id float64 706 1.8k | title stringlengths 1 343 | abstract stringlengths 6 6.09k | categories stringlengths 5 125 | processed_abstract stringlengths 2 5.96k | tokenized_abstract stringlengths 8 8.74k | centroid stringlengths 2.1k 2.17k |
|---|---|---|---|---|---|---|
1,802.0746 | Learning Image Conditioned Label Space for Multilabel Classification | This work addresses the task of multilabel image classification. Inspired by
the great success from deep convolutional neural networks (CNNs) for
single-label visual-semantic embedding, we exploit extending these models for
multilabel images. Specifically, we propose an image-dependent ranking model,
which returns a ranked list of labels according to its relevance to the input
image. In contrast to conventional CNN models that learn an image
representation (i.e. the image embedding vector), the developed model learns a
mapping (i.e. a transformation matrix) from an image in an attempt to
differentiate between its relevant and irrelevant labels. Despite the
conceptual simplicity of our approach, experimental results on a public
benchmark dataset demonstrate that the proposed model achieves state-of-the-art
performance while using fewer training images than other multilabel
classification methods.
| cs.CV | this work addresses the task of multilabel image classification inspired by the great success from deep convolutional neural networks cnns for singlelabel visualsemantic embedding we exploit extending these models for multilabel images specifically we propose an imagedependent ranking model which returns a ranked list of labels according to its relevance to the input image in contrast to conventional cnn models that learn an image representation ie the image embedding vector the developed model learns a mapping ie a transformation matrix from an image in an attempt to differentiate between its relevant and irrelevant labels despite the conceptual simplicity of our approach experimental results on a public benchmark dataset demonstrate that the proposed model achieves stateoftheart performance while using fewer training images than other multilabel classification methods | [['this', 'work', 'addresses', 'the', 'task', 'of', 'multilabel', 'image', 'classification', 'inspired', 'by', 'the', 'great', 'success', 'from', 'deep', 'convolutional', 'neural', 'networks', 'cnns', 'for', 'singlelabel', 'visualsemantic', 'embedding', 'we', 'exploit', 'extending', 'these', 'models', 'for', 'multilabel', 'images', 'specifically', 'we', 'propose', 'an', 'imagedependent', 'ranking', 'model', 'which', 'returns', 'a', 'ranked', 'list', 'of', 'labels', 'according', 'to', 'its', 'relevance', 'to', 'the', 'input', 'image', 'in', 'contrast', 'to', 'conventional', 'cnn', 'models', 'that', 'learn', 'an', 'image', 'representation', 'ie', 'the', 'image', 'embedding', 'vector', 'the', 'developed', 'model', 'learns', 'a', 'mapping', 'ie', 'a', 'transformation', 'matrix', 'from', 'an', 'image', 'in', 'an', 'attempt', 'to', 'differentiate', 'between', 'its', 'relevant', 'and', 'irrelevant', 'labels', 'despite', 'the', 'conceptual', 'simplicity', 'of', 'our', 'approach', 'experimental', 'results', 'on', 'a', 'public', 'benchmark', 'dataset', 'demonstrate', 'that', 'the', 'proposed', 'model', 'achieves', 'stateoftheart', 'performance', 'while', 'using', 'fewer', 'training', 'images', 'than', 'other', 'multilabel', 'classification', 'methods']] | [0.03271160930735133, -0.08818004875294198, -0.036114753262760736, 0.06586094503568131, -0.1204726308628562, -0.19589893246764348, 0.030431416595265978, 0.48717877225920797, -0.2792835305777511, -0.3363193172766524, 0.03196768488620393, -0.30291456331513705, -0.21873808938950773, 0.16354155913549698, -0.18207081992526553, 0.09453226519390083, 0.1638577052665549, 0.08420482694747902, -0.11003954214088264, -0.33039595891854595, 0.3079347003025875, 0.03930932629482991, 0.39190032456203233, -0.01881082101710259, 0.16556521215003042, -0.030789727832482655, -0.05768707039995149, -0.037046006129140364, -0.01870069429446991, 0.22233116667392472, 0.3287555879092935, 0.22808866517337423, 0.3202255161678685, -0.37010550324524205, -0.25766793762459345, 0.10487414692853769, 0.1215829266575239, 0.10744786958879096, -0.04884510379125704, -0.3962985795741487, 0.08489648826671617, -0.17040629013042366, 0.09207554379781147, -0.17535039535095354, -0.03460424848913496, -0.08805294224062919, -0.29593268436534953, 0.020410620631544533, 0.11240510090664473, 0.043143289932419386, -0.10192576196092727, -0.105852891302978, 0.02548439666769275, 0.17473469421799695, 0.02958762865986616, 0.11389397772856885, 0.09869421602481798, -0.2746267642933018, -0.17421133553199025, 0.37999401764116353, -0.03779553283351965, -0.22055431001908368, 0.2039484247557878, 0.025903748383464677, -0.1382589188084701, 0.09282982553399745, 0.24597780404257633, 0.11037347094148457, -0.14655383194645216, -0.006499876483022014, -0.104757368413081, 0.2117086227961062, 0.03933651540945801, -0.0455495261084584, 0.18042074057960972, 0.2985383600868758, -0.017932686788429106, 0.15724787349112346, -0.17468810864051598, -0.04246970983998229, -0.183316538169507, -0.07937354871786997, -0.22666961387435478, -0.03676439008753126, -0.13798858910521386, -0.13105801500471045, 0.4525970688001031, 0.3057278521092875, 0.2644999756899086, 0.1490562219507179, 0.3551926766152656, -0.014013571604635448, 0.1479012872413954, 0.06859765461385472, 0.152989585004333, 0.01846279795392461, 0.07339815235011177, -0.12593576883793706, 0.05797444504781789, 0.1113556942732502] |
1,802.07461 | Emergence of Structured Behaviors from Curiosity-Based Intrinsic
Motivation | Infants are experts at playing, with an amazing ability to generate novel
structured behaviors in unstructured environments that lack clear extrinsic
reward signals. We seek to replicate some of these abilities with a neural
network that implements curiosity-driven intrinsic motivation. Using a simple
but ecologically naturalistic simulated environment in which the agent can move
and interact with objects it sees, the agent learns a world model predicting
the dynamic consequences of its actions. Simultaneously, the agent learns to
take actions that adversarially challenge the developing world model, pushing
the agent to explore novel and informative interactions with its environment.
We demonstrate that this policy leads to the self-supervised emergence of a
spectrum of complex behaviors, including ego motion prediction, object
attention, and object gathering. Moreover, the world model that the agent
learns supports improved performance on object dynamics prediction and
localization tasks. Our results are a proof-of-principle that computational
models of intrinsic motivation might account for key features of developmental
visuomotor learning in infants.
| cs.LG cs.AI cs.CV stat.ML | infants are experts at playing with an amazing ability to generate novel structured behaviors in unstructured environments that lack clear extrinsic reward signals we seek to replicate some of these abilities with a neural network that implements curiositydriven intrinsic motivation using a simple but ecologically naturalistic simulated environment in which the agent can move and interact with objects it sees the agent learns a world model predicting the dynamic consequences of its actions simultaneously the agent learns to take actions that adversarially challenge the developing world model pushing the agent to explore novel and informative interactions with its environment we demonstrate that this policy leads to the selfsupervised emergence of a spectrum of complex behaviors including ego motion prediction object attention and object gathering moreover the world model that the agent learns supports improved performance on object dynamics prediction and localization tasks our results are a proofofprinciple that computational models of intrinsic motivation might account for key features of developmental visuomotor learning in infants | [['infants', 'are', 'experts', 'at', 'playing', 'with', 'an', 'amazing', 'ability', 'to', 'generate', 'novel', 'structured', 'behaviors', 'in', 'unstructured', 'environments', 'that', 'lack', 'clear', 'extrinsic', 'reward', 'signals', 'we', 'seek', 'to', 'replicate', 'some', 'of', 'these', 'abilities', 'with', 'a', 'neural', 'network', 'that', 'implements', 'curiositydriven', 'intrinsic', 'motivation', 'using', 'a', 'simple', 'but', 'ecologically', 'naturalistic', 'simulated', 'environment', 'in', 'which', 'the', 'agent', 'can', 'move', 'and', 'interact', 'with', 'objects', 'it', 'sees', 'the', 'agent', 'learns', 'a', 'world', 'model', 'predicting', 'the', 'dynamic', 'consequences', 'of', 'its', 'actions', 'simultaneously', 'the', 'agent', 'learns', 'to', 'take', 'actions', 'that', 'adversarially', 'challenge', 'the', 'developing', 'world', 'model', 'pushing', 'the', 'agent', 'to', 'explore', 'novel', 'and', 'informative', 'interactions', 'with', 'its', 'environment', 'we', 'demonstrate', 'that', 'this', 'policy', 'leads', 'to', 'the', 'selfsupervised', 'emergence', 'of', 'a', 'spectrum', 'of', 'complex', 'behaviors', 'including', 'ego', 'motion', 'prediction', 'object', 'attention', 'and', 'object', 'gathering', 'moreover', 'the', 'world', 'model', 'that', 'the', 'agent', 'learns', 'supports', 'improved', 'performance', 'on', 'object', 'dynamics', 'prediction', 'and', 'localization', 'tasks', 'our', 'results', 'are', 'a', 'proofofprinciple', 'that', 'computational', 'models', 'of', 'intrinsic', 'motivation', 'might', 'account', 'for', 'key', 'features', 'of', 'developmental', 'visuomotor', 'learning', 'in', 'infants']] | [-0.05591516671759054, 0.0683578315551042, -0.10564888740652638, 0.07312995548893857, -0.1682728489452019, -0.20184759120740814, 0.042484599191882855, 0.48089516476341865, -0.25213365278206057, -0.34333840527617165, 0.022904626736218656, -0.2716441549880362, -0.25160090114762323, 0.13874289378802088, -0.1509907661522625, 0.009571042095691465, 0.11056959665616088, 0.06288288054965073, 0.031988745086780956, -0.23154709241764687, 0.2954608714577129, 0.045800357128538915, 0.28067592694140153, -0.02008360710063177, 0.18133340822816713, -0.020645441742977354, 0.012309470798155838, -0.018305351452975783, -0.010555312583963358, 0.18363959490457868, 0.3235036063276378, 0.19258000634088204, 0.3450158645807788, -0.4414307183086327, -0.2381960418722706, 0.09322684606190816, 0.09701546658257806, 0.11497987954374743, -0.06540450941921756, -0.3779984276469161, 0.06112577507510872, -0.17049920274137814, -0.07737938770115739, -0.1378234679890206, -0.002853853964508034, -0.0387782862260171, -0.28351776970823, -0.005194419313494752, 0.08239011745296544, 0.050889975929394274, -0.10113697277847677, -0.055650431870073985, 0.01257195916571995, 0.26879464097820766, 0.05274955309194899, 0.028878172419442818, 0.21896807066159232, -0.22588636931110026, -0.17458894499861521, 0.3793289435845686, -0.00467660982252621, -0.18448360287016485, 0.2628447251598828, -0.08095069606390941, -0.1317147828905457, 0.0967353703212788, 0.25472974167886847, 0.08133864600677043, -0.1440532702992375, -0.0011023415476878787, -0.030982177997385604, 0.17669560637207213, -0.025302843139620453, -0.010054171680921415, 0.23565054657761145, 0.25528458433180323, 0.01304916654878137, 0.10058500404929652, -0.06209640168988078, -0.13976847831296121, -0.20992565484505954, -0.09553311329914212, -0.14399506695420913, 0.016677944896822203, -0.09469612831180269, -0.11966332025178594, 0.4071397702834319, 0.26448957900596193, 0.22480728558446395, 0.11862783926814545, 0.3188536627808722, -0.006713931399778031, 0.07124043605006414, 0.08023746317911257, 0.17089590024030568, -0.03383686588282084, 0.12606936277787587, -0.20498365598798887, 0.16444541456563988, 0.004951070460331876] |
1,802.07462 | An Information-Theoretical Analysis of the Minimum Cost to Erase
Information | We normally hold a lot of confidential information in hard disk drives and
solid-state drives. When we want to erase such information to prevent the
leakage, we have to overwrite the sequence of information with a sequence of
symbols independent of the information. The overwriting is needed only at
places where overwritten symbols are different from original symbols. Then, the
cost of overwrites such as the number of overwritten symbols to erase
information is important. In this paper, we clarify the minimum cost such as
the minimum number of overwrites to erase information under weak and strong
independence criteria. The former (resp. the latter) criterion represents that
the mutual information between the original sequence and the overwritten
sequence normalized (resp. not normalized) by the length of the sequences is
less than a given desired value.
| cs.IT math.IT | we normally hold a lot of confidential information in hard disk drives and solidstate drives when we want to erase such information to prevent the leakage we have to overwrite the sequence of information with a sequence of symbols independent of the information the overwriting is needed only at places where overwritten symbols are different from original symbols then the cost of overwrites such as the number of overwritten symbols to erase information is important in this paper we clarify the minimum cost such as the minimum number of overwrites to erase information under weak and strong independence criteria the former resp the latter criterion represents that the mutual information between the original sequence and the overwritten sequence normalized resp not normalized by the length of the sequences is less than a given desired value | [['we', 'normally', 'hold', 'a', 'lot', 'of', 'confidential', 'information', 'in', 'hard', 'disk', 'drives', 'and', 'solidstate', 'drives', 'when', 'we', 'want', 'to', 'erase', 'such', 'information', 'to', 'prevent', 'the', 'leakage', 'we', 'have', 'to', 'overwrite', 'the', 'sequence', 'of', 'information', 'with', 'a', 'sequence', 'of', 'symbols', 'independent', 'of', 'the', 'information', 'the', 'overwriting', 'is', 'needed', 'only', 'at', 'places', 'where', 'overwritten', 'symbols', 'are', 'different', 'from', 'original', 'symbols', 'then', 'the', 'cost', 'of', 'overwrites', 'such', 'as', 'the', 'number', 'of', 'overwritten', 'symbols', 'to', 'erase', 'information', 'is', 'important', 'in', 'this', 'paper', 'we', 'clarify', 'the', 'minimum', 'cost', 'such', 'as', 'the', 'minimum', 'number', 'of', 'overwrites', 'to', 'erase', 'information', 'under', 'weak', 'and', 'strong', 'independence', 'criteria', 'the', 'former', 'resp', 'the', 'latter', 'criterion', 'represents', 'that', 'the', 'mutual', 'information', 'between', 'the', 'original', 'sequence', 'and', 'the', 'overwritten', 'sequence', 'normalized', 'resp', 'not', 'normalized', 'by', 'the', 'length', 'of', 'the', 'sequences', 'is', 'less', 'than', 'a', 'given', 'desired', 'value']] | [-0.14734193116288494, 0.09926774056145439, -0.05494940282638978, 0.08195936549627394, -0.09465246985287026, -0.14442193464686473, 0.08262035337199146, 0.33455362701788544, -0.3321196897507266, -0.30902376654385416, 0.12549358049571446, -0.3153163378644321, -0.10370392764194145, 0.14057204763370532, -0.1366175621851451, 0.031010451679186965, 0.01898053595451293, 0.1440785952878219, -0.0551613636220012, -0.2564411074388772, 0.3245991231614931, 0.06209748018257044, 0.23250360484752391, 0.01841481599139688, 0.10112405535242201, 0.04395944317231489, -0.039386153783373255, -0.03900052112423712, -0.12854555253207864, 0.08035091860219837, 0.23972912954373493, 0.20050185212937693, 0.3087620793600325, -0.43246918998106765, -0.15683519406485613, 0.1841707990332334, 0.11796874612638795, 0.11602581988468215, 0.007949796815713247, -0.20927170240492732, 0.1645484370972823, -0.10421011997386813, -0.02155163975570489, -0.011109610746994063, 0.0018705655303266314, 0.032542586164480004, -0.298412414678131, 0.03972483584312377, 0.10527275157747445, 0.035807116840172695, 0.005271151727410378, -0.08685762092333149, -0.06479293183871994, 0.21393422911016927, 0.05018824302349929, 0.06421405166749738, 0.10653366505478819, -0.11335399664628008, -0.03329730880688186, 0.3279645061189378, -0.02709481189495246, -0.1940370889449561, 0.13959961457876488, -0.11865664309028674, -0.10953497198168878, 0.1263748878095713, 0.13904594786603142, 0.08799197917666149, -0.1215448982596475, 0.005654853115427411, -0.021637080720177403, 0.2325183014212935, 0.10736041559182384, 0.16267285737795412, 0.21507829162119715, 0.07569451626752399, 0.08871700847348957, 0.17720503547677288, -0.06992633688367075, -0.08330430520043053, -0.29600728405294596, -0.16846098861963213, -0.22309442810990193, 0.04713543007264552, -0.0889866250650138, -0.1296254792060979, 0.3330590936562253, 0.175910390375389, 0.20962548310075094, 0.05246886267775187, 0.32255117055718546, 0.10030914892925433, 0.09624426299595615, 0.10562794544147673, 0.149854957126081, 0.11872062489166166, 0.08401707947012726, -0.1820074629780181, 0.1270737121226611, 0.04658956389736246] |
1,802.07463 | X-ray and Gamma-ray Observations of the Fermi Bubbles and NPS/Loop I
Structures | The Fermi bubbles were possibly created by large injections of energy into
the Galactic Center (GC), either by an active galactic nucleus (AGN) or by
nuclear starburst more than ~10 Myr ago. However, the origin of the diffuse
gamma-ray emission associated with Loop I, a radio continuum loop spanning
across 100 deg on the sky, is still being debated. The northern-most part of
Loop I, known as the North Polar Spur (NPS), is the brightest arm and is even
clearly visible in the ROSAT X-ray sky map. In this paper, we present a
comprehensive review on the X-ray observations of the Fermi bubbles and their
possible association with the NPS and Loop I structures. Using uniform analysis
of archival Suzaku and Swift data, we show that X-ray plasma with kT ~ 0.3 keV
and low metal abundance (Z ~ 0.2 Z_solar) is ubiquitous in both the bubbles and
Loop I and is naturally interpreted as weakly shock-heated Galactic halo gas.
However, the observed asymmetry of the X-ray-emitting gas above and below the
GC has still not been resolved; it cannot be fully explained by the inclination
of the axis of the Fermi bubbles to the Galactic disk normal. We argue that the
NPS and Loop I may be asymmetric remnants of a large explosion that occurred
before the event that created the Fermi bubbles, and that the soft gamma-ray
emission from Loop I may be due to either pi^0 decay of accelerated protons or
electron bremsstrahlung.
| astro-ph.HE | the fermi bubbles were possibly created by large injections of energy into the galactic center gc either by an active galactic nucleus agn or by nuclear starburst more than 10 myr ago however the origin of the diffuse gammaray emission associated with loop i a radio continuum loop spanning across 100 deg on the sky is still being debated the northernmost part of loop i known as the north polar spur nps is the brightest arm and is even clearly visible in the rosat xray sky map in this paper we present a comprehensive review on the xray observations of the fermi bubbles and their possible association with the nps and loop i structures using uniform analysis of archival suzaku and swift data we show that xray plasma with kt 03 kev and low metal abundance z 02 z_solar is ubiquitous in both the bubbles and loop i and is naturally interpreted as weakly shockheated galactic halo gas however the observed asymmetry of the xrayemitting gas above and below the gc has still not been resolved it cannot be fully explained by the inclination of the axis of the fermi bubbles to the galactic disk normal we argue that the nps and loop i may be asymmetric remnants of a large explosion that occurred before the event that created the fermi bubbles and that the soft gammaray emission from loop i may be due to either pi0 decay of accelerated protons or electron bremsstrahlung | [['the', 'fermi', 'bubbles', 'were', 'possibly', 'created', 'by', 'large', 'injections', 'of', 'energy', 'into', 'the', 'galactic', 'center', 'gc', 'either', 'by', 'an', 'active', 'galactic', 'nucleus', 'agn', 'or', 'by', 'nuclear', 'starburst', 'more', 'than', '10', 'myr', 'ago', 'however', 'the', 'origin', 'of', 'the', 'diffuse', 'gammaray', 'emission', 'associated', 'with', 'loop', 'i', 'a', 'radio', 'continuum', 'loop', 'spanning', 'across', '100', 'deg', 'on', 'the', 'sky', 'is', 'still', 'being', 'debated', 'the', 'northernmost', 'part', 'of', 'loop', 'i', 'known', 'as', 'the', 'north', 'polar', 'spur', 'nps', 'is', 'the', 'brightest', 'arm', 'and', 'is', 'even', 'clearly', 'visible', 'in', 'the', 'rosat', 'xray', 'sky', 'map', 'in', 'this', 'paper', 'we', 'present', 'a', 'comprehensive', 'review', 'on', 'the', 'xray', 'observations', 'of', 'the', 'fermi', 'bubbles', 'and', 'their', 'possible', 'association', 'with', 'the', 'nps', 'and', 'loop', 'i', 'structures', 'using', 'uniform', 'analysis', 'of', 'archival', 'suzaku', 'and', 'swift', 'data', 'we', 'show', 'that', 'xray', 'plasma', 'with', 'kt', '03', 'kev', 'and', 'low', 'metal', 'abundance', 'z', '02', 'z_solar', 'is', 'ubiquitous', 'in', 'both', 'the', 'bubbles', 'and', 'loop', 'i', 'and', 'is', 'naturally', 'interpreted', 'as', 'weakly', 'shockheated', 'galactic', 'halo', 'gas', 'however', 'the', 'observed', 'asymmetry', 'of', 'the', 'xrayemitting', 'gas', 'above', 'and', 'below', 'the', 'gc', 'has', 'still', 'not', 'been', 'resolved', 'it', 'can', 'not', 'be', 'fully', 'explained', 'by', 'the', 'inclination', 'of', 'the', 'axis', 'of', 'the', 'fermi', 'bubbles', 'to', 'the', 'galactic', 'disk', 'normal', 'we', 'argue', 'that', 'the', 'nps', 'and', 'loop', 'i', 'may', 'be', 'asymmetric', 'remnants', 'of', 'a', 'large', 'explosion', 'that', 'occurred', 'before', 'the', 'event', 'that', 'created', 'the', 'fermi', 'bubbles', 'and', 'that', 'the', 'soft', 'gammaray', 'emission', 'from', 'loop', 'i', 'may', 'be', 'due', 'to', 'either', 'pi0', 'decay', 'of', 'accelerated', 'protons', 'or', 'electron', 'bremsstrahlung']] | [-0.05500515375609453, 0.1873105090905613, -0.04044843196146646, 0.12724591358992443, -0.09341496950234002, -0.07804272776488595, 0.05963267383251187, 0.4570908060154821, -0.22154281012029672, -0.30301583809683064, 0.07384251668688138, -0.3212132137344808, -0.010048036294400084, 0.18139124160789297, -0.003454378745233526, -0.08481043650559625, 0.029000513890416038, -0.07584269472530909, -0.016949320772938353, -0.2202200007948036, 0.2880542362545978, 0.11982903240429124, 0.16470284352307113, 0.03802585561753236, 0.08208490782892522, -0.09324858718437656, -0.04315077926683221, 0.015623995021213682, -0.07808442965279956, 0.05663773488462427, 0.23207575707430286, 0.08714740278498669, 0.1673382531262326, -0.40089740915490046, -0.22162974590093507, 0.06263658880702772, 0.22110838282625286, -0.009433691659870994, -0.06525512664865142, -0.28626153994807785, 0.04467294907995633, -0.21209432291133062, -0.1818413466923129, 0.07418230433511186, 0.021205902576674613, 0.017220871449847307, -0.1392626102139451, 0.1312272561395693, 0.04819481164521101, 0.07068415202998689, -0.10956151521935754, -0.08493565905801191, -0.027109451021295878, 0.04062775574358446, 0.07111383626256518, 0.10515963175162978, 0.21081239373591842, -0.13213265792048556, -0.07116246803530625, 0.3922884173230363, -0.028970024242479835, 0.030363074224442243, 0.20028009695447602, -0.26435279313626947, -0.15268494467802193, 0.21903112976697786, 0.1167508997260688, 0.07436852360415101, -0.1594779469215368, 0.05978718725453625, -0.044084253448194693, 0.20145560094602025, 0.051187175678621445, -0.001995743234280725, 0.31410689480811815, 0.10073835827286678, 0.02976041226932893, 0.12093864595089868, -0.2742616002103706, -0.044754491978543524, -0.26787797177438527, -0.09193367052215094, -0.1266920408062941, 0.08788773851547561, -0.0694612259571488, -0.13661226257681847, 0.34615908903164827, 0.05008538028187289, 0.224319897188653, -0.04468551034509318, 0.31494609190730793, 0.050675930610230686, 0.09904591283875004, 0.15430232490013754, 0.3239172050311249, 0.12227232140317863, 0.09243545106954264, -0.21506103844149038, 0.0830861638566213, -0.012914929033390114] |
1,802.07464 | Meta-screening and permanence of polar distortion in metallized
ferroelectrics | Ferroelectric materials are characterized by a spontaneous polar distortion.
The behavior of such distortions in the presence of free charge is the key to
the physics of metallized ferroelectrics in particular, and of
structurally-polar metals more generally. Using first-principles simulations,
here we show that a polar distortion resists metallization and the attendant
suppression of long-range dipolar interactions in the vast majority of a sample
of 11 representative ferroelectrics. We identify a meta-screening effect,
occurring in the doped compounds as a consequence of the charge rearrangements
associated to electrostatic screening, as the main factor determining the
survival of a non-centrosymmetric phase. Our findings advance greatly our
understanding of the essentials of structurally-polar metals, and offer
guidelines on the behavior of ferroelectrics upon field-effect charge injection
or proximity to conductive device elements.
| cond-mat.mtrl-sci | ferroelectric materials are characterized by a spontaneous polar distortion the behavior of such distortions in the presence of free charge is the key to the physics of metallized ferroelectrics in particular and of structurallypolar metals more generally using firstprinciples simulations here we show that a polar distortion resists metallization and the attendant suppression of longrange dipolar interactions in the vast majority of a sample of 11 representative ferroelectrics we identify a metascreening effect occurring in the doped compounds as a consequence of the charge rearrangements associated to electrostatic screening as the main factor determining the survival of a noncentrosymmetric phase our findings advance greatly our understanding of the essentials of structurallypolar metals and offer guidelines on the behavior of ferroelectrics upon fieldeffect charge injection or proximity to conductive device elements | [['ferroelectric', 'materials', 'are', 'characterized', 'by', 'a', 'spontaneous', 'polar', 'distortion', 'the', 'behavior', 'of', 'such', 'distortions', 'in', 'the', 'presence', 'of', 'free', 'charge', 'is', 'the', 'key', 'to', 'the', 'physics', 'of', 'metallized', 'ferroelectrics', 'in', 'particular', 'and', 'of', 'structurallypolar', 'metals', 'more', 'generally', 'using', 'firstprinciples', 'simulations', 'here', 'we', 'show', 'that', 'a', 'polar', 'distortion', 'resists', 'metallization', 'and', 'the', 'attendant', 'suppression', 'of', 'longrange', 'dipolar', 'interactions', 'in', 'the', 'vast', 'majority', 'of', 'a', 'sample', 'of', '11', 'representative', 'ferroelectrics', 'we', 'identify', 'a', 'metascreening', 'effect', 'occurring', 'in', 'the', 'doped', 'compounds', 'as', 'a', 'consequence', 'of', 'the', 'charge', 'rearrangements', 'associated', 'to', 'electrostatic', 'screening', 'as', 'the', 'main', 'factor', 'determining', 'the', 'survival', 'of', 'a', 'noncentrosymmetric', 'phase', 'our', 'findings', 'advance', 'greatly', 'our', 'understanding', 'of', 'the', 'essentials', 'of', 'structurallypolar', 'metals', 'and', 'offer', 'guidelines', 'on', 'the', 'behavior', 'of', 'ferroelectrics', 'upon', 'fieldeffect', 'charge', 'injection', 'or', 'proximity', 'to', 'conductive', 'device', 'elements']] | [-0.16765791777953118, 0.16325235668951132, -0.014281158975791186, 0.02537197980197425, -0.032537260525456566, -0.07321904435768489, 0.1085284710036752, 0.364425936574483, -0.25802186370541264, -0.27464019375904575, 0.012788169749638461, -0.30652969724711354, -0.19666792297787142, 0.17626397432869403, -0.015572329506454036, -0.023425049807575687, -0.06814062916268672, -0.06186778702604489, -0.10617786120462018, -0.17631064595903936, 0.2659123338206431, 0.06210580610442819, 0.31676886323472764, 0.09306728540311061, 0.01644906072371353, -0.01782073057027475, 0.07233279853633891, 0.04591853975311039, -0.12831093965486237, 0.09865194451481867, 0.2540975702893517, -0.04881859248628708, 0.23384681814093525, -0.46420544466547126, -0.26354012235551777, 0.013675662776909944, 0.10307040047560503, 0.1553776151927804, -0.14101202347039477, -0.23774645630798236, 0.07569219897625835, -0.14629022687248242, -0.12391232127162415, -0.08089588523116403, -0.012259980337327624, 0.054412315442413824, -0.24651457733056675, 0.09178281893154357, 0.11794237511353493, 0.07427702980541338, -0.11617635116054434, -0.12182678555424406, -0.0448661405981819, 0.08456964013863384, 0.06955503046651935, 0.03774097380155008, 0.21081650395708995, -0.14841605227909924, -0.12349468938947662, 0.4277448237499618, -0.011517704116165872, -0.10700507550023672, 0.18056997375821285, -0.19632593513371085, -0.06392702287590997, 0.16121554169730526, 0.15959144105372114, 0.11516555286503917, -0.13233197784769957, 0.03721542775082791, 0.034851285354665106, 0.16696694157430975, 0.010040878049669948, 0.1160327097819018, 0.24364022319901765, 0.23183710306450198, -0.002983010806671278, 0.14675158245386336, -0.10092170908462758, -0.052172585267676264, -0.2767517389653995, -0.20235496639516057, -0.21098230397108736, 0.0739515804736985, -0.08699093277093599, -0.2298788668983799, 0.4096048518384653, 0.15122585806731634, 0.13555362924207442, -0.07012424448378546, 0.2432697658375727, 0.01743219781842992, 0.11397305600286468, -0.03296355778850087, 0.2607142044630958, 0.1354371233912933, 0.06970639495677718, -0.28695272153067425, 0.13860772405274388, 0.010739254062137325] |
1,802.07465 | Multiclass Weighted Loss for Instance Segmentation of Cluttered Cells | We propose a new multiclass weighted loss function for instance segmentation
of cluttered cells. We are primarily motivated by the need of developmental
biologists to quantify and model the behavior of blood T-cells which might help
us in understanding their regulation mechanisms and ultimately help researchers
in their quest for developing an effective immuno-therapy cancer treatment.
Segmenting individual touching cells in cluttered regions is challenging as the
feature distribution on shared borders and cell foreground are similar thus
difficulting discriminating pixels into proper classes. We present two novel
weight maps applied to the weighted cross entropy loss function which take into
account both class imbalance and cell geometry. Binary ground truth training
data is augmented so the learning model can handle not only foreground and
background but also a third touching class. This framework allows training
using U-Net. Experiments with our formulations have shown superior results when
compared to other similar schemes, outperforming binary class models with
significant improvement of boundary adequacy and instance detection. We
validate our results on manually annotated microscope images of T-cells.
| cs.CV | we propose a new multiclass weighted loss function for instance segmentation of cluttered cells we are primarily motivated by the need of developmental biologists to quantify and model the behavior of blood tcells which might help us in understanding their regulation mechanisms and ultimately help researchers in their quest for developing an effective immunotherapy cancer treatment segmenting individual touching cells in cluttered regions is challenging as the feature distribution on shared borders and cell foreground are similar thus difficulting discriminating pixels into proper classes we present two novel weight maps applied to the weighted cross entropy loss function which take into account both class imbalance and cell geometry binary ground truth training data is augmented so the learning model can handle not only foreground and background but also a third touching class this framework allows training using unet experiments with our formulations have shown superior results when compared to other similar schemes outperforming binary class models with significant improvement of boundary adequacy and instance detection we validate our results on manually annotated microscope images of tcells | [['we', 'propose', 'a', 'new', 'multiclass', 'weighted', 'loss', 'function', 'for', 'instance', 'segmentation', 'of', 'cluttered', 'cells', 'we', 'are', 'primarily', 'motivated', 'by', 'the', 'need', 'of', 'developmental', 'biologists', 'to', 'quantify', 'and', 'model', 'the', 'behavior', 'of', 'blood', 'tcells', 'which', 'might', 'help', 'us', 'in', 'understanding', 'their', 'regulation', 'mechanisms', 'and', 'ultimately', 'help', 'researchers', 'in', 'their', 'quest', 'for', 'developing', 'an', 'effective', 'immunotherapy', 'cancer', 'treatment', 'segmenting', 'individual', 'touching', 'cells', 'in', 'cluttered', 'regions', 'is', 'challenging', 'as', 'the', 'feature', 'distribution', 'on', 'shared', 'borders', 'and', 'cell', 'foreground', 'are', 'similar', 'thus', 'difficulting', 'discriminating', 'pixels', 'into', 'proper', 'classes', 'we', 'present', 'two', 'novel', 'weight', 'maps', 'applied', 'to', 'the', 'weighted', 'cross', 'entropy', 'loss', 'function', 'which', 'take', 'into', 'account', 'both', 'class', 'imbalance', 'and', 'cell', 'geometry', 'binary', 'ground', 'truth', 'training', 'data', 'is', 'augmented', 'so', 'the', 'learning', 'model', 'can', 'handle', 'not', 'only', 'foreground', 'and', 'background', 'but', 'also', 'a', 'third', 'touching', 'class', 'this', 'framework', 'allows', 'training', 'using', 'unet', 'experiments', 'with', 'our', 'formulations', 'have', 'shown', 'superior', 'results', 'when', 'compared', 'to', 'other', 'similar', 'schemes', 'outperforming', 'binary', 'class', 'models', 'with', 'significant', 'improvement', 'of', 'boundary', 'adequacy', 'and', 'instance', 'detection', 'we', 'validate', 'our', 'results', 'on', 'manually', 'annotated', 'microscope', 'images', 'of', 'tcells']] | [-0.025484010415550852, 0.04129534377392182, -0.037352014492665016, 0.09581686680670827, -0.11546520431126867, -0.1857601669718445, 0.07126597986656374, 0.4291957657012556, -0.22909210164366023, -0.3408621168685412, 0.04005950848505433, -0.27995406362103364, -0.18457682345062495, 0.18112022236787848, -0.17485856844112277, 0.06454518121800253, 0.1270264686504379, -0.011597301039312566, 0.003805577675146716, -0.26900704853037105, 0.2936143853355731, 0.032512406589729446, 0.3358371507429651, 0.03340705961255091, 0.10402661026388939, -0.035200401918430414, -0.048550648745149375, 0.04333719813397952, -0.06292774037458003, 0.1648205521343542, 0.31299712813286795, 0.17014710958780987, 0.31146014771291186, -0.4319788780595575, -0.25397844988985785, 0.1364948629853981, 0.1515992581977376, 0.10843788510853691, -0.04207387349036123, -0.3255929962665375, 0.07552417290064373, -0.14992905199128603, -0.030868649780750275, -0.12977592875515775, -0.03657790754722165, -0.011794976172054054, -0.2803221337736717, 0.05634288363857195, 0.05293826257676951, 0.057342205148722444, -0.13987664256677299, -0.13578383156364518, 0.009622194463653224, 0.20889825547862398, 0.02063415115366557, 0.041569793383990014, 0.1539507948753557, -0.18268127280553537, -0.10488129349691527, 0.3519089066929051, -0.0009370344238621848, -0.24472806494683028, 0.22453134716155806, -0.09341726190011417, -0.12310550754490708, 0.12647529670436466, 0.2260225067101419, 0.12298470750184996, -0.1856486193799979, -0.018641292351031943, -0.004102266054999615, 0.15467106768329228, 0.07899159868380853, -0.016807154537860438, 0.2157625110474016, 0.22203071121791643, 0.024482565456668715, 0.1573245416984095, -0.15431067371873983, -0.07199079958455903, -0.2383550808365856, -0.11905991826206445, -0.11908324197200792, -0.019375087000080383, -0.09099695081107452, -0.1700641437278994, 0.37808000002588543, 0.18050050286576153, 0.2067016599872815, 0.07943741359215761, 0.29963674085480824, 0.02460637913018997, 0.12551562742729272, 0.024022728093633695, 0.15709682780983192, 0.04751276780585093, 0.06535693291840809, -0.19357086250558495, 0.10925811757549776, 0.05626431102465306] |
1,802.07466 | Frozen accelerated information via local operations | In this contribution, we introduce a technique to freeze the parameters which
describe the accelerated states between two users to be used in the context of
quantum cryptography and quantum teleportation. It is assumed that, the two
users share different dimension sizes of particles, where we consider a
qubit-qutrit system. This technique depends on local operations, where it is
allowed that each particle interacts locally with a noisy phase channel. We
show that, the possibility of freezing the information of quantum channel
between the users depends on the initial state setting parameters, the initial
acceleration parameter strength of the phase channel. It is shown that, one may
increase the possibility of freezing the estimation degree of the parameters if
only the larger dimension system or both particles pass through the noisy phase
channel. Moreover, at small values of initial acceleration and large values of
the channel strength, the size of freezing estimation areas increases. The
results may be helpful in the context of quantum teleportation and quantum
coding.
| quant-ph | in this contribution we introduce a technique to freeze the parameters which describe the accelerated states between two users to be used in the context of quantum cryptography and quantum teleportation it is assumed that the two users share different dimension sizes of particles where we consider a qubitqutrit system this technique depends on local operations where it is allowed that each particle interacts locally with a noisy phase channel we show that the possibility of freezing the information of quantum channel between the users depends on the initial state setting parameters the initial acceleration parameter strength of the phase channel it is shown that one may increase the possibility of freezing the estimation degree of the parameters if only the larger dimension system or both particles pass through the noisy phase channel moreover at small values of initial acceleration and large values of the channel strength the size of freezing estimation areas increases the results may be helpful in the context of quantum teleportation and quantum coding | [['in', 'this', 'contribution', 'we', 'introduce', 'a', 'technique', 'to', 'freeze', 'the', 'parameters', 'which', 'describe', 'the', 'accelerated', 'states', 'between', 'two', 'users', 'to', 'be', 'used', 'in', 'the', 'context', 'of', 'quantum', 'cryptography', 'and', 'quantum', 'teleportation', 'it', 'is', 'assumed', 'that', 'the', 'two', 'users', 'share', 'different', 'dimension', 'sizes', 'of', 'particles', 'where', 'we', 'consider', 'a', 'qubitqutrit', 'system', 'this', 'technique', 'depends', 'on', 'local', 'operations', 'where', 'it', 'is', 'allowed', 'that', 'each', 'particle', 'interacts', 'locally', 'with', 'a', 'noisy', 'phase', 'channel', 'we', 'show', 'that', 'the', 'possibility', 'of', 'freezing', 'the', 'information', 'of', 'quantum', 'channel', 'between', 'the', 'users', 'depends', 'on', 'the', 'initial', 'state', 'setting', 'parameters', 'the', 'initial', 'acceleration', 'parameter', 'strength', 'of', 'the', 'phase', 'channel', 'it', 'is', 'shown', 'that', 'one', 'may', 'increase', 'the', 'possibility', 'of', 'freezing', 'the', 'estimation', 'degree', 'of', 'the', 'parameters', 'if', 'only', 'the', 'larger', 'dimension', 'system', 'or', 'both', 'particles', 'pass', 'through', 'the', 'noisy', 'phase', 'channel', 'moreover', 'at', 'small', 'values', 'of', 'initial', 'acceleration', 'and', 'large', 'values', 'of', 'the', 'channel', 'strength', 'the', 'size', 'of', 'freezing', 'estimation', 'areas', 'increases', 'the', 'results', 'may', 'be', 'helpful', 'in', 'the', 'context', 'of', 'quantum', 'teleportation', 'and', 'quantum', 'coding']] | [-0.1517921061735944, 0.21072589535643124, -0.08506326206372164, 0.02358075885664827, -0.029189408898154006, -0.19616227638297937, 0.059429955115774646, 0.3306407687875132, -0.2956121236950691, -0.2756575609646028, 0.08470972555681199, -0.24213664796635775, -0.12073431923081876, 0.17610761583879744, -0.04067651138618766, 0.036018224853164395, 0.0689814011940533, 0.0889916544796766, -0.055682023554774265, -0.2716887948668695, 0.322176706676449, 0.0543583138281801, 0.28885499117452473, 0.03952374512196651, 0.10188750321893687, 0.02486743806539813, 0.02985168655314261, -0.006828043110934752, -0.1311863694193432, 0.051873022666508666, 0.22121252270084196, 0.11736707678452755, 0.26182185071298764, -0.39345291779110475, -0.22556367961113297, 0.13792103733811972, 0.12722091101403793, 0.1393006898613835, -0.024603292030709174, -0.2828903775592889, 0.06212875559798531, -0.16282794680219445, -0.08314132127339863, -0.0053169587239002185, 4.6492116304025765e-05, -0.0017387783598332178, -0.2974874698723267, 0.06904466844363404, 0.03481273073287282, -0.0030118153552480395, -0.03336038885338764, -0.060197856065185205, 0.006768838100556639, 0.16425719286503626, 0.023754697874426797, -0.003720667116881703, 0.17938203961100607, -0.15612644919851196, -0.07851602317255345, 0.344501003257132, -0.02206087169664291, -0.2259174074902798, 0.19490317737446666, -0.1392211249053833, -0.09276509773449756, 0.1050043435257283, 0.1747670657655579, 0.09656001427598919, -0.08857701847141254, 0.06980169163025926, -0.013452744754474787, 0.23674267522264494, 0.04052765742138339, 0.09013351340711649, 0.18422488780647872, 0.12964894004454391, 0.08389691400918223, 0.1634729122465831, -0.12101120303019083, -0.15957554033403062, -0.3031116135728856, -0.1832903169283998, -0.23068576252609047, 0.019352228504084495, -0.12167414107300699, -0.11832347356522362, 0.39868969019014566, 0.1881381114432034, 0.2070329943477797, -0.009945415702532046, 0.3031828647335282, 0.10077652365622011, 0.04663235240427423, 0.09769546682946384, 0.24165080379628176, 0.12096497179092174, 0.09788585884130693, -0.23510439132501015, 0.11206383238701771, 0.00821052865579813] |
1,802.07467 | Thermodynamics analysis on BaF2 intermediate phase in solution-derived
YBCO superconducting film deposition | In the YBa2Cu3O7-{\delta} (YBCO) high temperature superconducting thin film
fabrication via the chemical solution deposition method, BaF2 is an important
intermediate phase during heat treatment. In this paper, BaF2 thermodynamics
stability was analyzed through calculating the standard Gibbs free energy
change ({\Delta}GT) of the reactions related to other intermediate phases
within the temperature range of 700-1000 K. Two thermodynamics methods, the
Gibbs free energy function method and standard formation molar Gibbs free
energy method, were utilized to obtain the {\Delta}GT values. The formation
priority of BaF2 relative to other intermediate phases were verified at higher
temperatures, while the possibility of BaCO3 formation was found at 700 K.
| cond-mat.supr-con | in the yba2cu3o7delta ybco high temperature superconducting thin film fabrication via the chemical solution deposition method baf2 is an important intermediate phase during heat treatment in this paper baf2 thermodynamics stability was analyzed through calculating the standard gibbs free energy change deltagt of the reactions related to other intermediate phases within the temperature range of 7001000 k two thermodynamics methods the gibbs free energy function method and standard formation molar gibbs free energy method were utilized to obtain the deltagt values the formation priority of baf2 relative to other intermediate phases were verified at higher temperatures while the possibility of baco3 formation was found at 700 k | [['in', 'the', 'yba2cu3o7delta', 'ybco', 'high', 'temperature', 'superconducting', 'thin', 'film', 'fabrication', 'via', 'the', 'chemical', 'solution', 'deposition', 'method', 'baf2', 'is', 'an', 'important', 'intermediate', 'phase', 'during', 'heat', 'treatment', 'in', 'this', 'paper', 'baf2', 'thermodynamics', 'stability', 'was', 'analyzed', 'through', 'calculating', 'the', 'standard', 'gibbs', 'free', 'energy', 'change', 'deltagt', 'of', 'the', 'reactions', 'related', 'to', 'other', 'intermediate', 'phases', 'within', 'the', 'temperature', 'range', 'of', '7001000', 'k', 'two', 'thermodynamics', 'methods', 'the', 'gibbs', 'free', 'energy', 'function', 'method', 'and', 'standard', 'formation', 'molar', 'gibbs', 'free', 'energy', 'method', 'were', 'utilized', 'to', 'obtain', 'the', 'deltagt', 'values', 'the', 'formation', 'priority', 'of', 'baf2', 'relative', 'to', 'other', 'intermediate', 'phases', 'were', 'verified', 'at', 'higher', 'temperatures', 'while', 'the', 'possibility', 'of', 'baco3', 'formation', 'was', 'found', 'at', '700', 'k']] | [-0.06949145817763616, 0.23087032217324047, -0.06864290530401691, 0.026219464103021076, 0.019938317919585193, -0.12180297099332386, 0.09701513948036515, 0.39768728892379834, -0.24833492849405123, -0.3636432077700847, 0.03061809863190158, -0.27660845950350305, 0.016639805259618248, 0.1621601488093071, 0.026849078369178922, 0.0744046861270201, -0.017244126340896587, -0.0016506469713863437, -0.10508594246772683, -0.21958218956644707, 0.23519323770148315, 0.1088896806952413, 0.36294777731402456, 0.11017770836321271, 0.060337107467560845, -0.054571876095642693, 0.05872024995683928, -0.031237885268909908, -0.22690055462766753, 0.01786818171342156, 0.27205394929118243, -0.03376637062353787, 0.20624503058981952, -0.3882878900409859, -0.26489704345988335, 0.0741089750908176, 0.08545141895171081, 0.08255880410243348, -0.07828940373680024, -0.18849385084984738, 0.06330104220101487, -0.15448959519929975, -0.12475407854697415, -0.06828542387495949, -0.0485963515989552, 0.006718685227624689, -0.19615281633184092, 0.12932248247317343, -0.009063826797942948, 0.0769666634787257, -0.1441823296753742, -0.1719532537352398, -0.09823964280293923, 0.061439158499380135, 0.008084394618712156, 0.02618876771096175, 0.21195883756486056, -0.040697512223393975, -0.05459925124996176, 0.32675315253436565, -0.05400978466582911, -0.06007575501348371, 0.213232659660802, -0.14225552802514851, -0.0955829862766316, 0.22450407891247037, 0.07217514183302627, 0.15300641970509862, -0.21061507515852976, 0.05083225247456701, 0.10920430665017566, 0.17254904901530488, 0.13582300243542364, -0.012865376989487733, 0.2189459162285534, 0.19375040900467017, -0.006260754462227086, 0.17888108151420845, -0.10976165069580496, -0.09083604017951499, -0.24043748281878707, -0.19992593269812586, -0.1645118511569138, 0.012691753283230084, -0.09883440544849989, -0.1626453982474648, 0.3435403974378638, 0.11760135215846386, 0.1382624861157595, -0.0429404893069676, 0.2666235419912873, 0.08662598924363189, 0.04465383691843773, 0.032186896727359464, 0.22493910511833765, 0.1703408831887156, 0.16282966803059212, -0.2763068720254455, 0.11757025748021274, 0.0736606534500824] |
1,802.07468 | Quantum Decoherence in System-Bath Interferometry | In this paper, we study a quantum harmonic oscillator in a Mach-Zehnder-type
interferometer which interacts with an environment, including electromagnetic
oscillators. By solving the Lindblad master equation, we calculate the resulted
interference pattern of the system. Interestingly, we show that even if one
considers the decoherence effect, the system will keep some of its quantum
properties. Indeed, the thermalization process does not completely leave the
system in a classical state and the system keeps some of its coherency. Such an
effect can be detected, when the frequency of the central system is high and
the temperature is low, even with zero phase angle. This observation makes the
quantum-to-classical transition remain as a vague notion in decoherence theory.
By introducing an entropy measure, we express the influence of the bath as a
maximization of system's entropy instead of classicalization of the state.
| quant-ph | in this paper we study a quantum harmonic oscillator in a machzehndertype interferometer which interacts with an environment including electromagnetic oscillators by solving the lindblad master equation we calculate the resulted interference pattern of the system interestingly we show that even if one considers the decoherence effect the system will keep some of its quantum properties indeed the thermalization process does not completely leave the system in a classical state and the system keeps some of its coherency such an effect can be detected when the frequency of the central system is high and the temperature is low even with zero phase angle this observation makes the quantumtoclassical transition remain as a vague notion in decoherence theory by introducing an entropy measure we express the influence of the bath as a maximization of systems entropy instead of classicalization of the state | [['in', 'this', 'paper', 'we', 'study', 'a', 'quantum', 'harmonic', 'oscillator', 'in', 'a', 'machzehndertype', 'interferometer', 'which', 'interacts', 'with', 'an', 'environment', 'including', 'electromagnetic', 'oscillators', 'by', 'solving', 'the', 'lindblad', 'master', 'equation', 'we', 'calculate', 'the', 'resulted', 'interference', 'pattern', 'of', 'the', 'system', 'interestingly', 'we', 'show', 'that', 'even', 'if', 'one', 'considers', 'the', 'decoherence', 'effect', 'the', 'system', 'will', 'keep', 'some', 'of', 'its', 'quantum', 'properties', 'indeed', 'the', 'thermalization', 'process', 'does', 'not', 'completely', 'leave', 'the', 'system', 'in', 'a', 'classical', 'state', 'and', 'the', 'system', 'keeps', 'some', 'of', 'its', 'coherency', 'such', 'an', 'effect', 'can', 'be', 'detected', 'when', 'the', 'frequency', 'of', 'the', 'central', 'system', 'is', 'high', 'and', 'the', 'temperature', 'is', 'low', 'even', 'with', 'zero', 'phase', 'angle', 'this', 'observation', 'makes', 'the', 'quantumtoclassical', 'transition', 'remain', 'as', 'a', 'vague', 'notion', 'in', 'decoherence', 'theory', 'by', 'introducing', 'an', 'entropy', 'measure', 'we', 'express', 'the', 'influence', 'of', 'the', 'bath', 'as', 'a', 'maximization', 'of', 'systems', 'entropy', 'instead', 'of', 'classicalization', 'of', 'the', 'state']] | [-0.20403860145122976, 0.17816371372221815, -0.11069202365631119, 0.028669535160601466, -0.020200738358040544, -0.14232364951150742, 0.044012431818199284, 0.3230135139698784, -0.29153123528016267, -0.2504471134103782, 0.0899121676916785, -0.2914868667325441, -0.15522653020997632, 0.1522830161431157, -0.05639268543425921, 0.02365908293459723, 0.04723393989409855, 0.09439838203561908, -0.06617214569841769, -0.18323060776625516, 0.3329192422180113, 0.08765271103095448, 0.24269025059786778, 0.04971777079362713, 0.11875090667654278, 0.015175572859044088, 0.05414996317964285, 0.009781664078857036, -0.06131130000701255, 0.01717422604032442, 0.19694855370631453, 0.12431272482648095, 0.28916759654575735, -0.41066452689098976, -0.2146902858999604, 0.10993881209205228, 0.12442694975439697, 0.17079732340103318, -0.019883580424935154, -0.2853288703155539, 0.007047968705230993, -0.19699551074448576, -0.15429875627820586, -0.05626537001539841, -0.008337245900712326, -0.02453445340176476, -0.21764332553081162, 0.07831825794493581, 0.11089154591797092, 0.03253419225678799, -0.04875531055343648, -0.021699605680546387, 0.007904027872685845, 0.11663692714568023, 0.0026666031527441945, 0.008944037424876018, 0.16728361716150497, -0.1509422387577699, -0.09149422719149936, 0.38015821577439496, -0.08273968583588812, -0.1913301800196026, 0.17330355025788255, -0.1833067689130598, -0.09416376769952212, 0.0970060986314788, 0.12188062404368258, 0.10395228429961659, -0.1780553301793221, 0.08343147130535275, 0.009714121441521966, 0.19912234359546332, 0.03345548850319064, 0.09354108636406192, 0.22088836375227633, 0.15293664799785203, 0.07392896964802598, 0.201940862068094, -0.05835362683638191, -0.12437077266897292, -0.28732849884751843, -0.17486729278230828, -0.1979138793007649, 0.07934256657598464, -0.04585612668453118, -0.17123827813127152, 0.3835214074595389, 0.17574774883877395, 0.19297692590518623, 0.011707069696561295, 0.289371444711607, 0.1920027151647691, 0.018606204018558222, 0.046296160635109065, 0.27721542936579674, 0.1449819763276911, 0.10863577910362089, -0.297964169929491, 0.0775901641240938, 0.013716457722087702] |
1,802.07469 | Evidences of extragalactic origin and planet engulfment in the
metal-poor twin pair HD 134439/HD 134440 | Recent studies of chemical abundances in metal-poor Halo stars show the
existence of different populations, which is important for studies of Galaxy
formation and evolution. Here we revisit the twin pair of chemically anomalous
stars HD 134439 and HD 134440, using high resolution (R $\sim 72 000$) and high
S/N ratio (S/N $\sim 250$) HDS/Subaru spectra. We compare them to the
well-studied Halo star HD 103095, using the line-by-line differential technique
to estimate precise stellar parameters and LTE chemical abundances. We present
the abundances of C, O, Na, Mg, Si, Ca, Sc, Ti, V, Cr, Mn, Co, Ni, Cu, Zn, Sr,
Y, Ba, La, Ce, Nd, and Sm. We compare our results to the precise abundance
patterns of Nissen & Schuster (2010) and data from dwarf Spheroidal Galaxies
(dSphs). We show that the abundance pattern of these stars appears to be
closely linked to that of dSphs with [$\alpha$/Fe] knee below [Fe/H] $<-1.5$.
We also find a systematic difference of $0.06\pm0.01$ dex between the
abundances of these twin binary stars, which could be explained by the
engulfment of a planet, thus suggesting that planet formation is possible at
low metallicities ([Fe/H]=$ -1.4$).
| astro-ph.SR | recent studies of chemical abundances in metalpoor halo stars show the existence of different populations which is important for studies of galaxy formation and evolution here we revisit the twin pair of chemically anomalous stars hd 134439 and hd 134440 using high resolution r sim 72 000 and high sn ratio sn sim 250 hdssubaru spectra we compare them to the wellstudied halo star hd 103095 using the linebyline differential technique to estimate precise stellar parameters and lte chemical abundances we present the abundances of c o na mg si ca sc ti v cr mn co ni cu zn sr y ba la ce nd and sm we compare our results to the precise abundance patterns of nissen schuster 2010 and data from dwarf spheroidal galaxies dsphs we show that the abundance pattern of these stars appears to be closely linked to that of dsphs with alphafe knee below feh 15 we also find a systematic difference of 006pm001 dex between the abundances of these twin binary stars which could be explained by the engulfment of a planet thus suggesting that planet formation is possible at low metallicities feh 14 | [['recent', 'studies', 'of', 'chemical', 'abundances', 'in', 'metalpoor', 'halo', 'stars', 'show', 'the', 'existence', 'of', 'different', 'populations', 'which', 'is', 'important', 'for', 'studies', 'of', 'galaxy', 'formation', 'and', 'evolution', 'here', 'we', 'revisit', 'the', 'twin', 'pair', 'of', 'chemically', 'anomalous', 'stars', 'hd', '134439', 'and', 'hd', '134440', 'using', 'high', 'resolution', 'r', 'sim', '72', '000', 'and', 'high', 'sn', 'ratio', 'sn', 'sim', '250', 'hdssubaru', 'spectra', 'we', 'compare', 'them', 'to', 'the', 'wellstudied', 'halo', 'star', 'hd', '103095', 'using', 'the', 'linebyline', 'differential', 'technique', 'to', 'estimate', 'precise', 'stellar', 'parameters', 'and', 'lte', 'chemical', 'abundances', 'we', 'present', 'the', 'abundances', 'of', 'c', 'o', 'na', 'mg', 'si', 'ca', 'sc', 'ti', 'v', 'cr', 'mn', 'co', 'ni', 'cu', 'zn', 'sr', 'y', 'ba', 'la', 'ce', 'nd', 'and', 'sm', 'we', 'compare', 'our', 'results', 'to', 'the', 'precise', 'abundance', 'patterns', 'of', 'nissen', 'schuster', '2010', 'and', 'data', 'from', 'dwarf', 'spheroidal', 'galaxies', 'dsphs', 'we', 'show', 'that', 'the', 'abundance', 'pattern', 'of', 'these', 'stars', 'appears', 'to', 'be', 'closely', 'linked', 'to', 'that', 'of', 'dsphs', 'with', 'alphafe', 'knee', 'below', 'feh', '15', 'we', 'also', 'find', 'a', 'systematic', 'difference', 'of', '006pm001', 'dex', 'between', 'the', 'abundances', 'of', 'these', 'twin', 'binary', 'stars', 'which', 'could', 'be', 'explained', 'by', 'the', 'engulfment', 'of', 'a', 'planet', 'thus', 'suggesting', 'that', 'planet', 'formation', 'is', 'possible', 'at', 'low', 'metallicities', 'feh', '14']] | [-0.035828875397695574, 0.11448976596727728, -0.0016526127112550003, 0.08775605914123197, -0.05309708462156515, -0.10320661023612766, 0.10295120368582161, 0.4228832480064369, -0.16866094968655213, -0.3846590043229853, -0.0822790359504232, -0.3266024913359931, -0.01823413274082838, 0.13402517882479545, -0.07030642548087924, -0.06340844108832672, 0.09484493116447254, -0.09435382314564232, -0.07946897914320639, -0.31380539815275266, 0.2868306284252415, 0.052477519416354874, 0.12039833014362795, -0.07132943559943494, -0.02999894255784684, -0.1688944884391631, -0.02902965824229314, -0.022439128460292827, -0.21647168518062576, 0.044658609245092, 0.24776034465496663, 0.1492286939547462, 0.11785007786394201, -0.3214748868579294, -0.1984084842248476, 0.015808478450990298, 0.21425295447343015, 0.051549414050127855, -0.1424810025233397, -0.24286257680057283, 0.1411761801570335, -0.14804275946057885, -0.16105890895344596, 0.0646802146577763, 0.061112897201655386, 0.04316603543017717, -0.2722306045813157, 0.131546441985283, 0.04774108378357941, 0.18287468296575315, -0.1053543932426828, -0.21866731935200645, -0.1387290446906983, 0.035828457700765946, -0.01941548892854648, 0.021854165267886565, 0.13543499057445138, 0.005946792861357093, 0.021275667638024864, 0.43535300146011424, -0.1731441421639722, 0.05941305200962778, 0.24281119694684278, -0.2224639839652109, -0.1937820379183233, 0.08355198173913209, 0.10929092739952757, 0.15395897072067555, -0.1683475732912912, 0.04381657586719985, 0.008152453771687765, 0.22434815057717702, 0.07881110315933265, 0.034275967494617615, 0.2921567755990368, 0.11064560650872754, 0.031328465159544176, -0.06409726359004922, -0.25242607036426806, -0.004248224509155308, -0.1393266194425324, -0.18713504159175617, -0.07054805488607044, 0.08695671097798781, -0.17994820512535503, -0.1093089094554836, 0.3039656663612328, 0.1050118619537499, 0.2552933266565682, -0.01794910654898753, 0.26527335334389923, 0.06344545999962717, 0.06251051282836373, 0.0756034387622955, 0.25439365567729116, 0.258796260972323, 0.12227444274520333, -0.323855266979781, 0.10773882471376103, 0.013870431590865161] |
1,802.0747 | Slocalization: Sub-{\mu}W Ultra Wideband Backscatter Localization | Ultra wideband technology has shown great promise for providing high-quality
location estimation, even in complex indoor multipath environments, but
existing ultra wideband systems require tens to hundreds of milliwatts during
operation. Backscatter communication has demonstrated the viability of
astonishingly low-power tags, but has thus far been restricted to narrowband
systems with low localization resolution. The challenge to combining these
complimentary technologies is that they share a compounding limitation,
constrained transmit power. Regulations limit ultra wideband transmissions to
just -41.3 dBm/MHz, and a backscatter device can only reflect the power it
receives. The solution is long-term integration of this limited power, lifting
the initially imperceptible signal out of the noise. This integration only
works while the target is stationary. However, stationary describes the vast
majority of objects, especially lost ones. With this insight, we design
Slocalization, a sub-microwatt, decimeter-accurate localization system that
opens a new tradeoff space in localization systems and realizes an energy,
size, and cost point that invites the localization of every thing. To evaluate
this concept, we implement an energy-harvesting Slocalization tag and find that
Slocalization can recover ultra wideband backscatter in under fifteen minutes
across thirty meters of space and localize tags with a mean 3D Euclidean error
of only 30 cm.
| cs.NI eess.SP | ultra wideband technology has shown great promise for providing highquality location estimation even in complex indoor multipath environments but existing ultra wideband systems require tens to hundreds of milliwatts during operation backscatter communication has demonstrated the viability of astonishingly lowpower tags but has thus far been restricted to narrowband systems with low localization resolution the challenge to combining these complimentary technologies is that they share a compounding limitation constrained transmit power regulations limit ultra wideband transmissions to just 413 dbmmhz and a backscatter device can only reflect the power it receives the solution is longterm integration of this limited power lifting the initially imperceptible signal out of the noise this integration only works while the target is stationary however stationary describes the vast majority of objects especially lost ones with this insight we design slocalization a submicrowatt decimeteraccurate localization system that opens a new tradeoff space in localization systems and realizes an energy size and cost point that invites the localization of every thing to evaluate this concept we implement an energyharvesting slocalization tag and find that slocalization can recover ultra wideband backscatter in under fifteen minutes across thirty meters of space and localize tags with a mean 3d euclidean error of only 30 cm | [['ultra', 'wideband', 'technology', 'has', 'shown', 'great', 'promise', 'for', 'providing', 'highquality', 'location', 'estimation', 'even', 'in', 'complex', 'indoor', 'multipath', 'environments', 'but', 'existing', 'ultra', 'wideband', 'systems', 'require', 'tens', 'to', 'hundreds', 'of', 'milliwatts', 'during', 'operation', 'backscatter', 'communication', 'has', 'demonstrated', 'the', 'viability', 'of', 'astonishingly', 'lowpower', 'tags', 'but', 'has', 'thus', 'far', 'been', 'restricted', 'to', 'narrowband', 'systems', 'with', 'low', 'localization', 'resolution', 'the', 'challenge', 'to', 'combining', 'these', 'complimentary', 'technologies', 'is', 'that', 'they', 'share', 'a', 'compounding', 'limitation', 'constrained', 'transmit', 'power', 'regulations', 'limit', 'ultra', 'wideband', 'transmissions', 'to', 'just', '413', 'dbmmhz', 'and', 'a', 'backscatter', 'device', 'can', 'only', 'reflect', 'the', 'power', 'it', 'receives', 'the', 'solution', 'is', 'longterm', 'integration', 'of', 'this', 'limited', 'power', 'lifting', 'the', 'initially', 'imperceptible', 'signal', 'out', 'of', 'the', 'noise', 'this', 'integration', 'only', 'works', 'while', 'the', 'target', 'is', 'stationary', 'however', 'stationary', 'describes', 'the', 'vast', 'majority', 'of', 'objects', 'especially', 'lost', 'ones', 'with', 'this', 'insight', 'we', 'design', 'slocalization', 'a', 'submicrowatt', 'decimeteraccurate', 'localization', 'system', 'that', 'opens', 'a', 'new', 'tradeoff', 'space', 'in', 'localization', 'systems', 'and', 'realizes', 'an', 'energy', 'size', 'and', 'cost', 'point', 'that', 'invites', 'the', 'localization', 'of', 'every', 'thing', 'to', 'evaluate', 'this', 'concept', 'we', 'implement', 'an', 'energyharvesting', 'slocalization', 'tag', 'and', 'find', 'that', 'slocalization', 'can', 'recover', 'ultra', 'wideband', 'backscatter', 'in', 'under', 'fifteen', 'minutes', 'across', 'thirty', 'meters', 'of', 'space', 'and', 'localize', 'tags', 'with', 'a', 'mean', '3d', 'euclidean', 'error', 'of', 'only', '30', 'cm']] | [-0.18429989094348176, 0.07931030916553014, -0.036375765369865545, 0.024025353067439838, -0.0743248577016346, -0.1920610656434202, 0.07953632738799077, 0.4197340289043639, -0.24888376249092187, -0.3403903670755807, 0.10665936561145366, -0.2730674986805528, -0.13917196916790192, 0.21906946891267312, -0.1364779966617269, 0.06736966388144076, 0.06823615246484506, 0.00024736853284311705, -0.04882523418705809, -0.22041990251734558, 0.220344605546541, 0.11088158024172184, 0.32961801881099057, 0.007473891867345355, 0.1455310381159847, 0.014147681999307016, -0.008571418287838107, -0.04655790316621117, -0.02371278428200178, 0.12162289492272098, 0.3008752002362437, 0.13754668427340255, 0.305925669357309, -0.40219219965476594, -0.2792353140318702, 0.10415662381066275, 0.17404641273770977, 0.06638564429391551, -0.08426736893930606, -0.28075131018912153, 0.129421664330778, -0.19626399013672594, -0.09248837208151106, -0.05797453025032495, -0.0005578609123789325, 0.018550613428537133, -0.22780691262040967, 0.012837238108574097, 0.0007364876520145556, 0.02939282657046403, -0.05722789525506293, -0.04763316397906139, 0.05650847817408701, 0.16009266181789303, -0.015223120473407833, 0.007039644230120434, 0.14098479018375745, -0.14693974877051463, -0.060516786135840585, 0.3864521661491175, -0.002132392472362724, -0.1503167451712592, 0.20532611490507138, -0.14208995927070162, -0.11729418850971816, 0.1911758207326085, 0.1709681622749378, 0.0728450988171613, -0.17501872246901462, 0.07536477260988347, 0.003835922242440467, 0.21904836425381677, 0.09510411876666686, 0.13878772988355734, 0.19794361285201223, 0.22379614722460803, 0.11574864597633261, 0.1017396251024137, -0.16034056993862017, -0.032903931731601326, -0.20300188415231907, -0.1144489390692981, -0.2068484029205048, 0.0807711934175324, -0.033249712590081734, -0.11412932555374157, 0.362313787374884, 0.19214067033152532, 0.15157095669066817, 0.06465138245148588, 0.37568509469515293, 0.08539227078315513, 0.11282549090419662, 0.0746486248113582, 0.25043777758576746, 0.053496560757392515, 0.14822849114358097, -0.12228486065757392, 0.030781204853518842, -0.0459916460750168] |
1,802.07471 | Degressive representation of Member States in the European Parliament
2019-2024 | Primary law of the European Union demands that the allocation of the seats of
the European Parliament between the Member States must obey the principle of
degressive proportionality. The principle embodies the political aim that the
more populous states agree to be underrepresented in order to allow the less
populous states to be better represented. This paper reviews four allocation
methods achieving this goal: the Cambridge Compromise, the Power Compromise,
the Modified Cambridge Compromise, and the 0.5-DPL Method. After a year of
committee deliberations, Parliament decreed on 7 February 2018 an allocation of
seats for the 2019 elections that realizes degressive proportionality, but
otherwise lacks methodological grounding. The allocation emerged from haggling
and bargaining behind closed doors.
| physics.soc-ph math.HO | primary law of the european union demands that the allocation of the seats of the european parliament between the member states must obey the principle of degressive proportionality the principle embodies the political aim that the more populous states agree to be underrepresented in order to allow the less populous states to be better represented this paper reviews four allocation methods achieving this goal the cambridge compromise the power compromise the modified cambridge compromise and the 05dpl method after a year of committee deliberations parliament decreed on 7 february 2018 an allocation of seats for the 2019 elections that realizes degressive proportionality but otherwise lacks methodological grounding the allocation emerged from haggling and bargaining behind closed doors | [['primary', 'law', 'of', 'the', 'european', 'union', 'demands', 'that', 'the', 'allocation', 'of', 'the', 'seats', 'of', 'the', 'european', 'parliament', 'between', 'the', 'member', 'states', 'must', 'obey', 'the', 'principle', 'of', 'degressive', 'proportionality', 'the', 'principle', 'embodies', 'the', 'political', 'aim', 'that', 'the', 'more', 'populous', 'states', 'agree', 'to', 'be', 'underrepresented', 'in', 'order', 'to', 'allow', 'the', 'less', 'populous', 'states', 'to', 'be', 'better', 'represented', 'this', 'paper', 'reviews', 'four', 'allocation', 'methods', 'achieving', 'this', 'goal', 'the', 'cambridge', 'compromise', 'the', 'power', 'compromise', 'the', 'modified', 'cambridge', 'compromise', 'and', 'the', '05dpl', 'method', 'after', 'a', 'year', 'of', 'committee', 'deliberations', 'parliament', 'decreed', 'on', '7', 'february', '2018', 'an', 'allocation', 'of', 'seats', 'for', 'the', '2019', 'elections', 'that', 'realizes', 'degressive', 'proportionality', 'but', 'otherwise', 'lacks', 'methodological', 'grounding', 'the', 'allocation', 'emerged', 'from', 'haggling', 'and', 'bargaining', 'behind', 'closed', 'doors']] | [-0.11235943066219435, 0.06056853043758209, -0.10102045774945746, 0.06261127364173856, -0.13581820249395526, -0.1704084122189037, 0.15582639002544887, 0.3000023822826536, -0.22331708864835292, -0.3559843715604233, 0.09706825172103456, -0.30719376776529395, -0.07416212907384918, 0.126683503941319, -0.15187108440567618, -0.012452144596887671, 0.05905475126498419, 0.009085692549358456, 0.035501148067819684, -0.3122206264580398, 0.27630680152417525, 0.1257985773638053, 0.37374419171525086, 0.008900266278373158, 0.08886111545902879, -0.013183253533814264, -0.0367464582476279, -0.01968263967529587, -0.09409660012404303, 0.16384505238839547, 0.3296000023777394, 0.2180454862061078, 0.3796632808997579, -0.39981484028520875, -0.08480200920577931, 0.06661076278061323, 0.04698966447284202, 0.01007129253576631, 0.04612969519689416, -0.2676093501079342, 0.006074543076607844, -0.26550522527616954, -0.1521209424159125, -0.00254635086040134, 0.026589119694519627, -0.005418125383110474, -0.2177097044652328, 0.06306045939740927, 0.023451347677442044, 0.050580893959040224, -0.07300136826284553, -0.16547196099645983, -0.012897164119488519, 0.21432036627084017, 0.05468539334023776, 0.013195110999209725, 0.07406269779337732, -0.11508037121156635, -0.17159540594919867, 0.42466020009115985, 0.03154817932265122, -0.08079783275885427, 0.12390130328149888, -0.12039674648448177, -0.1840136184681045, 0.04773678126663941, 0.16846981831704794, 0.05300733865493068, -0.1551818271127084, 0.016215842745631287, -0.06119261711187984, 0.1998958807884027, 0.1386128457668035, -0.0003775497736490291, 0.24710391242381025, 0.15554737528057203, 0.10189680342117081, 0.0912473831548477, -0.047031277926314785, -0.13722967958968618, -0.2909027471733482, -0.12976856630133546, -0.1654642152680975, 0.040530852143875445, -0.04380326802695535, -0.09255418403722022, 0.38709313840321874, 0.09062863575375599, 0.05528082165705121, 0.03150942620375882, 0.22159789087169846, 0.046074738790807514, 0.06461826291583155, 0.15191511205883454, 0.24306024976540358, 0.04075946596491596, 0.14773993772940466, -0.19128293262430182, 0.11155406647240339, 0.022661107009195762] |
1,802.07472 | Gromov-Lawson Tunnels with Estimates | In an appendix to an earlier paper (cf. arXiv:1703.00984) we showed we showed
how to construct tunnels of positive scalar curvature and of arbitrarily small
length and volume connecting points in a \emph{three dimensional} manifold of
\emph{constant sectional curvature}. Here we generalize the construction to
arbitrary dimensions and require only positivity of the scalar curvature. This
version contains an added section on existence of arbitrarily narrow tunnels of
prescribed length.
| math.DG | in an appendix to an earlier paper cf arxiv170300984 we showed we showed how to construct tunnels of positive scalar curvature and of arbitrarily small length and volume connecting points in a emphthree dimensional manifold of emphconstant sectional curvature here we generalize the construction to arbitrary dimensions and require only positivity of the scalar curvature this version contains an added section on existence of arbitrarily narrow tunnels of prescribed length | [['in', 'an', 'appendix', 'to', 'an', 'earlier', 'paper', 'cf', 'arxiv170300984', 'we', 'showed', 'we', 'showed', 'how', 'to', 'construct', 'tunnels', 'of', 'positive', 'scalar', 'curvature', 'and', 'of', 'arbitrarily', 'small', 'length', 'and', 'volume', 'connecting', 'points', 'in', 'a', 'emphthree', 'dimensional', 'manifold', 'of', 'emphconstant', 'sectional', 'curvature', 'here', 'we', 'generalize', 'the', 'construction', 'to', 'arbitrary', 'dimensions', 'and', 'require', 'only', 'positivity', 'of', 'the', 'scalar', 'curvature', 'this', 'version', 'contains', 'an', 'added', 'section', 'on', 'existence', 'of', 'arbitrarily', 'narrow', 'tunnels', 'of', 'prescribed', 'length']] | [-0.21407837004981178, 0.1367907505969608, -0.04286870815237795, 0.0386103914183416, -0.06622940291097199, -0.17504144780526776, -0.014371655926958698, 0.34326229706082656, -0.20385387546021788, -0.2539812871997339, 0.05762449057057392, -0.2796341274473546, -0.14382172631693707, 0.13798455329800863, -0.11433894701632738, 0.0035546589507788853, 0.03993265156674644, 0.10830736319547977, -0.037694280292244926, -0.29429913965472276, 0.39566039650336554, 0.029558238721844078, 0.18276299505858964, 0.14163642484303293, 0.1394940197089876, 0.017757646496529163, -0.02657579973448014, 0.08547056991390992, -0.22956183685016804, 0.14434148801787608, 0.19707646425577233, 0.06280026805546621, 0.22239218010108217, -0.3979305487288081, -0.19941454142816298, 0.13270891768236956, 0.15647248686561227, 0.10126578212594209, -0.010448695357848444, -0.2545122415556208, 0.12355578748806231, -0.10454119858669414, -0.22664337038345958, -0.07565295840681031, 0.029819854433931734, -0.045380762960437845, -0.20926486741265524, 0.02058156929316296, 0.07964054270026584, 0.05132904681174651, -0.05889391652105943, -0.08854883266747862, 0.0007367462621650834, 0.08604238354398505, 0.07737765070455878, 0.01641066283311533, 0.05841341254763656, -0.053055706283872045, -0.0855409059221384, 0.23672759937851326, -0.11299498904280472, -0.2653452148391069, 0.13321590720189977, -0.09960060360153085, -0.11351818591356277, 0.15392983262089716, 0.1897576109006785, 0.12158486123898647, -0.03319150908593682, 0.15327847618491564, -0.06053578413591005, 0.20157869429449024, 0.19741098280402197, -0.007957804826614649, 0.14260353983474383, 0.050769148446767984, 0.13736991461474393, 0.15749559236228114, -0.05841591734560612, -0.09486475997887876, -0.3913583625917849, -0.22750257539092159, -0.17505267196068325, 0.17280155269132144, -0.1061716216906949, -0.22635228063344306, 0.3735126951250477, 0.056315371721976204, 0.2693096739847375, 0.09997780619702046, 0.25925253297917655, 0.03255187701163949, 0.034902410035062094, 0.13042852116505738, 0.17644515120680782, 0.1596467320881514, 0.08115912934063353, -0.1282985534829398, -0.04172689833448849, 0.11333719586980516] |
1,802.07473 | Merger of multiple accreting black holes concordant with gravitational
wave events | Recently, advanced Laser Interferometer Gravitational-Wave Observatory
(aLIGO) has detected black hole (BH) merger events, most of which are sourced
by BHs more massive than $30~M_\odot$. Especially, the observation of GW170104
suggests dynamically assembled binaries favoring a distribution of misaligned
spins. It has been argued that mergers of unassociated BHs can be engendered
through a "chance meeting" in a multiple BH system under gas-rich environments.
In this paper, we consider the merger of unassociated BHs, concordant with the
massive BH merger events. To that end, we simulate a multiple BH system with a
post-Newtonian $N$-body code incorporating gas accretion and general
relativistic effects. As a result, we find that gas dynamical friction
effectively promotes three-body interaction of BHs in dense gas of
$n_\mathrm{gas}\gtrsim 10^6\,\mathrm{cm}^{-3}$, so that BH mergers can take
place within $30$ Myr. This scenario predicts an isotropic distribution of spin
tilts. In the concordant models with GW150914, the masses of seed BHs are
required to be $\gtrsim 25~M_\odot$. The potential sites of such "chance
meeting" BH mergers are active galactic nucleus (AGN) disks and dense
interstellar clouds. Assuming the LIGO O1, we roughly estimate the event rates
for PopI BHs and PopIII BHs in AGN disks to be respectively $\simeq
1-2\,\mathrm{yr}^{-1}$ and $\simeq 1\,\mathrm{yr}^{-1}$. Multiple episodes of
AGNs may enhance the rates by roughly an order of magnitude. For massive PopI
BHs in dense interstellar clouds, the rate is $\simeq 0.02\,\mathrm{yr}^{-1}$.
Hence, high-density AGN disks are a more plausible site for mergers of chance
meeting BHs.
| astro-ph.GA astro-ph.HE | recently advanced laser interferometer gravitationalwave observatory aligo has detected black hole bh merger events most of which are sourced by bhs more massive than 30m_odot especially the observation of gw170104 suggests dynamically assembled binaries favoring a distribution of misaligned spins it has been argued that mergers of unassociated bhs can be engendered through a chance meeting in a multiple bh system under gasrich environments in this paper we consider the merger of unassociated bhs concordant with the massive bh merger events to that end we simulate a multiple bh system with a postnewtonian nbody code incorporating gas accretion and general relativistic effects as a result we find that gas dynamical friction effectively promotes threebody interaction of bhs in dense gas of n_mathrmgasgtrsim 106mathrmcm3 so that bh mergers can take place within 30 myr this scenario predicts an isotropic distribution of spin tilts in the concordant models with gw150914 the masses of seed bhs are required to be gtrsim 25m_odot the potential sites of such chance meeting bh mergers are active galactic nucleus agn disks and dense interstellar clouds assuming the ligo o1 we roughly estimate the event rates for popi bhs and popiii bhs in agn disks to be respectively simeq 12mathrmyr1 and simeq 1mathrmyr1 multiple episodes of agns may enhance the rates by roughly an order of magnitude for massive popi bhs in dense interstellar clouds the rate is simeq 002mathrmyr1 hence highdensity agn disks are a more plausible site for mergers of chance meeting bhs | [['recently', 'advanced', 'laser', 'interferometer', 'gravitationalwave', 'observatory', 'aligo', 'has', 'detected', 'black', 'hole', 'bh', 'merger', 'events', 'most', 'of', 'which', 'are', 'sourced', 'by', 'bhs', 'more', 'massive', 'than', '30m_odot', 'especially', 'the', 'observation', 'of', 'gw170104', 'suggests', 'dynamically', 'assembled', 'binaries', 'favoring', 'a', 'distribution', 'of', 'misaligned', 'spins', 'it', 'has', 'been', 'argued', 'that', 'mergers', 'of', 'unassociated', 'bhs', 'can', 'be', 'engendered', 'through', 'a', 'chance', 'meeting', 'in', 'a', 'multiple', 'bh', 'system', 'under', 'gasrich', 'environments', 'in', 'this', 'paper', 'we', 'consider', 'the', 'merger', 'of', 'unassociated', 'bhs', 'concordant', 'with', 'the', 'massive', 'bh', 'merger', 'events', 'to', 'that', 'end', 'we', 'simulate', 'a', 'multiple', 'bh', 'system', 'with', 'a', 'postnewtonian', 'nbody', 'code', 'incorporating', 'gas', 'accretion', 'and', 'general', 'relativistic', 'effects', 'as', 'a', 'result', 'we', 'find', 'that', 'gas', 'dynamical', 'friction', 'effectively', 'promotes', 'threebody', 'interaction', 'of', 'bhs', 'in', 'dense', 'gas', 'of', 'n_mathrmgasgtrsim', '106mathrmcm3', 'so', 'that', 'bh', 'mergers', 'can', 'take', 'place', 'within', '30', 'myr', 'this', 'scenario', 'predicts', 'an', 'isotropic', 'distribution', 'of', 'spin', 'tilts', 'in', 'the', 'concordant', 'models', 'with', 'gw150914', 'the', 'masses', 'of', 'seed', 'bhs', 'are', 'required', 'to', 'be', 'gtrsim', '25m_odot', 'the', 'potential', 'sites', 'of', 'such', 'chance', 'meeting', 'bh', 'mergers', 'are', 'active', 'galactic', 'nucleus', 'agn', 'disks', 'and', 'dense', 'interstellar', 'clouds', 'assuming', 'the', 'ligo', 'o1', 'we', 'roughly', 'estimate', 'the', 'event', 'rates', 'for', 'popi', 'bhs', 'and', 'popiii', 'bhs', 'in', 'agn', 'disks', 'to', 'be', 'respectively', 'simeq', '12mathrmyr1', 'and', 'simeq', '1mathrmyr1', 'multiple', 'episodes', 'of', 'agns', 'may', 'enhance', 'the', 'rates', 'by', 'roughly', 'an', 'order', 'of', 'magnitude', 'for', 'massive', 'popi', 'bhs', 'in', 'dense', 'interstellar', 'clouds', 'the', 'rate', 'is', 'simeq', '002mathrmyr1', 'hence', 'highdensity', 'agn', 'disks', 'are', 'a', 'more', 'plausible', 'site', 'for', 'mergers', 'of', 'chance', 'meeting', 'bhs']] | [-0.1651709508360075, 0.17297294932383417, -0.030080075500810072, 0.16486045230355129, -0.08918245160598154, -0.07276539293585407, 0.026671604469345404, 0.38911282230353306, -0.08947207836082113, -0.31571088409174447, 0.0269955945829476, -0.3159576338737018, -0.016883171184906304, 0.2066238122638161, -0.0035865717223068035, -0.03759086624409403, 0.08378774406723216, -0.0998448377671413, -0.0447507740319745, -0.3024186321643897, 0.31912030571101624, 0.13785275711470152, 0.06909427072945212, -0.10046828607520476, 0.09729543861871477, -0.0783639114065296, -0.016224978693707055, -0.05535331438487965, -0.13632635807694024, -0.01211331106780322, 0.28062613792077956, 0.16366266755797046, 0.24346367298232868, -0.41528582569088573, -0.23865385604964584, 0.09445316311787845, 0.22598924904230458, 0.10860483242814094, -0.1288783641322564, -0.28883954065982714, 0.10074845880697181, -0.32500452415879105, -0.14025232981332897, 0.08521116731114962, 0.06260250387270742, 0.024592775000261205, -0.2522497654715476, 0.17887916823672054, 0.06983913309583037, -0.07454339774856575, -0.09422452225299814, -0.01371906755909647, -0.05946210916500446, 0.04409094287413519, 0.09434161917931855, 0.11239725378657545, 0.2473383718016288, -0.12522589491895778, -0.09791786396637374, 0.40419342267434766, 0.0019915510179577896, -0.021758569690229542, 0.24653550064044982, -0.2598447354110189, -0.18767738849028545, 0.15770050304487718, 0.224207766484931, 0.15137746026797205, -0.15301192523372814, -0.023142223635584155, 0.03191775369673413, 0.24346721311742517, 0.07842604982982243, 0.04569166552584256, 0.45259159177634095, 0.12392423812430814, 0.030540194626020128, 0.0703177468958003, -0.1384990918103698, -0.058152038813761076, -0.16902722775611895, -0.09974956927048466, -0.13147858630342424, 0.1327730069198638, -0.16433172561935427, -0.06683887289221252, 0.2470232321436263, 0.0945108190649343, 0.2046454307538542, 0.035258864438941044, 0.26395753947325235, 0.06587939834066335, 0.09219255024174705, 0.14971668017096817, 0.34541832151137725, 0.12871333270541524, 0.028413535407474957, -0.19225816486508215, 0.06477541229045422, 0.009462754773206947] |
1,802.07474 | The Moduli Space of Polynomial Maps and Their Fixed-Point Multipliers:
II. Improvement to the Algorithm and Monic Centered Polynomials | We consider the family $\mathrm{MC}_d$ of monic centered polynomials of one
complex variable with degree $d \geq 2$, and study the map
$\widehat{\Phi}_d:\mathrm{MC}_d\to \widetilde{\Lambda}_d \subset \mathbb{C}^d /
\mathfrak{S}_d$ which maps each $f \in \mathrm{MC}_d$ to its unordered
collection of fixed-point multipliers. We give an explicit formula for counting
the number of elements of each fiber
$\widehat{\Phi}_d^{-1}\left(\bar{\lambda}\right)$ for every $\bar{\lambda} \in
\widetilde{\Lambda}_d$ except when the fiber
$\widehat{\Phi}_d^{-1}\left(\bar{\lambda}\right)$ contains polynomials having
multiple fixed points. This formula is not a recursive one, and is a drastic
improvement of our previous result [T. Sugiyama, The moduli space of polynomial
maps and their fixed-point multipliers. Adv. Math. 322 (2017), 132--185] which
gave a rather long algorithm with some induction processes.
| math.DS math.AG math.CO math.CV | we consider the family mathrmmc_d of monic centered polynomials of one complex variable with degree d geq 2 and study the map widehatphi_dmathrmmc_dto widetildelambda_d subset mathbbcd mathfraks_d which maps each f in mathrmmc_d to its unordered collection of fixedpoint multipliers we give an explicit formula for counting the number of elements of each fiber widehatphi_d1leftbarlambdaright for every barlambda in widetildelambda_d except when the fiber widehatphi_d1leftbarlambdaright contains polynomials having multiple fixed points this formula is not a recursive one and is a drastic improvement of our previous result t sugiyama the moduli space of polynomial maps and their fixedpoint multipliers adv math 322 2017 132185 which gave a rather long algorithm with some induction processes | [['we', 'consider', 'the', 'family', 'mathrmmc_d', 'of', 'monic', 'centered', 'polynomials', 'of', 'one', 'complex', 'variable', 'with', 'degree', 'd', 'geq', '2', 'and', 'study', 'the', 'map', 'widehatphi_dmathrmmc_dto', 'widetildelambda_d', 'subset', 'mathbbcd', 'mathfraks_d', 'which', 'maps', 'each', 'f', 'in', 'mathrmmc_d', 'to', 'its', 'unordered', 'collection', 'of', 'fixedpoint', 'multipliers', 'we', 'give', 'an', 'explicit', 'formula', 'for', 'counting', 'the', 'number', 'of', 'elements', 'of', 'each', 'fiber', 'widehatphi_d1leftbarlambdaright', 'for', 'every', 'barlambda', 'in', 'widetildelambda_d', 'except', 'when', 'the', 'fiber', 'widehatphi_d1leftbarlambdaright', 'contains', 'polynomials', 'having', 'multiple', 'fixed', 'points', 'this', 'formula', 'is', 'not', 'a', 'recursive', 'one', 'and', 'is', 'a', 'drastic', 'improvement', 'of', 'our', 'previous', 'result', 't', 'sugiyama', 'the', 'moduli', 'space', 'of', 'polynomial', 'maps', 'and', 'their', 'fixedpoint', 'multipliers', 'adv', 'math', '322', '2017', '132185', 'which', 'gave', 'a', 'rather', 'long', 'algorithm', 'with', 'some', 'induction', 'processes']] | [-0.18747650552541018, 0.06918735756321608, -0.06533305331443746, -0.031240444870760525, -0.07005650814217343, -0.1468096173161434, 0.044640708800957156, 0.33540271120835785, -0.2854190714036425, -0.23264741075345902, 0.08194734943552046, -0.2648082225264429, -0.12387301393405155, 0.2050255420272825, -0.08796583110880521, 0.02265484658602401, 0.03482271564361225, 0.054392664788152884, -0.06189262957087959, -0.3109471386695212, 0.3030812151027257, -0.025581884292747686, 0.1676139507843699, -0.019337257879130817, 0.15552719014629945, 0.05435765383083856, -0.05261648122271894, -0.061709880083206506, -0.14021389772770582, 0.12435760820732901, 0.27334281565897445, 0.12905038574158592, 0.25830321250638616, -0.3202733885185875, -0.12581410630243933, 0.22180042050442556, 0.10719291975773457, 0.027178495365660638, 0.020842167833406065, -0.22274128913327498, 0.10366008937179921, -0.12496949739539155, -0.15017792166434918, -0.057588430509592094, 0.10777384764083696, 0.07368787903019607, -0.2964634257239393, -0.010016704263829591, 0.13216969537272774, 0.13197807134215342, -0.022459695901488885, -0.17726704511894947, -0.02354714729935276, 0.06943343703002298, -0.038363125417769574, 0.11424395992071368, 0.04815643881307484, -0.07429125456595405, -0.11427726819938808, 0.3430189209471724, -0.0537713309318793, -0.22387149680785282, 0.13370432020854894, -0.1734886236049028, -0.16914371734795472, 0.16119189738054518, 0.10371213101919878, 0.16448057387282866, -0.07052290639734969, 0.158142824474554, -0.1383522065459854, 0.13914830960156568, 0.153752024182015, 0.018552195530867687, 0.09504763892618939, 0.07956946456882481, 0.09843364339192501, 0.1345390088094131, -0.0367591359945773, -0.029594566798079067, -0.336583802869427, -0.19106041346417946, -0.15294818465891122, 0.08278196729750359, -0.1664656610935506, -0.1857160598953703, 0.3940062972854961, 0.041697160737520014, 0.23944082140439638, 0.08834045560797676, 0.20569315258655008, 0.11873716591637479, 0.027928639878087712, 0.09924125237631853, 0.1011896762553348, 0.15203450238176527, 0.049110547673923, -0.1271444070691898, -0.006836992201257359, 0.1819076234543765] |
1,802.07475 | Car-to-Cloud Communication Traffic Analysis Based on the Common Vehicle
Information Model | Although connectivity services have been introduced already today in many of
the most recent car models, the potential of vehicles serving as highly mobile
sensor platform in the Internet of Things (IoT) has not been sufficiently
exploited yet. The European AutoMat project has therefore defined an open
Common Vehicle Information Model (CVIM) in combination with a cross-industry,
cloud-based big data marketplace. Thereby, vehicle sensor data can be leveraged
for the design of entirely new services even beyond traffic-related
applications (such as localized weather forecasts). This paper focuses on the
prediction of the achievable data rate making use of an analytical model based
on empirical measurements. For an in-depth analysis, the CVIM has been
integrated in a vehicle traffic simulator to produce CVIM-complaint data
streams as a result of the individual behavior of each vehicle (speed, brake
activity, steering activity, etc.). In a next step, a simulation of vehicle
traffic in a realistically modeled, large-area street network has been used in
combination with a cellular Long Term Evolution (LTE) network to determine the
cumulated amount of data produced within each network cell. As a result, a new
car-to-cloud communication traffic model has been derived, which quantifies the
data rate of aggregated car-to-cloud data producible by vehicles depending on
the current traffic situations (free flow and traffic jam). The results provide
a reference for network planning and resource scheduling for car-to-cloud type
services in the context of smart cities.
| cs.NI | although connectivity services have been introduced already today in many of the most recent car models the potential of vehicles serving as highly mobile sensor platform in the internet of things iot has not been sufficiently exploited yet the european automat project has therefore defined an open common vehicle information model cvim in combination with a crossindustry cloudbased big data marketplace thereby vehicle sensor data can be leveraged for the design of entirely new services even beyond trafficrelated applications such as localized weather forecasts this paper focuses on the prediction of the achievable data rate making use of an analytical model based on empirical measurements for an indepth analysis the cvim has been integrated in a vehicle traffic simulator to produce cvimcomplaint data streams as a result of the individual behavior of each vehicle speed brake activity steering activity etc in a next step a simulation of vehicle traffic in a realistically modeled largearea street network has been used in combination with a cellular long term evolution lte network to determine the cumulated amount of data produced within each network cell as a result a new cartocloud communication traffic model has been derived which quantifies the data rate of aggregated cartocloud data producible by vehicles depending on the current traffic situations free flow and traffic jam the results provide a reference for network planning and resource scheduling for cartocloud type services in the context of smart cities | [['although', 'connectivity', 'services', 'have', 'been', 'introduced', 'already', 'today', 'in', 'many', 'of', 'the', 'most', 'recent', 'car', 'models', 'the', 'potential', 'of', 'vehicles', 'serving', 'as', 'highly', 'mobile', 'sensor', 'platform', 'in', 'the', 'internet', 'of', 'things', 'iot', 'has', 'not', 'been', 'sufficiently', 'exploited', 'yet', 'the', 'european', 'automat', 'project', 'has', 'therefore', 'defined', 'an', 'open', 'common', 'vehicle', 'information', 'model', 'cvim', 'in', 'combination', 'with', 'a', 'crossindustry', 'cloudbased', 'big', 'data', 'marketplace', 'thereby', 'vehicle', 'sensor', 'data', 'can', 'be', 'leveraged', 'for', 'the', 'design', 'of', 'entirely', 'new', 'services', 'even', 'beyond', 'trafficrelated', 'applications', 'such', 'as', 'localized', 'weather', 'forecasts', 'this', 'paper', 'focuses', 'on', 'the', 'prediction', 'of', 'the', 'achievable', 'data', 'rate', 'making', 'use', 'of', 'an', 'analytical', 'model', 'based', 'on', 'empirical', 'measurements', 'for', 'an', 'indepth', 'analysis', 'the', 'cvim', 'has', 'been', 'integrated', 'in', 'a', 'vehicle', 'traffic', 'simulator', 'to', 'produce', 'cvimcomplaint', 'data', 'streams', 'as', 'a', 'result', 'of', 'the', 'individual', 'behavior', 'of', 'each', 'vehicle', 'speed', 'brake', 'activity', 'steering', 'activity', 'etc', 'in', 'a', 'next', 'step', 'a', 'simulation', 'of', 'vehicle', 'traffic', 'in', 'a', 'realistically', 'modeled', 'largearea', 'street', 'network', 'has', 'been', 'used', 'in', 'combination', 'with', 'a', 'cellular', 'long', 'term', 'evolution', 'lte', 'network', 'to', 'determine', 'the', 'cumulated', 'amount', 'of', 'data', 'produced', 'within', 'each', 'network', 'cell', 'as', 'a', 'result', 'a', 'new', 'cartocloud', 'communication', 'traffic', 'model', 'has', 'been', 'derived', 'which', 'quantifies', 'the', 'data', 'rate', 'of', 'aggregated', 'cartocloud', 'data', 'producible', 'by', 'vehicles', 'depending', 'on', 'the', 'current', 'traffic', 'situations', 'free', 'flow', 'and', 'traffic', 'jam', 'the', 'results', 'provide', 'a', 'reference', 'for', 'network', 'planning', 'and', 'resource', 'scheduling', 'for', 'cartocloud', 'type', 'services', 'in', 'the', 'context', 'of', 'smart', 'cities']] | [-0.16602613434562102, 0.028111444442084632, -0.07053570581619885, 0.028220906034805513, -0.06779121592779584, -0.16072666258055796, 0.07635243040400537, 0.37675418961951707, -0.24990759703796356, -0.3238175237194655, 0.15326082128238805, -0.2771593681437538, -0.12337343979929079, 0.2360718935128658, -0.1331291974730235, 0.10031999712066844, 0.09480976256878769, 0.055823084145432654, 0.05797326927682623, -0.22004452072916195, 0.2454771524196134, 0.07351540523838807, 0.36117500175741757, 0.060899406757720924, 0.09376666413847991, -0.011031802778845613, -0.048449942606322946, 0.003643372014878278, -0.07940541032523392, 0.1421449370256209, 0.32139215227286144, 0.2001340843086624, 0.310836224150943, -0.49412706162225695, -0.2852357384798295, 0.09893450559850069, 0.15943086196846784, 0.05817685097584779, -0.05949892110656947, -0.322472235286965, 0.07474762291956799, -0.2745765350560876, -0.10818034470715421, -0.02892147821394053, 0.03372336389259138, 0.06126284757331806, -0.2802685081859694, -0.019079316913229512, -0.048596828210692694, 0.10040772483941722, -0.0510620627423471, -0.04506388570112672, -0.0343760503376735, 0.22513723098177543, 0.040427875297114335, 0.01360416387683375, 0.15666566108492144, -0.15231533932816632, -0.1354816487098628, 0.40788491702777274, -0.026006195586214358, -0.15083410318821985, 0.14092338590862905, -0.03127529387501009, -0.14202262448800845, 0.07840601603619438, 0.2601857148264436, 0.043178766018691216, -0.24508485047102094, 0.009930136598686272, -0.05053460584121182, 0.14793404206940705, 0.022399773076176643, 0.01625496699534198, 0.1992168350581159, 0.2971949278882289, 0.1380097538973403, 0.06715449777263355, -0.11567735241607148, -0.09857553807978935, -0.19204493841116732, -0.13149308688700834, -0.19293814609818002, 0.016890720617920258, -0.08608126389841113, -0.11712854628332277, 0.3730644888462538, 0.16912533140919628, 0.16032587949265825, 0.02906945376765934, 0.3598176298355882, 0.04911831684603772, 0.10851093690465898, 0.11121246567431917, 0.16915040371216278, 0.006460981062078413, 0.2317239919102731, -0.13691689638579463, 0.13535159694655066, 0.004695928222846557] |
1,802.07476 | Empirical evaluation of predictive channel-aware transmission for
resource efficient car-to-cloud communication | Nowadays vehicles are by default equipped with communication hardware. This
enables new possibilities of connected services, like vehicles serving as
highly mobile sensor platforms in the Internet of Things (IoT) context. Hereby,
cars need to upload and transfer their data via a mobile communication network
into the cloud for further evaluation. As wireless resources are limited and
shared by all users, data transfers need to be conducted efficiently. Within
the scope of this work three car-to-cloud data transmission algorithms
Channel-Aware Transmission (CAT), predictive CAT (pCAT) and a periodic scheme
are evaluated in an empirical setup. CAT leverages channel quality measurements
to start data uploads preferably when the channel quality is good. CAT's
extension pCAT uses past measurements in addition to estimate future channel
conditions. For the empirical evaluation, a research vehicle was equipped with
a measurement platform. On test drives along a reference route vehicle sensor
data was collected and subsequently uploaded to a cloud server via a Long Term
Evolution (LTE) network.
| cs.NI | nowadays vehicles are by default equipped with communication hardware this enables new possibilities of connected services like vehicles serving as highly mobile sensor platforms in the internet of things iot context hereby cars need to upload and transfer their data via a mobile communication network into the cloud for further evaluation as wireless resources are limited and shared by all users data transfers need to be conducted efficiently within the scope of this work three cartocloud data transmission algorithms channelaware transmission cat predictive cat pcat and a periodic scheme are evaluated in an empirical setup cat leverages channel quality measurements to start data uploads preferably when the channel quality is good cats extension pcat uses past measurements in addition to estimate future channel conditions for the empirical evaluation a research vehicle was equipped with a measurement platform on test drives along a reference route vehicle sensor data was collected and subsequently uploaded to a cloud server via a long term evolution lte network | [['nowadays', 'vehicles', 'are', 'by', 'default', 'equipped', 'with', 'communication', 'hardware', 'this', 'enables', 'new', 'possibilities', 'of', 'connected', 'services', 'like', 'vehicles', 'serving', 'as', 'highly', 'mobile', 'sensor', 'platforms', 'in', 'the', 'internet', 'of', 'things', 'iot', 'context', 'hereby', 'cars', 'need', 'to', 'upload', 'and', 'transfer', 'their', 'data', 'via', 'a', 'mobile', 'communication', 'network', 'into', 'the', 'cloud', 'for', 'further', 'evaluation', 'as', 'wireless', 'resources', 'are', 'limited', 'and', 'shared', 'by', 'all', 'users', 'data', 'transfers', 'need', 'to', 'be', 'conducted', 'efficiently', 'within', 'the', 'scope', 'of', 'this', 'work', 'three', 'cartocloud', 'data', 'transmission', 'algorithms', 'channelaware', 'transmission', 'cat', 'predictive', 'cat', 'pcat', 'and', 'a', 'periodic', 'scheme', 'are', 'evaluated', 'in', 'an', 'empirical', 'setup', 'cat', 'leverages', 'channel', 'quality', 'measurements', 'to', 'start', 'data', 'uploads', 'preferably', 'when', 'the', 'channel', 'quality', 'is', 'good', 'cats', 'extension', 'pcat', 'uses', 'past', 'measurements', 'in', 'addition', 'to', 'estimate', 'future', 'channel', 'conditions', 'for', 'the', 'empirical', 'evaluation', 'a', 'research', 'vehicle', 'was', 'equipped', 'with', 'a', 'measurement', 'platform', 'on', 'test', 'drives', 'along', 'a', 'reference', 'route', 'vehicle', 'sensor', 'data', 'was', 'collected', 'and', 'subsequently', 'uploaded', 'to', 'a', 'cloud', 'server', 'via', 'a', 'long', 'term', 'evolution', 'lte', 'network']] | [-0.1778170753547499, 0.03418144617778566, -0.041186065988706576, 0.00969798283214378, -0.10853473702017104, -0.24083714168004555, 0.10353071564677074, 0.4425927168615391, -0.2548475977450472, -0.3361531595922321, 0.1270614156930349, -0.31126471025515007, -0.09039489942512824, 0.21992726674006302, -0.12458499350750739, 0.10222981467077429, 0.1501638773654479, 0.03338421533238486, 0.032458124219502775, -0.22916505400068554, 0.2788852857428666, 0.08420533473757695, 0.3815066448578531, 0.025178661704223396, 0.05499667997194877, 0.019319438284828665, -0.06211614808741888, -0.04414166919915634, -0.057611966304062505, 0.14980026034415453, 0.31770901989900263, 0.20105720122567625, 0.3153874772440848, -0.4907807506723729, -0.21982946050956137, 0.06378863761030092, 0.1578368346343971, 0.04474391421428853, -0.05370073800155196, -0.3665466015255707, 0.08072025821925616, -0.2641464820348778, -0.07788983802739645, -0.04639644424168199, 0.0002771955971931753, 0.045070112500042635, -0.31108540105433463, -0.03934783756981484, -0.10478149514582488, 0.08381708434274408, -0.0521255404734127, -0.011468366794059612, 0.011116969404867822, 0.218350536560824, -0.010653361238173547, 0.013460097977308773, 0.18021998583750537, -0.11151388015003841, -0.12655224556823266, 0.38107039027081724, -0.02596212244746875, -0.15829462437759056, 0.1544337483130801, -0.003182651612199157, -0.08737750087316187, 0.07868768194793192, 0.23191357172555663, 0.029238378113432804, -0.24651461782155665, -0.014313414568607153, -0.005797187212434672, 0.15919194685615187, 0.042470980194208724, 0.059547008032356304, 0.17810750578421575, 0.23342302890117367, 0.10652089561764265, 0.10128198276656719, -0.10390746992429936, -0.10193383981090931, -0.20713660465210584, -0.16410123762543216, -0.20323085022927403, 0.019611707540011843, -0.04798374880366656, -0.0626340640474545, 0.32726208214223385, 0.16984512601362003, 0.14692301765381377, 0.04528212747279486, 0.42117001904471796, -0.0026673071105690225, 0.1315579531825736, 0.11886525606348014, 0.12806633274439447, 0.02157771469813777, 0.23908222262444764, -0.13685531724684305, 0.0865390341803203, -0.05507507600730136] |
1,802.07477 | Shape Dynamics of Freely Falling Droplets | Oscillating shape motion of a freely falling water droplet has long
fascinated and inspired scientists. We propose dynamic non-linear equations for
closed, two dimensional surfaces in gravity and apply it to analyze shape
dynamics of freely falling water drops. The analytic solutions qualitatively
well explain why drops oscillate among prolate/oblate morphologies and display
a number of features consistent with experiments.
| physics.flu-dyn physics.bio-ph | oscillating shape motion of a freely falling water droplet has long fascinated and inspired scientists we propose dynamic nonlinear equations for closed two dimensional surfaces in gravity and apply it to analyze shape dynamics of freely falling water drops the analytic solutions qualitatively well explain why drops oscillate among prolateoblate morphologies and display a number of features consistent with experiments | [['oscillating', 'shape', 'motion', 'of', 'a', 'freely', 'falling', 'water', 'droplet', 'has', 'long', 'fascinated', 'and', 'inspired', 'scientists', 'we', 'propose', 'dynamic', 'nonlinear', 'equations', 'for', 'closed', 'two', 'dimensional', 'surfaces', 'in', 'gravity', 'and', 'apply', 'it', 'to', 'analyze', 'shape', 'dynamics', 'of', 'freely', 'falling', 'water', 'drops', 'the', 'analytic', 'solutions', 'qualitatively', 'well', 'explain', 'why', 'drops', 'oscillate', 'among', 'prolateoblate', 'morphologies', 'and', 'display', 'a', 'number', 'of', 'features', 'consistent', 'with', 'experiments']] | [-0.09348553729554017, 0.1784025359277924, -0.13954700730052233, 0.07976321469759569, -0.11417570679138105, -0.20183412459058067, -0.03794411768515905, 0.39515168803433576, -0.2403357714424298, -0.2995332325886314, 0.06277042894119707, -0.29251732542179526, -0.16244609109126032, 0.20231193772827585, -0.05794355618054396, 0.03488375727708141, 0.03403645670041442, -0.003314619588976105, -0.03962589805790533, -0.17838332587853073, 0.2385639099093775, -0.04122474764784177, 0.2726781023045381, 0.02107598234433681, 0.14646472906072935, -0.058341247991969186, 0.0020750088151544333, 0.08834428421687335, -0.1968779845784108, 0.04997030528223453, 0.22753708006736512, 0.05574460726541777, 0.21430039623131356, -0.5113348658507069, -0.24134484581494084, 0.045328111946582796, 0.17709780804192027, 0.12299134702576946, -0.07130259549400458, -0.26661410940190156, -0.04223550682266553, -0.15781219348621864, -0.23629552740603685, -0.07749363317464789, 0.0861492537893355, 0.08264004673498372, -0.13501861637535814, 0.10162590713783477, 0.02096991307140949, 0.05541116348467767, -0.12082080831751227, -0.05889656933334966, -0.018161378137301655, 0.14753456523176284, 0.1174260754720308, -0.012937781831715256, 0.19826140652876348, -0.13547506366703602, -0.02880364462422828, 0.3922734941821545, -0.08498855413248142, -0.20813182449977224, 0.2602933429181576, -0.17741723073025545, -0.060768541026239596, 0.1808393346145749, 0.1848695183871314, 0.11940267334381739, -0.10487713987628619, 0.03049721630619994, -0.042611615677985056, 0.17275538501950602, 0.1640529847665069, -0.05603298906547328, 0.30980488372345766, 0.19736727903752277, -0.025480606748412054, 0.17164823350807032, -0.058337852855523425, -0.1413794845342636, -0.2237074103827278, -0.12672154552613696, -0.09512490164488555, 0.01798159528989345, -0.04503333036094167, -0.21219988248000543, 0.38502268915375076, 0.09112816938334921, 0.21438449188135564, 0.07360803154297173, 0.24196821032868077, 0.012526894826442004, 0.04227573286431531, 0.11972072691035768, 0.21963125203425685, 0.08035532130549351, 0.11727223018727576, -0.22288035810925066, 0.025750108552165328, 0.03380889904219657] |
1,802.07478 | Neutrino astrophysics and its connections to nuclear physics | We highlight recent developments in neutrino astrophysics. We discuss some of
the connections with nuclear physics.
| hep-ph nucl-ex nucl-th | we highlight recent developments in neutrino astrophysics we discuss some of the connections with nuclear physics | [['we', 'highlight', 'recent', 'developments', 'in', 'neutrino', 'astrophysics', 'we', 'discuss', 'some', 'of', 'the', 'connections', 'with', 'nuclear', 'physics']] | [-0.0659123215591535, 0.18836412543896586, -0.019001139560714364, 0.15848051710054278, -0.11662052699830383, -0.046810486004687846, -0.0370304862735793, 0.37254382739774883, -0.27073152596130967, -0.29449088824912906, 0.10860809068981325, -0.31434759631520137, -0.2104593524709344, 0.24911342770792544, -0.059416186646558344, 0.002075233729556203, 0.08695670845918357, -0.026601152261719108, -0.2074531823163852, -0.2679351472761482, 0.3329179978463799, 0.11103279097005725, 0.14981749188154936, 0.19582712245710354, 0.03957191278459504, -0.007816554250894114, -0.22545014397474006, -0.08019925490953028, -0.25221654458437115, 0.1889244857011363, 0.3230134203331545, 0.2053590805735439, 0.29078642185777426, -0.5389276295900345, -0.2662009526975453, 0.095314702950418, 0.03351475176168606, 0.16590011725202203, -0.2657967007253319, -0.2506221644580364, -0.06343131163157523, -0.23030039854347706, -0.17245997799545876, -0.10511809840681963, -0.04150986624881625, 0.13743645092472434, -0.06050071585923433, -0.01253415271639824, -0.031154868949670345, -0.017304833512753248, -0.03678890090668574, -0.24551461706869304, 0.21824510279111564, 0.07025229933788069, 0.1522466312162578, -0.01270774591830559, 0.09770611552812625, -0.282617106102407, -0.1914363566902466, 0.37551065441221, 0.032724699631216936, -0.060643545584753156, 0.2213290964718908, -0.26433389633893967, -0.29200979886809364, -0.09182376298122108, 0.17919360543601215, -0.029065342620015144, -0.06697560811880976, 0.20580240990966558, -0.0618729991838336, 0.05302495672367513, -0.04229406808735803, 0.1113700528148911, 0.28968242509290576, 0.29144145804457366, 0.005075388326076791, 0.013749066682066768, -0.14846073287480976, -0.11755946389166638, -0.4015857526101172, -0.09019967931089923, 0.0032558348029851913, 0.059732212335802615, 0.006670264410786331, -0.016683901892974973, 0.4532604810083285, 0.2009663283242844, 0.21208362467586994, -0.12235570617485791, 0.20173718500882387, -0.02513345080660656, -0.027238291455432773, 0.07237289531622082, 0.3554312778669555, 0.2967707645148039, 0.1641961072164122, -0.25425943452864885, -0.05152705890213838, 0.054015462927054614] |
1,802.07479 | Optimal Base Station Antenna Downtilt in Downlink Cellular Networks | From very recent studies, the area spectral efficiency (ASE) performance of
downlink (DL) cellular networks will continuously decrease and finally to zero
with the network densification in a fully loaded ultra-dense network (UDN) when
the absolute height difference between a base station (BS) antenna and a user
equipment (UE) antenna is larger than zero, which is referred as the ASE Crash.
We revisit this issue by considering the impact of the BS antenna downtilt on
the downlink network capacity. In general, there exists a height difference
between a BS and a UE in practical networks. It is common to utilize antenna
downtilt to adjust the direction of the vertical antenna pattern, and thus
increase received signal power or reduce inter-cell interference power to
improve network performance. This paper focuses on investigating the
relationship between the base station antenna downtilt and the downlink network
capacity in terms of the coverage probability and the ASE. The analytical
results of the coverage probability and the ASE are derived, and we find that
there exists an optimal antenna downtilt to achieve the maximal coverage
probability for each base station density. Moreover, we derive numerically
solvable expressions for the optimal antenna downtilt, which is a function of
the base station density. Our theoretical and numerical results show that after
applying the optimal antenna downtilt, the network performance can be improved
significantly. Specifically, with the optimal antenna downtilt, the ASE crash
can be delayed by nearly one order of magnitude in terms of the base station
density.
| cs.NI cs.IT math.IT | from very recent studies the area spectral efficiency ase performance of downlink dl cellular networks will continuously decrease and finally to zero with the network densification in a fully loaded ultradense network udn when the absolute height difference between a base station bs antenna and a user equipment ue antenna is larger than zero which is referred as the ase crash we revisit this issue by considering the impact of the bs antenna downtilt on the downlink network capacity in general there exists a height difference between a bs and a ue in practical networks it is common to utilize antenna downtilt to adjust the direction of the vertical antenna pattern and thus increase received signal power or reduce intercell interference power to improve network performance this paper focuses on investigating the relationship between the base station antenna downtilt and the downlink network capacity in terms of the coverage probability and the ase the analytical results of the coverage probability and the ase are derived and we find that there exists an optimal antenna downtilt to achieve the maximal coverage probability for each base station density moreover we derive numerically solvable expressions for the optimal antenna downtilt which is a function of the base station density our theoretical and numerical results show that after applying the optimal antenna downtilt the network performance can be improved significantly specifically with the optimal antenna downtilt the ase crash can be delayed by nearly one order of magnitude in terms of the base station density | [['from', 'very', 'recent', 'studies', 'the', 'area', 'spectral', 'efficiency', 'ase', 'performance', 'of', 'downlink', 'dl', 'cellular', 'networks', 'will', 'continuously', 'decrease', 'and', 'finally', 'to', 'zero', 'with', 'the', 'network', 'densification', 'in', 'a', 'fully', 'loaded', 'ultradense', 'network', 'udn', 'when', 'the', 'absolute', 'height', 'difference', 'between', 'a', 'base', 'station', 'bs', 'antenna', 'and', 'a', 'user', 'equipment', 'ue', 'antenna', 'is', 'larger', 'than', 'zero', 'which', 'is', 'referred', 'as', 'the', 'ase', 'crash', 'we', 'revisit', 'this', 'issue', 'by', 'considering', 'the', 'impact', 'of', 'the', 'bs', 'antenna', 'downtilt', 'on', 'the', 'downlink', 'network', 'capacity', 'in', 'general', 'there', 'exists', 'a', 'height', 'difference', 'between', 'a', 'bs', 'and', 'a', 'ue', 'in', 'practical', 'networks', 'it', 'is', 'common', 'to', 'utilize', 'antenna', 'downtilt', 'to', 'adjust', 'the', 'direction', 'of', 'the', 'vertical', 'antenna', 'pattern', 'and', 'thus', 'increase', 'received', 'signal', 'power', 'or', 'reduce', 'intercell', 'interference', 'power', 'to', 'improve', 'network', 'performance', 'this', 'paper', 'focuses', 'on', 'investigating', 'the', 'relationship', 'between', 'the', 'base', 'station', 'antenna', 'downtilt', 'and', 'the', 'downlink', 'network', 'capacity', 'in', 'terms', 'of', 'the', 'coverage', 'probability', 'and', 'the', 'ase', 'the', 'analytical', 'results', 'of', 'the', 'coverage', 'probability', 'and', 'the', 'ase', 'are', 'derived', 'and', 'we', 'find', 'that', 'there', 'exists', 'an', 'optimal', 'antenna', 'downtilt', 'to', 'achieve', 'the', 'maximal', 'coverage', 'probability', 'for', 'each', 'base', 'station', 'density', 'moreover', 'we', 'derive', 'numerically', 'solvable', 'expressions', 'for', 'the', 'optimal', 'antenna', 'downtilt', 'which', 'is', 'a', 'function', 'of', 'the', 'base', 'station', 'density', 'our', 'theoretical', 'and', 'numerical', 'results', 'show', 'that', 'after', 'applying', 'the', 'optimal', 'antenna', 'downtilt', 'the', 'network', 'performance', 'can', 'be', 'improved', 'significantly', 'specifically', 'with', 'the', 'optimal', 'antenna', 'downtilt', 'the', 'ase', 'crash', 'can', 'be', 'delayed', 'by', 'nearly', 'one', 'order', 'of', 'magnitude', 'in', 'terms', 'of', 'the', 'base', 'station', 'density']] | [-0.22185646645739615, 0.03614490732335647, 0.0022701450078135943, 0.016120308512020336, -0.053717325788466226, -0.18280132842691713, 0.17204680127616734, 0.39923005385984817, -0.2242390044187511, -0.26957636854177214, 0.06310879102809748, -0.24900844983340972, -0.20133296584532379, 0.13860158751017426, -0.09751937335145575, 0.015905035602158876, 0.06063627511210947, 0.06950823390537286, -0.0454496668254682, -0.20555846220108706, 0.28446594756783034, 0.179326074153363, 0.4094166908027285, 0.04817384256762397, 0.07421262751090381, -0.01575540382214692, -0.014778261892015181, 0.010026706023646362, -0.09342113425761538, 0.09217222526565609, 0.3352339574018961, 0.18758425676260157, 0.25385461853765157, -0.42314516309930744, -0.2465855434455304, 0.09762796640128966, 0.14853531934610342, 0.018719785756791434, 0.00038557266491832606, -0.23029112492676868, 0.13873696888414808, -0.24820676481488543, -0.0891522286289123, 0.06727492268312263, -0.04603786031953041, 0.10403067535587189, -0.3652958967115366, -0.03028761988029856, -0.026191699075553403, 0.03051188282892783, -0.011502195903344963, -0.13228963555784828, -0.01438875527462488, 0.18826092104763775, 0.05641657989973061, 0.017914800728444917, 0.11126206515253005, -0.09529327535704965, -0.062273575408120764, 0.34086976036340355, -0.0332857204098055, -0.24586193831229353, 0.10213151386293372, -0.15599300438057923, -0.041405297350138426, 0.18245103979943342, 0.2398296554917952, 0.044822167347285495, -0.1270982828453314, 0.028542066879516683, -0.0043859790998559255, 0.19112209833957128, 0.12823319023259844, 0.07247657636741725, 0.15895110572803306, 0.22414749441436488, 0.17895603860984463, 0.13909672135283124, -0.17239448215545292, -0.0951470348536894, -0.20844793685923416, -0.10137516884801101, -0.22306537235422855, 0.028837641718726888, -0.11976005028383908, -0.04790942842489576, 0.3774079700553441, 0.10305134536312574, 0.13039379494183093, 0.12773848546156846, 0.3936237779277121, 0.14469790915620934, 0.057962009662843914, 0.10981379172660825, 0.216876779442045, 0.10524548270991925, 0.14502199698402823, -0.2617518224835069, 0.0380796789218564, -0.022094996384923824] |
1,802.0748 | Collective Dynamics of Self-propelled Semiflexible Filaments | The collective behavior of active semiflexible filaments is studied with a
model of tangentially driven self-propelled worm-like chains. The combination
of excluded-volume interactions and self-propulsion leads to several distinct
dynamic phases as a function of bending rigidity, activity, and aspect ratio of
individual filaments. We consider first the case of intermediate filament
density. For high-aspect-ratio filaments, we identify a transition with
increasing propulsion from a state of free-swimming filaments to a state of
spiraled filaments with nearly frozen translational motion. For lower aspect
ratios, this gas-of-spirals phase is suppressed with growing density due to
filament collisions; instead, filaments form clusters similar to self-propelled
rods, as activity increases. Finite bending rigidity strongly effects the
dynamics and phase behavior. Flexible filaments form small and transient
clusters, while stiffer filaments organize into giant clusters, similarly as
self-propelled rods, but with a reentrant phase behavior from giant to smaller
clusters as activity becomes large enough to bend the filaments. For high
filament densities, we identify a nearly frozen jamming state at low
activities, a nematic laning state at intermediate activities, and an
active-turbulence state at high activities. The latter state is characterized
by a power-law decay of the energy spectrum as a function of wave number. The
resulting phase diagrams encapsulate tunable non-equilibrium steady states that
can be used in the organization of living matter.
| physics.bio-ph cond-mat.soft q-bio.SC | the collective behavior of active semiflexible filaments is studied with a model of tangentially driven selfpropelled wormlike chains the combination of excludedvolume interactions and selfpropulsion leads to several distinct dynamic phases as a function of bending rigidity activity and aspect ratio of individual filaments we consider first the case of intermediate filament density for highaspectratio filaments we identify a transition with increasing propulsion from a state of freeswimming filaments to a state of spiraled filaments with nearly frozen translational motion for lower aspect ratios this gasofspirals phase is suppressed with growing density due to filament collisions instead filaments form clusters similar to selfpropelled rods as activity increases finite bending rigidity strongly effects the dynamics and phase behavior flexible filaments form small and transient clusters while stiffer filaments organize into giant clusters similarly as selfpropelled rods but with a reentrant phase behavior from giant to smaller clusters as activity becomes large enough to bend the filaments for high filament densities we identify a nearly frozen jamming state at low activities a nematic laning state at intermediate activities and an activeturbulence state at high activities the latter state is characterized by a powerlaw decay of the energy spectrum as a function of wave number the resulting phase diagrams encapsulate tunable nonequilibrium steady states that can be used in the organization of living matter | [['the', 'collective', 'behavior', 'of', 'active', 'semiflexible', 'filaments', 'is', 'studied', 'with', 'a', 'model', 'of', 'tangentially', 'driven', 'selfpropelled', 'wormlike', 'chains', 'the', 'combination', 'of', 'excludedvolume', 'interactions', 'and', 'selfpropulsion', 'leads', 'to', 'several', 'distinct', 'dynamic', 'phases', 'as', 'a', 'function', 'of', 'bending', 'rigidity', 'activity', 'and', 'aspect', 'ratio', 'of', 'individual', 'filaments', 'we', 'consider', 'first', 'the', 'case', 'of', 'intermediate', 'filament', 'density', 'for', 'highaspectratio', 'filaments', 'we', 'identify', 'a', 'transition', 'with', 'increasing', 'propulsion', 'from', 'a', 'state', 'of', 'freeswimming', 'filaments', 'to', 'a', 'state', 'of', 'spiraled', 'filaments', 'with', 'nearly', 'frozen', 'translational', 'motion', 'for', 'lower', 'aspect', 'ratios', 'this', 'gasofspirals', 'phase', 'is', 'suppressed', 'with', 'growing', 'density', 'due', 'to', 'filament', 'collisions', 'instead', 'filaments', 'form', 'clusters', 'similar', 'to', 'selfpropelled', 'rods', 'as', 'activity', 'increases', 'finite', 'bending', 'rigidity', 'strongly', 'effects', 'the', 'dynamics', 'and', 'phase', 'behavior', 'flexible', 'filaments', 'form', 'small', 'and', 'transient', 'clusters', 'while', 'stiffer', 'filaments', 'organize', 'into', 'giant', 'clusters', 'similarly', 'as', 'selfpropelled', 'rods', 'but', 'with', 'a', 'reentrant', 'phase', 'behavior', 'from', 'giant', 'to', 'smaller', 'clusters', 'as', 'activity', 'becomes', 'large', 'enough', 'to', 'bend', 'the', 'filaments', 'for', 'high', 'filament', 'densities', 'we', 'identify', 'a', 'nearly', 'frozen', 'jamming', 'state', 'at', 'low', 'activities', 'a', 'nematic', 'laning', 'state', 'at', 'intermediate', 'activities', 'and', 'an', 'activeturbulence', 'state', 'at', 'high', 'activities', 'the', 'latter', 'state', 'is', 'characterized', 'by', 'a', 'powerlaw', 'decay', 'of', 'the', 'energy', 'spectrum', 'as', 'a', 'function', 'of', 'wave', 'number', 'the', 'resulting', 'phase', 'diagrams', 'encapsulate', 'tunable', 'nonequilibrium', 'steady', 'states', 'that', 'can', 'be', 'used', 'in', 'the', 'organization', 'of', 'living', 'matter']] | [-0.19123349952714552, 0.27914619569824295, -0.07970367814866043, 0.031066211458236046, -0.042837716349864115, -0.11028098053464742, 0.02827301970098304, 0.3900687968895024, -0.24308720176197487, -0.2959734314370084, 0.031205084079719194, -0.273982138810977, -0.12282339487752142, 0.07984440219716156, 0.05742014094880999, -0.0060399473627782575, 0.005089564220214339, -0.01879333942431157, 0.008894318645632907, -0.1312176403972282, 0.23986816092566524, 0.05425414839147093, 0.3064447693764891, -0.008952974807471037, 0.0948711521625859, -0.041578602248836805, 0.08440252481513236, 0.07708397126633283, -0.16846851109900882, 0.04282756494961522, 0.2276580268984924, -0.015772578646705303, 0.21857773852811013, -0.46296163476561303, -0.216450477137494, 0.08208626177221469, 0.23196233434126326, 0.10888521731661029, -0.02788601683656851, -0.26784036372847786, 0.04212423354242695, -0.19011865184986837, -0.18611999958557965, -0.036657130752358436, 0.06543720057701956, 0.0793433621678327, -0.18710383391815777, 0.16552650549164102, 0.029649467272343768, 0.055025782245296355, -0.08685207960608343, -0.06598799028667753, -0.059003861380749506, 0.12546086737877565, 0.07837928440177294, 0.037301978538637835, 0.2760623999611904, -0.20237265471911237, -0.0444790677456653, 0.3721379712904425, -0.02774836415729005, -0.1212238621340903, 0.2503445892973237, -0.14869924916756355, -0.14870760244166917, 0.2409304537933711, 0.18229704335295768, 0.08396906143673122, -0.09625588923258936, -0.06551352475855401, 0.003244665679992304, 0.19901211068595517, 0.04371077311544182, -0.00018533136691370784, 0.28194891782179815, 0.20361723402434254, 0.06840176963710894, 0.2169766038008774, -0.08809968134011971, -0.12794533818875137, -0.22861966489895022, -0.12150323872781915, -0.15552492333272022, 0.0224926439583696, -0.08983933494380329, -0.20246625213020536, 0.3241160360189393, 0.01430607818919723, 0.2563751342425444, 0.07283247064439724, 0.24718998629625324, 0.02970018460825681, 0.05623817102787974, 0.06314352724794724, 0.2477302098238509, 0.1671332927605724, 0.1259610257653698, -0.23580369817679875, 0.08242802738348133, 0.026026678647948047] |
1,802.07481 | Celer: a Fast Solver for the Lasso with Dual Extrapolation | Convex sparsity-inducing regularizations are ubiquitous in high-dimensional
machine learning, but solving the resulting optimization problems can be slow.
To accelerate solvers, state-of-the-art approaches consist in reducing the size
of the optimization problem at hand. In the context of regression, this can be
achieved either by discarding irrelevant features (screening techniques) or by
prioritizing features likely to be included in the support of the solution
(working set techniques). Duality comes into play at several steps in these
techniques. Here, we propose an extrapolation technique starting from a
sequence of iterates in the dual that leads to the construction of improved
dual points. This enables a tighter control of optimality as used in stopping
criterion, as well as better screening performance of Gap Safe rules. Finally,
we propose a working set strategy based on an aggressive use of Gap Safe
screening rules. Thanks to our new dual point construction, we show significant
computational speedups on multiple real-world problems.
| stat.ML | convex sparsityinducing regularizations are ubiquitous in highdimensional machine learning but solving the resulting optimization problems can be slow to accelerate solvers stateoftheart approaches consist in reducing the size of the optimization problem at hand in the context of regression this can be achieved either by discarding irrelevant features screening techniques or by prioritizing features likely to be included in the support of the solution working set techniques duality comes into play at several steps in these techniques here we propose an extrapolation technique starting from a sequence of iterates in the dual that leads to the construction of improved dual points this enables a tighter control of optimality as used in stopping criterion as well as better screening performance of gap safe rules finally we propose a working set strategy based on an aggressive use of gap safe screening rules thanks to our new dual point construction we show significant computational speedups on multiple realworld problems | [['convex', 'sparsityinducing', 'regularizations', 'are', 'ubiquitous', 'in', 'highdimensional', 'machine', 'learning', 'but', 'solving', 'the', 'resulting', 'optimization', 'problems', 'can', 'be', 'slow', 'to', 'accelerate', 'solvers', 'stateoftheart', 'approaches', 'consist', 'in', 'reducing', 'the', 'size', 'of', 'the', 'optimization', 'problem', 'at', 'hand', 'in', 'the', 'context', 'of', 'regression', 'this', 'can', 'be', 'achieved', 'either', 'by', 'discarding', 'irrelevant', 'features', 'screening', 'techniques', 'or', 'by', 'prioritizing', 'features', 'likely', 'to', 'be', 'included', 'in', 'the', 'support', 'of', 'the', 'solution', 'working', 'set', 'techniques', 'duality', 'comes', 'into', 'play', 'at', 'several', 'steps', 'in', 'these', 'techniques', 'here', 'we', 'propose', 'an', 'extrapolation', 'technique', 'starting', 'from', 'a', 'sequence', 'of', 'iterates', 'in', 'the', 'dual', 'that', 'leads', 'to', 'the', 'construction', 'of', 'improved', 'dual', 'points', 'this', 'enables', 'a', 'tighter', 'control', 'of', 'optimality', 'as', 'used', 'in', 'stopping', 'criterion', 'as', 'well', 'as', 'better', 'screening', 'performance', 'of', 'gap', 'safe', 'rules', 'finally', 'we', 'propose', 'a', 'working', 'set', 'strategy', 'based', 'on', 'an', 'aggressive', 'use', 'of', 'gap', 'safe', 'screening', 'rules', 'thanks', 'to', 'our', 'new', 'dual', 'point', 'construction', 'we', 'show', 'significant', 'computational', 'speedups', 'on', 'multiple', 'realworld', 'problems']] | [-0.05698858257472658, 0.028388499043686375, -0.11718172661195962, 0.07928613878231353, -0.10500367983984642, -0.15859177271322084, 0.0965488309157081, 0.3860814035810435, -0.3167981771238817, -0.30664499937735784, 0.14185327125149064, -0.22725730346073994, -0.1600481541655683, 0.2184119082387322, -0.12330643910443029, 0.08788591820689945, 0.09145405096336244, -0.02376374897833627, -0.10741719947262214, -0.2815199634179664, 0.2857861328356637, 0.053576722072485164, 0.30249158880756927, 0.04266884646867999, 0.08504655682895063, 0.009280875543108543, -0.016608044278258696, 0.0558070661380696, -0.044499315220188386, 0.15050569148540185, 0.318984969256398, 0.18228209474816537, 0.3680537292160667, -0.4461227184734665, -0.18831920399567864, 0.09109419806508157, 0.18079134795549087, 0.10649793731788985, -0.04192996942527735, -0.23607810858475903, 0.08851747835825126, -0.12320775367996435, -0.09264286246914895, -0.14334550633886978, -0.08156718906516638, -0.006595136732824194, -0.32446872451318765, 0.030386053138406564, 0.06176430738252328, 0.0354631640500604, -0.05181779162450813, -0.14743003515878883, 0.06449662527227655, 0.11191538992063262, 0.06071397975887148, 0.037797047301398545, 0.1258847823885914, -0.14296220582671082, -0.18170914716588762, 0.3691726981614454, -0.03443065626757184, -0.20771312979885784, 0.2212276835940802, 0.003894493371869127, -0.13801294656542057, 0.13942266754710522, 0.23655205165955406, 0.16639566203603187, -0.15545268709777305, 0.06782810722525494, -0.0059957755699706, 0.1379923031328452, 0.06002562892778466, 0.03548624960836978, 0.18861845500904542, 0.2214789124793755, 0.11902186066174927, 0.16220012569325404, -0.04685144039551513, -0.10729971690344452, -0.27447143544253405, -0.10295461533547869, -0.16257008936447212, -0.004217404172008033, -0.12271053512067272, -0.15824737280863935, 0.3431405250747234, 0.2045540086319073, 0.19959532487458395, 0.05391896346722765, 0.3028643078600558, 0.12333783396024955, 0.13243919849180832, 0.07535745299910793, 0.20891313901609884, 0.03919253963641285, 0.06521429204328272, -0.22816373520748665, 0.044659558114989735, 0.11550526068999599] |
1,802.07482 | The BMM symmetrising trace conjecture for groups
$G_4,\,G_5,\,G_6,\,G_7,\,G_8$ | We prove the BMM symmetrising trace conjecture for the exceptional complex
reflection groups $G_4,\,G_5,\,G_6,\,G_7,\,G_8$ using a combination of
algorithms programmed in different languages (C++, SAGE, GAP3, Mathematica).
Our proof depends on the choice of a suitable basis for the generic Hecke
algebra associated with each group.
| math.RT | we prove the bmm symmetrising trace conjecture for the exceptional complex reflection groups g_4g_5g_6g_7g_8 using a combination of algorithms programmed in different languages c sage gap3 mathematica our proof depends on the choice of a suitable basis for the generic hecke algebra associated with each group | [['we', 'prove', 'the', 'bmm', 'symmetrising', 'trace', 'conjecture', 'for', 'the', 'exceptional', 'complex', 'reflection', 'groups', 'g_4g_5g_6g_7g_8', 'using', 'a', 'combination', 'of', 'algorithms', 'programmed', 'in', 'different', 'languages', 'c', 'sage', 'gap3', 'mathematica', 'our', 'proof', 'depends', 'on', 'the', 'choice', 'of', 'a', 'suitable', 'basis', 'for', 'the', 'generic', 'hecke', 'algebra', 'associated', 'with', 'each', 'group']] | [-0.15352381144740238, 0.0020054547031494703, -0.10714468783275648, 0.037217008309777484, -0.1370718811469322, -0.19609761078291657, 0.02804628477050838, 0.3515795727726072, -0.2928562477781353, -0.23129682037556035, 0.11935763037498956, -0.1658563517743129, -0.14459914475975727, 0.2576297032011842, -0.07044863489202478, -0.014821721928786825, 0.10623528563883156, 0.07863817269257693, -0.11350780854594301, -0.25260161682540044, 0.3807842154055834, -0.0045745303028855815, 0.2319092918399044, 0.006219926120882685, 0.10747493300798604, 0.0737845828354528, -0.06712854471565648, -0.06658871535381133, -0.10798577053091404, 0.16133162748089738, 0.2719406815065833, 0.148975202861369, 0.1947801979893649, -0.3665144449438561, -0.049515953245810866, 0.09718984344296834, 0.13621116653799123, 0.050559230741452084, -0.057833430015968836, -0.2660808634245768, 0.051941239200955766, -0.19643116810105063, -0.15830747061409056, -0.05581214729781178, 0.0413509323050014, 0.03494143663820895, -0.24817907272584058, -0.02666649412871762, 0.010706237898292866, 0.17553829746744173, -0.05909482852174816, -0.15441585472911934, -0.03586125898238441, 0.08403273502534087, -0.07333892410282385, -0.00765419018518349, 0.16102909835436466, -0.04330971703166142, -0.15531971331008457, 0.3675798745825887, -0.051715750797567045, -0.19398279623551803, 0.18854214380156586, -0.12158550118858164, -0.2684859698849984, 0.08946794445033777, 0.09739833246831867, 0.133801802103831, -0.043839464683763006, 0.19977994915097952, -0.1230876048569123, 0.12687290510670704, 0.10298732987774367, -0.054932265399574215, 0.1367512816478583, 0.08645308828404681, 0.013874082889577205, 0.12328671712682328, 0.06818652274060613, -0.002442786872217601, -0.3614412891593846, -0.2415431369815699, -0.14365730697119777, 0.024887487821450286, -0.16604916107925502, -0.18845466556641358, 0.40776097537441686, 0.0877655646763742, 0.11502415454015136, 0.12233067107048225, 0.2057936271144585, 0.12459838063593699, 0.13733863521801223, 0.07724432477896864, 0.07086443275065077, 0.1525050115940923, -0.0015503092171539638, -0.21930050231855025, 0.03329899003305896, 0.15981944574741647] |
1,802.07483 | Hilfer-Hadamard-Type Fractional Differential Equation with Cauchy-Type
Problem | In this paper, we consider the Cauchy-type problem (1.1) involving
Hilfer-Hadamard-type fractional derivative for a nonlinear fractional
differential equation. We prove an equivalence between the Cauchy-type problem
(1.1) and Volterra integral equation(VIE), existence, and uniqueness. We
present a slight generalization for the Gronwall inequality which was used in
studying the continuous dependence of a solution for the Cauchy-type problem
(1.2).
| math.AP | in this paper we consider the cauchytype problem 11 involving hilferhadamardtype fractional derivative for a nonlinear fractional differential equation we prove an equivalence between the cauchytype problem 11 and volterra integral equationvie existence and uniqueness we present a slight generalization for the gronwall inequality which was used in studying the continuous dependence of a solution for the cauchytype problem 12 | [['in', 'this', 'paper', 'we', 'consider', 'the', 'cauchytype', 'problem', '11', 'involving', 'hilferhadamardtype', 'fractional', 'derivative', 'for', 'a', 'nonlinear', 'fractional', 'differential', 'equation', 'we', 'prove', 'an', 'equivalence', 'between', 'the', 'cauchytype', 'problem', '11', 'and', 'volterra', 'integral', 'equationvie', 'existence', 'and', 'uniqueness', 'we', 'present', 'a', 'slight', 'generalization', 'for', 'the', 'gronwall', 'inequality', 'which', 'was', 'used', 'in', 'studying', 'the', 'continuous', 'dependence', 'of', 'a', 'solution', 'for', 'the', 'cauchytype', 'problem', '12']] | [-0.14926368269627377, -0.025630267303174567, -0.06961714163604113, 0.11444163724377562, -0.10213409941959178, -0.11181356106742711, -0.00036835534916401417, 0.2750338454872875, -0.3492929814067685, -0.2791169338812262, 0.17301473336025947, -0.27779001676303855, -0.18427679826647547, 0.19425852123205944, -0.08010120737224312, 0.10576830518637169, 0.015871539475175285, -0.0029069310748728655, -0.11830624712974433, -0.19739486599514672, 0.3631712823190679, -0.11161483589054669, 0.1725293989372203, 0.06193371221296868, 0.1926697923375641, 0.05708642265664698, -0.035880872758768376, -0.00792819098964081, -0.20145330580061901, 0.13638661490256063, 0.2147893590568486, 0.022167895387826583, 0.33482475379103066, -0.3661934692033772, -0.16504375057263396, 0.1730123781046625, 0.08762843780598398, 0.06215566609220548, -0.07907498672494065, -0.29827335113817355, 0.025247409343877335, -0.12606214804543278, -0.20663821663889023, -0.01737809184962347, 0.041310647849814364, 0.02470931467615952, -0.32603395035316757, 0.18705979534188064, 0.09462809535848388, 0.02945811371047689, -0.16581972309593426, -0.07793819620195082, 0.08255005738366458, 0.02627199589101187, 0.00743384025320095, -0.0046155703001482, -0.0594000670411703, -0.10422420049465056, -0.1670625795594464, 0.31375349194632246, -0.13914793734517644, -0.2961069146897328, 0.09042455093398438, -0.11595681095022266, -0.20316356017996193, 0.07502692266350974, 0.14167308995216074, 0.1893696744721067, -0.1989849091081296, 0.11240295914862053, -0.09328421382864906, 0.14836592209856894, 0.1266361491723081, -0.01111769892859383, 0.04859440963936307, 0.16065016944529648, 0.16535621476596443, 0.23253563122224, -0.03490374614958162, -0.11844395492541587, -0.35364450305952866, -0.2417947335950083, -0.09931208054393025, 0.12656332678319412, -0.10258794273595105, -0.16359763717184128, 0.357057976931081, 0.11183060548994374, 0.12132370989706556, 0.10894160771592504, 0.1589667346581059, 0.27605513670734305, -0.07041702081717677, 0.031769099045481725, 0.18427882684489427, 0.20357344621176815, 0.192835792804421, -0.23154772845120564, -0.012322966096196639, 0.21139491781971212] |
1,802.07484 | A Godunov type scheme for a class of LWR traffic flow models with
non-local flux | We present a Godunov type numerical scheme for a class of scalar conservation
laws with non-local flux arising for example in traffic flow models. The
proposed scheme delivers more accurate solutions than the widely used
Lax-Friedrichs type scheme. In contrast to other approaches, we consider a
non-local mean velocity instead of a mean density and provide $L^\infty$ and
bounded variation estimates for the sequence of approximate solutions. Together
with a discrete entropy inequality, we also show the well-posedness of the
considered class of scalar conservation laws. The better accuracy of the
Godunov type scheme in comparison to Lax-Friedrichs is proved by a variety of
numerical examples.
| math.NA | we present a godunov type numerical scheme for a class of scalar conservation laws with nonlocal flux arising for example in traffic flow models the proposed scheme delivers more accurate solutions than the widely used laxfriedrichs type scheme in contrast to other approaches we consider a nonlocal mean velocity instead of a mean density and provide linfty and bounded variation estimates for the sequence of approximate solutions together with a discrete entropy inequality we also show the wellposedness of the considered class of scalar conservation laws the better accuracy of the godunov type scheme in comparison to laxfriedrichs is proved by a variety of numerical examples | [['we', 'present', 'a', 'godunov', 'type', 'numerical', 'scheme', 'for', 'a', 'class', 'of', 'scalar', 'conservation', 'laws', 'with', 'nonlocal', 'flux', 'arising', 'for', 'example', 'in', 'traffic', 'flow', 'models', 'the', 'proposed', 'scheme', 'delivers', 'more', 'accurate', 'solutions', 'than', 'the', 'widely', 'used', 'laxfriedrichs', 'type', 'scheme', 'in', 'contrast', 'to', 'other', 'approaches', 'we', 'consider', 'a', 'nonlocal', 'mean', 'velocity', 'instead', 'of', 'a', 'mean', 'density', 'and', 'provide', 'linfty', 'and', 'bounded', 'variation', 'estimates', 'for', 'the', 'sequence', 'of', 'approximate', 'solutions', 'together', 'with', 'a', 'discrete', 'entropy', 'inequality', 'we', 'also', 'show', 'the', 'wellposedness', 'of', 'the', 'considered', 'class', 'of', 'scalar', 'conservation', 'laws', 'the', 'better', 'accuracy', 'of', 'the', 'godunov', 'type', 'scheme', 'in', 'comparison', 'to', 'laxfriedrichs', 'is', 'proved', 'by', 'a', 'variety', 'of', 'numerical', 'examples']] | [-0.12257652248602958, -0.004271768323444533, -0.08634168511906744, 0.10486741811761914, -0.058750684627876526, -0.17227197107243933, 0.00018089195990161794, 0.30750542179734075, -0.2427243785054054, -0.28838336916491036, 0.09489979075360165, -0.2526349024319986, -0.1066529527921581, 0.23626964070992368, -0.08487490111223932, 0.11314662285522505, 0.055817764880627674, 0.004912294586077069, -0.0987475660985406, -0.21107106576541895, 0.3347228315992738, -0.0333489148157104, 0.2967531575364465, 0.02758459371013813, 0.14097665865325704, -0.07164428010308359, -0.07370647907977537, 0.064216766154991, -0.16059608261961983, 0.1413627465602608, 0.19137136868953092, 0.052215072638267336, 0.29366655484148585, -0.4028981141921765, -0.2988523798818999, 0.12364964323329194, 0.12086687881262305, 0.11749986348287114, -0.08555213168314504, -0.24724356425082628, 0.11278520219954925, -0.19710214339737026, -0.1856685600568593, -0.09918246279417905, -0.014913840324811216, 0.09996262924495276, -0.342697279193913, 0.16207626160208952, 0.04701937361673083, 0.040880793688010494, -0.10066434542015898, -0.06781976697263571, -0.011410304266115967, 0.030906682117965142, 0.048023296885833774, -0.010195939476549063, 0.043921319271420255, -0.11835534302605633, -0.10181197064340045, 0.3900084950926028, -0.11581683353664253, -0.29560259637370145, 0.16428713268547687, -0.06237236477592784, -0.11209650838062307, 0.12254582471565677, 0.17499511268095308, 0.17652935954689417, -0.11235845851588924, 0.052136343533726724, -0.03327819763546599, 0.15460834726866968, 0.01686783258820761, 0.029357824123130656, 0.06549758720650987, 0.1369293278504936, 0.15527651358817546, 0.10381378003292857, -0.07879074544861105, -0.15164384465084746, -0.36755032661669657, -0.16752409213318661, -0.14990006104322537, 0.045953586284633516, -0.10938061271626107, -0.15530917268105834, 0.3681306644250312, 0.11866998127749506, 0.11283042864381986, 0.12112905896040348, 0.2809851861576427, 0.16686056735310353, 0.02747770548218264, 0.1111170864215929, 0.2061010086557494, 0.1712996139441494, 0.16536524175349973, -0.22301209714694195, 0.016547156721880694, 0.2078480026666855] |
1,802.07485 | Perfect powers that are sums of squares in a three term arithmetic
progression | We determine primitive solutions to the equation $(x-r)^2 + x^2 + (x+r)^2 =
y^n$ for $1 \le r \le 5,000$, making use of a factorization argument and the
Primitive Divisors Theorem due to Bilu, Hanrot and Voutier.
| math.NT | we determine primitive solutions to the equation xr2 x2 xr2 yn for 1 le r le 5000 making use of a factorization argument and the primitive divisors theorem due to bilu hanrot and voutier | [['we', 'determine', 'primitive', 'solutions', 'to', 'the', 'equation', 'xr2', 'x2', 'xr2', 'yn', 'for', '1', 'le', 'r', 'le', '5000', 'making', 'use', 'of', 'a', 'factorization', 'argument', 'and', 'the', 'primitive', 'divisors', 'theorem', 'due', 'to', 'bilu', 'hanrot', 'and', 'voutier']] | [-0.15888100489974022, 0.028971210065778467, -0.13100833793906796, 0.10036674442310486, -0.07168388147387773, -0.19740378398508315, 0.06288591789592418, 0.23865907843555173, -0.3325918138988556, -0.2402150149066602, 0.11045234036000987, -0.3791221030537159, -0.08282501017674804, 0.15620894381596195, -0.06004942499942357, 0.017129513405023084, -0.0006328012433744246, 0.016279812030974897, -0.03710267939154179, -0.2478163499955929, 0.3156718529099899, -0.04335698948031472, 0.12447174217912459, 0.06945491371856581, 0.13371433530964197, 0.07550381944184342, -0.0067421012828426975, -0.13621936278838304, -0.24287479692288944, 0.10061477796144543, 0.26908484654080483, 0.13715089959723334, 0.25213348993190354, -0.3208520992869331, -0.05798483219358229, 0.14950858290878036, 0.17304810515094188, 0.00941033827351226, 0.044631713430487344, -0.1813169709526964, 0.22669545018805132, -0.20620550419534406, -0.24514739056147875, -0.10592113477328131, 0.1168452967258711, 0.04157636161412923, -0.3373886711234527, 0.017944337169249213, 0.11632551982878678, 0.10226809575913413, -0.03012701805170265, -0.19644988099894217, 0.04145547405125633, 0.029011485872850303, 0.020521549988658197, 0.057909228658724214, 0.020340023457162803, -0.07539503432569965, 0.005450375318046539, 0.3563842780647739, -0.011060911020444285, -0.16071174474012467, 0.12339810873832434, -0.11212031387033002, -0.16962803728998668, 0.09939713457659367, 0.0825495652463888, 0.2047052489323241, -0.04158683538797402, 0.18834473323001857, -0.02475589636953608, 0.19935498290484951, 0.16292675921032507, -0.014674588130982292, 0.05663885885188656, 0.005497043576812552, -0.023329437398652154, 0.023703547585154732, -0.03525355914908071, -0.02993303013124293, -0.24421935756841012, -0.2125885773209795, -0.17790049194328247, 0.1964438240824928, -0.1749303660706632, -0.11794124889157472, 0.27200973322314603, 0.139328972631765, 0.1496200731564914, 0.1140839871199381, 0.1733129962437576, 0.0790397901568682, -0.012119768502851647, 0.09847116935998201, 0.11007966017050128, 0.2362416523298429, 0.0490295787401978, -0.12216587710164246, -0.02657047496177256, 0.19545733165596763] |
1,802.07486 | Data-Driven Forecasting of High-Dimensional Chaotic Systems with Long
Short-Term Memory Networks | We introduce a data-driven forecasting method for high-dimensional chaotic
systems using long short-term memory (LSTM) recurrent neural networks. The
proposed LSTM neural networks perform inference of high-dimensional dynamical
systems in their reduced order space and are shown to be an effective set of
nonlinear approximators of their attractor. We demonstrate the forecasting
performance of the LSTM and compare it with Gaussian processes (GPs) in time
series obtained from the Lorenz 96 system, the Kuramoto-Sivashinsky equation
and a prototype climate model. The LSTM networks outperform the GPs in
short-term forecasting accuracy in all applications considered. A hybrid
architecture, extending the LSTM with a mean stochastic model (MSM-LSTM), is
proposed to ensure convergence to the invariant measure. This novel hybrid
method is fully data-driven and extends the forecasting capabilities of LSTM
networks.
| physics.comp-ph cs.LG nlin.CD | we introduce a datadriven forecasting method for highdimensional chaotic systems using long shortterm memory lstm recurrent neural networks the proposed lstm neural networks perform inference of highdimensional dynamical systems in their reduced order space and are shown to be an effective set of nonlinear approximators of their attractor we demonstrate the forecasting performance of the lstm and compare it with gaussian processes gps in time series obtained from the lorenz 96 system the kuramotosivashinsky equation and a prototype climate model the lstm networks outperform the gps in shortterm forecasting accuracy in all applications considered a hybrid architecture extending the lstm with a mean stochastic model msmlstm is proposed to ensure convergence to the invariant measure this novel hybrid method is fully datadriven and extends the forecasting capabilities of lstm networks | [['we', 'introduce', 'a', 'datadriven', 'forecasting', 'method', 'for', 'highdimensional', 'chaotic', 'systems', 'using', 'long', 'shortterm', 'memory', 'lstm', 'recurrent', 'neural', 'networks', 'the', 'proposed', 'lstm', 'neural', 'networks', 'perform', 'inference', 'of', 'highdimensional', 'dynamical', 'systems', 'in', 'their', 'reduced', 'order', 'space', 'and', 'are', 'shown', 'to', 'be', 'an', 'effective', 'set', 'of', 'nonlinear', 'approximators', 'of', 'their', 'attractor', 'we', 'demonstrate', 'the', 'forecasting', 'performance', 'of', 'the', 'lstm', 'and', 'compare', 'it', 'with', 'gaussian', 'processes', 'gps', 'in', 'time', 'series', 'obtained', 'from', 'the', 'lorenz', '96', 'system', 'the', 'kuramotosivashinsky', 'equation', 'and', 'a', 'prototype', 'climate', 'model', 'the', 'lstm', 'networks', 'outperform', 'the', 'gps', 'in', 'shortterm', 'forecasting', 'accuracy', 'in', 'all', 'applications', 'considered', 'a', 'hybrid', 'architecture', 'extending', 'the', 'lstm', 'with', 'a', 'mean', 'stochastic', 'model', 'msmlstm', 'is', 'proposed', 'to', 'ensure', 'convergence', 'to', 'the', 'invariant', 'measure', 'this', 'novel', 'hybrid', 'method', 'is', 'fully', 'datadriven', 'and', 'extends', 'the', 'forecasting', 'capabilities', 'of', 'lstm', 'networks']] | [-0.10386554156736896, -0.0010884267181228457, -0.058964869707765044, 0.10592297689633647, -0.03618957160416153, -0.19660122132076802, 0.021166501942184543, 0.43090991189255734, -0.30269874911755323, -0.262800709986987, 0.09223246969672483, -0.24260541190963614, -0.2622920414613372, 0.21183063732748925, -0.11921716110723078, 0.1800843948325099, 0.13356845148355345, 0.034455756185749586, -0.030673453667338275, -0.2939363433925305, 0.20160542688397473, 0.077652327644155, 0.3289079781073008, -0.09499173619073288, 0.1860294522168909, -0.07227625631972744, -0.03778769871465457, -0.042805678969431424, -0.017358995428987483, 0.15315119044624212, 0.23887712760853705, 0.12222936861000436, 0.3612558176676028, -0.4377711331110823, -0.34351796961512215, 0.10258988830325909, 0.10600888613560021, 0.055966157305538076, 0.0634484635954795, -0.3482602707926155, 0.07323249091589173, -0.24290939129784328, -0.04030508800525247, -0.20663188155307327, -0.01083487880149091, 0.061003562492542254, -0.3084623460665114, 0.07126879896187989, 0.0805888804234835, 0.0411496841197097, -0.0830645563095346, -0.06269560643388752, -0.011517016504089846, 0.12601017669680736, 0.008630864865457019, 0.034750792021004034, 0.09161726673415234, -0.11033654229421269, -0.17952424715915621, 0.3170481590453044, -0.1383810468079421, -0.25261231509665416, 0.16814587743187598, -0.04016609656689472, -0.1604762260058476, 0.06740051834273708, 0.28450347022550515, 0.08592477262150063, -0.20553068999316573, 0.0355231429399677, -0.013600425904818862, 0.16453661910409845, -0.00751833735726947, 0.023590677554986273, 0.15592233183100646, 0.38229850228413825, 0.032637613006080535, 0.11187598320688012, -0.14579572785616846, -0.1526120963123764, -0.18714658155055472, -0.07867894700706698, -0.16304760730316387, 0.011348756055470354, -0.1469579019521493, -0.18123078136592058, 0.4573470385774046, 0.2614005990615187, 0.16750854382637975, 0.1794225454741959, 0.3307166990224821, 0.09510920318703135, 0.10336902478886696, 0.13955927375963953, 0.1749855933256101, 0.09359721652441477, 0.20876961629187993, -0.18997815197564719, 0.0652200914666692, 0.08353895453064768] |
1,802.07487 | Sensor-topology based simplicial complex reconstruction | We propose a new method for the reconstruction of simplicial complexes
(combining points, edges and triangles) from 3D point clouds from Mobile Laser
Scanning (MLS). Our main goal is to produce a reconstruction of a scene that is
adapted to the local geometry of objects. Our method uses the inherent topology
of the MLS sensor to define a spatial adjacency relationship between points. We
then investigate each possible connexion between adjacent points and filter
them by searching collinear structures in the scene, or structures
perpendicular to the laser beams. Next, we create triangles for each triplet of
self-connected edges. Last, we improve this method with a regularization based
on the co-planarity of triangles and collinearity of remaining edges. We
compare our results to a naive simplicial complexes reconstruction based on
edge length.
| cs.GR cs.CG | we propose a new method for the reconstruction of simplicial complexes combining points edges and triangles from 3d point clouds from mobile laser scanning mls our main goal is to produce a reconstruction of a scene that is adapted to the local geometry of objects our method uses the inherent topology of the mls sensor to define a spatial adjacency relationship between points we then investigate each possible connexion between adjacent points and filter them by searching collinear structures in the scene or structures perpendicular to the laser beams next we create triangles for each triplet of selfconnected edges last we improve this method with a regularization based on the coplanarity of triangles and collinearity of remaining edges we compare our results to a naive simplicial complexes reconstruction based on edge length | [['we', 'propose', 'a', 'new', 'method', 'for', 'the', 'reconstruction', 'of', 'simplicial', 'complexes', 'combining', 'points', 'edges', 'and', 'triangles', 'from', '3d', 'point', 'clouds', 'from', 'mobile', 'laser', 'scanning', 'mls', 'our', 'main', 'goal', 'is', 'to', 'produce', 'a', 'reconstruction', 'of', 'a', 'scene', 'that', 'is', 'adapted', 'to', 'the', 'local', 'geometry', 'of', 'objects', 'our', 'method', 'uses', 'the', 'inherent', 'topology', 'of', 'the', 'mls', 'sensor', 'to', 'define', 'a', 'spatial', 'adjacency', 'relationship', 'between', 'points', 'we', 'then', 'investigate', 'each', 'possible', 'connexion', 'between', 'adjacent', 'points', 'and', 'filter', 'them', 'by', 'searching', 'collinear', 'structures', 'in', 'the', 'scene', 'or', 'structures', 'perpendicular', 'to', 'the', 'laser', 'beams', 'next', 'we', 'create', 'triangles', 'for', 'each', 'triplet', 'of', 'selfconnected', 'edges', 'last', 'we', 'improve', 'this', 'method', 'with', 'a', 'regularization', 'based', 'on', 'the', 'coplanarity', 'of', 'triangles', 'and', 'collinearity', 'of', 'remaining', 'edges', 'we', 'compare', 'our', 'results', 'to', 'a', 'naive', 'simplicial', 'complexes', 'reconstruction', 'based', 'on', 'edge', 'length']] | [-0.11261800113557414, 0.03465058187650742, -0.08763421944229666, 0.044189435413114334, -0.07677348880591153, -0.1118946829951848, 0.07556492950287506, 0.45148389148667, -0.30285605136305094, -0.29714544424363837, 0.02579832023316571, -0.30596171766801766, -0.1723738674896374, 0.10267097370127555, -0.10401244561194978, 0.015015027477409492, 0.08350578077828907, -0.0044381904793254125, -0.05487122802834633, -0.22017081450692125, 0.34529676185356395, 0.018303856521731977, 0.2681957304999797, 0.019513652825756282, 0.12141656074990434, 0.04349208380374352, -0.017018106801322465, 0.03837710549123585, -0.13210679878945733, 0.20219840807840228, 0.21878081955241435, 0.09057629352989324, 0.20207629974042488, -0.4425470719650162, -0.16918838616093676, 0.0874594616329749, 0.11823764077130225, 0.10685810639353638, -0.042050578635429374, -0.2908842293545604, 0.13134641393183052, -0.05950877981288641, -0.09877998861978113, -0.03340962307640549, -0.016430799803470796, 0.03273946962982529, -0.26708257580740435, -0.007891733411022207, 0.033560871825708695, 0.055800275573732724, -0.025171602691636617, -0.09735220339092793, -0.04586148343691038, 0.14186337578399671, -0.0308486638717692, 0.035433812917097275, 0.1003107762204088, -0.11950172809531179, -0.17182339505278366, 0.37727701410326653, -0.005469147024224653, -0.19169448613309104, 0.1914974879967331, -0.11492342206959923, -0.10818983344925624, 0.13490173526136487, 0.1620362538696182, 0.17611607924724618, -0.09398457068583053, 0.040873414521532446, -0.04937072076206801, 0.15204331051724942, 0.12249005188685701, 0.010460545277138326, 0.20827802970024728, 0.1850339679777707, 0.14500398249682886, 0.1668655994148911, -0.1823211998458701, -0.044980940722532316, -0.2553776470506846, -0.15157117994650351, -0.218072333404879, -0.0063906206147900475, -0.1267490629491504, -0.1835679144485656, 0.4342363238322309, 0.20832264883475463, 0.26675869742669445, 0.0104597439675479, 0.3593404813948313, 0.018105934927007183, 0.09443280959297254, 0.060984869319134195, 0.1621880094436082, 0.12217975270345272, 0.039511979412936576, -0.14184823870009772, 0.017145300823771817, 0.14880719861707115] |
1,802.07488 | From jamming to collective cell migration through a boundary induced
transition | Cell monolayers provide an interesting example of active matter, exhibiting a
phase transition from a flowing to jammed state as they age. Here we report
experiments and numerical simulations illustrating how a jammed cellular layer
rapidly reverts to a flowing state after a wound. Quantitative comparison
between experiments and simulations shows that cells change their
self-propulsion and alignement strength so that the system crosses a phase
transition line, which we characterize by finite-size scaling in an active
particle model. This wound-induced unjamming transition is found to occur
generically in epithelial, endothelial and cancer cells.
| physics.bio-ph cond-mat.soft q-bio.CB | cell monolayers provide an interesting example of active matter exhibiting a phase transition from a flowing to jammed state as they age here we report experiments and numerical simulations illustrating how a jammed cellular layer rapidly reverts to a flowing state after a wound quantitative comparison between experiments and simulations shows that cells change their selfpropulsion and alignement strength so that the system crosses a phase transition line which we characterize by finitesize scaling in an active particle model this woundinduced unjamming transition is found to occur generically in epithelial endothelial and cancer cells | [['cell', 'monolayers', 'provide', 'an', 'interesting', 'example', 'of', 'active', 'matter', 'exhibiting', 'a', 'phase', 'transition', 'from', 'a', 'flowing', 'to', 'jammed', 'state', 'as', 'they', 'age', 'here', 'we', 'report', 'experiments', 'and', 'numerical', 'simulations', 'illustrating', 'how', 'a', 'jammed', 'cellular', 'layer', 'rapidly', 'reverts', 'to', 'a', 'flowing', 'state', 'after', 'a', 'wound', 'quantitative', 'comparison', 'between', 'experiments', 'and', 'simulations', 'shows', 'that', 'cells', 'change', 'their', 'selfpropulsion', 'and', 'alignement', 'strength', 'so', 'that', 'the', 'system', 'crosses', 'a', 'phase', 'transition', 'line', 'which', 'we', 'characterize', 'by', 'finitesize', 'scaling', 'in', 'an', 'active', 'particle', 'model', 'this', 'woundinduced', 'unjamming', 'transition', 'is', 'found', 'to', 'occur', 'generically', 'in', 'epithelial', 'endothelial', 'and', 'cancer', 'cells']] | [-0.13692212699642103, 0.23938324908576955, -0.07923579204487063, 0.0025865624067924354, -0.001763761767076068, -0.16361549910238032, 0.1410069933000912, 0.3949249544861897, -0.22932665743013864, -0.24051917274232193, 0.04983822597561264, -0.3081220744518183, -0.2681183247095955, 0.13544568475911653, -0.007988541021502467, 0.0030062387707412886, 0.03888646361758552, -0.01094624103185901, -0.041969119572401126, -0.1406146634209861, 0.2217278161576839, 0.02597589173193981, 0.30389600488988144, 0.03922663197942799, 0.08317010696496695, -0.10523377077951927, 0.06839204253879205, 0.07386714081850744, -0.21386671056848905, 0.0026462307520290856, 0.2600148950781052, 0.03760942449212395, 0.23183065112580054, -0.4927546868040677, -0.25138110883774295, 0.08804158423025842, 0.21025058872664787, 0.11525345377759227, -0.10907774356504281, -0.2688440516170475, 0.019986984611649106, -0.19650403273502184, -0.12475843257420967, -0.0743546582638256, 0.03085098712034123, 0.019566364110677793, -0.24809510314020938, 0.1191180011749478, 0.04342544961079795, 0.08115203675603674, -0.08630323718972904, -0.022666288823920792, -0.06040842254065298, 0.17073027654651113, 0.05592452059249564, 0.029050429001130085, 0.2734978201007971, -0.16809858501918853, -0.0794727463946147, 0.3574803941031938, 0.021485211074812917, -0.12508545770379964, 0.23393194339743825, -0.15465095481755192, -0.05966752277366737, 0.19395070637185727, 0.17808730559804106, 0.056044371565803885, -0.09650939444620762, -0.050585500690685486, -0.048907433696571856, 0.2253040245493814, 0.03135773653204563, -0.05943094159887042, 0.24888683387869467, 0.26172576081608573, 0.009152872247561332, 0.17587378939553613, -0.09965963100874296, -0.15369341983610102, -0.25641445043466743, -0.1867038578305754, -0.14690270179742446, 0.05390462052497652, -0.07931487690795072, -0.18877049269635351, 0.3614792692104495, 0.11106511329110431, 0.21208845613704574, 0.027520605294103984, 0.2508481049920202, 0.012929260359591334, 0.03131834469405153, 0.01458767467799286, 0.2644644155797939, 0.11944689654985503, 0.13777488204450297, -0.24737517351675178, 0.06344975727880674, 0.016365956975727954] |
1,802.07489 | Epistemic Graphs for Representing and Reasoning with Positive and
Negative Influences of Arguments | This paper introduces epistemic graphs as a generalization of the epistemic
approach to probabilistic argumentation. In these graphs, an argument can be
believed or disbelieved up to a given degree, thus providing a more
fine--grained alternative to the standard Dung's approaches when it comes to
determining the status of a given argument. Furthermore, the flexibility of the
epistemic approach allows us to both model the rationale behind the existing
semantics as well as completely deviate from them when required. Epistemic
graphs can model both attack and support as well as relations that are neither
support nor attack. The way other arguments influence a given argument is
expressed by the epistemic constraints that can restrict the belief we have in
an argument with a varying degree of specificity. The fact that we can specify
the rules under which arguments should be evaluated and we can include
constraints between unrelated arguments permits the framework to be more
context--sensitive. It also allows for better modelling of imperfect agents,
which can be important in multi--agent applications.
| cs.AI | this paper introduces epistemic graphs as a generalization of the epistemic approach to probabilistic argumentation in these graphs an argument can be believed or disbelieved up to a given degree thus providing a more finegrained alternative to the standard dungs approaches when it comes to determining the status of a given argument furthermore the flexibility of the epistemic approach allows us to both model the rationale behind the existing semantics as well as completely deviate from them when required epistemic graphs can model both attack and support as well as relations that are neither support nor attack the way other arguments influence a given argument is expressed by the epistemic constraints that can restrict the belief we have in an argument with a varying degree of specificity the fact that we can specify the rules under which arguments should be evaluated and we can include constraints between unrelated arguments permits the framework to be more contextsensitive it also allows for better modelling of imperfect agents which can be important in multiagent applications | [['this', 'paper', 'introduces', 'epistemic', 'graphs', 'as', 'a', 'generalization', 'of', 'the', 'epistemic', 'approach', 'to', 'probabilistic', 'argumentation', 'in', 'these', 'graphs', 'an', 'argument', 'can', 'be', 'believed', 'or', 'disbelieved', 'up', 'to', 'a', 'given', 'degree', 'thus', 'providing', 'a', 'more', 'finegrained', 'alternative', 'to', 'the', 'standard', 'dungs', 'approaches', 'when', 'it', 'comes', 'to', 'determining', 'the', 'status', 'of', 'a', 'given', 'argument', 'furthermore', 'the', 'flexibility', 'of', 'the', 'epistemic', 'approach', 'allows', 'us', 'to', 'both', 'model', 'the', 'rationale', 'behind', 'the', 'existing', 'semantics', 'as', 'well', 'as', 'completely', 'deviate', 'from', 'them', 'when', 'required', 'epistemic', 'graphs', 'can', 'model', 'both', 'attack', 'and', 'support', 'as', 'well', 'as', 'relations', 'that', 'are', 'neither', 'support', 'nor', 'attack', 'the', 'way', 'other', 'arguments', 'influence', 'a', 'given', 'argument', 'is', 'expressed', 'by', 'the', 'epistemic', 'constraints', 'that', 'can', 'restrict', 'the', 'belief', 'we', 'have', 'in', 'an', 'argument', 'with', 'a', 'varying', 'degree', 'of', 'specificity', 'the', 'fact', 'that', 'we', 'can', 'specify', 'the', 'rules', 'under', 'which', 'arguments', 'should', 'be', 'evaluated', 'and', 'we', 'can', 'include', 'constraints', 'between', 'unrelated', 'arguments', 'permits', 'the', 'framework', 'to', 'be', 'more', 'contextsensitive', 'it', 'also', 'allows', 'for', 'better', 'modelling', 'of', 'imperfect', 'agents', 'which', 'can', 'be', 'important', 'in', 'multiagent', 'applications']] | [-0.07130473596316202, 0.07072365492849872, -0.14572217215086763, 0.11340692231693027, -0.1835657186065501, -0.17704706704407408, 0.08702552026717744, 0.3775666696155629, -0.27710357340640246, -0.35173575654190187, 0.09196320308470413, -0.20329222019114368, -0.17547239564367356, 0.17372597959464448, -0.14090086833426826, 0.031754749952352536, 0.029681179045619715, 0.054846896980589595, -0.03524971512631018, -0.21891235480662327, 0.3064549460704847, 0.055887408009920904, 0.23653004090819094, 0.09419950593517527, 0.06395578064427476, 0.030838182367580503, -0.014081048531381533, 0.0780605386407523, -0.07517993945980884, 0.15784031104116716, 0.2981848546320148, 0.23862423729260415, 0.29932893361972523, -0.4295605171515405, -0.19767502196982764, 0.11126621420990829, 0.13750200634086995, 0.14156510570761885, 0.06222490626383894, -0.3080310575141196, 0.090560556596352, -0.2204585079709953, -0.1293593578718668, -0.1256456858783481, -0.03027092058984944, 0.014135344165693207, -0.2693449983205469, 0.003418043640963679, 0.15623158712773338, 0.028896750550467264, -0.033176308389881094, -0.07785923056827303, -0.012292763027662074, 0.12656263642085236, 0.05345744868380982, 0.012810445325285719, 0.11083190512641916, -0.10300850710009186, -0.17795247083518936, 0.4033031133398392, -0.01053029416967728, -0.24560192299255154, 0.2005849325340459, -0.048307126353573794, -0.14148547057040603, 0.04897399630658982, 0.14243021159165958, 0.11226809109228919, -0.154568140779803, 0.05835939545050939, -0.05165373109967301, 0.19870774481140557, 0.04818716243573884, 0.0430861909040495, 0.2119878596511849, 0.15150414826348424, 0.0591219252517327, 0.11602977310662697, 0.0005932390669085717, -0.12218016010371434, -0.30720613634333627, -0.11598411422734808, -0.12157932864447608, 0.024837931717064488, -0.10497380454588154, -0.13546287477947772, 0.34394752457520067, 0.2204265433339108, 0.16914685488809908, 0.10059415265286004, 0.30454296173190165, 0.11650141820853456, 0.07155343389127687, 0.040960658318499286, 0.20429729791092605, 0.09865430456706001, 0.05553785868925832, -0.12710190682102823, 0.1766131468544774, 0.0263279397476312] |
1,802.0749 | ViTac: Feature Sharing between Vision and Tactile Sensing for Cloth
Texture Recognition | Vision and touch are two of the important sensing modalities for humans and
they offer complementary information for sensing the environment. Robots could
also benefit from such multi-modal sensing ability. In this paper, addressing
for the first time (to the best of our knowledge) texture recognition from
tactile images and vision, we propose a new fusion method named Deep Maximum
Covariance Analysis (DMCA) to learn a joint latent space for sharing features
through vision and tactile sensing. The features of camera images and tactile
data acquired from a GelSight sensor are learned by deep neural networks. But
the learned features are of a high dimensionality and are redundant due to the
differences between the two sensing modalities, which deteriorates the
perception performance. To address this, the learned features are paired using
maximum covariance analysis. Results of the algorithm on a newly collected
dataset of paired visual and tactile data relating to cloth textures show that
a good recognition performance of greater than 90\% can be achieved by using
the proposed DMCA framework. In addition, we find that the perception
performance of either vision or tactile sensing can be improved by employing
the shared representation space, compared to learning from unimodal data.
| cs.RO cs.CV cs.GR | vision and touch are two of the important sensing modalities for humans and they offer complementary information for sensing the environment robots could also benefit from such multimodal sensing ability in this paper addressing for the first time to the best of our knowledge texture recognition from tactile images and vision we propose a new fusion method named deep maximum covariance analysis dmca to learn a joint latent space for sharing features through vision and tactile sensing the features of camera images and tactile data acquired from a gelsight sensor are learned by deep neural networks but the learned features are of a high dimensionality and are redundant due to the differences between the two sensing modalities which deteriorates the perception performance to address this the learned features are paired using maximum covariance analysis results of the algorithm on a newly collected dataset of paired visual and tactile data relating to cloth textures show that a good recognition performance of greater than 90 can be achieved by using the proposed dmca framework in addition we find that the perception performance of either vision or tactile sensing can be improved by employing the shared representation space compared to learning from unimodal data | [['vision', 'and', 'touch', 'are', 'two', 'of', 'the', 'important', 'sensing', 'modalities', 'for', 'humans', 'and', 'they', 'offer', 'complementary', 'information', 'for', 'sensing', 'the', 'environment', 'robots', 'could', 'also', 'benefit', 'from', 'such', 'multimodal', 'sensing', 'ability', 'in', 'this', 'paper', 'addressing', 'for', 'the', 'first', 'time', 'to', 'the', 'best', 'of', 'our', 'knowledge', 'texture', 'recognition', 'from', 'tactile', 'images', 'and', 'vision', 'we', 'propose', 'a', 'new', 'fusion', 'method', 'named', 'deep', 'maximum', 'covariance', 'analysis', 'dmca', 'to', 'learn', 'a', 'joint', 'latent', 'space', 'for', 'sharing', 'features', 'through', 'vision', 'and', 'tactile', 'sensing', 'the', 'features', 'of', 'camera', 'images', 'and', 'tactile', 'data', 'acquired', 'from', 'a', 'gelsight', 'sensor', 'are', 'learned', 'by', 'deep', 'neural', 'networks', 'but', 'the', 'learned', 'features', 'are', 'of', 'a', 'high', 'dimensionality', 'and', 'are', 'redundant', 'due', 'to', 'the', 'differences', 'between', 'the', 'two', 'sensing', 'modalities', 'which', 'deteriorates', 'the', 'perception', 'performance', 'to', 'address', 'this', 'the', 'learned', 'features', 'are', 'paired', 'using', 'maximum', 'covariance', 'analysis', 'results', 'of', 'the', 'algorithm', 'on', 'a', 'newly', 'collected', 'dataset', 'of', 'paired', 'visual', 'and', 'tactile', 'data', 'relating', 'to', 'cloth', 'textures', 'show', 'that', 'a', 'good', 'recognition', 'performance', 'of', 'greater', 'than', '90', 'can', 'be', 'achieved', 'by', 'using', 'the', 'proposed', 'dmca', 'framework', 'in', 'addition', 'we', 'find', 'that', 'the', 'perception', 'performance', 'of', 'either', 'vision', 'or', 'tactile', 'sensing', 'can', 'be', 'improved', 'by', 'employing', 'the', 'shared', 'representation', 'space', 'compared', 'to', 'learning', 'from', 'unimodal', 'data']] | [-0.026042351891884384, 0.04357538026391496, -0.08932182026461731, 0.012228064051949749, -0.14000740901692144, -0.18570820830614115, -0.006940422279340915, 0.4571792303552082, -0.29686089897463425, -0.3646965388449567, 0.10910779541817063, -0.29266840975212666, -0.23240171029667986, 0.19210764299730645, -0.1844175418268945, 0.09441532267822851, 0.14160893902828944, 0.07728819790312473, -0.07728844906599608, -0.23377207804943867, 0.2883617807601333, 0.03599437175345241, 0.3477661271593464, -0.012075193078356762, 0.15367127039275175, -0.0019262805974935714, -0.04793127169091236, -0.005629946681872399, -0.03055232289035524, 0.22698031006431885, 0.339665296698332, 0.23721463416253602, 0.28783662173322483, -0.41566015048814353, -0.24177863574887984, 0.07699390637470567, 0.1578355796382628, 0.07594561823979669, -0.06896758902370836, -0.40776888233845804, 0.08956220300766218, -0.13711668935370405, 0.035830612746136845, -0.13557444338163185, -0.048924307240432695, -0.02835091129026436, -0.301350525626681, 0.031236864242845202, 0.04285491627886595, 0.10572311854851779, -0.09368989610261474, -0.10250326205248857, 0.03625760030636184, 0.21761101053272425, -4.041578333398596e-05, 0.015248431663714646, 0.1819465491406397, -0.22453110246451116, -0.12623277036890165, 0.35226776296115336, -0.018118833064635062, -0.18486364133799663, 0.2110632773956738, -0.059411604750892195, -0.11186046394014462, 0.10499009743230928, 0.24268369299686277, 0.07988914212128564, -0.18385805829488372, -0.019634226179248492, -0.018821708959948957, 0.1780496514668753, 0.062226374218916865, 0.027494692310820617, 0.2035000309317989, 0.22483447363220194, 0.033942951681787396, 0.12164356536116099, -0.1603554233535661, -0.0037629798249299846, -0.17255486388788072, -0.11342544276823303, -0.24286970940640948, -0.04827182906661275, -0.12139054823996075, -0.06050276239751549, 0.3957217766750437, 0.24361833775721825, 0.23491473703306928, 0.08026727801015072, 0.37818905886318255, -0.0035289729444659894, 0.12746155597918218, 0.0541161233883592, 0.20569382655545512, 0.023679916755022918, 0.1489698300462457, -0.17189448314547465, 0.06836909371594996, 0.0016279996521029604] |
1,802.07491 | Stone Commutator Lattices and Baer Rings | In this paper, we transfer Davey`s characterization for $\kappa $--Stone
bounded distributive lattices to lattices with certain kinds of quotients, in
particular to commutator lattices with certain properties, and obtain related
results on prime, radical, complemented and compact elements, annihilators and
congruences of these lattices. We then apply these results to certain
congruence lattices, in particular to those of semiprime members of
semi--degenerate congruence--modular varieties, and use this particular case to
transfer Davey`s Theorem to commutative unitary rings.
| math.RA | in this paper we transfer daveys characterization for kappa stone bounded distributive lattices to lattices with certain kinds of quotients in particular to commutator lattices with certain properties and obtain related results on prime radical complemented and compact elements annihilators and congruences of these lattices we then apply these results to certain congruence lattices in particular to those of semiprime members of semidegenerate congruencemodular varieties and use this particular case to transfer daveys theorem to commutative unitary rings | [['in', 'this', 'paper', 'we', 'transfer', 'daveys', 'characterization', 'for', 'kappa', 'stone', 'bounded', 'distributive', 'lattices', 'to', 'lattices', 'with', 'certain', 'kinds', 'of', 'quotients', 'in', 'particular', 'to', 'commutator', 'lattices', 'with', 'certain', 'properties', 'and', 'obtain', 'related', 'results', 'on', 'prime', 'radical', 'complemented', 'and', 'compact', 'elements', 'annihilators', 'and', 'congruences', 'of', 'these', 'lattices', 'we', 'then', 'apply', 'these', 'results', 'to', 'certain', 'congruence', 'lattices', 'in', 'particular', 'to', 'those', 'of', 'semiprime', 'members', 'of', 'semidegenerate', 'congruencemodular', 'varieties', 'and', 'use', 'this', 'particular', 'case', 'to', 'transfer', 'daveys', 'theorem', 'to', 'commutative', 'unitary', 'rings']] | [-0.15413622349763337, 0.11008994879487616, -0.03980214461588707, 0.051583740152776815, -0.10660976911775577, -0.135323896096685, 0.0244731589127929, 0.42206693328439426, -0.3493636881407255, -0.1409970229694572, 0.11138182561635637, -0.2677349475546716, -0.11064089036797388, 0.2126421318986477, -0.1308443728977671, 0.022446907700027507, 0.05859576618651119, 0.045694416197828755, -0.11308500359360224, -0.3537207468150136, 0.42321333835999936, -0.013878963611578235, 0.20807062426152137, 0.056674874698122345, 0.0202493510949306, 0.026833853596308004, 0.008503710600332571, 0.0028073179463927564, -0.2345663438169047, 0.20277856256535204, 0.30788487530289554, 0.01695332690500296, 0.14826070354543985, -0.39026238984213424, -0.09855251698396526, 0.19241873240575957, 0.11015432054559007, 0.016849703931560118, -0.014720397244673222, -0.24545252758663338, 0.13547812989101005, -0.21689340722962067, -0.16801258109700987, -0.15967178151298028, 0.06927222713159445, 0.0934875834082516, -0.27038078924688774, -0.005713827651328383, 0.1955215896730526, 0.1781559992903987, -0.08748751466807264, -0.10692809383050562, 0.028155807008704122, 0.08511976240417705, -0.046072534046685085, -0.06940632220730783, 0.044113224799123905, -0.08179270697590442, -0.1477398031259863, 0.3963349436242611, -0.02008271970762274, -0.1678079994252095, 0.22294351139750618, -0.21835622174713093, -0.17918941860970777, 0.029616297157003712, 0.10981903145185266, 0.12604253029880616, -0.03675264861577979, 0.09943424563747473, -0.14891544515147614, 0.07632677217360395, 0.15460464193557316, 0.08428532261258134, 0.13259396622351444, 0.030888951905907538, 0.044138090135768436, 0.17930107899248982, 0.085346109015891, -0.036457122342723705, -0.30480279033191693, -0.15922106282475093, -0.1040709781794785, 0.14473845731267013, -0.04152283021651853, -0.17215497330881846, 0.3316075105745441, 0.12171897722276835, 0.13518999595768177, 0.10429502980640301, 0.145136654505339, 0.02915764739438414, 0.08864585950206487, 0.036228316803224005, 0.0840939674198102, 0.2786203224259691, -0.03723473439160257, -0.12475006934852363, -0.1294107342329927, 0.2103304831818185] |
1,802.07492 | Surface texturing of Ti6Al4V alloy using femtosecond laser for superior
antibacterial performance | Titanium and its alloy are most widely used implant materials in dental and
orthopaedic fields. However, infections occurring during implantation leads to
implant failure in most of the cases. Here, we have demonstrated antibacterial
behavior of Ti6Al4V alloy achieved when surface modified using femtosecond
laser beam. Post laser treatment conical microstructures were observed on the
Ti6Al4V alloy surface. Generation of different sub-oxide phases of titanium
dioxide were detected on laser treated samples using X-ray diffraction and
X-ray photoelectron spectroscopy. Wettability of Ti6Al4V alloy surface changed
significantly after interaction with the laser. Adhesion and growth of two gram
positive; Staphylococcus aureus and Streptococcus mutans and one gram negative
Pseudomonas aeruginosa bacteria have been explored on pristine, as well as, on
laser textured Ti6Al4V alloy surfaces. In-vitro investigation on agar plate
showed inhibition of bacterial growth on most of the laser treated surface.
Superior surface roughness and occurrence of magneli phases of titanium dioxide
on laser treated surface were probably responsible for the antibacterial
behavior exhibited by the laser treated samples. Therefore, femtosecond laser
surface treatment of Ti6Al4V alloy could find potential application in the
development of infection free medical implants for dental and orthopedic
usages.
| physics.med-ph | titanium and its alloy are most widely used implant materials in dental and orthopaedic fields however infections occurring during implantation leads to implant failure in most of the cases here we have demonstrated antibacterial behavior of ti6al4v alloy achieved when surface modified using femtosecond laser beam post laser treatment conical microstructures were observed on the ti6al4v alloy surface generation of different suboxide phases of titanium dioxide were detected on laser treated samples using xray diffraction and xray photoelectron spectroscopy wettability of ti6al4v alloy surface changed significantly after interaction with the laser adhesion and growth of two gram positive staphylococcus aureus and streptococcus mutans and one gram negative pseudomonas aeruginosa bacteria have been explored on pristine as well as on laser textured ti6al4v alloy surfaces invitro investigation on agar plate showed inhibition of bacterial growth on most of the laser treated surface superior surface roughness and occurrence of magneli phases of titanium dioxide on laser treated surface were probably responsible for the antibacterial behavior exhibited by the laser treated samples therefore femtosecond laser surface treatment of ti6al4v alloy could find potential application in the development of infection free medical implants for dental and orthopedic usages | [['titanium', 'and', 'its', 'alloy', 'are', 'most', 'widely', 'used', 'implant', 'materials', 'in', 'dental', 'and', 'orthopaedic', 'fields', 'however', 'infections', 'occurring', 'during', 'implantation', 'leads', 'to', 'implant', 'failure', 'in', 'most', 'of', 'the', 'cases', 'here', 'we', 'have', 'demonstrated', 'antibacterial', 'behavior', 'of', 'ti6al4v', 'alloy', 'achieved', 'when', 'surface', 'modified', 'using', 'femtosecond', 'laser', 'beam', 'post', 'laser', 'treatment', 'conical', 'microstructures', 'were', 'observed', 'on', 'the', 'ti6al4v', 'alloy', 'surface', 'generation', 'of', 'different', 'suboxide', 'phases', 'of', 'titanium', 'dioxide', 'were', 'detected', 'on', 'laser', 'treated', 'samples', 'using', 'xray', 'diffraction', 'and', 'xray', 'photoelectron', 'spectroscopy', 'wettability', 'of', 'ti6al4v', 'alloy', 'surface', 'changed', 'significantly', 'after', 'interaction', 'with', 'the', 'laser', 'adhesion', 'and', 'growth', 'of', 'two', 'gram', 'positive', 'staphylococcus', 'aureus', 'and', 'streptococcus', 'mutans', 'and', 'one', 'gram', 'negative', 'pseudomonas', 'aeruginosa', 'bacteria', 'have', 'been', 'explored', 'on', 'pristine', 'as', 'well', 'as', 'on', 'laser', 'textured', 'ti6al4v', 'alloy', 'surfaces', 'invitro', 'investigation', 'on', 'agar', 'plate', 'showed', 'inhibition', 'of', 'bacterial', 'growth', 'on', 'most', 'of', 'the', 'laser', 'treated', 'surface', 'superior', 'surface', 'roughness', 'and', 'occurrence', 'of', 'magneli', 'phases', 'of', 'titanium', 'dioxide', 'on', 'laser', 'treated', 'surface', 'were', 'probably', 'responsible', 'for', 'the', 'antibacterial', 'behavior', 'exhibited', 'by', 'the', 'laser', 'treated', 'samples', 'therefore', 'femtosecond', 'laser', 'surface', 'treatment', 'of', 'ti6al4v', 'alloy', 'could', 'find', 'potential', 'application', 'in', 'the', 'development', 'of', 'infection', 'free', 'medical', 'implants', 'for', 'dental', 'and', 'orthopedic', 'usages']] | [-0.02177312993684534, 0.19970796817851244, -0.03854148313115092, -0.010739279168624355, 0.04656300904498119, -0.19443350465555398, 0.02235696609095987, 0.4841641612859808, -0.1679961080167841, -0.30427257978680217, 0.06383318188852276, -0.32084625083761115, -0.1749605517378365, 0.250292400510252, -0.0745757934229314, 0.08104011896648444, 0.012522191968002385, -0.11324239054397132, 0.04150570721903182, -0.2329988621880982, 0.21048597100529262, 0.05621920720213237, 0.3429067944261706, 0.08453131695614033, 0.07629859351466611, 0.02176288777923922, 0.0870060498235728, -0.020621072986342397, -0.15776801344709945, 0.03840180474559095, 0.2692390770976043, -0.022257517438775562, 0.2311379958577838, -0.5437006284242746, -0.3079998889558747, -0.0219775088558684, 0.08278813667729804, 0.05679036814781847, -0.121837098285263, -0.246875135753707, 0.05104914611579308, -0.11511546317439948, -0.09298574659234085, -0.020381182336162047, -0.004857597975828445, 0.05877465942212064, -0.2009930506585041, 0.05614831116165697, -0.0009658436031985702, 0.17297394737630084, -0.15554808118541427, -0.1577969225262743, -0.12939904944265512, 0.0549693613059005, 0.06494590782526803, 0.003866653594178791, 0.31854515134557343, -0.07537948564367042, -0.035443965924097244, 0.3560663722887558, -0.021022326300957614, -0.043736048546840545, 0.18906978283979997, -0.15751275476131266, -0.03403634264028257, 0.19837021076398872, 0.15222171033473358, 0.15483769127431796, -0.14873877158978074, -0.025608598086598915, 0.12022542626568183, 0.20625390182849326, 0.24553956016754136, -0.023915491575740046, 0.17415438939639627, 0.27847826283319477, -0.07904149736721817, 0.14642128412919023, -0.14432048673391074, 0.05788022869977063, -0.11831409318766259, -0.2058203589343994, -0.16035381543417654, 0.06520604405590553, -0.04199181910371408, -0.24190716901506037, 0.3578831155294764, 0.04924429655459124, 0.038097698915961015, -0.10063708217972986, 0.19468965622975692, -0.013018628161102917, 0.08228709063127868, -0.09391902995022186, 0.205109752661827, 0.13572523779939072, 0.09849950573983189, -0.2693092090500154, 0.2081776654693423, 0.004066484471418194] |
1,802.07493 | The real polynomial eigenvalue problem is well conditioned on the
average | We study the average condition number for polynomial eigenvalues of
collections of matrices drawn from various random matrix ensembles. In
particular, we prove that polynomial eigenvalue problems defined by matrices
with Gaussian entries are very well-conditioned on the average.
| math.NA math.PR | we study the average condition number for polynomial eigenvalues of collections of matrices drawn from various random matrix ensembles in particular we prove that polynomial eigenvalue problems defined by matrices with gaussian entries are very wellconditioned on the average | [['we', 'study', 'the', 'average', 'condition', 'number', 'for', 'polynomial', 'eigenvalues', 'of', 'collections', 'of', 'matrices', 'drawn', 'from', 'various', 'random', 'matrix', 'ensembles', 'in', 'particular', 'we', 'prove', 'that', 'polynomial', 'eigenvalue', 'problems', 'defined', 'by', 'matrices', 'with', 'gaussian', 'entries', 'are', 'very', 'wellconditioned', 'on', 'the', 'average']] | [-0.13564515445763484, 0.12267517704421128, -0.004976570439071228, 0.026192964365084965, 0.014399898811601676, -0.12343480160985237, -0.00623853273021105, 0.39127150951669765, -0.27877506031057775, -0.2505410520407634, 0.1290966737149761, -0.2974797627673699, -0.20307304070163995, 0.15535882791169944, -0.049818120419214934, 0.17505738967790818, 0.15069502181349656, 0.07870987861250074, -0.15252069551617098, -0.32208104226260614, 0.3696499610176453, -0.014651927476127943, 0.22031398944389552, -0.010182225599120825, 0.10903361370452704, 0.0030050383498653388, -0.057876040967993245, -0.001662422544681109, -0.05140252335639581, 0.09072887796598177, 0.28693131558023965, 0.153347479710833, 0.26390188585560864, -0.41494973462361556, -0.10711646557618411, 0.2697414576004331, 0.15307554123827663, 0.04447035930859737, -0.02163707292698419, -0.2750871600344395, 0.15359584965671486, -0.10208673055212085, -0.14001216036148179, -0.03657097797482633, -0.0008434572131917753, 0.06994200941437903, -0.3700716255758053, 0.0797511142415878, 0.033674026934955366, 0.10356391932910834, 0.03305723254258434, -0.2754073585025393, 0.11211922827761811, 0.0670222590247599, 0.0008988782094839292, -0.12439050702736355, 0.09262947239077245, -0.055622127551872, -0.0554703393807778, 0.32087721212361103, -0.033222624029104524, -0.3074756079377272, 0.07054230967202248, -0.17186795773271185, -0.17109574714245704, 0.08754627862706399, 0.21017694965195963, 0.09475696607468984, -0.09923357573839334, 0.13782978927095732, -0.1794171360297463, 0.12726814634142777, 0.11284818928927565, 0.02881057036276429, 0.0940798561160381, -0.009842832698128544, 0.12656709869416097, 0.17204442859078065, 0.026847791052065216, -0.1397900813474105, -0.25067801735340023, -0.06999125090451577, -0.35669186080877596, 0.10899587118854889, -0.241152825872772, -0.24425856310587662, 0.40218102633475494, 0.10868001139412324, 0.2508086821494194, 0.1994735065083473, 0.16988438601868275, 0.1358530409872914, -0.012088741104190167, 0.100068444887606, 0.060024006196703665, 0.2775577439341503, 0.049346620515466504, -0.1322253035226216, 0.056069887505891994, 0.15769097674638033] |
1,802.07494 | Stellar population of the superbubble N206 in the LMC II. Parameters of
the OB and WR stars, and the total massive star feedback | Clusters or associations of early-type stars are often associated with a
'superbubble' of hot gas. The formation of such superbubbles is caused by the
feedback from massive stars. The complex N206 in the Large Magellanic Cloud
exhibits a superbubble and a rich massive star population. We observed these
massive stars using the FLAMES multi-object spectrograph at ESO-VLT. Available
UV spectra from HST, IUE, and FUSE are also used. The spectral analysis is
performed with Potsdam Wolf-Rayet (PoWR) model atmospheres. We present the
stellar and wind parameters of the OB stars and the two WR binaries in the N206
complex. Twelve percent of the sample show Oe/Be type emission lines, although
most of them appear to rotate far below critical. We found eight runaway stars
based on their radial velocity. The wind-momentum luminosity relation of our OB
sample is consistent with the expectations. The HRD of the OB stars reveals a
large age spread (1-30 Myr), suggesting different episodes of star formation in
the complex. The youngest stars are concentrated in the inner part of the
complex, while the older OB stars are scattered over outer regions. We derived
the present day mass function for the entire N206 complex as well as for the
cluster NGC2018. Three very massive Of stars are found to dominate the feedback
among 164 OB stars in the sample. The two WR winds alone release about as much
mechanical luminosity as the whole OB star sample. The cumulative mechanical
feedback from all massive stellar winds is comparable to the combined
mechanical energy of the supernova explosions that likely occurred in the
complex. Accounting also for the WR wind and supernovae, the mechanical input
over the last five Myr is ~$2.3\times10^{52}$ erg, which exceeds the current
energy content of the complex by more than a factor of five. The morphology of
the complex suggests a leakage of hot gas from the superbubble.
| astro-ph.GA astro-ph.SR | clusters or associations of earlytype stars are often associated with a superbubble of hot gas the formation of such superbubbles is caused by the feedback from massive stars the complex n206 in the large magellanic cloud exhibits a superbubble and a rich massive star population we observed these massive stars using the flames multiobject spectrograph at esovlt available uv spectra from hst iue and fuse are also used the spectral analysis is performed with potsdam wolfrayet powr model atmospheres we present the stellar and wind parameters of the ob stars and the two wr binaries in the n206 complex twelve percent of the sample show oebe type emission lines although most of them appear to rotate far below critical we found eight runaway stars based on their radial velocity the windmomentum luminosity relation of our ob sample is consistent with the expectations the hrd of the ob stars reveals a large age spread 130 myr suggesting different episodes of star formation in the complex the youngest stars are concentrated in the inner part of the complex while the older ob stars are scattered over outer regions we derived the present day mass function for the entire n206 complex as well as for the cluster ngc2018 three very massive of stars are found to dominate the feedback among 164 ob stars in the sample the two wr winds alone release about as much mechanical luminosity as the whole ob star sample the cumulative mechanical feedback from all massive stellar winds is comparable to the combined mechanical energy of the supernova explosions that likely occurred in the complex accounting also for the wr wind and supernovae the mechanical input over the last five myr is 23times1052 erg which exceeds the current energy content of the complex by more than a factor of five the morphology of the complex suggests a leakage of hot gas from the superbubble | [['clusters', 'or', 'associations', 'of', 'earlytype', 'stars', 'are', 'often', 'associated', 'with', 'a', 'superbubble', 'of', 'hot', 'gas', 'the', 'formation', 'of', 'such', 'superbubbles', 'is', 'caused', 'by', 'the', 'feedback', 'from', 'massive', 'stars', 'the', 'complex', 'n206', 'in', 'the', 'large', 'magellanic', 'cloud', 'exhibits', 'a', 'superbubble', 'and', 'a', 'rich', 'massive', 'star', 'population', 'we', 'observed', 'these', 'massive', 'stars', 'using', 'the', 'flames', 'multiobject', 'spectrograph', 'at', 'esovlt', 'available', 'uv', 'spectra', 'from', 'hst', 'iue', 'and', 'fuse', 'are', 'also', 'used', 'the', 'spectral', 'analysis', 'is', 'performed', 'with', 'potsdam', 'wolfrayet', 'powr', 'model', 'atmospheres', 'we', 'present', 'the', 'stellar', 'and', 'wind', 'parameters', 'of', 'the', 'ob', 'stars', 'and', 'the', 'two', 'wr', 'binaries', 'in', 'the', 'n206', 'complex', 'twelve', 'percent', 'of', 'the', 'sample', 'show', 'oebe', 'type', 'emission', 'lines', 'although', 'most', 'of', 'them', 'appear', 'to', 'rotate', 'far', 'below', 'critical', 'we', 'found', 'eight', 'runaway', 'stars', 'based', 'on', 'their', 'radial', 'velocity', 'the', 'windmomentum', 'luminosity', 'relation', 'of', 'our', 'ob', 'sample', 'is', 'consistent', 'with', 'the', 'expectations', 'the', 'hrd', 'of', 'the', 'ob', 'stars', 'reveals', 'a', 'large', 'age', 'spread', '130', 'myr', 'suggesting', 'different', 'episodes', 'of', 'star', 'formation', 'in', 'the', 'complex', 'the', 'youngest', 'stars', 'are', 'concentrated', 'in', 'the', 'inner', 'part', 'of', 'the', 'complex', 'while', 'the', 'older', 'ob', 'stars', 'are', 'scattered', 'over', 'outer', 'regions', 'we', 'derived', 'the', 'present', 'day', 'mass', 'function', 'for', 'the', 'entire', 'n206', 'complex', 'as', 'well', 'as', 'for', 'the', 'cluster', 'ngc2018', 'three', 'very', 'massive', 'of', 'stars', 'are', 'found', 'to', 'dominate', 'the', 'feedback', 'among', '164', 'ob', 'stars', 'in', 'the', 'sample', 'the', 'two', 'wr', 'winds', 'alone', 'release', 'about', 'as', 'much', 'mechanical', 'luminosity', 'as', 'the', 'whole', 'ob', 'star', 'sample', 'the', 'cumulative', 'mechanical', 'feedback', 'from', 'all', 'massive', 'stellar', 'winds', 'is', 'comparable', 'to', 'the', 'combined', 'mechanical', 'energy', 'of', 'the', 'supernova', 'explosions', 'that', 'likely', 'occurred', 'in', 'the', 'complex', 'accounting', 'also', 'for', 'the', 'wr', 'wind', 'and', 'supernovae', 'the', 'mechanical', 'input', 'over', 'the', 'last', 'five', 'myr', 'is', '23times1052', 'erg', 'which', 'exceeds', 'the', 'current', 'energy', 'content', 'of', 'the', 'complex', 'by', 'more', 'than', 'a', 'factor', 'of', 'five', 'the', 'morphology', 'of', 'the', 'complex', 'suggests', 'a', 'leakage', 'of', 'hot', 'gas', 'from', 'the', 'superbubble']] | [-0.05920277788148572, 0.12748489354644568, -0.039571945545060605, 0.12157183568454527, -0.11462104775814506, -0.016281772458639283, 0.07910912962875162, 0.4075125606360439, -0.1546888660064164, -0.35118867476017046, 0.04388827234372282, -0.3021829220233485, -0.003122601704373478, 0.22351644622932115, -0.0352827364628329, -0.0657293916473207, 0.13895462359113692, -0.016370640919866182, -0.01321561238691151, -0.2831362646747715, 0.3461687958057528, 0.04708241598489575, 0.12112761011574036, -0.08093607899261257, 0.04388523795578527, -0.14819556933630687, -0.08501691162848893, -0.04282097813176314, -0.12187419927471264, 0.06710878858594253, 0.19529000727165205, 0.15752188390242503, 0.2408357031735926, -0.35429181836391366, -0.23739107250450894, 0.03727417933838203, 0.2445273553663029, 0.01706226844488321, -0.05555424012247666, -0.23995566945552874, 0.06984044136104273, -0.21027252223276988, -0.1689972189566246, 0.09907313678055428, 0.021906784901661105, 0.06591091849431088, -0.22373912022988243, 0.13619396401825212, -0.0019353598159236403, 0.13415199183882812, -0.13797596023188163, -0.12351201758251708, -0.09633627006461701, 0.09762906261834686, 0.016927474922760248, 0.05292199119158352, 0.17342806038728809, -0.17656844822713771, 0.014640569677001808, 0.43175306854148704, -0.04958876287020804, 0.0334843709342516, 0.2707559819995927, -0.2270257571948698, -0.15924387174853996, 0.1713033736181947, 0.1517072883079191, 0.15679981355638936, -0.1957141690669605, -0.019814272394190386, -0.018217829499357883, 0.18161528296052262, 0.0371501417136572, 0.07246701603857311, 0.31435245793396366, 0.13804281935713683, -0.026865318074273184, 0.12421381693629649, -0.23117625159657343, -0.09092267288957746, -0.2065036018104412, -0.10186552910062556, -0.09990107969609269, 0.08782746115638218, -0.1661023889346558, -0.14316070524177915, 0.3175238898115006, 0.06513428297778144, 0.19167263242595184, 0.0029499897616169155, 0.2938882693922959, 0.0811998189866501, 0.15457692419369826, 0.17563254073805487, 0.29988544141181195, 0.19159337543234684, 0.10250504044905448, -0.26957151517592887, 0.07019602654420454, -0.013023649976672366] |
1,802.07495 | Rapid voltage sensing with single nanorods via the quantum confined
Stark effect | Properly designed colloidal semiconductor quantum dots (QDs) have already
been shown to exhibit high sensitivity to external electric fields via the
quantum confined Stark effect (QCSE). Yet, detection of the characteristic
spectral shifts associated with the effect of QCSE has traditionally been
painstakingly slow, dramatically limiting the sensitivity of these QD sensors
to fast transients. We experimentally demonstrate a new detection scheme
designed at achieving shot-noise limited sensitivity to emission wavelength
shifts in QDs, showing feasibility for their use as local electric field
sensors on the millisecond time scale. This regime of operation is already
potentially suitable for detection of single action potentials in neurons at a
high spatial resolution.
| physics.app-ph physics.optics | properly designed colloidal semiconductor quantum dots qds have already been shown to exhibit high sensitivity to external electric fields via the quantum confined stark effect qcse yet detection of the characteristic spectral shifts associated with the effect of qcse has traditionally been painstakingly slow dramatically limiting the sensitivity of these qd sensors to fast transients we experimentally demonstrate a new detection scheme designed at achieving shotnoise limited sensitivity to emission wavelength shifts in qds showing feasibility for their use as local electric field sensors on the millisecond time scale this regime of operation is already potentially suitable for detection of single action potentials in neurons at a high spatial resolution | [['properly', 'designed', 'colloidal', 'semiconductor', 'quantum', 'dots', 'qds', 'have', 'already', 'been', 'shown', 'to', 'exhibit', 'high', 'sensitivity', 'to', 'external', 'electric', 'fields', 'via', 'the', 'quantum', 'confined', 'stark', 'effect', 'qcse', 'yet', 'detection', 'of', 'the', 'characteristic', 'spectral', 'shifts', 'associated', 'with', 'the', 'effect', 'of', 'qcse', 'has', 'traditionally', 'been', 'painstakingly', 'slow', 'dramatically', 'limiting', 'the', 'sensitivity', 'of', 'these', 'qd', 'sensors', 'to', 'fast', 'transients', 'we', 'experimentally', 'demonstrate', 'a', 'new', 'detection', 'scheme', 'designed', 'at', 'achieving', 'shotnoise', 'limited', 'sensitivity', 'to', 'emission', 'wavelength', 'shifts', 'in', 'qds', 'showing', 'feasibility', 'for', 'their', 'use', 'as', 'local', 'electric', 'field', 'sensors', 'on', 'the', 'millisecond', 'time', 'scale', 'this', 'regime', 'of', 'operation', 'is', 'already', 'potentially', 'suitable', 'for', 'detection', 'of', 'single', 'action', 'potentials', 'in', 'neurons', 'at', 'a', 'high', 'spatial', 'resolution']] | [-0.11985610103636811, 0.168135117739439, -0.03210558135231788, 0.018127628462389113, -0.019177198918028313, -0.18560943315863948, 0.028984267425469376, 0.4749797099608589, -0.23550600215199996, -0.33982144876975906, 0.04875848709224639, -0.23245845942398194, -0.0902462081211111, 0.23833892446180635, -0.05587827669964595, 0.11036807781519284, 0.014378539549017494, -0.0012628985399549659, -0.00040115499022332107, -0.19089330011259087, 0.20853954612235115, 0.11518696346531876, 0.33778160085732284, 0.07199623555960981, 0.1161085962403211, -0.04840344292196361, 0.05893159039233896, 0.02859398056329651, -0.06941736300571144, 0.05355535725935955, 0.2663104961880229, -0.003707863990116907, 0.2719813083044507, -0.42322840757551605, -0.2411206664178859, 0.11382017693249509, 0.18074727601964366, 0.12837101576045495, -0.09007876596985046, -0.32409248415550046, 0.0775822959755632, -0.13149237551472404, -0.09940876297822053, -0.09005798861299726, 0.026429465160154823, 0.037694680263203655, -0.22442500056190925, 0.035711543994363056, 0.017910293489694595, 0.08858235981315374, -0.0040608844719827175, -0.04731569899330762, 0.07271697471680288, 0.09748744022270495, -0.028975236663510175, -0.014847113666209307, 0.21688497708422472, -0.14502674961854195, -0.1417341393672607, 0.3308742070062594, -0.076197982435538, -0.12969697049437937, 0.19206807003356516, -0.21547978619452227, -0.1009085062340918, 0.1968651227568361, 0.16529295143449085, 0.12813171029768206, -0.14120878644753249, 0.07458404171365228, 0.09379231268116696, 0.19296822380274534, 0.10366512272422286, 0.14697987842796878, 0.2549396561543373, 0.19047070719640363, 0.0739812636187046, 0.12218954267234287, -0.17298449405564248, -0.04354489168829539, -0.18818277383053844, -0.10038492299764502, -0.20168733564628796, 0.08450593808242543, -0.043114090943709014, -0.14291991472154306, 0.38466741970475016, 0.1545623971276324, 0.1427277370292524, -0.003659016215665774, 0.3215669453567402, 0.14000427750764755, 0.14273590416520496, -0.03942610041069036, 0.32234494054520674, 0.17549266820265488, 0.11203596258789979, -0.2723062384905378, 0.03830716977827251, -0.045052104240114035] |
1,802.07496 | Boundary regularity of mass-minimizing integral currents and a question
of Almgren | This short note is the announcement of a forthcoming work in which we prove a
first general boundary regularity result for area-minimizing currents in higher
codimension, without any geometric assumption on the boundary, except that it
is an embedded submanifold of a Riemannian manifold, with a mild amount of
smoothness ($C^{3, a_0}$ for a positive $a_0$ suffices). Our theorem allows to
answer a question posed by Almgren at the end of his Big Regularity Paper. In
this note we discuss the ideas of the proof and we also announce a theorem
which shows that the boundary regularity is in general weaker that the interior
regularity. Moreover we remark an interesting elementary byproduct on boundary
monotonicity formulae.
| math.AP | this short note is the announcement of a forthcoming work in which we prove a first general boundary regularity result for areaminimizing currents in higher codimension without any geometric assumption on the boundary except that it is an embedded submanifold of a riemannian manifold with a mild amount of smoothness c3 a_0 for a positive a_0 suffices our theorem allows to answer a question posed by almgren at the end of his big regularity paper in this note we discuss the ideas of the proof and we also announce a theorem which shows that the boundary regularity is in general weaker that the interior regularity moreover we remark an interesting elementary byproduct on boundary monotonicity formulae | [['this', 'short', 'note', 'is', 'the', 'announcement', 'of', 'a', 'forthcoming', 'work', 'in', 'which', 'we', 'prove', 'a', 'first', 'general', 'boundary', 'regularity', 'result', 'for', 'areaminimizing', 'currents', 'in', 'higher', 'codimension', 'without', 'any', 'geometric', 'assumption', 'on', 'the', 'boundary', 'except', 'that', 'it', 'is', 'an', 'embedded', 'submanifold', 'of', 'a', 'riemannian', 'manifold', 'with', 'a', 'mild', 'amount', 'of', 'smoothness', 'c3', 'a_0', 'for', 'a', 'positive', 'a_0', 'suffices', 'our', 'theorem', 'allows', 'to', 'answer', 'a', 'question', 'posed', 'by', 'almgren', 'at', 'the', 'end', 'of', 'his', 'big', 'regularity', 'paper', 'in', 'this', 'note', 'we', 'discuss', 'the', 'ideas', 'of', 'the', 'proof', 'and', 'we', 'also', 'announce', 'a', 'theorem', 'which', 'shows', 'that', 'the', 'boundary', 'regularity', 'is', 'in', 'general', 'weaker', 'that', 'the', 'interior', 'regularity', 'moreover', 'we', 'remark', 'an', 'interesting', 'elementary', 'byproduct', 'on', 'boundary', 'monotonicity', 'formulae']] | [-0.16724171896930784, 0.057014500822208054, -0.12254800307484151, 0.09792592324485103, -0.11945830511956892, -0.14004235414804184, 0.01706352803739719, 0.3119504178215846, -0.25695626885260875, -0.21409325055970713, 0.1522687291887043, -0.22715134898028516, -0.16378650234676978, 0.18454552990191714, -0.19701720798259664, 0.0037670312850768195, 0.10312520487611343, 0.06195164524452311, -0.08087491549015575, -0.28313785846192585, 0.4220928994819305, -0.02212188265623589, 0.18524587741282222, 0.17719885726672083, 0.09333622413446549, -0.002853837871827699, 0.0078907936634817, -0.009451071763860768, -0.22617642803749638, 0.1505108196208061, 0.2077082080509642, 0.09143979230630693, 0.29745287093502504, -0.40139499163768927, -0.18129155262180702, 0.13356737742312894, 0.09327634899266835, 0.09370538988351372, -0.06307399590451528, -0.2551647149315425, 0.1320847447224941, -0.07837630394075451, -0.2457885458174258, -0.03782230225223084, 0.028929054881606638, -0.04507132100969039, -0.2791389320527428, 0.049255810904563484, 0.20409360669296364, 0.08151412678978823, -0.10101633643026961, -0.0607658129783572, -0.002685140683877699, 0.032346102918883596, 0.07349658291014623, 0.07449997727787283, 0.033025835772197504, -0.07343342291303621, -0.06312144724732457, 0.29323245571717493, -0.07626824887320881, -0.23052537971144094, 0.16548133479704247, -0.1517651902174513, -0.1976547575011801, 0.06142119172928405, 0.10879576630019262, 0.16768665529048904, -0.12099639290857434, 0.17061460128903053, -0.13591080019651944, 0.13734923783641564, 0.14880584077187012, -0.0007331538052249957, 0.10916395395881785, 0.11901438892578128, 0.17863994716377607, 0.13490737763490399, -0.0019556958718096903, -0.017398106622718405, -0.43516116345237044, -0.21727165122564626, -0.1534676900964455, 0.1670990949998417, -0.10167057548460434, -0.16227409140014187, 0.368753917947821, 0.1514659555195349, 0.19581355258083805, 0.10747637338775756, 0.26404450246853484, 0.09869242815605911, -0.011076078738150155, 0.10205862184199666, 0.1770120511325237, 0.13895112124135203, 0.1198135420477072, -0.10803438915548934, 0.03630199841352116, 0.14779195297862693] |
1,802.07497 | Landau theory of the short-time dynamical phase transitions of the
Kardar-Parisi-Zhang interface | We study the short-time distribution $\mathcal{P}\left(H,L,t\right)$ of the
two-point two-time height difference $H=h(L,t)-h(0,0)$ of a stationary
Kardar-Parisi-Zhang (KPZ) interface in 1+1 dimension. Employing the
optimal-fluctuation method, we develop an effective Landau theory for the
second-order dynamical phase transition found previously for $L=0$ at a
critical value $H=H_c$. We show that $|H|$ and $L$ play the roles of inverse
temperature and external magnetic field, respectively. In particular, we find a
first-order dynamical phase transition when $L$ changes sign, at supercritical
$H$. We also determine analytically $\mathcal{P}\left(H,L,t\right)$ in several
limits away from the second-order transition. Typical fluctuations of $H$ are
Gaussian, but the distribution tails are highly asymmetric. The tails
$-\ln\mathcal{P}\sim\left|H\right|^{3/2} \! /\sqrt{t}$ and
$-\ln\mathcal{P}\sim\left|H\right|^{5/2} \! /\sqrt{t}$, previously found for
$L=0$, are enhanced for $L \ne 0$. At very large $|L|$ the whole
height-difference distribution $\mathcal{P}\left(H,L,t\right)$ is
time-independent and Gaussian in $H$, $-\ln\mathcal{P}\sim\left|H\right|^{2} \!
/|L|$, describing the probability of creating a ramp-like height profile at
$t=0$.
| cond-mat.stat-mech | we study the shorttime distribution mathcalplefthltright of the twopoint twotime height difference hhlth00 of a stationary kardarparisizhang kpz interface in 11 dimension employing the optimalfluctuation method we develop an effective landau theory for the secondorder dynamical phase transition found previously for l0 at a critical value hh_c we show that h and l play the roles of inverse temperature and external magnetic field respectively in particular we find a firstorder dynamical phase transition when l changes sign at supercritical h we also determine analytically mathcalplefthltright in several limits away from the secondorder transition typical fluctuations of h are gaussian but the distribution tails are highly asymmetric the tails lnmathcalpsimlefthright32 sqrtt and lnmathcalpsimlefthright52 sqrtt previously found for l0 are enhanced for l ne 0 at very large l the whole heightdifference distribution mathcalplefthltright is timeindependent and gaussian in h lnmathcalpsimlefthright2 l describing the probability of creating a ramplike height profile at t0 | [['we', 'study', 'the', 'shorttime', 'distribution', 'mathcalplefthltright', 'of', 'the', 'twopoint', 'twotime', 'height', 'difference', 'hhlth00', 'of', 'a', 'stationary', 'kardarparisizhang', 'kpz', 'interface', 'in', '11', 'dimension', 'employing', 'the', 'optimalfluctuation', 'method', 'we', 'develop', 'an', 'effective', 'landau', 'theory', 'for', 'the', 'secondorder', 'dynamical', 'phase', 'transition', 'found', 'previously', 'for', 'l0', 'at', 'a', 'critical', 'value', 'hh_c', 'we', 'show', 'that', 'h', 'and', 'l', 'play', 'the', 'roles', 'of', 'inverse', 'temperature', 'and', 'external', 'magnetic', 'field', 'respectively', 'in', 'particular', 'we', 'find', 'a', 'firstorder', 'dynamical', 'phase', 'transition', 'when', 'l', 'changes', 'sign', 'at', 'supercritical', 'h', 'we', 'also', 'determine', 'analytically', 'mathcalplefthltright', 'in', 'several', 'limits', 'away', 'from', 'the', 'secondorder', 'transition', 'typical', 'fluctuations', 'of', 'h', 'are', 'gaussian', 'but', 'the', 'distribution', 'tails', 'are', 'highly', 'asymmetric', 'the', 'tails', 'lnmathcalpsimlefthright32', 'sqrtt', 'and', 'lnmathcalpsimlefthright52', 'sqrtt', 'previously', 'found', 'for', 'l0', 'are', 'enhanced', 'for', 'l', 'ne', '0', 'at', 'very', 'large', 'l', 'the', 'whole', 'heightdifference', 'distribution', 'mathcalplefthltright', 'is', 'timeindependent', 'and', 'gaussian', 'in', 'h', 'lnmathcalpsimlefthright2', 'l', 'describing', 'the', 'probability', 'of', 'creating', 'a', 'ramplike', 'height', 'profile', 'at', 't0']] | [-0.13160082005553556, 0.18822675121745783, -0.09174564739746251, 0.09862631946235109, -0.0026056612390378603, -0.16264293235599944, 0.019483945323756205, 0.36429865649413495, -0.2531986673042609, -0.2595589382916081, 0.053853773160324414, -0.28029006658372196, -0.10424060694442518, 0.13151068853683212, 0.07536544837691143, 0.056835278447362636, -0.05267927203118345, 0.035152014582512936, -0.09096549740568007, -0.1567796383205117, 0.3064136814332383, 0.0022033017166719145, 0.24873109605974283, 0.0264755893581021, 0.02495281484459533, -0.011266564899266755, 0.01289240561732959, 0.016722753349387526, -0.2091504371241246, -0.01946422755816234, 0.20912115567452497, -0.005636965852788314, 0.2526344865889979, -0.32382256041604035, -0.1900286324572477, 0.08945309092151318, 0.17989229428943018, 0.09769520760897142, -0.006780637529532925, -0.2674080134198374, 0.06215845017858661, -0.10811818983614901, -0.1886552722339018, -0.017750527294745452, 0.11088175076040396, 0.01993514038305603, -0.3058782334686542, 0.14507984265793578, 0.0834976712627444, 0.0761472335658242, -0.029103548259658066, -0.16214914313916648, -0.04370727833537828, 0.08875755267079166, 0.006907347608020103, 0.05487030500159631, 0.13999084996845143, -0.15500677498627682, -0.032130717337891766, 0.29930851640430006, -0.12415368429410467, -0.13324187083968095, 0.16434334075319118, -0.22180905065825526, -0.12035111361500002, 0.1924904264908816, 0.13600107284934343, 0.12216543634168703, -0.09834948775002521, 0.14758056150210805, -0.006020600362649175, 0.14588809959894541, 0.08367499222560805, 0.0016717084936503017, 0.16374228191466964, 0.09178154670623873, 0.06928851962925828, 0.1463767834543092, -0.1344651458848293, -0.13288479062671565, -0.33661884395088876, -0.1206407497326533, -0.18532687258038696, 0.05491368971518748, -0.11088270854900217, -0.17918646947915712, 0.32189162296946255, 0.1271421011999807, 0.21877780109232126, 0.08656977812385783, 0.17838114786570017, 0.1997324650613021, -0.013446380434950599, 0.12160613589134499, 0.1938677049577743, 0.13329322323469178, 0.1276464245130061, -0.25695872781513146, 0.04353873819258495, 0.05825898912260119] |
1,802.07498 | ALP production through non-linear Compton scattering in intense fields | We derive production yields for massive pseudo-scalar and scalar
axion-like-particles (ALPs), through non-linear Compton scattering of an
electron in the background of low- and high-intensity electromagnetic fields.
In particular, we focus on electromagnetic fields from Gaussian plane wave
laser pulses. A detailed study of the angular distributions and effects of the
scalar and pseudo-scalar masses is presented. It is shown that
ultra-relativistic seed electrons can be used to produce scalars and
pseudo-scalars with masses up to the order of the electron mass. We briefly
discuss future applications of this work towards lab-based searches for light
beyond-the-Standard-Model particles.
| hep-ph | we derive production yields for massive pseudoscalar and scalar axionlikeparticles alps through nonlinear compton scattering of an electron in the background of low and highintensity electromagnetic fields in particular we focus on electromagnetic fields from gaussian plane wave laser pulses a detailed study of the angular distributions and effects of the scalar and pseudoscalar masses is presented it is shown that ultrarelativistic seed electrons can be used to produce scalars and pseudoscalars with masses up to the order of the electron mass we briefly discuss future applications of this work towards labbased searches for light beyondthestandardmodel particles | [['we', 'derive', 'production', 'yields', 'for', 'massive', 'pseudoscalar', 'and', 'scalar', 'axionlikeparticles', 'alps', 'through', 'nonlinear', 'compton', 'scattering', 'of', 'an', 'electron', 'in', 'the', 'background', 'of', 'low', 'and', 'highintensity', 'electromagnetic', 'fields', 'in', 'particular', 'we', 'focus', 'on', 'electromagnetic', 'fields', 'from', 'gaussian', 'plane', 'wave', 'laser', 'pulses', 'a', 'detailed', 'study', 'of', 'the', 'angular', 'distributions', 'and', 'effects', 'of', 'the', 'scalar', 'and', 'pseudoscalar', 'masses', 'is', 'presented', 'it', 'is', 'shown', 'that', 'ultrarelativistic', 'seed', 'electrons', 'can', 'be', 'used', 'to', 'produce', 'scalars', 'and', 'pseudoscalars', 'with', 'masses', 'up', 'to', 'the', 'order', 'of', 'the', 'electron', 'mass', 'we', 'briefly', 'discuss', 'future', 'applications', 'of', 'this', 'work', 'towards', 'labbased', 'searches', 'for', 'light', 'beyondthestandardmodel', 'particles']] | [-0.09891984337753587, 0.2855029630238615, -0.04441102203365761, 0.1326390943026708, -0.08032337426611212, -0.09564944317554767, -0.02695625396349381, 0.3873729650075211, -0.1558346078399876, -0.283885992540181, -0.0015484297038392, -0.2976418313733542, -0.042354333348879496, 0.2399165012417499, 0.08487178903791592, 0.06251351454669667, 0.02450336301555262, -0.0063566865601106404, -0.012498137826752877, -0.19495265250161445, 0.340240744043372, 0.07876967168269083, 0.19483570961915342, 0.10801677412555083, 0.10319023758902685, 0.06539549403967931, -0.035298029889146196, -0.08355727784105182, -0.09038051309493987, 0.08142124134183083, 0.19495790023068638, 0.09958144971505575, 0.14938153039913663, -0.4343394362895759, -0.20922733537526322, 0.11915505724507816, 0.17343738386119456, 0.12947880312531573, -0.13760028186748668, -0.30405925362150077, 0.03158489882780392, -0.14330612508983342, -0.16575280568303213, -0.0645239000741546, -0.03136168849491274, 0.030895438023660446, -0.3292087456979549, 0.040501727708183305, -0.030126811468436085, -0.03262404351226371, -0.05103395985002562, -0.12297188258278616, 0.0011502394702323933, -0.002351668284073011, 0.15067593275674993, 0.048166685015174376, 0.18719237852246337, -0.18756241697251566, -0.11537205288906764, 0.41937951546296787, -0.11132928456021376, -0.16868500532486388, 0.16715262424123964, -0.1832561590516767, -0.09319788076646011, 0.14808518273429466, 0.28226718575376825, 0.12337056315052755, -0.18075481701891907, 0.09313043790773252, -0.006626624498635137, 0.1500069968373582, 0.10031232162926, 0.0937310034245944, 0.302429100786595, 0.16338013909209864, -0.013177029591668206, 0.11115912056033567, -0.11507737856195069, 0.0014267456285732309, -0.32867703840290147, -0.16199086368871257, -0.09921659172642208, 0.07423441377081356, -0.06643627488102942, -0.09924133114376317, 0.3878040500465281, 0.17216135909752056, 0.14747791854453454, -0.013817023092247162, 0.30906030677796636, 0.12700063692040972, 0.016161130054748243, 0.06410209350191902, 0.3452635244610383, 0.20674072629436083, 0.1272814141624828, -0.20830662186814414, -0.1040755569425978, -0.008602133913676148] |
1,802.07499 | Relative Phase Shifts for Metaplectic Isotopies Acting on Mixed Gaussian
States | We address in this paper the notion of relative phase shift for mixed quantum
systems. We study the Pancharatnam-Sjoeqvist phase shift for metaplectic
isotopies acting on Gaussian mixed states. We complete and generalize previous
results obtained by one of us while giving rigorous proofs. This gives us the
opportunity to review and complement the theory of the Conley-Zehnder index
which plays an essential role in the determination of phase shifts.
| math-ph math.FA math.MP math.SG quant-ph | we address in this paper the notion of relative phase shift for mixed quantum systems we study the pancharatnamsjoeqvist phase shift for metaplectic isotopies acting on gaussian mixed states we complete and generalize previous results obtained by one of us while giving rigorous proofs this gives us the opportunity to review and complement the theory of the conleyzehnder index which plays an essential role in the determination of phase shifts | [['we', 'address', 'in', 'this', 'paper', 'the', 'notion', 'of', 'relative', 'phase', 'shift', 'for', 'mixed', 'quantum', 'systems', 'we', 'study', 'the', 'pancharatnamsjoeqvist', 'phase', 'shift', 'for', 'metaplectic', 'isotopies', 'acting', 'on', 'gaussian', 'mixed', 'states', 'we', 'complete', 'and', 'generalize', 'previous', 'results', 'obtained', 'by', 'one', 'of', 'us', 'while', 'giving', 'rigorous', 'proofs', 'this', 'gives', 'us', 'the', 'opportunity', 'to', 'review', 'and', 'complement', 'the', 'theory', 'of', 'the', 'conleyzehnder', 'index', 'which', 'plays', 'an', 'essential', 'role', 'in', 'the', 'determination', 'of', 'phase', 'shifts']] | [-0.1263330567626458, 0.11518775049678853, -0.1275283874053022, 0.029397307591431814, -0.08257584480325812, -0.08649628182225254, 0.08459988860345945, 0.321832829222515, -0.24572877558893053, -0.2791416370782299, 0.06328831684937619, -0.24397120030893796, -0.16712927717067624, 0.19386438094079494, -0.12026503414887449, 0.013302634321693062, 0.031179692879643128, 0.02202452604483435, -0.10000525462184695, -0.18387074965605701, 0.37966971553565154, 0.04296952440653104, 0.26037719824175903, 0.08491634247838047, 0.03421869998176893, 0.08159940907785641, -0.09392416014241567, -0.03566004192807536, -0.211824053844464, 0.18231990189288164, 0.23882342059759126, 0.04944539630947554, 0.2294783071493325, -0.40504897904136905, -0.18331676671126237, 0.14824406105174642, 0.11315814656731875, 0.11900262556382982, -0.029280185846247427, -0.29125732340026594, 0.023900770413540842, -0.15357709632076297, -0.18243032448884586, -0.11247103053914465, -0.00491021124754047, -0.07110807121869689, -0.23162938975661562, 0.04613277351186759, 0.13556646048548998, 0.07204469786012087, -0.07653598306511623, -0.10170554715222206, 0.06190544365149369, 0.1983487343793546, -0.01648703252599723, 0.028495629611627563, 0.052013996745581215, -0.07589773887741393, -0.12469767135284517, 0.3731647964458967, -0.06654517198710339, -0.15755219115079314, 0.14478313926931308, -0.1279980083404487, -0.17743113357573748, 0.09144267326463824, 0.1581928765239275, 0.10177635822607123, -0.048916586445293564, 0.08832142971611272, -0.025697626936100962, 0.14047558500390986, 0.0653716666434986, 0.09196316682315175, 0.16396005288360344, 0.10687841488507346, 0.13037919355691344, 0.19418778911948312, -0.024815603925347113, -0.15804967447521462, -0.32958600980540115, -0.21478228751515996, -0.10184883108983438, 0.038473878285267216, -0.0379060537590598, -0.17738687449499316, 0.4585531874816271, 0.14422735420690067, 0.1860938235135425, 0.04175662801202819, 0.2487918306277066, 0.12380435452729031, -0.006219153953851133, -0.007554677935938041, 0.2236704563425071, 0.23008500425941378, 0.08357365902823706, -0.21350236214103474, 0.029913875773765038, 0.12216964027965846] |
1,802.075 | Passive Decoupling of Two Closely Located Dipole Antennas | In this paper, we prove that two parallel dipole antennas can be decoupled by
a similar but passive dipole located in the middle between them. The decoupling
is proved for whatever excitation of these antennas and for ultimately small
distances between them. Our theoretical model based on the method of induced
electromotive forces is validated by numerical simulations and measurements. A
good agreement between theory, simulation and measurement proves the veracity
of our approach.
| physics.app-ph | in this paper we prove that two parallel dipole antennas can be decoupled by a similar but passive dipole located in the middle between them the decoupling is proved for whatever excitation of these antennas and for ultimately small distances between them our theoretical model based on the method of induced electromotive forces is validated by numerical simulations and measurements a good agreement between theory simulation and measurement proves the veracity of our approach | [['in', 'this', 'paper', 'we', 'prove', 'that', 'two', 'parallel', 'dipole', 'antennas', 'can', 'be', 'decoupled', 'by', 'a', 'similar', 'but', 'passive', 'dipole', 'located', 'in', 'the', 'middle', 'between', 'them', 'the', 'decoupling', 'is', 'proved', 'for', 'whatever', 'excitation', 'of', 'these', 'antennas', 'and', 'for', 'ultimately', 'small', 'distances', 'between', 'them', 'our', 'theoretical', 'model', 'based', 'on', 'the', 'method', 'of', 'induced', 'electromotive', 'forces', 'is', 'validated', 'by', 'numerical', 'simulations', 'and', 'measurements', 'a', 'good', 'agreement', 'between', 'theory', 'simulation', 'and', 'measurement', 'proves', 'the', 'veracity', 'of', 'our', 'approach']] | [-0.14675462015942242, 0.11472340995395505, -0.09188571790897136, 0.035612690943683425, -0.0049599790442231536, -0.137633858304046, 0.05329030813457369, 0.3824529656133539, -0.22951199008604964, -0.33237271607425567, 0.016977372223737876, -0.27116736581838513, -0.14745959611861287, 0.23743331958728567, -0.007587635084181218, 0.006312730042515574, 0.08780363528529887, -0.014964560386598916, -0.02504951793486504, -0.19015199771604022, 0.2758189798395678, 0.06016499547891923, 0.3103397733255013, 0.08373908845808457, 0.0924583663157112, -0.030118070347738023, -0.042521141293282445, 0.05235198059597531, -0.09908198546730312, 0.1430044967328777, 0.23865916099197962, 0.046811852733151534, 0.23717169536630045, -0.45602947569175345, -0.15743878188014432, 0.0519657771958894, 0.14314120979287434, 0.11532246025681898, -0.08717510297837844, -0.28863547731039896, 0.12288060759169024, -0.14022066162244692, -0.12943380269398158, -0.05601696119442381, 0.00821711543343357, 0.05421779017794777, -0.31130250362125605, 0.07054215614256021, 0.038840650719263264, 0.07125101947049434, -0.046652518857799065, -0.0946251935187123, 0.003751412929960753, 0.13443063938442767, 0.05602891060265687, 0.009550215311449122, 0.09749627848961265, -0.05353750351099046, -0.0782155919870412, 0.33917586501637426, -0.0600037753733026, -0.18914644639762873, 0.209346595248585, -0.139190281023951, -0.06661050738546544, 0.08883928350248449, 0.15215489736481294, 0.12628924727087487, -0.14871633930031108, 0.02778869614750776, -0.05037319869577029, 0.17876715998391848, 0.0634760871668019, -0.030985578379497038, 0.23021448917082837, 0.16087757269977718, 0.04738568478087719, 0.10037911885789268, -0.08390456209088222, -0.10995635682263889, -0.31624011847039535, -0.10902372309686365, -0.23155702466799602, 0.0029144153640781705, -0.09441797560449797, -0.08279934670222369, 0.3356570607756038, 0.19025985945985224, 0.14692805280493623, 0.08271242252777557, 0.38215861383926225, 0.07800474846452424, 0.046796105776888294, 0.06596179339229255, 0.3414685783429524, 0.1763925786520279, 0.035907232341029355, -0.2386907738180378, 0.05878439542799685, 0.03587270773494163] |
1,802.07501 | Geometric Law for Multiple Returns until a Hazard | For a $\psi$-mixing stationary process $\xi_0,\xi_1,\xi_2,...$ we consider
the number $\mathcal N_N$ of multiple recurrencies
$\{\xi_{q_i(n)}\in\Gamma_N,\, i=1,...,\ell\}$ to a set $\Gamma_N$ for $n$ until
the moment $\tau_N$ (which we call a hazard) when another multiple recurrence
$\{\xi_{q_i(n)}\in\Delta_N,\, i=1,...,\ell\}$ takes place for the first time
where $\Gamma_N\cap\Delta_N= \emptyset$ and $q_i(n)<q_{i+1}(n),\, i=1,...,\ell$
are nonnegative increasing functions taking on integer values on integers. It
turns out that if $P\{\xi_0\in\Gamma_N\}$ and $P\{\xi_0\in\Delta_N\}$ decay in
$N$ with the same speed then $\mathcal N_N$ converges weakly to a geometrically
distributed random variable. We obtain also a similar result in the dynamical
systems setup considering a $\psi$-mixing shift $T$ on a sequence space
$\Omega$ and study the number of multiple recurrencies $\{ T^{q_i(n)}\omega\in
A_n^b,\, i=1,...,\ell\}$ until the first occurence of another multiple
recurrence $\{ T^{q_i(n)}\omega\in A_m^a,\, i=1,...,\ell\}$ where $A_m^a,\,
A_n^b$ are cylinder sets of length $m$ and $n$ constructed by sequences
$a,b\in\Omega$, respectively, and chosen so that their probabilities have the
same order. This work is motivated by a number of papers on asymptotics of
numbers of single and multiple returns to shrinking sets, as well as by the
papers on open systems studying their behavior until an exit through a "hole".
| math.PR math.DS | for a psimixing stationary process xi_0xi_1xi_2 we consider the number mathcal n_n of multiple recurrencies xi_q_iningamma_n i1ell to a set gamma_n for n until the moment tau_n which we call a hazard when another multiple recurrence xi_q_inindelta_n i1ell takes place for the first time where gamma_ncapdelta_n emptyset and q_inq_i1n i1ell are nonnegative increasing functions taking on integer values on integers it turns out that if pxi_0ingamma_n and pxi_0indelta_n decay in n with the same speed then mathcal n_n converges weakly to a geometrically distributed random variable we obtain also a similar result in the dynamical systems setup considering a psimixing shift t on a sequence space omega and study the number of multiple recurrencies tq_inomegain a_nb i1ell until the first occurence of another multiple recurrence tq_inomegain a_ma i1ell where a_ma a_nb are cylinder sets of length m and n constructed by sequences abinomega respectively and chosen so that their probabilities have the same order this work is motivated by a number of papers on asymptotics of numbers of single and multiple returns to shrinking sets as well as by the papers on open systems studying their behavior until an exit through a hole | [['for', 'a', 'psimixing', 'stationary', 'process', 'xi_0xi_1xi_2', 'we', 'consider', 'the', 'number', 'mathcal', 'n_n', 'of', 'multiple', 'recurrencies', 'xi_q_iningamma_n', 'i1ell', 'to', 'a', 'set', 'gamma_n', 'for', 'n', 'until', 'the', 'moment', 'tau_n', 'which', 'we', 'call', 'a', 'hazard', 'when', 'another', 'multiple', 'recurrence', 'xi_q_inindelta_n', 'i1ell', 'takes', 'place', 'for', 'the', 'first', 'time', 'where', 'gamma_ncapdelta_n', 'emptyset', 'and', 'q_inq_i1n', 'i1ell', 'are', 'nonnegative', 'increasing', 'functions', 'taking', 'on', 'integer', 'values', 'on', 'integers', 'it', 'turns', 'out', 'that', 'if', 'pxi_0ingamma_n', 'and', 'pxi_0indelta_n', 'decay', 'in', 'n', 'with', 'the', 'same', 'speed', 'then', 'mathcal', 'n_n', 'converges', 'weakly', 'to', 'a', 'geometrically', 'distributed', 'random', 'variable', 'we', 'obtain', 'also', 'a', 'similar', 'result', 'in', 'the', 'dynamical', 'systems', 'setup', 'considering', 'a', 'psimixing', 'shift', 't', 'on', 'a', 'sequence', 'space', 'omega', 'and', 'study', 'the', 'number', 'of', 'multiple', 'recurrencies', 'tq_inomegain', 'a_nb', 'i1ell', 'until', 'the', 'first', 'occurence', 'of', 'another', 'multiple', 'recurrence', 'tq_inomegain', 'a_ma', 'i1ell', 'where', 'a_ma', 'a_nb', 'are', 'cylinder', 'sets', 'of', 'length', 'm', 'and', 'n', 'constructed', 'by', 'sequences', 'abinomega', 'respectively', 'and', 'chosen', 'so', 'that', 'their', 'probabilities', 'have', 'the', 'same', 'order', 'this', 'work', 'is', 'motivated', 'by', 'a', 'number', 'of', 'papers', 'on', 'asymptotics', 'of', 'numbers', 'of', 'single', 'and', 'multiple', 'returns', 'to', 'shrinking', 'sets', 'as', 'well', 'as', 'by', 'the', 'papers', 'on', 'open', 'systems', 'studying', 'their', 'behavior', 'until', 'an', 'exit', 'through', 'a', 'hole']] | [-0.16930024146707984, 0.1677471072842587, -0.05721231854312081, 0.029704087562438006, -0.017129533025283427, -0.13476570698501328, 0.08321122287440526, 0.3301197540299977, -0.2777376869525455, -0.22652159200070293, 0.11362967365345017, -0.29562873948528307, -0.0965039606977132, 0.19231534970713057, -0.0314221536801731, 0.047064211407928894, 0.03343033427474359, 0.10739519910713852, -0.026201900873394288, -0.278968503832298, 0.31465441475640166, -0.010071847491129174, 0.19674465718266906, -0.020813618595788223, 0.10158323061454003, 0.030812047215819847, 0.0029767986591854464, 0.014020058850451154, -0.13819361325199753, 0.0301164335258244, 0.2034768326096033, 0.12228713770615843, 0.30833905471152945, -0.3882031942389478, -0.14746578513324016, 0.14929332510603827, 0.17677570888874392, 0.024529098127866824, 0.002537218638812828, -0.2550843735861648, 0.10953821149105053, -0.1359455853304953, -0.09588925783376749, -0.03717586852080835, 0.10979981778209896, 0.06042276005530374, -0.3163281577763967, 0.003565759208311627, 0.07357339565677166, 0.017917321349845312, -0.008777568017544805, -0.13496229581310937, -0.008180937539567265, 0.12357428947879037, 0.0545852062108868, 0.04171529023073451, 0.04772334272561014, -0.0425643105142323, -0.08320521204376115, 0.3280283682394386, -0.06631098170841082, -0.19941683859141962, 0.12421919923540348, -0.15976440876880102, -0.17399306210073454, 0.1100743585088051, 0.15426027700254094, 0.15803391569360195, -0.09736624932531433, 0.10196988856422466, -0.0942874416362881, 0.14249257574460972, 0.12853215943736945, 0.015292266469011134, 0.1858858652005756, 0.12355930866200293, 0.0638675699354012, 0.1420653676995855, -0.047123877393957125, -0.07689260698529214, -0.30439458440262773, -0.1432077364418452, -0.20636684435185634, 0.11390088946823174, -0.0988217236932502, -0.18240201227936914, 0.32196141340988665, 0.07574915110840987, 0.28060829746562355, 0.13367316143597888, 0.2267638001504451, 0.12314384501267421, 0.012051862866180069, 0.07113183575270117, 0.08481141925685087, 0.10770709818939021, 0.06272427034895114, -0.17249219295412271, 0.06102237645587553, 0.10497291781430647] |
1,802.07502 | Approximation Algorithms for Road Coverage Using Wireless Sensor
Networks for Moving Objects Monitoring | Coverage problem in wireless sensor networks measures how well a region or
parts of it is sensed by the deployed sensors. Definition of coverage metric
depends on its applications for which sensors are deployed. In this paper, we
introduce a new quality control metric/measure called road coverage. It will be
used for measuring efficiency of a sensor network, which is deployed for
tracking moving/mobile objects in a road network. A road segment is a sub-part
of a road network. A road segment is said to be road covered if an object
travels through the entire road segment then it must be detected somewhere on
the road segment by a sensor. First, we propose different definitions of road
coverage metrics. Thereafter, algorithms are proposed to measure those proposed
road coverage metrics. It is shown that the problem of deploying minimum number
of sensors to road cover a set of road segments is NP-hard. Constant factor
approximation algorithms are proposed for road covering axis-parallel road
segments. Experimental performance analysis of our algorithms are evaluated
through simulations.
| cs.CG | coverage problem in wireless sensor networks measures how well a region or parts of it is sensed by the deployed sensors definition of coverage metric depends on its applications for which sensors are deployed in this paper we introduce a new quality control metricmeasure called road coverage it will be used for measuring efficiency of a sensor network which is deployed for tracking movingmobile objects in a road network a road segment is a subpart of a road network a road segment is said to be road covered if an object travels through the entire road segment then it must be detected somewhere on the road segment by a sensor first we propose different definitions of road coverage metrics thereafter algorithms are proposed to measure those proposed road coverage metrics it is shown that the problem of deploying minimum number of sensors to road cover a set of road segments is nphard constant factor approximation algorithms are proposed for road covering axisparallel road segments experimental performance analysis of our algorithms are evaluated through simulations | [['coverage', 'problem', 'in', 'wireless', 'sensor', 'networks', 'measures', 'how', 'well', 'a', 'region', 'or', 'parts', 'of', 'it', 'is', 'sensed', 'by', 'the', 'deployed', 'sensors', 'definition', 'of', 'coverage', 'metric', 'depends', 'on', 'its', 'applications', 'for', 'which', 'sensors', 'are', 'deployed', 'in', 'this', 'paper', 'we', 'introduce', 'a', 'new', 'quality', 'control', 'metricmeasure', 'called', 'road', 'coverage', 'it', 'will', 'be', 'used', 'for', 'measuring', 'efficiency', 'of', 'a', 'sensor', 'network', 'which', 'is', 'deployed', 'for', 'tracking', 'movingmobile', 'objects', 'in', 'a', 'road', 'network', 'a', 'road', 'segment', 'is', 'a', 'subpart', 'of', 'a', 'road', 'network', 'a', 'road', 'segment', 'is', 'said', 'to', 'be', 'road', 'covered', 'if', 'an', 'object', 'travels', 'through', 'the', 'entire', 'road', 'segment', 'then', 'it', 'must', 'be', 'detected', 'somewhere', 'on', 'the', 'road', 'segment', 'by', 'a', 'sensor', 'first', 'we', 'propose', 'different', 'definitions', 'of', 'road', 'coverage', 'metrics', 'thereafter', 'algorithms', 'are', 'proposed', 'to', 'measure', 'those', 'proposed', 'road', 'coverage', 'metrics', 'it', 'is', 'shown', 'that', 'the', 'problem', 'of', 'deploying', 'minimum', 'number', 'of', 'sensors', 'to', 'road', 'cover', 'a', 'set', 'of', 'road', 'segments', 'is', 'nphard', 'constant', 'factor', 'approximation', 'algorithms', 'are', 'proposed', 'for', 'road', 'covering', 'axisparallel', 'road', 'segments', 'experimental', 'performance', 'analysis', 'of', 'our', 'algorithms', 'are', 'evaluated', 'through', 'simulations']] | [-0.17391098615500775, 0.027044074022499816, -0.03893836135330012, -0.0009564916102614017, -0.08322379923549432, -0.15775238267668237, 0.07569387962441418, 0.4573476939701685, -0.24011437509816566, -0.31229437721322556, 0.12416475575290771, -0.32762216523860316, -0.18069461085618274, 0.19774558171602988, -0.16662998634913392, 0.11157224238197443, 0.14529801086883323, 0.07354036856959494, 0.021043411888063728, -0.2618774073642566, 0.26178101475775845, 0.02895021874651399, 0.3381702736668784, 0.1190201154630093, 0.10932421894485637, -0.0429516841382908, -0.04452797985296546, 0.10010192797430441, -0.11174137941098165, 0.14394507633193768, 0.3362006674133069, 0.21271769877663152, 0.255045146982164, -0.39902535290861063, -0.2627173493309431, 0.11971094812982516, 0.12316969391819886, 0.0209850233581154, 0.029749102157007667, -0.379447219640318, 0.12205001968901195, -0.14879225444511612, -0.07696255351782835, 0.01425427019143897, 0.04214813558094074, 0.01471238789913067, -0.25876987984436267, -0.0707019391022838, -0.03990277265147387, 0.031541897316404076, -0.011058293706252956, -0.017878060040704778, 0.02197251586927198, 0.21875598231085572, -0.03056823004173745, 0.04570518067440373, 0.2041934819251428, -0.12119737552341633, -0.1056028031555645, 0.4097385059912942, 0.0052452950140816626, -0.24599740037296206, 0.10222206589889664, -0.013245418678560009, -0.10401390164261522, 0.13065902170499066, 0.23277042010486815, 0.1335266830488458, -0.19120168351605965, -0.003630174971939296, -0.05253513310255343, 0.11422813708780905, 0.09800262646776532, -0.03282665167639107, 0.19991420154093706, 0.27608078802771585, 0.22900325666596263, 0.13302773636741552, -0.1709901921321891, -0.05536599130762709, -0.2566969164006541, -0.12095986082450072, -0.22606402528714498, -0.014520084903295545, -0.0925055152219801, -0.17310359633195946, 0.4050370970191811, 0.16728831326179852, 0.18695199274258806, 0.10210984800753824, 0.35888632971556544, 0.03746026232201038, 0.08849960143174546, 0.11354661108979772, 0.17786385631592502, 0.01575472695494577, 0.11849239034405937, -0.0918439680709089, 0.11747396352157169, 0.05544865398393201] |
1,802.07503 | Progenitors of Core-Collapse Supernovae | Massive stars have a strong impact on their surroundings, in particular when
they produce a core-collapse supernova at the end of their evolution. In these
proceedings, we review the general evolution of massive stars and their
properties at collapse as well as the transition between massive and
intermediate-mass stars. We also summarise the effects of metallicity and
rotation. We then discuss some of the major uncertainties in the modelling of
massive stars, with a particular emphasis on the treatment of convection in 1D
stellar evolution codes. Finally, we present new 3D hydrodynamic simulations of
convection in carbon burning and list key points to take from 3D hydrodynamic
studies for the development of new prescriptions for convective boundary mixing
in 1D stellar evolution codes.
| astro-ph.SR | massive stars have a strong impact on their surroundings in particular when they produce a corecollapse supernova at the end of their evolution in these proceedings we review the general evolution of massive stars and their properties at collapse as well as the transition between massive and intermediatemass stars we also summarise the effects of metallicity and rotation we then discuss some of the major uncertainties in the modelling of massive stars with a particular emphasis on the treatment of convection in 1d stellar evolution codes finally we present new 3d hydrodynamic simulations of convection in carbon burning and list key points to take from 3d hydrodynamic studies for the development of new prescriptions for convective boundary mixing in 1d stellar evolution codes | [['massive', 'stars', 'have', 'a', 'strong', 'impact', 'on', 'their', 'surroundings', 'in', 'particular', 'when', 'they', 'produce', 'a', 'corecollapse', 'supernova', 'at', 'the', 'end', 'of', 'their', 'evolution', 'in', 'these', 'proceedings', 'we', 'review', 'the', 'general', 'evolution', 'of', 'massive', 'stars', 'and', 'their', 'properties', 'at', 'collapse', 'as', 'well', 'as', 'the', 'transition', 'between', 'massive', 'and', 'intermediatemass', 'stars', 'we', 'also', 'summarise', 'the', 'effects', 'of', 'metallicity', 'and', 'rotation', 'we', 'then', 'discuss', 'some', 'of', 'the', 'major', 'uncertainties', 'in', 'the', 'modelling', 'of', 'massive', 'stars', 'with', 'a', 'particular', 'emphasis', 'on', 'the', 'treatment', 'of', 'convection', 'in', '1d', 'stellar', 'evolution', 'codes', 'finally', 'we', 'present', 'new', '3d', 'hydrodynamic', 'simulations', 'of', 'convection', 'in', 'carbon', 'burning', 'and', 'list', 'key', 'points', 'to', 'take', 'from', '3d', 'hydrodynamic', 'studies', 'for', 'the', 'development', 'of', 'new', 'prescriptions', 'for', 'convective', 'boundary', 'mixing', 'in', '1d', 'stellar', 'evolution', 'codes']] | [-0.06309512440054639, 0.13959372851513024, -0.03270831077957783, 0.10169822256633543, -0.06318033911378645, -0.02790147091860209, 0.03942779288627207, 0.3712948735621644, -0.1712533273181416, -0.3206520510716288, 0.09848383773019825, -0.26078264770946064, -0.09673223165961785, 0.178716515228758, -0.047577681097512446, 0.010513401056480845, 0.14865856863013127, -0.042480855354872664, -0.12157263899150085, -0.2481605290090741, 0.4058111299745496, 0.06980799171104421, 0.15995462784710213, 0.0006408480230749138, 0.013937651062369103, -0.12013229273441361, -0.08866788692984397, -0.02637161207726089, -0.2002362414259403, 0.025384216497432652, 0.18983279284417753, 0.13787640451748923, 0.24327697491318714, -0.46743566692784067, -0.25797500246870747, 0.01438212256719608, 0.21273969837683973, 0.16501955719043812, -0.13110864475725326, -0.21152172314109113, 0.04967547629437432, -0.20494931620144383, -0.13806943043430403, 0.026502977753800106, 0.03151338857909044, 0.07096246299826033, -0.22315058639136756, 0.07655450638276676, 0.053542858543351474, 0.10536979148883706, -0.09385290378477515, -0.1161051663821866, -0.0858053721211154, 0.14819537607855465, 0.039657810441695335, -0.018850475299830843, 0.08890497364383948, -0.1748080973218127, -0.016016324940402577, 0.4613727240603629, -0.07605032701418182, -0.1084004291030389, 0.2438971440921106, -0.20639456055937258, -0.1961797189338481, 0.060352278377376195, 0.2788033523876977, 0.14201881988276918, -0.13882636653916716, -0.007918305723450897, 0.012968485471716801, 0.07898803331654489, 0.01789358298945415, 0.0706409844506567, 0.3356900153515058, 0.20749730873678818, -0.04045089777952772, 0.0692778252504342, -0.1462603287214822, -0.0962221798699016, -0.28820847117955367, -0.15380803696674908, -0.07442140898182685, 0.07215884908640045, -0.12337143451866989, -0.18926610251722054, 0.354995386262341, 0.17140024622553976, 0.15174875952061115, 0.017399220301474377, 0.2857265417327786, 0.05781500114741304, 0.0658021917400079, 0.1346254745816312, 0.2851247983330168, 0.2218853619585677, 0.11777151840155929, -0.29064995606005856, 0.039402496417969224, 0.047228234774637515] |
1,802.07504 | Skueue: A Scalable and Sequentially Consistent Distributed Queue | We propose a distributed protocol for a queue, called \textsc{Skueue}, which
spreads its data fairly onto multiple processes, avoiding bottlenecks in high
throughput scenarios. \textsc{Skueue} can be used in highly dynamic
environments, through the addition of join and leave requests to the standard
queue operations enqueue and dequeue. Furthermore \textsc{Skueue} satisfies
sequential consistency in the asynchronous message passing model. Scalability
is achieved by aggregating multiple requests to a batch, which can then be
processed in a distributed fashion without hurting the queue semantics.
Operations in \textsc{Skueue} need a logarithmic number of rounds w.h.p. until
they are processed, even under a high rate of incoming requests.
| cs.DC | we propose a distributed protocol for a queue called textscskueue which spreads its data fairly onto multiple processes avoiding bottlenecks in high throughput scenarios textscskueue can be used in highly dynamic environments through the addition of join and leave requests to the standard queue operations enqueue and dequeue furthermore textscskueue satisfies sequential consistency in the asynchronous message passing model scalability is achieved by aggregating multiple requests to a batch which can then be processed in a distributed fashion without hurting the queue semantics operations in textscskueue need a logarithmic number of rounds whp until they are processed even under a high rate of incoming requests | [['we', 'propose', 'a', 'distributed', 'protocol', 'for', 'a', 'queue', 'called', 'textscskueue', 'which', 'spreads', 'its', 'data', 'fairly', 'onto', 'multiple', 'processes', 'avoiding', 'bottlenecks', 'in', 'high', 'throughput', 'scenarios', 'textscskueue', 'can', 'be', 'used', 'in', 'highly', 'dynamic', 'environments', 'through', 'the', 'addition', 'of', 'join', 'and', 'leave', 'requests', 'to', 'the', 'standard', 'queue', 'operations', 'enqueue', 'and', 'dequeue', 'furthermore', 'textscskueue', 'satisfies', 'sequential', 'consistency', 'in', 'the', 'asynchronous', 'message', 'passing', 'model', 'scalability', 'is', 'achieved', 'by', 'aggregating', 'multiple', 'requests', 'to', 'a', 'batch', 'which', 'can', 'then', 'be', 'processed', 'in', 'a', 'distributed', 'fashion', 'without', 'hurting', 'the', 'queue', 'semantics', 'operations', 'in', 'textscskueue', 'need', 'a', 'logarithmic', 'number', 'of', 'rounds', 'whp', 'until', 'they', 'are', 'processed', 'even', 'under', 'a', 'high', 'rate', 'of', 'incoming', 'requests']] | [-0.24056581052270934, 0.11025786329880177, -0.090307809269199, 0.031020645111521635, -0.049647354368621915, -0.22172966094848773, 0.19706370006455332, 0.4299205981727797, -0.33547150143063986, -0.30423697201499283, 0.12546820463411187, -0.23817588608317936, -0.035222797320994474, 0.12510165554480268, -0.14847804527156627, 0.08638209664618793, 0.12679976692351586, 0.05737068659912508, -0.004295521405695651, -0.3207060568126438, 0.19063478668193476, 0.08415523579773995, 0.2898024905298371, -0.029246621870977554, 0.09459308498256948, 0.03833301122694348, 0.0025387397304607127, 0.0037279182937569343, -0.018570907440824576, 0.03925477736181794, 0.29744732102307564, 0.23073736053461638, 0.2972417274364628, -0.5163267644014783, -0.1565213848649504, 0.09829043652504109, 0.18514633655566007, 0.050406284986260846, -0.038319690708214275, -0.25131266007128245, 0.16176245136571546, -0.21691212308136387, -0.009845619645112982, -0.05786698650962745, -0.06105184592664815, 0.04295219969040213, -0.31950050617496556, -0.007251447865900655, 0.03368996681036571, -0.025674194366169665, 0.030786108376700073, -0.002331553951640112, -0.0015597692914665318, 0.14414444688121036, 0.002816631324374332, -0.005608101475025671, 0.15951526414853737, -0.11729786134898089, -0.1357921345714623, 0.3856394352534643, -0.043836527834803116, -0.17381961374149585, 0.14573156918161728, -0.01698525166228557, -0.15996887634705323, 0.13564385446863106, 0.2114010276272893, 0.1017947162528379, -0.21163156579356068, 0.050858420399331056, -0.01350444693189974, 0.1763150808289468, 0.1350413034983481, 0.052553853154397354, 0.15229083942428517, 0.1816688609900526, 0.1059871911823463, 0.15159461771523078, -0.046122762822331145, -0.12173499384124835, -0.24255495703031416, -0.14181556592498404, -0.15501736514628506, -0.004958659639389505, -0.13013681954264308, -0.11438060728295778, 0.30850349331292537, 0.151423046983277, 0.20839771629275325, 0.14831467414534508, 0.3596207099035382, 0.07765718457700971, 0.09549590032167124, 0.20642025282275148, 0.07120080118049653, 0.01809594403312076, 0.1542589076472303, -0.13834988896717101, 0.1804155118879862, -0.0022049070282194475] |
1,802.07505 | Influence of toroidal magnetic field in multi-accreting tori | We analyzed the effects of a toroidal magnetic field in the formation of
several magnetized accretion tori, dubbed as ringed accretion disks (RADs),
orbiting around one central Kerr supermassive Black Hole (SMBH) in AGNs, where
both corotating and counterotating disks are considered. Constraints on tori
formation and emergence of RADs instabilities, accretion onto the central
attractor and tori collision emergence, are investigated. The results of this
analysis show that the role of the central BH spin-mass ratio, the magnetic
field and the relative fluid rotation and tori rotation with respect the
central BH, are crucial elements in determining the accretion tori features,
providing ultimately evidence of a strict correlation between SMBH spin, fluid
rotation and magnetic fields in RADs formation and evolution. More specifically
we proved that magnetic field and disks rotation are in fact strongly
constrained, as tori formation and evolution in RADs depend on the toroidal
magnetic fields parameters. Eventually this analysis identifies specific
classes of tori, for restrict ranges of magnetic field parameter, that can be
observed around some specific SMBHs identified by their dimensionless spin.
| astro-ph.HE gr-qc | we analyzed the effects of a toroidal magnetic field in the formation of several magnetized accretion tori dubbed as ringed accretion disks rads orbiting around one central kerr supermassive black hole smbh in agns where both corotating and counterotating disks are considered constraints on tori formation and emergence of rads instabilities accretion onto the central attractor and tori collision emergence are investigated the results of this analysis show that the role of the central bh spinmass ratio the magnetic field and the relative fluid rotation and tori rotation with respect the central bh are crucial elements in determining the accretion tori features providing ultimately evidence of a strict correlation between smbh spin fluid rotation and magnetic fields in rads formation and evolution more specifically we proved that magnetic field and disks rotation are in fact strongly constrained as tori formation and evolution in rads depend on the toroidal magnetic fields parameters eventually this analysis identifies specific classes of tori for restrict ranges of magnetic field parameter that can be observed around some specific smbhs identified by their dimensionless spin | [['we', 'analyzed', 'the', 'effects', 'of', 'a', 'toroidal', 'magnetic', 'field', 'in', 'the', 'formation', 'of', 'several', 'magnetized', 'accretion', 'tori', 'dubbed', 'as', 'ringed', 'accretion', 'disks', 'rads', 'orbiting', 'around', 'one', 'central', 'kerr', 'supermassive', 'black', 'hole', 'smbh', 'in', 'agns', 'where', 'both', 'corotating', 'and', 'counterotating', 'disks', 'are', 'considered', 'constraints', 'on', 'tori', 'formation', 'and', 'emergence', 'of', 'rads', 'instabilities', 'accretion', 'onto', 'the', 'central', 'attractor', 'and', 'tori', 'collision', 'emergence', 'are', 'investigated', 'the', 'results', 'of', 'this', 'analysis', 'show', 'that', 'the', 'role', 'of', 'the', 'central', 'bh', 'spinmass', 'ratio', 'the', 'magnetic', 'field', 'and', 'the', 'relative', 'fluid', 'rotation', 'and', 'tori', 'rotation', 'with', 'respect', 'the', 'central', 'bh', 'are', 'crucial', 'elements', 'in', 'determining', 'the', 'accretion', 'tori', 'features', 'providing', 'ultimately', 'evidence', 'of', 'a', 'strict', 'correlation', 'between', 'smbh', 'spin', 'fluid', 'rotation', 'and', 'magnetic', 'fields', 'in', 'rads', 'formation', 'and', 'evolution', 'more', 'specifically', 'we', 'proved', 'that', 'magnetic', 'field', 'and', 'disks', 'rotation', 'are', 'in', 'fact', 'strongly', 'constrained', 'as', 'tori', 'formation', 'and', 'evolution', 'in', 'rads', 'depend', 'on', 'the', 'toroidal', 'magnetic', 'fields', 'parameters', 'eventually', 'this', 'analysis', 'identifies', 'specific', 'classes', 'of', 'tori', 'for', 'restrict', 'ranges', 'of', 'magnetic', 'field', 'parameter', 'that', 'can', 'be', 'observed', 'around', 'some', 'specific', 'smbhs', 'identified', 'by', 'their', 'dimensionless', 'spin']] | [-0.21074541349662468, 0.1542179320410438, -0.012533074043419086, 0.12311693571711985, -0.058321688462864986, -0.05050855052210731, -0.04870105520861349, 0.3519823962006341, -0.181068420611594, -0.32263924838586583, 0.11400820712658336, -0.213589442412505, -0.049906348325626064, 0.23883663534364674, -0.03142300742714969, -0.021872269502432828, -0.021648777539442388, -0.03620601876827187, -0.07552194534251572, -0.20586554260579137, 0.3703219947049373, 0.042768621780606135, 0.16573520870931613, -0.03450259076953954, 0.036328101805358955, -0.054301878729419197, -0.009965898291197386, 0.038084542902652174, -0.21947332392534172, 0.04390952711548196, 0.20300119441837136, 0.06295416679683277, 0.2056953865574317, -0.41694143412404516, -0.20174060722425832, 0.049341417760117336, 0.19916147945888257, 0.05991355044076617, -0.12050879419249223, -0.22544189361761208, 0.06157631852946589, -0.1789037037681359, -0.14044375509138773, -0.056468739357431616, 0.09646853112636573, 0.0578604967495573, -0.22043416035143146, 0.1287370418800758, 0.14940979761050083, 0.06924449938108747, -0.1582206363019303, 0.013713279587289925, -0.13766871161204292, 0.07839115385457956, 0.1312012404904523, 0.07012866467127597, 0.2864094160947153, -0.13815706253334295, -0.10037167196710113, 0.36678906735242084, -0.03311347327550894, -0.1374241830153244, 0.21632219931853705, -0.2978082747339909, -0.1430201117587642, 0.1450865145019266, 0.19687776609972704, 0.16707878064343265, -0.05837262294966769, 0.030004384962441608, -0.04121907018818317, 0.17431826003973655, 0.07609703514909404, 0.055169528745261306, 0.4323294228596843, 0.13117789251342668, 0.02267078474540724, 0.09534614143456238, -0.13192105460441095, -0.12707067958047885, -0.2246200897772744, -0.10056255732432762, -0.11514197698247546, 0.09598688312853279, -0.1620256534529545, -0.12716619545081106, 0.33039453109789096, 0.07638249703662685, 0.23158705451400177, -0.037161535741709, 0.24548223855371556, 0.0597475349178454, 0.06714955845382065, 0.16242129425256607, 0.3500591407020202, 0.24048432525315352, 0.07311243193323483, -0.2934408404279351, -0.007555312296543061, 0.05818718030991221] |
1,802.07506 | High Temperature Superconductivity: A Simple Model Exploiting Hydrogen
Bonds | Lately, there has been much interest in high temperature superconductors, and
more recently hydrogen-based superconductors. This work offers a simple model
which explains the behavior of the superconducting gap based on BCS theory, and
reproduces most effects seen in experiments, including the isotope effect and
T_c enhancement as a function of pressure. We show that this is due to a
combination of the factors appearing in the gap equation: the matrix element
between the proton states, and the level splitting of the proton.
| cond-mat.supr-con cond-mat.mes-hall | lately there has been much interest in high temperature superconductors and more recently hydrogenbased superconductors this work offers a simple model which explains the behavior of the superconducting gap based on bcs theory and reproduces most effects seen in experiments including the isotope effect and t_c enhancement as a function of pressure we show that this is due to a combination of the factors appearing in the gap equation the matrix element between the proton states and the level splitting of the proton | [['lately', 'there', 'has', 'been', 'much', 'interest', 'in', 'high', 'temperature', 'superconductors', 'and', 'more', 'recently', 'hydrogenbased', 'superconductors', 'this', 'work', 'offers', 'a', 'simple', 'model', 'which', 'explains', 'the', 'behavior', 'of', 'the', 'superconducting', 'gap', 'based', 'on', 'bcs', 'theory', 'and', 'reproduces', 'most', 'effects', 'seen', 'in', 'experiments', 'including', 'the', 'isotope', 'effect', 'and', 't_c', 'enhancement', 'as', 'a', 'function', 'of', 'pressure', 'we', 'show', 'that', 'this', 'is', 'due', 'to', 'a', 'combination', 'of', 'the', 'factors', 'appearing', 'in', 'the', 'gap', 'equation', 'the', 'matrix', 'element', 'between', 'the', 'proton', 'states', 'and', 'the', 'level', 'splitting', 'of', 'the', 'proton']] | [-0.10356915765091305, 0.150121058732922, -0.1068876159927213, 0.05517233012058963, -0.04118744528527001, -0.09410365665168782, 0.083330669164018, 0.3398952811328043, -0.21395945031874736, -0.29315463534320696, 0.008338827517792493, -0.31550596515277785, -0.14797431250461882, 0.18742200092367647, -0.004896753857540618, 0.04682874109130353, -0.018609707271792442, 0.02585226538624749, -0.12933407511550887, -0.18493125580688827, 0.3443083682725857, 0.07050571585612664, 0.3459722878837801, 0.1614427208964971, 0.08549589475235307, -0.04525715908798647, 0.06562920603676732, 0.03792641004435269, -0.09424756933608533, 0.09754998031484681, 0.2709130058682198, 0.019736419243917586, 0.24360292186225618, -0.41114459057192665, -0.2650092743331544, 0.06326185429401426, 0.1182074520978179, 0.1463118758801573, -0.10604780910102544, -0.2229755829166935, 0.051013254594192446, -0.1906035053936473, -0.10216050148459084, -0.06086899072257241, 0.031408649274563216, -0.031663798325953174, -0.24260568479637065, 0.08895388809705984, 0.0388870333119419, 0.0699221225881792, -0.0349447542706123, -0.18775597634354987, 0.0261259922611875, 0.05182470265686153, 0.10867616885021912, 0.047000071863119254, 0.09256241494138916, -0.15028238022161355, -0.06959294111479118, 0.3895337242543338, -0.07443277292088213, -0.10162318625812788, 0.1669905777510076, -0.163666411201997, -0.09496347757662277, 0.10170307234827294, 0.09941253812243063, 0.07890039477609546, -0.11881532304056258, 0.10528870223998933, -0.0440322689554957, 0.18290268890671882, 0.04466335716410484, 0.06949815740360014, 0.1893065002668335, 0.2401331637548395, 0.016212929892970854, 0.11551442127450402, -0.09662743812393262, -0.07164087926363011, -0.23784220583052432, -0.16245549784816174, -0.17568458661616568, 0.004408153859584267, -0.014900191955644279, -0.1722832145982882, 0.413696093271565, 0.14353395141212336, 0.2457165154572352, -0.055833432575160394, 0.24377836484506907, 0.16629210134536163, 0.1261820130710103, 0.05018368232658649, 0.26240375653156134, 0.17130976646341922, 0.11170680356963751, -0.2886740367197578, 0.10481672963486557, 0.03164287897721718] |
1,802.07507 | Electron-seeded ALP production and ALP decay in an oscillating
electromagnetic field | Certain models involving ALPs (axion-like-particles) allow for the coupling
of scalars and pseudoscalars to fermions. A derivation of the total rate for
production of massive scalars and pseudoscalars by an electron in a
monochromatic, circularly-polarised electromagnetic background is presented. In
addition, a derivation and the total rate for the decay of massive scalars and
pseudoscalars into electron-positron pairs in the same electromagnetic
background is given. We conclude by approximating the total yield of ALP
production for a typical laser-particle experimental scenario.
| hep-ph physics.optics physics.plasm-ph | certain models involving alps axionlikeparticles allow for the coupling of scalars and pseudoscalars to fermions a derivation of the total rate for production of massive scalars and pseudoscalars by an electron in a monochromatic circularlypolarised electromagnetic background is presented in addition a derivation and the total rate for the decay of massive scalars and pseudoscalars into electronpositron pairs in the same electromagnetic background is given we conclude by approximating the total yield of alp production for a typical laserparticle experimental scenario | [['certain', 'models', 'involving', 'alps', 'axionlikeparticles', 'allow', 'for', 'the', 'coupling', 'of', 'scalars', 'and', 'pseudoscalars', 'to', 'fermions', 'a', 'derivation', 'of', 'the', 'total', 'rate', 'for', 'production', 'of', 'massive', 'scalars', 'and', 'pseudoscalars', 'by', 'an', 'electron', 'in', 'a', 'monochromatic', 'circularlypolarised', 'electromagnetic', 'background', 'is', 'presented', 'in', 'addition', 'a', 'derivation', 'and', 'the', 'total', 'rate', 'for', 'the', 'decay', 'of', 'massive', 'scalars', 'and', 'pseudoscalars', 'into', 'electronpositron', 'pairs', 'in', 'the', 'same', 'electromagnetic', 'background', 'is', 'given', 'we', 'conclude', 'by', 'approximating', 'the', 'total', 'yield', 'of', 'alp', 'production', 'for', 'a', 'typical', 'laserparticle', 'experimental', 'scenario']] | [-0.14606736463575085, 0.2609952955959828, -0.006015452092088023, 0.1263498042014508, -0.04829479849402919, -0.10986309063931306, 0.024554821671228164, 0.2986872992305844, -0.12656965413717208, -0.2902814618277329, -0.02244887229796775, -0.31278357176501076, -0.0072299468698968855, 0.21246961449606366, 0.07744909181363052, 0.05604107566407801, 0.06488285740883445, 0.047851450784407834, 0.0006079889293530105, -0.23599614106394626, 0.3068245476698158, 0.06289435451689326, 0.1996119656243626, 0.07524201280816838, 0.11218129346768062, 0.040528354717901456, -0.05477794674138918, -0.08545770302966789, -0.07516199711388276, 0.11102560673046995, 0.14114688228971914, 0.15323671704894046, 0.1448100191069606, -0.4054438780395337, -0.18586598129736054, 0.14694242968143503, 0.1568637583059845, 0.08261116303181575, -0.11758047990776875, -0.28235358839141733, 0.086568071656389, -0.16635903874757113, -0.08262237668451336, 0.007895339493076374, -0.00016420459903684665, -0.024431336533140252, -0.3804430344406469, 0.08489154709824993, -0.014677443070176207, -0.04515514485423028, -0.07134166607679224, -0.12655492824283832, -0.018137240299472102, -0.013842244339347989, 0.13746418971223412, 0.008584977478294828, 0.13583414182411852, -0.21357677488323348, -0.12993422240869681, 0.39213552684695635, -0.13264092502333683, -0.19133077248540006, 0.16170927302704918, -0.1258010056939114, -0.09835236119451346, 0.16475540273937822, 0.2192636479359166, 0.1157340263016522, -0.18510539527338596, 0.11577458112546599, -0.03581309034546584, 0.13776318884719116, 0.0826636323199412, 0.10243303963431606, 0.2881955895802857, 0.14246975354574345, 0.010031878080127048, 0.11615718891959131, -0.043890659513388885, -0.018628160066810655, -0.3959035884450983, -0.22608400292602587, -0.06913043618386175, 0.0741693584225428, -0.08901221835935477, -0.10755668458080402, 0.3696079213908057, 0.08504428693817721, 0.21068683310331385, 0.01802248542231542, 0.2995658598518298, 0.13932061420730601, 0.06000764106894717, 0.04243436585364426, 0.33409211529062394, 0.16337833262083154, 0.07621013607691836, -0.2118288354580233, -0.05923979114856065, 0.058858865734051774] |
1,802.07508 | A Dual Tableau-based Decision Procedure for a Relational Logic with the
Universal Relation (Extended Version) | We present a first result towards the use of entailment in- side relational
dual tableau-based decision procedures. To this end, we introduce a fragment of
RL(1) which admits a restricted form of composition, (R ; S) or (R ; 1), where
the left subterm R of (R ; S) is only allowed to be either the constant 1, or a
Boolean term neither containing the complement operator nor the constant 1,
while in the case of (R ; 1), R can only be a Boolean term involving relational
variables and the operators of intersection and of union. We prove the
decidability of the fragment by defining a dual tableau- based decision
procedure with a suitable blocking mechanism and where the rules to decompose
compositional formulae are modified so to deal with the constant 1 while
preserving termination. The fragment properly includes the logics presented in
previous work and, therefore, it allows one to express, among others, the
multi-modal logic K with union and intersection of accessibility relations, and
the description logic ALC with union and intersection of roles.
| cs.LO | we present a first result towards the use of entailment in side relational dual tableaubased decision procedures to this end we introduce a fragment of rl1 which admits a restricted form of composition r s or r 1 where the left subterm r of r s is only allowed to be either the constant 1 or a boolean term neither containing the complement operator nor the constant 1 while in the case of r 1 r can only be a boolean term involving relational variables and the operators of intersection and of union we prove the decidability of the fragment by defining a dual tableau based decision procedure with a suitable blocking mechanism and where the rules to decompose compositional formulae are modified so to deal with the constant 1 while preserving termination the fragment properly includes the logics presented in previous work and therefore it allows one to express among others the multimodal logic k with union and intersection of accessibility relations and the description logic alc with union and intersection of roles | [['we', 'present', 'a', 'first', 'result', 'towards', 'the', 'use', 'of', 'entailment', 'in', 'side', 'relational', 'dual', 'tableaubased', 'decision', 'procedures', 'to', 'this', 'end', 'we', 'introduce', 'a', 'fragment', 'of', 'rl1', 'which', 'admits', 'a', 'restricted', 'form', 'of', 'composition', 'r', 's', 'or', 'r', '1', 'where', 'the', 'left', 'subterm', 'r', 'of', 'r', 's', 'is', 'only', 'allowed', 'to', 'be', 'either', 'the', 'constant', '1', 'or', 'a', 'boolean', 'term', 'neither', 'containing', 'the', 'complement', 'operator', 'nor', 'the', 'constant', '1', 'while', 'in', 'the', 'case', 'of', 'r', '1', 'r', 'can', 'only', 'be', 'a', 'boolean', 'term', 'involving', 'relational', 'variables', 'and', 'the', 'operators', 'of', 'intersection', 'and', 'of', 'union', 'we', 'prove', 'the', 'decidability', 'of', 'the', 'fragment', 'by', 'defining', 'a', 'dual', 'tableau', 'based', 'decision', 'procedure', 'with', 'a', 'suitable', 'blocking', 'mechanism', 'and', 'where', 'the', 'rules', 'to', 'decompose', 'compositional', 'formulae', 'are', 'modified', 'so', 'to', 'deal', 'with', 'the', 'constant', '1', 'while', 'preserving', 'termination', 'the', 'fragment', 'properly', 'includes', 'the', 'logics', 'presented', 'in', 'previous', 'work', 'and', 'therefore', 'it', 'allows', 'one', 'to', 'express', 'among', 'others', 'the', 'multimodal', 'logic', 'k', 'with', 'union', 'and', 'intersection', 'of', 'accessibility', 'relations', 'and', 'the', 'description', 'logic', 'alc', 'with', 'union', 'and', 'intersection', 'of', 'roles']] | [-0.1167708808106595, 0.06429593972334051, -0.055366042444760774, 0.05139663538242551, -0.1136021473566766, -0.1876511890360893, 0.08804674757692706, 0.3362627020748011, -0.3203323785451123, -0.24680576055985073, 0.11593562725934083, -0.2613443499498756, -0.05681141932901723, 0.10654559916677489, -0.07521688691892565, 0.012807980024566254, 0.02406356049482122, 0.09294516193926677, -0.04481832707573756, -0.23136824671441325, 0.3369210725436094, -0.01593911948067875, 0.17857552350491376, 0.038008229183461306, 0.08730327644674428, 0.05987901093395448, -0.039360814564593734, 0.07607044802909053, -0.12149164972334416, 0.15056111164198355, 0.2718863195456008, 0.2150360404382642, 0.27471995161011303, -0.4095009930817218, -0.12249816098817806, 0.11357541206217873, 0.1126853988757464, 0.02452777814123065, 0.03984431050391333, -0.23182339555364445, 0.09835433883956451, -0.18609684584100314, -0.07795126977291, -0.06435915637472324, 0.07865029812961731, 0.02913131350156284, -0.2904956562835295, -0.008768103432195293, 0.17708009002655317, 0.06903562615572036, -0.028499169132321665, -0.1168398771942834, -0.020303729900169647, 0.07789665057281053, -0.01182503465579116, 0.04993872403504391, 0.06819405560060565, -0.08208137500265764, -0.11972497296840723, 0.37036101402308064, -0.04126363551115681, -0.2183445898559073, 0.15512253311944418, -0.1340759807191361, -0.1602452763077942, 0.06987004247547567, 0.07784412322490979, 0.1529839457836987, -0.11046319495586829, 0.16199514991369623, -0.04544339386810516, 0.1868511312025674, 0.11350819931750925, 0.030345063260488813, 0.1790230048264393, 0.13644855044214804, 0.062205985713022195, 0.16586082541496203, -0.0021340479035915315, -0.07363501158221786, -0.3318278988202413, -0.15837598673132217, -0.10664439028471537, 0.004640269906366453, -0.08865086938163878, -0.19288229361583276, 0.35740567613245877, 0.11039370082147505, 0.20048062834669916, 0.1286635673461059, 0.27210223304921355, 0.09779643105482147, 0.11121595298855341, 0.07303656885753675, 0.13316052763096603, 0.1326032215207494, 0.0546043944258568, -0.16035038940126783, 0.0832034267549371, 0.12053109022925693] |
1,802.07509 | Quantum Optimal Control in a Chopped Basis: Applications in Control of
Bose-Einstein Condensates | We discuss quantum optimal control of Bose-Einstein condensates trapped in
magnetic microtraps. The objective is to transfer a condensate from the ground
state to the first-excited state. This type of control problem is typically
solved using derivative-based methods in a high-dimensional control space such
as gradient-ascent pulse engineering (GRAPE) and Krotov's method or
derivative-free methods in a reduced control space such as Nelder-Mead with a
chopped random basis (CRAB). We discuss how these methods can be combined in
gradient optimization using parametrization (GROUP) including the finite
bandwidth of the control electronics. We compare these methods and find that
GROUP converges much faster than Nelder-Mead with CRAB and achieves better
results than GRAPE and Krotov's method on the control problem presented here.
| quant-ph | we discuss quantum optimal control of boseeinstein condensates trapped in magnetic microtraps the objective is to transfer a condensate from the ground state to the firstexcited state this type of control problem is typically solved using derivativebased methods in a highdimensional control space such as gradientascent pulse engineering grape and krotovs method or derivativefree methods in a reduced control space such as neldermead with a chopped random basis crab we discuss how these methods can be combined in gradient optimization using parametrization group including the finite bandwidth of the control electronics we compare these methods and find that group converges much faster than neldermead with crab and achieves better results than grape and krotovs method on the control problem presented here | [['we', 'discuss', 'quantum', 'optimal', 'control', 'of', 'boseeinstein', 'condensates', 'trapped', 'in', 'magnetic', 'microtraps', 'the', 'objective', 'is', 'to', 'transfer', 'a', 'condensate', 'from', 'the', 'ground', 'state', 'to', 'the', 'firstexcited', 'state', 'this', 'type', 'of', 'control', 'problem', 'is', 'typically', 'solved', 'using', 'derivativebased', 'methods', 'in', 'a', 'highdimensional', 'control', 'space', 'such', 'as', 'gradientascent', 'pulse', 'engineering', 'grape', 'and', 'krotovs', 'method', 'or', 'derivativefree', 'methods', 'in', 'a', 'reduced', 'control', 'space', 'such', 'as', 'neldermead', 'with', 'a', 'chopped', 'random', 'basis', 'crab', 'we', 'discuss', 'how', 'these', 'methods', 'can', 'be', 'combined', 'in', 'gradient', 'optimization', 'using', 'parametrization', 'group', 'including', 'the', 'finite', 'bandwidth', 'of', 'the', 'control', 'electronics', 'we', 'compare', 'these', 'methods', 'and', 'find', 'that', 'group', 'converges', 'much', 'faster', 'than', 'neldermead', 'with', 'crab', 'and', 'achieves', 'better', 'results', 'than', 'grape', 'and', 'krotovs', 'method', 'on', 'the', 'control', 'problem', 'presented', 'here']] | [-0.05903467947948139, 0.08424616609276696, -0.08833516444549087, 0.06304738571778833, -0.05937810163667872, -0.16445294271939057, 0.03789062356029845, 0.4566895451612216, -0.28099664817910547, -0.31062721353686173, 0.12983565883757162, -0.22135523729187953, -0.11777289389163133, 0.2695709187941518, -0.07573459601156753, 0.10959606345219552, 0.07589088321070779, -0.02416224886994224, -0.12829351033976932, -0.2309672580502758, 0.24715268132392287, 0.002153358648315626, 0.2960604986999461, -0.034686613385373155, 0.1377354080332751, 0.0033298576758666472, 0.05335428719293357, -3.567341116664946e-05, -0.0936874213173513, 0.14189602843339533, 0.254848272555069, 0.12972315862266856, 0.30757248642554214, -0.42372001335024834, -0.21659440621117915, 0.10683111070216564, 0.18036319431656403, 0.152019408531487, -0.04183119522457681, -0.2775187126576346, 0.04107527565913398, -0.17509455184167452, -0.10871873615109477, -0.1364470382167165, -0.07170106896029954, 0.057467928112961725, -0.2767394973747557, 0.041422318701809346, -0.01010483968233274, 0.04831298193624936, -0.08927501083836575, -0.1371676016922209, 0.041147502780938136, 0.03909890730249549, -0.02683326486144061, 0.08274529694217789, 0.1551482442983865, -0.11618948661460549, -0.17253394929830693, 0.37849926370511616, -0.07220931691122395, -0.20438528125566885, 0.14629824212843684, -0.06751730758696795, -0.08453262045840956, 0.11666733540656153, 0.20962018465954224, 0.16469134470786562, -0.10555576112829457, 0.045089248184899774, -0.012442711696475128, 0.2003173212143631, 0.03429145890111027, 0.020277159700308703, 0.09276690064113556, 0.21517193820019645, 0.15879191803815199, 0.16131279711546145, -0.08293243219560274, -0.12870966351190813, -0.23029887975262833, -0.13198179289821751, -0.18941673871191325, 0.027477210976398925, -0.05538061972320742, -0.13399264460029311, 0.40143319892827883, 0.16905987826137503, 0.1275170962826526, 0.014220834817460254, 0.33309872140569136, 0.1472684410246751, 0.03822716123863193, 0.09664667067060262, 0.22786121543743149, 0.11204940792219328, 0.07311545183914829, -0.27905220087148125, 0.014801632701457778, 0.07382428325127718] |
1,802.0751 | Spectrally approximating large graphs with smaller graphs | How does coarsening affect the spectrum of a general graph? We provide
conditions such that the principal eigenvalues and eigenspaces of a coarsened
and original graph Laplacian matrices are close. The achieved approximation is
shown to depend on standard graph-theoretic properties, such as the degree and
eigenvalue distributions, as well as on the ratio between the coarsened and
actual graph sizes. Our results carry implications for learning methods that
utilize coarsening. For the particular case of spectral clustering, they imply
that coarse eigenvectors can be used to derive good quality assignments even
without refinement---this phenomenon was previously observed, but lacked formal
justification.
| cs.LG cs.DS stat.ML | how does coarsening affect the spectrum of a general graph we provide conditions such that the principal eigenvalues and eigenspaces of a coarsened and original graph laplacian matrices are close the achieved approximation is shown to depend on standard graphtheoretic properties such as the degree and eigenvalue distributions as well as on the ratio between the coarsened and actual graph sizes our results carry implications for learning methods that utilize coarsening for the particular case of spectral clustering they imply that coarse eigenvectors can be used to derive good quality assignments even without refinementthis phenomenon was previously observed but lacked formal justification | [['how', 'does', 'coarsening', 'affect', 'the', 'spectrum', 'of', 'a', 'general', 'graph', 'we', 'provide', 'conditions', 'such', 'that', 'the', 'principal', 'eigenvalues', 'and', 'eigenspaces', 'of', 'a', 'coarsened', 'and', 'original', 'graph', 'laplacian', 'matrices', 'are', 'close', 'the', 'achieved', 'approximation', 'is', 'shown', 'to', 'depend', 'on', 'standard', 'graphtheoretic', 'properties', 'such', 'as', 'the', 'degree', 'and', 'eigenvalue', 'distributions', 'as', 'well', 'as', 'on', 'the', 'ratio', 'between', 'the', 'coarsened', 'and', 'actual', 'graph', 'sizes', 'our', 'results', 'carry', 'implications', 'for', 'learning', 'methods', 'that', 'utilize', 'coarsening', 'for', 'the', 'particular', 'case', 'of', 'spectral', 'clustering', 'they', 'imply', 'that', 'coarse', 'eigenvectors', 'can', 'be', 'used', 'to', 'derive', 'good', 'quality', 'assignments', 'even', 'without', 'refinementthis', 'phenomenon', 'was', 'previously', 'observed', 'but', 'lacked', 'formal', 'justification']] | [-0.05176830754297242, 0.04483161574819743, -0.11970655259556405, 0.11181728811681012, -0.10889381655067722, -0.11678689454525414, 0.014984949823874648, 0.409107438260966, -0.2518606676632483, -0.3324490786013701, 0.118561510081947, -0.23098265921862998, -0.18103605877183895, 0.1549581852165226, -0.08109247919614657, 0.08044660866887558, 0.12557129066271505, 0.06924078624383177, -0.07317772452917762, -0.214255734293498, 0.30731897819602844, 0.07974780422299962, 0.2966351204408831, 0.07273881854766076, 0.06312860758735402, -0.0070368134817753985, -0.006142030668325058, 0.050997092220286776, -0.1294173820941717, 0.08419962504436032, 0.25545133252877117, 0.14634713323989718, 0.21944310305418796, -0.4250231177020486, -0.20635778875099403, 0.1534389065726116, 0.17425496092914503, 0.07855673154613169, -0.003744386498456692, -0.2381807482031423, 0.12415950487155726, -0.11202218767044038, -0.10724476695355803, -0.1299127948627171, -0.016052620674455814, 0.047770385261588166, -0.28640889270821274, 0.08807021633970856, 0.10434363862743952, 0.04943442681232597, -0.014000649091391133, -0.18282015532103027, -0.03398565049997835, 0.17738472876406394, 0.0006973101079722147, -0.047789604924065934, 0.11201862246259162, -0.08028024055137492, -0.12433882557215298, 0.39412331287887425, -0.01691093669724789, -0.23321140177664923, 0.18962087552293694, -0.09963770426514715, -0.15367566175887934, 0.07124097181926711, 0.13667973249431442, 0.09815137147313298, -0.05504461158398945, 0.0678821620738853, -0.059018853092842764, 0.1845456524337135, 0.08284695826858135, 0.06150844095028144, 0.13835556116785006, 0.12145442962773273, 0.09863384302341296, 0.10775444514376323, -0.030634534545242786, -0.0901169341085202, -0.26717554140688465, -0.11355848593342274, -0.25947980510674895, 0.05559814631210474, -0.16673120340772693, -0.20337945604230057, 0.40696757472129447, 0.1426281784223116, 0.2497149791826706, 0.08780474293894033, 0.2457239809584352, 0.13664895650414327, 0.042167047045013804, 0.08908397082405367, 0.22916818924690827, 0.1528908191525405, 0.0688989179964998, -0.18449597887344438, 0.1216381564897734, 0.10347045928534895] |
1,802.07511 | Spin-fluctuations drive the inverse magnetocaloric effect in Mn5Si3 | Inelastic neutron scattering measurements were performed on single crystals
of the antiferromagnetic compound Mn5Si3 in order to investigate the relation
between the spin dynamics and the magneto-thermodynamic properties. It is shown
that among the two stable antiferromagnetic phases of this compound, the high
temperature one has an unusual magnetic excitation spectrum where propagative
spin-waves and diffuse spin-fluctuations coexist. Moreover, it is evidenced
that the inverse magnetocaloric effect of Mn5Si3, the cooling by adiabatic
magnetization, is associated with field induced spin-fluctuations.
| cond-mat.mtrl-sci | inelastic neutron scattering measurements were performed on single crystals of the antiferromagnetic compound mn5si3 in order to investigate the relation between the spin dynamics and the magnetothermodynamic properties it is shown that among the two stable antiferromagnetic phases of this compound the high temperature one has an unusual magnetic excitation spectrum where propagative spinwaves and diffuse spinfluctuations coexist moreover it is evidenced that the inverse magnetocaloric effect of mn5si3 the cooling by adiabatic magnetization is associated with field induced spinfluctuations | [['inelastic', 'neutron', 'scattering', 'measurements', 'were', 'performed', 'on', 'single', 'crystals', 'of', 'the', 'antiferromagnetic', 'compound', 'mn5si3', 'in', 'order', 'to', 'investigate', 'the', 'relation', 'between', 'the', 'spin', 'dynamics', 'and', 'the', 'magnetothermodynamic', 'properties', 'it', 'is', 'shown', 'that', 'among', 'the', 'two', 'stable', 'antiferromagnetic', 'phases', 'of', 'this', 'compound', 'the', 'high', 'temperature', 'one', 'has', 'an', 'unusual', 'magnetic', 'excitation', 'spectrum', 'where', 'propagative', 'spinwaves', 'and', 'diffuse', 'spinfluctuations', 'coexist', 'moreover', 'it', 'is', 'evidenced', 'that', 'the', 'inverse', 'magnetocaloric', 'effect', 'of', 'mn5si3', 'the', 'cooling', 'by', 'adiabatic', 'magnetization', 'is', 'associated', 'with', 'field', 'induced', 'spinfluctuations']] | [-0.19246294336480788, 0.2702768072793333, -0.05434719109616708, 0.03990745409682859, -0.07036514727515168, -0.09156893744366243, 0.04336155813653022, 0.4148298113141209, -0.2988361921161413, -0.25243612891063094, 0.010916487690701615, -0.3510375008219853, -0.09724121645558625, 0.19076893765595743, 0.13648454360663892, -0.012077065091580153, -0.059418226964771746, 0.037613413424696776, -0.06234353319159709, -0.1896978380755172, 0.30989792388572823, 0.05773188829771243, 0.31304309056140484, 0.06748874973272904, 0.06868371402379125, 0.0017867027199827135, 0.12315956817474216, -0.007167638326063752, -0.13593832389542512, -0.00018619040492922067, 0.24940536194480956, -0.12628762509557417, 0.12359493121039122, -0.409696978260763, -0.22754228666890414, 0.05034015979326796, 0.1289037596201524, 0.08863309655571357, -0.06667201463860692, -0.26614855555817485, 0.04540884260786697, -0.12874512991402298, -0.11351854688982713, -0.12064013019553385, -0.030202041687152813, -0.01973064293852076, -0.23563877801352645, 0.1292496936628595, 0.12755272262729705, 0.09295146847434807, -0.1211450862174388, -0.08032518677646294, -0.06564760939800181, 0.039201727870386095, 0.09953848119766917, 0.038296462036669254, 0.13701736703515052, -0.10199575796432328, -0.12364327851682902, 0.3294731040252373, -0.03010692038369598, -0.03337418534210883, 0.15416744955582545, -0.22129902696779027, -0.09357638806832255, 0.2163217188732233, 0.06674859597114846, 0.10080601610825397, -0.15904993820004165, 0.06134081518248422, -0.0007333796820603311, 0.1711363408190664, 0.04549707000842318, 0.07343030943156918, 0.2338666131021455, 0.2008434735238552, -0.009856985736405477, 0.18080564260017126, -0.15898590609795066, -0.07180014226469211, -0.16981934555224143, -0.14534269490104634, -0.21288681784644722, 0.056926743281655943, -0.06569809970642382, -0.16207867957527924, 0.33677430981770157, 0.14299061538622482, 0.15262860259972513, -0.1173495079157874, 0.26658566971309483, 0.1312238178201369, 0.04521317120234016, 0.03876527125830762, 0.2854785834788345, 0.2544673515541945, 0.11610175634850747, -0.38793106022640134, 0.10705561514478176, -0.02783982453402132] |
1,802.07512 | Density Weighted Connectivity of Grass Pixels in Image Frames for
Biomass Estimation | Accurate estimation of the biomass of roadside grasses plays a significant
role in applications such as fire-prone region identification. Current
solutions heavily depend on field surveys, remote sensing measurements and
image processing using reference markers, which often demand big investments of
time, effort and cost. This paper proposes Density Weighted Connectivity of
Grass Pixels (DWCGP) to automatically estimate grass biomass from roadside
image data. The DWCGP calculates the length of continuously connected grass
pixels along a vertical orientation in each image column, and then weights the
length by the grass density in a surrounding region of the column. Grass pixels
are classified using feedforward artificial neural networks and the dominant
texture orientation at every pixel is computed using multi-orientation Gabor
wavelet filter vote. Evaluations on a field survey dataset show that the DWCGP
reduces Root-Mean-Square Error from 5.84 to 5.52 by additionally considering
grass density on top of grass height. The DWCGP shows robustness to
non-vertical grass stems and to changes of both Gabor filter parameters and
surrounding region widths. It also has performance close to human observation
and higher than eight baseline approaches, as well as promising results for
classifying low vs. high fire risk and identifying fire-prone road regions.
| cs.CV cs.AI | accurate estimation of the biomass of roadside grasses plays a significant role in applications such as fireprone region identification current solutions heavily depend on field surveys remote sensing measurements and image processing using reference markers which often demand big investments of time effort and cost this paper proposes density weighted connectivity of grass pixels dwcgp to automatically estimate grass biomass from roadside image data the dwcgp calculates the length of continuously connected grass pixels along a vertical orientation in each image column and then weights the length by the grass density in a surrounding region of the column grass pixels are classified using feedforward artificial neural networks and the dominant texture orientation at every pixel is computed using multiorientation gabor wavelet filter vote evaluations on a field survey dataset show that the dwcgp reduces rootmeansquare error from 584 to 552 by additionally considering grass density on top of grass height the dwcgp shows robustness to nonvertical grass stems and to changes of both gabor filter parameters and surrounding region widths it also has performance close to human observation and higher than eight baseline approaches as well as promising results for classifying low vs high fire risk and identifying fireprone road regions | [['accurate', 'estimation', 'of', 'the', 'biomass', 'of', 'roadside', 'grasses', 'plays', 'a', 'significant', 'role', 'in', 'applications', 'such', 'as', 'fireprone', 'region', 'identification', 'current', 'solutions', 'heavily', 'depend', 'on', 'field', 'surveys', 'remote', 'sensing', 'measurements', 'and', 'image', 'processing', 'using', 'reference', 'markers', 'which', 'often', 'demand', 'big', 'investments', 'of', 'time', 'effort', 'and', 'cost', 'this', 'paper', 'proposes', 'density', 'weighted', 'connectivity', 'of', 'grass', 'pixels', 'dwcgp', 'to', 'automatically', 'estimate', 'grass', 'biomass', 'from', 'roadside', 'image', 'data', 'the', 'dwcgp', 'calculates', 'the', 'length', 'of', 'continuously', 'connected', 'grass', 'pixels', 'along', 'a', 'vertical', 'orientation', 'in', 'each', 'image', 'column', 'and', 'then', 'weights', 'the', 'length', 'by', 'the', 'grass', 'density', 'in', 'a', 'surrounding', 'region', 'of', 'the', 'column', 'grass', 'pixels', 'are', 'classified', 'using', 'feedforward', 'artificial', 'neural', 'networks', 'and', 'the', 'dominant', 'texture', 'orientation', 'at', 'every', 'pixel', 'is', 'computed', 'using', 'multiorientation', 'gabor', 'wavelet', 'filter', 'vote', 'evaluations', 'on', 'a', 'field', 'survey', 'dataset', 'show', 'that', 'the', 'dwcgp', 'reduces', 'rootmeansquare', 'error', 'from', '584', 'to', '552', 'by', 'additionally', 'considering', 'grass', 'density', 'on', 'top', 'of', 'grass', 'height', 'the', 'dwcgp', 'shows', 'robustness', 'to', 'nonvertical', 'grass', 'stems', 'and', 'to', 'changes', 'of', 'both', 'gabor', 'filter', 'parameters', 'and', 'surrounding', 'region', 'widths', 'it', 'also', 'has', 'performance', 'close', 'to', 'human', 'observation', 'and', 'higher', 'than', 'eight', 'baseline', 'approaches', 'as', 'well', 'as', 'promising', 'results', 'for', 'classifying', 'low', 'vs', 'high', 'fire', 'risk', 'and', 'identifying', 'fireprone', 'road', 'regions']] | [-0.056470768971876036, 0.05505331050122703, -0.0036924232228367185, 0.03999948453659711, -0.03637761458179992, -0.11544931711239824, 0.05826790124092214, 0.428007210984789, -0.2344058119655782, -0.3264883828085305, 0.1298663276160803, -0.3135190038334819, -0.12940417425110426, 0.16752122085198612, -0.13952101104176343, 0.05869150295997252, 0.07505673152540546, 0.024310516235210113, -0.02184518726266902, -0.20521737716684293, 0.23004005881374728, 0.10023012291176699, 0.33575994867034514, 0.015643049124164962, 0.13453879805760452, -0.003861441183140251, -0.09138551309579677, 0.01411099678543408, -0.08650985654271631, 0.12467992428516586, 0.2863399647187849, 0.14376556861448328, 0.27532014576254865, -0.4123492762276993, -0.20828248061869867, 0.07944096112392139, 0.12594780938431102, 0.03527298689859257, -0.023101861778048995, -0.32163023680856273, 0.08260061540664058, -0.12923995814105468, -0.04619342624789002, -0.02158395528784068, 0.032685238357160744, 0.041619270768037425, -0.2709656275104527, 0.08193575812660653, -0.012122414250547109, 0.09208178974627819, -0.0624676840414585, -0.15170864543798773, -0.08713280699396533, 0.19250081778869996, 0.0010755970386037632, 0.07385796436168883, 0.23631023947324428, -0.19224824818819575, -0.035526052223916964, 0.3299080301110925, -0.0713933117967012, -0.16823228161124076, 0.16132471825816294, -0.08545935234076353, -0.10657949149909786, 0.15692167862524645, 0.2144091447568568, 0.04894491297132637, -0.12203285287583794, -0.010738779383969832, -0.038478102763785764, 0.2008875152130903, 0.11989961144866523, -0.0033058346022124315, 0.22157056072601744, 0.19708888908727698, 0.11020068771991212, 0.10297285771548785, -0.2334621930390652, -0.041884123476277756, -0.20798091249904174, -0.1157100530527619, -0.17306980728264434, -0.038216648199387006, -0.13552841871677995, -0.1800353084992043, 0.40037263641643583, 0.17658131652794296, 0.2128588063005284, 0.06174235039017631, 0.3447255500863348, 0.034938902942815896, 0.1222069621299259, 0.07089731654393214, 0.14392096534445512, 0.07759078482249335, 0.09913850560916393, -0.16456234664308714, 0.11656821949004348, 0.078202857926664] |
1,802.07513 | Adversarial classification: An adversarial risk analysis approach | Classification problems in security settings are usually contemplated as
confrontations in which one or more adversaries try to fool a classifier to
obtain a benefit. Most approaches to such adversarial classification problems
have focused on game theoretical ideas with strong underlying common knowledge
assumptions, which are actually not realistic in security domains. We provide
an alternative framework to such problem based on adversarial risk analysis,
which we illustrate with several examples. Computational and implementation
issues are discussed.
| stat.ML cs.GT cs.LG | classification problems in security settings are usually contemplated as confrontations in which one or more adversaries try to fool a classifier to obtain a benefit most approaches to such adversarial classification problems have focused on game theoretical ideas with strong underlying common knowledge assumptions which are actually not realistic in security domains we provide an alternative framework to such problem based on adversarial risk analysis which we illustrate with several examples computational and implementation issues are discussed | [['classification', 'problems', 'in', 'security', 'settings', 'are', 'usually', 'contemplated', 'as', 'confrontations', 'in', 'which', 'one', 'or', 'more', 'adversaries', 'try', 'to', 'fool', 'a', 'classifier', 'to', 'obtain', 'a', 'benefit', 'most', 'approaches', 'to', 'such', 'adversarial', 'classification', 'problems', 'have', 'focused', 'on', 'game', 'theoretical', 'ideas', 'with', 'strong', 'underlying', 'common', 'knowledge', 'assumptions', 'which', 'are', 'actually', 'not', 'realistic', 'in', 'security', 'domains', 'we', 'provide', 'an', 'alternative', 'framework', 'to', 'such', 'problem', 'based', 'on', 'adversarial', 'risk', 'analysis', 'which', 'we', 'illustrate', 'with', 'several', 'examples', 'computational', 'and', 'implementation', 'issues', 'are', 'discussed']] | [-0.03020396622883567, -0.05861648807567454, -0.0663345664521897, 0.14905447085908094, -0.14535153115337546, -0.25256055326188925, 0.027515358497183045, 0.4301714338846021, -0.24615179221962227, -0.3388580517577274, 0.16295470377315416, -0.2827704125870164, -0.20043533328352134, 0.24429182779378797, -0.20115771808649424, 0.09786018728756334, 0.05399739846750465, 0.03729731233090513, -0.023556578819724647, -0.33481490074705283, 0.35644188212750894, -0.001541111134476476, 0.29599112929026417, 0.05716289819351265, 0.028196410046188863, -0.05968932271632668, 0.007883696363295441, 0.025604183168767336, -0.10558461326222818, 0.14226524426462733, 0.35892604330143374, 0.22074541610411622, 0.4030836965743597, -0.4635404564149968, -0.2548697098678389, 0.10425379503119205, 0.10216253971100434, 0.145286297662994, -0.07735829574283509, -0.31746634802260953, 0.08953475110934346, -0.1738264982576494, -0.04429783638228069, -0.15912137475082433, -0.07724449830129743, 0.005864436278579297, -0.28512480543539315, -0.039258714813690684, 0.08914351974335777, 0.081861713514119, -0.003308786563091464, -0.12773512822708913, 0.061352989858609035, 0.10453563455383402, 0.10635640231481233, -0.01315322279243718, 0.14014076009126647, -0.1524868638242607, -0.22243274686640346, 0.3598037136283207, 0.029698705881253465, -0.26846990376928603, 0.24842519891545078, 0.015250618448601915, -0.20293207039040598, 0.057747184722260994, 0.24014210168804442, 0.10759874917687727, -0.16410199210483145, 0.005401659695667444, -0.020296865336403444, 0.16265217642989252, 0.030921001767425182, 0.07338246161892235, 0.12992262397590396, 0.21273929207259185, 0.08801740180253499, 0.11576681598029159, -0.011099769830606974, -0.1309694134412551, -0.2627289860763333, -0.041415528926466195, -0.14354660199023783, 0.015130523669528896, -0.047901952741841496, -0.1660154883132933, 0.341434594443334, 0.23628323595341924, 0.18147296927290646, 0.04462409969389003, 0.3761745889175248, 0.015594806263598238, 0.040615119043036135, 0.10737243592255301, 0.22162824763021396, 0.04392219913591232, 0.07491790056954344, -0.07236892413106058, 0.10903849579430148, 0.014085156586045375] |
1,802.07514 | On some properties of the functors ${\mathcal F}^G_P$ from Lie algebra
to locally analytic representations | For a split reductive group $G$ over a finite extension $L$ of ${\mathbb
Q}_p$, and a parabolic subgroup $P \subset G$ we examine functorial properties
of the functors ${\mathcal F}^G_P$ introduced in \cite{OS2}. We discuss the
aspects of faithfulness, projective and injective objects, Ext-groups and some
kind of adjunction formulas.
| math.RT math.NT | for a split reductive group g over a finite extension l of mathbb q_p and a parabolic subgroup p subset g we examine functorial properties of the functors mathcal fg_p introduced in citeos2 we discuss the aspects of faithfulness projective and injective objects extgroups and some kind of adjunction formulas | [['for', 'a', 'split', 'reductive', 'group', 'g', 'over', 'a', 'finite', 'extension', 'l', 'of', 'mathbb', 'q_p', 'and', 'a', 'parabolic', 'subgroup', 'p', 'subset', 'g', 'we', 'examine', 'functorial', 'properties', 'of', 'the', 'functors', 'mathcal', 'fg_p', 'introduced', 'in', 'citeos2', 'we', 'discuss', 'the', 'aspects', 'of', 'faithfulness', 'projective', 'and', 'injective', 'objects', 'extgroups', 'and', 'some', 'kind', 'of', 'adjunction', 'formulas']] | [-0.26066664130970213, 0.0004940873089556893, -0.09011240416051199, 0.07919752704522882, -0.1727718459442258, -0.12310110018006526, 0.023401318700052798, 0.37556659903687734, -0.4011277415168782, -0.1688616060807059, 0.030884431430119246, -0.1892294148262105, -0.07854585859846945, 0.1850475438598854, -0.2155857631814797, -0.06354162106678511, 0.022272568947907228, 0.13117842125939205, -0.11980439165684705, -0.2509604267543182, 0.407910718737791, -0.1305197918942819, 0.18727531741994122, 0.00594771277004232, 0.1159383852694494, 0.0360180238300624, -0.03757753233245845, -0.028903848549816757, -0.2055554891412612, 0.08344739772534619, 0.3810035232260513, 0.056048904972461365, 0.23824420656698445, -0.35261727813243243, -0.11922553656525754, 0.2975784431716117, 0.11758244530453037, -0.08527732593938708, -0.0072139128218016895, -0.32618138535569113, 0.12493754200356004, -0.2302079825506856, -0.1559152939977745, -0.049061696510761976, 0.17319513220960894, -0.010162657243199646, -0.24058042596637583, -0.06631908878140773, 0.15366883824268976, 0.1993275827165538, -0.03177352293763155, -0.10316901087450485, -0.08918639889452606, 0.002145398340265577, -0.07243782025761902, 0.01638857339276001, 0.11970578489126638, -0.053877796715823933, -0.09669821183585252, 0.41157070516298216, -0.11504707573719013, -0.20249778715515276, 0.0892530344814683, -0.18573557760100812, -0.17874895323378345, 0.07496490751509555, 0.04195727050925294, 0.21819241651489088, 0.05632222746498883, 0.2922360573005183, -0.1979381605051458, 0.008052837372815702, 0.07842094451189041, 0.047763163301472865, 0.07543483306653798, 0.055215522702686336, 0.030085495857444283, 0.16044957113141814, 0.05053766933269799, 0.0934582549186113, -0.4436657230835408, -0.18859951077805212, -0.01904867907675604, 0.15151802473701537, -0.11382421666742933, -0.12466588259364168, 0.4208749483999175, 0.08014860361193617, 0.1603017375455238, 0.16237936900385344, 0.17140352732288497, -0.018603595439344645, 0.05040629310921455, 0.03634729463071077, 0.016815679374000563, 0.35462995851412416, -0.14709738412784645, -0.1538124707682679, -0.07399862017094468, 0.2796639213435507] |
1,802.07515 | A framework for cost-constrained genome rearrangement under Double Cut
and Join | The study of genome rearrangement has many flavours, but they all are somehow
tied to edit distances on variations of a multi-graph called the breakpoint
graph. We study a weighted 2-break distance on Eulerian 2-edge-colored
multi-graphs, which generalizes weighted versions of several Double Cut and
Join problems, including those on genomes with unequal gene content. We affirm
the connection between cycle decompositions and edit scenarios first discovered
with the Sorting By Reversals problem. Using this we show that the problem of
finding a parsimonious scenario of minimum cost on an Eulerian 2-edge-colored
multi-graph - with a general cost function for 2-breaks - can be solved by
decomposing the problem into independent instances on simple alternating
cycles. For breakpoint graphs, and a more constrained cost function, based on
coloring the vertices, we give a polynomial-time algorithm for finding a
parsimonious 2-break scenario of minimum cost, while showing that finding a
non-parsimonious 2-break scenario of minimum cost is NP-Hard.
| cs.DS cs.DM math.CO q-bio.GN | the study of genome rearrangement has many flavours but they all are somehow tied to edit distances on variations of a multigraph called the breakpoint graph we study a weighted 2break distance on eulerian 2edgecolored multigraphs which generalizes weighted versions of several double cut and join problems including those on genomes with unequal gene content we affirm the connection between cycle decompositions and edit scenarios first discovered with the sorting by reversals problem using this we show that the problem of finding a parsimonious scenario of minimum cost on an eulerian 2edgecolored multigraph with a general cost function for 2breaks can be solved by decomposing the problem into independent instances on simple alternating cycles for breakpoint graphs and a more constrained cost function based on coloring the vertices we give a polynomialtime algorithm for finding a parsimonious 2break scenario of minimum cost while showing that finding a nonparsimonious 2break scenario of minimum cost is nphard | [['the', 'study', 'of', 'genome', 'rearrangement', 'has', 'many', 'flavours', 'but', 'they', 'all', 'are', 'somehow', 'tied', 'to', 'edit', 'distances', 'on', 'variations', 'of', 'a', 'multigraph', 'called', 'the', 'breakpoint', 'graph', 'we', 'study', 'a', 'weighted', '2break', 'distance', 'on', 'eulerian', '2edgecolored', 'multigraphs', 'which', 'generalizes', 'weighted', 'versions', 'of', 'several', 'double', 'cut', 'and', 'join', 'problems', 'including', 'those', 'on', 'genomes', 'with', 'unequal', 'gene', 'content', 'we', 'affirm', 'the', 'connection', 'between', 'cycle', 'decompositions', 'and', 'edit', 'scenarios', 'first', 'discovered', 'with', 'the', 'sorting', 'by', 'reversals', 'problem', 'using', 'this', 'we', 'show', 'that', 'the', 'problem', 'of', 'finding', 'a', 'parsimonious', 'scenario', 'of', 'minimum', 'cost', 'on', 'an', 'eulerian', '2edgecolored', 'multigraph', 'with', 'a', 'general', 'cost', 'function', 'for', '2breaks', 'can', 'be', 'solved', 'by', 'decomposing', 'the', 'problem', 'into', 'independent', 'instances', 'on', 'simple', 'alternating', 'cycles', 'for', 'breakpoint', 'graphs', 'and', 'a', 'more', 'constrained', 'cost', 'function', 'based', 'on', 'coloring', 'the', 'vertices', 'we', 'give', 'a', 'polynomialtime', 'algorithm', 'for', 'finding', 'a', 'parsimonious', '2break', 'scenario', 'of', 'minimum', 'cost', 'while', 'showing', 'that', 'finding', 'a', 'nonparsimonious', '2break', 'scenario', 'of', 'minimum', 'cost', 'is', 'nphard']] | [-0.16731698176968698, 0.07875550121710373, -0.06620936782716157, 0.09988373412158001, -0.09839570901187306, -0.14581136983008935, 0.10457227708070309, 0.39673648364751224, -0.29327358565196493, -0.345604443934734, 0.07619722324420468, -0.25960389459384725, -0.1788136379433457, 0.14845175937108404, -0.1262663087093985, 0.014945171620355097, 0.1564254554188145, 0.03393904496794688, -0.015696461410367523, -0.28121591227408044, 0.2711403435338047, 0.007449390770347378, 0.19146778606718962, 0.05393244355747646, 0.09371030489708503, 0.03608194955128741, -0.024380303000087863, 0.11286971774390693, -0.13640979706665407, 0.12232932128849766, 0.23093705977367648, 0.22948642387904353, 0.2534135850358077, -0.4076411791944078, -0.1706266925555303, 0.19550245955386863, 0.12580962002076293, 0.07060425290565744, -0.021953188101084473, -0.18332685545304572, 0.09788906829455843, -0.10708951259140748, -0.03358086299864793, 0.008302059044226907, 0.04818369800454707, -0.00031804189111662474, -0.281937816579427, 0.04851964992461968, 0.027043349932056742, 0.0455581036217922, 0.010263599798555014, -0.16695213963749347, 0.014130351496497532, 0.07176178336583264, -0.012199581711660381, 0.07008989494257643, 0.04014826330126493, -0.1084987205776761, -0.20480974845349328, 0.38856480605658383, 0.012765769024270696, -0.1878539235361356, 0.1399296173960418, -0.03490588895662071, -0.19647794240154326, 0.08539482419811455, 0.15880792578924205, 0.16254681888544423, -0.15521848644129932, 0.045869328443326855, -0.11770994787621493, 0.12304955949498848, 0.12823846276740652, -0.012724106170935556, 0.16775247705162974, 0.17293012568231236, 0.19060709228241732, 0.19893476854353634, -0.0005709154186649369, -0.09076040534471924, -0.24070085100406272, -0.08248248049239447, -0.20866207641401244, 0.0061537282966234565, -0.18517477886553615, -0.2068659521869154, 0.42719288629951413, 0.07825631525839208, 0.20698400891413188, 0.18000816970280456, 0.2623995713732363, 0.07837953731756318, 0.06672943100505568, 0.13526354142005084, 0.11448292250672427, 0.12470677473836324, -0.001822919289992711, -0.21575885154185936, 0.1102364957922247, 0.1509429822470267] |
1,802.07516 | A new technique for observationally derived boundary conditions for
space weather | In recent years, space weather research has focused on developing modelling
techniques to predict the arrival time and properties of coronal mass ejections
(CMEs) at the Earth. The aim of this paper is to propose a new modelling
technique suitable for the next generation of Space Weather predictive tools
that is both efficient and accurate. The aim of the new approach is to provide
interplanetary space weather forecasting models with accurate time dependent
boundary conditions of erupting magnetic flux ropes in the upper solar corona.
To produce boundary conditions, we couple two different modelling techniques,
MHD simulations and a quasi-static non-potential evolution model. Both are
applied on a spatial domain that covers the entire solar surface. The
non-potential model uses a time series of observed synoptic magnetograms to
drive the non-potential quasi-static evolution of the coronal magnetic field.
This allows us to follow the formation and loss of equilibrium of magnetic flux
ropes. Following this a MHD simulation captures the dynamic evolution of the
erupting flux rope. The present paper focuses on the MHD simulations that
follow the ejection of magnetic flux ropes to 4$R_\odot$. We first propose a
technique for specifying the pre-eruptive plasma properties in the corona.
Next, time dependent MHD simulations describe the ejection of two magnetic flux
ropes, that produce time dependent boundary conditions for the magnetic field
and plasma at 4$R_{\odot}$. In the present paper, we show that the dual use of
quasi-static non-potential magnetic field simulations and full time dependent
MHD simulations can produce realistic inhomogeneous boundary conditions for
space weather forecasting tools. Before a fully operational model can be
produced there are a number of technical and scientific challenges that still
need to be addressed.
| astro-ph.SR | in recent years space weather research has focused on developing modelling techniques to predict the arrival time and properties of coronal mass ejections cmes at the earth the aim of this paper is to propose a new modelling technique suitable for the next generation of space weather predictive tools that is both efficient and accurate the aim of the new approach is to provide interplanetary space weather forecasting models with accurate time dependent boundary conditions of erupting magnetic flux ropes in the upper solar corona to produce boundary conditions we couple two different modelling techniques mhd simulations and a quasistatic nonpotential evolution model both are applied on a spatial domain that covers the entire solar surface the nonpotential model uses a time series of observed synoptic magnetograms to drive the nonpotential quasistatic evolution of the coronal magnetic field this allows us to follow the formation and loss of equilibrium of magnetic flux ropes following this a mhd simulation captures the dynamic evolution of the erupting flux rope the present paper focuses on the mhd simulations that follow the ejection of magnetic flux ropes to 4r_odot we first propose a technique for specifying the preeruptive plasma properties in the corona next time dependent mhd simulations describe the ejection of two magnetic flux ropes that produce time dependent boundary conditions for the magnetic field and plasma at 4r_odot in the present paper we show that the dual use of quasistatic nonpotential magnetic field simulations and full time dependent mhd simulations can produce realistic inhomogeneous boundary conditions for space weather forecasting tools before a fully operational model can be produced there are a number of technical and scientific challenges that still need to be addressed | [['in', 'recent', 'years', 'space', 'weather', 'research', 'has', 'focused', 'on', 'developing', 'modelling', 'techniques', 'to', 'predict', 'the', 'arrival', 'time', 'and', 'properties', 'of', 'coronal', 'mass', 'ejections', 'cmes', 'at', 'the', 'earth', 'the', 'aim', 'of', 'this', 'paper', 'is', 'to', 'propose', 'a', 'new', 'modelling', 'technique', 'suitable', 'for', 'the', 'next', 'generation', 'of', 'space', 'weather', 'predictive', 'tools', 'that', 'is', 'both', 'efficient', 'and', 'accurate', 'the', 'aim', 'of', 'the', 'new', 'approach', 'is', 'to', 'provide', 'interplanetary', 'space', 'weather', 'forecasting', 'models', 'with', 'accurate', 'time', 'dependent', 'boundary', 'conditions', 'of', 'erupting', 'magnetic', 'flux', 'ropes', 'in', 'the', 'upper', 'solar', 'corona', 'to', 'produce', 'boundary', 'conditions', 'we', 'couple', 'two', 'different', 'modelling', 'techniques', 'mhd', 'simulations', 'and', 'a', 'quasistatic', 'nonpotential', 'evolution', 'model', 'both', 'are', 'applied', 'on', 'a', 'spatial', 'domain', 'that', 'covers', 'the', 'entire', 'solar', 'surface', 'the', 'nonpotential', 'model', 'uses', 'a', 'time', 'series', 'of', 'observed', 'synoptic', 'magnetograms', 'to', 'drive', 'the', 'nonpotential', 'quasistatic', 'evolution', 'of', 'the', 'coronal', 'magnetic', 'field', 'this', 'allows', 'us', 'to', 'follow', 'the', 'formation', 'and', 'loss', 'of', 'equilibrium', 'of', 'magnetic', 'flux', 'ropes', 'following', 'this', 'a', 'mhd', 'simulation', 'captures', 'the', 'dynamic', 'evolution', 'of', 'the', 'erupting', 'flux', 'rope', 'the', 'present', 'paper', 'focuses', 'on', 'the', 'mhd', 'simulations', 'that', 'follow', 'the', 'ejection', 'of', 'magnetic', 'flux', 'ropes', 'to', '4r_odot', 'we', 'first', 'propose', 'a', 'technique', 'for', 'specifying', 'the', 'preeruptive', 'plasma', 'properties', 'in', 'the', 'corona', 'next', 'time', 'dependent', 'mhd', 'simulations', 'describe', 'the', 'ejection', 'of', 'two', 'magnetic', 'flux', 'ropes', 'that', 'produce', 'time', 'dependent', 'boundary', 'conditions', 'for', 'the', 'magnetic', 'field', 'and', 'plasma', 'at', '4r_odot', 'in', 'the', 'present', 'paper', 'we', 'show', 'that', 'the', 'dual', 'use', 'of', 'quasistatic', 'nonpotential', 'magnetic', 'field', 'simulations', 'and', 'full', 'time', 'dependent', 'mhd', 'simulations', 'can', 'produce', 'realistic', 'inhomogeneous', 'boundary', 'conditions', 'for', 'space', 'weather', 'forecasting', 'tools', 'before', 'a', 'fully', 'operational', 'model', 'can', 'be', 'produced', 'there', 'are', 'a', 'number', 'of', 'technical', 'and', 'scientific', 'challenges', 'that', 'still', 'need', 'to', 'be', 'addressed']] | [-0.14134363628468138, 0.18724083855867069, -0.04328836954829567, 0.13041868937657553, -0.0926521790960262, -0.03540088943245404, -0.02696200566249074, 0.4199565136507946, -0.2053776835817976, -0.3557182325393701, 0.09235419997977834, -0.15937310199387222, -0.10709161558584805, 0.2312402671495294, -0.03766944577111631, 0.06837473949850933, 0.12347647001890875, -0.033502100690177984, -0.06523962365628504, -0.20727179531860065, 0.2982722788897231, 0.09840958125902512, 0.2511391302253655, 0.005220755665556442, 0.09079025340463029, -0.0890372155865007, -0.04384298592719996, 0.02349480100476401, -0.1467773100885613, 0.07534937881175198, 0.18043440647963493, 0.11569707269626768, 0.2808837381568044, -0.5382169281191965, -0.2996073237501402, 0.005086981084574252, 0.13581041280834122, 0.03670851630323851, -0.02391105004196577, -0.21657405334280422, 0.05053756784495785, -0.1371306101147561, -0.1268292306327915, -0.04484032899849711, -0.004535781864014104, 0.026287106504822348, -0.3385631543656824, 0.05368064937564868, 0.019959952235791556, 0.08051968561491601, -0.15531146045483596, -0.015100847832703343, -0.047311306830350286, 0.14984602375733766, 0.09798626274412088, 0.06723489962660226, 0.16848093236062564, -0.10683220790794899, -0.08958266886753684, 0.3571691062129664, -0.03920990514489723, -0.12652046459971378, 0.1904306605087547, -0.18332073419909686, -0.1663522083289155, 0.1698311306503172, 0.2054550673355223, 0.0982734591531706, -0.1601578728667401, 0.02592030287318176, -0.05016312599083052, 0.1099027993474552, 0.015388337475023106, -0.051916612213120814, 0.2682550276302673, 0.18866433163300644, 0.07242033951948826, 0.11697347314594023, -0.17695960460448676, -0.08112339651482907, -0.2870139175107874, -0.14189196599336548, -0.11007692421050015, 0.04482697304924422, -0.06677849005280494, -0.23825437661775567, 0.4348135784347641, 0.24993073333926658, 0.14311061748253934, -0.006524148248532351, 0.33419980336945004, 0.09903618991738251, 0.009676650081470556, 0.13990623932430876, 0.23799491069091366, 0.16680165811719255, 0.22904751207580434, -0.2422068778430409, 0.05790096800237669, 0.09902602383959377] |
1,802.07517 | Near-infrared scattering as a dust diagnostic | We examine the possibility of using near-infrared scattering to constrain the
local radiation field and the dust properties, for example, the size
distribution of the grains, and maximum grain size. We use radiative transfer
modelling to examine the constraints provided by J, H, and K bands in
combination with mid-infrared surface brightness at 3.6 $\mu$m. We use a
spherical one-dimensional and elliptical three-dimensional cloud models to
study the observable effects of different grain size distributions with varying
absorption and scattering properties. As an example, we analyse observations of
a molecular cloud in Taurus, TMC-1N. The observed surface brightness ratios
between the bands change when the dust properties are changed. However, even a
small change of 10% in the surface brightness of one channel changes the
estimated powerlaw exponent of the size distribution $\gamma$ by up to ~30% and
the estimated strength of the radiation field K_ISRF by up to ~60%. The maximum
grain size A_max and $\gamma$ are always strongly anti-correlated. For example,
overestimating the surface brightness by 10% changes the estimated radiation
field strength by ~20% and the exponent of the size distribution by ~15%. The
analysis of our synthetic observations indicates that the relative uncertainty
of the parameter distributions are on average A_max, $\gamma$ ~25%, and the
deviation between the estimated and correct values $\Delta$ Q <15%. We show
that scattered infrared light can be used to derive meaningful limits for the
dust parameters. However, errors in the surface brightness data can result in
considerable uncertainties in the derived parameters.
| astro-ph.GA | we examine the possibility of using nearinfrared scattering to constrain the local radiation field and the dust properties for example the size distribution of the grains and maximum grain size we use radiative transfer modelling to examine the constraints provided by j h and k bands in combination with midinfrared surface brightness at 36 mum we use a spherical onedimensional and elliptical threedimensional cloud models to study the observable effects of different grain size distributions with varying absorption and scattering properties as an example we analyse observations of a molecular cloud in taurus tmc1n the observed surface brightness ratios between the bands change when the dust properties are changed however even a small change of 10 in the surface brightness of one channel changes the estimated powerlaw exponent of the size distribution gamma by up to 30 and the estimated strength of the radiation field k_isrf by up to 60 the maximum grain size a_max and gamma are always strongly anticorrelated for example overestimating the surface brightness by 10 changes the estimated radiation field strength by 20 and the exponent of the size distribution by 15 the analysis of our synthetic observations indicates that the relative uncertainty of the parameter distributions are on average a_max gamma 25 and the deviation between the estimated and correct values delta q 15 we show that scattered infrared light can be used to derive meaningful limits for the dust parameters however errors in the surface brightness data can result in considerable uncertainties in the derived parameters | [['we', 'examine', 'the', 'possibility', 'of', 'using', 'nearinfrared', 'scattering', 'to', 'constrain', 'the', 'local', 'radiation', 'field', 'and', 'the', 'dust', 'properties', 'for', 'example', 'the', 'size', 'distribution', 'of', 'the', 'grains', 'and', 'maximum', 'grain', 'size', 'we', 'use', 'radiative', 'transfer', 'modelling', 'to', 'examine', 'the', 'constraints', 'provided', 'by', 'j', 'h', 'and', 'k', 'bands', 'in', 'combination', 'with', 'midinfrared', 'surface', 'brightness', 'at', '36', 'mum', 'we', 'use', 'a', 'spherical', 'onedimensional', 'and', 'elliptical', 'threedimensional', 'cloud', 'models', 'to', 'study', 'the', 'observable', 'effects', 'of', 'different', 'grain', 'size', 'distributions', 'with', 'varying', 'absorption', 'and', 'scattering', 'properties', 'as', 'an', 'example', 'we', 'analyse', 'observations', 'of', 'a', 'molecular', 'cloud', 'in', 'taurus', 'tmc1n', 'the', 'observed', 'surface', 'brightness', 'ratios', 'between', 'the', 'bands', 'change', 'when', 'the', 'dust', 'properties', 'are', 'changed', 'however', 'even', 'a', 'small', 'change', 'of', '10', 'in', 'the', 'surface', 'brightness', 'of', 'one', 'channel', 'changes', 'the', 'estimated', 'powerlaw', 'exponent', 'of', 'the', 'size', 'distribution', 'gamma', 'by', 'up', 'to', '30', 'and', 'the', 'estimated', 'strength', 'of', 'the', 'radiation', 'field', 'k_isrf', 'by', 'up', 'to', '60', 'the', 'maximum', 'grain', 'size', 'a_max', 'and', 'gamma', 'are', 'always', 'strongly', 'anticorrelated', 'for', 'example', 'overestimating', 'the', 'surface', 'brightness', 'by', '10', 'changes', 'the', 'estimated', 'radiation', 'field', 'strength', 'by', '20', 'and', 'the', 'exponent', 'of', 'the', 'size', 'distribution', 'by', '15', 'the', 'analysis', 'of', 'our', 'synthetic', 'observations', 'indicates', 'that', 'the', 'relative', 'uncertainty', 'of', 'the', 'parameter', 'distributions', 'are', 'on', 'average', 'a_max', 'gamma', '25', 'and', 'the', 'deviation', 'between', 'the', 'estimated', 'and', 'correct', 'values', 'delta', 'q', '15', 'we', 'show', 'that', 'scattered', 'infrared', 'light', 'can', 'be', 'used', 'to', 'derive', 'meaningful', 'limits', 'for', 'the', 'dust', 'parameters', 'however', 'errors', 'in', 'the', 'surface', 'brightness', 'data', 'can', 'result', 'in', 'considerable', 'uncertainties', 'in', 'the', 'derived', 'parameters']] | [-0.06000401274105385, 0.15807494292351318, -0.05800269665270747, 0.07038332897412825, -0.010074291569811563, -0.06702391264507496, 0.06427396170839489, 0.3979533371474757, -0.25363682644475116, -0.39281484361671176, 0.0776323370507499, -0.2768659825544374, -0.04334988531868059, 0.17975759792301166, -0.024810874684615455, 0.02776120857209704, 0.012628610109524482, -0.06490558941117618, -0.07167087827875943, -0.20634790298258107, 0.29265968604718307, 0.07137277580063003, 0.24702971019149958, 0.05607101025381701, 0.02869854622336839, -0.021958616459222726, -0.06230359545545244, 0.012701095905585356, -0.19043076847916687, 0.08625703490348728, 0.16640852682220397, 0.061883428768510836, 0.16903183616065157, -0.37784755674090637, -0.2408782721931241, 0.0849827330270077, 0.11794849280713207, 0.04070081741389525, 0.004822314323568012, -0.2250552932134425, 0.05627205800318411, -0.1266831822690565, -0.1885695187170875, 0.045330944734503074, 0.10105023199861193, 0.03129027333236726, -0.27064250078260066, 0.0946257761085918, 0.010907200559473038, 0.0969628099448593, -0.07706539394367352, -0.14385322533525616, -0.07867870211000165, 0.09349522737341384, 0.04489453945427658, 0.031818064090153905, 0.20304079047511833, -0.14148506299737262, -0.014495980266789605, 0.36848574946170665, -0.12445057743781829, -0.11085056517629391, 0.16647780430711903, -0.21543730455135326, -0.07709752033980363, 0.19638345871154086, 0.1740190147040078, 0.08957194150852195, -0.12807979903851063, 0.05062891728665858, 0.009754244034063532, 0.21007077270027424, 0.06752132623089084, 0.045831485855508135, 0.23379300015633445, 0.09994143986818474, -0.0030385726446886937, 0.1357338968362934, -0.242833117834771, -0.030837968978808222, -0.2711718395928411, -0.10852277887228179, -0.19302069438821767, 0.05660994856876221, -0.1757030847042463, -0.10399075916623214, 0.34371892784711017, 0.14327194685472613, 0.24508298917922128, 0.05668529732045217, 0.26378418843955753, 0.11838776163897845, 0.07894491201704479, 0.11004925393443778, 0.27709007580612466, 0.1474178339787425, 0.051526866592578144, -0.25911330826120427, 0.08049616217891503, -0.05283794390683274] |
1,802.07518 | Global regularity for the Monge-Amp\`ere equation with natural boundary
condition | In this paper, we establish the global $C^{2,\alpha}$ and $W^{2,p}$
regularity for the Monge-Amp\`ere equation $\det\,D^2u = f$ subject to boundary
condition $Du(\Omega) = \Omega^*$, where $\Omega$ and $\Omega^*$ are bounded
convex domains in the Euclidean space $\mathbb{R}^n$ with $C^{1,1}$ boundaries,
and $f$ is a H\"older continuous function. This boundary value problem arises
naturally in optimal transportation and many other applications.
| math.AP | in this paper we establish the global c2alpha and w2p regularity for the mongeampere equation detd2u f subject to boundary condition duomega omega where omega and omega are bounded convex domains in the euclidean space mathbbrn with c11 boundaries and f is a holder continuous function this boundary value problem arises naturally in optimal transportation and many other applications | [['in', 'this', 'paper', 'we', 'establish', 'the', 'global', 'c2alpha', 'and', 'w2p', 'regularity', 'for', 'the', 'mongeampere', 'equation', 'detd2u', 'f', 'subject', 'to', 'boundary', 'condition', 'duomega', 'omega', 'where', 'omega', 'and', 'omega', 'are', 'bounded', 'convex', 'domains', 'in', 'the', 'euclidean', 'space', 'mathbbrn', 'with', 'c11', 'boundaries', 'and', 'f', 'is', 'a', 'holder', 'continuous', 'function', 'this', 'boundary', 'value', 'problem', 'arises', 'naturally', 'in', 'optimal', 'transportation', 'and', 'many', 'other', 'applications']] | [-0.20191923721597113, 0.04671387022746534, -0.0264136355193653, 0.040213643675589744, -0.1520192705913736, -0.1300748581757191, -0.0096536672268673, 0.34136948161678193, -0.38810074881746853, -0.1681227600844256, 0.18986953263660764, -0.2884195704045224, -0.11070362083485415, 0.1666909469520384, -0.16910460024494037, 0.17651575485822454, 0.05425614346589508, 0.05211116277195256, -0.08340174091401799, -0.1960114155061029, 0.4116402042323145, -0.2230723841549379, 0.2158421448207107, 0.11586574126227663, 0.06735299155116081, -0.04840517449513849, 0.08633260367084937, -0.009298427954239867, -0.26601526198571485, 0.13756142937024285, 0.29046752008384674, 0.08907611555708893, 0.3527241752258149, -0.38233454050175075, -0.23965531598037942, 0.212928612941298, 0.11837075242034063, -0.07443330491539733, -0.011772204270779059, -0.29991292325651336, 0.07655627350322902, 0.008137886151510837, -0.2065276698980095, 0.005069121630091606, 0.06078333950376716, 0.04236595669825529, -0.3898760818812097, 0.12217155684203167, 0.09640251768046412, 0.048250376357263404, -0.21280714270562448, -0.09206404500030752, -0.05728913040767456, 0.06508558511268348, 0.049147095832299315, 0.20955533104756013, 0.06453351386630073, -0.07978128825699718, -0.0022090655301922352, 0.3505823800404524, -0.06591926807344987, -0.36991798649702606, 0.18022402755691316, -0.2314445887820731, -0.11874348544997387, 0.04474083445805671, 0.16260731513290827, 0.1877645264090649, -0.1531944702186718, 0.2706586312269792, -0.061634654801435255, 0.0900917858013819, 0.160014580862982, 0.01481590532408706, 0.006915908748412441, 0.10704543268115356, 0.2871637082455985, 0.16004760298528709, 0.050298556146525036, -0.06336850284373965, -0.40152296642291135, -0.12472412682234726, -0.16558056650683284, 0.08999804877836642, -0.1143151161748643, -0.20851852677377133, 0.26790939341299236, 0.05225474687678547, 0.17904245622199158, 0.07934492730920942, 0.2003940771382045, 0.14306037974190608, -0.0577435285045669, 0.14334893116631128, 0.1170911827558202, 0.11393258814972922, 0.1650963632614705, -0.17710990183344433, 0.004792198659209856, 0.114829994281222] |
1,802.07519 | Packing unequal rectangles and squares in a fixed size circular
container using formulation space search | In this paper we formulate the problem of packing unequal rectangles/squares
into a fixed size circular container as a mixed-integer nonlinear program. Here
we pack rectangles so as to maximise some objective (e.g. maximise the number
of rectangles packed or maximise the total area of the rectangles packed). We
show how we can eliminate a nonlinear maximisation term that arises in one of
the constraints in our formulation. We indicate the amendments that can be made
to the formulation for the special case where we are maximising the number of
squares packed. A formulation space search heuristic is presented and
computational results given for publicly available test problems involving up
to 30 rectangles/squares. Our heuristic deals with the case where the
rectangles are of fixed orientation (so cannot be rotated) and with the case
where the rectangles can be rotated through ninety degrees.
| math.OC | in this paper we formulate the problem of packing unequal rectanglessquares into a fixed size circular container as a mixedinteger nonlinear program here we pack rectangles so as to maximise some objective eg maximise the number of rectangles packed or maximise the total area of the rectangles packed we show how we can eliminate a nonlinear maximisation term that arises in one of the constraints in our formulation we indicate the amendments that can be made to the formulation for the special case where we are maximising the number of squares packed a formulation space search heuristic is presented and computational results given for publicly available test problems involving up to 30 rectanglessquares our heuristic deals with the case where the rectangles are of fixed orientation so cannot be rotated and with the case where the rectangles can be rotated through ninety degrees | [['in', 'this', 'paper', 'we', 'formulate', 'the', 'problem', 'of', 'packing', 'unequal', 'rectanglessquares', 'into', 'a', 'fixed', 'size', 'circular', 'container', 'as', 'a', 'mixedinteger', 'nonlinear', 'program', 'here', 'we', 'pack', 'rectangles', 'so', 'as', 'to', 'maximise', 'some', 'objective', 'eg', 'maximise', 'the', 'number', 'of', 'rectangles', 'packed', 'or', 'maximise', 'the', 'total', 'area', 'of', 'the', 'rectangles', 'packed', 'we', 'show', 'how', 'we', 'can', 'eliminate', 'a', 'nonlinear', 'maximisation', 'term', 'that', 'arises', 'in', 'one', 'of', 'the', 'constraints', 'in', 'our', 'formulation', 'we', 'indicate', 'the', 'amendments', 'that', 'can', 'be', 'made', 'to', 'the', 'formulation', 'for', 'the', 'special', 'case', 'where', 'we', 'are', 'maximising', 'the', 'number', 'of', 'squares', 'packed', 'a', 'formulation', 'space', 'search', 'heuristic', 'is', 'presented', 'and', 'computational', 'results', 'given', 'for', 'publicly', 'available', 'test', 'problems', 'involving', 'up', 'to', '30', 'rectanglessquares', 'our', 'heuristic', 'deals', 'with', 'the', 'case', 'where', 'the', 'rectangles', 'are', 'of', 'fixed', 'orientation', 'so', 'can', 'not', 'be', 'rotated', 'and', 'with', 'the', 'case', 'where', 'the', 'rectangles', 'can', 'be', 'rotated', 'through', 'ninety', 'degrees']] | [-0.1125063847251971, 0.10427223017085081, -0.024439897952260266, 0.01793249826681551, -0.12054663793426532, -0.12264743614876249, 0.048621578264201035, 0.380821488220507, -0.30147765319137326, -0.343748117993835, 0.15379886439440668, -0.3072719334208236, -0.12443602492895083, 0.14861654591235057, -0.10465048730675079, 0.07293219692532865, 0.06639760919571133, 0.013937063462717432, -0.04907044535174861, -0.30650902203362906, 0.24369437803028965, 0.0034576341457350154, 0.20273086112845218, 0.04773351320222965, 0.09353647810574227, 0.0359389461268684, 0.008220473914341608, 0.14001295581426387, -0.13496174273447176, 0.11230166752832535, 0.2674595907553506, 0.16076630885174997, 0.28771233721308304, -0.4414518669995309, -0.13052303066582116, 0.10982017966584158, 0.15207354397327283, 0.08495218349759251, 0.009632354540730708, -0.1947665280026292, 0.0790656534692561, -0.12445190059624507, -0.11231749561208655, -0.02553646293022788, -0.03622558407000148, 0.0333680459658917, -0.29098585531653337, -7.462963252000406e-05, 0.04343344231831356, -0.007971244287008131, -0.05264619198745825, -0.15932559431858465, 0.0078042640422903735, 0.11448469566686315, 0.041706154075398724, 0.045519957600922235, 0.10543559736926371, -0.10440788435598862, -0.10614932430612946, 0.4402383764497411, -0.001694322721114461, -0.3007873548227559, 0.11513432083835065, -0.1204720169345153, -0.13740337864023594, 0.09973245232552946, 0.2229113977231925, 0.14652789239017425, -0.10601414891589485, 0.03456837069948243, -0.131295795267133, 0.17262668885834986, 0.09435064711240711, -0.005828795426616996, 0.21788349895882356, 0.16264425044466124, 0.1203959891802146, 0.25064714818874795, -0.06995291953486665, -0.11834401093443042, -0.3102514793330633, -0.1561958662260481, -0.20387366718389618, -0.0048737193360018, -0.07939559722324985, -0.16155812507954387, 0.3419790704321431, 0.13243285851867895, 0.2044234813722244, 0.09113138811548017, 0.28293257176508785, 0.10361896473652041, 0.07496968980773654, 0.07352813361802886, 0.22310433893330875, 0.05675552695543623, 0.027626729803159833, -0.17966326684559839, 0.0225982493261846, 0.05219267764022987] |
1,802.0752 | Synchrotron emission from nanowire-array targets irradiated by
ultraintense laser pulses | We present a numerical study, based on two-dimensional particle-in-cell
simulations, of the synchrotron emission induced during the interaction of
femtosecond laser pulses of intensities $I=10^{21}-10^{23}\,\mathrm{Wcm}^{-2}$
with nanowire arrays. Through an extensive parametric scan on the target
parameters, we identify and characterize several dominant radiation mechanisms,
mainly depending on the transparency or opacity of the plasma produced by the
wire expansion. At $I=10^{22}\,\mathrm{Wcm}^{-2}$, the emission of high-energy
($>10\,\mathrm{keV}$) photons attains a maximum conversion efficiency of $\sim
10\%$ for $36-50\,\mathrm{nm}$ wire widths and $1\,\mu\mathrm{m}$ interspacing.
This maximum radiation yield is similar to that achieved in uniform plasma of
same average (sub-solid) density, but nanowire arrays provide efficient
radiation sources over a broader parameter range. We examine the variations of
the photon spectra with the laser intensity and the wire material. Finally, we
demonstrate that the radiation efficiency can be further enhanced by adding a
plasma mirror at the backside of the nanowire array.
| physics.plasm-ph | we present a numerical study based on twodimensional particleincell simulations of the synchrotron emission induced during the interaction of femtosecond laser pulses of intensities i10211023mathrmwcm2 with nanowire arrays through an extensive parametric scan on the target parameters we identify and characterize several dominant radiation mechanisms mainly depending on the transparency or opacity of the plasma produced by the wire expansion at i1022mathrmwcm2 the emission of highenergy 10mathrmkev photons attains a maximum conversion efficiency of sim 10 for 3650mathrmnm wire widths and 1mumathrmm interspacing this maximum radiation yield is similar to that achieved in uniform plasma of same average subsolid density but nanowire arrays provide efficient radiation sources over a broader parameter range we examine the variations of the photon spectra with the laser intensity and the wire material finally we demonstrate that the radiation efficiency can be further enhanced by adding a plasma mirror at the backside of the nanowire array | [['we', 'present', 'a', 'numerical', 'study', 'based', 'on', 'twodimensional', 'particleincell', 'simulations', 'of', 'the', 'synchrotron', 'emission', 'induced', 'during', 'the', 'interaction', 'of', 'femtosecond', 'laser', 'pulses', 'of', 'intensities', 'i10211023mathrmwcm2', 'with', 'nanowire', 'arrays', 'through', 'an', 'extensive', 'parametric', 'scan', 'on', 'the', 'target', 'parameters', 'we', 'identify', 'and', 'characterize', 'several', 'dominant', 'radiation', 'mechanisms', 'mainly', 'depending', 'on', 'the', 'transparency', 'or', 'opacity', 'of', 'the', 'plasma', 'produced', 'by', 'the', 'wire', 'expansion', 'at', 'i1022mathrmwcm2', 'the', 'emission', 'of', 'highenergy', '10mathrmkev', 'photons', 'attains', 'a', 'maximum', 'conversion', 'efficiency', 'of', 'sim', '10', 'for', '3650mathrmnm', 'wire', 'widths', 'and', '1mumathrmm', 'interspacing', 'this', 'maximum', 'radiation', 'yield', 'is', 'similar', 'to', 'that', 'achieved', 'in', 'uniform', 'plasma', 'of', 'same', 'average', 'subsolid', 'density', 'but', 'nanowire', 'arrays', 'provide', 'efficient', 'radiation', 'sources', 'over', 'a', 'broader', 'parameter', 'range', 'we', 'examine', 'the', 'variations', 'of', 'the', 'photon', 'spectra', 'with', 'the', 'laser', 'intensity', 'and', 'the', 'wire', 'material', 'finally', 'we', 'demonstrate', 'that', 'the', 'radiation', 'efficiency', 'can', 'be', 'further', 'enhanced', 'by', 'adding', 'a', 'plasma', 'mirror', 'at', 'the', 'backside', 'of', 'the', 'nanowire', 'array']] | [-0.10767449189156089, 0.19013720294167621, -0.03390817749888113, 0.016670442202243292, 0.0043897825829072356, -0.09104359180232739, 0.034158387943808856, 0.4854330735357657, -0.21211004299940925, -0.3353060615226652, 0.03422700460244302, -0.27488354036635526, 0.0014842805557897035, 0.23447481954106678, 0.03219181299369068, 0.008443210327404563, 0.06222123479508884, -0.0688115594857165, -0.03586509936387102, -0.14315193230190557, 0.2800808411015019, 0.1582224358141116, 0.3091690817158924, 0.10076286817250187, 0.10633279082097419, -0.013687419685956142, 0.0055985692091133086, -0.013503126232336238, -0.12920055173202705, 0.07923166383670209, 0.17233205066191684, 0.0458211685763672, 0.20286871180933427, -0.45092207729044587, -0.25637594340624265, 0.04283483387353792, 0.1501765848529742, 0.06972636506982045, -0.07305953426331231, -0.24636949102828049, 0.046604217393706515, -0.15301548067335005, -0.09867121287532253, 0.03788297107341151, -0.024274325546846814, 0.07709091583949398, -0.2705559269812162, 0.00848577657637939, 0.02233627145154695, 0.04492645794031376, -0.007810239495122677, -0.05919535847680567, -0.013725078710468889, 0.010134351789817368, 0.012741517159156501, 0.008876138397058702, 0.22095056044652242, -0.14440868326386258, -0.09205748833562821, 0.35575464910035, -0.1146779806892968, -0.08817566885000529, 0.161492481555037, -0.20712467099297538, -0.023752129938108973, 0.23534503563830297, 0.1752681302047041, 0.13633967955016263, -0.109156946554359, 0.006934150666307836, 0.008852973359490247, 0.2170077267004024, 0.12514307930402152, 0.06390546444382468, 0.23776323355938475, 0.18936482302793492, 0.013895644162054339, 0.20965346730272733, -0.17927154854150515, 0.008044363417318219, -0.28812096294092193, -0.11425193464255905, -0.16576153448183242, 0.053869112830908894, -0.10653739183958164, -0.14376615888613742, 0.43936714142152705, 0.17030893025596064, 0.13191238640845843, -0.013445042073726654, 0.31430815361848435, 0.1496340514301029, 0.044702665926569636, 0.04144057967023899, 0.30119426912498143, 0.14077569224412412, 0.06958944683699958, -0.2860341842114058, 0.016154588152310006, -0.035883381055374565] |
1,802.07521 | Approaching the Quantum Speed Limit with Global-Local Optimization | We propose a Global-Local optimization algorithm for quantum control that
combines standard local search methodologies with evolutionary algorithms. This
allows us to find faster solutions to a set of problems relating to ultracold
control of Bose-Einstein condensates.
| quant-ph | we propose a globallocal optimization algorithm for quantum control that combines standard local search methodologies with evolutionary algorithms this allows us to find faster solutions to a set of problems relating to ultracold control of boseeinstein condensates | [['we', 'propose', 'a', 'globallocal', 'optimization', 'algorithm', 'for', 'quantum', 'control', 'that', 'combines', 'standard', 'local', 'search', 'methodologies', 'with', 'evolutionary', 'algorithms', 'this', 'allows', 'us', 'to', 'find', 'faster', 'solutions', 'to', 'a', 'set', 'of', 'problems', 'relating', 'to', 'ultracold', 'control', 'of', 'boseeinstein', 'condensates']] | [-0.08264349758423664, 0.04326295991100975, -0.1585831802741096, 0.04812671836604037, -0.11704854823246195, -0.22567872630079855, 0.07813190319418051, 0.37924528736117724, -0.26573011596259233, -0.3256293142063392, 0.0247953487560153, -0.1915269204910146, -0.14582779530335116, 0.22081913905866393, -0.07481836157574041, 0.1760398743271425, 0.0500665363427755, -0.07830870371450342, -0.11252935350922919, -0.2680280219159416, 0.2762178829745264, -0.03049113756561702, 0.2745973299685362, -0.020570279703148314, 0.16560448638188677, -0.000852048522918611, 0.005439245469264082, 0.0029064211490991954, -0.1916711005782221, 0.2181338593363762, 0.28539484950738986, 0.20342453888843995, 0.33642833156360163, -0.42880445759038666, -0.1811654165487837, 0.18929733060350692, 0.20858664148663347, 0.22760660697177454, -0.04260969306090595, -0.2753904268548295, 0.042809445574577595, -0.13761661780645718, -0.10958853012857002, -0.2099382675227684, -0.034831895719508864, 0.03489073557225433, -0.37309870828647873, 0.024086793519657205, -0.00425849507587987, -0.009555010930509181, -0.08443103753489668, -0.06271668921249944, 0.15500343961616023, 0.03270744247915777, -0.02041158004588372, 0.03610457915409997, 0.15019813276877678, -0.13309124163729516, -0.24850942758289543, 0.38594607223530075, -0.06252049302329889, -0.16876600807960573, 0.2574052533285843, -0.0016466005629784352, -0.099386815610971, 0.11212183205360496, 0.24714138401307267, 0.14162016805966157, -0.17860277716976566, 0.05784367847986318, -0.03508465747172768, 0.1824834390662963, 0.009627588697381922, 0.0044548415478218245, 0.20666070304955733, 0.22098259970143036, 0.19105838201436642, 0.18414805081949845, -0.047320258476444194, -0.21669489588286425, -0.21560310991480947, -0.14092960772482124, -0.09241304758030015, 0.005592866335064173, -0.07583313957611854, -0.21398230143696875, 0.3963150149462996, 0.25030120925323385, 0.16335037947204467, 0.067277059437254, 0.29172989695861534, 0.08588454733654617, 0.058226075577172076, 0.08121849329689064, 0.1803983181928964, 0.12330203995460996, 0.11221957542757327, -0.2782016436544222, -0.013033844908145634, 0.12348035934406358] |
1,802.07522 | Gap control by singular Schr\"odinger operators in a periodically
structured metamaterial | We consider a family $\{\mathcal{H}^\varepsilon\}_{\varepsilon>0}$ of
$\varepsilon\mathbb{Z}^n$-periodic Schr\"odinger operators with
$\delta'$-interactions supported on a lattice of closed compact surfaces;
within a minimal period cell one has $m\in\mathbb{N}$ surfaces. We show that in
the limit when $\varepsilon\to 0$ and the interactions strengths are
appropriately scaled, $\mathcal{H}^\varepsilon$ has at most $m$ gaps within
finite intervals, and moreover, the limiting behavior of the first $m$ gaps can
be completely controlled through a suitable choice of those surfaces and of the
interactions strengths.
| math.SP math-ph math.AP math.MP | we consider a family mathcalhvarepsilon_varepsilon0 of varepsilonmathbbznperiodic schrodinger operators with deltainteractions supported on a lattice of closed compact surfaces within a minimal period cell one has minmathbbn surfaces we show that in the limit when varepsilonto 0 and the interactions strengths are appropriately scaled mathcalhvarepsilon has at most m gaps within finite intervals and moreover the limiting behavior of the first m gaps can be completely controlled through a suitable choice of those surfaces and of the interactions strengths | [['we', 'consider', 'a', 'family', 'mathcalhvarepsilon_varepsilon0', 'of', 'varepsilonmathbbznperiodic', 'schrodinger', 'operators', 'with', 'deltainteractions', 'supported', 'on', 'a', 'lattice', 'of', 'closed', 'compact', 'surfaces', 'within', 'a', 'minimal', 'period', 'cell', 'one', 'has', 'minmathbbn', 'surfaces', 'we', 'show', 'that', 'in', 'the', 'limit', 'when', 'varepsilonto', '0', 'and', 'the', 'interactions', 'strengths', 'are', 'appropriately', 'scaled', 'mathcalhvarepsilon', 'has', 'at', 'most', 'm', 'gaps', 'within', 'finite', 'intervals', 'and', 'moreover', 'the', 'limiting', 'behavior', 'of', 'the', 'first', 'm', 'gaps', 'can', 'be', 'completely', 'controlled', 'through', 'a', 'suitable', 'choice', 'of', 'those', 'surfaces', 'and', 'of', 'the', 'interactions', 'strengths']] | [-0.1922186646536973, 0.17399108027549168, -0.05362619002698921, 0.04824056897900606, -0.0055270027890066175, -0.13584481803455242, 0.05185873427820441, 0.4064001916772931, -0.24154401920570404, -0.2386410059284811, 0.09333502186774767, -0.29810546296893764, -0.10211951151416686, 0.19486944146429827, -0.01758281635365596, 0.019980960949875514, 0.058743794534453435, 0.04864601576455722, -0.08018896893267274, -0.2207771181772267, 0.3727062298475127, -0.030913797176541073, 0.19942731553639628, 0.055202859870501254, 0.05322301881020203, 0.0015755346179694722, 0.08035101027551143, 0.0468780793445675, -0.15218841485837306, 0.11562083463956553, 0.23170162132009864, -0.007738187713058372, 0.26513226945443374, -0.41488822858388485, -0.20864241826348007, 0.11332819059393123, 0.1451649790396914, 0.05075883424203647, -0.0034931344791977225, -0.2552933254965434, 0.10257095492163085, -0.12079143773543795, -0.1795523551317226, -0.0418799172253593, 0.06410375413926024, 0.08809774385850974, -0.26262609372650714, 0.01832546621536542, 0.0585901542983361, 0.07780760049354285, -0.06604171884981425, -0.11191390394110624, -0.036258820330993716, 0.126474825481924, 0.013842392153731597, -0.023929239376325552, 0.08090367818888473, -0.06129387054151218, -0.06586879043913398, 0.36846754238190205, -0.13219195461562394, -0.2608731693686231, 0.16990707034710795, -0.18868525299292646, -0.08455047031594931, 0.11352918974099387, 0.1151098087537225, 0.15666550794297732, -0.11901210302178362, 0.19809148874590296, -0.02367508297979121, 0.13944523611510368, 0.08936068420543482, 0.009681713004523007, 0.19828136342479602, 0.15837680230738202, 0.08846400385587722, 0.09362285220719825, -0.0656854570873915, -0.07184679865665537, -0.33470982271491695, -0.13773803072246282, -0.19008519697787338, 0.07774820779511508, -0.09832237052097825, -0.16133905425790304, 0.38859040182279914, 0.061783133534175395, 0.24618815093938456, 0.07277776599910699, 0.16040397170735032, 0.12288499207811822, 0.07854842578959315, 0.07451723709604458, 0.18083455284297661, 0.10678077913134505, -0.012090246438195831, -0.17508323286892846, 0.0010222575909114983, 0.059880707498737855] |
1,802.07523 | Toward Open Data Blockchain Analytics: A Bitcoin Perspective | Bitcoin is the first implementation of what has become known as a 'public
permissionless' blockchain. Guaranteeing security and protocol conformity
through its elegant combination of cryptographic assurances and game theoretic
economic incentives, it permits censorship resistant public read-write access
to its append-only blockchain database without the need for any mediating
central authority. Not until its advent has such a trusted, transparent,
comprehensive and granular data set of digital economic behaviours been
available for public network analysis. In this article, by translating the
cumbersome binary data structure of the Bitcoin blockchain into a high fidelity
graph model, we demonstrate through various analyses the often overlooked
social and econometric benefits of employing such a novel open data
architecture. Specifically we show (a) how repeated patterns of transaction
behaviours can be revealed to link user activity across the blockchain; (b) how
newly mined bitcoin can be associated to demonstrate individual accumulations
of wealth; (c) through application of the naive quantity theory of money that
Bitcoin's disinflationary properties can be revealed and measured; and (d) how
the user community can develop coordinated defences against repeated denial of
service attacks on the network. All of the aforementioned being exemplary
benefits that would be lost with the closed data models of the 'private
permissioned' distributed ledger architectures that are dominating enterprise
level development due to existing blockchain issues of governance, scalability
and confidentiality.
| cs.CR cs.CY | bitcoin is the first implementation of what has become known as a public permissionless blockchain guaranteeing security and protocol conformity through its elegant combination of cryptographic assurances and game theoretic economic incentives it permits censorship resistant public readwrite access to its appendonly blockchain database without the need for any mediating central authority not until its advent has such a trusted transparent comprehensive and granular data set of digital economic behaviours been available for public network analysis in this article by translating the cumbersome binary data structure of the bitcoin blockchain into a high fidelity graph model we demonstrate through various analyses the often overlooked social and econometric benefits of employing such a novel open data architecture specifically we show a how repeated patterns of transaction behaviours can be revealed to link user activity across the blockchain b how newly mined bitcoin can be associated to demonstrate individual accumulations of wealth c through application of the naive quantity theory of money that bitcoins disinflationary properties can be revealed and measured and d how the user community can develop coordinated defences against repeated denial of service attacks on the network all of the aforementioned being exemplary benefits that would be lost with the closed data models of the private permissioned distributed ledger architectures that are dominating enterprise level development due to existing blockchain issues of governance scalability and confidentiality | [['bitcoin', 'is', 'the', 'first', 'implementation', 'of', 'what', 'has', 'become', 'known', 'as', 'a', 'public', 'permissionless', 'blockchain', 'guaranteeing', 'security', 'and', 'protocol', 'conformity', 'through', 'its', 'elegant', 'combination', 'of', 'cryptographic', 'assurances', 'and', 'game', 'theoretic', 'economic', 'incentives', 'it', 'permits', 'censorship', 'resistant', 'public', 'readwrite', 'access', 'to', 'its', 'appendonly', 'blockchain', 'database', 'without', 'the', 'need', 'for', 'any', 'mediating', 'central', 'authority', 'not', 'until', 'its', 'advent', 'has', 'such', 'a', 'trusted', 'transparent', 'comprehensive', 'and', 'granular', 'data', 'set', 'of', 'digital', 'economic', 'behaviours', 'been', 'available', 'for', 'public', 'network', 'analysis', 'in', 'this', 'article', 'by', 'translating', 'the', 'cumbersome', 'binary', 'data', 'structure', 'of', 'the', 'bitcoin', 'blockchain', 'into', 'a', 'high', 'fidelity', 'graph', 'model', 'we', 'demonstrate', 'through', 'various', 'analyses', 'the', 'often', 'overlooked', 'social', 'and', 'econometric', 'benefits', 'of', 'employing', 'such', 'a', 'novel', 'open', 'data', 'architecture', 'specifically', 'we', 'show', 'a', 'how', 'repeated', 'patterns', 'of', 'transaction', 'behaviours', 'can', 'be', 'revealed', 'to', 'link', 'user', 'activity', 'across', 'the', 'blockchain', 'b', 'how', 'newly', 'mined', 'bitcoin', 'can', 'be', 'associated', 'to', 'demonstrate', 'individual', 'accumulations', 'of', 'wealth', 'c', 'through', 'application', 'of', 'the', 'naive', 'quantity', 'theory', 'of', 'money', 'that', 'bitcoins', 'disinflationary', 'properties', 'can', 'be', 'revealed', 'and', 'measured', 'and', 'd', 'how', 'the', 'user', 'community', 'can', 'develop', 'coordinated', 'defences', 'against', 'repeated', 'denial', 'of', 'service', 'attacks', 'on', 'the', 'network', 'all', 'of', 'the', 'aforementioned', 'being', 'exemplary', 'benefits', 'that', 'would', 'be', 'lost', 'with', 'the', 'closed', 'data', 'models', 'of', 'the', 'private', 'permissioned', 'distributed', 'ledger', 'architectures', 'that', 'are', 'dominating', 'enterprise', 'level', 'development', 'due', 'to', 'existing', 'blockchain', 'issues', 'of', 'governance', 'scalability', 'and', 'confidentiality']] | [-0.18502073672386835, 0.0013787583118321093, -0.09126751569915661, 0.0696543697278073, -0.14062764381462362, -0.20963035752601197, 0.13441237305915313, 0.37768550001834805, -0.31439390213978763, -0.31761442342426927, 0.14408381101835016, -0.300769836029895, -0.138508527339807, 0.15679704407394857, -0.12384740553746841, 0.06998961703131693, 0.06746870628094498, 0.010041990778944661, 0.05193520200374924, -0.3170215477225571, 0.2807747276105292, 0.06163495812210691, 0.3516183339246854, 0.09219550553387838, 0.05642963122639319, 0.000327979072318536, -0.048619139480324196, -0.004087227642890561, -0.0590895773539723, 0.14255344059186437, 0.3258306757282226, 0.2816169964931534, 0.36740495223694675, -0.4717332299394879, -0.14569488415325604, 0.08421761393588267, 0.1458291311519616, 0.0824628581006525, -0.06740280766858085, -0.3286432287572323, 0.10393926483502744, -0.29998859958888024, -0.09533205156449426, -0.13649617159838037, -0.02089155712373559, 0.025536303392217897, -0.22726809674079645, -0.0030362046039374793, 0.005615706490641212, 0.09465095562761468, 0.015135786736402578, -0.04207973749030678, -0.07551462420486985, 0.17831253607224765, 0.04900775675093178, -0.02952343548544522, 0.1931615175748351, -0.11660393653952607, -0.18860249027720058, 0.3674874541110697, 0.010797524649600408, -0.11712165309767346, 0.14719802304222537, -0.022885736639496036, -0.17509454077076728, 0.06322319403525639, 0.1943398894529905, 0.021301987055540744, -0.22908157449801847, 0.047645938893974824, -0.0528961843316468, 0.19524071471604923, 0.0347683027325367, 0.08116611033941792, 0.2026948141937548, 0.20545541631022832, 0.06485285551109005, 0.1118853068431485, -0.005233404726517362, -0.14453279877913935, -0.20613314342413064, -0.13080116988064935, -0.16173734548202906, 0.0630220182078908, -0.09909985442930447, -0.13883072063656507, 0.36144803600659825, 0.19217778357009577, 0.09364970575449412, 0.020476988674243458, 0.3784691982622366, -0.01839904298492557, 0.12634823259673972, 0.1241977545370933, 0.16535602383257872, -0.007472170870215426, 0.18360948352044268, -0.14100924596206937, 0.22130011617457412, -0.03613391572061465] |
1,802.07524 | Spectral asymptotics for Dirichlet to Neumann operator | We consider eigenvalues of the Dirichlet-to-Neumann operator for Laplacian in
the domain (or manifold) with edges and establish the asymptotics of the
eigenvalue counting function \begin{equation*} \mathsf{N}(\lambda)=
\kappa_0\lambda^d +O(\lambda^{d-1})\qquad \text{as}\ \ \lambda\to+\infty,
\end{equation*} where $d$ is dimension of the boundary. Further, in certain
cases we establish two-term asymptotics \begin{equation*} \mathsf{N}(\lambda)=
\kappa_0\lambda^d+\kappa_1\lambda^{d-1}+o(\lambda^{d-1})\qquad \text{as}\ \
\lambda\to+\infty. \end{equation*} We also establish improved asymptotics for
Riesz means.
| math.SP | we consider eigenvalues of the dirichlettoneumann operator for laplacian in the domain or manifold with edges and establish the asymptotics of the eigenvalue counting function beginequation mathsfnlambda kappa_0lambdad olambdad1qquad textas lambdatoinfty endequation where d is dimension of the boundary further in certain cases we establish twoterm asymptotics beginequation mathsfnlambda kappa_0lambdadkappa_1lambdad1olambdad1qquad textas lambdatoinfty endequation we also establish improved asymptotics for riesz means | [['we', 'consider', 'eigenvalues', 'of', 'the', 'dirichlettoneumann', 'operator', 'for', 'laplacian', 'in', 'the', 'domain', 'or', 'manifold', 'with', 'edges', 'and', 'establish', 'the', 'asymptotics', 'of', 'the', 'eigenvalue', 'counting', 'function', 'beginequation', 'mathsfnlambda', 'kappa_0lambdad', 'olambdad1qquad', 'textas', 'lambdatoinfty', 'endequation', 'where', 'd', 'is', 'dimension', 'of', 'the', 'boundary', 'further', 'in', 'certain', 'cases', 'we', 'establish', 'twoterm', 'asymptotics', 'beginequation', 'mathsfnlambda', 'kappa_0lambdadkappa_1lambdad1olambdad1qquad', 'textas', 'lambdatoinfty', 'endequation', 'we', 'also', 'establish', 'improved', 'asymptotics', 'for', 'riesz', 'means']] | [-0.2013689916166186, 0.008203926571046136, -0.013421952208903219, 0.10221047560792483, -0.07599754097671914, -0.15779605059651658, -0.0031880019565245937, 0.3002843942293631, -0.282202814248324, -0.1416985603781151, 0.12042586607276462, -0.4178131303883025, -0.1408510713912879, 0.09868200448857221, -0.07875407630178545, 0.15271876536176673, 0.050857162535456676, 0.11621434703868415, -0.02010248999743323, -0.15705527061280528, 0.37059720090058235, -0.1309054092437561, 0.15876032986437036, 0.1391356388589234, 0.05847506531115089, -0.013280938936597002, 0.10147165905384879, -0.11988512478355265, -0.3473005153105727, 0.0368827553216501, 0.2789433769898356, 0.0033193186266414288, 0.2808331748736756, -0.39570149815907435, -0.14029661421331444, 0.23982015306163312, 0.24198127365005867, -0.06609284031271402, 0.06201273150301339, -0.35791647869960536, 0.10743843239781979, -0.0446342418435961, -0.2526815982419066, -0.0813291251127209, 0.05473149617734764, 0.06317938616432782, -0.4354569445962885, 0.18359804009950104, 0.0970953669374077, 0.02618510673554348, -0.06609190069139004, -0.2108538275268594, 0.05220103245561144, 0.08636772667731359, 0.03719530135068843, -0.005028247309383005, -0.03314791873396773, -0.09603417661648044, 0.0015069140936248004, 0.27227614952218054, -0.07441921126363533, -0.3262975345631795, -0.03482014934499083, -0.2638185835011037, -0.16184588011154638, -0.03652201734283673, 0.08684698159673385, 0.21902737773156591, -0.08466455536628407, 0.25412550468692124, -0.055918333733903376, 0.07869514811318368, 0.18050980398298375, 0.050559575586313646, -0.049099714162626436, 0.07668712209644062, 0.1808317556507453, 0.19495556310617498, -0.019964820044281493, -0.027112489133807167, -0.37120264888341936, -0.18763620870387449, -0.2347955574597498, 0.21121463952087133, -0.16764337196712273, -0.17653570719994605, 0.29735595090979977, 0.08112730729460184, 0.2283276359750224, 0.16560038160865329, 0.14150029510242998, 0.24642188751438102, -0.07323662513434621, 0.09795168566883408, 0.06494000381124872, 0.19305986583848217, 0.11554195084941707, -0.243000813751548, -0.032696271290270876, 0.26526001035901053] |
1,802.07525 | Modelling Microbial Fuel Cells using lattice Boltzmann methods | An accurate modelling of bio-electrochemical processes that govern Microbial
Fuel Cells (MFCs) and mapping their behaviour according to several parameters
will enhance the development of MFC technology and enable their successful
implementation in well defined applications. The geometry of the electrodes is
among key parameters determining efficiency of MFCs due to the formation of a
biofilm of anodophilic bacteria on the anode electrode, which is a decisive
factor for the functionality of the device. We simulate the bio-electrochemical
processes in an MFC while taking into account the geometry of the electrodes.
Namely, lattice Boltzmann methods are used to simulate the fluid dynamics and
the advection-diffusion phenomena in the anode compartment. The model is
verified on voltage and current outputs of a single MFC derived from laboratory
experiments under continuous flow.
| cs.CE | an accurate modelling of bioelectrochemical processes that govern microbial fuel cells mfcs and mapping their behaviour according to several parameters will enhance the development of mfc technology and enable their successful implementation in well defined applications the geometry of the electrodes is among key parameters determining efficiency of mfcs due to the formation of a biofilm of anodophilic bacteria on the anode electrode which is a decisive factor for the functionality of the device we simulate the bioelectrochemical processes in an mfc while taking into account the geometry of the electrodes namely lattice boltzmann methods are used to simulate the fluid dynamics and the advectiondiffusion phenomena in the anode compartment the model is verified on voltage and current outputs of a single mfc derived from laboratory experiments under continuous flow | [['an', 'accurate', 'modelling', 'of', 'bioelectrochemical', 'processes', 'that', 'govern', 'microbial', 'fuel', 'cells', 'mfcs', 'and', 'mapping', 'their', 'behaviour', 'according', 'to', 'several', 'parameters', 'will', 'enhance', 'the', 'development', 'of', 'mfc', 'technology', 'and', 'enable', 'their', 'successful', 'implementation', 'in', 'well', 'defined', 'applications', 'the', 'geometry', 'of', 'the', 'electrodes', 'is', 'among', 'key', 'parameters', 'determining', 'efficiency', 'of', 'mfcs', 'due', 'to', 'the', 'formation', 'of', 'a', 'biofilm', 'of', 'anodophilic', 'bacteria', 'on', 'the', 'anode', 'electrode', 'which', 'is', 'a', 'decisive', 'factor', 'for', 'the', 'functionality', 'of', 'the', 'device', 'we', 'simulate', 'the', 'bioelectrochemical', 'processes', 'in', 'an', 'mfc', 'while', 'taking', 'into', 'account', 'the', 'geometry', 'of', 'the', 'electrodes', 'namely', 'lattice', 'boltzmann', 'methods', 'are', 'used', 'to', 'simulate', 'the', 'fluid', 'dynamics', 'and', 'the', 'advectiondiffusion', 'phenomena', 'in', 'the', 'anode', 'compartment', 'the', 'model', 'is', 'verified', 'on', 'voltage', 'and', 'current', 'outputs', 'of', 'a', 'single', 'mfc', 'derived', 'from', 'laboratory', 'experiments', 'under', 'continuous', 'flow']] | [-0.07411674056346565, 0.07870871920338038, -0.026380071131324814, -0.012845444703265273, -0.009978865735348343, -0.13658256923361112, 0.037002422535848845, 0.36232952055947265, -0.25936507232227296, -0.2809787388284539, 0.0870014847438537, -0.21879771221140326, -0.13207980961170654, 0.24730710104620446, -0.05992295966274286, 0.05480476163414329, 0.03076200608216301, -0.03652967050195087, 0.018062987797099434, -0.18810523137479096, 0.2329281346092737, 0.1149641107334647, 0.34360200297376214, 0.07422248324940646, 0.14353306151839884, -0.04276610632578647, -0.02611934495440056, 0.004338790746908834, -0.13361248989661031, 0.10619924962159621, 0.23492110637197083, 0.0891881106103691, 0.24989156303710716, -0.5264463366204223, -0.2505583701828538, 0.046450862776516944, 0.10542377633540782, 0.09700644718096844, -0.05185197260006973, -0.24790656801255406, 0.05177905195385449, -0.14779777370407715, -0.1142837299690979, -0.03267421738367326, 0.003446281577150027, 0.07509337261981555, -0.2609717208213469, 0.01997694013957945, 0.046750825278861666, 0.03257172379657164, -0.09745900388879254, -0.09149049376967804, -0.040013560471161044, 0.19811249516075008, -0.006965217219355206, -0.03548879521472972, 0.24571757488378662, -0.14819901748452075, -0.10225728284134421, 0.40454613512685134, -0.014890620715973912, -0.19968545354556205, 0.2049270419660205, -0.12609562546361325, -0.04075872800998794, 0.11729014266188466, 0.20976118996104068, 0.08464016932127781, -0.19333968436446533, 0.03537299189659723, 0.028810626733326173, 0.13564531211271996, 0.04064270447715828, -0.018145590850924567, 0.2222148166651758, 0.25956174474238425, 0.014735266925449403, 0.12262803750011579, -0.07970795648663427, -0.10061737140026954, -0.23933389313634515, -0.20591835816498655, -0.12922500261257208, 0.026602190520340043, -0.08228087478611518, -0.1565369155488966, 0.4293724016120383, 0.14808918173648705, 0.1577337380253183, -0.030579563056104347, 0.2998517977521401, 0.06357362684468891, 0.10110509201032362, 0.002830097173853207, 0.20545427910234534, 0.1688883283514847, 0.11529178119827668, -0.28087962794030996, 0.12422488908131801, 0.030230632037386414] |
1,802.07526 | Truncated Euler polynomials | We define a truncated Euler polynomial $E_{m,n}(x)$ as a generalization of
the classical Euler polynomial $E_n(x)$. In this paper we give its some
properties and relations with the hypergeometric Bernoulli polynomial.
| math.NT | we define a truncated euler polynomial e_mnx as a generalization of the classical euler polynomial e_nx in this paper we give its some properties and relations with the hypergeometric bernoulli polynomial | [['we', 'define', 'a', 'truncated', 'euler', 'polynomial', 'e_mnx', 'as', 'a', 'generalization', 'of', 'the', 'classical', 'euler', 'polynomial', 'e_nx', 'in', 'this', 'paper', 'we', 'give', 'its', 'some', 'properties', 'and', 'relations', 'with', 'the', 'hypergeometric', 'bernoulli', 'polynomial']] | [-0.17642034757882358, 0.038152064010500905, -0.16145230885595083, 0.0855492722049045, -0.14578128717839717, -0.11275741832020382, -0.028088751710796108, 0.23049015067517759, -0.40785594979921974, -0.17987225954420866, 0.08555288696661592, -0.19063493371941148, -0.23950683077176413, 0.21091553717851638, -0.0978510269895196, 0.0788138542304902, 0.0007855717403193314, 0.05111776534467936, -0.1807593476337691, -0.35974704201022784, 0.3346745064792534, -0.042436949287851654, 0.08650992448286464, -0.005908095215757688, 0.1679037029389292, -0.058708006019393605, -0.06254255094875892, -0.023878644655148187, -0.22978702550753952, 0.07190152853727341, 0.2659479528044661, 0.08107113554142416, 0.2751531889041265, -0.3779933524007599, -0.057396252065276106, 0.21914720321074127, 0.17387057438803216, 0.0023493824526667597, -0.0006228453790148099, -0.23297098303834599, 0.0680417583634456, -0.24112780611030757, -0.2278721975783507, -0.057190225832164286, -0.002452771707127492, 0.1766051273792982, -0.2550815500319004, 0.04696807796135545, 0.12889219367255766, 0.13264460920909188, 0.021773629973176868, -0.13088184868295988, 0.1139229158560435, 0.0036828836270918447, -0.028929870451490085, 0.0068508842183897896, -0.03235446875914931, -0.16060003041444967, -0.15028587936734158, 0.4168980307877064, -0.0624320903676562, -0.34160327340165775, 0.1029786673684915, -0.1416488611449798, -0.220094935875386, 0.026778051055346926, 0.1165438535157591, 0.13195232537885507, -0.03329798582320412, 0.10670184974054185, -0.2105026311551531, 0.040685934876091776, 0.1647988432707886, 0.016919934873779616, 0.04726057754208644, 0.004005501978099346, 0.021113308146595955, 0.25994401588104665, -0.016103865361462036, -0.10602555628865958, -0.34441410849491755, -0.2714179175905883, -0.1670925975908176, 0.13967394568026065, -0.17681017851718933, -0.2599048415819804, 0.4438133999705315, 0.08224426160838144, 0.16902839864293734, 0.26840047917018334, 0.23213804515544326, 0.23852928873384371, -0.04225970545473198, 0.04263511663302779, 0.06888685490800223, 0.20953146728376548, 0.11438682538767656, -0.15633718393510207, 0.07867020596750081, 0.2726896581239998] |
1,802.07527 | Smooth points in operator spaces and some
Bishop-Phelps-Bollob$\acute{a}$s type theorems in Banach spaces | We introduce the notion of approximate norm attainment set of a bounded
linear operator between Banach spaces and use it to obtain a complete
characterization of smooth points in the space of compact linear operators,
provided the domain space is reflexive and Kadets-Klee. We also apply the
concept to characterize strong BPB property (sBPBp) of a pair of Banach spaces.
We further introduce uniform $ \epsilon- $BPB approximation of a bounded linear
operator and uniform strong BPB property (uniform sBPBp) with respect to a
given family of norm one linear operators and explore some of the relevant
properties to illustrate its connection with earlier studies on
Bishop-Phelps-Bollob$\acute{a}$s type theorems in Banach spaces. It is evident
that our study has deep connections with the study of smooth points in operator
spaces. We obtain a complete characterization of uniform sBPBp for a pair of
Banach spaces, with respect to a given family of norm one bounded linear
operators between them. As the final result of this paper, we prove that if $
\mathbb{X} $ is a reflexive Kadets-Klee Banach space and $ \mathbb{Y} $ is any
Banach space, then the pair $ (\mathbb{X},\mathbb{Y}) $ has sBPBp for compact
operators. Our results extend, complement and improve some of the earlier
results in this context.
| math.FA | we introduce the notion of approximate norm attainment set of a bounded linear operator between banach spaces and use it to obtain a complete characterization of smooth points in the space of compact linear operators provided the domain space is reflexive and kadetsklee we also apply the concept to characterize strong bpb property sbpbp of a pair of banach spaces we further introduce uniform epsilon bpb approximation of a bounded linear operator and uniform strong bpb property uniform sbpbp with respect to a given family of norm one linear operators and explore some of the relevant properties to illustrate its connection with earlier studies on bishopphelpsbollobacuteas type theorems in banach spaces it is evident that our study has deep connections with the study of smooth points in operator spaces we obtain a complete characterization of uniform sbpbp for a pair of banach spaces with respect to a given family of norm one bounded linear operators between them as the final result of this paper we prove that if mathbbx is a reflexive kadetsklee banach space and mathbby is any banach space then the pair mathbbxmathbby has sbpbp for compact operators our results extend complement and improve some of the earlier results in this context | [['we', 'introduce', 'the', 'notion', 'of', 'approximate', 'norm', 'attainment', 'set', 'of', 'a', 'bounded', 'linear', 'operator', 'between', 'banach', 'spaces', 'and', 'use', 'it', 'to', 'obtain', 'a', 'complete', 'characterization', 'of', 'smooth', 'points', 'in', 'the', 'space', 'of', 'compact', 'linear', 'operators', 'provided', 'the', 'domain', 'space', 'is', 'reflexive', 'and', 'kadetsklee', 'we', 'also', 'apply', 'the', 'concept', 'to', 'characterize', 'strong', 'bpb', 'property', 'sbpbp', 'of', 'a', 'pair', 'of', 'banach', 'spaces', 'we', 'further', 'introduce', 'uniform', 'epsilon', 'bpb', 'approximation', 'of', 'a', 'bounded', 'linear', 'operator', 'and', 'uniform', 'strong', 'bpb', 'property', 'uniform', 'sbpbp', 'with', 'respect', 'to', 'a', 'given', 'family', 'of', 'norm', 'one', 'linear', 'operators', 'and', 'explore', 'some', 'of', 'the', 'relevant', 'properties', 'to', 'illustrate', 'its', 'connection', 'with', 'earlier', 'studies', 'on', 'bishopphelpsbollobacuteas', 'type', 'theorems', 'in', 'banach', 'spaces', 'it', 'is', 'evident', 'that', 'our', 'study', 'has', 'deep', 'connections', 'with', 'the', 'study', 'of', 'smooth', 'points', 'in', 'operator', 'spaces', 'we', 'obtain', 'a', 'complete', 'characterization', 'of', 'uniform', 'sbpbp', 'for', 'a', 'pair', 'of', 'banach', 'spaces', 'with', 'respect', 'to', 'a', 'given', 'family', 'of', 'norm', 'one', 'bounded', 'linear', 'operators', 'between', 'them', 'as', 'the', 'final', 'result', 'of', 'this', 'paper', 'we', 'prove', 'that', 'if', 'mathbbx', 'is', 'a', 'reflexive', 'kadetsklee', 'banach', 'space', 'and', 'mathbby', 'is', 'any', 'banach', 'space', 'then', 'the', 'pair', 'mathbbxmathbby', 'has', 'sbpbp', 'for', 'compact', 'operators', 'our', 'results', 'extend', 'complement', 'and', 'improve', 'some', 'of', 'the', 'earlier', 'results', 'in', 'this', 'context']] | [-0.11042167337180064, 0.07205117580462522, -0.07511159254560876, 0.09199536648312849, -0.10098962048917384, -0.07875033191822726, 0.03437921416365399, 0.39298759883480705, -0.3108030614360543, -0.1474792405399792, 0.1310735767904504, -0.26519814074461534, -0.13797008998581928, 0.19383332324145464, -0.13029322522265718, 0.03260438669480961, 0.07220618684633906, 0.07006478525716536, -0.15161787682520272, -0.2582567380374215, 0.4466004660215431, -0.04749367883548787, 0.1978518467389616, 0.054227292186686975, 0.1349078870190335, 0.0262634551285633, -0.03787374244131184, 0.03588193706340005, -0.17649505499630233, 0.16961732158652998, 0.2566080278684867, 0.11594806885085265, 0.3229381616268619, -0.33885142848978345, -0.17049350481872616, 0.21888491008293084, 0.060760240939909164, -0.022064764838289525, -0.04015044641584672, -0.28855530540068897, 0.11086499584572655, -0.13940754398850386, -0.1669587955091566, -0.13084830215322357, 0.034665627501391134, 0.038807857498925714, -0.3283257993864896, -0.005250324138578973, 0.16901882907623433, 0.05850024783772788, -0.11895387449583929, -0.058760940085802904, -0.041017098673458756, 0.06343089277612898, -0.037733484770680586, 0.10720670525571836, 0.03253789493593896, -0.0229773803882466, -0.1315560415605074, 0.3099608833326963, -0.07846022631716111, -0.2510031571203448, 0.1753515671213786, -0.2025610321921668, -0.13168109584429985, 0.04319578668290722, 0.16059931107507697, 0.15989990544326493, -0.0801618602313216, 0.20012784260955957, -0.13333083232956494, 0.11923395052524696, 0.05548878452222189, 0.12573618367211115, 0.07482853448913052, 0.1472400344582504, 0.177599363077175, 0.16714048240875157, 0.03419432662679181, -0.06594815647792704, -0.34579054396048997, -0.17457927727791953, -0.16317297397135513, 0.044878016916456924, -0.11936609293497626, -0.2038967068458499, 0.35491995525826225, 0.05996667197332006, 0.2308838366544599, 0.10709643803692877, 0.208961063060047, 0.09179089647344155, 0.014872853155591953, 0.05397739433201736, 0.19509223535607612, 0.20069400642727836, 0.04974059311195914, -0.11847952871670571, 0.0003009708208293457, 0.18479012996206357] |
1,802.07528 | Learning Integral Representations of Gaussian Processes | We propose a representation of Gaussian processes (GPs) based on powers of
the integral operator defined by a kernel function, we call these stochastic
processes integral Gaussian processes (IGPs). Sample paths from IGPs are
functions contained within the reproducing kernel Hilbert space (RKHS) defined
by the kernel function, in contrast sample paths from the standard GP are not
functions within the RKHS. We develop computationally efficient non-parametric
regression models based on IGPs. The main innovation in our regression
algorithm is the construction of a low dimensional subspace that captures the
information most relevant to explaining variation in the response. We use ideas
from supervised dimension reduction to compute this subspace. The result of
using the construction we propose involves significant improvements in the
computational complexity of estimating kernel hyper-parameters as well as
reducing the prediction variance.
| stat.ML cs.LG | we propose a representation of gaussian processes gps based on powers of the integral operator defined by a kernel function we call these stochastic processes integral gaussian processes igps sample paths from igps are functions contained within the reproducing kernel hilbert space rkhs defined by the kernel function in contrast sample paths from the standard gp are not functions within the rkhs we develop computationally efficient nonparametric regression models based on igps the main innovation in our regression algorithm is the construction of a low dimensional subspace that captures the information most relevant to explaining variation in the response we use ideas from supervised dimension reduction to compute this subspace the result of using the construction we propose involves significant improvements in the computational complexity of estimating kernel hyperparameters as well as reducing the prediction variance | [['we', 'propose', 'a', 'representation', 'of', 'gaussian', 'processes', 'gps', 'based', 'on', 'powers', 'of', 'the', 'integral', 'operator', 'defined', 'by', 'a', 'kernel', 'function', 'we', 'call', 'these', 'stochastic', 'processes', 'integral', 'gaussian', 'processes', 'igps', 'sample', 'paths', 'from', 'igps', 'are', 'functions', 'contained', 'within', 'the', 'reproducing', 'kernel', 'hilbert', 'space', 'rkhs', 'defined', 'by', 'the', 'kernel', 'function', 'in', 'contrast', 'sample', 'paths', 'from', 'the', 'standard', 'gp', 'are', 'not', 'functions', 'within', 'the', 'rkhs', 'we', 'develop', 'computationally', 'efficient', 'nonparametric', 'regression', 'models', 'based', 'on', 'igps', 'the', 'main', 'innovation', 'in', 'our', 'regression', 'algorithm', 'is', 'the', 'construction', 'of', 'a', 'low', 'dimensional', 'subspace', 'that', 'captures', 'the', 'information', 'most', 'relevant', 'to', 'explaining', 'variation', 'in', 'the', 'response', 'we', 'use', 'ideas', 'from', 'supervised', 'dimension', 'reduction', 'to', 'compute', 'this', 'subspace', 'the', 'result', 'of', 'using', 'the', 'construction', 'we', 'propose', 'involves', 'significant', 'improvements', 'in', 'the', 'computational', 'complexity', 'of', 'estimating', 'kernel', 'hyperparameters', 'as', 'well', 'as', 'reducing', 'the', 'prediction', 'variance']] | [-0.023475976190050405, 0.02471997857826543, -0.08903945048908046, 0.12033531069070758, -0.09393623126636479, -0.08021185276790194, 0.04391501433650881, 0.39609127549235434, -0.2938965691762004, -0.2238861442447695, 0.09998827452963109, -0.2420382276382845, -0.19918104341965825, 0.19831293412854017, -0.10498341106850763, 0.09333006715871092, 0.059406792823745704, -0.019279355957063243, -0.09037139620768893, -0.24790837011738298, 0.35342433072657836, 0.07310938903623644, 0.2671869327793555, -0.05109809525995789, 0.16706705394351637, 0.06321890243527699, -0.09249234626151841, -0.05520338794881622, -0.10082701429826771, 0.17742142974919475, 0.29918206160535943, 0.17374654419836588, 0.3408274198608363, -0.38152058562723945, -0.24403552001518514, 0.15356919879388228, 0.14133818544124713, 0.048192238746731376, 0.012170053641859661, -0.240846092805869, -0.0029667343444410056, -0.1278983495259822, -0.06971132513546549, -0.12844492975786767, -0.04986050854409661, 0.017341826679458952, -0.2916489434188834, 0.09548424221301342, 0.05587107483691344, 0.040430156945470065, -0.05746349206995493, -0.16967977910398452, 0.04999710721141823, 0.06419659811602768, 0.0004574260999695124, 0.05293944552249741, 0.14520026922892773, -0.10798182790339898, -0.13708594626993598, 0.30570814034367416, -0.11085182488065637, -0.25179453713216765, 0.17337940592551604, -0.13509163152946926, -0.132099463710534, 0.1148272792890887, 0.21978583356694265, 0.1047932866769021, -0.1678469419677961, 0.1429585948749531, -0.032461773587034684, 0.10808278329204768, 0.00445760295877014, 0.03306379683165099, 0.08167361947252015, 0.20304159936495125, 0.07282077747239622, 0.15161945273661437, -0.10024608186829616, -0.11826234993607025, -0.32011315026594434, -0.14853747111363405, -0.24137299129848971, -0.005617198268844411, -0.15139950169524288, -0.20778223506846083, 0.3968065110761124, 0.1603460607220768, 0.258637603451087, 0.11279870782677523, 0.3135908106341958, 0.16205051294716266, 0.10622041988159146, 0.13019367919289782, 0.1271767835423816, 0.11570874768007985, 0.017874470042229137, -0.16174676984647865, 0.11315246335374575, 0.13502053457983387] |
1,802.07529 | Algorithms and Convergence Results of Projection Methods for
Inconsistent Feasibility Problems: A Review | The convex feasibility problem (CFP) is to find a feasible point in the
intersection of finitely many convex and closed sets. If the intersection is
empty then the CFP is inconsistent and a feasible point does not exist.
However, algorithmic research of inconsistent CFPs exists and is mainly focused
on two directions. One is oriented toward defining other solution concepts that
will apply, such as proximity function minimization wherein a proximity
function measures in some way the total violation of all constraints. The
second direction investigates the behavior of algorithms that are designed to
solve a consistent CFP when applied to inconsistent problems. This direction is
fueled by situations wherein one lacks a priori information about the
consistency or inconsistency of the CFP or does not wish to invest
computational resources to get hold of such knowledge prior to running his
algorithm. In this paper we bring under one roof and telegraphically review
some recent works on inconsistent CFPs.
| math.OC | the convex feasibility problem cfp is to find a feasible point in the intersection of finitely many convex and closed sets if the intersection is empty then the cfp is inconsistent and a feasible point does not exist however algorithmic research of inconsistent cfps exists and is mainly focused on two directions one is oriented toward defining other solution concepts that will apply such as proximity function minimization wherein a proximity function measures in some way the total violation of all constraints the second direction investigates the behavior of algorithms that are designed to solve a consistent cfp when applied to inconsistent problems this direction is fueled by situations wherein one lacks a priori information about the consistency or inconsistency of the cfp or does not wish to invest computational resources to get hold of such knowledge prior to running his algorithm in this paper we bring under one roof and telegraphically review some recent works on inconsistent cfps | [['the', 'convex', 'feasibility', 'problem', 'cfp', 'is', 'to', 'find', 'a', 'feasible', 'point', 'in', 'the', 'intersection', 'of', 'finitely', 'many', 'convex', 'and', 'closed', 'sets', 'if', 'the', 'intersection', 'is', 'empty', 'then', 'the', 'cfp', 'is', 'inconsistent', 'and', 'a', 'feasible', 'point', 'does', 'not', 'exist', 'however', 'algorithmic', 'research', 'of', 'inconsistent', 'cfps', 'exists', 'and', 'is', 'mainly', 'focused', 'on', 'two', 'directions', 'one', 'is', 'oriented', 'toward', 'defining', 'other', 'solution', 'concepts', 'that', 'will', 'apply', 'such', 'as', 'proximity', 'function', 'minimization', 'wherein', 'a', 'proximity', 'function', 'measures', 'in', 'some', 'way', 'the', 'total', 'violation', 'of', 'all', 'constraints', 'the', 'second', 'direction', 'investigates', 'the', 'behavior', 'of', 'algorithms', 'that', 'are', 'designed', 'to', 'solve', 'a', 'consistent', 'cfp', 'when', 'applied', 'to', 'inconsistent', 'problems', 'this', 'direction', 'is', 'fueled', 'by', 'situations', 'wherein', 'one', 'lacks', 'a', 'priori', 'information', 'about', 'the', 'consistency', 'or', 'inconsistency', 'of', 'the', 'cfp', 'or', 'does', 'not', 'wish', 'to', 'invest', 'computational', 'resources', 'to', 'get', 'hold', 'of', 'such', 'knowledge', 'prior', 'to', 'running', 'his', 'algorithm', 'in', 'this', 'paper', 'we', 'bring', 'under', 'one', 'roof', 'and', 'telegraphically', 'review', 'some', 'recent', 'works', 'on', 'inconsistent', 'cfps']] | [-0.12875964243961144, 0.021210747626551157, -0.0858282333570002, 0.08177504713036993, -0.14884604505098226, -0.16152810218119168, 0.06936082559051228, 0.38774545256732196, -0.28156907858822167, -0.2584737747011683, 0.14608556176078966, -0.2859502197302218, -0.11348093869282475, 0.17485648131328105, -0.14590081933862234, 0.0516134525503362, 0.04296329485759422, 0.04446720270605027, -0.07185241946386162, -0.25213199027790395, 0.33411194655537324, 0.008239411460117826, 0.2884829213188466, 0.07468834623828519, 0.08093184870490923, -0.019724038650600028, -0.026307573320957112, 0.07542972654528633, -0.10056908685270818, 0.13819101553106727, 0.28886699807370386, 0.22390431658470933, 0.3319061520698044, -0.4449675001817036, -0.1801126312429109, 0.14310679223559372, 0.1471211026876552, 0.07442085089934164, -0.04529034090817823, -0.20402185229254485, 0.07045815205732006, -0.10494354213411107, -0.14166857402541827, -0.03840862044215768, 0.017531681455129497, 0.0013956281811859507, -0.25153262138107346, 0.022732180480983792, 0.06773085117817539, 0.030257391547371598, -0.04394751165616267, -0.11583838352485548, 0.02782923899166569, 0.10075118377030373, 0.08414895117836946, 0.08116763323483564, 0.11536979907534167, -0.09509800864410103, -0.13437496825074188, 0.40571246027380603, 0.01089288985733933, -0.22519584119178448, 0.198235672272674, -0.11939002368805482, -0.1817997875498148, 0.10464711905209513, 0.12969662723591244, 0.12778481950429327, -0.15799377733280462, 0.09487142730828468, -0.07290672082336078, 0.1472906623867523, 0.059123803064215316, 0.012696212766208697, 0.19795930636103584, 0.1286604427953569, 0.1459432304129476, 0.10825090534738972, -0.013387450243971205, -0.1224278585655214, -0.29631754759805207, -0.12402295380170587, -0.19875648598955897, 0.02265242771617626, -0.009890920904397233, -0.15509918303806572, 0.3340049957004788, 0.170808176938857, 0.18672548891398819, 0.03286532311600079, 0.3208170364385388, 0.06856992580527085, 0.043384515354336135, 0.09750966151846172, 0.23139695832071105, 0.0654294254535314, 0.055720103598093686, -0.16736803138816486, 0.13747456504247163, 0.026043845387765125] |
1,802.0753 | Topological phase transitions in tilted optical lattices | We analyze the energy spectrum and eigenstates of cold atoms in a tilted
brick-wall optical lattice. When the tilt is applied, the system exhibits a
sequence of topological phase transitions reflected in an abrupt change of the
eigenstates. It is demonstrated that these topological phase transitions can be
easily detected in a laboratory experiment by observing Bloch oscillations of
cold atoms.
| cond-mat.quant-gas cond-mat.mes-hall quant-ph | we analyze the energy spectrum and eigenstates of cold atoms in a tilted brickwall optical lattice when the tilt is applied the system exhibits a sequence of topological phase transitions reflected in an abrupt change of the eigenstates it is demonstrated that these topological phase transitions can be easily detected in a laboratory experiment by observing bloch oscillations of cold atoms | [['we', 'analyze', 'the', 'energy', 'spectrum', 'and', 'eigenstates', 'of', 'cold', 'atoms', 'in', 'a', 'tilted', 'brickwall', 'optical', 'lattice', 'when', 'the', 'tilt', 'is', 'applied', 'the', 'system', 'exhibits', 'a', 'sequence', 'of', 'topological', 'phase', 'transitions', 'reflected', 'in', 'an', 'abrupt', 'change', 'of', 'the', 'eigenstates', 'it', 'is', 'demonstrated', 'that', 'these', 'topological', 'phase', 'transitions', 'can', 'be', 'easily', 'detected', 'in', 'a', 'laboratory', 'experiment', 'by', 'observing', 'bloch', 'oscillations', 'of', 'cold', 'atoms']] | [-0.19468225389108307, 0.28914705542756863, -0.08321134726990198, 0.026711243284927286, 0.016795759654191673, -0.12942052295920056, 0.065943681820082, 0.39667827697073826, -0.2767650211978032, -0.27049507154915176, 0.04826206296537316, -0.29985558769864135, -0.12011253568114805, 0.13125480674817913, 0.011892839426510647, 0.02573456567307537, 0.052546370408085526, -0.024218935019443513, -0.07347266120668196, -0.16290875632682297, 0.253039495347709, 0.04097349927226295, 0.2747627945586306, 0.011625952931830934, 0.02966526565981693, -0.06268791380323104, 0.09382357298717146, 0.010726442102526055, -0.08416619068896684, 0.024122353334487492, 0.24835130150933735, 0.00741653385587403, 0.13845397614431185, -0.4261312234200171, -0.21349216776243488, 0.11304583861568912, 0.15768119254622792, 0.152461681530246, -0.07863741631421153, -0.36537848980944665, -0.05620237361242781, -0.12013313437422707, -0.14377097042704948, -0.09178952454421364, 0.0225195403165016, -0.001031361779839289, -0.2292954645684508, 0.07531755028262002, 0.027319038744832647, 0.10457369903499475, -0.07966937607184785, -0.008965933892005657, -0.06108625093474984, 0.05109202803625939, -0.02659517277764981, 0.017443839521681676, 0.14399249995982305, -0.06679235792673024, -0.10151517949998379, 0.4331442234640727, -0.10979758815641408, -0.08961067408262217, 0.1488965425476218, -0.20276543691174173, -0.0674510091604268, 0.17945727251744906, 0.11297774840085233, 0.06034822075734617, -0.07976183470564734, 0.05731093958230139, -0.024927277957684683, 0.19985595689781133, 0.07272684785201534, 0.044061330490608196, 0.2980025502104984, 0.1379013722266269, 0.051619414100805144, 0.2074720900883654, -0.12467124881070168, -0.10485977420705508, -0.24285878760159993, -0.16747962084949994, -0.26222881989278757, 0.03400429470281376, -0.019982958219890087, -0.15010509209432563, 0.47342447170102203, 0.11614227731574754, 0.20968703331700603, -0.10844145316752743, 0.2554599273278088, 0.17290382990308228, 0.04395139783040666, 0.004863697607986262, 0.3111097156757214, 0.11773454480743432, 0.11583123719472377, -0.296055112415772, 0.0003975143228642276, 0.013130510271694816] |
1,802.07531 | Phonon mode softening and elastic properties of hafnium under pressure | The effect of pressure on the zone-center optical phonon modes and the
elastic properties of hafnium has been studied by both experimental (Raman
scattering) and theoretical (DFT) approaches. It was found an anomaly
dependence of the phonon frequency of E$_{2g}$ mode in the pressure range from
0 to 67 GPa. The calculated electronic structure of hafnium shows significant
changes under pressure, which have a pronounced spatial anisotropy similar to
the anisotropy of the observed phonon properties. The dependencies of the
elastic properties on pressure including the components of the elasticity
tensor, bulk and shear modulus, Poisson ratio and Universal anisotropy index
obtained during the calculations has characteristic features indicating the
occurrence of the structural phase transition.
| cond-mat.mtrl-sci | the effect of pressure on the zonecenter optical phonon modes and the elastic properties of hafnium has been studied by both experimental raman scattering and theoretical dft approaches it was found an anomaly dependence of the phonon frequency of e_2g mode in the pressure range from 0 to 67 gpa the calculated electronic structure of hafnium shows significant changes under pressure which have a pronounced spatial anisotropy similar to the anisotropy of the observed phonon properties the dependencies of the elastic properties on pressure including the components of the elasticity tensor bulk and shear modulus poisson ratio and universal anisotropy index obtained during the calculations has characteristic features indicating the occurrence of the structural phase transition | [['the', 'effect', 'of', 'pressure', 'on', 'the', 'zonecenter', 'optical', 'phonon', 'modes', 'and', 'the', 'elastic', 'properties', 'of', 'hafnium', 'has', 'been', 'studied', 'by', 'both', 'experimental', 'raman', 'scattering', 'and', 'theoretical', 'dft', 'approaches', 'it', 'was', 'found', 'an', 'anomaly', 'dependence', 'of', 'the', 'phonon', 'frequency', 'of', 'e_2g', 'mode', 'in', 'the', 'pressure', 'range', 'from', '0', 'to', '67', 'gpa', 'the', 'calculated', 'electronic', 'structure', 'of', 'hafnium', 'shows', 'significant', 'changes', 'under', 'pressure', 'which', 'have', 'a', 'pronounced', 'spatial', 'anisotropy', 'similar', 'to', 'the', 'anisotropy', 'of', 'the', 'observed', 'phonon', 'properties', 'the', 'dependencies', 'of', 'the', 'elastic', 'properties', 'on', 'pressure', 'including', 'the', 'components', 'of', 'the', 'elasticity', 'tensor', 'bulk', 'and', 'shear', 'modulus', 'poisson', 'ratio', 'and', 'universal', 'anisotropy', 'index', 'obtained', 'during', 'the', 'calculations', 'has', 'characteristic', 'features', 'indicating', 'the', 'occurrence', 'of', 'the', 'structural', 'phase', 'transition']] | [-0.14309919185952508, 0.17608991877593858, -0.11620431029637232, -0.0392901517595325, -0.047856663040624095, -0.044977483223192394, 0.04660571291480727, 0.3980518951690916, -0.310956132244961, -0.2720952727189609, 0.00759319726132852, -0.3249415661738222, -0.13778762143490517, 0.15839649889224755, 0.0937025230297626, 0.08394179263017702, -0.0313849268663787, 0.020814350408758838, -0.09027194187591045, -0.15119458778644912, 0.2701869874405835, 0.08936553344066286, 0.3942578401223853, 0.12023427038090223, 0.044442165867778764, -0.01466355412186862, 0.045585663740298356, 0.03931656906959312, -0.17991740501622253, 0.03817537717140081, 0.22752311873924116, -0.08743893687015175, 0.18216647206331957, -0.40305450532970755, -0.2709259727873422, 0.00974609604675387, 0.07198852693846707, 0.08322358279436795, -0.024353328957784408, -0.22761847113323366, 0.05157540069796659, -0.0997692366243051, -0.10644102943077652, -0.09399897688126657, 0.041702553376972935, -0.00044312545676426643, -0.20789549256131004, 0.17477518636412148, 0.03495028687657082, 0.13259111664498552, -0.17876018260220258, -0.1841200774350878, -0.09789664008863398, 0.044140694578627834, 0.11517117154415182, -0.009486309848806083, 0.19879557160612452, -0.1030416623448375, -0.06286350402435095, 0.41700284910420404, -0.06960446287974201, -0.04307501801642878, 0.1683560646608761, -0.16461375779733223, -0.09301529373122572, 0.21261833260510246, 0.1289522570802766, 0.03705989160366228, -0.09525211423119642, 0.068453873738502, 0.05150720419498674, 0.20167759156199813, 0.09384737938144726, 0.06564499370769822, 0.170066434717416, 0.1391892850696077, -0.0522901201786916, 0.13970102621483263, -0.1587934565232617, 0.0035280903303546124, -0.21696009551142825, -0.11916776580719984, -0.1731732751958871, 0.023290360091527088, -0.1402640458721274, -0.20096823529757815, 0.4164093651985428, 0.07085613209497311, 0.17847279818871076, -0.029998082178845552, 0.2488127521987892, 0.13314799024675297, 0.11118354378187836, 0.03503511986968204, 0.34977541465697615, 0.2360966016462169, 0.1228449222037633, -0.3403895183502504, 0.11540636905982833, -0.028025634618925637] |
1,802.07532 | Measurements of the global 21-cm signal from the Cosmic Dawn | The sky-averaged (global) 21-cm signal is a very promising probe of the
Cosmic Dawn, when the first luminous sources were formed and started to shine
in a substantially neutral intergalactic medium. I here report on the status
and early result of the Large-Aperture Experiment to Detect the Dark Age that
focuses on observations of the global 21-cm signal in the $16 \lesssim z
\lesssim 30$ range.
| astro-ph.CO | the skyaveraged global 21cm signal is a very promising probe of the cosmic dawn when the first luminous sources were formed and started to shine in a substantially neutral intergalactic medium i here report on the status and early result of the largeaperture experiment to detect the dark age that focuses on observations of the global 21cm signal in the 16 lesssim z lesssim 30 range | [['the', 'skyaveraged', 'global', '21cm', 'signal', 'is', 'a', 'very', 'promising', 'probe', 'of', 'the', 'cosmic', 'dawn', 'when', 'the', 'first', 'luminous', 'sources', 'were', 'formed', 'and', 'started', 'to', 'shine', 'in', 'a', 'substantially', 'neutral', 'intergalactic', 'medium', 'i', 'here', 'report', 'on', 'the', 'status', 'and', 'early', 'result', 'of', 'the', 'largeaperture', 'experiment', 'to', 'detect', 'the', 'dark', 'age', 'that', 'focuses', 'on', 'observations', 'of', 'the', 'global', '21cm', 'signal', 'in', 'the', '16', 'lesssim', 'z', 'lesssim', '30', 'range']] | [-0.07991555711707791, 0.16678624260098193, -0.03373819808334564, 0.06374434232764709, -0.09637520165591867, -0.05817871399675355, 0.02472012616327089, 0.3536924842293515, -0.15936156727768708, -0.35188944929872046, 0.11844148937344665, -0.3185765132463227, -0.031337158218251934, 0.17652105318974823, 0.06743302449555785, -0.048542093838367495, 0.013127667208512625, -0.07305001511210293, -0.018085993004426586, -0.27067625340229523, 0.25155361434162565, 0.17143876485837004, 0.22783299642050583, 0.036229865456169304, 0.09615506027176073, -0.08027584151590639, -0.15546098597009073, -0.07754809302136753, -0.1326861405560163, 0.01860615143651199, 0.23274958167563786, 0.198521339542684, 0.21003973636790318, -0.410024757666344, -0.1877173984310392, 0.13845417042488628, 0.17166971360954145, 0.07328300858198693, -0.10458262864796614, -0.3537827639163218, 0.09104839270708687, -0.1214691887214554, -0.12163631031007478, 0.0924942052894921, 0.013284679445804972, 0.004473738195939046, -0.20724512643011456, 0.10587942684210386, -0.025184200117082306, 0.05246233071419269, -0.07161381392683269, -0.09961617845075318, 0.02132646996302135, 0.040659980194477335, 0.01114222011881683, 0.09986872031268748, 0.21089366031105095, -0.19452192004995816, -0.003663386641578241, 0.3953788132322105, -0.17423780082555657, 0.0570572739410581, 0.1950750696105939, -0.2604668361529934, -0.2186682196686778, 0.13715447764843702, 0.2155418378780737, 0.10767400817183609, -0.14003412495830245, 0.038549275051054516, 0.018395744193571085, 0.2425221326111844, 0.01695103267433517, 0.06388259510453226, 0.305911442956351, 0.1636526596513718, 0.08009500441204925, 0.038035605808324886, -0.21569027366631693, 0.04042621609529085, -0.2559834738971073, -0.1275514496885466, -0.13361144566442817, 0.1280071993471321, -0.08727492660127058, -0.037081294431118295, 0.3999470141292973, 0.18926743197847495, 0.22810775024647062, 0.015770395547433785, 0.3227562933708682, 0.017475323116576128, 0.020839397837831217, 0.02366952490498961, 0.38111678127086523, 0.15259797930731578, 0.1630552390618532, -0.16881060480337703, 0.060596030390694396, -0.044281027731344555] |
1,802.07533 | Variational solutions to nonlinear stochastic differential equations in
Hilbert spaces | One introduces a new variational concept of solution for the stochastic
differential equation $dX+A(t)X\,dt+\lambda X\,dt=X\,dW,$ $t\in(0,T)$; $X(0)=x$
in a real Hilbert space where $A(t)=\partial\varphi(t)$, $t\in(0,T)$, is a
maximal monotone subpotential operator in $H$ while $W$ is a Wiener process in
$H$ on a probability space $\{\Omega,\mathcal{F},\mathbb{P}\}$. In this new
context, the solution $X=X(t,x)$ exists for each $x\in H$, is unique, and
depends continuously on $x$. This functional scheme applies to a general class
of stochastic PDE not covered by the classical variational existence theory
([15], [16], [17]) and, in particular, to stochastic variational inequalities
and parabolic stochastic equations with general monotone nonlinearities with
low or superfast growth to $+\infty$.
| math.PR | one introduces a new variational concept of solution for the stochastic differential equation dxatxdtlambda xdtxdw tin0t x0x in a real hilbert space where atpartialvarphit tin0t is a maximal monotone subpotential operator in h while w is a wiener process in h on a probability space omegamathcalfmathbbp in this new context the solution xxtx exists for each xin h is unique and depends continuously on x this functional scheme applies to a general class of stochastic pde not covered by the classical variational existence theory 15 16 17 and in particular to stochastic variational inequalities and parabolic stochastic equations with general monotone nonlinearities with low or superfast growth to infty | [['one', 'introduces', 'a', 'new', 'variational', 'concept', 'of', 'solution', 'for', 'the', 'stochastic', 'differential', 'equation', 'dxatxdtlambda', 'xdtxdw', 'tin0t', 'x0x', 'in', 'a', 'real', 'hilbert', 'space', 'where', 'atpartialvarphit', 'tin0t', 'is', 'a', 'maximal', 'monotone', 'subpotential', 'operator', 'in', 'h', 'while', 'w', 'is', 'a', 'wiener', 'process', 'in', 'h', 'on', 'a', 'probability', 'space', 'omegamathcalfmathbbp', 'in', 'this', 'new', 'context', 'the', 'solution', 'xxtx', 'exists', 'for', 'each', 'xin', 'h', 'is', 'unique', 'and', 'depends', 'continuously', 'on', 'x', 'this', 'functional', 'scheme', 'applies', 'to', 'a', 'general', 'class', 'of', 'stochastic', 'pde', 'not', 'covered', 'by', 'the', 'classical', 'variational', 'existence', 'theory', '15', '16', '17', 'and', 'in', 'particular', 'to', 'stochastic', 'variational', 'inequalities', 'and', 'parabolic', 'stochastic', 'equations', 'with', 'general', 'monotone', 'nonlinearities', 'with', 'low', 'or', 'superfast', 'growth', 'to', 'infty']] | [-0.10356936356318848, 0.09555648030890596, -0.026418957779450077, 0.0471849618341886, -0.10402834445371159, -0.1850480614762221, 0.02423053571533057, 0.2920512593528699, -0.334268408375127, -0.20270218999967687, 0.1167195391370028, -0.2874630635515565, -0.14406577517455887, 0.1921683912365032, -0.11250416804881146, 0.0937211829814173, 0.03725346027252575, 0.03527135630803449, -0.0812105627553094, -0.21361658175786336, 0.33789182092905756, -0.07481148828353201, 0.20501161502851617, -0.008300484131489481, 0.18414929129538082, 0.01355208667837793, 0.0019460336793036689, 0.01124987094829391, -0.183449722143511, 0.0888108789543843, 0.24632146686005096, 0.1070856021672842, 0.3845956196387609, -0.35351438206576163, -0.20922894640160458, 0.13156297043231982, 0.10355819678266666, 0.022947393603889005, -0.05074902554707868, -0.27094264016264963, 0.05070336720063573, -0.11609073116754492, -0.16066721855618415, -0.03733143087232574, 0.05682608837572237, 0.04769942511227869, -0.3584255160896906, 0.09289753569423088, 0.07489974480454943, -0.009748191819969741, -0.05225401071920281, -0.06899807483090886, -0.03723946051738624, -0.025216223953646564, -0.044087232259334995, 0.09688276538093175, 0.04923156774824574, -0.06199434962833211, -0.09228568594636662, 0.32317188715650924, -0.14703693508691643, -0.29793419823760076, 0.1397031365893781, -0.17679532576086265, -0.1868851120716759, 0.15287594776157112, 0.16197289270127102, 0.1945549007150389, -0.16243881726903575, 0.21683034510213128, -0.04942408370386277, 0.12201626034054373, 0.04282786548137665, -0.005313286028935441, 0.02946550062014943, 0.16021593114849003, 0.19617521882589375, 0.08873932958979691, -0.019681664197040455, -0.15035449521882194, -0.3635228238822449, -0.19774056755538497, -0.1420522022327142, 0.1228386966512993, -0.120626337697225, -0.19655944877969367, 0.3176635786260054, 0.04011640938919126, 0.16751364952928963, 0.05561557590872759, 0.1937944631391604, 0.19795265659867298, -0.021506061103372345, 0.08667805246160631, 0.15861590746346685, 0.17175853783043013, 0.12612217782686155, -0.1517398836822914, 0.05274883114644104, 0.15518610300274477] |
1,802.07534 | Uniqueness of DRS as the 2 Operator Resolvent-Splitting and
Impossibility of 3 Operator Resolvent-Splitting | Given the success of Douglas--Rachford splitting (DRS), it is natural to ask
whether DRS can be generalized. Are there other 2 operator resolvent-splittings
sharing the favorable properties of DRS? Can DRS be generalized to 3 operators?
This work presents the answers: no and no. In a certain sense, DRS is the
unique 2 operator resolvent-splitting, and generalizing DRS to 3 operators is
impossible without lifting, where lifting roughly corresponds to enlarging the
problem size. The impossibility result further raises a question. How much
lifting is necessary to generalize DRS to 3 operators? This work presents the
answer by providing a novel 3 operator resolvent-splitting with provably
minimal lifting that directly generalizes DRS.
| math.OC | given the success of douglasrachford splitting drs it is natural to ask whether drs can be generalized are there other 2 operator resolventsplittings sharing the favorable properties of drs can drs be generalized to 3 operators this work presents the answers no and no in a certain sense drs is the unique 2 operator resolventsplitting and generalizing drs to 3 operators is impossible without lifting where lifting roughly corresponds to enlarging the problem size the impossibility result further raises a question how much lifting is necessary to generalize drs to 3 operators this work presents the answer by providing a novel 3 operator resolventsplitting with provably minimal lifting that directly generalizes drs | [['given', 'the', 'success', 'of', 'douglasrachford', 'splitting', 'drs', 'it', 'is', 'natural', 'to', 'ask', 'whether', 'drs', 'can', 'be', 'generalized', 'are', 'there', 'other', '2', 'operator', 'resolventsplittings', 'sharing', 'the', 'favorable', 'properties', 'of', 'drs', 'can', 'drs', 'be', 'generalized', 'to', '3', 'operators', 'this', 'work', 'presents', 'the', 'answers', 'no', 'and', 'no', 'in', 'a', 'certain', 'sense', 'drs', 'is', 'the', 'unique', '2', 'operator', 'resolventsplitting', 'and', 'generalizing', 'drs', 'to', '3', 'operators', 'is', 'impossible', 'without', 'lifting', 'where', 'lifting', 'roughly', 'corresponds', 'to', 'enlarging', 'the', 'problem', 'size', 'the', 'impossibility', 'result', 'further', 'raises', 'a', 'question', 'how', 'much', 'lifting', 'is', 'necessary', 'to', 'generalize', 'drs', 'to', '3', 'operators', 'this', 'work', 'presents', 'the', 'answer', 'by', 'providing', 'a', 'novel', '3', 'operator', 'resolventsplitting', 'with', 'provably', 'minimal', 'lifting', 'that', 'directly', 'generalizes', 'drs']] | [-0.12465906607140916, 0.10787623371382099, -0.04982354821756892, 0.11599885552925049, -0.17901736694610243, -0.20525318081277089, 0.05417749627254083, 0.32586266592021074, -0.33519588823968527, -0.3082979622237179, 0.11642545924165261, -0.22230365526341245, -0.16620654291302445, 0.161319823833097, -0.16116370463214064, 0.054659429450579194, 0.08753303684499286, 0.014811853852567322, -0.09675710338783032, -0.24464908632163573, 0.3867681676056236, 0.0432441152158031, 0.21077616201764945, 0.1249870313972303, 0.0848145142898237, 0.019625874680526758, -0.013326428531575094, -0.014191412157592696, -0.07837489609818302, 0.13767219353371105, 0.3071734688454094, 0.2041182048499174, 0.3134260178808499, -0.34066361096610714, -0.14162300353647644, 0.15520746718318876, 0.1518292101057366, 0.09987892874371294, -0.030983550773096193, -0.19580978062217458, 0.15457554867730364, -0.11663408964923626, -0.15088991408552463, -0.0857144576078708, -0.02551348094717352, -0.0689700300679243, -0.29681487364369796, 0.01483216495124982, 0.16366674697214584, 0.040635683795932784, -0.054650829165080274, -0.07843985692213434, 0.0077455006112609436, 0.09635786107664399, 0.023733753640820587, 0.08411547557425199, 0.04226507717068521, -0.04508406004586488, -0.13922733382787555, 0.36265927197736336, -0.03553245284961998, -0.22943383333521014, 0.16265819452856795, -0.10644586161932472, -0.11748429872159667, 0.07757011551939703, 0.08085852343196032, 0.12897449463537528, -0.1519425269985281, 0.10194036251664537, -0.11770086871767672, 0.14193505963840342, 0.1380540213479293, 0.04085113950994361, 0.07407621988052622, 0.09950883259757533, 0.20838363905685073, 0.12930687886573067, 0.025078464060201557, -0.0684025312620087, -0.26014305372645546, -0.16508516409314758, -0.11073696032303189, 0.07421536281610916, -0.0195605729131451, -0.07982404661843331, 0.4112206042035047, 0.16531075040570573, 0.23342127203428692, 0.06555366639150392, 0.2904613582297749, 0.17242318633602027, 0.14424629436822933, 0.12117759060860107, 0.19539485023134823, 0.11133769892557703, 0.072574093032184, -0.2031437294608956, 0.04912120142071551, 0.1310582534674931] |
1,802.07535 | BRUNO: A Deep Recurrent Model for Exchangeable Data | We present a novel model architecture which leverages deep learning tools to
perform exact Bayesian inference on sets of high dimensional, complex
observations. Our model is provably exchangeable, meaning that the joint
distribution over observations is invariant under permutation: this property
lies at the heart of Bayesian inference. The model does not require variational
approximations to train, and new samples can be generated conditional on
previous samples, with cost linear in the size of the conditioning set. The
advantages of our architecture are demonstrated on learning tasks that require
generalisation from short observed sequences while modelling sequence
variability, such as conditional image generation, few-shot learning, and
anomaly detection.
| stat.ML | we present a novel model architecture which leverages deep learning tools to perform exact bayesian inference on sets of high dimensional complex observations our model is provably exchangeable meaning that the joint distribution over observations is invariant under permutation this property lies at the heart of bayesian inference the model does not require variational approximations to train and new samples can be generated conditional on previous samples with cost linear in the size of the conditioning set the advantages of our architecture are demonstrated on learning tasks that require generalisation from short observed sequences while modelling sequence variability such as conditional image generation fewshot learning and anomaly detection | [['we', 'present', 'a', 'novel', 'model', 'architecture', 'which', 'leverages', 'deep', 'learning', 'tools', 'to', 'perform', 'exact', 'bayesian', 'inference', 'on', 'sets', 'of', 'high', 'dimensional', 'complex', 'observations', 'our', 'model', 'is', 'provably', 'exchangeable', 'meaning', 'that', 'the', 'joint', 'distribution', 'over', 'observations', 'is', 'invariant', 'under', 'permutation', 'this', 'property', 'lies', 'at', 'the', 'heart', 'of', 'bayesian', 'inference', 'the', 'model', 'does', 'not', 'require', 'variational', 'approximations', 'to', 'train', 'and', 'new', 'samples', 'can', 'be', 'generated', 'conditional', 'on', 'previous', 'samples', 'with', 'cost', 'linear', 'in', 'the', 'size', 'of', 'the', 'conditioning', 'set', 'the', 'advantages', 'of', 'our', 'architecture', 'are', 'demonstrated', 'on', 'learning', 'tasks', 'that', 'require', 'generalisation', 'from', 'short', 'observed', 'sequences', 'while', 'modelling', 'sequence', 'variability', 'such', 'as', 'conditional', 'image', 'generation', 'fewshot', 'learning', 'and', 'anomaly', 'detection']] | [-0.028578459630133928, 0.01546268735115451, -0.08946606950107876, 0.0674641138100048, -0.13225576212560688, -0.14332199738257462, 0.035045848477036796, 0.4465542142796848, -0.2924172152825459, -0.3225055997458252, 0.0752043176250515, -0.2300889945278565, -0.16153271040551503, 0.18781681616437035, -0.14268203261653306, 0.11164260495786073, 0.14098087996158196, 0.03722183721967869, -0.07133504305373342, -0.2547169871222987, 0.2771426528828063, 0.04000944462017354, 0.36874617664660847, -0.04015670242747378, 0.1783605252082149, 0.014136893743718112, -0.01033326718714778, -0.023250567889556772, -0.0589790079052532, 0.16547195648740012, 0.29097509122005216, 0.24035429806207065, 0.318591735925077, -0.38760371571751656, -0.26579667777857846, 0.11597008257727053, 0.1312673906925031, 0.0923551737893528, -0.02828892253886874, -0.3014904094430946, 0.07526029407529643, -0.1473573091196293, 0.008311135478800646, -0.1602321176776766, -0.058744197711348534, 0.006492595558585081, -0.3320895239788418, 0.06960635472097676, 0.09992389143789532, 0.07204194422687309, -0.018470138406243036, -0.11945840853473379, 0.036581139133044484, 0.09434307879268157, 0.023313640367834725, 0.03314830536126263, 0.12314714664211755, -0.12853640235866973, -0.15445459942889606, 0.29825178332868274, -0.05207576213783964, -0.20194891945424456, 0.21308073578445516, -0.07524776066377482, -0.2326998503822661, 0.1143743514980155, 0.212835765581716, 0.13803290772355264, -0.1377504768833104, 0.05989988119647562, -0.05543462878645018, 0.19313163376689232, -0.0029654773555833984, -0.004330801928450388, 0.2094151001430065, 0.24697217100334387, 0.04352630458392755, 0.1202949091411601, -0.1502650840643414, -0.10021259347666744, -0.27946706885402955, -0.08203629662252583, -0.22940955349002723, 0.029408695743364258, -0.10258666324160812, -0.19296080102881039, 0.37879439988346014, 0.23425388851588919, 0.2098081236881963, 0.18504365389256877, 0.33030402867330444, 0.07538830046555463, 0.1047324430147893, 0.08818693944528976, 0.15204106152695776, 0.08022175770666864, 0.04272156209939298, -0.14418858634652915, 0.13989403876217288, 0.054932682470987655] |
1,802.07536 | Rotating effects on the scalar field in the cosmic string spacetime, in
the spacetime with space-like dislocation and in the spacetime with a spiral
dislocation | In the interface between general relativity and relativistic quantum
mechanics, we analyse rotating effects on the scalar field subject to a
hard-wall confining potential. We consider three different scenarios of general
relativity given by the cosmic string spacetime, the spacetime with space-like
dislocation and the spacetime with a spiral dislocation. Then, by searching for
a discrete spectrum of energy, we analyse analogues effects of the
Aharonov-Bohm effect for bound states and the Sagnac effect.
| gr-qc quant-ph | in the interface between general relativity and relativistic quantum mechanics we analyse rotating effects on the scalar field subject to a hardwall confining potential we consider three different scenarios of general relativity given by the cosmic string spacetime the spacetime with spacelike dislocation and the spacetime with a spiral dislocation then by searching for a discrete spectrum of energy we analyse analogues effects of the aharonovbohm effect for bound states and the sagnac effect | [['in', 'the', 'interface', 'between', 'general', 'relativity', 'and', 'relativistic', 'quantum', 'mechanics', 'we', 'analyse', 'rotating', 'effects', 'on', 'the', 'scalar', 'field', 'subject', 'to', 'a', 'hardwall', 'confining', 'potential', 'we', 'consider', 'three', 'different', 'scenarios', 'of', 'general', 'relativity', 'given', 'by', 'the', 'cosmic', 'string', 'spacetime', 'the', 'spacetime', 'with', 'spacelike', 'dislocation', 'and', 'the', 'spacetime', 'with', 'a', 'spiral', 'dislocation', 'then', 'by', 'searching', 'for', 'a', 'discrete', 'spectrum', 'of', 'energy', 'we', 'analyse', 'analogues', 'effects', 'of', 'the', 'aharonovbohm', 'effect', 'for', 'bound', 'states', 'and', 'the', 'sagnac', 'effect']] | [-0.16309221060411702, 0.17650513113098773, -0.09789170379549064, 0.13193891246526226, -0.0612112814057115, -0.15405662595042707, -0.01633387881117193, 0.31077948090544827, -0.18005188807492722, -0.2851558739092906, 0.005606563728793549, -0.23550398860479127, -0.13935713716656775, 0.12414268569114643, -0.010420387623378553, 0.04953152353472605, -0.020736854020002728, 0.01716108447746248, -0.08495972740363229, -0.1873706777838084, 0.40076379941121953, 0.06587184728846911, 0.2580853388393046, 0.04362374677549343, 0.07277839431992254, 0.03966440302886169, -0.0062087077798472865, 0.07871699141262956, -0.1765122470647298, 0.05500073070131318, 0.1534537367422033, 0.04294987754720087, 0.19749706067346237, -0.5109472762088518, -0.26947793153089444, 0.07439795485068415, 0.09385476791224368, 0.2079202730170879, -0.08413317257922294, -0.3621508289833327, 0.009860775688335904, -0.13884253016314343, -0.16281810110887965, 0.010234150255249964, 0.047588341537472864, -0.058450792601483094, -0.20279790539093115, 0.10384362802614232, 0.013375549904398015, 0.042095971400723665, -0.0955368167834004, -0.019568295435149322, 0.01130963527169582, 0.045171064544922195, 0.08499909410051801, 0.018616625202215603, 0.1369366588108745, -0.11032133194542415, -0.14962162990028643, 0.463924381730927, -0.08546145109308732, -0.2657873332500458, 0.11192564936858174, -0.20167702107337881, -0.08204862923436873, 0.04759743834870893, 0.19219025583132296, 0.11685082107480313, -0.12076154161194289, 0.13985200034772247, 0.016114207337031495, 0.07371194166685077, 0.12030475806268687, 0.06875341553539918, 0.3095958519324258, 0.09831340998612545, 0.007151062433557534, 0.16810729165838376, -0.11547778354095597, -0.1479537555746533, -0.39372617202634747, -0.1491793831660903, -0.13542230867755575, 0.0694210763668289, -0.14260758593543968, -0.17757737506936128, 0.3660247593117576, 0.07537219770303047, 0.09855356706759415, 0.021164247964357806, 0.25571905637814385, 0.07990264065714704, 0.003688310518407741, 0.09716071437641575, 0.27771412314394034, 0.19267517978300316, 0.11147956436223073, -0.2832146080374416, -0.092954741356693, 0.06011638946428492] |
1,802.07537 | Penumbral Waves driving Solar chromospheric fan-shaped jets | We use H$\alpha$ imaging spectroscopy taken via the Swedish 1-m Solar
Telescope (SST) to investigate the occurrence of fan-shaped jets at the solar
limb. We show evidence for near-simultaneous photospheric reconnection at a
sunspot edge leading to the jets appearance, with upward velocities of 30\ks,
and extensions up to 8~Mm. The brightening at the base of the jets appears
recurrent, with a periodicity matching that of the nearby sunspot penumbra,
implying running penumbral waves could be the driver of the jets. The jets'
constant extension velocity implies that a driver counteracting solar gravity
exists, possibly as a result of the recurrent reconnection erupting material
into the chromosphere. These jets also show signatures in higher temperature
lines captured from the Solar Dynamics Observatory (SDO), indicating a very hot
jet front, leaving behind optically thick cool plasma in its wake.
| astro-ph.SR | we use halpha imaging spectroscopy taken via the swedish 1m solar telescope sst to investigate the occurrence of fanshaped jets at the solar limb we show evidence for nearsimultaneous photospheric reconnection at a sunspot edge leading to the jets appearance with upward velocities of 30ks and extensions up to 8mm the brightening at the base of the jets appears recurrent with a periodicity matching that of the nearby sunspot penumbra implying running penumbral waves could be the driver of the jets the jets constant extension velocity implies that a driver counteracting solar gravity exists possibly as a result of the recurrent reconnection erupting material into the chromosphere these jets also show signatures in higher temperature lines captured from the solar dynamics observatory sdo indicating a very hot jet front leaving behind optically thick cool plasma in its wake | [['we', 'use', 'halpha', 'imaging', 'spectroscopy', 'taken', 'via', 'the', 'swedish', '1m', 'solar', 'telescope', 'sst', 'to', 'investigate', 'the', 'occurrence', 'of', 'fanshaped', 'jets', 'at', 'the', 'solar', 'limb', 'we', 'show', 'evidence', 'for', 'nearsimultaneous', 'photospheric', 'reconnection', 'at', 'a', 'sunspot', 'edge', 'leading', 'to', 'the', 'jets', 'appearance', 'with', 'upward', 'velocities', 'of', '30ks', 'and', 'extensions', 'up', 'to', '8mm', 'the', 'brightening', 'at', 'the', 'base', 'of', 'the', 'jets', 'appears', 'recurrent', 'with', 'a', 'periodicity', 'matching', 'that', 'of', 'the', 'nearby', 'sunspot', 'penumbra', 'implying', 'running', 'penumbral', 'waves', 'could', 'be', 'the', 'driver', 'of', 'the', 'jets', 'the', 'jets', 'constant', 'extension', 'velocity', 'implies', 'that', 'a', 'driver', 'counteracting', 'solar', 'gravity', 'exists', 'possibly', 'as', 'a', 'result', 'of', 'the', 'recurrent', 'reconnection', 'erupting', 'material', 'into', 'the', 'chromosphere', 'these', 'jets', 'also', 'show', 'signatures', 'in', 'higher', 'temperature', 'lines', 'captured', 'from', 'the', 'solar', 'dynamics', 'observatory', 'sdo', 'indicating', 'a', 'very', 'hot', 'jet', 'front', 'leaving', 'behind', 'optically', 'thick', 'cool', 'plasma', 'in', 'its', 'wake']] | [-0.12432811079391588, 0.22987972679244273, -0.02581389096760005, 0.13904244935585428, -0.11415122788183499, -0.08125841969023526, 0.010239907941085867, 0.4133958008572243, -0.20953303997985262, -0.318503541264521, 0.0699579121183901, -0.2713564772671763, -0.08113892717486032, 0.20960274221969472, -0.02755886137795945, -0.0555064539712739, 0.13515456100045095, -0.06436152871617157, 0.012461266234058185, -0.1253918965779029, 0.24775060593906412, 0.10524767722455326, 0.15135595386517167, 0.005592119471723403, 0.11641236107148555, -0.17208088099268143, -0.04575065384025051, 0.02331263933033831, -0.08781067086164367, 0.006786994345020503, 0.174067962449044, 0.07765262205656905, 0.23265258053193658, -0.45700782696729986, -0.23689314001577272, -0.055268442467448935, 0.1835826937770606, -0.03150937687335671, -0.02384686552197335, -0.2792909891299053, 0.06723012317282458, -0.11875949050907207, -0.17950446640505738, 0.1135216435417322, 0.0010854282688039045, -0.018738510083758098, -0.27538991274069186, 0.03890480529462102, 0.03658681871382979, 0.13573453354436663, -0.09285800361523297, -0.00018709192754349846, -0.11215438454604262, 0.1098477881016046, 0.1377923836671339, 0.08472483184026636, 0.20310320222979764, -0.14431937467357467, -0.0862352848171081, 0.3589721673645503, -0.09820014336213902, 0.05087691949059566, 0.21042022635093957, -0.2888640943455739, -0.14523131469014924, 0.2326804031347991, 0.16925678658299148, 0.06502968831404544, -0.06172498481928546, -0.033425129149058506, -0.10065332568669016, 0.12662507311535487, 0.11997046123218277, 0.0342563128831081, 0.32645834703335835, 0.12285879954520235, 0.04454565524002132, 0.12473565566925453, -0.30125996073626954, -0.025084010376831167, -0.29894102087068924, -0.1430848288498279, -0.04566970115980518, 0.060126216209871505, -0.09257635608493887, -0.19662332237846608, 0.4097378628874245, 0.12774723972889016, 0.21299666863110295, -0.030757008988470974, 0.32694059846150025, 0.060688857514701405, 0.10729585912085368, 0.22613668155626973, 0.31482272913706477, 0.20379991953234203, 0.23863664688373767, -0.25253969907888846, 0.0678636283846572, 0.10775700862775894] |
1,802.07538 | How strict is strictification? | The subject of this paper is the higher structure of the strictification
adjunction, which relates the two fundamental bases of three-dimensional
category theory: the $\mathbf{Gray}$-category of $2$-categories and the
tricategory of bicategories. We show that -- far from requiring the full
weakness provided by the definitions of tricategory theory -- this adjunction
can be $\textit{strictly}$ enriched over the symmetric closed multicategory of
bicategories defined by Verity. Moreover, we show that this adjunction
underlies an adjunction of bicategory-enriched symmetric multicategories. An
appendix introduces the symmetric closed multicategory of pseudo double
categories, into which Verity's symmetric multicategory of bicategories embeds
fully.
| math.CT | the subject of this paper is the higher structure of the strictification adjunction which relates the two fundamental bases of threedimensional category theory the mathbfgraycategory of 2categories and the tricategory of bicategories we show that far from requiring the full weakness provided by the definitions of tricategory theory this adjunction can be textitstrictly enriched over the symmetric closed multicategory of bicategories defined by verity moreover we show that this adjunction underlies an adjunction of bicategoryenriched symmetric multicategories an appendix introduces the symmetric closed multicategory of pseudo double categories into which veritys symmetric multicategory of bicategories embeds fully | [['the', 'subject', 'of', 'this', 'paper', 'is', 'the', 'higher', 'structure', 'of', 'the', 'strictification', 'adjunction', 'which', 'relates', 'the', 'two', 'fundamental', 'bases', 'of', 'threedimensional', 'category', 'theory', 'the', 'mathbfgraycategory', 'of', '2categories', 'and', 'the', 'tricategory', 'of', 'bicategories', 'we', 'show', 'that', 'far', 'from', 'requiring', 'the', 'full', 'weakness', 'provided', 'by', 'the', 'definitions', 'of', 'tricategory', 'theory', 'this', 'adjunction', 'can', 'be', 'textitstrictly', 'enriched', 'over', 'the', 'symmetric', 'closed', 'multicategory', 'of', 'bicategories', 'defined', 'by', 'verity', 'moreover', 'we', 'show', 'that', 'this', 'adjunction', 'underlies', 'an', 'adjunction', 'of', 'bicategoryenriched', 'symmetric', 'multicategories', 'an', 'appendix', 'introduces', 'the', 'symmetric', 'closed', 'multicategory', 'of', 'pseudo', 'double', 'categories', 'into', 'which', 'veritys', 'symmetric', 'multicategory', 'of', 'bicategories', 'embeds', 'fully']] | [-0.12156344042747885, 0.0503307238467003, -0.027614048999199208, 0.12842355572192513, -0.08256357611018292, -0.10046156584978738, -0.020083464881494404, 0.3585536986430909, -0.39049288813777744, -0.18912203366214292, 0.03154780312461105, -0.15742014403989973, -0.1750737505449735, 0.14111742381244263, -0.2080662460165455, -0.12108131698729034, 0.029839855509790333, 0.08385789121917271, -0.1104516473133117, -0.23883771929800748, 0.4814712599296361, -0.027748442621544956, 0.26419456241692, 0.05134650486263823, 0.11157814051678523, 0.015066961757838726, -0.02881183936954179, 0.038373072819903174, -0.11199020951484116, 0.21517852297364834, 0.30050017318113686, 0.14860587325343427, 0.17700715787446206, -0.38893526009818974, -0.09011852244866338, 0.12897680389714686, 0.12436383134348596, 0.06772018674057612, -0.051386800852227715, -0.364091287743538, 0.09509260842992746, -0.28630657344709765, -0.052291788879108236, -0.07257278531819503, 0.007627943055109775, -0.002476990876838248, -0.21770168025296757, -0.01780822509503428, 0.19639199625383666, 0.10276385373931299, -0.1003159014607205, -0.04882255660994177, -0.07701676912566131, 0.09744496401114527, -0.028327122838434544, -0.0013682000101246732, 0.08781236314036428, -0.09510217515127535, -0.15498738753500374, 0.3615134333438696, -0.03727260642149981, -0.19369196815000095, 0.11989225245061073, -0.10263392371509442, -0.11783944907043367, 0.13301042079965167, 0.010899948144450467, 0.17909330341647914, -0.09040489950417938, 0.20758712998073686, -0.18302083480112413, 0.09499792342985723, 0.11534452180754631, 0.025187722813496564, 0.18571607233768211, 0.11789707839488983, 0.024808298920261415, 0.22406662896924473, 0.013574408917152819, -0.13751416125067292, -0.36636741887381735, -0.20569769788454187, -0.019061725229976026, 0.13428329367517552, -0.0752356177085374, -0.21252745617815155, 0.3604942800358255, 0.08439247034232508, 0.13220347631524534, 0.11601787159823754, 0.27743575060145653, 0.028049173428023114, 0.09831248236661579, -0.02642715082285886, 0.18328997574280947, 0.2643718859725731, -0.005335133863325687, -0.06922703710176606, -0.0017694654537642256, 0.19460349919353712] |
1,802.07539 | Continuous Level Monte Carlo and Sample-Adaptive Model Hierarchies | In this paper, we present a generalisation of the Multilevel Monte Carlo
(MLMC) method to a setting where the level parameter is a continuous variable.
This Continuous Level Monte Carlo (CLMC) estimator provides a natural framework
in PDE applications to adapt the model hierarchy to each sample. In addition,
it can be made unbiased with respect to the expected value of the true quantity
of interest provided the quantity of interest converges sufficiently fast. The
practical implementation of the CLMC estimator is based on interpolating actual
evaluations of the quantity of interest at a finite number of resolutions. As
our new level parameter, we use the logarithm of a goal-oriented finite element
error estimator for the accuracy of the quantity of interest. We prove the
unbiasedness, as well as a complexity theorem that shows the same rate of
complexity for CLMC as for MLMC. Finally, we provide some numerical evidence to
support our theoretical results, by successfully testing CLMC on a standard PDE
test problem. The numerical experiments demonstrate clear gains for sample-wise
adaptive refinement strategies over uniform refinements.
| math.NA | in this paper we present a generalisation of the multilevel monte carlo mlmc method to a setting where the level parameter is a continuous variable this continuous level monte carlo clmc estimator provides a natural framework in pde applications to adapt the model hierarchy to each sample in addition it can be made unbiased with respect to the expected value of the true quantity of interest provided the quantity of interest converges sufficiently fast the practical implementation of the clmc estimator is based on interpolating actual evaluations of the quantity of interest at a finite number of resolutions as our new level parameter we use the logarithm of a goaloriented finite element error estimator for the accuracy of the quantity of interest we prove the unbiasedness as well as a complexity theorem that shows the same rate of complexity for clmc as for mlmc finally we provide some numerical evidence to support our theoretical results by successfully testing clmc on a standard pde test problem the numerical experiments demonstrate clear gains for samplewise adaptive refinement strategies over uniform refinements | [['in', 'this', 'paper', 'we', 'present', 'a', 'generalisation', 'of', 'the', 'multilevel', 'monte', 'carlo', 'mlmc', 'method', 'to', 'a', 'setting', 'where', 'the', 'level', 'parameter', 'is', 'a', 'continuous', 'variable', 'this', 'continuous', 'level', 'monte', 'carlo', 'clmc', 'estimator', 'provides', 'a', 'natural', 'framework', 'in', 'pde', 'applications', 'to', 'adapt', 'the', 'model', 'hierarchy', 'to', 'each', 'sample', 'in', 'addition', 'it', 'can', 'be', 'made', 'unbiased', 'with', 'respect', 'to', 'the', 'expected', 'value', 'of', 'the', 'true', 'quantity', 'of', 'interest', 'provided', 'the', 'quantity', 'of', 'interest', 'converges', 'sufficiently', 'fast', 'the', 'practical', 'implementation', 'of', 'the', 'clmc', 'estimator', 'is', 'based', 'on', 'interpolating', 'actual', 'evaluations', 'of', 'the', 'quantity', 'of', 'interest', 'at', 'a', 'finite', 'number', 'of', 'resolutions', 'as', 'our', 'new', 'level', 'parameter', 'we', 'use', 'the', 'logarithm', 'of', 'a', 'goaloriented', 'finite', 'element', 'error', 'estimator', 'for', 'the', 'accuracy', 'of', 'the', 'quantity', 'of', 'interest', 'we', 'prove', 'the', 'unbiasedness', 'as', 'well', 'as', 'a', 'complexity', 'theorem', 'that', 'shows', 'the', 'same', 'rate', 'of', 'complexity', 'for', 'clmc', 'as', 'for', 'mlmc', 'finally', 'we', 'provide', 'some', 'numerical', 'evidence', 'to', 'support', 'our', 'theoretical', 'results', 'by', 'successfully', 'testing', 'clmc', 'on', 'a', 'standard', 'pde', 'test', 'problem', 'the', 'numerical', 'experiments', 'demonstrate', 'clear', 'gains', 'for', 'samplewise', 'adaptive', 'refinement', 'strategies', 'over', 'uniform', 'refinements']] | [-0.0612310236163812, 0.023145152768380316, -0.105863051944251, 0.0821886681457305, -0.051851887107623854, -0.09755385709619514, 0.10195371653434597, 0.3606096193527376, -0.26527437657835196, -0.2985856757091499, 0.13080522464393174, -0.23037701806667463, -0.12474259510948504, 0.24268349706112047, -0.10488139683843783, 0.11712019829672642, 0.09470274223680686, 0.022167949348215962, -0.08319170325318112, -0.2691265384318026, 0.24635654379916402, 0.10164279614018495, 0.286511672686723, 0.022286881008523635, 0.14510921478354732, -0.014660228447020886, -0.020645216755131937, 0.039476938630495215, -0.1541512593818915, 0.12134357955626748, 0.2679333237192318, 0.1423599494831876, 0.35683841422699686, -0.3332975481975581, -0.1955852083999705, 0.09767198289468801, 0.12821253604520966, 0.10587479950412691, -0.08033528867016375, -0.2456176335710054, 0.08886582092655167, -0.19626844851378164, -0.14716641353599352, -0.1010859652419767, -0.06084241764099654, 0.03062154198658533, -0.35407583468578047, 0.07497103385986272, 0.03353854449655778, 0.06730896601838439, 0.005215724305816869, -0.13018155661307526, 0.028930065844158574, 0.09399228624989117, 0.05807607069510092, 0.02186625830646391, 0.07882998857449469, -0.08891103004870218, -0.1355536206880345, 0.33018350663631324, -0.0791738560704863, -0.257381937807353, 0.1606187463527306, -0.11494442404055312, -0.15143097322056975, 0.11693543039506832, 0.16902486452385368, 0.1352897027153626, -0.1055536231360341, 0.09943232171409165, -0.05679894825599713, 0.187253433805188, -0.015756783560152535, 0.019703791882613852, 0.11893850195549387, 0.2175401437600981, 0.11042592550144016, 0.15975131843481005, -0.08524106216861466, -0.13146743334455196, -0.3431094910678917, -0.19721808182153663, -0.22097378850696014, 0.009870229256417415, -0.14323069537110503, -0.19034828168766665, 0.3571279129356812, 0.22315841134346232, 0.17500714139294857, 0.12539562843115637, 0.30324703495033795, 0.12240801417716264, 0.0115562273220643, 0.045273543080554327, 0.17848805578600474, 0.12358965789352923, 0.04709393154457732, -0.20477569768174067, 0.09482076518268809, 0.09687202188378856] |
1,802.0754 | Operator splitting technique using streamline projection for two-phase
flow in highly heterogeneous and anisotropic porous media | In this paper, we present a fast streamline-based numerical method for the
two-phase flow equations in high-rate flooding scenarios for incompressible
fluids in heterogeneous and anisotropic porous media. A fractional flow
formulation is adopted and a discontinuous Galerkin method (DG) is employed to
solve the pressure equation. Capillary effects can be neglected in high-rate
flooding scenarios. This allows us to present an improved streamline approach
in combination with the one-dimensional front tracking method to solve the
transport equation. To handle the high computational costs of the DG
approximation, domain decomposition is applied combined with an algebraic
multigrid preconditioner to solve the linear system. Special care at the
interior interfaces is required and the streamline tracer has to include a
dynamic communication strategy. The method is validated in various two- and
three-dimensional tests, where comparisons of the solutions in terms of
approximation of flow front propagation with standard fully-implicit finite
volume methods are provided.
| math.NA physics.comp-ph | in this paper we present a fast streamlinebased numerical method for the twophase flow equations in highrate flooding scenarios for incompressible fluids in heterogeneous and anisotropic porous media a fractional flow formulation is adopted and a discontinuous galerkin method dg is employed to solve the pressure equation capillary effects can be neglected in highrate flooding scenarios this allows us to present an improved streamline approach in combination with the onedimensional front tracking method to solve the transport equation to handle the high computational costs of the dg approximation domain decomposition is applied combined with an algebraic multigrid preconditioner to solve the linear system special care at the interior interfaces is required and the streamline tracer has to include a dynamic communication strategy the method is validated in various two and threedimensional tests where comparisons of the solutions in terms of approximation of flow front propagation with standard fullyimplicit finite volume methods are provided | [['in', 'this', 'paper', 'we', 'present', 'a', 'fast', 'streamlinebased', 'numerical', 'method', 'for', 'the', 'twophase', 'flow', 'equations', 'in', 'highrate', 'flooding', 'scenarios', 'for', 'incompressible', 'fluids', 'in', 'heterogeneous', 'and', 'anisotropic', 'porous', 'media', 'a', 'fractional', 'flow', 'formulation', 'is', 'adopted', 'and', 'a', 'discontinuous', 'galerkin', 'method', 'dg', 'is', 'employed', 'to', 'solve', 'the', 'pressure', 'equation', 'capillary', 'effects', 'can', 'be', 'neglected', 'in', 'highrate', 'flooding', 'scenarios', 'this', 'allows', 'us', 'to', 'present', 'an', 'improved', 'streamline', 'approach', 'in', 'combination', 'with', 'the', 'onedimensional', 'front', 'tracking', 'method', 'to', 'solve', 'the', 'transport', 'equation', 'to', 'handle', 'the', 'high', 'computational', 'costs', 'of', 'the', 'dg', 'approximation', 'domain', 'decomposition', 'is', 'applied', 'combined', 'with', 'an', 'algebraic', 'multigrid', 'preconditioner', 'to', 'solve', 'the', 'linear', 'system', 'special', 'care', 'at', 'the', 'interior', 'interfaces', 'is', 'required', 'and', 'the', 'streamline', 'tracer', 'has', 'to', 'include', 'a', 'dynamic', 'communication', 'strategy', 'the', 'method', 'is', 'validated', 'in', 'various', 'two', 'and', 'threedimensional', 'tests', 'where', 'comparisons', 'of', 'the', 'solutions', 'in', 'terms', 'of', 'approximation', 'of', 'flow', 'front', 'propagation', 'with', 'standard', 'fullyimplicit', 'finite', 'volume', 'methods', 'are', 'provided']] | [-0.11650308566114338, 0.02029488662638438, -0.1194785764378857, 0.00654826144991124, -0.08224617069323645, -0.15994007822959438, -0.0192151513374962, 0.35101551248839025, -0.3235883456164677, -0.268724083465426, 0.12426998533038913, -0.2395403325362598, -0.11154579222324844, 0.18305190274412253, -0.095493558717671, 0.12245191791781078, 0.07799060243843614, -0.06850041561502669, -0.06848661678591988, -0.21195012423528456, 0.2663632408029547, 0.02659145563436476, 0.29450237078249064, 0.06323890557120505, 0.1286603447484882, -0.06907549495104161, -0.06288087017540085, 0.08083661315705333, -0.14723858117787658, 0.08628935157321393, 0.28602654935093597, 0.04496675931333907, 0.2831077811700341, -0.48682184753890495, -0.2824397830010735, 0.05219557140126677, 0.16053129372180833, 0.12848320575185904, -0.06099478107659563, -0.24284154086030627, 0.09009824304130713, -0.18840731104750089, -0.15096540779249104, -0.07399196434141088, -0.043337653162444964, 0.038001327799927244, -0.3130562701630161, 0.09379400878127567, -0.012052266052801554, 0.013317506619435, -0.06353081994434194, -0.060511079789935855, 0.06095795009030936, 0.07351623643741109, 0.01890753591616981, -0.004631263853393887, 0.07642723318560074, -0.11658521431443085, -0.07572093735890169, 0.43574531774931147, -0.061810437121541904, -0.318782499023272, 0.21931232404466228, -0.06303197894866523, -0.0643035485026255, 0.18859985009294178, 0.2578284464145422, 0.17833657266486339, -0.14699325613420164, 0.07049405847302344, -0.0034039091881009212, 0.1250074166162353, 0.03379425446588644, -0.07861754048999021, 0.08177334307018962, 0.22310956117795094, 0.1072000403104252, 0.12896127098563165, -0.0894945404908963, -0.1240016961605043, -0.2829868935636784, -0.18322839576285332, -0.15890125941950828, -0.042112434782259366, -0.13314031147800912, -0.19107503648602256, 0.3543392727572753, 0.16867757735369532, 0.07645726471711992, 0.020835015438742152, 0.35163137468043715, 0.13475951246647655, 0.020008835337648634, 0.13122429966460913, 0.18926612298175888, 0.1650317361406786, 0.17971373220299078, -0.2621124288232654, 0.05028885710482044, 0.15334239996675597] |
1,802.07541 | Mean field quantization of effective string | I describe the recently proposed quantization of bosonic string about the
mean-field ground state, paying special attention to the differences from the
usual quantization about the classical vacuum which turns out to be unstable
for d>2. In particular, the string susceptibility index $\gamma_{\rm str}$ is 1
in the usual perturbation theory, but equals 1/2 in the mean-field
approximation that applies for 2<d<26. I show that the total central charge
equals zero in the mean-field approximation and argue that fluctuations about
the mean field do not spoil conformal invariance.
| hep-th hep-ph | i describe the recently proposed quantization of bosonic string about the meanfield ground state paying special attention to the differences from the usual quantization about the classical vacuum which turns out to be unstable for d2 in particular the string susceptibility index gamma_rm str is 1 in the usual perturbation theory but equals 12 in the meanfield approximation that applies for 2d26 i show that the total central charge equals zero in the meanfield approximation and argue that fluctuations about the mean field do not spoil conformal invariance | [['i', 'describe', 'the', 'recently', 'proposed', 'quantization', 'of', 'bosonic', 'string', 'about', 'the', 'meanfield', 'ground', 'state', 'paying', 'special', 'attention', 'to', 'the', 'differences', 'from', 'the', 'usual', 'quantization', 'about', 'the', 'classical', 'vacuum', 'which', 'turns', 'out', 'to', 'be', 'unstable', 'for', 'd2', 'in', 'particular', 'the', 'string', 'susceptibility', 'index', 'gamma_rm', 'str', 'is', '1', 'in', 'the', 'usual', 'perturbation', 'theory', 'but', 'equals', '12', 'in', 'the', 'meanfield', 'approximation', 'that', 'applies', 'for', '2d26', 'i', 'show', 'that', 'the', 'total', 'central', 'charge', 'equals', 'zero', 'in', 'the', 'meanfield', 'approximation', 'and', 'argue', 'that', 'fluctuations', 'about', 'the', 'mean', 'field', 'do', 'not', 'spoil', 'conformal', 'invariance']] | [-0.11351878563238477, 0.16360940976301208, -0.09288158256094903, 0.14678919437045063, -0.03722446494397114, -0.16109471998854794, 0.0510512924665818, 0.26353158930909226, -0.22209850661668248, -0.24443947621197862, 0.05473351087923881, -0.2968303225537635, -0.12713021027262916, 0.06516741640701763, -0.06301564960317178, -0.005325161746110429, -0.02682634577451443, 0.13452725797171958, -0.10785081162016881, -0.22471509537320922, 0.3032699086840942, 0.048068769900551575, 0.33173350215127523, 0.035744796611569735, 0.04988829042122234, 0.036347725423349235, 0.024869650803421708, 0.028884252459234136, -0.1418505676595239, 0.043218454393685206, 0.20693269740811296, 0.05492845904187892, 0.23830259710402144, -0.4154503096360713, -0.23150297858625313, 0.08058902350339023, 0.15929178432138127, 0.15032387914173093, 0.021142540533632695, -0.22450197892877358, 0.10806759047343141, -0.1699879663977878, -0.16254475407979704, -0.09392188503724438, 0.03187304933751214, -0.027821756222031334, -0.22467330662501891, 0.09831540598348841, 0.09078059442584742, 0.022144652426835488, -0.047932310990290716, -0.12948006723838096, -0.019000832494136623, 0.09432939953826876, 0.09157967921716838, 0.07530674145197157, 0.1172248249376108, -0.16898830103772608, -0.08167904304784977, 0.38266155297275295, -0.07577587767842818, -0.20055346042235297, 0.08703803688298319, -0.1936179015161046, -0.15207581767621872, 0.13994965973357798, 0.04498906148893928, 0.1047018788098781, -0.06558379234576767, 0.17244870155263925, -0.008450744197365235, 0.18091166313123805, 0.07995746205084618, 0.03205153851145455, 0.18256193698934195, 0.04083803032567217, 0.057117224075640974, 0.10828871859253426, -0.0645899307300252, -0.2487672796553604, -0.37129704163155774, -0.10587977157609368, -0.16547506415570917, 0.13486305896516237, -0.09572294089312808, -0.13875882928683, 0.337507134726779, 0.18687625893835502, 0.14615040354494174, 0.04605769933947489, 0.23012154838281937, 0.16085222880461847, 0.0656069873578169, 0.10221118220546156, 0.3120627513774459, 0.1788712700627829, 0.07554240860653491, -0.26059614652397367, -0.047503574259198184, 0.09427025773435492] |
1,802.07542 | Self-contracted curves are gradient flows of convex functions | In this paper we prove that any $C^{1,\alpha}$ curve in $\mathbb{R}^n$, with
$\alpha \in (\frac{1}{2},1]$, is the solution of the gradient flow equation for
some $C^1$ convex function $f$, if and only if it is strongly self-contracted.
| math.AP | in this paper we prove that any c1alpha curve in mathbbrn with alpha in frac121 is the solution of the gradient flow equation for some c1 convex function f if and only if it is strongly selfcontracted | [['in', 'this', 'paper', 'we', 'prove', 'that', 'any', 'c1alpha', 'curve', 'in', 'mathbbrn', 'with', 'alpha', 'in', 'frac121', 'is', 'the', 'solution', 'of', 'the', 'gradient', 'flow', 'equation', 'for', 'some', 'c1', 'convex', 'function', 'f', 'if', 'and', 'only', 'if', 'it', 'is', 'strongly', 'selfcontracted']] | [-0.14997744107165853, 0.0844465907210031, -0.09507222448450488, -0.02492995636625769, -0.05801753654471926, -0.18816030327532743, -0.04044564750133636, 0.3873173763623109, -0.3540780014182265, -0.1456855658844516, 0.14034555446218094, -0.3280995120671955, -0.18588746500805625, 0.20222801813302008, -0.13358592692561247, 0.04794562250577115, 0.06327776409484245, 0.07831525294160521, -0.04511459085561738, -0.25248715282745055, 0.36842867651501215, -0.17484002887598565, 0.13928675855434425, 0.12410687560819693, 0.0904320145932001, -0.03274188242298928, 0.10956378915422671, 0.04729322918590058, -0.20106981876656269, 0.07321727603069834, 0.22486080920223045, 0.1525509680080152, 0.2975217513236645, -0.33042394339635567, -0.23764188182414384, 0.23750773409532533, 0.13271291866093068, -0.023713958852395817, -0.06433646691132437, -0.1826926986309322, 0.16098163503448706, -0.04970056095437424, -0.19294408579180772, -0.023646503013583856, 0.10468249944214886, 0.0778841538656805, -0.3125289309946065, 0.09420947879049424, 0.13932400282371687, 0.020229732340856177, -0.12311365118099225, -0.060717325229701156, -0.06508939909572536, -0.007014847322795037, 0.04981074450266976, 0.20598208378194957, 0.043731682166155125, -0.10394467703519843, 0.036498510958375155, 0.3550223162448084, -0.12594363584208326, -0.33680052149134715, 0.10030443037583216, -0.26346350264911716, -0.17631335441979604, 0.09321136385001041, 0.1128636775160762, 0.2160871684349872, -0.1326576972480964, 0.21748748497653603, -0.09352716642457086, 0.18212060343373465, 0.06109841905433584, -0.06380351641643289, 0.039779552881530414, 0.0840243859392767, 0.24311982933431864, 0.11574669829192194, 0.0044408180574710306, -0.00825874084556425, -0.3924320661336989, -0.1864076964305462, -0.18955783246122804, 0.09274373873061426, -0.1278926701960626, -0.1915947740545144, 0.3217788280264751, 0.0748853179802363, 0.16484368660462065, 0.10859863643811361, 0.25052212548719066, 0.16218025257458557, -0.03557048692695192, 0.20921724788039117, 0.18598229245902542, 0.08711215200506754, 0.03261963695891806, -0.17987042873141332, 0.06889302662347217, 0.13612213015959068] |
1,802.07543 | The Many Faces of Exponential Weights in Online Learning | A standard introduction to online learning might place Online Gradient
Descent at its center and then proceed to develop generalizations and
extensions like Online Mirror Descent and second-order methods. Here we explore
the alternative approach of putting Exponential Weights (EW) first. We show
that many standard methods and their regret bounds then follow as a special
case by plugging in suitable surrogate losses and playing the EW posterior
mean. For instance, we easily recover Online Gradient Descent by using EW with
a Gaussian prior on linearized losses, and, more generally, all instances of
Online Mirror Descent based on regular Bregman divergences also correspond to
EW with a prior that depends on the mirror map. Furthermore, appropriate
quadratic surrogate losses naturally give rise to Online Gradient Descent for
strongly convex losses and to Online Newton Step. We further interpret several
recent adaptive methods (iProd, Squint, and a variation of Coin Betting for
experts) as a series of closely related reductions to exp-concave surrogate
losses that are then handled by Exponential Weights. Finally, a benefit of our
EW interpretation is that it opens up the possibility of sampling from the EW
posterior distribution instead of playing the mean. As already observed by
Bubeck and Eldan, this recovers the best-known rate in Online Bandit Linear
Optimization.
| stat.ML cs.LG | a standard introduction to online learning might place online gradient descent at its center and then proceed to develop generalizations and extensions like online mirror descent and secondorder methods here we explore the alternative approach of putting exponential weights ew first we show that many standard methods and their regret bounds then follow as a special case by plugging in suitable surrogate losses and playing the ew posterior mean for instance we easily recover online gradient descent by using ew with a gaussian prior on linearized losses and more generally all instances of online mirror descent based on regular bregman divergences also correspond to ew with a prior that depends on the mirror map furthermore appropriate quadratic surrogate losses naturally give rise to online gradient descent for strongly convex losses and to online newton step we further interpret several recent adaptive methods iprod squint and a variation of coin betting for experts as a series of closely related reductions to expconcave surrogate losses that are then handled by exponential weights finally a benefit of our ew interpretation is that it opens up the possibility of sampling from the ew posterior distribution instead of playing the mean as already observed by bubeck and eldan this recovers the bestknown rate in online bandit linear optimization | [['a', 'standard', 'introduction', 'to', 'online', 'learning', 'might', 'place', 'online', 'gradient', 'descent', 'at', 'its', 'center', 'and', 'then', 'proceed', 'to', 'develop', 'generalizations', 'and', 'extensions', 'like', 'online', 'mirror', 'descent', 'and', 'secondorder', 'methods', 'here', 'we', 'explore', 'the', 'alternative', 'approach', 'of', 'putting', 'exponential', 'weights', 'ew', 'first', 'we', 'show', 'that', 'many', 'standard', 'methods', 'and', 'their', 'regret', 'bounds', 'then', 'follow', 'as', 'a', 'special', 'case', 'by', 'plugging', 'in', 'suitable', 'surrogate', 'losses', 'and', 'playing', 'the', 'ew', 'posterior', 'mean', 'for', 'instance', 'we', 'easily', 'recover', 'online', 'gradient', 'descent', 'by', 'using', 'ew', 'with', 'a', 'gaussian', 'prior', 'on', 'linearized', 'losses', 'and', 'more', 'generally', 'all', 'instances', 'of', 'online', 'mirror', 'descent', 'based', 'on', 'regular', 'bregman', 'divergences', 'also', 'correspond', 'to', 'ew', 'with', 'a', 'prior', 'that', 'depends', 'on', 'the', 'mirror', 'map', 'furthermore', 'appropriate', 'quadratic', 'surrogate', 'losses', 'naturally', 'give', 'rise', 'to', 'online', 'gradient', 'descent', 'for', 'strongly', 'convex', 'losses', 'and', 'to', 'online', 'newton', 'step', 'we', 'further', 'interpret', 'several', 'recent', 'adaptive', 'methods', 'iprod', 'squint', 'and', 'a', 'variation', 'of', 'coin', 'betting', 'for', 'experts', 'as', 'a', 'series', 'of', 'closely', 'related', 'reductions', 'to', 'expconcave', 'surrogate', 'losses', 'that', 'are', 'then', 'handled', 'by', 'exponential', 'weights', 'finally', 'a', 'benefit', 'of', 'our', 'ew', 'interpretation', 'is', 'that', 'it', 'opens', 'up', 'the', 'possibility', 'of', 'sampling', 'from', 'the', 'ew', 'posterior', 'distribution', 'instead', 'of', 'playing', 'the', 'mean', 'as', 'already', 'observed', 'by', 'bubeck', 'and', 'eldan', 'this', 'recovers', 'the', 'bestknown', 'rate', 'in', 'online', 'bandit', 'linear', 'optimization']] | [0.006100369890260001, 0.05249807110741594, -0.10702134948491529, 0.13443188705121362, -0.12957957547755455, -0.1887290844570775, 0.05336170753833117, 0.4544775079428394, -0.3161197295807794, -0.29422674932130527, 0.13260429973367005, -0.2349986633898708, -0.16179720267932424, 0.20192813783673183, -0.1292169323127348, 0.06968050729675561, 0.054265920443455955, 0.005346941484911543, -0.08199021248212787, -0.3192972368868244, 0.29207932463087105, 0.08670615273877047, 0.24638789957103688, -0.009135896244464125, 0.12167713580293942, 0.036580792470079546, -0.025897301404016478, 0.033757204255792046, -0.09405700581212514, 0.16611721316014222, 0.23368951455988693, 0.15392100088937918, 0.3495406025739492, -0.3743034975761372, -0.15678754899025354, 0.13399885669526346, 0.14178069594606124, 0.11617565347169491, -0.0778379112148887, -0.2612337563571274, 0.034145117994894295, -0.1513204811588984, -0.0704815492807132, -0.09268909383494899, -0.0553803441294838, 0.04919685435674663, -0.3250401621999632, 0.050942104277810527, 0.0609335032805695, 0.028429166973955085, -0.01726498593203394, -0.14436692320675817, 0.02022628243551326, 0.038434043922022265, 0.09410910787256346, 0.03200593633595898, 0.14861738748786935, -0.1223067513453985, -0.1626941583861755, 0.34537078698499585, -0.0913824825698646, -0.16428313052000584, 0.13028359143744345, -0.034221163191964395, -0.136247303372003, 0.10878341210806163, 0.21717832996817482, 0.13263854243076528, -0.12774273408862394, 0.07287752129360463, -0.029177041993397376, 0.1166468383041474, 0.07910048732103533, -0.018769561973694747, 0.11214162412929823, 0.09037956815237126, 0.14059730156688327, 0.150665568747807, -0.05174182892012638, -0.15374941001031198, -0.31191054473516866, -0.11949372204363276, -0.14006528054541945, 0.018459549758534984, -0.1310758363704152, -0.16488189653895427, 0.3473419112829878, 0.15018901531145257, 0.23326870723724155, 0.15311185429905066, 0.30099470639285053, 0.10363936306631966, 0.07711259280040395, 0.11531951394170152, 0.22000226984898788, 0.09584062987277372, 0.08224789200697692, -0.2149722146623733, 0.09565848892802847, 0.1003087171746576] |
1,802.07544 | Personal research information system. About developing the methods for
searching patent analogs of invention | The article describes information model and the method for searching patent
analogs for Personal Research Information System.
| cs.DL cs.IR | the article describes information model and the method for searching patent analogs for personal research information system | [['the', 'article', 'describes', 'information', 'model', 'and', 'the', 'method', 'for', 'searching', 'patent', 'analogs', 'for', 'personal', 'research', 'information', 'system']] | [-0.057917271795518255, -0.04453545743051697, -0.08126892024815521, 0.11125959127264864, -0.12499810010194778, -0.21477408882449656, 0.04155886797782253, 0.276462284163298, -0.27280366913798976, -0.3841909459408592, 0.11018545810571488, -0.40041322611710606, -0.22117990967543685, 0.2759287884212373, -0.09151777471689616, 0.045514040023964995, 0.08513103381675832, 0.05698237309287138, -0.006562929710044581, -0.2230977001873886, 0.28994675654479685, 0.06471726517466937, 0.4047543226796038, 0.06454916780485827, 0.09048781204311286, 0.09998669328770655, -0.19588726517908714, -0.05328099166645723, -0.16196876599946441, 0.24487629056196003, 0.2833827375982176, 0.27459193590809317, 0.3255952269879772, -0.3450530386146377, -0.18767863972222104, 0.08349688877077664, 0.10849826224148273, 0.1992564219981432, -0.06731694613528602, -0.37043040842913527, -0.015981130411519724, -0.2073934973381898, -0.14385266119942947, -0.10524486859931666, 0.046403407831402385, -0.030272061881773612, -0.23203452331397464, 0.0204970038989011, 0.06102216221830424, 0.1538105065770009, -0.13497080785386703, -0.09643348785089877, 0.05917438420960132, 0.21256240194334702, 0.006795930066693793, -0.007842882604831281, 0.15425762386225603, -0.14814921999898026, -0.13234910193611593, 0.3801458605072078, 0.00048592077184687643, -0.1364047345431412, 0.08186132088303566, -0.06356027108781478, -0.18679623048314276, 0.07263167684569079, 0.26103153079748154, 0.04307348807068432, -0.3046515987747732, 0.05014371731907458, -0.0380010769209441, 0.1486765507827787, -0.00573939282227965, 0.1134876639527433, 0.2821219824254513, 0.21595489518607364, 0.026086072574424392, 0.08721597799483467, -0.05149202640442287, -0.1320194213596337, -0.22287267241079142, -0.2668767227407764, -0.1820739347706823, -0.04819071621579282, 0.026899439256179474, -0.07578793529640226, 0.4365038341459106, 0.24856580246020765, 0.005590006544747774, 0.009492110173382303, 0.31083701500970434, -0.030800630721975777, 0.018773116061792654, 0.05443142759887611, 0.07173665607457652, 0.011325556894435602, 0.2613064222695196, -0.10595476552022293, 0.09918645544744589, 0.10499227879678502] |
1,802.07545 | A Novel Image Encryption Scheme Based on Different Block Sizes for
Grayscale and Color Images | In this paper, two image encryption schemes are proposed for grayscale and
color images. The two encryption schemes are based on dividing each image into
blocks of different sizes. In the first scheme, the two dimension ($2$D) input
image is divided into various blocks of size $N \times N$. Each block is
transformed into a one dimensional ($1$D) array by using the Zigzag pattern.
Then, the exclusive or (XOR) logical operation is used to encrypt each block
with the analogous secret key. In the second scheme, after the transformation
process, the first block of each image is encrypted by the corresponding secret
key. Then, before the next block is encrypted, it is XORed with the first
encrypted block to become the next input to the encrypting routine and so on.
This feedback mechanism depends on the cipher block chaining (CBC) mode of
operation which considers the heart of some ciphers because it is highly
nonlinear. In the case of color images, the color component is separated into
blocks with the same size and different secret keys. The used secret key
sequences are generated from elliptic curves (EC) over a \textit{binary} finite
field $\mathbb{F}_{2^{m}}$. Finally, the experimental results are carried out
and security analysis of the ciphered images are demonstrated that the two
proposed schemes had a better performance in terms of security, sensitivity and
robustness.
| cs.CR | in this paper two image encryption schemes are proposed for grayscale and color images the two encryption schemes are based on dividing each image into blocks of different sizes in the first scheme the two dimension 2d input image is divided into various blocks of size n times n each block is transformed into a one dimensional 1d array by using the zigzag pattern then the exclusive or xor logical operation is used to encrypt each block with the analogous secret key in the second scheme after the transformation process the first block of each image is encrypted by the corresponding secret key then before the next block is encrypted it is xored with the first encrypted block to become the next input to the encrypting routine and so on this feedback mechanism depends on the cipher block chaining cbc mode of operation which considers the heart of some ciphers because it is highly nonlinear in the case of color images the color component is separated into blocks with the same size and different secret keys the used secret key sequences are generated from elliptic curves ec over a textitbinary finite field mathbbf_2m finally the experimental results are carried out and security analysis of the ciphered images are demonstrated that the two proposed schemes had a better performance in terms of security sensitivity and robustness | [['in', 'this', 'paper', 'two', 'image', 'encryption', 'schemes', 'are', 'proposed', 'for', 'grayscale', 'and', 'color', 'images', 'the', 'two', 'encryption', 'schemes', 'are', 'based', 'on', 'dividing', 'each', 'image', 'into', 'blocks', 'of', 'different', 'sizes', 'in', 'the', 'first', 'scheme', 'the', 'two', 'dimension', '2d', 'input', 'image', 'is', 'divided', 'into', 'various', 'blocks', 'of', 'size', 'n', 'times', 'n', 'each', 'block', 'is', 'transformed', 'into', 'a', 'one', 'dimensional', '1d', 'array', 'by', 'using', 'the', 'zigzag', 'pattern', 'then', 'the', 'exclusive', 'or', 'xor', 'logical', 'operation', 'is', 'used', 'to', 'encrypt', 'each', 'block', 'with', 'the', 'analogous', 'secret', 'key', 'in', 'the', 'second', 'scheme', 'after', 'the', 'transformation', 'process', 'the', 'first', 'block', 'of', 'each', 'image', 'is', 'encrypted', 'by', 'the', 'corresponding', 'secret', 'key', 'then', 'before', 'the', 'next', 'block', 'is', 'encrypted', 'it', 'is', 'xored', 'with', 'the', 'first', 'encrypted', 'block', 'to', 'become', 'the', 'next', 'input', 'to', 'the', 'encrypting', 'routine', 'and', 'so', 'on', 'this', 'feedback', 'mechanism', 'depends', 'on', 'the', 'cipher', 'block', 'chaining', 'cbc', 'mode', 'of', 'operation', 'which', 'considers', 'the', 'heart', 'of', 'some', 'ciphers', 'because', 'it', 'is', 'highly', 'nonlinear', 'in', 'the', 'case', 'of', 'color', 'images', 'the', 'color', 'component', 'is', 'separated', 'into', 'blocks', 'with', 'the', 'same', 'size', 'and', 'different', 'secret', 'keys', 'the', 'used', 'secret', 'key', 'sequences', 'are', 'generated', 'from', 'elliptic', 'curves', 'ec', 'over', 'a', 'textitbinary', 'finite', 'field', 'mathbbf_2m', 'finally', 'the', 'experimental', 'results', 'are', 'carried', 'out', 'and', 'security', 'analysis', 'of', 'the', 'ciphered', 'images', 'are', 'demonstrated', 'that', 'the', 'two', 'proposed', 'schemes', 'had', 'a', 'better', 'performance', 'in', 'terms', 'of', 'security', 'sensitivity', 'and', 'robustness']] | [-0.13171638495363627, 0.04503942706183547, -0.08842256639452119, 0.022041954099393024, -0.004761752099511796, -0.2231147420326514, 0.010442508381986824, 0.38938575894904454, -0.30508787994040176, -0.22474155767122284, 0.16758898145833104, -0.2509258961820576, -0.1088526293907697, 0.20311809750169882, -0.09149008003649735, 0.10840969261023149, 0.01979564451279917, 0.05731266957237884, -0.03640736629469237, -0.35203326658250134, 0.32024582376262906, 0.012738419451384939, 0.3438432473298495, -0.041465788352070376, 0.0875630529881164, 0.0365001169765102, -0.07310505748526859, -0.05800220619909981, -0.04073030750613985, 0.10533043407070052, 0.26609021063424215, 0.16080361722665007, 0.2566284741936085, -0.4302767908666283, -0.14926970384632504, 0.06454929166959898, 0.16395434490342659, 0.1295401826100715, -0.05550608866646404, -0.27381631355404223, 0.15076440645186398, -0.15164309776238433, -0.0006618612481231269, 0.00030798285089466456, -0.008584227716450446, 0.005285653046980444, -0.2914037082773575, -0.02610568018068144, 0.061503089146883995, 0.01079962712122194, 0.001477862529489877, -0.09244717968457346, -0.0186357138450798, 0.19739694032146612, 0.0016220468677212402, 0.01996915562111618, 0.12810641536322823, -0.0850153255517593, -0.10971417964408049, 0.38738559558779734, -0.002320331218080745, -0.18295140217066677, 0.11251599038223503, -0.07322493963874876, -0.1078412631385228, 0.13514717859652592, 0.1629365682939741, 0.08397546170038238, -0.12694456165107632, 0.023242785413198623, -0.06586707890840314, 0.24363668331976182, 0.10297174564454638, 0.07188862731189667, 0.17861530046892377, 0.1677045927457844, 0.03493771842165318, 0.17695306278048, -0.1154747402693569, -0.08996514590606759, -0.2732699355765362, -0.18021673183602616, -0.21290956463196511, -0.022301838110122065, -0.11578124253583155, -0.09834931478846036, 0.4314955211334888, 0.15127623594136302, 0.2079099531360303, 0.008094785413309833, 0.401947997834733, 0.05289872455302559, 0.1441948040992429, 0.08186177373149153, 0.13865228617903216, 0.1080418822210569, 0.04676813428886817, -0.15923814857433172, 0.08232094454953247, 0.13602148586557763] |
1,802.07546 | Planning Nonlinear Access Paths for Temporal Bone Surgery | Purpose: Interventions at the otobasis operate in the narrow region of the
temporal bone where several highly sensitive organs define obstacles with
minimal clearance for surgical instruments. Nonlinear trajectories for
potential minimally-invasive interventions can provide larger distances to risk
structures and optimized orientations of surgical instruments, thus improving
clinical outcomes when compared to existing linear approaches. In this paper,
we present fast and accurate planning methods for such nonlinear access paths.
Methods: We define a specific motion planning problem in SE(3) = R3 x SO(3)
with notable constraints in computation time and goal pose that reflect the
requirements of temporal bone surgery.We then present k-RRT-Connect: two
suitable motion planners based on bidirectional Rapidly-exploring Random Trees
(RRT) to solve this problem efficiently. Results: The benefits of k-RRT-Connect
are demonstrated on real CT data of patients. Their general performance is
shown on a large set of realistic synthetic anatomies. We also show that these
new algorithms outperform state of the art methods based on circular arcs or
Bezier-Splines when applied to this specific problem. Conclusion: With this
work we demonstrate that pre- and intra-operative planning of nonlinear access
paths is possible for minimally-invasive surgeries at the otobasis.
| cs.RO | purpose interventions at the otobasis operate in the narrow region of the temporal bone where several highly sensitive organs define obstacles with minimal clearance for surgical instruments nonlinear trajectories for potential minimallyinvasive interventions can provide larger distances to risk structures and optimized orientations of surgical instruments thus improving clinical outcomes when compared to existing linear approaches in this paper we present fast and accurate planning methods for such nonlinear access paths methods we define a specific motion planning problem in se3 r3 x so3 with notable constraints in computation time and goal pose that reflect the requirements of temporal bone surgerywe then present krrtconnect two suitable motion planners based on bidirectional rapidlyexploring random trees rrt to solve this problem efficiently results the benefits of krrtconnect are demonstrated on real ct data of patients their general performance is shown on a large set of realistic synthetic anatomies we also show that these new algorithms outperform state of the art methods based on circular arcs or beziersplines when applied to this specific problem conclusion with this work we demonstrate that pre and intraoperative planning of nonlinear access paths is possible for minimallyinvasive surgeries at the otobasis | [['purpose', 'interventions', 'at', 'the', 'otobasis', 'operate', 'in', 'the', 'narrow', 'region', 'of', 'the', 'temporal', 'bone', 'where', 'several', 'highly', 'sensitive', 'organs', 'define', 'obstacles', 'with', 'minimal', 'clearance', 'for', 'surgical', 'instruments', 'nonlinear', 'trajectories', 'for', 'potential', 'minimallyinvasive', 'interventions', 'can', 'provide', 'larger', 'distances', 'to', 'risk', 'structures', 'and', 'optimized', 'orientations', 'of', 'surgical', 'instruments', 'thus', 'improving', 'clinical', 'outcomes', 'when', 'compared', 'to', 'existing', 'linear', 'approaches', 'in', 'this', 'paper', 'we', 'present', 'fast', 'and', 'accurate', 'planning', 'methods', 'for', 'such', 'nonlinear', 'access', 'paths', 'methods', 'we', 'define', 'a', 'specific', 'motion', 'planning', 'problem', 'in', 'se3', 'r3', 'x', 'so3', 'with', 'notable', 'constraints', 'in', 'computation', 'time', 'and', 'goal', 'pose', 'that', 'reflect', 'the', 'requirements', 'of', 'temporal', 'bone', 'surgerywe', 'then', 'present', 'krrtconnect', 'two', 'suitable', 'motion', 'planners', 'based', 'on', 'bidirectional', 'rapidlyexploring', 'random', 'trees', 'rrt', 'to', 'solve', 'this', 'problem', 'efficiently', 'results', 'the', 'benefits', 'of', 'krrtconnect', 'are', 'demonstrated', 'on', 'real', 'ct', 'data', 'of', 'patients', 'their', 'general', 'performance', 'is', 'shown', 'on', 'a', 'large', 'set', 'of', 'realistic', 'synthetic', 'anatomies', 'we', 'also', 'show', 'that', 'these', 'new', 'algorithms', 'outperform', 'state', 'of', 'the', 'art', 'methods', 'based', 'on', 'circular', 'arcs', 'or', 'beziersplines', 'when', 'applied', 'to', 'this', 'specific', 'problem', 'conclusion', 'with', 'this', 'work', 'we', 'demonstrate', 'that', 'pre', 'and', 'intraoperative', 'planning', 'of', 'nonlinear', 'access', 'paths', 'is', 'possible', 'for', 'minimallyinvasive', 'surgeries', 'at', 'the', 'otobasis']] | [-0.06932214083567391, 0.05656235654432168, -0.0408515460303727, 0.05886565429961031, -0.11626674861775989, -0.15785550153219796, 0.03672178431495806, 0.460576556308413, -0.24244855955352096, -0.2989481652472564, 0.11590256936045641, -0.2421295272899752, -0.17412873352209027, 0.24470500680469373, -0.1575490127681715, 0.1142835394489242, 0.155249176428039, 0.025673884468833032, -0.04090333136542888, -0.25127988702498694, 0.2679762470851277, 0.013142103076654863, 0.3061039417714594, 0.03842336424450549, 0.13346918685760528, 0.029528282894851998, -0.015037825482184106, 0.05031643642925043, -0.12981949332773163, 0.14252651201751818, 0.3278471469579443, 0.1714032094014135, 0.30519740877950446, -0.468256875079997, -0.2174980454146862, 0.08732793243364134, 0.11447984087615314, 0.08898591484559917, -0.007999185913618891, -0.31438457198500475, 0.060893277125556936, -0.10663271123578058, -0.0907295774482686, -0.10009597790516675, 0.008670422055342413, 0.027097097632693166, -0.29734131629440064, 0.04315070754416817, 0.004802766888887879, 0.06477674049761226, -0.09181761092684687, -0.10293847835124867, 0.028222681776164694, 0.16465628688611297, 0.021408218095336665, 0.03810788366195567, 0.12857444694344985, -0.13504204874612077, -0.1861582462021962, 0.374727534182231, 0.021266217038847825, -0.23773711961149138, 0.19303821709423147, -0.09837890445735266, -0.15253190820766713, 0.12552204378137483, 0.24533254532341628, 0.17152025564226936, -0.16525209458632162, 0.012315558197789211, 0.03330172230229475, 0.12463558550943878, 0.055328737540626304, -0.004148086479386969, 0.1532064540760017, 0.22370732517942707, 0.10772644615474533, 0.11590454036721642, -0.11107501999891185, -0.05900914204199154, -0.2267561801189081, -0.12866751117775144, -0.1271947487319344, -0.018408679232457058, -0.10059338258647489, -0.16992543968158413, 0.3695134107764077, 0.22161670138720704, 0.1507261570721389, 0.09442175006087711, 0.349461858881578, 0.025569546174588044, 0.05893715376689525, 0.07287055267110229, 0.17892472473458645, 0.008994638597830496, 0.09570882805533945, -0.22066343542896805, 0.08518572551312242, 0.012658528833274799] |
1,802.07547 | On some realizations of globally exceptional $\varmathbb{Z}_3 \times
\varmathbb{Z}_3 $-symmetric spaces $G/K$, $G=G_2, F_4, E_6$, Part I | R. Lutz introduced the notion of $\varGamma$-symmetric space as a
generalization of the classical notion of symmetric space in 1981, where
$\varGamma$ is a finite abelian group. In the present article, as
$\varGamma=\varmathbb{Z}_3 \times \varmathbb{Z}_3$, we give the automorphisms
$\tilde{\sigma}_3, \tilde{\tau}_3$ of order $3$ on the connected compact
exceptional Lie groups $G=G_2, F_4,E_6$ %and construct
$\varGamma=\varmathbb{Z}_3 \times \varmathbb{Z}_3$ as the elements of order $3$
in $\Aut(G)$, explicitly and determine the structure of the group $G^{\sigma_3}
\cap G^{\tau_3}$ using homomorphism theorem elementary. These amount to some
global realizations of exceptional $\varmathbb{Z}_3 \times
\varmathbb{Z}_3$-symmetric spaces $G/K$, where $(G^{\sigma_3} \cap
G^{\tau_3})_0 \subseteq K \subseteq G^{\sigma_3} \cap G^{\tau_3}$.
| math.DG | r lutz introduced the notion of vargammasymmetric space as a generalization of the classical notion of symmetric space in 1981 where vargamma is a finite abelian group in the present article as vargammavarmathbbz_3 times varmathbbz_3 we give the automorphisms tildesigma_3 tildetau_3 of order 3 on the connected compact exceptional lie groups gg_2 f_4e_6 and construct vargammavarmathbbz_3 times varmathbbz_3 as the elements of order 3 in autg explicitly and determine the structure of the group gsigma_3 cap gtau_3 using homomorphism theorem elementary these amount to some global realizations of exceptional varmathbbz_3 times varmathbbz_3symmetric spaces gk where gsigma_3 cap gtau_3_0 subseteq k subseteq gsigma_3 cap gtau_3 | [['r', 'lutz', 'introduced', 'the', 'notion', 'of', 'vargammasymmetric', 'space', 'as', 'a', 'generalization', 'of', 'the', 'classical', 'notion', 'of', 'symmetric', 'space', 'in', '1981', 'where', 'vargamma', 'is', 'a', 'finite', 'abelian', 'group', 'in', 'the', 'present', 'article', 'as', 'vargammavarmathbbz_3', 'times', 'varmathbbz_3', 'we', 'give', 'the', 'automorphisms', 'tildesigma_3', 'tildetau_3', 'of', 'order', '3', 'on', 'the', 'connected', 'compact', 'exceptional', 'lie', 'groups', 'gg_2', 'f_4e_6', 'and', 'construct', 'vargammavarmathbbz_3', 'times', 'varmathbbz_3', 'as', 'the', 'elements', 'of', 'order', '3', 'in', 'autg', 'explicitly', 'and', 'determine', 'the', 'structure', 'of', 'the', 'group', 'gsigma_3', 'cap', 'gtau_3', 'using', 'homomorphism', 'theorem', 'elementary', 'these', 'amount', 'to', 'some', 'global', 'realizations', 'of', 'exceptional', 'varmathbbz_3', 'times', 'varmathbbz_3symmetric', 'spaces', 'gk', 'where', 'gsigma_3', 'cap', 'gtau_3_0', 'subseteq', 'k', 'subseteq', 'gsigma_3', 'cap', 'gtau_3']] | [-0.17659857252890127, 0.10031632924492055, -0.03469524526859614, 0.03367255763472751, -0.0752690428015875, -0.06324635963252884, 0.040981623232661885, 0.32627365960085647, -0.30285497366430914, -0.21811831360088385, 0.14110054520820764, -0.2382965911813873, -0.10118447653540569, 0.14909936280604055, -0.11083633262426296, -0.10344828063859901, -0.03444169351751817, 0.12285032430960935, -0.09817384777620355, -0.2606838830186926, 0.32854234218161477, -0.057660030884707864, 0.1815149961980654, 0.0058879992290538676, 0.1157018225689597, 0.019136275639113513, -0.024530295376725336, -0.026074073639663648, -0.20752446470841607, 0.08809169775068244, 0.286780481868265, 0.08723653109863083, 0.18179648069595483, -0.35793421347130167, -0.1290645324625075, 0.21315276888298226, 0.13119244618103543, -0.050931505410575326, -0.008186471436737461, -0.25744823905381753, 0.12837229181635887, -0.2141704656966427, -0.15310110187435405, -0.025962946024980952, 0.1386797612414081, -0.0022914498806633848, -0.2558589594103049, -0.010653604225731118, 0.11348751834296483, 0.10438283031606338, -0.028965849416984366, -0.12493973957533215, -0.04958965104231809, 0.07571471567226058, -0.046984055805257816, 0.10813832456652234, 0.07993608692839266, -0.028646732284192074, -0.11731925686051019, 0.41744233306715306, -0.04410558886717054, -0.16434946417451857, 0.1266659932320026, -0.17566162535048863, -0.16584152039734923, 0.10031466709172472, 0.1324113337719377, 0.15983364671627256, -0.008854918846330467, 0.2371481870576006, -0.1489769116123306, 0.05329257275220601, 0.08881223906807482, 0.03688149935407366, 0.07284198152495826, 0.09532387720351602, 0.09696730456136643, 0.11526097870142969, -0.003998073930678731, -0.0022026188095704592, -0.38000094019213415, -0.17547373679724146, -0.11248566915944933, 0.14451875245852513, -0.11884768759463964, -0.1562084726211516, 0.3656520078533349, 0.04169951030238968, 0.16532711876912953, 0.0635145038039364, 0.17076415427157932, 0.022618119915739258, 0.057464653467561334, 0.10314986735404014, 0.06766417334902725, 0.2067621412706819, -0.07857560394009813, -0.15744901283649093, -0.04989254950704251, 0.21443713676838322] |
1,802.07548 | The Banach manifold $C^k(M,N)$ | Let $M$ be a closed manifold and let $N$ be a connected manifold without
boundary. For each $k\in\mathbb{N}$ the set of $k$ times continuously
differentiable maps between $M$ and $N$ has the structure of a smooth Banach
manifold where the underlying manifold topology is the compact-open $C^k$
topology. We provide a detailed and rigorous proof for this important statement
which is already partially covered by existing literature.
| math.DG | let m be a closed manifold and let n be a connected manifold without boundary for each kinmathbbn the set of k times continuously differentiable maps between m and n has the structure of a smooth banach manifold where the underlying manifold topology is the compactopen ck topology we provide a detailed and rigorous proof for this important statement which is already partially covered by existing literature | [['let', 'm', 'be', 'a', 'closed', 'manifold', 'and', 'let', 'n', 'be', 'a', 'connected', 'manifold', 'without', 'boundary', 'for', 'each', 'kinmathbbn', 'the', 'set', 'of', 'k', 'times', 'continuously', 'differentiable', 'maps', 'between', 'm', 'and', 'n', 'has', 'the', 'structure', 'of', 'a', 'smooth', 'banach', 'manifold', 'where', 'the', 'underlying', 'manifold', 'topology', 'is', 'the', 'compactopen', 'ck', 'topology', 'we', 'provide', 'a', 'detailed', 'and', 'rigorous', 'proof', 'for', 'this', 'important', 'statement', 'which', 'is', 'already', 'partially', 'covered', 'by', 'existing', 'literature']] | [-0.20674507544417656, 0.08897938698863805, -0.08059566884315503, 0.025272172787087734, -0.11561347473996567, -0.1919616223799426, 0.028079609803633013, 0.36921802919302416, -0.26668471798523147, -0.24869851765236747, 0.1340083300897073, -0.23825243364414894, -0.12829629163285577, 0.16758737862527148, -0.09421375649633693, -0.04322911991126168, 0.07604379573864724, 0.11055546283501257, -0.07829438915837612, -0.24435836052584614, 0.40315650881671194, -0.05164459684113069, 0.17474743848972357, 0.05913003650841428, 0.12729911663249802, -0.016272524816553984, 0.04149040893248435, 0.07534244004463249, -0.16097997504272568, 0.1151689382082324, 0.3159470808650576, 0.11333439739735071, 0.2691914528198262, -0.40035866484490795, -0.23591307641020906, 0.17697762600632747, 0.1280660623086811, -0.08254899278651479, 0.01816371370996557, -0.3299169319667923, 0.14149973977273747, -0.0522536895196162, -0.12128498160572194, -0.0724431459944862, 0.09260663691796918, -0.045769096696193314, -0.2884084951356679, -0.07158207536132923, 0.12238518539260128, 0.08905501845779258, -0.05216747306551395, -0.09980375583825717, -0.086925291202601, 0.11958498010106051, -0.05998737553356966, 0.19638097608712182, 0.07915587624562766, 0.02563532933578896, -0.06331147110339866, 0.29968067622090233, -0.06317495968915633, -0.28309618064494274, 0.13345575387547934, -0.17091826090255557, -0.13107180278470268, 0.15628117022674476, 0.1162754392195771, 0.15738014272177842, -0.09390537681339531, 0.25833913405623926, -0.11832274564493225, 0.14276576848394834, 0.013105573848501514, -0.02119798187354107, 0.1339403345569301, 0.17452494189866, 0.1792044190467516, 0.09351986895815761, 0.02587299284858824, -0.0384759864728175, -0.3489770306302096, -0.17752372512399262, -0.19503032688551875, 0.21265665021961305, -0.14125631249152687, -0.15475574572250914, 0.34287978165240873, -0.012843974963275355, 0.27024481642935705, 0.08688902632687796, 0.2649636501029356, 0.04307517133250923, -0.008534366299690151, 0.14513878753658996, 0.06671772469113123, 0.18104931843161248, 0.019373097276287294, -0.07373269899998472, 0.039198214195168286, 0.15613715595968847] |
1,802.07549 | Evolution of 3-dimensional Relativistic Current Sheets and Development
of Self-Generated Turbulence | In this paper, the temporal evolution of 3-dimensional relativistic current
sheets in Poynting-dominated plasma is studied for the first time. Over the
past few decades, a lot of efforts have been conducted on studying the
evolution of current sheets in 2-dimensional space, and concluded that
sufficiently long current sheets always evolves into the so-called
"plasmoid-chain", which provides fast reconnection rate independent of its
resistivity. However, it is suspected that plasmoid-chain can exist only in the
case of 2-dimensional approximation, and would show transition to turbulence in
3-dimensional space.
We performed 3-dimensional numerical simulation of relativistic current sheet
using resistive relativistic magnetohydrodynamic approximation. The results
showed that the 3-dimensional current sheet evolve not into plasmoid-chain but
turbulence. The resulting reconnection rate is $0.004$ which is much smaller
than that of plasmoid-chain. The energy conversion from magnetic field to
kinetic energy of turbulence is just 0.01\% which is much smaller than typical
non-relativistic cases. Using the energy principle, we also showed that the
plasmoid is always unstable for a displacement in opposite direction to its
acceleration, probably interchange-type instability, and this always results in
seeds of turbulence behind the plasmoids. Finally, the temperature distribution
along the sheet is discussed, and it is found that the sheet is less active
than plasmoid-chain. Our finding can be applied for many high energy
astrophysical phenomena, and can provide a basic model of the general current
sheet in Poynting-dominated plasma.
| astro-ph.HE astro-ph.SR physics.plasm-ph | in this paper the temporal evolution of 3dimensional relativistic current sheets in poyntingdominated plasma is studied for the first time over the past few decades a lot of efforts have been conducted on studying the evolution of current sheets in 2dimensional space and concluded that sufficiently long current sheets always evolves into the socalled plasmoidchain which provides fast reconnection rate independent of its resistivity however it is suspected that plasmoidchain can exist only in the case of 2dimensional approximation and would show transition to turbulence in 3dimensional space we performed 3dimensional numerical simulation of relativistic current sheet using resistive relativistic magnetohydrodynamic approximation the results showed that the 3dimensional current sheet evolve not into plasmoidchain but turbulence the resulting reconnection rate is 0004 which is much smaller than that of plasmoidchain the energy conversion from magnetic field to kinetic energy of turbulence is just 001 which is much smaller than typical nonrelativistic cases using the energy principle we also showed that the plasmoid is always unstable for a displacement in opposite direction to its acceleration probably interchangetype instability and this always results in seeds of turbulence behind the plasmoids finally the temperature distribution along the sheet is discussed and it is found that the sheet is less active than plasmoidchain our finding can be applied for many high energy astrophysical phenomena and can provide a basic model of the general current sheet in poyntingdominated plasma | [['in', 'this', 'paper', 'the', 'temporal', 'evolution', 'of', '3dimensional', 'relativistic', 'current', 'sheets', 'in', 'poyntingdominated', 'plasma', 'is', 'studied', 'for', 'the', 'first', 'time', 'over', 'the', 'past', 'few', 'decades', 'a', 'lot', 'of', 'efforts', 'have', 'been', 'conducted', 'on', 'studying', 'the', 'evolution', 'of', 'current', 'sheets', 'in', '2dimensional', 'space', 'and', 'concluded', 'that', 'sufficiently', 'long', 'current', 'sheets', 'always', 'evolves', 'into', 'the', 'socalled', 'plasmoidchain', 'which', 'provides', 'fast', 'reconnection', 'rate', 'independent', 'of', 'its', 'resistivity', 'however', 'it', 'is', 'suspected', 'that', 'plasmoidchain', 'can', 'exist', 'only', 'in', 'the', 'case', 'of', '2dimensional', 'approximation', 'and', 'would', 'show', 'transition', 'to', 'turbulence', 'in', '3dimensional', 'space', 'we', 'performed', '3dimensional', 'numerical', 'simulation', 'of', 'relativistic', 'current', 'sheet', 'using', 'resistive', 'relativistic', 'magnetohydrodynamic', 'approximation', 'the', 'results', 'showed', 'that', 'the', '3dimensional', 'current', 'sheet', 'evolve', 'not', 'into', 'plasmoidchain', 'but', 'turbulence', 'the', 'resulting', 'reconnection', 'rate', 'is', '0004', 'which', 'is', 'much', 'smaller', 'than', 'that', 'of', 'plasmoidchain', 'the', 'energy', 'conversion', 'from', 'magnetic', 'field', 'to', 'kinetic', 'energy', 'of', 'turbulence', 'is', 'just', '001', 'which', 'is', 'much', 'smaller', 'than', 'typical', 'nonrelativistic', 'cases', 'using', 'the', 'energy', 'principle', 'we', 'also', 'showed', 'that', 'the', 'plasmoid', 'is', 'always', 'unstable', 'for', 'a', 'displacement', 'in', 'opposite', 'direction', 'to', 'its', 'acceleration', 'probably', 'interchangetype', 'instability', 'and', 'this', 'always', 'results', 'in', 'seeds', 'of', 'turbulence', 'behind', 'the', 'plasmoids', 'finally', 'the', 'temperature', 'distribution', 'along', 'the', 'sheet', 'is', 'discussed', 'and', 'it', 'is', 'found', 'that', 'the', 'sheet', 'is', 'less', 'active', 'than', 'plasmoidchain', 'our', 'finding', 'can', 'be', 'applied', 'for', 'many', 'high', 'energy', 'astrophysical', 'phenomena', 'and', 'can', 'provide', 'a', 'basic', 'model', 'of', 'the', 'general', 'current', 'sheet', 'in', 'poyntingdominated', 'plasma']] | [-0.13534083660160362, 0.18780170891897616, -0.05388457491562218, 0.08300474363523076, -0.04983113363561072, -0.07825313780113032, -0.037064950572938335, 0.3678652171461239, -0.24357230077765465, -0.28139996805224293, 0.07682969389970978, -0.22252967441254676, -0.08189080440980889, 0.25555159747420686, 0.010710778531254682, -0.0016927004670884156, 0.062239042429309416, 0.006952812166833578, -0.047906564000010685, -0.21014674255712348, 0.2720950818150964, 0.12391609055401813, 0.3001860100556117, 0.040406485503867204, 0.06900208294911254, -0.08618148343133952, 0.014125502460472318, 0.08388659719954306, -0.15176570670517578, 0.024064938917500268, 0.1880939793013548, 0.06387625102853965, 0.2608863726705952, -0.48791265139923845, -0.266114843126922, 0.028845039258267362, 0.20911575889598594, 0.10522840662583081, -0.0545432966622442, -0.20460297894871957, 0.083400984098855, -0.15622832198415448, -0.10604483333752039, -0.021077801671294822, 0.05579841328742854, 0.011480091836667207, -0.24133658375643002, 0.11578329239885499, 0.0815346648700759, 0.0077057917594366065, -0.08936729562536777, -0.07952448209925543, -0.05418770340303271, 0.05180379968384369, 0.11180094623280681, 0.09658732450898945, 0.15469478539195183, -0.1458913325232178, -0.0744922514565193, 0.4010575257817307, -0.02747985382549127, -0.1607614438081472, 0.19613863860732625, -0.2415036362877651, -0.09484367426924503, 0.19115615381895218, 0.13982363283042615, 0.09961387503976123, -0.10294739414174349, 0.04728200698402298, -0.0644833005529073, 0.12422499314945815, 0.05279463845656889, -0.037065424527443325, 0.24379021820688196, 0.20762480656384558, 0.049061066061588075, 0.09441690355071662, -0.11046877912697363, -0.10682322831760468, -0.2672517893160394, -0.16991440077260328, -0.16508922781225677, 0.09703807611136583, -0.04537016460530874, -0.16691947399234885, 0.39699140896565027, 0.17829108799112234, 0.15126453753153077, -0.01309517989696559, 0.3111161079573497, 0.14006510069753672, 0.05236214492370099, 0.14597590971046603, 0.3059392290833394, 0.1292471923723481, 0.1304565900052366, -0.17363844764026184, 0.06831008569905014, 0.04188996268528246] |
1,802.0755 | Noncommutative Gauge Theory and Gravity in Three Dimensions | The Einstein-Hilbert action in three dimensions and the transformation rules
for the dreibein and spin connection can be naturally described in terms of
gauge theory. In this spirit, we use covariant coordinates in noncommutative
gauge theory in order to describe 3D gravity in the framework of noncommutative
geometry. We consider 3D noncommutative spaces based on SU(2) and SU(1,1), as
foliations of fuzzy 2-spheres and fuzzy 2-hyperboloids respectively. Then we
construct a U(2)$\times$ U(2) and a GL(2,$\mathbb{C}$) gauge theory on them,
identifying the corresponding noncommutative vielbein and spin connection. We
determine the transformations of the fields and an action in terms of a matrix
model and discuss its relation to 3D gravity.
| hep-th | the einsteinhilbert action in three dimensions and the transformation rules for the dreibein and spin connection can be naturally described in terms of gauge theory in this spirit we use covariant coordinates in noncommutative gauge theory in order to describe 3d gravity in the framework of noncommutative geometry we consider 3d noncommutative spaces based on su2 and su11 as foliations of fuzzy 2spheres and fuzzy 2hyperboloids respectively then we construct a u2times u2 and a gl2mathbbc gauge theory on them identifying the corresponding noncommutative vielbein and spin connection we determine the transformations of the fields and an action in terms of a matrix model and discuss its relation to 3d gravity | [['the', 'einsteinhilbert', 'action', 'in', 'three', 'dimensions', 'and', 'the', 'transformation', 'rules', 'for', 'the', 'dreibein', 'and', 'spin', 'connection', 'can', 'be', 'naturally', 'described', 'in', 'terms', 'of', 'gauge', 'theory', 'in', 'this', 'spirit', 'we', 'use', 'covariant', 'coordinates', 'in', 'noncommutative', 'gauge', 'theory', 'in', 'order', 'to', 'describe', '3d', 'gravity', 'in', 'the', 'framework', 'of', 'noncommutative', 'geometry', 'we', 'consider', '3d', 'noncommutative', 'spaces', 'based', 'on', 'su2', 'and', 'su11', 'as', 'foliations', 'of', 'fuzzy', '2spheres', 'and', 'fuzzy', '2hyperboloids', 'respectively', 'then', 'we', 'construct', 'a', 'u2times', 'u2', 'and', 'a', 'gl2mathbbc', 'gauge', 'theory', 'on', 'them', 'identifying', 'the', 'corresponding', 'noncommutative', 'vielbein', 'and', 'spin', 'connection', 'we', 'determine', 'the', 'transformations', 'of', 'the', 'fields', 'and', 'an', 'action', 'in', 'terms', 'of', 'a', 'matrix', 'model', 'and', 'discuss', 'its', 'relation', 'to', '3d', 'gravity']] | [-0.12421182836405933, 0.12636742033077594, -0.07299212788268712, 0.10923268654785881, -0.08362036949362267, -0.10170468522913077, -0.041884146333375775, 0.3400475980650464, -0.2308712021744048, -0.253740274051035, 0.07769380838462067, -0.2424806921912188, -0.2267630445855585, 0.09350232817020944, -0.11858938325365836, 0.00535713647947308, -0.06411572350400754, 0.09502429318910634, -0.18206613279921427, -0.23337570176756178, 0.3740346554370428, -0.01826439903710376, 0.24096546060702, 0.0025349976240911266, 0.17922729408283802, 0.04589924811046909, -0.041640112815763464, 0.021975083031098953, -0.12831610160964457, 0.1388862399897665, 0.22038308191536501, 0.07290204782462255, 0.12521983730522068, -0.44679225121032107, -0.18831575241532517, 0.07272045275365764, 0.10308426775207574, 0.09554950304710391, 0.01411798220678148, -0.3299721541983837, 0.023147056533277713, -0.2057704837569459, -0.13903394921322945, -0.14734266022939912, 0.00014374287037009542, -0.09008729936216366, -0.2319786759601398, 0.034096098511409684, 0.03691816551250998, 0.06980156130157411, -0.0951527187653648, -0.014335565633055838, -0.03109167523004792, 0.06508702551099387, 0.04678140862379223, 0.0813611633440649, 0.09613203371620992, -0.13631873927290805, -0.16790956464299764, 0.4132874762808735, -0.0712224154362709, -0.32263291845606135, 0.12381410101132298, -0.12808081555095585, -0.18585289930924773, -0.013694358663633466, 0.16162192656404592, 0.15948629204437814, -0.12478836496275934, 0.21507883469411437, -0.04237539646723731, 0.09332684820771894, 0.0873319280989976, 0.04082192783667283, 0.20802838474681432, 0.07192918275567618, 0.028747760542583736, 0.1292389973606491, -0.01999978695133574, -0.17452242967238735, -0.3767343959686431, -0.19464848365592347, -0.09795087875417349, 0.08024861653843386, -0.16378750679062, -0.15070341183507646, 0.40120736284350805, 0.13992913469449955, 0.1514133158819856, 0.0441668953534893, 0.20088412493086336, 0.11517339799108661, 0.054213813216086815, 0.00967749548567967, 0.20724040931090712, 0.24191783579405057, 0.02278757014798678, -0.21637891410341994, -0.15749817633239382, 0.2243312423032793] |
1,802.07551 | On detectability of labeled Petri nets and finite automata | We study detectability properties for labeled Petri nets and finite automata.
We first study weak approximate detectability (WAD) that implies that there
exists an infinite observed output sequence of the system such that each prefix
of the output sequence with length greater than a given value allows an
observer to determine if the current state belongs to a given set. We also
consider two new concepts called instant strong detectability (ISD) and
eventual strong detectability (ESD). The former property implies that for each
possible infinite observed output sequence each prefix of the output sequence
allows reconstructing the current state. The latter implies that for each
possible infinite observed output sequence, there exists a value such that each
prefix of the output sequence with length greater than that value allows
reconstructing the current state.
Results: WAD: undecidable for labeled Petri nets, PSPACE-complete for finite
automata ISD: decidable and EXPSPACE-hard for labeled Petri nets, belongs to P
for finite automata ESD: decidable under promptness assumption and
EXPSPACE-hard for labeled Petri nets, belongs to P for finite automata SD:
belongs to P for finite automata, strengthens Shu and Lin's 2011 results based
on two assumptions of deadlock-freeness and promptness ISD<SD<ESD<WD<WAD for
both labeled Petri nets and finite automata
| math.OC cs.LO | we study detectability properties for labeled petri nets and finite automata we first study weak approximate detectability wad that implies that there exists an infinite observed output sequence of the system such that each prefix of the output sequence with length greater than a given value allows an observer to determine if the current state belongs to a given set we also consider two new concepts called instant strong detectability isd and eventual strong detectability esd the former property implies that for each possible infinite observed output sequence each prefix of the output sequence allows reconstructing the current state the latter implies that for each possible infinite observed output sequence there exists a value such that each prefix of the output sequence with length greater than that value allows reconstructing the current state results wad undecidable for labeled petri nets pspacecomplete for finite automata isd decidable and expspacehard for labeled petri nets belongs to p for finite automata esd decidable under promptness assumption and expspacehard for labeled petri nets belongs to p for finite automata sd belongs to p for finite automata strengthens shu and lins 2011 results based on two assumptions of deadlockfreeness and promptness isdsdesdwdwad for both labeled petri nets and finite automata | [['we', 'study', 'detectability', 'properties', 'for', 'labeled', 'petri', 'nets', 'and', 'finite', 'automata', 'we', 'first', 'study', 'weak', 'approximate', 'detectability', 'wad', 'that', 'implies', 'that', 'there', 'exists', 'an', 'infinite', 'observed', 'output', 'sequence', 'of', 'the', 'system', 'such', 'that', 'each', 'prefix', 'of', 'the', 'output', 'sequence', 'with', 'length', 'greater', 'than', 'a', 'given', 'value', 'allows', 'an', 'observer', 'to', 'determine', 'if', 'the', 'current', 'state', 'belongs', 'to', 'a', 'given', 'set', 'we', 'also', 'consider', 'two', 'new', 'concepts', 'called', 'instant', 'strong', 'detectability', 'isd', 'and', 'eventual', 'strong', 'detectability', 'esd', 'the', 'former', 'property', 'implies', 'that', 'for', 'each', 'possible', 'infinite', 'observed', 'output', 'sequence', 'each', 'prefix', 'of', 'the', 'output', 'sequence', 'allows', 'reconstructing', 'the', 'current', 'state', 'the', 'latter', 'implies', 'that', 'for', 'each', 'possible', 'infinite', 'observed', 'output', 'sequence', 'there', 'exists', 'a', 'value', 'such', 'that', 'each', 'prefix', 'of', 'the', 'output', 'sequence', 'with', 'length', 'greater', 'than', 'that', 'value', 'allows', 'reconstructing', 'the', 'current', 'state', 'results', 'wad', 'undecidable', 'for', 'labeled', 'petri', 'nets', 'pspacecomplete', 'for', 'finite', 'automata', 'isd', 'decidable', 'and', 'expspacehard', 'for', 'labeled', 'petri', 'nets', 'belongs', 'to', 'p', 'for', 'finite', 'automata', 'esd', 'decidable', 'under', 'promptness', 'assumption', 'and', 'expspacehard', 'for', 'labeled', 'petri', 'nets', 'belongs', 'to', 'p', 'for', 'finite', 'automata', 'sd', 'belongs', 'to', 'p', 'for', 'finite', 'automata', 'strengthens', 'shu', 'and', 'lins', '2011', 'results', 'based', 'on', 'two', 'assumptions', 'of', 'deadlockfreeness', 'and', 'promptness', 'isdsdesdwdwad', 'for', 'both', 'labeled', 'petri', 'nets', 'and', 'finite', 'automata']] | [-0.1283050062061817, 0.1447749401457829, 0.022558929368981396, 0.13112558440451383, -0.10023864439012957, -0.19368598898918385, 0.104717909558174, 0.3746458590578507, -0.30143273000915843, -0.2033104057761603, 0.08740395234952517, -0.25603778297262775, -0.07430266718581027, 0.1632622190529718, -0.1094750530342115, 0.0684109713354915, 0.10964571659161604, 0.10291418911519405, -0.027492589369192535, -0.21788497515794292, 0.30792960704603306, -0.04612444017730726, 0.25833311951354, -0.009889860045422763, 0.13989957745013504, 0.04476351683900016, 0.025094592441603832, 0.055611659021701156, -0.1189734342568437, 0.02261459632484498, 0.28446507053084524, 0.24143833772270193, 0.24914291758071996, -0.38321865507054564, -0.14951689258747386, 0.2518680689619014, 0.09705637091332499, 0.10342948342668916, -0.011860669515775881, -0.2492303299060201, 0.18794783275898583, -0.17886471235211573, -0.0709052276169863, -0.007969070890206187, 0.11622187712426096, 0.039505358942893934, -0.282715030626266, -0.04614456647258896, 0.1835431787447876, 0.08441455322135166, -0.06542174466263603, -0.118880490796608, -0.0462255262365729, 0.09896021347730329, -0.02672573664127484, 0.028032568424903585, 0.029608676394940737, -0.06978583175634198, -0.1858151706566751, 0.3020364259844463, -0.07633137339272413, -0.18895954220080932, 0.19172371323471524, -0.10210283672695011, -0.18636241595802358, 0.14586254033801035, 0.08354777272553275, 0.10344113783760216, -0.08720459415595613, 0.0778949716857146, -0.09951200254042358, 0.2393209399591547, 0.10861661303423199, 0.018165979570910044, 0.18555373956412807, 0.19151760253817865, 0.09185058142368992, 0.19251326234399468, -0.03011755824035408, -0.09767144229251654, -0.3040229452878931, -0.11737306920622359, -0.14745543087494797, 0.027864663437118426, -0.06506306821357416, -0.21937519552953103, 0.335299390701431, 0.19022799212732078, 0.15127779898580676, 0.2278026749491783, 0.24122133056117295, 0.12091209299529403, 0.04123326485026993, 0.08810244681423202, 0.09990381551723854, 0.14829320713133534, 0.063278181334574, -0.21785312776873803, 0.1262878443790125, 0.15123951105017433] |
1,802.07552 | On the Short GRB GeV emission from a Kerr Black hole | It has recently become clear that in both short and long gamma-ray bursts
(GRBs) it coexists a sequence of different events, each characterized by
specific physical processes and corresponding values of the Lorentz gamma
factors. The ultra-relativistic prompt emission (UPE) phase, with Lorentz
factor $\Gamma\leq10^4$, is followed by a mildly relativistic plateau-afterglow
phase with $\Gamma\lesssim2$. The GeV radiation, with $\Gamma\lesssim50$,
coexists with the above two phases. It is shown that: a) the GeV radiation
originates at the onset of the formation of a black hole (BH), b) its
luminosity follows specific power-law dependence when measured in the rest
frame of the source with a decay index $\gamma=-1.29\pm0.06$ in the case of the
short GRBs, and $\gamma=-1.20\pm0.04$ in the case of the long GRBs, c) these
energetics requirements are used to derive the mass and spin of the BH
originating this extended GeV emission. We present these conceptual results for
the case of short GRBs in this article and give the extended analysis for long
GRBs in a companion article. A direct astrophysical application of these
results is that the merger of binary neutron stars leading to BH formation
emits GeV radiation: the GeV emission is a necessary and sufficient condition
to indicate the creation of a BH in S-GRBs.
| astro-ph.HE astro-ph.CO | it has recently become clear that in both short and long gammaray bursts grbs it coexists a sequence of different events each characterized by specific physical processes and corresponding values of the lorentz gamma factors the ultrarelativistic prompt emission upe phase with lorentz factor gammaleq104 is followed by a mildly relativistic plateauafterglow phase with gammalesssim2 the gev radiation with gammalesssim50 coexists with the above two phases it is shown that a the gev radiation originates at the onset of the formation of a black hole bh b its luminosity follows specific powerlaw dependence when measured in the rest frame of the source with a decay index gamma129pm006 in the case of the short grbs and gamma120pm004 in the case of the long grbs c these energetics requirements are used to derive the mass and spin of the bh originating this extended gev emission we present these conceptual results for the case of short grbs in this article and give the extended analysis for long grbs in a companion article a direct astrophysical application of these results is that the merger of binary neutron stars leading to bh formation emits gev radiation the gev emission is a necessary and sufficient condition to indicate the creation of a bh in sgrbs | [['it', 'has', 'recently', 'become', 'clear', 'that', 'in', 'both', 'short', 'and', 'long', 'gammaray', 'bursts', 'grbs', 'it', 'coexists', 'a', 'sequence', 'of', 'different', 'events', 'each', 'characterized', 'by', 'specific', 'physical', 'processes', 'and', 'corresponding', 'values', 'of', 'the', 'lorentz', 'gamma', 'factors', 'the', 'ultrarelativistic', 'prompt', 'emission', 'upe', 'phase', 'with', 'lorentz', 'factor', 'gammaleq104', 'is', 'followed', 'by', 'a', 'mildly', 'relativistic', 'plateauafterglow', 'phase', 'with', 'gammalesssim2', 'the', 'gev', 'radiation', 'with', 'gammalesssim50', 'coexists', 'with', 'the', 'above', 'two', 'phases', 'it', 'is', 'shown', 'that', 'a', 'the', 'gev', 'radiation', 'originates', 'at', 'the', 'onset', 'of', 'the', 'formation', 'of', 'a', 'black', 'hole', 'bh', 'b', 'its', 'luminosity', 'follows', 'specific', 'powerlaw', 'dependence', 'when', 'measured', 'in', 'the', 'rest', 'frame', 'of', 'the', 'source', 'with', 'a', 'decay', 'index', 'gamma129pm006', 'in', 'the', 'case', 'of', 'the', 'short', 'grbs', 'and', 'gamma120pm004', 'in', 'the', 'case', 'of', 'the', 'long', 'grbs', 'c', 'these', 'energetics', 'requirements', 'are', 'used', 'to', 'derive', 'the', 'mass', 'and', 'spin', 'of', 'the', 'bh', 'originating', 'this', 'extended', 'gev', 'emission', 'we', 'present', 'these', 'conceptual', 'results', 'for', 'the', 'case', 'of', 'short', 'grbs', 'in', 'this', 'article', 'and', 'give', 'the', 'extended', 'analysis', 'for', 'long', 'grbs', 'in', 'a', 'companion', 'article', 'a', 'direct', 'astrophysical', 'application', 'of', 'these', 'results', 'is', 'that', 'the', 'merger', 'of', 'binary', 'neutron', 'stars', 'leading', 'to', 'bh', 'formation', 'emits', 'gev', 'radiation', 'the', 'gev', 'emission', 'is', 'a', 'necessary', 'and', 'sufficient', 'condition', 'to', 'indicate', 'the', 'creation', 'of', 'a', 'bh', 'in', 'sgrbs']] | [-0.10349228572767925, 0.19129551273800452, -0.05970037625867442, 0.15676706853285982, -0.0760298682677243, -0.09739572931484783, 0.020925094808791327, 0.4024990207786337, -0.19072612302978248, -0.2843972004931695, 0.04181858720062897, -0.28778104107882, -0.00303602559042388, 0.21741648469867358, 0.02435486973836798, -0.013582114389684083, 0.061568925895824515, 0.0016786543023887233, -0.08792841815609907, -0.19607293852226432, 0.30756439979353306, 0.10716474454005805, 0.1944684263816553, 0.05350912555253932, 0.09022991007579298, -0.031079428080065644, -0.01615363338232738, -0.051633330059737845, -0.13329716102076605, 0.029258340113140237, 0.22225373497076809, 0.1083066293171474, 0.19747901792618505, -0.35157584070039943, -0.23543872813386796, 0.10179286085876632, 0.10835349415383058, 0.04239475676156764, -0.08539079989061756, -0.2813544047490597, 0.0750175132072104, -0.24111100336653754, -0.13404052690981333, 0.06086031138309704, 0.06620658105560417, 0.042023515188263666, -0.2307660360109483, 0.13291030183200508, 0.08208162614013632, -0.02269351744583895, -0.07414155321487047, -0.00991326181465769, -0.005897113979963834, 0.04650067584374071, 0.14098684428250555, 0.07356487874978501, 0.1309759372528734, -0.12578969464288667, -0.10814088132585688, 0.4224541695063631, -0.03985019349332514, -0.04748530347781082, 0.2075584818026409, -0.21148775168701725, -0.15805820597042078, 0.19014351688362108, 0.1259094305953534, 0.10936114397972335, -0.15326767581495804, 0.01931716302659803, 0.006951872943533502, 0.18192253551294504, 0.04570267079489792, 0.06442798717231879, 0.2877556530499528, 0.16623530360087843, -0.011137084980389754, 0.13829518017861442, -0.1483599094839152, -0.020217980524258956, -0.35018496466066523, -0.11158715375341255, -0.14314498169017323, 0.12962033656331726, -0.091923805793261, -0.12042006173356336, 0.40105815066410033, 0.08037081457117659, 0.22191430284673797, 0.021753353859284168, 0.24851119567369445, 0.12264449742428839, 0.051882756200419475, 0.11807136644100028, 0.3229456019537349, 0.14258796758284525, 0.127657236123063, -0.20913804845948672, 0.054889608300726846, 0.018128482143169845] |
1,802.07553 | On a family of a linear maps from $M_{n}(\mathbb{C})$ to
$M_{n^{2}}(\mathbb{C})$ | Bhat characterizes the family of linear maps defined on $B(\mathcal{H})$
which preserve unitary conjugation. We generalize this idea and study the maps
with a similar equivariance property on finite-dimensional matrix algebras. We
show that the maps with equivariance property are significant to study
$k$-positivity of linear maps defined on finite-dimensional matrix algebras.
Choi showed that $n$-positivity is different from $(n-1)$-positivity for the
linear maps defined on $n$ by $n$ matrix algebras. In this paper, we present a
parametric family of linear maps $\Phi_{\alpha, \beta,n} : M_{n}(\mathbb{C})
\rightarrow M_{n^{2}}(\mathbb{C})$ and study the properties of positivity,
completely positivity, decomposability etc. We determine values of parameters
$\alpha$ and $\beta$ for which the family of maps $\Phi_{\alpha, \beta,n}$ is
positive for any natural number $n \geq 3$. We focus on the case of $n=3,$ that
is, $\Phi_{\alpha, \beta,3}$ and study the properties of $2$-positivity,
completely positivity and decomposability. In particular, we give values of
parameters $\alpha$ and $\beta$ for which the family of maps $\Phi_{\alpha,
\beta,3}$ is $2$-positive and not completely positive.
| math-ph math.MP quant-ph | bhat characterizes the family of linear maps defined on bmathcalh which preserve unitary conjugation we generalize this idea and study the maps with a similar equivariance property on finitedimensional matrix algebras we show that the maps with equivariance property are significant to study kpositivity of linear maps defined on finitedimensional matrix algebras choi showed that npositivity is different from n1positivity for the linear maps defined on n by n matrix algebras in this paper we present a parametric family of linear maps phi_alpha betan m_nmathbbc rightarrow m_n2mathbbc and study the properties of positivity completely positivity decomposability etc we determine values of parameters alpha and beta for which the family of maps phi_alpha betan is positive for any natural number n geq 3 we focus on the case of n3 that is phi_alpha beta3 and study the properties of 2positivity completely positivity and decomposability in particular we give values of parameters alpha and beta for which the family of maps phi_alpha beta3 is 2positive and not completely positive | [['bhat', 'characterizes', 'the', 'family', 'of', 'linear', 'maps', 'defined', 'on', 'bmathcalh', 'which', 'preserve', 'unitary', 'conjugation', 'we', 'generalize', 'this', 'idea', 'and', 'study', 'the', 'maps', 'with', 'a', 'similar', 'equivariance', 'property', 'on', 'finitedimensional', 'matrix', 'algebras', 'we', 'show', 'that', 'the', 'maps', 'with', 'equivariance', 'property', 'are', 'significant', 'to', 'study', 'kpositivity', 'of', 'linear', 'maps', 'defined', 'on', 'finitedimensional', 'matrix', 'algebras', 'choi', 'showed', 'that', 'npositivity', 'is', 'different', 'from', 'n1positivity', 'for', 'the', 'linear', 'maps', 'defined', 'on', 'n', 'by', 'n', 'matrix', 'algebras', 'in', 'this', 'paper', 'we', 'present', 'a', 'parametric', 'family', 'of', 'linear', 'maps', 'phi_alpha', 'betan', 'm_nmathbbc', 'rightarrow', 'm_n2mathbbc', 'and', 'study', 'the', 'properties', 'of', 'positivity', 'completely', 'positivity', 'decomposability', 'etc', 'we', 'determine', 'values', 'of', 'parameters', 'alpha', 'and', 'beta', 'for', 'which', 'the', 'family', 'of', 'maps', 'phi_alpha', 'betan', 'is', 'positive', 'for', 'any', 'natural', 'number', 'n', 'geq', '3', 'we', 'focus', 'on', 'the', 'case', 'of', 'n3', 'that', 'is', 'phi_alpha', 'beta3', 'and', 'study', 'the', 'properties', 'of', '2positivity', 'completely', 'positivity', 'and', 'decomposability', 'in', 'particular', 'we', 'give', 'values', 'of', 'parameters', 'alpha', 'and', 'beta', 'for', 'which', 'the', 'family', 'of', 'maps', 'phi_alpha', 'beta3', 'is', '2positive', 'and', 'not', 'completely', 'positive']] | [-0.13002804771815313, 0.12032336329263295, -0.007503108450824894, 0.03275733105639541, -0.02537948736443934, -0.146585483927416, -0.014807145917651856, 0.3598722953621934, -0.29677968087219975, -0.1887489964606286, 0.12194266902686028, -0.2670724784796376, -0.18568797185080035, 0.16765019552968158, -0.07731755171822975, 0.054989127032125155, 0.00825787990399432, 0.02936592894299637, -0.13465904017268657, -0.2438201313219374, 0.4143522861300082, -0.01777578542071463, 0.20061187219533433, 0.027401914784582558, 0.12956298947640946, 0.022588441558338408, -0.04273102601717522, -0.004634825847815813, -0.20584053862991666, 0.08043734604498462, 0.22305239277832187, 0.15160107868581602, 0.19049378379997683, -0.3113349747912186, -0.1419029473664279, 0.2098202626107306, 0.09696619798395238, 0.005682118977391638, -0.01970152541918385, -0.24143935401963706, 0.12253860126124559, -0.11670110612630663, -0.10865685630237638, -0.10159913335767824, 0.06614721526687102, 0.02042811599747482, -0.31255295439680086, 0.039477790284209044, 0.14781784057253744, 0.10388167556261689, -0.06311519104680728, -0.1422205423743169, -0.049471942157053, 0.09974192876493694, -0.041424756960534465, 0.0009013401960567912, 0.07709669366353987, -0.07381874060814791, -0.07099398196158113, 0.311370352406279, -0.06900973861792875, -0.25086593855081535, 0.12711549286940704, -0.1947245168266818, -0.22420566104261613, 0.07068278563844903, 0.11451722065940863, 0.13619842472281762, -0.0703198434131947, 0.20379880088326102, -0.1450244356060355, 0.13124153112265757, 0.08758505042812718, 0.025195588423052757, 0.09395558341184812, 0.02275512828463234, 0.11662571653780504, 0.1595141102514434, 0.023746783454709392, -0.026331993620615543, -0.32208883986104186, -0.16935130908926269, -0.13786336703498553, 0.12827116650504006, -0.1066038339455057, -0.16557295982748632, 0.39827387854627266, 0.08093930412209507, 0.2515148056966321, 0.15752648333550384, 0.1634567103337315, 0.11816574403414185, 0.050720560715090846, 0.04577056022940158, 0.14135250446341205, 0.20723692956522516, -0.01136080741246299, -0.17931409211397717, 0.03501237970322552, 0.1616610671370858] |
1,802.07554 | Can the relativistic light bending model explain X-ray spectral
variations of Seyfert galaxies? | Many Seyfert galaxies are known to exhibit Fe-K broad emission line features
in their X-ray energy spectra. The observed lines have three distinct features;
(1) the line profiles are skewed and show significant low-energy tails, (2) the
Fe-K band have low variability, which produces a broad and deep dip in the
root-mean-square (rms) spectra, and (3) photons in this band have time lags
behind those in the adjacent energy bands with amplitudes of several $R_g/c$,
where $R_g$ is the gravitational radius. The "relativistic light bending model"
is proposed to explain these observed features, where a compact X-ray source
(lamp post) above an extreme Kerr black hole illuminates the innermost area of
the accretion disc. In this paper, we critically examine the relativistic light
bending model by computing the rms spectra and the lag features using a
ray-tracing technique, when a lamp post moves vertically on the black hole spin
axis. As a result, we found that the observed deep rms dip requires that the
iron is extremely overabundant ($\gtrsim10$ solar), whereas the observed lag
amplitude is consistent with the normal iron abundance. Furthermore,
disappearance of the lag in the high-flux state requires a source height as
high as $\sim40\,R_g$, which contradicts the relativistically broad emission
line feature. Our simulations agree with the data that the reverberation
feature moves to lower frequencies with larger source height, however, if this
scenario is correct, the simulations predict detection of a clear Fe-K lag at
low frequencies, which is not constrained in the data. Therefore, we conclude
that the relativistic light bending model may not explain the characteristic
Fe-K spectral variations in Seyfert galaxies.
| astro-ph.HE | many seyfert galaxies are known to exhibit fek broad emission line features in their xray energy spectra the observed lines have three distinct features 1 the line profiles are skewed and show significant lowenergy tails 2 the fek band have low variability which produces a broad and deep dip in the rootmeansquare rms spectra and 3 photons in this band have time lags behind those in the adjacent energy bands with amplitudes of several r_gc where r_g is the gravitational radius the relativistic light bending model is proposed to explain these observed features where a compact xray source lamp post above an extreme kerr black hole illuminates the innermost area of the accretion disc in this paper we critically examine the relativistic light bending model by computing the rms spectra and the lag features using a raytracing technique when a lamp post moves vertically on the black hole spin axis as a result we found that the observed deep rms dip requires that the iron is extremely overabundant gtrsim10 solar whereas the observed lag amplitude is consistent with the normal iron abundance furthermore disappearance of the lag in the highflux state requires a source height as high as sim40r_g which contradicts the relativistically broad emission line feature our simulations agree with the data that the reverberation feature moves to lower frequencies with larger source height however if this scenario is correct the simulations predict detection of a clear fek lag at low frequencies which is not constrained in the data therefore we conclude that the relativistic light bending model may not explain the characteristic fek spectral variations in seyfert galaxies | [['many', 'seyfert', 'galaxies', 'are', 'known', 'to', 'exhibit', 'fek', 'broad', 'emission', 'line', 'features', 'in', 'their', 'xray', 'energy', 'spectra', 'the', 'observed', 'lines', 'have', 'three', 'distinct', 'features', '1', 'the', 'line', 'profiles', 'are', 'skewed', 'and', 'show', 'significant', 'lowenergy', 'tails', '2', 'the', 'fek', 'band', 'have', 'low', 'variability', 'which', 'produces', 'a', 'broad', 'and', 'deep', 'dip', 'in', 'the', 'rootmeansquare', 'rms', 'spectra', 'and', '3', 'photons', 'in', 'this', 'band', 'have', 'time', 'lags', 'behind', 'those', 'in', 'the', 'adjacent', 'energy', 'bands', 'with', 'amplitudes', 'of', 'several', 'r_gc', 'where', 'r_g', 'is', 'the', 'gravitational', 'radius', 'the', 'relativistic', 'light', 'bending', 'model', 'is', 'proposed', 'to', 'explain', 'these', 'observed', 'features', 'where', 'a', 'compact', 'xray', 'source', 'lamp', 'post', 'above', 'an', 'extreme', 'kerr', 'black', 'hole', 'illuminates', 'the', 'innermost', 'area', 'of', 'the', 'accretion', 'disc', 'in', 'this', 'paper', 'we', 'critically', 'examine', 'the', 'relativistic', 'light', 'bending', 'model', 'by', 'computing', 'the', 'rms', 'spectra', 'and', 'the', 'lag', 'features', 'using', 'a', 'raytracing', 'technique', 'when', 'a', 'lamp', 'post', 'moves', 'vertically', 'on', 'the', 'black', 'hole', 'spin', 'axis', 'as', 'a', 'result', 'we', 'found', 'that', 'the', 'observed', 'deep', 'rms', 'dip', 'requires', 'that', 'the', 'iron', 'is', 'extremely', 'overabundant', 'gtrsim10', 'solar', 'whereas', 'the', 'observed', 'lag', 'amplitude', 'is', 'consistent', 'with', 'the', 'normal', 'iron', 'abundance', 'furthermore', 'disappearance', 'of', 'the', 'lag', 'in', 'the', 'highflux', 'state', 'requires', 'a', 'source', 'height', 'as', 'high', 'as', 'sim40r_g', 'which', 'contradicts', 'the', 'relativistically', 'broad', 'emission', 'line', 'feature', 'our', 'simulations', 'agree', 'with', 'the', 'data', 'that', 'the', 'reverberation', 'feature', 'moves', 'to', 'lower', 'frequencies', 'with', 'larger', 'source', 'height', 'however', 'if', 'this', 'scenario', 'is', 'correct', 'the', 'simulations', 'predict', 'detection', 'of', 'a', 'clear', 'fek', 'lag', 'at', 'low', 'frequencies', 'which', 'is', 'not', 'constrained', 'in', 'the', 'data', 'therefore', 'we', 'conclude', 'that', 'the', 'relativistic', 'light', 'bending', 'model', 'may', 'not', 'explain', 'the', 'characteristic', 'fek', 'spectral', 'variations', 'in', 'seyfert', 'galaxies']] | [-0.06816335376282828, 0.11550529118283041, -0.06793061623238997, 0.12373718756058887, -0.06279569708518892, -0.15776659562044731, 0.005568097770079056, 0.47803730946241924, -0.19933901581345004, -0.33730767622285396, 0.04459311610925597, -0.31910094338361883, -0.041353840579981586, 0.19783410891374664, -0.036211805837055785, -0.01970638309693705, 0.023108364176351343, -0.050933684989269895, -0.05786550187654655, -0.1348007078175208, 0.27757105014207306, 0.10537590515227697, 0.23825590710283767, 0.03055406023997495, 0.029616442013040294, -0.07126483517613688, -0.017854835360300584, -0.0034042314525008148, -0.07232143418384339, 0.05620802646038922, 0.2530578155621028, 0.07998195259059783, 0.20187389678200604, -0.3620148018231013, -0.2673761031926232, 0.058378205296659644, 0.15913480878063238, 0.05712729416740885, -0.041172743539523236, -0.22710351692166414, 0.03888909918945075, -0.1439343178177384, -0.17096779586186417, 0.05818572917002769, 0.06169884911734874, 0.006977323262232138, -0.17909903732649604, 0.11523308588596941, 0.061896725888381326, 0.06089277609968108, -0.09865611984626456, -0.0751883599315995, -0.04636275689688868, 0.03911135809162379, 0.08445964582293852, 0.027263748781499366, 0.1803704297509119, -0.09258832112621156, -0.06656725096010402, 0.3897826943726566, -0.09277417360143701, -0.014212890334261173, 0.16709303055443286, -0.22713328318126833, -0.13032106860613513, 0.24328139130559276, 0.12380560800488553, 0.12120882238064058, -0.08053769482773353, -0.0009978712433827937, -0.04414229421074879, 0.2683280803311658, 0.061861767779800306, 0.05353688645837863, 0.3090225094202283, 0.09546114945936547, -0.005818444796877681, 0.09381458571645497, -0.25603602256203506, -0.02013034403469538, -0.2739266992363123, -0.0648727179046194, -0.1421247322430841, 0.050518414795984685, -0.11093646662502782, -0.16630787317828036, 0.4013316863420728, 0.10431246983872373, 0.2568625057484871, 0.046585187241071524, 0.3201495854627189, 0.12826506776750765, 0.07103360481785272, 0.11601989213758075, 0.3428551100218689, 0.11874458916506082, 0.13130305651886923, -0.24165789922958994, 0.06098796622862271, -0.02348660892152598] |
1,802.07555 | $C^1$ analysis of 2D subdivision schemes refining point-normal pairs
with the circle average | This article continues the investigation started in [9] on subdivision
schemes refining 2D point-normal pairs, obtained by modifying linear
subdivision schemes using the circle average. While in [9] the convergence of
the Modified Lane-Riesenfeld algorithm and the Modified 4-Point schemes is
proved, here we show that the curves generated by these two schemes are $C^1$.
| cs.GR | this article continues the investigation started in 9 on subdivision schemes refining 2d pointnormal pairs obtained by modifying linear subdivision schemes using the circle average while in 9 the convergence of the modified laneriesenfeld algorithm and the modified 4point schemes is proved here we show that the curves generated by these two schemes are c1 | [['this', 'article', 'continues', 'the', 'investigation', 'started', 'in', '9', 'on', 'subdivision', 'schemes', 'refining', '2d', 'pointnormal', 'pairs', 'obtained', 'by', 'modifying', 'linear', 'subdivision', 'schemes', 'using', 'the', 'circle', 'average', 'while', 'in', '9', 'the', 'convergence', 'of', 'the', 'modified', 'laneriesenfeld', 'algorithm', 'and', 'the', 'modified', '4point', 'schemes', 'is', 'proved', 'here', 'we', 'show', 'that', 'the', 'curves', 'generated', 'by', 'these', 'two', 'schemes', 'are', 'c1']] | [-0.13062637013003783, 0.0512033372565552, -0.08309331307342897, 0.0520471378544311, -0.000746622888578309, -0.134012789827668, 0.0460005580033693, 0.38065038876677, -0.24006755608651373, -0.2598933948169428, 0.11652948848334038, -0.2254670979110179, -0.17505152194105364, 0.23905667196959257, -0.09080050446748457, 0.08130727861835449, 0.04848095617705473, -0.03856895529423599, -0.10580631284715815, -0.37817811420946207, 0.34220229982639905, 0.01008950567079915, 0.28885226106029693, 0.010433859258396464, 0.07626319119568777, 0.008848249808781676, -0.14009615168389347, 0.04911725715889285, -0.164453551842194, 0.11431024859969814, 0.15530874015746154, 0.07198697944275206, 0.25204297641499174, -0.39697833273007915, -0.20319222924472005, 0.09309460149422565, 0.17025747459761245, 0.1002004550450861, -0.06162728854946585, -0.23766983433247166, 0.13740043114456865, -0.12139204358337102, -0.12858380667037433, -0.06134684433884643, -0.04382372895876566, 0.07516031181849367, -0.25001774043603625, 0.012294908813028424, 0.11524061679288193, 0.07094959723245767, -0.011131649310873062, -0.12210269838019654, -0.03387443394469166, 0.06246596771395869, -0.024027636045098513, 0.0412274278200197, 0.04291917976095445, -0.058088635650670364, -0.15913623148851372, 0.3561378564271662, -0.07376027259009856, -0.19906725303304415, 0.13043746176279253, -0.1292333747174039, -0.15074334056030406, 0.13122311522494312, 0.11354353719528902, 0.1593970333967634, -0.11114754046623905, 0.10143081281502317, -0.029464811750653165, 0.09638165461796301, 0.13219370631742533, -0.038626072048727006, 0.08374075491533235, 0.06742497236916313, 0.06837118020350183, 0.12831154377932694, -0.06237039475753489, -0.09692234545946121, -0.2888920116238296, -0.1281559946084464, -0.16592375380073296, 0.0069882534875499985, -0.09617437799089304, -0.07314747699570877, 0.39772064038724814, 0.05855808327733367, 0.1581021273870849, 0.07782455842459092, 0.2895793401532703, 0.10942043386468733, 0.06113162074217581, 0.11575912586758258, 0.21307659739007553, 0.11595663830155024, 0.06070936462169306, -0.19682305903794864, -0.004088049780370461, 0.21450694971200493] |
1,802.07556 | Time-Latitude Distribution of Prominences for 10 Solar Cycles: A study
using Kodaikanal, Meudon and Kanzelhohe Data | Solar prominences are structures of importance because of their role in polar
field reversal. We study the long-term variation of the time latitude
distribution of solar prominences in this article. To accomplish this, we
primarily used the digitised disc-blocked Ca II K spectroheliograms as recorded
from Kodaikanal Solar Observatory for the period of 1906 -- 2002. For improving
the data statistics we included full disc H_alpha images from Meudon and
Kanzelhohe Observatory which are available after 1980. We developed an
automated technique to identify the latitudinal locations of prominences in
daily images from all three datasets. Derived time-latitude distribution
clearly depicted pole-ward migration of prominence structures for 10 cycles
(15-24). Unlike previous studies, we separated the rate of pole-ward migration
during on-set and near pole, using piece-wise linear fits. In most cases, we
found acceleration in pole-ward migration with the change occurring near +/- 70
degree latitudes. The derived migration rates for such large number of solar
cycles can provide important inputs towards understanding polar field build-up
process.
| astro-ph.SR | solar prominences are structures of importance because of their role in polar field reversal we study the longterm variation of the time latitude distribution of solar prominences in this article to accomplish this we primarily used the digitised discblocked ca ii k spectroheliograms as recorded from kodaikanal solar observatory for the period of 1906 2002 for improving the data statistics we included full disc h_alpha images from meudon and kanzelhohe observatory which are available after 1980 we developed an automated technique to identify the latitudinal locations of prominences in daily images from all three datasets derived timelatitude distribution clearly depicted poleward migration of prominence structures for 10 cycles 1524 unlike previous studies we separated the rate of poleward migration during onset and near pole using piecewise linear fits in most cases we found acceleration in poleward migration with the change occurring near 70 degree latitudes the derived migration rates for such large number of solar cycles can provide important inputs towards understanding polar field buildup process | [['solar', 'prominences', 'are', 'structures', 'of', 'importance', 'because', 'of', 'their', 'role', 'in', 'polar', 'field', 'reversal', 'we', 'study', 'the', 'longterm', 'variation', 'of', 'the', 'time', 'latitude', 'distribution', 'of', 'solar', 'prominences', 'in', 'this', 'article', 'to', 'accomplish', 'this', 'we', 'primarily', 'used', 'the', 'digitised', 'discblocked', 'ca', 'ii', 'k', 'spectroheliograms', 'as', 'recorded', 'from', 'kodaikanal', 'solar', 'observatory', 'for', 'the', 'period', 'of', '1906', '2002', 'for', 'improving', 'the', 'data', 'statistics', 'we', 'included', 'full', 'disc', 'h_alpha', 'images', 'from', 'meudon', 'and', 'kanzelhohe', 'observatory', 'which', 'are', 'available', 'after', '1980', 'we', 'developed', 'an', 'automated', 'technique', 'to', 'identify', 'the', 'latitudinal', 'locations', 'of', 'prominences', 'in', 'daily', 'images', 'from', 'all', 'three', 'datasets', 'derived', 'timelatitude', 'distribution', 'clearly', 'depicted', 'poleward', 'migration', 'of', 'prominence', 'structures', 'for', '10', 'cycles', '1524', 'unlike', 'previous', 'studies', 'we', 'separated', 'the', 'rate', 'of', 'poleward', 'migration', 'during', 'onset', 'and', 'near', 'pole', 'using', 'piecewise', 'linear', 'fits', 'in', 'most', 'cases', 'we', 'found', 'acceleration', 'in', 'poleward', 'migration', 'with', 'the', 'change', 'occurring', 'near', '70', 'degree', 'latitudes', 'the', 'derived', 'migration', 'rates', 'for', 'such', 'large', 'number', 'of', 'solar', 'cycles', 'can', 'provide', 'important', 'inputs', 'towards', 'understanding', 'polar', 'field', 'buildup', 'process']] | [-0.12247140757231549, 0.14868275017387614, 0.0021025670960432654, 0.08969425760024574, -0.03923104594560396, -0.031743344345666245, 0.03825938990586578, 0.4075576220328609, -0.22931491305106178, -0.35969825123972965, 0.09981714828207976, -0.2377998155033724, -0.1450357707869967, 0.24219864499049656, -0.07316829421885786, -0.014121857005397254, 0.09314244485488443, -0.04992074683206297, 0.017396066680455326, -0.22433289288275057, 0.21563077783776505, 0.10791193950060529, 0.226430175631046, -0.034317698583684185, 0.052793007909150966, -0.050317026496949524, -0.08637176543477725, -0.012139437822406762, -0.14022907597422035, 0.0694696973614169, 0.2602580130368358, 0.1443002173931084, 0.2054704509844834, -0.4545977918713382, -0.20587834269372804, 0.03685669310278061, 0.16855971158515648, 0.028611959141739078, -0.030031841124273893, -0.2274480383913738, 0.039871950969664435, -0.10750575096877363, -0.15075083546001802, 0.03601361508057876, 0.07463709080422466, 0.010634425664885027, -0.2541052247771542, 0.09126128878049326, 0.01829295822800222, 0.22091737584860036, -0.13022260541576103, -0.12191864530358351, -0.09094791609342351, 0.19520956450000856, 0.08211900802932426, 0.034857237393346924, 0.16680855341820103, -0.08903441754113318, -0.06467422867391372, 0.3522062926186305, -0.10070965448394417, -0.010475472101207936, 0.1821046621171814, -0.23300286557694727, -0.1443938158854673, 0.19292298489899345, 0.2031994791623826, 0.12216199499442044, -0.13199847001921047, 0.0014337923566486235, -0.03482056551923354, 0.12201003109133153, 0.12545914135195993, -0.01708709771716685, 0.25096575771317337, 0.114403670879476, 0.029554869249378415, 0.08522339355990742, -0.2519960690459067, -0.11106375368086226, -0.2461706738580357, -0.11576737930828875, -0.07001487742897801, 0.017214046379156186, -0.04906187571115989, -0.13558250952963577, 0.4166919887912544, 0.16406678756360304, 0.2057419992757566, 0.0036408469059758565, 0.26966024222924856, 0.05866545929686364, 0.09029493827882547, 0.1373734558749041, 0.26572790529691814, 0.12407549066525517, 0.2289689909328114, -0.22144450389384998, 0.09162257150887991, 0.06114516989751296] |
1,802.07557 | The Power of Color: A Study on the Effective Use of Colored Light in
Human-Robot Interaction | In times of more and more complex interaction techniques, we point out the
powerfulness of colored light as a simple and cheap feedback mechanism. Since
it is visible over a distance and does not interfere with other modalities, it
is especially interesting for mobile robots. In an online survey, we asked 56
participants to choose the most appropriate colors for scenarios that were
presented in the form of videos. In these scenarios a mobile robot accomplished
tasks, in some with success, in others it failed because the task is not
feasible, in others it stopped because it waited for help. We analyze in what
way the color preferences differ between these three categories. The results
show a connection between colors and meanings and that it depends on the
participants' technical affinity, experience with robots and gender how clear
the color preference is for a certain category. Finally, we found out that the
participants' favorite color is not related to color preferences.
| cs.RO cs.HC | in times of more and more complex interaction techniques we point out the powerfulness of colored light as a simple and cheap feedback mechanism since it is visible over a distance and does not interfere with other modalities it is especially interesting for mobile robots in an online survey we asked 56 participants to choose the most appropriate colors for scenarios that were presented in the form of videos in these scenarios a mobile robot accomplished tasks in some with success in others it failed because the task is not feasible in others it stopped because it waited for help we analyze in what way the color preferences differ between these three categories the results show a connection between colors and meanings and that it depends on the participants technical affinity experience with robots and gender how clear the color preference is for a certain category finally we found out that the participants favorite color is not related to color preferences | [['in', 'times', 'of', 'more', 'and', 'more', 'complex', 'interaction', 'techniques', 'we', 'point', 'out', 'the', 'powerfulness', 'of', 'colored', 'light', 'as', 'a', 'simple', 'and', 'cheap', 'feedback', 'mechanism', 'since', 'it', 'is', 'visible', 'over', 'a', 'distance', 'and', 'does', 'not', 'interfere', 'with', 'other', 'modalities', 'it', 'is', 'especially', 'interesting', 'for', 'mobile', 'robots', 'in', 'an', 'online', 'survey', 'we', 'asked', '56', 'participants', 'to', 'choose', 'the', 'most', 'appropriate', 'colors', 'for', 'scenarios', 'that', 'were', 'presented', 'in', 'the', 'form', 'of', 'videos', 'in', 'these', 'scenarios', 'a', 'mobile', 'robot', 'accomplished', 'tasks', 'in', 'some', 'with', 'success', 'in', 'others', 'it', 'failed', 'because', 'the', 'task', 'is', 'not', 'feasible', 'in', 'others', 'it', 'stopped', 'because', 'it', 'waited', 'for', 'help', 'we', 'analyze', 'in', 'what', 'way', 'the', 'color', 'preferences', 'differ', 'between', 'these', 'three', 'categories', 'the', 'results', 'show', 'a', 'connection', 'between', 'colors', 'and', 'meanings', 'and', 'that', 'it', 'depends', 'on', 'the', 'participants', 'technical', 'affinity', 'experience', 'with', 'robots', 'and', 'gender', 'how', 'clear', 'the', 'color', 'preference', 'is', 'for', 'a', 'certain', 'category', 'finally', 'we', 'found', 'out', 'that', 'the', 'participants', 'favorite', 'color', 'is', 'not', 'related', 'to', 'color', 'preferences']] | [-0.07538465371280215, 0.09322334382828015, -0.11397730057584758, 0.09440179793988442, -0.12823240142113165, -0.2033987450991867, 0.07132341036202837, 0.5020727802600179, -0.23133869883832117, -0.335891291944553, 0.059506919929144544, -0.28397615690374317, -0.18231177572970805, 0.17220316783912618, -0.15945941010079354, -0.03392294994685568, 0.07410992999410732, 0.0913784771778777, 0.004824700892573188, -0.3195227582834846, 0.29794786888411884, -0.00701252552131133, 0.2543554237482618, 0.0661213573311334, 0.06845083086525802, 0.013680301172809202, -0.04365521145880408, 0.020821722624216065, -0.06798273886213917, 0.08467669507361347, 0.30186420117406554, 0.17528267242939946, 0.2729836418069263, -0.4053463631234369, -0.1451873301950671, 0.12380619631119952, 0.12027740684447821, 0.06506641118307106, -0.07083864564597404, -0.2711422398616994, 0.09530352514240058, -0.15636830900142096, -0.07591017418391337, -0.03705171637977502, 0.07660161122760695, -0.011209188474799844, -0.25260589063248556, -0.003461158730274772, 0.038737819103454675, 0.05872795430029401, -0.03904526343465037, -0.09439548052216863, -0.009318906958475245, 0.200372967232736, 0.056104860455086975, 0.009692707276897309, 0.12186692371640516, -0.22159778651121934, -0.1141500947534205, 0.40574807595889667, 0.023589708999606277, -0.1897677872590258, 0.2506242533249098, -0.09920472584184699, -0.13577685028029698, 0.08340697717615721, 0.1448069063249559, 0.12777461235336265, -0.1718192849214614, -0.014797982589850746, -0.06872930251038778, 0.17849182666178867, 0.07841500701485433, 0.024159341237814345, 0.20805301635471166, 0.14285001778246267, 0.07264047941216123, 0.0622132662094418, -0.028190604403834814, -0.09895728769717935, -0.2548039942316028, -0.13453462590920442, -0.15988745731417298, 0.0037543755425075184, -0.0615100144599897, -0.07836302321097634, 0.3732051893198134, 0.20893738852084978, 0.20764930329505377, 0.025175719780078078, 0.28614199552424713, 0.027659323823534136, 0.12132214187403638, 0.06858187190492736, 0.21559471682871703, 0.021837483625859022, 0.13595336355393325, -0.16591312126791602, 0.0920454379350456, 0.0007786076408897683] |
1,802.07558 | The Borwein brothers, Pi and the AGM | We consider some of Jonathan and Peter Borweins' contributions to the
high-precision computation of $\pi$ and the elementary functions, with
particular reference to their book "Pi and the AGM" (Wiley, 1987). Here "AGM"
is the arithmetic-geometric mean of Gauss and Legendre. Because the AGM
converges quadratically, it can be combined with fast multiplication algorithms
to give fast algorithms for the $n$-bit computation of $\pi$, and more
generally the elementary functions. These algorithms run in almost linear time
$O(M(n)\log n)$, where $M(n)$ is the time for $n$-bit multiplication. We
outline some of the results and algorithms given in Pi and the AGM, and present
some related (but new) results. In particular, we improve the published error
bounds for some quadratically and quartically convergent algorithms for $\pi$,
such as the Gauss-Legendre algorithm. We show that an iteration of the
Borwein-Borwein quartic algorithm for $\pi$ is equivalent to two iterations of
the Gauss-Legendre quadratic algorithm for $\pi$, in the sense that they
produce exactly the same sequence of approximations to $\pi$ if performed using
exact arithmetic.
| math.NT math.HO | we consider some of jonathan and peter borweins contributions to the highprecision computation of pi and the elementary functions with particular reference to their book pi and the agm wiley 1987 here agm is the arithmeticgeometric mean of gauss and legendre because the agm converges quadratically it can be combined with fast multiplication algorithms to give fast algorithms for the nbit computation of pi and more generally the elementary functions these algorithms run in almost linear time omnlog n where mn is the time for nbit multiplication we outline some of the results and algorithms given in pi and the agm and present some related but new results in particular we improve the published error bounds for some quadratically and quartically convergent algorithms for pi such as the gausslegendre algorithm we show that an iteration of the borweinborwein quartic algorithm for pi is equivalent to two iterations of the gausslegendre quadratic algorithm for pi in the sense that they produce exactly the same sequence of approximations to pi if performed using exact arithmetic | [['we', 'consider', 'some', 'of', 'jonathan', 'and', 'peter', 'borweins', 'contributions', 'to', 'the', 'highprecision', 'computation', 'of', 'pi', 'and', 'the', 'elementary', 'functions', 'with', 'particular', 'reference', 'to', 'their', 'book', 'pi', 'and', 'the', 'agm', 'wiley', '1987', 'here', 'agm', 'is', 'the', 'arithmeticgeometric', 'mean', 'of', 'gauss', 'and', 'legendre', 'because', 'the', 'agm', 'converges', 'quadratically', 'it', 'can', 'be', 'combined', 'with', 'fast', 'multiplication', 'algorithms', 'to', 'give', 'fast', 'algorithms', 'for', 'the', 'nbit', 'computation', 'of', 'pi', 'and', 'more', 'generally', 'the', 'elementary', 'functions', 'these', 'algorithms', 'run', 'in', 'almost', 'linear', 'time', 'omnlog', 'n', 'where', 'mn', 'is', 'the', 'time', 'for', 'nbit', 'multiplication', 'we', 'outline', 'some', 'of', 'the', 'results', 'and', 'algorithms', 'given', 'in', 'pi', 'and', 'the', 'agm', 'and', 'present', 'some', 'related', 'but', 'new', 'results', 'in', 'particular', 'we', 'improve', 'the', 'published', 'error', 'bounds', 'for', 'some', 'quadratically', 'and', 'quartically', 'convergent', 'algorithms', 'for', 'pi', 'such', 'as', 'the', 'gausslegendre', 'algorithm', 'we', 'show', 'that', 'an', 'iteration', 'of', 'the', 'borweinborwein', 'quartic', 'algorithm', 'for', 'pi', 'is', 'equivalent', 'to', 'two', 'iterations', 'of', 'the', 'gausslegendre', 'quadratic', 'algorithm', 'for', 'pi', 'in', 'the', 'sense', 'that', 'they', 'produce', 'exactly', 'the', 'same', 'sequence', 'of', 'approximations', 'to', 'pi', 'if', 'performed', 'using', 'exact', 'arithmetic']] | [-0.11370317041021122, 0.09901701354059231, -0.11194623510494049, 0.08574356932428578, -0.055735059063556754, -0.17088957725980775, 0.07051944018725366, 0.36230018802886005, -0.30206531551558263, -0.28486984229895695, 0.08912872176260016, -0.26586609956152535, -0.18053274577534975, 0.23880745688058047, -0.0768924558824226, 0.10949759091708137, 0.07352332360663473, 0.08471447121092053, -0.09337393037547076, -0.34192490585413654, 0.24143244734245115, 0.02014395591348063, 0.1570117663250976, 0.015837069242775743, 0.08246634333832041, 0.01678978431385097, -0.0546260082222478, -0.019764520022151774, -0.12105647624420546, 0.12088518615183962, 0.24432261418930235, 0.16982144860789006, 0.2560427129420257, -0.41575850539591686, -0.05098735425502148, 0.13059015786119596, 0.16231657738213937, 0.08217900007628826, -0.0035406673658905864, -0.23981675778537295, 0.1396743298379544, -0.09895160647994448, -0.08015483893524465, -0.1168564508593273, 0.046586010735048804, 0.05949737678206157, -0.28279577079770524, 0.01799998562214463, 0.09840115635496088, 0.04506480653207143, -0.001296699554713573, -0.19940891663738808, 0.09004073283570103, 0.07812457451282806, 0.046368793999305165, 0.08823337396444363, 0.06974925395158163, -0.07075479225970285, -0.16402141203722093, 0.36173550620523476, -0.0661820719982389, -0.21537054599219457, 0.11646237584145003, -0.09670672815043999, -0.1637411627155014, 0.12242044558542846, 0.14998063071834622, 0.13721891271974485, -0.07967133979248099, 0.14148181690908915, -0.03725889975984776, 0.14012904518262245, 0.0882325274328333, 0.008718043690287443, 0.05035931730188083, 0.06657837797831954, 0.08417209955527945, 0.09257063914975693, -0.022508392247187276, -0.10226321373362267, -0.3231193194623365, -0.18875564704040002, -0.16617724782419066, 0.025455945514570272, -0.08924338487604684, -0.18183960740354324, 0.379099486633962, 0.10515545585820842, 0.17590064074042752, 0.15009154173069048, 0.3057062543365498, 0.15407048596196463, 0.01745901796168128, 0.15015367300217147, 0.176035148811088, 0.1474282499023735, 0.06829505114745739, -0.2108203201760473, 0.028172931475172275, 0.12126391553482431] |
1,802.07559 | $L_p$-Blaschke Valuations | In this article, a classification of continuous, linearly intertwining,
symmetric $L_p$-Blaschke ($p>1$) valuations is established as an extension of
Haberl's work on Blaschke valuations. More precisely, we show that for
dimensions $n\geq 3$, the only continuous, linearly intertwining, normalized
symmetric $L_p$-Blaschke valuation is the normalized $L_p$-curvature image
operator, while for dimension $n = 2 $, a rotated normalized $L_p$-curvature
image operator is an only additional one. One of the advantages of our approach
is that we deal with normalized symmetric $L_p$-Blaschke valuations, which
makes it possible to handle the case $p=n$. The cases where $p \not =n$ are
also discussed by studying the relations between symmetric $L_p$-Blaschke
valuations and normalized ones.
| math.MG | in this article a classification of continuous linearly intertwining symmetric l_pblaschke p1 valuations is established as an extension of haberls work on blaschke valuations more precisely we show that for dimensions ngeq 3 the only continuous linearly intertwining normalized symmetric l_pblaschke valuation is the normalized l_pcurvature image operator while for dimension n 2 a rotated normalized l_pcurvature image operator is an only additional one one of the advantages of our approach is that we deal with normalized symmetric l_pblaschke valuations which makes it possible to handle the case pn the cases where p not n are also discussed by studying the relations between symmetric l_pblaschke valuations and normalized ones | [['in', 'this', 'article', 'a', 'classification', 'of', 'continuous', 'linearly', 'intertwining', 'symmetric', 'l_pblaschke', 'p1', 'valuations', 'is', 'established', 'as', 'an', 'extension', 'of', 'haberls', 'work', 'on', 'blaschke', 'valuations', 'more', 'precisely', 'we', 'show', 'that', 'for', 'dimensions', 'ngeq', '3', 'the', 'only', 'continuous', 'linearly', 'intertwining', 'normalized', 'symmetric', 'l_pblaschke', 'valuation', 'is', 'the', 'normalized', 'l_pcurvature', 'image', 'operator', 'while', 'for', 'dimension', 'n', '2', 'a', 'rotated', 'normalized', 'l_pcurvature', 'image', 'operator', 'is', 'an', 'only', 'additional', 'one', 'one', 'of', 'the', 'advantages', 'of', 'our', 'approach', 'is', 'that', 'we', 'deal', 'with', 'normalized', 'symmetric', 'l_pblaschke', 'valuations', 'which', 'makes', 'it', 'possible', 'to', 'handle', 'the', 'case', 'pn', 'the', 'cases', 'where', 'p', 'not', 'n', 'are', 'also', 'discussed', 'by', 'studying', 'the', 'relations', 'between', 'symmetric', 'l_pblaschke', 'valuations', 'and', 'normalized', 'ones']] | [-0.13268104383067386, 0.07371853194710193, -0.05120969230071905, 0.07463528526801932, -0.06602620642702535, -0.18198388610210903, -0.03250302094966173, 0.41255513958211215, -0.2877890134124823, -0.16959405992672127, 0.09707334668722602, -0.31609204363183313, -0.15065080845148637, 0.17882069564020298, -0.08199674802841092, 0.0025342994387138563, -0.035290656172020256, 0.10685537847743001, -0.09486824768773315, -0.32102482829172657, 0.36600279976736827, -0.022250047849737248, 0.24790368626280776, 0.025710657089597213, 0.07910830802987066, 0.04406286762008127, -0.03441385640147722, 0.0018073443208159693, -0.10176004335036576, 0.14548472293986464, 0.2662774433012841, 0.08605318391950414, 0.2474211129219324, -0.33334912903571745, -0.12258346757482526, 0.19897401930746744, 0.10392241489651771, -0.011557362274099845, -0.03043923134004526, -0.23352148837875575, 0.10584981680215108, -0.15444956474744206, -0.14630496865226272, -0.09406212465134713, 0.09296673559144421, -0.005922376407191755, -0.3325920385189952, 0.03035358565102797, 0.15699421408814643, 0.05140832953049608, -0.07472315362768846, -0.12888809698985293, -0.03933568248516476, 0.06494382080810918, 0.0355256025609121, 0.059419134012335596, 0.05559865640968366, -0.09138643957085837, -0.11646341069443326, 0.3543140784055346, -0.03323118637298357, -0.28374929073978356, 0.10362935189667316, -0.16888041373008406, -0.12857732885376602, 0.09550329739719911, 0.11792062400436064, 0.19210175217023856, -0.08817543904736357, 0.1526573048899047, -0.13298051075939582, 0.16312223612242993, 0.11608313449728742, 0.009906945225012814, 0.09473704507592011, 0.05989204531640939, 0.13073336357088267, 0.16317454158802921, 0.001857371387985658, -0.11132887207061702, -0.3225636786763679, -0.15853841167892208, -0.2060776422380136, 0.07550442632837419, -0.10650163805010654, -0.11617905285345602, 0.34922478877816276, 0.06314033291847357, 0.20041876793224014, 0.11817734246691337, 0.2701509705094515, 0.10916167255578879, 0.06105324418617869, 0.06686640153902601, 0.13196742483019336, 0.13694824471867661, 0.02426594981862197, -0.1323183102375072, 0.022188677232853084, 0.08440794843415958] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.