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.05067
|
Applications of Psychological Science for Actionable Analytics
|
Actionable analytics are those that humans can understand, and
operationalize. What kind of data mining models generate such actionable
analytics? According to psychological scientists, humans understand models that
most match their own internal models, which they characterize as lists of
"heuristic" (i.e., lists of very succinct rules). One such heuristic rule
generator is the Fast-and-Frugal Trees (FFT) preferred by psychological
scientists. Despite their successful use in many applied domains, FFTs have not
been applied in software analytics. Accordingly, this paper assesses FFTs for
software analytics.
We find that FFTs are remarkably effective. Their models are very succinct (5
lines or less describing a binary decision tree). These succinct models
outperform state-of-the-art defect prediction algorithms defined by Ghortra et
al. at ICSE'15. Also, when we restrict training data to operational attributes
(i.e., those attributes that are frequently changed by developers), FFTs
perform much better than standard learners.
Our conclusions are two-fold. Firstly, there is much that software analytics
community could learn from psychological science. Secondly, proponents of
complex methods should always baseline those methods against simpler
alternatives. For example, FFTs could be used as a standard baseline learner
against which other software analytics tools are compared.
|
cs.SE
|
actionable analytics are those that humans can understand and operationalize what kind of data mining models generate such actionable analytics according to psychological scientists humans understand models that most match their own internal models which they characterize as lists of heuristic ie lists of very succinct rules one such heuristic rule generator is the fastandfrugal trees fft preferred by psychological scientists despite their successful use in many applied domains ffts have not been applied in software analytics accordingly this paper assesses ffts for software analytics we find that ffts are remarkably effective their models are very succinct 5 lines or less describing a binary decision tree these succinct models outperform stateoftheart defect prediction algorithms defined by ghortra et al at icse15 also when we restrict training data to operational attributes ie those attributes that are frequently changed by developers ffts perform much better than standard learners our conclusions are twofold firstly there is much that software analytics community could learn from psychological science secondly proponents of complex methods should always baseline those methods against simpler alternatives for example ffts could be used as a standard baseline learner against which other software analytics tools are compared
|
[['actionable', 'analytics', 'are', 'those', 'that', 'humans', 'can', 'understand', 'and', 'operationalize', 'what', 'kind', 'of', 'data', 'mining', 'models', 'generate', 'such', 'actionable', 'analytics', 'according', 'to', 'psychological', 'scientists', 'humans', 'understand', 'models', 'that', 'most', 'match', 'their', 'own', 'internal', 'models', 'which', 'they', 'characterize', 'as', 'lists', 'of', 'heuristic', 'ie', 'lists', 'of', 'very', 'succinct', 'rules', 'one', 'such', 'heuristic', 'rule', 'generator', 'is', 'the', 'fastandfrugal', 'trees', 'fft', 'preferred', 'by', 'psychological', 'scientists', 'despite', 'their', 'successful', 'use', 'in', 'many', 'applied', 'domains', 'ffts', 'have', 'not', 'been', 'applied', 'in', 'software', 'analytics', 'accordingly', 'this', 'paper', 'assesses', 'ffts', 'for', 'software', 'analytics', 'we', 'find', 'that', 'ffts', 'are', 'remarkably', 'effective', 'their', 'models', 'are', 'very', 'succinct', '5', 'lines', 'or', 'less', 'describing', 'a', 'binary', 'decision', 'tree', 'these', 'succinct', 'models', 'outperform', 'stateoftheart', 'defect', 'prediction', 'algorithms', 'defined', 'by', 'ghortra', 'et', 'al', 'at', 'icse15', 'also', 'when', 'we', 'restrict', 'training', 'data', 'to', 'operational', 'attributes', 'ie', 'those', 'attributes', 'that', 'are', 'frequently', 'changed', 'by', 'developers', 'ffts', 'perform', 'much', 'better', 'than', 'standard', 'learners', 'our', 'conclusions', 'are', 'twofold', 'firstly', 'there', 'is', 'much', 'that', 'software', 'analytics', 'community', 'could', 'learn', 'from', 'psychological', 'science', 'secondly', 'proponents', 'of', 'complex', 'methods', 'should', 'always', 'baseline', 'those', 'methods', 'against', 'simpler', 'alternatives', 'for', 'example', 'ffts', 'could', 'be', 'used', 'as', 'a', 'standard', 'baseline', 'learner', 'against', 'which', 'other', 'software', 'analytics', 'tools', 'are', 'compared']]
|
[0.0016267797137596138, 0.06357680817576213, -0.10578090342249084, 0.1646918106777111, -0.21890187624919136, -0.227974730097433, 0.037286032230709074, 0.46935364228571946, -0.23522372900718252, -0.36758844674096824, 0.10036730356490327, -0.2921934607631763, -0.17306036782002202, 0.2343784376286414, -0.1155026893003559, 0.06791843989576875, 0.13253347183592193, 0.048935247971217864, -0.029949864731508024, -0.32282896363779595, 0.25089712292945177, 0.07631736162355063, 0.3261906668288064, -0.052792461502119664, -0.01846000951126102, -0.06796586115957948, -0.10134533167831175, 0.02816632705757369, -0.08044263962485104, 0.13850892897830416, 0.40612355589692395, 0.2816570385231352, 0.3378970307235273, -0.4507679538270507, -0.1846083906585341, 0.0911619635769335, 0.15409714002355238, 0.1002045531571394, 0.006805577849211664, -0.29822932095254817, 0.09996289059693486, -0.1982050034123439, -0.036641346037368544, -0.20012522097966523, 0.017218472451753335, 0.00813598652132618, -0.23493099840686035, -0.033727290905913136, 0.04958568714616984, 0.11483190497887137, 0.006236869870767075, -0.16853405734288285, -0.001924319804399974, 0.1558271708683813, 0.047155255820949614, 0.025076473485847326, 0.1609322907779501, -0.14012877145719382, -0.2080399850697059, 0.40507210686880074, 0.030014708074436455, -0.18285639357989547, 0.24036041789306956, -0.020313263405114412, -0.19348243549960747, 0.08677349201255175, 0.1859372280070008, 0.07762984276889133, -0.16927567988290593, 0.015476115161029457, -0.0049023450270217934, 0.18648749327412542, 0.07845727015778886, -0.015595375213994032, 0.21563385926437964, 0.16903669292039666, 0.021216080129240672, 0.053032210587108886, 0.03692759149659599, -0.09229371588287508, -0.16574196032142277, -0.09012494335123555, -0.1568375162193986, -0.01211043037140894, -0.11829351864076869, -0.166607063585531, 0.34674213117307023, 0.2418970737432569, 0.11433019272399791, 0.08444229336310699, 0.3347540652678575, 0.034034478089077294, 0.1273846695732827, 0.11800865322795402, 0.1674901140730712, -0.004911503147748854, 0.15311643162047384, -0.09621935719117483, 0.14938541290644614, 0.006810200784278194]
|
1,803.05068
|
AURORA: Auditing PageRank on Large Graphs
|
Ranking on large-scale graphs plays a fundamental role in many high-impact
application domains, ranging from information retrieval, recommender systems,
sports team management, biology to neuroscience and many more. PageRank,
together with many of its random walk based variants, has become one of the
most well-known and widely used algorithms, due to its mathematical elegance
and the superior performance across a variety of application domains. Important
as it might be, state-of-the-art lacks an intuitive way to explain the ranking
results by PageRank (or its variants), e.g., why it thinks the returned top-k
webpages are most important ones in the entire graph; why it gives a higher
rank to actor John than actor Smith in terms of their relevance w.r.t. a
particular movie? In order to answer these questions, this paper proposes a
paradigm shift for PageRank, from identifying which nodes are most important to
understanding why the ranking algorithm gives a particular ranking result. We
formally define the PageRank auditing problem, whose central idea is to
identify a set of key graph elements (e.g., edges, nodes, subgraphs) with the
highest influence on the ranking results. We formulate it as an optimization
problem and propose a family of effective and scalable algorithms (AURORA) to
solve it. Our algorithms measure the influence of graph elements and
incrementally select influential elements w.r.t. their gradients over the
ranking results. We perform extensive empirical evaluations on real-world
datasets, which demonstrate that the proposed methods (AURORA) provide
intuitive explanations with a linear scalability.
|
cs.SI physics.soc-ph
|
ranking on largescale graphs plays a fundamental role in many highimpact application domains ranging from information retrieval recommender systems sports team management biology to neuroscience and many more pagerank together with many of its random walk based variants has become one of the most wellknown and widely used algorithms due to its mathematical elegance and the superior performance across a variety of application domains important as it might be stateoftheart lacks an intuitive way to explain the ranking results by pagerank or its variants eg why it thinks the returned topk webpages are most important ones in the entire graph why it gives a higher rank to actor john than actor smith in terms of their relevance wrt a particular movie in order to answer these questions this paper proposes a paradigm shift for pagerank from identifying which nodes are most important to understanding why the ranking algorithm gives a particular ranking result we formally define the pagerank auditing problem whose central idea is to identify a set of key graph elements eg edges nodes subgraphs with the highest influence on the ranking results we formulate it as an optimization problem and propose a family of effective and scalable algorithms aurora to solve it our algorithms measure the influence of graph elements and incrementally select influential elements wrt their gradients over the ranking results we perform extensive empirical evaluations on realworld datasets which demonstrate that the proposed methods aurora provide intuitive explanations with a linear scalability
|
[['ranking', 'on', 'largescale', 'graphs', 'plays', 'a', 'fundamental', 'role', 'in', 'many', 'highimpact', 'application', 'domains', 'ranging', 'from', 'information', 'retrieval', 'recommender', 'systems', 'sports', 'team', 'management', 'biology', 'to', 'neuroscience', 'and', 'many', 'more', 'pagerank', 'together', 'with', 'many', 'of', 'its', 'random', 'walk', 'based', 'variants', 'has', 'become', 'one', 'of', 'the', 'most', 'wellknown', 'and', 'widely', 'used', 'algorithms', 'due', 'to', 'its', 'mathematical', 'elegance', 'and', 'the', 'superior', 'performance', 'across', 'a', 'variety', 'of', 'application', 'domains', 'important', 'as', 'it', 'might', 'be', 'stateoftheart', 'lacks', 'an', 'intuitive', 'way', 'to', 'explain', 'the', 'ranking', 'results', 'by', 'pagerank', 'or', 'its', 'variants', 'eg', 'why', 'it', 'thinks', 'the', 'returned', 'topk', 'webpages', 'are', 'most', 'important', 'ones', 'in', 'the', 'entire', 'graph', 'why', 'it', 'gives', 'a', 'higher', 'rank', 'to', 'actor', 'john', 'than', 'actor', 'smith', 'in', 'terms', 'of', 'their', 'relevance', 'wrt', 'a', 'particular', 'movie', 'in', 'order', 'to', 'answer', 'these', 'questions', 'this', 'paper', 'proposes', 'a', 'paradigm', 'shift', 'for', 'pagerank', 'from', 'identifying', 'which', 'nodes', 'are', 'most', 'important', 'to', 'understanding', 'why', 'the', 'ranking', 'algorithm', 'gives', 'a', 'particular', 'ranking', 'result', 'we', 'formally', 'define', 'the', 'pagerank', 'auditing', 'problem', 'whose', 'central', 'idea', 'is', 'to', 'identify', 'a', 'set', 'of', 'key', 'graph', 'elements', 'eg', 'edges', 'nodes', 'subgraphs', 'with', 'the', 'highest', 'influence', 'on', 'the', 'ranking', 'results', 'we', 'formulate', 'it', 'as', 'an', 'optimization', 'problem', 'and', 'propose', 'a', 'family', 'of', 'effective', 'and', 'scalable', 'algorithms', 'aurora', 'to', 'solve', 'it', 'our', 'algorithms', 'measure', 'the', 'influence', 'of', 'graph', 'elements', 'and', 'incrementally', 'select', 'influential', 'elements', 'wrt', 'their', 'gradients', 'over', 'the', 'ranking', 'results', 'we', 'perform', 'extensive', 'empirical', 'evaluations', 'on', 'realworld', 'datasets', 'which', 'demonstrate', 'that', 'the', 'proposed', 'methods', 'aurora', 'provide', 'intuitive', 'explanations', 'with', 'a', 'linear', 'scalability']]
|
[-0.0595683045623771, -0.021238825716361275, -0.06929748188571747, 0.09879741499155979, -0.1592599847699455, -0.14978911062679823, 0.06423749190062375, 0.4138729597339634, -0.26691198024124557, -0.3515261661791814, 0.09713591579196414, -0.31105562064837383, -0.2218432982357094, 0.19378739492153765, -0.1119950578748665, 0.04651400531766126, 0.09565384084561356, 0.09144775587764883, -0.005453166982530033, -0.3055307680486117, 0.29092854798457896, 0.05699000452603478, 0.3032342180414731, 0.05702180469955689, 0.07526299777455871, 0.0017537010409604244, -0.061321073273249815, 0.04426799818504994, -0.08604261384557245, 0.18470110763687778, 0.3426797957523022, 0.2374760586677528, 0.35869444305894943, -0.3642883335156896, -0.18320197604854055, 0.12963798673391888, 0.13442868839159544, 0.08383269300188621, -0.05017387132687784, -0.2749742850191831, 0.07796569370164923, -0.16631762748792372, -0.04734438210650067, -0.12782964567706837, 0.046247873535262406, 0.0018261192495200207, -0.24503365867748494, -0.005136878724324487, 0.0724708425899498, 0.04775029468110893, -0.002360937958375013, -0.14730599625376847, 0.04794963315220141, 0.15981851667411837, 0.04802310813187344, 0.04477140620091506, 0.15608661426458417, -0.13955968623125276, -0.21257218565958425, 0.443466672613011, -0.0023491175595516662, -0.17647512212804542, 0.21527828504350338, -0.033374141049912064, -0.17499241606063565, 0.06365879103389939, 0.2086804713978152, 0.10797913237538745, -0.1391120986460246, 0.012391969444688289, -0.06040508546525749, 0.13015557260146532, 0.055674186733558895, 0.034547609367930304, 0.1798754084242008, 0.19284220079596087, 0.10877103757276957, 0.1265695840853235, -0.007107329449798094, -0.11990225261902603, -0.18776641256787352, -0.14377264467227022, -0.1728872653774584, -0.006910702168214612, -0.14021900854306768, -0.21697520319423524, 0.4320605875909086, 0.2423852763320433, 0.1883846230471764, 0.028295347539824434, 0.30387059922852533, 0.04103877863046246, 0.06419262675851455, 0.12242265294184833, 0.1461368843646175, 0.10128649291336324, 0.14009006250019343, -0.1442896866833988, 0.14542290188724222, 0.07481122492695212]
|
1,803.05069
|
HotStuff: BFT Consensus in the Lens of Blockchain
|
We present HotStuff, a leader-based Byzantine fault-tolerant replication
protocol for the partially synchronous model. Once network communication
becomes synchronous, HotStuff enables a correct leader to drive the protocol to
consensus at the pace of actual (vs. maximum) network delay--a property called
responsiveness--and with communication complexity that is linear in the number
of replicas. To our knowledge, HotStuff is the first partially synchronous BFT
replication protocol exhibiting these combined properties. HotStuff is built
around a novel framework that forms a bridge between classical BFT foundations
and blockchains. It allows the expression of other known protocols (DLS, PBFT,
Tendermint, Casper), and ours, in a common framework.
Our deployment of HotStuff over a network with over 100 replicas achieves
throughput and latency comparable to that of BFT-SMaRt, while enjoying linear
communication footprint during leader failover (vs. quadratic with BFT-SMaRt).
|
cs.DC
|
we present hotstuff a leaderbased byzantine faulttolerant replication protocol for the partially synchronous model once network communication becomes synchronous hotstuff enables a correct leader to drive the protocol to consensus at the pace of actual vs maximum network delaya property called responsivenessand with communication complexity that is linear in the number of replicas to our knowledge hotstuff is the first partially synchronous bft replication protocol exhibiting these combined properties hotstuff is built around a novel framework that forms a bridge between classical bft foundations and blockchains it allows the expression of other known protocols dls pbft tendermint casper and ours in a common framework our deployment of hotstuff over a network with over 100 replicas achieves throughput and latency comparable to that of bftsmart while enjoying linear communication footprint during leader failover vs quadratic with bftsmart
|
[['we', 'present', 'hotstuff', 'a', 'leaderbased', 'byzantine', 'faulttolerant', 'replication', 'protocol', 'for', 'the', 'partially', 'synchronous', 'model', 'once', 'network', 'communication', 'becomes', 'synchronous', 'hotstuff', 'enables', 'a', 'correct', 'leader', 'to', 'drive', 'the', 'protocol', 'to', 'consensus', 'at', 'the', 'pace', 'of', 'actual', 'vs', 'maximum', 'network', 'delaya', 'property', 'called', 'responsivenessand', 'with', 'communication', 'complexity', 'that', 'is', 'linear', 'in', 'the', 'number', 'of', 'replicas', 'to', 'our', 'knowledge', 'hotstuff', 'is', 'the', 'first', 'partially', 'synchronous', 'bft', 'replication', 'protocol', 'exhibiting', 'these', 'combined', 'properties', 'hotstuff', 'is', 'built', 'around', 'a', 'novel', 'framework', 'that', 'forms', 'a', 'bridge', 'between', 'classical', 'bft', 'foundations', 'and', 'blockchains', 'it', 'allows', 'the', 'expression', 'of', 'other', 'known', 'protocols', 'dls', 'pbft', 'tendermint', 'casper', 'and', 'ours', 'in', 'a', 'common', 'framework', 'our', 'deployment', 'of', 'hotstuff', 'over', 'a', 'network', 'with', 'over', '100', 'replicas', 'achieves', 'throughput', 'and', 'latency', 'comparable', 'to', 'that', 'of', 'bftsmart', 'while', 'enjoying', 'linear', 'communication', 'footprint', 'during', 'leader', 'failover', 'vs', 'quadratic', 'with', 'bftsmart']]
|
[-0.23453979438810207, 0.04215676649803741, -0.05734293446737105, -0.019882605686512733, -0.06634512940185394, -0.23570186757385286, 0.15046785155540582, 0.35667068753113496, -0.2706106040737967, -0.3217174476429598, 0.05933520766218373, -0.21284579509470017, -0.1484796911392903, 0.16599258005883155, -0.13155984053555042, 0.08445628005107726, 0.053862724022300384, 0.03930435371724194, 0.005555146392921347, -0.265871623822891, 0.2153697371858158, 0.08303305353976285, 0.3293399778333729, -0.011407260869893788, 0.10861644412737527, 0.03134628793280294, 0.028767882693392127, -0.023387563507830195, -0.060465166671842305, 0.11092687923975511, 0.2788870055506478, 0.22534826009728903, 0.31023871014589693, -0.43115527473334503, -0.14604637121656605, 0.08437175852500263, 0.11995856699085475, 0.1360823702772579, -0.01544214054983832, -0.25527767343585617, 0.12808815108997915, -0.22767396953387825, -0.06887775514997653, -0.05582842424011497, -0.02398130155877391, 0.012014556161402516, -0.2514939685769157, 0.017506254701388637, 0.04756008889508753, 0.03994082587896221, -0.01206928735586759, -0.024587633109081592, 0.004144234033718483, 0.11382348665743007, -0.04978497058705691, 0.055687336022652856, 0.12415321764219969, -0.08925521091571939, -0.1837898855585841, 0.35537866664244167, -0.01834811774124183, -0.1169490150218124, 0.1729764992965441, -0.029552759776420114, -0.16374557585900287, 0.09978084772679288, 0.1767053323929935, 0.05879795381020921, -0.16067303308879144, 0.05079693585128607, -0.016369133728987247, 0.21325219525441305, 0.04651369297539871, 0.07320257020530416, 0.12379620254123166, 0.21560251059135727, 0.13252720408708052, 0.12687138499346312, -0.0326152824372776, -0.21103137912256503, -0.22176320041154526, -0.13380234415552564, -0.13306717907856982, 0.0011230982386562696, -0.08252443166055679, -0.14088681292087674, 0.37781276514948303, 0.13496340861424122, 0.13392267753231102, 0.19354249591897452, 0.3830729598707672, 0.0009760005458661202, 0.11970222267711451, 0.1883719107657393, 0.19615953730822389, 0.07708565736321538, 0.13306257821343243, -0.18911582309537248, 0.15047540686982894, 0.0049519483625555215]
|
1,803.0507
|
A Multi-Modal Approach to Infer Image Affect
|
The group affect or emotion in an image of people can be inferred by
extracting features about both the people in the picture and the overall makeup
of the scene. The state-of-the-art on this problem investigates a combination
of facial features, scene extraction and even audio tonality. This paper
combines three additional modalities, namely, human pose, text-based tagging
and CNN extracted features / predictions. To the best of our knowledge, this is
the first time all of the modalities were extracted using deep neural networks.
We evaluate the performance of our approach against baselines and identify
insights throughout this paper.
|
cs.CV cs.LG stat.ML
|
the group affect or emotion in an image of people can be inferred by extracting features about both the people in the picture and the overall makeup of the scene the stateoftheart on this problem investigates a combination of facial features scene extraction and even audio tonality this paper combines three additional modalities namely human pose textbased tagging and cnn extracted features predictions to the best of our knowledge this is the first time all of the modalities were extracted using deep neural networks we evaluate the performance of our approach against baselines and identify insights throughout this paper
|
[['the', 'group', 'affect', 'or', 'emotion', 'in', 'an', 'image', 'of', 'people', 'can', 'be', 'inferred', 'by', 'extracting', 'features', 'about', 'both', 'the', 'people', 'in', 'the', 'picture', 'and', 'the', 'overall', 'makeup', 'of', 'the', 'scene', 'the', 'stateoftheart', 'on', 'this', 'problem', 'investigates', 'a', 'combination', 'of', 'facial', 'features', 'scene', 'extraction', 'and', 'even', 'audio', 'tonality', 'this', 'paper', 'combines', 'three', 'additional', 'modalities', 'namely', 'human', 'pose', 'textbased', 'tagging', 'and', 'cnn', 'extracted', 'features', 'predictions', 'to', 'the', 'best', 'of', 'our', 'knowledge', 'this', 'is', 'the', 'first', 'time', 'all', 'of', 'the', 'modalities', 'were', 'extracted', 'using', 'deep', 'neural', 'networks', 'we', 'evaluate', 'the', 'performance', 'of', 'our', 'approach', 'against', 'baselines', 'and', 'identify', 'insights', 'throughout', 'this', 'paper']]
|
[-0.036578465201962514, -0.020692690184917255, -0.09483072441541637, 0.05033174575414659, -0.10495451277573452, -0.1180987861195598, 0.0040538280736655, 0.42903923540554867, -0.2814641406364513, -0.3475676569335087, 0.05260507938583767, -0.3231965031550087, -0.19216408400627022, 0.1679318283773921, -0.1474000723994892, 0.031554552860501586, 0.1397497754431132, 0.0874859109859575, -0.05105903137191857, -0.24980188185593696, 0.3388082603430093, 0.014628012817190734, 0.3202784358044014, 0.05482306172295163, 0.1311747346289757, -0.024154699082966104, -0.11851386276233677, -0.036693558143922174, -0.04497461122780511, 0.21344752298230588, 0.33095705681104176, 0.23547148106694973, 0.26164970328241133, -0.4228410012173382, -0.23789849350548753, 0.035975366545226095, 0.1478923598840607, 0.12550801141751985, 0.003233138828143252, -0.39986412041829994, 0.10379841395023495, -0.14333137329855952, 0.03265658831411992, -0.11617225405731887, -0.0453890919252628, -0.03595498553242045, -0.24505577066141848, 0.03535295803701938, 0.1053418376379543, 0.1096113489169364, -0.09678807586074026, -0.12859758559256942, 0.056238837206190585, 0.27895157348430444, 0.05798482927117459, 0.031053283482300815, 0.1658092590867344, -0.25973167568332023, -0.14376649978768194, 0.3780141551273339, -0.0668622480912341, -0.18114012517176117, 0.19037098244698059, -0.05741623415367095, -0.13800114656168253, 0.0691187573182914, 0.22121743990856252, 0.12825830105805036, -0.19288930259268694, -0.04438158785312841, -0.0787027799148075, 0.233215920307269, 0.07815759698625165, 0.009929536813587853, 0.20009211502790528, 0.26203181429982486, -0.04477009390753628, 0.11667821499062796, -0.15930735566088874, -0.015009374560016876, -0.1891564646644066, -0.09813802476708937, -0.15294002662671524, -0.040874361093485294, -0.12464132639191423, -0.0974037197202143, 0.4987371590228356, 0.2711660134925912, 0.22837396766614132, 0.09161972318484325, 0.3797283626415513, 0.003887368453139759, 0.09611813414540857, 0.05039884217290415, 0.1918972319255423, -0.03275074451841941, 0.13246495460131855, -0.2061075085722324, 0.13523782884132945, 0.04825285660582736]
|
1,803.05071
|
Neural Lattice Language Models
|
In this work, we propose a new language modeling paradigm that has the
ability to perform both prediction and moderation of information flow at
multiple granularities: neural lattice language models. These models construct
a lattice of possible paths through a sentence and marginalize across this
lattice to calculate sequence probabilities or optimize parameters. This
approach allows us to seamlessly incorporate linguistic intuitions - including
polysemy and existence of multi-word lexical items - into our language model.
Experiments on multiple language modeling tasks show that English neural
lattice language models that utilize polysemous embeddings are able to improve
perplexity by 9.95% relative to a word-level baseline, and that a Chinese model
that handles multi-character tokens is able to improve perplexity by 20.94%
relative to a character-level baseline.
|
cs.CL
|
in this work we propose a new language modeling paradigm that has the ability to perform both prediction and moderation of information flow at multiple granularities neural lattice language models these models construct a lattice of possible paths through a sentence and marginalize across this lattice to calculate sequence probabilities or optimize parameters this approach allows us to seamlessly incorporate linguistic intuitions including polysemy and existence of multiword lexical items into our language model experiments on multiple language modeling tasks show that english neural lattice language models that utilize polysemous embeddings are able to improve perplexity by 995 relative to a wordlevel baseline and that a chinese model that handles multicharacter tokens is able to improve perplexity by 2094 relative to a characterlevel baseline
|
[['in', 'this', 'work', 'we', 'propose', 'a', 'new', 'language', 'modeling', 'paradigm', 'that', 'has', 'the', 'ability', 'to', 'perform', 'both', 'prediction', 'and', 'moderation', 'of', 'information', 'flow', 'at', 'multiple', 'granularities', 'neural', 'lattice', 'language', 'models', 'these', 'models', 'construct', 'a', 'lattice', 'of', 'possible', 'paths', 'through', 'a', 'sentence', 'and', 'marginalize', 'across', 'this', 'lattice', 'to', 'calculate', 'sequence', 'probabilities', 'or', 'optimize', 'parameters', 'this', 'approach', 'allows', 'us', 'to', 'seamlessly', 'incorporate', 'linguistic', 'intuitions', 'including', 'polysemy', 'and', 'existence', 'of', 'multiword', 'lexical', 'items', 'into', 'our', 'language', 'model', 'experiments', 'on', 'multiple', 'language', 'modeling', 'tasks', 'show', 'that', 'english', 'neural', 'lattice', 'language', 'models', 'that', 'utilize', 'polysemous', 'embeddings', 'are', 'able', 'to', 'improve', 'perplexity', 'by', '995', 'relative', 'to', 'a', 'wordlevel', 'baseline', 'and', 'that', 'a', 'chinese', 'model', 'that', 'handles', 'multicharacter', 'tokens', 'is', 'able', 'to', 'improve', 'perplexity', 'by', '2094', 'relative', 'to', 'a', 'characterlevel', 'baseline']]
|
[-0.004183720158893735, 0.03390917330304341, -0.07731765618870756, 0.1314196259838589, -0.19142090357960231, -0.18507973266194663, 0.12307506195934219, 0.4663134378441159, -0.30946091250441365, -0.33093604184086284, -0.03777625077993669, -0.2755335238068637, -0.13619338539091028, 0.15830238023209536, -0.11526732830961625, 0.05126778040580722, 0.15430333161812967, 0.04885603954279495, -0.04737103336364887, -0.28677419487916445, 0.2654143305704389, 0.03966845417275063, 0.3368953901508282, 0.023467535934140606, 0.1529826346274105, -0.05198402718580779, -0.04042240608419712, -0.05307095493903504, -0.09689014671787463, 0.21535306354804384, 0.35129831979943005, 0.20002005792658537, 0.28496681180061595, -0.41208638258338454, -0.2688693219885951, 0.049845800487204425, 0.09966443835442225, 0.11662790671576775, 0.06116628016236298, -0.31485321737765787, 0.1031800610418882, -0.22256743015191938, 0.08659831214425785, -0.1864368917951886, -0.014326272352087882, -0.012329604441953463, -0.2714724216390506, 0.014465410568405904, 0.16035366187967273, 0.05827415569294845, -0.02170444466736949, -0.10488434229046106, 0.018097945823213987, 0.18679481895542854, 0.04353181259413701, 0.08630294716567732, 0.08444565466338498, -0.12780818917916245, -0.22902987584201318, 0.41109999934692054, -0.11821045343305976, -0.2619296386387319, 0.21331344045428258, -0.009875180995872906, -0.1445819359730869, 0.04566717993528131, 0.2601255326862297, 0.054003999622504885, -0.1833231213282899, 0.013609643298907266, -0.06356698288882692, 0.2761860048574876, 0.09391192870492476, -0.026680614919431748, 0.24285385717127111, 0.23257034688797448, -0.045544701358003, 0.12838895039843215, -0.08864399197609013, -0.07176024644051664, -0.17969592992355296, -0.08888069579317685, -0.10696555735598996, -0.04109894847610004, -0.09874612528919018, -0.1454259947152628, 0.41843082993141106, 0.3004298063686057, 0.2029748479272389, 0.1838345388492716, 0.2990989866910592, -0.01526424867352621, 0.1265698737228259, 0.05326409483959357, 0.07068710310775186, -0.005688821900666, 0.10303910278655108, -0.17000983036198322, 0.0849499758257861, 0.07883253737746863]
|
1,803.05072
|
On the shape of the gamma-ray spectrum around the "$\pi^0$-bump"
|
The "pion-decay" bump is a distinct signature of the differential energy
spectrum of $\gamma$-rays between 100 MeV and 1 GeV produced in hadronic
interactions of accelerated particles (cosmic rays) with the ambient gas. We
use the recent parametrisations of relevant cross-sections to study the
formation of the "pion-decay" bump. The $\gamma$-ray spectrum below the maximum
of this spectral feature can be distorted because of contributions of
additional radiation components, in particular, due to the bremsstrahlung of
secondary electrons and positrons, the products of decays of $\pi^\pm$-mesons,
accompanying the $\pi^0$-production. At energies below 100 MeV, a
non-negligible fraction of $\gamma$-ray flux could originate from interactions
of sub-relativistic heavy ions. We study the impact of these radiation channels
on the formation of the overall $\gamma$-ray spectrum based on a time-dependent
treatment of evolution of energy distributions of the primary and secondary
particles in the $\gamma$-ray production region.
|
astro-ph.HE
|
the piondecay bump is a distinct signature of the differential energy spectrum of gammarays between 100 mev and 1 gev produced in hadronic interactions of accelerated particles cosmic rays with the ambient gas we use the recent parametrisations of relevant crosssections to study the formation of the piondecay bump the gammaray spectrum below the maximum of this spectral feature can be distorted because of contributions of additional radiation components in particular due to the bremsstrahlung of secondary electrons and positrons the products of decays of pipmmesons accompanying the pi0production at energies below 100 mev a nonnegligible fraction of gammaray flux could originate from interactions of subrelativistic heavy ions we study the impact of these radiation channels on the formation of the overall gammaray spectrum based on a timedependent treatment of evolution of energy distributions of the primary and secondary particles in the gammaray production region
|
[['the', 'piondecay', 'bump', 'is', 'a', 'distinct', 'signature', 'of', 'the', 'differential', 'energy', 'spectrum', 'of', 'gammarays', 'between', '100', 'mev', 'and', '1', 'gev', 'produced', 'in', 'hadronic', 'interactions', 'of', 'accelerated', 'particles', 'cosmic', 'rays', 'with', 'the', 'ambient', 'gas', 'we', 'use', 'the', 'recent', 'parametrisations', 'of', 'relevant', 'crosssections', 'to', 'study', 'the', 'formation', 'of', 'the', 'piondecay', 'bump', 'the', 'gammaray', 'spectrum', 'below', 'the', 'maximum', 'of', 'this', 'spectral', 'feature', 'can', 'be', 'distorted', 'because', 'of', 'contributions', 'of', 'additional', 'radiation', 'components', 'in', 'particular', 'due', 'to', 'the', 'bremsstrahlung', 'of', 'secondary', 'electrons', 'and', 'positrons', 'the', 'products', 'of', 'decays', 'of', 'pipmmesons', 'accompanying', 'the', 'pi0production', 'at', 'energies', 'below', '100', 'mev', 'a', 'nonnegligible', 'fraction', 'of', 'gammaray', 'flux', 'could', 'originate', 'from', 'interactions', 'of', 'subrelativistic', 'heavy', 'ions', 'we', 'study', 'the', 'impact', 'of', 'these', 'radiation', 'channels', 'on', 'the', 'formation', 'of', 'the', 'overall', 'gammaray', 'spectrum', 'based', 'on', 'a', 'timedependent', 'treatment', 'of', 'evolution', 'of', 'energy', 'distributions', 'of', 'the', 'primary', 'and', 'secondary', 'particles', 'in', 'the', 'gammaray', 'production', 'region']]
|
[-0.08601411619464569, 0.2434886565250862, -0.05336083940750945, 0.14048047141922224, -0.015572261613771034, -0.02413447160506621, 0.015150941860661583, 0.36772308208876187, -0.24273077695721035, -0.3399835839971072, -0.048447955951916005, -0.3508137467757074, 0.04658630009685617, 0.17710967403319147, 0.0709576004994435, -0.04641002626158297, 0.08481925705159989, -0.011950935599290662, -0.027731946334016457, -0.1521438226983365, 0.34030562491453664, 0.19615365892079556, 0.20097094819195466, 0.15519202814256358, 0.05978525533444352, -0.02343952691040209, -0.03764456592802566, -0.09204897742408018, -0.09891130582804585, 0.10747884018120304, 0.16767636793600912, 0.07439831915123957, 0.14095486501011895, -0.3908175210494341, -0.24423768207068658, 0.152995382500295, 0.16192529862342375, 0.024087903439067304, -0.0729715922514313, -0.2577816234875677, 0.04887757892073649, -0.1972354294945641, -0.13912993137556542, 0.06709577765044135, -0.01665357010400233, 0.056302027854447566, -0.22693013067408982, 0.12186111889119881, 0.015333266221003013, 0.0004260916563604648, -0.12072447465389916, -0.10625389885454853, -0.04709333491822084, 0.045143059351378016, 0.12105290290492121, 0.01478008292744764, 0.20221043033395997, -0.15401695942758428, -0.09292677373418377, 0.4093379255823998, -0.07822290806668913, -0.038694823432403304, 0.19035983830932915, -0.20847971262588139, -0.13379958775476553, 0.29206392600058784, 0.23173006057186285, 0.09546982899438364, -0.158767218733879, 0.054093346519140245, 0.04817249680571775, 0.1527933225912016, 0.06684618757572025, 0.061547325083261564, 0.25958578993150794, 0.14314162712899917, -0.016838452535062567, 0.10496015936546933, -0.1837623033756649, -0.0069923058779548025, -0.3405639525671076, -0.11441388867873077, -0.14057524163702814, 0.10447936361742904, -0.05577492255027513, -0.1277980417782803, 0.4218025789208089, 0.06789055403108553, 0.23059038422717196, -0.0525584774893812, 0.3061056156616865, 0.0886273075908927, 0.02795622940983675, 0.0821052306144136, 0.33897013089800665, 0.15902113375098756, 0.10135113155976999, -0.23332549884798937, 0.041663428138741035, -0.023262335401442315]
|
1,803.05073
|
Predicting Human Performance in Vertical Menu Selection Using Deep
Learning
|
Predicting human performance in interaction tasks allows designers or
developers to understand the expected performance of a target interface without
actually testing it with real users. In this work, we present a deep neural net
to model and predict human performance in performing a sequence of UI tasks. In
particular, we focus on a dominant class of tasks, i.e., target selection from
a vertical list or menu. We experimented with our deep neural net using a
public dataset collected from a desktop laboratory environment and a dataset
collected from hundreds of touchscreen smartphone users via crowdsourcing. Our
model significantly outperformed previous methods on these datasets.
Importantly, our method, as a deep model, can easily incorporate additional UI
attributes such as visual appearance and content semantics without changing
model architectures. By understanding about how a deep learning model learns
from human behaviors, our approach can be seen as a vehicle to discover new
patterns about human behaviors to advance analytical modeling.
|
cs.HC
|
predicting human performance in interaction tasks allows designers or developers to understand the expected performance of a target interface without actually testing it with real users in this work we present a deep neural net to model and predict human performance in performing a sequence of ui tasks in particular we focus on a dominant class of tasks ie target selection from a vertical list or menu we experimented with our deep neural net using a public dataset collected from a desktop laboratory environment and a dataset collected from hundreds of touchscreen smartphone users via crowdsourcing our model significantly outperformed previous methods on these datasets importantly our method as a deep model can easily incorporate additional ui attributes such as visual appearance and content semantics without changing model architectures by understanding about how a deep learning model learns from human behaviors our approach can be seen as a vehicle to discover new patterns about human behaviors to advance analytical modeling
|
[['predicting', 'human', 'performance', 'in', 'interaction', 'tasks', 'allows', 'designers', 'or', 'developers', 'to', 'understand', 'the', 'expected', 'performance', 'of', 'a', 'target', 'interface', 'without', 'actually', 'testing', 'it', 'with', 'real', 'users', 'in', 'this', 'work', 'we', 'present', 'a', 'deep', 'neural', 'net', 'to', 'model', 'and', 'predict', 'human', 'performance', 'in', 'performing', 'a', 'sequence', 'of', 'ui', 'tasks', 'in', 'particular', 'we', 'focus', 'on', 'a', 'dominant', 'class', 'of', 'tasks', 'ie', 'target', 'selection', 'from', 'a', 'vertical', 'list', 'or', 'menu', 'we', 'experimented', 'with', 'our', 'deep', 'neural', 'net', 'using', 'a', 'public', 'dataset', 'collected', 'from', 'a', 'desktop', 'laboratory', 'environment', 'and', 'a', 'dataset', 'collected', 'from', 'hundreds', 'of', 'touchscreen', 'smartphone', 'users', 'via', 'crowdsourcing', 'our', 'model', 'significantly', 'outperformed', 'previous', 'methods', 'on', 'these', 'datasets', 'importantly', 'our', 'method', 'as', 'a', 'deep', 'model', 'can', 'easily', 'incorporate', 'additional', 'ui', 'attributes', 'such', 'as', 'visual', 'appearance', 'and', 'content', 'semantics', 'without', 'changing', 'model', 'architectures', 'by', 'understanding', 'about', 'how', 'a', 'deep', 'learning', 'model', 'learns', 'from', 'human', 'behaviors', 'our', 'approach', 'can', 'be', 'seen', 'as', 'a', 'vehicle', 'to', 'discover', 'new', 'patterns', 'about', 'human', 'behaviors', 'to', 'advance', 'analytical', 'modeling']]
|
[-0.037935449200449514, -0.023263522412162275, -0.09828967291016681, 0.0635893969258177, -0.17243222812830936, -0.20967819869110826, 0.09025081593354116, 0.4647730371914804, -0.2525853799830656, -0.40955210761749183, 0.032191102269280236, -0.29948508274837876, -0.2098882995400345, 0.21853573676926316, -0.12064736264219392, 0.053278737221990016, 0.14608144058584002, 0.06640996878850274, -0.025522621025447733, -0.2525012280995725, 0.26546604252944234, 0.02612352357173222, 0.309033831502893, 0.01654352999466937, 0.08647822318162071, -0.03126090682053473, -0.023824376634729562, -0.008974915230646729, -0.029364736287971028, 0.1688689005037304, 0.31871069044464095, 0.2163042338325795, 0.32631789200240746, -0.4363331337226555, -0.23848378114489605, 0.0643799870274961, 0.14654891763875638, 0.09977391042129966, -0.05352426433310029, -0.3959655428072438, 0.075256527075544, -0.2080133323552218, -0.024403980962233618, -0.11070126105332748, -0.03693714591208845, -0.013962272768549156, -0.2907972519751638, -0.018649190984433517, 0.06056217344012112, 0.13478296400862746, -0.04815166747466719, -0.0923881629925745, 0.008486740171792916, 0.2215983923873864, 0.040344255461968716, 0.04209231765125878, 0.1928623583407898, -0.21787090233847267, -0.16114990706264506, 0.36694385497830806, -0.06284045096253976, -0.20111176551436075, 0.23499346129246987, -0.03254582249501255, -0.10880452353449073, 0.07016727703157813, 0.3010147205204703, 0.11534256749146152, -0.20152654758712743, -0.023082988646274318, -0.0608828901706147, 0.23222672214906198, 0.014385268793557771, -0.04144767140242038, 0.22145816379779718, 0.2886861629245686, -0.010907371213033912, 0.12958382284632536, -0.08261470754805486, -0.06224671898235101, -0.2006805179917137, -0.09160352283070097, -0.13466958499338944, 0.01884104804485105, -0.07659738810880298, -0.106431686662836, 0.3987352257943712, 0.267363830000977, 0.19693976019043474, 0.10393236600211822, 0.3604754953295924, -0.026319465705455514, 0.15381351477553834, 0.07400231561769033, 0.12473942756987526, -0.07662352103361628, 0.18321743254200556, -0.1747729742899537, 0.13588537245523186, -0.0023032275639707223]
|
1,803.05074
|
Development of Safety Performance Functions: Incorporating Unobserved
Heterogeneity and Functional Form Analysis
|
To improve transportation safety, this study applies Highway Safety Manual
(HSM) procedures to roadways while accounting for unobserved heterogeneity and
exploring alternative functional forms for Safety Performance Functions (SPFs).
Specifically, several functional forms are considered in Poisson and
Poisson-gamma modeling frameworks. Using five years (2011-2015) of crash,
traffic, and road inventory data for two-way, two-lane roads in Tennessee,
fixed- and random-parameter count data models are calibrated. The models
account for important methodological concerns of unobserved heterogeneity and
omitted variable bias. With a validation dataset, the calibrated and
uncalibrated HSM SPFs and eight new Tennessee-specific SPFs are compared for
prediction accuracy. The results show that the statewide calibration factor is
2.48, suggesting rural two-lane, two-way road segment crashes are at least 1.48
times greater than what HSM SPF predicts. Significant variation in four
different regions in Tennessee is observed with calibration factors ranging
between 2.02 and 2.77. Among all the SPFs considered, fully specified
Tennessee-specific random parameter Poisson SPF outperformed all competing SPFs
in predicting out-of-sample crashes on these road segments. The best-fit random
parameter SPF specification for crash frequency includes the following
variables: annual average daily traffic, segment length, shoulder width, lane
width, speed limit, and the presence of passing lanes. Significant
heterogeneity is observed in the effects of traffic exposure-related variables
on crash frequency. The study shows how heterogeneity-based models can be
specified and used by practitioners for obtaining accurate crash predictions.
|
stat.AP
|
to improve transportation safety this study applies highway safety manual hsm procedures to roadways while accounting for unobserved heterogeneity and exploring alternative functional forms for safety performance functions spfs specifically several functional forms are considered in poisson and poissongamma modeling frameworks using five years 20112015 of crash traffic and road inventory data for twoway twolane roads in tennessee fixed and randomparameter count data models are calibrated the models account for important methodological concerns of unobserved heterogeneity and omitted variable bias with a validation dataset the calibrated and uncalibrated hsm spfs and eight new tennesseespecific spfs are compared for prediction accuracy the results show that the statewide calibration factor is 248 suggesting rural twolane twoway road segment crashes are at least 148 times greater than what hsm spf predicts significant variation in four different regions in tennessee is observed with calibration factors ranging between 202 and 277 among all the spfs considered fully specified tennesseespecific random parameter poisson spf outperformed all competing spfs in predicting outofsample crashes on these road segments the bestfit random parameter spf specification for crash frequency includes the following variables annual average daily traffic segment length shoulder width lane width speed limit and the presence of passing lanes significant heterogeneity is observed in the effects of traffic exposurerelated variables on crash frequency the study shows how heterogeneitybased models can be specified and used by practitioners for obtaining accurate crash predictions
|
[['to', 'improve', 'transportation', 'safety', 'this', 'study', 'applies', 'highway', 'safety', 'manual', 'hsm', 'procedures', 'to', 'roadways', 'while', 'accounting', 'for', 'unobserved', 'heterogeneity', 'and', 'exploring', 'alternative', 'functional', 'forms', 'for', 'safety', 'performance', 'functions', 'spfs', 'specifically', 'several', 'functional', 'forms', 'are', 'considered', 'in', 'poisson', 'and', 'poissongamma', 'modeling', 'frameworks', 'using', 'five', 'years', '20112015', 'of', 'crash', 'traffic', 'and', 'road', 'inventory', 'data', 'for', 'twoway', 'twolane', 'roads', 'in', 'tennessee', 'fixed', 'and', 'randomparameter', 'count', 'data', 'models', 'are', 'calibrated', 'the', 'models', 'account', 'for', 'important', 'methodological', 'concerns', 'of', 'unobserved', 'heterogeneity', 'and', 'omitted', 'variable', 'bias', 'with', 'a', 'validation', 'dataset', 'the', 'calibrated', 'and', 'uncalibrated', 'hsm', 'spfs', 'and', 'eight', 'new', 'tennesseespecific', 'spfs', 'are', 'compared', 'for', 'prediction', 'accuracy', 'the', 'results', 'show', 'that', 'the', 'statewide', 'calibration', 'factor', 'is', '248', 'suggesting', 'rural', 'twolane', 'twoway', 'road', 'segment', 'crashes', 'are', 'at', 'least', '148', 'times', 'greater', 'than', 'what', 'hsm', 'spf', 'predicts', 'significant', 'variation', 'in', 'four', 'different', 'regions', 'in', 'tennessee', 'is', 'observed', 'with', 'calibration', 'factors', 'ranging', 'between', '202', 'and', '277', 'among', 'all', 'the', 'spfs', 'considered', 'fully', 'specified', 'tennesseespecific', 'random', 'parameter', 'poisson', 'spf', 'outperformed', 'all', 'competing', 'spfs', 'in', 'predicting', 'outofsample', 'crashes', 'on', 'these', 'road', 'segments', 'the', 'bestfit', 'random', 'parameter', 'spf', 'specification', 'for', 'crash', 'frequency', 'includes', 'the', 'following', 'variables', 'annual', 'average', 'daily', 'traffic', 'segment', 'length', 'shoulder', 'width', 'lane', 'width', 'speed', 'limit', 'and', 'the', 'presence', 'of', 'passing', 'lanes', 'significant', 'heterogeneity', 'is', 'observed', 'in', 'the', 'effects', 'of', 'traffic', 'exposurerelated', 'variables', 'on', 'crash', 'frequency', 'the', 'study', 'shows', 'how', 'heterogeneitybased', 'models', 'can', 'be', 'specified', 'and', 'used', 'by', 'practitioners', 'for', 'obtaining', 'accurate', 'crash', 'predictions']]
|
[-0.10189472467881507, 0.07795135282465945, -0.025655486129993653, 0.11739277471484535, -0.05212329701297795, -0.19086424598429838, 0.08753517098603365, 0.3948784440614121, -0.1726149550801062, -0.35109271262974845, 0.12712783711031078, -0.3067257540847134, -0.08310648630950195, 0.21377393056071647, -0.11175215322240863, 0.08944750571339999, 0.09087014129263875, -0.025736528785352635, 0.009610232421318475, -0.26464621814210776, 0.20100730523041896, 0.019388536983372076, 0.32631608834705295, 0.030455698967789827, 0.0719369698892874, 0.013245688279604782, -0.10133705912562815, 0.01030118417845148, -0.10182941769994416, 0.09043911683914738, 0.2980247290087351, 0.12539314851164818, 0.25992971985074487, -0.40631418048869816, -0.252119382786686, 0.11034396392009828, 0.09551879065414971, 0.019823098252527416, 0.060834736588573, -0.3054783569567877, 0.04898571309901814, -0.18186066809677234, -0.11286939192036896, -0.03515153196690928, 0.04818574582105097, 0.030232173429913415, -0.28710675781552236, 0.09814138899091632, -0.009774623437197474, 0.12964962610731953, -0.05127995203745187, -0.16594639741815626, -0.038748223724289106, 0.17458662860216978, 0.06628827976882863, 0.0040846375930730415, 0.14585398266170396, -0.11782188758699466, -0.14049334640098413, 0.365913679851624, -0.04684767291973517, -0.15353015918669333, 0.15283713688790473, -0.09497068113161494, -0.15416384115005316, 0.12751663875786345, 0.2328869911831925, 0.001276178225753424, -0.17466401544743743, -0.02401005029324037, 0.013888018906278455, 0.1609356772761954, 0.09029396456291737, -0.051173400366678834, 0.16058503624112547, 0.2196273541857448, 0.03959244417593531, 0.07308766839003353, -0.14962491609115638, -0.1425373779852753, -0.25351787149177296, -0.09086624866638728, -0.07353999297559748, -0.027296063202716735, -0.1528137546269294, -0.13588390993916066, 0.3920555578666213, 0.19125956681799952, 0.1652090822123801, 0.09991440922629251, 0.3108279008337337, 0.07092786446750245, 0.0511119035548409, 0.11641572556539398, 0.1701924749650061, 0.021808373206801228, 0.0898103556919681, -0.15475300223181915, 0.17414246401952013, -0.01093973108648282]
|
1,803.05075
|
Stock Price Prediction using Principle Components
|
The literature provides strong evidence that stock prices can be predicted
from past price data. Principal component analysis (PCA) is a widely used
mathematical technique for dimensionality reduction and analysis of data by
identifying a small number of principal components to explain the variation
found in a data set. In this paper, we describe a general method for stock
price prediction using covariance information, in terms of a dimension
reduction operation based on principle component analysis. Projecting the noisy
observation onto a principle subspace leads to a well-conditioned problem. We
illustrate our method on daily stock price values for five companies in
different industries. We investigate the results based on mean squared error
and directional change statistic of prediction, as measures of performance, and
volatility of prediction as a measure of risk.
|
q-fin.MF
|
the literature provides strong evidence that stock prices can be predicted from past price data principal component analysis pca is a widely used mathematical technique for dimensionality reduction and analysis of data by identifying a small number of principal components to explain the variation found in a data set in this paper we describe a general method for stock price prediction using covariance information in terms of a dimension reduction operation based on principle component analysis projecting the noisy observation onto a principle subspace leads to a wellconditioned problem we illustrate our method on daily stock price values for five companies in different industries we investigate the results based on mean squared error and directional change statistic of prediction as measures of performance and volatility of prediction as a measure of risk
|
[['the', 'literature', 'provides', 'strong', 'evidence', 'that', 'stock', 'prices', 'can', 'be', 'predicted', 'from', 'past', 'price', 'data', 'principal', 'component', 'analysis', 'pca', 'is', 'a', 'widely', 'used', 'mathematical', 'technique', 'for', 'dimensionality', 'reduction', 'and', 'analysis', 'of', 'data', 'by', 'identifying', 'a', 'small', 'number', 'of', 'principal', 'components', 'to', 'explain', 'the', 'variation', 'found', 'in', 'a', 'data', 'set', 'in', 'this', 'paper', 'we', 'describe', 'a', 'general', 'method', 'for', 'stock', 'price', 'prediction', 'using', 'covariance', 'information', 'in', 'terms', 'of', 'a', 'dimension', 'reduction', 'operation', 'based', 'on', 'principle', 'component', 'analysis', 'projecting', 'the', 'noisy', 'observation', 'onto', 'a', 'principle', 'subspace', 'leads', 'to', 'a', 'wellconditioned', 'problem', 'we', 'illustrate', 'our', 'method', 'on', 'daily', 'stock', 'price', 'values', 'for', 'five', 'companies', 'in', 'different', 'industries', 'we', 'investigate', 'the', 'results', 'based', 'on', 'mean', 'squared', 'error', 'and', 'directional', 'change', 'statistic', 'of', 'prediction', 'as', 'measures', 'of', 'performance', 'and', 'volatility', 'of', 'prediction', 'as', 'a', 'measure', 'of', 'risk']]
|
[-0.0585093309557785, -0.011244001636055835, -0.13197941027377083, 0.11038142154839906, -0.07058413614779993, -0.10047495677700323, 0.1037741406612578, 0.3816769208660293, -0.25791051056744024, -0.28725339635275304, 0.1756585631625388, -0.2916031159905039, -0.1680417823972124, 0.2361397450634589, -0.11904761025851424, 0.04794030754651017, 0.09566951759343008, 0.023605021831551283, -0.028435232403518803, -0.23141071768160063, 0.2781214043189362, 0.047210953614646285, 0.35363989336430235, 0.017175209312523348, 0.13142780194351816, 0.014198893970442992, -0.10405023844743316, 0.035006446319378236, -0.09832153279206647, 0.2000458597330814, 0.2866653467256886, 0.14437186509585995, 0.33677574131412036, -0.3690073328784131, -0.19808296240499298, 0.13757879837772413, 0.06294797393175858, 0.06903838774782013, 0.009584200213077676, -0.25073354713138984, 0.039123425909289807, -0.18577989938344355, -0.09634822591033299, -0.13507522800655075, 0.008906158029496895, -0.025303499815477568, -0.3157614949688485, 0.10562450552022325, 0.027821307818433554, 0.10077202059421159, -0.045239816014090495, -0.12996242338505742, 0.003225349888177306, 0.10360209804617404, 0.1490840837765118, -0.030019103723161883, 0.1493704286227567, -0.061729218149346045, -0.16187535019972446, 0.35641145168196864, -0.13255136272919393, -0.19493001978844404, 0.11241707746574486, -0.11154869874360773, -0.14177219637768398, 0.10561193163139802, 0.25925958567214286, 0.03093345865967091, -0.18585026186933232, 0.03009018776312146, -0.05587439576629549, 0.20264246116505202, 0.03700633750431183, -0.008682300278010327, 0.1629601975525447, 0.21216218228536574, 0.09369331547609225, 0.10821664829078752, -0.13190652260902536, -0.09884500075625538, -0.26653386098967696, -0.1553845672509245, -0.22270696600158277, 0.026475699298316613, -0.1703733931729706, -0.16259311354775546, 0.4177446400104655, 0.15900164790747856, 0.1893393201859329, 0.07047415099276061, 0.30756267564985057, 0.11555374946957189, 0.02064206028642895, 0.0745856258841796, 0.17901668742750632, 0.08457937461824974, 0.08250966949995156, -0.1676619626100133, 0.1348559866327736, 0.07860887464079441]
|
1,803.05076
|
Galaxy And Mass Assembly (GAMA): impact of the group environment on
galaxy star formation
|
We explore how the group environment may affect the evolution of star-forming
galaxies. We select 1197 Galaxy And Mass Assembly (GAMA) groups at $0.05\leq z
\leq 0.2$ and analyze the projected phase space (PPS) diagram, i.e. the galaxy
velocity as a function of projected group-centric radius, as a local
environmental metric in the low-mass halo regime $10^{12}\leq
(M_{200}/M_{\odot})< 10^{14}$. We study the properties of star-forming group
galaxies, exploring the correlation of star formation rate (SFR) with radial
distance and stellar mass. We find that the fraction of star-forming group
members is higher in the PPS regions dominated by recently accreted galaxies,
whereas passive galaxies dominate the virialized regions. We observe a small
decline in specific SFR of star-forming galaxies towards the group center by a
factor $\sim 1.2$ with respect to field galaxies. Similar to cluster studies,
we conclude for low-mass halos that star-forming group galaxies represent an
infalling population from the field to the halo and show suppressed star
formation.
|
astro-ph.GA
|
we explore how the group environment may affect the evolution of starforming galaxies we select 1197 galaxy and mass assembly gama groups at 005leq z leq 02 and analyze the projected phase space pps diagram ie the galaxy velocity as a function of projected groupcentric radius as a local environmental metric in the lowmass halo regime 1012leq m_200m_odot 1014 we study the properties of starforming group galaxies exploring the correlation of star formation rate sfr with radial distance and stellar mass we find that the fraction of starforming group members is higher in the pps regions dominated by recently accreted galaxies whereas passive galaxies dominate the virialized regions we observe a small decline in specific sfr of starforming galaxies towards the group center by a factor sim 12 with respect to field galaxies similar to cluster studies we conclude for lowmass halos that starforming group galaxies represent an infalling population from the field to the halo and show suppressed star formation
|
[['we', 'explore', 'how', 'the', 'group', 'environment', 'may', 'affect', 'the', 'evolution', 'of', 'starforming', 'galaxies', 'we', 'select', '1197', 'galaxy', 'and', 'mass', 'assembly', 'gama', 'groups', 'at', '005leq', 'z', 'leq', '02', 'and', 'analyze', 'the', 'projected', 'phase', 'space', 'pps', 'diagram', 'ie', 'the', 'galaxy', 'velocity', 'as', 'a', 'function', 'of', 'projected', 'groupcentric', 'radius', 'as', 'a', 'local', 'environmental', 'metric', 'in', 'the', 'lowmass', 'halo', 'regime', '1012leq', 'm_200m_odot', '1014', 'we', 'study', 'the', 'properties', 'of', 'starforming', 'group', 'galaxies', 'exploring', 'the', 'correlation', 'of', 'star', 'formation', 'rate', 'sfr', 'with', 'radial', 'distance', 'and', 'stellar', 'mass', 'we', 'find', 'that', 'the', 'fraction', 'of', 'starforming', 'group', 'members', 'is', 'higher', 'in', 'the', 'pps', 'regions', 'dominated', 'by', 'recently', 'accreted', 'galaxies', 'whereas', 'passive', 'galaxies', 'dominate', 'the', 'virialized', 'regions', 'we', 'observe', 'a', 'small', 'decline', 'in', 'specific', 'sfr', 'of', 'starforming', 'galaxies', 'towards', 'the', 'group', 'center', 'by', 'a', 'factor', 'sim', '12', 'with', 'respect', 'to', 'field', 'galaxies', 'similar', 'to', 'cluster', 'studies', 'we', 'conclude', 'for', 'lowmass', 'halos', 'that', 'starforming', 'group', 'galaxies', 'represent', 'an', 'infalling', 'population', 'from', 'the', 'field', 'to', 'the', 'halo', 'and', 'show', 'suppressed', 'star', 'formation']]
|
[-0.0945127272023673, 0.1324119771027728, -0.07664067135631757, 0.12152533647867869, -0.08158666221132069, 0.017217192122326145, 0.04575286058668024, 0.44910709468542404, -0.10754926435344811, -0.33500735404785525, -0.017598506015631715, -0.26913501917964444, -0.01865624677999027, 0.14355399064520527, -0.009081587317268713, -0.10030281945254724, 0.00170901431789938, -0.08567053388874486, -0.08673138537730819, -0.30555601249179515, 0.37266764093963606, 0.055440996550960735, 0.1594766146831402, -0.1165717000598615, 0.07607347609580688, -0.11351365644672194, -0.08698381015257735, -0.031525664614497406, -0.23233328707292514, -0.03405117975700202, 0.25543591826451273, 0.12869823087920557, 0.2756611518386119, -0.29203034905751923, -0.17831276122293194, 0.11463956394578395, 0.25017802063639294, 0.011578001825830096, -0.1562327783387857, -0.2987039827407812, 0.08646068347723417, -0.21816517556461054, -0.1820573013652198, 0.10880057456018696, 0.025146013660262683, 0.03144730005337148, -0.19332644611058183, 0.23686060664367, -0.015220877178505345, 0.08037796590781812, -0.08424742345012864, -0.06369746333784745, -0.11449316946742763, 0.09857619430799529, -0.003988616883830876, 0.1298007395502133, 0.33489019406736836, -0.19489434358309485, 0.060488094432563554, 0.41593907201229213, -0.06467702686083766, 0.03793207370769818, 0.2316153972415523, -0.28036325622449554, -0.20626522894398128, 0.07111004329690675, 0.1823785022814881, 0.10093738088009399, -0.12370882925442742, 0.014580246575071284, -0.023720605350860964, 0.23576744072396988, -0.0047878597880590635, 0.059123571520801575, 0.3159899396218547, 0.07993269737798182, 0.11445479075945679, 0.07637279908284077, -0.16619503698985344, -0.024283090802553878, -0.19532741718697097, -0.12237680772518587, -0.10636001978795859, 0.0783521817153636, -0.17415942326912937, -0.07627235045334406, 0.3379202954172385, 0.05538244856275844, 0.2685065194027229, 0.137215363213195, 0.24700029503624393, 0.05640675246850265, 0.17068662281212565, 0.14206854045191933, 0.27259775367711886, 0.21052721905691912, -0.013408807112905636, -0.28732488885574603, 0.03237756525763785, 0.004407489899276469]
|
1,803.05077
|
Axiomatic systems and topological semantics for intuitionistic temporal
logic
|
We propose four axiomatic systems for intuitionistic linear temporal logic
and show that each of these systems is sound for a class of structures based
either on Kripke frames or on dynamic topological systems. Our topological
semantics features a new interpretation for the `henceforth' modality that is a
natural intuitionistic variant of the classical one. Using the soundness
results, we show that the four logics obtained from the axiomatic systems are
distinct. Finally, we show that when the language is restricted to the
`henceforth'-free fragment, the set of valid formulas for the relational and
topological semantics coincide.
|
math.LO cs.LO
|
we propose four axiomatic systems for intuitionistic linear temporal logic and show that each of these systems is sound for a class of structures based either on kripke frames or on dynamic topological systems our topological semantics features a new interpretation for the henceforth modality that is a natural intuitionistic variant of the classical one using the soundness results we show that the four logics obtained from the axiomatic systems are distinct finally we show that when the language is restricted to the henceforthfree fragment the set of valid formulas for the relational and topological semantics coincide
|
[['we', 'propose', 'four', 'axiomatic', 'systems', 'for', 'intuitionistic', 'linear', 'temporal', 'logic', 'and', 'show', 'that', 'each', 'of', 'these', 'systems', 'is', 'sound', 'for', 'a', 'class', 'of', 'structures', 'based', 'either', 'on', 'kripke', 'frames', 'or', 'on', 'dynamic', 'topological', 'systems', 'our', 'topological', 'semantics', 'features', 'a', 'new', 'interpretation', 'for', 'the', 'henceforth', 'modality', 'that', 'is', 'a', 'natural', 'intuitionistic', 'variant', 'of', 'the', 'classical', 'one', 'using', 'the', 'soundness', 'results', 'we', 'show', 'that', 'the', 'four', 'logics', 'obtained', 'from', 'the', 'axiomatic', 'systems', 'are', 'distinct', 'finally', 'we', 'show', 'that', 'when', 'the', 'language', 'is', 'restricted', 'to', 'the', 'henceforthfree', 'fragment', 'the', 'set', 'of', 'valid', 'formulas', 'for', 'the', 'relational', 'and', 'topological', 'semantics', 'coincide']]
|
[-0.1094636511115823, 0.05382378684104575, -0.10978551419975702, 0.13117379999675904, -0.12900127953616902, -0.14301779670737838, 0.038667207409162074, 0.3651074395359804, -0.3134567356513192, -0.2116595920912611, 0.07339394318842096, -0.2707771577794726, -0.14236169721455857, 0.20023853544989834, -0.11615734209453876, 0.07458416057246116, 0.03712766111129895, 0.10703890175015356, -0.06418852270871866, -0.21174542618397632, 0.37506490466815495, -0.08763948565077347, 0.2527978596141717, -0.0014613260621748243, 0.13145981444298135, 0.018834587385451112, 0.03917161732291182, 0.12930351423953348, -0.10594312986510583, 0.17917634776677005, 0.285067840195552, 0.2262632704951102, 0.26003978645894676, -0.4105656359461136, -0.17757145225429363, 0.03681567734262595, 0.04713187933763644, 0.11411106737796217, 0.013959459186783837, -0.3297279541147873, 0.13326356184552424, -0.17523632114656115, -0.007095992366278854, -0.1349375609861454, 0.05310882369910056, 0.020677042649670813, -0.22281778689042162, -0.022336926092975773, 0.2022276591451373, 0.12679877377619655, -0.10491628936627724, -0.08201033504489412, -0.008750857562214756, 0.04863141920122871, -0.06645486184788751, -0.03877371927471055, 0.08051901699703497, -0.07613330645835958, -0.23864596022758633, 0.3974077229310448, -0.041113905388556304, -0.19911639062532535, 0.22192046028067125, -0.08544963515305426, -0.2022930216990062, 0.06416566879973591, 0.08793310717737768, 0.13030257413144378, -0.11708946349563121, 0.10396011641690468, -0.0964797552296659, 0.22405044060239257, 0.08300263798931458, 0.11824095206975471, 0.23567381860448222, 0.18828924373034775, 0.02220788164413534, 0.17829178484438066, -0.0066254534128044424, -0.11760808375159588, -0.32862556687905453, -0.18959214489344353, -0.11290240027544012, -0.06803670568478992, -0.08452424708684703, -0.19684089213842526, 0.3790491360705346, 0.20960768629629456, 0.14340772743647298, 0.19702183430005485, 0.3030672321134868, 0.11715331857476485, 0.07636794184994262, 0.03253550815376608, 0.17591632256517187, 0.09287985098004962, 0.09331123058897599, -0.144838468824067, 0.07029213247975956, 0.12291409941341651]
|
1,803.05078
|
Bisimulations for intuitionistic temporal logics
|
We introduce bisimulations for the logic $ITL^e$ with `next', `until' and
`release', an intuitionistic temporal logic based on structures equipped with a
partial order used to interpret intuitionistic implication and a monotone
function used to interpret the temporal modalities. Our main results are that
`eventually', which is definable in terms of `until', cannot be defined in
terms of `next' and `henceforth', and similarly that `henceforth', definable in
terms of `release', cannot be defined in terms of `next' and `until', even over
the smaller class of here-and-there models.
|
math.LO cs.LO
|
we introduce bisimulations for the logic itle with next until and release an intuitionistic temporal logic based on structures equipped with a partial order used to interpret intuitionistic implication and a monotone function used to interpret the temporal modalities our main results are that eventually which is definable in terms of until cannot be defined in terms of next and henceforth and similarly that henceforth definable in terms of release cannot be defined in terms of next and until even over the smaller class of hereandthere models
|
[['we', 'introduce', 'bisimulations', 'for', 'the', 'logic', 'itle', 'with', 'next', 'until', 'and', 'release', 'an', 'intuitionistic', 'temporal', 'logic', 'based', 'on', 'structures', 'equipped', 'with', 'a', 'partial', 'order', 'used', 'to', 'interpret', 'intuitionistic', 'implication', 'and', 'a', 'monotone', 'function', 'used', 'to', 'interpret', 'the', 'temporal', 'modalities', 'our', 'main', 'results', 'are', 'that', 'eventually', 'which', 'is', 'definable', 'in', 'terms', 'of', 'until', 'can', 'not', 'be', 'defined', 'in', 'terms', 'of', 'next', 'and', 'henceforth', 'and', 'similarly', 'that', 'henceforth', 'definable', 'in', 'terms', 'of', 'release', 'can', 'not', 'be', 'defined', 'in', 'terms', 'of', 'next', 'and', 'until', 'even', 'over', 'the', 'smaller', 'class', 'of', 'hereandthere', 'models']]
|
[-0.03926498418820373, 0.09372156608690838, -0.03685576468706131, 0.08958224260138369, -0.1091636650504942, -0.07058471856701574, 0.010379457825355315, 0.37505114932408495, -0.3232252578135957, -0.2710856162024704, 0.13880946438660155, -0.22051062290504408, -0.12092162051834585, 0.19942422739617274, -0.11706533645059955, 0.02515252958983183, -0.014089651740668865, 0.10311926288132588, -0.06056100089008805, -0.2931227278712551, 0.3104948703660054, -0.002057335867933678, 0.18798304227798174, 0.04606217820867059, 0.12601171888599402, 0.007782777912621753, -0.01547622662874755, 0.1253230617371168, -0.11330333496054786, 0.10986277961245414, 0.3213403383602229, 0.18727127543723818, 0.2847894572893555, -0.45623437652176013, -0.1477856898321927, 0.12835602978475946, 0.14427339182538765, 0.03915351633573725, 0.05338758131583336, -0.2885561528081974, 0.11629627854301688, -0.21184674994706104, -0.06312439688272105, -0.1050886281928194, 0.0335672290503895, 0.08459766923313898, -0.2629576029067629, 0.010035649737280406, 0.14903329801484105, 0.047025605651623247, -0.062073324838381135, -0.03787142790728406, -0.05054846568964422, 0.09150650798541944, -0.029938624473288655, 0.06717362898935596, 0.029661796762074314, -0.08180849584803153, -0.19947436475979813, 0.3729855776084273, -0.09499210977189117, -0.17770935660960635, 0.1543725820577421, -0.12626101986473698, -0.15157903492806502, 0.06984924440261688, 0.131365542633595, 0.12553387308974615, -0.11913363460786222, 0.0745000092049778, -0.0201678414923254, 0.21821158879509803, 0.11823340348920293, 0.09965771662720134, 0.19160076996751046, 0.17581533352070058, 0.048410492488758616, 0.1784559308415216, -0.007058029227858681, -0.09673203655591842, -0.34092108554761397, -0.14505953952837525, -0.10395579967448969, -0.013882055046400475, -0.020189502892075262, -0.1870805136022273, 0.3673825566813852, 0.16888432249719842, 0.1711857933760359, 0.1504763308820953, 0.2496088748232702, 0.13194375527693022, 0.14264169467215457, 0.041508352203462065, 0.18828879605476442, 0.12877262659172078, 0.11109620155740446, -0.09675529978520582, 0.14627216119591271, 0.08830482095710179]
|
1,803.05079
|
Role of four-fermion interaction and impurity in the states of
two-dimensional semi-Dirac materials
|
We study the effects of four-fermion interaction and impurity on the
low-energy states of two-dimensional semi-Dirac materials by virtue of the
unbiased renormalization group approach. The coupled flow equations that govern
the energy-dependent evolutions of all correlated interaction parameters are
derived after taking into account one-loop corrections from the interplay
between four-fermion interaction and impurity. Whether and how four-fermion
interaction and impurity influence the low-energy properties of two-dimensional
semi-Dirac materials are discreetly explored and addressed attentively. After
carrying out the standard renormalization group analysis, we find that both
trivial insulating and nontrivial semimetal states are qualitatively stable
against all four kinds of four-fermion interactions. However, while switching
on both four-fermion interaction and impurity, certain insulator-semimetal
phase transition and the distance of Dirac nodal points can be respectively
induced and modified due to their strong interplay and intimate competition.
Moreover, several non-Fermi liquid behaviors that deviate from the conventional
Fermi liquids are exhibited at the lowest-energy limit.
|
cond-mat.str-el
|
we study the effects of fourfermion interaction and impurity on the lowenergy states of twodimensional semidirac materials by virtue of the unbiased renormalization group approach the coupled flow equations that govern the energydependent evolutions of all correlated interaction parameters are derived after taking into account oneloop corrections from the interplay between fourfermion interaction and impurity whether and how fourfermion interaction and impurity influence the lowenergy properties of twodimensional semidirac materials are discreetly explored and addressed attentively after carrying out the standard renormalization group analysis we find that both trivial insulating and nontrivial semimetal states are qualitatively stable against all four kinds of fourfermion interactions however while switching on both fourfermion interaction and impurity certain insulatorsemimetal phase transition and the distance of dirac nodal points can be respectively induced and modified due to their strong interplay and intimate competition moreover several nonfermi liquid behaviors that deviate from the conventional fermi liquids are exhibited at the lowestenergy limit
|
[['we', 'study', 'the', 'effects', 'of', 'fourfermion', 'interaction', 'and', 'impurity', 'on', 'the', 'lowenergy', 'states', 'of', 'twodimensional', 'semidirac', 'materials', 'by', 'virtue', 'of', 'the', 'unbiased', 'renormalization', 'group', 'approach', 'the', 'coupled', 'flow', 'equations', 'that', 'govern', 'the', 'energydependent', 'evolutions', 'of', 'all', 'correlated', 'interaction', 'parameters', 'are', 'derived', 'after', 'taking', 'into', 'account', 'oneloop', 'corrections', 'from', 'the', 'interplay', 'between', 'fourfermion', 'interaction', 'and', 'impurity', 'whether', 'and', 'how', 'fourfermion', 'interaction', 'and', 'impurity', 'influence', 'the', 'lowenergy', 'properties', 'of', 'twodimensional', 'semidirac', 'materials', 'are', 'discreetly', 'explored', 'and', 'addressed', 'attentively', 'after', 'carrying', 'out', 'the', 'standard', 'renormalization', 'group', 'analysis', 'we', 'find', 'that', 'both', 'trivial', 'insulating', 'and', 'nontrivial', 'semimetal', 'states', 'are', 'qualitatively', 'stable', 'against', 'all', 'four', 'kinds', 'of', 'fourfermion', 'interactions', 'however', 'while', 'switching', 'on', 'both', 'fourfermion', 'interaction', 'and', 'impurity', 'certain', 'insulatorsemimetal', 'phase', 'transition', 'and', 'the', 'distance', 'of', 'dirac', 'nodal', 'points', 'can', 'be', 'respectively', 'induced', 'and', 'modified', 'due', 'to', 'their', 'strong', 'interplay', 'and', 'intimate', 'competition', 'moreover', 'several', 'nonfermi', 'liquid', 'behaviors', 'that', 'deviate', 'from', 'the', 'conventional', 'fermi', 'liquids', 'are', 'exhibited', 'at', 'the', 'lowestenergy', 'limit']]
|
[-0.17662105212709114, 0.23992666930200593, -0.064692745128301, 0.10504940016075007, -0.03462658353870915, -0.2104213353637005, 0.07252155802392911, 0.3583157819823452, -0.2549962088525776, -0.2875833387907234, -0.012447739218271548, -0.3891858985827815, -0.17371789445920335, 0.12666871986922718, 0.11864241948351265, 0.0130678431281159, 0.00933345858263032, -0.051802874560798365, -0.14795662954359526, -0.20306599856234125, 0.374790345607025, -0.01449717251403678, 0.28051530412368236, 0.11745513286141138, 0.030568690902944052, 0.035530787189641304, 0.04280247216172997, 0.055160455060972564, -0.1009453399403062, 0.02001021968486208, 0.22009806918889105, -0.11532369661220018, 0.15635897326132944, -0.45516037796774217, -0.2108329180567976, 0.026169602499313414, 0.14504166684684253, 0.11405663855463988, -0.05660560662753039, -0.34794617630541325, -0.00961005855652113, -0.17972300533325442, -0.11920312952941224, -0.13624594818440175, -0.019337116799227172, -0.02346173540159549, -0.2105899988072774, 0.09066752578252026, 0.02509448494679565, 0.045880382141518974, -0.06761414624840742, -0.10445804075608331, -0.10648738641231771, 0.14304081628159168, 0.09800253151315114, -0.03129374080397669, 0.15002929879382493, -0.15978379106569673, -0.07971564814929039, 0.41208324516492506, -0.07253330757000273, -0.1380027758738687, 0.2154757234928829, -0.12832272069288359, -0.07856366941705346, 0.1640288198637145, 0.1448175512254238, 0.04665366807772267, -0.15892105313738988, 0.13923218282044775, 0.00018532384908007037, 0.10202033952434338, 0.010555107609158561, 0.07295590871344171, 0.24973252107419314, 0.13700389066530813, 0.022502558498132614, 0.08122234333591956, -0.04522516680280528, -0.1414958851336832, -0.2834461382530149, -0.08194382600185852, -0.18063570000081053, 0.06743384505577026, -0.09276269942788677, -0.15777685584560516, 0.44247923639092235, 0.15396570039071864, 0.1556382057317082, -0.04114429432027523, 0.18571526469182104, 0.1018967989471651, 0.038041145214810966, 0.05213220461662258, 0.30261903150728153, 0.127763190632686, 0.00786655084830859, -0.349336614865329, 0.03213588175694308, 0.1107002508015402]
|
1,803.0508
|
A Survey of Multimedia Streaming in LTE Cellular Networks
|
With the growing of Long Term Evolution (LTE) cellular networks and the
increase in the demand of the video services, it is vital to consider the
challenges in the streaming services from a different perspective. A
perspective that focuses on the streaming services in light of cellular
networks challenges, both per layer basis and across multiple layers as well.
In this tutorial, we highlight the main challenges that faces the industry of
video streaming in the context of cellular networks with a focus on LTE. We
also discuss proposed solutions for these challenges while highlighting the
limitations of these solutions and the conditions/assumptions required for
these solution to deliver high performance. In addition, we show different work
in cross layer optimization for video streaming and how it leads towards a more
optimized end to end LTE networking for video streaming. Finally, we suggest
different open research areas in the domain of video delivery over LTE networks
that can significantly enhance the quality of streaming experience to the end
user.
|
cs.NI
|
with the growing of long term evolution lte cellular networks and the increase in the demand of the video services it is vital to consider the challenges in the streaming services from a different perspective a perspective that focuses on the streaming services in light of cellular networks challenges both per layer basis and across multiple layers as well in this tutorial we highlight the main challenges that faces the industry of video streaming in the context of cellular networks with a focus on lte we also discuss proposed solutions for these challenges while highlighting the limitations of these solutions and the conditionsassumptions required for these solution to deliver high performance in addition we show different work in cross layer optimization for video streaming and how it leads towards a more optimized end to end lte networking for video streaming finally we suggest different open research areas in the domain of video delivery over lte networks that can significantly enhance the quality of streaming experience to the end user
|
[['with', 'the', 'growing', 'of', 'long', 'term', 'evolution', 'lte', 'cellular', 'networks', 'and', 'the', 'increase', 'in', 'the', 'demand', 'of', 'the', 'video', 'services', 'it', 'is', 'vital', 'to', 'consider', 'the', 'challenges', 'in', 'the', 'streaming', 'services', 'from', 'a', 'different', 'perspective', 'a', 'perspective', 'that', 'focuses', 'on', 'the', 'streaming', 'services', 'in', 'light', 'of', 'cellular', 'networks', 'challenges', 'both', 'per', 'layer', 'basis', 'and', 'across', 'multiple', 'layers', 'as', 'well', 'in', 'this', 'tutorial', 'we', 'highlight', 'the', 'main', 'challenges', 'that', 'faces', 'the', 'industry', 'of', 'video', 'streaming', 'in', 'the', 'context', 'of', 'cellular', 'networks', 'with', 'a', 'focus', 'on', 'lte', 'we', 'also', 'discuss', 'proposed', 'solutions', 'for', 'these', 'challenges', 'while', 'highlighting', 'the', 'limitations', 'of', 'these', 'solutions', 'and', 'the', 'conditionsassumptions', 'required', 'for', 'these', 'solution', 'to', 'deliver', 'high', 'performance', 'in', 'addition', 'we', 'show', 'different', 'work', 'in', 'cross', 'layer', 'optimization', 'for', 'video', 'streaming', 'and', 'how', 'it', 'leads', 'towards', 'a', 'more', 'optimized', 'end', 'to', 'end', 'lte', 'networking', 'for', 'video', 'streaming', 'finally', 'we', 'suggest', 'different', 'open', 'research', 'areas', 'in', 'the', 'domain', 'of', 'video', 'delivery', 'over', 'lte', 'networks', 'that', 'can', 'significantly', 'enhance', 'the', 'quality', 'of', 'streaming', 'experience', 'to', 'the', 'end', 'user']]
|
[-0.15516514373995874, 0.03085546934744343, -0.0028105321329175716, 0.01893563672257144, -0.03638060236837538, -0.13102597987744957, 0.061092845156616976, 0.4140022015377499, -0.30770108903968885, -0.2898344090263847, 0.10387327842112254, -0.2753468137289885, -0.19066838563109437, 0.19102293601359374, -0.129257314249084, 0.06780237957303013, 0.10800770710158672, 0.01149822971118348, -0.018339508393269387, -0.28887863231163163, 0.32488379332547385, 0.0653717501998125, 0.38133241643663496, 0.10278299064486332, 0.036193028172766345, -0.05115009422713358, -0.07356243071124136, -0.017023933499807582, -0.08686394592218892, 0.17990651970363356, 0.32712819227682693, 0.20370828363090931, 0.3326365577744409, -0.5064752826001495, -0.27607798434439157, 0.023512750905605832, 0.20859240732222264, 0.08832245991271477, -0.09334238073028073, -0.24307485749956131, 0.14368553561057307, -0.22086918291946253, -0.05298409205196159, -0.01904728086221786, -0.01585208750717963, 0.06899594327045461, -0.2455163413958092, -0.024969357312026357, 0.01759114752348978, 0.04424183612129474, -0.09016585209368107, -0.07938389336119317, 0.018518875260183233, 0.21123359197961344, 0.0804904714397188, 0.009638482369371645, 0.1089868929924532, -0.2070436890644487, -0.09273593111651107, 0.44384176565688993, -0.07950818079275666, -0.16810566035703578, 0.2065822192442803, -0.04183407933617543, -0.14868352464483386, 0.07548992892164581, 0.2629390425835958, 0.0584350130520761, -0.17715823969947883, 0.020520411142136992, 0.007209026314307093, 0.14860381083105625, 0.06280952862601095, 0.07555781695659139, 0.20911092456108668, 0.23904255569712923, 0.11760585133119353, 0.11887663976882495, -0.07581554703314655, -0.1272288098643046, -0.20109938038270533, -0.16225066833153723, -0.1187343984215875, -0.02487983741420543, -0.09307589073120782, -0.13264505643746816, 0.410125099420492, 0.23642196960004402, 0.18329341535545177, 0.07166991667067382, 0.376407697375509, 0.03552287737104399, 0.08280932316223957, 0.09039616853918969, 0.1732283702225513, -0.01815176549107058, 0.257033900757614, -0.15491868816232973, 0.041284832144377843, 0.005024229450750032]
|
1,803.05081
|
Schauder estimates on smooth and singular spaces
|
In this paper, we present a proof of Schauder estimate on Euclidean space and
use it to generalize Donaldson's Schauder estimate on space with conical
singularities in the following two directions. The first is that we allow the
total cone angle to be larger than 2$\pi$ and the second is that we discuss
higher order estimates.
|
math.AP
|
in this paper we present a proof of schauder estimate on euclidean space and use it to generalize donaldsons schauder estimate on space with conical singularities in the following two directions the first is that we allow the total cone angle to be larger than 2pi and the second is that we discuss higher order estimates
|
[['in', 'this', 'paper', 'we', 'present', 'a', 'proof', 'of', 'schauder', 'estimate', 'on', 'euclidean', 'space', 'and', 'use', 'it', 'to', 'generalize', 'donaldsons', 'schauder', 'estimate', 'on', 'space', 'with', 'conical', 'singularities', 'in', 'the', 'following', 'two', 'directions', 'the', 'first', 'is', 'that', 'we', 'allow', 'the', 'total', 'cone', 'angle', 'to', 'be', 'larger', 'than', '2pi', 'and', 'the', 'second', 'is', 'that', 'we', 'discuss', 'higher', 'order', 'estimates']]
|
[-0.11315491702407598, 0.06358215786583189, -0.10354817582161299, 0.10176821646122594, -0.13104807610423969, -0.0583323916736325, 0.03425328694408693, 0.3967105156708775, -0.22642319955463922, -0.20040964661166072, 0.14963550142627874, -0.29918518358109786, -0.14081525071898277, 0.19164463049466057, -0.12378811814622688, 0.002579497572566782, 0.039002952340524644, 0.02200601906432504, -0.1629043817769603, -0.24321455249030674, 0.4318730481900275, -0.00621424858192248, 0.19140182274194167, 0.05733838351859179, 0.09724504351782214, 0.049205209203397056, -0.021963198203593493, 0.006000716121759199, -0.23082779995794617, 0.1803969963802956, 0.20127099931622588, 0.062478178746200035, 0.2584956935606897, -0.40047120795186075, -0.1677759604062885, 0.14476703902307367, 0.13313060682932182, 0.09120796150195279, -0.0024874409760481547, -0.226858234764742, 0.1205871945879023, -0.11122890708585535, -0.19677515467628837, -0.10871429580064225, -0.01855343839685832, -0.01422558437168066, -0.22426495260359453, 0.035097272625924755, 0.06555759828604225, 0.02373966030843024, -0.08893898106180131, -0.09845385796922658, -0.0011870797191347396, 0.08121361677019324, 0.05928244913229719, 0.13056453287468425, 0.02291335919705619, -0.02413980321476369, -0.1032774263959644, 0.3496539168325918, -0.08723653736030558, -0.25983355909452904, 0.1286818205844611, -0.22749733602228975, -0.12497747519436027, 0.09313046461569943, 0.1820138485594985, 0.17812696588225663, -0.07099998647546661, 0.04720317205439122, -0.07084306855020779, 0.13897850949849402, 0.11088470384545092, 0.020002648350782692, 0.09435391860149268, 0.1248721121644069, 0.1938015262879032, 0.12706472130750107, -0.10450718600934904, -0.06680943562449622, -0.3794977118793343, -0.25124217774386387, -0.195720624178648, 0.07664676925300487, -0.10847640864033435, -0.11765298811951652, 0.37307473483295844, 0.19012097919559373, 0.2267883562516155, 0.08910839906561055, 0.2972190777904221, 0.1175453329924494, 0.028008959197904915, 0.07904939039976203, 0.2815553059003183, 0.09618328791111708, 0.062623625454892, -0.1428748828314253, 0.00242270520954792, 0.18255276766805245]
|
1,803.05082
|
Revisiting Salient Object Detection: Simultaneous Detection, Ranking,
and Subitizing of Multiple Salient Objects
|
Salient object detection is a problem that has been considered in detail and
many solutions proposed. In this paper, we argue that work to date has
addressed a problem that is relatively ill-posed. Specifically, there is not
universal agreement about what constitutes a salient object when multiple
observers are queried. This implies that some objects are more likely to be
judged salient than others, and implies a relative rank exists on salient
objects. The solution presented in this paper solves this more general problem
that considers relative rank, and we propose data and metrics suitable to
measuring success in a relative object saliency landscape. A novel deep
learning solution is proposed based on a hierarchical representation of
relative saliency and stage-wise refinement. We also show that the problem of
salient object subitizing can be addressed with the same network, and our
approach exceeds performance of any prior work across all metrics considered
(both traditional and newly proposed).
|
cs.CV
|
salient object detection is a problem that has been considered in detail and many solutions proposed in this paper we argue that work to date has addressed a problem that is relatively illposed specifically there is not universal agreement about what constitutes a salient object when multiple observers are queried this implies that some objects are more likely to be judged salient than others and implies a relative rank exists on salient objects the solution presented in this paper solves this more general problem that considers relative rank and we propose data and metrics suitable to measuring success in a relative object saliency landscape a novel deep learning solution is proposed based on a hierarchical representation of relative saliency and stagewise refinement we also show that the problem of salient object subitizing can be addressed with the same network and our approach exceeds performance of any prior work across all metrics considered both traditional and newly proposed
|
[['salient', 'object', 'detection', 'is', 'a', 'problem', 'that', 'has', 'been', 'considered', 'in', 'detail', 'and', 'many', 'solutions', 'proposed', 'in', 'this', 'paper', 'we', 'argue', 'that', 'work', 'to', 'date', 'has', 'addressed', 'a', 'problem', 'that', 'is', 'relatively', 'illposed', 'specifically', 'there', 'is', 'not', 'universal', 'agreement', 'about', 'what', 'constitutes', 'a', 'salient', 'object', 'when', 'multiple', 'observers', 'are', 'queried', 'this', 'implies', 'that', 'some', 'objects', 'are', 'more', 'likely', 'to', 'be', 'judged', 'salient', 'than', 'others', 'and', 'implies', 'a', 'relative', 'rank', 'exists', 'on', 'salient', 'objects', 'the', 'solution', 'presented', 'in', 'this', 'paper', 'solves', 'this', 'more', 'general', 'problem', 'that', 'considers', 'relative', 'rank', 'and', 'we', 'propose', 'data', 'and', 'metrics', 'suitable', 'to', 'measuring', 'success', 'in', 'a', 'relative', 'object', 'saliency', 'landscape', 'a', 'novel', 'deep', 'learning', 'solution', 'is', 'proposed', 'based', 'on', 'a', 'hierarchical', 'representation', 'of', 'relative', 'saliency', 'and', 'stagewise', 'refinement', 'we', 'also', 'show', 'that', 'the', 'problem', 'of', 'salient', 'object', 'subitizing', 'can', 'be', 'addressed', 'with', 'the', 'same', 'network', 'and', 'our', 'approach', 'exceeds', 'performance', 'of', 'any', 'prior', 'work', 'across', 'all', 'metrics', 'considered', 'both', 'traditional', 'and', 'newly', 'proposed']]
|
[-0.08119248103344469, -0.002819023154391225, -0.0859754902553881, 0.07540881990975623, -0.10583006345316957, -0.17071406608803352, 0.009122771209485497, 0.4329870250906534, -0.23033315574774033, -0.295835272296314, 0.09269458719286, -0.2638000880789225, -0.21720357318438446, 0.17903199907582087, -0.18749862794532993, 0.06096997499394759, 0.11413612320224285, 0.07339660893342677, -0.055952574642505616, -0.2690548488920685, 0.36538757415856143, 0.0512677379896802, 0.2926353228925045, 0.04953204395225758, 0.1466572842253728, -0.04926865727931356, -0.042469804216722015, 0.07925152452588437, -0.08490835326406022, 0.17257394416518745, 0.30819556577380297, 0.19796135173858423, 0.3103940874089006, -0.3364709451272609, -0.2400551723156148, 0.13005007906656735, 0.16381178554859321, 0.11408528208341094, -0.05904070534064897, -0.2950171117068737, 0.15206437446043536, -0.17044311978373747, -0.031130149146352128, -0.09313036130658191, 0.03163895231469944, -0.06183798809885789, -0.23849548084756275, 0.04095626919241889, 0.08398127816947455, 0.014976959076419378, -0.08731730339031335, -0.08749491199598926, 0.05924707838144319, 0.12013694395961472, 0.053229231262804974, 0.06982087296030372, 0.1050657230654767, -0.16443312112583072, -0.11363354758403982, 0.3991651674080047, -0.018695763385410503, -0.23307607528771374, 0.2157810718091027, -0.08101132165219421, -0.18132064992763625, 0.09353079361348728, 0.15161311095521138, 0.1813512572838486, -0.15747377199054455, 0.03180499881198986, -0.09634634943762023, 0.19538805642088128, 0.06308966189931342, 0.003100089487057271, 0.19924440031283933, 0.20927435339274253, 0.08108259636610687, 0.1300106471490447, -0.09610206290640554, -0.06834056114208452, -0.24633000150380752, -0.1361484562645957, -0.183608951293982, -0.02962137634150764, -0.06256907441807914, -0.11366127388089135, 0.4053287214368202, 0.24329585126885894, 0.23249760711903739, 0.06323345108080068, 0.31041900863037536, 0.08099102571229955, 0.0598057678349262, 0.11181269170846908, 0.243249941167346, 0.02094080518029488, 0.07311173206325738, -0.13245748938802795, 0.11913619335343362, 0.06576895907930555]
|
1,803.05083
|
Block Diagonally Dominant Positive Definite Sub-optimal Filters and
Smoothers
|
We examine stochastic dynamical systems where the transition matrix, $\Phi$,
and the system noise, $\bf{\Gamma}\bf{Q}\bf{\Gamma}^T$, covariance are nearly
block diagonal. When $\bf{H}^T \bf{R}^{-1} \bf{H}$ is also nearly block
diagonal, where $\bf{R}$ is the observation noise covariance and $\bf{H}$ is
the observation matrix, our suboptimal filter/smoothers are always positive
semi-definite, and have improved numerical properties. Applications for
distributed dynamical systems with time dependent pixel imaging are discussed.
|
stat.ME cs.SY eess.SY math.RT
|
we examine stochastic dynamical systems where the transition matrix phi and the system noise bfgammabfqbfgammat covariance are nearly block diagonal when bfht bfr1 bfh is also nearly block diagonal where bfr is the observation noise covariance and bfh is the observation matrix our suboptimal filtersmoothers are always positive semidefinite and have improved numerical properties applications for distributed dynamical systems with time dependent pixel imaging are discussed
|
[['we', 'examine', 'stochastic', 'dynamical', 'systems', 'where', 'the', 'transition', 'matrix', 'phi', 'and', 'the', 'system', 'noise', 'bfgammabfqbfgammat', 'covariance', 'are', 'nearly', 'block', 'diagonal', 'when', 'bfht', 'bfr1', 'bfh', 'is', 'also', 'nearly', 'block', 'diagonal', 'where', 'bfr', 'is', 'the', 'observation', 'noise', 'covariance', 'and', 'bfh', 'is', 'the', 'observation', 'matrix', 'our', 'suboptimal', 'filtersmoothers', 'are', 'always', 'positive', 'semidefinite', 'and', 'have', 'improved', 'numerical', 'properties', 'applications', 'for', 'distributed', 'dynamical', 'systems', 'with', 'time', 'dependent', 'pixel', 'imaging', 'are', 'discussed']]
|
[-0.1705691531721142, 0.13657240081398236, -0.015539874683224385, 0.019474386881601306, -0.015149473024892711, -0.2165448226282493, -0.03130982146267929, 0.4159303259765429, -0.29696525164669557, -0.2117929755289468, 0.2284666607156396, -0.30797911584076865, -0.21326935811028366, 0.13843355496083537, -0.03108728301501082, 0.1021026999749724, 0.055520910153826396, 0.021851885113714924, -0.1554759012745513, -0.26169361044923145, 0.30271340772742406, 0.07663479776331975, 0.24791312073507615, -0.05489691120061663, 0.10477639405026791, 0.007851952322638564, -0.046223647351707184, -0.005051323032427219, -0.03664831742043457, 0.0025192821593654734, 0.25982497390660064, 0.10890042105494367, 0.22047930631426074, -0.36674799418617643, -0.16465956116876296, 0.1112622834569324, 0.13795504725731594, 0.08758721938131438, -0.050173407531298335, -0.28690072125004185, 0.12301796996184895, -0.12137389564586262, -0.06280866014440695, -0.0932599371674681, 0.022979429742741968, -0.001827683686579187, -0.3529193667214244, 0.11706348771047252, 0.0587693723322328, 0.010613241931423545, -0.020826414167400328, -0.2075671677594073, 0.04584382719645697, 0.09728061061328082, 0.015185867214665538, -0.028578988638811656, 0.18885863720319204, -0.010272919095211452, -0.059726271988643755, 0.3097668079989812, -0.025418333589069305, -0.2409565812277217, 0.13431466340778336, -0.1488999865588642, -0.12202239789879851, 0.13675664310463734, 0.18504705983063868, 0.08737719052230879, -0.1564047806119385, 0.1259045668158515, -0.044060062391743544, 0.1927672691282726, -0.013329398059736817, 0.08160471423499045, 0.1539340405875156, 0.14944959805542302, 0.13361659011852386, 0.09703658431047393, -0.04653824697579107, -0.141371990771844, -0.25576304785546755, -0.10977360055849497, -0.24899855666914053, 0.041992322564305316, -0.15723662004705646, -0.1638255559148327, 0.35186316415427193, 0.12093170511446172, 0.1766441273578112, 0.10031302407714388, 0.29316024023348525, 0.17115614993775624, 0.013374713820315177, 0.07865389230691137, 0.20951994861506165, 0.20612313520283468, 0.08397940262371013, -0.2317384672276075, 0.06952901956655326, 0.016918567366026822]
|
1,803.05084
|
Local Partition in Rich Graphs
|
Local graph partitioning is a key graph mining tool that allows researchers
to identify small groups of interrelated nodes (e.g. people) and their
connective edges (e.g. interactions). Because local graph partitioning is
primarily focused on the network structure of the graph (vertices and edges),
it often fails to consider the additional information contained in the
attributes. In this paper we propose---(i) a scalable algorithm to improve
local graph partitioning by taking into account both the network structure of
the graph and the attribute data and (ii) an application of the proposed local
graph partitioning algorithm (AttriPart) to predict the evolution of local
communities (LocalForecasting). Experimental results show that our proposed
AttriPart algorithm finds up to 1.6$\times$ denser local partitions, while
running approximately 43$\times$ faster than traditional local partitioning
techniques (PageRank-Nibble). In addition, our LocalForecasting algorithm shows
a significant improvement in the number of nodes and edges correctly predicted
over baseline methods.
|
cs.SI cs.DS physics.soc-ph
|
local graph partitioning is a key graph mining tool that allows researchers to identify small groups of interrelated nodes eg people and their connective edges eg interactions because local graph partitioning is primarily focused on the network structure of the graph vertices and edges it often fails to consider the additional information contained in the attributes in this paper we proposei a scalable algorithm to improve local graph partitioning by taking into account both the network structure of the graph and the attribute data and ii an application of the proposed local graph partitioning algorithm attripart to predict the evolution of local communities localforecasting experimental results show that our proposed attripart algorithm finds up to 16times denser local partitions while running approximately 43times faster than traditional local partitioning techniques pageranknibble in addition our localforecasting algorithm shows a significant improvement in the number of nodes and edges correctly predicted over baseline methods
|
[['local', 'graph', 'partitioning', 'is', 'a', 'key', 'graph', 'mining', 'tool', 'that', 'allows', 'researchers', 'to', 'identify', 'small', 'groups', 'of', 'interrelated', 'nodes', 'eg', 'people', 'and', 'their', 'connective', 'edges', 'eg', 'interactions', 'because', 'local', 'graph', 'partitioning', 'is', 'primarily', 'focused', 'on', 'the', 'network', 'structure', 'of', 'the', 'graph', 'vertices', 'and', 'edges', 'it', 'often', 'fails', 'to', 'consider', 'the', 'additional', 'information', 'contained', 'in', 'the', 'attributes', 'in', 'this', 'paper', 'we', 'proposei', 'a', 'scalable', 'algorithm', 'to', 'improve', 'local', 'graph', 'partitioning', 'by', 'taking', 'into', 'account', 'both', 'the', 'network', 'structure', 'of', 'the', 'graph', 'and', 'the', 'attribute', 'data', 'and', 'ii', 'an', 'application', 'of', 'the', 'proposed', 'local', 'graph', 'partitioning', 'algorithm', 'attripart', 'to', 'predict', 'the', 'evolution', 'of', 'local', 'communities', 'localforecasting', 'experimental', 'results', 'show', 'that', 'our', 'proposed', 'attripart', 'algorithm', 'finds', 'up', 'to', '16times', 'denser', 'local', 'partitions', 'while', 'running', 'approximately', '43times', 'faster', 'than', 'traditional', 'local', 'partitioning', 'techniques', 'pageranknibble', 'in', 'addition', 'our', 'localforecasting', 'algorithm', 'shows', 'a', 'significant', 'improvement', 'in', 'the', 'number', 'of', 'nodes', 'and', 'edges', 'correctly', 'predicted', 'over', 'baseline', 'methods']]
|
[-0.11503147717509098, 0.015032184637123558, -0.08018340115989397, 0.0544953706939223, -0.1153420571880094, -0.11139263734652997, 0.08468269841175462, 0.39472336553294085, -0.28949055869517654, -0.3948068926303551, 0.046314237652153804, -0.2747986211522747, -0.17115196728524912, 0.10128925687408653, -0.06637276023112494, 0.034780468496269194, 0.12259561135273041, 0.06240997496542745, 0.016680332420169024, -0.2932978481654447, 0.2643883272491652, 0.04964969936308676, 0.3078012346803885, 0.05048836911867919, 0.06959540204000499, 0.03508522659861322, -0.08787186732194548, 0.08398965654316648, -0.08496609838922299, 0.15677364670896324, 0.2665347172975026, 0.17456240754189162, 0.296541303621027, -0.4730589683713584, -0.20131899842928197, 0.14786688387715097, 0.16166454426330065, 0.08783541233599956, 0.014773035337666756, -0.2876350479007795, 0.13172129581859013, -0.12579226268070012, -0.010371076564328617, -0.0754197155735616, 0.0206459551214658, -0.004118511545198873, -0.2777262914516353, 0.019009357237995697, 0.07237472073496158, 0.016284727295338787, -0.0006156897625950133, -0.12802538217992745, -0.01755308253562142, 0.14351313490870185, -0.0188537207729151, 0.0495320937202858, 0.13658978133141222, -0.1282286831314258, -0.1463985024847026, 0.3830275383745802, -0.007808114977348756, -0.12357391509677058, 0.17978209472614629, -0.06392305408572328, -0.17378721991553903, 0.12854701771946817, 0.19138884088747074, 0.09290019360386992, -0.12243611286635157, 0.053435331349791, -0.04891624759098892, 0.17344784228580779, 0.038517045833427334, 0.014728738785046956, 0.11773909261803432, 0.1976926752269782, 0.1592642881811179, 0.1280112193977653, -0.04963157499562307, -0.07188189514302488, -0.19420117892100122, -0.11788517668650582, -0.2156116520423956, -0.0365668458029114, -0.19446617348454812, -0.17379660142810438, 0.47219564172856765, 0.17953157806447867, 0.23649679359755127, 0.055764694550427894, 0.32371972597942783, 0.01614811797305171, 0.12215619201065395, 0.17235438029827743, 0.12412717312911589, 0.0868399354035099, 0.05198154969156944, -0.18315358034511706, 0.10453449055905743, 0.07229019756717929]
|
1,803.05085
|
The $\mathbb{Z}_2$-genus of Kuratowski minors
|
A drawing of a graph on a surface is independently even if every pair of
nonadjacent edges in the drawing crosses an even number of times. The
$\mathbb{Z}_2$-genus of a graph $G$ is the minimum $g$ such that $G$ has an
independently even drawing on the orientable surface of genus $g$. An
unpublished result by Robertson and Seymour implies that for every $t$, every
graph of sufficiently large genus contains as a minor a projective $t\times t$
grid or one of the following so-called $t$-Kuratowski graphs: $K_{3,t}$, or $t$
copies of $K_5$ or $K_{3,3}$ sharing at most two common vertices. We show that
the $\mathbb{Z}_2$-genus of graphs in these families is unbounded in $t$; in
fact, equal to their genus. Together, this implies that the genus of a graph is
bounded from above by a function of its $\mathbb{Z}_2$-genus, solving a problem
posed by Schaefer and \v{S}tefankovi\v{c}, and giving an approximate version of
the Hanani-Tutte theorem on orientable surfaces. We also obtain an analogous
result for Euler genus and Euler $\mathbb{Z}_2$-genus of graphs.
|
math.CO cs.DM
|
a drawing of a graph on a surface is independently even if every pair of nonadjacent edges in the drawing crosses an even number of times the mathbbz_2genus of a graph g is the minimum g such that g has an independently even drawing on the orientable surface of genus g an unpublished result by robertson and seymour implies that for every t every graph of sufficiently large genus contains as a minor a projective ttimes t grid or one of the following socalled tkuratowski graphs k_3t or t copies of k_5 or k_33 sharing at most two common vertices we show that the mathbbz_2genus of graphs in these families is unbounded in t in fact equal to their genus together this implies that the genus of a graph is bounded from above by a function of its mathbbz_2genus solving a problem posed by schaefer and vstefankovivc and giving an approximate version of the hananitutte theorem on orientable surfaces we also obtain an analogous result for euler genus and euler mathbbz_2genus of graphs
|
[['a', 'drawing', 'of', 'a', 'graph', 'on', 'a', 'surface', 'is', 'independently', 'even', 'if', 'every', 'pair', 'of', 'nonadjacent', 'edges', 'in', 'the', 'drawing', 'crosses', 'an', 'even', 'number', 'of', 'times', 'the', 'mathbbz_2genus', 'of', 'a', 'graph', 'g', 'is', 'the', 'minimum', 'g', 'such', 'that', 'g', 'has', 'an', 'independently', 'even', 'drawing', 'on', 'the', 'orientable', 'surface', 'of', 'genus', 'g', 'an', 'unpublished', 'result', 'by', 'robertson', 'and', 'seymour', 'implies', 'that', 'for', 'every', 't', 'every', 'graph', 'of', 'sufficiently', 'large', 'genus', 'contains', 'as', 'a', 'minor', 'a', 'projective', 'ttimes', 't', 'grid', 'or', 'one', 'of', 'the', 'following', 'socalled', 'tkuratowski', 'graphs', 'k_3t', 'or', 't', 'copies', 'of', 'k_5', 'or', 'k_33', 'sharing', 'at', 'most', 'two', 'common', 'vertices', 'we', 'show', 'that', 'the', 'mathbbz_2genus', 'of', 'graphs', 'in', 'these', 'families', 'is', 'unbounded', 'in', 't', 'in', 'fact', 'equal', 'to', 'their', 'genus', 'together', 'this', 'implies', 'that', 'the', 'genus', 'of', 'a', 'graph', 'is', 'bounded', 'from', 'above', 'by', 'a', 'function', 'of', 'its', 'mathbbz_2genus', 'solving', 'a', 'problem', 'posed', 'by', 'schaefer', 'and', 'vstefankovivc', 'and', 'giving', 'an', 'approximate', 'version', 'of', 'the', 'hananitutte', 'theorem', 'on', 'orientable', 'surfaces', 'we', 'also', 'obtain', 'an', 'analogous', 'result', 'for', 'euler', 'genus', 'and', 'euler', 'mathbbz_2genus', 'of', 'graphs']]
|
[-0.19047644417406173, 0.13082387127543524, -0.08237392882467928, 0.014329178021180482, -0.0807566655791577, -0.15144238395518378, 0.035449163933769304, 0.33423076025264786, -0.2459470940983925, -0.3214899095004065, 0.08933570566287602, -0.31727433102532177, -0.1230710644849538, 0.17983051270487505, -0.14281856136026178, -0.02401560788656917, 0.11970151922997763, 0.09641433129228695, -0.00038403255200525474, -0.27445995056394445, 0.3390083115885568, -0.07436679660925391, 0.12145873438703081, 0.1136068311242158, 0.11790489925790512, 0.045325362777108684, 0.02236964867303246, 0.07638868355064256, -0.1401792446266089, 0.06376481476057408, 0.24393197638391143, 0.10831135849206987, 0.24367531757169997, -0.3883652484089705, -0.17949099072979557, 0.2074148776950873, 0.093662773391398, 0.0399734111739682, 5.3455033993119736e-05, -0.21272195739486413, 0.11110553948197797, -0.08987849333959397, -0.13675731531077484, 0.0400163566486703, 0.11321078865020945, -0.025582977897373207, -0.22245530281978393, -0.019202872466912754, 0.1703082596888624, 0.0684655691055875, 0.06422727834501396, -0.15007697883993387, -0.11070150371684491, 0.10197721017328532, -0.027656727707372944, 0.13602949006616394, -0.007503226309216837, -0.14462420512899643, -0.14694831546461373, 0.34299358498980426, -0.0619691688123524, -0.16027626422729496, 0.1297727320268369, -0.11924261365859219, -0.18089373053830357, 0.12567189778065124, 0.09265854945869256, 0.18179262235586408, -0.05616676153843863, 0.16663777040540953, -0.14039831508866005, 0.11524032946398254, 0.16083566724099438, -0.07784859423814287, 0.1405477064106156, 0.11461826091991704, 0.16095410457305742, 0.16414469539879534, 0.00717025390847951, 0.05949404567196878, -0.3076553483226756, -0.15692439634211316, -0.2507899299642474, 0.1379647040794119, -0.16999391806468486, -0.21047257483876936, 0.4066120129056841, 0.044269046551488035, 0.21356958317385213, 0.12663712909673913, 0.23524864534820206, 0.06932382305542127, 0.04186031606445928, 0.18939901439592852, 0.10580719528142472, 0.1912409359404044, -0.04674650281694941, -0.12556626027237558, 0.05417472500543312, 0.1711296645943341]
|
1,803.05086
|
OPE inversion in Mellin space
|
The fundamental ingredients that build the observables in conformal field
theory are the spectrum of operators and the OPE coefficients, or equivalently,
the two- and three-point functions of the theory. Recently an inversion formula
solving the OPE coefficients by a convolution over the light-cone
double-discontinuities of the correlator has been found by Simon Caron-Huot.
Taking into account that the same OPE data determine the Mellin amplitude
representation of the correlator, motivate us to look for an analogous
inversion formula in Mellin space, which we develops partially on this paper.
|
hep-th
|
the fundamental ingredients that build the observables in conformal field theory are the spectrum of operators and the ope coefficients or equivalently the two and threepoint functions of the theory recently an inversion formula solving the ope coefficients by a convolution over the lightcone doublediscontinuities of the correlator has been found by simon caronhuot taking into account that the same ope data determine the mellin amplitude representation of the correlator motivate us to look for an analogous inversion formula in mellin space which we develops partially on this paper
|
[['the', 'fundamental', 'ingredients', 'that', 'build', 'the', 'observables', 'in', 'conformal', 'field', 'theory', 'are', 'the', 'spectrum', 'of', 'operators', 'and', 'the', 'ope', 'coefficients', 'or', 'equivalently', 'the', 'two', 'and', 'threepoint', 'functions', 'of', 'the', 'theory', 'recently', 'an', 'inversion', 'formula', 'solving', 'the', 'ope', 'coefficients', 'by', 'a', 'convolution', 'over', 'the', 'lightcone', 'doublediscontinuities', 'of', 'the', 'correlator', 'has', 'been', 'found', 'by', 'simon', 'caronhuot', 'taking', 'into', 'account', 'that', 'the', 'same', 'ope', 'data', 'determine', 'the', 'mellin', 'amplitude', 'representation', 'of', 'the', 'correlator', 'motivate', 'us', 'to', 'look', 'for', 'an', 'analogous', 'inversion', 'formula', 'in', 'mellin', 'space', 'which', 'we', 'develops', 'partially', 'on', 'this', 'paper']]
|
[-0.11076623074371707, 0.10033559257631582, -0.16115175128321757, 0.08287766278821933, -0.07501528547833335, -0.056193235409657726, -0.016881370238314212, 0.3050013377479362, -0.23501866818829018, -0.18556568393250927, 0.11870094765750268, -0.259848085983487, -0.16572645583073609, 0.1411261175486619, 0.021209654451178558, 0.056748586413133045, -0.006977604998444969, 0.02029053280553357, -0.13082128524018283, -0.22226977261545305, 0.35753837863872334, 0.01734902267344296, 0.2886143614940176, 0.08655269226371522, 0.09048766121188899, 0.07850258006510558, -0.09068209849911826, -0.05232221004850792, -0.09383978188353384, 0.15782405467788604, 0.22617568082006817, 0.08654363311837766, 0.17641917425631123, -0.45684927939014003, -0.17381784093396907, 0.07454316086791964, 0.1698589792358689, 0.08551805880878502, 0.035028682366828434, -0.28211409314958885, 0.04427993892882527, -0.17821788303130728, -0.14618016134905207, -0.13478395911145277, 0.01809047551201233, -0.07841555375753986, -0.30335893981497397, 0.05166238451651721, 0.04819097947752611, 0.0352424584667791, -0.0647166140949015, -0.13378616616616704, 0.015877297629644585, 0.1492287307390308, 0.0967010594163598, 0.06399844655640084, 0.04770605652116832, -0.15126487881273284, -0.13334028046070176, 0.31765712036708876, -0.059311861151152036, -0.21528849961363117, 0.053143760485743936, -0.21434933082623917, -0.16610916627211159, 0.0631593083777592, 0.128373285300437, 0.11249719574962827, -0.19844696576580068, 0.18119637070049066, -0.05111445279114626, 0.11058820921673694, 0.1132572061879645, 0.008566750001839617, 0.19863080874678085, 0.02495819702744484, 0.02253724756354297, 0.16987791937902907, -0.03927310652215965, -0.10069402249593457, -0.3434405030090023, -0.16597455854009074, -0.18706726915181868, 0.05361769638892094, -0.1420177498905766, -0.17042089693925597, 0.42821166753790085, 0.12445282031942705, 0.22974093256793407, 0.07593326056931718, 0.2864336743527515, 0.24442373181227595, 0.15717713651247323, 0.0469585614151914, 0.20031091147525745, 0.20261930490695787, 0.08188458120747039, -0.20797564527443188, -0.020113777689402923, 0.20467338370243934]
|
1,803.05087
|
Smoothing Spline Growth Curves With Covariates
|
We adapt the interactive spline model of Wahba to growth curves with
covariates. The smoothing spline formulation permits a non-parametric
representation of the growth curves. In the limit when the discretization error
is small relative to the estimation error, the resulting growth curve estimates
often depend only weakly on the number and locations of the knots. The
smoothness parameter is determined from the data by minimizing an empirical
estimate of the expected error. We show that the risk estimate of Craven and
Wahba is a weighted goodness of fit estimate. A modified loss estimate is
given, where $\sigma^2$ is replaced by its unbiased estimate.
|
stat.ME math.ST physics.data-an physics.plasm-ph stat.TH
|
we adapt the interactive spline model of wahba to growth curves with covariates the smoothing spline formulation permits a nonparametric representation of the growth curves in the limit when the discretization error is small relative to the estimation error the resulting growth curve estimates often depend only weakly on the number and locations of the knots the smoothness parameter is determined from the data by minimizing an empirical estimate of the expected error we show that the risk estimate of craven and wahba is a weighted goodness of fit estimate a modified loss estimate is given where sigma2 is replaced by its unbiased estimate
|
[['we', 'adapt', 'the', 'interactive', 'spline', 'model', 'of', 'wahba', 'to', 'growth', 'curves', 'with', 'covariates', 'the', 'smoothing', 'spline', 'formulation', 'permits', 'a', 'nonparametric', 'representation', 'of', 'the', 'growth', 'curves', 'in', 'the', 'limit', 'when', 'the', 'discretization', 'error', 'is', 'small', 'relative', 'to', 'the', 'estimation', 'error', 'the', 'resulting', 'growth', 'curve', 'estimates', 'often', 'depend', 'only', 'weakly', 'on', 'the', 'number', 'and', 'locations', 'of', 'the', 'knots', 'the', 'smoothness', 'parameter', 'is', 'determined', 'from', 'the', 'data', 'by', 'minimizing', 'an', 'empirical', 'estimate', 'of', 'the', 'expected', 'error', 'we', 'show', 'that', 'the', 'risk', 'estimate', 'of', 'craven', 'and', 'wahba', 'is', 'a', 'weighted', 'goodness', 'of', 'fit', 'estimate', 'a', 'modified', 'loss', 'estimate', 'is', 'given', 'where', 'sigma2', 'is', 'replaced', 'by', 'its', 'unbiased', 'estimate']]
|
[-0.05641318128730815, 0.034886761648102456, -0.12533437992589405, 0.12484051884026624, -0.07647397840180649, -0.10585140316442658, 0.057320431586748995, 0.34457009225241986, -0.27401016457364535, -0.30090720241423696, 0.1570609295774305, -0.27028646091303715, -0.11124635975899694, 0.201915967365494, -0.15976934567040119, 0.06827904334092566, 0.043966772043719314, 0.02731441046881418, -0.08618519271994256, -0.2945936973376844, 0.28863264053451043, 0.06349496156774247, 0.2557063599972305, -0.025979549328510005, 0.11366229375506429, 0.032330288753235854, -0.07230030495422678, -0.013023008377506183, -0.20258574338011107, 0.18183348479215056, 0.1588833756283678, 0.11546879023080692, 0.30510183101376664, -0.3208471002961652, -0.21207214284759873, 0.14703792230620122, 0.11639493337805526, 0.04690236705713547, 0.021395786023976352, -0.23512824483287448, 0.053906477123606376, -0.12840748796812618, -0.11731212068116292, -0.053210286367595054, -0.023244530490886133, 0.07590703371533891, -0.3638382511070141, 0.12377141025633766, 0.026594409851545955, 0.06698520800385338, -0.07879208473493166, -0.09879971519470788, -0.03932048049038993, 0.09585417520009706, 0.07700629209620484, 0.05570115650054784, 0.1075830908689218, -0.12289068310593183, -0.02775628465371063, 0.3230480019701645, -0.10372752906718793, -0.26447336828473805, 0.09731797450848927, -0.1440513806972796, -0.057827573300948225, 0.14957564259216619, 0.19570937684665507, 0.09014323874502085, -0.1251789871229658, 0.08701416286930908, -0.018996067819758676, 0.19177453947038606, 0.031544429841093145, -0.04187251393719075, 0.09238242850495645, 0.15534383008399835, 0.11345169164549308, 0.11486650410873923, -0.16052994157787628, -0.053188180891223825, -0.33918929528982306, -0.136527774509047, -0.2533652583459535, -0.010107351395373162, -0.19733804508191846, -0.219010661044964, 0.3761763477948709, 0.11450594843392117, 0.24367296804065028, 0.13534810345691556, 0.294180243052184, 0.16566585411783308, 0.02997064408219348, 0.08949469916898614, 0.21409589580546778, 0.12878688406467867, -0.043228783447725266, -0.21390862626419851, 0.17683364755178516, 0.10544769598681551]
|
1,803.05088
|
Observation of an Unusual Upward-going Cosmic-ray-like Event in the
Third Flight of ANITA
|
We report on an upward traveling, radio-detected cosmic-ray-like impulsive
event with characteristics closely matching an extensive air shower. This
event, observed in the third flight of the Antarctic Impulsive Transient
Antenna (ANITA), a NASA-sponsored long-duration balloon payload, is consistent
with a similar event reported in a previous flight. These events may be
produced by the atmospheric decay of an upward-propagating $\tau$-lepton
produced by a $\nu_{\tau}$ interaction, although their relatively steep arrival
angles create tension with the standard model (SM) neutrino cross section. Each
of the two events have $a~posteriori$ background estimates of $\lesssim
10^{-2}$ events. If these are generated by $\tau$-lepton decay, then either the
charged-current $\nu_{\tau}$ cross section is suppressed at EeV energies, or
the events arise at moments when the peak flux of a transient neutrino source
was much larger than the typical expected cosmogenic background neutrinos.
|
astro-ph.HE
|
we report on an upward traveling radiodetected cosmicraylike impulsive event with characteristics closely matching an extensive air shower this event observed in the third flight of the antarctic impulsive transient antenna anita a nasasponsored longduration balloon payload is consistent with a similar event reported in a previous flight these events may be produced by the atmospheric decay of an upwardpropagating taulepton produced by a nu_tau interaction although their relatively steep arrival angles create tension with the standard model sm neutrino cross section each of the two events have aposteriori background estimates of lesssim 102 events if these are generated by taulepton decay then either the chargedcurrent nu_tau cross section is suppressed at eev energies or the events arise at moments when the peak flux of a transient neutrino source was much larger than the typical expected cosmogenic background neutrinos
|
[['we', 'report', 'on', 'an', 'upward', 'traveling', 'radiodetected', 'cosmicraylike', 'impulsive', 'event', 'with', 'characteristics', 'closely', 'matching', 'an', 'extensive', 'air', 'shower', 'this', 'event', 'observed', 'in', 'the', 'third', 'flight', 'of', 'the', 'antarctic', 'impulsive', 'transient', 'antenna', 'anita', 'a', 'nasasponsored', 'longduration', 'balloon', 'payload', 'is', 'consistent', 'with', 'a', 'similar', 'event', 'reported', 'in', 'a', 'previous', 'flight', 'these', 'events', 'may', 'be', 'produced', 'by', 'the', 'atmospheric', 'decay', 'of', 'an', 'upwardpropagating', 'taulepton', 'produced', 'by', 'a', 'nu_tau', 'interaction', 'although', 'their', 'relatively', 'steep', 'arrival', 'angles', 'create', 'tension', 'with', 'the', 'standard', 'model', 'sm', 'neutrino', 'cross', 'section', 'each', 'of', 'the', 'two', 'events', 'have', 'aposteriori', 'background', 'estimates', 'of', 'lesssim', '102', 'events', 'if', 'these', 'are', 'generated', 'by', 'taulepton', 'decay', 'then', 'either', 'the', 'chargedcurrent', 'nu_tau', 'cross', 'section', 'is', 'suppressed', 'at', 'eev', 'energies', 'or', 'the', 'events', 'arise', 'at', 'moments', 'when', 'the', 'peak', 'flux', 'of', 'a', 'transient', 'neutrino', 'source', 'was', 'much', 'larger', 'than', 'the', 'typical', 'expected', 'cosmogenic', 'background', 'neutrinos']]
|
[-0.10288905433338622, 0.31496812804655655, 0.0035801229247042193, 0.1763739802451143, -0.046723351165976215, -0.06612016973963035, -0.010237818712071665, 0.38094504026399145, -0.17141559249991417, -0.3500061823912235, 0.03163961251772454, -0.391183202519365, -0.02065004833528529, 0.2100165109656265, 0.025014829258366986, 0.024032548606476706, 0.15099951394739142, 0.025425622014470562, -0.021071589788071055, -0.19949616013985613, 0.1945215287260657, 0.18423129354968018, 0.23022655482349944, 0.017859909855558173, 0.09536293572771525, -0.04241619429355352, -0.09769958365865497, -0.06450750090964678, -0.09375782239426306, -0.0033308297017778177, 0.19886056942050345, 0.09289659022529057, 0.09084677424929712, -0.4163265269033719, -0.18275105025352695, 0.14487390687851154, 0.11590648413149883, 0.010848305220386701, -0.0675503288208426, -0.38025391506760015, 0.08417386128074714, -0.21629722069516993, -0.0960074992955028, 0.11567568386047808, -0.0147137685165997, 0.006738661444219558, -0.2889930277765877, 0.07439465916283644, -0.017053870598117457, 0.04523032660042678, -0.022737391446687558, -0.13421929827081444, -0.00840640850905059, 0.028023560475022365, 0.18472166977353746, 0.03585478383710311, 0.16862678495438202, -0.09324578747897327, -0.14921774495514514, 0.3744288944382814, -0.05776722291773404, -0.06765350162227085, 0.12750571088163534, -0.20447379802657373, -0.1045033686820281, 0.2985087741854722, 0.19245151981400946, 0.07515988703580924, -0.20739496552498854, -0.0075621455604129514, 0.020934095221531134, 0.16151387158248143, 0.09087529081338341, -0.02182687520668707, 0.2721436184466533, 0.20022669129505538, 0.09076042273048096, 0.033075901550625494, -0.2187013376986716, 0.03233941429399251, -0.3504589913628887, -0.07126746254136274, -0.07790854270063827, 0.09172573939735151, -0.04467364907263866, -0.1612545696628766, 0.379348731673984, 0.08803327920580067, 0.20139728766892642, 0.01077082105136166, 0.32193033591560694, 0.09395912742458176, 0.01899022516116257, 0.06448190290467355, 0.3303748815914319, 0.08558164167460865, 0.1524774654906756, -0.18764816846637783, 0.13047130311673938, 0.027273748518791104]
|
1,803.05089
|
Energy Dissipation in the Upper Atmospheres of Trappist-1 Planets
|
We present a method to quantify the upper-limit of the energy transmitted
from the intense stellar wind to the upper atmospheres of three of the
Trappist-1 planets (e, f, and g). We use a formalism that treats the system as
two electromagnetic regions, where the efficiency of the energy transmission
between one region (the stellar wind at the planetary orbits) to the other (the
planetary ionospheres) depends on the relation between the conductances and
impedances of the two regions. Since the energy flux of the stellar wind is
very high at these planetary orbits, we find that for the case of high
transmission efficiency (when the conductances and impedances are close in
magnitude), the energy dissipation in the upper planetary atmospheres is also
very large. On average, the Ohmic energy can reach $0.5-1~W/m^2$, about 1\% of
the stellar irradiance and 5-15 times the EUV irradiance. Here, using constant
values for the ionospheric conductance, we demonstrate that the stellar wind
energy could potentially drive large atmospheric heating in terrestrial
planets, as well as in hot jupiters. More detailed calculations are needed to
assess the ionospheric conductance and to determine more accurately the amount
of heating the stellar wind can drive in close-orbit planets.
|
astro-ph.EP
|
we present a method to quantify the upperlimit of the energy transmitted from the intense stellar wind to the upper atmospheres of three of the trappist1 planets e f and g we use a formalism that treats the system as two electromagnetic regions where the efficiency of the energy transmission between one region the stellar wind at the planetary orbits to the other the planetary ionospheres depends on the relation between the conductances and impedances of the two regions since the energy flux of the stellar wind is very high at these planetary orbits we find that for the case of high transmission efficiency when the conductances and impedances are close in magnitude the energy dissipation in the upper planetary atmospheres is also very large on average the ohmic energy can reach 051wm2 about 1 of the stellar irradiance and 515 times the euv irradiance here using constant values for the ionospheric conductance we demonstrate that the stellar wind energy could potentially drive large atmospheric heating in terrestrial planets as well as in hot jupiters more detailed calculations are needed to assess the ionospheric conductance and to determine more accurately the amount of heating the stellar wind can drive in closeorbit planets
|
[['we', 'present', 'a', 'method', 'to', 'quantify', 'the', 'upperlimit', 'of', 'the', 'energy', 'transmitted', 'from', 'the', 'intense', 'stellar', 'wind', 'to', 'the', 'upper', 'atmospheres', 'of', 'three', 'of', 'the', 'trappist1', 'planets', 'e', 'f', 'and', 'g', 'we', 'use', 'a', 'formalism', 'that', 'treats', 'the', 'system', 'as', 'two', 'electromagnetic', 'regions', 'where', 'the', 'efficiency', 'of', 'the', 'energy', 'transmission', 'between', 'one', 'region', 'the', 'stellar', 'wind', 'at', 'the', 'planetary', 'orbits', 'to', 'the', 'other', 'the', 'planetary', 'ionospheres', 'depends', 'on', 'the', 'relation', 'between', 'the', 'conductances', 'and', 'impedances', 'of', 'the', 'two', 'regions', 'since', 'the', 'energy', 'flux', 'of', 'the', 'stellar', 'wind', 'is', 'very', 'high', 'at', 'these', 'planetary', 'orbits', 'we', 'find', 'that', 'for', 'the', 'case', 'of', 'high', 'transmission', 'efficiency', 'when', 'the', 'conductances', 'and', 'impedances', 'are', 'close', 'in', 'magnitude', 'the', 'energy', 'dissipation', 'in', 'the', 'upper', 'planetary', 'atmospheres', 'is', 'also', 'very', 'large', 'on', 'average', 'the', 'ohmic', 'energy', 'can', 'reach', '051wm2', 'about', '1', 'of', 'the', 'stellar', 'irradiance', 'and', '515', 'times', 'the', 'euv', 'irradiance', 'here', 'using', 'constant', 'values', 'for', 'the', 'ionospheric', 'conductance', 'we', 'demonstrate', 'that', 'the', 'stellar', 'wind', 'energy', 'could', 'potentially', 'drive', 'large', 'atmospheric', 'heating', 'in', 'terrestrial', 'planets', 'as', 'well', 'as', 'in', 'hot', 'jupiters', 'more', 'detailed', 'calculations', 'are', 'needed', 'to', 'assess', 'the', 'ionospheric', 'conductance', 'and', 'to', 'determine', 'more', 'accurately', 'the', 'amount', 'of', 'heating', 'the', 'stellar', 'wind', 'can', 'drive', 'in', 'closeorbit', 'planets']]
|
[-0.12805012436189794, 0.1765802613498912, -0.011403092400655058, 0.10036488361911505, -0.04353491859379501, -0.031034537651274927, 0.04921427113699046, 0.35719399247318506, -0.19408179477635604, -0.39118863925782604, 0.044670148977786255, -0.2749110647657914, -0.07201077263635486, 0.2723386968516128, -0.05367524843487485, 0.02836864995337219, 0.08744449253872834, -0.019199043957155142, -0.01157460695414095, -0.21656750419422688, 0.288402664106784, 0.10494695232708508, 0.11753253280347334, 0.07988364834324527, 0.04505773320497565, -0.10380795900014911, -0.0016204569192223288, -0.05742893514885979, -0.1518900632847489, 0.062028582629502116, 0.23143832356001792, 0.08340617676904953, 0.21023371444079117, -0.45293842012929125, -0.23669909268840036, 0.05254001975457986, 0.12700442099869622, 0.026192576755347908, 0.007131312265314523, -0.18517724938102215, 0.05580028061249956, -0.18720062837857215, -0.11650992191364219, 0.036657527376392586, 0.0419020326987641, 0.04992111386564463, -0.2924386077463182, 0.07303944903884005, 0.016748875370874668, 0.0987414568135227, -0.1304176740617079, -0.09644150484378788, -0.1258515181791371, 0.13394895574238397, 0.04176679148167298, -0.01788644759860168, 0.19651923524169482, -0.12362292075798434, 0.026048554621859274, 0.39328608519179903, -0.10135118397235389, -0.10834257270380929, 0.22994369697706096, -0.25467964914159397, -0.07863817856976049, 0.14772079289608187, 0.19435366887636296, 0.09743890655806187, -0.14039366749245313, 0.005077568578721482, -0.007113089128044105, 0.16091370672469413, 0.07553812296625542, 0.051760678566454804, 0.3189035479190171, 0.12167398495581094, 0.09923456986179918, 0.08434820013260932, -0.23215549483904568, -0.032804716109710544, -0.22051586861495132, -0.11662557883990946, -0.15357520162771962, 0.06260822276209495, -0.11809487229538039, -0.14701217130308425, 0.41636143109543405, 0.20466289027195553, 0.17685325428917634, 0.02080191250494334, 0.3642213420139681, 0.16005433450478468, 0.041482059807465665, 0.1492403421912398, 0.32700623403678636, 0.16243568780966364, 0.11202065139286109, -0.302238979987309, 0.08581655837227103, -0.0029746386400928988]
|
1,803.0509
|
Secret Key Generation from Channel Noise with the Help of a Common Key
|
Information-theoretically secure communications are possible when channel
noise is usable and when the channel has an intrinsic characteristic that a
legitimate receiver (Bob) can use the noise more advantageously than an
eavesdropper (Eve). This report deals with the case in which the channel does
not have such an intrinsic characteristic. Here, we use a pre-shared common key
as a tool that extrinsically makes Bob more advantageous than Eve. This method
uses error-correcting code in addition to the common key and noise, and manages
the three components in random-number transmission. Secret keys are generated
from noise, and messages are encrypted with the secret keys in a one-time pad
manner. As a result, information leaks meaningful to Eve are restricted to the
parity-check symbols for the random numbers. It is possible to derive the
candidates of the common key from the parity check symbols, and the security of
this method is quantified in terms of the amount of computations needed for an
exhaustive search of the candidates, where we evaluate the security by assuming
that all parity check symbols leak to Eve without bit errors. Noise contributes
to not only generating secret keys but also enhancing the security because the
candidates of the common key increase with it.
|
cs.CR
|
informationtheoretically secure communications are possible when channel noise is usable and when the channel has an intrinsic characteristic that a legitimate receiver bob can use the noise more advantageously than an eavesdropper eve this report deals with the case in which the channel does not have such an intrinsic characteristic here we use a preshared common key as a tool that extrinsically makes bob more advantageous than eve this method uses errorcorrecting code in addition to the common key and noise and manages the three components in randomnumber transmission secret keys are generated from noise and messages are encrypted with the secret keys in a onetime pad manner as a result information leaks meaningful to eve are restricted to the paritycheck symbols for the random numbers it is possible to derive the candidates of the common key from the parity check symbols and the security of this method is quantified in terms of the amount of computations needed for an exhaustive search of the candidates where we evaluate the security by assuming that all parity check symbols leak to eve without bit errors noise contributes to not only generating secret keys but also enhancing the security because the candidates of the common key increase with it
|
[['informationtheoretically', 'secure', 'communications', 'are', 'possible', 'when', 'channel', 'noise', 'is', 'usable', 'and', 'when', 'the', 'channel', 'has', 'an', 'intrinsic', 'characteristic', 'that', 'a', 'legitimate', 'receiver', 'bob', 'can', 'use', 'the', 'noise', 'more', 'advantageously', 'than', 'an', 'eavesdropper', 'eve', 'this', 'report', 'deals', 'with', 'the', 'case', 'in', 'which', 'the', 'channel', 'does', 'not', 'have', 'such', 'an', 'intrinsic', 'characteristic', 'here', 'we', 'use', 'a', 'preshared', 'common', 'key', 'as', 'a', 'tool', 'that', 'extrinsically', 'makes', 'bob', 'more', 'advantageous', 'than', 'eve', 'this', 'method', 'uses', 'errorcorrecting', 'code', 'in', 'addition', 'to', 'the', 'common', 'key', 'and', 'noise', 'and', 'manages', 'the', 'three', 'components', 'in', 'randomnumber', 'transmission', 'secret', 'keys', 'are', 'generated', 'from', 'noise', 'and', 'messages', 'are', 'encrypted', 'with', 'the', 'secret', 'keys', 'in', 'a', 'onetime', 'pad', 'manner', 'as', 'a', 'result', 'information', 'leaks', 'meaningful', 'to', 'eve', 'are', 'restricted', 'to', 'the', 'paritycheck', 'symbols', 'for', 'the', 'random', 'numbers', 'it', 'is', 'possible', 'to', 'derive', 'the', 'candidates', 'of', 'the', 'common', 'key', 'from', 'the', 'parity', 'check', 'symbols', 'and', 'the', 'security', 'of', 'this', 'method', 'is', 'quantified', 'in', 'terms', 'of', 'the', 'amount', 'of', 'computations', 'needed', 'for', 'an', 'exhaustive', 'search', 'of', 'the', 'candidates', 'where', 'we', 'evaluate', 'the', 'security', 'by', 'assuming', 'that', 'all', 'parity', 'check', 'symbols', 'leak', 'to', 'eve', 'without', 'bit', 'errors', 'noise', 'contributes', 'to', 'not', 'only', 'generating', 'secret', 'keys', 'but', 'also', 'enhancing', 'the', 'security', 'because', 'the', 'candidates', 'of', 'the', 'common', 'key', 'increase', 'with', 'it']]
|
[-0.18703607924834112, 0.06072448995625555, -0.0763662453555475, 0.09057589940755295, -0.04718347573969332, -0.29874857770306174, 0.10320437470342493, 0.3437087538909818, -0.2887687060193077, -0.3033035562545495, 0.12065610227127586, -0.2835009373900779, -0.11401875781698392, 0.18245917564321273, -0.15933864263962338, 0.09019174394242972, 0.013264518034490712, 0.07074136881031168, -0.013699246764870233, -0.30925504394549225, 0.3272969033230024, 0.11690860338287555, 0.26730938057993875, -0.015673146792235377, 0.06634257077827181, 0.02441329032282155, -0.05943176753943881, -0.10121154317898491, -0.06338746427471192, 0.07624414710110976, 0.28767942436473465, 0.174256377059738, 0.26846921347190167, -0.39047302978872817, -0.19497318812013034, 0.1291493744243533, 0.14881765372707573, 0.17599890336071625, -0.0483441169214609, -0.2757297867301002, 0.14491138294185466, -0.18631531886679564, -0.026557522971698454, -0.05503835802608468, -0.03508561390714304, 0.003134388654058781, -0.3126723525313281, -0.005699244464744217, 0.05005380273480149, 0.042143788342409345, 0.05486998028795515, -0.06492982027392147, 0.010947770538549978, 0.23310413438226638, 0.025914174531668693, 0.0186679213216248, 0.10375233330465491, -0.1166935493913239, -0.10145133545224383, 0.3571070313851521, -0.02090334274212138, -0.1952092896534347, 0.14065345479441055, -0.0889476314560031, -0.08653379356866088, 0.14860178887373904, 0.1398837828123716, 0.0724660197211581, -0.1620365940815672, -0.007894767332173324, -0.048920852222561255, 0.2919024723645264, 0.06946714322797014, 0.17232376759537288, 0.17346343469893044, 0.06795975256222979, 0.06897469066295776, 0.15175260195070064, -0.11194920661018311, -0.07422111454098802, -0.2981750812218751, -0.20165993086993694, -0.22963491856861967, 0.04295368096353237, -0.06172609959526419, -0.09497078587255865, 0.3504723948969063, 0.21744220183249022, 0.1281349892445893, 0.02433474210500084, 0.42313198904389315, 0.04416549734282985, 0.09145935497346144, 0.14998191141170783, 0.19183735865466658, 0.11593830935290825, 0.06495892615973027, -0.1431346598247437, 0.16755088833974474, -0.030963141471147537]
|
1,803.05091
|
Structural Controllability of a Consensus Network with Multiple Leaders
|
This paper examines the structural controllability for a group of agents,
called followers, connected to each other based on the consensus law under
commands of multiple leaders, which are agents with superior capabilities, over
a fixed communication topology. It is proved that the graph-theoretic
sufficient and necessary condition for the set of followers to be structurally
controllable under the leaders' commands is leader-follower connectivity of the
associated graph topology. This shrinks to graph connectivity for the case of
solo leader. In the approach, we explicitly put into account the dependence
among the entries of the system matrices for a consensus network using the
linear parameterization technique introduced in [1].
|
cs.SY
|
this paper examines the structural controllability for a group of agents called followers connected to each other based on the consensus law under commands of multiple leaders which are agents with superior capabilities over a fixed communication topology it is proved that the graphtheoretic sufficient and necessary condition for the set of followers to be structurally controllable under the leaders commands is leaderfollower connectivity of the associated graph topology this shrinks to graph connectivity for the case of solo leader in the approach we explicitly put into account the dependence among the entries of the system matrices for a consensus network using the linear parameterization technique introduced in 1
|
[['this', 'paper', 'examines', 'the', 'structural', 'controllability', 'for', 'a', 'group', 'of', 'agents', 'called', 'followers', 'connected', 'to', 'each', 'other', 'based', 'on', 'the', 'consensus', 'law', 'under', 'commands', 'of', 'multiple', 'leaders', 'which', 'are', 'agents', 'with', 'superior', 'capabilities', 'over', 'a', 'fixed', 'communication', 'topology', 'it', 'is', 'proved', 'that', 'the', 'graphtheoretic', 'sufficient', 'and', 'necessary', 'condition', 'for', 'the', 'set', 'of', 'followers', 'to', 'be', 'structurally', 'controllable', 'under', 'the', 'leaders', 'commands', 'is', 'leaderfollower', 'connectivity', 'of', 'the', 'associated', 'graph', 'topology', 'this', 'shrinks', 'to', 'graph', 'connectivity', 'for', 'the', 'case', 'of', 'solo', 'leader', 'in', 'the', 'approach', 'we', 'explicitly', 'put', 'into', 'account', 'the', 'dependence', 'among', 'the', 'entries', 'of', 'the', 'system', 'matrices', 'for', 'a', 'consensus', 'network', 'using', 'the', 'linear', 'parameterization', 'technique', 'introduced', 'in', '1']]
|
[-0.20080220030296012, 0.05704379350869754, -0.07730281187665708, 0.023190478486683937, -0.11207460229490124, -0.18254634586308116, 0.09124613766731489, 0.37548991935242204, -0.29329418427729553, -0.27903254159540364, 0.07447955992559843, -0.2399445545235905, -0.20320151454059904, 0.11059545464984594, -0.10398572749125028, 0.04592809598431538, 0.06192142744078685, 0.11553255769577937, 0.035352541426401755, -0.2751186033053999, 0.31703753375080884, 0.027261005218969573, 0.27424638949061203, 0.0053932268392516795, 0.1309099431200927, 0.03318613679938599, 0.010621732735254486, 0.07358609486281564, -0.11464541714560772, 0.1138290854997574, 0.25765505741316175, 0.1695793395810718, 0.3290278527954029, -0.4421071419065152, -0.148142357134696, 0.14197965267908955, 0.08903664987483019, 0.05378369843788069, 0.012035862789403886, -0.3280493928773175, 0.15152437008336322, -0.17024380156616553, -0.0700066544557708, -0.04416795962686659, 0.012682219025243175, 0.059491572935783534, -0.3033193631969187, -0.01314645281933043, 0.07738803491133069, 0.06311800090356841, -0.061194844022735, -0.05740054473259546, -0.0203572880015324, 0.18502463569967162, 0.01423560296091328, -0.027894547854234047, 0.11693397937812458, -0.1108784005857594, -0.12429900446088575, 0.38125986935263245, 0.03081065572909327, -0.22092764327193637, 0.15583261790463204, -0.07019521887285994, -0.18149582319892943, 0.08716925116973596, 0.20698121933420316, 0.07262791983427858, -0.18153507043735698, 0.05953706982449432, -0.07552092649691969, 0.14875729215852573, 0.04021417451680664, 0.012137686919181719, 0.11626734806293058, 0.18388291215951288, 0.211000340913824, 0.1248664771278235, 0.01516165908312835, -0.10617579619502734, -0.26385976476283074, -0.10150633561809402, -0.19190047999177504, 0.004303195436886691, -0.10430003394607194, -0.13901803490423828, 0.4637178451745608, 0.12873218354657975, 0.1632245805439189, 0.11152065336520553, 0.2780413305346316, 0.06303572606088684, 0.056003321679907105, 0.1257446601628027, 0.17729954672721002, 0.14714635195159312, 0.08740657899387762, -0.19850704633981126, 0.1489890133577544, 0.07516961217934795]
|
1,803.05092
|
Strong enhancement of the Edelstein effect in f-electron systems
|
The Edelstein effect occurring in systems with broken inversion symmetry
generates a spin polarization when an electric field is applied, which is most
advantageous in spintronics applications. Unfortunately, it became apparent
that this kind of magnetoelectric effect is very small in semiconductors. We
here demonstrate that correlation effects can strongly enhance the
magnetoelectric effect. Particularly, we observe a strong enhancement of the
Edelstein effect in $f$-electron systems close to the coherence temperature,
where the $f$-electrons change their character from localized to itinerant. We
furthermore show that this enhancement can be explained by a coupling between
the conduction electrons and the still localized $f$-electrons.
|
cond-mat.str-el
|
the edelstein effect occurring in systems with broken inversion symmetry generates a spin polarization when an electric field is applied which is most advantageous in spintronics applications unfortunately it became apparent that this kind of magnetoelectric effect is very small in semiconductors we here demonstrate that correlation effects can strongly enhance the magnetoelectric effect particularly we observe a strong enhancement of the edelstein effect in felectron systems close to the coherence temperature where the felectrons change their character from localized to itinerant we furthermore show that this enhancement can be explained by a coupling between the conduction electrons and the still localized felectrons
|
[['the', 'edelstein', 'effect', 'occurring', 'in', 'systems', 'with', 'broken', 'inversion', 'symmetry', 'generates', 'a', 'spin', 'polarization', 'when', 'an', 'electric', 'field', 'is', 'applied', 'which', 'is', 'most', 'advantageous', 'in', 'spintronics', 'applications', 'unfortunately', 'it', 'became', 'apparent', 'that', 'this', 'kind', 'of', 'magnetoelectric', 'effect', 'is', 'very', 'small', 'in', 'semiconductors', 'we', 'here', 'demonstrate', 'that', 'correlation', 'effects', 'can', 'strongly', 'enhance', 'the', 'magnetoelectric', 'effect', 'particularly', 'we', 'observe', 'a', 'strong', 'enhancement', 'of', 'the', 'edelstein', 'effect', 'in', 'felectron', 'systems', 'close', 'to', 'the', 'coherence', 'temperature', 'where', 'the', 'felectrons', 'change', 'their', 'character', 'from', 'localized', 'to', 'itinerant', 'we', 'furthermore', 'show', 'that', 'this', 'enhancement', 'can', 'be', 'explained', 'by', 'a', 'coupling', 'between', 'the', 'conduction', 'electrons', 'and', 'the', 'still', 'localized', 'felectrons']]
|
[-0.18808360375210786, 0.23016335841088026, -0.03913555955695151, 0.10113313026812144, -0.0919120932332448, -0.13917006444167887, 0.03831123936134707, 0.392434905563454, -0.31151917061058676, -0.2766538087179143, 0.009476981663769021, -0.29744621296187196, -0.21130183496449179, 0.18748216151974154, 0.003512000192625864, -0.07800751258686944, -0.024785528985729204, -0.03476713838290821, -0.09144557421366928, -0.190596111663572, 0.2556968369403655, 0.03350068022072026, 0.3243108793722411, 0.15410178739722202, 0.02727547343888148, 0.0005592338071720114, 0.14151212748465608, 0.06750990258692538, -0.003393176362188013, 0.061637191583958535, 0.26647910316140183, -0.08647711131070714, 0.23822849120004375, -0.4325241470998786, -0.20425957132688072, 0.051801480425214305, 0.14395726650492152, 0.18932839211650662, -0.11601336431707644, -0.2701126994040695, 0.04645735888348585, -0.15450339415788794, -0.0915705210719149, -0.0969460592514754, 0.035973489660887245, -0.05746735464691103, -0.29135291824497067, 0.12441781414582313, 0.11082891146516771, 0.0779650546429516, -0.03889379784853641, -0.07669992539669993, -0.04538880399365014, 0.0520439531546181, 0.10361414811646258, 0.032789300313418354, 0.14084972686346764, -0.13165368890566118, -0.1078114520788907, 0.3969371868568717, -0.07393167897136611, -0.1440557904125562, 0.17469116086501954, -0.21458641205941445, -0.07415412786389583, 0.14433642062675028, 0.15425483055087258, 0.10786499766614831, -0.11708788063054457, 0.08105100729916408, 0.011257717069419264, 0.1857291433544269, -0.0053023058848762974, 0.12675498975260022, 0.28197132406340353, 0.16279760229365123, 0.04730734750809311, 0.1678065548626055, -0.11159337733338759, -0.03629636101750205, -0.205898499329918, -0.14531131868377256, -0.2563283541561918, 0.07873043535476171, -0.029996696064328927, -0.16321825538987964, 0.38400749613992075, 0.2325202329626795, 0.1631207953148422, -0.09309869520343587, 0.2501576190579285, 0.15915258948745442, 0.11044199353093011, 0.03532370699352576, 0.3150813695748599, 0.15803124101773736, 0.1041900909650456, -0.34427474650952206, 0.11362248870037786, -0.031776889670387054]
|
1,803.05093
|
Graph Reconstruction by Discrete Morse Theory
|
Recovering hidden graph-like structures from potentially noisy data is a
fundamental task in modern data analysis. Recently, a persistence-guided
discrete Morse-based framework to extract a geometric graph from
low-dimensional data has become popular. However, to date, there is very
limited theoretical understanding of this framework in terms of graph
reconstruction. This paper makes a first step towards closing this gap.
Specifically, first, leveraging existing theoretical understanding of
persistence-guided discrete Morse cancellation, we provide a simplified version
of the existing discrete Morse-based graph reconstruction algorithm. We then
introduce a simple and natural noise model and show that the aforementioned
framework can correctly reconstruct a graph under this noise model, in the
sense that it has the same loop structure as the hidden ground-truth graph, and
is also geometrically close. We also provide some experimental results for our
simplified graph-reconstruction algorithm.
|
cs.CG
|
recovering hidden graphlike structures from potentially noisy data is a fundamental task in modern data analysis recently a persistenceguided discrete morsebased framework to extract a geometric graph from lowdimensional data has become popular however to date there is very limited theoretical understanding of this framework in terms of graph reconstruction this paper makes a first step towards closing this gap specifically first leveraging existing theoretical understanding of persistenceguided discrete morse cancellation we provide a simplified version of the existing discrete morsebased graph reconstruction algorithm we then introduce a simple and natural noise model and show that the aforementioned framework can correctly reconstruct a graph under this noise model in the sense that it has the same loop structure as the hidden groundtruth graph and is also geometrically close we also provide some experimental results for our simplified graphreconstruction algorithm
|
[['recovering', 'hidden', 'graphlike', 'structures', 'from', 'potentially', 'noisy', 'data', 'is', 'a', 'fundamental', 'task', 'in', 'modern', 'data', 'analysis', 'recently', 'a', 'persistenceguided', 'discrete', 'morsebased', 'framework', 'to', 'extract', 'a', 'geometric', 'graph', 'from', 'lowdimensional', 'data', 'has', 'become', 'popular', 'however', 'to', 'date', 'there', 'is', 'very', 'limited', 'theoretical', 'understanding', 'of', 'this', 'framework', 'in', 'terms', 'of', 'graph', 'reconstruction', 'this', 'paper', 'makes', 'a', 'first', 'step', 'towards', 'closing', 'this', 'gap', 'specifically', 'first', 'leveraging', 'existing', 'theoretical', 'understanding', 'of', 'persistenceguided', 'discrete', 'morse', 'cancellation', 'we', 'provide', 'a', 'simplified', 'version', 'of', 'the', 'existing', 'discrete', 'morsebased', 'graph', 'reconstruction', 'algorithm', 'we', 'then', 'introduce', 'a', 'simple', 'and', 'natural', 'noise', 'model', 'and', 'show', 'that', 'the', 'aforementioned', 'framework', 'can', 'correctly', 'reconstruct', 'a', 'graph', 'under', 'this', 'noise', 'model', 'in', 'the', 'sense', 'that', 'it', 'has', 'the', 'same', 'loop', 'structure', 'as', 'the', 'hidden', 'groundtruth', 'graph', 'and', 'is', 'also', 'geometrically', 'close', 'we', 'also', 'provide', 'some', 'experimental', 'results', 'for', 'our', 'simplified', 'graphreconstruction', 'algorithm']]
|
[-0.05642494885598434, 0.016032025559436974, -0.13100557671790358, 0.10075409449341555, -0.14258817142681846, -0.14499890448789654, 0.05310452986011671, 0.39817245700049086, -0.3072817054257464, -0.33676140850284764, 0.11216675311434708, -0.22620621792721882, -0.23998079605143405, 0.16697785183578842, -0.1261101832483495, 0.0759940022053614, 0.12618368175645261, 0.06199015654083133, -0.038465817650057264, -0.1928173585626759, 0.29526595505295017, 0.05247490091854012, 0.2902553490182357, 0.049435511998112885, 0.09766830175697157, -0.0071700728470598584, -0.04878232501961513, 0.020697514742001225, -0.10796556865447635, 0.1674271469593479, 0.2771942639834623, 0.14500675829294235, 0.2765278516132246, -0.42525633560048776, -0.24842186935885407, 0.12221768958521868, 0.1323707720843394, 0.15440688131953964, -0.08809766785672574, -0.2823743480657325, 0.13082176562634978, -0.12791028094769857, -0.03527051468602201, -0.12189709076504987, -0.017061293625564716, -0.07280196609938128, -0.26491987785374843, 0.03741875652757251, 0.09591246905750525, 0.03400014329409755, -0.013863305258043388, -0.07386000789945195, 0.030379027168183075, 0.14264170416116492, 0.008044863182272929, 0.06552779841334072, 0.056984378320317886, -0.11060927127863267, -0.1377727983853043, 0.389012839672948, -0.04034222760011873, -0.20112806928184218, 0.17429051655275163, -0.07449526680848881, -0.22580937176609217, 0.10818455337525916, 0.178567043890909, 0.08645450317304332, -0.16951945312225622, 0.10459449655704771, -0.10802192304894995, 0.16029217249519234, 0.009090912125226277, 0.021657533944521877, 0.155568438898355, 0.2441274669758086, 0.08068187961201947, 0.164196827344652, -0.07068277060735359, -0.08814818574004431, -0.29162650934503925, -0.11823289627348309, -0.20859566123968462, 0.005394328419473579, -0.09912856919449882, -0.17621747493299086, 0.432380360738833, 0.18954019226592533, 0.22805724052865226, 0.08659979875203623, 0.35810145630271856, 0.07742377890121024, 0.019762017847553118, 0.09528540066441646, 0.1824888544369562, 0.12342006752072875, 0.07933683202428432, -0.11847610128765453, 0.06567762157386307, 0.05360210668156618]
|
1,803.05094
|
Symbol-level precoding is symbol-perturbed ZF when energy Efficiency is
sought
|
This paper considers symbol-level precoding (SLP) for multiuser
multiple-input single-output (MISO) downlink. SLP is a nonlinear precoding
scheme that utilizes symbol constellation structures. It has been shown that
SLP can outperform the popular linear beamforming scheme. In this work we
reveal a hidden connection between SLP and linear beamforming. We show that
under an energy minimization design, SLP is equivalent to a zero-forcing (ZF)
beamforming scheme with perturbations on symbols. This identity gives new
insights and they are discussed in the paper. As a side contribution, this work
also develops a symbol error probability (SEP)-constrained SLP design
formulation under quadrature amplitude modulation (QAM) constellations.
|
cs.IT math.IT
|
this paper considers symbollevel precoding slp for multiuser multipleinput singleoutput miso downlink slp is a nonlinear precoding scheme that utilizes symbol constellation structures it has been shown that slp can outperform the popular linear beamforming scheme in this work we reveal a hidden connection between slp and linear beamforming we show that under an energy minimization design slp is equivalent to a zeroforcing zf beamforming scheme with perturbations on symbols this identity gives new insights and they are discussed in the paper as a side contribution this work also develops a symbol error probability sepconstrained slp design formulation under quadrature amplitude modulation qam constellations
|
[['this', 'paper', 'considers', 'symbollevel', 'precoding', 'slp', 'for', 'multiuser', 'multipleinput', 'singleoutput', 'miso', 'downlink', 'slp', 'is', 'a', 'nonlinear', 'precoding', 'scheme', 'that', 'utilizes', 'symbol', 'constellation', 'structures', 'it', 'has', 'been', 'shown', 'that', 'slp', 'can', 'outperform', 'the', 'popular', 'linear', 'beamforming', 'scheme', 'in', 'this', 'work', 'we', 'reveal', 'a', 'hidden', 'connection', 'between', 'slp', 'and', 'linear', 'beamforming', 'we', 'show', 'that', 'under', 'an', 'energy', 'minimization', 'design', 'slp', 'is', 'equivalent', 'to', 'a', 'zeroforcing', 'zf', 'beamforming', 'scheme', 'with', 'perturbations', 'on', 'symbols', 'this', 'identity', 'gives', 'new', 'insights', 'and', 'they', 'are', 'discussed', 'in', 'the', 'paper', 'as', 'a', 'side', 'contribution', 'this', 'work', 'also', 'develops', 'a', 'symbol', 'error', 'probability', 'sepconstrained', 'slp', 'design', 'formulation', 'under', 'quadrature', 'amplitude', 'modulation', 'qam', 'constellations']]
|
[-0.3275606015378392, -0.02963437917922031, -0.05802939104332218, 0.03189698844985331, -0.1310929919330819, -0.29388571993077117, 0.06792843543915349, 0.38971738402451417, -0.2946107673088034, -0.17650867920386995, 0.08691867836751044, -0.21277377194752103, -0.3200672604505298, 0.10006409935490454, -0.17522159251339228, 0.0693568037732423, 0.035059749212079834, 0.002267357004914903, -0.11922627190937225, -0.27144043266373963, 0.2640665907557439, 0.15375027033382827, 0.4214587575909727, -0.06462274651038596, 0.11889100708609936, 0.01135720660485038, 0.010754365704555824, -0.053163113088337974, -0.08024695978574263, 0.07588617105118352, 0.4064658958677065, 0.26788177312514516, 0.26498989727420424, -0.34965119665506683, -0.25194449279710507, 0.06210768768491531, 0.19508647681801644, 0.10557456700655732, -0.07246529538460185, -0.20008378269747623, 0.16117340350722514, -0.2222649054511369, 0.04118356088321041, 0.02732962987485152, -0.11980363279942749, 0.006651063458722772, -0.43317583073111415, 0.017302861506994182, 0.05837977269790994, 0.055214396478988015, -0.031104491670950522, -0.18695803334172453, 0.11950549564676956, -0.013921944257233617, 0.025545349719852787, 0.02118584512760049, -0.0013317568951006075, 0.024485203997543968, -0.10112761170829385, 0.35111617283371177, -0.03235052826190458, -0.3249902207205452, 0.054086653407192924, -0.0554819925444074, -0.08198838374685967, 0.16859354651578276, 0.2623725480951586, 0.040836093373126485, -0.16619014921733766, 0.0784990660545588, -0.0977630480373441, 0.2507434348548645, 0.15349032826613165, 0.15395308320311088, 0.13993463929272393, 0.18817855937641512, 0.21767708617579012, 0.15986774467582843, -0.14582533444259857, -0.11290406877428148, -0.24455937258537533, -0.11875492105604087, -0.16989141640262406, -0.021870345700062015, -0.04977356104007289, -0.06787499597887238, 0.340416311825835, 0.12268166271607997, 0.053636313605945084, 0.16298961216240254, 0.429123151432542, 0.16330175954244977, 0.03857695709154444, 0.13588611489089514, 0.1770667698125816, 0.20130783547330827, 0.13498989566798927, -0.24300897297747795, 0.006680242887933205, 0.051079017532880876]
|
1,803.05095
|
OGLE-2017-BLG-1522: A giant planet around a brown dwarf located in the
Galactic bulge
|
We report the discovery of a giant planet in the OGLE-2017-BLG-1522
microlensing event. The planetary perturbations were clearly identified by
high-cadence survey experiments despite the relatively short event timescale of
$t_{\rm E} \sim 7.5$ days. The Einstein radius is unusually small, $\theta_{\rm
E} = 0.065\,$mas, implying that the lens system either has very low mass or
lies much closer to the microlensed source than the Sun, or both. A Bayesian
analysis yields component masses $(M_{\rm host}, M_{\rm
planet})=(46_{-25}^{+79}, 0.75_{-0.40}^{+1.26})~M_{\rm J}$ and source-lens
distance $D_{\rm LS} = 0.99_{-0.54}^{+0.91}~{\rm kpc}$, implying that this is a
brown-dwarf/Jupiter system that probably lies in the Galactic bulge, a location
that is also consistent with the relatively low lens-source relative proper
motion $\mu = 3.2 \pm 0.5~{\rm mas}~{\rm yr^{-1}}$. The projected
companion-host separation is $0.59_{-0.11}^{+0.12}~{\rm AU}$, indicating that
the planet is placed beyond the snow line of the host, i.e., $a_{sl} \sim
0.12~{\rm AU}$. Planet formation scenarios combined with the small
companion-host mass ratio $q \sim 0.016$ and separation suggest that the
companion could be the first discovery of a giant planet that formed in a
protoplanetary disk around a brown dwarf host.
|
astro-ph.EP astro-ph.SR
|
we report the discovery of a giant planet in the ogle2017blg1522 microlensing event the planetary perturbations were clearly identified by highcadence survey experiments despite the relatively short event timescale of t_rm e sim 75 days the einstein radius is unusually small theta_rm e 0065mas implying that the lens system either has very low mass or lies much closer to the microlensed source than the sun or both a bayesian analysis yields component masses m_rm host m_rm planet46_2579 075_040126m_rm j and sourcelens distance d_rm ls 099_054091rm kpc implying that this is a browndwarfjupiter system that probably lies in the galactic bulge a location that is also consistent with the relatively low lenssource relative proper motion mu 32 pm 05rm masrm yr1 the projected companionhost separation is 059_011012rm au indicating that the planet is placed beyond the snow line of the host ie a_sl sim 012rm au planet formation scenarios combined with the small companionhost mass ratio q sim 0016 and separation suggest that the companion could be the first discovery of a giant planet that formed in a protoplanetary disk around a brown dwarf host
|
[['we', 'report', 'the', 'discovery', 'of', 'a', 'giant', 'planet', 'in', 'the', 'ogle2017blg1522', 'microlensing', 'event', 'the', 'planetary', 'perturbations', 'were', 'clearly', 'identified', 'by', 'highcadence', 'survey', 'experiments', 'despite', 'the', 'relatively', 'short', 'event', 'timescale', 'of', 't_rm', 'e', 'sim', '75', 'days', 'the', 'einstein', 'radius', 'is', 'unusually', 'small', 'theta_rm', 'e', '0065mas', 'implying', 'that', 'the', 'lens', 'system', 'either', 'has', 'very', 'low', 'mass', 'or', 'lies', 'much', 'closer', 'to', 'the', 'microlensed', 'source', 'than', 'the', 'sun', 'or', 'both', 'a', 'bayesian', 'analysis', 'yields', 'component', 'masses', 'm_rm', 'host', 'm_rm', 'planet46_2579', '075_040126m_rm', 'j', 'and', 'sourcelens', 'distance', 'd_rm', 'ls', '099_054091rm', 'kpc', 'implying', 'that', 'this', 'is', 'a', 'browndwarfjupiter', 'system', 'that', 'probably', 'lies', 'in', 'the', 'galactic', 'bulge', 'a', 'location', 'that', 'is', 'also', 'consistent', 'with', 'the', 'relatively', 'low', 'lenssource', 'relative', 'proper', 'motion', 'mu', '32', 'pm', '05rm', 'masrm', 'yr1', 'the', 'projected', 'companionhost', 'separation', 'is', '059_011012rm', 'au', 'indicating', 'that', 'the', 'planet', 'is', 'placed', 'beyond', 'the', 'snow', 'line', 'of', 'the', 'host', 'ie', 'a_sl', 'sim', '012rm', 'au', 'planet', 'formation', 'scenarios', 'combined', 'with', 'the', 'small', 'companionhost', 'mass', 'ratio', 'q', 'sim', '0016', 'and', 'separation', 'suggest', 'that', 'the', 'companion', 'could', 'be', 'the', 'first', 'discovery', 'of', 'a', 'giant', 'planet', 'that', 'formed', 'in', 'a', 'protoplanetary', 'disk', 'around', 'a', 'brown', 'dwarf', 'host']]
|
[-0.15914393650462566, 0.12283439891896931, -0.052048428141723106, 0.06109188627819978, -0.09710832674445657, -0.10527769910003253, 0.05869889608189716, 0.3428706739329349, -0.14774711413629943, -0.36071863796793474, 0.07357158752666039, -0.29694422379683305, -0.017084569863627774, 0.17241735937663139, -0.056872003909731864, -0.061445485874168614, 0.13174080628820165, -0.047764266212339285, -0.07723137315515281, -0.19407708491567038, 0.22331012231771344, 0.0859355888497821, 0.07582225497515403, 0.011185565589806117, 0.06063034175007241, -0.07117766586505929, 0.005337395273822512, -0.04907647447692136, -0.1849271506309101, 0.006474481403596152, 0.17934401836376151, 0.10552733326804335, 0.21969270337330923, -0.26245423073822494, -0.15734981170902818, 0.06457492320845692, 0.18860220646822437, -0.01394215092690409, -0.035886340974540694, -0.2836106590082143, 0.12919706716379784, -0.20874596828605327, -0.17716966906436166, 0.11979873312767438, 0.15255137225665616, -0.021229393690782417, -0.24367899170124346, 0.1753464561890703, 0.07617708958711214, 0.10522701182352684, -0.08675592893860855, -0.14566775168276438, -0.08102844662617072, -0.01680162036659901, 0.029656580529283563, 0.14690542268687806, 0.2118566857952109, -0.06174339259459011, 0.0044299444982171645, 0.41770113119066266, -0.09905393340792257, 0.008516118603911103, 0.23754838760679134, -0.2377292183984208, -0.11009580208683166, 0.16734458036565533, 0.15322663887709084, 0.15124480733595325, -0.14216087429158095, 0.028248029389736994, -0.012626698184403259, 0.26806359305862065, 0.06545538323310514, 0.024089525578876347, 0.42153900841055014, 0.15625339790114523, 0.06653583256296267, -0.002338133132122036, -0.29676262294810457, -0.045508112011235315, -0.2020355586467658, -0.09789337618322516, -0.170644611432638, 0.08961385858013679, -0.15595049782518672, -0.07832660768075851, 0.28318567198864314, 0.1131551575775937, 0.27625808872856034, 0.044051095123611925, 0.2640372496242977, 0.07887590637083276, 0.13508138243677253, 0.11973226034887514, 0.3596542109814236, 0.15703860483405913, 0.06826955970050504, -0.24112844432961975, 0.07583946914617289, -0.020702646312561666]
|
1,803.05096
|
Markov spectra for modular billiards
|
We introduce some analogues of the Markov spectrum defined in terms of
modular billiards and consider the problem of characterizing that part of the
spectrum below the lowest limit point.
|
math.NT math.DS
|
we introduce some analogues of the markov spectrum defined in terms of modular billiards and consider the problem of characterizing that part of the spectrum below the lowest limit point
|
[['we', 'introduce', 'some', 'analogues', 'of', 'the', 'markov', 'spectrum', 'defined', 'in', 'terms', 'of', 'modular', 'billiards', 'and', 'consider', 'the', 'problem', 'of', 'characterizing', 'that', 'part', 'of', 'the', 'spectrum', 'below', 'the', 'lowest', 'limit', 'point']]
|
[-0.17336164208051438, 0.08720921521695951, -0.026383354514837264, 0.07770737012227376, 0.018387915939092635, -0.026897562481462956, 0.024856053354839484, 0.26095399012168247, -0.31069859632601343, -0.2529585080842177, 0.142298424426311, -0.27555261543020604, -0.16872245768706004, 0.20213972944766284, -0.0495044381202509, 0.04261726097514232, -0.002685851976275444, 0.05851103773651024, -0.06825863597138475, -0.14870829128970703, 0.45170923074086505, 0.04578949883580208, 0.2125960000635435, 0.04577601237930746, 0.09256432112306356, 0.050495244065920514, 0.01737233850484093, -0.05292236573683719, -0.1568418265332487, 0.1376671668103275, 0.2190435010318955, 0.0713493583103021, 0.22158471383154393, -0.346125159971416, -0.2107155849225819, 0.18870136899252732, 0.15917002543186148, 0.011407681143221755, 0.03809529192124804, -0.24911341698219377, 0.09075882525648922, -0.14682489912956953, -0.19631454600797346, -0.018717856022218864, -0.045169878068069616, 0.003495536930859089, -0.15638283947482706, 0.06981565927465756, 0.12141611700256666, 0.09137441189959646, -0.10221225551019113, -0.12392960085223119, 0.00448944711436828, 0.15422573134613535, 0.010110931311889242, -0.0720961345359683, 0.09862350630573928, -0.15116079524159431, -0.13408492766320707, 0.4155985104540984, -0.12688421520094076, -0.17271321651836236, 0.11477245731900136, -0.21476350246618192, -0.19617266257603963, 0.09958026645084223, 0.14625899706346293, 0.14330653563762705, -0.10373069299384952, 0.19306785653461703, -0.06314571673671404, 0.07762413826324822, 0.07576283387218913, 0.1048750752893587, 0.19037078693509102, 0.11077361696710189, 0.10032405561457078, 0.2338670420460403, -0.045553078937033815, -0.11691927608723442, -0.34888273403048514, -0.14107923184831936, -0.2084540185208122, 0.02902047554962337, -0.03173051763587864, -0.2469197825839122, 0.43154120845720173, 0.14617149643599986, 0.2551119767439862, 0.13742490153138837, 0.20320750263830026, 0.2204432101920247, -0.011541217844933272, 0.07692720689810813, 0.18212239055137616, 0.15071692802011966, 0.04778332121980687, -0.18719091123590867, -0.01867958214133978, 0.09987157941795885]
|
1,803.05097
|
Thurston norms of tunnel number-one manifolds
|
The Thurston norm of a 3-manifold measures the complexity of surfaces
representing two-dimensional homology classes. We study the possible unit balls
of Thurston norms of 3-manifolds $M$ with $b_1(M) = 2$, and whose fundamental
groups admit presentations with two generators and one relator. We show that
even among this special class, there are 3-manifolds such that the unit ball of
the Thurston norm has arbitrarily many faces.
|
math.GT
|
the thurston norm of a 3manifold measures the complexity of surfaces representing twodimensional homology classes we study the possible unit balls of thurston norms of 3manifolds m with b_1m 2 and whose fundamental groups admit presentations with two generators and one relator we show that even among this special class there are 3manifolds such that the unit ball of the thurston norm has arbitrarily many faces
|
[['the', 'thurston', 'norm', 'of', 'a', '3manifold', 'measures', 'the', 'complexity', 'of', 'surfaces', 'representing', 'twodimensional', 'homology', 'classes', 'we', 'study', 'the', 'possible', 'unit', 'balls', 'of', 'thurston', 'norms', 'of', '3manifolds', 'm', 'with', 'b_1m', '2', 'and', 'whose', 'fundamental', 'groups', 'admit', 'presentations', 'with', 'two', 'generators', 'and', 'one', 'relator', 'we', 'show', 'that', 'even', 'among', 'this', 'special', 'class', 'there', 'are', '3manifolds', 'such', 'that', 'the', 'unit', 'ball', 'of', 'the', 'thurston', 'norm', 'has', 'arbitrarily', 'many', 'faces']]
|
[-0.20237629318779166, 0.12181743752267776, -0.04324396337809352, 0.07120755443765754, -0.023730849240426764, -0.174142272966547, -0.03922689537284896, 0.3897871776963725, -0.3106566628046108, -0.26753747621268936, 0.1307314565708635, -0.3230133692233005, -0.154875177505539, 0.19261316301399897, -0.21587938116951563, 0.04756876791008946, 0.10652083858396068, 0.10048640008564248, -0.0872463004242022, -0.3259693525280013, 0.44942459177620936, -0.0670427802639703, 0.1637840631954146, 0.06899543216621334, 0.15492674639222748, -0.0812530685075079, 0.004530683731321584, 0.05819126716673826, -0.20772185204237537, 0.17395202853632244, 0.2887958927136479, 0.06310588876349908, 0.23069929365407338, -0.38139113761258847, -0.1477052938496468, 0.2779348330346472, 0.05892021445359922, -0.05223158306696198, -0.06639310934891303, -0.2279044484973631, 0.046673825469263124, -0.08551306630287206, -0.13196311191175925, -0.04548974656217703, 0.06350641639084753, 0.0407204817818252, -0.12693488180185808, -0.04074704862961715, 0.11572601671584627, 0.10055981370422876, -0.06444322633218359, -0.13326359636178522, -0.010223552880978043, 0.20532081112491363, 0.08934033819417836, 0.09631041138588141, 0.0918699864608546, -0.03905591517016574, -0.14554217343472622, 0.393904345053615, -0.0020519309310298977, -0.2975240599251155, 0.18225428480549122, -0.21860901365113078, -0.2116100794960265, 0.13641798755358622, 0.08860608465461568, 0.10940850603704651, -0.01697819959372282, 0.1880752574493685, -0.15991255440608118, 0.08443043375684117, 0.1610517465072035, 0.017713116940506028, 0.10867035922340372, 0.09362721878499018, 0.1367216998434301, 0.16049754777641007, 0.0096238717563789, -0.032123329034110415, -0.33263540006891795, -0.25474828557167767, -0.18569815264676104, 0.13020150498910385, -0.15537572732489824, -0.2224112622983133, 0.36817848688047944, -0.08737500407027476, 0.1420012414667078, 0.1715516218012481, 0.20071026080139828, -0.04257321126307502, 0.12116782497050184, 0.15412315436300228, 0.10300112637747644, 0.15634667101513708, -0.07005109941361076, -0.11260054713453758, -0.05955203269805872, 0.24632000475134136]
|
1,803.05098
|
Algorithmic Social Intervention
|
Social and behavioral interventions are a critical tool for governments and
communities to tackle deep-rooted societal challenges such as homelessness,
disease, and poverty. However, real-world interventions are almost always
plagued by limited resources and limited data, which creates a computational
challenge: how can we use algorithmic techniques to enhance the targeting and
delivery of social and behavioral interventions? The goal of my thesis is to
provide a unified study of such questions, collectively considered under the
name "algorithmic social intervention". This proposal introduces algorithmic
social intervention as a distinct area with characteristic technical
challenges, presents my published research in the context of these challenges,
and outlines open problems for future work. A common technical theme is
decision making under uncertainty: how can we find actions which will impact a
social system in desirable ways under limitations of knowledge and resources?
The primary application area for my work thus far is public health, e.g. HIV or
tuberculosis prevention. For instance, I have developed a series of algorithms
which optimize social network interventions for HIV prevention. Two of these
algorithms have been pilot-tested in collaboration with LA-area service
providers for homeless youth, with preliminary results showing substantial
improvement over status-quo approaches. My work also spans other topics in
infectious disease prevention and underlying algorithmic questions in robust
and risk-aware submodular optimization.
|
cs.AI cs.CY cs.SI
|
social and behavioral interventions are a critical tool for governments and communities to tackle deeprooted societal challenges such as homelessness disease and poverty however realworld interventions are almost always plagued by limited resources and limited data which creates a computational challenge how can we use algorithmic techniques to enhance the targeting and delivery of social and behavioral interventions the goal of my thesis is to provide a unified study of such questions collectively considered under the name algorithmic social intervention this proposal introduces algorithmic social intervention as a distinct area with characteristic technical challenges presents my published research in the context of these challenges and outlines open problems for future work a common technical theme is decision making under uncertainty how can we find actions which will impact a social system in desirable ways under limitations of knowledge and resources the primary application area for my work thus far is public health eg hiv or tuberculosis prevention for instance i have developed a series of algorithms which optimize social network interventions for hiv prevention two of these algorithms have been pilottested in collaboration with laarea service providers for homeless youth with preliminary results showing substantial improvement over statusquo approaches my work also spans other topics in infectious disease prevention and underlying algorithmic questions in robust and riskaware submodular optimization
|
[['social', 'and', 'behavioral', 'interventions', 'are', 'a', 'critical', 'tool', 'for', 'governments', 'and', 'communities', 'to', 'tackle', 'deeprooted', 'societal', 'challenges', 'such', 'as', 'homelessness', 'disease', 'and', 'poverty', 'however', 'realworld', 'interventions', 'are', 'almost', 'always', 'plagued', 'by', 'limited', 'resources', 'and', 'limited', 'data', 'which', 'creates', 'a', 'computational', 'challenge', 'how', 'can', 'we', 'use', 'algorithmic', 'techniques', 'to', 'enhance', 'the', 'targeting', 'and', 'delivery', 'of', 'social', 'and', 'behavioral', 'interventions', 'the', 'goal', 'of', 'my', 'thesis', 'is', 'to', 'provide', 'a', 'unified', 'study', 'of', 'such', 'questions', 'collectively', 'considered', 'under', 'the', 'name', 'algorithmic', 'social', 'intervention', 'this', 'proposal', 'introduces', 'algorithmic', 'social', 'intervention', 'as', 'a', 'distinct', 'area', 'with', 'characteristic', 'technical', 'challenges', 'presents', 'my', 'published', 'research', 'in', 'the', 'context', 'of', 'these', 'challenges', 'and', 'outlines', 'open', 'problems', 'for', 'future', 'work', 'a', 'common', 'technical', 'theme', 'is', 'decision', 'making', 'under', 'uncertainty', 'how', 'can', 'we', 'find', 'actions', 'which', 'will', 'impact', 'a', 'social', 'system', 'in', 'desirable', 'ways', 'under', 'limitations', 'of', 'knowledge', 'and', 'resources', 'the', 'primary', 'application', 'area', 'for', 'my', 'work', 'thus', 'far', 'is', 'public', 'health', 'eg', 'hiv', 'or', 'tuberculosis', 'prevention', 'for', 'instance', 'i', 'have', 'developed', 'a', 'series', 'of', 'algorithms', 'which', 'optimize', 'social', 'network', 'interventions', 'for', 'hiv', 'prevention', 'two', 'of', 'these', 'algorithms', 'have', 'been', 'pilottested', 'in', 'collaboration', 'with', 'laarea', 'service', 'providers', 'for', 'homeless', 'youth', 'with', 'preliminary', 'results', 'showing', 'substantial', 'improvement', 'over', 'statusquo', 'approaches', 'my', 'work', 'also', 'spans', 'other', 'topics', 'in', 'infectious', 'disease', 'prevention', 'and', 'underlying', 'algorithmic', 'questions', 'in', 'robust', 'and', 'riskaware', 'submodular', 'optimization']]
|
[-0.08330396965493701, 0.034700002645738935, -0.05003824560529625, 0.09647768023552605, -0.15328462197432458, -0.18614183694481246, 0.10757366189741731, 0.40865359614144, -0.22506274513831612, -0.33104689955960287, 0.13672832368973917, -0.2915712916120578, -0.2288599329783843, 0.19449896758426546, -0.2059285887452658, 0.0717231813916928, 0.096065383844672, 0.005031130168118089, 0.045365146054427055, -0.3381885904647101, 0.30776723466324296, 0.04969385938830502, 0.3165284317278642, 0.1396777522152028, 0.05688745624864311, -5.4202825775206915e-05, -0.08875653042548126, 0.01718345616594352, -0.13214256641471625, 0.17093578083354824, 0.44638406466435177, 0.2867300888225179, 0.4619890696064393, -0.42920473427189865, -0.23166802684317261, 0.08913883823613863, 0.1402824518818935, 0.0950916617757894, -0.038032703962410944, -0.2967840719384395, 0.05057700883950137, -0.19607303875137963, -0.10746818286268049, -0.07630685975127059, -0.0021435417844334506, 0.013860991658655763, -0.2419665678262642, 0.018876763484371003, 0.010410784829830674, 0.16166861058740709, -0.02413376079430194, -0.1458021431122177, 0.055737476252997936, 0.20667283475980558, 0.1282154799166483, 0.01142589758635254, 0.19098913695176092, -0.17328840838358975, -0.20481690502090355, 0.3763690741157614, 0.05274623147563897, -0.1335119276156237, 0.1855353495545475, -0.015240753538400141, -0.2201639754860769, 0.04465625665315817, 0.24421120625072962, 0.045523530991387465, -0.21542659693307453, 0.016113487078190228, 0.025211140446897064, 0.13257653643387854, 0.04970140947020411, 0.013827377561187964, 0.1883567293981425, 0.23761039043557808, 0.10990994329422643, 0.07662492977001399, -0.005272464084220097, -0.1106595414044756, -0.2040506773306409, -0.1242564625282716, -0.09106193101548586, 0.05328114977329626, -0.036438774638718065, -0.1274713456785212, 0.38875942548934356, 0.20132005368981698, 0.06287798976478991, 0.038894453281772746, 0.30482946581331677, -0.03614536241503767, 0.04417345372204613, 0.06786500395239171, 0.1335154811788376, -0.01254943189879639, 0.16693653886459664, -0.16563733346805337, 0.16894127341515217, -0.05452173629621138]
|
1,803.05099
|
Noisy Adaptive Group Testing: Bounds and Algorithms
|
The group testing problem consists of determining a small set of defective
items from a larger set of items based on a number of possibly-noisy tests, and
is relevant in applications such as medical testing, communication protocols,
pattern matching, and many more. One of the defining features of the group
testing problem is the distinction between the non-adaptive and adaptive
settings: In the non-adaptive case, all tests must be designed in advance,
whereas in the adaptive case, each test can be designed based on the previous
outcomes. While tight information-theoretic limits and near-optimal practical
algorithms are known for the adaptive setting in the absence of noise,
surprisingly little is known in the noisy adaptive setting. In this paper, we
address this gap by providing information-theoretic achievability and converse
bounds under various noise models, as well as a slightly weaker achievability
bound for a computationally efficient variant. These bounds are shown to be
tight or near-tight in a broad range of scaling regimes, particularly at low
noise levels. The algorithms used for the achievability results have the
notable feature of only using two or three stages of adaptivity.
|
cs.IT math.IT math.PR
|
the group testing problem consists of determining a small set of defective items from a larger set of items based on a number of possiblynoisy tests and is relevant in applications such as medical testing communication protocols pattern matching and many more one of the defining features of the group testing problem is the distinction between the nonadaptive and adaptive settings in the nonadaptive case all tests must be designed in advance whereas in the adaptive case each test can be designed based on the previous outcomes while tight informationtheoretic limits and nearoptimal practical algorithms are known for the adaptive setting in the absence of noise surprisingly little is known in the noisy adaptive setting in this paper we address this gap by providing informationtheoretic achievability and converse bounds under various noise models as well as a slightly weaker achievability bound for a computationally efficient variant these bounds are shown to be tight or neartight in a broad range of scaling regimes particularly at low noise levels the algorithms used for the achievability results have the notable feature of only using two or three stages of adaptivity
|
[['the', 'group', 'testing', 'problem', 'consists', 'of', 'determining', 'a', 'small', 'set', 'of', 'defective', 'items', 'from', 'a', 'larger', 'set', 'of', 'items', 'based', 'on', 'a', 'number', 'of', 'possiblynoisy', 'tests', 'and', 'is', 'relevant', 'in', 'applications', 'such', 'as', 'medical', 'testing', 'communication', 'protocols', 'pattern', 'matching', 'and', 'many', 'more', 'one', 'of', 'the', 'defining', 'features', 'of', 'the', 'group', 'testing', 'problem', 'is', 'the', 'distinction', 'between', 'the', 'nonadaptive', 'and', 'adaptive', 'settings', 'in', 'the', 'nonadaptive', 'case', 'all', 'tests', 'must', 'be', 'designed', 'in', 'advance', 'whereas', 'in', 'the', 'adaptive', 'case', 'each', 'test', 'can', 'be', 'designed', 'based', 'on', 'the', 'previous', 'outcomes', 'while', 'tight', 'informationtheoretic', 'limits', 'and', 'nearoptimal', 'practical', 'algorithms', 'are', 'known', 'for', 'the', 'adaptive', 'setting', 'in', 'the', 'absence', 'of', 'noise', 'surprisingly', 'little', 'is', 'known', 'in', 'the', 'noisy', 'adaptive', 'setting', 'in', 'this', 'paper', 'we', 'address', 'this', 'gap', 'by', 'providing', 'informationtheoretic', 'achievability', 'and', 'converse', 'bounds', 'under', 'various', 'noise', 'models', 'as', 'well', 'as', 'a', 'slightly', 'weaker', 'achievability', 'bound', 'for', 'a', 'computationally', 'efficient', 'variant', 'these', 'bounds', 'are', 'shown', 'to', 'be', 'tight', 'or', 'neartight', 'in', 'a', 'broad', 'range', 'of', 'scaling', 'regimes', 'particularly', 'at', 'low', 'noise', 'levels', 'the', 'algorithms', 'used', 'for', 'the', 'achievability', 'results', 'have', 'the', 'notable', 'feature', 'of', 'only', 'using', 'two', 'or', 'three', 'stages', 'of', 'adaptivity']]
|
[-0.12172129719207685, 0.05345684740634795, -0.05312624187158641, 0.09478677419998173, -0.046667214807233105, -0.22214571279298354, 0.0948895285292829, 0.36642573888523766, -0.23869186975762888, -0.33420126068015255, 0.1491917236307536, -0.21059398628240553, -0.15839718827747448, 0.24443371393260926, -0.11142442834198034, 0.08772290534069462, 0.029461260946933885, 0.03370501294041112, -0.0397819336678993, -0.2807724710850556, 0.30890163153870615, 0.08076288366705299, 0.30193709626152954, 0.014345728310002815, 0.05179204432273744, 0.00048734540600449806, -0.03690810703925328, 0.043466324103064835, -0.10434105083651801, 0.10161930499022566, 0.3126530773084029, 0.15624133897544715, 0.33431507448755926, -0.3820565156939049, -0.18329805659095166, 0.11680108692368082, 0.1432464088373367, 0.11748873943998729, -0.06118347521807801, -0.250834818455636, 0.09104303700689187, -0.12163577113370662, -0.02090628295185505, -0.04175001670986975, -0.02925628970967986, 0.00951770908338198, -0.34238944914923, 0.05177244480188575, 0.06947233197492077, 0.06546498934227613, -0.0279729861180268, -0.14175541060025332, 0.090469938761089, 0.15875191466822738, 0.018807697816506548, -0.027215098646739797, 0.10095055828181405, -0.12581512683962462, -0.13588310863261902, 0.39142861563001347, -0.02828787390195254, -0.20838827752227826, 0.2286502279751804, -0.09434895691842402, -0.1700770498074401, 0.10450972376080851, 0.18836898590508167, 0.13749745419068682, -0.13942708660190004, 0.07270558933794413, -0.07806048530995124, 0.16026344709348694, 0.08151151346523434, 0.1066531099939859, 0.1195982571666865, 0.1957097831457573, 0.11355434606128412, 0.15197840931772766, -0.060073409654495494, -0.07093428724610637, -0.28346241983054304, -0.11454035969412264, -0.20387617849446935, -0.02865901436176031, -0.14195631846486056, -0.12654013868958955, 0.34108254440148833, 0.15778948593088576, 0.17878389871749345, 0.09192723759840574, 0.3284818501341888, 0.0720791496927612, 0.042596481249777864, 0.10583801401318402, 0.2357363874313011, 0.09894005713423573, 0.024723537122299993, -0.15152897153479067, 0.1364758161011763, 0.036259432763902734]
|
1,803.051
|
The Topological Period-Index Problem over 8-Complexes, II
|
We complete the study of the topological period-index problem over 8
dimensional finite CW complexes started in a preceding paper. More precisely,
we determine the sharp upper bound of the index of a topological Brauer class
$\alpha\in H^3(X;\mathbb{Z})$, where $X$ is of the homotopy type of an 8
dimensional finite CW complex and the period of $\alpha$ is divisible by 4.
|
math.AT
|
we complete the study of the topological periodindex problem over 8 dimensional finite cw complexes started in a preceding paper more precisely we determine the sharp upper bound of the index of a topological brauer class alphain h3xmathbbz where x is of the homotopy type of an 8 dimensional finite cw complex and the period of alpha is divisible by 4
|
[['we', 'complete', 'the', 'study', 'of', 'the', 'topological', 'periodindex', 'problem', 'over', '8', 'dimensional', 'finite', 'cw', 'complexes', 'started', 'in', 'a', 'preceding', 'paper', 'more', 'precisely', 'we', 'determine', 'the', 'sharp', 'upper', 'bound', 'of', 'the', 'index', 'of', 'a', 'topological', 'brauer', 'class', 'alphain', 'h3xmathbbz', 'where', 'x', 'is', 'of', 'the', 'homotopy', 'type', 'of', 'an', '8', 'dimensional', 'finite', 'cw', 'complex', 'and', 'the', 'period', 'of', 'alpha', 'is', 'divisible', 'by', '4']]
|
[-0.17693767511324646, 0.17209559807306504, -0.04599039963601778, 0.03875689115181255, -0.04604246804956347, -0.12482320450556775, 0.049822205120775225, 0.3397720466445511, -0.2696847919529925, -0.23271524218531947, 0.08508063516152713, -0.21280515072867273, -0.13002709353653094, 0.198964332730975, -0.10264214199657241, -0.016569284629076718, -0.044208620116114615, 0.11644760050500433, -0.07676548475089172, -0.29798789403090875, 0.3692939347432305, -0.057408239630361395, 0.2069751366747975, 0.038198066766684254, 0.05159791096424063, 0.002903216662283133, -0.030149522098266365, -0.0038151771451036135, -0.2302661699669746, 0.15154487479982587, 0.2579125109439095, 0.0312276362751921, 0.22869474353889624, -0.3308690130400161, -0.1875765161278347, 0.18916574912145734, 0.09883644960355013, 0.022750131529755892, -0.0006077982846666904, -0.23724925282100837, 0.19180537248030305, -0.19962320829120775, -0.18200251817858468, 0.03675590396548311, 0.10451995568970839, -0.0060316669483048225, -0.252104067010805, 0.014823998619491855, 0.12404116544251641, 0.13626797998974022, -0.06175919619078438, -0.06909122011857108, -0.06563766885859271, 0.08051635666439931, -0.056033993054491776, 0.026130644144723193, -0.0015946254522229235, -0.09126682207303626, -0.1536615276709199, 0.31714818235486747, -0.05644951864766578, -0.12225750675424933, 0.1673789265177523, -0.1979220275223876, -0.15480562544738252, 0.20581673383712767, 0.11837613405465769, 0.2131300815070669, -0.033202767744660376, 0.22430571578346037, -0.07707576178945601, 0.18399997058634956, 0.11970872789000471, -0.02745647745517393, 0.10105191839393228, 0.1601939834576721, 0.14256446063906575, 0.177372405740122, -0.06140614332786451, -0.029266318151106436, -0.33374149875404935, -0.223959933653047, -0.1659765358432196, 0.17024219445108127, -0.12051685152085459, -0.1656259841984138, 0.43759092738231026, 0.04126012093038298, 0.16611796574046214, 0.042264292885859804, 0.1939100658055395, 0.12043709692855677, -0.048576678080280544, 0.026105825851360957, 0.10981509623428186, 0.19888842832685139, 0.03024923808213013, -0.12562719889295598, -0.05784126649765919, 0.18168669540124635]
|
1,803.05101
|
Model-Agnostic Private Learning via Stability
|
We design differentially private learning algorithms that are agnostic to the
learning model. Our algorithms are interactive in nature, i.e., instead of
outputting a model based on the training data, they provide predictions for a
set of $m$ feature vectors that arrive online. We show that, for the feature
vectors on which an ensemble of models (trained on random disjoint subsets of a
dataset) makes consistent predictions, there is almost no-cost of privacy in
generating accurate predictions for those feature vectors. To that end, we
provide a novel coupling of the distance to instability framework with the
sparse vector technique. We provide algorithms with formal privacy and utility
guarantees for both binary/multi-class classification, and soft-label
classification. For binary classification in the standard (agnostic) PAC model,
we show how to bootstrap from our privately generated predictions to construct
a computationally efficient private learner that outputs a final accurate
hypothesis. Our construction - to the best of our knowledge - is the first
computationally efficient construction for a label-private learner. We prove
sample complexity upper bounds for this setting. As in non-private sample
complexity bounds, the only relevant property of the given concept class is its
VC dimension. For soft-label classification, our techniques are based on
exploiting the stability properties of traditional learning algorithms, like
stochastic gradient descent (SGD). We provide a new technique to boost the
average-case stability properties of learning algorithms to strong (worst-case)
stability properties, and then exploit them to obtain private classification
algorithms. In the process, we also show that a large class of SGD methods
satisfy average-case stability properties, in contrast to a smaller class of
SGD methods that are uniformly stable as shown in prior work.
|
cs.LG
|
we design differentially private learning algorithms that are agnostic to the learning model our algorithms are interactive in nature ie instead of outputting a model based on the training data they provide predictions for a set of m feature vectors that arrive online we show that for the feature vectors on which an ensemble of models trained on random disjoint subsets of a dataset makes consistent predictions there is almost nocost of privacy in generating accurate predictions for those feature vectors to that end we provide a novel coupling of the distance to instability framework with the sparse vector technique we provide algorithms with formal privacy and utility guarantees for both binarymulticlass classification and softlabel classification for binary classification in the standard agnostic pac model we show how to bootstrap from our privately generated predictions to construct a computationally efficient private learner that outputs a final accurate hypothesis our construction to the best of our knowledge is the first computationally efficient construction for a labelprivate learner we prove sample complexity upper bounds for this setting as in nonprivate sample complexity bounds the only relevant property of the given concept class is its vc dimension for softlabel classification our techniques are based on exploiting the stability properties of traditional learning algorithms like stochastic gradient descent sgd we provide a new technique to boost the averagecase stability properties of learning algorithms to strong worstcase stability properties and then exploit them to obtain private classification algorithms in the process we also show that a large class of sgd methods satisfy averagecase stability properties in contrast to a smaller class of sgd methods that are uniformly stable as shown in prior work
|
[['we', 'design', 'differentially', 'private', 'learning', 'algorithms', 'that', 'are', 'agnostic', 'to', 'the', 'learning', 'model', 'our', 'algorithms', 'are', 'interactive', 'in', 'nature', 'ie', 'instead', 'of', 'outputting', 'a', 'model', 'based', 'on', 'the', 'training', 'data', 'they', 'provide', 'predictions', 'for', 'a', 'set', 'of', 'm', 'feature', 'vectors', 'that', 'arrive', 'online', 'we', 'show', 'that', 'for', 'the', 'feature', 'vectors', 'on', 'which', 'an', 'ensemble', 'of', 'models', 'trained', 'on', 'random', 'disjoint', 'subsets', 'of', 'a', 'dataset', 'makes', 'consistent', 'predictions', 'there', 'is', 'almost', 'nocost', 'of', 'privacy', 'in', 'generating', 'accurate', 'predictions', 'for', 'those', 'feature', 'vectors', 'to', 'that', 'end', 'we', 'provide', 'a', 'novel', 'coupling', 'of', 'the', 'distance', 'to', 'instability', 'framework', 'with', 'the', 'sparse', 'vector', 'technique', 'we', 'provide', 'algorithms', 'with', 'formal', 'privacy', 'and', 'utility', 'guarantees', 'for', 'both', 'binarymulticlass', 'classification', 'and', 'softlabel', 'classification', 'for', 'binary', 'classification', 'in', 'the', 'standard', 'agnostic', 'pac', 'model', 'we', 'show', 'how', 'to', 'bootstrap', 'from', 'our', 'privately', 'generated', 'predictions', 'to', 'construct', 'a', 'computationally', 'efficient', 'private', 'learner', 'that', 'outputs', 'a', 'final', 'accurate', 'hypothesis', 'our', 'construction', 'to', 'the', 'best', 'of', 'our', 'knowledge', 'is', 'the', 'first', 'computationally', 'efficient', 'construction', 'for', 'a', 'labelprivate', 'learner', 'we', 'prove', 'sample', 'complexity', 'upper', 'bounds', 'for', 'this', 'setting', 'as', 'in', 'nonprivate', 'sample', 'complexity', 'bounds', 'the', 'only', 'relevant', 'property', 'of', 'the', 'given', 'concept', 'class', 'is', 'its', 'vc', 'dimension', 'for', 'softlabel', 'classification', 'our', 'techniques', 'are', 'based', 'on', 'exploiting', 'the', 'stability', 'properties', 'of', 'traditional', 'learning', 'algorithms', 'like', 'stochastic', 'gradient', 'descent', 'sgd', 'we', 'provide', 'a', 'new', 'technique', 'to', 'boost', 'the', 'averagecase', 'stability', 'properties', 'of', 'learning', 'algorithms', 'to', 'strong', 'worstcase', 'stability', 'properties', 'and', 'then', 'exploit', 'them', 'to', 'obtain', 'private', 'classification', 'algorithms', 'in', 'the', 'process', 'we', 'also', 'show', 'that', 'a', 'large', 'class', 'of', 'sgd', 'methods', 'satisfy', 'averagecase', 'stability', 'properties', 'in', 'contrast', 'to', 'a', 'smaller', 'class', 'of', 'sgd', 'methods', 'that', 'are', 'uniformly', 'stable', 'as', 'shown', 'in', 'prior', 'work']]
|
[-0.0631035659815242, 0.0018313005352783645, -0.10349752481804912, 0.1074341449272031, -0.10780627611900145, -0.17633433635695417, 0.0862983229976914, 0.42239614749253335, -0.27555325953289866, -0.2927215623262503, 0.09023964800199473, -0.24169077013790716, -0.16067804330800212, 0.23179116123608087, -0.11731452957116781, 0.10146727251449586, 0.0950061476214483, 0.052659741418338665, -0.07332890242462581, -0.3277498451910496, 0.2959064556914466, 0.04971691734739159, 0.32217481066741804, -0.034916400777458445, 0.10016025827284768, -0.014315846295428836, -0.01013723870282085, 0.018197596248404026, -0.10357279253169867, 0.18480860677863797, 0.2823013568921579, 0.22815336560534602, 0.31791393335115176, -0.3576486047694274, -0.1633422568565258, 0.12518334559195202, 0.12264163832006629, 0.12712125213680595, -0.0824992761918636, -0.2643763833054735, 0.13152948301453615, -0.12498074622374257, -0.04359000241585641, -0.16906632766310825, -0.033605203591875514, 0.006522665560137924, -0.3488966449086524, 0.020515925202090866, 0.11753825010523361, 0.03717484374583988, -0.06721222081300651, -0.11523238331624155, 0.04422408488069725, 0.10696872966221134, 0.03199746045954307, 0.02131775629098127, 0.10708944061821468, -0.14292836315099433, -0.16653228460076444, 0.3246454752675705, -0.07698287791950756, -0.21178234589121403, 0.1941798994761458, -0.04983614209417585, -0.18026371537085745, 0.10175979995111588, 0.2593582027561505, 0.13741920833536406, -0.14274531057178436, 0.05849720526252124, -0.07288625624051001, 0.16905811875100357, -0.0004104026349510204, 0.04191231405314576, 0.11744840564718974, 0.20415720336024887, 0.1014867497940921, 0.13863483277932886, -0.05519336658466476, -0.0925850976176143, -0.2673339080153746, -0.13374896993491184, -0.1879014632898292, -0.00452158246307032, -0.12096787368970552, -0.1872334496746645, 0.3679475968061452, 0.22028936726959011, 0.23459798405417628, 0.17043939627587648, 0.34131776127587693, 0.03195367225061048, 0.04783850054476, 0.1603279058411314, 0.23153256685918513, 0.08391708430803856, 0.060444132361009664, -0.14516007587933974, 0.11595512953644034, 0.09880459378095216]
|
1,803.05102
|
Matrix iterations with vertical support restrictions
|
We use coherent systems of FS iterations on a power set, which can be seen as
matrix iteration that allows restriction on arbitrary subsets of the vertical
component, to prove general theorems about preservation of certain type of
unbounded families on definable structures and of certain mad families (like
those added by Hechler's poset for adding an a.d. family) regardless of the
cofinality of their size. In particular, we define a class of posets called
$\sigma$-Frechet-linked and show that they work well to preserve mad families,
and unbounded families on $\omega^\omega$.
As applications of this method, we show that a large class of FS iterations
can preserve the mad family added by Hechler's poset (regardless of the
cofinality of its size), and the consistency of a constellation of Cicho\'n's
diagram with 7 values where two of these values are singular.
|
math.LO
|
we use coherent systems of fs iterations on a power set which can be seen as matrix iteration that allows restriction on arbitrary subsets of the vertical component to prove general theorems about preservation of certain type of unbounded families on definable structures and of certain mad families like those added by hechlers poset for adding an ad family regardless of the cofinality of their size in particular we define a class of posets called sigmafrechetlinked and show that they work well to preserve mad families and unbounded families on omegaomega as applications of this method we show that a large class of fs iterations can preserve the mad family added by hechlers poset regardless of the cofinality of its size and the consistency of a constellation of cichons diagram with 7 values where two of these values are singular
|
[['we', 'use', 'coherent', 'systems', 'of', 'fs', 'iterations', 'on', 'a', 'power', 'set', 'which', 'can', 'be', 'seen', 'as', 'matrix', 'iteration', 'that', 'allows', 'restriction', 'on', 'arbitrary', 'subsets', 'of', 'the', 'vertical', 'component', 'to', 'prove', 'general', 'theorems', 'about', 'preservation', 'of', 'certain', 'type', 'of', 'unbounded', 'families', 'on', 'definable', 'structures', 'and', 'of', 'certain', 'mad', 'families', 'like', 'those', 'added', 'by', 'hechlers', 'poset', 'for', 'adding', 'an', 'ad', 'family', 'regardless', 'of', 'the', 'cofinality', 'of', 'their', 'size', 'in', 'particular', 'we', 'define', 'a', 'class', 'of', 'posets', 'called', 'sigmafrechetlinked', 'and', 'show', 'that', 'they', 'work', 'well', 'to', 'preserve', 'mad', 'families', 'and', 'unbounded', 'families', 'on', 'omegaomega', 'as', 'applications', 'of', 'this', 'method', 'we', 'show', 'that', 'a', 'large', 'class', 'of', 'fs', 'iterations', 'can', 'preserve', 'the', 'mad', 'family', 'added', 'by', 'hechlers', 'poset', 'regardless', 'of', 'the', 'cofinality', 'of', 'its', 'size', 'and', 'the', 'consistency', 'of', 'a', 'constellation', 'of', 'cichons', 'diagram', 'with', '7', 'values', 'where', 'two', 'of', 'these', 'values', 'are', 'singular']]
|
[-0.13628066744465028, 0.1127243944449923, -0.03590341804236391, 0.0641938671427201, -0.0765474438225429, -0.10256556451769315, 0.04077227337517007, 0.34737060425707894, -0.31136941921686495, -0.27196569738053056, 0.14758659568768212, -0.2516817443607499, -0.10689823365477967, 0.22276640062417535, -0.11949233808996577, 0.04914528851879142, 0.0605091453890187, 0.08252684902535738, -0.08140487524589021, -0.2530402869774695, 0.40403847766183587, -0.048512111628686426, 0.21760778325732227, -0.007650755536164681, 0.10892992448333623, -0.010046899695982681, 0.02139210612275196, 0.06659547909142545, -0.16045280953823124, 0.1377178268799436, 0.22556800317753406, 0.13711091132501452, 0.2771962404074351, -0.3522711914766879, -0.15853433441506684, 0.16777011933634534, 0.11988757318926696, 0.05752641187188807, 0.009187312485704566, -0.24508917770504843, 0.16040250250090757, -0.19017577613533956, -0.1622938120458955, -0.11396024828729132, 0.01991902026653725, 0.08770039865413994, -0.2853146838772036, -0.030096780090681174, 0.14469990900880828, 0.09249727416062986, -0.026301356074553202, -0.11673786318402085, -0.05986440089449667, 0.078526241592655, 0.008406441968043138, -0.012280885748782732, 0.07169496498145435, -0.08263719174161173, -0.10034991500399544, 0.3448681242901655, -0.04057330874739772, -0.18056135210650462, 0.17417334980351756, -0.13651551558792482, -0.15620847593272363, 0.10291031350374874, 0.144389780020948, 0.1332828134763986, -0.04078478606784866, 0.11964500923369108, -0.11780863614195455, 0.16543100614195866, 0.14117613683257552, 0.0953890707494222, 0.1471417708539941, 0.09899711353102288, 0.11072197012657667, 0.1709680787285953, -0.05092454119415505, -0.07427940275146197, -0.3278962856168811, -0.1225651689927454, -0.13824353788564675, 0.05224632038768843, -0.1272763407506205, -0.23551132956886814, 0.3936011838543154, 0.11636447646131698, 0.2121969646889798, 0.10359777445500432, 0.19627138647849052, 0.07291700276063949, 0.10840237009199676, 0.06363402625178768, 0.14787733234315567, 0.11626717097798947, -0.013094915671913076, -0.15593785058407889, 0.07901772675716257, 0.10957060894677348]
|
1,803.05103
|
Robustness to incorrect priors in partially observed stochastic control
|
We study the continuity properties of optimal solutions to stochastic control
problems with respect to initial probability measures and applications of these
to the robustness of optimal control policies applied to systems with
incomplete or incorrect priors. It is shown that for single and multi-stage
optimal cost problems, continuity and robustness cannot be established under
weak convergence or Wasserstein convergence in general, but that the optimal
cost is continuous in the priors under the convergence in total variation under
mild conditions. By imposing further assumptions on the measurement models,
robustness and continuity also hold under weak convergence of priors. We thus
obtain robustness results and bounds on the mismatch error that occurs due to
the application of a control policy which is designed for an incorrectly
estimated prior in terms of a distance measure between the true prior and the
incorrect one. Positive and negative practical implications of these results in
empirical learning for stochastic control will be presented, where almost
surely weak convergence of i.i.d. empirical measures occurs but stronger
notions of convergence, such as total variation convergence, in general, do
not.
|
cs.SY math.OC
|
we study the continuity properties of optimal solutions to stochastic control problems with respect to initial probability measures and applications of these to the robustness of optimal control policies applied to systems with incomplete or incorrect priors it is shown that for single and multistage optimal cost problems continuity and robustness cannot be established under weak convergence or wasserstein convergence in general but that the optimal cost is continuous in the priors under the convergence in total variation under mild conditions by imposing further assumptions on the measurement models robustness and continuity also hold under weak convergence of priors we thus obtain robustness results and bounds on the mismatch error that occurs due to the application of a control policy which is designed for an incorrectly estimated prior in terms of a distance measure between the true prior and the incorrect one positive and negative practical implications of these results in empirical learning for stochastic control will be presented where almost surely weak convergence of iid empirical measures occurs but stronger notions of convergence such as total variation convergence in general do not
|
[['we', 'study', 'the', 'continuity', 'properties', 'of', 'optimal', 'solutions', 'to', 'stochastic', 'control', 'problems', 'with', 'respect', 'to', 'initial', 'probability', 'measures', 'and', 'applications', 'of', 'these', 'to', 'the', 'robustness', 'of', 'optimal', 'control', 'policies', 'applied', 'to', 'systems', 'with', 'incomplete', 'or', 'incorrect', 'priors', 'it', 'is', 'shown', 'that', 'for', 'single', 'and', 'multistage', 'optimal', 'cost', 'problems', 'continuity', 'and', 'robustness', 'can', 'not', 'be', 'established', 'under', 'weak', 'convergence', 'or', 'wasserstein', 'convergence', 'in', 'general', 'but', 'that', 'the', 'optimal', 'cost', 'is', 'continuous', 'in', 'the', 'priors', 'under', 'the', 'convergence', 'in', 'total', 'variation', 'under', 'mild', 'conditions', 'by', 'imposing', 'further', 'assumptions', 'on', 'the', 'measurement', 'models', 'robustness', 'and', 'continuity', 'also', 'hold', 'under', 'weak', 'convergence', 'of', 'priors', 'we', 'thus', 'obtain', 'robustness', 'results', 'and', 'bounds', 'on', 'the', 'mismatch', 'error', 'that', 'occurs', 'due', 'to', 'the', 'application', 'of', 'a', 'control', 'policy', 'which', 'is', 'designed', 'for', 'an', 'incorrectly', 'estimated', 'prior', 'in', 'terms', 'of', 'a', 'distance', 'measure', 'between', 'the', 'true', 'prior', 'and', 'the', 'incorrect', 'one', 'positive', 'and', 'negative', 'practical', 'implications', 'of', 'these', 'results', 'in', 'empirical', 'learning', 'for', 'stochastic', 'control', 'will', 'be', 'presented', 'where', 'almost', 'surely', 'weak', 'convergence', 'of', 'iid', 'empirical', 'measures', 'occurs', 'but', 'stronger', 'notions', 'of', 'convergence', 'such', 'as', 'total', 'variation', 'convergence', 'in', 'general', 'do', 'not']]
|
[-0.07462605686020612, 0.032546063210089494, -0.09513832655300022, 0.12121640413723704, -0.050699071393034464, -0.1387737391987289, 0.08821399269989975, 0.41207228858104866, -0.2997826536833916, -0.27497430975231313, 0.1611580674134134, -0.21197790563683552, -0.13462608396240167, 0.20346033171581043, -0.1658797102661439, 0.1373592747012204, 0.07188411509496687, 0.02138195444675385, -0.12075737587355947, -0.2964002447174014, 0.3202878647324447, 0.06393584330647212, 0.3267981938906419, 0.06160959108029087, 0.12040471394404607, -0.020476714190368984, 0.021688074149373595, 0.04699537824616646, -0.15082344882272952, 0.10585076677228283, 0.21041909783519694, 0.14715370249873755, 0.35619166446849704, -0.3769690257158009, -0.19946507894454282, 0.15651807733862053, 0.10212699577190822, 0.05677520218191405, -0.059119532032839386, -0.2820757027695198, 0.13134982971393544, -0.09352135937281317, -0.10456662970018046, -0.11253837327240035, -0.009591280993924516, 0.09410994261650005, -0.3660186862841289, 0.10611625142511279, 0.10408370378022284, 0.03659968618961537, -0.10169109873759621, -0.10363358455968251, -0.002431665319422989, 0.13197811161744935, 0.11415131593188878, 0.006381823874265968, 0.12104582240262181, -0.10863220132887363, -0.11690340877596653, 0.3458962524512216, -0.07956462718910821, -0.2783261908258757, 0.20500114067798006, -0.1099970664945431, -0.1396842881342467, 0.10541955354552635, 0.19744525758458464, 0.1015393158152659, -0.15499074042347036, 0.07707528930705335, -0.0004007347110334946, 0.14142345123780062, 0.07196404893297965, 0.07246735782182837, 0.08783516474194704, 0.11795807112534733, 0.21303034230273307, 0.1200825777322398, -0.021118674007163423, -0.12289853988635435, -0.3224522206203445, -0.09054211329329638, -0.16844765909279333, 0.05618568790748174, -0.13761974942470892, -0.1643539463451737, 0.3220102686679203, 0.19506845071294304, 0.16265386981625773, 0.11486230312363224, 0.2815880084450802, 0.13862856219297418, 0.0014316294925621428, 0.08546619651505076, 0.25716698870730953, 0.13343015726929044, 0.073557881962346, -0.20124626438811663, 0.18276364970496733, 0.014190514597272419]
|
1,803.05104
|
Bucket Renormalization for Approximate Inference
|
Probabilistic graphical models are a key tool in machine learning
applications. Computing the partition function, i.e., normalizing constant, is
a fundamental task of statistical inference but it is generally computationally
intractable, leading to extensive study of approximation methods. Iterative
variational methods are a popular and successful family of approaches. However,
even state of the art variational methods can return poor results or fail to
converge on difficult instances. In this paper, we instead consider computing
the partition function via sequential summation over variables. We develop
robust approximate algorithms by combining ideas from mini-bucket elimination
with tensor network and renormalization group methods from statistical physics.
The resulting "convergence-free" methods show good empirical performance on
both synthetic and real-world benchmark models, even for difficult instances.
|
stat.ML
|
probabilistic graphical models are a key tool in machine learning applications computing the partition function ie normalizing constant is a fundamental task of statistical inference but it is generally computationally intractable leading to extensive study of approximation methods iterative variational methods are a popular and successful family of approaches however even state of the art variational methods can return poor results or fail to converge on difficult instances in this paper we instead consider computing the partition function via sequential summation over variables we develop robust approximate algorithms by combining ideas from minibucket elimination with tensor network and renormalization group methods from statistical physics the resulting convergencefree methods show good empirical performance on both synthetic and realworld benchmark models even for difficult instances
|
[['probabilistic', 'graphical', 'models', 'are', 'a', 'key', 'tool', 'in', 'machine', 'learning', 'applications', 'computing', 'the', 'partition', 'function', 'ie', 'normalizing', 'constant', 'is', 'a', 'fundamental', 'task', 'of', 'statistical', 'inference', 'but', 'it', 'is', 'generally', 'computationally', 'intractable', 'leading', 'to', 'extensive', 'study', 'of', 'approximation', 'methods', 'iterative', 'variational', 'methods', 'are', 'a', 'popular', 'and', 'successful', 'family', 'of', 'approaches', 'however', 'even', 'state', 'of', 'the', 'art', 'variational', 'methods', 'can', 'return', 'poor', 'results', 'or', 'fail', 'to', 'converge', 'on', 'difficult', 'instances', 'in', 'this', 'paper', 'we', 'instead', 'consider', 'computing', 'the', 'partition', 'function', 'via', 'sequential', 'summation', 'over', 'variables', 'we', 'develop', 'robust', 'approximate', 'algorithms', 'by', 'combining', 'ideas', 'from', 'minibucket', 'elimination', 'with', 'tensor', 'network', 'and', 'renormalization', 'group', 'methods', 'from', 'statistical', 'physics', 'the', 'resulting', 'convergencefree', 'methods', 'show', 'good', 'empirical', 'performance', 'on', 'both', 'synthetic', 'and', 'realworld', 'benchmark', 'models', 'even', 'for', 'difficult', 'instances']]
|
[-0.01934316199937011, -0.023442450633127488, -0.10413137213594173, 0.13507094641586337, -0.10083561840650367, -0.18899306971350777, 0.06976092290839364, 0.4338668289701225, -0.2876325303261153, -0.3337179986668415, 0.11192617739634741, -0.22713647451114338, -0.20042410983368145, 0.22832364715506, -0.08189423852046708, 0.1529517463354974, 0.16142123917758952, 0.00617887177141994, -0.11537760314455286, -0.2818877849571376, 0.28841171279305317, 0.017929937808820216, 0.3457442056005973, -0.007067118038530233, 0.08504343546209399, 0.0035373342937224956, -0.045304843913534745, 0.042250071819222794, -0.10065592655751732, 0.1768827574617672, 0.30708578841067274, 0.19875831298194216, 0.3529768630282068, -0.4191393282943878, -0.19739791610827823, 0.13676512140597477, 0.15559235214423695, 0.12985275855257375, -0.0012501737343330608, -0.25803921034284794, 0.06840745197441124, -0.16341636570353732, -0.018937564435888263, -0.21579719069184827, -0.046900315927799606, 0.005101835592764384, -0.3037143005439859, 0.08578466817156458, 0.016400192549345313, 0.051326231550058866, -0.0006617079488933086, -0.1775868881997637, 0.09237724225624602, 0.10645840856147411, 0.07520294673244668, 0.0303750150917159, 0.11728360567272442, -0.17911275157697315, -0.1755703186013232, 0.37446593047934584, -0.04515332029273612, -0.21502228429327247, 0.23749617605515924, 0.016886312838979674, -0.20033691184915847, 0.11597271368182341, 0.20373489826604663, 0.18219200546851336, -0.13276304783238496, 0.11615645151335334, -0.024404203450520995, 0.13596148098834226, -0.0037481701383214505, -0.03890312394340996, 0.15533270978666536, 0.17535794599813823, 0.055743799296772624, 0.1216463458315912, -0.03973127178061509, -0.16542083536442675, -0.21040961329565674, -0.10844109546332086, -0.21834498412952927, 0.013667718660025323, -0.11455871933676612, -0.21927359251335996, 0.35904566310422464, 0.2114701176035508, 0.13720670589446243, 0.12031058506032483, 0.3818600268759688, 0.10377018448331805, 0.0394103476915081, 0.1316955752291938, 0.15159023719406534, 0.10374273506916876, 0.041629486414794734, -0.1382721483890639, 0.11536098263402027, 0.08281380314590814]
|
1,803.05105
|
Ranking with Adaptive Neighbors
|
Retrieving the most similar objects in a large-scale database for a given
query is a fundamental building block in many application domains, ranging from
web searches, visual, cross media, and document retrievals. State-of-the-art
approaches have mainly focused on capturing the underlying geometry of the data
manifolds. Graph-based approaches, in particular, define various diffusion
processes on weighted data graphs. Despite success, these approaches rely on
fixed-weight graphs, making ranking sensitive to the input affinity matrix. In
this study, we propose a new ranking algorithm that simultaneously learns the
data affinity matrix and the ranking scores. The proposed optimization
formulation assigns adaptive neighbors to each point in the data based on the
local connectivity, and the smoothness constraint assigns similar ranking
scores to similar data points. We develop a novel and efficient algorithm to
solve the optimization problem. Evaluations using synthetic and real datasets
suggest that the proposed algorithm can outperform the existing methods.
|
cs.LG stat.ML
|
retrieving the most similar objects in a largescale database for a given query is a fundamental building block in many application domains ranging from web searches visual cross media and document retrievals stateoftheart approaches have mainly focused on capturing the underlying geometry of the data manifolds graphbased approaches in particular define various diffusion processes on weighted data graphs despite success these approaches rely on fixedweight graphs making ranking sensitive to the input affinity matrix in this study we propose a new ranking algorithm that simultaneously learns the data affinity matrix and the ranking scores the proposed optimization formulation assigns adaptive neighbors to each point in the data based on the local connectivity and the smoothness constraint assigns similar ranking scores to similar data points we develop a novel and efficient algorithm to solve the optimization problem evaluations using synthetic and real datasets suggest that the proposed algorithm can outperform the existing methods
|
[['retrieving', 'the', 'most', 'similar', 'objects', 'in', 'a', 'largescale', 'database', 'for', 'a', 'given', 'query', 'is', 'a', 'fundamental', 'building', 'block', 'in', 'many', 'application', 'domains', 'ranging', 'from', 'web', 'searches', 'visual', 'cross', 'media', 'and', 'document', 'retrievals', 'stateoftheart', 'approaches', 'have', 'mainly', 'focused', 'on', 'capturing', 'the', 'underlying', 'geometry', 'of', 'the', 'data', 'manifolds', 'graphbased', 'approaches', 'in', 'particular', 'define', 'various', 'diffusion', 'processes', 'on', 'weighted', 'data', 'graphs', 'despite', 'success', 'these', 'approaches', 'rely', 'on', 'fixedweight', 'graphs', 'making', 'ranking', 'sensitive', 'to', 'the', 'input', 'affinity', 'matrix', 'in', 'this', 'study', 'we', 'propose', 'a', 'new', 'ranking', 'algorithm', 'that', 'simultaneously', 'learns', 'the', 'data', 'affinity', 'matrix', 'and', 'the', 'ranking', 'scores', 'the', 'proposed', 'optimization', 'formulation', 'assigns', 'adaptive', 'neighbors', 'to', 'each', 'point', 'in', 'the', 'data', 'based', 'on', 'the', 'local', 'connectivity', 'and', 'the', 'smoothness', 'constraint', 'assigns', 'similar', 'ranking', 'scores', 'to', 'similar', 'data', 'points', 'we', 'develop', 'a', 'novel', 'and', 'efficient', 'algorithm', 'to', 'solve', 'the', 'optimization', 'problem', 'evaluations', 'using', 'synthetic', 'and', 'real', 'datasets', 'suggest', 'that', 'the', 'proposed', 'algorithm', 'can', 'outperform', 'the', 'existing', 'methods']]
|
[-0.050697506776104045, -0.04669422794770645, -0.07180676850533162, 0.09511526907322389, -0.13420016920702582, -0.16839942744455152, 0.057753352572418454, 0.4364953328836954, -0.26719329029238953, -0.3350361379807031, 0.08509456682077143, -0.31598668802938557, -0.1893823327049368, 0.1698482923644693, -0.10629155250468389, 0.08972599479679239, 0.12753294040081337, 0.05492721306539974, -0.07305948709223517, -0.2824956579654674, 0.33736900444731827, 0.04787219501419091, 0.36551139945482936, 0.03175935875869503, 0.11606859339563495, 0.02334579710517765, -0.09885888781220849, 0.025144217013803427, -0.09525273141489858, 0.19994921066513358, 0.3169546166701414, 0.2329335576903663, 0.30022619816621665, -0.39116196502245176, -0.1957344806348709, 0.11206107763083357, 0.113285434507385, 0.0939352444357179, -0.059494250219646154, -0.3139707855451362, 0.05708330873772196, -0.10007029788960752, 0.04118778497764939, -0.12417139544758309, -0.016449701748665814, 0.023342397786205095, -0.31079391132746087, 0.010424372890970278, 0.010566821233001783, 0.03635668017484836, -0.06483812855041929, -0.15008138996352882, 0.04621043913204247, 0.14081481874822394, 0.008575972759373192, 0.033844623078996515, 0.1632256293516165, -0.1259303698059643, -0.20194275025316624, 0.39689898809516116, -0.03762067151929889, -0.21134298306270993, 0.21149926869915553, -0.024948369366986873, -0.18870975984425872, 0.11168752189750146, 0.25856651981226414, 0.13978182919029342, -0.15054992902227432, 0.05459860699231381, -0.06081183032763779, 0.16431975839020052, 0.028943421984302786, -0.01720065537742094, 0.14122469290802991, 0.21624227888165287, 0.09265148592921353, 0.09802092113807846, -0.09043973039124946, -0.08685870563893236, -0.16860981474900127, -0.10342612044884222, -0.22544755885304002, -0.05389509087590819, -0.17455186689910893, -0.18165238210196166, 0.4091512006125413, 0.24485207142577947, 0.2253142845461537, 0.08318134498978524, 0.33068035799844536, 0.036434105983445125, 0.08697238269968166, 0.11546967691116918, 0.13855596228294367, 0.047683833341579884, 0.11582641401266876, -0.1492907787431154, 0.11005315102949298, 0.09363898991815452]
|
1,803.05106
|
Tail state formation in solar cell materials: First principles analyses
of zincblende, chalcopyrite, kesterite and hybrid perovskite crystals
|
Tail state formation in solar cell absorbers leads to a detrimental effect on
solar cell performance. Nevertheless, the characterization of the band tailing
in experimental semiconductor crystals is generally difficult. In this article,
to determine the tail state generation in various solar cell materials, we have
developed a quite general theoretical scheme in which the experimental Urbach
energy is compared with the absorption edge energy derived from density
functional theory (DFT) calculation. For this purpose, the absorption spectra
of solar cell materials, including CdTe, CuInSe2 (CISe), CuGaSe2 (CGSe),
Cu2ZnSnSe4 (CZTSe), Cu2ZnSnS4 (CZTS) and hybrid perovskites, have been
calculated by DFT particularly using very-high-density k meshes. As a result,
we find that the tail state formation is negligible in CdTe, CISe, CGSe and
hybrid perovskite polycrystals. However, coevaporated CZTSe and CZTS layers
exhibit very large Urbach energies, which are far larger than the theoretical
counterparts. Based on DFT analysis results, we conclude that the quite large
tail state formation observed in the CZTSe and CZTS originates from extensive
cation disordering. In particular, even a slight cation substitution is found
to generate unusual band fluctuation in CZT(S)Se. In contrast, CH3NH3PbI3
hybrid perovskite shows the sharpest absorption edge theoretically, which
agrees with experiment.
|
cond-mat.mtrl-sci
|
tail state formation in solar cell absorbers leads to a detrimental effect on solar cell performance nevertheless the characterization of the band tailing in experimental semiconductor crystals is generally difficult in this article to determine the tail state generation in various solar cell materials we have developed a quite general theoretical scheme in which the experimental urbach energy is compared with the absorption edge energy derived from density functional theory dft calculation for this purpose the absorption spectra of solar cell materials including cdte cuinse2 cise cugase2 cgse cu2znsnse4 cztse cu2znsns4 czts and hybrid perovskites have been calculated by dft particularly using veryhighdensity k meshes as a result we find that the tail state formation is negligible in cdte cise cgse and hybrid perovskite polycrystals however coevaporated cztse and czts layers exhibit very large urbach energies which are far larger than the theoretical counterparts based on dft analysis results we conclude that the quite large tail state formation observed in the cztse and czts originates from extensive cation disordering in particular even a slight cation substitution is found to generate unusual band fluctuation in cztsse in contrast ch3nh3pbi3 hybrid perovskite shows the sharpest absorption edge theoretically which agrees with experiment
|
[['tail', 'state', 'formation', 'in', 'solar', 'cell', 'absorbers', 'leads', 'to', 'a', 'detrimental', 'effect', 'on', 'solar', 'cell', 'performance', 'nevertheless', 'the', 'characterization', 'of', 'the', 'band', 'tailing', 'in', 'experimental', 'semiconductor', 'crystals', 'is', 'generally', 'difficult', 'in', 'this', 'article', 'to', 'determine', 'the', 'tail', 'state', 'generation', 'in', 'various', 'solar', 'cell', 'materials', 'we', 'have', 'developed', 'a', 'quite', 'general', 'theoretical', 'scheme', 'in', 'which', 'the', 'experimental', 'urbach', 'energy', 'is', 'compared', 'with', 'the', 'absorption', 'edge', 'energy', 'derived', 'from', 'density', 'functional', 'theory', 'dft', 'calculation', 'for', 'this', 'purpose', 'the', 'absorption', 'spectra', 'of', 'solar', 'cell', 'materials', 'including', 'cdte', 'cuinse2', 'cise', 'cugase2', 'cgse', 'cu2znsnse4', 'cztse', 'cu2znsns4', 'czts', 'and', 'hybrid', 'perovskites', 'have', 'been', 'calculated', 'by', 'dft', 'particularly', 'using', 'veryhighdensity', 'k', 'meshes', 'as', 'a', 'result', 'we', 'find', 'that', 'the', 'tail', 'state', 'formation', 'is', 'negligible', 'in', 'cdte', 'cise', 'cgse', 'and', 'hybrid', 'perovskite', 'polycrystals', 'however', 'coevaporated', 'cztse', 'and', 'czts', 'layers', 'exhibit', 'very', 'large', 'urbach', 'energies', 'which', 'are', 'far', 'larger', 'than', 'the', 'theoretical', 'counterparts', 'based', 'on', 'dft', 'analysis', 'results', 'we', 'conclude', 'that', 'the', 'quite', 'large', 'tail', 'state', 'formation', 'observed', 'in', 'the', 'cztse', 'and', 'czts', 'originates', 'from', 'extensive', 'cation', 'disordering', 'in', 'particular', 'even', 'a', 'slight', 'cation', 'substitution', 'is', 'found', 'to', 'generate', 'unusual', 'band', 'fluctuation', 'in', 'cztsse', 'in', 'contrast', 'ch3nh3pbi3', 'hybrid', 'perovskite', 'shows', 'the', 'sharpest', 'absorption', 'edge', 'theoretically', 'which', 'agrees', 'with', 'experiment']]
|
[-0.07739360051828638, 0.12770778854288647, -0.0366008777052033, 0.0490335593766114, 0.01344895374086035, -0.1251079957211512, 0.07171403845051426, 0.4320608787332198, -0.19836012958252075, -0.312220230876426, 0.02044849232279101, -0.30407174174257334, -0.15904674145051434, 0.17421589997227319, -0.03948511963186027, 0.03313576909783647, 0.05075632626466902, -0.08606295926372366, -0.05295712710592203, -0.14654771882476725, 0.20125097966514266, 0.10248921983805134, 0.33163072074290795, 0.07046539117608468, -0.015434950215732633, -0.0736616767039663, 0.0959284979938974, 0.030586003826640958, -0.16777159198429775, 0.11050083611895278, 0.2776789148057338, -0.05967758998424563, 0.2009179253042231, -0.4578055727796339, -0.2548611783820331, -0.01746878499792884, 0.1110346297845806, 0.09048022587383493, -0.1345440152138659, -0.20981946937159526, 0.10129033757815951, -0.16779267022517233, -0.07245842321780534, -0.03853122988743848, -0.03331246039357467, 0.009700032528100802, -0.23126002496117773, 0.09617278364430833, 0.007201295319111578, 0.06174471954599809, -0.13707427594380164, -0.19991355357240023, -0.0815054767510044, 0.024973125607079486, 0.028889107626708384, 0.004918819957941621, 0.17040721941054868, -0.07586208978362484, -0.08534372220840773, 0.4026865965438698, -0.05317209659756487, -0.038842813628983106, 0.17920546727395387, -0.2075962000918439, -0.12713615448873997, 0.20041727053993685, 0.09376359292792727, 0.11015992451356209, -0.1353678205424929, 0.07913186670346513, -0.015098371606755383, 0.1949008566259533, 0.06858066172952104, 0.12030089227219426, 0.1800309956487942, 0.2154474849286185, 0.01612228755815769, 0.11293722705180809, -0.1394989803695499, -0.07813739460710455, -0.15960099786782084, -0.17109852427050434, -0.19916622848636073, 0.060255963234280605, -0.04831074500876484, -0.21946931638563025, 0.3710852644258217, 0.108347665059881, 0.14106009899516914, -0.01967237356186718, 0.22764537611686106, 0.09021644023113683, 0.09025646883809481, 0.014632862538148137, 0.2806468028200781, 0.15854133278173604, 0.13037749406549348, -0.24755404881510565, 0.13779052821966123, 0.003198534272489461]
|
1,803.05107
|
Vector-valued Littewood-Paley-Stein theory for semigroups II
|
Inspired by a recent work of Hyt\"onen and Naor, we solve a problem left open
in our previous work joint with Mart\'{\i}nez and Torrea on the vector-valued
Littlewood-Paley-Stein theory for symmetric diffusion semigroups. We prove a
similar result in the discrete case, namely, for any $T$ which is the square of
a symmetric Markovian operator on a measure space $(\Omega, \mu)$. Moreover, we
show that $T\otimes{\rm Id}_X$ extends to an analytic contraction on
$L_p(\Omega; X)$ for any $1<p<\infty$ and any uniformly convex Banach space
$X$.
|
math.FA math.CA math.OA
|
inspired by a recent work of hytonen and naor we solve a problem left open in our previous work joint with martinez and torrea on the vectorvalued littlewoodpaleystein theory for symmetric diffusion semigroups we prove a similar result in the discrete case namely for any t which is the square of a symmetric markovian operator on a measure space omega mu moreover we show that totimesrm id_x extends to an analytic contraction on l_pomega x for any 1pinfty and any uniformly convex banach space x
|
[['inspired', 'by', 'a', 'recent', 'work', 'of', 'hytonen', 'and', 'naor', 'we', 'solve', 'a', 'problem', 'left', 'open', 'in', 'our', 'previous', 'work', 'joint', 'with', 'martinez', 'and', 'torrea', 'on', 'the', 'vectorvalued', 'littlewoodpaleystein', 'theory', 'for', 'symmetric', 'diffusion', 'semigroups', 'we', 'prove', 'a', 'similar', 'result', 'in', 'the', 'discrete', 'case', 'namely', 'for', 'any', 't', 'which', 'is', 'the', 'square', 'of', 'a', 'symmetric', 'markovian', 'operator', 'on', 'a', 'measure', 'space', 'omega', 'mu', 'moreover', 'we', 'show', 'that', 'totimesrm', 'id_x', 'extends', 'to', 'an', 'analytic', 'contraction', 'on', 'l_pomega', 'x', 'for', 'any', '1pinfty', 'and', 'any', 'uniformly', 'convex', 'banach', 'space', 'x']]
|
[-0.10133454783464826, 0.08197112607238177, -0.06352576120046988, 0.0485788896455363, -0.08949243687536745, -0.10621236732030022, 0.03951507252280689, 0.3741767290491788, -0.2955162782953786, -0.13030405677948562, 0.12794572710602856, -0.27696319294738625, -0.1494109532130616, 0.21055693087206842, -0.1404532198018084, 0.0581256539915644, 0.029291181958147457, 0.046371239583961485, -0.10651061285032137, -0.2489332811743398, 0.3839850889219503, -0.04614551334331433, 0.17689461821767813, 0.06610090319078327, 0.12697911155520983, 0.055126880711343675, -0.031460456644362284, -0.011586582116987779, -0.20618917030281278, 0.12048155303151968, 0.222016705000507, 0.0866037621523165, 0.2955389765002543, -0.34057262169551994, -0.22756124488521545, 0.1805119371717973, 0.09018802639496114, -0.013521000505923959, -0.05756684514788157, -0.33014833360322793, 0.09582804153892323, -0.12699812206084884, -0.11338306913690065, -0.06550220876843446, 0.0787379579352481, 0.015531634956243493, -0.37519407440863906, 0.0511047867392855, 0.18108576785639993, 0.01731402578852361, -0.11123905762464606, -0.12344379939826294, 0.019299817213322967, 0.031369729327880555, -0.03985449038944872, 0.1594877882605596, 0.033716227376966605, 0.005413964856415987, -0.14513314107344263, 0.3006645781597832, -0.09020082919769698, -0.2649051390056099, 0.1427644020711471, -0.185669068862418, -0.183547082190801, 0.03416198489832736, 0.1253234272700779, 0.20785992980624238, -0.09439577196636015, 0.27044079522394376, -0.15521832430247395, 0.10798769892287619, 0.09559447399251872, -0.02561264258388075, 0.02757439744753009, 0.10248811292417702, 0.1623224596426423, 0.11372787655619461, 0.04170618387676465, -0.06532723854096341, -0.3227220626902722, -0.18145515851765162, -0.19952045546822428, 0.1363436739886224, -0.08568065915581731, -0.14941264883964323, 0.31392768339165267, 0.07994739501737058, 0.21714071020306575, 0.1430935417981042, 0.19137523833307482, 0.09224025212876898, -0.01751289107362806, 0.10918907040087063, 0.11398530219559602, 0.16382430456412425, 0.07457888928530294, -0.16837788917057747, -0.012188134070519092, 0.1612390218069777]
|
1,803.05108
|
Sub-Doppler laser cooling of 23Na in gray molasses on the D2 line
|
We report on the efficient gray molasses cooling of sodium atoms using the
$D_{2}$ optical transition at 589.1 nm. Thanks to the hyperfine split about
6$\Gamma$ between the $|F'=2\rangle$ and $|F'=3\rangle$ in the excited state
3$^{2}P_{3/2}$, this atomic transition is effective for the gray molasses
cooling mechanism. Using this cooling technique, the atomic sample in $F = 2$
ground manifold is cooled from 700 $\upmu$K to 56 $\upmu$K in 3.5 ms. We
observe that the loading efficiency into magnetic trap is increased due to the
lower temperature and high phase space density of atomic cloud after gray
molasses. This technique offers a promising route for the fast cooling of the
sodium atoms in the $F=2$ state.
|
cond-mat.quant-gas physics.atom-ph
|
we report on the efficient gray molasses cooling of sodium atoms using the d_2 optical transition at 5891 nm thanks to the hyperfine split about 6gamma between the f2rangle and f3rangle in the excited state 32p_32 this atomic transition is effective for the gray molasses cooling mechanism using this cooling technique the atomic sample in f 2 ground manifold is cooled from 700 upmuk to 56 upmuk in 35 ms we observe that the loading efficiency into magnetic trap is increased due to the lower temperature and high phase space density of atomic cloud after gray molasses this technique offers a promising route for the fast cooling of the sodium atoms in the f2 state
|
[['we', 'report', 'on', 'the', 'efficient', 'gray', 'molasses', 'cooling', 'of', 'sodium', 'atoms', 'using', 'the', 'd_2', 'optical', 'transition', 'at', '5891', 'nm', 'thanks', 'to', 'the', 'hyperfine', 'split', 'about', '6gamma', 'between', 'the', 'f2rangle', 'and', 'f3rangle', 'in', 'the', 'excited', 'state', '32p_32', 'this', 'atomic', 'transition', 'is', 'effective', 'for', 'the', 'gray', 'molasses', 'cooling', 'mechanism', 'using', 'this', 'cooling', 'technique', 'the', 'atomic', 'sample', 'in', 'f', '2', 'ground', 'manifold', 'is', 'cooled', 'from', '700', 'upmuk', 'to', '56', 'upmuk', 'in', '35', 'ms', 'we', 'observe', 'that', 'the', 'loading', 'efficiency', 'into', 'magnetic', 'trap', 'is', 'increased', 'due', 'to', 'the', 'lower', 'temperature', 'and', 'high', 'phase', 'space', 'density', 'of', 'atomic', 'cloud', 'after', 'gray', 'molasses', 'this', 'technique', 'offers', 'a', 'promising', 'route', 'for', 'the', 'fast', 'cooling', 'of', 'the', 'sodium', 'atoms', 'in', 'the', 'f2', 'state']]
|
[-0.048844642712819304, 0.25124418383294883, -0.0223240545400503, -0.011664502227954059, 0.054564644531770186, -0.13154215371998196, 0.13134836477269843, 0.43221207508309323, -0.24461135438495232, -0.31452776342630384, 0.04318200895054774, -0.23132060631601647, 0.002239004818891937, 0.17306303834881295, 0.035437906910242005, -0.0048521952999925075, -0.00924220708283511, -0.006145137243650177, -0.06615807283458046, -0.21598217273131012, 0.25323599940589203, 0.08568297741426663, 0.3067360363561999, 0.08975570917722177, 0.1057516993319785, -0.07910767072938721, 0.07652927417392758, -0.1144282960039246, -0.130858619500875, 0.08301838892935352, 0.1873304430861026, 0.06117540348151868, 0.21802238083698533, -0.4212890450135588, -0.1791630677201531, 0.08101260846226731, 0.16243336243893614, 0.17841471619057384, -0.07805428786563094, -0.2613882649435916, 0.016050385789607057, -0.13326907390728593, -0.10495792619714683, -0.08013081174682488, 0.04905309867198494, -0.021181767044419594, -0.2735393733881541, 0.057813981618594634, 0.039788586921481926, 0.10822664267933843, -0.11836207408711992, -0.11790907918898896, 0.015952994346364654, 0.046047328137369316, -0.09618819028943439, 0.08310977458234199, 0.18685170850631866, -0.09077526892598888, 0.019445650271055374, 0.404083096913316, -0.1598740867000412, -0.018460626218637283, 0.1670510443689471, -0.13777919400652702, -0.06019920240664347, 0.24438062178140338, 0.1214214092459191, 0.09997929619963873, -0.07656209842428904, 0.011366499087307603, 0.009390818398572844, 0.2136753646519289, 0.11601875205100938, 0.055523592949082906, 0.19642095652260733, 0.2022540055130693, 0.040660971936515786, 0.19640624101633544, -0.20285189257384362, -0.03970524602230977, -0.1798561962490732, -0.16728089811962987, -0.16126364362426102, 0.060993889016522605, -0.05920753952258648, -0.07697014480681073, 0.3454218819102442, 0.13126204983246598, 0.1836336105892604, -0.061083547516979954, 0.35809772238981996, 0.08779199722815643, 0.061453922346911646, 0.03820018664277582, 0.272297610825097, 0.17644212799231437, 0.10124372042165222, -0.3152697067644278, -0.009011282371780411, 0.050213712913153526]
|
1,803.05109
|
PT-Spike: A Precise-Time-Dependent Single Spike Neuromorphic
Architecture with Efficient Supervised Learning
|
One of the most exciting advancements in AI over the last decade is the wide
adoption of ANNs, such as DNN and CNN, in many real-world applications.
However, the underlying massive amounts of computation and storage requirement
greatly challenge their applicability in resource-limited platforms like the
drone, mobile phone, and IoT devices etc. The third generation of neural
network model--Spiking Neural Network (SNN), inspired by the working mechanism
and efficiency of human brain, has emerged as a promising solution for
achieving more impressive computing and power efficiency within light-weighted
devices (e.g. single chip). However, the relevant research activities have been
narrowly carried out on conventional rate-based spiking system designs for
fulfilling the practical cognitive tasks, underestimating SNN's energy
efficiency, throughput, and system flexibility. Although the time-based SNN can
be more attractive conceptually, its potentials are not unleashed in realistic
applications due to lack of efficient coding and practical learning schemes. In
this work, a Precise-Time-Dependent Single Spike Neuromorphic Architecture,
namely "PT-Spike", is developed to bridge this gap. Three constituent
hardware-favorable techniques: precise single-spike temporal encoding,
efficient supervised temporal learning, and fast asymmetric decoding are
proposed accordingly to boost the energy efficiency and data processing
capability of the time-based SNN at a more compact neural network model size
when executing real cognitive tasks. Simulation results show that "PT-Spike"
demonstrates significant improvements in network size, processing efficiency
and power consumption with marginal classification accuracy degradation when
compared with the rate-based SNN and ANN under the similar network
configuration.
|
cs.NE q-bio.NC
|
one of the most exciting advancements in ai over the last decade is the wide adoption of anns such as dnn and cnn in many realworld applications however the underlying massive amounts of computation and storage requirement greatly challenge their applicability in resourcelimited platforms like the drone mobile phone and iot devices etc the third generation of neural network modelspiking neural network snn inspired by the working mechanism and efficiency of human brain has emerged as a promising solution for achieving more impressive computing and power efficiency within lightweighted devices eg single chip however the relevant research activities have been narrowly carried out on conventional ratebased spiking system designs for fulfilling the practical cognitive tasks underestimating snns energy efficiency throughput and system flexibility although the timebased snn can be more attractive conceptually its potentials are not unleashed in realistic applications due to lack of efficient coding and practical learning schemes in this work a precisetimedependent single spike neuromorphic architecture namely ptspike is developed to bridge this gap three constituent hardwarefavorable techniques precise singlespike temporal encoding efficient supervised temporal learning and fast asymmetric decoding are proposed accordingly to boost the energy efficiency and data processing capability of the timebased snn at a more compact neural network model size when executing real cognitive tasks simulation results show that ptspike demonstrates significant improvements in network size processing efficiency and power consumption with marginal classification accuracy degradation when compared with the ratebased snn and ann under the similar network configuration
|
[['one', 'of', 'the', 'most', 'exciting', 'advancements', 'in', 'ai', 'over', 'the', 'last', 'decade', 'is', 'the', 'wide', 'adoption', 'of', 'anns', 'such', 'as', 'dnn', 'and', 'cnn', 'in', 'many', 'realworld', 'applications', 'however', 'the', 'underlying', 'massive', 'amounts', 'of', 'computation', 'and', 'storage', 'requirement', 'greatly', 'challenge', 'their', 'applicability', 'in', 'resourcelimited', 'platforms', 'like', 'the', 'drone', 'mobile', 'phone', 'and', 'iot', 'devices', 'etc', 'the', 'third', 'generation', 'of', 'neural', 'network', 'modelspiking', 'neural', 'network', 'snn', 'inspired', 'by', 'the', 'working', 'mechanism', 'and', 'efficiency', 'of', 'human', 'brain', 'has', 'emerged', 'as', 'a', 'promising', 'solution', 'for', 'achieving', 'more', 'impressive', 'computing', 'and', 'power', 'efficiency', 'within', 'lightweighted', 'devices', 'eg', 'single', 'chip', 'however', 'the', 'relevant', 'research', 'activities', 'have', 'been', 'narrowly', 'carried', 'out', 'on', 'conventional', 'ratebased', 'spiking', 'system', 'designs', 'for', 'fulfilling', 'the', 'practical', 'cognitive', 'tasks', 'underestimating', 'snns', 'energy', 'efficiency', 'throughput', 'and', 'system', 'flexibility', 'although', 'the', 'timebased', 'snn', 'can', 'be', 'more', 'attractive', 'conceptually', 'its', 'potentials', 'are', 'not', 'unleashed', 'in', 'realistic', 'applications', 'due', 'to', 'lack', 'of', 'efficient', 'coding', 'and', 'practical', 'learning', 'schemes', 'in', 'this', 'work', 'a', 'precisetimedependent', 'single', 'spike', 'neuromorphic', 'architecture', 'namely', 'ptspike', 'is', 'developed', 'to', 'bridge', 'this', 'gap', 'three', 'constituent', 'hardwarefavorable', 'techniques', 'precise', 'singlespike', 'temporal', 'encoding', 'efficient', 'supervised', 'temporal', 'learning', 'and', 'fast', 'asymmetric', 'decoding', 'are', 'proposed', 'accordingly', 'to', 'boost', 'the', 'energy', 'efficiency', 'and', 'data', 'processing', 'capability', 'of', 'the', 'timebased', 'snn', 'at', 'a', 'more', 'compact', 'neural', 'network', 'model', 'size', 'when', 'executing', 'real', 'cognitive', 'tasks', 'simulation', 'results', 'show', 'that', 'ptspike', 'demonstrates', 'significant', 'improvements', 'in', 'network', 'size', 'processing', 'efficiency', 'and', 'power', 'consumption', 'with', 'marginal', 'classification', 'accuracy', 'degradation', 'when', 'compared', 'with', 'the', 'ratebased', 'snn', 'and', 'ann', 'under', 'the', 'similar', 'network', 'configuration']]
|
[-0.11178460162417013, -0.00016868129880766528, -0.009479194415802777, 0.03325974746173464, -0.08268505939634138, -0.23117301171776913, 0.03137052860555405, 0.456824458441871, -0.25713488561076137, -0.3553011782652857, 0.07362350886417128, -0.22926571531920728, -0.21894636283400642, 0.2575316501740768, -0.11928767294473695, 0.1400037493406509, 0.12995529998696692, 0.04439792759704495, -0.03373219443318971, -0.2770881751543529, 0.2145789642441492, 0.13023751012061208, 0.41085086107984403, 0.05404980033824483, 0.08933975468235114, -0.04462142135267807, 0.006030271553890432, -0.05620992600316901, 0.0023678965762166278, 0.1969474654343304, 0.3338520208679679, 0.18848964196428872, 0.3584875633082202, -0.47383556098805707, -0.27964314939434876, 0.10536143996490019, 0.1656769421339857, 0.05478542568732084, -0.07935774983123044, -0.27995444303842193, 0.13508945452078358, -0.2323929331559085, -0.01474287295489402, -0.11693651745591217, 0.028039333169518572, 0.038600049158403676, -0.24979385096363382, 0.01705696941565923, 0.0434038980157345, 0.06525659515170759, -4.369742732158866e-05, -0.1029442406957003, 0.031214147483489448, 0.1486213435373014, -0.0021146949717805903, 0.012995758703987103, 0.19287610501756203, -0.19954838930011853, -0.15858218472651922, 0.3495837118654392, 0.020028710372058126, -0.1641189950669022, 0.2146934610646589, -0.010974438642190297, -0.14868161327464513, 0.10687151503714412, 0.2458040146369688, 0.05909715458572962, -0.17244972130904435, 0.01884727319050387, 0.05756616217945992, 0.17341880077622732, 0.07021895136647467, 0.08169377685420184, 0.1942693795921876, 0.3282554674907143, 0.03687352662267457, 0.10583745646899126, -0.09392150708993982, -0.12445878866804895, -0.16053154267934905, -0.1046370848838464, -0.20195285202664828, 0.017376594054447466, -0.12349078726561796, -0.0791191062793383, 0.40628943373584403, 0.18455791940982164, 0.15230253520247786, 0.09704353940575113, 0.37347374226959784, 0.06156825821236147, 0.16173194426969775, 0.12464113619673178, 0.19869213380331088, 0.04223254105053007, 0.21406334686272727, -0.17851145562756404, 0.06493969149675019, -0.04095576538055115]
|
1,803.0511
|
A Study on the Relationship Between Depth Map Quality and the Overall 3D
Video Quality OF Experience
|
The emergence of multiview displays has made the need for synthesizing
virtual views more pronounced, since it is not practical to capture all of the
possible views when filming multiview content. View synthesis is performed
using the available views and depth maps. There is a correlation between the
quality of the synthesized views and the quality of depth maps. In this paper
we study the effect of depth map quality on perceptual quality of synthesized
view through subjective and objective analysis. Our evaluation results show
that: 1) 3D video quality depends highly on the depth map quality and 2) the
Visual Information Fidelity index computed between the reference and distorted
depth maps has Pearson correlation ratio of 0.75 and Spearman rank order
correlation coefficient of 0.67 with the subjective 3D video quality.
|
eess.IV
|
the emergence of multiview displays has made the need for synthesizing virtual views more pronounced since it is not practical to capture all of the possible views when filming multiview content view synthesis is performed using the available views and depth maps there is a correlation between the quality of the synthesized views and the quality of depth maps in this paper we study the effect of depth map quality on perceptual quality of synthesized view through subjective and objective analysis our evaluation results show that 1 3d video quality depends highly on the depth map quality and 2 the visual information fidelity index computed between the reference and distorted depth maps has pearson correlation ratio of 075 and spearman rank order correlation coefficient of 067 with the subjective 3d video quality
|
[['the', 'emergence', 'of', 'multiview', 'displays', 'has', 'made', 'the', 'need', 'for', 'synthesizing', 'virtual', 'views', 'more', 'pronounced', 'since', 'it', 'is', 'not', 'practical', 'to', 'capture', 'all', 'of', 'the', 'possible', 'views', 'when', 'filming', 'multiview', 'content', 'view', 'synthesis', 'is', 'performed', 'using', 'the', 'available', 'views', 'and', 'depth', 'maps', 'there', 'is', 'a', 'correlation', 'between', 'the', 'quality', 'of', 'the', 'synthesized', 'views', 'and', 'the', 'quality', 'of', 'depth', 'maps', 'in', 'this', 'paper', 'we', 'study', 'the', 'effect', 'of', 'depth', 'map', 'quality', 'on', 'perceptual', 'quality', 'of', 'synthesized', 'view', 'through', 'subjective', 'and', 'objective', 'analysis', 'our', 'evaluation', 'results', 'show', 'that', '1', '3d', 'video', 'quality', 'depends', 'highly', 'on', 'the', 'depth', 'map', 'quality', 'and', '2', 'the', 'visual', 'information', 'fidelity', 'index', 'computed', 'between', 'the', 'reference', 'and', 'distorted', 'depth', 'maps', 'has', 'pearson', 'correlation', 'ratio', 'of', '075', 'and', 'spearman', 'rank', 'order', 'correlation', 'coefficient', 'of', '067', 'with', 'the', 'subjective', '3d', 'video', 'quality']]
|
[-0.06138038374113173, 0.003422147936582791, -0.06508686312185036, 0.031820245589849284, -0.03362453529949893, -0.12051630850218123, 0.01474960516718442, 0.48267091212399077, -0.25329921758649027, -0.3418463360461773, 0.05222161483658111, -0.3195350252966763, -0.17514415486419405, 0.16635228592944754, -0.11709272369361398, 0.08107696908480262, 0.07182488096595714, 0.036154507673486616, -0.13497677783942147, -0.27824248098609544, 0.31151020192632906, 0.06580443219563951, 0.39125030074325023, 0.05749071625089555, 0.1238959632861555, 0.0322010813979432, -0.08664916135427175, 0.06754593755062105, -0.08941373169611987, 0.17384710149472635, 0.24578253970530844, 0.21902039312672886, 0.24575256906576792, -0.3386067392473871, -0.18447108900837714, 0.03276082662914908, 0.08367996046206716, 0.0054284241015204425, -0.06320728635061339, -0.3116359822205127, 0.07555225979233386, -0.0891712768723003, 0.00922527436914882, -0.08778055277864703, 0.01632333035443232, -0.048865264615001666, -0.29374368795348954, 0.07418446818006817, 0.001163515040058304, 0.14810007646905654, -0.06595115364656191, -0.1015905903468868, -0.042873977087297, 0.24685918654347805, 0.029284566162845516, 0.09419310430089492, 0.12358551258291824, -0.1995647632513393, -0.06139664354630055, 0.40975565347594745, -0.045204926641114675, -0.20348594308774354, 0.17489868058438526, -0.12268202080193794, -0.09396835489403174, 0.16910067817309138, 0.1673041285371944, 0.06575240413098293, -0.10166680432159796, -0.004536966566582013, -0.044739898830426464, 0.2911975375750582, 0.08793623089987898, 0.04347852268256247, 0.19947583348292744, 0.1787799033742031, -0.00014644490367958718, 0.14098998865246717, -0.16848970981399444, -0.004086082403029484, -0.18667718162760139, -0.1376795518268464, -0.19457784112345314, 0.008750415621541448, -0.147235552642087, -0.14971092906269018, 0.3997621420403999, 0.2081794412312747, 0.20640136303810516, 0.07697832338497833, 0.36927942358042026, 0.06247457987928735, 0.03539010788010659, 0.01062051622747359, 0.20185160394899096, 0.02060274484877785, 0.1396682342041679, -0.14577581519243363, 0.13422565296941408, 0.06310273131715473]
|
1,803.05111
|
Photoinduced High-Frequency Charge Oscillations in Dimerized Systems
|
Photoinduced charge dynamics in dimerized systems is studied on the basis of
the exact diagonalization method and the time-dependent Schr\"odinger equation
for a one-dimensional spinless-fermion model at half filling and a
two-dimensional model for $\kappa$-(bis[ethylenedithio]tetrathiafulvalene)$_2$X
[$\kappa$-(BEDT-TTF)$_2$X] at three-quarter filling. After the application of a
one-cycle pulse of a specifically polarized electric field, the charge
densities at half of the sites of the system oscillate in the same phase and
those at the other half oscillate in the opposite phase. For weak fields, the
Fourier transform of the time profile of the charge density at any site after
photoexcitation has peaks for finite-sized systems that correspond to those of
the steady-state optical conductivity spectrum. For strong fields, these peaks
are suppressed and a new peak appears on the high-energy side, that is, the
charge densities mainly oscillate with a single frequency, although the
oscillation is eventually damped. In the two-dimensional case without intersite
repulsion and in the one-dimensional case, this frequency corresponds to
charge-transfer processes by which all the bonds connecting the two classes of
sites are exploited. Thus, this oscillation behaves as an electronic breathing
mode. The relevance of the new peak to a recently found reflectivity peak in
$\kappa$-(BEDT-TTF)$_2$X after photoexcitation is discussed.
|
cond-mat.str-el
|
photoinduced charge dynamics in dimerized systems is studied on the basis of the exact diagonalization method and the timedependent schrodinger equation for a onedimensional spinlessfermion model at half filling and a twodimensional model for kappabisethylenedithiotetrathiafulvalene_2x kappabedtttf_2x at threequarter filling after the application of a onecycle pulse of a specifically polarized electric field the charge densities at half of the sites of the system oscillate in the same phase and those at the other half oscillate in the opposite phase for weak fields the fourier transform of the time profile of the charge density at any site after photoexcitation has peaks for finitesized systems that correspond to those of the steadystate optical conductivity spectrum for strong fields these peaks are suppressed and a new peak appears on the highenergy side that is the charge densities mainly oscillate with a single frequency although the oscillation is eventually damped in the twodimensional case without intersite repulsion and in the onedimensional case this frequency corresponds to chargetransfer processes by which all the bonds connecting the two classes of sites are exploited thus this oscillation behaves as an electronic breathing mode the relevance of the new peak to a recently found reflectivity peak in kappabedtttf_2x after photoexcitation is discussed
|
[['photoinduced', 'charge', 'dynamics', 'in', 'dimerized', 'systems', 'is', 'studied', 'on', 'the', 'basis', 'of', 'the', 'exact', 'diagonalization', 'method', 'and', 'the', 'timedependent', 'schrodinger', 'equation', 'for', 'a', 'onedimensional', 'spinlessfermion', 'model', 'at', 'half', 'filling', 'and', 'a', 'twodimensional', 'model', 'for', 'kappabisethylenedithiotetrathiafulvalene_2x', 'kappabedtttf_2x', 'at', 'threequarter', 'filling', 'after', 'the', 'application', 'of', 'a', 'onecycle', 'pulse', 'of', 'a', 'specifically', 'polarized', 'electric', 'field', 'the', 'charge', 'densities', 'at', 'half', 'of', 'the', 'sites', 'of', 'the', 'system', 'oscillate', 'in', 'the', 'same', 'phase', 'and', 'those', 'at', 'the', 'other', 'half', 'oscillate', 'in', 'the', 'opposite', 'phase', 'for', 'weak', 'fields', 'the', 'fourier', 'transform', 'of', 'the', 'time', 'profile', 'of', 'the', 'charge', 'density', 'at', 'any', 'site', 'after', 'photoexcitation', 'has', 'peaks', 'for', 'finitesized', 'systems', 'that', 'correspond', 'to', 'those', 'of', 'the', 'steadystate', 'optical', 'conductivity', 'spectrum', 'for', 'strong', 'fields', 'these', 'peaks', 'are', 'suppressed', 'and', 'a', 'new', 'peak', 'appears', 'on', 'the', 'highenergy', 'side', 'that', 'is', 'the', 'charge', 'densities', 'mainly', 'oscillate', 'with', 'a', 'single', 'frequency', 'although', 'the', 'oscillation', 'is', 'eventually', 'damped', 'in', 'the', 'twodimensional', 'case', 'without', 'intersite', 'repulsion', 'and', 'in', 'the', 'onedimensional', 'case', 'this', 'frequency', 'corresponds', 'to', 'chargetransfer', 'processes', 'by', 'which', 'all', 'the', 'bonds', 'connecting', 'the', 'two', 'classes', 'of', 'sites', 'are', 'exploited', 'thus', 'this', 'oscillation', 'behaves', 'as', 'an', 'electronic', 'breathing', 'mode', 'the', 'relevance', 'of', 'the', 'new', 'peak', 'to', 'a', 'recently', 'found', 'reflectivity', 'peak', 'in', 'kappabedtttf_2x', 'after', 'photoexcitation', 'is', 'discussed']]
|
[-0.15954515390703683, 0.19749928419250282, -0.03571404418044981, 0.048177698625967345, 0.016260021212487825, -0.13854736060115136, 0.05810148559116157, 0.3753151856546332, -0.2454431695849841, -0.2299189527657828, 0.07067886951122561, -0.3260212904450213, -0.08444947296560838, 0.1797863391796907, 0.07599150732600043, -0.01987978436621686, -0.006093523844737064, 0.03980677622930133, -0.08621438098968158, -0.17809361559820586, 0.2913348391431893, 0.03805224189599012, 0.3047422713512931, 0.04938333736172891, 0.04436285318141537, 0.015775161591161206, 0.06836443005606825, -0.010554870237307301, -0.10872194988303531, 0.03949229080523043, 0.202421273767783, -0.04728422552952772, 0.24220772858782502, -0.4351565234656698, -0.19676636530400662, 0.06122842008761804, 0.14399830643041747, 0.15837179512196115, -0.05157798995192764, -0.26335494037031704, 0.0018159732465710253, -0.12481708699273028, -0.1778836804946765, -0.007157809594018141, 0.04415682955872121, 0.054840054009752025, -0.2423887388761215, 0.14381276564259687, 0.03829583584840222, 0.02939098234302158, -0.09667361274951142, -0.09920237693199291, -0.07292736171207992, 0.08972556592456152, 0.026474662137727065, 0.04001974136674125, 0.12609514280502213, -0.13067031450159022, -0.07685130602150256, 0.36311940189561087, -0.064915416914777, -0.12293569676766145, 0.1627341998841962, -0.21179626806721716, -0.09486509535204747, 0.21499184243211275, 0.11520956897433719, 0.09445242361817051, -0.11112886293231523, 0.05979187905374373, -0.0070634155283025996, 0.15800473180323096, 0.07756253797675625, 0.06474025547447078, 0.26272146811300495, 0.15804718441348248, 0.06461873307842486, 0.13868553803922848, -0.11590168887767666, -0.09069903643705465, -0.26262608964656814, -0.13171626461653746, -0.19988937736841567, 0.034413133178988996, -0.028581710747575612, -0.1658204674968505, 0.4744767005844363, 0.09596889051998704, 0.1896243269906237, -0.013092083736607264, 0.2520520521759106, 0.1855266582641723, 0.0653175055966919, 0.024247184260736857, 0.24097902958597897, 0.13713956099999106, 0.14580234191770403, -0.26640864916310963, -0.0005055260454566021, 0.04516489327807218]
|
1,803.05112
|
Uplift Modeling from Separate Labels
|
Uplift modeling is aimed at estimating the incremental impact of an action on
an individual's behavior, which is useful in various application domains such
as targeted marketing (advertisement campaigns) and personalized medicine
(medical treatments). Conventional methods of uplift modeling require every
instance to be jointly equipped with two types of labels: the taken action and
its outcome. However, obtaining two labels for each instance at the same time
is difficult or expensive in many real-world problems. In this paper, we
propose a novel method of uplift modeling that is applicable to a more
practical setting where only one type of labels is available for each instance.
We show a mean squared error bound for the proposed estimator and demonstrate
its effectiveness through experiments.
|
stat.ML
|
uplift modeling is aimed at estimating the incremental impact of an action on an individuals behavior which is useful in various application domains such as targeted marketing advertisement campaigns and personalized medicine medical treatments conventional methods of uplift modeling require every instance to be jointly equipped with two types of labels the taken action and its outcome however obtaining two labels for each instance at the same time is difficult or expensive in many realworld problems in this paper we propose a novel method of uplift modeling that is applicable to a more practical setting where only one type of labels is available for each instance we show a mean squared error bound for the proposed estimator and demonstrate its effectiveness through experiments
|
[['uplift', 'modeling', 'is', 'aimed', 'at', 'estimating', 'the', 'incremental', 'impact', 'of', 'an', 'action', 'on', 'an', 'individuals', 'behavior', 'which', 'is', 'useful', 'in', 'various', 'application', 'domains', 'such', 'as', 'targeted', 'marketing', 'advertisement', 'campaigns', 'and', 'personalized', 'medicine', 'medical', 'treatments', 'conventional', 'methods', 'of', 'uplift', 'modeling', 'require', 'every', 'instance', 'to', 'be', 'jointly', 'equipped', 'with', 'two', 'types', 'of', 'labels', 'the', 'taken', 'action', 'and', 'its', 'outcome', 'however', 'obtaining', 'two', 'labels', 'for', 'each', 'instance', 'at', 'the', 'same', 'time', 'is', 'difficult', 'or', 'expensive', 'in', 'many', 'realworld', 'problems', 'in', 'this', 'paper', 'we', 'propose', 'a', 'novel', 'method', 'of', 'uplift', 'modeling', 'that', 'is', 'applicable', 'to', 'a', 'more', 'practical', 'setting', 'where', 'only', 'one', 'type', 'of', 'labels', 'is', 'available', 'for', 'each', 'instance', 'we', 'show', 'a', 'mean', 'squared', 'error', 'bound', 'for', 'the', 'proposed', 'estimator', 'and', 'demonstrate', 'its', 'effectiveness', 'through', 'experiments']]
|
[-0.054302160408559855, 0.017166788158114864, -0.04242670716248392, 0.07894803272423948, -0.1220654040476595, -0.19146272061180655, 0.039104814581550296, 0.41716463627611716, -0.23813174295473874, -0.3021821966394782, 0.15302845520796482, -0.28356529022301963, -0.18647220930864475, 0.23912517570633046, -0.12166957627239872, 0.03912561880594983, 0.11103168409696318, 0.07651411357564791, -0.03352122511373969, -0.2918692381855676, 0.29361363544603963, 0.01729494562690578, 0.3159585214538, 0.04258290221971437, 0.13142447752075467, 0.03006162479466842, -0.039078463440594395, 0.030736369966733748, -0.06087692801461307, 0.1475896497419846, 0.3302202131902057, 0.1952757550653343, 0.3794338123653296, -0.39949819359741917, -0.2414043999118049, 0.1322692254770214, 0.12796463095204436, 0.1095975284583912, -0.06375445606817806, -0.2647906413180678, 0.07517975356762971, -0.17680822395363716, -0.04967044808947277, -0.0884235125438242, -5.790227418386839e-06, -0.026304610507994344, -0.34055526898340965, 0.029199206381960493, 0.000405305613218466, 0.06977598520556116, -0.077567032827973, -0.12725292219651665, 0.03432088134700539, 0.20115703407758317, 0.0852128481189531, 0.0011979967196721856, 0.11097803037960037, -0.17756814431073523, -0.14930934850429375, 0.4060387234165659, -0.023088491067472027, -0.22870338017999278, 0.21278747473654103, -0.040353429914505135, -0.15776123397991182, 0.09391657059550346, 0.2257849240327269, 0.18710941485909185, -0.15497685087242777, 0.019413627103459452, -0.003606636516325842, 0.15719116031101382, 0.019383466868790063, -0.016775615520896466, 0.16728138698953984, 0.23888226409965171, 0.08856579496258325, 0.1257458689984131, -0.08653161423167259, -0.03146158029302591, -0.27810206122666115, -0.1504192858072172, -0.17871382101098213, 0.012265233527414682, -0.10556132840032867, -0.15338419156709338, 0.3681249776646889, 0.20732567722841008, 0.17695164231477473, 0.04351665541563728, 0.34313788549686836, 0.06804335104373503, 0.04499016848309496, 0.07241831174616255, 0.14732411118769428, -0.0011749066965185044, 0.07628798320495743, -0.1778658088732026, 0.12421033295946635, 0.05025560843447844]
|
1,803.05113
|
Star product on $L^2(S^n)$, $n = 2, 3, 5$
|
We consider the bounded linear operators with domain in the Hilbert space
$L^2(S^n)$, $n=2,3,5$ and describe its symbolic calculus defined by the Berezin
quantization. In particular, we derive an explicit formula for the composition
of Berezin's symbols and thus a noncommutative invariant star product, which in
turn is invariant under the action of the group $SU(2)$, $SU(2)\times SU(2)$
and $SU(4)$ on $\mathbb C^2$ , $\mathbb C^4$ and $\mathbb C^8$ respectively.
|
math-ph math.MP
|
we consider the bounded linear operators with domain in the hilbert space l2sn n235 and describe its symbolic calculus defined by the berezin quantization in particular we derive an explicit formula for the composition of berezins symbols and thus a noncommutative invariant star product which in turn is invariant under the action of the group su2 su2times su2 and su4 on mathbb c2 mathbb c4 and mathbb c8 respectively
|
[['we', 'consider', 'the', 'bounded', 'linear', 'operators', 'with', 'domain', 'in', 'the', 'hilbert', 'space', 'l2sn', 'n235', 'and', 'describe', 'its', 'symbolic', 'calculus', 'defined', 'by', 'the', 'berezin', 'quantization', 'in', 'particular', 'we', 'derive', 'an', 'explicit', 'formula', 'for', 'the', 'composition', 'of', 'berezins', 'symbols', 'and', 'thus', 'a', 'noncommutative', 'invariant', 'star', 'product', 'which', 'in', 'turn', 'is', 'invariant', 'under', 'the', 'action', 'of', 'the', 'group', 'su2', 'su2times', 'su2', 'and', 'su4', 'on', 'mathbb', 'c2', 'mathbb', 'c4', 'and', 'mathbb', 'c8', 'respectively']]
|
[-0.17331967015257654, 0.12556734204019235, -0.039707543766673875, 0.05664029672420036, -0.0835777334012913, -0.1081006484626628, -0.027043620590120554, 0.3424856600296848, -0.25175290215103063, -0.15678156259031417, 0.15164991188965574, -0.21569556669633397, -0.13892028937527143, 0.12087531527846723, -0.13871598401216462, 0.013986703007557319, -0.05089431994950727, 0.14033642817316028, -0.19992838065852137, -0.2528432102647939, 0.385493075591512, -0.06697076583719429, 0.20519418479970603, 0.020166401514228816, 0.1402302869280581, 0.024292305810377002, -0.032230118659379726, -0.12477021041944253, -0.16606574909597197, 0.12654670137528548, 0.24179966405362768, 0.05175962255067562, 0.12621981453369646, -0.4114069509429528, -0.15088290273321464, 0.15410336554187404, 0.14148326611201115, -0.02974146291757386, -0.0201323733165148, -0.3636956312556696, 0.05215078524163212, -0.18058849870816202, -0.12042152431711335, -0.10062195582534461, 0.0760028711246217, -0.05414802854990258, -0.28637561180135784, 0.02121326106134802, 0.11040520606398144, 0.11265578690697164, -0.11028405528358075, -0.07529180392842083, -0.08419925855089198, 0.05786644923500717, -0.0015316493655144073, 0.14392714714631438, 0.1041701357702122, -0.0397010703352006, -0.09366959933301106, 0.3903602311278091, -0.10263839232485385, -0.2946687120505992, 0.06385241146199405, -0.18389693082666353, -0.20187576117528164, 0.057849555824171096, 0.10127376970451545, 0.1766018315547091, -0.06245181160321569, 0.2858801989590147, -0.09063306623412405, 0.08084375756409239, 0.07825954942895538, 0.06300890935338377, 0.11065713590120568, 0.02432774060392095, 0.09273917100611417, 0.1662724485333242, -6.170111352249103e-06, -0.14772884532987304, -0.3846210822024766, -0.17878599479274057, -0.1101194485090673, 0.13623217018047237, -0.1370128248056383, -0.1330706421559786, 0.372455985415453, 0.011183111051864484, 0.18041239819242894, 0.09378546657321482, 0.19174327179515624, 0.14470522337154867, 0.06888963949784417, 0.041467337697908724, 0.07510731078903465, 0.19851298594970584, 0.003720014582059401, -0.23214849048321518, -0.06904024593806003, 0.21625835154790204]
|
1,803.05114
|
Correlation and scaling behaviors of $PM_{2.5}$ concentration in China
|
Air pollution has become a major issue and caused widespread environmental
and health problems. Aerosols or particulate matters are an important component
of the atmosphere and can transport under complex meteorological conditions.
Based on the data of $PM_{2.5}$ observations, we develop a network approach to
study and quantify their spreading and diffusion patterns. We calculate
cross-correlation functions of time lag between sites within different season.
The probability distribution of correlation changes with season. It is found
that the probability distributions in four seasons can be scaled into one
scaling function with averages and standard deviations of correlation. This
seasonal scaling behavior indicates there is the same mechanism behind
correlations of $PM_{2.5}$ concentration in different seasons. Further, from
weighted and directional degrees of complex network, different properties of
$PM_{2.5}$ concentration are studied. The weighted degrees reveal the strongest
correlations of $PM_{2.5}$ concentration in winter and in the North China
plain. These directional degrees show net influences of $PM_{2.5}$ along Gobi
and inner Mongolia, the North China plain, Central China, and Yangtze River
Delta.
|
physics.ao-ph physics.soc-ph
|
air pollution has become a major issue and caused widespread environmental and health problems aerosols or particulate matters are an important component of the atmosphere and can transport under complex meteorological conditions based on the data of pm_25 observations we develop a network approach to study and quantify their spreading and diffusion patterns we calculate crosscorrelation functions of time lag between sites within different season the probability distribution of correlation changes with season it is found that the probability distributions in four seasons can be scaled into one scaling function with averages and standard deviations of correlation this seasonal scaling behavior indicates there is the same mechanism behind correlations of pm_25 concentration in different seasons further from weighted and directional degrees of complex network different properties of pm_25 concentration are studied the weighted degrees reveal the strongest correlations of pm_25 concentration in winter and in the north china plain these directional degrees show net influences of pm_25 along gobi and inner mongolia the north china plain central china and yangtze river delta
|
[['air', 'pollution', 'has', 'become', 'a', 'major', 'issue', 'and', 'caused', 'widespread', 'environmental', 'and', 'health', 'problems', 'aerosols', 'or', 'particulate', 'matters', 'are', 'an', 'important', 'component', 'of', 'the', 'atmosphere', 'and', 'can', 'transport', 'under', 'complex', 'meteorological', 'conditions', 'based', 'on', 'the', 'data', 'of', 'pm_25', 'observations', 'we', 'develop', 'a', 'network', 'approach', 'to', 'study', 'and', 'quantify', 'their', 'spreading', 'and', 'diffusion', 'patterns', 'we', 'calculate', 'crosscorrelation', 'functions', 'of', 'time', 'lag', 'between', 'sites', 'within', 'different', 'season', 'the', 'probability', 'distribution', 'of', 'correlation', 'changes', 'with', 'season', 'it', 'is', 'found', 'that', 'the', 'probability', 'distributions', 'in', 'four', 'seasons', 'can', 'be', 'scaled', 'into', 'one', 'scaling', 'function', 'with', 'averages', 'and', 'standard', 'deviations', 'of', 'correlation', 'this', 'seasonal', 'scaling', 'behavior', 'indicates', 'there', 'is', 'the', 'same', 'mechanism', 'behind', 'correlations', 'of', 'pm_25', 'concentration', 'in', 'different', 'seasons', 'further', 'from', 'weighted', 'and', 'directional', 'degrees', 'of', 'complex', 'network', 'different', 'properties', 'of', 'pm_25', 'concentration', 'are', 'studied', 'the', 'weighted', 'degrees', 'reveal', 'the', 'strongest', 'correlations', 'of', 'pm_25', 'concentration', 'in', 'winter', 'and', 'in', 'the', 'north', 'china', 'plain', 'these', 'directional', 'degrees', 'show', 'net', 'influences', 'of', 'pm_25', 'along', 'gobi', 'and', 'inner', 'mongolia', 'the', 'north', 'china', 'plain', 'central', 'china', 'and', 'yangtze', 'river', 'delta']]
|
[-0.11196020770033724, 0.16500179091550488, -0.09625918274385888, 0.11762783970147349, 0.012765847093409352, -0.06468056407566482, 0.029719593263454518, 0.3689571978301028, -0.2585338214140015, -0.309421591068569, 0.11302641901454469, -0.3452334812902219, -0.1580612185637178, 0.14516142776442897, -0.04855014988471759, 0.0025186616136305775, 0.0270952457529411, -0.028770603458751102, -0.01986427585953814, -0.2277491439539549, 0.27434923185024696, 0.08166779874693275, 0.3307066706896961, 0.08792887630903745, 0.09697746728922714, 0.004918657156110507, -0.07724781362993415, 0.005633025728329493, -0.09160314396464392, 0.07998014872716515, 0.24127557426718288, 0.12856821117416156, 0.2532407698427104, -0.4365730177208084, -0.2481936272288188, 0.12414979802346543, 0.08414207660859963, -0.0038921433931205706, 0.010640921740389664, -0.26343697792038934, -0.006942718480414117, -0.16037840755351368, -0.1459516317621745, 0.008741870666826851, 0.02324370317139298, 0.06854922161846046, -0.26656696414820064, 0.1516581669515162, -0.014277836923318648, 0.1441598974865431, -0.049486769496719214, -0.17107754385055243, -0.06842908766583611, 0.1897563524231075, 0.1053125738732691, -0.02004332051405476, 0.1647211306126603, -0.106408663040942, -0.042428410339049386, 0.32918634366554517, -0.08241500915164313, -0.10927602956997372, 0.1864704278240536, -0.20616145591572885, -0.12166383445851113, 0.10700038934197299, 0.2423596516447632, 0.05767911720792191, -0.169900904485836, -0.025647042706548863, -0.0338074610601261, 0.20299740941692634, 0.1099986105963958, 0.009856471938914374, 0.21922685933566233, 0.14580206839198911, 0.09915399675567944, 0.11953001392103885, -0.20037143498152626, -0.1387821888355048, -0.2013249911779091, -0.11900675507011818, -0.09925193965641989, 0.004219592595200616, -0.1374778977494172, -0.1184662458042979, 0.4138888007095247, 0.13802606886326285, 0.15470899756533524, 0.0193558640897884, 0.23441667165008118, 0.04657322453261402, 0.05782144321319348, 0.0775079069528402, 0.20376899159834747, 0.08962225137312137, 0.14311531589949253, -0.1998474487683556, 0.17707440118735646, -0.018257873815148033]
|
1,803.05115
|
Continuity of vortices from the hadronic to the color-flavor locked
phase in dense matter
|
We study how vortices in dense superfluid hadronic matter can connect to
vortices in superfluid quark matter, as in rotating neutron stars, focusing on
the extent to which quark-hadron continuity can be maintained. As we show, a
singly quantized vortex in three-flavor symmetric hadronic matter can connect
smoothly to a singly quantized non-Abelian vortex in three-flavor symmetric
quark matter in the color-flavor locked (CFL) phase, without the necessity for
boojums appearing at the transition.
|
hep-ph nucl-th
|
we study how vortices in dense superfluid hadronic matter can connect to vortices in superfluid quark matter as in rotating neutron stars focusing on the extent to which quarkhadron continuity can be maintained as we show a singly quantized vortex in threeflavor symmetric hadronic matter can connect smoothly to a singly quantized nonabelian vortex in threeflavor symmetric quark matter in the colorflavor locked cfl phase without the necessity for boojums appearing at the transition
|
[['we', 'study', 'how', 'vortices', 'in', 'dense', 'superfluid', 'hadronic', 'matter', 'can', 'connect', 'to', 'vortices', 'in', 'superfluid', 'quark', 'matter', 'as', 'in', 'rotating', 'neutron', 'stars', 'focusing', 'on', 'the', 'extent', 'to', 'which', 'quarkhadron', 'continuity', 'can', 'be', 'maintained', 'as', 'we', 'show', 'a', 'singly', 'quantized', 'vortex', 'in', 'threeflavor', 'symmetric', 'hadronic', 'matter', 'can', 'connect', 'smoothly', 'to', 'a', 'singly', 'quantized', 'nonabelian', 'vortex', 'in', 'threeflavor', 'symmetric', 'quark', 'matter', 'in', 'the', 'colorflavor', 'locked', 'cfl', 'phase', 'without', 'the', 'necessity', 'for', 'boojums', 'appearing', 'at', 'the', 'transition']]
|
[-0.1461327760983762, 0.3856410996585682, -0.1154087512640635, 0.08912456755501193, -0.10778487441004128, -0.08688090275973082, 0.07808887811276961, 0.32568564142629103, -0.19214495009667165, -0.22503268766544154, -0.009392558593881896, -0.22853149104913748, 0.013137505666629688, 0.025946656009182334, -0.019020204784701, 0.03031240844142598, -0.05218176395204421, 0.06815753896041093, -0.17812784228826295, -0.20025987356013894, 0.35484009911935477, -0.1071559939332105, 0.2553624085628906, 0.07420153966223872, -0.02801759254086662, -0.11073457918796889, 0.0062253005123017605, -0.020302275938258785, -0.1122874949077094, -0.07572893712770294, 0.2630267772820426, -0.033358091872336494, 0.05916865825860736, -0.5113121332550371, -0.21451198972283383, 0.16384515423969542, 0.2338481983673331, 0.17645109670607978, -0.08724322666672084, -0.33489779080893545, 0.09912710392696632, -0.24621188955230489, -0.18383629116657618, -0.15293606305243196, -0.0469619456452091, 0.014034560280600312, -0.2312339532465951, 0.10821446403389091, 0.005264227070870834, -0.05809719687267962, -0.007581876789068652, -0.07774228152089022, -0.08559279811467875, 0.0035923666861915103, 0.020339097223571828, 0.0752689314351694, 0.1444887356215937, -0.27329282161804874, -0.07187306353620984, 0.46285653461676995, -0.11646063887589686, -0.16378352753314618, 0.1056021917107943, -0.20486140000709407, -0.11586477150637153, 0.13219932728522532, 0.19104981992544756, 0.10115372423535667, -0.07631614235405987, 0.036948624104764814, -0.11674838191577913, 0.15969713630997953, 0.13644526868655876, 0.03564037226543233, 0.4287351899956529, 0.19989208578811707, 0.0010166203200414373, 0.14333978943319084, -0.08976045926416142, -0.16641879665375864, -0.34788875366762484, -0.12035952363087721, -0.15804870509718721, -0.0010344759133216496, -0.017170744919771882, -0.16378754266613238, 0.3348104290119876, 0.06314525887294598, 0.15524011603603768, -0.0908787370694021, 0.28700167907880164, 0.02868112798062833, 0.03149128985918454, 0.12043861277099396, 0.29990572872496135, 0.27015283973132437, 0.18491860533863105, -0.32993002047107833, -0.0873217025796908, 0.12725300613690066]
|
1,803.05116
|
Extending automorphisms of the genus-2 surface over the 3-sphere
|
An automorphism $f$ of a closed orientable surface $\Sigma$ is said to be
extendable over the 3-sphere $S^3$ if $f$ extends to an automorphism of the
pair $(S^3, \Sigma)$ with respect to some embedding $\Sigma \hookrightarrow
S^3$. We prove that if an automorphism of a genus-2 surface $\Sigma$ is
extendable over $S^3$, then $f$ extends to an automorphism of the pair $(S^3,
\Sigma)$ with respect to an embedding $\Sigma \hookrightarrow S^3$ such that
$\Sigma$ bounds genus-2 handlebodies on both sides. The classification of
essential annuli in the exterior of genus-2 handlebodies embedded in $S^3$ due
to Ozawa and the second author plays a key role.
|
math.GT
|
an automorphism f of a closed orientable surface sigma is said to be extendable over the 3sphere s3 if f extends to an automorphism of the pair s3 sigma with respect to some embedding sigma hookrightarrow s3 we prove that if an automorphism of a genus2 surface sigma is extendable over s3 then f extends to an automorphism of the pair s3 sigma with respect to an embedding sigma hookrightarrow s3 such that sigma bounds genus2 handlebodies on both sides the classification of essential annuli in the exterior of genus2 handlebodies embedded in s3 due to ozawa and the second author plays a key role
|
[['an', 'automorphism', 'f', 'of', 'a', 'closed', 'orientable', 'surface', 'sigma', 'is', 'said', 'to', 'be', 'extendable', 'over', 'the', '3sphere', 's3', 'if', 'f', 'extends', 'to', 'an', 'automorphism', 'of', 'the', 'pair', 's3', 'sigma', 'with', 'respect', 'to', 'some', 'embedding', 'sigma', 'hookrightarrow', 's3', 'we', 'prove', 'that', 'if', 'an', 'automorphism', 'of', 'a', 'genus2', 'surface', 'sigma', 'is', 'extendable', 'over', 's3', 'then', 'f', 'extends', 'to', 'an', 'automorphism', 'of', 'the', 'pair', 's3', 'sigma', 'with', 'respect', 'to', 'an', 'embedding', 'sigma', 'hookrightarrow', 's3', 'such', 'that', 'sigma', 'bounds', 'genus2', 'handlebodies', 'on', 'both', 'sides', 'the', 'classification', 'of', 'essential', 'annuli', 'in', 'the', 'exterior', 'of', 'genus2', 'handlebodies', 'embedded', 'in', 's3', 'due', 'to', 'ozawa', 'and', 'the', 'second', 'author', 'plays', 'a', 'key', 'role']]
|
[-0.22509999025967858, 0.03877012456720141, -0.07035789036945927, 0.040456384724183454, -0.12282946181394869, -0.15628256858991726, -0.06406553460373765, 0.3634314112986127, -0.28064200888787, -0.23851780141149426, 0.08692180675986622, -0.3357404524194343, -0.13221217125565524, 0.20109657077118753, -0.16662267850534546, -0.06004232571770748, 0.02309071219836672, 0.1620744833313871, -0.14681547851845, -0.29888258753344416, 0.33337573443229, -0.1052855598252444, 0.12306594507147868, 0.1352480301367385, 0.10557421843654342, -0.014915986228290767, 0.03910185175371312, -0.01841272899792308, -0.22036865333696673, 0.1201829304031673, 0.26443312156590676, 0.028481911763637548, 0.09495899972860657, -0.37513735482380506, -0.18251923927704672, 0.2189818275826318, 0.18582081721119936, -0.11072762874176814, 0.0012743705052084156, -0.30198369653718105, 0.10294457629677795, -0.15531493109606562, -0.15581287154484363, 0.01422794758386555, 0.13966052846184798, -0.0661434316120687, -0.18708075862377882, -0.048622114903160506, 0.13443954388300577, 0.07980143944954589, -0.0033615640985469025, -0.06486132203468255, -0.1550561596240316, 0.1114641473584232, 0.016532424531344857, 0.24235096126794814, 0.0895309993598078, -0.08177362786428559, -0.06926301336802897, 0.3719614494059767, -0.1612855549591283, -0.313343762517685, 0.09902528712437267, -0.12175392196846328, -0.19172038916675818, 0.21250065021837752, 0.07184441404505855, 0.12364290842254247, -0.01581391833190407, 0.26972630932162117, -0.126321421031441, 0.18085758807137609, 0.10031484251043626, -0.05085012731807573, 0.1672011421749457, 0.11088264514470385, 0.1523405765050224, 0.14380492928016575, -0.035308981409651184, 0.015674535708413238, -0.3821883726598961, -0.21364175104314373, -0.0692387207499927, 0.17224168742873838, -0.14105461292575847, -0.1539489767813523, 0.3583613223085801, -0.04353805524962289, 0.2012099442925925, 0.1250933671902333, 0.18943664832484156, 0.008936999401166325, 0.030483212880790235, 0.1315898188788976, 0.06517008741835266, 0.22616804492260728, -0.1632159411973719, -0.14957942676625124, -0.0954495541263549, 0.18295157957112507]
|
1,803.05117
|
MT-Spike: A Multilayer Time-based Spiking Neuromorphic Architecture with
Temporal Error Backpropagation
|
Modern deep learning enabled artificial neural networks, such as Deep Neural
Network (DNN) and Convolutional Neural Network (CNN), have achieved a series of
breaking records on a broad spectrum of recognition applications. However, the
enormous computation and storage requirements associated with such deep and
complex neural network models greatly challenge their implementations on
resource-limited platforms. Time-based spiking neural network has recently
emerged as a promising solution in Neuromorphic Computing System designs for
achieving remarkable computing and power efficiency within a single chip.
However, the relevant research activities have been narrowly concentrated on
the biological plausibility and theoretical learning approaches, causing
inefficient neural processing and impracticable multilayer extension thus
significantly limitations on speed and accuracy when handling the realistic
cognitive tasks. In this work, a practical multilayer time-based spiking
neuromorphic architecture, namely "MT-Spike", is developed to fill this gap.
With the proposed practical time-coding scheme, average delay response model,
temporal error backpropagation algorithm, and heuristic loss function,
"MT-Spike" achieves more efficient neural processing through flexible neural
model size reduction while offering very competitive classification accuracy
for realistic recognition tasks. Simulation results well validated that the
algorithmic power of deep multi-layer learning can be seamlessly merged with
the efficiency of time-based spiking neuromorphic architecture, demonstrating
great potentials of "MT-Spike" in resource and power constrained embedded
platforms.
|
cs.NE q-bio.NC
|
modern deep learning enabled artificial neural networks such as deep neural network dnn and convolutional neural network cnn have achieved a series of breaking records on a broad spectrum of recognition applications however the enormous computation and storage requirements associated with such deep and complex neural network models greatly challenge their implementations on resourcelimited platforms timebased spiking neural network has recently emerged as a promising solution in neuromorphic computing system designs for achieving remarkable computing and power efficiency within a single chip however the relevant research activities have been narrowly concentrated on the biological plausibility and theoretical learning approaches causing inefficient neural processing and impracticable multilayer extension thus significantly limitations on speed and accuracy when handling the realistic cognitive tasks in this work a practical multilayer timebased spiking neuromorphic architecture namely mtspike is developed to fill this gap with the proposed practical timecoding scheme average delay response model temporal error backpropagation algorithm and heuristic loss function mtspike achieves more efficient neural processing through flexible neural model size reduction while offering very competitive classification accuracy for realistic recognition tasks simulation results well validated that the algorithmic power of deep multilayer learning can be seamlessly merged with the efficiency of timebased spiking neuromorphic architecture demonstrating great potentials of mtspike in resource and power constrained embedded platforms
|
[['modern', 'deep', 'learning', 'enabled', 'artificial', 'neural', 'networks', 'such', 'as', 'deep', 'neural', 'network', 'dnn', 'and', 'convolutional', 'neural', 'network', 'cnn', 'have', 'achieved', 'a', 'series', 'of', 'breaking', 'records', 'on', 'a', 'broad', 'spectrum', 'of', 'recognition', 'applications', 'however', 'the', 'enormous', 'computation', 'and', 'storage', 'requirements', 'associated', 'with', 'such', 'deep', 'and', 'complex', 'neural', 'network', 'models', 'greatly', 'challenge', 'their', 'implementations', 'on', 'resourcelimited', 'platforms', 'timebased', 'spiking', 'neural', 'network', 'has', 'recently', 'emerged', 'as', 'a', 'promising', 'solution', 'in', 'neuromorphic', 'computing', 'system', 'designs', 'for', 'achieving', 'remarkable', 'computing', 'and', 'power', 'efficiency', 'within', 'a', 'single', 'chip', 'however', 'the', 'relevant', 'research', 'activities', 'have', 'been', 'narrowly', 'concentrated', 'on', 'the', 'biological', 'plausibility', 'and', 'theoretical', 'learning', 'approaches', 'causing', 'inefficient', 'neural', 'processing', 'and', 'impracticable', 'multilayer', 'extension', 'thus', 'significantly', 'limitations', 'on', 'speed', 'and', 'accuracy', 'when', 'handling', 'the', 'realistic', 'cognitive', 'tasks', 'in', 'this', 'work', 'a', 'practical', 'multilayer', 'timebased', 'spiking', 'neuromorphic', 'architecture', 'namely', 'mtspike', 'is', 'developed', 'to', 'fill', 'this', 'gap', 'with', 'the', 'proposed', 'practical', 'timecoding', 'scheme', 'average', 'delay', 'response', 'model', 'temporal', 'error', 'backpropagation', 'algorithm', 'and', 'heuristic', 'loss', 'function', 'mtspike', 'achieves', 'more', 'efficient', 'neural', 'processing', 'through', 'flexible', 'neural', 'model', 'size', 'reduction', 'while', 'offering', 'very', 'competitive', 'classification', 'accuracy', 'for', 'realistic', 'recognition', 'tasks', 'simulation', 'results', 'well', 'validated', 'that', 'the', 'algorithmic', 'power', 'of', 'deep', 'multilayer', 'learning', 'can', 'be', 'seamlessly', 'merged', 'with', 'the', 'efficiency', 'of', 'timebased', 'spiking', 'neuromorphic', 'architecture', 'demonstrating', 'great', 'potentials', 'of', 'mtspike', 'in', 'resource', 'and', 'power', 'constrained', 'embedded', 'platforms']]
|
[-0.08860839107740635, -0.041405864540343236, -0.009503590874100637, 0.027543262368944766, -0.09282377148877846, -0.259619917674646, 0.023691764140737728, 0.49084050560090253, -0.2672676374947766, -0.34741597160906856, 0.05382491341363551, -0.21001758015421634, -0.2768345953188312, 0.24657953265800792, -0.12151141243234186, 0.1949811150263033, 0.15182006212187485, 0.0039056273928397725, -0.03516506003062875, -0.2827608704287122, 0.18364552421792643, 0.1166658595793535, 0.42598880139647377, 0.03464084520428813, 0.13938524586215786, -0.0759467599474051, 0.022700082844105754, -0.046581669359690915, -0.006218315657353118, 0.22155771424945775, 0.33108027591643663, 0.2104533333735794, 0.3797810979793067, -0.4969816542683637, -0.30840169121576866, 0.08280520215018394, 0.1839703654678005, 0.06707604779826888, -0.06968988023706255, -0.3148697153829091, 0.09276283617861604, -0.23394481195333663, 0.02308231735374656, -0.16826823080587638, 0.009889940530643251, 0.017000064538013487, -0.24231414510234492, 0.006495329004847948, 0.05986343884617615, 0.08182002194313236, -0.010479840149112622, -0.1176401748919877, 0.05612188541361004, 0.12022818571151707, -0.04909168434670379, 0.04695491757934712, 0.18937102048368162, -0.21861599311489446, -0.17384894905850168, 0.31656079189283465, -0.013207750108547753, -0.1689552685175913, 0.196118064084803, 0.049746201572581215, -0.17535125435998952, 0.08753035823375144, 0.2809291522263466, 0.049482430653873956, -0.15736404328724257, 0.020461959844977624, 0.04072066575688848, 0.1797149406233365, 0.04340384244818258, 0.05661829773494056, 0.20658691307232482, 0.3824976969438172, 0.009896246736807456, 0.11883185823511402, -0.10160751189427678, -0.12529804539962938, -0.12619644441278957, -0.07103534765703333, -0.20445623595110127, 0.01924703860034545, -0.12857871447484054, -0.13949060956444678, 0.41349799979533525, 0.18277922323620724, 0.16948529488096634, 0.15263627785227388, 0.40384497439506256, 0.0613205937172413, 0.18945230930462095, 0.13072873048807884, 0.1816225394840514, 0.049242965673739224, 0.20311522657328238, -0.1673246289279854, 0.08547755062772494, -0.012992839584730461]
|
1,803.05118
|
Spectrum Sensing: Enhanced Energy Detection Technique Based on Noise
Measurement
|
Spectrum sensing enables cognitive radio systems to detect unused portions of
the radio spectrum and then use them while avoiding interferences to the
primary users. Energy detection is one of the most used techniques for spectrum
sensing because it does not require any prior information about the
characteristics of the primary user signal. However, this technique does not
distinguish between the signal and the noise. It has a low performance at low
SNR, and the selection of the threshold becomes an issue because the noise is
uncertain. The detection performance of this technique can be further improved
using a dynamic selection of the sensing threshold. In this work, we
investigate a dynamic selection of this threshold by measuring the power of
noise present in the received signal using a blind technique. The proposed
model was implemented and tested using GNU Radio software and USRP units. Our
results show that the dynamic selection of the threshold based on measuring the
noise level present in the received signal during the detection process
increases the probability of detection and decreases the probability of false
alarm compared to the ones of energy detection with a static threshold.
|
eess.SP
|
spectrum sensing enables cognitive radio systems to detect unused portions of the radio spectrum and then use them while avoiding interferences to the primary users energy detection is one of the most used techniques for spectrum sensing because it does not require any prior information about the characteristics of the primary user signal however this technique does not distinguish between the signal and the noise it has a low performance at low snr and the selection of the threshold becomes an issue because the noise is uncertain the detection performance of this technique can be further improved using a dynamic selection of the sensing threshold in this work we investigate a dynamic selection of this threshold by measuring the power of noise present in the received signal using a blind technique the proposed model was implemented and tested using gnu radio software and usrp units our results show that the dynamic selection of the threshold based on measuring the noise level present in the received signal during the detection process increases the probability of detection and decreases the probability of false alarm compared to the ones of energy detection with a static threshold
|
[['spectrum', 'sensing', 'enables', 'cognitive', 'radio', 'systems', 'to', 'detect', 'unused', 'portions', 'of', 'the', 'radio', 'spectrum', 'and', 'then', 'use', 'them', 'while', 'avoiding', 'interferences', 'to', 'the', 'primary', 'users', 'energy', 'detection', 'is', 'one', 'of', 'the', 'most', 'used', 'techniques', 'for', 'spectrum', 'sensing', 'because', 'it', 'does', 'not', 'require', 'any', 'prior', 'information', 'about', 'the', 'characteristics', 'of', 'the', 'primary', 'user', 'signal', 'however', 'this', 'technique', 'does', 'not', 'distinguish', 'between', 'the', 'signal', 'and', 'the', 'noise', 'it', 'has', 'a', 'low', 'performance', 'at', 'low', 'snr', 'and', 'the', 'selection', 'of', 'the', 'threshold', 'becomes', 'an', 'issue', 'because', 'the', 'noise', 'is', 'uncertain', 'the', 'detection', 'performance', 'of', 'this', 'technique', 'can', 'be', 'further', 'improved', 'using', 'a', 'dynamic', 'selection', 'of', 'the', 'sensing', 'threshold', 'in', 'this', 'work', 'we', 'investigate', 'a', 'dynamic', 'selection', 'of', 'this', 'threshold', 'by', 'measuring', 'the', 'power', 'of', 'noise', 'present', 'in', 'the', 'received', 'signal', 'using', 'a', 'blind', 'technique', 'the', 'proposed', 'model', 'was', 'implemented', 'and', 'tested', 'using', 'gnu', 'radio', 'software', 'and', 'usrp', 'units', 'our', 'results', 'show', 'that', 'the', 'dynamic', 'selection', 'of', 'the', 'threshold', 'based', 'on', 'measuring', 'the', 'noise', 'level', 'present', 'in', 'the', 'received', 'signal', 'during', 'the', 'detection', 'process', 'increases', 'the', 'probability', 'of', 'detection', 'and', 'decreases', 'the', 'probability', 'of', 'false', 'alarm', 'compared', 'to', 'the', 'ones', 'of', 'energy', 'detection', 'with', 'a', 'static', 'threshold']]
|
[-0.12206879328985197, 0.045316029883576726, -0.07039267550719602, 0.03578730151478156, -0.07547303454327961, -0.1505007686773846, 0.10158977810283785, 0.37511644454508863, -0.23883135003759165, -0.3313199474278432, 0.12697263534236314, -0.24573696687711413, -0.1574999570600457, 0.1829310315673196, -0.08127361336008795, 0.05579717452529277, 0.04759866940316025, 0.07933055511989433, -0.036507217348173235, -0.19349003191210976, 0.27630986070134944, 0.1810047903479381, 0.34713907351167245, 0.06408746905354638, 0.0877997140602783, 0.03101093903029521, -0.07904344788448489, -0.019792438672923053, -0.041748892412337875, 0.09004891462324892, 0.2685294899561109, 0.20724897211600926, 0.2842549756434722, -0.35903255137677637, -0.2561625058900256, 0.13020651994051094, 0.1343229900770507, 0.09279930340536324, -0.06377648062572135, -0.28919098509832675, 0.13100370370006006, -0.18240000803682258, -0.047625902675844996, 0.0018357563078635097, -0.04014590116690632, 0.014280364198738063, -0.2862126318342173, 0.05943260229448426, 0.043122114045448946, 0.02175029782443235, -0.03349255650410419, -0.09454467625072506, 0.03992092400581764, 0.17047527645729058, 0.024008168710288325, -0.01262257370715985, 0.17525179652072528, -0.16361927519518632, -0.11449241619122846, 0.370180147482864, -0.04244953234091285, -0.1772780913058572, 0.20340114089641045, -0.11410264468418888, -0.14478761088564496, 0.18311525897093966, 0.1872253996727824, 0.09082328896894762, -0.1590386503810362, 0.02876502358556093, 0.0600849586572749, 0.24287955398512087, 0.06389297752513265, 0.05636839781419755, 0.18163388290978158, 0.18311347699014788, 0.0853443634334392, 0.14247170109072593, -0.19472226273968762, 0.005052654417062786, -0.220251278140476, -0.09626460381074196, -0.20315627952545418, -0.002869842037615255, -0.0401001473464412, -0.1234631625533712, 0.42449847038429944, 0.1988345692296141, 0.16971847945655372, 0.07501112816281076, 0.4002485192462879, 0.14709138199071753, 0.07258148646281327, 0.0711649203977012, 0.2730973843356035, 0.08488000848407766, 0.1135490942695733, -0.22676827550631673, 0.0990945861815633, -0.050425197598596774]
|
1,803.05119
|
Momentum distribution and contacts of one-dimensional spinless Fermi
gases with an attractive p-wave interaction
|
We present a rigorous study of momentum distribution and p-wave contacts of
one dimensional (1D) spinless Fermi gases with an attractive p-wave
interaction. Using the Bethe wave function, we analytically calculate the
large-momentum tail of momentum distribution of the model. We show that the
leading ($\sim 1/p^{2}$) and sub-leading terms ($\sim 1/p^{4}$) of the
large-momentum tail are determined by two contacts $C_2$ and $C_4$, which we
show, by explicit calculation, are related to the short-distance behaviour of
the two-body correlation function and its derivatives. We show as one increases
the 1D scattering length, the contact $C_2$ increases monotonically from zero
while $C_4$ exhibits a peak for finite scattering length. In addition, we
obtain analytic expressions for p-wave contacts at finite temperature from the
thermodynamic Bethe ansatz equations in both weakly and strongly attractive
regimes.
|
cond-mat.quant-gas
|
we present a rigorous study of momentum distribution and pwave contacts of one dimensional 1d spinless fermi gases with an attractive pwave interaction using the bethe wave function we analytically calculate the largemomentum tail of momentum distribution of the model we show that the leading sim 1p2 and subleading terms sim 1p4 of the largemomentum tail are determined by two contacts c_2 and c_4 which we show by explicit calculation are related to the shortdistance behaviour of the twobody correlation function and its derivatives we show as one increases the 1d scattering length the contact c_2 increases monotonically from zero while c_4 exhibits a peak for finite scattering length in addition we obtain analytic expressions for pwave contacts at finite temperature from the thermodynamic bethe ansatz equations in both weakly and strongly attractive regimes
|
[['we', 'present', 'a', 'rigorous', 'study', 'of', 'momentum', 'distribution', 'and', 'pwave', 'contacts', 'of', 'one', 'dimensional', '1d', 'spinless', 'fermi', 'gases', 'with', 'an', 'attractive', 'pwave', 'interaction', 'using', 'the', 'bethe', 'wave', 'function', 'we', 'analytically', 'calculate', 'the', 'largemomentum', 'tail', 'of', 'momentum', 'distribution', 'of', 'the', 'model', 'we', 'show', 'that', 'the', 'leading', 'sim', '1p2', 'and', 'subleading', 'terms', 'sim', '1p4', 'of', 'the', 'largemomentum', 'tail', 'are', 'determined', 'by', 'two', 'contacts', 'c_2', 'and', 'c_4', 'which', 'we', 'show', 'by', 'explicit', 'calculation', 'are', 'related', 'to', 'the', 'shortdistance', 'behaviour', 'of', 'the', 'twobody', 'correlation', 'function', 'and', 'its', 'derivatives', 'we', 'show', 'as', 'one', 'increases', 'the', '1d', 'scattering', 'length', 'the', 'contact', 'c_2', 'increases', 'monotonically', 'from', 'zero', 'while', 'c_4', 'exhibits', 'a', 'peak', 'for', 'finite', 'scattering', 'length', 'in', 'addition', 'we', 'obtain', 'analytic', 'expressions', 'for', 'pwave', 'contacts', 'at', 'finite', 'temperature', 'from', 'the', 'thermodynamic', 'bethe', 'ansatz', 'equations', 'in', 'both', 'weakly', 'and', 'strongly', 'attractive', 'regimes']]
|
[-0.18774151333621633, 0.19351429361278807, -0.07978064689521136, 0.08887911244962754, -0.015460639344111307, -0.16820522867935472, 0.03120085296443483, 0.346393672290689, -0.23194347383148634, -0.20330178616012431, -0.013330789812868322, -0.3839118731644269, -0.11296922939398618, 0.1273081015974436, 0.11161122222104346, 0.05609061669709453, -0.006337790777767772, 0.03884273121464014, -0.1432227693678839, -0.18319746528043232, 0.3375596545094541, -0.008517978782418058, 0.2606949334592322, 0.15162999188499665, 0.049434392323800876, 0.0750598533447387, 0.04542812818327724, -0.020015801817401133, -0.20863814372422718, 0.03755669851106272, 0.1907443207216887, -0.04893228237920288, 0.15342596722349747, -0.4073649988120505, -0.18681924576165654, 0.05246197007276785, 0.2211965473660671, 0.11701007725048894, 0.024861559145840637, -0.2515950649003707, 0.0015583504060867118, -0.23766116682551244, -0.21613483207731216, -0.11218647313401547, 0.04046911033827798, 0.04440094961796943, -0.24595717811929202, 0.15934595863209733, 0.02563826526852269, 0.049721313098362134, -0.05530424161775927, -0.14225029522108276, -0.036356294140177985, 0.07093266855730716, 0.09051649843232594, 0.01900250527403081, 0.08060668516945817, -0.17117831448108042, -0.040966723433525455, 0.3494761132047887, -0.11331158567831587, -0.15750079786595228, 0.16309682430643865, -0.1814604325101836, -0.06686363115067483, 0.16113800866140135, 0.10609199502679116, 0.09713871682839427, -0.14309974559304764, 0.11175476392312322, -0.01686363135550932, 0.13632336992131017, 0.07352908160155222, 0.038581375564351233, 0.17828093023637115, 0.11708795575689135, 0.021555237326103805, 0.1638036614019813, -0.09700387963371825, -0.09566773955863137, -0.3231300910128586, -0.12125206142385948, -0.22736050356040471, 0.06659712924988186, -0.13315099373808628, -0.18423909418034687, 0.35416833522604474, 0.1271952230777807, 0.24146133960127386, 0.10469078802965831, 0.2554589570430455, 0.209280829813241, 0.03999371255692372, 0.09355907250584951, 0.2034534254083549, 0.15050449745673963, 0.023363843687059387, -0.3030082537764822, 0.03489014825005251, 0.09096083742802713]
|
1,803.0512
|
Topology guaranteed segmentation of the human retina from OCT using
convolutional neural networks
|
Optical coherence tomography (OCT) is a noninvasive imaging modality which
can be used to obtain depth images of the retina. The changing layer
thicknesses can thus be quantified by analyzing these OCT images, moreover
these changes have been shown to correlate with disease progression in multiple
sclerosis. Recent automated retinal layer segmentation tools use machine
learning methods to perform pixel-wise labeling and graph methods to guarantee
the layer hierarchy or topology. However, graph parameters like distance and
smoothness constraints must be experimentally assigned by retinal region and
pathology, thus degrading the flexibility and time efficiency of the whole
framework. In this paper, we develop cascaded deep networks to provide a
topologically correct segmentation of the retinal layers in a single feed
forward propagation. The first network (S-Net) performs pixel-wise labeling and
the second regression network (R-Net) takes the topologically unconstrained
S-Net results and outputs layer thicknesses for each layer and each position.
Relu activation is used as the final operation of the R-Net which guarantees
non-negativity of the output layer thickness. Since the segmentation boundary
position is acquired by summing up the corresponding non-negative layer
thicknesses, the layer ordering (i.e., topology) of the reconstructed
boundaries is guaranteed even at the fovea where the distances between
boundaries can be zero. The R-Net is trained using simulated masks and thus can
be generalized to provide topology guaranteed segmentation for other layered
structures. This deep network has achieved comparable mean absolute boundary
error (2.82 {\mu}m) to state-of-the-art graph methods (2.83 {\mu}m).
|
cs.CV
|
optical coherence tomography oct is a noninvasive imaging modality which can be used to obtain depth images of the retina the changing layer thicknesses can thus be quantified by analyzing these oct images moreover these changes have been shown to correlate with disease progression in multiple sclerosis recent automated retinal layer segmentation tools use machine learning methods to perform pixelwise labeling and graph methods to guarantee the layer hierarchy or topology however graph parameters like distance and smoothness constraints must be experimentally assigned by retinal region and pathology thus degrading the flexibility and time efficiency of the whole framework in this paper we develop cascaded deep networks to provide a topologically correct segmentation of the retinal layers in a single feed forward propagation the first network snet performs pixelwise labeling and the second regression network rnet takes the topologically unconstrained snet results and outputs layer thicknesses for each layer and each position relu activation is used as the final operation of the rnet which guarantees nonnegativity of the output layer thickness since the segmentation boundary position is acquired by summing up the corresponding nonnegative layer thicknesses the layer ordering ie topology of the reconstructed boundaries is guaranteed even at the fovea where the distances between boundaries can be zero the rnet is trained using simulated masks and thus can be generalized to provide topology guaranteed segmentation for other layered structures this deep network has achieved comparable mean absolute boundary error 282 mum to stateoftheart graph methods 283 mum
|
[['optical', 'coherence', 'tomography', 'oct', 'is', 'a', 'noninvasive', 'imaging', 'modality', 'which', 'can', 'be', 'used', 'to', 'obtain', 'depth', 'images', 'of', 'the', 'retina', 'the', 'changing', 'layer', 'thicknesses', 'can', 'thus', 'be', 'quantified', 'by', 'analyzing', 'these', 'oct', 'images', 'moreover', 'these', 'changes', 'have', 'been', 'shown', 'to', 'correlate', 'with', 'disease', 'progression', 'in', 'multiple', 'sclerosis', 'recent', 'automated', 'retinal', 'layer', 'segmentation', 'tools', 'use', 'machine', 'learning', 'methods', 'to', 'perform', 'pixelwise', 'labeling', 'and', 'graph', 'methods', 'to', 'guarantee', 'the', 'layer', 'hierarchy', 'or', 'topology', 'however', 'graph', 'parameters', 'like', 'distance', 'and', 'smoothness', 'constraints', 'must', 'be', 'experimentally', 'assigned', 'by', 'retinal', 'region', 'and', 'pathology', 'thus', 'degrading', 'the', 'flexibility', 'and', 'time', 'efficiency', 'of', 'the', 'whole', 'framework', 'in', 'this', 'paper', 'we', 'develop', 'cascaded', 'deep', 'networks', 'to', 'provide', 'a', 'topologically', 'correct', 'segmentation', 'of', 'the', 'retinal', 'layers', 'in', 'a', 'single', 'feed', 'forward', 'propagation', 'the', 'first', 'network', 'snet', 'performs', 'pixelwise', 'labeling', 'and', 'the', 'second', 'regression', 'network', 'rnet', 'takes', 'the', 'topologically', 'unconstrained', 'snet', 'results', 'and', 'outputs', 'layer', 'thicknesses', 'for', 'each', 'layer', 'and', 'each', 'position', 'relu', 'activation', 'is', 'used', 'as', 'the', 'final', 'operation', 'of', 'the', 'rnet', 'which', 'guarantees', 'nonnegativity', 'of', 'the', 'output', 'layer', 'thickness', 'since', 'the', 'segmentation', 'boundary', 'position', 'is', 'acquired', 'by', 'summing', 'up', 'the', 'corresponding', 'nonnegative', 'layer', 'thicknesses', 'the', 'layer', 'ordering', 'ie', 'topology', 'of', 'the', 'reconstructed', 'boundaries', 'is', 'guaranteed', 'even', 'at', 'the', 'fovea', 'where', 'the', 'distances', 'between', 'boundaries', 'can', 'be', 'zero', 'the', 'rnet', 'is', 'trained', 'using', 'simulated', 'masks', 'and', 'thus', 'can', 'be', 'generalized', 'to', 'provide', 'topology', 'guaranteed', 'segmentation', 'for', 'other', 'layered', 'structures', 'this', 'deep', 'network', 'has', 'achieved', 'comparable', 'mean', 'absolute', 'boundary', 'error', '282', 'mum', 'to', 'stateoftheart', 'graph', 'methods', '283', 'mum']]
|
[-0.05333711407400833, 0.0564540020013444, -0.04260515726749755, 0.029820988213384313, -0.0723806012857465, -0.18891724408979738, 0.0309252056481895, 0.46307338458380753, -0.3276160936126666, -0.325921687793227, 0.1054043344774982, -0.24361778625602565, -0.15158167938587272, 0.1343141428937557, -0.12482592032064267, 0.11185088790878053, 0.13096186593165546, 0.020272669868943688, -0.04751495577464436, -0.24616182779221074, 0.2515716673796921, 0.030608987787995683, 0.3351962530624963, 0.04120189848782179, 0.12021210940644866, -0.03294874079555513, 0.008388444212370462, 0.018586613521620166, -0.08277458137449538, 0.12539742294877448, 0.3016994131321553, 0.11213951974341105, 0.2705435863575868, -0.45360734103052247, -0.2589450699907179, 0.057422556444503094, 0.15935520321175817, 0.05851251670936754, 0.03877586077930661, -0.3206356846705838, 0.12312662652261826, -0.0870677586729383, -0.0039016616158938458, -0.07042580016986316, -0.034832849907087945, -0.0382063982622405, -0.3006854778063679, 0.06135210248964628, 0.0386501785166817, 0.07566362563727214, -0.07279129947757258, -0.10797427748254831, -0.06628793120128854, 0.21486853477789178, -0.037661441739821326, 0.10741725556210675, 0.16923961526387551, -0.18528516766532593, -0.10831699050745115, 0.29241442847471205, -0.01818112700974809, -0.20075684888363485, 0.17218279826451063, -0.06591606088160563, -0.06582016730305529, 0.15383629345395153, 0.18420284282746574, 0.10612845704083392, -0.14330951423541974, -0.012134373810934653, -0.015834439988060285, 0.23014592061254888, 0.11998894365857385, 0.020228872674652527, 0.15911782551002915, 0.23425629636227724, 0.054206003502552065, 0.14896918233599507, -0.20914136969957092, -0.0053866463633547084, -0.22479830080321275, -0.13573901923166798, -0.1806448283023201, -0.024932331566120527, -0.11769040742459061, -0.16091137055686447, 0.4119361100921167, 0.1664789306044939, 0.20997962760814134, 0.08229109897342089, 0.3440756166368843, 0.06195943974542446, 0.1542066766940538, 0.05749068438120547, 0.2329426756083605, 0.09821468279727513, 0.0979741528431224, -0.1600983485204192, 0.13578200606101629, 0.09346786912740959]
|
1,803.05121
|
Linear Quadratic Optimal Control and Stabilization for Discrete-time
Markov Jump Linear Systems
|
This paper mainly investigates the optimal control and stabilization problems
for linear discrete-time Markov jump systems. The general case for the
finite-horizon optimal controller is considered, where the input weighting
matrix in the performance index is just required to be positive semi-definite.
The necessary and sufficient condition for the existence of the optimal
controller in finite-horizon is given explicitly from a set of coupled
difference Riccati equations (CDRE). One of the key techniques is to solve the
forward and backward stochastic difference equation (FDSDE) which is obtained
by the maximum principle. As to the infinite-horizon case, we establish the
necessary and sufficient condition to stabilize the Markov jump linear system
in the mean square sense. It is shown that the Markov jump linear system is
stabilizable under the optimal controller if and only if the associated couple
algebraic Riccati equation (CARE) has a unique positive solution. Meanwhile,
the optimal controller and optimal cost function in infinite-horizon case are
expressed explicitly.
|
math.OC
|
this paper mainly investigates the optimal control and stabilization problems for linear discretetime markov jump systems the general case for the finitehorizon optimal controller is considered where the input weighting matrix in the performance index is just required to be positive semidefinite the necessary and sufficient condition for the existence of the optimal controller in finitehorizon is given explicitly from a set of coupled difference riccati equations cdre one of the key techniques is to solve the forward and backward stochastic difference equation fdsde which is obtained by the maximum principle as to the infinitehorizon case we establish the necessary and sufficient condition to stabilize the markov jump linear system in the mean square sense it is shown that the markov jump linear system is stabilizable under the optimal controller if and only if the associated couple algebraic riccati equation care has a unique positive solution meanwhile the optimal controller and optimal cost function in infinitehorizon case are expressed explicitly
|
[['this', 'paper', 'mainly', 'investigates', 'the', 'optimal', 'control', 'and', 'stabilization', 'problems', 'for', 'linear', 'discretetime', 'markov', 'jump', 'systems', 'the', 'general', 'case', 'for', 'the', 'finitehorizon', 'optimal', 'controller', 'is', 'considered', 'where', 'the', 'input', 'weighting', 'matrix', 'in', 'the', 'performance', 'index', 'is', 'just', 'required', 'to', 'be', 'positive', 'semidefinite', 'the', 'necessary', 'and', 'sufficient', 'condition', 'for', 'the', 'existence', 'of', 'the', 'optimal', 'controller', 'in', 'finitehorizon', 'is', 'given', 'explicitly', 'from', 'a', 'set', 'of', 'coupled', 'difference', 'riccati', 'equations', 'cdre', 'one', 'of', 'the', 'key', 'techniques', 'is', 'to', 'solve', 'the', 'forward', 'and', 'backward', 'stochastic', 'difference', 'equation', 'fdsde', 'which', 'is', 'obtained', 'by', 'the', 'maximum', 'principle', 'as', 'to', 'the', 'infinitehorizon', 'case', 'we', 'establish', 'the', 'necessary', 'and', 'sufficient', 'condition', 'to', 'stabilize', 'the', 'markov', 'jump', 'linear', 'system', 'in', 'the', 'mean', 'square', 'sense', 'it', 'is', 'shown', 'that', 'the', 'markov', 'jump', 'linear', 'system', 'is', 'stabilizable', 'under', 'the', 'optimal', 'controller', 'if', 'and', 'only', 'if', 'the', 'associated', 'couple', 'algebraic', 'riccati', 'equation', 'care', 'has', 'a', 'unique', 'positive', 'solution', 'meanwhile', 'the', 'optimal', 'controller', 'and', 'optimal', 'cost', 'function', 'in', 'infinitehorizon', 'case', 'are', 'expressed', 'explicitly']]
|
[-0.14362462070001336, 0.050856188066374465, -0.04402583420771775, 0.08589097941929347, -0.094997105039833, -0.2179628736133204, 0.03505706435063547, 0.3426699168991911, -0.36366383805635233, -0.234746762415795, 0.20063967239944253, -0.21789891599335626, -0.1648386383275914, 0.17988036737977703, -0.09995395986693381, 0.15235497771844833, 0.04587768697285954, 0.07193294784961905, -0.047493589852267544, -0.2602957363205054, 0.3195598252431513, 0.030258436375253397, 0.2655088707769313, 0.001225052580098869, 0.2312269789001704, 0.008172042069579416, 0.046346179247963463, -0.006282800814443374, -0.13408401341619053, 0.05291829762768142, 0.30160789160629664, 0.1234120869908859, 0.33934162592491773, -0.37747932764807646, -0.147715968463004, 0.16989958267423172, 0.10847166217358847, 0.08790618404407124, -0.0037177158254375563, -0.23311187319392693, 0.11756094135461917, -0.1172129911299842, -0.11372227618423632, -0.012369974315920962, -0.011817974536502851, 0.040643905454515655, -0.3734134088514986, 0.05752025811072392, 0.0647133835473487, 0.010920431792052298, -0.10179490534164294, -0.08553365533699907, -0.02864945825348502, 0.11970441749089551, 0.029704774228879547, -0.012935936767784761, 0.09646101576818412, -0.06217368229298228, -0.10925853440591099, 0.32383891740884585, -0.05213739621066901, -0.3050601257798203, 0.10536358074308667, -0.10571246021839825, -0.10210150548203883, 0.14967990581158408, 0.1888554285315773, 0.13023039453391788, -0.19874747026169412, 0.117060870731609, -0.04779542464161692, 0.16640146959667343, 0.03169006192349369, -0.007732534664314641, 0.09401979243317973, 0.14853111196226806, 0.21973718460826086, 0.17200340711897757, 0.037722832475762365, -0.1827918760643541, -0.3547522920667182, -0.1363215551658569, -0.15986154428860055, 0.040534307445617555, -0.09104374895418281, -0.1380689608563501, 0.3444098707559648, 0.13052572547811778, 0.10260233780534207, 0.1069112685516394, 0.2664856760750843, 0.2581800091725257, -0.027900731475077736, 0.10517049828673937, 0.21201308263551233, 0.18173026131271514, 0.11997686424351568, -0.30270101937768934, 0.13335865181634982, 0.11112883626895992]
|
1,803.05122
|
A semiclassical theory of phase-space dynamics of interacting bosons
|
We study the phase-space representation of dynamics of bosons in the
semiclassical regime where the occupation number of the modes is large. To this
end, we employ the van Vleck-Gutzwiller propagator to obtain an approximation
for the Green's function of the Wigner distribution. The semiclassical analysis
incorporates interference of classical paths and reduces to the truncated
Wigner approximation (TWA) when the interference is ignored. Furthermore, we
identify the Ehrenfest time after which the TWA fails. As a case study, we
consider a single-mode quantum nonlinear oscillator, which displays collapse
and revival of observables. We analytically show that the interference of
classical paths leads to revivals, an effect that is not reproduced by the TWA
or a perturbative analysis.
|
cond-mat.quant-gas quant-ph
|
we study the phasespace representation of dynamics of bosons in the semiclassical regime where the occupation number of the modes is large to this end we employ the van vleckgutzwiller propagator to obtain an approximation for the greens function of the wigner distribution the semiclassical analysis incorporates interference of classical paths and reduces to the truncated wigner approximation twa when the interference is ignored furthermore we identify the ehrenfest time after which the twa fails as a case study we consider a singlemode quantum nonlinear oscillator which displays collapse and revival of observables we analytically show that the interference of classical paths leads to revivals an effect that is not reproduced by the twa or a perturbative analysis
|
[['we', 'study', 'the', 'phasespace', 'representation', 'of', 'dynamics', 'of', 'bosons', 'in', 'the', 'semiclassical', 'regime', 'where', 'the', 'occupation', 'number', 'of', 'the', 'modes', 'is', 'large', 'to', 'this', 'end', 'we', 'employ', 'the', 'van', 'vleckgutzwiller', 'propagator', 'to', 'obtain', 'an', 'approximation', 'for', 'the', 'greens', 'function', 'of', 'the', 'wigner', 'distribution', 'the', 'semiclassical', 'analysis', 'incorporates', 'interference', 'of', 'classical', 'paths', 'and', 'reduces', 'to', 'the', 'truncated', 'wigner', 'approximation', 'twa', 'when', 'the', 'interference', 'is', 'ignored', 'furthermore', 'we', 'identify', 'the', 'ehrenfest', 'time', 'after', 'which', 'the', 'twa', 'fails', 'as', 'a', 'case', 'study', 'we', 'consider', 'a', 'singlemode', 'quantum', 'nonlinear', 'oscillator', 'which', 'displays', 'collapse', 'and', 'revival', 'of', 'observables', 'we', 'analytically', 'show', 'that', 'the', 'interference', 'of', 'classical', 'paths', 'leads', 'to', 'revivals', 'an', 'effect', 'that', 'is', 'not', 'reproduced', 'by', 'the', 'twa', 'or', 'a', 'perturbative', 'analysis']]
|
[-0.13597244568074407, 0.13054104893635052, -0.16293784560856678, 0.11776096721858544, -0.019337333989392778, -0.09664150621047464, 0.06838387322229317, 0.3089454943724608, -0.2423467333586413, -0.21413001892456818, -0.005728959791575385, -0.26185415262826006, -0.1712389148523147, 0.12534503693301705, -0.019072178163234206, 0.04327094176058042, 0.0740118066373802, 0.022344628712004523, -0.08631226000123483, -0.2061656800639358, 0.31609628096795583, 0.045732850385474644, 0.23264718847349286, 0.019811830720153904, 0.0756293880611153, 0.0827465158851691, 0.019036435427428302, -0.026049397546419148, -0.1322101658113721, 9.850144062696372e-05, 0.19340841634735717, 0.07600735466516877, 0.2845220801073237, -0.41015757972342987, -0.20221792768008248, 0.0730928500830117, 0.19391084175904172, 0.1779570932661862, 0.015171439809156424, -0.2828452756482382, 0.016298730500531777, -0.16961877611470685, -0.1892130047209182, -0.09515958861053242, -0.005496028031348803, 0.0004372311681035464, -0.27555984826620383, 0.14491003230056268, 0.0633620231913529, -0.014411073596358804, -0.016035875292214705, -0.05684665508442006, 0.03614143837022327, 0.08979835800981441, -0.002244557646578977, -0.005895988378373874, 0.08119841551160789, -0.13357492873121557, -0.12683447180473703, 0.4107248725653705, -0.07808405570823983, -0.17485083650079383, 0.14091430452920622, -0.20984115469727224, -0.08286447440258275, 0.11446635780256179, 0.11625543284087868, 0.12307889291018216, -0.13336373557658743, 0.09324589176636221, -0.032585438652658616, 0.15924259888055592, 0.0810935159955742, 0.068958258911399, 0.1493913199736784, 0.11975496060854235, 0.0210467171717151, 0.1738406609806974, -0.13556925428368277, -0.201950874282205, -0.3110474189901251, -0.1480098127513745, -0.2165816740716918, 0.0894938608103923, -0.061953350515607984, -0.21531674952514596, 0.3889848929277416, 0.144265461767337, 0.18335283774156438, 0.0825718181835235, 0.296583260060288, 0.23300957902220187, 0.04573440831188498, 0.05177449736491603, 0.2514600432714668, 0.1782308141108981, 0.061479992986956646, -0.29592809525034314, -0.005314063744508993, 0.05999876150340473]
|
1,803.05123
|
Defending against Adversarial Attack towards Deep Neural Networks via
Collaborative Multi-task Training
|
Deep neural networks (DNNs) are known to be vulnerable to adversarial
examples which contain human-imperceptible perturbations. A series of defending
methods, either proactive defence or reactive defence, have been proposed in
the recent years. However, most of the methods can only handle specific
attacks. For example, proactive defending methods are invalid against grey-box
or white-box attacks, while reactive defending methods are challenged by
low-distortion adversarial examples or transferring adversarial examples. This
becomes a critical problem since a defender usually does not have the type of
the attack as a priori knowledge. Moreover, existing two-pronged defences
(e.g., MagNet), which take advantages of both proactive and reactive methods,
have been reported as broken under transferring attacks. To address this
problem, this paper proposed a novel defensive framework based on collaborative
multi-task training, aiming at providing defence for different types of
attacks. The proposed defence first encodes training labels into label pairs
and counters black-box attacks leveraging adversarial training supervised by
the encoded label pairs. The defence further constructs a detector to identify
and reject high-confidence adversarial examples that bypass the black-box
defence. In addition, the proposed collaborative architecture can prevent
adversaries from finding valid adversarial examples when the defence strategy
is exposed. In the experiments, we evaluated our defence against four
state-of-the-art attacks on $MNIST$ and $CIFAR10$ datasets. The results showed
that our defending method achieved up to $96.3\%$ classification accuracy on
black-box adversarial examples, and detected up to $98.7\%$ of the high
confidence adversarial examples. It only decreased the model accuracy on benign
example classification by $2.1\%$ for the $CIFAR10$ dataset.
|
cs.LG cs.CR
|
deep neural networks dnns are known to be vulnerable to adversarial examples which contain humanimperceptible perturbations a series of defending methods either proactive defence or reactive defence have been proposed in the recent years however most of the methods can only handle specific attacks for example proactive defending methods are invalid against greybox or whitebox attacks while reactive defending methods are challenged by lowdistortion adversarial examples or transferring adversarial examples this becomes a critical problem since a defender usually does not have the type of the attack as a priori knowledge moreover existing twopronged defences eg magnet which take advantages of both proactive and reactive methods have been reported as broken under transferring attacks to address this problem this paper proposed a novel defensive framework based on collaborative multitask training aiming at providing defence for different types of attacks the proposed defence first encodes training labels into label pairs and counters blackbox attacks leveraging adversarial training supervised by the encoded label pairs the defence further constructs a detector to identify and reject highconfidence adversarial examples that bypass the blackbox defence in addition the proposed collaborative architecture can prevent adversaries from finding valid adversarial examples when the defence strategy is exposed in the experiments we evaluated our defence against four stateoftheart attacks on mnist and cifar10 datasets the results showed that our defending method achieved up to 963 classification accuracy on blackbox adversarial examples and detected up to 987 of the high confidence adversarial examples it only decreased the model accuracy on benign example classification by 21 for the cifar10 dataset
|
[['deep', 'neural', 'networks', 'dnns', 'are', 'known', 'to', 'be', 'vulnerable', 'to', 'adversarial', 'examples', 'which', 'contain', 'humanimperceptible', 'perturbations', 'a', 'series', 'of', 'defending', 'methods', 'either', 'proactive', 'defence', 'or', 'reactive', 'defence', 'have', 'been', 'proposed', 'in', 'the', 'recent', 'years', 'however', 'most', 'of', 'the', 'methods', 'can', 'only', 'handle', 'specific', 'attacks', 'for', 'example', 'proactive', 'defending', 'methods', 'are', 'invalid', 'against', 'greybox', 'or', 'whitebox', 'attacks', 'while', 'reactive', 'defending', 'methods', 'are', 'challenged', 'by', 'lowdistortion', 'adversarial', 'examples', 'or', 'transferring', 'adversarial', 'examples', 'this', 'becomes', 'a', 'critical', 'problem', 'since', 'a', 'defender', 'usually', 'does', 'not', 'have', 'the', 'type', 'of', 'the', 'attack', 'as', 'a', 'priori', 'knowledge', 'moreover', 'existing', 'twopronged', 'defences', 'eg', 'magnet', 'which', 'take', 'advantages', 'of', 'both', 'proactive', 'and', 'reactive', 'methods', 'have', 'been', 'reported', 'as', 'broken', 'under', 'transferring', 'attacks', 'to', 'address', 'this', 'problem', 'this', 'paper', 'proposed', 'a', 'novel', 'defensive', 'framework', 'based', 'on', 'collaborative', 'multitask', 'training', 'aiming', 'at', 'providing', 'defence', 'for', 'different', 'types', 'of', 'attacks', 'the', 'proposed', 'defence', 'first', 'encodes', 'training', 'labels', 'into', 'label', 'pairs', 'and', 'counters', 'blackbox', 'attacks', 'leveraging', 'adversarial', 'training', 'supervised', 'by', 'the', 'encoded', 'label', 'pairs', 'the', 'defence', 'further', 'constructs', 'a', 'detector', 'to', 'identify', 'and', 'reject', 'highconfidence', 'adversarial', 'examples', 'that', 'bypass', 'the', 'blackbox', 'defence', 'in', 'addition', 'the', 'proposed', 'collaborative', 'architecture', 'can', 'prevent', 'adversaries', 'from', 'finding', 'valid', 'adversarial', 'examples', 'when', 'the', 'defence', 'strategy', 'is', 'exposed', 'in', 'the', 'experiments', 'we', 'evaluated', 'our', 'defence', 'against', 'four', 'stateoftheart', 'attacks', 'on', 'mnist', 'and', 'cifar10', 'datasets', 'the', 'results', 'showed', 'that', 'our', 'defending', 'method', 'achieved', 'up', 'to', '963', 'classification', 'accuracy', 'on', 'blackbox', 'adversarial', 'examples', 'and', 'detected', 'up', 'to', '987', 'of', 'the', 'high', 'confidence', 'adversarial', 'examples', 'it', 'only', 'decreased', 'the', 'model', 'accuracy', 'on', 'benign', 'example', 'classification', 'by', '21', 'for', 'the', 'cifar10', 'dataset']]
|
[-0.07038515488026091, -0.03661961805863449, -0.008439046105083364, 0.10422732767989286, -0.0876446242748688, -0.29464376260383196, 0.0799777853987717, 0.38643716861081956, -0.1928982597887695, -0.34051857034031013, 0.09508643543499952, -0.31644931789756253, -0.20028928817124464, 0.21535244636246575, -0.19702597475037553, 0.12142540647227389, 0.06397649109925484, 0.005628922062281233, -0.006035951969142144, -0.380884503481838, 0.32099423463223503, 0.03812208163379602, 0.34235425195656716, 0.027406352246851805, 0.1074102935828985, -0.07243846046733848, -0.001572107590842419, -0.008889378166685884, -0.021121851251238975, 0.09120245757781399, 0.3520391519917421, 0.23020127829200088, 0.3803712542115066, -0.4316040538609601, -0.26222033669384054, 0.1094124478543213, 0.10368073468489455, 0.1597164018944358, -0.07690646552767318, -0.41897472064369, 0.15503788343809832, -0.23886322333978918, 0.012947994934466595, -0.1853465235411512, -0.05287056755847656, -0.020464812728459948, -0.27889813734039376, -0.02258875495664632, 0.11681633378096963, 0.08420105162972155, -0.0230206346927354, -0.10261031893583444, -0.0024742846327941294, 0.140003025180396, 0.07111003150527652, 0.004656907910696016, 0.19046153284143658, -0.15777487663570075, -0.20830805925741935, 0.31163134248389934, -0.00251141928960211, -0.17588579387296566, 0.21053642824095173, 0.08878235628362745, -0.1517883989207733, 0.1199021625923566, 0.2686735048943844, 0.16872571173858328, -0.13951403699538786, -0.016340601209846612, -0.004001349800119687, 0.14715910577931657, 0.09545219076188424, -0.03545811736442444, 0.12094822886865586, 0.2293541149227307, 0.060133462965201875, 0.15084401525852556, -0.12535917991055892, -0.06094403177132615, -0.2107219523159214, -0.05302887425149003, -0.1751725900882425, 0.004156276096574192, -0.04715335869130705, -0.11494012893750691, 0.3903645756932047, 0.2396668388096889, 0.16273022338103216, 0.10000524543082485, 0.42316628731429, -0.049958601077266324, 0.09960646363279711, 0.13412326933242955, 0.22635099955766166, -0.03549877688257346, 0.06326788055191103, -0.12989698100136593, 0.17691112134041478, 0.009371503277977283]
|
1,803.05124
|
Galactic or extragalactic chemical tagging for NGC3201? Discovery of an
anomalous CN-CH relation
|
(ABRIDGED) The origin of the globular cluster (GC) NGC3201 is under debate.
Its retrograde orbit points to an extragalactic origin, but no further chemical
evidence supports this idea. Light-element chemical abundances are useful to
tag GCs and can be used to shed light on this discussion. We aim to derive CN
and CH band strengths for red giant stars in NGC3201 and compare these with
photometric indices and high-resolution spectroscopy and discuss in the context
of GC chemical tagging. We found three groups in the CN-CH distribution. A main
sequence (S1), a secondary less-populated sequence (S2), and a group of
peculiar (pec) CN-weak and CH-weak stars, one of which was previously known.
The three groups seem to have different C+N+O and/or s-process element
abundances, to be confirmed by high-resolution spectroscopy. These are typical
characteristics of anomalous GCs. The CN distribution of NGC 3201 is
quadrimodal, which is more common in anomalous clusters. However, NGC3201 does
not belong to the trend of anomalous GCs in the mass-size relation. Three
scenarios are postulated here: (i) if the sequence pec-S1-S2 has increasing
C+N+O and s-process element abundances, NGC3201 would be the first anomalous GC
outside of the mass-size relation; (ii) if the abundances are almost constant,
NGC3201 would be the first non-anomalous GC with multiple CN-CH
anti-correlation groups; or (iii) it would be the first anomalous GC without
variations in C+N+O and s-process element abundances. In all cases, the
definition of anomalous clusters and the scenario in which they have an
extragalactic origin must be revised.
|
astro-ph.GA
|
abridged the origin of the globular cluster gc ngc3201 is under debate its retrograde orbit points to an extragalactic origin but no further chemical evidence supports this idea lightelement chemical abundances are useful to tag gcs and can be used to shed light on this discussion we aim to derive cn and ch band strengths for red giant stars in ngc3201 and compare these with photometric indices and highresolution spectroscopy and discuss in the context of gc chemical tagging we found three groups in the cnch distribution a main sequence s1 a secondary lesspopulated sequence s2 and a group of peculiar pec cnweak and chweak stars one of which was previously known the three groups seem to have different cno andor sprocess element abundances to be confirmed by highresolution spectroscopy these are typical characteristics of anomalous gcs the cn distribution of ngc 3201 is quadrimodal which is more common in anomalous clusters however ngc3201 does not belong to the trend of anomalous gcs in the masssize relation three scenarios are postulated here i if the sequence pecs1s2 has increasing cno and sprocess element abundances ngc3201 would be the first anomalous gc outside of the masssize relation ii if the abundances are almost constant ngc3201 would be the first nonanomalous gc with multiple cnch anticorrelation groups or iii it would be the first anomalous gc without variations in cno and sprocess element abundances in all cases the definition of anomalous clusters and the scenario in which they have an extragalactic origin must be revised
|
[['abridged', 'the', 'origin', 'of', 'the', 'globular', 'cluster', 'gc', 'ngc3201', 'is', 'under', 'debate', 'its', 'retrograde', 'orbit', 'points', 'to', 'an', 'extragalactic', 'origin', 'but', 'no', 'further', 'chemical', 'evidence', 'supports', 'this', 'idea', 'lightelement', 'chemical', 'abundances', 'are', 'useful', 'to', 'tag', 'gcs', 'and', 'can', 'be', 'used', 'to', 'shed', 'light', 'on', 'this', 'discussion', 'we', 'aim', 'to', 'derive', 'cn', 'and', 'ch', 'band', 'strengths', 'for', 'red', 'giant', 'stars', 'in', 'ngc3201', 'and', 'compare', 'these', 'with', 'photometric', 'indices', 'and', 'highresolution', 'spectroscopy', 'and', 'discuss', 'in', 'the', 'context', 'of', 'gc', 'chemical', 'tagging', 'we', 'found', 'three', 'groups', 'in', 'the', 'cnch', 'distribution', 'a', 'main', 'sequence', 's1', 'a', 'secondary', 'lesspopulated', 'sequence', 's2', 'and', 'a', 'group', 'of', 'peculiar', 'pec', 'cnweak', 'and', 'chweak', 'stars', 'one', 'of', 'which', 'was', 'previously', 'known', 'the', 'three', 'groups', 'seem', 'to', 'have', 'different', 'cno', 'andor', 'sprocess', 'element', 'abundances', 'to', 'be', 'confirmed', 'by', 'highresolution', 'spectroscopy', 'these', 'are', 'typical', 'characteristics', 'of', 'anomalous', 'gcs', 'the', 'cn', 'distribution', 'of', 'ngc', '3201', 'is', 'quadrimodal', 'which', 'is', 'more', 'common', 'in', 'anomalous', 'clusters', 'however', 'ngc3201', 'does', 'not', 'belong', 'to', 'the', 'trend', 'of', 'anomalous', 'gcs', 'in', 'the', 'masssize', 'relation', 'three', 'scenarios', 'are', 'postulated', 'here', 'i', 'if', 'the', 'sequence', 'pecs1s2', 'has', 'increasing', 'cno', 'and', 'sprocess', 'element', 'abundances', 'ngc3201', 'would', 'be', 'the', 'first', 'anomalous', 'gc', 'outside', 'of', 'the', 'masssize', 'relation', 'ii', 'if', 'the', 'abundances', 'are', 'almost', 'constant', 'ngc3201', 'would', 'be', 'the', 'first', 'nonanomalous', 'gc', 'with', 'multiple', 'cnch', 'anticorrelation', 'groups', 'or', 'iii', 'it', 'would', 'be', 'the', 'first', 'anomalous', 'gc', 'without', 'variations', 'in', 'cno', 'and', 'sprocess', 'element', 'abundances', 'in', 'all', 'cases', 'the', 'definition', 'of', 'anomalous', 'clusters', 'and', 'the', 'scenario', 'in', 'which', 'they', 'have', 'an', 'extragalactic', 'origin', 'must', 'be', 'revised']]
|
[-0.07523270975844934, 0.14113702383369672, -0.11280434129573405, 0.11147592028835789, -0.10553766977787017, -0.07907795410975814, 0.0676619335799478, 0.454118928745389, -0.18543303821515292, -0.3404044907540083, 0.020812009868212043, -0.30161167070642114, -0.06000443639000878, 0.16060476503311658, -0.08115356717165559, -0.06004916863585822, 0.07432189307175577, -0.008277321625500917, -0.01915072817960754, -0.27894276327639816, 0.3082309758793563, -0.007170047092746244, 0.17034927320387214, -0.030310854147421195, -0.021487347448244692, -0.15033828377909958, -0.05247318622050807, -0.02726277695265162, -0.09664672470465302, 0.05530286970268935, 0.23865025898627937, 0.138795694693923, 0.15240856955572962, -0.35230441083200276, -0.19928912213817238, 0.1251986186937429, 0.2485111477188766, 0.05274330319510773, -0.12265928240289213, -0.25497407115995885, 0.101892105858773, -0.14820727751636878, -0.20071618279628456, 0.053177947856485844, 0.06389925669319928, 0.04070323700038716, -0.1967622470315546, 0.10873126103286632, 0.038929889526451, 0.11373282562568784, -0.11067764145089314, -0.17485040501412005, -0.05473892535828054, 0.13751985478121787, 0.04085556522477418, 0.017024125443771482, 0.12467283335514366, -0.05019889860227704, -0.03702066818997264, 0.4252258360609412, -0.08972793047875166, -0.0483403308223933, 0.22902032046020032, -0.21086880643712358, -0.2653468471132219, 0.07147296654060482, 0.1132785551995039, 0.10247130086831749, -0.22795515783689915, 0.04113522550463677, -0.006880945661105215, 0.1829002402687911, 0.0448439154913649, 0.057433082957286385, 0.2722329079546034, 0.09496638546697796, 0.02691912482632324, 0.011486022683791817, -0.17590156657528133, -0.027915328009054066, -0.21783888859883882, -0.16173346910998226, -0.07679105131467805, 0.06364293712569634, -0.13870837564987595, -0.14185455092659685, 0.3105539016351104, 0.09980541589856148, 0.1986697943266481, -0.026964210665319115, 0.26895427333563565, 0.09353725944366306, 0.11799771699402481, 0.08910516756307334, 0.2795544212926179, 0.21496609932370483, 0.055795087590813634, -0.26759215313382445, 0.15153157213144006, 0.019154957722872495]
|
1,803.05125
|
Gate controlled Majorana Zero Modes on 2D heterostructures
|
Half-integer conductance, the signature of Majorana edge modes, has been
recently observed in a quantum anomalous Hall insulator/superconductor
heterostructure. Here, we analyze a scheme for gate-tunable control of
degenerate ground states of Majorana zero modes (MZM) in thin film topological
superconductors. Gating the top surface of a thin film magnetic topological
insulator controls the topological phase in the region underneath the gate. The
voltage of the transition depends on the gate width, and narrower gates require
larger voltages. Relatively long gates are required, on the order of a micron,
to prevent hybridization of the end modes and to allow the creation of MZMs at
low gate voltages. Applying a voltage to T{shaped and I{shaped gates localizes
the Majoranas at their ends. This scheme may provide a facile method for
implementing quantum gates for topological quantum computing.
|
cond-mat.mes-hall
|
halfinteger conductance the signature of majorana edge modes has been recently observed in a quantum anomalous hall insulatorsuperconductor heterostructure here we analyze a scheme for gatetunable control of degenerate ground states of majorana zero modes mzm in thin film topological superconductors gating the top surface of a thin film magnetic topological insulator controls the topological phase in the region underneath the gate the voltage of the transition depends on the gate width and narrower gates require larger voltages relatively long gates are required on the order of a micron to prevent hybridization of the end modes and to allow the creation of mzms at low gate voltages applying a voltage to tshaped and ishaped gates localizes the majoranas at their ends this scheme may provide a facile method for implementing quantum gates for topological quantum computing
|
[['halfinteger', 'conductance', 'the', 'signature', 'of', 'majorana', 'edge', 'modes', 'has', 'been', 'recently', 'observed', 'in', 'a', 'quantum', 'anomalous', 'hall', 'insulatorsuperconductor', 'heterostructure', 'here', 'we', 'analyze', 'a', 'scheme', 'for', 'gatetunable', 'control', 'of', 'degenerate', 'ground', 'states', 'of', 'majorana', 'zero', 'modes', 'mzm', 'in', 'thin', 'film', 'topological', 'superconductors', 'gating', 'the', 'top', 'surface', 'of', 'a', 'thin', 'film', 'magnetic', 'topological', 'insulator', 'controls', 'the', 'topological', 'phase', 'in', 'the', 'region', 'underneath', 'the', 'gate', 'the', 'voltage', 'of', 'the', 'transition', 'depends', 'on', 'the', 'gate', 'width', 'and', 'narrower', 'gates', 'require', 'larger', 'voltages', 'relatively', 'long', 'gates', 'are', 'required', 'on', 'the', 'order', 'of', 'a', 'micron', 'to', 'prevent', 'hybridization', 'of', 'the', 'end', 'modes', 'and', 'to', 'allow', 'the', 'creation', 'of', 'mzms', 'at', 'low', 'gate', 'voltages', 'applying', 'a', 'voltage', 'to', 'tshaped', 'and', 'ishaped', 'gates', 'localizes', 'the', 'majoranas', 'at', 'their', 'ends', 'this', 'scheme', 'may', 'provide', 'a', 'facile', 'method', 'for', 'implementing', 'quantum', 'gates', 'for', 'topological', 'quantum', 'computing']]
|
[-0.24904203180716755, 0.2521301867536214, -0.04360038232441772, -0.013396664122838582, -0.02117552940548836, -0.2776086048757219, 0.1532313903033569, 0.3761954145533416, -0.21725061158855064, -0.2945511048173477, -0.006539274116649348, -0.2597551197635339, -0.10262939897502828, 0.2305196175327771, -0.025776086279459858, 0.09986185527112171, -0.034310722463380766, -0.07324983252286021, -0.10455534278641126, -0.21042097624226966, 0.2579517397474881, -0.037422876126263015, 0.35211740273585107, 0.0994903394158053, 0.04430409390753245, -0.08756560703263591, 0.13559030490133034, -0.022184160175075865, -0.12694583490648417, 0.034751072650525364, 0.2570777671490385, -0.13958898670320838, 0.20115782156148376, -0.5023395081105477, -0.1449383185039658, -0.021446697560403502, 0.1339075318640372, 0.20232999195714535, -0.0655547575391692, -0.3253143771263935, 0.12320779375594985, -0.15280218519653907, -0.07748713157728643, -0.06142142364371787, 0.017290181107134286, -0.07972261885879561, -0.22043524870583925, 0.025439763933878996, 0.04704735755769755, 0.06965962737526485, 0.01025392034994986, -0.05843927539364599, -0.083674211287871, 0.10282990121435004, -0.07044814678374678, 0.007094272806117421, 0.20570243113701614, -0.14162224914659471, -0.18261574841359535, 0.25702666829473697, -0.0394993433240897, -0.10798431044574552, 0.15240777682458215, -0.16330259699059432, -0.00884974405155791, 0.1285031099927009, 0.12216557222692405, 0.09125577626229428, -0.07001195733627195, 0.11599108797000714, 0.05127054317991304, 0.17141497809686423, 0.06956475682433366, 0.12265556411790278, 0.3153903275481699, 0.1862440906218527, 0.13393570177654243, 0.1744080425157924, -0.15075265641173566, -0.028895996866427756, -0.29781896593597007, -0.23409121119595297, -0.249115021649392, 0.06365614705582094, -0.0008555722816869521, -0.27570180716472403, 0.501761396085278, 0.126086442536154, 0.17128492229590742, -0.04207630242693566, 0.2914096616681063, 0.15747797375490122, 0.14415778124342016, 0.013634718611951136, 0.20956794913474688, 0.21037434182225673, 0.09321949480342001, -0.3064082793374409, 0.05636277805794688, 0.030344486895688427]
|
1,803.05126
|
Damped Newton's Method on Riemannian Manifolds
|
A damped Newton's method to find a singularity of a vector field in
Riemannian setting is presented with global convergence study. It is ensured
that the sequence generated by the proposed method reduces to a sequence
generated by the Riemannian version of the classical Newton's method after a
finite number of iterations, consequently its convergence rate is
superlinear/quadratic. Moreover, numerical experiments illustrate that the
damped Newton's method has better performance than Newton's method in number of
iteration and computational time.
|
math.OC
|
a damped newtons method to find a singularity of a vector field in riemannian setting is presented with global convergence study it is ensured that the sequence generated by the proposed method reduces to a sequence generated by the riemannian version of the classical newtons method after a finite number of iterations consequently its convergence rate is superlinearquadratic moreover numerical experiments illustrate that the damped newtons method has better performance than newtons method in number of iteration and computational time
|
[['a', 'damped', 'newtons', 'method', 'to', 'find', 'a', 'singularity', 'of', 'a', 'vector', 'field', 'in', 'riemannian', 'setting', 'is', 'presented', 'with', 'global', 'convergence', 'study', 'it', 'is', 'ensured', 'that', 'the', 'sequence', 'generated', 'by', 'the', 'proposed', 'method', 'reduces', 'to', 'a', 'sequence', 'generated', 'by', 'the', 'riemannian', 'version', 'of', 'the', 'classical', 'newtons', 'method', 'after', 'a', 'finite', 'number', 'of', 'iterations', 'consequently', 'its', 'convergence', 'rate', 'is', 'superlinearquadratic', 'moreover', 'numerical', 'experiments', 'illustrate', 'that', 'the', 'damped', 'newtons', 'method', 'has', 'better', 'performance', 'than', 'newtons', 'method', 'in', 'number', 'of', 'iteration', 'and', 'computational', 'time']]
|
[-0.10904315722873434, 0.045614437374752015, -0.12206994380103424, 0.025943680967611727, -0.07826552701881155, -0.15096047470578924, 0.027867410660837776, 0.32685897531919184, -0.28963735881261526, -0.2872508140746504, 0.10493173704453511, -0.2482831514964346, -0.1649327393155545, 0.27027487351151647, -0.08452413881896063, 0.08148303904090426, 0.12493484050501139, 0.07525473603745922, -0.055254740099189806, -0.32622276642359793, 0.2746237840096001, 0.08386644157581032, 0.2550788532622391, -0.01964994740555994, 0.149363219101906, -0.06590953470440582, -0.010276151681318879, 0.07276904676109552, -0.0676616231803564, 0.08297004435444251, 0.16364586716517807, 0.14798439996666274, 0.3985672343056649, -0.3475240429630503, -0.18937937062000856, 0.11421634483485832, 0.1509987146477215, 0.12187516748672352, -0.1267753918422386, -0.265880646253936, 0.16234606064390392, -0.11729551110474859, -0.15332000026246534, -0.13094223882071673, -0.03348811229661806, 0.03724058073275956, -0.26893073661631206, 0.10152027439617087, 0.07311219537077704, 0.030680679832585156, -0.011195773365034255, -0.05892432623077184, 0.023111244500614702, 0.025537462608190252, 0.11171825231576804, 0.07362147409294266, 0.13361734298523514, -0.052680614055134356, -0.09631513580679893, 0.3903285290580243, -0.1239079402623247, -0.24277287600561975, 0.13766308499034494, -0.11453142601531, -0.08211269170278683, 0.17084122758824377, 0.14662043421449197, 0.1911009497474879, -0.1051654179696925, 0.11967559513213928, -0.023787463863845913, 0.17249081023037433, 0.04435740480839741, -0.07285223158542067, 0.06551952337322291, 0.16803757594307173, 0.1432273637095932, 0.11835299972444772, -0.02296420310231042, -0.12348646020982415, -0.29352510906755924, -0.17413348112022503, -0.25345485799189194, 0.027806424870504998, -0.15228195047802728, -0.1426886144094169, 0.40949496678076686, 0.13910682921050466, 0.1568702198448591, 0.15134792761527932, 0.3346780454739928, 0.15912781200604514, 0.02831103132921271, 0.07730351881764363, 0.22116305883973836, 0.14189577659708447, 0.09698698983265786, -0.29782591497641986, -0.004784869367722422, 0.22594540079589934]
|
1,803.05127
|
Feature Selection and Model Comparison on Microsoft Learning-to-Rank
Data Sets
|
With the rapid advance of the Internet, search engines (e.g., Google, Bing,
Yahoo!) are used by billions of users for each day. The main function of a
search engine is to locate the most relevant webpages corresponding to what the
user requests. This report focuses on the core problem of information
retrieval: how to learn the relevance between a document (very often webpage)
and a query given by user. Our analysis consists of two parts: 1) we use
standard statistical methods to select important features among 137 candidates
given by information retrieval researchers from Microsoft. We find that not all
the features are useful, and give interpretations on the top-selected features;
2) we give baselines on prediction over the real-world dataset MSLR-WEB by
using various learning algorithms. We find that models of boosting trees,
random forest in general achieve the best performance of prediction. This
agrees with the mainstream opinion in information retrieval community that
tree-based algorithms outperform the other candidates for this problem.
|
stat.AP cs.IR
|
with the rapid advance of the internet search engines eg google bing yahoo are used by billions of users for each day the main function of a search engine is to locate the most relevant webpages corresponding to what the user requests this report focuses on the core problem of information retrieval how to learn the relevance between a document very often webpage and a query given by user our analysis consists of two parts 1 we use standard statistical methods to select important features among 137 candidates given by information retrieval researchers from microsoft we find that not all the features are useful and give interpretations on the topselected features 2 we give baselines on prediction over the realworld dataset mslrweb by using various learning algorithms we find that models of boosting trees random forest in general achieve the best performance of prediction this agrees with the mainstream opinion in information retrieval community that treebased algorithms outperform the other candidates for this problem
|
[['with', 'the', 'rapid', 'advance', 'of', 'the', 'internet', 'search', 'engines', 'eg', 'google', 'bing', 'yahoo', 'are', 'used', 'by', 'billions', 'of', 'users', 'for', 'each', 'day', 'the', 'main', 'function', 'of', 'a', 'search', 'engine', 'is', 'to', 'locate', 'the', 'most', 'relevant', 'webpages', 'corresponding', 'to', 'what', 'the', 'user', 'requests', 'this', 'report', 'focuses', 'on', 'the', 'core', 'problem', 'of', 'information', 'retrieval', 'how', 'to', 'learn', 'the', 'relevance', 'between', 'a', 'document', 'very', 'often', 'webpage', 'and', 'a', 'query', 'given', 'by', 'user', 'our', 'analysis', 'consists', 'of', 'two', 'parts', '1', 'we', 'use', 'standard', 'statistical', 'methods', 'to', 'select', 'important', 'features', 'among', '137', 'candidates', 'given', 'by', 'information', 'retrieval', 'researchers', 'from', 'microsoft', 'we', 'find', 'that', 'not', 'all', 'the', 'features', 'are', 'useful', 'and', 'give', 'interpretations', 'on', 'the', 'topselected', 'features', '2', 'we', 'give', 'baselines', 'on', 'prediction', 'over', 'the', 'realworld', 'dataset', 'mslrweb', 'by', 'using', 'various', 'learning', 'algorithms', 'we', 'find', 'that', 'models', 'of', 'boosting', 'trees', 'random', 'forest', 'in', 'general', 'achieve', 'the', 'best', 'performance', 'of', 'prediction', 'this', 'agrees', 'with', 'the', 'mainstream', 'opinion', 'in', 'information', 'retrieval', 'community', 'that', 'treebased', 'algorithms', 'outperform', 'the', 'other', 'candidates', 'for', 'this', 'problem']]
|
[-0.04131513299351489, -0.0070197917398835685, -0.04556698891920624, 0.08712539197963283, -0.14036637527313384, -0.1618617838219866, 0.09544792854698536, 0.40980066391236986, -0.2571623081170356, -0.3658012514129097, 0.09939197142303771, -0.35719326853660155, -0.1518235818898294, 0.2383682383483069, -0.06801123698931877, 0.03460620783260782, 0.11106788417335922, 0.10984309323499968, -0.050047816621013166, -0.3284975286683838, 0.30330438265378623, 0.06847133353513515, 0.2966519871059759, 0.02586703908480244, 0.05174740868114671, 0.0024561823071210563, -0.11055188313023084, -0.030822837012417524, -0.11050757405812167, 0.16616905317641795, 0.34437233235437387, 0.258645660844689, 0.30126205309765575, -0.3561137437441007, -0.18768023139578693, 0.09901296234413705, 0.11698759222188662, 0.07992599549111162, -0.05810691773486151, -0.32015891770981714, 0.11141765551471991, -0.15323938507540727, 0.02196610349310953, -0.08622593815541929, 0.031002319213807767, 0.05323402996945344, -0.24393101270529038, -0.0014536753728019971, 0.03555141660969785, 0.055169335560712185, -0.02049093925319382, -0.11776835966875408, 0.05176378654123479, 0.2045488672612672, 0.036628642112281125, 0.030296611677952983, 0.1654026939039245, -0.17548209996096342, -0.21065319843775662, 0.42854374058452654, -0.0684698832201208, -0.14832153170582274, 0.18846621015109122, -0.0415444901086574, -0.1789148330119335, 0.0957047029622589, 0.20989755083473377, 0.12712660964066738, -0.16781451347870407, -0.010846863452626828, -0.06924869966647232, 0.19422832706851173, 0.03910770621955579, 0.004697077081576104, 0.23231871162374493, 0.22579763015088292, 0.04495082383998382, 0.1277196253021104, -0.08020244011465737, -0.08102078026700994, -0.20538053598921793, -0.1212169073757796, -0.1893053265413511, -0.032062805639949975, -0.14567625742778614, -0.14673635102695293, 0.4133840811059431, 0.27255036899199087, 0.19887458403410826, 0.06035731317774381, 0.3241198619275733, 0.0077848197226872504, 0.08388324575728656, 0.1391142125652505, 0.17083483712782185, -0.019757466257066914, 0.17360979300725307, -0.12672663565845815, 0.11541313186782286, 0.0585984986183452]
|
1,803.05128
|
On Power Law Scaling Dynamics for Time-fractional Phase Field Models
during Coarsening
|
In this paper, we study the phase field models with fractional-order in time.
The phase field models have been widely used to study coarsening dynamics of
material systems with microstructures. It is known that phase field models are
usually derived from energy variation so that they obey some energy dissipation
laws intrinsically. Recently, many works have been published on investigating
fractional-order phase field models, but little is known of the corresponding
energy dissipation laws. We focus on the time-fractional phase field models and
report that the effective free energy and roughness obey a universal power-law
scaling dynamics during coarsening. Mainly, the effective free energy and
roughness in the time-fractional phase field models scale by following a
similar power law as the integer phase field models, where the power is
linearly proportional to the fractional order. This universal scaling law is
verified numerically against several phase field models, including the
Cahn-Hilliard equations with different variable mobilities and molecular beam
epitaxy models. This new finding sheds light on potential applications of time
fractional phase field models in studying coarsening dynamics and crystal
growths.
|
math.NA
|
in this paper we study the phase field models with fractionalorder in time the phase field models have been widely used to study coarsening dynamics of material systems with microstructures it is known that phase field models are usually derived from energy variation so that they obey some energy dissipation laws intrinsically recently many works have been published on investigating fractionalorder phase field models but little is known of the corresponding energy dissipation laws we focus on the timefractional phase field models and report that the effective free energy and roughness obey a universal powerlaw scaling dynamics during coarsening mainly the effective free energy and roughness in the timefractional phase field models scale by following a similar power law as the integer phase field models where the power is linearly proportional to the fractional order this universal scaling law is verified numerically against several phase field models including the cahnhilliard equations with different variable mobilities and molecular beam epitaxy models this new finding sheds light on potential applications of time fractional phase field models in studying coarsening dynamics and crystal growths
|
[['in', 'this', 'paper', 'we', 'study', 'the', 'phase', 'field', 'models', 'with', 'fractionalorder', 'in', 'time', 'the', 'phase', 'field', 'models', 'have', 'been', 'widely', 'used', 'to', 'study', 'coarsening', 'dynamics', 'of', 'material', 'systems', 'with', 'microstructures', 'it', 'is', 'known', 'that', 'phase', 'field', 'models', 'are', 'usually', 'derived', 'from', 'energy', 'variation', 'so', 'that', 'they', 'obey', 'some', 'energy', 'dissipation', 'laws', 'intrinsically', 'recently', 'many', 'works', 'have', 'been', 'published', 'on', 'investigating', 'fractionalorder', 'phase', 'field', 'models', 'but', 'little', 'is', 'known', 'of', 'the', 'corresponding', 'energy', 'dissipation', 'laws', 'we', 'focus', 'on', 'the', 'timefractional', 'phase', 'field', 'models', 'and', 'report', 'that', 'the', 'effective', 'free', 'energy', 'and', 'roughness', 'obey', 'a', 'universal', 'powerlaw', 'scaling', 'dynamics', 'during', 'coarsening', 'mainly', 'the', 'effective', 'free', 'energy', 'and', 'roughness', 'in', 'the', 'timefractional', 'phase', 'field', 'models', 'scale', 'by', 'following', 'a', 'similar', 'power', 'law', 'as', 'the', 'integer', 'phase', 'field', 'models', 'where', 'the', 'power', 'is', 'linearly', 'proportional', 'to', 'the', 'fractional', 'order', 'this', 'universal', 'scaling', 'law', 'is', 'verified', 'numerically', 'against', 'several', 'phase', 'field', 'models', 'including', 'the', 'cahnhilliard', 'equations', 'with', 'different', 'variable', 'mobilities', 'and', 'molecular', 'beam', 'epitaxy', 'models', 'this', 'new', 'finding', 'sheds', 'light', 'on', 'potential', 'applications', 'of', 'time', 'fractional', 'phase', 'field', 'models', 'in', 'studying', 'coarsening', 'dynamics', 'and', 'crystal', 'growths']]
|
[-0.1375197481739628, 0.1872369010375751, -0.12941503448885203, 0.0586998877585068, -0.04273212045683263, -0.16822476021415497, -0.017632858947984546, 0.35911100265153206, -0.2788652271824729, -0.32285217806254385, 0.11240151931804435, -0.23534430163135514, -0.16489120105600488, 0.19632566761410697, -0.028463323752380372, 0.10252760796812851, -0.04959586992131762, -0.020426454830359028, -0.03266740135928276, -0.2037044313192131, 0.332629588684736, 0.059311022138151016, 0.314229732255827, 0.012711046428229268, 0.08432155336351108, -0.08331233209374654, 0.003448528799778931, 0.04894689022105455, -0.19693980769839398, 0.0115520267860542, 0.1856931717577921, -0.02551330194823979, 0.22677239006930622, -0.45518744065560074, -0.31516470647936695, 0.11562261493871431, 0.13073035496163557, 0.10864120319573137, -0.08537436200907834, -0.21581250985631545, 0.004389350400280557, -0.13324734738652302, -0.12938495367014194, -0.07960037114638938, 0.042462294384224844, 0.08417222820844975, -0.20842205945277606, 0.1301379356843944, 0.046410354749603165, 0.07323088693800409, -0.10011134329457762, -0.10775297353152206, -0.012993048397999113, 0.05529483966014827, 0.08363044444466453, 0.03268440767675021, 0.11542960941966479, -0.17056247428476357, -0.1044175545993719, 0.38027132141985287, -0.032042695566348076, -0.17551436702828874, 0.18844689764159614, -0.1536720619171611, -0.10833001452451829, 0.14639138830671325, 0.17128925574834084, 0.11263365482627505, -0.17367079254569104, 0.10746996127461657, 0.032240920309080275, 0.21919272589151237, 0.012461343793023522, 0.020816740026769552, 0.18481229663728763, 0.1850021962405733, -0.006897950766528365, 0.12086827670949517, -0.05984701102120977, -0.2027800059517156, -0.25612724547722066, -0.1374892558290196, -0.1817432542984986, 0.03274588012110792, -0.10438587554839494, -0.15437540758751045, 0.4130379506978541, 0.1568576001860613, 0.13856322923932451, 0.049430107040516, 0.2743220644390715, 0.20474049666039748, 0.06955825298952546, 0.05976767617262365, 0.23622381330666503, 0.1496497708802415, 0.1662158317405998, -0.22921064573832792, 0.052775256567279605, 0.07915533352283072]
|
1,803.05129
|
Classical correlation and quantum entanglement in the mixed-spin
Ising-XY model with Dzyaloshinskii-Moriya interaction
|
In the present work, initially a mixed-three-spin (1/2,1,1/2) cell of a
mixed-N-spin chain with Ising-XY model is introduced, for which pair spins
(1,1/2) have Ising-type interaction and pair spins (1/2,1/2) have both XY-type
and Dzyaloshinskii-Moriya(DM) interactions together. An external homogeneous
magnetic field B is considered for the system in thermal equilibrium.
Integer-spins have a single-ion anisotropy property with coefficient {\zeta}.
Then, we investigate the quantum entanglement between half-spins (1/2,1/2), by
means of the concurrence. Classical correlation(CC) for this pair of spins is
investigated as well as the concurrence and some interesting the temperature,
the magnetic field and the DM interaction properties are expressed. Moreover,
single-ion anisotropy effects on the correlation between half-spins is
verified. According to the verifications based on the communication channels
category by D. Rossini, V. Giovannetti and R. Fazio 63, we theoretically
consider such tripartite spin model as an ideal quantum channel, then calculate
its information transmission rate and express some differences in behaviour
between this suggested model and introduced simple models in the previous
works(chains without spin integer and DM interaction) from information
transferring protocol point of view.
|
cond-mat.stat-mech quant-ph
|
in the present work initially a mixedthreespin 12112 cell of a mixednspin chain with isingxy model is introduced for which pair spins 112 have isingtype interaction and pair spins 1212 have both xytype and dzyaloshinskiimoriyadm interactions together an external homogeneous magnetic field b is considered for the system in thermal equilibrium integerspins have a singleion anisotropy property with coefficient zeta then we investigate the quantum entanglement between halfspins 1212 by means of the concurrence classical correlationcc for this pair of spins is investigated as well as the concurrence and some interesting the temperature the magnetic field and the dm interaction properties are expressed moreover singleion anisotropy effects on the correlation between halfspins is verified according to the verifications based on the communication channels category by d rossini v giovannetti and r fazio 63 we theoretically consider such tripartite spin model as an ideal quantum channel then calculate its information transmission rate and express some differences in behaviour between this suggested model and introduced simple models in the previous workschains without spin integer and dm interaction from information transferring protocol point of view
|
[['in', 'the', 'present', 'work', 'initially', 'a', 'mixedthreespin', '12112', 'cell', 'of', 'a', 'mixednspin', 'chain', 'with', 'isingxy', 'model', 'is', 'introduced', 'for', 'which', 'pair', 'spins', '112', 'have', 'isingtype', 'interaction', 'and', 'pair', 'spins', '1212', 'have', 'both', 'xytype', 'and', 'dzyaloshinskiimoriyadm', 'interactions', 'together', 'an', 'external', 'homogeneous', 'magnetic', 'field', 'b', 'is', 'considered', 'for', 'the', 'system', 'in', 'thermal', 'equilibrium', 'integerspins', 'have', 'a', 'singleion', 'anisotropy', 'property', 'with', 'coefficient', 'zeta', 'then', 'we', 'investigate', 'the', 'quantum', 'entanglement', 'between', 'halfspins', '1212', 'by', 'means', 'of', 'the', 'concurrence', 'classical', 'correlationcc', 'for', 'this', 'pair', 'of', 'spins', 'is', 'investigated', 'as', 'well', 'as', 'the', 'concurrence', 'and', 'some', 'interesting', 'the', 'temperature', 'the', 'magnetic', 'field', 'and', 'the', 'dm', 'interaction', 'properties', 'are', 'expressed', 'moreover', 'singleion', 'anisotropy', 'effects', 'on', 'the', 'correlation', 'between', 'halfspins', 'is', 'verified', 'according', 'to', 'the', 'verifications', 'based', 'on', 'the', 'communication', 'channels', 'category', 'by', 'd', 'rossini', 'v', 'giovannetti', 'and', 'r', 'fazio', '63', 'we', 'theoretically', 'consider', 'such', 'tripartite', 'spin', 'model', 'as', 'an', 'ideal', 'quantum', 'channel', 'then', 'calculate', 'its', 'information', 'transmission', 'rate', 'and', 'express', 'some', 'differences', 'in', 'behaviour', 'between', 'this', 'suggested', 'model', 'and', 'introduced', 'simple', 'models', 'in', 'the', 'previous', 'workschains', 'without', 'spin', 'integer', 'and', 'dm', 'interaction', 'from', 'information', 'transferring', 'protocol', 'point', 'of', 'view']]
|
[-0.18016230738804942, 0.15993768758423227, -0.032977580508948966, 0.0528565034017499, -0.004764762917267425, -0.19448276868356126, 0.018815610801268902, 0.3758774275652, -0.2670828701103372, -0.30617990396916867, 0.030132352894039028, -0.29436011678938356, -0.10106331648038966, 0.15570665484959526, 0.06017576713913254, 0.005759793668652751, -0.0009309352561831474, 0.0758150060089039, -0.030195468533784152, -0.2182061085078333, 0.3015337827187198, 0.03682602571988745, 0.24441399413427073, 0.07461077502795628, 0.08514979665500245, 0.06241485063917935, 0.0432508772851101, 0.018380020195244078, -0.1564441937254742, 0.04717723512489881, 0.18647727640006842, 0.036780538516385214, 0.1874322896909767, -0.38653676416192734, -0.19754855449710573, 0.08596248390419142, 0.1214212389689471, 0.11372967991246177, -0.04357487001589366, -0.2974736796851669, 0.02216762279692505, -0.2149908368535606, -0.08388965401798487, -0.07308035999802606, 0.049083485401102474, 0.01831282620584326, -0.2951905900878566, 0.09646970716438123, 0.07800524852438165, 0.11990615690792246, -0.04735017558759345, -0.09784670657544796, -0.04685989946126938, 0.09688190090736108, 0.020211490721308758, 0.05184859660121479, 0.1071668140590191, -0.10638500872932907, -0.13919171624983262, 0.34215774908528795, -0.06604497483931482, -0.19251675070396493, 0.17625406618795492, -0.1157155269184815, -0.08630511401487248, 0.049030823767451305, 0.11627112547068724, 0.07342058626136609, -0.17264813362753817, 0.10785410528470363, -0.021393599632595267, 0.14371824413355042, 0.029808387434376138, 0.07849196533472942, 0.2385042884626559, 0.09598509812727571, 0.012983704495376775, 0.17809202092034476, -0.08837578157495175, -0.11570553027891688, -0.239988603216729, -0.1855462349578738, -0.22560962973960808, 0.06879283604212105, -0.0850590805948845, -0.10521245741617999, 0.36851970934708206, 0.14473424518431524, 0.19750133624300362, 0.009870652338889029, 0.2461453825847379, 0.08641699604490506, 0.013890481361387564, 0.058564340049134835, 0.24265685465353143, 0.21048976603629332, 0.07358286158846958, -0.2580906882802291, 0.06534615626425615, 0.04077576760202646]
|
1,803.0513
|
Signal Processing and Piecewise Convex Estimation
|
Many problems on signal processing reduce to nonparametric function
estimation. We propose a new methodology, piecewise convex fitting (PCF), and
give a two-stage adaptive estimate. In the first stage, the number and location
of the change points is estimated using strong smoothing. In the second stage,
a constrained smoothing spline fit is performed with the smoothing level chosen
to minimize the MSE. The imposed constraint is that a single change point
occurs in a region about each empirical change point of the first-stage
estimate. This constraint is equivalent to requiring that the third derivative
of the second-stage estimate has a single sign in a small neighborhood about
each first-stage change point. We sketch how PCF may be applied to signal
recovery, instantaneous frequency estimation, surface reconstruction, image
segmentation, spectral estimation and multivariate adaptive regression.
|
stat.ME eess.SP math.ST physics.data-an stat.ML stat.TH
|
many problems on signal processing reduce to nonparametric function estimation we propose a new methodology piecewise convex fitting pcf and give a twostage adaptive estimate in the first stage the number and location of the change points is estimated using strong smoothing in the second stage a constrained smoothing spline fit is performed with the smoothing level chosen to minimize the mse the imposed constraint is that a single change point occurs in a region about each empirical change point of the firststage estimate this constraint is equivalent to requiring that the third derivative of the secondstage estimate has a single sign in a small neighborhood about each firststage change point we sketch how pcf may be applied to signal recovery instantaneous frequency estimation surface reconstruction image segmentation spectral estimation and multivariate adaptive regression
|
[['many', 'problems', 'on', 'signal', 'processing', 'reduce', 'to', 'nonparametric', 'function', 'estimation', 'we', 'propose', 'a', 'new', 'methodology', 'piecewise', 'convex', 'fitting', 'pcf', 'and', 'give', 'a', 'twostage', 'adaptive', 'estimate', 'in', 'the', 'first', 'stage', 'the', 'number', 'and', 'location', 'of', 'the', 'change', 'points', 'is', 'estimated', 'using', 'strong', 'smoothing', 'in', 'the', 'second', 'stage', 'a', 'constrained', 'smoothing', 'spline', 'fit', 'is', 'performed', 'with', 'the', 'smoothing', 'level', 'chosen', 'to', 'minimize', 'the', 'mse', 'the', 'imposed', 'constraint', 'is', 'that', 'a', 'single', 'change', 'point', 'occurs', 'in', 'a', 'region', 'about', 'each', 'empirical', 'change', 'point', 'of', 'the', 'firststage', 'estimate', 'this', 'constraint', 'is', 'equivalent', 'to', 'requiring', 'that', 'the', 'third', 'derivative', 'of', 'the', 'secondstage', 'estimate', 'has', 'a', 'single', 'sign', 'in', 'a', 'small', 'neighborhood', 'about', 'each', 'firststage', 'change', 'point', 'we', 'sketch', 'how', 'pcf', 'may', 'be', 'applied', 'to', 'signal', 'recovery', 'instantaneous', 'frequency', 'estimation', 'surface', 'reconstruction', 'image', 'segmentation', 'spectral', 'estimation', 'and', 'multivariate', 'adaptive', 'regression']]
|
[-0.08222614465031161, -0.013344416958662167, -0.12034600680787812, 0.07398739256270563, -0.12570000947000234, -0.17576676638060207, 0.07587208228755686, 0.39333476773254683, -0.3158419333231538, -0.2980236621650019, 0.1693110531647759, -0.2297772370146782, -0.12309690997475382, 0.12263492418022187, -0.12996180051326953, 0.07077759303458368, 0.05884183751446987, 0.04666662177960597, -0.13339435912793807, -0.2459819461479644, 0.25537540746762405, 0.06638994730258388, 0.27991250072042945, -0.03752569975539931, 0.14292743214955136, 0.05235583447927693, -0.05283279118385277, -0.003049626294002215, -0.12850351217465644, 0.11475790533890474, 0.24702496570187496, 0.13276755115114597, 0.3515665553433737, -0.35046858375252626, -0.2394390647358664, 0.15294295953892506, 0.11130731022541425, 0.0799007482154281, -0.03839450345266916, -0.21752898388285077, 0.0741148456138795, -0.09645504595315668, -0.07271388015334508, -0.03687051162532003, -0.062462364299111624, 0.008578442683471228, -0.3608415301110762, 0.09065126395200504, 0.03110663320021287, 0.05228910828704265, -0.05517989413381846, -0.11298469402966325, 0.0013379957353168014, 0.10803767920596831, 0.016816746756267636, 0.09223081125750088, 0.17859636771722015, -0.0964206897309606, -0.06149387182302968, 0.3246493968789452, -0.08639969493943586, -0.2339353270467315, 0.11103617976099919, -0.12753186635707797, -0.1515445317239014, 0.17151982874553656, 0.21947733912992276, 0.07724118097893783, -0.14690612268602865, 0.03183411493933926, 0.004215651747784508, 0.22428367738312271, 0.08463922674670371, -0.060933779146689085, 0.17697745677667545, 0.19497773286177597, 0.14793819294801094, 0.14868088934827708, -0.18815673255785578, -0.056325763846233265, -0.34139011149753384, -0.09946136629737135, -0.23232542919412033, -0.05339498428016234, -0.14881870866400873, -0.20564296841968907, 0.4158250295327726, 0.17065578794763633, 0.21993605173957437, 0.0513272310551534, 0.33159902736322205, 0.19963689664128556, 0.04081429327914575, 0.051472447989786514, 0.2102697920749214, 0.0793171340057543, 0.05791569987673368, -0.20077623069349768, 0.1128016352347696, 0.07146936733755213]
|
1,803.05131
|
Feature extraction without learning in an analog Spatial Pooler
memristive-CMOS circuit design of Hierarchical Temporal Memory
|
Hierarchical Temporal Memory (HTM) is a neuromorphic algorithm that emulates
sparsity, hierarchy and modularity resembling the working principles of
neocortex. Feature encoding is an important step to create sparse binary
patterns. This sparsity is introduced by the binary weights and random weight
assignment in the initialization stage of the HTM. We propose the alternative
deterministic method for the HTM initialization stage, which connects the HTM
weights to the input data and preserves natural sparsity of the input
information. Further, we introduce the hardware implementation of the
deterministic approach and compare it to the traditional HTM and existing
hardware implementation. We test the proposed approach on the face recognition
problem and show that it outperforms the conventional HTM approach.
|
cs.ET cs.AI cs.AR cs.NE
|
hierarchical temporal memory htm is a neuromorphic algorithm that emulates sparsity hierarchy and modularity resembling the working principles of neocortex feature encoding is an important step to create sparse binary patterns this sparsity is introduced by the binary weights and random weight assignment in the initialization stage of the htm we propose the alternative deterministic method for the htm initialization stage which connects the htm weights to the input data and preserves natural sparsity of the input information further we introduce the hardware implementation of the deterministic approach and compare it to the traditional htm and existing hardware implementation we test the proposed approach on the face recognition problem and show that it outperforms the conventional htm approach
|
[['hierarchical', 'temporal', 'memory', 'htm', 'is', 'a', 'neuromorphic', 'algorithm', 'that', 'emulates', 'sparsity', 'hierarchy', 'and', 'modularity', 'resembling', 'the', 'working', 'principles', 'of', 'neocortex', 'feature', 'encoding', 'is', 'an', 'important', 'step', 'to', 'create', 'sparse', 'binary', 'patterns', 'this', 'sparsity', 'is', 'introduced', 'by', 'the', 'binary', 'weights', 'and', 'random', 'weight', 'assignment', 'in', 'the', 'initialization', 'stage', 'of', 'the', 'htm', 'we', 'propose', 'the', 'alternative', 'deterministic', 'method', 'for', 'the', 'htm', 'initialization', 'stage', 'which', 'connects', 'the', 'htm', 'weights', 'to', 'the', 'input', 'data', 'and', 'preserves', 'natural', 'sparsity', 'of', 'the', 'input', 'information', 'further', 'we', 'introduce', 'the', 'hardware', 'implementation', 'of', 'the', 'deterministic', 'approach', 'and', 'compare', 'it', 'to', 'the', 'traditional', 'htm', 'and', 'existing', 'hardware', 'implementation', 'we', 'test', 'the', 'proposed', 'approach', 'on', 'the', 'face', 'recognition', 'problem', 'and', 'show', 'that', 'it', 'outperforms', 'the', 'conventional', 'htm', 'approach']]
|
[-0.07756969963705515, 0.04010740784897126, -0.06907047449326995, 0.06486570378134059, -0.12417610169593561, -0.20394797742729848, 0.0077049506993932745, 0.44417350581389364, -0.3459473238563386, -0.30410631855858994, 0.09945238190130883, -0.18086943164333638, -0.2462361861332083, 0.09753707948661709, -0.08879295280361074, 0.12142851618828915, 0.13131512475784046, 0.045946384284850525, -0.034566917081789696, -0.2762471602310158, 0.2709313780010157, 0.09080469199472059, 0.35075089682714417, -0.04319860973253341, 0.17092999625582075, 0.0009091390006765092, -0.03585442650660683, -0.08947250031140018, -0.027373447097365357, 0.1717460143125332, 0.24488942097809355, 0.25023523188922236, 0.29023470535432383, -0.4196623207496132, -0.1724859600278975, 0.07223852530173105, 0.11120973927584493, 0.10972310610656169, -0.01940408175104787, -0.2753657545614198, 0.120094940239974, -0.15661726506442716, -0.016386058368972677, -0.1372832835360156, -0.04660632054053121, -0.045537797138252754, -0.3335731273548583, 0.02442497957371554, 0.12328888705698034, -0.027011425013385586, -0.027139601712036183, -0.13561413424894592, 0.059598870015055955, 0.07776925818189599, -0.027408299788090763, 0.03965880548861667, 0.1197566885217014, -0.13155562274544735, -0.18762418631685235, 0.35361349737366377, -0.025230536402116324, -0.20481561177994234, 0.1805926253150959, 0.007957359290508143, -0.17612069115926654, 0.03411510087928529, 0.17624813933477942, 0.04713168314074056, -0.11683991049432148, 0.06660347800776836, -0.0071235197868545425, 0.20101792246134856, 0.0485345115332659, 0.05663051909246182, 0.12733060142846178, 0.30007411719110433, 0.04712970359882308, 0.16939820925373647, -0.1337346565826812, -0.1258851603715349, -0.21554847512102165, -0.1344672011022093, -0.21799911643867775, -0.0716266151284799, -0.13886431497605556, -0.16823807803882382, 0.46898825267740224, 0.24664574242749457, 0.20315938222348312, 0.14088911966690043, 0.38319006169479247, 0.07302134456823312, 0.15013594453428256, 0.09540500259421514, 0.11949358036952741, 0.042685581842768876, 0.13399214318645644, -0.24597135736701725, 0.10433085838858615, 0.07930206889444488]
|
1,803.05132
|
Neuron inspired data encoding memristive multi-level memory cell
|
Mapping neuro-inspired algorithms to sensor backplanes of on-chip hardware
require shifting the signal processing from digital to the analog domain,
demanding memory technologies beyond conventional CMOS binary storage units.
Using memristors for building analog data storage is one of the promising
approaches amongst emerging non-volatile memory technologies. Recently, a
memristive multi-level memory (MLM) cell for storing discrete analog values has
been developed in which memory system is implemented combining memristors in
voltage divider configuration. In given example, the memory cell of 3 sub-cells
with a memristor in each was programmed to store ternary bits which overall
achieved 10 and 27 discrete voltage levels. However, for further use of
proposed memory cell in analog signal processing circuits data encoder is
required to generate control voltages for programming memristors to store
discrete analog values. In this paper, we present the design and performance
analysis of data encoder that generates write pattern signals for 10 level
memristive memory.
|
cs.ET cs.AR cs.NE
|
mapping neuroinspired algorithms to sensor backplanes of onchip hardware require shifting the signal processing from digital to the analog domain demanding memory technologies beyond conventional cmos binary storage units using memristors for building analog data storage is one of the promising approaches amongst emerging nonvolatile memory technologies recently a memristive multilevel memory mlm cell for storing discrete analog values has been developed in which memory system is implemented combining memristors in voltage divider configuration in given example the memory cell of 3 subcells with a memristor in each was programmed to store ternary bits which overall achieved 10 and 27 discrete voltage levels however for further use of proposed memory cell in analog signal processing circuits data encoder is required to generate control voltages for programming memristors to store discrete analog values in this paper we present the design and performance analysis of data encoder that generates write pattern signals for 10 level memristive memory
|
[['mapping', 'neuroinspired', 'algorithms', 'to', 'sensor', 'backplanes', 'of', 'onchip', 'hardware', 'require', 'shifting', 'the', 'signal', 'processing', 'from', 'digital', 'to', 'the', 'analog', 'domain', 'demanding', 'memory', 'technologies', 'beyond', 'conventional', 'cmos', 'binary', 'storage', 'units', 'using', 'memristors', 'for', 'building', 'analog', 'data', 'storage', 'is', 'one', 'of', 'the', 'promising', 'approaches', 'amongst', 'emerging', 'nonvolatile', 'memory', 'technologies', 'recently', 'a', 'memristive', 'multilevel', 'memory', 'mlm', 'cell', 'for', 'storing', 'discrete', 'analog', 'values', 'has', 'been', 'developed', 'in', 'which', 'memory', 'system', 'is', 'implemented', 'combining', 'memristors', 'in', 'voltage', 'divider', 'configuration', 'in', 'given', 'example', 'the', 'memory', 'cell', 'of', '3', 'subcells', 'with', 'a', 'memristor', 'in', 'each', 'was', 'programmed', 'to', 'store', 'ternary', 'bits', 'which', 'overall', 'achieved', '10', 'and', '27', 'discrete', 'voltage', 'levels', 'however', 'for', 'further', 'use', 'of', 'proposed', 'memory', 'cell', 'in', 'analog', 'signal', 'processing', 'circuits', 'data', 'encoder', 'is', 'required', 'to', 'generate', 'control', 'voltages', 'for', 'programming', 'memristors', 'to', 'store', 'discrete', 'analog', 'values', 'in', 'this', 'paper', 'we', 'present', 'the', 'design', 'and', 'performance', 'analysis', 'of', 'data', 'encoder', 'that', 'generates', 'write', 'pattern', 'signals', 'for', '10', 'level', 'memristive', 'memory']]
|
[-0.15034061125312995, 0.05465380013469727, 0.010485453763976693, -0.02141897880111731, -0.08350803595516951, -0.27083123427244926, 0.10132355267076844, 0.4069588317032603, -0.2893177210112974, -0.3326866838239854, 0.12726767986126605, -0.22675460607955053, -0.15526334777955086, 0.253042956285419, -0.12695938030167694, 0.11700356375414787, 0.04644197338230668, 0.004773386120036922, -0.016887570787108532, -0.22866860486702212, 0.1419017960677945, 0.0874859407904648, 0.3629107885663548, -0.0762186989128109, 0.15215626938734203, -0.06551328152267923, 0.012388637863219745, -0.07760835455189789, -0.017323365475421005, 0.12977102225826634, 0.3428204107714156, 0.1263854315429325, 0.24892319130801385, -0.5427393326956418, -0.21175421743969164, 0.06827738384205488, 0.11364421461138033, 0.11087419478853623, -0.10799011075043029, -0.20754010866981962, 0.16046814901694176, -0.2041872955978878, 0.006998506066719851, -0.09236220486101604, 0.04857696243111164, 0.023768516515584422, -0.2781408636920875, -0.029895808962323973, 0.0459120805431608, 0.046380148185116626, -0.036606504768133166, -0.13752524349613177, 0.04009234450059011, 0.11206724980823515, -0.13260505198869074, 0.007735723961001983, 0.19206533402865453, -0.08164053008283279, -0.20654998742524655, 0.30044506879283056, 0.001280523988328153, -0.17217501988709574, 0.10617694889886245, -0.05499022481963038, -0.11288577880289766, 0.10905692956176578, 0.19328288572930521, -0.032250645831828156, -0.20316562135253222, 0.07453664420247678, 0.10426473296547849, 0.2639910012603767, 0.10715957233351805, 0.1233374780104045, 0.17683250627240105, 0.2984594639150366, 0.022288809275074352, 0.19506792298427994, -0.11165533097378248, -0.10326366249862458, -0.20632430831263324, -0.18665810716488668, -0.23794357274628936, 0.04368474103074761, -0.07160860186934681, -0.15554686634530945, 0.36617427761516264, 0.1850825914812665, 0.10259804888478209, 0.060875157770069854, 0.3907180617533384, 0.09629421967171854, 0.24374388191818952, 0.08308741812014037, 0.09036883425057655, 0.11763639076342505, 0.25146810513951123, -0.19256496272170015, 0.05687254312928886, 0.0032134000872892717]
|
1,803.05133
|
Nearly defect-free dynamical models of disordered solids: The case of
amorphous silicon
|
It is widely accepted in the materials modeling community that defect-free
realistic networks of amorphous silicon cannot be prepared by quenching from a
molten state of silicon using classical or ab initio molecular-dynamics (MD)
simulations. In this work, we address this long-standing problem by producing
nearly defect-free ultra-large models of amorphous silicon, consisting of up to
half-a-million atoms, using classical molecular-dynamics simulations. The
structural, topological, electronic, and vibrational properties of the models
are presented and compared with experimental data. A comparison of the models
with those obtained from using the modified Wooten-Winer-Weaire bond-switching
algorithm shows that the models are on par with the latter, which were
generated via event-based total-energy relaxations of atomistic networks in the
configuration space. The MD models produced in this work represent the highest
quality of amorphous-silicon networks so far reported in the literature using
molecular-dynamics simulations.
|
cond-mat.dis-nn physics.comp-ph
|
it is widely accepted in the materials modeling community that defectfree realistic networks of amorphous silicon cannot be prepared by quenching from a molten state of silicon using classical or ab initio moleculardynamics md simulations in this work we address this longstanding problem by producing nearly defectfree ultralarge models of amorphous silicon consisting of up to halfamillion atoms using classical moleculardynamics simulations the structural topological electronic and vibrational properties of the models are presented and compared with experimental data a comparison of the models with those obtained from using the modified wootenwinerweaire bondswitching algorithm shows that the models are on par with the latter which were generated via eventbased totalenergy relaxations of atomistic networks in the configuration space the md models produced in this work represent the highest quality of amorphoussilicon networks so far reported in the literature using moleculardynamics simulations
|
[['it', 'is', 'widely', 'accepted', 'in', 'the', 'materials', 'modeling', 'community', 'that', 'defectfree', 'realistic', 'networks', 'of', 'amorphous', 'silicon', 'can', 'not', 'be', 'prepared', 'by', 'quenching', 'from', 'a', 'molten', 'state', 'of', 'silicon', 'using', 'classical', 'or', 'ab', 'initio', 'moleculardynamics', 'md', 'simulations', 'in', 'this', 'work', 'we', 'address', 'this', 'longstanding', 'problem', 'by', 'producing', 'nearly', 'defectfree', 'ultralarge', 'models', 'of', 'amorphous', 'silicon', 'consisting', 'of', 'up', 'to', 'halfamillion', 'atoms', 'using', 'classical', 'moleculardynamics', 'simulations', 'the', 'structural', 'topological', 'electronic', 'and', 'vibrational', 'properties', 'of', 'the', 'models', 'are', 'presented', 'and', 'compared', 'with', 'experimental', 'data', 'a', 'comparison', 'of', 'the', 'models', 'with', 'those', 'obtained', 'from', 'using', 'the', 'modified', 'wootenwinerweaire', 'bondswitching', 'algorithm', 'shows', 'that', 'the', 'models', 'are', 'on', 'par', 'with', 'the', 'latter', 'which', 'were', 'generated', 'via', 'eventbased', 'totalenergy', 'relaxations', 'of', 'atomistic', 'networks', 'in', 'the', 'configuration', 'space', 'the', 'md', 'models', 'produced', 'in', 'this', 'work', 'represent', 'the', 'highest', 'quality', 'of', 'amorphoussilicon', 'networks', 'so', 'far', 'reported', 'in', 'the', 'literature', 'using', 'moleculardynamics', 'simulations']]
|
[-0.04415548819649432, 0.10386864119375656, -0.083446878677101, -0.003913998266216368, 0.0370288394857198, -0.11343488575158907, 0.017607889054176797, 0.43885555109009144, -0.2526504872732663, -0.3154136618599296, 0.054558793645784524, -0.3002375649887004, -0.1609435290380913, 0.19988765456946567, 0.031025815741824253, 0.11182038549200765, 0.11876526736388249, -0.0726531255358298, -0.06892388245822596, -0.2225982845020813, 0.2537024791202774, 0.10663711010877575, 0.2908503750139581, -0.008415926835732534, 0.05359188958287372, -0.059998844693395115, 0.010289757585685169, 0.05553449636770113, -0.17197321997841106, 0.15605184454720333, 0.2543293006377488, 0.02503104685539646, 0.22049213874353363, -0.5229247746323901, -0.26998931673255616, 0.05281202881680136, 0.10392832413448819, 0.15521760246566763, -0.05582948396996861, -0.26585636848051636, 0.10689606885176285, -0.1469277618527745, -0.04084561606869101, -0.08574265846649982, -0.06060650444456509, 0.03894045625015029, -0.20338905367700916, 0.06989095810942152, 0.007075967397291346, 0.08425688636821828, -0.10419020406635744, -0.14493970145870533, -0.035639457797099434, 0.059831232225821755, -0.021152673869593335, 0.028290214642350164, 0.16372378239341612, -0.10810119263062785, -0.15428820269714508, 0.42387285314034673, -0.04953369553134378, -0.1487346388266555, 0.24131880112358237, -0.08884401695270623, -0.12409786083901833, 0.13518595912693335, 0.11999620446419743, 0.1339144323270635, -0.17378184869220215, 0.061624768308995825, -0.04272760292182543, 0.18760330630383187, 0.03785327494676624, -0.015574185410514474, 0.1798566542025323, 0.24758903257814902, -0.07259241693786213, 0.1519571374361736, -0.06525973934247824, -0.11553134701347777, -0.18569056982440607, -0.13083287293224463, -0.2445214329969271, 0.05458410130574651, -0.041887968678617785, -0.18516845920655345, 0.35872735946239637, 0.15709064429143577, 0.1370972279392715, 0.011781496921321378, 0.287985113182471, 0.04060489191407604, 0.07119350801222027, 0.03690792148201061, 0.2676706584569599, 0.12799592099119245, 0.08720941739156843, -0.20099789841499713, 0.09191149778780527, 0.011416814063808747]
|
1,803.05134
|
Performance study of particle identification at the CEPC using TPC
$dE/dx$ information
|
The kaon identification is crucial for the flavor physics, and also benefits
the flavor and charge reconstruction of the jets. We explore the particle
identification capability for tracks with momenta ranging from 2-20 GeV/c using
the $dE/dx$ measurements in the Time Projection Chamber at the future Circular
Electron-Positron Collider. Based on Monte Carlo simulation, we anticipate that
an average $3.2~\sigma$ ($2.6~\sigma$) $K/\pi$ separation can be achieved based
on $dE/dx$ information for an optimistic (conservative) extrapolation of the
simulated performance to the final system. Time-of-flight (TOF) information
from the Electromagnetic Calorimeter can provide $K/\pi$ separation around 1
GeV/c and reduce the $K/p$ mis-identification rate. By combining the $dE/dx$
and TOF information, we estimate that in the optimistic scenario a kaon
selection in inclusive hadronic $Z$ decays with both the average efficiency and
purity approaching 95\% can be achieved.
|
physics.ins-det hep-ex
|
the kaon identification is crucial for the flavor physics and also benefits the flavor and charge reconstruction of the jets we explore the particle identification capability for tracks with momenta ranging from 220 gevc using the dedx measurements in the time projection chamber at the future circular electronpositron collider based on monte carlo simulation we anticipate that an average 32sigma 26sigma kpi separation can be achieved based on dedx information for an optimistic conservative extrapolation of the simulated performance to the final system timeofflight tof information from the electromagnetic calorimeter can provide kpi separation around 1 gevc and reduce the kp misidentification rate by combining the dedx and tof information we estimate that in the optimistic scenario a kaon selection in inclusive hadronic z decays with both the average efficiency and purity approaching 95 can be achieved
|
[['the', 'kaon', 'identification', 'is', 'crucial', 'for', 'the', 'flavor', 'physics', 'and', 'also', 'benefits', 'the', 'flavor', 'and', 'charge', 'reconstruction', 'of', 'the', 'jets', 'we', 'explore', 'the', 'particle', 'identification', 'capability', 'for', 'tracks', 'with', 'momenta', 'ranging', 'from', '220', 'gevc', 'using', 'the', 'dedx', 'measurements', 'in', 'the', 'time', 'projection', 'chamber', 'at', 'the', 'future', 'circular', 'electronpositron', 'collider', 'based', 'on', 'monte', 'carlo', 'simulation', 'we', 'anticipate', 'that', 'an', 'average', '32sigma', '26sigma', 'kpi', 'separation', 'can', 'be', 'achieved', 'based', 'on', 'dedx', 'information', 'for', 'an', 'optimistic', 'conservative', 'extrapolation', 'of', 'the', 'simulated', 'performance', 'to', 'the', 'final', 'system', 'timeofflight', 'tof', 'information', 'from', 'the', 'electromagnetic', 'calorimeter', 'can', 'provide', 'kpi', 'separation', 'around', '1', 'gevc', 'and', 'reduce', 'the', 'kp', 'misidentification', 'rate', 'by', 'combining', 'the', 'dedx', 'and', 'tof', 'information', 'we', 'estimate', 'that', 'in', 'the', 'optimistic', 'scenario', 'a', 'kaon', 'selection', 'in', 'inclusive', 'hadronic', 'z', 'decays', 'with', 'both', 'the', 'average', 'efficiency', 'and', 'purity', 'approaching', '95', 'can', 'be', 'achieved']]
|
[-0.029737389231794073, 0.18472106322959697, -0.11521013409415953, 0.09425528178647515, -0.01765170542822376, -0.12200034109630832, 0.045916306593346605, 0.343136094853853, -0.21049880093629778, -0.33646432218230227, 0.028250753333159878, -0.3266686638069414, 0.07537231732450467, 0.19948151686320584, 0.021949018827591933, 0.11505249544747011, 0.14504738151177382, -0.0015176417487486518, -0.12522742303468995, -0.17954779716793204, 0.2226260339061179, 0.18512404308973873, 0.2609899370169716, 0.10400670578866436, 0.13798333906201496, 0.06597354375743682, -0.0760924334019205, -0.030889635030384156, -0.11645532926970695, 0.03690272227378331, 0.24512984242161096, 0.14281748678793546, 0.12593019432692032, -0.3440298560656689, -0.11355280877179365, 0.10728529110605264, 0.1733507102968878, 0.06826377936713669, -0.1011755312198134, -0.3161914505125669, 0.11487937836702165, -0.20798283570678056, -0.09644804193713043, -0.04747960372338493, -0.07115358124439516, 0.00471398460739938, -0.3169414851696394, 0.12522884079465052, -0.03401145098363831, 0.033268202007850155, -0.030650756303153007, -0.20840323094472316, 0.007084417350617421, 0.0511771521095975, 0.049106464555561814, 0.09171849959037083, 0.2045031766080889, -0.14027801443598348, -0.18711779770325787, 0.3612545913554402, -0.028170075655887652, -0.19199140044609017, 0.16018423579809984, -0.19801076482913463, -0.10312174217449162, 0.2123877789050232, 0.23331507979246385, 0.05932280146958728, -0.19548397727419425, 0.024454969716900754, 0.004990197995160944, 0.23257229004707866, 0.08199921024650553, 0.05491260252128199, 0.21143322523146268, 0.24151833224225872, 0.030587374660981832, 0.05546061619929289, -0.20760574367876253, -0.042007639999059536, -0.34287381762244407, -0.15857493420501995, -0.11601484849382818, 0.060438468131189145, -0.1071700451856931, -0.012370921684986484, 0.355733779823258, 0.15904272445919412, 0.20369912363779152, 0.017755262145813366, 0.3553057644910512, 0.08087232450862844, 0.028193440387938102, 0.04959163744965769, 0.30251450411275194, 0.10713102192835489, 0.16486749068636747, -0.28908653441734994, 0.04409272595730195, 0.05121094615021925]
|
1,803.05135
|
Measurements of the Canonical Helicity of a Gyrating Kink
|
Conversions between magnetic and kinetic energy occur over a range of plasma
scales in astrophysical and solar dynamos and reconnection in the solar corona
and the laboratory. Canonical flux tubes reconcile all plasma regimes with
concepts of twists, writhes, and linkages. We present measurements of canonical
flux tubes, their helicity, and their helicity transport in a gyrating plasma
kink. The helicity gauge is removed with general techniques valid even if only
a limited section of the plasma is measured. Temporal asymmetries in the
helicities confirm irreducible 3D fields in the kink.
|
physics.plasm-ph
|
conversions between magnetic and kinetic energy occur over a range of plasma scales in astrophysical and solar dynamos and reconnection in the solar corona and the laboratory canonical flux tubes reconcile all plasma regimes with concepts of twists writhes and linkages we present measurements of canonical flux tubes their helicity and their helicity transport in a gyrating plasma kink the helicity gauge is removed with general techniques valid even if only a limited section of the plasma is measured temporal asymmetries in the helicities confirm irreducible 3d fields in the kink
|
[['conversions', 'between', 'magnetic', 'and', 'kinetic', 'energy', 'occur', 'over', 'a', 'range', 'of', 'plasma', 'scales', 'in', 'astrophysical', 'and', 'solar', 'dynamos', 'and', 'reconnection', 'in', 'the', 'solar', 'corona', 'and', 'the', 'laboratory', 'canonical', 'flux', 'tubes', 'reconcile', 'all', 'plasma', 'regimes', 'with', 'concepts', 'of', 'twists', 'writhes', 'and', 'linkages', 'we', 'present', 'measurements', 'of', 'canonical', 'flux', 'tubes', 'their', 'helicity', 'and', 'their', 'helicity', 'transport', 'in', 'a', 'gyrating', 'plasma', 'kink', 'the', 'helicity', 'gauge', 'is', 'removed', 'with', 'general', 'techniques', 'valid', 'even', 'if', 'only', 'a', 'limited', 'section', 'of', 'the', 'plasma', 'is', 'measured', 'temporal', 'asymmetries', 'in', 'the', 'helicities', 'confirm', 'irreducible', '3d', 'fields', 'in', 'the', 'kink']]
|
[-0.1686879589918305, 0.3032990742863698, 0.0030106682135917985, 0.14875956274988641, -0.032933016635150046, -0.04245877469593024, -0.027048670566528217, 0.38355489152964656, -0.19857504452159117, -0.3357003376829428, -0.009126006197030809, -0.21624129153992777, -0.02548080469880785, 0.2143981908396869, 0.02039204342393102, 0.013411573441392119, 0.0831507346899873, -0.02975324578173868, -0.03979293212222938, -0.13863906298078352, 0.28251509828196203, 0.06762428811986695, 0.2557720637951906, 0.06815864165200965, 0.12665590734712287, -0.08924023604153522, -0.0526576635688748, 0.04020486434328032, -0.1170818226758626, 0.017432315356947562, 0.2022511026115863, 0.040655727491197224, 0.12484518225703921, -0.5299223678207005, -0.22442852183767073, 0.039142901180209695, 0.1646787979189757, 0.023779326947508277, -0.0012164799762623651, -0.18460414528969551, 0.01340566981797475, -0.14123393070710066, -0.09237045345566962, -0.026319496446176545, 0.03459618875889906, 0.028354442760266444, -0.3073180708624832, 0.1025423853438102, 0.043886159893360685, 0.11390734039717815, -0.09642755638316765, -0.06679674559196068, -0.09670884010719728, 0.08223580030192222, 0.13748336937994912, 0.04610500420228793, 0.20441805001266383, -0.18694707129539534, -0.10400496701617817, 0.35255060719510356, -0.01236846222501289, -0.1800357315198078, 0.17094696427767092, -0.27344595335403477, -0.11787811652399026, 0.19143704947207, 0.11886852994435824, 0.09624403474755217, -0.08784329331387858, 0.06604527194017115, -0.04691433398933201, 0.07964092270972636, 0.11146874953020405, 0.009483667661737815, 0.28526978814913023, 0.12892069463786965, 0.009128890240790097, 0.05600720255477047, -0.14458566883599366, -0.0388923707817282, -0.33458265200625736, -0.14346744122167865, -0.0723262967268046, 0.06475935687546383, -0.0732958605145181, -0.18547882158104534, 0.42102709434066826, 0.15311657758122618, 0.16594131170147722, -0.03783016402151559, 0.2962649328490862, 0.09553864059821385, 0.04777609890040297, 0.15198672303909455, 0.3031861326480694, 0.28279169006170807, 0.21997240667134155, -0.23476817331322888, -0.03742398395315631, 0.06687832139637116]
|
1,803.05136
|
A primer on the use of probability generating functions in infectious
disease modeling
|
We explore the application of probability generating functions (PGFs) to
invasive processes, focusing on infectious disease introduced into large
populations. Our goal is to acquaint the reader with applications of PGFs,
moreso than to derive new results. PGFs help predict a number of properties
about early outbreak behavior while the population is still effectively
infinite, including the probability of an epidemic, the size distribution after
some number of generations, and the cumulative size distribution of
non-epidemic outbreaks. We show how PGFs can be used in both discrete-time and
continuous-time settings, and discuss how to use these results to infer disease
parameters from observed outbreaks. In the large population limit for
susceptible-infected-recovered (SIR) epidemics PGFs lead to survival-function
based models that are equivalent the the usual mass-action SIR models but with
fewer ODEs. We use these to explore properties such as the final size of
epidemics or even the dynamics once stochastic effects are negligible. We
target this tutorial to biologists and public health researchers who want to
learn how to apply PGFs to invasive diseases, but it could also be used in an
introductory mathematics course on PGFs. We include many exercises to help
demonstrate concepts and to give practice applying the results. We summarize
our main results in a few tables. Additionally we provide a small python
package which performs many of the relevant calculations.
|
q-bio.PE physics.soc-ph q-bio.QM
|
we explore the application of probability generating functions pgfs to invasive processes focusing on infectious disease introduced into large populations our goal is to acquaint the reader with applications of pgfs moreso than to derive new results pgfs help predict a number of properties about early outbreak behavior while the population is still effectively infinite including the probability of an epidemic the size distribution after some number of generations and the cumulative size distribution of nonepidemic outbreaks we show how pgfs can be used in both discretetime and continuoustime settings and discuss how to use these results to infer disease parameters from observed outbreaks in the large population limit for susceptibleinfectedrecovered sir epidemics pgfs lead to survivalfunction based models that are equivalent the the usual massaction sir models but with fewer odes we use these to explore properties such as the final size of epidemics or even the dynamics once stochastic effects are negligible we target this tutorial to biologists and public health researchers who want to learn how to apply pgfs to invasive diseases but it could also be used in an introductory mathematics course on pgfs we include many exercises to help demonstrate concepts and to give practice applying the results we summarize our main results in a few tables additionally we provide a small python package which performs many of the relevant calculations
|
[['we', 'explore', 'the', 'application', 'of', 'probability', 'generating', 'functions', 'pgfs', 'to', 'invasive', 'processes', 'focusing', 'on', 'infectious', 'disease', 'introduced', 'into', 'large', 'populations', 'our', 'goal', 'is', 'to', 'acquaint', 'the', 'reader', 'with', 'applications', 'of', 'pgfs', 'moreso', 'than', 'to', 'derive', 'new', 'results', 'pgfs', 'help', 'predict', 'a', 'number', 'of', 'properties', 'about', 'early', 'outbreak', 'behavior', 'while', 'the', 'population', 'is', 'still', 'effectively', 'infinite', 'including', 'the', 'probability', 'of', 'an', 'epidemic', 'the', 'size', 'distribution', 'after', 'some', 'number', 'of', 'generations', 'and', 'the', 'cumulative', 'size', 'distribution', 'of', 'nonepidemic', 'outbreaks', 'we', 'show', 'how', 'pgfs', 'can', 'be', 'used', 'in', 'both', 'discretetime', 'and', 'continuoustime', 'settings', 'and', 'discuss', 'how', 'to', 'use', 'these', 'results', 'to', 'infer', 'disease', 'parameters', 'from', 'observed', 'outbreaks', 'in', 'the', 'large', 'population', 'limit', 'for', 'susceptibleinfectedrecovered', 'sir', 'epidemics', 'pgfs', 'lead', 'to', 'survivalfunction', 'based', 'models', 'that', 'are', 'equivalent', 'the', 'the', 'usual', 'massaction', 'sir', 'models', 'but', 'with', 'fewer', 'odes', 'we', 'use', 'these', 'to', 'explore', 'properties', 'such', 'as', 'the', 'final', 'size', 'of', 'epidemics', 'or', 'even', 'the', 'dynamics', 'once', 'stochastic', 'effects', 'are', 'negligible', 'we', 'target', 'this', 'tutorial', 'to', 'biologists', 'and', 'public', 'health', 'researchers', 'who', 'want', 'to', 'learn', 'how', 'to', 'apply', 'pgfs', 'to', 'invasive', 'diseases', 'but', 'it', 'could', 'also', 'be', 'used', 'in', 'an', 'introductory', 'mathematics', 'course', 'on', 'pgfs', 'we', 'include', 'many', 'exercises', 'to', 'help', 'demonstrate', 'concepts', 'and', 'to', 'give', 'practice', 'applying', 'the', 'results', 'we', 'summarize', 'our', 'main', 'results', 'in', 'a', 'few', 'tables', 'additionally', 'we', 'provide', 'a', 'small', 'python', 'package', 'which', 'performs', 'many', 'of', 'the', 'relevant', 'calculations']]
|
[-0.022948892660852937, 0.08276996319712554, -0.08957323901976148, 0.15048052884701368, -0.10711901386268437, -0.1541325162226955, 0.05119210163752238, 0.37457896273997093, -0.2313009608236866, -0.3149835938339432, 0.14293329741598831, -0.27614717336578504, -0.21091582952377697, 0.20562530084513128, -0.12819725314776104, 0.02505874812602997, 0.08421942355369942, 0.018993149710068893, 0.02956151157617569, -0.3233868945664209, 0.2763993163831118, 0.0498708402696583, 0.23373767252183622, 0.04093574180164271, 0.058730988707393406, 0.01809620662488871, -0.03329643001365993, -0.00538913105511003, -0.16367469524256498, 0.10100639801291335, 0.32472323920309365, 0.20357903085442053, 0.31752622178031337, -0.46498883263932334, -0.21811969787710242, 0.11992106626120706, 0.15014064998508225, 0.17915078911361182, 0.008858790694632464, -0.2781005878891382, 0.04573860268212027, -0.18372279851800866, -0.15816771019250153, -0.07619102457745208, -0.02735626044579678, 0.051895552348384326, -0.2525771219040164, 0.031235444972990082, -0.0005086951206127803, 0.0743567073011137, 0.000990960935337676, -0.14429062352567498, -0.01705146642194854, 0.19428262994831635, 0.07669892005208466, -0.04270359783536858, 0.15201489652662228, -0.14045860303358898, -0.1213840787154105, 0.3367618749870194, -0.03695390936123052, -0.18278003810180557, 0.21461054887415634, -0.12695167894578643, -0.14754558561162817, 0.09126957614802651, 0.2631916273716423, 0.08008947815021707, -0.16981475978882776, -0.005009976150726693, 0.008445053996725215, 0.171242195394718, 0.014399093312935696, -0.009464397876419955, 0.15018336840387847, 0.19059332060731118, 0.02420979522737778, 0.11320458075135119, -0.06009857652708888, -0.12434721664008166, -0.23158969628314177, -0.12772071035475366, -0.10416076314946016, 0.0675439263238675, -0.06809981236822851, -0.1646289760307021, 0.40496202688043315, 0.2576353374061485, 0.1716675327097376, 0.09281593681778759, 0.23745534237991606, 0.06030961988028139, 0.030014170286142165, 0.07553582378621083, 0.14077271163114347, 0.09346021955548268, 0.0950644683227357, -0.187627140501928, 0.14000091353431343, -0.004634728133678437]
|
1,803.05137
|
Adversarial Data Programming: Using GANs to Relax the Bottleneck of
Curated Labeled Data
|
Paucity of large curated hand-labeled training data for every
domain-of-interest forms a major bottleneck in the deployment of machine
learning models in computer vision and other fields. Recent work (Data
Programming) has shown how distant supervision signals in the form of labeling
functions can be used to obtain labels for given data in near-constant time. In
this work, we present Adversarial Data Programming (ADP), which presents an
adversarial methodology to generate data as well as a curated aggregated label
has given a set of weak labeling functions. We validated our method on the
MNIST, Fashion MNIST, CIFAR 10 and SVHN datasets, and it outperformed many
state-of-the-art models. We conducted extensive experiments to study its
usefulness, as well as showed how the proposed ADP framework can be used for
transfer learning as well as multi-task learning, where data from two domains
are generated simultaneously using the framework along with the label
information. Our future work will involve understanding the theoretical
implications of this new framework from a game-theoretic perspective, as well
as explore the performance of the method on more complex datasets.
|
cs.CV
|
paucity of large curated handlabeled training data for every domainofinterest forms a major bottleneck in the deployment of machine learning models in computer vision and other fields recent work data programming has shown how distant supervision signals in the form of labeling functions can be used to obtain labels for given data in nearconstant time in this work we present adversarial data programming adp which presents an adversarial methodology to generate data as well as a curated aggregated label has given a set of weak labeling functions we validated our method on the mnist fashion mnist cifar 10 and svhn datasets and it outperformed many stateoftheart models we conducted extensive experiments to study its usefulness as well as showed how the proposed adp framework can be used for transfer learning as well as multitask learning where data from two domains are generated simultaneously using the framework along with the label information our future work will involve understanding the theoretical implications of this new framework from a gametheoretic perspective as well as explore the performance of the method on more complex datasets
|
[['paucity', 'of', 'large', 'curated', 'handlabeled', 'training', 'data', 'for', 'every', 'domainofinterest', 'forms', 'a', 'major', 'bottleneck', 'in', 'the', 'deployment', 'of', 'machine', 'learning', 'models', 'in', 'computer', 'vision', 'and', 'other', 'fields', 'recent', 'work', 'data', 'programming', 'has', 'shown', 'how', 'distant', 'supervision', 'signals', 'in', 'the', 'form', 'of', 'labeling', 'functions', 'can', 'be', 'used', 'to', 'obtain', 'labels', 'for', 'given', 'data', 'in', 'nearconstant', 'time', 'in', 'this', 'work', 'we', 'present', 'adversarial', 'data', 'programming', 'adp', 'which', 'presents', 'an', 'adversarial', 'methodology', 'to', 'generate', 'data', 'as', 'well', 'as', 'a', 'curated', 'aggregated', 'label', 'has', 'given', 'a', 'set', 'of', 'weak', 'labeling', 'functions', 'we', 'validated', 'our', 'method', 'on', 'the', 'mnist', 'fashion', 'mnist', 'cifar', '10', 'and', 'svhn', 'datasets', 'and', 'it', 'outperformed', 'many', 'stateoftheart', 'models', 'we', 'conducted', 'extensive', 'experiments', 'to', 'study', 'its', 'usefulness', 'as', 'well', 'as', 'showed', 'how', 'the', 'proposed', 'adp', 'framework', 'can', 'be', 'used', 'for', 'transfer', 'learning', 'as', 'well', 'as', 'multitask', 'learning', 'where', 'data', 'from', 'two', 'domains', 'are', 'generated', 'simultaneously', 'using', 'the', 'framework', 'along', 'with', 'the', 'label', 'information', 'our', 'future', 'work', 'will', 'involve', 'understanding', 'the', 'theoretical', 'implications', 'of', 'this', 'new', 'framework', 'from', 'a', 'gametheoretic', 'perspective', 'as', 'well', 'as', 'explore', 'the', 'performance', 'of', 'the', 'method', 'on', 'more', 'complex', 'datasets']]
|
[-0.015065689011114753, -0.02679313373058297, -0.06146444140564806, 0.07211022909549582, -0.1051775505184196, -0.14186745853835925, 0.03825480706549974, 0.43074255511164666, -0.27146216315579497, -0.37438815388983737, 0.09972381529255978, -0.2891407036067297, -0.1939895607906187, 0.26022961905433073, -0.11221834588795901, 0.10148286013314242, 0.15082237768478485, 0.038435083292036626, -0.027865058628635274, -0.27511824830693915, 0.2971821472941277, 0.040629939740109776, 0.3267274306996519, 0.04973664899072092, 0.09493436532793567, -0.03543494085703666, -0.00923509563629826, 0.011069912960131963, -0.05218309388841994, 0.15951823447313573, 0.35047474169328374, 0.2619610169954184, 0.3391267306274838, -0.4171812798845672, -0.22888804912670618, 0.08936117933028274, 0.13712005647571965, 0.12456010372924438, -0.0994992562961771, -0.3577822458723353, 0.07104946272544718, -0.1783829520456493, 0.02035932045481685, -0.18301025056538897, -0.028567389965367816, 0.004579124807625906, -0.28970893788047963, 0.03599535358371213, 0.052477126050831026, 0.1012429409712139, -0.06234146593617172, -0.15013966924614378, 0.007393368971275373, 0.17051074053160847, 0.06380780822429288, 0.07920664750466434, 0.12482698734998444, -0.14646063641379847, -0.2105212348099384, 0.3776797477569845, -0.0881186456131723, -0.20056888271679377, 0.2131809867038909, -0.02899481987891098, -0.16432650323905465, 0.032774716729505195, 0.2788391950022843, 0.15456860518703858, -0.16245438190591005, 0.03621172054004597, -0.07264249832822113, 0.1465461630231908, 0.027416523304095285, -0.028942627099523735, 0.1500151872026941, 0.28417626494127846, 0.010358298610986418, 0.1676549599263429, -0.12425363263011807, -0.059314293398832284, -0.23938992030291248, -0.08954775978345424, -0.22740844091814424, -0.011164407877044546, -0.08521225298471917, -0.12421883288302019, 0.3719468584116031, 0.23360636489621053, 0.24342114925384523, 0.10768301765007587, 0.33819814119488, 0.004196956317254161, 0.13078104206102176, 0.09299937124467558, 0.1708775429494886, 0.01961610241430915, 0.12543530587831306, -0.127783502640927, 0.08091608633403666, -0.01436081725017478]
|
1,803.05138
|
Skyrmions in magnetic tunnel junctions
|
In this work, we demonstrate that skyrmions can be nucleated in the free
layer of a magnetic tunnel junction (MTJ) with Dzyaloshinskii-Moriya
interactions (DMI) by a spin-polarized current with the assistance of stray
fields from the pinned layer. The size, stability and number of created
skyrmions can be tuned by either the DMI strength or the stray field
distribution. The interaction between the stray field and the DMI effective
field is discussed. A device with multi-level tunneling magnetoresistance is
proposed, which could pave the ways for skyrmion-MTJ-based multi-bit storage
and artificial neural network computation. Our results may facilitate the
efficient nucleation and electrical detection of skyrmions.
|
cond-mat.mes-hall physics.atom-ph
|
in this work we demonstrate that skyrmions can be nucleated in the free layer of a magnetic tunnel junction mtj with dzyaloshinskiimoriya interactions dmi by a spinpolarized current with the assistance of stray fields from the pinned layer the size stability and number of created skyrmions can be tuned by either the dmi strength or the stray field distribution the interaction between the stray field and the dmi effective field is discussed a device with multilevel tunneling magnetoresistance is proposed which could pave the ways for skyrmionmtjbased multibit storage and artificial neural network computation our results may facilitate the efficient nucleation and electrical detection of skyrmions
|
[['in', 'this', 'work', 'we', 'demonstrate', 'that', 'skyrmions', 'can', 'be', 'nucleated', 'in', 'the', 'free', 'layer', 'of', 'a', 'magnetic', 'tunnel', 'junction', 'mtj', 'with', 'dzyaloshinskiimoriya', 'interactions', 'dmi', 'by', 'a', 'spinpolarized', 'current', 'with', 'the', 'assistance', 'of', 'stray', 'fields', 'from', 'the', 'pinned', 'layer', 'the', 'size', 'stability', 'and', 'number', 'of', 'created', 'skyrmions', 'can', 'be', 'tuned', 'by', 'either', 'the', 'dmi', 'strength', 'or', 'the', 'stray', 'field', 'distribution', 'the', 'interaction', 'between', 'the', 'stray', 'field', 'and', 'the', 'dmi', 'effective', 'field', 'is', 'discussed', 'a', 'device', 'with', 'multilevel', 'tunneling', 'magnetoresistance', 'is', 'proposed', 'which', 'could', 'pave', 'the', 'ways', 'for', 'skyrmionmtjbased', 'multibit', 'storage', 'and', 'artificial', 'neural', 'network', 'computation', 'our', 'results', 'may', 'facilitate', 'the', 'efficient', 'nucleation', 'and', 'electrical', 'detection', 'of', 'skyrmions']]
|
[-0.2179150524859627, 0.19524425448672403, -0.03199434501085696, -0.010929752823098429, -0.09746927462873005, -0.1280807783605442, 0.03655960028991103, 0.41805222105412254, -0.29510381925141527, -0.37488952048477675, 0.0030840136332526092, -0.23220981510045627, -0.12828237667369347, 0.20543666698171625, 0.018750246258596667, -0.007038254432734989, 0.01927581746907284, -0.02844860206047694, 0.028543051516282416, -0.24015555255381124, 0.27454350850367476, 0.001674785885205936, 0.3420866651637923, 0.11350529881726418, 0.021227665414058027, 0.00489662176530276, 0.13982575560831242, 0.06736279244290753, -0.0908806369332957, 0.11138967549029205, 0.22154760297798065, -0.07785118128217403, 0.19110228225056614, -0.5561033650168351, -0.21505916034359307, 0.029538845936102526, 0.1864854015321249, 0.1976563909257363, -0.11626052305634532, -0.3644186082273899, 0.09210548982733772, -0.15527218336328155, -0.09375552856339103, -0.10810303068054573, -0.0209413350748253, 0.04823982416086697, -0.3070626969138781, 0.021536815723881036, 0.061874511688282445, 0.07916076333217678, -0.06276329426272284, -0.08785085755211877, -0.06246641694922887, 0.07323517553685677, 0.04035762357747271, 0.08959922473988541, 0.2384433682209679, -0.1856010319321372, -0.15441640137384335, 0.25818136565032457, -0.05771059441779341, -0.16384096953663088, 0.12938603645279295, -0.08872747642121144, 0.04186425046285703, 0.10253225034102798, 0.1334154575664018, 0.10154258995538666, -0.15610931783559776, 0.07886904987639615, 0.05694092289500293, 0.17868381582998805, 0.04475178385951689, 0.020360619410695065, 0.3102769671274083, 0.22672361115969364, 0.06826095207195197, 0.18218751503154634, -0.16403157180788444, -0.03943146924831949, -0.22476650127431466, -0.17293495429635403, -0.24498489295975084, 0.06800809409025879, -0.1140405974855336, -0.14723142469745307, 0.4068982363368074, 0.2348578293641497, 0.12362739291441227, -0.049795182513827016, 0.32116841099091936, 0.08216239694794196, 0.1592354333649079, 0.04442162339886029, 0.2614054317597211, 0.17611014426109337, 0.16394176901805968, -0.28708990533570095, 0.0936665376914399, -0.02694618888421073]
|
1,803.05139
|
Nonlinear scalar field equations with $L^2$ constraint: Mountain pass
and symmetric mountain pass approaches
|
We study the existence of radially symmetric solutions of the following
nonlinear scalar field equations in ${\mathbb R}^N$ ($N\geq 2$):
$$ (*)_m \left\{
\eqalign{
-&\Delta u = g(u) -\mu u \quad \hbox{in}\ {\mathbb R}^N, \cr
&\| u\|_{L^2({\mathbb R}^N)} = m, \cr
&u \in H^1({\mathbb R}^N), \cr} \right.
$$ where $g(\xi)\in C({\mathbb R},{\mathbb R})$, $m>0$ is a given constant
and $\mu\in {\mathbb R}$ is a Lagrange multiplier.
We introduce a new approach using a Lagrange formulation of the problem
$(*)_m$. We develop a new deformation argument under a new version of the
Palais-Smale condition. For a general class of nonlinearities related to [BL1,
BL2, HIT], it enables us to apply minimax argument for $L^2$ constraint
problems and we show the existence of infinitely many solutions as well as
mountain pass characterization of a minimizing solution of the problem:
$$ \inf\left\{ \int_{{\mathbb R}^N} {1\over 2}|\nabla u|^2 - G(u)\, dx;\, \|
u\|_{L^2({\mathbb R}^N)}^2 = m \right\},
\quad G(\xi)=\int_0^\xi g(\tau)\, d\tau.
$$
|
math.AP
|
we study the existence of radially symmetric solutions of the following nonlinear scalar field equations in mathbb rn ngeq 2 _m left eqalign delta u gu mu u quad hboxin mathbb rn cr u_l2mathbb rn m cr u in h1mathbb rn cr right where gxiin cmathbb rmathbb r m0 is a given constant and muin mathbb r is a lagrange multiplier we introduce a new approach using a lagrange formulation of the problem _m we develop a new deformation argument under a new version of the palaissmale condition for a general class of nonlinearities related to bl1 bl2 hit it enables us to apply minimax argument for l2 constraint problems and we show the existence of infinitely many solutions as well as mountain pass characterization of a minimizing solution of the problem infleft int_mathbb rn 1over 2nabla u2 gu dx u_l2mathbb rn2 m right quad gxiint_0xi gtau dtau
|
[['we', 'study', 'the', 'existence', 'of', 'radially', 'symmetric', 'solutions', 'of', 'the', 'following', 'nonlinear', 'scalar', 'field', 'equations', 'in', 'mathbb', 'rn', 'ngeq', '2', '_m', 'left', 'eqalign', 'delta', 'u', 'gu', 'mu', 'u', 'quad', 'hboxin', 'mathbb', 'rn', 'cr', 'u_l2mathbb', 'rn', 'm', 'cr', 'u', 'in', 'h1mathbb', 'rn', 'cr', 'right', 'where', 'gxiin', 'cmathbb', 'rmathbb', 'r', 'm0', 'is', 'a', 'given', 'constant', 'and', 'muin', 'mathbb', 'r', 'is', 'a', 'lagrange', 'multiplier', 'we', 'introduce', 'a', 'new', 'approach', 'using', 'a', 'lagrange', 'formulation', 'of', 'the', 'problem', '_m', 'we', 'develop', 'a', 'new', 'deformation', 'argument', 'under', 'a', 'new', 'version', 'of', 'the', 'palaissmale', 'condition', 'for', 'a', 'general', 'class', 'of', 'nonlinearities', 'related', 'to', 'bl1', 'bl2', 'hit', 'it', 'enables', 'us', 'to', 'apply', 'minimax', 'argument', 'for', 'l2', 'constraint', 'problems', 'and', 'we', 'show', 'the', 'existence', 'of', 'infinitely', 'many', 'solutions', 'as', 'well', 'as', 'mountain', 'pass', 'characterization', 'of', 'a', 'minimizing', 'solution', 'of', 'the', 'problem', 'infleft', 'int_mathbb', 'rn', '1over', '2nabla', 'u2', 'gu', 'dx', 'u_l2mathbb', 'rn2', 'm', 'right', 'quad', 'gxiint_0xi', 'gtau', 'dtau']]
|
[-0.21232681429352274, 0.010613697253727725, 0.015870263363671054, 0.030007141889756794, -0.08998858711480365, -0.23329090808316336, -0.03337587796027896, 0.28258052771793796, -0.33591918097613577, -0.13819374540377852, 0.1189691769870949, -0.34949762695241016, -0.1015998140780151, 0.14578085306094035, -0.10726447510158552, 0.05060597451752169, -0.025443407755761923, 0.06001015316556172, -0.09812832301339278, -0.2059845809443769, 0.3226247531967563, -0.13627619148473014, 0.1191950049373432, 0.03839005597409551, 0.09576459731776397, -0.015221678644542458, 0.08336511614465422, -0.03985316001556136, -0.28827299944522394, 0.05178067415555405, 0.1806707340329267, 0.13904481195401844, 0.31812016799446796, -0.3652748086105485, -0.1585450383005794, 0.2020158712146478, 0.16124782267098242, -0.09729025886602491, -0.04247889920769559, -0.30009200801695146, 0.14459808644760477, -0.103329764379488, -0.19954724776740934, -0.021829517975032745, 0.10461881205560053, 0.0565238872435517, -0.4365666998237684, 0.09666107117714949, 0.13105386500271246, -0.021419370476721454, -0.1341071873626483, -0.14767492941818428, -0.028165729477076785, 0.006333402397071982, 0.00895956592386836, 0.20662013103475574, 0.027319387203876996, -0.027025686830959537, -0.008579723055839174, 0.36939495700326835, -0.11513373746790669, -0.2821316970577398, 0.06618223931246366, -0.17365519748023756, -0.16589397293925806, 0.05069784469042833, 0.11078525414540583, 0.2401648701617976, -0.09421817245534979, 0.32960794951971883, -0.09993024724307698, 0.12602490896824747, 0.1423838061729928, -0.02811440440029935, 0.057915337898253975, 0.08684931197460136, 0.18683556453251585, 0.06833011281214185, -0.0569732166188476, 0.016751260353395574, -0.38758051153142137, -0.1609979425263884, -0.12177823809418384, 0.20890765425189842, -0.10493847116778306, -0.1307331294234894, 0.3033717892766064, 0.039771240747572816, 0.1705111912614503, 0.09795567330129289, 0.1622471271230924, 0.09216373119262287, -0.050877676014072046, 0.10199360901789441, 0.07103268232626411, 0.17521658358397166, 0.10148833767621668, -0.19670814424720626, -0.09025898092862714, 0.20855500228325283]
|
1,803.0514
|
Radiative lifetime of localized excitons in transition metal
dichalcogenides
|
Disorder derived from defects or strain in monolayer TMDs can lead to a
dramatic change in the physical behavior of the interband excitations,
producing inhomogeneous spectral broadening and localization; leading to
radiative lifetime increase. In this study, we have modeled the disorder in the
surface of the sample through a randomized potential in monolayer WSe2. We show
that this model allows us to simulate the spectra of localized exciton states
as well as their radiative lifetime. In this context, we give an in depth study
of the influence of the disorder potential parameters on the optical properties
of these defects through energies, density of states, oscillator strengths,
photoluminescence (PL) spectroscopy and radiative lifetime at low temperature
(4K). We demonstrate that localized excitons have a longer emission time than
free excitons, in the range of tens of picoseconds or more, and we show that it
depends strongly on the disorder parameter and dielectric environment. Finally,
in order to prove the validity of our model we compare it to available
experimental results of the literature.
|
cond-mat.mes-hall
|
disorder derived from defects or strain in monolayer tmds can lead to a dramatic change in the physical behavior of the interband excitations producing inhomogeneous spectral broadening and localization leading to radiative lifetime increase in this study we have modeled the disorder in the surface of the sample through a randomized potential in monolayer wse2 we show that this model allows us to simulate the spectra of localized exciton states as well as their radiative lifetime in this context we give an in depth study of the influence of the disorder potential parameters on the optical properties of these defects through energies density of states oscillator strengths photoluminescence pl spectroscopy and radiative lifetime at low temperature 4k we demonstrate that localized excitons have a longer emission time than free excitons in the range of tens of picoseconds or more and we show that it depends strongly on the disorder parameter and dielectric environment finally in order to prove the validity of our model we compare it to available experimental results of the literature
|
[['disorder', 'derived', 'from', 'defects', 'or', 'strain', 'in', 'monolayer', 'tmds', 'can', 'lead', 'to', 'a', 'dramatic', 'change', 'in', 'the', 'physical', 'behavior', 'of', 'the', 'interband', 'excitations', 'producing', 'inhomogeneous', 'spectral', 'broadening', 'and', 'localization', 'leading', 'to', 'radiative', 'lifetime', 'increase', 'in', 'this', 'study', 'we', 'have', 'modeled', 'the', 'disorder', 'in', 'the', 'surface', 'of', 'the', 'sample', 'through', 'a', 'randomized', 'potential', 'in', 'monolayer', 'wse2', 'we', 'show', 'that', 'this', 'model', 'allows', 'us', 'to', 'simulate', 'the', 'spectra', 'of', 'localized', 'exciton', 'states', 'as', 'well', 'as', 'their', 'radiative', 'lifetime', 'in', 'this', 'context', 'we', 'give', 'an', 'in', 'depth', 'study', 'of', 'the', 'influence', 'of', 'the', 'disorder', 'potential', 'parameters', 'on', 'the', 'optical', 'properties', 'of', 'these', 'defects', 'through', 'energies', 'density', 'of', 'states', 'oscillator', 'strengths', 'photoluminescence', 'pl', 'spectroscopy', 'and', 'radiative', 'lifetime', 'at', 'low', 'temperature', '4k', 'we', 'demonstrate', 'that', 'localized', 'excitons', 'have', 'a', 'longer', 'emission', 'time', 'than', 'free', 'excitons', 'in', 'the', 'range', 'of', 'tens', 'of', 'picoseconds', 'or', 'more', 'and', 'we', 'show', 'that', 'it', 'depends', 'strongly', 'on', 'the', 'disorder', 'parameter', 'and', 'dielectric', 'environment', 'finally', 'in', 'order', 'to', 'prove', 'the', 'validity', 'of', 'our', 'model', 'we', 'compare', 'it', 'to', 'available', 'experimental', 'results', 'of', 'the', 'literature']]
|
[-0.08382914831452717, 0.15802053915078662, -0.04605524424420444, 0.03859879439858171, 0.01751023359096076, -0.09079240719589937, 0.08019772405073994, 0.4632600053466555, -0.24125305589320772, -0.29929076654115166, 0.014885879885486052, -0.29177208179804814, -0.12325701009444462, 0.1830722965283933, 0.02314727683820778, 0.011955388221415997, 0.01974463829033163, -0.035548238648973794, -0.049698702421717644, -0.2036391552949844, 0.2998204080258749, 0.052733079697183105, 0.28660216289060997, 0.15908813148446252, -0.0020910042359606725, 0.0021550966981217006, 0.04291329020095957, -0.0026617274172819417, -0.15966437684806606, 0.08032024958819646, 0.2138675278687925, -0.016174835439588378, 0.23874229855426302, -0.4488515773075387, -0.24840876598158754, 0.06845161511503547, 0.15816317584010303, 0.18043915377364553, -0.05394346922923033, -0.2760033155979879, 0.043870346350164686, -0.14609636036165036, -0.11935588714768948, -0.07738194418694243, 0.012920199404874376, 0.017491332501592922, -0.2239518446384827, 0.11457475004690791, 0.024365816690630652, 0.04237886166167742, -0.1214964669288642, -0.07598863928588888, -0.07195942830617373, 0.09417726644826245, 0.057714359499675606, -0.02098028610778079, 0.18400527549519963, -0.1408888640035633, -0.10849936062610047, 0.36898156944823834, -0.10862599133328478, -0.10467864248384802, 0.20049651702758292, -0.19623722895075477, -0.06292942045740998, 0.16969401272272186, 0.1935046793905765, 0.14765889824447465, -0.10248014935617997, 0.04641707586356697, 0.011591646737537502, 0.20348313535466747, 0.027333848689806598, 0.13723250411483162, 0.18335424791590843, 0.18427864268672453, 0.02477149540730725, 0.16664555450131568, -0.11774895399690449, -0.04722650457345853, -0.24110048965179506, -0.15527372918700036, -0.20134390030067004, 0.10830343625578233, -0.07057866205648396, -0.18487659636131257, 0.4498246658083342, 0.20900967450963193, 0.21867894515868902, 0.027574396939851302, 0.24174212180131863, 0.138173363076636, 0.0796264468149196, 0.006229442874012741, 0.28397692087230225, 0.1330397631999945, 0.08951518789601291, -0.28785658143851045, 0.03438253820513111, -0.023955532278316472]
|
1,803.05141
|
Arithmetic Functions of Balancing Numbers
|
Two inequalities involving the Euler totient function and the sum of the
$k$-th powers of the divisors of balancing numbers are explored.
|
math.NT
|
two inequalities involving the euler totient function and the sum of the kth powers of the divisors of balancing numbers are explored
|
[['two', 'inequalities', 'involving', 'the', 'euler', 'totient', 'function', 'and', 'the', 'sum', 'of', 'the', 'kth', 'powers', 'of', 'the', 'divisors', 'of', 'balancing', 'numbers', 'are', 'explored']]
|
[-0.32497150963172317, 0.10328278021717613, -0.039276844737204636, 0.11621694603342224, -0.05271982528607954, -0.11046497235921296, -0.02266870893072337, 0.19216877018863504, -0.34175332940437575, -0.29101192841136997, 0.07469046911732717, -0.333601573894901, -0.12118369330313396, 0.2155379509045319, 0.005968777335841547, 0.05882800865749067, -0.04271116664379158, 0.06677031034434383, -0.0647280509583652, -0.2978780754757198, 0.45152872474864125, -0.09508669350973585, 0.17873260503719476, 0.11289533981206742, 0.11545627360994165, -0.056419536217369816, -0.06492552296946418, -0.013263085010376844, -0.14575859705324878, 0.1505482897839763, 0.23078888586976312, 0.1448377501219511, 0.33287780333987693, -0.3983089054765349, -0.057680663398721, 0.23056999035179615, 0.12298975823531774, -0.1732503388246352, 0.07083706727082079, -0.14596847326240756, 0.05264755700376223, -0.13838462650098585, -0.14475260819943453, -0.050774972716515716, -0.01215664991600947, 0.24281285737048497, -0.32787610150196334, 0.04017168046398596, 0.017649820413101803, 0.10066975209205835, 0.004619721101004292, -0.30221178043972363, 0.014194072647528215, 0.09007683785801585, 0.12426462104882706, -0.07884795574302023, 0.0483091724189845, -0.19590635762803935, -0.13856228929944336, 0.3945413496006619, 0.0205079959705472, -0.31152065013619984, 0.026911938351325014, -0.16262400270153937, -0.0697919495022771, 0.09765612786974419, 0.08026870187710632, 0.24255779724229465, -0.021749876143241472, 0.0410862708945801, -0.11300932167267258, -0.017845048950138418, 0.21355698835528034, 0.03921548099341718, 0.10649984414604577, 0.01513483938337727, 0.03088051351633939, 0.19909936260559002, -0.05582331374964931, -0.11795033870095556, -0.36872234601866116, -0.24844935367053206, -0.2914475634355437, 0.12704492889514024, -0.17668181850339434, -0.14461216243216768, 0.37561169927093113, -0.033547498201104725, 0.16048624470237305, 0.21503734588623047, 0.324528652835976, 0.21204046718776226, 0.041808940512551504, -0.0094460052522746, 0.10729289102495056, 0.251730113173835, 0.042418814010240814, -0.2132671648975123, 0.039972708793357015, 0.2833277107301084]
|
1,803.05142
|
Anomalous change in the de Haas-van Alphen oscillations of CeCoIn$_5$ at
ultra-low temperatures
|
We have performed de Haas-van Alphen (dHvA) measurements of the heavy-fermion
superconductor CeCoIn$_5$ down to 2 mK above the upper critical field. We find
that the dHvA amplitudes show an anomalous suppression, concomitantly with a
shift of the dHvA frequency, below the transition temperature $T_{\rm n}=20$
mK. We suggest that the change is owing to magnetic breakdown caused by a
field-induced antiferromagnetic (AFM) state emerging below $T_{\rm n}$,
revealing the origin of the field-induced quantum critical point (QCP) in
CeCoIn$_5$. The field dependence of $T_{\rm n}$ is found to be very weak for
7--10 T, implying that an enhancement of AFM order by suppressing the critical
spin fluctuations near the AFM QCP competes with the field suppression effect
on the AFM phase. We suggest that the appearance of a field-induced AFM phase
is a generic feature of unconventional superconductors, which emerge near an
AFM QCP, including CeCoIn$_5$, CeRhIn$_5$, and high-$T_{\rm c}$ cuprates.
|
cond-mat.str-el cond-mat.supr-con
|
we have performed de haasvan alphen dhva measurements of the heavyfermion superconductor cecoin_5 down to 2 mk above the upper critical field we find that the dhva amplitudes show an anomalous suppression concomitantly with a shift of the dhva frequency below the transition temperature t_rm n20 mk we suggest that the change is owing to magnetic breakdown caused by a fieldinduced antiferromagnetic afm state emerging below t_rm n revealing the origin of the fieldinduced quantum critical point qcp in cecoin_5 the field dependence of t_rm n is found to be very weak for 710 t implying that an enhancement of afm order by suppressing the critical spin fluctuations near the afm qcp competes with the field suppression effect on the afm phase we suggest that the appearance of a fieldinduced afm phase is a generic feature of unconventional superconductors which emerge near an afm qcp including cecoin_5 cerhin_5 and hight_rm c cuprates
|
[['we', 'have', 'performed', 'de', 'haasvan', 'alphen', 'dhva', 'measurements', 'of', 'the', 'heavyfermion', 'superconductor', 'cecoin_5', 'down', 'to', '2', 'mk', 'above', 'the', 'upper', 'critical', 'field', 'we', 'find', 'that', 'the', 'dhva', 'amplitudes', 'show', 'an', 'anomalous', 'suppression', 'concomitantly', 'with', 'a', 'shift', 'of', 'the', 'dhva', 'frequency', 'below', 'the', 'transition', 'temperature', 't_rm', 'n20', 'mk', 'we', 'suggest', 'that', 'the', 'change', 'is', 'owing', 'to', 'magnetic', 'breakdown', 'caused', 'by', 'a', 'fieldinduced', 'antiferromagnetic', 'afm', 'state', 'emerging', 'below', 't_rm', 'n', 'revealing', 'the', 'origin', 'of', 'the', 'fieldinduced', 'quantum', 'critical', 'point', 'qcp', 'in', 'cecoin_5', 'the', 'field', 'dependence', 'of', 't_rm', 'n', 'is', 'found', 'to', 'be', 'very', 'weak', 'for', '710', 't', 'implying', 'that', 'an', 'enhancement', 'of', 'afm', 'order', 'by', 'suppressing', 'the', 'critical', 'spin', 'fluctuations', 'near', 'the', 'afm', 'qcp', 'competes', 'with', 'the', 'field', 'suppression', 'effect', 'on', 'the', 'afm', 'phase', 'we', 'suggest', 'that', 'the', 'appearance', 'of', 'a', 'fieldinduced', 'afm', 'phase', 'is', 'a', 'generic', 'feature', 'of', 'unconventional', 'superconductors', 'which', 'emerge', 'near', 'an', 'afm', 'qcp', 'including', 'cecoin_5', 'cerhin_5', 'and', 'hight_rm', 'c', 'cuprates']]
|
[-0.2717331148512465, 0.3225039613894057, -0.05893001022753639, 0.015107186500436479, -0.04754462394569265, -0.1555763602158741, 0.13571833611288303, 0.28340427353855613, -0.22293477654028193, -0.2721630559780782, -0.0355052167747329, -0.387418059877267, -0.12108923862749514, 0.20422005369082877, 0.07375949461895384, -0.026080423567787205, -0.11924194692753524, 0.03202286925730541, -0.16250447103811894, -0.17621393753047174, 0.3106698364702568, 0.031414846132209184, 0.3435178202956817, 0.0886615073173552, 0.009147924897996219, -0.051171713298045735, 0.2136988929449121, 0.018125131251412983, -0.1646630535475484, -0.09100647778617904, 0.3067384068609068, -0.12419900727390516, 0.14520075620691242, -0.3583275244209768, -0.21660503961979166, 0.026582182472039723, 0.16109044924470303, 0.147207570417729, -0.05874068516468948, -0.32380267436076937, 0.051540306845900455, -0.06392958015203476, -0.14189765480382208, -0.13928303557546123, -0.04842537286841482, -0.0873005123208522, -0.2517027883716908, 0.16610463752754426, 0.1223814823146983, 0.20627290104383925, -0.09866901755786354, -0.13567781421098565, -0.022328722132155428, -0.012084160465747118, 0.08394968789530378, 0.1954040336820885, 0.1768979395622553, -0.09855659751797487, -0.13592594890781728, 0.28205495812826004, -0.0929778170002943, 0.08913550900883581, 0.12377281185840011, -0.2631062809990621, -0.09132284005050008, 0.2116586404950603, 0.01665120560516554, 0.02990127031960966, -0.04902635797962399, 0.0749059386461771, 0.0565234773369555, 0.23706987973300306, 0.044667791962733884, 0.07169882250692401, 0.285819471145882, 0.2016369754840669, 0.042742381578519645, 0.0964256070215733, -0.19573381471625334, -0.051905295655351916, -0.2517593174216975, -0.1684300321932441, -0.2023503655616782, 0.06109159405490285, -0.10161206991506333, -0.20834201501412808, 0.3185474567519697, 0.23305699659977108, 0.23509631049972468, -0.11016672374420236, 0.20173102297734372, 0.11104338876458841, 0.06384185367297553, 0.054568846405967826, 0.25982995408335946, 0.19060263429970578, 0.17583281939579665, -0.4122695405079101, 0.06660858415201992, 0.030719064996351096]
|
1,803.05143
|
Network Coding for Real-time Wireless Communication for Automation
|
Real-time applications require latencies on the order of a millisecond with
very high reliabilities, paralleling the requirements for high-performance
industrial control. Current wireless technologies like WiFi, Bluetooth, LTE,
etc. are unable to meet these stringent latency and reliability requirements,
forcing the use of wired systems. This paper introduces a wireless
communication protocol based on network coding that in conjunction with
cooperative communication techniques builds the necessary diversity to achieve
the target reliability. The proposed protocol is analyzed using a communication
theoretic delay-limited-capacity framework and compared to proposed protocols
without network coding. The results show that for larger network sizes or
payloads employing network coding lowers the minimum SNR required to achieve
the target reliability. For a scenario inspired by an industrial printing
application with $30$ nodes in the control loop, aggregate throughput of $4.8$
Mb/s, $20$MHz of bandwidth and cycle time under $2$ ms, the protocol can
robustly achieve a system probability of error better than $10^{-9}$ with a
nominal SNR less than $2$ dB under ideal channel conditions.
|
cs.IT math.IT
|
realtime applications require latencies on the order of a millisecond with very high reliabilities paralleling the requirements for highperformance industrial control current wireless technologies like wifi bluetooth lte etc are unable to meet these stringent latency and reliability requirements forcing the use of wired systems this paper introduces a wireless communication protocol based on network coding that in conjunction with cooperative communication techniques builds the necessary diversity to achieve the target reliability the proposed protocol is analyzed using a communication theoretic delaylimitedcapacity framework and compared to proposed protocols without network coding the results show that for larger network sizes or payloads employing network coding lowers the minimum snr required to achieve the target reliability for a scenario inspired by an industrial printing application with 30 nodes in the control loop aggregate throughput of 48 mbs 20mhz of bandwidth and cycle time under 2 ms the protocol can robustly achieve a system probability of error better than 109 with a nominal snr less than 2 db under ideal channel conditions
|
[['realtime', 'applications', 'require', 'latencies', 'on', 'the', 'order', 'of', 'a', 'millisecond', 'with', 'very', 'high', 'reliabilities', 'paralleling', 'the', 'requirements', 'for', 'highperformance', 'industrial', 'control', 'current', 'wireless', 'technologies', 'like', 'wifi', 'bluetooth', 'lte', 'etc', 'are', 'unable', 'to', 'meet', 'these', 'stringent', 'latency', 'and', 'reliability', 'requirements', 'forcing', 'the', 'use', 'of', 'wired', 'systems', 'this', 'paper', 'introduces', 'a', 'wireless', 'communication', 'protocol', 'based', 'on', 'network', 'coding', 'that', 'in', 'conjunction', 'with', 'cooperative', 'communication', 'techniques', 'builds', 'the', 'necessary', 'diversity', 'to', 'achieve', 'the', 'target', 'reliability', 'the', 'proposed', 'protocol', 'is', 'analyzed', 'using', 'a', 'communication', 'theoretic', 'delaylimitedcapacity', 'framework', 'and', 'compared', 'to', 'proposed', 'protocols', 'without', 'network', 'coding', 'the', 'results', 'show', 'that', 'for', 'larger', 'network', 'sizes', 'or', 'payloads', 'employing', 'network', 'coding', 'lowers', 'the', 'minimum', 'snr', 'required', 'to', 'achieve', 'the', 'target', 'reliability', 'for', 'a', 'scenario', 'inspired', 'by', 'an', 'industrial', 'printing', 'application', 'with', '30', 'nodes', 'in', 'the', 'control', 'loop', 'aggregate', 'throughput', 'of', '48', 'mbs', '20mhz', 'of', 'bandwidth', 'and', 'cycle', 'time', 'under', '2', 'ms', 'the', 'protocol', 'can', 'robustly', 'achieve', 'a', 'system', 'probability', 'of', 'error', 'better', 'than', '109', 'with', 'a', 'nominal', 'snr', 'less', 'than', '2', 'db', 'under', 'ideal', 'channel', 'conditions']]
|
[-0.21819906707276546, 0.027864337747121767, 0.004390535992570221, 0.02431827648321078, -0.016966558499483482, -0.24706129866120005, 0.15844941281067718, 0.3938226333106979, -0.21460423603033027, -0.3443064950461987, 0.11807121276104313, -0.2009827090244341, -0.12447753840907742, 0.21417813450292064, -0.17049976850172416, 0.11537106180219867, 0.07792694086397421, 0.0431636709683863, -0.0430909905158582, -0.27717927811318077, 0.24017024757285116, 0.13573493675877607, 0.38185877554185155, 0.034365228165933376, 0.07309320764727004, -0.011300868090031491, -0.0005583737705213329, -0.043625514018848274, -0.08875261662346713, 0.13464881142066415, 0.29349784666417345, 0.18496848076271513, 0.2896824679282006, -0.4641537124656939, -0.26807018638300223, 0.06911903497252968, 0.12657341195569774, 0.03356194302683607, -0.011432007577414402, -0.26306743774053065, 0.18050255444610402, -0.26870538102507235, -0.05752806734692838, -0.011535142165874797, -0.0640098922220724, 0.06409795112129013, -0.32297549092964756, 0.0009979199523860146, -0.026075925118112492, 0.062244395911139214, -0.020190600242044422, -0.0720187433450649, 0.02917371837455513, 0.1549693803355608, -0.044421076766281785, 0.031459226839139036, 0.15608000291589028, -0.13248066281847146, -0.15047347188616791, 0.3889232916602244, -0.007401936238671797, -0.1584852327941917, 0.19393098638344478, -0.03084400828395571, -0.11797280893439338, 0.15785686229632812, 0.2053432903817988, 0.021083002190737585, -0.17825110465665125, -0.0025245370797208687, 0.05212892295925745, 0.24479399489826478, 0.0984000594637889, 0.13382451186910094, 0.11765750112231001, 0.25247961498375626, 0.1581540846025995, 0.1148378255602438, -0.12462673474510666, -0.08788524628505998, -0.1898673918116228, -0.10819375834294728, -0.17635982742164438, 0.024724676028459465, -0.1238799993926001, -0.0638042493360228, 0.33732047750427663, 0.20143455915274985, 0.09418008388907072, 0.14553428366309076, 0.41506001716923147, 0.042188981004680194, 0.1069382606690938, 0.14936489483530058, 0.19451850569125131, 0.0834729616056263, 0.18088277982315049, -0.16517091961924008, 0.09995251148384773, -0.01944988085112224]
|
1,803.05144
|
Valley-Dependent Magnetoresistance in Two-Dimensional Semiconductors
|
We show theoretically that two-dimensional direct-gap semiconductors with a
valley degree of freedom, including monolayer transition-metal dichalcogenides
and gapped bilayer graphene, have a longitudinal magnetoconductivity
contribution that is odd in valley and odd in the magnetic field applied
perpendicular to the system. Using a quantum kinetic theory we show how this
valley-dependent magnetoconductivity arises from the interplay between the
momentum-space Berry curvature of Bloch electrons, the presence of a magnetic
field, and disorder scattering. We discuss how the effect can be measured
experimentally and used as a detector of valley polarization.
|
cond-mat.mes-hall cond-mat.mtrl-sci
|
we show theoretically that twodimensional directgap semiconductors with a valley degree of freedom including monolayer transitionmetal dichalcogenides and gapped bilayer graphene have a longitudinal magnetoconductivity contribution that is odd in valley and odd in the magnetic field applied perpendicular to the system using a quantum kinetic theory we show how this valleydependent magnetoconductivity arises from the interplay between the momentumspace berry curvature of bloch electrons the presence of a magnetic field and disorder scattering we discuss how the effect can be measured experimentally and used as a detector of valley polarization
|
[['we', 'show', 'theoretically', 'that', 'twodimensional', 'directgap', 'semiconductors', 'with', 'a', 'valley', 'degree', 'of', 'freedom', 'including', 'monolayer', 'transitionmetal', 'dichalcogenides', 'and', 'gapped', 'bilayer', 'graphene', 'have', 'a', 'longitudinal', 'magnetoconductivity', 'contribution', 'that', 'is', 'odd', 'in', 'valley', 'and', 'odd', 'in', 'the', 'magnetic', 'field', 'applied', 'perpendicular', 'to', 'the', 'system', 'using', 'a', 'quantum', 'kinetic', 'theory', 'we', 'show', 'how', 'this', 'valleydependent', 'magnetoconductivity', 'arises', 'from', 'the', 'interplay', 'between', 'the', 'momentumspace', 'berry', 'curvature', 'of', 'bloch', 'electrons', 'the', 'presence', 'of', 'a', 'magnetic', 'field', 'and', 'disorder', 'scattering', 'we', 'discuss', 'how', 'the', 'effect', 'can', 'be', 'measured', 'experimentally', 'and', 'used', 'as', 'a', 'detector', 'of', 'valley', 'polarization']]
|
[-0.21306964728960787, 0.23518573092603748, -0.058644649653265685, 0.05975278751453855, -0.03404819030266071, -0.1482860773423134, 0.025976156768552795, 0.4033776053565217, -0.274363596360762, -0.2748546779442292, -0.08462041426849153, -0.29948604398581025, -0.2588798469239539, 0.16837758646643425, 0.05867762696816699, -0.025237584594064034, -0.04625925184278698, -0.11354305675243037, -0.06523578527516552, -0.1936330602716675, 0.2835267615340814, -0.029912615738614656, 0.3112169388927274, 0.15113980944299107, 0.05502853121935994, 0.04116310101708622, 0.1587878453371289, 0.08130476585906612, -0.1196473650437598, 0.04683406949862019, 0.2328933225612023, -0.14382104246089092, 0.1830686790930046, -0.4642008256249048, -0.18351652762842374, 0.028826406210210626, 0.1473794191932449, 0.20193648357763067, -0.10520992897819359, -0.2717927905454577, 0.017213420962894355, -0.14010428174051512, -0.12305287289136387, -0.10111974418715952, -0.01777766909767556, -0.046005196449766445, -0.22506859334144783, 0.10511274617370013, 0.030498314357188704, 0.11149448759157907, -0.06402477959764528, -0.11706588627478866, -0.13353637677545732, 0.056310418381734374, 0.08548683663676647, 0.05752929177769756, 0.16331165862668837, -0.13764753018679854, -0.17512211801259073, 0.3868666624805153, -0.1072013633975575, -0.1711336264775677, 0.09429552237718151, -0.23118536196556966, -0.041485178123156614, 0.12627633355025733, 0.15861238146221246, 0.10254952118087274, -0.07688738799213872, 0.13646592329522328, -0.032340897349538385, 0.11438112890675337, 0.024930130350045286, 0.14106770358201895, 0.28294941671397333, 0.12885040581958102, 0.0432969975249412, 0.17484197648661723, -0.17808695806824898, -0.0011180451671992029, -0.22626128198149112, -0.2114018126605795, -0.27472936531917735, 0.16788187639398888, -0.05078083956243143, -0.18204590650582378, 0.48896869992489345, 0.16894504017489873, 0.13310829514207748, -0.07712067961488124, 0.2672047777162803, 0.12551019736629615, 0.07133639812121516, 0.022065402751860138, 0.29488121265044004, 0.23554180685307954, 0.11709196901378724, -0.3190551301244401, -0.008703692611511592, -0.017934120290881986]
|
1,803.05145
|
Rydberg-interaction gates via adiabatic passage and phase control of
driving fields
|
In this paperwe propose two theoretical schemes for implementation of quantum
phase gates by engineering the phase-sensitive dark state of two atoms
subjected to Rydberg-Rydberg interaction. Combining the conventional adiabatic
techniques and currently developed approaches of phase control, a feasible
proposal for implementation of a geometric phase gate is presented, where the
conditional phase shift (Berry phase) is achieved by adiabatically and
cyclically changing the parameters of the driving fields. Here we find that the
geometric phase acquired is related to the way how the relative phase is
modulated. In the second scheme, the system Hamiltonian is adiabatically
changed in a noncyclic manner, so that the acquired conditional phase is not a
Berry phase. A detailed analysis of the experimental feasibility and the effect
of decoherence is also given. The proposed schemes provide new perspectives for
adiabatic manipulation of interacting Rydberg systems with tailored phase
modulation.
|
quant-ph
|
in this paperwe propose two theoretical schemes for implementation of quantum phase gates by engineering the phasesensitive dark state of two atoms subjected to rydbergrydberg interaction combining the conventional adiabatic techniques and currently developed approaches of phase control a feasible proposal for implementation of a geometric phase gate is presented where the conditional phase shift berry phase is achieved by adiabatically and cyclically changing the parameters of the driving fields here we find that the geometric phase acquired is related to the way how the relative phase is modulated in the second scheme the system hamiltonian is adiabatically changed in a noncyclic manner so that the acquired conditional phase is not a berry phase a detailed analysis of the experimental feasibility and the effect of decoherence is also given the proposed schemes provide new perspectives for adiabatic manipulation of interacting rydberg systems with tailored phase modulation
|
[['in', 'this', 'paperwe', 'propose', 'two', 'theoretical', 'schemes', 'for', 'implementation', 'of', 'quantum', 'phase', 'gates', 'by', 'engineering', 'the', 'phasesensitive', 'dark', 'state', 'of', 'two', 'atoms', 'subjected', 'to', 'rydbergrydberg', 'interaction', 'combining', 'the', 'conventional', 'adiabatic', 'techniques', 'and', 'currently', 'developed', 'approaches', 'of', 'phase', 'control', 'a', 'feasible', 'proposal', 'for', 'implementation', 'of', 'a', 'geometric', 'phase', 'gate', 'is', 'presented', 'where', 'the', 'conditional', 'phase', 'shift', 'berry', 'phase', 'is', 'achieved', 'by', 'adiabatically', 'and', 'cyclically', 'changing', 'the', 'parameters', 'of', 'the', 'driving', 'fields', 'here', 'we', 'find', 'that', 'the', 'geometric', 'phase', 'acquired', 'is', 'related', 'to', 'the', 'way', 'how', 'the', 'relative', 'phase', 'is', 'modulated', 'in', 'the', 'second', 'scheme', 'the', 'system', 'hamiltonian', 'is', 'adiabatically', 'changed', 'in', 'a', 'noncyclic', 'manner', 'so', 'that', 'the', 'acquired', 'conditional', 'phase', 'is', 'not', 'a', 'berry', 'phase', 'a', 'detailed', 'analysis', 'of', 'the', 'experimental', 'feasibility', 'and', 'the', 'effect', 'of', 'decoherence', 'is', 'also', 'given', 'the', 'proposed', 'schemes', 'provide', 'new', 'perspectives', 'for', 'adiabatic', 'manipulation', 'of', 'interacting', 'rydberg', 'systems', 'with', 'tailored', 'phase', 'modulation']]
|
[-0.1933991205687188, 0.21257750825435784, -0.11717019685263401, -0.015932821361698872, -0.03385642837862204, -0.17397999141224954, 0.10377163322457457, 0.39543619570130967, -0.26606068391454957, -0.28120610711152016, 0.06325840218110673, -0.18987815281414516, -0.1721558070148354, 0.20887840617996678, -0.04870258073628663, 0.07140690578651704, 0.03315311396647602, -0.019913887206189116, -0.1134125769476419, -0.2284919471345995, 0.3070434685126712, 0.01613069304874269, 0.31132225121677637, 0.01978966649398463, 0.09561252533394383, -0.006364812358435601, 0.02206224489742603, -0.01944413756926174, -0.11140659981303966, 0.07197921987693144, 0.22620621994687945, 0.06934779437182292, 0.22338001183967732, -0.43473054482665374, -0.21971377517951474, 0.09252908805541515, 0.12545273135964796, 0.16613394054520417, -0.09332525110660018, -0.3320638452886208, -0.016923255242458354, -0.1798644961744598, -0.09279633395864999, -0.1233642426421483, 0.00316465548431016, -0.010119661181680348, -0.25454280671523244, 0.04312026874327311, 0.055501199885016735, 0.05021799076986436, -0.023064576143603008, -0.038936873715313486, 0.017828320411403906, 0.08893152872022331, -0.043738870057022226, 0.04731578935154599, 0.1493305161321051, -0.09758321968966151, -0.15345959332835388, 0.3856682767868297, -0.0546551827430623, -0.15014941022055198, 0.12351236595255514, -0.08347636112011969, -0.07691897958523454, 0.13608579991436373, 0.09916654040985932, 0.10572106834207598, -0.13185521291747485, 0.06637963662059557, 0.06747422870631291, 0.19217686072368276, -0.006306828733227432, 0.05465317353261762, 0.19630917731021874, 0.16876675318671416, 0.07090840429388152, 0.1824639427494768, -0.08395172956667535, -0.15273683574943714, -0.2863131339521441, -0.14777182172090836, -0.22599448672534056, -0.021232670132283676, -0.04007988950391723, -0.1323976948066321, 0.45031462839655784, 0.1742066581070117, 0.15437803095228944, -0.055458728507901095, 0.372042761646747, 0.1312609409390349, 0.006198860090927617, 0.017424459801986814, 0.27925322729574314, 0.15398418557932217, 0.09770715035089891, -0.27329809601799016, 0.05445616592952905, 0.050524700557404795]
|
1,803.05146
|
Bond-Derived Orbitalwise Coordination Number as an Accurate Reactivity
Descriptor for Oxygen Electrochemistry in Transition-Metal Oxides
|
Unraveling a descriptor that is correlated with catalytic reactivity is
essential for fast screening for the optimal catalysts for a given catalytic
reaction. Herein, we propose bond-derived orbitalwise coordination number
($\overline{CN}^\alpha$, $\alpha$= $s$ or $d$) as a simple and accurate
descriptor used for transition metal (TM) oxides that takes into account both
geometrical and electronic structures around active sites, and avoids excessive
computation burden. This descriptor has a strong scaling relation with the
activity in oxygen electrochemistry, enabling us to readily screen for the
optimal catalyst for $\beta$-MnO$_2$. $\beta$-MnO$_2$ with
$\overline{CN}^\alpha$=5.6 by creating an oxygen vacancy on (110) surface
exhibits the best oxygen electrochemical activity, which is well consistent
with experimetal result. This descriptor can be universally applied to other TM
oxides, e.g. RuO$_2$, opening up a new route as a guideline to design novel
catalysts in catalytic reactions.
|
cond-mat.mtrl-sci
|
unraveling a descriptor that is correlated with catalytic reactivity is essential for fast screening for the optimal catalysts for a given catalytic reaction herein we propose bondderived orbitalwise coordination number overlinecnalpha alpha s or d as a simple and accurate descriptor used for transition metal tm oxides that takes into account both geometrical and electronic structures around active sites and avoids excessive computation burden this descriptor has a strong scaling relation with the activity in oxygen electrochemistry enabling us to readily screen for the optimal catalyst for betamno_2 betamno_2 with overlinecnalpha56 by creating an oxygen vacancy on 110 surface exhibits the best oxygen electrochemical activity which is well consistent with experimetal result this descriptor can be universally applied to other tm oxides eg ruo_2 opening up a new route as a guideline to design novel catalysts in catalytic reactions
|
[['unraveling', 'a', 'descriptor', 'that', 'is', 'correlated', 'with', 'catalytic', 'reactivity', 'is', 'essential', 'for', 'fast', 'screening', 'for', 'the', 'optimal', 'catalysts', 'for', 'a', 'given', 'catalytic', 'reaction', 'herein', 'we', 'propose', 'bondderived', 'orbitalwise', 'coordination', 'number', 'overlinecnalpha', 'alpha', 's', 'or', 'd', 'as', 'a', 'simple', 'and', 'accurate', 'descriptor', 'used', 'for', 'transition', 'metal', 'tm', 'oxides', 'that', 'takes', 'into', 'account', 'both', 'geometrical', 'and', 'electronic', 'structures', 'around', 'active', 'sites', 'and', 'avoids', 'excessive', 'computation', 'burden', 'this', 'descriptor', 'has', 'a', 'strong', 'scaling', 'relation', 'with', 'the', 'activity', 'in', 'oxygen', 'electrochemistry', 'enabling', 'us', 'to', 'readily', 'screen', 'for', 'the', 'optimal', 'catalyst', 'for', 'betamno_2', 'betamno_2', 'with', 'overlinecnalpha56', 'by', 'creating', 'an', 'oxygen', 'vacancy', 'on', '110', 'surface', 'exhibits', 'the', 'best', 'oxygen', 'electrochemical', 'activity', 'which', 'is', 'well', 'consistent', 'with', 'experimetal', 'result', 'this', 'descriptor', 'can', 'be', 'universally', 'applied', 'to', 'other', 'tm', 'oxides', 'eg', 'ruo_2', 'opening', 'up', 'a', 'new', 'route', 'as', 'a', 'guideline', 'to', 'design', 'novel', 'catalysts', 'in', 'catalytic', 'reactions']]
|
[-0.06867454572132341, 0.12848261910484224, -0.022417710641295545, 0.013183888805926674, -0.0396189247292501, -0.215270696338956, 0.1460993352846277, 0.43443892473975815, -0.24671857456366222, -0.3066562721574748, 0.014009376516979602, -0.2706842401099426, -0.17390261805202398, 0.16860641602737209, -0.03929084767393457, 0.027812428305063534, -0.013913437075637004, -0.04315562796675497, -0.04185717609469537, -0.14686791491694748, 0.20685645651775067, 0.10687719500037256, 0.301519370989667, 0.10748969101588483, 0.05526301771730047, -0.021267145316771888, 0.06269297915062419, 0.01144745735520566, -0.1002533523302258, 0.15294773390040198, 0.3095298065346907, 0.04118969065516635, 0.21830700568302913, -0.44679281858520375, -0.2403270953321933, 0.035857930608714624, 0.1447503645614402, 0.14609096215744674, -0.16169501071951042, -0.22722693696894028, 0.06615747741113107, -0.12408281534358308, -0.10631917230095024, -0.1227030388088207, 0.05934338030508823, 0.012883666440568589, -0.3121753792209482, 0.03996939668431878, 0.04312556185328436, 0.0788452896591345, -0.11347634852691381, -0.12033292474225163, -0.0739171533483184, 0.11484588433350264, -0.008201076678448806, 0.0682344570508037, 0.2235072041844466, -0.05485891994537303, -0.08062007652630132, 0.43122961471478144, -0.029111804361282675, -0.14882368750663266, 0.22012012586411503, -0.09351284365359418, -0.13184793438348505, 0.17600293613418386, 0.16659639672617668, 0.12137893361591355, -0.1943511433209534, 0.02795731793028406, 0.0335554496333417, 0.16398214380498286, 0.04273998282711815, 0.03141451449116209, 0.2098488906605376, 0.27419446432549094, 0.10844822149654781, 0.11938303764176521, -0.07339290691436165, -0.025538651534804592, -0.18727892513421399, -0.2539156180434576, -0.14237914268850108, 0.06472812580910546, -0.11869806260338346, -0.18549825953043722, 0.3380660009432446, 0.0791151719202322, 0.18929602401072365, -0.03768772721480302, 0.22858612749001217, 0.05300057827564025, 0.10608176197856664, 0.025061044428299217, 0.18835190138607114, 0.10167318624099371, 0.09361122811420096, -0.24175372286182312, 0.20899491250445998, 0.07483094052101175]
|
1,803.05147
|
Twofold mechanical squeezing in a cavity optomechanical system
|
We investigate the dynamics of an optomechanical system where a cavity with a
movable mirror involves a degenerate optical parametric amplifier and is driven
by a periodically modulated laser field. Our results show that the cooperation
between the parametric driving and periodically modulated cavity driving
results in a two-fold squeezing on the movable cavity mirror that acts as a
mechanical oscillator. This allows the fluctuation of the mechanical oscillator
in one quadrature (momentum or position) to be reduced to a level that cannot
be reached by solely applying either of these two drivings. In addition to the
fundamental interests, e.g., study of quantum effects at the macroscopic level
and exploration of the quantum-to-classical transition, our results have
potential applications in ultrasensitive sensing of force and motion.
|
quant-ph
|
we investigate the dynamics of an optomechanical system where a cavity with a movable mirror involves a degenerate optical parametric amplifier and is driven by a periodically modulated laser field our results show that the cooperation between the parametric driving and periodically modulated cavity driving results in a twofold squeezing on the movable cavity mirror that acts as a mechanical oscillator this allows the fluctuation of the mechanical oscillator in one quadrature momentum or position to be reduced to a level that cannot be reached by solely applying either of these two drivings in addition to the fundamental interests eg study of quantum effects at the macroscopic level and exploration of the quantumtoclassical transition our results have potential applications in ultrasensitive sensing of force and motion
|
[['we', 'investigate', 'the', 'dynamics', 'of', 'an', 'optomechanical', 'system', 'where', 'a', 'cavity', 'with', 'a', 'movable', 'mirror', 'involves', 'a', 'degenerate', 'optical', 'parametric', 'amplifier', 'and', 'is', 'driven', 'by', 'a', 'periodically', 'modulated', 'laser', 'field', 'our', 'results', 'show', 'that', 'the', 'cooperation', 'between', 'the', 'parametric', 'driving', 'and', 'periodically', 'modulated', 'cavity', 'driving', 'results', 'in', 'a', 'twofold', 'squeezing', 'on', 'the', 'movable', 'cavity', 'mirror', 'that', 'acts', 'as', 'a', 'mechanical', 'oscillator', 'this', 'allows', 'the', 'fluctuation', 'of', 'the', 'mechanical', 'oscillator', 'in', 'one', 'quadrature', 'momentum', 'or', 'position', 'to', 'be', 'reduced', 'to', 'a', 'level', 'that', 'can', 'not', 'be', 'reached', 'by', 'solely', 'applying', 'either', 'of', 'these', 'two', 'drivings', 'in', 'addition', 'to', 'the', 'fundamental', 'interests', 'eg', 'study', 'of', 'quantum', 'effects', 'at', 'the', 'macroscopic', 'level', 'and', 'exploration', 'of', 'the', 'quantumtoclassical', 'transition', 'our', 'results', 'have', 'potential', 'applications', 'in', 'ultrasensitive', 'sensing', 'of', 'force', 'and', 'motion']]
|
[-0.16760697050797424, 0.19486339067993044, -0.07947679718967351, -0.048614697237535726, -0.029346811420130212, -0.17704647222504488, 0.0626637830158813, 0.39002008668667687, -0.2846944543320363, -0.26006494631338134, 0.07913644570402625, -0.23641468300202248, -0.16480299162194426, 0.2663851114692108, -0.06209946816831123, 0.03288790395146045, 0.03309010023821336, 0.01848019341072874, -0.0016622270996440348, -0.1464854489533436, 0.31403692303900055, 0.029553934773173564, 0.2843783885812548, 0.012757610298663848, 0.13752199760014852, -0.0012688229729487437, 0.0878192849574596, -0.018711722169922094, -0.08396485258588397, 0.12010126062265532, 0.2017561326126062, 0.006239887587286121, 0.31311949503820713, -0.4394357676258472, -0.20595523648653327, 0.09327185148644576, 0.12245578073388182, 0.16916309284618286, -0.062246407489438986, -0.30695452526446404, -0.015196508874632711, -0.1510283163873347, -0.1529469590296778, -0.07883131581607943, -0.042667447595754415, 0.06698280261044838, -0.2519199219898973, 0.020266995094276555, 0.08150812205821863, 0.07572155739877402, -0.03837242618058331, 0.007171657124321585, -0.026942603205748664, 0.11384910420426644, -0.024874323892854447, 0.019885719768926648, 0.21062360291449925, -0.1680856954258698, -0.12201569431762058, 0.3916439978821995, -0.10835102451855214, -0.19872800624511372, 0.15985831528476727, -0.15277027232044443, -0.04745717829929327, 0.10809269244599296, 0.15956488123720908, 0.04944173066774163, -0.1313545960514975, 0.009937691379441168, 0.03550286173057838, 0.21902101786117853, 0.09791851251965433, 0.04963402568516651, 0.23838107166518493, 0.171761280072369, 0.06072548825447777, 0.18305706305981168, -0.076917240108312, -0.11091807140147417, -0.3008783011015241, -0.12156485909537419, -0.19899407211016482, 0.0637303516434874, -0.04758643370999874, -0.13081205330099763, 0.402991769454024, 0.14096116530525638, 0.1572935134099107, -0.0543172902640278, 0.32721236213587046, 0.1678663042390455, 0.05417032464312052, -0.016725851456620033, 0.3395833190875201, 0.13925635339105574, 0.08125705394791219, -0.3078804968628944, -0.034997349663630245, -0.0016169194892914158]
|
1,803.05148
|
How Problematic is the Near-Euclidean Spatial Geometry of the
Large-Scale Universe?
|
Modern observations based on general relativity indicate that the spatial
geometry of the expanding, large-scale Universe is very nearly Euclidean. This
basic empirical fact is at the core of the so-called "flatness problem", which
is widely perceived to be a major outstanding problem of modern cosmology and
as such forms one of the prime motivations behind inflationary models. An
inspection of the literature and some further critical reflection however
quickly reveals that the typical formulation of this putative problem is
fraught with questionable arguments and misconceptions and that it is moreover
imperative to distinguish between different varieties of problem. It is shown
that the observational fact that the large-scale Universe is so nearly flat is
ultimately no more puzzling than similar "anthropic coincidences", such as the
specific (orders of magnitude of the) values of the gravitational and
electromagnetic coupling constants. In particular, there is no fine-tuning
problem in connection to flatness of the kind usually argued for. The arguments
regarding flatness and particle horizons typically found in cosmological
discourses in fact address a mere $single$ issue underlying the standard FLRW
cosmologies, namely the $extreme$ improbability of these models with respect to
any "reasonable measure" on the "space of all spacetimes". This issue may be
expressed in different ways and a phase space formulation, due to Penrose, is
presented here. A horizon problem only arises when additional assumptions -
which are usually kept implicit and at any rate seem rather speculative - are
made.
|
gr-qc hep-th
|
modern observations based on general relativity indicate that the spatial geometry of the expanding largescale universe is very nearly euclidean this basic empirical fact is at the core of the socalled flatness problem which is widely perceived to be a major outstanding problem of modern cosmology and as such forms one of the prime motivations behind inflationary models an inspection of the literature and some further critical reflection however quickly reveals that the typical formulation of this putative problem is fraught with questionable arguments and misconceptions and that it is moreover imperative to distinguish between different varieties of problem it is shown that the observational fact that the largescale universe is so nearly flat is ultimately no more puzzling than similar anthropic coincidences such as the specific orders of magnitude of the values of the gravitational and electromagnetic coupling constants in particular there is no finetuning problem in connection to flatness of the kind usually argued for the arguments regarding flatness and particle horizons typically found in cosmological discourses in fact address a mere single issue underlying the standard flrw cosmologies namely the extreme improbability of these models with respect to any reasonable measure on the space of all spacetimes this issue may be expressed in different ways and a phase space formulation due to penrose is presented here a horizon problem only arises when additional assumptions which are usually kept implicit and at any rate seem rather speculative are made
|
[['modern', 'observations', 'based', 'on', 'general', 'relativity', 'indicate', 'that', 'the', 'spatial', 'geometry', 'of', 'the', 'expanding', 'largescale', 'universe', 'is', 'very', 'nearly', 'euclidean', 'this', 'basic', 'empirical', 'fact', 'is', 'at', 'the', 'core', 'of', 'the', 'socalled', 'flatness', 'problem', 'which', 'is', 'widely', 'perceived', 'to', 'be', 'a', 'major', 'outstanding', 'problem', 'of', 'modern', 'cosmology', 'and', 'as', 'such', 'forms', 'one', 'of', 'the', 'prime', 'motivations', 'behind', 'inflationary', 'models', 'an', 'inspection', 'of', 'the', 'literature', 'and', 'some', 'further', 'critical', 'reflection', 'however', 'quickly', 'reveals', 'that', 'the', 'typical', 'formulation', 'of', 'this', 'putative', 'problem', 'is', 'fraught', 'with', 'questionable', 'arguments', 'and', 'misconceptions', 'and', 'that', 'it', 'is', 'moreover', 'imperative', 'to', 'distinguish', 'between', 'different', 'varieties', 'of', 'problem', 'it', 'is', 'shown', 'that', 'the', 'observational', 'fact', 'that', 'the', 'largescale', 'universe', 'is', 'so', 'nearly', 'flat', 'is', 'ultimately', 'no', 'more', 'puzzling', 'than', 'similar', 'anthropic', 'coincidences', 'such', 'as', 'the', 'specific', 'orders', 'of', 'magnitude', 'of', 'the', 'values', 'of', 'the', 'gravitational', 'and', 'electromagnetic', 'coupling', 'constants', 'in', 'particular', 'there', 'is', 'no', 'finetuning', 'problem', 'in', 'connection', 'to', 'flatness', 'of', 'the', 'kind', 'usually', 'argued', 'for', 'the', 'arguments', 'regarding', 'flatness', 'and', 'particle', 'horizons', 'typically', 'found', 'in', 'cosmological', 'discourses', 'in', 'fact', 'address', 'a', 'mere', 'single', 'issue', 'underlying', 'the', 'standard', 'flrw', 'cosmologies', 'namely', 'the', 'extreme', 'improbability', 'of', 'these', 'models', 'with', 'respect', 'to', 'any', 'reasonable', 'measure', 'on', 'the', 'space', 'of', 'all', 'spacetimes', 'this', 'issue', 'may', 'be', 'expressed', 'in', 'different', 'ways', 'and', 'a', 'phase', 'space', 'formulation', 'due', 'to', 'penrose', 'is', 'presented', 'here', 'a', 'horizon', 'problem', 'only', 'arises', 'when', 'additional', 'assumptions', 'which', 'are', 'usually', 'kept', 'implicit', 'and', 'at', 'any', 'rate', 'seem', 'rather', 'speculative', 'are', 'made']]
|
[-0.11403623823737301, 0.08711355874616569, -0.09925783061155763, 0.14071051098350282, -0.12026482768727784, -0.13898546583489205, -0.012434383786159773, 0.34984506725206105, -0.2700373180968014, -0.3260245164283899, 0.1338771868248845, -0.24017137133070032, -0.14236371378951485, 0.18935106281158262, -0.08493824421594313, 0.024294188099102255, 0.03257976887318696, 0.03423299754610386, -0.0675012591339385, -0.2533167056928686, 0.3778671519405738, 0.09053262184215594, 0.27134376604335103, 0.04346103852622489, 0.09589603046970674, -0.05050974225826345, -0.040584233877368855, 0.04477520923239384, -0.0984132030254041, 0.09687611902291071, 0.24226758507490606, 0.14828663076133047, 0.2844025537688517, -0.4155157633179884, -0.23287944074070924, 0.1350766799433922, 0.14148601015263595, 0.1116602859283866, -0.033288226277710914, -0.23639640393493025, 0.07295540822196474, -0.11088856516591432, -0.14562555883177344, -0.029560232469309663, 0.030535176036979896, -0.059034252379387156, -0.2035611165490357, 0.08417933063457925, 0.05812328422277358, 0.02139580911469812, -0.05647655222052902, -0.09019183490717111, 0.025840189663936766, 0.0682634770310111, 0.13761543403901313, 0.04049252276985106, 0.09250118171011727, -0.13533188186825496, -0.1003393678987762, 0.4379455498593601, 0.0023670461290507265, -0.18234367432513301, 0.20977649483921518, -0.14277232750763352, -0.14790654486949514, 0.08621731882671443, 0.08220666698354037, 0.10646405280857536, -0.1296134796218789, 0.09546037067183877, -0.03575421587652933, 0.17406555821373285, 0.09162809702865315, 0.04301017216195186, 0.2669948000476321, 0.13339435778117711, 0.05106143993074345, 0.06324419947978711, -0.010181527540350479, -0.12676715755258414, -0.33326319904217333, -0.12751326055065013, -0.16187059935771655, 0.06983999378063341, -0.12858274268343634, -0.18079809369594227, 0.32328124133352176, 0.16524052940444545, 0.17474514934817847, 0.0049119084789437, 0.29748616893524576, 0.08536927076008294, 0.056468231406901416, 0.060780857066542716, 0.2948175853421898, 0.0879683154480555, 0.09029498300225285, -0.17035079788787608, 0.09145571481382389, 0.003688341986264307]
|
1,803.05149
|
Phase separation and second-order phase transition in the
phenomenological model for Coulomb frustrated 2D system
|
We have considered the model of the phase transition of the second order for
the Coulomb frustrated 2D charged system. The coupling of the order parameter
with the charge was considered as the local temperature. We have found that in
such system, an appearance of the phase-separated state is possible. By
numerical simulation, we have obtained different types ("stripes", "rings",
"snakes") of phase-separated states and determined the parameter ranges for
these states. Thus the system undergoes a series of phase transitions when the
temperature decreases. First, the system moves from the homogeneous state with
a zero order parameter to the phase-separated state with two phases in one of
which the order parameter is zero and, in the other, it is nonzero ($\tau>0$).
Then a first-order transition occurs to another phase-separated state, in which
both phases have different and nonzero values of the order parameter (for
$\tau<0$). And only a further decrease of temperature leads to a transition to
a homogeneous ordered state.
|
cond-mat.str-el
|
we have considered the model of the phase transition of the second order for the coulomb frustrated 2d charged system the coupling of the order parameter with the charge was considered as the local temperature we have found that in such system an appearance of the phaseseparated state is possible by numerical simulation we have obtained different types stripes rings snakes of phaseseparated states and determined the parameter ranges for these states thus the system undergoes a series of phase transitions when the temperature decreases first the system moves from the homogeneous state with a zero order parameter to the phaseseparated state with two phases in one of which the order parameter is zero and in the other it is nonzero tau0 then a firstorder transition occurs to another phaseseparated state in which both phases have different and nonzero values of the order parameter for tau0 and only a further decrease of temperature leads to a transition to a homogeneous ordered state
|
[['we', 'have', 'considered', 'the', 'model', 'of', 'the', 'phase', 'transition', 'of', 'the', 'second', 'order', 'for', 'the', 'coulomb', 'frustrated', '2d', 'charged', 'system', 'the', 'coupling', 'of', 'the', 'order', 'parameter', 'with', 'the', 'charge', 'was', 'considered', 'as', 'the', 'local', 'temperature', 'we', 'have', 'found', 'that', 'in', 'such', 'system', 'an', 'appearance', 'of', 'the', 'phaseseparated', 'state', 'is', 'possible', 'by', 'numerical', 'simulation', 'we', 'have', 'obtained', 'different', 'types', 'stripes', 'rings', 'snakes', 'of', 'phaseseparated', 'states', 'and', 'determined', 'the', 'parameter', 'ranges', 'for', 'these', 'states', 'thus', 'the', 'system', 'undergoes', 'a', 'series', 'of', 'phase', 'transitions', 'when', 'the', 'temperature', 'decreases', 'first', 'the', 'system', 'moves', 'from', 'the', 'homogeneous', 'state', 'with', 'a', 'zero', 'order', 'parameter', 'to', 'the', 'phaseseparated', 'state', 'with', 'two', 'phases', 'in', 'one', 'of', 'which', 'the', 'order', 'parameter', 'is', 'zero', 'and', 'in', 'the', 'other', 'it', 'is', 'nonzero', 'tau0', 'then', 'a', 'firstorder', 'transition', 'occurs', 'to', 'another', 'phaseseparated', 'state', 'in', 'which', 'both', 'phases', 'have', 'different', 'and', 'nonzero', 'values', 'of', 'the', 'order', 'parameter', 'for', 'tau0', 'and', 'only', 'a', 'further', 'decrease', 'of', 'temperature', 'leads', 'to', 'a', 'transition', 'to', 'a', 'homogeneous', 'ordered', 'state']]
|
[-0.17383975256090684, 0.22790413047842764, -0.05829880478198689, -0.03279161941113502, -0.0027834947657897884, -0.1298744548054665, 0.0552501794515626, 0.32993601611527945, -0.2647815819047851, -0.2776502464598988, 0.10142816527298203, -0.30064317145971237, -0.08216981078141633, 0.11359180176463898, 0.06664858034949887, 0.04086793030054886, -0.02626769846006308, 0.07435125228948891, -0.12226565645462949, -0.21668213600419278, 0.35337497388806055, -0.02264801050639815, 0.2692093604623719, 0.018712433740779768, 0.07720012199938481, -0.06728677428278096, 0.10749526182620751, 0.07125741097915136, -0.1759121316490227, -0.006515358813986596, 0.23814217872733687, 0.004998105218189188, 0.21307613339884507, -0.3850366101473754, -0.2131159636910637, 0.1147695034124348, 0.11955369348396305, 0.13900446833577007, -0.03286365486457254, -0.2943722891483318, 0.04720745390901963, -0.18910245922031915, -0.13593820115424876, -0.09286151137088, 0.023756746007244527, 0.003733622306888854, -0.29703590561877247, 0.11668459804337701, 0.07821349546824938, 0.016774179336304467, -0.09876372693336488, -0.11119690789829617, -0.07102877619377349, 0.155021424876148, 0.044877272876077276, 0.04726148316245756, 0.07111459652272363, -0.1443530904893752, -0.07891595644163496, 0.35392928693190584, -0.04804943898983047, -0.14536399329796199, 0.20175966697768022, -0.179114837211127, -0.06306338122252513, 0.1801162064132959, 0.12145897561546277, 0.1175033738779157, -0.0709295096670825, 0.04291750367495151, 0.011713246452006982, 0.19210179944603165, 0.019457390631066152, 0.013334264745935798, 0.20388807017747082, 0.1747352201362244, 0.06618109013724291, 0.18908888832299486, -0.11631775512733715, -0.15345461715054468, -0.27302803975288514, -0.1777084777764056, -0.18702251036409978, -0.01968414722338181, -0.090811452488803, -0.19042111358915767, 0.41443061205665555, 0.13287716670346986, 0.24175536286597496, -0.031172069564266245, 0.24185529810859374, 0.14870577682611635, 0.03528859558296792, 0.009431392632792761, 0.26355318426309776, 0.11592932455500381, 0.11184200106970506, -0.23520686844939417, 0.07648430452365888, 0.045732037282123425]
|
1,803.0515
|
Bernstein type inequalities for self-normalized martingales with
applications
|
For self-normalized martingales with conditionally symmetric differences, de
la Pe\~{n}a [A general class of exponential inequalities for martingales and
ratios. Ann. Probab. 27, No.1, 537-564] established the Gaussian type
exponential inequalities. Bercu and Touati [Exponential inequalities for
self-normalized martingales with applications. Ann. Appl. Probab. 18:
1848-1869] extended de la Pe\~{n}a's inequalities to martingales with
differences heavy on left. In this paper, we establish Bernstein type
exponential inequalities for self-normalized martingales with differences
bounded from below. Moreover, applications to self-normalized sums,
t-statistics and autoregressive processes are discussed.
|
math.PR
|
for selfnormalized martingales with conditionally symmetric differences de la pena a general class of exponential inequalities for martingales and ratios ann probab 27 no1 537564 established the gaussian type exponential inequalities bercu and touati exponential inequalities for selfnormalized martingales with applications ann appl probab 18 18481869 extended de la penas inequalities to martingales with differences heavy on left in this paper we establish bernstein type exponential inequalities for selfnormalized martingales with differences bounded from below moreover applications to selfnormalized sums tstatistics and autoregressive processes are discussed
|
[['for', 'selfnormalized', 'martingales', 'with', 'conditionally', 'symmetric', 'differences', 'de', 'la', 'pena', 'a', 'general', 'class', 'of', 'exponential', 'inequalities', 'for', 'martingales', 'and', 'ratios', 'ann', 'probab', '27', 'no1', '537564', 'established', 'the', 'gaussian', 'type', 'exponential', 'inequalities', 'bercu', 'and', 'touati', 'exponential', 'inequalities', 'for', 'selfnormalized', 'martingales', 'with', 'applications', 'ann', 'appl', 'probab', '18', '18481869', 'extended', 'de', 'la', 'penas', 'inequalities', 'to', 'martingales', 'with', 'differences', 'heavy', 'on', 'left', 'in', 'this', 'paper', 'we', 'establish', 'bernstein', 'type', 'exponential', 'inequalities', 'for', 'selfnormalized', 'martingales', 'with', 'differences', 'bounded', 'from', 'below', 'moreover', 'applications', 'to', 'selfnormalized', 'sums', 'tstatistics', 'and', 'autoregressive', 'processes', 'are', 'discussed']]
|
[0.013972055176661039, 0.10091616470544111, -0.04588161298029479, 0.17264604301696332, -0.049033792617376004, -0.2228404578830426, 0.04337587822339542, 0.2873010745804225, -0.2501878516992465, -0.2477977846616081, 0.14461390076099806, -0.3011396226495327, -0.12548979926144793, 0.23818995202669785, -0.19352165989333853, 0.10200858754771096, -0.05377253402201902, -0.11726082776468025, -0.061536141438409686, -0.3323995922248633, 0.21808614697129952, 0.007996028444419304, 0.2349698905489363, -0.03665181845870046, 0.10221930353353466, 0.0715072300795111, -0.09195884849343981, -0.11264538614168054, -0.20006451030453068, 0.1790304465130681, 0.3194463853502557, 0.048770738915274184, 0.34259225501279744, -0.35236984094427454, -0.08460284633197478, 0.24328944357555538, 0.10092087126741674, -0.03354293282055074, -0.04800956243222269, -0.38543147662477123, 0.0034207379212602973, -0.08006095951921972, -0.19037651400347905, -0.06419955495567549, 0.06653763509045045, 0.1921166955365888, -0.4598779280536941, 0.24758215846183398, 0.16796622351033702, 0.10421548996237107, 0.013638685108162463, -0.2297702349619829, 0.0662828933425425, -0.10937511164783723, 0.03506455714592621, -0.04601766915792333, 0.09692530676035122, 0.03775090033776082, -0.26054854644462466, 0.13161767042419387, -0.10696672835703273, -0.1984273127634965, 0.16065423581970945, -0.174351342598952, -0.25685812524032026, 0.03689114590885029, 0.18166467404392148, 0.09872919578282606, -0.13983001656431174, 0.24293815448029255, -0.041539983301325786, 0.026270423155178184, 0.20525447941673475, 0.015726514651933463, -0.006167451912049381, -0.016482780149783053, 0.11147179837072534, 0.046424383630177805, -0.033367442762634404, -0.1873193946445272, -0.36023062871148187, -0.19478735228906208, -0.15245393386465453, 0.14975493577852225, -0.23314965317262076, -0.18065373184868977, 0.2131237326400532, 0.049253170899603335, 0.059160339867784864, 0.2364711227627205, 0.008952648473149609, 0.1300633342360102, -0.03228156102289047, 0.12872901871083914, 0.14256396945122451, 0.3199335314843449, 0.1932919464196034, -0.051577338081274536, 0.09095690118348491, 0.19425666445663192]
|
1,803.05151
|
Bound states in the continuum on periodic structures surrounded by
strong resonances
|
Bound states in the continuum (BICs) are trapped or guided modes with their
frequencies in the frequency intervals of the radiation modes. On periodic
structures, a BIC is surrounded by a family of resonant modes with their
quality factors approaching infinity. Typically the quality factors are
proportional to $1/|\beta - \beta_*|^2$, where $\beta$ and $\beta_*$ are the
Bloch wavevectors of the resonant modes and the BIC, respectively. But for some
special BICs, the quality factors are proportional to $1/|\beta -\beta_*|^4$.
In this paper, a general condition is derived for such special BICs on
two-dimensional periodic structures. As a numerical example, we use the general
condition to calculate special BICs, which are antisymmetric standing waves, on
a periodic array of circular cylinders, and show their dependence on
parameters. The special BICs are important for practical applications, because
they produce resonances with large quality factors for a very large range of
$\beta$.
|
physics.optics
|
bound states in the continuum bics are trapped or guided modes with their frequencies in the frequency intervals of the radiation modes on periodic structures a bic is surrounded by a family of resonant modes with their quality factors approaching infinity typically the quality factors are proportional to 1beta beta_2 where beta and beta_ are the bloch wavevectors of the resonant modes and the bic respectively but for some special bics the quality factors are proportional to 1beta beta_4 in this paper a general condition is derived for such special bics on twodimensional periodic structures as a numerical example we use the general condition to calculate special bics which are antisymmetric standing waves on a periodic array of circular cylinders and show their dependence on parameters the special bics are important for practical applications because they produce resonances with large quality factors for a very large range of beta
|
[['bound', 'states', 'in', 'the', 'continuum', 'bics', 'are', 'trapped', 'or', 'guided', 'modes', 'with', 'their', 'frequencies', 'in', 'the', 'frequency', 'intervals', 'of', 'the', 'radiation', 'modes', 'on', 'periodic', 'structures', 'a', 'bic', 'is', 'surrounded', 'by', 'a', 'family', 'of', 'resonant', 'modes', 'with', 'their', 'quality', 'factors', 'approaching', 'infinity', 'typically', 'the', 'quality', 'factors', 'are', 'proportional', 'to', '1beta', 'beta_2', 'where', 'beta', 'and', 'beta_', 'are', 'the', 'bloch', 'wavevectors', 'of', 'the', 'resonant', 'modes', 'and', 'the', 'bic', 'respectively', 'but', 'for', 'some', 'special', 'bics', 'the', 'quality', 'factors', 'are', 'proportional', 'to', '1beta', 'beta_4', 'in', 'this', 'paper', 'a', 'general', 'condition', 'is', 'derived', 'for', 'such', 'special', 'bics', 'on', 'twodimensional', 'periodic', 'structures', 'as', 'a', 'numerical', 'example', 'we', 'use', 'the', 'general', 'condition', 'to', 'calculate', 'special', 'bics', 'which', 'are', 'antisymmetric', 'standing', 'waves', 'on', 'a', 'periodic', 'array', 'of', 'circular', 'cylinders', 'and', 'show', 'their', 'dependence', 'on', 'parameters', 'the', 'special', 'bics', 'are', 'important', 'for', 'practical', 'applications', 'because', 'they', 'produce', 'resonances', 'with', 'large', 'quality', 'factors', 'for', 'a', 'very', 'large', 'range', 'of', 'beta']]
|
[-0.17354526008704316, 0.19584706910079558, 0.002478603186123323, 0.07206708798263121, -0.09127204861154392, -0.15020914108886216, 0.03818061755854486, 0.39773905563524503, -0.19945567015608484, -0.23947745532847492, 0.12722190941024522, -0.28165183502605695, -0.1373696174056913, 0.20289303465346312, -0.0063403979039144695, 0.08060229714997363, 0.030450028381404162, 0.01724811990264078, -0.015909517010448862, -0.16533718623687316, 0.31813643002670083, 0.046950929860690695, 0.30221566354743384, 0.036880620077077375, 0.00767162437871061, -0.021710770929719778, 0.06914630208098824, -0.023066850247849154, -0.15899574837566122, 0.08707483838923313, 0.24509808181116244, 0.015207106466311337, 0.23653354614523034, -0.40011532469683847, -0.17443591591000346, 0.04439472694624991, 0.16195165738932188, 0.10606607638733874, -0.004651740999679838, -0.263108882253002, 0.050694064390314306, -0.09264537046707216, -0.17156160712451518, -0.07410946231641675, 0.03899317609783787, 0.05876357551201578, -0.3140908339617136, 0.08081261815984526, 0.04433163345147599, 0.03362234219308668, -0.0699040240033111, -0.13378965860739, -0.021891367038861916, 0.0861079187629332, 0.0758021648491939, -0.04743315535753766, 0.11375616440837015, -0.12719706570317083, -0.08018977456919898, 0.4044567423606223, -0.04847122258553594, -0.23812781140870795, 0.18812948154229295, -0.15857528799507242, -0.09046543317365667, 0.15269689327855937, 0.1883504160542366, 0.11207291214483096, -0.05310268560111923, 0.0699312413324627, -0.032702846815122054, 0.14801876134732925, 0.166782442817852, 0.11562878617488673, 0.22194893037487798, 0.09051476694305971, 0.02309138446596245, 0.146317453161132, -0.07030990509153813, -0.026804029468865752, -0.30486706254266255, -0.10401077684204113, -0.1777723344580439, 0.02525860565908303, -0.08683359046162328, -0.24109278551159088, 0.39112450714979397, 0.004337691445678672, 0.2031251985154696, 0.030595848762630266, 0.24997794283428948, 0.15914643524236502, 0.05865279253065936, 0.07267136111442975, 0.289366378388938, 0.13942079374491667, 0.0007437364254521844, -0.2028562396595992, -0.011722528863076712, -0.015063015987859077]
|
1,803.05152
|
Study of Quantum Walk over a Square Lattice
|
Quantum random walk finds application in efficient quantum algorithms as well
as in quantum network theory. Here we study the mixing time of a discrete
quantum walk over a square lattice in presence percolation and decoherence. We
consider bit-flip and phase damping noise, and evaluate the instantaneous
mixing time for both the cases. Using numerical analysis we show that in case
of phase damping noise probability distribution of walker's position is
sufficiently close to the uniform distribution after infinite time. However,
during the action of bit-flip noise, even after infinite time the total
variation distance between the two probability distributions is large enough.
|
quant-ph
|
quantum random walk finds application in efficient quantum algorithms as well as in quantum network theory here we study the mixing time of a discrete quantum walk over a square lattice in presence percolation and decoherence we consider bitflip and phase damping noise and evaluate the instantaneous mixing time for both the cases using numerical analysis we show that in case of phase damping noise probability distribution of walkers position is sufficiently close to the uniform distribution after infinite time however during the action of bitflip noise even after infinite time the total variation distance between the two probability distributions is large enough
|
[['quantum', 'random', 'walk', 'finds', 'application', 'in', 'efficient', 'quantum', 'algorithms', 'as', 'well', 'as', 'in', 'quantum', 'network', 'theory', 'here', 'we', 'study', 'the', 'mixing', 'time', 'of', 'a', 'discrete', 'quantum', 'walk', 'over', 'a', 'square', 'lattice', 'in', 'presence', 'percolation', 'and', 'decoherence', 'we', 'consider', 'bitflip', 'and', 'phase', 'damping', 'noise', 'and', 'evaluate', 'the', 'instantaneous', 'mixing', 'time', 'for', 'both', 'the', 'cases', 'using', 'numerical', 'analysis', 'we', 'show', 'that', 'in', 'case', 'of', 'phase', 'damping', 'noise', 'probability', 'distribution', 'of', 'walkers', 'position', 'is', 'sufficiently', 'close', 'to', 'the', 'uniform', 'distribution', 'after', 'infinite', 'time', 'however', 'during', 'the', 'action', 'of', 'bitflip', 'noise', 'even', 'after', 'infinite', 'time', 'the', 'total', 'variation', 'distance', 'between', 'the', 'two', 'probability', 'distributions', 'is', 'large', 'enough']]
|
[-0.1446459626335904, 0.2297826601300859, -0.07126872732475834, 0.06852755278972819, 0.0315901801731546, -0.16239629003210265, 0.09908100805647707, 0.4200764025190791, -0.25612142678006616, -0.24448693118926174, 0.1146370834248249, -0.2450509405360349, -0.17138787749612217, 0.15363912624352186, -0.05430431300955056, 0.10206501577411173, 0.07002119437420687, 0.05281722350769396, -0.06206065617971918, -0.25263748274781533, 0.2490602816913946, 0.051626492223874165, 0.26729463499708517, 0.016878787168184098, 0.11385747987903583, 0.04884528292306853, -0.009418704194351308, 0.0041836086928597775, -0.10809667161429919, -0.03601518578972052, 0.18779301284631553, 0.05114762045587729, 0.27997840445000427, -0.4153941486356328, -0.22034345587118737, 0.1407489729468774, 0.12860081235435114, 0.1886359851771188, -0.019418382461101395, -0.2759419769857947, 0.031251351672306076, -0.17565388039875668, -0.09523061931458782, -0.03642670956702487, 0.05912970843752032, 0.018344466480679666, -0.27756093352246414, 0.13150080066011513, 0.06354487829421222, 0.03145566977813695, 0.0010897002173858939, -0.05165505522265307, 0.039191219835876694, 0.1605889345875272, 0.018569693619213564, -0.005459544816262369, 0.1156280594244961, -0.10949739078403105, -0.14827802663361564, 0.3695251575481255, -0.11741882355576291, -0.20086777448943519, 0.14274215266940374, -0.18257318547411452, -0.10690024906760352, 0.11936110410007458, 0.19042781338059497, 0.08937818559736592, -0.10527213437717806, 0.09526212445914618, 0.01783867059185088, 0.16797342249960864, 0.06722115492900309, 0.07801388475808849, 0.13637202283032962, 0.14093236885603191, 0.1217455359625639, 0.183459620146325, -0.14824518613241505, -0.2096638844972386, -0.32986975958552756, -0.1330448509718391, -0.2640406090079002, 0.10205452123010368, -0.1443692161742591, -0.19153985746421862, 0.3729852724965047, 0.16497635431090388, 0.20742966728827472, 0.11238158751930137, 0.297528814578664, 0.13189456362991583, -0.04061532526014788, 0.07753280197152669, 0.15099282191333913, 0.16555517802277164, 0.05455758505234115, -0.24107776257634453, 0.09776812161147161, 0.04570081625676271]
|
1,803.05153
|
Dynamic polarizabilities and magic wavelengths of Sr$^+$ for focused
vortex light
|
A theory of dynamic polarizability for trapping relevant states of Sr$^+$ is
presented here when the ions interact with a focused optical vortex. The
coupling between the orbital and spin angular momentum of the optical vortex
varies with focusing angle of the beam and is studied in the calculation of the
magic wavelengths for $5s_{{1}/{2}}\rightarrow 4d_{{3}/{2}, {5}/{2}}$
transitions of Sr$^+$. The initial state of our interest here is $5s_{{1}/{2}}$
with $m_J = -1/2$ of which is different possible trapping state compare to our
recent work on Sr$^+$ [Phys. Rev. A \textbf{97}, 022511 (2018)]. We find
variation in magic wavelengths and the corresponding polarizabilities with
different combinations of orbital and spin angular momentum of the vortex beam.
The variation is very significant when the wavelengths of the beam are in the
infrared region of electromagnetic spectrum. The calculated magic wavelengths
will help the experimentalists to trap the ion for performing the high
precision spectroscopic measurements.
|
physics.atom-ph
|
a theory of dynamic polarizability for trapping relevant states of sr is presented here when the ions interact with a focused optical vortex the coupling between the orbital and spin angular momentum of the optical vortex varies with focusing angle of the beam and is studied in the calculation of the magic wavelengths for 5s_12rightarrow 4d_32 52 transitions of sr the initial state of our interest here is 5s_12 with m_j 12 of which is different possible trapping state compare to our recent work on sr phys rev a textbf97 022511 2018 we find variation in magic wavelengths and the corresponding polarizabilities with different combinations of orbital and spin angular momentum of the vortex beam the variation is very significant when the wavelengths of the beam are in the infrared region of electromagnetic spectrum the calculated magic wavelengths will help the experimentalists to trap the ion for performing the high precision spectroscopic measurements
|
[['a', 'theory', 'of', 'dynamic', 'polarizability', 'for', 'trapping', 'relevant', 'states', 'of', 'sr', 'is', 'presented', 'here', 'when', 'the', 'ions', 'interact', 'with', 'a', 'focused', 'optical', 'vortex', 'the', 'coupling', 'between', 'the', 'orbital', 'and', 'spin', 'angular', 'momentum', 'of', 'the', 'optical', 'vortex', 'varies', 'with', 'focusing', 'angle', 'of', 'the', 'beam', 'and', 'is', 'studied', 'in', 'the', 'calculation', 'of', 'the', 'magic', 'wavelengths', 'for', '5s_12rightarrow', '4d_32', '52', 'transitions', 'of', 'sr', 'the', 'initial', 'state', 'of', 'our', 'interest', 'here', 'is', '5s_12', 'with', 'm_j', '12', 'of', 'which', 'is', 'different', 'possible', 'trapping', 'state', 'compare', 'to', 'our', 'recent', 'work', 'on', 'sr', 'phys', 'rev', 'a', 'textbf97', '022511', '2018', 'we', 'find', 'variation', 'in', 'magic', 'wavelengths', 'and', 'the', 'corresponding', 'polarizabilities', 'with', 'different', 'combinations', 'of', 'orbital', 'and', 'spin', 'angular', 'momentum', 'of', 'the', 'vortex', 'beam', 'the', 'variation', 'is', 'very', 'significant', 'when', 'the', 'wavelengths', 'of', 'the', 'beam', 'are', 'in', 'the', 'infrared', 'region', 'of', 'electromagnetic', 'spectrum', 'the', 'calculated', 'magic', 'wavelengths', 'will', 'help', 'the', 'experimentalists', 'to', 'trap', 'the', 'ion', 'for', 'performing', 'the', 'high', 'precision', 'spectroscopic', 'measurements']]
|
[-0.11879413053381875, 0.21466963523370827, -0.023457959024725777, -0.007690255988946822, -0.012029924622957447, -0.11768911790874738, 0.04609719821248865, 0.4096965787895514, -0.18019946653236585, -0.3080321598589714, 0.023314370716290892, -0.300255340033848, -0.01861196336655044, 0.1813861713974467, 0.02511914450760263, 0.06037243802749895, 0.04529536770056247, -0.01742859101413112, -0.07520429387199999, -0.16022319596652923, 0.2749012062283184, 0.12346135242382604, 0.2463747736581258, 0.07092515081718662, 0.08461678396959446, 0.02720418198058676, 0.006564728673670049, -0.028125548150120794, -0.13595008196333716, 0.11763133224533369, 0.20838840630542682, 0.04320030642434416, 0.19327645614286762, -0.3859240608044753, -0.17701519277302155, 0.05080469204174159, 0.11067252165307045, 0.164603800417114, -0.014007898834135727, -0.2791735939926615, -0.020010083893889953, -0.14303029804202533, -0.15961591407387077, -0.06316054663253262, 0.0936162347513202, 0.07127225665872654, -0.2753545606423071, 0.053728767728898674, 0.013237301097864187, 0.09689544553647896, -0.09885530557949096, -0.16483033850090578, -0.046026088468926515, 0.06772732710975872, 0.02387606032578716, 0.06430957316862125, 0.1097034970727308, -0.10538705934978727, -0.09860527490091524, 0.3704162346027595, -0.030497546969471795, -0.10771754621160462, 0.150363456467044, -0.22069163574518538, -0.0806981535830633, 0.16480920440517366, 0.14648833369535982, 0.15253373638322382, -0.07463874861902073, 0.036947837967952514, -0.023399281822524865, 0.19174619399652665, 0.11154291473672186, 0.12313710969235551, 0.24369297174397567, 0.1623784016211223, 0.0017515316170542256, 0.11649491175816556, -0.21939155313425304, -0.08359896921358181, -0.2570300219859315, -0.12832319756087504, -0.1988361735742441, 0.04576471776052035, -0.024442092976881356, -0.08639417071275315, 0.4171376746564515, 0.12547704864808015, 0.18343017320857094, -0.037334843910158316, 0.2813909082171066, 0.09582086071436367, 0.048147652834335246, 0.02197810985748411, 0.3587025776934369, 0.1618545939288053, 0.14282427922712246, -0.3222447227913347, -0.02534362160536387, -0.017622219922486693]
|
1,803.05154
|
The Origin of the Milky Way's Halo Age Distribution
|
We present an analysis of the radial age gradients for the stellar halos of
five Milky Way mass-sized systems simulated as part of the Aquarius Project.
The halos show a diversity of age trends, reflecting their different assembly
histories. Four of the simulated halos possess clear negative age gradients,
ranging from approximately -7 to -19 Myr/kpc , shallower than those determined
by recent observational studies of the Milky Way's stellar halo. However, when
restricting the analysis to the accreted component alone, all of the stellar
halos exhibit a steeper negative age gradient with values ranging from $-$8 to
$-$32~Myr/kpc, closer to those observed in the Galaxy. Two of the
accretion-dominated simulated halos show a large concentration of old stars in
the center, in agreement with the Ancient Chronographic Sphere reported
observationally. The stellar halo that best reproduces the current observed
characteristics of the age distributions of the Galaxy is that formed
principally by the accretion of small satellite galaxies. Our findings suggest
that the hierarchical clustering scenario can reproduce the MW's halo age
distribution if the stellar halo was assembled from accretion and disruption of
satellite galaxies with dynamical masses less than ~10^9.5M_sun, and a minimal
in situ contribution.
|
astro-ph.GA
|
we present an analysis of the radial age gradients for the stellar halos of five milky way masssized systems simulated as part of the aquarius project the halos show a diversity of age trends reflecting their different assembly histories four of the simulated halos possess clear negative age gradients ranging from approximately 7 to 19 myrkpc shallower than those determined by recent observational studies of the milky ways stellar halo however when restricting the analysis to the accreted component alone all of the stellar halos exhibit a steeper negative age gradient with values ranging from 8 to 32myrkpc closer to those observed in the galaxy two of the accretiondominated simulated halos show a large concentration of old stars in the center in agreement with the ancient chronographic sphere reported observationally the stellar halo that best reproduces the current observed characteristics of the age distributions of the galaxy is that formed principally by the accretion of small satellite galaxies our findings suggest that the hierarchical clustering scenario can reproduce the mws halo age distribution if the stellar halo was assembled from accretion and disruption of satellite galaxies with dynamical masses less than 1095m_sun and a minimal in situ contribution
|
[['we', 'present', 'an', 'analysis', 'of', 'the', 'radial', 'age', 'gradients', 'for', 'the', 'stellar', 'halos', 'of', 'five', 'milky', 'way', 'masssized', 'systems', 'simulated', 'as', 'part', 'of', 'the', 'aquarius', 'project', 'the', 'halos', 'show', 'a', 'diversity', 'of', 'age', 'trends', 'reflecting', 'their', 'different', 'assembly', 'histories', 'four', 'of', 'the', 'simulated', 'halos', 'possess', 'clear', 'negative', 'age', 'gradients', 'ranging', 'from', 'approximately', '7', 'to', '19', 'myrkpc', 'shallower', 'than', 'those', 'determined', 'by', 'recent', 'observational', 'studies', 'of', 'the', 'milky', 'ways', 'stellar', 'halo', 'however', 'when', 'restricting', 'the', 'analysis', 'to', 'the', 'accreted', 'component', 'alone', 'all', 'of', 'the', 'stellar', 'halos', 'exhibit', 'a', 'steeper', 'negative', 'age', 'gradient', 'with', 'values', 'ranging', 'from', '8', 'to', '32myrkpc', 'closer', 'to', 'those', 'observed', 'in', 'the', 'galaxy', 'two', 'of', 'the', 'accretiondominated', 'simulated', 'halos', 'show', 'a', 'large', 'concentration', 'of', 'old', 'stars', 'in', 'the', 'center', 'in', 'agreement', 'with', 'the', 'ancient', 'chronographic', 'sphere', 'reported', 'observationally', 'the', 'stellar', 'halo', 'that', 'best', 'reproduces', 'the', 'current', 'observed', 'characteristics', 'of', 'the', 'age', 'distributions', 'of', 'the', 'galaxy', 'is', 'that', 'formed', 'principally', 'by', 'the', 'accretion', 'of', 'small', 'satellite', 'galaxies', 'our', 'findings', 'suggest', 'that', 'the', 'hierarchical', 'clustering', 'scenario', 'can', 'reproduce', 'the', 'mws', 'halo', 'age', 'distribution', 'if', 'the', 'stellar', 'halo', 'was', 'assembled', 'from', 'accretion', 'and', 'disruption', 'of', 'satellite', 'galaxies', 'with', 'dynamical', 'masses', 'less', 'than', '1095m_sun', 'and', 'a', 'minimal', 'in', 'situ', 'contribution']]
|
[-0.04847480214278524, 0.11750478476281456, -0.12125631086647702, 0.14213004962672504, -0.09437162052505674, 0.005848281622195664, -0.013796604886794319, 0.38845152138278655, -0.14173297633593065, -0.43640572463090604, 0.008794057292815967, -0.28992402487231467, -0.03779815098958072, 0.2323173045538939, -0.019666960902321035, -0.025439769247448285, 0.06312976714271383, -0.06350467685514535, -0.060865282235093986, -0.30163468175018443, 0.3317944409397359, 0.04891371134525308, 0.15381706981137633, -0.09576876709858577, 0.060836866560081644, -0.11711673099213303, -0.09322784198209261, -0.020471876881156977, -0.16890113321905328, 0.06078408494926034, 0.22569419314416173, 0.14379924284861398, 0.21794036295838082, -0.3738521207888157, -0.21773256282202708, 0.07960015901674827, 0.23005281205002506, 0.04956552130289567, -0.15595606255273406, -0.24035580676431076, 0.09912135030996676, -0.2137693163437339, -0.19004824405345014, 0.12101643651914902, 0.03149955818572869, 0.03340310668304133, -0.18029730151801443, 0.19547408802781063, 0.017288868207311354, 0.09690761532968818, -0.12172785515252214, -0.14674673473749023, -0.11176541764886143, 0.10828235158890796, 0.04389678484712465, 0.03834250738653235, 0.24940474536986304, -0.13044852387900344, -0.010821489125299148, 0.40961054160426824, -0.07079945034362399, 0.000431129083974669, 0.235330264767011, -0.2340576684436737, -0.13990244721420683, 0.05616253872106496, 0.13221599920533406, 0.0778662547110938, -0.15645325369573235, -0.0010582372408885605, -0.04578696226922031, 0.21938803976831528, 0.04849145790227713, -0.03529274675727207, 0.32915773308143403, 0.09010274757822163, 0.06182894869588124, 0.040694428097385056, -0.15291898584184357, -0.077525682008276, -0.16563624332730587, -0.07009613144521912, -0.13269396409069975, 0.06426503925273816, -0.17705997404125998, -0.11652653708886833, 0.35719239696478233, 0.13207467905580042, 0.2886656378742116, 0.12160530507397384, 0.3253520865757496, 0.03927744353781096, 0.1510256109393548, 0.09258958784958873, 0.2772020135128584, 0.1698399998796865, 0.06333446783037522, -0.26131289151067344, 0.11394084565735493, -0.06728436193452814]
|
1,803.05155
|
Limiting fragmentation in high-energy nuclear collisions at the CERN
Large Hadron Collider
|
The hypothesis of limiting fragmentation (LF) or it is called otherwise
recently, as extended longitudinal scaling, is an interesting phenomena in high
energy multiparticle production process. This paper discusses about different
regions of phase space and their importance in hadron production, giving
special emphasis on the fragmentation region. Although it was conjectured as a
universal phenomenon in high energy physics, with the advent of higher
center-of-mass energies, it has become prudent to analyse and understand the
validity of such hypothesis in view of the increasing inelastic nucleon-nucleon
cross-section ($\sigma_{\rm in}$). In this work, we revisit the phenomenon of
limiting fragmentation for nucleus-nucleus (A+A) collisions in the
pseudorapidity distribution of charged particles at various energies. We use
energy dependent $\sigma_{\rm in}$ to transform the charged particle
pseudorapidity distributions ($dN^{\rm AA}_{ch}/d\eta$) into differential
cross-section per unit pseudorapidity ($d\sigma^{\rm AA}/d\eta$) of charged
particles and study the phenomenon of LF. We find that in $d\sigma^{\rm
AA}/d\eta$ LF seems to be violated at LHC energies while considering the energy
dependent $\sigma_{\rm in}$. We also perform a similar study using A
Multi-Phase Transport (AMPT) Model with string melting scenario and also find
that LF is violated at LHC energies.
|
hep-ph hep-ex nucl-ex nucl-th
|
the hypothesis of limiting fragmentation lf or it is called otherwise recently as extended longitudinal scaling is an interesting phenomena in high energy multiparticle production process this paper discusses about different regions of phase space and their importance in hadron production giving special emphasis on the fragmentation region although it was conjectured as a universal phenomenon in high energy physics with the advent of higher centerofmass energies it has become prudent to analyse and understand the validity of such hypothesis in view of the increasing inelastic nucleonnucleon crosssection sigma_rm in in this work we revisit the phenomenon of limiting fragmentation for nucleusnucleus aa collisions in the pseudorapidity distribution of charged particles at various energies we use energy dependent sigma_rm in to transform the charged particle pseudorapidity distributions dnrm aa_chdeta into differential crosssection per unit pseudorapidity dsigmarm aadeta of charged particles and study the phenomenon of lf we find that in dsigmarm aadeta lf seems to be violated at lhc energies while considering the energy dependent sigma_rm in we also perform a similar study using a multiphase transport ampt model with string melting scenario and also find that lf is violated at lhc energies
|
[['the', 'hypothesis', 'of', 'limiting', 'fragmentation', 'lf', 'or', 'it', 'is', 'called', 'otherwise', 'recently', 'as', 'extended', 'longitudinal', 'scaling', 'is', 'an', 'interesting', 'phenomena', 'in', 'high', 'energy', 'multiparticle', 'production', 'process', 'this', 'paper', 'discusses', 'about', 'different', 'regions', 'of', 'phase', 'space', 'and', 'their', 'importance', 'in', 'hadron', 'production', 'giving', 'special', 'emphasis', 'on', 'the', 'fragmentation', 'region', 'although', 'it', 'was', 'conjectured', 'as', 'a', 'universal', 'phenomenon', 'in', 'high', 'energy', 'physics', 'with', 'the', 'advent', 'of', 'higher', 'centerofmass', 'energies', 'it', 'has', 'become', 'prudent', 'to', 'analyse', 'and', 'understand', 'the', 'validity', 'of', 'such', 'hypothesis', 'in', 'view', 'of', 'the', 'increasing', 'inelastic', 'nucleonnucleon', 'crosssection', 'sigma_rm', 'in', 'in', 'this', 'work', 'we', 'revisit', 'the', 'phenomenon', 'of', 'limiting', 'fragmentation', 'for', 'nucleusnucleus', 'aa', 'collisions', 'in', 'the', 'pseudorapidity', 'distribution', 'of', 'charged', 'particles', 'at', 'various', 'energies', 'we', 'use', 'energy', 'dependent', 'sigma_rm', 'in', 'to', 'transform', 'the', 'charged', 'particle', 'pseudorapidity', 'distributions', 'dnrm', 'aa_chdeta', 'into', 'differential', 'crosssection', 'per', 'unit', 'pseudorapidity', 'dsigmarm', 'aadeta', 'of', 'charged', 'particles', 'and', 'study', 'the', 'phenomenon', 'of', 'lf', 'we', 'find', 'that', 'in', 'dsigmarm', 'aadeta', 'lf', 'seems', 'to', 'be', 'violated', 'at', 'lhc', 'energies', 'while', 'considering', 'the', 'energy', 'dependent', 'sigma_rm', 'in', 'we', 'also', 'perform', 'a', 'similar', 'study', 'using', 'a', 'multiphase', 'transport', 'ampt', 'model', 'with', 'string', 'melting', 'scenario', 'and', 'also', 'find', 'that', 'lf', 'is', 'violated', 'at', 'lhc', 'energies']]
|
[-0.05132256528350378, 0.19587696121559833, -0.13250893474262404, 0.16195041012777342, 0.005372841658658888, -0.1011172854660177, -0.026730268717571896, 0.35553125960164167, -0.19619296075237033, -0.30011203440984613, -0.028282470615139527, -0.3039723713061233, -0.005063335686971091, 0.14323158240938363, 0.020868464575093976, 0.06746820943233998, 0.05408984428075583, 0.003844392632967547, -0.021218096795736958, -0.18700658218984148, 0.3047507508648682, 0.13405572007491412, 0.278379771902569, 0.16244762432516405, 0.06988524860996558, 0.07353878695468762, -0.0203788394126796, 0.011404701986343992, -0.17022207878617338, 0.030910592664823572, 0.25588485523629445, 0.04366447651378908, 0.19398262206783617, -0.38075606506808024, -0.16570207172710644, 0.13192124111994513, 0.17829459946431023, 0.06500308280198001, -0.05316239591798206, -0.2130864775935678, 0.059035992176320995, -0.21852978052981933, -0.17439545034676007, -0.005684623734927491, 0.05298973927274346, 0.010788843073494623, -0.2416581063972492, 0.15411829549641545, -0.002667449139315929, 0.048292491033575254, -0.04964460835571548, -0.10970791076358996, -0.0625403514150285, -0.014374688171512006, 0.0934273820424048, 0.056151121070510464, 0.1773978629026954, -0.17810236192614723, -0.10388681384930877, 0.380854994058609, 0.014041789255938247, -0.1511904808135832, 0.19708728791263544, -0.21999162101235828, -0.19175455123431195, 0.1609720609156954, 0.22989731743245534, 0.08822323910916519, -0.18567614797502757, 0.08716639033886359, -0.015777888979860828, 0.14624852918480571, 0.09657467916289246, 0.05879402971936782, 0.2080981127844241, 0.21563367448673632, -0.007459792621298938, 0.11847033777556039, -0.11131788866202298, -0.1219184795051421, -0.3582432959473839, -0.15223818085536261, -0.12569950212430406, 0.04508963947637791, -0.03667043894743792, -0.10064666886862955, 0.34487228544649523, 0.14548521237175968, 0.2815423501434883, 0.02471136048338131, 0.24638449367576917, 0.1381862057850843, 0.07141960301117874, 0.05271055055537114, 0.27171968777026784, 0.13529164755814954, 0.17679131462753409, -0.19382095588616244, 0.03787004982709492, 0.03853082635170339]
|
1,803.05156
|
The 2017 AIBIRDS Competition
|
This paper presents an overview of the sixth AIBIRDS competition, held at the
26th International Joint Conference on Artificial Intelligence. This
competition tasked participants with developing an intelligent agent which can
play the physics-based puzzle game Angry Birds. This game uses a sophisticated
physics engine that requires agents to reason and predict the outcome of
actions with only limited environmental information. Agents entered into this
competition were required to solve a wide assortment of previously unseen
levels within a set time limit. The physical reasoning and planning required to
solve these levels are very similar to those of many real-world problems. This
year's competition featured some of the best agents developed so far and even
included several new AI techniques such as deep reinforcement learning. Within
this paper we describe the framework, rules, submitted agents and results for
this competition. We also provide some background information on related work
and other video game AI competitions, as well as discussing some potential
ideas for future AIBIRDS competitions and agent improvements.
|
cs.AI
|
this paper presents an overview of the sixth aibirds competition held at the 26th international joint conference on artificial intelligence this competition tasked participants with developing an intelligent agent which can play the physicsbased puzzle game angry birds this game uses a sophisticated physics engine that requires agents to reason and predict the outcome of actions with only limited environmental information agents entered into this competition were required to solve a wide assortment of previously unseen levels within a set time limit the physical reasoning and planning required to solve these levels are very similar to those of many realworld problems this years competition featured some of the best agents developed so far and even included several new ai techniques such as deep reinforcement learning within this paper we describe the framework rules submitted agents and results for this competition we also provide some background information on related work and other video game ai competitions as well as discussing some potential ideas for future aibirds competitions and agent improvements
|
[['this', 'paper', 'presents', 'an', 'overview', 'of', 'the', 'sixth', 'aibirds', 'competition', 'held', 'at', 'the', '26th', 'international', 'joint', 'conference', 'on', 'artificial', 'intelligence', 'this', 'competition', 'tasked', 'participants', 'with', 'developing', 'an', 'intelligent', 'agent', 'which', 'can', 'play', 'the', 'physicsbased', 'puzzle', 'game', 'angry', 'birds', 'this', 'game', 'uses', 'a', 'sophisticated', 'physics', 'engine', 'that', 'requires', 'agents', 'to', 'reason', 'and', 'predict', 'the', 'outcome', 'of', 'actions', 'with', 'only', 'limited', 'environmental', 'information', 'agents', 'entered', 'into', 'this', 'competition', 'were', 'required', 'to', 'solve', 'a', 'wide', 'assortment', 'of', 'previously', 'unseen', 'levels', 'within', 'a', 'set', 'time', 'limit', 'the', 'physical', 'reasoning', 'and', 'planning', 'required', 'to', 'solve', 'these', 'levels', 'are', 'very', 'similar', 'to', 'those', 'of', 'many', 'realworld', 'problems', 'this', 'years', 'competition', 'featured', 'some', 'of', 'the', 'best', 'agents', 'developed', 'so', 'far', 'and', 'even', 'included', 'several', 'new', 'ai', 'techniques', 'such', 'as', 'deep', 'reinforcement', 'learning', 'within', 'this', 'paper', 'we', 'describe', 'the', 'framework', 'rules', 'submitted', 'agents', 'and', 'results', 'for', 'this', 'competition', 'we', 'also', 'provide', 'some', 'background', 'information', 'on', 'related', 'work', 'and', 'other', 'video', 'game', 'ai', 'competitions', 'as', 'well', 'as', 'discussing', 'some', 'potential', 'ideas', 'for', 'future', 'aibirds', 'competitions', 'and', 'agent', 'improvements']]
|
[-0.06659853205597303, 0.07293595402717133, -0.07839228910498718, 0.09968025659241289, -0.15095033168726596, -0.17099610230328857, 0.06741619832709035, 0.3641839728045922, -0.2614555366991016, -0.40310893605942644, 0.09538196198939836, -0.28451717642174496, -0.19108956416286307, 0.14910759131517812, -0.13634018330785208, 0.03427227049481851, 0.0916814747481392, 0.049852902925409344, 0.06347521873378366, -0.3173144445231063, 0.2867067662830955, 0.053569483905362474, 0.25581589302037067, 0.0607987535888737, 0.13405491914820566, 0.02194988159683241, -0.03011990973544059, 0.031171486856272586, -0.10594706054500162, 0.14333281282765362, 0.3767023276118837, 0.20234566970766912, 0.3893983517139709, -0.47491333460622637, -0.16314489982099845, 0.09136454983250673, 0.10806235998659533, 0.11404452713402043, -0.05282537605663067, -0.32410968587177214, 0.01162849823887785, -0.2294113555779824, -0.05943389044600655, -0.08163614685925484, 0.018301658613397876, 0.011822425040138125, -0.2455116448835773, -0.06478012323854133, 0.07038436283856167, 0.1234319702523744, -0.08287958612323866, -0.15497984812724452, 0.0896031393686078, 0.20336799069373873, 0.0619451038728154, 0.04077561302785624, 0.14540400133418613, -0.17808356763899724, -0.21889286058728952, 0.39819294111748066, -0.0002108050108000019, -0.104482374975827, 0.24480042689667253, -0.03980630431489567, -0.17899105250394556, 0.038819699526141734, 0.2260122298061181, 0.10265363662189544, -0.190765078901451, 0.01729060157089213, -0.027200107947653214, 0.170724431397228, 0.03504066473043926, -0.00827298575417089, 0.21041133829541284, 0.23316315219313258, 0.06803726341152432, 0.06029624577519379, 0.0019063070270414712, -0.16983298162968288, -0.24272942784953222, -0.08587083963335619, -0.10444610271487142, -0.00034770429028975144, -0.0321395465266855, -0.1044014977710046, 0.36236693666002456, 0.22672280146789975, 0.13833633882628021, 0.042732042288710775, 0.2905337458928309, 0.035589035694193256, 0.030664673772883, 0.05513389026966585, 0.22057841661625222, 0.0005888858074377451, 0.19559854206204766, -0.1779820550716697, 0.10652153413279875, 0.020959839704253618]
|
1,803.05157
|
No temporal distributional limit theorem for a.e. irrational translation
|
Bromberg and Ulcigrai constructed piecewise smooth functions f on the torus
such that the set of angles alpha for which the Birkhoff sums of f with respect
to the irrational translation by alpha satisfies a temporal distributional
limit theorem along the orbit of a.e. x has Hausdorff dimension one. We show
that the Lebesgue measure of this set of angles is equal to zero.
|
math.DS
|
bromberg and ulcigrai constructed piecewise smooth functions f on the torus such that the set of angles alpha for which the birkhoff sums of f with respect to the irrational translation by alpha satisfies a temporal distributional limit theorem along the orbit of ae x has hausdorff dimension one we show that the lebesgue measure of this set of angles is equal to zero
|
[['bromberg', 'and', 'ulcigrai', 'constructed', 'piecewise', 'smooth', 'functions', 'f', 'on', 'the', 'torus', 'such', 'that', 'the', 'set', 'of', 'angles', 'alpha', 'for', 'which', 'the', 'birkhoff', 'sums', 'of', 'f', 'with', 'respect', 'to', 'the', 'irrational', 'translation', 'by', 'alpha', 'satisfies', 'a', 'temporal', 'distributional', 'limit', 'theorem', 'along', 'the', 'orbit', 'of', 'ae', 'x', 'has', 'hausdorff', 'dimension', 'one', 'we', 'show', 'that', 'the', 'lebesgue', 'measure', 'of', 'this', 'set', 'of', 'angles', 'is', 'equal', 'to', 'zero']]
|
[-0.17666032358829398, 0.09822037234789605, -0.07763544385670684, 0.046104755223495886, -0.014288728321844246, -0.13906835365196457, 0.06635217653820291, 0.3549197726933926, -0.317501891287975, -0.13143108606982423, 0.06774174448946724, -0.30703433730377583, -0.07879881432745606, 0.21530803771747742, -0.09315448453708086, 0.09883541701128706, 0.008517207388649695, 0.09178237206651829, -0.10537416414445033, -0.2290370111077209, 0.3819683494511992, -0.07605479455378372, 0.19963582674972713, 0.005565254425164312, 0.17269996016693767, -0.008229712781030685, 0.008752720401389524, 0.006329032023131731, -0.17471199543183502, 0.12386270571732894, 0.17745364582515322, 0.10326759547388065, 0.25363566580927, -0.29146223711722996, -0.15670521511492552, 0.18088452830852475, 0.07185882667545229, -0.09329484882800898, 0.06224587388533109, -0.2818454588559689, 0.13688611987163313, -0.11210855562239885, -0.23133676227735123, -0.082908773663803, 0.1294111476818216, 0.057830851670587435, -0.28156521411438007, 0.017978030213271268, 0.1589664149651071, 0.10013619280289277, -0.04404237827111501, -0.1186187009443529, -0.09002793445324642, 0.09259928597566613, 0.10039885529477033, 0.1499097804990015, 0.07238560846599285, -0.00834443160056253, -0.07821500840145745, 0.36472682383464416, -0.10144716854301805, -0.2860663009923883, 0.14830215464462526, -0.25331446449126815, -0.1362570108176442, 0.1311651446740143, 0.10817533628141973, 0.12339757871814072, -0.04545836743636755, 0.2084649196904138, -0.13397609096136875, 0.14745758357457817, 0.15081844870292116, 0.006414451738237403, 0.13640486593794776, 0.032173000916372985, 0.1596016748517286, 0.10223340010270476, -0.07249877827052842, -0.028462220478104427, -0.3236761796288192, -0.1257876601521275, -0.1820162061994779, 0.1502957627089927, -0.15542830736353608, -0.23462121837656014, 0.3367537477170117, 0.0759600235542166, 0.20200846684747376, 0.1609225699844501, 0.22000535789993592, 0.1431393840871351, 0.019536814101229538, 0.03957723876374075, 0.1539227676403243, 0.14458334359005676, 0.0002088654218823649, -0.15068081995286775, 0.06285972827026853, 0.19380492949858308]
|
1,803.05158
|
Inter-orbital topological superconductivity in spin-orbit coupled
superconductors with inversion symmetry breaking
|
We study the superconducting state of multi-orbital spin-orbit coupled
systems in the presence of an orbitally driven inversion asymmetry assuming
that the inter-orbital attraction is the dominant pairing channel. Although the
inversion symmetry is absent, we show that superconducting states that avoid
mixing of spin-triplet and spin-singlet configurations are allowed, and
remarkably, spin-triplet states that are topologically nontrivial can be
stabilized in a large portion of the phase diagram. The orbital-dependent
spin-triplet pairing generally leads to topological superconductivity with
point nodes that are protected by a nonvanishing winding number. We demonstrate
that the disclosed topological phase can exhibit Lifshitz-type transitions upon
different driving mechanisms and interactions, e.g., by tuning the strength of
the atomic spin-orbit and inversion asymmetry couplings or by varying the
doping and the amplitude of order parameter. Such distinctive signatures of the
nodal phase manifest through an extraordinary reconstruction of the low-energy
excitation spectra both in the bulk and at the edge of the superconductor.
|
cond-mat.supr-con
|
we study the superconducting state of multiorbital spinorbit coupled systems in the presence of an orbitally driven inversion asymmetry assuming that the interorbital attraction is the dominant pairing channel although the inversion symmetry is absent we show that superconducting states that avoid mixing of spintriplet and spinsinglet configurations are allowed and remarkably spintriplet states that are topologically nontrivial can be stabilized in a large portion of the phase diagram the orbitaldependent spintriplet pairing generally leads to topological superconductivity with point nodes that are protected by a nonvanishing winding number we demonstrate that the disclosed topological phase can exhibit lifshitztype transitions upon different driving mechanisms and interactions eg by tuning the strength of the atomic spinorbit and inversion asymmetry couplings or by varying the doping and the amplitude of order parameter such distinctive signatures of the nodal phase manifest through an extraordinary reconstruction of the lowenergy excitation spectra both in the bulk and at the edge of the superconductor
|
[['we', 'study', 'the', 'superconducting', 'state', 'of', 'multiorbital', 'spinorbit', 'coupled', 'systems', 'in', 'the', 'presence', 'of', 'an', 'orbitally', 'driven', 'inversion', 'asymmetry', 'assuming', 'that', 'the', 'interorbital', 'attraction', 'is', 'the', 'dominant', 'pairing', 'channel', 'although', 'the', 'inversion', 'symmetry', 'is', 'absent', 'we', 'show', 'that', 'superconducting', 'states', 'that', 'avoid', 'mixing', 'of', 'spintriplet', 'and', 'spinsinglet', 'configurations', 'are', 'allowed', 'and', 'remarkably', 'spintriplet', 'states', 'that', 'are', 'topologically', 'nontrivial', 'can', 'be', 'stabilized', 'in', 'a', 'large', 'portion', 'of', 'the', 'phase', 'diagram', 'the', 'orbitaldependent', 'spintriplet', 'pairing', 'generally', 'leads', 'to', 'topological', 'superconductivity', 'with', 'point', 'nodes', 'that', 'are', 'protected', 'by', 'a', 'nonvanishing', 'winding', 'number', 'we', 'demonstrate', 'that', 'the', 'disclosed', 'topological', 'phase', 'can', 'exhibit', 'lifshitztype', 'transitions', 'upon', 'different', 'driving', 'mechanisms', 'and', 'interactions', 'eg', 'by', 'tuning', 'the', 'strength', 'of', 'the', 'atomic', 'spinorbit', 'and', 'inversion', 'asymmetry', 'couplings', 'or', 'by', 'varying', 'the', 'doping', 'and', 'the', 'amplitude', 'of', 'order', 'parameter', 'such', 'distinctive', 'signatures', 'of', 'the', 'nodal', 'phase', 'manifest', 'through', 'an', 'extraordinary', 'reconstruction', 'of', 'the', 'lowenergy', 'excitation', 'spectra', 'both', 'in', 'the', 'bulk', 'and', 'at', 'the', 'edge', 'of', 'the', 'superconductor']]
|
[-0.27889923223211793, 0.27576813766238417, -0.03828844880940145, 0.058632650879754014, -0.05187050729718861, -0.17216722837566764, 0.09049544500885531, 0.3430491669399699, -0.25286114353191436, -0.27352150770411177, -0.010319756085341913, -0.3074233486358359, -0.13976270456715853, 0.1086356214710358, 0.06608325065720733, -0.01132063401930765, -0.02896358001287555, -0.05483094609601871, -0.1181583091516425, -0.17872300307867647, 0.3786893773918288, -0.03512772575574868, 0.33286035919114004, 0.09230715074411393, -0.01952995467176543, -0.018052073941224173, 0.11088742016478666, 0.0028251967498961884, -0.09949274577892642, 0.026732518896902615, 0.2440248261429841, -0.08693935851790482, 0.13392227947051766, -0.442171866569338, -0.20347810770337812, 0.08478831933056817, 0.17243575038197906, 0.17597842807115255, -0.07270549763807485, -0.35325581269173684, 0.05072936618441268, -0.18522521256339514, -0.12213412235502767, -0.14997739960657597, -0.023560248831098404, -0.030366429169013907, -0.26692875553529616, 0.08314808127853454, 0.06592587351687017, 0.06260168023666815, -0.05880226558987994, -0.07587278955557113, -0.15830539747825056, 0.060512315073710736, 0.08149263363249035, 0.03192987546024113, 0.09300349492806635, -0.15919382660649717, -0.1047796641485294, 0.3362047597176478, -0.04618186492670351, -0.12017711065120146, 0.17194506119313366, -0.12557510338588088, -0.07059172950935538, 0.177759319352269, 0.08480835339066255, 0.05326766596629603, -0.07174459524759197, 0.083207844777911, -0.006460419614339554, 0.18160897747063096, 0.009137560265681034, 0.12498256233240819, 0.2632451796844525, 0.13190201263361953, 0.07746165591185983, 0.13829071871432347, -0.13731491397123172, -0.10427387130941866, -0.29382090273171757, -0.13070671148362417, -0.22681993039772858, 0.016161839389301175, -0.05150180329812567, -0.17003221263006754, 0.44625006037980874, 0.13806694718313556, 0.2059058911930416, -0.10787890874043908, 0.2314599741875088, 0.13075493636269925, 0.09034181381516819, 0.026277527684652354, 0.2757130944629825, 0.1295689980637966, 0.029654111686645994, -0.3555406597207147, 0.10533547356188344, 0.014240527843844287]
|
1,803.05159
|
Multiplicative Updates for Convolutional NMF Under $\beta$-Divergence
|
In this letter, we generalize the convolutional NMF by taking the
$\beta$-divergence as the contrast function and present the correct
multiplicative updates for its factors in closed form. The new updates unify
the $\beta$-NMF and the convolutional NMF. We state why almost all of the
existing updates are inexact and approximative w.r.t. the convolutional data
model. We show that our updates are stable and that their convergence
performance is consistent across the most common values of $\beta$.
|
cs.LG cs.DS stat.ML
|
in this letter we generalize the convolutional nmf by taking the betadivergence as the contrast function and present the correct multiplicative updates for its factors in closed form the new updates unify the betanmf and the convolutional nmf we state why almost all of the existing updates are inexact and approximative wrt the convolutional data model we show that our updates are stable and that their convergence performance is consistent across the most common values of beta
|
[['in', 'this', 'letter', 'we', 'generalize', 'the', 'convolutional', 'nmf', 'by', 'taking', 'the', 'betadivergence', 'as', 'the', 'contrast', 'function', 'and', 'present', 'the', 'correct', 'multiplicative', 'updates', 'for', 'its', 'factors', 'in', 'closed', 'form', 'the', 'new', 'updates', 'unify', 'the', 'betanmf', 'and', 'the', 'convolutional', 'nmf', 'we', 'state', 'why', 'almost', 'all', 'of', 'the', 'existing', 'updates', 'are', 'inexact', 'and', 'approximative', 'wrt', 'the', 'convolutional', 'data', 'model', 'we', 'show', 'that', 'our', 'updates', 'are', 'stable', 'and', 'that', 'their', 'convergence', 'performance', 'is', 'consistent', 'across', 'the', 'most', 'common', 'values', 'of', 'beta']]
|
[-0.08513028076604794, 0.03226370431825911, -0.08165095441386495, 0.062005390008715425, -0.05497779727815405, -0.14003293246251383, 0.03590200337471048, 0.442461478670961, -0.3051678198956468, -0.2453544762622761, 0.10822450753920221, -0.2758572534658015, -0.18738147787333123, 0.12171997698207729, -0.09056188308290745, 0.0815799935273964, 0.08988210404794172, 0.06673177907635507, -0.1308987410126352, -0.29436814645305276, 0.31496164260285076, 0.04052815303255461, 0.2383382724334584, -0.009272289649264789, 0.10653627675645494, -0.02873917607786624, -0.04248416118666922, -0.006178154824546685, -0.09107168950848925, 0.1494843239304732, 0.24329088350120737, 0.18990270192979983, 0.27852635342921866, -0.41678863834271107, -0.1613343247629114, 0.0871972915299825, 0.14347261987859383, 0.07932576743003569, -0.01587868247818398, -0.2526240821339582, 0.12595806774487228, -0.17039218927292446, -0.028241406121340237, -0.1527029714105945, -0.04809938172662729, 0.05304563886142875, -0.2939172822884039, 0.07230969532515462, 0.09339469467522576, -0.026012836832945283, -0.07640711309259611, -0.1869317421469053, 0.05759608938272944, 0.1316259253868147, 0.07781289420611422, 0.052369906738596525, 0.08759611210246619, -0.14396003840527938, -0.09921802058938499, 0.31469868309795856, -0.08978727959574347, -0.18525021219331966, 0.14843920705300806, -0.07338184686255102, -0.17526032234002886, 0.09943663602155682, 0.13984695100225508, 0.12497347083530928, -0.14130183885725656, 0.08885385902708788, -0.07841905362070783, 0.1107119676706038, 0.03438590911805237, 0.03923324783528714, 0.10707219984492679, 0.1626931086142768, 0.04117945791222155, 0.10970113653763149, -0.07192687268712018, -0.1180015410553958, -0.3015640417211934, -0.12186029486015047, -0.14806529118121894, -0.02535817202634031, -0.13927263649422553, -0.17672474402934313, 0.450134817422, 0.23009447410310568, 0.240969941075156, 0.15395404058041381, 0.3437461523633254, 0.07871363000135477, 0.0878448523734206, 0.16795118354677566, 0.2262696035966081, 0.11421254629538835, 0.08509031291070737, -0.19936565405958773, 0.13859833238989508, 0.04835537393994041]
|
1,803.0516
|
How to evaluate sentiment classifiers for Twitter time-ordered data?
|
Social media are becoming an increasingly important source of information
about the public mood regarding issues such as elections, Brexit, stock market,
etc. In this paper we focus on sentiment classification of Twitter data.
Construction of sentiment classifiers is a standard text mining task, but here
we address the question of how to properly evaluate them as there is no settled
way to do so. Sentiment classes are ordered and unbalanced, and Twitter
produces a stream of time-ordered data. The problem we address concerns the
procedures used to obtain reliable estimates of performance measures, and
whether the temporal ordering of the training and test data matters. We
collected a large set of 1.5 million tweets in 13 European languages. We
created 138 sentiment models and out-of-sample datasets, which are used as a
gold standard for evaluations. The corresponding 138 in-sample datasets are
used to empirically compare six different estimation procedures: three variants
of cross-validation, and three variants of sequential validation (where test
set always follows the training set). We find no significant difference between
the best cross-validation and sequential validation. However, we observe that
all cross-validation variants tend to overestimate the performance, while the
sequential methods tend to underestimate it. Standard cross-validation with
random selection of examples is significantly worse than the blocked
cross-validation, and should not be used to evaluate classifiers in
time-ordered data scenarios.
|
cs.CL cs.IR cs.SI
|
social media are becoming an increasingly important source of information about the public mood regarding issues such as elections brexit stock market etc in this paper we focus on sentiment classification of twitter data construction of sentiment classifiers is a standard text mining task but here we address the question of how to properly evaluate them as there is no settled way to do so sentiment classes are ordered and unbalanced and twitter produces a stream of timeordered data the problem we address concerns the procedures used to obtain reliable estimates of performance measures and whether the temporal ordering of the training and test data matters we collected a large set of 15 million tweets in 13 european languages we created 138 sentiment models and outofsample datasets which are used as a gold standard for evaluations the corresponding 138 insample datasets are used to empirically compare six different estimation procedures three variants of crossvalidation and three variants of sequential validation where test set always follows the training set we find no significant difference between the best crossvalidation and sequential validation however we observe that all crossvalidation variants tend to overestimate the performance while the sequential methods tend to underestimate it standard crossvalidation with random selection of examples is significantly worse than the blocked crossvalidation and should not be used to evaluate classifiers in timeordered data scenarios
|
[['social', 'media', 'are', 'becoming', 'an', 'increasingly', 'important', 'source', 'of', 'information', 'about', 'the', 'public', 'mood', 'regarding', 'issues', 'such', 'as', 'elections', 'brexit', 'stock', 'market', 'etc', 'in', 'this', 'paper', 'we', 'focus', 'on', 'sentiment', 'classification', 'of', 'twitter', 'data', 'construction', 'of', 'sentiment', 'classifiers', 'is', 'a', 'standard', 'text', 'mining', 'task', 'but', 'here', 'we', 'address', 'the', 'question', 'of', 'how', 'to', 'properly', 'evaluate', 'them', 'as', 'there', 'is', 'no', 'settled', 'way', 'to', 'do', 'so', 'sentiment', 'classes', 'are', 'ordered', 'and', 'unbalanced', 'and', 'twitter', 'produces', 'a', 'stream', 'of', 'timeordered', 'data', 'the', 'problem', 'we', 'address', 'concerns', 'the', 'procedures', 'used', 'to', 'obtain', 'reliable', 'estimates', 'of', 'performance', 'measures', 'and', 'whether', 'the', 'temporal', 'ordering', 'of', 'the', 'training', 'and', 'test', 'data', 'matters', 'we', 'collected', 'a', 'large', 'set', 'of', '15', 'million', 'tweets', 'in', '13', 'european', 'languages', 'we', 'created', '138', 'sentiment', 'models', 'and', 'outofsample', 'datasets', 'which', 'are', 'used', 'as', 'a', 'gold', 'standard', 'for', 'evaluations', 'the', 'corresponding', '138', 'insample', 'datasets', 'are', 'used', 'to', 'empirically', 'compare', 'six', 'different', 'estimation', 'procedures', 'three', 'variants', 'of', 'crossvalidation', 'and', 'three', 'variants', 'of', 'sequential', 'validation', 'where', 'test', 'set', 'always', 'follows', 'the', 'training', 'set', 'we', 'find', 'no', 'significant', 'difference', 'between', 'the', 'best', 'crossvalidation', 'and', 'sequential', 'validation', 'however', 'we', 'observe', 'that', 'all', 'crossvalidation', 'variants', 'tend', 'to', 'overestimate', 'the', 'performance', 'while', 'the', 'sequential', 'methods', 'tend', 'to', 'underestimate', 'it', 'standard', 'crossvalidation', 'with', 'random', 'selection', 'of', 'examples', 'is', 'significantly', 'worse', 'than', 'the', 'blocked', 'crossvalidation', 'and', 'should', 'not', 'be', 'used', 'to', 'evaluate', 'classifiers', 'in', 'timeordered', 'data', 'scenarios']]
|
[-0.03408466081394591, 0.007882371535630324, -0.05808017032006673, 0.1881891927147177, -0.11226213159682476, -0.16198499270290367, 0.11361380861155211, 0.450845704471643, -0.22412901777806032, -0.34353720307745766, 0.14622774324637416, -0.35647148800502837, -0.10645469424440485, 0.22172133460863952, -0.11299866617377023, 0.07537467267768111, 0.13448249120306455, 0.0423396223562613, -0.032878994782541804, -0.3694209473483693, 0.29460382177037786, 0.02540067400766817, 0.3691309668696527, 0.024425149635634327, 0.0658589646568423, -0.03226318572706077, -0.09967549899345741, 0.018534487310322558, -0.08479899003812905, 0.13240430529942257, 0.3262280193782872, 0.21467584702474748, 0.3475184860738176, -0.3711024877178458, -0.14659194293546807, 0.13761569107305752, 0.14480827609901276, 0.09688758104756284, 0.02732685685623437, -0.2888187757874551, 0.07652517152430935, -0.1861112587612619, 0.00716123733446991, -0.13750128463514363, -0.0027409071345871265, -0.012187248980574952, -0.280281954383389, 0.08339084151398753, 0.037952447701575215, 0.11089502602189252, -0.016706551444733236, -0.15313140745918613, -0.008468794052291298, 0.17503291175162947, 0.1283398876213922, -0.005274595075134452, 0.13668582095626527, -0.1254469027538115, -0.18791217090298248, 0.38517559768088094, -0.06063391681199335, -0.18616452678292167, 0.19024795536425756, -0.047104404085373454, -0.1479945871950667, 0.045544382769911164, 0.23109082021725785, 0.08897833277644442, -0.18051525720897899, -0.043348313925326266, -0.05084440518537355, 0.22810482822020695, 0.09666779526896709, -0.04984623105502152, 0.146591964737199, 0.20690944686787516, 0.029899535876847145, 0.1269639286993533, -0.1239587832490953, -0.0776899753414523, -0.22739327302206702, -0.09809787830853509, -0.13676636291521527, 0.0013624459002975712, -0.11833020063288163, -0.19109853612778263, 0.36809923131414485, 0.22264646706006497, 0.17906550599305388, 0.058962232385354064, 0.2834635246998375, 0.006345407256330631, 0.06486859728285499, 0.08986382898993056, 0.17529788042575253, 0.00778320647335191, 0.10569129446912887, -0.1258682423493767, 0.11046581674651532, -0.013977311295045095]
|
1,803.05161
|
Study of $B^-\to \Lambda\bar p\eta^{(')}$ and $\bar B^0_s\to
\Lambda\bar\Lambda\eta^{(')}$ decays
|
We study the three-body baryonic $B\to {\bf B\bar B'}M$ decays with $M$
representing the $\eta$ or $\eta'$ meson. Particularly, we predict that ${\cal
B}(B^-\to\Lambda\bar p\eta,\Lambda\bar p\eta')=(5.3\pm 1.4,3.3\pm 0.7)\times
10^{-6}$ or $(4.0\pm 0.7,4.6\pm 1.1)\times 10^{-6}$, where the errors arise
from the non-factorizable effects as well as the uncertainties in the $0\to
{\bf B\bar B'}$ and $B\to{\bf B\bar B'}$ transition form factors, while the two
different results are due to overall relative signs between the form factors,
causing the constructive and destructive interference effects. For the
corresponding baryonic $\bar B_s^0$ decays, we find that ${\cal B}(\bar
B^0_s\to \Lambda\bar \Lambda \eta,\Lambda\bar \Lambda \eta')=(1.2\pm 0.3,2.6\pm
0.8)\times 10^{-6}$ or $(2.1\pm 0.6,1.5\pm 0.4)\times 10^{-6}$ with the errors
similar to those above. The decays in question are accessible to the
experiments at BELLE and LHCb.
|
hep-ph hep-ex
|
we study the threebody baryonic bto bf bbar bm decays with m representing the eta or eta meson particularly we predict that cal bbtolambdabar petalambdabar peta53pm 1433pm 07times 106 or 40pm 0746pm 11times 106 where the errors arise from the nonfactorizable effects as well as the uncertainties in the 0to bf bbar b and btobf bbar b transition form factors while the two different results are due to overall relative signs between the form factors causing the constructive and destructive interference effects for the corresponding baryonic bar b_s0 decays we find that cal bbar b0_sto lambdabar lambda etalambdabar lambda eta12pm 0326pm 08times 106 or 21pm 0615pm 04times 106 with the errors similar to those above the decays in question are accessible to the experiments at belle and lhcb
|
[['we', 'study', 'the', 'threebody', 'baryonic', 'bto', 'bf', 'bbar', 'bm', 'decays', 'with', 'm', 'representing', 'the', 'eta', 'or', 'eta', 'meson', 'particularly', 'we', 'predict', 'that', 'cal', 'bbtolambdabar', 'petalambdabar', 'peta53pm', '1433pm', '07times', '106', 'or', '40pm', '0746pm', '11times', '106', 'where', 'the', 'errors', 'arise', 'from', 'the', 'nonfactorizable', 'effects', 'as', 'well', 'as', 'the', 'uncertainties', 'in', 'the', '0to', 'bf', 'bbar', 'b', 'and', 'btobf', 'bbar', 'b', 'transition', 'form', 'factors', 'while', 'the', 'two', 'different', 'results', 'are', 'due', 'to', 'overall', 'relative', 'signs', 'between', 'the', 'form', 'factors', 'causing', 'the', 'constructive', 'and', 'destructive', 'interference', 'effects', 'for', 'the', 'corresponding', 'baryonic', 'bar', 'b_s0', 'decays', 'we', 'find', 'that', 'cal', 'bbar', 'b0_sto', 'lambdabar', 'lambda', 'etalambdabar', 'lambda', 'eta12pm', '0326pm', '08times', '106', 'or', '21pm', '0615pm', '04times', '106', 'with', 'the', 'errors', 'similar', 'to', 'those', 'above', 'the', 'decays', 'in', 'question', 'are', 'accessible', 'to', 'the', 'experiments', 'at', 'belle', 'and', 'lhcb']]
|
[-0.0777148189875534, 0.26099859033533673, 0.01845600492699798, 0.1072600882567497, -0.04638751080827946, -0.10374581319737737, 0.10160407913608034, 0.24105995366255106, -0.18050238183873185, -0.2459738779165861, -0.050943118975876625, -0.4016850855146235, -0.018515117401336083, 0.11070691894392594, 0.042522604756799164, 0.06102582893701333, 0.070518796241416, -0.0005822431895945032, -0.07259253113751568, -0.1754708473168124, 0.21884268991080885, -0.05865133906146353, 0.1587171753931601, 0.06374259888573344, -0.07352509812878097, -0.0652968063871613, -0.02903324260644741, -0.08398208060199237, -0.20550573739221703, -0.03902972581247815, 0.22004467671958067, 0.13721575613589404, 0.1425851182775351, -0.3262949902564287, 0.019117139335090325, 0.19071036221862028, 0.18793216944766877, 0.041835479104844066, 0.052741368092059836, -0.4152972348255374, 0.17507981073695345, -0.19689902315958072, 0.002589932887546592, -0.06021282677262453, 0.11868341826691718, -0.10920816124268902, -0.4129944631703577, 0.1512196531688984, -0.03444873291072465, 0.0277818681680108, 0.016468571546345442, -0.27883806834648506, -0.019798021473511423, -0.006102546333272199, 0.10815731729222935, 0.16146059851833003, 0.2265291308068623, -0.13213263307619144, -0.1065787161203196, 0.4530589610843335, -0.06806544588002676, -0.1567379542294953, 0.16914860707297288, -0.22971948201499753, -0.120422029556012, 0.16390190976750801, 0.21108955665199497, 0.019776843249466332, -0.10485363795453588, 0.13665551207495963, 0.011516791008712755, 0.13241128546138436, 0.12264304460712977, 0.1218228866661883, 0.13018557396880154, 0.11240966930606608, -0.08131799587222227, 0.0036597812367737356, -0.10213324672274166, -0.01988255708099548, -0.3871284273089999, -0.09079134879610107, -0.00984882814336126, 0.1241510290952431, -0.049754765239505734, -0.05611322751915935, 0.2832383938662518, 0.048988468889778446, 0.37477590607763345, 0.005743065278708808, 0.29021840379573405, 0.08326593263003723, 0.03692557576400528, 0.11655455944522963, 0.3008281413734086, 0.19503445036993441, 0.06954046225341005, -0.33826726235615057, 0.005540900772942578, -0.035257695882060264]
|
1,803.05162
|
Van der Waals interlayer potential of graphitic structures: from
Lennard-Jones to Kolmogorov-Crespy and Lebedeva models
|
The experimental knowledge on interlayer potential of graphenites is
summarized and compared with computational results based on phenomenological
models. Besides Lennard-Jones approximation, the Mie potential is discussed,
Kolmogorov-Crespy model and equation of Lebedeva et al. An agreement is found
between a set of reported physical properties of graphite (compressibility
along c-axis under broad pressure range, Raman frequencies for bulk shear and
breathing modes under pressure, layer binding energies), when a proper choice
of model parameters is made. It is argued that the Kolmogorov-Crespy potential
is the preferable one for modelling. A simple method of fast numerical
modelling, convenient for accurate estimation of all these discussed physical
properties is proposed. It is useful in studies of other van der Waals
homo/heterostructures.
|
cond-mat.mes-hall
|
the experimental knowledge on interlayer potential of graphenites is summarized and compared with computational results based on phenomenological models besides lennardjones approximation the mie potential is discussed kolmogorovcrespy model and equation of lebedeva et al an agreement is found between a set of reported physical properties of graphite compressibility along caxis under broad pressure range raman frequencies for bulk shear and breathing modes under pressure layer binding energies when a proper choice of model parameters is made it is argued that the kolmogorovcrespy potential is the preferable one for modelling a simple method of fast numerical modelling convenient for accurate estimation of all these discussed physical properties is proposed it is useful in studies of other van der waals homoheterostructures
|
[['the', 'experimental', 'knowledge', 'on', 'interlayer', 'potential', 'of', 'graphenites', 'is', 'summarized', 'and', 'compared', 'with', 'computational', 'results', 'based', 'on', 'phenomenological', 'models', 'besides', 'lennardjones', 'approximation', 'the', 'mie', 'potential', 'is', 'discussed', 'kolmogorovcrespy', 'model', 'and', 'equation', 'of', 'lebedeva', 'et', 'al', 'an', 'agreement', 'is', 'found', 'between', 'a', 'set', 'of', 'reported', 'physical', 'properties', 'of', 'graphite', 'compressibility', 'along', 'caxis', 'under', 'broad', 'pressure', 'range', 'raman', 'frequencies', 'for', 'bulk', 'shear', 'and', 'breathing', 'modes', 'under', 'pressure', 'layer', 'binding', 'energies', 'when', 'a', 'proper', 'choice', 'of', 'model', 'parameters', 'is', 'made', 'it', 'is', 'argued', 'that', 'the', 'kolmogorovcrespy', 'potential', 'is', 'the', 'preferable', 'one', 'for', 'modelling', 'a', 'simple', 'method', 'of', 'fast', 'numerical', 'modelling', 'convenient', 'for', 'accurate', 'estimation', 'of', 'all', 'these', 'discussed', 'physical', 'properties', 'is', 'proposed', 'it', 'is', 'useful', 'in', 'studies', 'of', 'other', 'van', 'der', 'waals', 'homoheterostructures']]
|
[-0.09941900080342873, 0.08823611574753785, -0.07411394103687129, 0.007570073429037464, -0.07691096943995819, -0.1577955503859718, 0.04560289340061617, 0.40785040845291626, -0.22534922302845095, -0.266205922604121, -0.018301061700812766, -0.2765369486015547, -0.1724664353924113, 0.275739977357042, 0.015446407901091051, 0.08994117971702383, 0.06078292774377744, -0.015442598354199836, -0.03492484866151715, -0.21320459678576426, 0.2534429468214512, 0.10461416563966536, 0.32496291303059793, 0.10540803062934267, 0.051066096237828505, -0.002943265071170854, 0.016239521964774305, 0.03807238354106787, -0.2012130237159501, 0.07377286721924159, 0.224864136051706, -0.000502954437879139, 0.25106791342640744, -0.39282812168500547, -0.27406291017340945, 6.718197757185533e-06, 0.08016622477564318, 0.13392331222762707, -0.06395419085888064, -0.23151261533674752, 0.050017391660668216, -0.15670400515905228, -0.13904490607292874, -0.12655851259760625, 0.0557468178890774, 0.04532412995166819, -0.28537251845259093, 0.1386744719568704, 0.003325135033108005, 0.06555911284823228, -0.1386115810279895, -0.17932932800613344, -0.04324455776227767, 0.04052927970895263, 0.04085974793696519, 0.010940400267357072, 0.14181954369294167, -0.10371845592905221, -0.038234830484725535, 0.4394203880801797, -0.023265758445004708, -0.17740879176939228, 0.23157607421383325, -0.05876565408684185, -0.09496725096110382, 0.12250390249015443, 0.08658495953443043, 0.0726918655825008, -0.16155571334231103, 0.07636041406407583, -0.002571700111228234, 0.1754801126702785, 0.0796956488429087, 0.0010484927694553083, 0.1898809882073567, 0.2165443867882553, -0.00792668666690588, 0.09176776630669463, -0.06861602180388532, -0.08963209459134619, -0.271284425912168, -0.127817334724537, -0.21741149212326052, -0.007072240808689645, -0.11068857898235679, -0.19114280185373178, 0.36554704565762597, 0.14977538454795963, 0.15960738357409418, -0.013274858707706604, 0.28853782191511307, 0.09593473246297499, 0.033012466830329906, 0.027918006036559057, 0.3029290141762587, 0.17334387903422888, 0.07326305464937768, -0.21367682387715142, 0.09546449912359721, 0.04351555248361145]
|
1,803.05163
|
Field Driven Quantum Criticality in the Spinel Magnet ZnCr$_2$Se$_4$
|
We report detailed dc and ac magnetic susceptibilities, specific heat, and
thermal conductivity measurements on the frustrated magnet ZnCr$_2$Se$_4$. At
low temperatures, with increasing magnetic field, this spinel material goes
through a series of spin state transitions from the helix spin state to the
spiral spin state and then to the fully polarized state. Our results indicate a
direct quantum phase transition from the spiral spin state to the fully
polarized state. As the system approaches the quantum criticality, we find
strong quantum fluctuations of the spins with the behaviors such as an
unconventional $T^2$-dependent specific heat and temperature independent mean
free path for the thermal transport. We complete the full phase diagram of
ZnCr$_2$Se$_4$ under the external magnetic field and propose the possibility of
frustrated quantum criticality with extended densities of critical modes to
account for the unusual low-energy excitations in the vicinity of the
criticality. Our results reveal that ZnCr$_2$Se$_4$ is a rare example of 3D
magnet exhibiting a field-driven quantum criticality with unconventional
properties.
|
cond-mat.str-el
|
we report detailed dc and ac magnetic susceptibilities specific heat and thermal conductivity measurements on the frustrated magnet zncr_2se_4 at low temperatures with increasing magnetic field this spinel material goes through a series of spin state transitions from the helix spin state to the spiral spin state and then to the fully polarized state our results indicate a direct quantum phase transition from the spiral spin state to the fully polarized state as the system approaches the quantum criticality we find strong quantum fluctuations of the spins with the behaviors such as an unconventional t2dependent specific heat and temperature independent mean free path for the thermal transport we complete the full phase diagram of zncr_2se_4 under the external magnetic field and propose the possibility of frustrated quantum criticality with extended densities of critical modes to account for the unusual lowenergy excitations in the vicinity of the criticality our results reveal that zncr_2se_4 is a rare example of 3d magnet exhibiting a fielddriven quantum criticality with unconventional properties
|
[['we', 'report', 'detailed', 'dc', 'and', 'ac', 'magnetic', 'susceptibilities', 'specific', 'heat', 'and', 'thermal', 'conductivity', 'measurements', 'on', 'the', 'frustrated', 'magnet', 'zncr_2se_4', 'at', 'low', 'temperatures', 'with', 'increasing', 'magnetic', 'field', 'this', 'spinel', 'material', 'goes', 'through', 'a', 'series', 'of', 'spin', 'state', 'transitions', 'from', 'the', 'helix', 'spin', 'state', 'to', 'the', 'spiral', 'spin', 'state', 'and', 'then', 'to', 'the', 'fully', 'polarized', 'state', 'our', 'results', 'indicate', 'a', 'direct', 'quantum', 'phase', 'transition', 'from', 'the', 'spiral', 'spin', 'state', 'to', 'the', 'fully', 'polarized', 'state', 'as', 'the', 'system', 'approaches', 'the', 'quantum', 'criticality', 'we', 'find', 'strong', 'quantum', 'fluctuations', 'of', 'the', 'spins', 'with', 'the', 'behaviors', 'such', 'as', 'an', 'unconventional', 't2dependent', 'specific', 'heat', 'and', 'temperature', 'independent', 'mean', 'free', 'path', 'for', 'the', 'thermal', 'transport', 'we', 'complete', 'the', 'full', 'phase', 'diagram', 'of', 'zncr_2se_4', 'under', 'the', 'external', 'magnetic', 'field', 'and', 'propose', 'the', 'possibility', 'of', 'frustrated', 'quantum', 'criticality', 'with', 'extended', 'densities', 'of', 'critical', 'modes', 'to', 'account', 'for', 'the', 'unusual', 'lowenergy', 'excitations', 'in', 'the', 'vicinity', 'of', 'the', 'criticality', 'our', 'results', 'reveal', 'that', 'zncr_2se_4', 'is', 'a', 'rare', 'example', 'of', '3d', 'magnet', 'exhibiting', 'a', 'fielddriven', 'quantum', 'criticality', 'with', 'unconventional', 'properties']]
|
[-0.1738673717056786, 0.24075806502492966, -0.050733652478920484, 0.0017873669401491563, -0.05069003605373025, -0.11718685034394799, 0.08999747066189741, 0.3501111747262007, -0.251520697841655, -0.265480983818318, 0.053547043787611055, -0.3276401385888011, -0.09710012548073323, 0.17746406822035948, 0.09142963797088244, 0.04760623058794947, -0.03750188202837002, 0.03339063461338766, -0.09971062099131683, -0.14427120669849997, 0.28858191166956654, 0.029505030484172978, 0.32031006337015216, 0.06317470513296754, 0.0805411102155413, 0.002545988849436719, 0.16146253336299055, 0.038173144541033904, -0.16269010915386967, 0.0028223155964232846, 0.22995427159402898, -0.06680257452626936, 0.12781716682052402, -0.44542646157683546, -0.2287670609424125, 0.03726452172031169, 0.10217317440850286, 0.17269269812261007, -0.06485679343100191, -0.30881880408900225, 0.005792557399212466, -0.14376280884938816, -0.14511033956485683, -0.14714131318032742, -0.04689302417577919, -0.00440451598162958, -0.2395544483488102, 0.12415686109616327, 0.0866211557066874, 0.11989489283962008, -0.08427271923094899, -0.11072169439964732, -0.04671725003372231, 0.104346248619593, 0.02452723432086899, 0.06593132990283103, 0.16802855372891767, -0.17651720587749725, -0.15587209885198244, 0.31177024280061266, -0.0452179731863891, -0.07252569160909353, 0.18292869440932386, -0.22056510364692547, -0.10495357863426566, 0.16475279570953127, 0.1180423880794119, 0.08977422006093635, -0.11599914145706121, 0.03165186576327047, 0.013397990491709666, 0.16896649142364764, -0.08443139763660505, 0.08203947521651353, 0.3104252262628016, 0.17395649023889426, 0.021064979632100658, 0.22414977364465147, -0.1325207545580956, -0.13055197499179377, -0.257071556186047, -0.18346237274330154, -0.1949843272321417, 0.1085056051288447, -0.07633545605926202, -0.20189056653685555, 0.4124268656540774, 0.16990485758130985, 0.16717994875625936, -0.051524522206829695, 0.26842415530281977, 0.11398491143976745, 0.023692965362510997, 0.08331107992043127, 0.24278064274848132, 0.20387979991131736, 0.15346294449095776, -0.34534344587385835, 0.03296636813041381, -0.006477773245312497]
|
1,803.05164
|
A curious class of Hankel determinants
|
We consider Hankel determinants of the sequence of Catalan numbers modulo 2
(interpreted as integers 0 and 1) and more generally Hankel determinants where
the sum over all permutations reduces to a single signed permutation.
|
math.CO math.NT
|
we consider hankel determinants of the sequence of catalan numbers modulo 2 interpreted as integers 0 and 1 and more generally hankel determinants where the sum over all permutations reduces to a single signed permutation
|
[['we', 'consider', 'hankel', 'determinants', 'of', 'the', 'sequence', 'of', 'catalan', 'numbers', 'modulo', '2', 'interpreted', 'as', 'integers', '0', 'and', '1', 'and', 'more', 'generally', 'hankel', 'determinants', 'where', 'the', 'sum', 'over', 'all', 'permutations', 'reduces', 'to', 'a', 'single', 'signed', 'permutation']]
|
[-0.22069185829521823, 0.15932832027652433, 0.06478654239326716, 0.1283443386799523, -0.01899799451764141, -0.10351731223220538, 0.03979561680462211, 0.2919688142836094, -0.3530108494418008, -0.2604111772562776, 0.09227400929001825, -0.3150031143001148, -0.1981993726255106, 0.12093023431620427, -0.07114207257649728, 0.020637262176855336, 0.013000784934099232, 0.12493991394128118, -0.123677951416799, -0.30332400453543024, 0.3636549999671323, -0.06826440721218074, 0.1087218165397644, -0.017276424701724732, 0.04789321385324001, 0.03573381689244083, -0.041330406122973985, -0.07815241872199945, -0.03455458815608706, 0.03929949817912919, 0.2802563571504184, 0.2215113375868116, 0.26157597681241374, -0.3699451136535832, -0.036693834460207395, 0.26126930173486473, 0.25186029002070426, -0.09010591804981231, 0.03952067605277989, -0.2254952158911952, 0.14834074270911515, -0.21160369005519897, -0.055692296608218124, -0.05542436630598136, 0.107018538245133, 0.11459626709776265, -0.3621525795864207, 0.05903784882809435, 0.06977709284318345, 0.09902629264231239, 0.034233753635947196, -0.31822924731033186, 0.050006608851253985, 0.09521973876814757, 0.06624610526154616, -0.0007009755820035935, 0.008739720564335585, -0.05471324063837528, -0.1589484195624079, 0.3758916275309665, 0.002773385202246053, -0.2702735105263335, 0.006428270241511719, -0.2158167229699237, -0.17504841381950037, 0.15892021379300525, 0.06130121652302997, 0.19843915730182612, 0.026141120573239668, 0.04719840786752424, -0.1459458717544164, 0.1488150618704302, 0.23524465401257788, 0.011423372424074582, 0.1663881835660764, 0.013510601249124322, 0.053866966680756634, 0.18892880933625358, -0.0013114324770867824, -0.04782798616215587, -0.2869685832677143, -0.19224136379281326, -0.24169816739657626, 0.1773953334561416, -0.18380729814109925, -0.22499092080231223, 0.38127683241452487, 0.06860439245189939, 0.16297649004762726, 0.2495074452300157, 0.16300323914204326, 0.09409699679152773, 0.110495209853564, -0.028458764776587486, -0.07776291574617582, 0.23280902898737363, 0.0033989844411345463, -0.10871980695852211, -0.059436859137245585, 0.21327618956565858]
|
1,803.05165
|
Fast generalised linear models by database sampling and one-step
polishing
|
In this note, I show how to fit a generalised linear model to $N$
observations on $p$ variables stored in a relational database, using one
sampling query and one aggregation queries, as long as $N^{\frac{1}{2}+\delta}$
observations can be stored in memory. The resulting estimator is fully
efficient and asymptotically equivalent to the maximum likelihood estimator,
and so its variance can be estimated from the Fisher information in the usual
way. A proof-of-concept implementation uses R with MonetDB and with SQLite, and
could easily be adapted to other popular databases. I illustrate the approach
with examples of taxi-trip data in New York City and factors related to car
colour in New Zealand.
|
stat.CO
|
in this note i show how to fit a generalised linear model to n observations on p variables stored in a relational database using one sampling query and one aggregation queries as long as nfrac12delta observations can be stored in memory the resulting estimator is fully efficient and asymptotically equivalent to the maximum likelihood estimator and so its variance can be estimated from the fisher information in the usual way a proofofconcept implementation uses r with monetdb and with sqlite and could easily be adapted to other popular databases i illustrate the approach with examples of taxitrip data in new york city and factors related to car colour in new zealand
|
[['in', 'this', 'note', 'i', 'show', 'how', 'to', 'fit', 'a', 'generalised', 'linear', 'model', 'to', 'n', 'observations', 'on', 'p', 'variables', 'stored', 'in', 'a', 'relational', 'database', 'using', 'one', 'sampling', 'query', 'and', 'one', 'aggregation', 'queries', 'as', 'long', 'as', 'nfrac12delta', 'observations', 'can', 'be', 'stored', 'in', 'memory', 'the', 'resulting', 'estimator', 'is', 'fully', 'efficient', 'and', 'asymptotically', 'equivalent', 'to', 'the', 'maximum', 'likelihood', 'estimator', 'and', 'so', 'its', 'variance', 'can', 'be', 'estimated', 'from', 'the', 'fisher', 'information', 'in', 'the', 'usual', 'way', 'a', 'proofofconcept', 'implementation', 'uses', 'r', 'with', 'monetdb', 'and', 'with', 'sqlite', 'and', 'could', 'easily', 'be', 'adapted', 'to', 'other', 'popular', 'databases', 'i', 'illustrate', 'the', 'approach', 'with', 'examples', 'of', 'taxitrip', 'data', 'in', 'new', 'york', 'city', 'and', 'factors', 'related', 'to', 'car', 'colour', 'in', 'new', 'zealand']]
|
[-0.02341182055720769, 0.04754978049238887, -0.11737151420141202, 0.08650463106486639, -0.10833355939494224, -0.19949048949798587, 0.06569189831738385, 0.3843392977905417, -0.3059400698733986, -0.36479496340258816, 0.14390672155690098, -0.3021822698038379, -0.12180046894621753, 0.18282119895399915, -0.12987917818880956, 0.03531346907102238, 0.06781885232413273, 0.05172463813412149, -0.0204631456370474, -0.2967181354718402, 0.23302239687993712, 0.06687670761565549, 0.25842183435532273, -0.026749460295765498, 0.07522765681288555, -0.004381936116126973, -0.05388258432396987, 0.05730069014286503, -0.10098615679419984, 0.1388303199729566, 0.29165717206816316, 0.22847850469086284, 0.24559242582512558, -0.3846590655445711, -0.1432571161726336, 0.07458833209452552, 0.15811443699784405, 0.08992074211042614, 0.005875585548400264, -0.29036864272634916, 0.04292590099096767, -0.19836401052499583, -0.07162346427730464, -0.111492142337588, 0.014456953306537155, 0.02729612558977593, -0.3302064453328558, 0.0470616840105931, 0.01053446296756284, 0.027608690561231122, -0.0027016920257581893, -0.11900138599160469, 0.0010265924139033764, 0.07924398607702567, 0.023806160287034417, 0.03698676215685528, 0.10167356865873578, -0.05506317299970109, -0.139181848477098, 0.3573757788388554, -0.10015968614633819, -0.1865034679275587, 0.1280560828638562, -0.10174015607821559, -0.13789406912871252, 0.05710541163015803, 0.2006891338761315, 0.0924185482195553, -0.19280023525956028, 0.05761922955824866, -0.031893718680110546, 0.17016883692148765, 0.03384196784810821, 0.01988634862296215, 0.17021035003997043, 0.16123049402686365, 0.043586228175276735, 0.1500825236285524, -0.1157534513259392, -0.08017318417241268, -0.2708135783809041, -0.16172016429108219, -0.21122545798505665, 0.0090903891175729, -0.13953485226161444, -0.12866324871146215, 0.3611002785384382, 0.2090762587362439, 0.18783045070963578, 0.06034928251809757, 0.3050364328531224, 0.058532099134861196, 0.12310947188594883, 0.14820144373769745, 0.13579655143885164, 0.05630633753613321, 0.11102450239566078, -0.12611870307244633, 0.0845121908292106, 0.010957548924542348]
|
1,803.05166
|
1D Mott variable-range hopping with external field
|
Mott variable-range hopping is a fundamental mechanism for electron transport
in disordered solids in the regime of strong Anderson localization. We give a
brief description of this mechanism, recall some results concerning the
behavior of the conductivity at low temperature and describe in more detail
recent results (obtained in collaboration with N. Gantert and M. Salvi)
concerning the one-dimensional Mott variable-range hopping under an external
field.
|
math.PR math-ph math.MP
|
mott variablerange hopping is a fundamental mechanism for electron transport in disordered solids in the regime of strong anderson localization we give a brief description of this mechanism recall some results concerning the behavior of the conductivity at low temperature and describe in more detail recent results obtained in collaboration with n gantert and m salvi concerning the onedimensional mott variablerange hopping under an external field
|
[['mott', 'variablerange', 'hopping', 'is', 'a', 'fundamental', 'mechanism', 'for', 'electron', 'transport', 'in', 'disordered', 'solids', 'in', 'the', 'regime', 'of', 'strong', 'anderson', 'localization', 'we', 'give', 'a', 'brief', 'description', 'of', 'this', 'mechanism', 'recall', 'some', 'results', 'concerning', 'the', 'behavior', 'of', 'the', 'conductivity', 'at', 'low', 'temperature', 'and', 'describe', 'in', 'more', 'detail', 'recent', 'results', 'obtained', 'in', 'collaboration', 'with', 'n', 'gantert', 'and', 'm', 'salvi', 'concerning', 'the', 'onedimensional', 'mott', 'variablerange', 'hopping', 'under', 'an', 'external', 'field']]
|
[-0.18736951179766598, 0.23302970806051654, -0.029036295070097997, 0.03355786905516512, 0.022367205897059577, -0.20212000457999799, 0.08104850487926832, 0.3702737554907799, -0.23226426772486705, -0.2243051949601907, 0.012118502577336935, -0.30525826525229677, -0.17215688777729296, 0.19262875591834577, -0.025614116985637408, -0.004407937280260599, 0.004488639920376815, -0.01746769202156709, -0.06933951016802054, -0.24402568656592988, 0.26366825742790334, 0.06693528708643638, 0.2803038162107651, 0.1529155984762698, 0.008444727011598074, 0.09447608843732339, 0.06295198654182828, -0.0029770334179584795, -0.21787940871257047, 0.044137572726378076, 0.2331036823730056, -0.11564931683242322, 0.20790875208779022, -0.4302939237883458, -0.24657279970124363, -0.01925016430994639, 0.11991607713727997, 0.13929853811860085, -0.10651355946476822, -0.27242205261897584, 0.017534883968675367, -0.19973234904285234, -0.16219572714315011, -0.09183614286952294, 0.04039607500263418, 0.017977830978970114, -0.26769677236532935, 0.11895699147135019, 0.10493623091337773, 0.11467843696188468, -0.09981830602225203, -0.078117288219241, 0.041250520006108744, 0.07452030615307964, 0.06247729640095853, 0.05645103317040664, 0.09087480179822216, -0.1857642000899292, -0.12533779055632363, 0.3657533348752902, -0.06174699841783597, -0.08329850082787184, 0.23019149037561595, -0.22097113311577302, -0.09990417004491274, 0.1496274807705329, 0.09534124572976277, 0.06848434696976956, -0.1578023310105961, 0.12025559478878187, -0.08293330568390397, 0.09649403139617509, -0.0016650002199010208, 0.09149549190814678, 0.19963276111162626, 0.24382932415375344, 0.021020174442002406, 0.1364193482969243, -0.05486028727609664, -0.0927033231450388, -0.2655717259702774, -0.11650431244992293, -0.2127307255501644, 0.09782726405045161, -0.08291053990430486, -0.16237204001786618, 0.41878720679535314, 0.1871789292504008, 0.22882036649836943, 0.006069280121188897, 0.19344742078907215, 0.13656429745830023, -0.06643971925458082, 0.03675094721480631, 0.19162796412890132, 0.16926418538205326, 0.1806796647930661, -0.26474509648262307, 0.008923915954521642, 0.11064821410064514]
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.