id float64 706 1.8k | title stringlengths 1 343 | abstract stringlengths 6 6.09k | categories stringlengths 5 125 | processed_abstract stringlengths 2 5.96k | tokenized_abstract stringlengths 8 8.74k | centroid stringlengths 2.1k 2.17k |
|---|---|---|---|---|---|---|
1,803.00967 | Active model learning and diverse action sampling for task and motion
planning | The objective of this work is to augment the basic abilities of a robot by
learning to use new sensorimotor primitives to enable the solution of complex
long-horizon problems. Solving long-horizon problems in complex domains
requires flexible generative planning that can combine primitive abilities in
novel combinations to solve problems as they arise in the world. In order to
plan to combine primitive actions, we must have models of the preconditions and
effects of those actions: under what circumstances will executing this
primitive achieve some particular effect in the world?
We use, and develop novel improvements on, state-of-the-art methods for
active learning and sampling. We use Gaussian process methods for learning the
conditions of operator effectiveness from small numbers of expensive training
examples collected by experimentation on a robot. We develop adaptive sampling
methods for generating diverse elements of continuous sets (such as robot
configurations and object poses) during planning for solving a new task, so
that planning is as efficient as possible. We demonstrate these methods in an
integrated system, combining newly learned models with an efficient
continuous-space robot task and motion planner to learn to solve long horizon
problems more efficiently than was previously possible.
| cs.RO cs.AI cs.LG stat.AP stat.ML | the objective of this work is to augment the basic abilities of a robot by learning to use new sensorimotor primitives to enable the solution of complex longhorizon problems solving longhorizon problems in complex domains requires flexible generative planning that can combine primitive abilities in novel combinations to solve problems as they arise in the world in order to plan to combine primitive actions we must have models of the preconditions and effects of those actions under what circumstances will executing this primitive achieve some particular effect in the world we use and develop novel improvements on stateoftheart methods for active learning and sampling we use gaussian process methods for learning the conditions of operator effectiveness from small numbers of expensive training examples collected by experimentation on a robot we develop adaptive sampling methods for generating diverse elements of continuous sets such as robot configurations and object poses during planning for solving a new task so that planning is as efficient as possible we demonstrate these methods in an integrated system combining newly learned models with an efficient continuousspace robot task and motion planner to learn to solve long horizon problems more efficiently than was previously possible | [['the', 'objective', 'of', 'this', 'work', 'is', 'to', 'augment', 'the', 'basic', 'abilities', 'of', 'a', 'robot', 'by', 'learning', 'to', 'use', 'new', 'sensorimotor', 'primitives', 'to', 'enable', 'the', 'solution', 'of', 'complex', 'longhorizon', 'problems', 'solving', 'longhorizon', 'problems', 'in', 'complex', 'domains', 'requires', 'flexible', 'generative', 'planning', 'that', 'can', 'combine', 'primitive', 'abilities', 'in', 'novel', 'combinations', 'to', 'solve', 'problems', 'as', 'they', 'arise', 'in', 'the', 'world', 'in', 'order', 'to', 'plan', 'to', 'combine', 'primitive', 'actions', 'we', 'must', 'have', 'models', 'of', 'the', 'preconditions', 'and', 'effects', 'of', 'those', 'actions', 'under', 'what', 'circumstances', 'will', 'executing', 'this', 'primitive', 'achieve', 'some', 'particular', 'effect', 'in', 'the', 'world', 'we', 'use', 'and', 'develop', 'novel', 'improvements', 'on', 'stateoftheart', 'methods', 'for', 'active', 'learning', 'and', 'sampling', 'we', 'use', 'gaussian', 'process', 'methods', 'for', 'learning', 'the', 'conditions', 'of', 'operator', 'effectiveness', 'from', 'small', 'numbers', 'of', 'expensive', 'training', 'examples', 'collected', 'by', 'experimentation', 'on', 'a', 'robot', 'we', 'develop', 'adaptive', 'sampling', 'methods', 'for', 'generating', 'diverse', 'elements', 'of', 'continuous', 'sets', 'such', 'as', 'robot', 'configurations', 'and', 'object', 'poses', 'during', 'planning', 'for', 'solving', 'a', 'new', 'task', 'so', 'that', 'planning', 'is', 'as', 'efficient', 'as', 'possible', 'we', 'demonstrate', 'these', 'methods', 'in', 'an', 'integrated', 'system', 'combining', 'newly', 'learned', 'models', 'with', 'an', 'efficient', 'continuousspace', 'robot', 'task', 'and', 'motion', 'planner', 'to', 'learn', 'to', 'solve', 'long', 'horizon', 'problems', 'more', 'efficiently', 'than', 'was', 'previously', 'possible']] | [-0.04428387398129509, 0.047482251954474135, -0.07588305337434909, 0.07406034352005997, -0.17208880711899985, -0.14165700574258938, 0.030070378537275615, 0.46595754280572915, -0.30032269091009717, -0.345910189439292, 0.10966600503342293, -0.22335095355183188, -0.1978894811109427, 0.24569146602998398, -0.17088885674593488, 0.12491810488689521, 0.13205652811616508, 0.01376846716691962, -0.05770114087499678, -0.2561784152976866, 0.3051091209817784, 0.02178463033461934, 0.24066627185394618, -0.029070789427295574, 0.17072694888042977, -0.0072883941726002675, 0.017985284230364534, 0.015204720284203587, -0.07769935119811146, 0.17890932030153228, 0.34098486818993246, 0.2204763338059603, 0.3486459066347942, -0.46605149843744215, -0.21794293002523293, 0.10781329492731068, 0.1330391361701969, 0.107896258175665, -0.02285465113808304, -0.2974870437756181, 0.08321213733456878, -0.16060168366302466, -0.08320771499541658, -0.1725705962138827, 0.0038154049975050587, -0.013473607647010518, -0.31353205970020465, -0.019835843223024178, 0.03176062562394188, 0.0583183285082941, -0.06754551599804444, -0.09468707827990638, 0.07330241070133704, 0.18320482689414533, 0.016678852716852027, 0.004819117552071318, 0.14595069002530298, -0.164903552458163, -0.2237125306489504, 0.3891631766969366, 0.012490448890815886, -0.2393166585845328, 0.22713052214662247, -0.02154865881503763, -0.16690095250026754, 0.11483518009400231, 0.2788129964190994, 0.1774118798820368, -0.1784659633436595, 0.0357056930486874, -0.006039541947471006, 0.12862116382557776, 0.035569998837515784, -0.03017808830242623, 0.16732221578843515, 0.2327632057341052, 0.09746568293669994, 0.14686065231719372, -0.04923962314286964, -0.11776444131832305, -0.22772829765973962, -0.13544768990646236, -0.1470576834021051, -0.02815020732288509, -0.05983388032207235, -0.1299528783116505, 0.34003374583045315, 0.2690589428586214, 0.17266672520619358, 0.09159961214577449, 0.32904179537016426, 0.05825528662963794, 0.09544850792440344, 0.07373977634230827, 0.16451915523565025, 0.01771780438035689, 0.12797328199113384, -0.1821695650681891, 0.07580280285044975, 0.044295656946274985] |
1,803.00968 | QCD analysis of the ATLAS and CMS $W^{\pm}$ and $Z$ cross-section
measurements and implications for the strange sea density | In the present paper, the ATLAS inclusive $W^{\pm}$ and $Z$ boson production
data are analysed together with the CMS inclusive $W^{\pm}$ and $Z$ boson
production data to investigate any possible tensions between the data sets and
to determine the strange sea fraction, within the framework of a parton
distribution function fit at next-to-next-to leading order in perturbative QCD.
| hep-ex hep-ph | in the present paper the atlas inclusive wpm and z boson production data are analysed together with the cms inclusive wpm and z boson production data to investigate any possible tensions between the data sets and to determine the strange sea fraction within the framework of a parton distribution function fit at nexttonextto leading order in perturbative qcd | [['in', 'the', 'present', 'paper', 'the', 'atlas', 'inclusive', 'wpm', 'and', 'z', 'boson', 'production', 'data', 'are', 'analysed', 'together', 'with', 'the', 'cms', 'inclusive', 'wpm', 'and', 'z', 'boson', 'production', 'data', 'to', 'investigate', 'any', 'possible', 'tensions', 'between', 'the', 'data', 'sets', 'and', 'to', 'determine', 'the', 'strange', 'sea', 'fraction', 'within', 'the', 'framework', 'of', 'a', 'parton', 'distribution', 'function', 'fit', 'at', 'nexttonextto', 'leading', 'order', 'in', 'perturbative', 'qcd']] | [-0.015069575635074028, 0.2020720192231238, -0.11192520525595494, 0.16605179458214292, -0.0294820173675644, -0.08879825614938705, 0.07312725220830983, 0.30572573227229816, -0.1986151322208602, -0.25368201507030635, -0.01936270744973344, -0.39835372644251793, 0.10187898672603328, 0.07719725048458524, 0.08360873505970913, 0.14565991910559864, 0.11594010786763553, -0.05070699007924775, -0.015960484372797134, -0.2870103312367252, 0.3197354104024647, 0.040146741807332326, 0.2277981283721225, 0.13245602215415445, 0.05175144122391618, 0.06528570184660755, -0.14061717933710216, -0.11707640358985498, -0.16617680973662385, 0.06442847587810509, 0.2430151409895063, 0.05713735257500205, 0.09292589590467255, -0.3037738615068896, -0.03500286333969441, 0.14659409626419173, 0.1743476269686402, 0.06855515733056156, -0.053996805643566466, -0.27967522930803485, 0.13990547655728355, -0.27412686612585496, -0.11725584132564736, -0.09407887509060574, -0.039125215615434895, -0.053634031611526835, -0.3498369846493006, 0.11777465948273011, -0.16972230175702735, 0.04050167686113253, 0.025558807525848007, -0.18601533256728073, -0.13921301918714468, 0.02816737662390645, 0.14747201483536126, 0.1770919033743698, 0.14531384171629003, -0.2046280092848786, -0.23662392775817165, 0.3627307556954951, -0.039974706000568155, -0.171500035971082, 0.16615922239825837, -0.2799810792223133, -0.17334870164732225, 0.14433361018269225, 0.3162789054471871, -0.017613888317759244, -0.2651438387271402, 0.16865207643974733, 0.054884421229683636, 0.15892956584916804, 0.06326142490985964, 0.05031072462362976, 0.20536774332265786, 0.21941575353387102, -0.09324297668605015, 0.04810394194169805, -0.11803643074657383, -0.06326659803443331, -0.46800489460342914, -0.12631859917771712, -0.0215565812741888, 0.020497665443489778, -0.07338585446368912, -0.10706831552569979, 0.3482239755705513, 0.11962715480155472, 0.350509465126128, 0.05455116579180647, 0.3306404634154049, 0.07244454963927574, 0.05877116535276432, 0.07892654054990873, 0.27676993524976845, 0.17143270979105527, 0.16267639076425533, -0.20871274333832593, 0.010342213156600964, 0.062046788761328006] |
1,803.00969 | Energy Efficiency of Opportunistic Device-to-Device Relaying Under
Lognormal Shadowing | Energy consumption is a major limitation of low power and mobile devices.
Efficient transmission protocols are required to minimize an energy consumption
of the mobile devices for ubiquitous connectivity in the next generation
wireless networks. Opportunistic schemes select a single relay using the
criteria of the best channel and achieve a near-optimal diversity performance
in a cooperative wireless system. In this paper, we study the energy efficiency
of the opportunistic schemes for device-to-device communication. In the
opportunistic approach, an energy consumed by devices is minimized by selecting
a single neighboring device as a relay using the criteria of minimum consumed
energy in each transmission in the uplink of a wireless network. We derive
analytical bounds and scaling laws on the expected energy consumption when the
devices experience log-normal shadowing with respect to a base station
considering both the transmission as well as circuit energy consumptions. We
show that the protocol improves the energy efficiency of the network comparing
to the direct transmission even if only a few devices are considered for
relaying. We also demonstrate the effectiveness of the protocol by means of
simulations in realistic scenarios of the wireless network.
| cs.IT eess.SP math.IT | energy consumption is a major limitation of low power and mobile devices efficient transmission protocols are required to minimize an energy consumption of the mobile devices for ubiquitous connectivity in the next generation wireless networks opportunistic schemes select a single relay using the criteria of the best channel and achieve a nearoptimal diversity performance in a cooperative wireless system in this paper we study the energy efficiency of the opportunistic schemes for devicetodevice communication in the opportunistic approach an energy consumed by devices is minimized by selecting a single neighboring device as a relay using the criteria of minimum consumed energy in each transmission in the uplink of a wireless network we derive analytical bounds and scaling laws on the expected energy consumption when the devices experience lognormal shadowing with respect to a base station considering both the transmission as well as circuit energy consumptions we show that the protocol improves the energy efficiency of the network comparing to the direct transmission even if only a few devices are considered for relaying we also demonstrate the effectiveness of the protocol by means of simulations in realistic scenarios of the wireless network | [['energy', 'consumption', 'is', 'a', 'major', 'limitation', 'of', 'low', 'power', 'and', 'mobile', 'devices', 'efficient', 'transmission', 'protocols', 'are', 'required', 'to', 'minimize', 'an', 'energy', 'consumption', 'of', 'the', 'mobile', 'devices', 'for', 'ubiquitous', 'connectivity', 'in', 'the', 'next', 'generation', 'wireless', 'networks', 'opportunistic', 'schemes', 'select', 'a', 'single', 'relay', 'using', 'the', 'criteria', 'of', 'the', 'best', 'channel', 'and', 'achieve', 'a', 'nearoptimal', 'diversity', 'performance', 'in', 'a', 'cooperative', 'wireless', 'system', 'in', 'this', 'paper', 'we', 'study', 'the', 'energy', 'efficiency', 'of', 'the', 'opportunistic', 'schemes', 'for', 'devicetodevice', 'communication', 'in', 'the', 'opportunistic', 'approach', 'an', 'energy', 'consumed', 'by', 'devices', 'is', 'minimized', 'by', 'selecting', 'a', 'single', 'neighboring', 'device', 'as', 'a', 'relay', 'using', 'the', 'criteria', 'of', 'minimum', 'consumed', 'energy', 'in', 'each', 'transmission', 'in', 'the', 'uplink', 'of', 'a', 'wireless', 'network', 'we', 'derive', 'analytical', 'bounds', 'and', 'scaling', 'laws', 'on', 'the', 'expected', 'energy', 'consumption', 'when', 'the', 'devices', 'experience', 'lognormal', 'shadowing', 'with', 'respect', 'to', 'a', 'base', 'station', 'considering', 'both', 'the', 'transmission', 'as', 'well', 'as', 'circuit', 'energy', 'consumptions', 'we', 'show', 'that', 'the', 'protocol', 'improves', 'the', 'energy', 'efficiency', 'of', 'the', 'network', 'comparing', 'to', 'the', 'direct', 'transmission', 'even', 'if', 'only', 'a', 'few', 'devices', 'are', 'considered', 'for', 'relaying', 'we', 'also', 'demonstrate', 'the', 'effectiveness', 'of', 'the', 'protocol', 'by', 'means', 'of', 'simulations', 'in', 'realistic', 'scenarios', 'of', 'the', 'wireless', 'network']] | [-0.2683620498906053, 0.020153260391348172, -0.0004091735256357967, 0.02133239346193101, -0.0059791416592934995, -0.21225717037438332, 0.14852811177127082, 0.4080091489232706, -0.2655768517431613, -0.32808559147929967, 0.04907628127827226, -0.2506143543576695, -0.15218861988399432, 0.1966462586457836, -0.11967376484023651, 0.07648158509586572, 0.05322558562154272, 0.049133411044235395, 0.01250652150623988, -0.2441642406440452, 0.2823529944033484, 0.1674874004754311, 0.391855490871788, 0.07276672323804875, 0.06166005194070139, 0.0008475400887780789, -0.007097004244776921, -0.043874100618020516, -0.09711095855434343, 0.1154002521323596, 0.2989813626264783, 0.14198707555620615, 0.31548915759060553, -0.4612778995127578, -0.29240590715732095, 0.10564525028768712, 0.16052806266054453, 0.04342563595154678, -0.061757491733903234, -0.21536865631723046, 0.14198044944720353, -0.2879341938947352, -0.04602674499520708, 0.01894569990873649, -0.07258203244860728, 0.11578823473299633, -0.3183060549199581, 0.022206858806013426, -0.04962339753428893, 0.006183877660458937, -0.08835104218794153, -0.054843568960472905, -0.014423433660178479, 0.17118940995265583, -0.015064635177518373, -0.08113364557642977, 0.13578964024386003, -0.15178402177184938, -0.14855998281404104, 0.38385059905886965, 0.01468479270432437, -0.17956226657379995, 0.1167620189676271, -0.032724818263534475, -0.0647882316407811, 0.11785633648204476, 0.23531747174434636, 0.09020900955491977, -0.20274284437058934, 0.01595874344341881, 0.027657466277441117, 0.15198233793611535, 0.05017720130899999, 0.12883928304547884, 0.1388391172702312, 0.25102135088874994, 0.16014920585150025, 0.12126035580694364, -0.11186710039655927, -0.08199100282179747, -0.23194949471767193, -0.15113295602285504, -0.2684545634821525, 0.03957584425099974, -0.10330958996559018, -0.03978185907447545, 0.3892626104466812, 0.1248258073760577, 0.1440241383437399, 0.09461778084167245, 0.45672358124863105, 0.12299691962568256, 0.07237125179910617, 0.13431157542548644, 0.2134403554041241, 0.05754423679184188, 0.17664924449708216, -0.2332671889949941, 0.0570178699718681, -0.036840065873681486] |
1,803.0097 | Intertwined Superfluid and Density Wave Order in a $p$-Orbital Bose
Condensate | We study a continuum model of the weakly interacting Bose gas in the presence
of an external field with minima forming a triangular lattice. The second
lowest band of the single-particle spectrum ($p$-band) has three minima at
non-zero momenta. We consider a metastable Bose condensate at these momenta and
find that, in the presence of interactions that vary slowly over the lattice
spacing, the order parameter space is isomorphic to $S^{5}$. We show that the
enlarged symmetry leads to the loss of topologically stable vortices, as well
as two extra gapless modes with quadratic dispersion. The former feature
implies that this non-Abelian condensate is a "failed superfluid" that does not
undergo a Berezinskii-Kosterlitz-Thouless (BKT) transition. Order-by-disorder
splitting appears suppressed, implying that signatures of the $S^5$ manifold
ought to be observable at low temperatures.
| cond-mat.quant-gas | we study a continuum model of the weakly interacting bose gas in the presence of an external field with minima forming a triangular lattice the second lowest band of the singleparticle spectrum pband has three minima at nonzero momenta we consider a metastable bose condensate at these momenta and find that in the presence of interactions that vary slowly over the lattice spacing the order parameter space is isomorphic to s5 we show that the enlarged symmetry leads to the loss of topologically stable vortices as well as two extra gapless modes with quadratic dispersion the former feature implies that this nonabelian condensate is a failed superfluid that does not undergo a berezinskiikosterlitzthouless bkt transition orderbydisorder splitting appears suppressed implying that signatures of the s5 manifold ought to be observable at low temperatures | [['we', 'study', 'a', 'continuum', 'model', 'of', 'the', 'weakly', 'interacting', 'bose', 'gas', 'in', 'the', 'presence', 'of', 'an', 'external', 'field', 'with', 'minima', 'forming', 'a', 'triangular', 'lattice', 'the', 'second', 'lowest', 'band', 'of', 'the', 'singleparticle', 'spectrum', 'pband', 'has', 'three', 'minima', 'at', 'nonzero', 'momenta', 'we', 'consider', 'a', 'metastable', 'bose', 'condensate', 'at', 'these', 'momenta', 'and', 'find', 'that', 'in', 'the', 'presence', 'of', 'interactions', 'that', 'vary', 'slowly', 'over', 'the', 'lattice', 'spacing', 'the', 'order', 'parameter', 'space', 'is', 'isomorphic', 'to', 's5', 'we', 'show', 'that', 'the', 'enlarged', 'symmetry', 'leads', 'to', 'the', 'loss', 'of', 'topologically', 'stable', 'vortices', 'as', 'well', 'as', 'two', 'extra', 'gapless', 'modes', 'with', 'quadratic', 'dispersion', 'the', 'former', 'feature', 'implies', 'that', 'this', 'nonabelian', 'condensate', 'is', 'a', 'failed', 'superfluid', 'that', 'does', 'not', 'undergo', 'a', 'berezinskiikosterlitzthouless', 'bkt', 'transition', 'orderbydisorder', 'splitting', 'appears', 'suppressed', 'implying', 'that', 'signatures', 'of', 'the', 's5', 'manifold', 'ought', 'to', 'be', 'observable', 'at', 'low', 'temperatures']] | [-0.20797332119646558, 0.27254310143593774, -0.07898502870282523, 0.06231450449449493, -0.040150087559595704, -0.15546176144573137, 0.036564412426126465, 0.3751138206219031, -0.21554048925890287, -0.233333816114617, 0.03228428278685568, -0.2844408327797638, -0.08366305926198461, 0.06175592192098554, 0.027601522624604684, -0.03288438519256372, 0.0006022056935817227, 0.028011525457259268, -0.12135471027918664, -0.2377177721223815, 0.3395963641079633, 0.0028600375985558656, 0.28690162302464023, 0.04432771217491114, 0.0675809246249833, -0.035950075483117676, 0.11039105491866742, 0.00998127170207322, -0.12552139689413658, 0.014607405448437465, 0.2274051457958618, -0.06813411685967244, 0.1895702577439396, -0.37673625618191364, -0.20680776392494826, 0.13699536703183854, 0.20686410898272706, 0.150167851043599, -0.0029710563314602452, -0.2588394680454333, 0.0022406807559703415, -0.18943240171424428, -0.19442597584784926, -0.1019296018627544, 0.008332431880946279, -0.05200566909331968, -0.24601257378515556, 0.12869778837084322, 0.08512643218142002, 0.05884180048522644, -0.07786648555508205, -0.05407093269960549, -0.12069440283812582, 0.03732599803645696, 0.0605329936212699, 0.07245660299974445, 0.12908580733718758, -0.1463426703331586, -0.08549853549618974, 0.40198425381423386, -0.11815749322802976, -0.12519975086408003, 0.21333226141400805, -0.2067684911233478, -0.1285771525962124, 0.2283465313634142, 0.10544228444534137, 0.062199223466231524, -0.05356390557875086, 0.08875819742552676, -0.05433174463591181, 0.18097389444596784, 0.03808315002352448, 0.08466767355855695, 0.3079421687468578, 0.13275882590359034, 0.07336064472206329, 0.17133145876617445, -0.10294054133495442, -0.12417383379253902, -0.3111262972837776, -0.12356142290426712, -0.22228934854633153, 0.04689520303804613, -0.04405544895520767, -0.1951117700830634, 0.37008650490972106, 0.11242308654591329, 0.2417873527340003, -0.0042289605003578545, 0.21990553396438858, 0.13871057097505973, 0.09167109349308382, 0.06367595700014915, 0.2641442156837959, 0.11910857847730692, 0.05473240363653189, -0.29713898195024696, -0.07367651128819339, 0.072382712624687] |
1,803.00971 | On commensurability of some right-angled Artin groups II: RAAGs defined
by paths | In this paper we continue the study of right-angled Artin groups up to
commensurability initiated in [CKZ]. We show that RAAGs defined by different
paths of length greater than 3 are not commensurable. We also characterise
which RAAGs defined by paths are commensurable to RAAGs defined by trees of
diameter 4. More precisely, we show that a RAAG defined by a path of length
$n>4$ is commensurable to a RAAG defined by a tree of diameter 4 if and only if
$n$ is 2 modulo 4. These results follow from the connection that we establish
between the classification of RAAGs up to commensurability and linear
integer-programming.
| math.GR | in this paper we continue the study of rightangled artin groups up to commensurability initiated in ckz we show that raags defined by different paths of length greater than 3 are not commensurable we also characterise which raags defined by paths are commensurable to raags defined by trees of diameter 4 more precisely we show that a raag defined by a path of length n4 is commensurable to a raag defined by a tree of diameter 4 if and only if n is 2 modulo 4 these results follow from the connection that we establish between the classification of raags up to commensurability and linear integerprogramming | [['in', 'this', 'paper', 'we', 'continue', 'the', 'study', 'of', 'rightangled', 'artin', 'groups', 'up', 'to', 'commensurability', 'initiated', 'in', 'ckz', 'we', 'show', 'that', 'raags', 'defined', 'by', 'different', 'paths', 'of', 'length', 'greater', 'than', '3', 'are', 'not', 'commensurable', 'we', 'also', 'characterise', 'which', 'raags', 'defined', 'by', 'paths', 'are', 'commensurable', 'to', 'raags', 'defined', 'by', 'trees', 'of', 'diameter', '4', 'more', 'precisely', 'we', 'show', 'that', 'a', 'raag', 'defined', 'by', 'a', 'path', 'of', 'length', 'n4', 'is', 'commensurable', 'to', 'a', 'raag', 'defined', 'by', 'a', 'tree', 'of', 'diameter', '4', 'if', 'and', 'only', 'if', 'n', 'is', '2', 'modulo', '4', 'these', 'results', 'follow', 'from', 'the', 'connection', 'that', 'we', 'establish', 'between', 'the', 'classification', 'of', 'raags', 'up', 'to', 'commensurability', 'and', 'linear', 'integerprogramming']] | [-0.17660857691939566, 0.22311528353325447, -0.04823553714723814, 0.06336235801933245, -0.059482159270417126, -0.13240378546040682, 0.039171369476909086, 0.4132998442898194, -0.30530075090272085, -0.316079342258828, 0.08197995440457903, -0.2620947860181332, -0.17773555370845964, 0.2253579251800797, -0.11909231608290048, -0.020016538972655932, 0.0521071517662633, 0.07498113380390264, -0.08137371257346655, -0.3109601322206713, 0.34365324517060625, -0.05115350030717396, 0.15845658324681045, 0.03747898793468873, 0.05668982288667134, 0.011348918922955082, -0.04465634311948504, 0.07634936627887544, -0.21841017835256588, 0.12476760088244364, 0.26481059007568375, 0.07172102383559659, 0.18300655382197528, -0.35443309903854414, -0.13661100777708704, 0.15254223229629651, 0.15636084808391473, -0.009662461012513154, 0.03499555900579296, -0.2395409963470662, 0.20043615353781552, -0.15160912836768797, -0.13488419801440268, 0.030695364269472305, 0.09963945038616658, 0.011591032925727112, -0.1669410024259594, 0.010985052627455886, 0.13630604359010856, 0.10955351551972507, 0.014897522365763074, -0.0769412791267747, -0.04432312725998816, 0.14529322171140285, -0.007293010582881314, 0.025246978460234545, 0.036679150966838714, -0.05241977340275688, -0.1598447837379007, 0.3758965511229776, -0.050125610197123714, -0.16518670115176412, 0.1822027621169885, -0.20015190152806187, -0.14551555719448342, 0.14777792286837385, 0.13425203525416907, 0.14229300091309208, -0.08089699693733737, 0.09915285310818858, -0.1251250638316075, 0.164173410965928, 0.17198714770021892, -0.061388817846420266, 0.0981342347225845, 0.11889927602772202, 0.15433507934212684, 0.16250845826053548, 0.035781635831864105, 0.03997917855601935, -0.303523380557696, -0.1608356045647746, -0.1329728604250011, 0.10562493430597464, -0.07819862413591527, -0.13728789229699898, 0.35645617542433594, 0.0833903936824451, 0.2043998379082907, 0.1727904472511173, 0.17592390055901239, 0.041988166483740014, 0.11377687551347272, 0.11265960199137529, 0.1508061694956961, 0.14788377037981437, -0.115793276338705, -0.1445154263527088, -0.019096617946135146, 0.14197199435106345] |
1,803.00972 | Trade-off between information and disturbance in qubit thermometry | We address the trade-off between information and disturbance in qubit
thermometry from the perspective of quantum estimation theory. Given a quantum
measurement, we quantify information via the Fisher information of the
measurement and disturbance via four different figures of merit, which capture
different aspects (statistical, thermodynamical, geometrical) of the trade-off.
For each disturbance measure, the efficient measurements, i.e. the measurements
that introduce a disturbance not greater than any other measurement extracting
the same amount of information, are determined explicitly. The family of
efficient measurements varies with the choice of the disturbance measure. On
the other hand, commutativity between the elements of the probability
operator-valued measure (POVM) and the equilibrium state of the thermometer is
a necessary condition for efficiency with respect to any figure of disturbance.
| quant-ph | we address the tradeoff between information and disturbance in qubit thermometry from the perspective of quantum estimation theory given a quantum measurement we quantify information via the fisher information of the measurement and disturbance via four different figures of merit which capture different aspects statistical thermodynamical geometrical of the tradeoff for each disturbance measure the efficient measurements ie the measurements that introduce a disturbance not greater than any other measurement extracting the same amount of information are determined explicitly the family of efficient measurements varies with the choice of the disturbance measure on the other hand commutativity between the elements of the probability operatorvalued measure povm and the equilibrium state of the thermometer is a necessary condition for efficiency with respect to any figure of disturbance | [['we', 'address', 'the', 'tradeoff', 'between', 'information', 'and', 'disturbance', 'in', 'qubit', 'thermometry', 'from', 'the', 'perspective', 'of', 'quantum', 'estimation', 'theory', 'given', 'a', 'quantum', 'measurement', 'we', 'quantify', 'information', 'via', 'the', 'fisher', 'information', 'of', 'the', 'measurement', 'and', 'disturbance', 'via', 'four', 'different', 'figures', 'of', 'merit', 'which', 'capture', 'different', 'aspects', 'statistical', 'thermodynamical', 'geometrical', 'of', 'the', 'tradeoff', 'for', 'each', 'disturbance', 'measure', 'the', 'efficient', 'measurements', 'ie', 'the', 'measurements', 'that', 'introduce', 'a', 'disturbance', 'not', 'greater', 'than', 'any', 'other', 'measurement', 'extracting', 'the', 'same', 'amount', 'of', 'information', 'are', 'determined', 'explicitly', 'the', 'family', 'of', 'efficient', 'measurements', 'varies', 'with', 'the', 'choice', 'of', 'the', 'disturbance', 'measure', 'on', 'the', 'other', 'hand', 'commutativity', 'between', 'the', 'elements', 'of', 'the', 'probability', 'operatorvalued', 'measure', 'povm', 'and', 'the', 'equilibrium', 'state', 'of', 'the', 'thermometer', 'is', 'a', 'necessary', 'condition', 'for', 'efficiency', 'with', 'respect', 'to', 'any', 'figure', 'of', 'disturbance']] | [-0.12613696745589434, 0.1295675132054067, -0.10951269043993855, 0.0366373578426502, -0.03193721217325046, -0.174753070930906, 0.07460196118982923, 0.30675223475092994, -0.2882662005648608, -0.33045756407978294, 0.08690377402891745, -0.32136730367820415, -0.08854303638347322, 0.19573190119413156, -0.09179759734321297, 0.08478487137379864, 0.06933093670799974, 0.08366926012575508, -0.14282860233086264, -0.16914415425835325, 0.33134976588559173, 0.09785761835519224, 0.31517353786214714, 0.038923545710979, 0.16552696473866937, 0.011979547038208693, -0.06485016145817345, 0.011515511913106792, -0.18383117417449416, 0.1265457800510044, 0.21973018424487525, 0.18629523430995287, 0.26110214672775733, -0.3670787022611688, -0.19843132648291806, 0.1438310993890766, 0.05215458842068319, 0.09705843952473342, -0.006377101841656166, -0.2834661335671424, 0.01912513030840764, -0.14371321331118309, -0.04905803704316476, -0.06842479667448927, -0.0038976536542620686, -0.0036646978530500618, -0.2717107325082734, 0.08836465018490951, 0.05890633661248204, 0.08547779423968187, -0.03967568055645282, -0.05606251966858667, -0.007588589667446083, 0.18658538947310593, -0.03013334191766464, -0.01388718143090724, 0.19681927004075123, -0.11519353755468888, -0.11364683412645558, 0.34445535444187014, -0.04922465460307043, -0.27438488911300535, 0.1229370934962635, -0.16709813009947538, -0.0869303098953669, 0.07217792956905054, 0.12512087283123816, 0.06649310473677894, -0.17532962821571837, -0.0071104480529255755, 0.002536871526408793, 0.19807998096895596, 0.06102244049635908, 0.15442685906716164, 0.16967203518346188, 0.09992409877050372, 0.12352834547322894, 0.1404972923078781, -0.09955614319418572, -0.10283315997748148, -0.32259212667122483, -0.20015373237667575, -0.2150239870876133, 0.04617805051118864, -0.1488076950630611, -0.12325272998876041, 0.3932735507805196, 0.19569164657935736, 0.18166688389130056, -0.00044486038885744553, 0.3476295890286565, 0.11692676766468803, 0.0008976484883561848, 0.03176276693453214, 0.267159196104677, 0.17266918562116132, 0.02529977208616892, -0.2577335194459126, 0.1428984867941056, 0.009846944400730232] |
1,803.00973 | Series solution of Laplace problems | At the ANZIAM conference in Hobart in February, 2018, there were several
talks on the solution of Laplace problems in multiply connected domains by
means of conformal mapping. It appears to be not widely known that such
problems can also be solved by the elementary method of series expansions with
coefficients determined by least-squares fitting on the boundary. (These are
not convergent series; the coefficients depend on the degree of the
approximation.) Here we give a tutorial introduction to this method, which
converges at an exponential rate if the boundary data are sufficiently
well-behaved. The mathematical foundations go back to Runge in 1885 and Walsh
in 1929. One of our examples involves an approximate Cantor set with up to 2048
components.
| math.NA | at the anziam conference in hobart in february 2018 there were several talks on the solution of laplace problems in multiply connected domains by means of conformal mapping it appears to be not widely known that such problems can also be solved by the elementary method of series expansions with coefficients determined by leastsquares fitting on the boundary these are not convergent series the coefficients depend on the degree of the approximation here we give a tutorial introduction to this method which converges at an exponential rate if the boundary data are sufficiently wellbehaved the mathematical foundations go back to runge in 1885 and walsh in 1929 one of our examples involves an approximate cantor set with up to 2048 components | [['at', 'the', 'anziam', 'conference', 'in', 'hobart', 'in', 'february', '2018', 'there', 'were', 'several', 'talks', 'on', 'the', 'solution', 'of', 'laplace', 'problems', 'in', 'multiply', 'connected', 'domains', 'by', 'means', 'of', 'conformal', 'mapping', 'it', 'appears', 'to', 'be', 'not', 'widely', 'known', 'that', 'such', 'problems', 'can', 'also', 'be', 'solved', 'by', 'the', 'elementary', 'method', 'of', 'series', 'expansions', 'with', 'coefficients', 'determined', 'by', 'leastsquares', 'fitting', 'on', 'the', 'boundary', 'these', 'are', 'not', 'convergent', 'series', 'the', 'coefficients', 'depend', 'on', 'the', 'degree', 'of', 'the', 'approximation', 'here', 'we', 'give', 'a', 'tutorial', 'introduction', 'to', 'this', 'method', 'which', 'converges', 'at', 'an', 'exponential', 'rate', 'if', 'the', 'boundary', 'data', 'are', 'sufficiently', 'wellbehaved', 'the', 'mathematical', 'foundations', 'go', 'back', 'to', 'runge', 'in', '1885', 'and', 'walsh', 'in', '1929', 'one', 'of', 'our', 'examples', 'involves', 'an', 'approximate', 'cantor', 'set', 'with', 'up', 'to', '2048', 'components']] | [-0.059749926547452516, 0.07205986512525676, -0.10095934168058486, 0.02490717176759754, -0.09257695683054934, -0.12181037774863691, 0.013462033981701729, 0.34982735313444346, -0.29166771280617754, -0.27814461410907676, 0.17653863517517485, -0.2885078955249291, -0.15094555633513965, 0.23780710443330944, -0.07539242863932177, 0.04355703715681414, 0.05435313397926117, 0.028647232812267442, -0.061759698287437645, -0.33301766022793516, 0.2808222328524359, 0.011891841457402411, 0.22300540805555696, 0.053067496869990155, 0.10091386155575545, -0.04387607700229922, -0.05568791855480676, -0.00494371279920182, -0.1213847529473219, 0.09968681612690865, 0.26979165002010946, 0.10405579330168727, 0.287868387573822, -0.4317241654046311, -0.14329418278884234, 0.05758534730238886, 0.133354241840449, 0.05259120737179375, 0.007770709573168092, -0.2659140121632386, 0.06971538548688751, -0.11834473102384782, -0.1438293821286133, -0.08989406109574416, 0.007391719074442613, 0.05028665138308482, -0.2472735461413337, 0.07168715787942767, 0.05909027534052114, 0.0719806292432953, -0.03073515884952489, -0.10634634372093214, 0.041520731246545296, 0.09935672058192782, 0.04511384261879793, 0.04892478191701711, 0.03966930087594207, -0.05038865737343776, -0.10576283667344323, 0.3471197268833245, -0.06336553635321988, -0.22357638387758985, 0.17273660483269776, -0.13630071245056907, -0.1547807170528426, 0.1513306537127384, 0.16004067462337904, 0.152300733001133, -0.15403945075948378, 0.1371666826687807, -0.04208785460392121, 0.15547680850948922, 0.13648141863609642, -0.056380124566383846, 0.1708524947454922, 0.0896604163649161, 0.05666518238923187, 0.10070503672223138, -0.009844073535074011, -0.10432116611483545, -0.322416636107628, -0.11805235049571873, -0.2209595283454915, 0.04325474983813388, -0.06280151466646113, -0.19739113341726378, 0.3806450364587844, 0.10282628053031026, 0.18023898285498058, 0.031167278074936494, 0.23990989870522633, 0.15452113550376198, 0.05500453075707682, 0.10911491894939374, 0.20099379021812938, 0.12267342866552332, 0.083274762583935, -0.15288429458775704, 0.04211147975567189, 0.1465868836245692] |
1,803.00974 | Hashing with Mutual Information | Binary vector embeddings enable fast nearest neighbor retrieval in large
databases of high-dimensional objects, and play an important role in many
practical applications, such as image and video retrieval. We study the problem
of learning binary vector embeddings under a supervised setting, also known as
hashing. We propose a novel supervised hashing method based on optimizing an
information-theoretic quantity: mutual information. We show that optimizing
mutual information can reduce ambiguity in the induced neighborhood structure
in the learned Hamming space, which is essential in obtaining high retrieval
performance. To this end, we optimize mutual information in deep neural
networks with minibatch stochastic gradient descent, with a formulation that
maximally and efficiently utilizes available supervision. Experiments on four
image retrieval benchmarks, including ImageNet, confirm the effectiveness of
our method in learning high-quality binary embeddings for nearest neighbor
retrieval.
| cs.CV | binary vector embeddings enable fast nearest neighbor retrieval in large databases of highdimensional objects and play an important role in many practical applications such as image and video retrieval we study the problem of learning binary vector embeddings under a supervised setting also known as hashing we propose a novel supervised hashing method based on optimizing an informationtheoretic quantity mutual information we show that optimizing mutual information can reduce ambiguity in the induced neighborhood structure in the learned hamming space which is essential in obtaining high retrieval performance to this end we optimize mutual information in deep neural networks with minibatch stochastic gradient descent with a formulation that maximally and efficiently utilizes available supervision experiments on four image retrieval benchmarks including imagenet confirm the effectiveness of our method in learning highquality binary embeddings for nearest neighbor retrieval | [['binary', 'vector', 'embeddings', 'enable', 'fast', 'nearest', 'neighbor', 'retrieval', 'in', 'large', 'databases', 'of', 'highdimensional', 'objects', 'and', 'play', 'an', 'important', 'role', 'in', 'many', 'practical', 'applications', 'such', 'as', 'image', 'and', 'video', 'retrieval', 'we', 'study', 'the', 'problem', 'of', 'learning', 'binary', 'vector', 'embeddings', 'under', 'a', 'supervised', 'setting', 'also', 'known', 'as', 'hashing', 'we', 'propose', 'a', 'novel', 'supervised', 'hashing', 'method', 'based', 'on', 'optimizing', 'an', 'informationtheoretic', 'quantity', 'mutual', 'information', 'we', 'show', 'that', 'optimizing', 'mutual', 'information', 'can', 'reduce', 'ambiguity', 'in', 'the', 'induced', 'neighborhood', 'structure', 'in', 'the', 'learned', 'hamming', 'space', 'which', 'is', 'essential', 'in', 'obtaining', 'high', 'retrieval', 'performance', 'to', 'this', 'end', 'we', 'optimize', 'mutual', 'information', 'in', 'deep', 'neural', 'networks', 'with', 'minibatch', 'stochastic', 'gradient', 'descent', 'with', 'a', 'formulation', 'that', 'maximally', 'and', 'efficiently', 'utilizes', 'available', 'supervision', 'experiments', 'on', 'four', 'image', 'retrieval', 'benchmarks', 'including', 'imagenet', 'confirm', 'the', 'effectiveness', 'of', 'our', 'method', 'in', 'learning', 'highquality', 'binary', 'embeddings', 'for', 'nearest', 'neighbor', 'retrieval']] | [-0.0738981952550855, -0.029560860693174325, -0.037449069640660373, 0.10632076094701995, -0.1150665571785661, -0.18353658861371885, 0.04937084108917383, 0.48838995640458416, -0.3255796213940221, -0.3096817608032185, 0.08098165078146424, -0.29771796344731843, -0.2218944886631339, 0.18955023154058923, -0.1388145523676037, 0.11011385231068099, 0.153276239922882, 0.07747998457388396, -0.12665378621500664, -0.346395616592112, 0.31219298713398674, 0.05714386194263735, 0.34488226535872823, 0.0049596997568499375, 0.14790246411852104, 0.07408821721132981, -0.038894301158015746, -0.02585496124450328, -0.06337910139626045, 0.22879919394371473, 0.34749502324274856, 0.2431940957360024, 0.32660217642151906, -0.33750304184092655, -0.23698776213360448, 0.13999123199091695, 0.171532583538312, 0.13268465572801574, -0.11125574913258277, -0.318080393304321, 0.055739815448866276, -0.15054177954099582, 0.09361589747229523, -0.20714035019385593, -0.02522784812090388, -0.002579068997874856, -0.32406707595308126, 0.016808648994591863, 0.10676476302944178, 0.0537997821148784, -0.05695497947846995, -0.11050057003315347, 0.060962250308357994, 0.16314812454592137, -0.013968397937986973, 0.09518410466580794, 0.12024662119207265, -0.18987817616868138, -0.15867176348425066, 0.35600940076409954, -0.10901113376395274, -0.21739128921316922, 0.1709820451843722, 0.00815194306035193, -0.1839828760529712, 0.061068112207372696, 0.30700656110216884, 0.172334926274272, -0.16062876522790873, 0.02324572604797087, -0.050212429629054166, 0.19754154388418924, 0.053243976859647754, 0.07800554630965212, 0.19926141934081856, 0.252610537733366, 0.07793476894101889, 0.20427156559932624, -0.1637304076095567, -0.12262778597319648, -0.1721142618882939, -0.11600313323080866, -0.2499984337329647, -0.05330613588750274, -0.1950217179209886, -0.13448791358837464, 0.3089444639677875, 0.23442026296712076, 0.23673994926694122, 0.04638934398603619, 0.33401355547082684, -0.024828874607176185, 0.09368561387034881, 0.13352959631962608, 0.19227439407463165, 0.04366180667803235, 0.11882166215728451, -0.1850045110238376, 0.08120884962828599, 0.13489579791746978] |
1,803.00975 | Entangled Pauli Principles: the DNA of Quantum Hall Fluids | A formalism is developed for the rigorous study of solvable fractional
quantum Hall parent Hamiltonians with Landau level mixing. The idea of
organization through "generalized Pauli principles" is expanded to allow for
root level entanglement, giving rise to "entangled Pauli principles". Through
the latter, aspects of the effective field theory description become ingrained
in exact microscopic solutions for a great wealth of phases for which no
similar single Landau level description is known. We discuss in detail braiding
statistic, edge theory, and rigorous zero mode counting for the Jain-221 state
as derived from a microscopic Hamiltonian. The relevant root-level entanglement
is found to feature an AKLT-type MPS structure associated with an emergent
SU(2) symmetry.
| cond-mat.str-el | a formalism is developed for the rigorous study of solvable fractional quantum hall parent hamiltonians with landau level mixing the idea of organization through generalized pauli principles is expanded to allow for root level entanglement giving rise to entangled pauli principles through the latter aspects of the effective field theory description become ingrained in exact microscopic solutions for a great wealth of phases for which no similar single landau level description is known we discuss in detail braiding statistic edge theory and rigorous zero mode counting for the jain221 state as derived from a microscopic hamiltonian the relevant rootlevel entanglement is found to feature an aklttype mps structure associated with an emergent su2 symmetry | [['a', 'formalism', 'is', 'developed', 'for', 'the', 'rigorous', 'study', 'of', 'solvable', 'fractional', 'quantum', 'hall', 'parent', 'hamiltonians', 'with', 'landau', 'level', 'mixing', 'the', 'idea', 'of', 'organization', 'through', 'generalized', 'pauli', 'principles', 'is', 'expanded', 'to', 'allow', 'for', 'root', 'level', 'entanglement', 'giving', 'rise', 'to', 'entangled', 'pauli', 'principles', 'through', 'the', 'latter', 'aspects', 'of', 'the', 'effective', 'field', 'theory', 'description', 'become', 'ingrained', 'in', 'exact', 'microscopic', 'solutions', 'for', 'a', 'great', 'wealth', 'of', 'phases', 'for', 'which', 'no', 'similar', 'single', 'landau', 'level', 'description', 'is', 'known', 'we', 'discuss', 'in', 'detail', 'braiding', 'statistic', 'edge', 'theory', 'and', 'rigorous', 'zero', 'mode', 'counting', 'for', 'the', 'jain221', 'state', 'as', 'derived', 'from', 'a', 'microscopic', 'hamiltonian', 'the', 'relevant', 'rootlevel', 'entanglement', 'is', 'found', 'to', 'feature', 'an', 'aklttype', 'mps', 'structure', 'associated', 'with', 'an', 'emergent', 'su2', 'symmetry']] | [-0.13012042860334208, 0.19388425985718122, -0.1085401378305895, 0.11473728289378674, -0.07258150644234515, -0.15815649164869683, 0.04898329088713841, 0.28340610617306083, -0.2428501955250145, -0.2764276046405679, 0.02401516987447394, -0.24152081665982092, -0.16260774833582609, 0.14672164459313666, 0.01440586090445452, 0.05843169356895877, 0.012760386047635361, 0.07989722357056703, -0.08206652451605935, -0.17925084510976116, 0.28432511814753525, 0.0729539059185689, 0.32945919421035796, 0.05170411399532376, 0.10833946782180906, 0.028950556613770977, 0.03408249532523249, 0.007725584969323661, -0.15058634877953278, 0.1039960760847732, 0.2725490105014095, 0.04996089544147253, 0.21887969566783536, -0.43838120468093883, -0.18593300414379751, -0.004398509387101512, 0.13125586288931249, 0.19309939153338615, -0.024565964454918036, -0.3163675438928684, 0.01701561808918736, -0.21363066041573933, -0.21365344672657166, -0.14008656653043414, 0.00624835988128325, -0.11608989652138137, -0.21717350117406958, 0.10367990338454547, 0.05065924282618133, 0.09283515904576234, -0.03640280959994665, -0.1086735281818879, -0.026554816273606514, 0.10748796184530615, 0.0035843638096204294, -0.011639166243185173, 0.0878280716642621, -0.15272670940196673, -0.16106173755750725, 0.3879104635312355, -0.01425465292881459, -0.19960071463304171, 0.15584201463622907, -0.11524303227750872, -0.16057712464992488, 0.1360081444269911, 0.08899159899530266, 0.048099126026500016, -0.166746831645079, 0.12280403617218585, -0.03581919183904704, 0.13706319896820268, 0.01848666394861149, 0.10242963083666316, 0.2185161205208195, 0.11688820482439562, 0.06654610712472017, 0.1406518963423358, -0.013764889882233027, -0.19988151941548235, -0.3291632766236684, -0.16122463984853702, -0.20923503831805387, 0.11527762452273496, -0.044936374598884346, -0.17919775307278282, 0.4323172737328735, 0.11520619570988597, 0.12167681164153724, 0.015663809324905742, 0.21928596436711295, 0.1870281536820195, 0.05184736905253625, 0.01814948971566212, 0.21295948489984898, 0.19597815317268083, 0.024062746104651263, -0.24096710575603147, -0.0007996581428285156, 0.12822781133581884] |
1,803.00976 | Sparse power-law network model for reliable statistical predictions
based on sampled data | A projective network model is a model that enables predictions to be made
based on a subsample of the network data, with the predictions remaining
unchanged if a larger sample is taken into consideration. An exchangeable model
is a model that does not depend on the order in which nodes are sampled.
Despite a large variety of non-equilibrium (growing) and equilibrium (static)
sparse complex network models that are widely used in network science, how to
reconcile sparseness (constant average degree) with the desired statistical
properties of projectivity and exchangeability is currently an outstanding
scientific problem. Here we propose a network process with hidden variables
which is projective and can generate sparse power-law networks. Despite the
model not being exchangeable, it can be closely related to exchangeable
uncorrelated networks as indicated by its information theory characterization
and its network entropy. The use of the proposed network process as a null
model is here tested on real data, indicating that the model offers a promising
avenue for statistical network modelling.
| physics.soc-ph cond-mat.dis-nn cond-mat.stat-mech | a projective network model is a model that enables predictions to be made based on a subsample of the network data with the predictions remaining unchanged if a larger sample is taken into consideration an exchangeable model is a model that does not depend on the order in which nodes are sampled despite a large variety of nonequilibrium growing and equilibrium static sparse complex network models that are widely used in network science how to reconcile sparseness constant average degree with the desired statistical properties of projectivity and exchangeability is currently an outstanding scientific problem here we propose a network process with hidden variables which is projective and can generate sparse powerlaw networks despite the model not being exchangeable it can be closely related to exchangeable uncorrelated networks as indicated by its information theory characterization and its network entropy the use of the proposed network process as a null model is here tested on real data indicating that the model offers a promising avenue for statistical network modelling | [['a', 'projective', 'network', 'model', 'is', 'a', 'model', 'that', 'enables', 'predictions', 'to', 'be', 'made', 'based', 'on', 'a', 'subsample', 'of', 'the', 'network', 'data', 'with', 'the', 'predictions', 'remaining', 'unchanged', 'if', 'a', 'larger', 'sample', 'is', 'taken', 'into', 'consideration', 'an', 'exchangeable', 'model', 'is', 'a', 'model', 'that', 'does', 'not', 'depend', 'on', 'the', 'order', 'in', 'which', 'nodes', 'are', 'sampled', 'despite', 'a', 'large', 'variety', 'of', 'nonequilibrium', 'growing', 'and', 'equilibrium', 'static', 'sparse', 'complex', 'network', 'models', 'that', 'are', 'widely', 'used', 'in', 'network', 'science', 'how', 'to', 'reconcile', 'sparseness', 'constant', 'average', 'degree', 'with', 'the', 'desired', 'statistical', 'properties', 'of', 'projectivity', 'and', 'exchangeability', 'is', 'currently', 'an', 'outstanding', 'scientific', 'problem', 'here', 'we', 'propose', 'a', 'network', 'process', 'with', 'hidden', 'variables', 'which', 'is', 'projective', 'and', 'can', 'generate', 'sparse', 'powerlaw', 'networks', 'despite', 'the', 'model', 'not', 'being', 'exchangeable', 'it', 'can', 'be', 'closely', 'related', 'to', 'exchangeable', 'uncorrelated', 'networks', 'as', 'indicated', 'by', 'its', 'information', 'theory', 'characterization', 'and', 'its', 'network', 'entropy', 'the', 'use', 'of', 'the', 'proposed', 'network', 'process', 'as', 'a', 'null', 'model', 'is', 'here', 'tested', 'on', 'real', 'data', 'indicating', 'that', 'the', 'model', 'offers', 'a', 'promising', 'avenue', 'for', 'statistical', 'network', 'modelling']] | [-0.06921878642502374, 0.07458959105913111, -0.0908607255141327, 0.06311620602019459, -0.09347342872587476, -0.18037883703558086, 0.03445354497844597, 0.41121069879192784, -0.2830045501801318, -0.29692727516937467, 0.10356881909787521, -0.2533344945915728, -0.17872903222450987, 0.16589945137439782, -0.07596188160546478, 0.07396954450953108, 0.08780957417218901, 0.04955780911924584, -0.00834452302660793, -0.24419535090592467, 0.3105268293376347, 0.08566557329391972, 0.33886455873393323, 0.009306778180568168, 0.11100038759815063, -0.018930366342222744, -0.021851994876453232, 0.04750173060511727, -0.062203416938462486, 0.13554682856955055, 0.2402338374573836, 0.17239334912128038, 0.279162010901408, -0.4275776609343839, -0.2664372291404843, 0.16685269005774034, 0.11838565235319991, 0.10453616486934368, 0.008194693043367892, -0.27090561616932973, 0.08553980007335278, -0.16458768898926446, -0.0861956544991006, -0.1126566151994796, -0.0059963585199078635, 0.010324078143249997, -0.29670814954165725, 0.0664668606727251, 0.05528836113323147, 0.019864510955466402, -0.020447915357570828, -0.09166546737972003, -0.054425809310660475, 0.12026178424934014, 0.014378118409478616, 0.05600710095868202, 0.1254365821452146, -0.12202337318359198, -0.11623662278898769, 0.37257850577900953, -0.037529016472815, -0.20558779616285824, 0.18574751686953409, -0.09925563458541763, -0.1684646570328845, 0.10746210366016298, 0.19693674269919506, 0.07908022518469286, -0.18657837433940067, 0.05179242255897926, -0.08701175046042495, 0.1984209287218705, -0.03814717000516664, 0.011423474970451068, 0.22595296825637065, 0.23773950294569313, 0.0346682995101825, 0.12455889823017753, -0.07520462761195154, -0.11795091534302282, -0.25638849534845487, -0.10133559739014822, -0.23162315549173704, 0.05212783314986848, -0.11983435556335496, -0.18520834637317984, 0.391453761829152, 0.18885168164983734, 0.21724967541827245, 0.08174054299126424, 0.27900218491309453, 0.05713643548161989, 0.08628363138025937, 0.0680674742796414, 0.19626435589244856, 0.1421564716362073, 0.06134379484103106, -0.10705814802176541, 0.1525044482855481, -0.011995636619671825] |
1,803.00977 | Collective effects in Casimir-Polder forces | We study cooperative phenomena in the fluctuation-induced forces between a
surface and a system of neutral two-level quantum emitters prepared in a
coherent collective state, showing that the total Casimir-Polder force on the
emitters can be modified via their mutual correlations. Particularly, we find
that a collection of emitters prepared in a super- or subradiant state
experiences an enhanced or suppressed collective vacuum-induced force,
respectively. The collective nature of dispersion forces can be understood as
resulting from the interference between the different processes contributing to
the surface-modified resonant dipole-dipole interaction. Such cooperative
fluctuation forces depend singularly on the surface response at the resonance
frequency of the emitters, thus being easily maneuverable. Our results
demonstrate the potential of collective phenomena as a new tool to selectively
tailor vacuum forces.
| quant-ph | we study cooperative phenomena in the fluctuationinduced forces between a surface and a system of neutral twolevel quantum emitters prepared in a coherent collective state showing that the total casimirpolder force on the emitters can be modified via their mutual correlations particularly we find that a collection of emitters prepared in a super or subradiant state experiences an enhanced or suppressed collective vacuuminduced force respectively the collective nature of dispersion forces can be understood as resulting from the interference between the different processes contributing to the surfacemodified resonant dipoledipole interaction such cooperative fluctuation forces depend singularly on the surface response at the resonance frequency of the emitters thus being easily maneuverable our results demonstrate the potential of collective phenomena as a new tool to selectively tailor vacuum forces | [['we', 'study', 'cooperative', 'phenomena', 'in', 'the', 'fluctuationinduced', 'forces', 'between', 'a', 'surface', 'and', 'a', 'system', 'of', 'neutral', 'twolevel', 'quantum', 'emitters', 'prepared', 'in', 'a', 'coherent', 'collective', 'state', 'showing', 'that', 'the', 'total', 'casimirpolder', 'force', 'on', 'the', 'emitters', 'can', 'be', 'modified', 'via', 'their', 'mutual', 'correlations', 'particularly', 'we', 'find', 'that', 'a', 'collection', 'of', 'emitters', 'prepared', 'in', 'a', 'super', 'or', 'subradiant', 'state', 'experiences', 'an', 'enhanced', 'or', 'suppressed', 'collective', 'vacuuminduced', 'force', 'respectively', 'the', 'collective', 'nature', 'of', 'dispersion', 'forces', 'can', 'be', 'understood', 'as', 'resulting', 'from', 'the', 'interference', 'between', 'the', 'different', 'processes', 'contributing', 'to', 'the', 'surfacemodified', 'resonant', 'dipoledipole', 'interaction', 'such', 'cooperative', 'fluctuation', 'forces', 'depend', 'singularly', 'on', 'the', 'surface', 'response', 'at', 'the', 'resonance', 'frequency', 'of', 'the', 'emitters', 'thus', 'being', 'easily', 'maneuverable', 'our', 'results', 'demonstrate', 'the', 'potential', 'of', 'collective', 'phenomena', 'as', 'a', 'new', 'tool', 'to', 'selectively', 'tailor', 'vacuum', 'forces']] | [-0.1622860786428646, 0.24643586053673516, -0.11396419394077384, 0.0705069968062162, -0.014649045042460784, -0.14855948845433886, 0.06059497271417058, 0.3710245826659957, -0.2922705544406199, -0.28121189132798463, -0.04427036275865248, -0.3034062505885231, -0.16971712712256704, 0.19089042406949375, 0.03773027159331832, -0.017997448572714347, 0.018937099473987473, -0.0029973526925459737, 0.024141293743014103, -0.13259378850307257, 0.31395288132625865, 0.0672695642524559, 0.3098450682955445, 0.10056603333032399, 0.07573445870730211, 0.019846099998176214, 0.08043478643912749, 0.017551104250742355, -0.07849918191334382, 0.08509226513342583, 0.22024319664024006, 0.0029937335857539438, 0.2604680102704151, -0.4588289993116632, -0.18892082069214666, 0.08073214196338085, 0.17129360456169707, 0.17953805559955072, -0.0479574804976437, -0.35285648471835884, -0.05971303994010668, -0.15151306518055208, -0.13863313425827073, -0.0864845707983477, -0.005448525793326553, 0.057461118789433385, -0.2415858547174139, 0.09378755758734769, 0.05017135751040769, 0.04747051989670581, -0.06125246405281359, -0.040524928869672294, -0.024742500012507662, 0.13410484806263412, -1.3976587979414035e-05, -0.028434988647859427, 0.2467630042374367, -0.15880625245335978, -0.13450482898588234, 0.37821663413069473, -0.0992910793847841, -0.16827228751299117, 0.2398874011123553, -0.12932150279493726, -0.0347423341169133, 0.14824986696476117, 0.21459231735570938, 0.1149933004489867, -0.16992000927984918, 0.002797868327888864, 0.05611878049967345, 0.20098418897850934, 0.04735095211799489, 0.11560155675033457, 0.25063541697818437, 0.13289188187809486, 0.023826169767744432, 0.16984197047713678, -0.055707755134790204, -0.08220119790894387, -0.2605243312282255, -0.13135597137352306, -0.1917112105729757, 0.06360771561230649, -0.02965159224902436, -0.1517339370038826, 0.353919642209803, 0.10977408251164888, 0.15042779579380294, -0.04398312433477258, 0.2652360596548533, 0.12191821417491155, 0.07209031928323384, -0.00864110690599773, 0.3543898075586185, 0.12718823213799624, 0.05741965818378958, -0.3395515478878224, 0.03167085389941349, -0.01637067358751665] |
1,803.00978 | Control of Battery Storage Systems for the Simultaneous Provision of
Multiple Services | In this paper, we propose a control framework for a battery energy storage
system to provide simultaneously multiple services to the electrical grid. The
objective is to maximise the battery exploitation from these services in the
presence of uncertainty (load, stochastic distributed generation, grid
frequency). The framework is structured in two phases. In a period-ahead phase,
we solve an optimization problem that allocates the battery power and energy
budgets to the different services. In the subsequent real-time phase the
control set-points for the deployment of such services are calculated
separately and superimposed. The control framework is first formulated in a
general way and then casted in the problem of providing dispatchability of a
medium voltage feeder in conjunction to primary frequency control. The
performance of the proposed framework are validated by simulations and
real-scale experi- ments, performed with a grid-connected 560 kWh/720 kVA
Li-ion battery energy storage system.
| eess.SP | in this paper we propose a control framework for a battery energy storage system to provide simultaneously multiple services to the electrical grid the objective is to maximise the battery exploitation from these services in the presence of uncertainty load stochastic distributed generation grid frequency the framework is structured in two phases in a periodahead phase we solve an optimization problem that allocates the battery power and energy budgets to the different services in the subsequent realtime phase the control setpoints for the deployment of such services are calculated separately and superimposed the control framework is first formulated in a general way and then casted in the problem of providing dispatchability of a medium voltage feeder in conjunction to primary frequency control the performance of the proposed framework are validated by simulations and realscale experi ments performed with a gridconnected 560 kwh720 kva liion battery energy storage system | [['in', 'this', 'paper', 'we', 'propose', 'a', 'control', 'framework', 'for', 'a', 'battery', 'energy', 'storage', 'system', 'to', 'provide', 'simultaneously', 'multiple', 'services', 'to', 'the', 'electrical', 'grid', 'the', 'objective', 'is', 'to', 'maximise', 'the', 'battery', 'exploitation', 'from', 'these', 'services', 'in', 'the', 'presence', 'of', 'uncertainty', 'load', 'stochastic', 'distributed', 'generation', 'grid', 'frequency', 'the', 'framework', 'is', 'structured', 'in', 'two', 'phases', 'in', 'a', 'periodahead', 'phase', 'we', 'solve', 'an', 'optimization', 'problem', 'that', 'allocates', 'the', 'battery', 'power', 'and', 'energy', 'budgets', 'to', 'the', 'different', 'services', 'in', 'the', 'subsequent', 'realtime', 'phase', 'the', 'control', 'setpoints', 'for', 'the', 'deployment', 'of', 'such', 'services', 'are', 'calculated', 'separately', 'and', 'superimposed', 'the', 'control', 'framework', 'is', 'first', 'formulated', 'in', 'a', 'general', 'way', 'and', 'then', 'casted', 'in', 'the', 'problem', 'of', 'providing', 'dispatchability', 'of', 'a', 'medium', 'voltage', 'feeder', 'in', 'conjunction', 'to', 'primary', 'frequency', 'control', 'the', 'performance', 'of', 'the', 'proposed', 'framework', 'are', 'validated', 'by', 'simulations', 'and', 'realscale', 'experi', 'ments', 'performed', 'with', 'a', 'gridconnected', '560', 'kwh720', 'kva', 'liion', 'battery', 'energy', 'storage', 'system']] | [-0.18436275799567364, 0.04732200568822956, -0.015924755523335315, -0.013142010661109975, -0.03723469166538027, -0.14213433651228066, 0.10848477673605211, 0.3961948974517314, -0.3043638633321716, -0.3526560772172086, 0.11367894528586775, -0.2430104510444025, -0.06873283245320087, 0.20145599184675805, -0.11698779994175348, 0.09738885507638222, 0.03360253681543551, -0.006081123904712588, 0.010827983593989215, -0.1996550385852995, 0.22858070552728638, 0.10167178042130927, 0.35089286011069604, 0.05608292101971703, 0.08605416315808663, -0.026563449547472983, 0.0011238591165013917, 0.009744721506275747, -0.05742516252077671, 0.13512857911043022, 0.3058995329774916, 0.136160486636122, 0.32450490812324495, -0.482970109069082, -0.2363389725733089, 0.08869811252863083, 0.07831026740513315, 0.034533369782291455, -0.07921613259113407, -0.21558985153965857, 0.08696279285175802, -0.24956709733998325, -0.0704205503371506, -0.055264518328317226, -0.05176718375479726, 0.0543762252678814, -0.33573189719057045, 0.0102824462220481, -0.023851258527130298, 0.015767428671545666, -0.15191225258454885, -0.07124093605352132, -0.011761236741296845, 0.16152625079579694, -0.0025901181339477637, -0.029401966855440238, 0.1457724407421304, -0.08857951274983687, -0.12060666770980477, 0.40755644627553345, 0.00016417657070010198, -0.17974435423870813, 0.11046823306481214, -0.048211053759437725, -0.0873916432770186, 0.11175342605366333, 0.2528261184239479, 0.09562237020454382, -0.23286786915779062, 0.03460335455139563, 0.03479870998265528, 0.16652557635775525, 0.0069624862206257776, 0.013751716182761737, 0.21059420296271675, 0.2438296775129458, 0.12510674467871655, 0.1579617867804426, -0.07492008370870393, -0.11293849178066809, -0.22428004610494148, -0.1525191024953678, -0.17081911317136597, -0.020272763945124023, -0.0695809982330315, -0.12063270443029804, 0.43681417154913693, 0.15724739580006938, 0.1271297584881062, 0.04492766448385911, 0.40898117882339924, 0.12126464573411297, 0.028647628271942702, 0.11301261560723491, 0.19674651960089598, 0.050499955397928516, 0.21290996836574927, -0.25857817785884574, 0.06010204338913541, 0.015989868196799126] |
1,803.00979 | A lower bound for the number of elastic collisions | We prove by example that the number of elastic collisions of $n$ balls of
equal mass and equal size in $d$-dimensional space can be greater than $n^3/27$
for $n\geq 3$ and $d\geq 2$. The previously known lower bound was of order
$n^2$.
| math.DS math-ph math.MP | we prove by example that the number of elastic collisions of n balls of equal mass and equal size in ddimensional space can be greater than n327 for ngeq 3 and dgeq 2 the previously known lower bound was of order n2 | [['we', 'prove', 'by', 'example', 'that', 'the', 'number', 'of', 'elastic', 'collisions', 'of', 'n', 'balls', 'of', 'equal', 'mass', 'and', 'equal', 'size', 'in', 'ddimensional', 'space', 'can', 'be', 'greater', 'than', 'n327', 'for', 'ngeq', '3', 'and', 'dgeq', '2', 'the', 'previously', 'known', 'lower', 'bound', 'was', 'of', 'order', 'n2']] | [-0.10813782550394535, 0.2585092483360956, 0.009676532865297504, 0.06967161132431612, 0.03705354271138587, -0.16616640537522914, -0.026726099355827745, 0.29187736843099316, -0.11732073627957483, -0.38113983370727156, 0.108271856698571, -0.3193543901121834, -0.09106574662415902, 0.16086289715930457, -0.028924925298225587, 0.05473106867838197, -0.03762647166575601, 0.14577032057795583, -0.045026691102354625, -0.3608909518480664, 0.3218391830408264, -0.0334819992777051, 0.15899309316059437, 0.06231455670715105, 0.03819461651827868, 0.013665593842544206, 0.023868001361445682, 0.03990183015305708, -0.21417259366521982, 0.1284704306681084, 0.17843363052461206, 0.08956267220740456, 0.21932742776485478, -0.40560668361623115, -0.17720530963525538, 0.23227032460556252, 0.23551558948508122, 0.04657621979259136, 0.052752907427663843, -0.17334773030881656, 0.1706879005381247, -0.141838626436344, -0.23681597505900553, 0.01674642820456406, 0.15431141393350029, -0.018964084614886016, -0.30698596190933775, 0.08380467608207609, 0.14611574934750068, 0.04500098496948073, -0.09089425692289341, -0.2276234409953581, -0.06416779121088727, 0.07975124530267061, -0.021192685030855057, 0.0902674601345164, 0.03400735130033842, -0.0833276817717067, -0.12862582496798983, 0.35138707385375734, -0.025107638534547467, -0.21594990381016965, 0.15134138034702074, -0.2319926258017559, -0.06053488906018618, 0.18038087600569536, 0.21038790892173603, 0.1589053648115113, -0.0474492293759817, 0.13737144266402848, -0.08822109917371829, 0.21444800814113965, 0.1997655760042551, 0.03288340833174383, 0.06174811200670353, 0.16169058454291121, 0.14312915476720509, 0.1713284646791247, -0.06930889609474235, -0.007537413161338829, -0.3121275840009131, -0.18031541957298475, -0.25939490900533957, 0.1400321154094233, -0.20727052513393573, -0.004449987443300282, 0.2083308941048638, 0.06904385651166482, 0.19037767826783947, 0.11531284737696008, 0.23340634093052004, 0.09832801274591829, 0.04373811362538396, 0.1441845183556036, 0.179400654191651, 0.09265536540500229, -0.04233600199222565, -0.1406658602106135, 0.01139902119047758, 0.1167025073408717] |
1,803.0098 | Estimation of Poisson arrival processes under linear models | In this paper we consider the problem of estimating the parameters of a
Poisson arrival process where the rate function is assumed to lie in the span
of a known basis. Our goal is to estimate the basis expansions coefficients
given a realization of this process. We establish novel guarantees concerning
the accuracy achieved by the maximum likelihood estimate. Our initial result is
near-optimal, with the exception of an undesirable dependence on the dynamic
range of the rate function. We then show how to remove this dependence through
a process of "noise regularization", which results in an improved bound. We
conjecture that a similar guarantee should be possible when using a more direct
(deterministic) regularization scheme. We conclude with a discussion of
practical applications and an empirical examination of the proposed
regularization schemes.
| cs.IT eess.SP math.IT | in this paper we consider the problem of estimating the parameters of a poisson arrival process where the rate function is assumed to lie in the span of a known basis our goal is to estimate the basis expansions coefficients given a realization of this process we establish novel guarantees concerning the accuracy achieved by the maximum likelihood estimate our initial result is nearoptimal with the exception of an undesirable dependence on the dynamic range of the rate function we then show how to remove this dependence through a process of noise regularization which results in an improved bound we conjecture that a similar guarantee should be possible when using a more direct deterministic regularization scheme we conclude with a discussion of practical applications and an empirical examination of the proposed regularization schemes | [['in', 'this', 'paper', 'we', 'consider', 'the', 'problem', 'of', 'estimating', 'the', 'parameters', 'of', 'a', 'poisson', 'arrival', 'process', 'where', 'the', 'rate', 'function', 'is', 'assumed', 'to', 'lie', 'in', 'the', 'span', 'of', 'a', 'known', 'basis', 'our', 'goal', 'is', 'to', 'estimate', 'the', 'basis', 'expansions', 'coefficients', 'given', 'a', 'realization', 'of', 'this', 'process', 'we', 'establish', 'novel', 'guarantees', 'concerning', 'the', 'accuracy', 'achieved', 'by', 'the', 'maximum', 'likelihood', 'estimate', 'our', 'initial', 'result', 'is', 'nearoptimal', 'with', 'the', 'exception', 'of', 'an', 'undesirable', 'dependence', 'on', 'the', 'dynamic', 'range', 'of', 'the', 'rate', 'function', 'we', 'then', 'show', 'how', 'to', 'remove', 'this', 'dependence', 'through', 'a', 'process', 'of', 'noise', 'regularization', 'which', 'results', 'in', 'an', 'improved', 'bound', 'we', 'conjecture', 'that', 'a', 'similar', 'guarantee', 'should', 'be', 'possible', 'when', 'using', 'a', 'more', 'direct', 'deterministic', 'regularization', 'scheme', 'we', 'conclude', 'with', 'a', 'discussion', 'of', 'practical', 'applications', 'and', 'an', 'empirical', 'examination', 'of', 'the', 'proposed', 'regularization', 'schemes']] | [-0.11030625072885585, 0.02436898964493539, -0.1083749176696279, 0.04858017347981885, -0.07890535988039653, -0.0769186113204779, 0.10319200500625332, 0.3741769743593116, -0.2757525164213844, -0.28482412533568485, 0.11596763200263135, -0.2093045401115135, -0.18210826027627222, 0.2051588427485492, -0.10261676854040838, 0.07454921930846303, 0.07481676580986582, 0.0368483908040295, -0.09424513051701233, -0.2758623154473288, 0.3144659815650237, 0.09385134675014849, 0.2779447356154932, 0.06590115133308827, 0.13011525983088895, 0.023166359395236896, -0.03623520263603756, -0.02043321433772956, -0.15725638403381523, 0.11583301960052993, 0.21489456268482582, 0.1365796304307878, 0.32409956589117084, -0.36280418714137286, -0.20349558509529142, 0.1251108561812277, 0.1401011335603977, 0.11013869748230239, -0.05578157310586342, -0.22535355557876646, 0.10579197693623155, -0.17112154590624168, -0.13466044861728788, -0.05407817824918749, -0.02349933577855503, 0.016333395699249173, -0.37005222184737596, 0.06647066342035182, 0.07239148209197097, 0.024500038859931596, -0.06526153131617457, -0.10612409915144842, 0.04684640590059466, 0.09927336170615565, 0.06295411995654975, 0.03561130557817589, 0.09157213197033712, -0.11663628189782507, -0.11555482120134104, 0.3522154998762491, -0.08686863247627266, -0.22800090797665648, 0.14782398691772014, -0.11892785327649094, -0.13748918452713274, 0.10186598139037763, 0.18091121814528802, 0.15022596329996796, -0.15174571029402936, 0.04552066849178767, -0.054404422080606446, 0.16816915314875655, 0.030412225752956885, 0.02612063518718333, 0.1156902930076073, 0.1889808278345272, 0.11036889036921294, 0.15528196637095057, -0.04852128302139279, -0.06213762574781895, -0.3276707591783059, -0.14382248055198601, -0.2089638979160192, 0.0365326522649931, -0.12540774849382197, -0.15494700213123982, 0.3747552293309838, 0.19968368750261634, 0.2574757061254485, 0.07688554657948785, 0.29617159055980075, 0.17665169226124713, 0.004590428054430767, 0.061384836446381826, 0.21750897149506368, 0.10582577193653057, 0.028726338632964997, -0.20499030059322546, 0.09325499023062254, 0.04770214964908765] |
1,803.00981 | On non-positive curvature properties of the Hilbert metric | In this paper, we consider different types of non-positive curvature
properties of the Hilbert metric of a convex domain in R^n. First, we survey
the relationships among the concepts and prove that in the case of Hilbert
metric some of them are equivalent. Furthermore, we show some condition which
implies the rigidity feature: if the Hilbert metric is Berwald, i.e., its
Finslerian Chern connection reduces to a linear one, then the domain is an
ellipsoid and the metric is Riemannian.
| math.DG | in this paper we consider different types of nonpositive curvature properties of the hilbert metric of a convex domain in rn first we survey the relationships among the concepts and prove that in the case of hilbert metric some of them are equivalent furthermore we show some condition which implies the rigidity feature if the hilbert metric is berwald ie its finslerian chern connection reduces to a linear one then the domain is an ellipsoid and the metric is riemannian | [['in', 'this', 'paper', 'we', 'consider', 'different', 'types', 'of', 'nonpositive', 'curvature', 'properties', 'of', 'the', 'hilbert', 'metric', 'of', 'a', 'convex', 'domain', 'in', 'rn', 'first', 'we', 'survey', 'the', 'relationships', 'among', 'the', 'concepts', 'and', 'prove', 'that', 'in', 'the', 'case', 'of', 'hilbert', 'metric', 'some', 'of', 'them', 'are', 'equivalent', 'furthermore', 'we', 'show', 'some', 'condition', 'which', 'implies', 'the', 'rigidity', 'feature', 'if', 'the', 'hilbert', 'metric', 'is', 'berwald', 'ie', 'its', 'finslerian', 'chern', 'connection', 'reduces', 'to', 'a', 'linear', 'one', 'then', 'the', 'domain', 'is', 'an', 'ellipsoid', 'and', 'the', 'metric', 'is', 'riemannian']] | [-0.17164983132388442, 0.0797447333303353, -0.08851167242974042, 0.07549446880875621, -0.1438609848031774, -0.12667710078530944, -0.05155454391933745, 0.38229097588919103, -0.3177039669128135, -0.18003729374031535, 0.10982881382369669, -0.30401145401410756, -0.22605887635145336, 0.13468880317523144, -0.13944765571359313, 0.02041431401667069, 0.045645040093222636, 0.08743617786967661, -0.1242498745530611, -0.27502281877968926, 0.4955294509418309, -0.03331955277826637, 0.2342395598330768, 0.09473753396887333, 0.137415602436522, -0.05920393889537081, -0.00907041773898527, 0.07265236335806549, -0.15616431610296785, 0.13754676522512455, 0.24214944527484478, 0.16662832433066796, 0.2838034722139128, -0.3687937853625044, -0.19183439963962884, 0.18073232783935964, 0.05875953498616582, 0.00927993866353063, 0.009151949273655192, -0.3012691807671217, 0.09042893067526166, -0.08785740301245823, -0.12897072932682932, -0.06242761066532694, 0.02777133076451719, -0.014263067825231701, -0.203148819191847, 0.038997243077028544, 0.15140452040359378, 0.024072025262285024, -0.1406309558034991, -0.047125794657040386, -0.019207588792778552, 0.08224324245238676, 0.052639619175170085, 0.04903233621735126, 0.04377692142152227, -0.07766183485800866, -0.05736641098628752, 0.38119589708512647, -0.060941713955980956, -0.3034679144155234, 0.11509690559469163, -0.163691444741562, -0.12435444493603427, 0.01983680697303498, 0.14248211583471856, 0.18235863867448643, -0.11660630611004308, 0.17179299784911564, -0.07540986605454236, 0.10970845529809595, 0.07331693421001546, 0.054074304574169216, 0.10309037779225036, 0.08890154544496909, 0.1670807834714651, 0.19528230190044268, -0.05382816860546882, -0.08971741557470522, -0.36716548539698124, -0.26428096555173397, -0.20085195645224302, 0.08635832095751539, -0.17778041387173288, -0.17053676909417845, 0.41151627611834557, 0.06445815749466419, 0.20744088033970912, 0.12373376906762132, 0.24409924218198284, 0.06453507459373213, 0.0054069641220849006, 0.08106757561326958, 0.2510781626602693, 0.1584358431166038, 0.04340470413444564, -0.1504546223091893, -0.005974686500849202, 0.13268477846868337] |
1,803.00982 | Excitons in few-layer hexagonal boron nitride: Davydov splitting and
surface localization | Hexagonal boron nitride (hBN) has been attracting great attention because of
its strong excitonic effects. Taking into account few-layer systems, we
investigate theoretically the effects of the number of layers on quasiparticle
energies, absorption spectra, and excitonic states, placing particular focus on
the Davydov splitting of the lowest bound excitons. We describe how the
inter-layer interaction as well as the variation in electronic screening as a
function of layer number $N$ affects the electronic and optical properties.
Using both \textit{ab initio} simulations and a tight-binding model for an
effective Hamiltonian describing the excitons, we characterize in detail the
symmetry of the excitonic wavefunctions and the selection rules for their
coupling to incoming light. We show that for $N > 2$, one can distinguish
between surface excitons that are mostly localized on the outer layers and
inner excitons, leading to an asymmetry in the energy separation between split
excitonic states. In particular, the bound surface excitons lie lower in energy
than their inner counterparts. Additionally, this enables us to show how the
layer thickness affects the shape of the absorption spectrum.
| cond-mat.mtrl-sci cond-mat.mes-hall | hexagonal boron nitride hbn has been attracting great attention because of its strong excitonic effects taking into account fewlayer systems we investigate theoretically the effects of the number of layers on quasiparticle energies absorption spectra and excitonic states placing particular focus on the davydov splitting of the lowest bound excitons we describe how the interlayer interaction as well as the variation in electronic screening as a function of layer number n affects the electronic and optical properties using both textitab initio simulations and a tightbinding model for an effective hamiltonian describing the excitons we characterize in detail the symmetry of the excitonic wavefunctions and the selection rules for their coupling to incoming light we show that for n 2 one can distinguish between surface excitons that are mostly localized on the outer layers and inner excitons leading to an asymmetry in the energy separation between split excitonic states in particular the bound surface excitons lie lower in energy than their inner counterparts additionally this enables us to show how the layer thickness affects the shape of the absorption spectrum | [['hexagonal', 'boron', 'nitride', 'hbn', 'has', 'been', 'attracting', 'great', 'attention', 'because', 'of', 'its', 'strong', 'excitonic', 'effects', 'taking', 'into', 'account', 'fewlayer', 'systems', 'we', 'investigate', 'theoretically', 'the', 'effects', 'of', 'the', 'number', 'of', 'layers', 'on', 'quasiparticle', 'energies', 'absorption', 'spectra', 'and', 'excitonic', 'states', 'placing', 'particular', 'focus', 'on', 'the', 'davydov', 'splitting', 'of', 'the', 'lowest', 'bound', 'excitons', 'we', 'describe', 'how', 'the', 'interlayer', 'interaction', 'as', 'well', 'as', 'the', 'variation', 'in', 'electronic', 'screening', 'as', 'a', 'function', 'of', 'layer', 'number', 'n', 'affects', 'the', 'electronic', 'and', 'optical', 'properties', 'using', 'both', 'textitab', 'initio', 'simulations', 'and', 'a', 'tightbinding', 'model', 'for', 'an', 'effective', 'hamiltonian', 'describing', 'the', 'excitons', 'we', 'characterize', 'in', 'detail', 'the', 'symmetry', 'of', 'the', 'excitonic', 'wavefunctions', 'and', 'the', 'selection', 'rules', 'for', 'their', 'coupling', 'to', 'incoming', 'light', 'we', 'show', 'that', 'for', 'n', '2', 'one', 'can', 'distinguish', 'between', 'surface', 'excitons', 'that', 'are', 'mostly', 'localized', 'on', 'the', 'outer', 'layers', 'and', 'inner', 'excitons', 'leading', 'to', 'an', 'asymmetry', 'in', 'the', 'energy', 'separation', 'between', 'split', 'excitonic', 'states', 'in', 'particular', 'the', 'bound', 'surface', 'excitons', 'lie', 'lower', 'in', 'energy', 'than', 'their', 'inner', 'counterparts', 'additionally', 'this', 'enables', 'us', 'to', 'show', 'how', 'the', 'layer', 'thickness', 'affects', 'the', 'shape', 'of', 'the', 'absorption', 'spectrum']] | [-0.12833719740377209, 0.14840240740654964, -0.04237415716468289, 0.07678016498307672, -0.02588575353127951, -0.10296982118610147, 0.0836007139923873, 0.43313996000579613, -0.25396839065955923, -0.3159555984848288, -0.030697802041381516, -0.3117614209433424, -0.14064195540645186, 0.14085179949361393, 0.061925006949722604, 0.0019427309766822812, 0.013958001690110265, -0.0497692667504554, -0.059244444146986486, -0.191996473337097, 0.3165982356086873, 0.05108942005226607, 0.29679827712210904, 0.15562102549277537, 0.016225384791542948, 0.024254656989939054, 0.09826232508532495, -0.0311840051296037, -0.15498760648049978, 0.1417047461727634, 0.21377735936333941, -0.0591210236151146, 0.23789659339684846, -0.48230258375406265, -0.20096526304832218, 0.04475990549905756, 0.18798898023490757, 0.15683574658199395, -0.046352239012817056, -0.26302950120629875, 0.028171269439015142, -0.15213276152437236, -0.08159457757423877, -0.07549890434348633, 0.02140638473126309, 0.00796249614997283, -0.20461502064061066, 0.060499876520860495, 0.03049540183670798, 0.01013651969579215, -0.12099227690405873, -0.13247010298333436, -0.1328317428426557, 0.12044924750271144, 0.02042593169559376, -0.05026050815853035, 0.16237315606240016, -0.14397115951310324, -0.07567011010078661, 0.39169919040241385, -0.07098044282355145, -0.13332114808583975, 0.1726736357831006, -0.13674168778952814, -0.057890511229738345, 0.13716541712078678, 0.17212716875631653, 0.11881093466075596, -0.09513570910889406, 0.10330150688331127, -0.03018295710292442, 0.19217179848763094, 0.07547782825087536, 0.16476295447996792, 0.22663150648664496, 0.16896121883660806, 0.048398618810086946, 0.14733482243274676, -0.12875094109828786, -0.06251025742294486, -0.21610772014496712, -0.160066400449749, -0.21762589920525485, 0.050680756281447394, -0.04927770894854239, -0.18810499193115607, 0.46131729941513366, 0.10725154741224963, 0.20936425341642462, -0.018690817028169607, 0.25256207367332456, 0.13525060323579496, 0.07399616325430197, 0.02510875622434906, 0.3111536600288815, 0.1788439221768614, 0.026357592330652407, -0.2998707806418374, 0.03603858990834079, 0.023586573664556836] |
1,803.00983 | Power Control and Channel Allocation for D2D Underlaid Cellular Networks | Device-to-Device (D2D) communications underlaying cellular networks is a
viable network technology that can potentially increase spectral utilization
and improve power efficiency for proximitybased wireless applications and
services. However, a major challenge in such deployment scenarios is the
interference caused by D2D links when sharing the same resources with cellular
users. In this work, we propose a channel allocation (CA) scheme together with
a set of three power control (PC) schemes to mitigate interference in a D2D
underlaid cellular system modeled as a random network using the mathematical
tool of stochastic geometry. The novel aspect of the proposed CA scheme is that
it enables D2D links to share resources with multiple cellular users as opposed
to one as previously considered in the literature. Moreover, the accompanying
distributed PC schemes further manage interference during link establishment
and maintenance. The first two PC schemes compensate for large-scale path-loss
effects and maximize the D2D sum rate by employing distance-dependent pathloss
parameters of the D2D link and the base station, including an error estimation
margin. The third scheme is an adaptive PC scheme based on a variable target
signal-to-interference-plus-noise ratio, which limits the interference caused
by D2D users and provides sufficient coverage probability for cellular users.
Closed-form expressions for the coverage probability of cellular links, D2D
links, and sum rate of D2D links are derived in terms of the allocated power,
density of D2D links, and path-loss exponent. The impact of these key system
parameters on network performance is analyzed and compared with previous work.
Simulation results demonstrate an enhancement in cellular and D2D coverage
probabilities, and an increase in spectral and power efficiency.
| cs.IT math.IT | devicetodevice d2d communications underlaying cellular networks is a viable network technology that can potentially increase spectral utilization and improve power efficiency for proximitybased wireless applications and services however a major challenge in such deployment scenarios is the interference caused by d2d links when sharing the same resources with cellular users in this work we propose a channel allocation ca scheme together with a set of three power control pc schemes to mitigate interference in a d2d underlaid cellular system modeled as a random network using the mathematical tool of stochastic geometry the novel aspect of the proposed ca scheme is that it enables d2d links to share resources with multiple cellular users as opposed to one as previously considered in the literature moreover the accompanying distributed pc schemes further manage interference during link establishment and maintenance the first two pc schemes compensate for largescale pathloss effects and maximize the d2d sum rate by employing distancedependent pathloss parameters of the d2d link and the base station including an error estimation margin the third scheme is an adaptive pc scheme based on a variable target signaltointerferenceplusnoise ratio which limits the interference caused by d2d users and provides sufficient coverage probability for cellular users closedform expressions for the coverage probability of cellular links d2d links and sum rate of d2d links are derived in terms of the allocated power density of d2d links and pathloss exponent the impact of these key system parameters on network performance is analyzed and compared with previous work simulation results demonstrate an enhancement in cellular and d2d coverage probabilities and an increase in spectral and power efficiency | [['devicetodevice', 'd2d', 'communications', 'underlaying', 'cellular', 'networks', 'is', 'a', 'viable', 'network', 'technology', 'that', 'can', 'potentially', 'increase', 'spectral', 'utilization', 'and', 'improve', 'power', 'efficiency', 'for', 'proximitybased', 'wireless', 'applications', 'and', 'services', 'however', 'a', 'major', 'challenge', 'in', 'such', 'deployment', 'scenarios', 'is', 'the', 'interference', 'caused', 'by', 'd2d', 'links', 'when', 'sharing', 'the', 'same', 'resources', 'with', 'cellular', 'users', 'in', 'this', 'work', 'we', 'propose', 'a', 'channel', 'allocation', 'ca', 'scheme', 'together', 'with', 'a', 'set', 'of', 'three', 'power', 'control', 'pc', 'schemes', 'to', 'mitigate', 'interference', 'in', 'a', 'd2d', 'underlaid', 'cellular', 'system', 'modeled', 'as', 'a', 'random', 'network', 'using', 'the', 'mathematical', 'tool', 'of', 'stochastic', 'geometry', 'the', 'novel', 'aspect', 'of', 'the', 'proposed', 'ca', 'scheme', 'is', 'that', 'it', 'enables', 'd2d', 'links', 'to', 'share', 'resources', 'with', 'multiple', 'cellular', 'users', 'as', 'opposed', 'to', 'one', 'as', 'previously', 'considered', 'in', 'the', 'literature', 'moreover', 'the', 'accompanying', 'distributed', 'pc', 'schemes', 'further', 'manage', 'interference', 'during', 'link', 'establishment', 'and', 'maintenance', 'the', 'first', 'two', 'pc', 'schemes', 'compensate', 'for', 'largescale', 'pathloss', 'effects', 'and', 'maximize', 'the', 'd2d', 'sum', 'rate', 'by', 'employing', 'distancedependent', 'pathloss', 'parameters', 'of', 'the', 'd2d', 'link', 'and', 'the', 'base', 'station', 'including', 'an', 'error', 'estimation', 'margin', 'the', 'third', 'scheme', 'is', 'an', 'adaptive', 'pc', 'scheme', 'based', 'on', 'a', 'variable', 'target', 'signaltointerferenceplusnoise', 'ratio', 'which', 'limits', 'the', 'interference', 'caused', 'by', 'd2d', 'users', 'and', 'provides', 'sufficient', 'coverage', 'probability', 'for', 'cellular', 'users', 'closedform', 'expressions', 'for', 'the', 'coverage', 'probability', 'of', 'cellular', 'links', 'd2d', 'links', 'and', 'sum', 'rate', 'of', 'd2d', 'links', 'are', 'derived', 'in', 'terms', 'of', 'the', 'allocated', 'power', 'density', 'of', 'd2d', 'links', 'and', 'pathloss', 'exponent', 'the', 'impact', 'of', 'these', 'key', 'system', 'parameters', 'on', 'network', 'performance', 'is', 'analyzed', 'and', 'compared', 'with', 'previous', 'work', 'simulation', 'results', 'demonstrate', 'an', 'enhancement', 'in', 'cellular', 'and', 'd2d', 'coverage', 'probabilities', 'and', 'an', 'increase', 'in', 'spectral', 'and', 'power', 'efficiency']] | [-0.2673472808154653, -0.012000186703571197, 0.023489574642097198, 0.03096356606898573, -0.05767214243308049, -0.22803555973407338, 0.1869330613520758, 0.38652048788992444, -0.25461153551022137, -0.2766302909328149, 0.03657923398243409, -0.23083334718636137, -0.21077166006945378, 0.14435897276781803, -0.1294827674044691, 0.04046229950626654, 0.0346737182430826, 0.00202187742054684, 0.03671147791602992, -0.24341196529125816, 0.29522215576840694, 0.16089468920381816, 0.42252993945129297, 0.06926559431990782, 0.03509711069106834, -0.0023405084083095665, -0.09467743702845641, -0.025657533816638364, -0.11538330971880696, 0.11831158988842512, 0.33247331439406647, 0.1724514729329506, 0.30114373006619044, -0.4104241138440124, -0.2973582741517061, 0.09019418257517138, 0.20933675422014228, -0.0072864224518853545, -0.010577207057499656, -0.2804979429923026, 0.14624641835083665, -0.3160772680626926, -0.041573408906275346, 0.026934082732366253, -0.06712667847945455, 0.11512005261576572, -0.35909377632932704, 0.012628767580108988, -0.052336336991171524, 0.049594482192319565, -0.023267337855048562, -0.0802964674288123, 0.019737299080751145, 0.2131697358923824, 0.014492749886545716, -0.05169642332865126, 0.11546376916462188, -0.12264771012634344, -0.14982280729608577, 0.3920685342412622, 0.020432124823179496, -0.2253929883567097, 0.15808202847894662, -0.04020023326732246, -0.08558927863303115, 0.1664409273672766, 0.23481534898703482, 0.0033828250381777057, -0.19524309596811296, -0.0033327037491056666, 0.014567701747990646, 0.16643041617420526, 0.08461430851806329, 0.15524612084813555, 0.15719000682612141, 0.22572091197487673, 0.16855725095534635, 0.0734473760681206, -0.13264446273414923, -0.11750490898889625, -0.19906158709130856, -0.1356661502552326, -0.21695995882290267, 0.012279996152475587, -0.12013671434935369, -0.04742908827808156, 0.35011585705780957, 0.08406427543658805, 0.1233294152855513, 0.12677630990246816, 0.40972389603469894, 0.11214786015701313, 0.08175750052881839, 0.11454865720026113, 0.15882519494264377, 0.1033633423449392, 0.17020559800463317, -0.21250593805249407, 0.06991009009382289, 0.010321514795233104] |
1,803.00984 | Topological Edge Modes by Smart Patterning | The research in topological materials and meta-materials reached maturity and
is now gradually entering the phase of practical applications and devices.
However, scaling down the experimental demonstrations definitely presents a
challenge. In this work, we study coupled identical resonators whose collective
dynamics is fully determined by the pattern in which the resonators are
arranged. We call a pattern topological if boundary resonant modes fully fill
all existing spectral gaps whenever the pattern is halved. This is a
characteristic of the pattern and is entirely independent of the structure of
the resonators and the details of the couplings. Existence of such patterns is
proven using $K$-theory and exemplified using a novel experimental platform
based on magnetically coupled spinners. Topological meta-materials built on
these principles can be easily engineered at any scale, providing a practical
platform for applications and devices.
| physics.app-ph cond-mat.mtrl-sci cond-mat.other math-ph math.MP | the research in topological materials and metamaterials reached maturity and is now gradually entering the phase of practical applications and devices however scaling down the experimental demonstrations definitely presents a challenge in this work we study coupled identical resonators whose collective dynamics is fully determined by the pattern in which the resonators are arranged we call a pattern topological if boundary resonant modes fully fill all existing spectral gaps whenever the pattern is halved this is a characteristic of the pattern and is entirely independent of the structure of the resonators and the details of the couplings existence of such patterns is proven using ktheory and exemplified using a novel experimental platform based on magnetically coupled spinners topological metamaterials built on these principles can be easily engineered at any scale providing a practical platform for applications and devices | [['the', 'research', 'in', 'topological', 'materials', 'and', 'metamaterials', 'reached', 'maturity', 'and', 'is', 'now', 'gradually', 'entering', 'the', 'phase', 'of', 'practical', 'applications', 'and', 'devices', 'however', 'scaling', 'down', 'the', 'experimental', 'demonstrations', 'definitely', 'presents', 'a', 'challenge', 'in', 'this', 'work', 'we', 'study', 'coupled', 'identical', 'resonators', 'whose', 'collective', 'dynamics', 'is', 'fully', 'determined', 'by', 'the', 'pattern', 'in', 'which', 'the', 'resonators', 'are', 'arranged', 'we', 'call', 'a', 'pattern', 'topological', 'if', 'boundary', 'resonant', 'modes', 'fully', 'fill', 'all', 'existing', 'spectral', 'gaps', 'whenever', 'the', 'pattern', 'is', 'halved', 'this', 'is', 'a', 'characteristic', 'of', 'the', 'pattern', 'and', 'is', 'entirely', 'independent', 'of', 'the', 'structure', 'of', 'the', 'resonators', 'and', 'the', 'details', 'of', 'the', 'couplings', 'existence', 'of', 'such', 'patterns', 'is', 'proven', 'using', 'ktheory', 'and', 'exemplified', 'using', 'a', 'novel', 'experimental', 'platform', 'based', 'on', 'magnetically', 'coupled', 'spinners', 'topological', 'metamaterials', 'built', 'on', 'these', 'principles', 'can', 'be', 'easily', 'engineered', 'at', 'any', 'scale', 'providing', 'a', 'practical', 'platform', 'for', 'applications', 'and', 'devices']] | [-0.17885632629411807, 0.18747909848605268, -0.07218918502938164, -0.01570618714701951, -0.0858315670621132, -0.157237520279022, 0.033444232655776854, 0.3945499936631624, -0.27385829776808945, -0.28292591893451585, 0.12396646433499763, -0.2798034317890162, -0.19304439279105703, 0.21637528658291136, -0.024774447356796136, 0.07828231732887418, 0.027062514645006995, -0.034204514869286315, -0.026150076106811564, -0.17255401829817751, 0.3061374242120571, 0.013364784039921411, 0.34712967941996414, 0.0827667372557672, 0.0757717218560477, -0.05547537734947991, 0.036468968095689794, 0.021734721064432593, -0.10661978345445317, 0.13761309141283046, 0.26896951606993197, 0.02991980373511636, 0.2340335790084783, -0.4535317463611347, -0.18819265597351437, 0.04463562847830463, 0.17153375887689923, 0.11315691136616701, -0.07579091343306599, -0.28848593645101495, 0.09759954429919952, -0.12771135633068997, -0.12997963041572433, -0.09644360019676927, -0.013021861027548279, -0.01677075578211019, -0.23120341675256487, -0.024887516711622586, 0.04929326021152994, 0.09181497212958292, -0.030621393909551323, -0.055851936151368034, 0.022783578171030335, 0.12293172845080413, -0.03422529212590577, -0.03101125474769514, 0.13405753929586406, -0.11293685097125886, -0.1464301683076158, 0.4019820446028725, -0.00478151526413453, -0.17079206996751725, 0.18081153462053803, -0.11045604372275589, -0.08962895440788049, 0.10945405782726796, 0.13890128922513753, 0.10575798638434945, -0.15099547638269345, 0.08670757724473294, -0.01214464893480223, 0.1850660900345774, 0.039097769257605774, 0.07038612229128678, 0.2710101017121064, 0.2402759082041735, 0.0338150507102356, 0.14224742210817698, -0.008185844033268158, -0.056227968577160566, -0.2570439294399019, -0.13614882568599304, -0.21892088051780761, 0.029740334508697622, -0.042909805729679014, -0.18481920873518506, 0.4459982663055585, 0.1407725087846157, 0.18432523918243637, -0.01567640213508402, 0.2972505341918356, 0.10535143002989175, 0.11761541938429455, 0.04135510064931451, 0.2552988417716562, 0.10977770365349462, 0.10579388409825986, -0.18729042324601955, 0.04250113981897417, 0.0028082433838289285] |
1,803.00985 | Hybrid Model For Word Prediction Using Naive Bayes and Latent
Information | Historically, the Natural Language Processing area has been given too much
attention by many researchers. One of the main motivation beyond this interest
is related to the word prediction problem, which states that given a set words
in a sentence, one can recommend the next word. In literature, this problem is
solved by methods based on syntactic or semantic analysis. Solely, each of
these analysis cannot achieve practical results for end-user applications. For
instance, the Latent Semantic Analysis can handle semantic features of text,
but cannot suggest words considering syntactical rules. On the other hand,
there are models that treat both methods together and achieve state-of-the-art
results, e.g. Deep Learning. These models can demand high computational effort,
which can make the model infeasible for certain types of applications. With the
advance of the technology and mathematical models, it is possible to develop
faster systems with more accuracy. This work proposes a hybrid word suggestion
model, based on Naive Bayes and Latent Semantic Analysis, considering
neighbouring words around unfilled gaps. Results show that this model could
achieve 44.2% of accuracy in the MSR Sentence Completion Challenge.
| cs.CL | historically the natural language processing area has been given too much attention by many researchers one of the main motivation beyond this interest is related to the word prediction problem which states that given a set words in a sentence one can recommend the next word in literature this problem is solved by methods based on syntactic or semantic analysis solely each of these analysis cannot achieve practical results for enduser applications for instance the latent semantic analysis can handle semantic features of text but cannot suggest words considering syntactical rules on the other hand there are models that treat both methods together and achieve stateoftheart results eg deep learning these models can demand high computational effort which can make the model infeasible for certain types of applications with the advance of the technology and mathematical models it is possible to develop faster systems with more accuracy this work proposes a hybrid word suggestion model based on naive bayes and latent semantic analysis considering neighbouring words around unfilled gaps results show that this model could achieve 442 of accuracy in the msr sentence completion challenge | [['historically', 'the', 'natural', 'language', 'processing', 'area', 'has', 'been', 'given', 'too', 'much', 'attention', 'by', 'many', 'researchers', 'one', 'of', 'the', 'main', 'motivation', 'beyond', 'this', 'interest', 'is', 'related', 'to', 'the', 'word', 'prediction', 'problem', 'which', 'states', 'that', 'given', 'a', 'set', 'words', 'in', 'a', 'sentence', 'one', 'can', 'recommend', 'the', 'next', 'word', 'in', 'literature', 'this', 'problem', 'is', 'solved', 'by', 'methods', 'based', 'on', 'syntactic', 'or', 'semantic', 'analysis', 'solely', 'each', 'of', 'these', 'analysis', 'can', 'not', 'achieve', 'practical', 'results', 'for', 'enduser', 'applications', 'for', 'instance', 'the', 'latent', 'semantic', 'analysis', 'can', 'handle', 'semantic', 'features', 'of', 'text', 'but', 'can', 'not', 'suggest', 'words', 'considering', 'syntactical', 'rules', 'on', 'the', 'other', 'hand', 'there', 'are', 'models', 'that', 'treat', 'both', 'methods', 'together', 'and', 'achieve', 'stateoftheart', 'results', 'eg', 'deep', 'learning', 'these', 'models', 'can', 'demand', 'high', 'computational', 'effort', 'which', 'can', 'make', 'the', 'model', 'infeasible', 'for', 'certain', 'types', 'of', 'applications', 'with', 'the', 'advance', 'of', 'the', 'technology', 'and', 'mathematical', 'models', 'it', 'is', 'possible', 'to', 'develop', 'faster', 'systems', 'with', 'more', 'accuracy', 'this', 'work', 'proposes', 'a', 'hybrid', 'word', 'suggestion', 'model', 'based', 'on', 'naive', 'bayes', 'and', 'latent', 'semantic', 'analysis', 'considering', 'neighbouring', 'words', 'around', 'unfilled', 'gaps', 'results', 'show', 'that', 'this', 'model', 'could', 'achieve', '442', 'of', 'accuracy', 'in', 'the', 'msr', 'sentence', 'completion', 'challenge']] | [-0.035121369795042046, 0.02588167185596325, -0.05419046365167886, 0.1065836768825526, -0.16011379177577514, -0.17560137893735644, 0.08204862246797844, 0.4282198777661365, -0.28301161886466775, -0.3438556434581664, 0.08538386163757467, -0.27891513268976287, -0.15749498391474154, 0.21766153847852243, -0.13775566941933995, 0.08102790266648931, 0.13513747814863442, 0.1012187762793532, -0.06450491359881948, -0.2771429308929187, 0.29787402747716896, 0.03315767836193604, 0.3265796056077044, 0.048409718850796875, 0.0766437728167138, -0.05487992292529042, -0.062171269452851764, -0.0019159166784807641, -0.0622881031588556, 0.20481849562614549, 0.3664940607182569, 0.19768641537110157, 0.34746197949756275, -0.4167902735485272, -0.2732136050577868, 0.08468676958218177, 0.1496707367984532, 0.12916432707172065, -0.016983753323998867, -0.2958374408367563, 0.1017633295169145, -0.1807249041602892, 0.022936491880884622, -0.13194491278210824, -0.012259586674365448, -0.006851647826120815, -0.23294212528750957, 0.014363928237322339, 0.12028462649447555, 0.05204604463751383, -0.04092882068474145, -0.13839681427876022, 0.03143056357194754, 0.13486901193702802, 0.06601778060891342, 0.060848125624520216, 0.10102966361066555, -0.16586990579763516, -0.17200540404961032, 0.4127071590566221, -0.03734427778159871, -0.22970951823169056, 0.2183969837394269, -0.05298879318671391, -0.18568752988684864, 0.07256498396954435, 0.1830523100427606, 0.08566508505787242, -0.1638805255857869, 0.048515046445558214, -0.055567032595309505, 0.22492191128751493, 0.07199502110426478, 0.0062491709383093764, 0.2219272595581245, 0.23539493185029747, 0.014531054040653642, 0.0963028037536486, -0.057337052163756376, -0.06430927873495718, -0.21418581817070032, -0.11016764025139139, -0.16915319599510037, -0.04504052118910601, -0.09649239386841817, -0.1493424880990689, 0.37418860534049153, 0.24322849187141168, 0.1644757691184669, 0.07952697727490556, 0.30561859820058, 0.07927791241571658, 0.11793710725421813, 0.07459335583934491, 0.16088695031027983, 0.010953035038761437, 0.1018455886047951, -0.1229987225999849, 0.1356122435498883, 0.08536657544331037] |
1,803.00986 | Niching an Archive-based Gaussian Estimation of Distribution Algorithm
via Adaptive Clustering | As a model-based evolutionary algorithm, estimation of distribution algorithm
(EDA) possesses unique characteristics and has been widely applied to global
optimization. However, traditional Gaussian EDA (GEDA) may suffer from
premature convergence and has a high risk of falling into local optimum when
dealing with multimodal problem. In this paper, we first attempts to improve
the performance of GEDA by utilizing historical solutions and develops a novel
archive-based EDA variant. The use of historical solutions not only enhances
the search efficiency of EDA to a large extent, but also significantly reduces
the population size so that a faster convergence could be achieved. Then, the
archive-based EDA is further integrated with a novel adaptive clustering
strategy for solving multimodal optimization problems. Taking the advantage of
the clustering strategy in locating different promising areas and the powerful
exploitation ability of the archive-based EDA, the resultant algorithm is
endowed with strong capability in finding multiple optima. To verify the
efficiency of the proposed algorithm, we tested it on a set of well-known
niching benchmark problems and compared it with several state-of-the-art
niching algorithms. The experimental results indicate that the proposed
algorithm is competitive.
| cs.NE | as a modelbased evolutionary algorithm estimation of distribution algorithm eda possesses unique characteristics and has been widely applied to global optimization however traditional gaussian eda geda may suffer from premature convergence and has a high risk of falling into local optimum when dealing with multimodal problem in this paper we first attempts to improve the performance of geda by utilizing historical solutions and develops a novel archivebased eda variant the use of historical solutions not only enhances the search efficiency of eda to a large extent but also significantly reduces the population size so that a faster convergence could be achieved then the archivebased eda is further integrated with a novel adaptive clustering strategy for solving multimodal optimization problems taking the advantage of the clustering strategy in locating different promising areas and the powerful exploitation ability of the archivebased eda the resultant algorithm is endowed with strong capability in finding multiple optima to verify the efficiency of the proposed algorithm we tested it on a set of wellknown niching benchmark problems and compared it with several stateoftheart niching algorithms the experimental results indicate that the proposed algorithm is competitive | [['as', 'a', 'modelbased', 'evolutionary', 'algorithm', 'estimation', 'of', 'distribution', 'algorithm', 'eda', 'possesses', 'unique', 'characteristics', 'and', 'has', 'been', 'widely', 'applied', 'to', 'global', 'optimization', 'however', 'traditional', 'gaussian', 'eda', 'geda', 'may', 'suffer', 'from', 'premature', 'convergence', 'and', 'has', 'a', 'high', 'risk', 'of', 'falling', 'into', 'local', 'optimum', 'when', 'dealing', 'with', 'multimodal', 'problem', 'in', 'this', 'paper', 'we', 'first', 'attempts', 'to', 'improve', 'the', 'performance', 'of', 'geda', 'by', 'utilizing', 'historical', 'solutions', 'and', 'develops', 'a', 'novel', 'archivebased', 'eda', 'variant', 'the', 'use', 'of', 'historical', 'solutions', 'not', 'only', 'enhances', 'the', 'search', 'efficiency', 'of', 'eda', 'to', 'a', 'large', 'extent', 'but', 'also', 'significantly', 'reduces', 'the', 'population', 'size', 'so', 'that', 'a', 'faster', 'convergence', 'could', 'be', 'achieved', 'then', 'the', 'archivebased', 'eda', 'is', 'further', 'integrated', 'with', 'a', 'novel', 'adaptive', 'clustering', 'strategy', 'for', 'solving', 'multimodal', 'optimization', 'problems', 'taking', 'the', 'advantage', 'of', 'the', 'clustering', 'strategy', 'in', 'locating', 'different', 'promising', 'areas', 'and', 'the', 'powerful', 'exploitation', 'ability', 'of', 'the', 'archivebased', 'eda', 'the', 'resultant', 'algorithm', 'is', 'endowed', 'with', 'strong', 'capability', 'in', 'finding', 'multiple', 'optima', 'to', 'verify', 'the', 'efficiency', 'of', 'the', 'proposed', 'algorithm', 'we', 'tested', 'it', 'on', 'a', 'set', 'of', 'wellknown', 'niching', 'benchmark', 'problems', 'and', 'compared', 'it', 'with', 'several', 'stateoftheart', 'niching', 'algorithms', 'the', 'experimental', 'results', 'indicate', 'that', 'the', 'proposed', 'algorithm', 'is', 'competitive']] | [-0.03954738947419972, -0.047584737096691414, -0.13395020568117538, 0.06227532073161836, -0.11120184269492273, -0.16318023112410354, 0.0585059811362366, 0.3886914167247673, -0.27651697403145215, -0.3365911507496127, 0.12995149669509687, -0.23002341397047515, -0.17650316112857095, 0.21518794026240587, -0.1074280955202917, 0.10233078295581792, 0.10158074111000157, -0.0049080199724625025, -0.05108174278583161, -0.26777381755574237, 0.23338788334112712, 0.09861107743973474, 0.3531040322902814, 0.020853496097501308, 0.12919494313823562, -0.018646792341122237, -0.0190958693566875, 0.0744579727527385, -0.06539986389493582, 0.13932683881034671, 0.25610712199304353, 0.24004337314895732, 0.3719820260075192, -0.3780079265888879, -0.20040897704862926, 0.13898816413773352, 0.1856136458615462, 0.10084934359189694, -0.09274924319254717, -0.28643450302209844, 0.13536510080168093, -0.1371232800311335, -0.07636593438675085, -0.10293629236775574, -0.05069891872406794, 0.05066775884811899, -0.30699623475422855, 0.0354971408081135, 0.038021979684739436, 0.00355347169553319, -0.054151617036146855, -0.16699263959058694, 0.045432610593726316, 0.10774518031748283, 0.060948471272014394, 0.053218751440499784, 0.1046360832338453, -0.11449124633147327, -0.15954539658521455, 0.35019709120588327, -0.04383166262968665, -0.18176748524124306, 0.2226617251431678, -0.028493027629025242, -0.13799383663005693, 0.1635198704553423, 0.2029083538036695, 0.12447823138375368, -0.1399171597453816, 0.06530974738185279, -0.007976936112360033, 0.1608246917141572, 0.019767334679801945, -0.006541208548855687, 0.14022151055492008, 0.26107282170202956, 0.12742017254617716, 0.14941349537814005, -0.10164498236115342, -0.11752021920537113, -0.15597953201578338, -0.1202322769979084, -0.19152721305865616, -0.03425775599786359, -0.10909512012951487, -0.14663840132819675, 0.412735537401642, 0.21059487077651456, 0.1661141385329227, 0.0649384841120866, 0.3534611624483236, 0.08712057160127665, 0.07861738431725711, 0.1033617219414621, 0.22085932546748568, 0.05497461328376577, 0.10053372400118009, -0.24250336345802578, 0.11069076440775047, 0.04154905863352632] |
1,803.00987 | Rashba Sandwiches with Topological Superconducting Phases | We introduce a versatile heterostructure harboring various topological
superconducting phases characterized by the presence of helical, chiral, or
unidirectional edge states. Changing parameters, such as an effective Zeeman
field or chemical potential, one can tune between these three topological
phases in the same setup. Our model relies only on conventional non-topological
ingredients. The bilayer setup consists of an s-wave superconductor sandwiched
between two two-dimensional electron gas layers with strong Rashba spin-orbit
interaction. The interplay between two different pairing mechanisms, proximity
induced direct and crossed Andreev superconducting pairings, gives rise to
multiple topological phases. In particular, helical edge states occur if
crossed Andreev superconducting pairing is dominant. In addition, an in-plane
Zeeman field leads to a 2D gapless topological phase with unidirectional edge
states, which were previously predicted to exist only in non-centrosymmetric
superconductors. If the Zeeman field is tilted out of the plane, the system is
in a topological phase hosting chiral edge states.
| cond-mat.mes-hall | we introduce a versatile heterostructure harboring various topological superconducting phases characterized by the presence of helical chiral or unidirectional edge states changing parameters such as an effective zeeman field or chemical potential one can tune between these three topological phases in the same setup our model relies only on conventional nontopological ingredients the bilayer setup consists of an swave superconductor sandwiched between two twodimensional electron gas layers with strong rashba spinorbit interaction the interplay between two different pairing mechanisms proximity induced direct and crossed andreev superconducting pairings gives rise to multiple topological phases in particular helical edge states occur if crossed andreev superconducting pairing is dominant in addition an inplane zeeman field leads to a 2d gapless topological phase with unidirectional edge states which were previously predicted to exist only in noncentrosymmetric superconductors if the zeeman field is tilted out of the plane the system is in a topological phase hosting chiral edge states | [['we', 'introduce', 'a', 'versatile', 'heterostructure', 'harboring', 'various', 'topological', 'superconducting', 'phases', 'characterized', 'by', 'the', 'presence', 'of', 'helical', 'chiral', 'or', 'unidirectional', 'edge', 'states', 'changing', 'parameters', 'such', 'as', 'an', 'effective', 'zeeman', 'field', 'or', 'chemical', 'potential', 'one', 'can', 'tune', 'between', 'these', 'three', 'topological', 'phases', 'in', 'the', 'same', 'setup', 'our', 'model', 'relies', 'only', 'on', 'conventional', 'nontopological', 'ingredients', 'the', 'bilayer', 'setup', 'consists', 'of', 'an', 'swave', 'superconductor', 'sandwiched', 'between', 'two', 'twodimensional', 'electron', 'gas', 'layers', 'with', 'strong', 'rashba', 'spinorbit', 'interaction', 'the', 'interplay', 'between', 'two', 'different', 'pairing', 'mechanisms', 'proximity', 'induced', 'direct', 'and', 'crossed', 'andreev', 'superconducting', 'pairings', 'gives', 'rise', 'to', 'multiple', 'topological', 'phases', 'in', 'particular', 'helical', 'edge', 'states', 'occur', 'if', 'crossed', 'andreev', 'superconducting', 'pairing', 'is', 'dominant', 'in', 'addition', 'an', 'inplane', 'zeeman', 'field', 'leads', 'to', 'a', '2d', 'gapless', 'topological', 'phase', 'with', 'unidirectional', 'edge', 'states', 'which', 'were', 'previously', 'predicted', 'to', 'exist', 'only', 'in', 'noncentrosymmetric', 'superconductors', 'if', 'the', 'zeeman', 'field', 'is', 'tilted', 'out', 'of', 'the', 'plane', 'the', 'system', 'is', 'in', 'a', 'topological', 'phase', 'hosting', 'chiral', 'edge', 'states']] | [-0.32313724527137005, 0.2787896131898402, -0.024651747674669152, 0.02231673129804753, -0.08245274385848603, -0.24714628845005743, 0.05312428658135695, 0.3740426997182431, -0.25494928273989204, -0.28702871392589885, -0.08923913843630414, -0.28893951047211885, -0.1484836481281786, 0.14374791950973162, 0.055466892521272036, -0.00156997029318825, -0.06503690751088033, -0.06659934706774286, -0.12156463997111983, -0.1953406522826098, 0.3840534432742793, -0.09255909445006158, 0.35542072575575634, 0.07650888444517147, -0.029630758240214224, -0.005652891921012529, 0.15666328687613904, 0.016308561687103727, -0.12265494410190489, 0.003962471462822483, 0.2525646715102167, -0.18256252279275326, 0.1347490142208415, -0.5160136416965684, -0.20934801191158062, 0.044783266448694, 0.14007791262210723, 0.15100778947817162, -0.05977468269834803, -0.3393478213186533, 0.03665772336535156, -0.2063438548652044, -0.10892261465249414, -0.07715811390526496, -0.018052990585353902, -0.07962630690051267, -0.2368635622682065, 0.04237428234263426, 0.05530960526235716, 0.08743432527347528, -0.06181948757488522, -0.07496825395402947, -0.13656334533558723, 0.06766317534720065, 0.014363136061606325, 0.0506359932161021, 0.11946781780933599, -0.15456062141963123, -0.1726157015171386, 0.3146860218280322, -0.04311472385994752, -0.1019905465866693, 0.22570113836736236, -0.10560232094614147, -0.030779601095921615, 0.14905118742842807, 0.0693349258538771, 0.04095987793868529, -0.08589295773198466, 0.06415120602317771, -0.05554455616088076, 0.1304487188924225, 0.03416479044509205, 0.12982024139325535, 0.3355688297752194, 0.15957048087677156, 0.11776752682181994, 0.17721291680747717, -0.14627453689493675, -0.07221222361670686, -0.23959710981202456, -0.1762478111263413, -0.22388281002595367, 0.027553061641716434, -0.008300639756342137, -0.2383146048493248, 0.4488916407405798, 0.10492701591491434, 0.19334300259708778, -0.16189789207117003, 0.28384511754848063, 0.10049099713872343, 0.0817071587911674, 0.0331254825419323, 0.2587484654489687, 0.2045832454656287, 0.029543311531691777, -0.30179410119345956, 0.04228753318357003, 0.05374306770851957] |
1,803.00988 | Cantor spectrum of graphene in magnetic fields | We consider a quantum graph as a model of graphene in magnetic fields and
give a complete analysis of the spectrum, for all constant fluxes. In
particular, we show that if the reduced magnetic flux $\Phi/2\pi$ through a
honeycomb is irrational, the continuous spectrum is an unbounded Cantor set of
Lebesgue measure zero.
| math.SP math-ph math.MP | we consider a quantum graph as a model of graphene in magnetic fields and give a complete analysis of the spectrum for all constant fluxes in particular we show that if the reduced magnetic flux phi2pi through a honeycomb is irrational the continuous spectrum is an unbounded cantor set of lebesgue measure zero | [['we', 'consider', 'a', 'quantum', 'graph', 'as', 'a', 'model', 'of', 'graphene', 'in', 'magnetic', 'fields', 'and', 'give', 'a', 'complete', 'analysis', 'of', 'the', 'spectrum', 'for', 'all', 'constant', 'fluxes', 'in', 'particular', 'we', 'show', 'that', 'if', 'the', 'reduced', 'magnetic', 'flux', 'phi2pi', 'through', 'a', 'honeycomb', 'is', 'irrational', 'the', 'continuous', 'spectrum', 'is', 'an', 'unbounded', 'cantor', 'set', 'of', 'lebesgue', 'measure', 'zero']] | [-0.1868321830582506, 0.16978102928836927, -0.03858616929677016, 0.06466859790391095, -0.035035046863035775, -0.10545138100970466, 0.05877252230157127, 0.3710877621932974, -0.2550889321796174, -0.2064359702547696, 0.08502977812785725, -0.2956215818676184, -0.12722570980670597, 0.20648932932735473, -0.03914445614055643, 0.019908744630948553, 0.033822482627517775, 0.0867754236777436, -0.02886284263540973, -0.19583578028041818, 0.33406345071798227, -0.02106500275758148, 0.24328085925992368, 0.08206616637279403, 0.09852212474171845, -0.021674601369941572, 0.042414290760204476, 0.05652556462951426, -0.1497406290965166, 0.05247367178704941, 0.16527738252584384, 0.05579556299830383, 0.2481650913942535, -0.40530343121796286, -0.22242017715009596, 0.1757299353737595, 0.1012125163128213, 0.059038331978163626, -0.025564409194971032, -0.22791975481822244, 0.08692665614697309, -0.14279122070743228, -0.14234590394211546, -0.09091002302560604, 0.052197339514024416, 0.003973142292245098, -0.28850427664869094, 0.038053166578119656, 0.09053548814878219, 0.12482717482127109, -0.10540470698813223, -0.048711660423509356, -0.07573366476187729, 0.09850630993550678, 0.01999110236043497, 0.07167668409540125, 0.09664811619188425, -0.08336197746531018, -0.1527152478888209, 0.3893112914004135, -0.13510853034567158, -0.21581254003323475, 0.08129456340563747, -0.20174899649859038, -0.13409498816285775, 0.13864291100850645, 0.12337572623114541, 0.10225225285679665, -0.1049998184174018, 0.18761646659618667, -0.11721061827298605, 0.15978741608472224, 0.015120692797145754, 0.03304204052173585, 0.20576222174150763, 0.12153159343321228, 0.1732765357097927, 0.18765891219471703, -0.05784063599125113, -0.02170165112013665, -0.31169130424705316, -0.17317770414476125, -0.22152688189295455, 0.13065684024675064, -0.09396075477075702, -0.29894786813946544, 0.4123079854784147, 0.10815408873758367, 0.227896132629435, 0.0436468136514414, 0.26821429837705957, 0.16062396648367383, -0.007213045643062664, 0.06519244767655179, 0.1836008327433242, 0.16796365758087836, 0.056081621354129516, -0.17239899806818873, -0.057773322038317344, 0.06940797660148369] |
1,803.00989 | Secure and Privacy-Aware Data Dissemination for Cloud-Based Applications | In this paper we propose a data dissemination platform that supports data
security and different privacy levels even when the platform and the data are
hosted by untrusted infrastructures. The proposed system aims at enabling an
application ecosystem that uses off-the-shelf trusted platforms (in this case,
Intel SGX), so that users may allow or disallow third parties to access the
live data stream with a specific sensitivity-level. Moreover, this approach
does not require users to manage the encryption keys directly. Our experiments
show that such an approach is indeed practical for medium scale systems, where
participants disseminate small volumes of data at a time, such as in smart
grids and IoT environments.
| cs.DC cs.CR | in this paper we propose a data dissemination platform that supports data security and different privacy levels even when the platform and the data are hosted by untrusted infrastructures the proposed system aims at enabling an application ecosystem that uses offtheshelf trusted platforms in this case intel sgx so that users may allow or disallow third parties to access the live data stream with a specific sensitivitylevel moreover this approach does not require users to manage the encryption keys directly our experiments show that such an approach is indeed practical for medium scale systems where participants disseminate small volumes of data at a time such as in smart grids and iot environments | [['in', 'this', 'paper', 'we', 'propose', 'a', 'data', 'dissemination', 'platform', 'that', 'supports', 'data', 'security', 'and', 'different', 'privacy', 'levels', 'even', 'when', 'the', 'platform', 'and', 'the', 'data', 'are', 'hosted', 'by', 'untrusted', 'infrastructures', 'the', 'proposed', 'system', 'aims', 'at', 'enabling', 'an', 'application', 'ecosystem', 'that', 'uses', 'offtheshelf', 'trusted', 'platforms', 'in', 'this', 'case', 'intel', 'sgx', 'so', 'that', 'users', 'may', 'allow', 'or', 'disallow', 'third', 'parties', 'to', 'access', 'the', 'live', 'data', 'stream', 'with', 'a', 'specific', 'sensitivitylevel', 'moreover', 'this', 'approach', 'does', 'not', 'require', 'users', 'to', 'manage', 'the', 'encryption', 'keys', 'directly', 'our', 'experiments', 'show', 'that', 'such', 'an', 'approach', 'is', 'indeed', 'practical', 'for', 'medium', 'scale', 'systems', 'where', 'participants', 'disseminate', 'small', 'volumes', 'of', 'data', 'at', 'a', 'time', 'such', 'as', 'in', 'smart', 'grids', 'and', 'iot', 'environments']] | [-0.18564781018004223, 0.015887096375573072, -0.07704239438480891, 0.029382329532742366, -0.10567698402011448, -0.22390681873327373, 0.0936085749134371, 0.38916277667289384, -0.26750627371507724, -0.346957341037892, 0.1387795995436357, -0.3138451980645055, -0.11160594699610663, 0.21359137578045126, -0.12029048581481785, 0.06558896021430825, 0.0671698284410947, 0.0074251505550466945, 0.057979085937830376, -0.3049098474166549, 0.34307816685890563, 0.05340460985311651, 0.34353772075091665, 0.07490644425044658, 0.04413881703376401, -0.022884250845055323, -0.003184852232267191, -0.06420512153842561, -0.016983191542765796, 0.1296107949697421, 0.3684678652768468, 0.22048536078954065, 0.33661104396388336, -0.48464320098293256, -0.13956877155447597, 0.08764577241664803, 0.1734568430341545, 0.09913347369932511, -0.11271559869920886, -0.31811277423817497, 0.11427771813720716, -0.2649232939951256, -0.10461379830549294, -0.1133474519975517, -0.02679924554451629, 0.01128743327461888, -0.30832485255139236, -0.02826545471619177, -0.01757270174923244, 0.06280822211825121, 0.008673054896093704, -0.010145925701730087, 0.016922223979506542, 0.1922239202532502, 0.0007244161464408175, -0.031073759498729092, 0.17749484046991612, -0.09350905628158576, -0.1492212081521011, 0.4023905937593464, 0.013551035463843529, -0.1642166724562779, 0.2096426420350064, -0.04984623183252978, -0.15787584475988337, 0.029649059661571775, 0.27091551204589576, 0.0611851299223532, -0.18137918072419665, 0.04360484401092378, -0.03800120223984794, 0.26718886308204215, 0.007319178576958743, 0.0562024434004818, 0.18290779666622747, 0.18395551819950007, 0.10861782258930239, 0.0693458124433082, -0.03954476068585037, -0.06569279326956619, -0.22680486760496557, -0.16994900420425577, -0.2025252746518802, -0.0046535201142867185, -0.07960289181485407, -0.11036170161379552, 0.30374286778644566, 0.24476752492616494, 0.13676342618576176, 0.0575918016456034, 0.445742211304605, -0.018206299907687278, 0.16537901537643895, 0.20692949782142434, 0.11788587762999374, -0.08498666831711726, 0.23461824498634348, -0.10994345317636658, 0.10897964588576206, -0.08596849047184528] |
1,803.0099 | Controlling the Deformation of Metamaterials: Corner Modes via Topology | Topological metamaterials have invaded the mechanical world, demonstrating
acoustic cloaking and waveguiding at finite frequencies and variable, tunable
elastic response at zero frequency. Zero frequency topological states have
previously relied on the Maxwell condition, namely that the system has equal
numbers of degrees of freedom and constraints. Here, we show that otherwise
rigid periodic mechanical structures are described by a map with a nontrivial
topological degree (a generalization of the winding number introduced by Kane
and Lubensky) that creates, directs and protects modes on their boundaries. We
introduce a model system consisting of rigid quadrilaterals connected via free
hinges at their corners in a checkerboard pattern. This bulk structure
generates a topological linear deformation mode exponentially localized in one
corner, as investigated numerically and via experimental prototype. Unlike the
Maxwell lattices, these structures select a single desired mode, which controls
variable stiffness and mechanical amplification that can be incorporated into
devices at any scale.
| cond-mat.soft cond-mat.mtrl-sci | topological metamaterials have invaded the mechanical world demonstrating acoustic cloaking and waveguiding at finite frequencies and variable tunable elastic response at zero frequency zero frequency topological states have previously relied on the maxwell condition namely that the system has equal numbers of degrees of freedom and constraints here we show that otherwise rigid periodic mechanical structures are described by a map with a nontrivial topological degree a generalization of the winding number introduced by kane and lubensky that creates directs and protects modes on their boundaries we introduce a model system consisting of rigid quadrilaterals connected via free hinges at their corners in a checkerboard pattern this bulk structure generates a topological linear deformation mode exponentially localized in one corner as investigated numerically and via experimental prototype unlike the maxwell lattices these structures select a single desired mode which controls variable stiffness and mechanical amplification that can be incorporated into devices at any scale | [['topological', 'metamaterials', 'have', 'invaded', 'the', 'mechanical', 'world', 'demonstrating', 'acoustic', 'cloaking', 'and', 'waveguiding', 'at', 'finite', 'frequencies', 'and', 'variable', 'tunable', 'elastic', 'response', 'at', 'zero', 'frequency', 'zero', 'frequency', 'topological', 'states', 'have', 'previously', 'relied', 'on', 'the', 'maxwell', 'condition', 'namely', 'that', 'the', 'system', 'has', 'equal', 'numbers', 'of', 'degrees', 'of', 'freedom', 'and', 'constraints', 'here', 'we', 'show', 'that', 'otherwise', 'rigid', 'periodic', 'mechanical', 'structures', 'are', 'described', 'by', 'a', 'map', 'with', 'a', 'nontrivial', 'topological', 'degree', 'a', 'generalization', 'of', 'the', 'winding', 'number', 'introduced', 'by', 'kane', 'and', 'lubensky', 'that', 'creates', 'directs', 'and', 'protects', 'modes', 'on', 'their', 'boundaries', 'we', 'introduce', 'a', 'model', 'system', 'consisting', 'of', 'rigid', 'quadrilaterals', 'connected', 'via', 'free', 'hinges', 'at', 'their', 'corners', 'in', 'a', 'checkerboard', 'pattern', 'this', 'bulk', 'structure', 'generates', 'a', 'topological', 'linear', 'deformation', 'mode', 'exponentially', 'localized', 'in', 'one', 'corner', 'as', 'investigated', 'numerically', 'and', 'via', 'experimental', 'prototype', 'unlike', 'the', 'maxwell', 'lattices', 'these', 'structures', 'select', 'a', 'single', 'desired', 'mode', 'which', 'controls', 'variable', 'stiffness', 'and', 'mechanical', 'amplification', 'that', 'can', 'be', 'incorporated', 'into', 'devices', 'at', 'any', 'scale']] | [-0.21026976965065416, 0.22634410062901578, -0.0715022651038689, -0.03135082690882823, -0.10642577218520757, -0.19032710988237825, 0.05772551142477563, 0.3541370447386395, -0.2722171506445323, -0.26187451137834555, 0.07717757341194922, -0.2595159418687418, -0.1920734959089064, 0.1703910035574083, -0.02646402445131937, 0.06656144412730325, 0.01202307492282919, 0.016156250659328002, -0.019182532487509698, -0.16458884335437476, 0.29752595187164843, -0.009198456854474816, 0.33143027254845947, 0.0024080421811864747, 0.13200939011264157, 0.019520729518168176, 0.05568183776423601, 0.051298504175963, -0.1275634337683411, 0.08835081358601993, 0.2071369620669004, -0.02010265498893795, 0.22415867218499785, -0.45179125394176256, -0.23465203208993976, 0.03304170314585427, 0.1354918201006465, 0.11324434852992583, -0.033003887967448436, -0.27651025460694323, 0.10836258776752013, -0.13480870393885364, -0.15905079681586168, -0.10163755821632584, 0.0027150931562502662, -0.013273217858952264, -0.20335050459154397, 0.03948358677678391, 0.06385710724181944, 0.08068406449938148, -0.05676852848183125, -0.07677761356303976, -0.0858797650865896, 0.08633475125065775, -0.019288682796865363, -0.026246051904261596, 0.1416066979336274, -0.11167371433754392, -0.13475533292399017, 0.3669046629522625, -0.0257338027185579, -0.2521170845116162, 0.2074459345191838, -0.11244491998759376, -0.05182081412118799, 0.15692606916221755, 0.16077672721600378, 0.08347034598525417, -0.08376674885882741, 0.09001090249706055, -0.03403457679389674, 0.17645676441297128, 0.13280581536569766, 0.08476235240685766, 0.2469815433950635, 0.14570353639632608, 0.07402890388152332, 0.18152436907871855, -0.05678096897794272, -0.04572969462190356, -0.28825651021529136, -0.12028338521410555, -0.2341807066314013, 0.035656128719739326, -0.059856629433876124, -0.20791401431968362, 0.4208850897727655, 0.06671747912549983, 0.18849250631007766, 0.015525624894555175, 0.2598368556513874, 0.09828008171216307, 0.11937224049145331, 0.05696451577642182, 0.25217507469510153, 0.12270952099722555, 0.062331746067011175, -0.23456532124795818, -0.00029736526110874753, 0.06239421757288858] |
1,803.00991 | Dissipative hydrodynamics with higher-form symmetry | A theory of parity-invariant dissipative fluids with $q$-form symmetry is
formulated to first order in a derivative expansion. The fluid is anisotropic
with symmetry $\text{SO}(D-1-q)\times\text{SO}(q)$ and carries dissolved
$q$-dimensional charged objects that couple to a $(q+1)$-form background gauge
field. The case $q=1$ for which the fluid carries string charge is related to
magnetohydrodynamics in $D=4$ spacetime dimensions. We identify $q$+7
parity-even independent transport coefficients at first order in derivatives
for $q>1$. In particular, compared to the $q=1$ case under the assumption of
parity and charge conjugation invariance, fluids with $q>1$ are characterised
by $q$ extra transport coefficients with the physical interpretation of shear
viscosity in the $\text{SO}(q)$ sector and current resistivities. We discuss
certain issues related to the existence of a hydrostatic sector for fluids with
higher-form symmetry for any $q\ge1$. We extend these results in order to
include an interface separating different fluid phases and study the dispersion
relation of capillary waves finding clear signatures of anisotropy. The
formalism developed here can be easily adapted to study hydrodynamics with
multiple higher-form symmetries.
| hep-th cond-mat.str-el | a theory of parityinvariant dissipative fluids with qform symmetry is formulated to first order in a derivative expansion the fluid is anisotropic with symmetry textsod1qtimestextsoq and carries dissolved qdimensional charged objects that couple to a q1form background gauge field the case q1 for which the fluid carries string charge is related to magnetohydrodynamics in d4 spacetime dimensions we identify q7 parityeven independent transport coefficients at first order in derivatives for q1 in particular compared to the q1 case under the assumption of parity and charge conjugation invariance fluids with q1 are characterised by q extra transport coefficients with the physical interpretation of shear viscosity in the textsoq sector and current resistivities we discuss certain issues related to the existence of a hydrostatic sector for fluids with higherform symmetry for any qge1 we extend these results in order to include an interface separating different fluid phases and study the dispersion relation of capillary waves finding clear signatures of anisotropy the formalism developed here can be easily adapted to study hydrodynamics with multiple higherform symmetries | [['a', 'theory', 'of', 'parityinvariant', 'dissipative', 'fluids', 'with', 'qform', 'symmetry', 'is', 'formulated', 'to', 'first', 'order', 'in', 'a', 'derivative', 'expansion', 'the', 'fluid', 'is', 'anisotropic', 'with', 'symmetry', 'textsod1qtimestextsoq', 'and', 'carries', 'dissolved', 'qdimensional', 'charged', 'objects', 'that', 'couple', 'to', 'a', 'q1form', 'background', 'gauge', 'field', 'the', 'case', 'q1', 'for', 'which', 'the', 'fluid', 'carries', 'string', 'charge', 'is', 'related', 'to', 'magnetohydrodynamics', 'in', 'd4', 'spacetime', 'dimensions', 'we', 'identify', 'q7', 'parityeven', 'independent', 'transport', 'coefficients', 'at', 'first', 'order', 'in', 'derivatives', 'for', 'q1', 'in', 'particular', 'compared', 'to', 'the', 'q1', 'case', 'under', 'the', 'assumption', 'of', 'parity', 'and', 'charge', 'conjugation', 'invariance', 'fluids', 'with', 'q1', 'are', 'characterised', 'by', 'q', 'extra', 'transport', 'coefficients', 'with', 'the', 'physical', 'interpretation', 'of', 'shear', 'viscosity', 'in', 'the', 'textsoq', 'sector', 'and', 'current', 'resistivities', 'we', 'discuss', 'certain', 'issues', 'related', 'to', 'the', 'existence', 'of', 'a', 'hydrostatic', 'sector', 'for', 'fluids', 'with', 'higherform', 'symmetry', 'for', 'any', 'qge1', 'we', 'extend', 'these', 'results', 'in', 'order', 'to', 'include', 'an', 'interface', 'separating', 'different', 'fluid', 'phases', 'and', 'study', 'the', 'dispersion', 'relation', 'of', 'capillary', 'waves', 'finding', 'clear', 'signatures', 'of', 'anisotropy', 'the', 'formalism', 'developed', 'here', 'can', 'be', 'easily', 'adapted', 'to', 'study', 'hydrodynamics', 'with', 'multiple', 'higherform', 'symmetries']] | [-0.19352756331849036, 0.19171525387180907, -0.08216490362953308, 0.03321108965091516, -0.09128542349548542, -0.15369917158778126, -0.060445650228114024, 0.29253234760018815, -0.24405706548169445, -0.2723231515057429, 0.06532955617093814, -0.2760757373929111, -0.09991534574948556, 0.09449454422560874, -0.012125391947454092, 0.03324312380888113, -0.0622018210866287, 0.008904835665380658, -0.07749625461488181, -0.20986102456608188, 0.3305749364540373, 0.0009677338064818409, 0.2537884706037653, 0.04323947911350906, 0.08534258028100196, -0.011080985850714452, -0.005391131046266235, 0.04948292069180667, -0.18679145268425487, 0.03990847480412551, 0.23097968728101828, -0.026095766172179617, 0.11667399847476978, -0.43948147054870573, -0.24565460269573575, 0.06819234866572664, 0.12721829348630462, 0.12650156928953438, -0.040893773423039424, -0.2492852532195897, 0.06865508919200528, -0.16781540669784037, -0.19151447285906198, -0.11540466645999392, 0.018144418663149208, -0.03874319943337979, -0.27405554018860234, 0.15108726500963782, 0.05444264542774368, 0.05288948165116646, -0.09950624657958224, -0.08426468498863236, -0.06462703220960167, 0.05154581418348073, 0.12864658637285473, 0.021349001994454546, 0.10802131175602737, -0.17891902560967277, -0.10553586831294566, 0.41930336616279784, -0.06780982940602089, -0.2686283644452168, 0.19718689431725014, -0.18274963854777024, -0.1346884213186452, 0.11430307343514827, 0.13823891098322402, 0.11125879177867233, -0.11419465597610028, 0.1173142532515748, -0.03003826929387032, 0.14147001685171623, 0.11451823989267064, 0.004861446789177189, 0.2297043867207715, 0.08514876442972287, 0.040799114387482405, 0.14910613668998104, -0.02745875264436268, -0.11562745115714289, -0.3715201566701793, -0.19357518004701552, -0.13554282661810604, 0.06830486039051034, -0.1042432152439448, -0.14046426526439643, 0.3538427383241336, 0.1405388621731841, 0.12244853185018666, -0.0010399320019866551, 0.22245582758465357, 0.10770110067453954, 0.0500620131527907, 0.07777305505352847, 0.2139135202398382, 0.19341822266605907, 0.11973679940010644, -0.2330503168880765, -0.03661658222193432, 0.11694416780111908] |
1,803.00992 | Label Sanitization against Label Flipping Poisoning Attacks | Many machine learning systems rely on data collected in the wild from
untrusted sources, exposing the learning algorithms to data poisoning.
Attackers can inject malicious data in the training dataset to subvert the
learning process, compromising the performance of the algorithm producing
errors in a targeted or an indiscriminate way. Label flipping attacks are a
special case of data poisoning, where the attacker can control the labels
assigned to a fraction of the training points. Even if the capabilities of the
attacker are constrained, these attacks have been shown to be effective to
significantly degrade the performance of the system. In this paper we propose
an efficient algorithm to perform optimal label flipping poisoning attacks and
a mechanism to detect and relabel suspicious data points, mitigating the effect
of such poisoning attacks.
| stat.ML cs.CR cs.LG | many machine learning systems rely on data collected in the wild from untrusted sources exposing the learning algorithms to data poisoning attackers can inject malicious data in the training dataset to subvert the learning process compromising the performance of the algorithm producing errors in a targeted or an indiscriminate way label flipping attacks are a special case of data poisoning where the attacker can control the labels assigned to a fraction of the training points even if the capabilities of the attacker are constrained these attacks have been shown to be effective to significantly degrade the performance of the system in this paper we propose an efficient algorithm to perform optimal label flipping poisoning attacks and a mechanism to detect and relabel suspicious data points mitigating the effect of such poisoning attacks | [['many', 'machine', 'learning', 'systems', 'rely', 'on', 'data', 'collected', 'in', 'the', 'wild', 'from', 'untrusted', 'sources', 'exposing', 'the', 'learning', 'algorithms', 'to', 'data', 'poisoning', 'attackers', 'can', 'inject', 'malicious', 'data', 'in', 'the', 'training', 'dataset', 'to', 'subvert', 'the', 'learning', 'process', 'compromising', 'the', 'performance', 'of', 'the', 'algorithm', 'producing', 'errors', 'in', 'a', 'targeted', 'or', 'an', 'indiscriminate', 'way', 'label', 'flipping', 'attacks', 'are', 'a', 'special', 'case', 'of', 'data', 'poisoning', 'where', 'the', 'attacker', 'can', 'control', 'the', 'labels', 'assigned', 'to', 'a', 'fraction', 'of', 'the', 'training', 'points', 'even', 'if', 'the', 'capabilities', 'of', 'the', 'attacker', 'are', 'constrained', 'these', 'attacks', 'have', 'been', 'shown', 'to', 'be', 'effective', 'to', 'significantly', 'degrade', 'the', 'performance', 'of', 'the', 'system', 'in', 'this', 'paper', 'we', 'propose', 'an', 'efficient', 'algorithm', 'to', 'perform', 'optimal', 'label', 'flipping', 'poisoning', 'attacks', 'and', 'a', 'mechanism', 'to', 'detect', 'and', 'relabel', 'suspicious', 'data', 'points', 'mitigating', 'the', 'effect', 'of', 'such', 'poisoning', 'attacks']] | [-0.13698558794148444, 0.018506774634950103, -0.06652334420171731, 0.09333540762165947, -0.1143525463236129, -0.23935616406555654, 0.1558307276934625, 0.35611130236506916, -0.288557257129331, -0.361874658628508, 0.11278915704778311, -0.3380424059401831, -0.12134177681714804, 0.17819105346632458, -0.1902712231367883, 0.09268503777231231, 0.08502875052561815, 0.02920563726961105, -0.003322542406914925, -0.3541604081225215, 0.3198624401684907, 0.08281042138255681, 0.32853434494499006, 0.013315209303982556, 0.06651941278797688, -0.00984278350017231, 0.016844280517420197, -0.033927602086667764, 0.0006607769244124718, 0.07691502380255384, 0.3398185530113, 0.2164248792175909, 0.33414643003065564, -0.43118704516779294, -0.19818949729034846, 0.1727990712194393, 0.15528307459317148, 0.1963544249601634, -0.06235591634829303, -0.3720734788327139, 0.13536789682235173, -0.21593796130654289, -0.0286934392202194, -0.12282303031745621, -0.05559501722878353, -0.002554669080189232, -0.29357119306399854, -0.02853928368902857, 0.06085532031482382, 0.05667198059911078, -0.012258918412650624, -0.05619417159080816, -0.0036135933848775244, 0.18512029175568992, 0.07157938485540923, -0.006694972839658008, 0.21899182694103342, -0.16165870093303084, -0.16668091039967045, 0.323345626111735, 0.017436676311207877, -0.17899477801455016, 0.16119575023538235, 0.0004983202485494654, -0.12169030304137392, 0.15351752461742074, 0.3051094430961574, 0.1325409440182601, -0.16659212187214784, -0.00611853419721945, 0.011889127450007381, 0.1705549412581604, 0.005867278760750637, 0.021711740982330714, 0.12825129034745536, 0.20462963005852405, 0.07340451728007545, 0.15349469279118982, -0.16988324249695957, -0.00788930229398168, -0.20154397962191564, -0.09459734230415162, -0.1997910025935253, 0.0152024599762323, -0.016628215378494297, -0.14108265484493598, 0.360485270181953, 0.2629881526526967, 0.21359444769085245, 0.04474494512595067, 0.3966360619348107, 0.0015758409395912718, 0.11997498948987799, 0.15574793611250987, 0.19937668300664166, -0.04387660378900667, 0.08039059308198789, -0.2013998648881997, 0.19734641242504233, -0.04173989528543175] |
1,803.00993 | Supernova 1987A Constraints on Sub-GeV Dark Sectors, Millicharged
Particles, the QCD Axion, and an Axion-like Particle | We consider the constraints from Supernova 1987A on particles with small
couplings to the Standard Model. We discuss a model with a fermion coupled to a
dark photon, with various mass relations in the dark sector; millicharged
particles; dark-sector fermions with inelastic transitions; the hadronic QCD
axion; and an axion-like particle that couples to Standard Model fermions with
couplings proportional to their mass. In the fermion cases, we develop a new
diagnostic for assessing when such a particle is trapped at large mixing
angles. Our bounds for a fermion coupled to a dark photon constrain small
couplings and masses <200 MeV, and do not decouple for low fermion masses. They
exclude parameter space that is otherwise unconstrained by existing
accelerator-based and direct-detection searches. In addition, our bounds are
complementary to proposed laboratory searches for sub-GeV dark matter, and do
not constrain several "thermal" benchmark-model targets. For a millicharged
particle, we exclude charges between 10^(-9) to a few times 10^(-6) in units of
the electron charge; this excludes parameter space to higher millicharges and
masses than previous bounds. For the QCD axion and an axion-like particle, we
apply several updated nuclear physics calculations and include the energy
dependence of the optical depth to accurately account for energy loss at large
couplings. We rule out a hadronic axion of mass between 0.1 and a few hundred
eV, or equivalently bound the PQ scale between a few times 10^4 and 10^8 GeV,
closing the hadronic axion window. For an axion-like particle, our bounds
disfavor decay constants between a few times 10^5 GeV up to a few times 10^8
GeV. In all cases, our bounds differ from previous work by more than an order
of magnitude across the entire parameter space. We also provide estimated
systematic errors due to the uncertainties of the progenitor.
| hep-ph astro-ph.CO astro-ph.GA astro-ph.HE hep-ex | we consider the constraints from supernova 1987a on particles with small couplings to the standard model we discuss a model with a fermion coupled to a dark photon with various mass relations in the dark sector millicharged particles darksector fermions with inelastic transitions the hadronic qcd axion and an axionlike particle that couples to standard model fermions with couplings proportional to their mass in the fermion cases we develop a new diagnostic for assessing when such a particle is trapped at large mixing angles our bounds for a fermion coupled to a dark photon constrain small couplings and masses 200 mev and do not decouple for low fermion masses they exclude parameter space that is otherwise unconstrained by existing acceleratorbased and directdetection searches in addition our bounds are complementary to proposed laboratory searches for subgev dark matter and do not constrain several thermal benchmarkmodel targets for a millicharged particle we exclude charges between 109 to a few times 106 in units of the electron charge this excludes parameter space to higher millicharges and masses than previous bounds for the qcd axion and an axionlike particle we apply several updated nuclear physics calculations and include the energy dependence of the optical depth to accurately account for energy loss at large couplings we rule out a hadronic axion of mass between 01 and a few hundred ev or equivalently bound the pq scale between a few times 104 and 108 gev closing the hadronic axion window for an axionlike particle our bounds disfavor decay constants between a few times 105 gev up to a few times 108 gev in all cases our bounds differ from previous work by more than an order of magnitude across the entire parameter space we also provide estimated systematic errors due to the uncertainties of the progenitor | [['we', 'consider', 'the', 'constraints', 'from', 'supernova', '1987a', 'on', 'particles', 'with', 'small', 'couplings', 'to', 'the', 'standard', 'model', 'we', 'discuss', 'a', 'model', 'with', 'a', 'fermion', 'coupled', 'to', 'a', 'dark', 'photon', 'with', 'various', 'mass', 'relations', 'in', 'the', 'dark', 'sector', 'millicharged', 'particles', 'darksector', 'fermions', 'with', 'inelastic', 'transitions', 'the', 'hadronic', 'qcd', 'axion', 'and', 'an', 'axionlike', 'particle', 'that', 'couples', 'to', 'standard', 'model', 'fermions', 'with', 'couplings', 'proportional', 'to', 'their', 'mass', 'in', 'the', 'fermion', 'cases', 'we', 'develop', 'a', 'new', 'diagnostic', 'for', 'assessing', 'when', 'such', 'a', 'particle', 'is', 'trapped', 'at', 'large', 'mixing', 'angles', 'our', 'bounds', 'for', 'a', 'fermion', 'coupled', 'to', 'a', 'dark', 'photon', 'constrain', 'small', 'couplings', 'and', 'masses', '200', 'mev', 'and', 'do', 'not', 'decouple', 'for', 'low', 'fermion', 'masses', 'they', 'exclude', 'parameter', 'space', 'that', 'is', 'otherwise', 'unconstrained', 'by', 'existing', 'acceleratorbased', 'and', 'directdetection', 'searches', 'in', 'addition', 'our', 'bounds', 'are', 'complementary', 'to', 'proposed', 'laboratory', 'searches', 'for', 'subgev', 'dark', 'matter', 'and', 'do', 'not', 'constrain', 'several', 'thermal', 'benchmarkmodel', 'targets', 'for', 'a', 'millicharged', 'particle', 'we', 'exclude', 'charges', 'between', '109', 'to', 'a', 'few', 'times', '106', 'in', 'units', 'of', 'the', 'electron', 'charge', 'this', 'excludes', 'parameter', 'space', 'to', 'higher', 'millicharges', 'and', 'masses', 'than', 'previous', 'bounds', 'for', 'the', 'qcd', 'axion', 'and', 'an', 'axionlike', 'particle', 'we', 'apply', 'several', 'updated', 'nuclear', 'physics', 'calculations', 'and', 'include', 'the', 'energy', 'dependence', 'of', 'the', 'optical', 'depth', 'to', 'accurately', 'account', 'for', 'energy', 'loss', 'at', 'large', 'couplings', 'we', 'rule', 'out', 'a', 'hadronic', 'axion', 'of', 'mass', 'between', '01', 'and', 'a', 'few', 'hundred', 'ev', 'or', 'equivalently', 'bound', 'the', 'pq', 'scale', 'between', 'a', 'few', 'times', '104', 'and', '108', 'gev', 'closing', 'the', 'hadronic', 'axion', 'window', 'for', 'an', 'axionlike', 'particle', 'our', 'bounds', 'disfavor', 'decay', 'constants', 'between', 'a', 'few', 'times', '105', 'gev', 'up', 'to', 'a', 'few', 'times', '108', 'gev', 'in', 'all', 'cases', 'our', 'bounds', 'differ', 'from', 'previous', 'work', 'by', 'more', 'than', 'an', 'order', 'of', 'magnitude', 'across', 'the', 'entire', 'parameter', 'space', 'we', 'also', 'provide', 'estimated', 'systematic', 'errors', 'due', 'to', 'the', 'uncertainties', 'of', 'the', 'progenitor']] | [-0.07746046832739298, 0.27882098169614994, -0.022114521112872355, 0.15342976741164138, -0.08772459722805011, -0.12694067726406988, 0.08493722427362284, 0.3280211428373454, -0.1698077674550207, -0.4027647107144986, 0.02191088336051121, -0.2971747249246491, 0.038872889744547695, 0.19598354518072475, 0.054232782799513844, 0.038101153281582735, 0.03718638270906481, 0.0060051011793155, -0.09067416266206478, -0.22957292539815116, 0.24738111992967768, 0.04602433363579986, 0.15694519061047, 0.11515930128699624, 0.08982724496116706, -0.04336071075376335, -0.004972502690456484, -0.09224820493610335, -0.18004799104027214, 0.06217073170736083, 0.1773166758478732, 0.04549852351620669, 0.16107178418227414, -0.40184674269948417, -0.19272114289885567, 0.19350084606449067, 0.15342127119485338, 0.08802358669004587, -0.07163519774164333, -0.3031171910280991, 0.05479292550500339, -0.21853673194042939, -0.1100688998016644, -0.057431759107172686, -0.028742054100833633, -0.04154421136454433, -0.3198927544512129, 0.10467272228940958, -0.05236210937247328, -0.03729115253924972, -0.05267516841152589, -0.1557118317106876, 0.03218256060406254, 0.0018699327286178663, 0.11921602394120351, 0.02956164007177919, 0.18920115991588993, -0.16409660313655328, -0.10370905510341456, 0.4283763348517385, -0.11802197809272327, -0.17916464937047216, 0.19512062463021673, -0.14952571314438728, -0.14779388083979786, 0.1571568330114452, 0.1880493172440315, 0.09245773206580193, -0.15943014975521366, 0.10082909174430509, -0.04224783238366146, 0.22182869373658753, 0.048894917901549304, 0.07821743242687605, 0.29435458417552024, 0.17195174062116864, 0.06267457463728719, 0.027632168740038775, -0.1248040512176137, -0.07785829812456484, -0.32595014448953563, -0.1126409256217587, -0.1274106993143724, 0.048996166953054664, -0.12159201565825842, -0.09039964066175152, 0.3637902471890991, 0.1703435029370405, 0.24801393432611207, 0.03908544883393234, 0.2875914064556809, 0.06707734309205393, 0.09045178820355718, 0.05809351572312141, 0.3423743456840378, 0.12802604680419916, 0.09044743774078762, -0.19418449352579473, -0.06337396527272976, 0.01642853761696098] |
1,803.00994 | A complex network description of thermal quantum states in the Ising
spin chain | We use network analysis to describe and characterize an archetypal quantum
system - an Ising spin chain in a transverse magnetic field. We analyze
weighted networks for this quantum system, with link weights given by various
measures of spin-spin correlations such as the von Neumann and Renyi mutual
information, concurrence, and negativity. We analytically calculate the
spin-spin correlations in the system at an arbitrary temperature by mapping the
Ising spin chain to fermions, as well as numerically calculate the correlations
in the ground state using matrix product state methods, and then analyze the
resulting networks using a variety of network measures. We demonstrate that the
network measures show some traits of complex networks already in this spin
chain, arguably the simplest quantum many-body system. The network measures
give insight into the phase diagram not easily captured by more typical
quantities, such as the order parameter or correlation length. For example, the
network structure varies with transverse field and temperature, and the
structure in the quantum critical fan is different from the ordered and
disordered phases.
| cond-mat.stat-mech cond-mat.quant-gas quant-ph | we use network analysis to describe and characterize an archetypal quantum system an ising spin chain in a transverse magnetic field we analyze weighted networks for this quantum system with link weights given by various measures of spinspin correlations such as the von neumann and renyi mutual information concurrence and negativity we analytically calculate the spinspin correlations in the system at an arbitrary temperature by mapping the ising spin chain to fermions as well as numerically calculate the correlations in the ground state using matrix product state methods and then analyze the resulting networks using a variety of network measures we demonstrate that the network measures show some traits of complex networks already in this spin chain arguably the simplest quantum manybody system the network measures give insight into the phase diagram not easily captured by more typical quantities such as the order parameter or correlation length for example the network structure varies with transverse field and temperature and the structure in the quantum critical fan is different from the ordered and disordered phases | [['we', 'use', 'network', 'analysis', 'to', 'describe', 'and', 'characterize', 'an', 'archetypal', 'quantum', 'system', 'an', 'ising', 'spin', 'chain', 'in', 'a', 'transverse', 'magnetic', 'field', 'we', 'analyze', 'weighted', 'networks', 'for', 'this', 'quantum', 'system', 'with', 'link', 'weights', 'given', 'by', 'various', 'measures', 'of', 'spinspin', 'correlations', 'such', 'as', 'the', 'von', 'neumann', 'and', 'renyi', 'mutual', 'information', 'concurrence', 'and', 'negativity', 'we', 'analytically', 'calculate', 'the', 'spinspin', 'correlations', 'in', 'the', 'system', 'at', 'an', 'arbitrary', 'temperature', 'by', 'mapping', 'the', 'ising', 'spin', 'chain', 'to', 'fermions', 'as', 'well', 'as', 'numerically', 'calculate', 'the', 'correlations', 'in', 'the', 'ground', 'state', 'using', 'matrix', 'product', 'state', 'methods', 'and', 'then', 'analyze', 'the', 'resulting', 'networks', 'using', 'a', 'variety', 'of', 'network', 'measures', 'we', 'demonstrate', 'that', 'the', 'network', 'measures', 'show', 'some', 'traits', 'of', 'complex', 'networks', 'already', 'in', 'this', 'spin', 'chain', 'arguably', 'the', 'simplest', 'quantum', 'manybody', 'system', 'the', 'network', 'measures', 'give', 'insight', 'into', 'the', 'phase', 'diagram', 'not', 'easily', 'captured', 'by', 'more', 'typical', 'quantities', 'such', 'as', 'the', 'order', 'parameter', 'or', 'correlation', 'length', 'for', 'example', 'the', 'network', 'structure', 'varies', 'with', 'transverse', 'field', 'and', 'temperature', 'and', 'the', 'structure', 'in', 'the', 'quantum', 'critical', 'fan', 'is', 'different', 'from', 'the', 'ordered', 'and', 'disordered', 'phases']] | [-0.14402111411702165, 0.15352462344338258, -0.05368072749115527, 0.11293443096145966, 0.027331899112925447, -0.14983477500727635, -0.0027102172781509914, 0.3793148571911707, -0.29443071981699304, -0.24874695531231747, 0.07941263309752183, -0.2947822745117337, -0.17632387513990633, 0.17570784587236443, 0.03725602933815841, 0.07056003321101353, 0.025514513022673112, 0.07357519410079581, -0.10304248795828558, -0.19972500833147472, 0.3645964626800911, 0.014172896025595308, 0.29818082469162244, 0.07077365668875904, 0.0888355032968383, 0.0637421496480104, 0.07559906313431332, 0.05251807237148349, -0.16254206723153047, 0.05350525886216469, 0.22868313137495397, 0.08304149855172292, 0.19809068720948336, -0.42176874350199756, -0.22020919099128966, 0.11939754575790687, 0.1324462573105555, 0.15030341535999342, 0.042152254265079396, -0.34480115261207195, 0.001020461465392647, -0.22820777402275466, -0.08911756550539927, -0.15223629934038838, -0.010294590917437327, 0.008520838328176874, -0.2428852098120173, 0.07273910922030437, 0.04353756021678812, 0.10304453791970195, -0.026124853247391253, -0.07871631454494407, -0.03431288383020645, 0.16213863195942438, -0.005602456566489779, 0.03713714263613346, 0.13561582891805762, -0.14477384206437474, -0.16206241198367138, 0.3152698363530739, -0.051659554651879505, -0.1983024581073216, 0.16442348801894863, -0.1464622817123503, -0.10483167631733606, 0.05801313437103968, 0.15866917985673437, 0.06097514663780129, -0.1633427956512187, 0.03616910466914943, -0.0076641737183705825, 0.173208791045365, -0.028653302097468282, 0.08128695480322101, 0.2087841198308629, 0.13632136477483972, 0.0702556766564262, 0.22981805412162995, -0.08948750246915667, -0.1552756804298481, -0.22883951989933848, -0.1874645407707698, -0.25491442023803235, 0.05234530243707149, -0.13837416019317783, -0.17930731528984575, 0.4386315975370335, 0.14794621107002132, 0.2121749191957087, 0.041634546384086896, 0.2554755647099395, 0.11751386364012015, 0.03925897907358648, 0.07406166734123046, 0.17425870953810846, 0.18270637890813743, 0.09686971198962788, -0.24239975637247807, 0.06967126444014239, 0.07349808893605382] |
1,803.00995 | Universal Behavior of the Thermoelectric Figure of Merit, zT, vs.
Quality Factor | To increase the performance of thermoelectric materials, the electronic
parameters in the figure of merit must be improved. In this paper, we use full,
numerical band structures and solve the Boltzmann equation in the relaxation
time approximation using energy-dependent scattering times informed by first
principles simulations. By varying the strength of the electron-phonon coupling
or the lattice thermal conductivity, we compute the thermoelectric figure of
merit, zT, vs. a generalized thermoelectric quality factor. More than a dozen
different complex electronic structures are examined. Surprisingly, we find
that at a given quality factor, none provides a better figure of merit than
that of a material with a simple, parabolic band and acoustic deformation
potential scattering. A qualitative argument for this unexpected finding is
presented. This apparent universal behavior suggests that even for complex
electronic band structures, the thermoelectric figure of merit depends solely
on the ratio of electrical to thermal conductivity; the Seebeck coefficient and
Lorenz number need not be considered. This observation should simplify the
search for promising new materials, but if exceptions to this behavior can be
identified, new paths for increasing thermoelectric material performance will
open up.
| cond-mat.mtrl-sci | to increase the performance of thermoelectric materials the electronic parameters in the figure of merit must be improved in this paper we use full numerical band structures and solve the boltzmann equation in the relaxation time approximation using energydependent scattering times informed by first principles simulations by varying the strength of the electronphonon coupling or the lattice thermal conductivity we compute the thermoelectric figure of merit zt vs a generalized thermoelectric quality factor more than a dozen different complex electronic structures are examined surprisingly we find that at a given quality factor none provides a better figure of merit than that of a material with a simple parabolic band and acoustic deformation potential scattering a qualitative argument for this unexpected finding is presented this apparent universal behavior suggests that even for complex electronic band structures the thermoelectric figure of merit depends solely on the ratio of electrical to thermal conductivity the seebeck coefficient and lorenz number need not be considered this observation should simplify the search for promising new materials but if exceptions to this behavior can be identified new paths for increasing thermoelectric material performance will open up | [['to', 'increase', 'the', 'performance', 'of', 'thermoelectric', 'materials', 'the', 'electronic', 'parameters', 'in', 'the', 'figure', 'of', 'merit', 'must', 'be', 'improved', 'in', 'this', 'paper', 'we', 'use', 'full', 'numerical', 'band', 'structures', 'and', 'solve', 'the', 'boltzmann', 'equation', 'in', 'the', 'relaxation', 'time', 'approximation', 'using', 'energydependent', 'scattering', 'times', 'informed', 'by', 'first', 'principles', 'simulations', 'by', 'varying', 'the', 'strength', 'of', 'the', 'electronphonon', 'coupling', 'or', 'the', 'lattice', 'thermal', 'conductivity', 'we', 'compute', 'the', 'thermoelectric', 'figure', 'of', 'merit', 'zt', 'vs', 'a', 'generalized', 'thermoelectric', 'quality', 'factor', 'more', 'than', 'a', 'dozen', 'different', 'complex', 'electronic', 'structures', 'are', 'examined', 'surprisingly', 'we', 'find', 'that', 'at', 'a', 'given', 'quality', 'factor', 'none', 'provides', 'a', 'better', 'figure', 'of', 'merit', 'than', 'that', 'of', 'a', 'material', 'with', 'a', 'simple', 'parabolic', 'band', 'and', 'acoustic', 'deformation', 'potential', 'scattering', 'a', 'qualitative', 'argument', 'for', 'this', 'unexpected', 'finding', 'is', 'presented', 'this', 'apparent', 'universal', 'behavior', 'suggests', 'that', 'even', 'for', 'complex', 'electronic', 'band', 'structures', 'the', 'thermoelectric', 'figure', 'of', 'merit', 'depends', 'solely', 'on', 'the', 'ratio', 'of', 'electrical', 'to', 'thermal', 'conductivity', 'the', 'seebeck', 'coefficient', 'and', 'lorenz', 'number', 'need', 'not', 'be', 'considered', 'this', 'observation', 'should', 'simplify', 'the', 'search', 'for', 'promising', 'new', 'materials', 'but', 'if', 'exceptions', 'to', 'this', 'behavior', 'can', 'be', 'identified', 'new', 'paths', 'for', 'increasing', 'thermoelectric', 'material', 'performance', 'will', 'open', 'up']] | [-0.14523777912220567, 0.08666539536518039, -0.0681533726380655, 0.003423445743185877, -0.12922009910461763, -0.13971978921945843, 0.08967233972596843, 0.3851740421362655, -0.29766233052033436, -0.32153170660295816, 0.01848009942289166, -0.29757413804708494, -0.17183695692401477, 0.27520323385824524, -0.001111581564324085, 0.0459746533460304, 0.044873362986085116, -0.03604535210049815, -0.11474161395660193, -0.25998916625779456, 0.24305962848175403, 0.1080742963292838, 0.2877809452336459, 0.09584788615148879, 0.044130760333029595, -0.017236365732199773, 0.06133735085783339, 0.07961876718290446, -0.1583973233493414, 0.10972551687339706, 0.27289186139029287, -0.041062249925859745, 0.21987142341911162, -0.3805363854817139, -0.21777397122005587, 0.04689292713171906, 0.12767777306757, 0.08394138745608784, -0.039501486085346045, -0.17765475729007332, 0.07545419483539209, -0.16764108616878431, -0.11682860692223859, -0.12468216086309107, 0.018844954046130024, -0.02212007187871095, -0.21762504448582018, 0.10131457927710717, 0.006512175126878357, 0.04790620078707222, -0.0566647030504312, -0.18170696342728598, 0.016503378736574655, 0.07111549771836806, 0.027708906767811015, -0.018381927236323318, 0.1791862495731385, -0.153735793408785, -0.09311068393708892, 0.426414230986247, -0.04673697213625668, -0.170130781536163, 0.12429858761883918, -0.1461140494719739, -0.09079190262066072, 0.16579929546812777, 0.14637074039426076, 0.06248455926795643, -0.1737956228030343, 0.025912597247894617, 0.0007169955217885593, 0.18396655407983062, 0.07159901474154105, 0.06983942817527032, 0.20254244951767816, 0.20714939464494664, 0.02723095100865793, 0.1427529980212933, -0.04156595095622516, 0.008125414150377746, -0.23160956873405705, -0.20399475728916794, -0.2037450183529737, 0.1382484504345234, -0.14296607296057995, -0.1573302085140582, 0.44819084412994836, 0.18124388166698358, 0.15408687736523688, -0.002676585786507795, 0.26220531158996796, 0.16557114011061097, 0.0648389510732149, 0.06205720200850727, 0.28365620143407283, 0.07850394019100658, 0.10655049932258273, -0.26996336607927723, 0.08612321985875646, 0.004155820517716979] |
1,803.00996 | Towards 2+1 photon tomography: Energy-based selection of two 511 keV
photons and a prompt photon with the J-PET scanner | The possibility to separate signals caused by 511 keV photons created in
annihilation of electron-positron pairs and the so-called prompt photons from
nuclei de- excitation is investigated. It could potentially be used to improve
the quality of reconstructed images in the J-PET scanner in 2+1 photon
tomography. Firstly, a research is conducted for several radioisotopes that
decay via \b{eta}+ decay followed by de-excitation of an excited nucleus.
Efficiency, purity and false positive rate are calculated for each isotope as a
function of energy deposited threshold, with a hypothesis that signals caused
by 511 keV photons deposit smaller values of energy than 1 z 13the selected
threshold, while prompt photons deposit larger energy than the threshold.
Analysis of the results accompanied with physical properties of radioisotopes
suggests using 44 Sc, which is the most promising candidate for medical
applications. With the use of GATE and J-POS simulation software, in-phantom
scattering was introduced and the best energy deposited threshold value was
estimated to be approximately 375 keV. It corresponds to almost 100% efficiency
for 511 keV signals, 75% purity for 511 keV photons, and approximately 70%
efficiency and purity for prompt photons.
| physics.med-ph physics.ins-det | the possibility to separate signals caused by 511 kev photons created in annihilation of electronpositron pairs and the socalled prompt photons from nuclei de excitation is investigated it could potentially be used to improve the quality of reconstructed images in the jpet scanner in 21 photon tomography firstly a research is conducted for several radioisotopes that decay via beta decay followed by deexcitation of an excited nucleus efficiency purity and false positive rate are calculated for each isotope as a function of energy deposited threshold with a hypothesis that signals caused by 511 kev photons deposit smaller values of energy than 1 z 13the selected threshold while prompt photons deposit larger energy than the threshold analysis of the results accompanied with physical properties of radioisotopes suggests using 44 sc which is the most promising candidate for medical applications with the use of gate and jpos simulation software inphantom scattering was introduced and the best energy deposited threshold value was estimated to be approximately 375 kev it corresponds to almost 100 efficiency for 511 kev signals 75 purity for 511 kev photons and approximately 70 efficiency and purity for prompt photons | [['the', 'possibility', 'to', 'separate', 'signals', 'caused', 'by', '511', 'kev', 'photons', 'created', 'in', 'annihilation', 'of', 'electronpositron', 'pairs', 'and', 'the', 'socalled', 'prompt', 'photons', 'from', 'nuclei', 'de', 'excitation', 'is', 'investigated', 'it', 'could', 'potentially', 'be', 'used', 'to', 'improve', 'the', 'quality', 'of', 'reconstructed', 'images', 'in', 'the', 'jpet', 'scanner', 'in', '21', 'photon', 'tomography', 'firstly', 'a', 'research', 'is', 'conducted', 'for', 'several', 'radioisotopes', 'that', 'decay', 'via', 'beta', 'decay', 'followed', 'by', 'deexcitation', 'of', 'an', 'excited', 'nucleus', 'efficiency', 'purity', 'and', 'false', 'positive', 'rate', 'are', 'calculated', 'for', 'each', 'isotope', 'as', 'a', 'function', 'of', 'energy', 'deposited', 'threshold', 'with', 'a', 'hypothesis', 'that', 'signals', 'caused', 'by', '511', 'kev', 'photons', 'deposit', 'smaller', 'values', 'of', 'energy', 'than', '1', 'z', '13the', 'selected', 'threshold', 'while', 'prompt', 'photons', 'deposit', 'larger', 'energy', 'than', 'the', 'threshold', 'analysis', 'of', 'the', 'results', 'accompanied', 'with', 'physical', 'properties', 'of', 'radioisotopes', 'suggests', 'using', '44', 'sc', 'which', 'is', 'the', 'most', 'promising', 'candidate', 'for', 'medical', 'applications', 'with', 'the', 'use', 'of', 'gate', 'and', 'jpos', 'simulation', 'software', 'inphantom', 'scattering', 'was', 'introduced', 'and', 'the', 'best', 'energy', 'deposited', 'threshold', 'value', 'was', 'estimated', 'to', 'be', 'approximately', '375', 'kev', 'it', 'corresponds', 'to', 'almost', '100', 'efficiency', 'for', '511', 'kev', 'signals', '75', 'purity', 'for', '511', 'kev', 'photons', 'and', 'approximately', '70', 'efficiency', 'and', 'purity', 'for', 'prompt', 'photons']] | [-0.008767178975060543, 0.1908090134230077, -0.024856541819741673, 0.112712525009943, 0.005031704423364569, -0.1249240743469427, 0.06938452898782302, 0.3957643312194008, -0.18427361659718022, -0.40232628475914295, 0.011387081867569383, -0.3576381622858227, 0.06688737856011163, 0.24919093774255127, 0.04111084720600357, 0.06540542071881181, 0.06599781916791356, -0.012670227004452906, -0.007506598220603105, -0.21704158819766042, 0.22457139882843624, 0.18996918989850722, 0.29457055556369904, 0.09355923527065432, 0.0855861467091327, -0.0005147799730617949, -0.015623276151637448, -0.08589849110811631, -0.08904889978487304, 0.06471377263152774, 0.24672369592317797, 0.13603950805059248, 0.19132032134431473, -0.33448739025613017, -0.1991904174278619, 0.15190924467528832, 0.14983503820498145, -0.003751091366173065, -0.08716501852873951, -0.29499381595598334, 0.11148598247227516, -0.1707700084154296, -0.0913391335436361, 0.039331920204703955, 0.012150512553102516, -0.0024633838605021743, -0.25709806082948566, 0.11529832091578777, -0.017637841615880383, 0.01083805281272594, -0.0866873159427493, -0.13166911576681353, -0.019444417909402004, 0.02405172215026625, 0.04844417881364241, 0.04301260175688707, 0.2299079538169416, -0.10793398717973143, -0.1381891184285818, 0.34946119634712, -0.055090871772839084, -0.063687547335421, 0.13134747315594492, -0.13781535699765415, -0.07534036405713972, 0.3192605175715103, 0.12682789076550646, 0.10176742134833748, -0.15960010862661564, -0.025249931940863383, 0.06997030888104494, 0.25470479139240776, 0.13543847218859306, 0.06659008197466586, 0.20667655626311898, 0.1497887352337823, -0.01967819575022193, 0.1527783096708516, -0.18010704721136597, 0.008426732373760735, -0.27456834322576007, -0.16210674682007906, -0.142974459722222, 0.0960187324792756, -0.020154252070766387, -0.07590596475687987, 0.3981980217789161, 0.08897740047851062, 0.20726207424539755, -0.03801364701506285, 0.2978777396851814, 0.11718730567743943, 0.05537068649467054, 0.05208004785588933, 0.314820256361619, 0.1492944969993798, 0.08236298624034773, -0.18536300160377187, 0.05125359019903625, -0.01732608781349746] |
1,803.00997 | A computational perspective of the role of Thalamus in cognition | Thalamus has traditionally been considered as only a relay source of cortical
inputs, with hierarchically organized cortical circuits serially transforming
thalamic signals to cognitively-relevant representations. Given the absence of
local excitatory connections within the thalamus, the notion of thalamic
`relay' seemed like a reasonable description over the last several decades.
Recent advances in experimental approaches and theory provide a broader
perspective on the role of the thalamus in cognitively-relevant cortical
computations, and suggest that only a subset of thalamic circuit motifs fit the
relay description. Here, we discuss this perspective and highlight the
potential role for the thalamus -- and specifically mediodorsal (MD) nucleus --
in dynamic selection of cortical representations through a combination of
intrinsic thalamic computations and output signals that change cortical network
functional parameters. We suggest that through the contextual modulation of
cortical computation, thalamus and cortex jointly optimize the information/cost
tradeoff in an emergent fashion. We emphasize that coordinated experimental and
theoretical efforts will provide a path to understanding the role of the
thalamus in cognition, along with an understanding to augment cognitive
capacity in health and disease.
| q-bio.NC cs.NE | thalamus has traditionally been considered as only a relay source of cortical inputs with hierarchically organized cortical circuits serially transforming thalamic signals to cognitivelyrelevant representations given the absence of local excitatory connections within the thalamus the notion of thalamic relay seemed like a reasonable description over the last several decades recent advances in experimental approaches and theory provide a broader perspective on the role of the thalamus in cognitivelyrelevant cortical computations and suggest that only a subset of thalamic circuit motifs fit the relay description here we discuss this perspective and highlight the potential role for the thalamus and specifically mediodorsal md nucleus in dynamic selection of cortical representations through a combination of intrinsic thalamic computations and output signals that change cortical network functional parameters we suggest that through the contextual modulation of cortical computation thalamus and cortex jointly optimize the informationcost tradeoff in an emergent fashion we emphasize that coordinated experimental and theoretical efforts will provide a path to understanding the role of the thalamus in cognition along with an understanding to augment cognitive capacity in health and disease | [['thalamus', 'has', 'traditionally', 'been', 'considered', 'as', 'only', 'a', 'relay', 'source', 'of', 'cortical', 'inputs', 'with', 'hierarchically', 'organized', 'cortical', 'circuits', 'serially', 'transforming', 'thalamic', 'signals', 'to', 'cognitivelyrelevant', 'representations', 'given', 'the', 'absence', 'of', 'local', 'excitatory', 'connections', 'within', 'the', 'thalamus', 'the', 'notion', 'of', 'thalamic', 'relay', 'seemed', 'like', 'a', 'reasonable', 'description', 'over', 'the', 'last', 'several', 'decades', 'recent', 'advances', 'in', 'experimental', 'approaches', 'and', 'theory', 'provide', 'a', 'broader', 'perspective', 'on', 'the', 'role', 'of', 'the', 'thalamus', 'in', 'cognitivelyrelevant', 'cortical', 'computations', 'and', 'suggest', 'that', 'only', 'a', 'subset', 'of', 'thalamic', 'circuit', 'motifs', 'fit', 'the', 'relay', 'description', 'here', 'we', 'discuss', 'this', 'perspective', 'and', 'highlight', 'the', 'potential', 'role', 'for', 'the', 'thalamus', 'and', 'specifically', 'mediodorsal', 'md', 'nucleus', 'in', 'dynamic', 'selection', 'of', 'cortical', 'representations', 'through', 'a', 'combination', 'of', 'intrinsic', 'thalamic', 'computations', 'and', 'output', 'signals', 'that', 'change', 'cortical', 'network', 'functional', 'parameters', 'we', 'suggest', 'that', 'through', 'the', 'contextual', 'modulation', 'of', 'cortical', 'computation', 'thalamus', 'and', 'cortex', 'jointly', 'optimize', 'the', 'informationcost', 'tradeoff', 'in', 'an', 'emergent', 'fashion', 'we', 'emphasize', 'that', 'coordinated', 'experimental', 'and', 'theoretical', 'efforts', 'will', 'provide', 'a', 'path', 'to', 'understanding', 'the', 'role', 'of', 'the', 'thalamus', 'in', 'cognition', 'along', 'with', 'an', 'understanding', 'to', 'augment', 'cognitive', 'capacity', 'in', 'health', 'and', 'disease']] | [-0.11384508320936054, 0.06372597207337094, -0.0487052785703616, 0.04325026688523146, -0.09081905382547782, -0.14361726939784025, 0.07960990902277197, 0.41963520410089666, -0.255939879364715, -0.27288346136496827, 0.048240557335454716, -0.2559316679048193, -0.3157504902562571, 0.1537964033301581, -0.09594377507148072, -0.0018263781887733123, 0.04745260811680716, 0.0481723629348959, -0.0006746552244294435, -0.18095992228534835, 0.22971239771471696, 0.10236289512249641, 0.3243055497135753, 0.027252658032838637, 0.11495073260849412, -0.004262522381561046, -0.06025270111223852, -0.025854138128951574, -0.09141369977921633, 0.19301230685563164, 0.34939341423953674, 0.17480963026173413, 0.30949333353253844, -0.5398134417046094, -0.3032645422499627, 0.06384838818815876, 0.1660846475702287, 0.07236999548463659, -0.03146862189367477, -0.286269125348719, 0.07023892618467058, -0.1480531336672522, -0.004377414236593971, -0.06419026679676873, 0.006561881373107264, 0.02138551233061166, -0.23302041839699747, 0.05574607127875259, 0.04160868705631318, 0.11962499571382068, -0.08537935691327386, -0.0777302104609341, -0.01218714806865054, 0.19714998423693364, 0.022030384761902413, 0.06273035445800898, 0.19273675472570836, -0.17198501523473003, -0.15584720829462062, 0.28742402623307, 0.040439083113927736, -0.1837567704483676, 0.158259340097588, -0.08102221964773806, -0.16669495388950137, 0.06622885196173395, 0.20558697749352592, -0.0009763538268585266, -0.15881158726088787, 0.00690974398590201, -0.018575199067444457, 0.19054357744409406, 0.044175868859218266, 0.056760776965265075, 0.20791865919243885, 0.22866969658273525, 0.0010167665261013265, 0.11433813147860664, -0.09813386794501805, -0.12521954758068948, -0.2713095375802368, -0.09932076914595779, -0.11446004184174606, 0.004547218048669906, -0.10591614818721692, -0.10471898116603287, 0.4423096661577636, 0.10712746348740025, 0.2159514469231877, 0.06631235898054332, 0.28445807226539316, 0.001198621069224001, 0.09548046267379752, 0.05564466009276326, 0.20111401211364532, 0.14764074977062014, 0.07998966100157387, -0.23345552063520617, 0.1195102567613834, 3.001454222778028e-06] |
1,803.00998 | Vu Ngoc's Conjecture on focus-focus singular fibers with multiple
pinched points | We classify, up to fiberwise symplectomorphisms, a saturated neighborhood of
a singular fiber of an integrable system (which is proper onto its image and
has connected fibers) containing $k > 1$ focus-focus critical points. Our
result shows that there is a one-to-one correspondence between such
neighborhoods and $k$ formal power series, up to a $(\mathbb{Z}_2 \times
D_k)$-action, where $D_k$ is the $k$-th dihedral group. The $k$ formal power
series determine the dynamical behavior of the Hamiltonian vector fields
associated to the components of the momentum map on the symplectic manifold
$(M,\omega)$ near the singular fiber containing the $k$ focus-focus critical
points. This proves a conjecture of San Vu Ngoc from 2002.
| math.SG math.DS | we classify up to fiberwise symplectomorphisms a saturated neighborhood of a singular fiber of an integrable system which is proper onto its image and has connected fibers containing k 1 focusfocus critical points our result shows that there is a onetoone correspondence between such neighborhoods and k formal power series up to a mathbbz_2 times d_kaction where d_k is the kth dihedral group the k formal power series determine the dynamical behavior of the hamiltonian vector fields associated to the components of the momentum map on the symplectic manifold momega near the singular fiber containing the k focusfocus critical points this proves a conjecture of san vu ngoc from 2002 | [['we', 'classify', 'up', 'to', 'fiberwise', 'symplectomorphisms', 'a', 'saturated', 'neighborhood', 'of', 'a', 'singular', 'fiber', 'of', 'an', 'integrable', 'system', 'which', 'is', 'proper', 'onto', 'its', 'image', 'and', 'has', 'connected', 'fibers', 'containing', 'k', '1', 'focusfocus', 'critical', 'points', 'our', 'result', 'shows', 'that', 'there', 'is', 'a', 'onetoone', 'correspondence', 'between', 'such', 'neighborhoods', 'and', 'k', 'formal', 'power', 'series', 'up', 'to', 'a', 'mathbbz_2', 'times', 'd_kaction', 'where', 'd_k', 'is', 'the', 'kth', 'dihedral', 'group', 'the', 'k', 'formal', 'power', 'series', 'determine', 'the', 'dynamical', 'behavior', 'of', 'the', 'hamiltonian', 'vector', 'fields', 'associated', 'to', 'the', 'components', 'of', 'the', 'momentum', 'map', 'on', 'the', 'symplectic', 'manifold', 'momega', 'near', 'the', 'singular', 'fiber', 'containing', 'the', 'k', 'focusfocus', 'critical', 'points', 'this', 'proves', 'a', 'conjecture', 'of', 'san', 'vu', 'ngoc', 'from', '2002']] | [-0.2605442240441201, 0.047625440562815716, -0.09247127236849671, -0.030075601966402264, -0.060299194377308726, -0.14305754108119484, 0.03381739420935922, 0.32396357122022623, -0.30351152927443864, -0.18722199018053506, 0.0645592893610512, -0.34001349838698336, -0.1532644257376637, 0.17493699144982144, -0.09364690587625181, 0.015595338409317983, 0.028142690778188748, 0.1294880059329844, -0.09152312072446792, -0.2489912542898994, 0.36833647072930403, -0.05341641732636805, 0.20793697779032683, 0.01828362980703695, 0.1526188494684602, -0.031134804678704896, 0.03792131807892199, -0.015595786974107453, -0.15376294154168904, 0.10447896412069645, 0.2897160827703432, 0.04861378483047042, 0.20513474851966315, -0.31150372201628096, -0.1757054089765073, 0.1738784362843961, 0.0963928218238876, -0.025139778590795303, 0.06736526972669767, -0.2831386148869786, 0.15335777893645364, -0.11809705401591342, -0.2013164133863062, -0.07994557566750675, 0.07777582114528216, -0.006870124850046597, -0.24047804418780389, -0.009294738595741332, 0.12429006390007631, 0.14802557850307826, -0.014180622718279856, -0.07074692132861413, -0.08475213062975111, 0.1262585683469447, 0.004893728346059765, 0.09789883203103865, 0.11033286621640308, -0.07632173369681343, -0.06379777980848737, 0.3596207796758331, -0.0621224653793909, -0.14702553416542505, 0.14242793265473816, -0.13833605249865202, -0.1463072016672872, 0.20113971097599886, 0.10292716982663361, 0.11704857062138276, -0.05939010261566541, 0.1555194772401859, -0.09078245557024392, 0.1282944543321335, 0.12213962947214962, -0.0733246339758465, 0.1785855378374594, 0.09776291121096445, 0.13350868452100859, 0.09911880658409737, -0.041020363302786036, -0.07924449115290964, -0.32830095706815154, -0.17810625091212196, -0.17629707381428314, 0.1684260414614248, -0.1407272576249243, -0.16082256953253352, 0.4141144277271601, 0.03322928330707236, 0.24746341702588107, 0.04974924132693559, 0.22159712841102017, 0.09186856256084465, 0.04947286704555154, 0.08813009295322069, 0.1374008398879012, 0.20142175256351538, 0.024253009745868248, -0.1778861215752507, -0.08746234228868686, 0.15119133088652284] |
1,803.00999 | Spinon Fermi surface in a cluster Mott insulator model on a triangular
lattice and possible application to 1T-TaS$_2$ | 1T-TaS$_2$ is a cluster Mott insulator on the triangular lattice with 13 Ta
atoms forming a star of David cluster as the unit cell. We derive a two
dimensional XXZ spin-1/2 model with four-spin ring exchange term to describe
the effective low energy physics of a monolayer 1T-TaS$_2$, where the effective
spin-1/2 degrees of freedom arises from the Kramers degenerate spin-orbital
states on each star of David. A large scale density matrix renormalization
group simulation is further performed on this effective model and we find a
gapless spin liquid phase with spinon Fermi surface at moderate to large
strength region of four-spin ring exchange term. All peaks in the static spin
structure factor are found to be located on the "$2k_F$" surface of half-filled
spinon on the triangular lattice. Experiments to detect the spinon Fermi
surface phase in 1T-TaS$_2$ are discussed.
| cond-mat.str-el | 1ttas_2 is a cluster mott insulator on the triangular lattice with 13 ta atoms forming a star of david cluster as the unit cell we derive a two dimensional xxz spin12 model with fourspin ring exchange term to describe the effective low energy physics of a monolayer 1ttas_2 where the effective spin12 degrees of freedom arises from the kramers degenerate spinorbital states on each star of david a large scale density matrix renormalization group simulation is further performed on this effective model and we find a gapless spin liquid phase with spinon fermi surface at moderate to large strength region of fourspin ring exchange term all peaks in the static spin structure factor are found to be located on the 2k_f surface of halffilled spinon on the triangular lattice experiments to detect the spinon fermi surface phase in 1ttas_2 are discussed | [['1ttas_2', 'is', 'a', 'cluster', 'mott', 'insulator', 'on', 'the', 'triangular', 'lattice', 'with', '13', 'ta', 'atoms', 'forming', 'a', 'star', 'of', 'david', 'cluster', 'as', 'the', 'unit', 'cell', 'we', 'derive', 'a', 'two', 'dimensional', 'xxz', 'spin12', 'model', 'with', 'fourspin', 'ring', 'exchange', 'term', 'to', 'describe', 'the', 'effective', 'low', 'energy', 'physics', 'of', 'a', 'monolayer', '1ttas_2', 'where', 'the', 'effective', 'spin12', 'degrees', 'of', 'freedom', 'arises', 'from', 'the', 'kramers', 'degenerate', 'spinorbital', 'states', 'on', 'each', 'star', 'of', 'david', 'a', 'large', 'scale', 'density', 'matrix', 'renormalization', 'group', 'simulation', 'is', 'further', 'performed', 'on', 'this', 'effective', 'model', 'and', 'we', 'find', 'a', 'gapless', 'spin', 'liquid', 'phase', 'with', 'spinon', 'fermi', 'surface', 'at', 'moderate', 'to', 'large', 'strength', 'region', 'of', 'fourspin', 'ring', 'exchange', 'term', 'all', 'peaks', 'in', 'the', 'static', 'spin', 'structure', 'factor', 'are', 'found', 'to', 'be', 'located', 'on', 'the', '2k_f', 'surface', 'of', 'halffilled', 'spinon', 'on', 'the', 'triangular', 'lattice', 'experiments', 'to', 'detect', 'the', 'spinon', 'fermi', 'surface', 'phase', 'in', '1ttas_2', 'are', 'discussed']] | [-0.20734919886561343, 0.25361043456545534, -0.025851838490496395, 0.04850886576290487, -0.03745745174778321, -0.1851794433149225, 0.07255105309168551, 0.3504237527859972, -0.2364669797218781, -0.25389347012412355, 0.005941080122670912, -0.35044643449999974, -0.09251800465153147, 0.09559217034938171, 0.08630418849936422, -0.046598282414785724, -0.009675184343627767, 0.00901813839119694, -0.12881569793210068, -0.24996370861987113, 0.30216059046929555, 0.043946812087868124, 0.28076410042584365, 0.09249486828368184, 0.07794698063574784, 0.039227834280170765, 0.13456837048569154, -0.020466012464083257, -0.1644839701830601, 0.05216675982207839, 0.2504339572702739, -0.15346440766997477, 0.14948395791410712, -0.416730026833396, -0.20063567979935001, -0.0043262006906488685, 0.1290302856627964, 0.15903578372341945, -0.042676478674707946, -0.3149034920023054, -0.0074358402506996555, -0.2565014889225998, -0.16117621560627265, -0.07188449758237082, -0.02165403472860707, -0.05478645201936754, -0.21818774314605505, 0.13111186233132002, 0.0136861435025402, 0.11976814056013493, -0.06159298628872485, -0.14357799186919493, -0.10361340142958236, 0.042931577184564494, 0.021793978336656875, 0.09143579467563025, 0.15486485424537397, -0.12093096077740431, -0.08693117216387962, 0.37464357203480303, -0.0738780244900878, -0.14292434286590375, 0.20270016550661085, -0.19576387828651895, -0.0950762801407341, 0.1568072597539145, 0.12144843216140008, 0.0523178939483003, -0.11185115934489956, 0.1186412013883468, -0.08905549036712115, 0.20204821649066945, -0.008133717175203224, 0.04895887713621747, 0.30172702515537436, 0.18305087580959847, 0.07187932756843363, 0.1726567021080669, -0.15672499815444627, -0.13687465011149624, -0.24292128300624535, -0.12801715255391302, -0.2671666871979238, 0.05488382910332042, -0.07923903255481916, -0.19107295063832866, 0.4098630112906297, 0.05189206983261669, 0.17304030958404568, -0.07000433723442256, 0.15837748472228752, 0.09698865284519072, 0.08268716318222384, 0.06265240857222427, 0.19810946566442436, 0.17440434511592415, 0.0340547269401768, -0.30629956091965505, -0.03400455417725792, 0.1177033391609418] |
1,803.01 | Cognitive Radars: A Reality? | This paper describes some key ideas and applications of cognitive radars,
highlighting the limits and the path forward. Cognitive radars are systems
based on the perception-action cycle of cognition that sense the environment,
learn from it relevant information about the target and the background, then
adapt the radar sensor to optimally satisfy the needs of their mission
according to a desired goal. The concept of cognitive radar was introduced
originally for active radar only. In this paper we describe how this paradigm
can be applied also to passive radar. In particular, we describe (i) cognitive
active radars that work in a spectrally dense environment and change the
transmitted waveform on-the-fly to avoid interference with the primary user of
the channel, such as broadcast or communication systems, (ii) cognitive active
radars that adjust transmit waveform parameters to achieve a specified level of
target tracking performance, and (iii) cognitive passive radars, that contrary
to the active radars cannot directly change the transmitted waveforms, but can
instead select the best source of opportunity to improve detection and tracking
performance.
| eess.SP | this paper describes some key ideas and applications of cognitive radars highlighting the limits and the path forward cognitive radars are systems based on the perceptionaction cycle of cognition that sense the environment learn from it relevant information about the target and the background then adapt the radar sensor to optimally satisfy the needs of their mission according to a desired goal the concept of cognitive radar was introduced originally for active radar only in this paper we describe how this paradigm can be applied also to passive radar in particular we describe i cognitive active radars that work in a spectrally dense environment and change the transmitted waveform onthefly to avoid interference with the primary user of the channel such as broadcast or communication systems ii cognitive active radars that adjust transmit waveform parameters to achieve a specified level of target tracking performance and iii cognitive passive radars that contrary to the active radars cannot directly change the transmitted waveforms but can instead select the best source of opportunity to improve detection and tracking performance | [['this', 'paper', 'describes', 'some', 'key', 'ideas', 'and', 'applications', 'of', 'cognitive', 'radars', 'highlighting', 'the', 'limits', 'and', 'the', 'path', 'forward', 'cognitive', 'radars', 'are', 'systems', 'based', 'on', 'the', 'perceptionaction', 'cycle', 'of', 'cognition', 'that', 'sense', 'the', 'environment', 'learn', 'from', 'it', 'relevant', 'information', 'about', 'the', 'target', 'and', 'the', 'background', 'then', 'adapt', 'the', 'radar', 'sensor', 'to', 'optimally', 'satisfy', 'the', 'needs', 'of', 'their', 'mission', 'according', 'to', 'a', 'desired', 'goal', 'the', 'concept', 'of', 'cognitive', 'radar', 'was', 'introduced', 'originally', 'for', 'active', 'radar', 'only', 'in', 'this', 'paper', 'we', 'describe', 'how', 'this', 'paradigm', 'can', 'be', 'applied', 'also', 'to', 'passive', 'radar', 'in', 'particular', 'we', 'describe', 'i', 'cognitive', 'active', 'radars', 'that', 'work', 'in', 'a', 'spectrally', 'dense', 'environment', 'and', 'change', 'the', 'transmitted', 'waveform', 'onthefly', 'to', 'avoid', 'interference', 'with', 'the', 'primary', 'user', 'of', 'the', 'channel', 'such', 'as', 'broadcast', 'or', 'communication', 'systems', 'ii', 'cognitive', 'active', 'radars', 'that', 'adjust', 'transmit', 'waveform', 'parameters', 'to', 'achieve', 'a', 'specified', 'level', 'of', 'target', 'tracking', 'performance', 'and', 'iii', 'cognitive', 'passive', 'radars', 'that', 'contrary', 'to', 'the', 'active', 'radars', 'can', 'not', 'directly', 'change', 'the', 'transmitted', 'waveforms', 'but', 'can', 'instead', 'select', 'the', 'best', 'source', 'of', 'opportunity', 'to', 'improve', 'detection', 'and', 'tracking', 'performance']] | [-0.11370408236007022, 0.09938887130182321, -0.04128464964602543, 0.03551678378384897, -0.13311146853470618, -0.20101758927938207, 0.0654767979854602, 0.3935454907685013, -0.26359339007360616, -0.3247895371852874, 0.09472299905528056, -0.22766089001946718, -0.23596183984477262, 0.16976137945854688, -0.18378022388886597, 0.051459559494640025, 0.02533905250204485, 0.07303784637696158, -0.009852879128213657, -0.18827163191554322, 0.260294562020197, 0.1408736371293159, 0.31330131801992317, -0.03854582823765606, 0.10870617630465304, 0.02767110493198224, -0.06643688996811792, -0.06367675233327312, -0.045632383992170684, 0.11978849811521543, 0.37642106728491476, 0.24997775152714996, 0.2464907046612668, -0.43522860545212516, -0.2764148515462349, 0.12035412730196607, 0.1722897285967802, 0.054615323237106626, -0.027916609797801684, -0.3210245288716429, 0.08521637226333895, -0.19128608890140883, -0.07053744307019363, 0.02279437456009015, -0.04271732558796214, 0.06300068033614464, -0.2793701647104706, -0.04509768202538486, 0.047004150452965736, 0.02500615815111136, -0.07776551281554508, -0.04971372573452312, 0.04457667177558829, 0.2500112952025197, 0.009617955690923299, 0.027145279700490303, 0.18197038466746177, -0.10605638026586066, -0.12422558842914791, 0.3765203791307443, 0.0023904930988305623, -0.21614075768975763, 0.21945403103149722, -0.10964686923270972, -0.0983405263632757, 0.1386055375372407, 0.26849694540040137, 0.06577377508382581, -0.18636642969976375, 0.002454062279887329, 0.027479414330890118, 0.19832624227208437, 0.06419907480815036, 0.09034862101214838, 0.19592226575126925, 0.1583446199429553, 0.10790555853144092, 0.0924375662415704, -0.14807168690692948, -0.06409407942161216, -0.22237089232115423, -0.12473708833830884, -0.20105755032897837, -0.00773899003297372, -0.03061683152063676, -0.06585891787753648, 0.3989303568299165, 0.22764822648901303, 0.11654428627715567, 0.06293883603092515, 0.38795024168277736, 0.062506041901928, 0.036441163745929754, 0.07722589190481073, 0.2520536242316327, 0.0706071888036121, 0.16087166748751522, -0.20751826101940357, 0.06936837530479172, -0.03910869983482664] |
1,803.01001 | The ASAS-SN Catalog of Variable Stars I: The Serendipitous Survey | The All-Sky Automated Survey for Supernovae (ASAS-SN) is the first optical
survey to routinely monitor the whole sky with a cadence of $\sim2-3$ days down
to V$\lesssim17$ mag. ASAS-SN has monitored the whole sky since 2014,
collecting $\sim100-500$ epochs of observations per field. The V-band light
curves for candidate variables identified during the search for supernovae are
classified using a random forest classifier and visually verified. We present a
catalog of 66,179 bright, new variable stars discovered during our search for
supernovae, including 27,479 periodic variables and 38,700 irregular variables.
V-band light curves for the ASAS-SN variables are available through the ASAS-SN
variable stars database (https://asas-sn.osu.edu/variables). The database will
begin to include the light curves of known variable stars in the near future
along with the results for a systematic, all-sky variability survey.
| astro-ph.SR | the allsky automated survey for supernovae asassn is the first optical survey to routinely monitor the whole sky with a cadence of sim23 days down to vlesssim17 mag asassn has monitored the whole sky since 2014 collecting sim100500 epochs of observations per field the vband light curves for candidate variables identified during the search for supernovae are classified using a random forest classifier and visually verified we present a catalog of 66179 bright new variable stars discovered during our search for supernovae including 27479 periodic variables and 38700 irregular variables vband light curves for the asassn variables are available through the asassn variable stars database httpsasassnosueduvariables the database will begin to include the light curves of known variable stars in the near future along with the results for a systematic allsky variability survey | [['the', 'allsky', 'automated', 'survey', 'for', 'supernovae', 'asassn', 'is', 'the', 'first', 'optical', 'survey', 'to', 'routinely', 'monitor', 'the', 'whole', 'sky', 'with', 'a', 'cadence', 'of', 'sim23', 'days', 'down', 'to', 'vlesssim17', 'mag', 'asassn', 'has', 'monitored', 'the', 'whole', 'sky', 'since', '2014', 'collecting', 'sim100500', 'epochs', 'of', 'observations', 'per', 'field', 'the', 'vband', 'light', 'curves', 'for', 'candidate', 'variables', 'identified', 'during', 'the', 'search', 'for', 'supernovae', 'are', 'classified', 'using', 'a', 'random', 'forest', 'classifier', 'and', 'visually', 'verified', 'we', 'present', 'a', 'catalog', 'of', '66179', 'bright', 'new', 'variable', 'stars', 'discovered', 'during', 'our', 'search', 'for', 'supernovae', 'including', '27479', 'periodic', 'variables', 'and', '38700', 'irregular', 'variables', 'vband', 'light', 'curves', 'for', 'the', 'asassn', 'variables', 'are', 'available', 'through', 'the', 'asassn', 'variable', 'stars', 'database', 'httpsasassnosueduvariables', 'the', 'database', 'will', 'begin', 'to', 'include', 'the', 'light', 'curves', 'of', 'known', 'variable', 'stars', 'in', 'the', 'near', 'future', 'along', 'with', 'the', 'results', 'for', 'a', 'systematic', 'allsky', 'variability', 'survey']] | [-0.06196615514602131, 0.09188647495260037, -0.08861791921823513, 0.0744419141844883, -0.17273396403184088, -0.07270076932517562, 0.16595156735733269, 0.4215113980563607, -0.2049877275236127, -0.3538787333463414, 0.16165965653893605, -0.37277032446673536, -0.016947512694095505, 0.2992578919468893, -0.08172148500410355, 0.001483039241137467, 0.13732491577352127, -0.09361179049060804, -0.0034005974500080733, -0.39180778602127164, 0.20268330229519624, 0.026381502609963962, 0.16255940979999292, -0.1798512854826028, 0.0875815379169337, 0.015140448682244838, -0.20223164774008154, -0.053859991600780976, -0.11220363600845962, 0.01772131239188703, 0.2624368464819882, 0.19490163576033875, 0.19017559575195622, -0.301275832708705, -0.2332681370239089, 0.11389733345053474, 0.17417914290201125, 0.044411611838603586, -0.03814570638021146, -0.34307084641764013, 0.012562222340177216, -0.10420104130134573, -0.21158469880483752, -0.02310150879339909, 0.09887083863388513, 0.12303771643980047, -0.19919773674474692, 0.06548751083910319, -0.036920366497109024, 0.18422796558882074, -0.13908819804760061, -0.07046455588543743, -0.05695856330589956, 0.07844503499626175, -0.013537258094939308, 0.11196390802488024, 0.06146112834946729, -0.156323521674838, -0.047005460679157104, 0.3828389139068643, -0.08287583275122465, 0.09509525037788617, 0.09766662327616703, -0.14306667644354537, -0.19017870233240208, 0.15909157511063185, 0.22134877250375828, 0.1501604347759271, -0.2752694971107797, -0.0472482380349057, 0.021679136156852498, 0.21865859201478619, 0.022344114824462184, 0.04595315469223566, 0.32224353306237463, 0.15262091125354288, -0.001806356658147076, 0.12435562888574676, -0.32401096449035593, 0.004312795124889359, -0.29747919516461924, -0.0826609043521792, -0.11185922783132143, 0.04601142043018655, -0.0888443711746803, -0.12995905934935656, 0.4210043559510877, 0.11144395403959971, 0.13960620649268954, 0.0418555201086267, 0.28138715239593715, 0.026309300321300962, 0.13540226985575762, 0.08534254692128207, 0.3391916253145667, 0.10857573991428739, 0.15565765579781077, -0.1330095827689497, 0.048282171841564143, 0.009849646066381472] |
1,803.01002 | Majorana Superconducting Qubit | We propose a platform for universal quantum computation that uses
conventional $s$-wave superconducting leads to address a topological qubit
stored in spatially separated Majorana bound states in a multi-terminal
topological superconductor island. Both the manipulation and read-out of this
"Majorana superconducting qubit" are realized by tunnel couplings between
Majorana bound states and the superconducting leads. The ability of turning on
and off tunnel couplings on-demand by local gates enables individual qubit
addressability while avoiding cross-talk errors. By combining the scalability
of superconducting qubit and the robustness of topological qubits, the Majorana
superconducting qubit may provide a promising and realistic route towards
quantum computation.
| cond-mat.mes-hall | we propose a platform for universal quantum computation that uses conventional swave superconducting leads to address a topological qubit stored in spatially separated majorana bound states in a multiterminal topological superconductor island both the manipulation and readout of this majorana superconducting qubit are realized by tunnel couplings between majorana bound states and the superconducting leads the ability of turning on and off tunnel couplings ondemand by local gates enables individual qubit addressability while avoiding crosstalk errors by combining the scalability of superconducting qubit and the robustness of topological qubits the majorana superconducting qubit may provide a promising and realistic route towards quantum computation | [['we', 'propose', 'a', 'platform', 'for', 'universal', 'quantum', 'computation', 'that', 'uses', 'conventional', 'swave', 'superconducting', 'leads', 'to', 'address', 'a', 'topological', 'qubit', 'stored', 'in', 'spatially', 'separated', 'majorana', 'bound', 'states', 'in', 'a', 'multiterminal', 'topological', 'superconductor', 'island', 'both', 'the', 'manipulation', 'and', 'readout', 'of', 'this', 'majorana', 'superconducting', 'qubit', 'are', 'realized', 'by', 'tunnel', 'couplings', 'between', 'majorana', 'bound', 'states', 'and', 'the', 'superconducting', 'leads', 'the', 'ability', 'of', 'turning', 'on', 'and', 'off', 'tunnel', 'couplings', 'ondemand', 'by', 'local', 'gates', 'enables', 'individual', 'qubit', 'addressability', 'while', 'avoiding', 'crosstalk', 'errors', 'by', 'combining', 'the', 'scalability', 'of', 'superconducting', 'qubit', 'and', 'the', 'robustness', 'of', 'topological', 'qubits', 'the', 'majorana', 'superconducting', 'qubit', 'may', 'provide', 'a', 'promising', 'and', 'realistic', 'route', 'towards', 'quantum', 'computation']] | [-0.28159406682639154, 0.2794656357411476, 0.022075343452104667, 0.008408359980359855, -0.014467821483617848, -0.3440633816734969, 0.19043797229244872, 0.3435238123084735, -0.1634404729798581, -0.3422313651015747, -0.06529602504932114, -0.28040740884912824, -0.042575736774258244, 0.24116574075000669, -0.006962404612317434, 0.13789648997588355, 0.028398339519078292, -0.0597155586230338, -0.12482129549155536, -0.24573986901725345, 0.3069450760133637, -0.015910884919259877, 0.3975317270576375, 0.0713824861800497, 0.05748055231513329, -0.0301863975976639, 0.1281293494021068, -0.09768731770946563, -0.07152306711906171, 0.125303306480083, 0.29564487127569117, -0.039745941997767945, 0.17820712540172112, -0.5542032142866005, -0.15816295629783164, 0.04060761366961795, 0.19180944286630425, 0.20829221744370618, -0.050382727095902476, -0.40674271111747307, 0.04715538206419826, -0.18878100984232518, -0.04657129886180379, -0.15103731941865775, -0.056533660034386854, -0.09015393525744038, -0.20423374039310854, 0.03769115086427881, 0.05131115482383163, -0.0009562009402993814, 0.08311714509104207, -0.0074259696926162085, 0.008912222025897896, 0.07783852436227127, -0.11407331085212312, -0.012829657101515428, 0.18209455218573, -0.09949686908325886, -0.20113622728120356, 0.24192609144510357, -0.005949712735917238, -0.1406523710121265, 0.12886837202585438, -0.018213378138912533, -0.0018917013511278676, 0.03687261562179593, 0.08565472959070602, 0.015252682950022151, -0.14082501681286444, 0.10014056296989737, 0.06017292578460522, 0.18401656900216073, 0.03873609237427127, 0.21410333334007164, 0.3082965815494072, 0.22549285040264136, 0.18266779727763632, 0.2042297565398593, -0.12930520155322422, -0.09056659620164813, -0.29933034930631375, -0.2146555702394164, -0.25784436678423467, 0.09983840005390925, -0.04080559109330281, -0.17449604110448685, 0.4617405412989913, 0.1434839680334282, 0.16219283590653857, -0.05562902195379138, 0.30733755997662404, 0.08203834798458276, 0.1077189978813409, 0.06249210463601698, 0.20977435432808492, 0.2163497610085472, 0.06841187830788345, -0.3575597458984703, 0.052045068970329844, -0.007826874249623817] |
1,803.01003 | Modeling microlensing events with MulensModel | We introduce MulensModel, a software package for gravitational microlensing
modeling. The package provides a framework for calculating microlensing model
magnification curves and goodness-of-fit statistics for microlensing events
with single and binary lenses as well as a variety of higher-order effects:
extended sources with limb-darkening, annual microlensing parallax, satellite
microlensing parallax, and binary lens orbital motion. The software could also
be used for analysis of the planned microlensing survey by the NASA flag-ship
WFIRST satellite. MulensModel is available at
https://github.com/rpoleski/MulensModel/.
| astro-ph.IM astro-ph.EP astro-ph.SR | we introduce mulensmodel a software package for gravitational microlensing modeling the package provides a framework for calculating microlensing model magnification curves and goodnessoffit statistics for microlensing events with single and binary lenses as well as a variety of higherorder effects extended sources with limbdarkening annual microlensing parallax satellite microlensing parallax and binary lens orbital motion the software could also be used for analysis of the planned microlensing survey by the nasa flagship wfirst satellite mulensmodel is available at httpsgithubcomrpoleskimulensmodel | [['we', 'introduce', 'mulensmodel', 'a', 'software', 'package', 'for', 'gravitational', 'microlensing', 'modeling', 'the', 'package', 'provides', 'a', 'framework', 'for', 'calculating', 'microlensing', 'model', 'magnification', 'curves', 'and', 'goodnessoffit', 'statistics', 'for', 'microlensing', 'events', 'with', 'single', 'and', 'binary', 'lenses', 'as', 'well', 'as', 'a', 'variety', 'of', 'higherorder', 'effects', 'extended', 'sources', 'with', 'limbdarkening', 'annual', 'microlensing', 'parallax', 'satellite', 'microlensing', 'parallax', 'and', 'binary', 'lens', 'orbital', 'motion', 'the', 'software', 'could', 'also', 'be', 'used', 'for', 'analysis', 'of', 'the', 'planned', 'microlensing', 'survey', 'by', 'the', 'nasa', 'flagship', 'wfirst', 'satellite', 'mulensmodel', 'is', 'available', 'at', 'httpsgithubcomrpoleskimulensmodel']] | [-0.10116817451719391, 0.0048627334058676894, -0.1440749502262885, 0.14968011580487273, -0.22522216956866414, -0.09440887877166174, -0.030754672035599423, 0.34952566204102414, -0.18366798832139944, -0.40320932811224147, 0.07304365322680066, -0.3247013746050039, -0.1108634744672791, 0.34154029021125387, -0.07606316060072889, 0.12859419870533442, 0.1805665577795528, -0.16241162602397563, 0.014277891859436702, -0.28443125399184954, 0.22290578839908304, 0.14986395511445344, 0.08129406352772524, -0.05998644002370144, 0.08723083366394828, 0.1008306820754354, -0.18187686992735652, 0.05824903895202289, -0.1757511692121625, 0.05993277023509635, 0.289084771957469, 0.25517426021887285, 0.1513382912196807, -0.20584725159661552, -0.22761154571842207, 0.06469911711878683, 0.11308882015414144, 0.07012133143143728, -0.0526245860505457, -0.38400567971525323, 0.021578419487923384, -0.29114922917889136, -0.14682917958309286, -0.018626645526015444, 0.09265212136271753, 0.094102185856747, -0.23546624876632305, 0.04366511238492278, -0.036924105865182355, 0.18800044386941744, -0.08376275706962731, -0.061430932659851875, -0.01086821480298807, 0.07239112011034433, -0.01845915801057249, 0.06502243285802634, 0.1338581961493841, -0.07542533581880362, -0.11996952869537238, 0.486334401918085, -0.1100334587114814, -0.07940551955375429, 0.10194383836106251, -0.15842576956646026, -0.1847503442243722, 0.11242455681694034, 0.2898862609443696, 0.10061482461414446, -0.23844999452979354, -0.0034256311475090975, 0.08427081273035392, 0.24890035302623323, 0.07268688554483417, 0.013041804710059966, 0.4487283628335909, 0.15884809456398025, 0.06248184494478138, 0.07306236475951185, -0.32693707641508235, 0.0017242048848665466, -0.3010351060840644, -0.09465961438438267, -0.12347887065506687, 0.032042996723535715, -0.10980222052469464, -0.15265151876021837, 0.3203040918849997, 0.15256333981003417, 0.06493394068552573, 0.07301989605797357, 0.3978669551556538, 0.042029588788098315, 0.115499250027106, -0.013024754620059148, 0.30831893127852755, 0.06195966510016373, 0.07548346316539928, -0.1886654537551007, 0.09719404600266564, 0.025500102679392223] |
1,803.01004 | VISION - Vienna Survey in Orion II. Infrared extinction in Orion A | We have investigated the shape of the extinction curve in the infrared up to
~25 {\mu}m for the Orion A star-forming complex. The basis of this work is
near-infrared data acquired with VISTA, in combination with Pan-STARRS and
mid-infrared Spitzer photometry. We obtain colour excess ratios for eight
passbands by fitting a series of colour-colour diagrams. The fits are performed
using Markov chain Monte Carlo methods, together with a linear model under a
Bayesian formalism. The resulting colour excess ratios are directly interpreted
as a measure of the extinction law. We show that the Orion A molecular cloud is
characterized by flat mid-infrared extinction, similar to many other recently
studied sightlines. Moreover, we find statistically significant evidence that
the extinction law from ~1 {\mu}m to at least ~6 {\mu}m varies across the
cloud. In particular, we find a gradient along galactic longitude, where
regions near the ONC show a different extinction law compared to L1641 and
L1647, the low-mass star-forming sites in the cloud complex. These variations
are of the order of only 3% and are most likely caused by the influence of the
massive stars on their surrounding medium. While the observed general trends in
our measurements are in agreement with model predictions, both well-established
and new dust grain models are not able to fully reproduce our infrared
extinction curve. We also present a new extinction map featuring a resolution
of 1 arcmin and revisit the correlation between extinction and dust optical
depth. This analysis shows that cloud substructure, which is not sampled by
background sources, affects the conversion factor between these two measures.
In conclusion, we argue that specific characteristics of the infrared
extinction law are still not well understood, but Orion A can serve as an
unbiased template for future studies.
| astro-ph.GA | we have investigated the shape of the extinction curve in the infrared up to 25 mum for the orion a starforming complex the basis of this work is nearinfrared data acquired with vista in combination with panstarrs and midinfrared spitzer photometry we obtain colour excess ratios for eight passbands by fitting a series of colourcolour diagrams the fits are performed using markov chain monte carlo methods together with a linear model under a bayesian formalism the resulting colour excess ratios are directly interpreted as a measure of the extinction law we show that the orion a molecular cloud is characterized by flat midinfrared extinction similar to many other recently studied sightlines moreover we find statistically significant evidence that the extinction law from 1 mum to at least 6 mum varies across the cloud in particular we find a gradient along galactic longitude where regions near the onc show a different extinction law compared to l1641 and l1647 the lowmass starforming sites in the cloud complex these variations are of the order of only 3 and are most likely caused by the influence of the massive stars on their surrounding medium while the observed general trends in our measurements are in agreement with model predictions both wellestablished and new dust grain models are not able to fully reproduce our infrared extinction curve we also present a new extinction map featuring a resolution of 1 arcmin and revisit the correlation between extinction and dust optical depth this analysis shows that cloud substructure which is not sampled by background sources affects the conversion factor between these two measures in conclusion we argue that specific characteristics of the infrared extinction law are still not well understood but orion a can serve as an unbiased template for future studies | [['we', 'have', 'investigated', 'the', 'shape', 'of', 'the', 'extinction', 'curve', 'in', 'the', 'infrared', 'up', 'to', '25', 'mum', 'for', 'the', 'orion', 'a', 'starforming', 'complex', 'the', 'basis', 'of', 'this', 'work', 'is', 'nearinfrared', 'data', 'acquired', 'with', 'vista', 'in', 'combination', 'with', 'panstarrs', 'and', 'midinfrared', 'spitzer', 'photometry', 'we', 'obtain', 'colour', 'excess', 'ratios', 'for', 'eight', 'passbands', 'by', 'fitting', 'a', 'series', 'of', 'colourcolour', 'diagrams', 'the', 'fits', 'are', 'performed', 'using', 'markov', 'chain', 'monte', 'carlo', 'methods', 'together', 'with', 'a', 'linear', 'model', 'under', 'a', 'bayesian', 'formalism', 'the', 'resulting', 'colour', 'excess', 'ratios', 'are', 'directly', 'interpreted', 'as', 'a', 'measure', 'of', 'the', 'extinction', 'law', 'we', 'show', 'that', 'the', 'orion', 'a', 'molecular', 'cloud', 'is', 'characterized', 'by', 'flat', 'midinfrared', 'extinction', 'similar', 'to', 'many', 'other', 'recently', 'studied', 'sightlines', 'moreover', 'we', 'find', 'statistically', 'significant', 'evidence', 'that', 'the', 'extinction', 'law', 'from', '1', 'mum', 'to', 'at', 'least', '6', 'mum', 'varies', 'across', 'the', 'cloud', 'in', 'particular', 'we', 'find', 'a', 'gradient', 'along', 'galactic', 'longitude', 'where', 'regions', 'near', 'the', 'onc', 'show', 'a', 'different', 'extinction', 'law', 'compared', 'to', 'l1641', 'and', 'l1647', 'the', 'lowmass', 'starforming', 'sites', 'in', 'the', 'cloud', 'complex', 'these', 'variations', 'are', 'of', 'the', 'order', 'of', 'only', '3', 'and', 'are', 'most', 'likely', 'caused', 'by', 'the', 'influence', 'of', 'the', 'massive', 'stars', 'on', 'their', 'surrounding', 'medium', 'while', 'the', 'observed', 'general', 'trends', 'in', 'our', 'measurements', 'are', 'in', 'agreement', 'with', 'model', 'predictions', 'both', 'wellestablished', 'and', 'new', 'dust', 'grain', 'models', 'are', 'not', 'able', 'to', 'fully', 'reproduce', 'our', 'infrared', 'extinction', 'curve', 'we', 'also', 'present', 'a', 'new', 'extinction', 'map', 'featuring', 'a', 'resolution', 'of', '1', 'arcmin', 'and', 'revisit', 'the', 'correlation', 'between', 'extinction', 'and', 'dust', 'optical', 'depth', 'this', 'analysis', 'shows', 'that', 'cloud', 'substructure', 'which', 'is', 'not', 'sampled', 'by', 'background', 'sources', 'affects', 'the', 'conversion', 'factor', 'between', 'these', 'two', 'measures', 'in', 'conclusion', 'we', 'argue', 'that', 'specific', 'characteristics', 'of', 'the', 'infrared', 'extinction', 'law', 'are', 'still', 'not', 'well', 'understood', 'but', 'orion', 'a', 'can', 'serve', 'as', 'an', 'unbiased', 'template', 'for', 'future', 'studies']] | [-0.029321541425648048, 0.08008115829343855, -0.10601495410579515, 0.07893238562189436, -0.026093074919992847, -0.09258131433036751, 0.059684719510516314, 0.48349569530668113, -0.22151615174126466, -0.32369946415493195, 0.062340649353807516, -0.2970100800624378, -0.09837063459064926, 0.16780134620134632, -0.06544670410161844, -0.002207657655640648, 0.025806259312635166, -0.10558299789580265, -0.01240643031526446, -0.23160833502092967, 0.2741273793323544, 0.046318041200434895, 0.21402278743881364, -0.005656450542060296, 0.053732685273141303, -0.07953054891937371, -0.11654082712647426, 0.02026158258550937, -0.15319298394779285, 0.10256771211656018, 0.21917337843164758, 0.09236075724522765, 0.1748846111435335, -0.3391233292748395, -0.2432009305092967, 0.09502183992110523, 0.1830828623105565, 0.04877450933867474, -0.04068340482579627, -0.2327374106804672, 0.057699919157580444, -0.14807605832249385, -0.1774851525498001, 0.003294794963284971, 0.031892056831193664, 0.04647234866952638, -0.25012346479402847, 0.09944304463256122, -0.022287860636300574, 0.13758565497556033, -0.09542121439250409, -0.12538026134148175, -0.06712342403056704, 0.11114411466713651, -0.010880816000380232, 0.07094294269038397, 0.1603644456008748, -0.15270409807276755, -0.05648544303172526, 0.38211024941641314, -0.09284657606840731, -0.06440935026752562, 0.20610922995681394, -0.20217706918129982, -0.17404784372874216, 0.15338112401168907, 0.12705543270150244, 0.11170978801702022, -0.19679006360592036, 0.0268477363000964, -0.029668092467415277, 0.19796574995741756, 0.04621040595714448, 0.0690470331804356, 0.2577620232477784, 0.11511549952125284, 0.019549603089841192, 0.13410059915582964, -0.2293654875901334, -0.1030305310632436, -0.2764617200088989, -0.10706151422784306, -0.12750399856726438, 0.0615121247077503, -0.14564679342978826, -0.1213371333713427, 0.31644363829996375, 0.13260861154070472, 0.24193862811835093, 0.07312834887467753, 0.31517407668709957, 0.09530728042035112, 0.125783105351034, 0.09519527468881205, 0.29456986391395584, 0.09352156707326446, 0.0945889659078137, -0.19839286673559772, 0.08274196601256652, -0.019273679566795304] |
1,803.01005 | Production of Cool Gas in Thermally-Driven Outflows | Galactic outflows commonly contain multiphase gas, and its physical origin
requires explanation. Using the CGOLS (Cholla Galactic OutfLow Simulations)
suite of high-resolution isolated galaxy models, we demonstrate the viability
of rapid radiative cooling as a source of fast-moving ($v \sim 1000$ km/s),
cool ($10^4$ K) gas observed in absorption line studies of outflows around some
star-forming galaxies. By varying the mass-loading and geometry of the
simulated winds, we identify a region of parameter space that leads to cool gas
in outflows. In particular, when using an analytically-motivated central
feedback model, we find that cooling flows can be produced with reasonable
mass-loading rates ($\dot{M}_{wind} / \dot{M}_{SFR} \sim 0.5$), provided the
star formation rate surface density is high. When a more realistic clustered
feedback model is applied, destruction of high density clouds near the disk and
interactions between different outflow regions indicate that lower mass-loading
rates of the hot gas within the feedback region may still produce multiphase
outflows. These results suggest an origin for fast-moving cool gas in outflows
that does not rely on directly accelerating cool gas from the interstellar
medium. These cooling flows may additionally provide an explanation for the
multiphase gas ubiquitously observed in the halos of star-forming galaxies at
low redshift.
| astro-ph.GA | galactic outflows commonly contain multiphase gas and its physical origin requires explanation using the cgols cholla galactic outflow simulations suite of highresolution isolated galaxy models we demonstrate the viability of rapid radiative cooling as a source of fastmoving v sim 1000 kms cool 104 k gas observed in absorption line studies of outflows around some starforming galaxies by varying the massloading and geometry of the simulated winds we identify a region of parameter space that leads to cool gas in outflows in particular when using an analyticallymotivated central feedback model we find that cooling flows can be produced with reasonable massloading rates dotm_wind dotm_sfr sim 05 provided the star formation rate surface density is high when a more realistic clustered feedback model is applied destruction of high density clouds near the disk and interactions between different outflow regions indicate that lower massloading rates of the hot gas within the feedback region may still produce multiphase outflows these results suggest an origin for fastmoving cool gas in outflows that does not rely on directly accelerating cool gas from the interstellar medium these cooling flows may additionally provide an explanation for the multiphase gas ubiquitously observed in the halos of starforming galaxies at low redshift | [['galactic', 'outflows', 'commonly', 'contain', 'multiphase', 'gas', 'and', 'its', 'physical', 'origin', 'requires', 'explanation', 'using', 'the', 'cgols', 'cholla', 'galactic', 'outflow', 'simulations', 'suite', 'of', 'highresolution', 'isolated', 'galaxy', 'models', 'we', 'demonstrate', 'the', 'viability', 'of', 'rapid', 'radiative', 'cooling', 'as', 'a', 'source', 'of', 'fastmoving', 'v', 'sim', '1000', 'kms', 'cool', '104', 'k', 'gas', 'observed', 'in', 'absorption', 'line', 'studies', 'of', 'outflows', 'around', 'some', 'starforming', 'galaxies', 'by', 'varying', 'the', 'massloading', 'and', 'geometry', 'of', 'the', 'simulated', 'winds', 'we', 'identify', 'a', 'region', 'of', 'parameter', 'space', 'that', 'leads', 'to', 'cool', 'gas', 'in', 'outflows', 'in', 'particular', 'when', 'using', 'an', 'analyticallymotivated', 'central', 'feedback', 'model', 'we', 'find', 'that', 'cooling', 'flows', 'can', 'be', 'produced', 'with', 'reasonable', 'massloading', 'rates', 'dotm_wind', 'dotm_sfr', 'sim', '05', 'provided', 'the', 'star', 'formation', 'rate', 'surface', 'density', 'is', 'high', 'when', 'a', 'more', 'realistic', 'clustered', 'feedback', 'model', 'is', 'applied', 'destruction', 'of', 'high', 'density', 'clouds', 'near', 'the', 'disk', 'and', 'interactions', 'between', 'different', 'outflow', 'regions', 'indicate', 'that', 'lower', 'massloading', 'rates', 'of', 'the', 'hot', 'gas', 'within', 'the', 'feedback', 'region', 'may', 'still', 'produce', 'multiphase', 'outflows', 'these', 'results', 'suggest', 'an', 'origin', 'for', 'fastmoving', 'cool', 'gas', 'in', 'outflows', 'that', 'does', 'not', 'rely', 'on', 'directly', 'accelerating', 'cool', 'gas', 'from', 'the', 'interstellar', 'medium', 'these', 'cooling', 'flows', 'may', 'additionally', 'provide', 'an', 'explanation', 'for', 'the', 'multiphase', 'gas', 'ubiquitously', 'observed', 'in', 'the', 'halos', 'of', 'starforming', 'galaxies', 'at', 'low', 'redshift']] | [-0.08552769221331522, 0.13801426352222565, -0.019899731268228766, 0.09978045405815332, -0.06889423229216818, -0.057470566746380986, 0.031964946784495595, 0.4365372364245467, -0.1794698000768546, -0.33111830765203615, 0.026011289443104674, -0.24945740419996892, 0.025083014549659426, 0.23089659203021745, 0.012853944947037508, -0.06180177139493885, 0.01816301170652311, -0.13969123873133657, -0.028996496679171823, -0.23128312016046376, 0.30847022194595514, 0.11985114768461029, 0.15151611134648585, 0.03378462131210046, 0.08443257285559307, -0.21638421996276658, -0.035063657553950744, -0.029864594245115388, -0.1650375520950008, -0.009455329926635359, 0.21815170615235588, 0.11714641540428278, 0.2652085956827218, -0.42773831719719807, -0.31578310245610586, 0.0656666802499799, 0.25915834889864203, 0.05350241366184162, -0.13891649695007124, -0.2071878178508475, 0.046943964531128035, -0.21611872685829822, -0.1742315053794739, 0.01133740408785978, -0.004616525159896019, 0.042094846114570886, -0.25846998350713496, 0.17623881806137423, 0.024356754072274937, 0.08330989643889268, -0.1066571133540026, -0.022620468318518532, -0.07727354874216656, 0.030185181146485253, -0.009552181467891264, 0.07436288138570722, 0.3038312341203567, -0.18659808980207424, 0.018695711813417813, 0.4439398564033248, -0.06323554697703926, -0.005371136632958549, 0.29770759413552345, -0.24933671817094574, -0.155066686647303, 0.23793080864338456, 0.1990264196205655, 0.09073027830346296, -0.11975257238914287, -0.06866027651680516, -0.07423645881444553, 0.18822799337999754, -0.0016303238278750948, 0.03701184967062705, 0.33834441765749723, 0.10024849645180356, 0.007544702850282192, 0.09194262836411614, -0.19176806016338419, -0.07348889945982838, -0.23412409462689904, -0.09688034540875323, -0.08730444865741173, 0.07523006335874591, -0.16421636151614652, -0.0855424680861752, 0.24162821372825857, 0.13782866637107807, 0.26547096165636525, -0.030562162860273266, 0.34009049812696834, 0.06204831302832887, 0.07341595690805072, 0.2156179945485376, 0.284421510774035, 0.1671310134873206, 0.07474880613826553, -0.2793584145926145, 0.10069554191007836, 0.002292651892522696] |
1,803.01006 | Identification of the Central Compact Object in the young supernova
remnant 1E0102.2-7219 | Oxygen-rich young supernova remnants are valuable objects for probing the
outcome of nucleosynthetic processes in massive stars, as well as the physics
of supernova explosions. Observed within a few thousand years after the
supernova explosion, these systems contain fast-moving oxygen-rich and
hydrogen-poor filaments visible at optical wavelengths: fragments of the
progenitor's interior expelled at a few 1000 km/s during the supernova
explosion. Here we report the first identification of the compact object in
1E0102.2-7219 in reprocessed Chandra X-ray Observatory data, enabled via the
discovery of a ring-shaped structure visible primarily in optical recombination
lines of Ne I and O I. The optical ring, discovered in integral field
spectroscopy observations from the Multi Unit Spectroscopic Explorer (MUSE) at
the Very Large Telescope, has a radius of $(2.10\pm0.35)$ arcsec =
$(0.63\pm0.11)$ pc, and is expanding at a velocity of $90.5_{-30}^{+40}$ km/s.
It surrounds an X-ray point source with an intrinsic X-ray luminosity $L_{i}$
(1.2--2.0 keV)= $(1.4\pm0.2)\times10^{33}$ erg/s. The energy distribution of
the source indicates that this object is an isolated neutron star: a Central
Compact Object akin to those present in the Cas A and Puppis A supernova
remnants, and the first of its kind to be identified outside of our Galaxy.
| astro-ph.SR astro-ph.GA astro-ph.HE | oxygenrich young supernova remnants are valuable objects for probing the outcome of nucleosynthetic processes in massive stars as well as the physics of supernova explosions observed within a few thousand years after the supernova explosion these systems contain fastmoving oxygenrich and hydrogenpoor filaments visible at optical wavelengths fragments of the progenitors interior expelled at a few 1000 kms during the supernova explosion here we report the first identification of the compact object in 1e010227219 in reprocessed chandra xray observatory data enabled via the discovery of a ringshaped structure visible primarily in optical recombination lines of ne i and o i the optical ring discovered in integral field spectroscopy observations from the multi unit spectroscopic explorer muse at the very large telescope has a radius of 210pm035 arcsec 063pm011 pc and is expanding at a velocity of 905_3040 kms it surrounds an xray point source with an intrinsic xray luminosity l_i 1220 kev 14pm02times1033 ergs the energy distribution of the source indicates that this object is an isolated neutron star a central compact object akin to those present in the cas a and puppis a supernova remnants and the first of its kind to be identified outside of our galaxy | [['oxygenrich', 'young', 'supernova', 'remnants', 'are', 'valuable', 'objects', 'for', 'probing', 'the', 'outcome', 'of', 'nucleosynthetic', 'processes', 'in', 'massive', 'stars', 'as', 'well', 'as', 'the', 'physics', 'of', 'supernova', 'explosions', 'observed', 'within', 'a', 'few', 'thousand', 'years', 'after', 'the', 'supernova', 'explosion', 'these', 'systems', 'contain', 'fastmoving', 'oxygenrich', 'and', 'hydrogenpoor', 'filaments', 'visible', 'at', 'optical', 'wavelengths', 'fragments', 'of', 'the', 'progenitors', 'interior', 'expelled', 'at', 'a', 'few', '1000', 'kms', 'during', 'the', 'supernova', 'explosion', 'here', 'we', 'report', 'the', 'first', 'identification', 'of', 'the', 'compact', 'object', 'in', '1e010227219', 'in', 'reprocessed', 'chandra', 'xray', 'observatory', 'data', 'enabled', 'via', 'the', 'discovery', 'of', 'a', 'ringshaped', 'structure', 'visible', 'primarily', 'in', 'optical', 'recombination', 'lines', 'of', 'ne', 'i', 'and', 'o', 'i', 'the', 'optical', 'ring', 'discovered', 'in', 'integral', 'field', 'spectroscopy', 'observations', 'from', 'the', 'multi', 'unit', 'spectroscopic', 'explorer', 'muse', 'at', 'the', 'very', 'large', 'telescope', 'has', 'a', 'radius', 'of', '210pm035', 'arcsec', '063pm011', 'pc', 'and', 'is', 'expanding', 'at', 'a', 'velocity', 'of', '905_3040', 'kms', 'it', 'surrounds', 'an', 'xray', 'point', 'source', 'with', 'an', 'intrinsic', 'xray', 'luminosity', 'l_i', '1220', 'kev', '14pm02times1033', 'ergs', 'the', 'energy', 'distribution', 'of', 'the', 'source', 'indicates', 'that', 'this', 'object', 'is', 'an', 'isolated', 'neutron', 'star', 'a', 'central', 'compact', 'object', 'akin', 'to', 'those', 'present', 'in', 'the', 'cas', 'a', 'and', 'puppis', 'a', 'supernova', 'remnants', 'and', 'the', 'first', 'of', 'its', 'kind', 'to', 'be', 'identified', 'outside', 'of', 'our', 'galaxy']] | [-0.058150441314165406, 0.08874017818292114, -0.060526783422877393, 0.08039595768428766, -0.12240375181277975, -0.06372878601631293, 0.05622363937750029, 0.43726175259321165, -0.21208296009363273, -0.30981077402352525, 0.08330054096519374, -0.31919220707928525, 0.019778194311910715, 0.2070180395492711, 0.004991520006352892, -0.08205985634211595, 0.1370628669284857, -0.04482824883352105, -0.04494925422761112, -0.22799251406059529, 0.2889912300528242, 0.11669195250440867, 0.1201471479740949, -0.034034005796106964, 0.110070761712268, -0.10933240048993283, -0.05810485606631025, -0.0751771429565568, -0.10572067754099128, 0.057372549649041434, 0.23073777405445117, 0.1743587437309683, 0.20874206343880639, -0.38260110104695344, -0.22749772862223788, 0.040988265933134614, 0.22556766885547683, 0.0021591422909972235, -0.08429675608431586, -0.2941797319942942, 0.049168163600067295, -0.22393065837856668, -0.2188491427626174, 0.13109061394352467, 0.06924849845146618, 0.052080730545836, -0.17295963283216295, 0.10001028648947771, -0.019551664002788946, 0.10171516437429744, -0.1393432493112647, -0.06833267649635673, -0.02403391003429603, 0.04014200257041897, -0.013237663344121896, 0.05390924457580042, 0.13783714744286277, -0.16899894593068612, -0.014922217136392227, 0.4035621252651207, -0.030411489806973783, 0.09145509310735342, 0.23045411039239322, -0.21287474321404423, -0.19080363419862129, 0.22973312571262702, 0.13591546018440753, 0.1614652830408886, -0.17562533916953282, 0.00916752439344493, -0.04010407158161681, 0.1964585856115147, 0.04768402168097404, 0.10377966880522972, 0.36917383490989986, 0.16480220703808113, -0.02368512990129276, 0.1195191144808912, -0.29376545939236304, 0.008649870648215978, -0.28456673992988774, -0.118242683653266, -0.1496630581537596, 0.14750405436930938, -0.11279180741664441, -0.14005593077207987, 0.31624414175211524, 0.05972890761943582, 0.19661555021332625, -0.07144677126302551, 0.28761663450501285, 0.024624332503821605, 0.12776697470496098, 0.11637970334850252, 0.3204468768615371, 0.170940122496671, 0.1587000547717206, -0.2093221822550568, 0.04218286992265628, 0.025563787302384393] |
1,803.01007 | Sowing black hole seeds: Direct collapse black hole formation with
realistic Lyman-Werner radiation in cosmological simulations | We study the birth of supermassive black holes from the direct collapse
process and characterize the sites where these black hole seeds form. In the
pre-reionization epoch, molecular hydrogen (H$_2$) is an efficient coolant,
causing gas to fragment and form Population III stars, but Lyman-Werner
radiation can suppress H$_2$ formation and allow gas to collapse directly into
a massive black hole. The critical flux required to inhibit H$_2$ formation,
$J_{\rm crit}$, is hotly debated, largely due to the uncertainties in the
source radiation spectrum, H$_2$ self-shielding, and collisional dissociation
rates. Here, we test the power of the direct collapse model in a
self-consistent, time-dependant, non-uniform Lyman-Werner radiation field --
the first time such has been done in a cosmological volume -- using an updated
version of the SPH+N-body tree code Gasoline with H$_2$ non-equilibrium
abundance tracking, H$_2$ cooling, and a modern SPH implementation. We vary
$J_{\rm crit} $ from $30$ to $10^3$ in units of $J_{21}$ to study how this
parameter impacts the number of seed black holes and the type of galaxies which
host them. We focus on black hole formation as a function of environment, halo
mass, metallicity, and proximity of the Lyman-Werner source. Massive black hole
seeds form more abundantly with lower $J_{\rm crit}$ thresholds, but regardless
of $J_{\rm crit}$, these seeds typically form in halos that have recently begun
star formation. Our results do not confirm the proposed atomic cooling halo
pair scenario; rather black hole seeds predominantly form in low-metallicity
pockets of halos which already host star formation.
| astro-ph.GA | we study the birth of supermassive black holes from the direct collapse process and characterize the sites where these black hole seeds form in the prereionization epoch molecular hydrogen h_2 is an efficient coolant causing gas to fragment and form population iii stars but lymanwerner radiation can suppress h_2 formation and allow gas to collapse directly into a massive black hole the critical flux required to inhibit h_2 formation j_rm crit is hotly debated largely due to the uncertainties in the source radiation spectrum h_2 selfshielding and collisional dissociation rates here we test the power of the direct collapse model in a selfconsistent timedependant nonuniform lymanwerner radiation field the first time such has been done in a cosmological volume using an updated version of the sphnbody tree code gasoline with h_2 nonequilibrium abundance tracking h_2 cooling and a modern sph implementation we vary j_rm crit from 30 to 103 in units of j_21 to study how this parameter impacts the number of seed black holes and the type of galaxies which host them we focus on black hole formation as a function of environment halo mass metallicity and proximity of the lymanwerner source massive black hole seeds form more abundantly with lower j_rm crit thresholds but regardless of j_rm crit these seeds typically form in halos that have recently begun star formation our results do not confirm the proposed atomic cooling halo pair scenario rather black hole seeds predominantly form in lowmetallicity pockets of halos which already host star formation | [['we', 'study', 'the', 'birth', 'of', 'supermassive', 'black', 'holes', 'from', 'the', 'direct', 'collapse', 'process', 'and', 'characterize', 'the', 'sites', 'where', 'these', 'black', 'hole', 'seeds', 'form', 'in', 'the', 'prereionization', 'epoch', 'molecular', 'hydrogen', 'h_2', 'is', 'an', 'efficient', 'coolant', 'causing', 'gas', 'to', 'fragment', 'and', 'form', 'population', 'iii', 'stars', 'but', 'lymanwerner', 'radiation', 'can', 'suppress', 'h_2', 'formation', 'and', 'allow', 'gas', 'to', 'collapse', 'directly', 'into', 'a', 'massive', 'black', 'hole', 'the', 'critical', 'flux', 'required', 'to', 'inhibit', 'h_2', 'formation', 'j_rm', 'crit', 'is', 'hotly', 'debated', 'largely', 'due', 'to', 'the', 'uncertainties', 'in', 'the', 'source', 'radiation', 'spectrum', 'h_2', 'selfshielding', 'and', 'collisional', 'dissociation', 'rates', 'here', 'we', 'test', 'the', 'power', 'of', 'the', 'direct', 'collapse', 'model', 'in', 'a', 'selfconsistent', 'timedependant', 'nonuniform', 'lymanwerner', 'radiation', 'field', 'the', 'first', 'time', 'such', 'has', 'been', 'done', 'in', 'a', 'cosmological', 'volume', 'using', 'an', 'updated', 'version', 'of', 'the', 'sphnbody', 'tree', 'code', 'gasoline', 'with', 'h_2', 'nonequilibrium', 'abundance', 'tracking', 'h_2', 'cooling', 'and', 'a', 'modern', 'sph', 'implementation', 'we', 'vary', 'j_rm', 'crit', 'from', '30', 'to', '103', 'in', 'units', 'of', 'j_21', 'to', 'study', 'how', 'this', 'parameter', 'impacts', 'the', 'number', 'of', 'seed', 'black', 'holes', 'and', 'the', 'type', 'of', 'galaxies', 'which', 'host', 'them', 'we', 'focus', 'on', 'black', 'hole', 'formation', 'as', 'a', 'function', 'of', 'environment', 'halo', 'mass', 'metallicity', 'and', 'proximity', 'of', 'the', 'lymanwerner', 'source', 'massive', 'black', 'hole', 'seeds', 'form', 'more', 'abundantly', 'with', 'lower', 'j_rm', 'crit', 'thresholds', 'but', 'regardless', 'of', 'j_rm', 'crit', 'these', 'seeds', 'typically', 'form', 'in', 'halos', 'that', 'have', 'recently', 'begun', 'star', 'formation', 'our', 'results', 'do', 'not', 'confirm', 'the', 'proposed', 'atomic', 'cooling', 'halo', 'pair', 'scenario', 'rather', 'black', 'hole', 'seeds', 'predominantly', 'form', 'in', 'lowmetallicity', 'pockets', 'of', 'halos', 'which', 'already', 'host', 'star', 'formation']] | [-0.09142779259569943, 0.14079215308942367, 0.004628059972077608, 0.1403227001012201, -0.05802442802721634, -0.0663663435196504, 0.06519609962962568, 0.36914710942655804, -0.14262625011056662, -0.3426346645988524, 0.029798263676464556, -0.2680676682703197, 0.006696117606014013, 0.15897831915644928, 0.02583624464087188, -0.03559517627069726, 0.012461147307883948, -0.06430037984531373, -0.03789412130229175, -0.2683359362501651, 0.34247503747418523, 0.14296542305499316, 0.18358672339096666, 0.02218247430305928, 0.016829980609356424, -0.12046749573387205, -0.002564000239595771, -0.044976429415866735, -0.22171766213621594, -0.006913166964950506, 0.19483454255666582, 0.1615872696157021, 0.25051324597653, -0.4513599212616682, -0.22566922551300378, 0.09277985479030758, 0.22650440899748356, 0.14684730448387565, -0.1674117941314471, -0.20786934025306256, 0.04060333640500903, -0.2603328442852944, -0.11053714699670672, 0.05366481527592987, 0.04802873777830973, -0.0006298773791640997, -0.24200920794159175, 0.16765176942804827, 0.02462736049713567, -0.06566932136565447, -0.08946965712289966, -0.029072956759948282, -0.11705351800564677, 0.05007639743760228, 0.032553476975648664, 0.09186089328397065, 0.2961396169103682, -0.15240172198787333, -0.003991102874279022, 0.3994573749732226, -0.047910301219671964, -0.058442236062139274, 0.23819346748106182, -0.2362837889380753, -0.17491315952315928, 0.16189795723184944, 0.15904617035668342, 0.1688375889826566, -0.1512616372331977, 0.02364829554570315, 0.030080056985840202, 0.22175477833859622, 0.0812567461943254, 0.05435976155474782, 0.39211583602055905, 0.11632341717742384, -0.0016017655450850726, 0.07799374129879288, -0.12222261511080433, -0.07893744166567922, -0.17748115343647078, -0.14059578423574567, -0.1333280061306432, 0.12991866709763417, -0.10698571322631324, -0.15227919865213335, 0.2715992490109056, 0.12660295151732862, 0.20309947318024935, -0.0029457822116091847, 0.29063649587114926, 0.08195545586012304, 0.07765568064153194, 0.1225286700166762, 0.2800884143821895, 0.1717967068841681, 0.06508292368333787, -0.2897665448319167, 0.04765993041172624, 0.05432034857664257] |
1,803.01008 | Introducing CGOLS: The Cholla Galactic OutfLow Simulation Suite | We present the Cholla Galactic OutfLow Simulations (CGOLS) suite, a set of
extremely high resolution global simulations of isolated disk galaxies designed
to clarify the nature of multiphase structure in galactic winds. Using the
GPU-based code Cholla, we achieve unprecedented resolution in these
simulations, modeling galaxies over a 20 kpc region at a constant resolution of
5 pc. The simulations include a feedback model designed to test the effects of
different mass- and energy-loading factors on galactic outflows over kiloparsec
scales. In addition to describing the simulation methodology in detail, we also
present the results from an adiabatic simulation that tests the
frequently-adopted analytic galactic wind model of Chevalier & Clegg. Our
results indicate that the Chevalier & Clegg model is a good fit to nuclear
starburst winds in the non-radiative region of parameter space. Lastly, we
investigate the role of resolution and convergence in large-scale simulations
of multiphase galactic winds. While our largest-scale simulations do show
convergence of observable features like soft X-ray emission, our tests
demonstrate that simulations of this kind with resolutions greater than 10 pc
are not yet converged, confirming the need for extreme resolution in order to
study the structure of winds and their effects on the circumgalactic medium.
| astro-ph.GA | we present the cholla galactic outflow simulations cgols suite a set of extremely high resolution global simulations of isolated disk galaxies designed to clarify the nature of multiphase structure in galactic winds using the gpubased code cholla we achieve unprecedented resolution in these simulations modeling galaxies over a 20 kpc region at a constant resolution of 5 pc the simulations include a feedback model designed to test the effects of different mass and energyloading factors on galactic outflows over kiloparsec scales in addition to describing the simulation methodology in detail we also present the results from an adiabatic simulation that tests the frequentlyadopted analytic galactic wind model of chevalier clegg our results indicate that the chevalier clegg model is a good fit to nuclear starburst winds in the nonradiative region of parameter space lastly we investigate the role of resolution and convergence in largescale simulations of multiphase galactic winds while our largestscale simulations do show convergence of observable features like soft xray emission our tests demonstrate that simulations of this kind with resolutions greater than 10 pc are not yet converged confirming the need for extreme resolution in order to study the structure of winds and their effects on the circumgalactic medium | [['we', 'present', 'the', 'cholla', 'galactic', 'outflow', 'simulations', 'cgols', 'suite', 'a', 'set', 'of', 'extremely', 'high', 'resolution', 'global', 'simulations', 'of', 'isolated', 'disk', 'galaxies', 'designed', 'to', 'clarify', 'the', 'nature', 'of', 'multiphase', 'structure', 'in', 'galactic', 'winds', 'using', 'the', 'gpubased', 'code', 'cholla', 'we', 'achieve', 'unprecedented', 'resolution', 'in', 'these', 'simulations', 'modeling', 'galaxies', 'over', 'a', '20', 'kpc', 'region', 'at', 'a', 'constant', 'resolution', 'of', '5', 'pc', 'the', 'simulations', 'include', 'a', 'feedback', 'model', 'designed', 'to', 'test', 'the', 'effects', 'of', 'different', 'mass', 'and', 'energyloading', 'factors', 'on', 'galactic', 'outflows', 'over', 'kiloparsec', 'scales', 'in', 'addition', 'to', 'describing', 'the', 'simulation', 'methodology', 'in', 'detail', 'we', 'also', 'present', 'the', 'results', 'from', 'an', 'adiabatic', 'simulation', 'that', 'tests', 'the', 'frequentlyadopted', 'analytic', 'galactic', 'wind', 'model', 'of', 'chevalier', 'clegg', 'our', 'results', 'indicate', 'that', 'the', 'chevalier', 'clegg', 'model', 'is', 'a', 'good', 'fit', 'to', 'nuclear', 'starburst', 'winds', 'in', 'the', 'nonradiative', 'region', 'of', 'parameter', 'space', 'lastly', 'we', 'investigate', 'the', 'role', 'of', 'resolution', 'and', 'convergence', 'in', 'largescale', 'simulations', 'of', 'multiphase', 'galactic', 'winds', 'while', 'our', 'largestscale', 'simulations', 'do', 'show', 'convergence', 'of', 'observable', 'features', 'like', 'soft', 'xray', 'emission', 'our', 'tests', 'demonstrate', 'that', 'simulations', 'of', 'this', 'kind', 'with', 'resolutions', 'greater', 'than', '10', 'pc', 'are', 'not', 'yet', 'converged', 'confirming', 'the', 'need', 'for', 'extreme', 'resolution', 'in', 'order', 'to', 'study', 'the', 'structure', 'of', 'winds', 'and', 'their', 'effects', 'on', 'the', 'circumgalactic', 'medium']] | [-0.06068714925670065, 0.02041679891124659, -0.06740853519178927, 0.10522001740057021, -0.0579939209879376, -0.029139347304881085, 0.013376004467718304, 0.4421312825102359, -0.19519957897718995, -0.354511925666593, 0.05883294035505969, -0.26133294183848194, -0.044249824311118575, 0.22224021222733426, 0.024873734879947734, 0.0038349484000355007, 0.07321809914661571, -0.11915137808769942, -0.05902785751968622, -0.2288804901042022, 0.2894287296384573, 0.1754522533994168, 0.17218892549164594, 0.009873109072213993, 0.12252611007541418, -0.13578462470788508, -0.06565804033540189, 0.013364485277998028, -0.18190826849775477, 0.04080745191371534, 0.21539102726441342, 0.10620029677636922, 0.2573901110305451, -0.4181142311601434, -0.27156133358366785, 0.035853877911577, 0.21136760554683862, 0.06180378944496624, -0.09360268961056135, -0.21567270992789417, 0.10509026321058627, -0.2051675885496661, -0.17093282457208261, -0.051091505675576625, -0.05504502331721597, 0.042275377331070556, -0.24255618899303955, 0.10660616989116534, 0.023366746829706245, 0.10260081491593155, -0.08934553593629971, -0.04694117799634114, -0.013773695318959653, 0.06371885664004368, 0.0036612479097675532, 0.04060924030491151, 0.19282046949490905, -0.15216082438477316, -0.07743431574373971, 0.41923190391622484, -0.022919178944212037, -0.0969964760588482, 0.2483242363500176, -0.24029934965074062, -0.155729599383194, 0.14230771301779896, 0.2107569910120219, 0.11944523166748695, -0.09651820692757611, 0.020130312684050296, -0.06415272623999044, 0.22154953022720292, -0.00112173980276566, 0.015504950319882482, 0.22561828994192182, 0.16845190980529878, -0.0025834899657638743, 0.08560596898430958, -0.18701312151300953, -0.10171570875914768, -0.26381334907142445, -0.07686866448028012, -0.100750435909722, 0.07544985791791987, -0.1670717627203703, -0.09474074708836269, 0.3425265564233996, 0.19932653756288346, 0.18269276540726423, 0.04657167665020097, 0.3347818266041577, -0.0023026675741857614, 0.06467714394908398, 0.14404370062518865, 0.2858786880457774, 0.14583863110048698, 0.08383376115234568, -0.2710524881188758, 0.03706881023477763, 0.006456201877444983] |
1,803.01009 | Multi-messenger constraints to the local emission of cosmic-ray
electrons | The data on the inclusive flux of cosmic positrons and electrons
($e^++e^{-}$) have been recently collected from GeV to tens of TeV energies by
several experiments with unprecedented precision. In addition, the Fermi-LAT
Collaboration has provided a new energy spectrum for the upper bounds on the
$e^++e^{-}$ dipole anisotropy. This observable can bring information on the
emission from local Galactic sources, notably measured with high precision at
radio frequencies. We develop a framework in which $e^-$ and $e^+$ measured at
Earth from GeV up to tens of TeV energies have a composite origin. A dedicated
analysis is deserved to Vela YZ and Cygnus Loop Supernova Remnants (SNRs), for
which we consider two different models for the injection of $e^-$. We
investigate the consistency of these models using the three physical
observables: the radio flux from Vela YZ and Cygnus Loop at all the available
frequencies, the $e^++e^-$ flux from five experiments from the GeV to tens of
TeV energy, the $e^++e^-$ dipole anisotropy upper limits from 50 GeV to about 1
TeV. We find that the radio flux for these nearby SNRs strongly constraints the
properties of the injection electron spectrum, partially compatible with the
looser constraints derived from the $e^+ + e^-$ flux data. We also perform a
multi-wavelength multi-messenger analysis by fitting simultaneously the radio
flux on Vela YZ and Cygnus Loop and the $e^+ + e^-$ flux, and checking the
outputs against the $e^+ + e^-$ dipole anisotropy data. Remarkably, we find a
model which is compatible with all the $e^++e^-$ flux data, the radio data for
Vela YZ and Cygnus Loop, and with the anisotropy upper bounds. We show the
severe constraints imposed by the most recent data on the $e^+ + e^-$ dipole
anisotropy.
| astro-ph.HE | the data on the inclusive flux of cosmic positrons and electrons ee have been recently collected from gev to tens of tev energies by several experiments with unprecedented precision in addition the fermilat collaboration has provided a new energy spectrum for the upper bounds on the ee dipole anisotropy this observable can bring information on the emission from local galactic sources notably measured with high precision at radio frequencies we develop a framework in which e and e measured at earth from gev up to tens of tev energies have a composite origin a dedicated analysis is deserved to vela yz and cygnus loop supernova remnants snrs for which we consider two different models for the injection of e we investigate the consistency of these models using the three physical observables the radio flux from vela yz and cygnus loop at all the available frequencies the ee flux from five experiments from the gev to tens of tev energy the ee dipole anisotropy upper limits from 50 gev to about 1 tev we find that the radio flux for these nearby snrs strongly constraints the properties of the injection electron spectrum partially compatible with the looser constraints derived from the e e flux data we also perform a multiwavelength multimessenger analysis by fitting simultaneously the radio flux on vela yz and cygnus loop and the e e flux and checking the outputs against the e e dipole anisotropy data remarkably we find a model which is compatible with all the ee flux data the radio data for vela yz and cygnus loop and with the anisotropy upper bounds we show the severe constraints imposed by the most recent data on the e e dipole anisotropy | [['the', 'data', 'on', 'the', 'inclusive', 'flux', 'of', 'cosmic', 'positrons', 'and', 'electrons', 'ee', 'have', 'been', 'recently', 'collected', 'from', 'gev', 'to', 'tens', 'of', 'tev', 'energies', 'by', 'several', 'experiments', 'with', 'unprecedented', 'precision', 'in', 'addition', 'the', 'fermilat', 'collaboration', 'has', 'provided', 'a', 'new', 'energy', 'spectrum', 'for', 'the', 'upper', 'bounds', 'on', 'the', 'ee', 'dipole', 'anisotropy', 'this', 'observable', 'can', 'bring', 'information', 'on', 'the', 'emission', 'from', 'local', 'galactic', 'sources', 'notably', 'measured', 'with', 'high', 'precision', 'at', 'radio', 'frequencies', 'we', 'develop', 'a', 'framework', 'in', 'which', 'e', 'and', 'e', 'measured', 'at', 'earth', 'from', 'gev', 'up', 'to', 'tens', 'of', 'tev', 'energies', 'have', 'a', 'composite', 'origin', 'a', 'dedicated', 'analysis', 'is', 'deserved', 'to', 'vela', 'yz', 'and', 'cygnus', 'loop', 'supernova', 'remnants', 'snrs', 'for', 'which', 'we', 'consider', 'two', 'different', 'models', 'for', 'the', 'injection', 'of', 'e', 'we', 'investigate', 'the', 'consistency', 'of', 'these', 'models', 'using', 'the', 'three', 'physical', 'observables', 'the', 'radio', 'flux', 'from', 'vela', 'yz', 'and', 'cygnus', 'loop', 'at', 'all', 'the', 'available', 'frequencies', 'the', 'ee', 'flux', 'from', 'five', 'experiments', 'from', 'the', 'gev', 'to', 'tens', 'of', 'tev', 'energy', 'the', 'ee', 'dipole', 'anisotropy', 'upper', 'limits', 'from', '50', 'gev', 'to', 'about', '1', 'tev', 'we', 'find', 'that', 'the', 'radio', 'flux', 'for', 'these', 'nearby', 'snrs', 'strongly', 'constraints', 'the', 'properties', 'of', 'the', 'injection', 'electron', 'spectrum', 'partially', 'compatible', 'with', 'the', 'looser', 'constraints', 'derived', 'from', 'the', 'e', 'e', 'flux', 'data', 'we', 'also', 'perform', 'a', 'multiwavelength', 'multimessenger', 'analysis', 'by', 'fitting', 'simultaneously', 'the', 'radio', 'flux', 'on', 'vela', 'yz', 'and', 'cygnus', 'loop', 'and', 'the', 'e', 'e', 'flux', 'and', 'checking', 'the', 'outputs', 'against', 'the', 'e', 'e', 'dipole', 'anisotropy', 'data', 'remarkably', 'we', 'find', 'a', 'model', 'which', 'is', 'compatible', 'with', 'all', 'the', 'ee', 'flux', 'data', 'the', 'radio', 'data', 'for', 'vela', 'yz', 'and', 'cygnus', 'loop', 'and', 'with', 'the', 'anisotropy', 'upper', 'bounds', 'we', 'show', 'the', 'severe', 'constraints', 'imposed', 'by', 'the', 'most', 'recent', 'data', 'on', 'the', 'e', 'e', 'dipole', 'anisotropy']] | [-0.09432381472893452, 0.13128027318110852, -0.022368879840921677, 0.12356733772454359, -0.07571832712805061, -0.09283563181627215, 0.06971150320676858, 0.38490662178384105, -0.21427278626391566, -0.37092535078786965, 0.029316582892645607, -0.3383287713209396, 0.04068209466834863, 0.2571038738162698, 0.08262091627050387, 0.012617279534849028, 0.10359534779155072, -0.012570407705610258, -0.029012318593123112, -0.18574499247121837, 0.2624450114441284, 0.15735244157871134, 0.23068882176946653, 0.08376232062286713, 0.09095833610269453, -0.05612177233489459, -0.020815988619436038, -0.04377305003438602, -0.13200395653903046, 0.11488935245413398, 0.1906464185183531, 0.11511731610894857, 0.11796911799986111, -0.39286142646482114, -0.2018694209000259, 0.13209834876960438, 0.11411191744631842, -0.018257800347923316, -0.017166241119092887, -0.30120941011496544, 0.0700400340027715, -0.19996131886973192, -0.11226336261126817, 0.02897825490748673, 0.0034866388282624255, 0.03545168941971241, -0.254069048426065, 0.06894790840962199, -0.0265193930749471, 0.05566252707881575, -0.10579196406536523, -0.14324807404099327, -0.049570101166242046, 0.018706683690349262, 0.09262858616400575, 0.07478666222662453, 0.130730730461839, -0.09567826044165709, -0.1627047973595102, 0.3594532646647279, -0.04754877863533533, -0.0770705399552785, 0.1754624938937476, -0.24463865313711658, -0.2133823547332564, 0.186927009069998, 0.1873164297293937, 0.044889388341260585, -0.18717727442517093, 0.12489481941907127, -0.00892690643637539, 0.14641035572674713, 0.0240730453699239, 0.04855057924218464, 0.26512992501650984, 0.12909489828652065, 0.04634156466478057, 0.1011223270668109, -0.24918918853805383, 0.02121305665605816, -0.3133869167237559, -0.03570392278692963, -0.14169010251123262, 0.11601773103486682, -0.08992950614299748, -0.04135608783935344, 0.4021858136349341, 0.10666419947846678, 0.24854893758402843, 0.010390035828918611, 0.32538712031877876, 0.10006558853773433, 0.045179820236782624, 0.15695351480604394, 0.33053472471799245, 0.11350953220029815, 0.13617553578121913, -0.2050712519014875, 0.00434114769991618, -0.017399068584404234] |
1,803.0101 | Quantized Rabi Oscillations and Circular Dichroism in Quantum Hall
Systems | The dissipative response of a quantum system upon a time-dependent drive can
be exploited as a probe of its geometric and topological properties. In this
work, we explore the implications of such phenomena in the context of
two-dimensional gases subjected to a uniform magnetic field. It is shown that a
filled Landau level exhibits a quantized circular dichroism, which can be
traced back to its underlying non-trivial topology. Based on selection rules,
we find that this quantized circular dichroism can be suitably described in
terms of Rabi oscillations, whose frequencies satisfy simple quantization laws.
Moreover, we discuss how these quantized dissipative responses can be probed
locally, both in the bulk and at the boundaries of the quantum Hall system.
This work suggests alternative forms of topological probes in quantum systems
based on circular dichroism.
| cond-mat.quant-gas cond-mat.mes-hall quant-ph | the dissipative response of a quantum system upon a timedependent drive can be exploited as a probe of its geometric and topological properties in this work we explore the implications of such phenomena in the context of twodimensional gases subjected to a uniform magnetic field it is shown that a filled landau level exhibits a quantized circular dichroism which can be traced back to its underlying nontrivial topology based on selection rules we find that this quantized circular dichroism can be suitably described in terms of rabi oscillations whose frequencies satisfy simple quantization laws moreover we discuss how these quantized dissipative responses can be probed locally both in the bulk and at the boundaries of the quantum hall system this work suggests alternative forms of topological probes in quantum systems based on circular dichroism | [['the', 'dissipative', 'response', 'of', 'a', 'quantum', 'system', 'upon', 'a', 'timedependent', 'drive', 'can', 'be', 'exploited', 'as', 'a', 'probe', 'of', 'its', 'geometric', 'and', 'topological', 'properties', 'in', 'this', 'work', 'we', 'explore', 'the', 'implications', 'of', 'such', 'phenomena', 'in', 'the', 'context', 'of', 'twodimensional', 'gases', 'subjected', 'to', 'a', 'uniform', 'magnetic', 'field', 'it', 'is', 'shown', 'that', 'a', 'filled', 'landau', 'level', 'exhibits', 'a', 'quantized', 'circular', 'dichroism', 'which', 'can', 'be', 'traced', 'back', 'to', 'its', 'underlying', 'nontrivial', 'topology', 'based', 'on', 'selection', 'rules', 'we', 'find', 'that', 'this', 'quantized', 'circular', 'dichroism', 'can', 'be', 'suitably', 'described', 'in', 'terms', 'of', 'rabi', 'oscillations', 'whose', 'frequencies', 'satisfy', 'simple', 'quantization', 'laws', 'moreover', 'we', 'discuss', 'how', 'these', 'quantized', 'dissipative', 'responses', 'can', 'be', 'probed', 'locally', 'both', 'in', 'the', 'bulk', 'and', 'at', 'the', 'boundaries', 'of', 'the', 'quantum', 'hall', 'system', 'this', 'work', 'suggests', 'alternative', 'forms', 'of', 'topological', 'probes', 'in', 'quantum', 'systems', 'based', 'on', 'circular', 'dichroism']] | [-0.17515900893981304, 0.19527244678552527, -0.1156182416763379, 0.031061603734617246, -0.07323547852322904, -0.1411302013725821, 0.03707190521700836, 0.3595593909580094, -0.3037652393469392, -0.24412384030318804, 0.055474607589300166, -0.21880273339547104, -0.21183401070458732, 0.2124866160091513, -0.033834043056217594, 0.05217445530379608, -0.019043809739497503, 0.02477309370149316, -0.07228113508977886, -0.19524622236990105, 0.27744784231346326, 0.056079189563274325, 0.29995311373052425, 0.0337991838303478, 0.0859594491776079, -0.007951179456744176, 0.05062161992588984, 0.12334808158173935, -0.10525348370372659, 0.07976732653245996, 0.23462381206258243, -0.006914623889641197, 0.20115091407032154, -0.4656495857052505, -0.2159159684418214, 0.04106378835042132, 0.12976438186996714, 0.14711388695634095, -0.048540197606476494, -0.293149042516641, 0.05648227228171456, -0.15106243210338202, -0.14226174678431072, -0.1192219771667203, -0.033736609839035, -0.006382745675005908, -0.22551105052767906, 0.05895205569773245, 0.09283638935980958, 0.0430515716477895, -0.0719938572051365, -0.018447392145797277, -0.036474892946043565, 0.0843065603750883, -0.01993572576590049, -0.006643131375964384, 0.15847871720846465, -0.12605969889485624, -0.18032759167740484, 0.40844546068014936, -0.09168368287092603, -0.21005348603366247, 0.180674571338902, -0.18156180204823613, -0.11016046458771869, 0.0785172718000223, 0.17897066858772157, 0.11482422283517002, -0.12481301756623052, 0.11496414460938766, -0.05244127514688715, 0.15366276176368346, 0.07756283746054049, 0.10195518841831458, 0.33364361210434296, 0.12323753022130078, 0.05267150070407053, 0.16657302567193202, -0.0701004760826368, -0.06959165199903021, -0.2792408686138189, -0.15091358436924865, -0.1977169533649376, 0.10785698294535336, -0.0071865483323970475, -0.18272773266153988, 0.4266676603635745, 0.14721516659830822, 0.21471072355161053, -0.03313176605221468, 0.2560919988170655, 0.18750220519028354, 0.0565261979788931, 0.03105040146524448, 0.2821590206307818, 0.17927759387808392, 0.0809609491461471, -0.2915021707147443, 0.028996012759144738, 0.025606932851777814] |
1,803.01011 | Response and phase transition of a Kitaev spin liquid in a local
magnetic field | We study the response of the Kitaev spin liquid (KSL) to a local magnetic
field perpendicular to the Kitaev honeycomb lattice. The local magnetic field
induces a dynamical excitation of a flux pair in the spin liquid and the system
can be described by a generally particle-hole asymmetric interacting resonant
level model. The dynamical excitation of the flux pair closes the flux gap in
the spectrum of the spin correlation function locally for the gapless KSL even
from the perturbative response to a weak magnetic field. Beyond the
perturbative regime, the p-h asymmetry competes with the magnetic field and
results in a rich phase diagram. Moreover, the magnetic field breaks the gauge
equivalence of the ferromagnetic and anti-ferromagnetic Kitaev couplings of the
ground state and leads to very different behaviors for the two cases. The
anti-ferromagnetic case experiences a first order phase transition to the
polarized state during magnetization whereas the ferromagnetic case does not.
This study can be generalized to the Kitaev model in a uniform magnetic field
and may help understand issues in recent experiments on KSL candidates.
| cond-mat.str-el | we study the response of the kitaev spin liquid ksl to a local magnetic field perpendicular to the kitaev honeycomb lattice the local magnetic field induces a dynamical excitation of a flux pair in the spin liquid and the system can be described by a generally particlehole asymmetric interacting resonant level model the dynamical excitation of the flux pair closes the flux gap in the spectrum of the spin correlation function locally for the gapless ksl even from the perturbative response to a weak magnetic field beyond the perturbative regime the ph asymmetry competes with the magnetic field and results in a rich phase diagram moreover the magnetic field breaks the gauge equivalence of the ferromagnetic and antiferromagnetic kitaev couplings of the ground state and leads to very different behaviors for the two cases the antiferromagnetic case experiences a first order phase transition to the polarized state during magnetization whereas the ferromagnetic case does not this study can be generalized to the kitaev model in a uniform magnetic field and may help understand issues in recent experiments on ksl candidates | [['we', 'study', 'the', 'response', 'of', 'the', 'kitaev', 'spin', 'liquid', 'ksl', 'to', 'a', 'local', 'magnetic', 'field', 'perpendicular', 'to', 'the', 'kitaev', 'honeycomb', 'lattice', 'the', 'local', 'magnetic', 'field', 'induces', 'a', 'dynamical', 'excitation', 'of', 'a', 'flux', 'pair', 'in', 'the', 'spin', 'liquid', 'and', 'the', 'system', 'can', 'be', 'described', 'by', 'a', 'generally', 'particlehole', 'asymmetric', 'interacting', 'resonant', 'level', 'model', 'the', 'dynamical', 'excitation', 'of', 'the', 'flux', 'pair', 'closes', 'the', 'flux', 'gap', 'in', 'the', 'spectrum', 'of', 'the', 'spin', 'correlation', 'function', 'locally', 'for', 'the', 'gapless', 'ksl', 'even', 'from', 'the', 'perturbative', 'response', 'to', 'a', 'weak', 'magnetic', 'field', 'beyond', 'the', 'perturbative', 'regime', 'the', 'ph', 'asymmetry', 'competes', 'with', 'the', 'magnetic', 'field', 'and', 'results', 'in', 'a', 'rich', 'phase', 'diagram', 'moreover', 'the', 'magnetic', 'field', 'breaks', 'the', 'gauge', 'equivalence', 'of', 'the', 'ferromagnetic', 'and', 'antiferromagnetic', 'kitaev', 'couplings', 'of', 'the', 'ground', 'state', 'and', 'leads', 'to', 'very', 'different', 'behaviors', 'for', 'the', 'two', 'cases', 'the', 'antiferromagnetic', 'case', 'experiences', 'a', 'first', 'order', 'phase', 'transition', 'to', 'the', 'polarized', 'state', 'during', 'magnetization', 'whereas', 'the', 'ferromagnetic', 'case', 'does', 'not', 'this', 'study', 'can', 'be', 'generalized', 'to', 'the', 'kitaev', 'model', 'in', 'a', 'uniform', 'magnetic', 'field', 'and', 'may', 'help', 'understand', 'issues', 'in', 'recent', 'experiments', 'on', 'ksl', 'candidates']] | [-0.21424028797385594, 0.22524101111533432, -0.050724013129042254, 0.07364644412817951, -0.06681731569115072, -0.12073436613944877, 0.049081386856657146, 0.36737916856590247, -0.2523995095010226, -0.2859766746728888, 0.02143782009047249, -0.2740023963619024, -0.08773535599466413, 0.13508196644640216, 0.08749755667263849, -0.020603339086907604, -0.04471890189322746, 0.03511568348104548, -0.12193731284933165, -0.20268365451031262, 0.29269798217962184, 0.013044797911748496, 0.308137739646352, 0.07580411513336002, 0.027972448667666565, 0.031014159504168977, 0.13517990774998906, 0.03182192159655541, -0.113162619765434, 0.007808596648586293, 0.2024477811012831, -0.09485879870804234, 0.16061383167333487, -0.44168517802738483, -0.1898126306051078, 0.0705382328467547, 0.11734699389586846, 0.17393365597559346, -0.02332311392722962, -0.31844133847237877, 0.01064491597418156, -0.17476717688712395, -0.15971031055863324, -0.08886236531090819, -0.044504776408171486, -0.011715241912558365, -0.2934138971122189, 0.09035918260795167, 0.11170758472128202, 0.060470509234194954, -0.07315629886773725, -0.05775722917622059, -0.08772256787245472, 0.07398012461554673, 0.07817534088875012, 0.12287399715359142, 0.13821945102730146, -0.19493949134808242, -0.14285087448305503, 0.3334336041298229, -0.09312283939539662, -0.11729582738027805, 0.18231158445382284, -0.19638450050778272, -0.09497731255445009, 0.17175431266918573, 0.10728647157342898, 0.06519741190390455, -0.1281043995792667, 0.10702773045280385, -0.020491129253059626, 0.17403422351409165, -0.03983099949675509, 0.023154644869888823, 0.3026265128903712, 0.1577352321241051, 0.05315954178610506, 0.18658014685691646, -0.12633028835536808, -0.1280117527530011, -0.255015395491177, -0.14891232940782276, -0.1999047603755672, 0.046732070154798244, -0.05307044168738584, -0.1838466439758324, 0.4652469731660353, 0.15954211406060495, 0.16141447204993004, -0.05288834828081437, 0.23415746987318722, 0.09991134678194713, 0.0315886625347452, 0.03157986860864589, 0.2728244788142749, 0.20685233195092426, 0.12262233897991892, -0.30885515322055046, 0.012621504984821917, 0.04438703327646686] |
1,803.01012 | Signatures of Plexcitonic States in Molecular Electroluminescence | We develop a quantum master equation (QME) approach to investigate the
electroluminesence (EL) of molecules confined between metallic electrodes and
coupled to quantum plasmonic modes. Within our general state-based framework,
we describe electronic tunneling, vibrational damping, environmental dephasing,
and the quantum coherent dynamics of coupled quantum electromagnetic field
modes. As an example, we calculate the STM-induced spontaneous emission of a
tetraphenylporphyrin (TPP) molecule coupled to a nanocavity plasmon. In the
weak molecular exciton-plasmon coupling regime we find excellent agreement with
experiments, including above-threshold hot luminescence, an effect not
described by previous semiclassical calculations. In the strong coupling
regime, we analyze the spectral features indicative of the formation of
plexcitonic states.
| cond-mat.mes-hall cond-mat.mtrl-sci physics.chem-ph | we develop a quantum master equation qme approach to investigate the electroluminesence el of molecules confined between metallic electrodes and coupled to quantum plasmonic modes within our general statebased framework we describe electronic tunneling vibrational damping environmental dephasing and the quantum coherent dynamics of coupled quantum electromagnetic field modes as an example we calculate the stminduced spontaneous emission of a tetraphenylporphyrin tpp molecule coupled to a nanocavity plasmon in the weak molecular excitonplasmon coupling regime we find excellent agreement with experiments including abovethreshold hot luminescence an effect not described by previous semiclassical calculations in the strong coupling regime we analyze the spectral features indicative of the formation of plexcitonic states | [['we', 'develop', 'a', 'quantum', 'master', 'equation', 'qme', 'approach', 'to', 'investigate', 'the', 'electroluminesence', 'el', 'of', 'molecules', 'confined', 'between', 'metallic', 'electrodes', 'and', 'coupled', 'to', 'quantum', 'plasmonic', 'modes', 'within', 'our', 'general', 'statebased', 'framework', 'we', 'describe', 'electronic', 'tunneling', 'vibrational', 'damping', 'environmental', 'dephasing', 'and', 'the', 'quantum', 'coherent', 'dynamics', 'of', 'coupled', 'quantum', 'electromagnetic', 'field', 'modes', 'as', 'an', 'example', 'we', 'calculate', 'the', 'stminduced', 'spontaneous', 'emission', 'of', 'a', 'tetraphenylporphyrin', 'tpp', 'molecule', 'coupled', 'to', 'a', 'nanocavity', 'plasmon', 'in', 'the', 'weak', 'molecular', 'excitonplasmon', 'coupling', 'regime', 'we', 'find', 'excellent', 'agreement', 'with', 'experiments', 'including', 'abovethreshold', 'hot', 'luminescence', 'an', 'effect', 'not', 'described', 'by', 'previous', 'semiclassical', 'calculations', 'in', 'the', 'strong', 'coupling', 'regime', 'we', 'analyze', 'the', 'spectral', 'features', 'indicative', 'of', 'the', 'formation', 'of', 'plexcitonic', 'states']] | [-0.15843431027261196, 0.16004913833441808, -0.05053640304443737, 0.05121500731049174, 0.006475610005307115, -0.17255691057329792, 0.03219338592262594, 0.38626701828885684, -0.2204443836817518, -0.24125233434433876, -0.09380583899231472, -0.29274080419499016, -0.1594898970409607, 0.16161921209681573, 0.04410009495094763, 0.040087902040829286, 0.03369211127412402, -0.0684990252355217, 0.010265807966115299, -0.10523426356721083, 0.2579775595589093, 0.04735057779449831, 0.3125206021833475, 0.1014347577691768, 0.07926811971615448, -0.004180655547383207, 0.10173645667102257, -0.04287292772938532, -0.18509436082267375, 0.08369061942977607, 0.27040573467362533, -0.057783474673568785, 0.23534338908696859, -0.4989975558041974, -0.21269881849487624, -0.006106490040784357, 0.16746594714614157, 0.21006563168096667, -0.05729316858802728, -0.3226184271086283, -0.03563356644439476, -0.15402176060403386, -0.12658329588723266, -0.10670178265664382, -0.06073295474548272, -0.011799152690434345, -0.2444720300371517, 0.09662499356178429, 0.01818539084612254, 0.042628688739299564, -0.057133010045314826, 0.0011033930662691731, -0.009461590349760459, 0.05448124175287645, -0.03127546916301879, -0.027135531621752307, 0.22510438440453814, -0.12122755405262406, -0.14691636558725601, 0.3662058954748015, -0.17406051729038288, -0.12012963898962846, 0.2074286080810621, -0.15711449759719134, -0.06138333261952977, 0.14973066061092713, 0.12435329406246266, 0.12819936862905268, -0.14544704534906755, 0.065107925000794, 0.011944068190469235, 0.19229304399858746, 0.04951693519251421, 0.1697156804028863, 0.230906206364226, 0.17826966929283958, -0.04911663342715689, 0.17222215338336322, -0.10635398932047085, -0.14414245020856875, -0.26542647344198217, -0.14335484281009822, -0.17097563202777463, 0.09611516726363334, -0.037956347560355895, -0.1842559459791691, 0.4242540093233671, 0.1143537434766552, 0.1206537379745256, -0.02493901163581069, 0.2601901691027538, 0.1520598023491773, 0.022590271999231644, 0.026662722969410458, 0.30830621002759373, 0.2530299732655597, 0.045072775403106655, -0.40948182749734435, -0.03476890694367251, -0.02810706233571249] |
1,803.01013 | An Overview of Robust Subspace Recovery | This paper will serve as an introduction to the body of work on robust
subspace recovery. Robust subspace recovery involves finding an underlying
low-dimensional subspace in a dataset that is possibly corrupted with outliers.
While this problem is easy to state, it has been difficult to develop optimal
algorithms due to its underlying nonconvexity. This work emphasizes advantages
and disadvantages of proposed approaches and unsolved problems in the area.
| cs.LG stat.ML | this paper will serve as an introduction to the body of work on robust subspace recovery robust subspace recovery involves finding an underlying lowdimensional subspace in a dataset that is possibly corrupted with outliers while this problem is easy to state it has been difficult to develop optimal algorithms due to its underlying nonconvexity this work emphasizes advantages and disadvantages of proposed approaches and unsolved problems in the area | [['this', 'paper', 'will', 'serve', 'as', 'an', 'introduction', 'to', 'the', 'body', 'of', 'work', 'on', 'robust', 'subspace', 'recovery', 'robust', 'subspace', 'recovery', 'involves', 'finding', 'an', 'underlying', 'lowdimensional', 'subspace', 'in', 'a', 'dataset', 'that', 'is', 'possibly', 'corrupted', 'with', 'outliers', 'while', 'this', 'problem', 'is', 'easy', 'to', 'state', 'it', 'has', 'been', 'difficult', 'to', 'develop', 'optimal', 'algorithms', 'due', 'to', 'its', 'underlying', 'nonconvexity', 'this', 'work', 'emphasizes', 'advantages', 'and', 'disadvantages', 'of', 'proposed', 'approaches', 'and', 'unsolved', 'problems', 'in', 'the', 'area']] | [-0.07545763116491877, -0.03526645958840348, -0.06346480656361235, 0.024144328609311386, -0.13729186539632687, -0.15803121968401948, 0.027571715571431687, 0.41170249037120654, -0.32578006319269753, -0.2839867228682598, 0.16202653745742704, -0.24996868259125, -0.20929256112625202, 0.16458463551901767, -0.23472630579456472, 0.10146712780292348, 0.08803394996304659, -0.008974133302336153, -0.07985059682455292, -0.2945796977661118, 0.29585533497342165, 0.10122169205999892, 0.293032051431879, 0.0277076558533894, 0.13282897075692165, 0.005677709349201641, -0.009736943969745998, 0.015512312438500963, -0.05331024619722418, 0.17835773840256414, 0.3684124935796295, 0.18871828716288766, 0.37456442080978036, -0.3874088646169158, -0.21286828613475614, 0.1465796953053686, 0.1728463757789923, 0.15165266625083768, -0.06272220854019828, -0.2661659138790075, 0.09278327792855924, -0.11886948239112245, -0.10628901300546915, -0.14736151781635007, 0.033529030132120934, -0.11307237626718142, -0.2704800542956893, 0.06604156199761707, 0.10395713511220031, -0.011878687672425007, -0.05088975097675322, -0.1288437983830986, 0.10244806609757623, 0.11994410197560985, 0.1322109955632924, 0.08249374490528219, 0.0969386727117218, -0.08557920974166389, -0.11439394814542671, 0.38816786341477133, 0.0415488605832924, -0.24781438339825557, 0.23418571918770886, -0.006630016450324784, -0.1541821526032805, 0.15107629573701517, 0.20072501329570144, 0.07850491534581111, -0.16615695830272592, 0.10214863642813989, -0.029898662417047264, 0.14888232209436272, -0.03768333071923774, 0.04823955586450039, 0.15131903833885124, 0.21605410146108572, 0.17643472237809413, 0.14828359122865536, -0.0873982424179659, -0.05915278382599354, -0.20901812940997921, -0.10566679436875426, -0.24051962715938038, -0.006245610520135665, -0.009153398131340931, -0.18031382189550693, 0.4300418635459104, 0.19660833519462714, 0.22201207783613083, 0.014818325593217236, 0.37993634778304375, 0.06148341038783985, -0.015289776065164124, 0.0886456946828875, 0.19787336853872714, 0.13056822504470314, 0.06683753571891482, -0.19602801357362204, 0.11695123360951201, 0.031678915064295994] |
1,803.01014 | Measurement of a Superconducting Qubit with a Microwave Photon Counter | Fast, high-fidelity measurement is a key ingredient for quantum error
correction. Conventional approaches to the measurement of superconducting
qubits, involving linear amplification of a microwave probe tone followed by
heterodyne detection at room temperature, do not scale well to large system
sizes. Here we introduce an alternative approach to measurement based on a
microwave photon counter. We demonstrate raw single-shot measurement fidelity
of 92%. Moreover, we exploit the intrinsic damping of the counter to extract
the energy released by the measurement process, allowing repeated high-fidelity
quantum non-demolition measurements. Crucially, our scheme provides access to
the classical outcome of projective quantum measurement at the millikelvin
stage. In a future system, counter-based measurement could form the basis for a
scalable quantum-to-classical interface.
| quant-ph | fast highfidelity measurement is a key ingredient for quantum error correction conventional approaches to the measurement of superconducting qubits involving linear amplification of a microwave probe tone followed by heterodyne detection at room temperature do not scale well to large system sizes here we introduce an alternative approach to measurement based on a microwave photon counter we demonstrate raw singleshot measurement fidelity of 92 moreover we exploit the intrinsic damping of the counter to extract the energy released by the measurement process allowing repeated highfidelity quantum nondemolition measurements crucially our scheme provides access to the classical outcome of projective quantum measurement at the millikelvin stage in a future system counterbased measurement could form the basis for a scalable quantumtoclassical interface | [['fast', 'highfidelity', 'measurement', 'is', 'a', 'key', 'ingredient', 'for', 'quantum', 'error', 'correction', 'conventional', 'approaches', 'to', 'the', 'measurement', 'of', 'superconducting', 'qubits', 'involving', 'linear', 'amplification', 'of', 'a', 'microwave', 'probe', 'tone', 'followed', 'by', 'heterodyne', 'detection', 'at', 'room', 'temperature', 'do', 'not', 'scale', 'well', 'to', 'large', 'system', 'sizes', 'here', 'we', 'introduce', 'an', 'alternative', 'approach', 'to', 'measurement', 'based', 'on', 'a', 'microwave', 'photon', 'counter', 'we', 'demonstrate', 'raw', 'singleshot', 'measurement', 'fidelity', 'of', '92', 'moreover', 'we', 'exploit', 'the', 'intrinsic', 'damping', 'of', 'the', 'counter', 'to', 'extract', 'the', 'energy', 'released', 'by', 'the', 'measurement', 'process', 'allowing', 'repeated', 'highfidelity', 'quantum', 'nondemolition', 'measurements', 'crucially', 'our', 'scheme', 'provides', 'access', 'to', 'the', 'classical', 'outcome', 'of', 'projective', 'quantum', 'measurement', 'at', 'the', 'millikelvin', 'stage', 'in', 'a', 'future', 'system', 'counterbased', 'measurement', 'could', 'form', 'the', 'basis', 'for', 'a', 'scalable', 'quantumtoclassical', 'interface']] | [-0.1380481985048391, 0.14527072769621252, -0.07214278704486787, -0.0040554796388429775, -0.03824066430485497, -0.21039749166423766, 0.09216559380098867, 0.3518329140264541, -0.24581083700953363, -0.30896853798961577, 0.06486080649726016, -0.25176175467204304, -0.0393563589619589, 0.2841926890978357, -0.04150602122535929, 0.1433182612604772, 0.06360534334380645, -0.02486755815722669, -0.06535498083685524, -0.18597642655756014, 0.2605317970834828, 0.13400719943553366, 0.3613552545934605, 0.0311541927823176, 0.17060761181928683, 0.027240445408582066, -0.039416138734668496, -0.05277126251991528, -0.09995560360427286, 0.06934679211311352, 0.2826788090945532, 0.09491998744003165, 0.2530886587454006, -0.4329271904891357, -0.17708000477481012, 0.08933651899763694, 0.10893962659950679, 0.2262096872999488, -0.06082650011230726, -0.2956396910478361, 0.019753022105336034, -0.1709382701315917, -0.07249091063858941, -0.13442227616518115, -0.05414676728347937, -0.07000930679884429, -0.2990661688769857, 0.08933694413184033, 0.03148398969109015, 0.04917422032449394, 0.028605014850230266, -0.0027310985703176507, 0.10059391425456851, 0.09244444049933614, -0.11774160365481899, 0.0298143087575833, 0.21432980327808765, -0.08510979224811308, -0.15276108584560763, 0.3035979311331175, -0.09677144988672808, -0.14947770428455745, 0.14289792799584877, -0.1375156830443302, -0.09027875490913478, 0.0962297192076221, 0.1623507133432819, 0.07491388066555374, -0.14845311105018483, -0.012590539866747956, 0.05708026385012393, 0.25930725391954185, 0.03368300369475037, 0.12608133065126215, 0.19544256926553014, 0.19300162240785237, 0.07130397273576819, 0.1402612136992199, -0.1529932607266043, -0.05254851242061705, -0.329105923383031, -0.18872201497821758, -0.22571214075821142, 0.12130943660170791, -0.05466782003835154, -0.13944638680356244, 0.37264542289882835, 0.20879974361208345, 0.18299324101341577, -0.00506203422943751, 0.40495255190568663, 0.08503891258733347, 0.084327698838509, -0.004487909884968152, 0.29452997075859455, 0.1489901764667593, 0.09211421998140092, -0.26560955290915444, 0.0591855306585785, 0.016322966432198882] |
1,803.01015 | The Dirac equation as a quantum walk over the honeycomb and triangular
lattices | A discrete-time Quantum Walk (QW) is essentially an operator driving the
evolution of a single particle on the lattice, through local unitaries. Some
QWs admit a continuum limit, leading to well-known physics partial differential
equations, such as the Dirac equation. We show that these simulation results
need not rely on the grid: the Dirac equation in $(2+1)$--dimensions can also
be simulated, through local unitaries, on the honeycomb or the triangular
lattice. The former is of interest in the study of graphene-like materials. The
latter, we argue, opens the door for a generalization of the Dirac equation to
arbitrary discrete surfaces.
| quant-ph cond-mat.mes-hall cs.DC hep-lat | a discretetime quantum walk qw is essentially an operator driving the evolution of a single particle on the lattice through local unitaries some qws admit a continuum limit leading to wellknown physics partial differential equations such as the dirac equation we show that these simulation results need not rely on the grid the dirac equation in 21dimensions can also be simulated through local unitaries on the honeycomb or the triangular lattice the former is of interest in the study of graphenelike materials the latter we argue opens the door for a generalization of the dirac equation to arbitrary discrete surfaces | [['a', 'discretetime', 'quantum', 'walk', 'qw', 'is', 'essentially', 'an', 'operator', 'driving', 'the', 'evolution', 'of', 'a', 'single', 'particle', 'on', 'the', 'lattice', 'through', 'local', 'unitaries', 'some', 'qws', 'admit', 'a', 'continuum', 'limit', 'leading', 'to', 'wellknown', 'physics', 'partial', 'differential', 'equations', 'such', 'as', 'the', 'dirac', 'equation', 'we', 'show', 'that', 'these', 'simulation', 'results', 'need', 'not', 'rely', 'on', 'the', 'grid', 'the', 'dirac', 'equation', 'in', '21dimensions', 'can', 'also', 'be', 'simulated', 'through', 'local', 'unitaries', 'on', 'the', 'honeycomb', 'or', 'the', 'triangular', 'lattice', 'the', 'former', 'is', 'of', 'interest', 'in', 'the', 'study', 'of', 'graphenelike', 'materials', 'the', 'latter', 'we', 'argue', 'opens', 'the', 'door', 'for', 'a', 'generalization', 'of', 'the', 'dirac', 'equation', 'to', 'arbitrary', 'discrete', 'surfaces']] | [-0.12415564822265879, 0.15021136102397578, -0.08268760286271572, 0.028666896431495843, -0.08270911895902827, -0.1549514795001596, 0.035270743954461066, 0.34384289715322663, -0.2908161480911076, -0.24158031925559043, 0.0802415774925612, -0.28119260662584566, -0.1643598827009555, 0.20865631807304452, -0.014650269709527493, 0.10629211275838316, 0.04112379161641002, 0.0040137023851275445, -0.09059494439279661, -0.24153029636479914, 0.32812053996138274, -0.004313983066240325, 0.2568234231136739, 0.052426045145839456, 0.09278349869418889, 0.008755501126870513, 0.041227989974431695, -0.004900940740481019, -0.12307447041188425, 0.06022032108157873, 0.18022023558150976, -0.039833538334351035, 0.22643781490623952, -0.4530233153887093, -0.2375532591342926, 0.07103602067567408, 0.1571832327824086, 0.17663856293074787, -0.0762137318670284, -0.3244542352762073, 0.03330640252679586, -0.12405825359979644, -0.1546830008458346, -0.05396870811935514, -0.06487527321092784, 0.008247089514043182, -0.24227479907218366, 0.06667282014008379, 0.08212660572957248, 0.023241820394323442, -0.041917025800794365, -0.07864081001840532, -0.060062747383490205, 0.08810650166822598, -0.05873122897697613, -0.026917583199683577, 0.12184416962787509, -0.10910847121849657, -0.18494140456430613, 0.46012416429817676, -0.07156712638679892, -0.2692817950528115, 0.14765255418955348, -0.16094896154478192, -0.11265420545358211, 0.09609268846921623, 0.14198890504427253, 0.11017861848638859, -0.1428492237557657, 0.1698245288990438, -0.10947404181584716, 0.11851622948888689, 0.003301057731732726, 0.03633571201469749, 0.20187388873193413, 0.13798504777252674, 0.13723384697921573, 0.13443937084753999, -0.02300459335441701, -0.16074853157391772, -0.30468277623294854, -0.18279915674822406, -0.21060585092753173, 0.13792431940571986, -0.10671362015797058, -0.2304354687104933, 0.41337901387363674, 0.1389972535939887, 0.17064734214916824, -0.0013915087841451167, 0.20964883828535677, 0.17805659031379037, 0.036354157887399194, 0.04394223313778639, 0.19239870228717337, 0.15598502846434711, 0.0926801920752041, -0.2392836957250256, 0.001013240956235677, 0.11071332112886012] |
1,803.01016 | Model-Free Control for Distributed Stream Data Processing using Deep
Reinforcement Learning | In this paper, we focus on general-purpose Distributed Stream Data Processing
Systems (DSDPSs), which deal with processing of unbounded streams of continuous
data at scale distributedly in real or near-real time. A fundamental problem in
a DSDPS is the scheduling problem with the objective of minimizing average
end-to-end tuple processing time. A widely-used solution is to distribute
workload evenly over machines in the cluster in a round-robin manner, which is
obviously not efficient due to lack of consideration for communication delay.
Model-based approaches do not work well either due to the high complexity of
the system environment. We aim to develop a novel model-free approach that can
learn to well control a DSDPS from its experience rather than accurate and
mathematically solvable system models, just as a human learns a skill (such as
cooking, driving, swimming, etc). Specifically, we, for the first time, propose
to leverage emerging Deep Reinforcement Learning (DRL) for enabling model-free
control in DSDPSs; and present design, implementation and evaluation of a novel
and highly effective DRL-based control framework, which minimizes average
end-to-end tuple processing time by jointly learning the system environment via
collecting very limited runtime statistics data and making decisions under the
guidance of powerful Deep Neural Networks. To validate and evaluate the
proposed framework, we implemented it based on a widely-used DSDPS, Apache
Storm, and tested it with three representative applications. Extensive
experimental results show 1) Compared to Storm's default scheduler and the
state-of-the-art model-based method, the proposed framework reduces average
tuple processing by 33.5% and 14.0% respectively on average. 2) The proposed
framework can quickly reach a good scheduling solution during online learning,
which justifies its practicability for online control in DSDPSs.
| cs.DC cs.AI | in this paper we focus on generalpurpose distributed stream data processing systems dsdpss which deal with processing of unbounded streams of continuous data at scale distributedly in real or nearreal time a fundamental problem in a dsdps is the scheduling problem with the objective of minimizing average endtoend tuple processing time a widelyused solution is to distribute workload evenly over machines in the cluster in a roundrobin manner which is obviously not efficient due to lack of consideration for communication delay modelbased approaches do not work well either due to the high complexity of the system environment we aim to develop a novel modelfree approach that can learn to well control a dsdps from its experience rather than accurate and mathematically solvable system models just as a human learns a skill such as cooking driving swimming etc specifically we for the first time propose to leverage emerging deep reinforcement learning drl for enabling modelfree control in dsdpss and present design implementation and evaluation of a novel and highly effective drlbased control framework which minimizes average endtoend tuple processing time by jointly learning the system environment via collecting very limited runtime statistics data and making decisions under the guidance of powerful deep neural networks to validate and evaluate the proposed framework we implemented it based on a widelyused dsdps apache storm and tested it with three representative applications extensive experimental results show 1 compared to storms default scheduler and the stateoftheart modelbased method the proposed framework reduces average tuple processing by 335 and 140 respectively on average 2 the proposed framework can quickly reach a good scheduling solution during online learning which justifies its practicability for online control in dsdpss | [['in', 'this', 'paper', 'we', 'focus', 'on', 'generalpurpose', 'distributed', 'stream', 'data', 'processing', 'systems', 'dsdpss', 'which', 'deal', 'with', 'processing', 'of', 'unbounded', 'streams', 'of', 'continuous', 'data', 'at', 'scale', 'distributedly', 'in', 'real', 'or', 'nearreal', 'time', 'a', 'fundamental', 'problem', 'in', 'a', 'dsdps', 'is', 'the', 'scheduling', 'problem', 'with', 'the', 'objective', 'of', 'minimizing', 'average', 'endtoend', 'tuple', 'processing', 'time', 'a', 'widelyused', 'solution', 'is', 'to', 'distribute', 'workload', 'evenly', 'over', 'machines', 'in', 'the', 'cluster', 'in', 'a', 'roundrobin', 'manner', 'which', 'is', 'obviously', 'not', 'efficient', 'due', 'to', 'lack', 'of', 'consideration', 'for', 'communication', 'delay', 'modelbased', 'approaches', 'do', 'not', 'work', 'well', 'either', 'due', 'to', 'the', 'high', 'complexity', 'of', 'the', 'system', 'environment', 'we', 'aim', 'to', 'develop', 'a', 'novel', 'modelfree', 'approach', 'that', 'can', 'learn', 'to', 'well', 'control', 'a', 'dsdps', 'from', 'its', 'experience', 'rather', 'than', 'accurate', 'and', 'mathematically', 'solvable', 'system', 'models', 'just', 'as', 'a', 'human', 'learns', 'a', 'skill', 'such', 'as', 'cooking', 'driving', 'swimming', 'etc', 'specifically', 'we', 'for', 'the', 'first', 'time', 'propose', 'to', 'leverage', 'emerging', 'deep', 'reinforcement', 'learning', 'drl', 'for', 'enabling', 'modelfree', 'control', 'in', 'dsdpss', 'and', 'present', 'design', 'implementation', 'and', 'evaluation', 'of', 'a', 'novel', 'and', 'highly', 'effective', 'drlbased', 'control', 'framework', 'which', 'minimizes', 'average', 'endtoend', 'tuple', 'processing', 'time', 'by', 'jointly', 'learning', 'the', 'system', 'environment', 'via', 'collecting', 'very', 'limited', 'runtime', 'statistics', 'data', 'and', 'making', 'decisions', 'under', 'the', 'guidance', 'of', 'powerful', 'deep', 'neural', 'networks', 'to', 'validate', 'and', 'evaluate', 'the', 'proposed', 'framework', 'we', 'implemented', 'it', 'based', 'on', 'a', 'widelyused', 'dsdps', 'apache', 'storm', 'and', 'tested', 'it', 'with', 'three', 'representative', 'applications', 'extensive', 'experimental', 'results', 'show', '1', 'compared', 'to', 'storms', 'default', 'scheduler', 'and', 'the', 'stateoftheart', 'modelbased', 'method', 'the', 'proposed', 'framework', 'reduces', 'average', 'tuple', 'processing', 'by', '335', 'and', '140', 'respectively', 'on', 'average', '2', 'the', 'proposed', 'framework', 'can', 'quickly', 'reach', 'a', 'good', 'scheduling', 'solution', 'during', 'online', 'learning', 'which', 'justifies', 'its', 'practicability', 'for', 'online', 'control', 'in', 'dsdpss']] | [-0.09083846753202779, 0.0051210462708213104, -0.08220120352329052, 0.04722972376994775, -0.10675689003740747, -0.18465386399762257, 0.07652563361432671, 0.4489074469841082, -0.27283626204476724, -0.3519973070310649, 0.11071708839299911, -0.23043798036632582, -0.1700326775252405, 0.21723914861230106, -0.13329440024163988, 0.12017118256484029, 0.10036659129064089, 0.040254503438052286, -0.03206401251769277, -0.25988044939921856, 0.23681431391575178, 0.06548186691413636, 0.34153133477368075, 0.013293815370086634, 0.15117257109202284, 0.01724459185418556, -0.026931862873930693, -0.009517536677610409, -0.04415552557532539, 0.15113166945579204, 0.3115319509038354, 0.2163842356802168, 0.35658194969565105, -0.4238338747452344, -0.19598558912968336, 0.08848721676299141, 0.15741983302418264, 0.05821821483279375, -0.05601113264517371, -0.28946406039572903, 0.0895956222804123, -0.19514209574871233, -0.01339095021601379, -0.11344835267645911, -0.003987517583394243, -0.006793969234044407, -0.3038476385580089, 0.017843506035564373, 0.026318235525203782, 0.05712502758464044, -0.0770623389482131, -0.07856249980216239, 0.07706998019415792, 0.13602941446290034, 0.006684052868909786, 0.06284463292281527, 0.17005538334235495, -0.11643120930815432, -0.14954178583746489, 0.3941290254327452, -0.05215099240816157, -0.1739408959581193, 0.18985140376130125, -0.017428727818012076, -0.1380356734728701, 0.09387466202967376, 0.26380991741266324, 0.12358595230733462, -0.1950900668935937, 0.01772185294337297, 0.002283900822629638, 0.18422996583244494, 0.003076768455414375, -0.0035733437441217656, 0.15132372955354365, 0.2572408775001177, 0.0980252401918293, 0.1344429420091973, -0.06011352142716314, -0.1253946764276974, -0.211888450774945, -0.1188160339874732, -0.17336094261674498, -0.01912090576437008, -0.08335235480532696, -0.1252462169217337, 0.3676373663668831, 0.22711766874102632, 0.18307568863373064, 0.1373575789107871, 0.3875887688064921, 0.06780743958365079, 0.08894488289718613, 0.14986336691802415, 0.15822119618378794, 0.006433913142480437, 0.16657097431318668, -0.2034946832994473, 0.10233348414533869, 0.0009667255555189425] |
1,803.01017 | A limit theorem for a class of stationary increments L\'{e}vy moving
average process with multiple singularities | In this paper we present some new limit theorems for power variations of
stationary increment L\'{e}vy driven moving average processes. Recently, such
asymptotic results have been investigated in [Ann. Probab. 45(6B) (2017),
4477--4528, Festschrift for Bernt {\O}ksendal, Stochastics 81(1) (2017),
360--383] under the assumption that the kernel function potentially exhibits a
singular behaviour at $0$. The aim of this work is to demonstrate how some of
the results change when the kernel function has multiple singularity points.
Our paper is also related to the article [Stoch. Process. Appl. 125(2) (2014),
653--677] that studied the same mathematical question for the class of Brownian
semi-stationary models.
| math.PR | in this paper we present some new limit theorems for power variations of stationary increment levy driven moving average processes recently such asymptotic results have been investigated in ann probab 456b 2017 44774528 festschrift for bernt oksendal stochastics 811 2017 360383 under the assumption that the kernel function potentially exhibits a singular behaviour at 0 the aim of this work is to demonstrate how some of the results change when the kernel function has multiple singularity points our paper is also related to the article stoch process appl 1252 2014 653677 that studied the same mathematical question for the class of brownian semistationary models | [['in', 'this', 'paper', 'we', 'present', 'some', 'new', 'limit', 'theorems', 'for', 'power', 'variations', 'of', 'stationary', 'increment', 'levy', 'driven', 'moving', 'average', 'processes', 'recently', 'such', 'asymptotic', 'results', 'have', 'been', 'investigated', 'in', 'ann', 'probab', '456b', '2017', '44774528', 'festschrift', 'for', 'bernt', 'oksendal', 'stochastics', '811', '2017', '360383', 'under', 'the', 'assumption', 'that', 'the', 'kernel', 'function', 'potentially', 'exhibits', 'a', 'singular', 'behaviour', 'at', '0', 'the', 'aim', 'of', 'this', 'work', 'is', 'to', 'demonstrate', 'how', 'some', 'of', 'the', 'results', 'change', 'when', 'the', 'kernel', 'function', 'has', 'multiple', 'singularity', 'points', 'our', 'paper', 'is', 'also', 'related', 'to', 'the', 'article', 'stoch', 'process', 'appl', '1252', '2014', '653677', 'that', 'studied', 'the', 'same', 'mathematical', 'question', 'for', 'the', 'class', 'of', 'brownian', 'semistationary', 'models']] | [-0.05243160137483342, 0.049771639821825156, -0.11554794028316709, 0.030853296924742424, -0.047560231580229644, -0.07706482754079531, 0.03170876999972435, 0.34810313675552607, -0.24400359867234725, -0.26804246164557305, 0.11451526511357063, -0.2775803556186006, -0.2241059367290952, 0.19697651929325527, -0.1421468271732782, 0.08765991052819623, 0.03380848495101537, -0.02385490614394046, -0.005277562463148074, -0.2886751541265785, 0.30756841065371504, 0.07886944563984118, 0.27675836428887013, 0.06531174886546032, 0.11777660563456441, -0.004505030114692871, -0.04890210414187738, -0.030730209990658543, -0.17930755171189297, 0.06841841682961042, 0.2408785005916228, 0.04066123488603743, 0.32807460913641584, -0.35738071151115375, -0.22010135718367316, 0.14210933176071544, 0.09640487211972776, 0.04138652296887353, -0.007043859131182685, -0.2744971358245521, 0.11697151558003341, -0.1537911638692774, -0.16246153420364165, -0.031003189694155196, 0.10547704013967604, 0.03887423791104194, -0.28503063032309517, 0.11558087022870431, 0.16280950289784055, 0.07849853916676959, -0.0335877979635214, -0.1330093104072442, 0.03481353495524011, 0.07268045705212797, 0.06534517023476039, 0.03303005989885541, 0.0984113364706211, -0.09218542932090584, -0.15427258742427585, 0.2807776111888351, -0.08081832709675184, -0.16935120954770932, 0.20382043804898106, -0.14168462809645618, -0.22300055333309704, 0.08521784490886887, 0.18621440545063128, 0.13396085353304793, -0.19586021756836228, 0.1636873543488257, -0.08160070390111268, 0.08028550011886641, 0.12936411839627632, -0.02376342372912349, 0.11046984027412654, 0.12373425686647269, 0.03951311187884497, 0.12806507732926142, -0.09029826344545892, -0.12358644009200913, -0.30465163542204676, -0.15403291305545905, -0.1696422751146284, 0.08614128688585503, -0.03762985537806996, -0.14512127437487696, 0.37816697223149615, 0.18814189686919702, 0.17242053129023524, 0.07983709429625911, 0.16007028085607658, 0.1870328459872234, -0.07547551054375792, 0.1340253594039817, 0.21216511995722118, 0.1240716846800889, 0.1669172661642384, -0.15525860223693377, 0.05307199258940539, 0.059458422507488666] |
1,803.01018 | The EBEX Balloon Borne Experiment - Detectors and Readout | EBEX was a long-duration balloon-borne experiment to measure the polarization
of the cosmic microwave background. The experiment had three frequency bands
centered at 150, 250, and 410 GHz and was the first to use a kilo-pixel array
of transition edge sensor (TES) bolometers aboard a balloon platform; shortly
after reaching float we operated 504, 342, and 109 TESs at each of the bands,
respectively. We describe the design and characterization of the array and the
readout system. We give the distributions of measured thermal conductances,
normal resistances, and transition temperatures. With the exception of the
thermal conductance at 150 GHz. We measured median low-loop-gain time constants
$\tau_{0}=$ 88, 46, and 57 ms and compare them to predictions. Two measurements
of bolometer absorption efficiency show high ($\sim$0.9) efficiency at 150 GHz
and medium ($\sim$0.35, and $\sim$0.25) at the two higher bands, respectively.
We measure a median total optical load of 3.6, 5.3 and 5.0 pW absorbed at the
three bands, respectively. EBEX pioneered the use of the digital version of the
frequency domain multiplexing (FDM) system which multiplexed the bias and
readout of 16 bolometers onto two wires. We present accounting of the measured
noise equivalent power. The median per-detector noise equivalent temperatures
referred to a black body with a temperature of 2.725 K are 400, 920, and 14500
$\mu$K$\sqrt{s}$ for the three bands, respectively. We compare these values to
our pre-flight predictions and to a previous balloon payload, discuss the
sources of excess noise, and the path for a future payload to make full use of
the balloon environment.
| astro-ph.IM | ebex was a longduration balloonborne experiment to measure the polarization of the cosmic microwave background the experiment had three frequency bands centered at 150 250 and 410 ghz and was the first to use a kilopixel array of transition edge sensor tes bolometers aboard a balloon platform shortly after reaching float we operated 504 342 and 109 tess at each of the bands respectively we describe the design and characterization of the array and the readout system we give the distributions of measured thermal conductances normal resistances and transition temperatures with the exception of the thermal conductance at 150 ghz we measured median lowloopgain time constants tau_0 88 46 and 57 ms and compare them to predictions two measurements of bolometer absorption efficiency show high sim09 efficiency at 150 ghz and medium sim035 and sim025 at the two higher bands respectively we measure a median total optical load of 36 53 and 50 pw absorbed at the three bands respectively ebex pioneered the use of the digital version of the frequency domain multiplexing fdm system which multiplexed the bias and readout of 16 bolometers onto two wires we present accounting of the measured noise equivalent power the median perdetector noise equivalent temperatures referred to a black body with a temperature of 2725 k are 400 920 and 14500 muksqrts for the three bands respectively we compare these values to our preflight predictions and to a previous balloon payload discuss the sources of excess noise and the path for a future payload to make full use of the balloon environment | [['ebex', 'was', 'a', 'longduration', 'balloonborne', 'experiment', 'to', 'measure', 'the', 'polarization', 'of', 'the', 'cosmic', 'microwave', 'background', 'the', 'experiment', 'had', 'three', 'frequency', 'bands', 'centered', 'at', '150', '250', 'and', '410', 'ghz', 'and', 'was', 'the', 'first', 'to', 'use', 'a', 'kilopixel', 'array', 'of', 'transition', 'edge', 'sensor', 'tes', 'bolometers', 'aboard', 'a', 'balloon', 'platform', 'shortly', 'after', 'reaching', 'float', 'we', 'operated', '504', '342', 'and', '109', 'tess', 'at', 'each', 'of', 'the', 'bands', 'respectively', 'we', 'describe', 'the', 'design', 'and', 'characterization', 'of', 'the', 'array', 'and', 'the', 'readout', 'system', 'we', 'give', 'the', 'distributions', 'of', 'measured', 'thermal', 'conductances', 'normal', 'resistances', 'and', 'transition', 'temperatures', 'with', 'the', 'exception', 'of', 'the', 'thermal', 'conductance', 'at', '150', 'ghz', 'we', 'measured', 'median', 'lowloopgain', 'time', 'constants', 'tau_0', '88', '46', 'and', '57', 'ms', 'and', 'compare', 'them', 'to', 'predictions', 'two', 'measurements', 'of', 'bolometer', 'absorption', 'efficiency', 'show', 'high', 'sim09', 'efficiency', 'at', '150', 'ghz', 'and', 'medium', 'sim035', 'and', 'sim025', 'at', 'the', 'two', 'higher', 'bands', 'respectively', 'we', 'measure', 'a', 'median', 'total', 'optical', 'load', 'of', '36', '53', 'and', '50', 'pw', 'absorbed', 'at', 'the', 'three', 'bands', 'respectively', 'ebex', 'pioneered', 'the', 'use', 'of', 'the', 'digital', 'version', 'of', 'the', 'frequency', 'domain', 'multiplexing', 'fdm', 'system', 'which', 'multiplexed', 'the', 'bias', 'and', 'readout', 'of', '16', 'bolometers', 'onto', 'two', 'wires', 'we', 'present', 'accounting', 'of', 'the', 'measured', 'noise', 'equivalent', 'power', 'the', 'median', 'perdetector', 'noise', 'equivalent', 'temperatures', 'referred', 'to', 'a', 'black', 'body', 'with', 'a', 'temperature', 'of', '2725', 'k', 'are', '400', '920', 'and', '14500', 'muksqrts', 'for', 'the', 'three', 'bands', 'respectively', 'we', 'compare', 'these', 'values', 'to', 'our', 'preflight', 'predictions', 'and', 'to', 'a', 'previous', 'balloon', 'payload', 'discuss', 'the', 'sources', 'of', 'excess', 'noise', 'and', 'the', 'path', 'for', 'a', 'future', 'payload', 'to', 'make', 'full', 'use', 'of', 'the', 'balloon', 'environment']] | [-0.11177555249337151, 0.16500586927605698, -0.018612735063120257, -0.020209045527622482, -0.01165054703914064, -0.13667798217328025, 0.09524943877884878, 0.42621013725807, -0.17615044783938547, -0.37949888311609165, 0.119495791580586, -0.36066685897816364, -0.010572331480986297, 0.2104250166749995, 0.0004021002999814916, 0.022701986987972253, 0.026164343276202446, -0.05879204080789803, -0.046594689708884356, -0.18909038690639957, 0.18423722531095668, 0.1391760037445503, 0.2977989937001223, 0.01764361149584331, 0.16375950077396423, -0.04806781789751774, -0.05644954677199191, -0.021630626626617133, -0.14658576705941934, 0.030583664707853984, 0.24213185097029294, 0.04586564974382824, 0.19358648802629394, -0.3566880618545484, -0.13469115144424576, 0.07393928767446473, 0.03610580205529609, 0.01176291989146257, 0.033754955052673556, -0.27296082725103377, 0.08380592352296642, -0.17760219450782738, -0.11673775566596871, 0.047572900641234844, 0.02441750013437992, 0.0014653945530145084, -0.22016156833833592, 0.053711299001735706, -0.024180275879486405, 0.07060946894135572, -0.09644468996145197, -0.1778333690479499, -0.0019843009642981253, 0.09239398047023595, -0.07721369838566748, 0.037544539997332406, 0.1858535814247364, -0.056532923491845626, -0.08525778477058424, 0.3444094363697859, -0.12416585789928176, -0.018759683010092273, 0.1805788860493249, -0.21361917373973419, -0.07273156957697224, 0.1783839387797428, 0.1465085041283445, 0.04619257458338898, -0.1697443235123798, -0.016245644207788335, 0.07454535195600343, 0.21433232712164405, 0.1185725518766834, 0.06596202767999473, 0.24668921880390163, 0.17287705801581377, 0.05927529205579006, 0.1425466894173038, -0.25862189368827265, 0.029595775220782997, -0.2710608347474891, -0.1396671021293762, -0.1514062525866216, 0.06438312257534973, -0.0828205461093249, -0.07492182757646564, 0.4124628588202109, 0.1575706082691551, 0.17722134875742435, 0.08207294692653178, 0.3048051977131501, 0.07209125101060791, 0.06128763591649612, 0.0638701780545181, 0.28603258061472775, 0.16796798896540957, 0.1414346133761021, -0.19760756646844663, -0.06288286532974777, -0.06978829059766149] |
1,803.01019 | Semidiscrete approximation to Benjamin-type equations | In this paper a semidiscrete Fourier pseudospectral method for approximating
Benjamin-type equations is introduced and analyzed. A study of convergence is
presented.
| math.NA | in this paper a semidiscrete fourier pseudospectral method for approximating benjamintype equations is introduced and analyzed a study of convergence is presented | [['in', 'this', 'paper', 'a', 'semidiscrete', 'fourier', 'pseudospectral', 'method', 'for', 'approximating', 'benjamintype', 'equations', 'is', 'introduced', 'and', 'analyzed', 'a', 'study', 'of', 'convergence', 'is', 'presented']] | [-0.10835850700026467, 0.009635809055041699, -0.16914635533023448, 0.06887020302071635, -0.017739803663321903, -0.08428237733564206, -0.05158097948324645, 0.34241680871872676, -0.2659232508213747, -0.1803395091777756, 0.14793337909837387, -0.2023886733111881, -0.18474680256275905, 0.19652334689384415, -0.10345658819590296, 0.15631776586884544, 0.11533725376994837, -0.09878836847132161, -0.13574937704418386, -0.22800801951615585, 0.2591384259008226, 0.018205501493953523, 0.2582758044203122, -0.0048288654181219285, 0.17016524488904647, -0.0641947662280429, -0.15672929620458967, 0.03066573380714371, -0.18610213475213164, 0.15967995957249687, 0.2750213637593247, 0.045501419564797765, 0.35992877149865743, -0.31838113424323855, -0.18608286369237162, 0.06264150067276898, 0.2350487464240619, 0.06468046669449125, -0.1394829581092511, -0.26467368184101014, 0.15701628609427384, -0.13287435795757033, -0.17068704590201378, -0.15516747977761997, -0.027386941193115143, 0.08154164404342217, -0.3130736570982706, 0.10674181185840141, 0.07657184429644119, 0.09320186468816939, -0.089630205295093, -0.0353594489750408, 0.0700475178836357, -0.03876813208418233, 0.017896800446102305, 0.0013038566491256158, -0.07964059830244098, -0.0022994073972638163, -0.06585490916456495, 0.4101763218641281, -0.06529557303569856, -0.34717304614328204, 0.09263634220475242, -0.09263431635640916, -0.1346732617488929, 0.10356863605834189, 0.24606219723465897, 0.24459276202001742, -0.24038955915187085, 0.1485701107303612, -0.06734700465486163, 0.1325693391263485, 0.08901691565378791, -0.0690878973830314, -0.057315695143881296, 0.2601288939338355, 0.08777953999205715, 0.20389228367379733, -0.04120487409333388, -0.14430593752435275, -0.3250793663873559, -0.22342137584374064, -0.278868453843253, -0.03565607104627859, -0.03428246808124684, -0.2065832886312689, 0.47270402986378895, 0.14273613549414135, 0.05102986594041189, 0.11488899038661093, 0.3369581080817928, 0.2545417623505706, -0.07668858899601869, 0.12674942736824354, 0.16713492094450408, 0.234004302748612, 0.1563355615806012, -0.25766341020131395, -0.016317105430754878, 0.2922655531604375] |
1,803.0102 | Bohmian mechanics and Fisher information for $q$-deformed Schr\"odinger
equation | We discuss the Bohmian mechanics by means of the deformed Schr\"odinger
equation for position dependent mass, in the context of a $q$-algebra inspired
by nonextensive statistics. A deduction of the Bohmian quantum formalism is
performed by means of a deformed Fisher information functional, from which a
deformed Cram\'er-Rao bound is derived. Lagrangian and Hamiltonian
formulations, inherited by the $q$-algebra, are also developed. Then, we
illustrate the results with a particle confined in an infinite square potential
well. The preservation of the deformed Cram\'er-Rao bound for the stationary
states shows the role played by the $q$-algebraic structure.
| quant-ph | we discuss the bohmian mechanics by means of the deformed schrodinger equation for position dependent mass in the context of a qalgebra inspired by nonextensive statistics a deduction of the bohmian quantum formalism is performed by means of a deformed fisher information functional from which a deformed cramerrao bound is derived lagrangian and hamiltonian formulations inherited by the qalgebra are also developed then we illustrate the results with a particle confined in an infinite square potential well the preservation of the deformed cramerrao bound for the stationary states shows the role played by the qalgebraic structure | [['we', 'discuss', 'the', 'bohmian', 'mechanics', 'by', 'means', 'of', 'the', 'deformed', 'schrodinger', 'equation', 'for', 'position', 'dependent', 'mass', 'in', 'the', 'context', 'of', 'a', 'qalgebra', 'inspired', 'by', 'nonextensive', 'statistics', 'a', 'deduction', 'of', 'the', 'bohmian', 'quantum', 'formalism', 'is', 'performed', 'by', 'means', 'of', 'a', 'deformed', 'fisher', 'information', 'functional', 'from', 'which', 'a', 'deformed', 'cramerrao', 'bound', 'is', 'derived', 'lagrangian', 'and', 'hamiltonian', 'formulations', 'inherited', 'by', 'the', 'qalgebra', 'are', 'also', 'developed', 'then', 'we', 'illustrate', 'the', 'results', 'with', 'a', 'particle', 'confined', 'in', 'an', 'infinite', 'square', 'potential', 'well', 'the', 'preservation', 'of', 'the', 'deformed', 'cramerrao', 'bound', 'for', 'the', 'stationary', 'states', 'shows', 'the', 'role', 'played', 'by', 'the', 'qalgebraic', 'structure']] | [-0.07510697265206545, 0.15158318333503, -0.15400128512798497, 0.11200939452828607, -0.027320170144472893, -0.1085463488852838, -0.005379262819284729, 0.2705848431432969, -0.2710571762290783, -0.2790250926239726, 0.04116189993267957, -0.2729092714046904, -0.18470672351152947, 0.16463539389102758, -0.07341743525466882, 0.0990619546258434, 0.057214805761759635, 0.101323646051848, -0.11545748365460895, -0.18167817933863262, 0.34203881599387387, 0.0921953415418102, 0.2603889860329218, 0.018157702465638675, 0.11491243812876444, 0.06672458998703708, -0.0041082933397168135, 0.047178447829840785, -0.18661974315182306, 0.16118205687659307, 0.16862769582257897, 0.11782456998480484, 0.2651284777020919, -0.41705449495930225, -0.20716566474826928, 0.032959043640100084, 0.15488827868345348, 0.11487940155954372, -0.06890990461882514, -0.38803856253313523, -0.024213178335533787, -0.19053104025078937, -0.20333825224952307, -0.07907615213055881, 0.010237468037909517, 0.002322559625705859, -0.2158467557728727, 0.11635202710719265, 0.07624946866296038, 0.04827564916922711, -0.07067687778908294, -0.09844204515684396, -0.036068338757710684, 0.05977463184232571, -0.016839266017389793, -0.018206035278126365, 0.1436597026719634, -0.130688571558494, -0.11486200836710243, 0.380922477178198, -0.046562827497837134, -0.2865520819905214, 0.04275113738791939, -0.10796471967478283, -0.12223926973820198, 0.06730125270163019, 0.07358107482044336, 0.12165405283546231, -0.1570941277223028, 0.17123938358599844, -0.04526665710727684, 0.11246822092895552, 0.06918869113724213, 0.036201890567705654, 0.19264902321932217, 0.12644710100236503, 0.03680171451317923, 0.15814547387708444, -0.05407700826860188, -0.22020680821394004, -0.337222413198712, -0.15603864007763, -0.252095351201812, 0.05586259739357047, -0.06966860382559996, -0.12490446062777967, 0.3426126807462424, 0.08687340176159826, 0.14903672143797544, 0.03366607911326961, 0.23652424491592683, 0.19004812609637156, 0.010022600134107051, 0.060813880641944706, 0.2661510679123846, 0.23929969086748315, 0.04280868752296859, -0.2366062886940199, -0.018152898834311298, 0.13241375780004697] |
1,803.01021 | Noise-induced backscattering in a quantum-spin-Hall edge | Time-reversal symmetry suppresses electron backscattering in a
quantum-spin-Hall edge, yielding quantized conductance at zero temperature.
Understanding the dominant corrections in finite-temperature experiments
remains an unsettled issue. We study a novel mechanism for conductance
suppression: backscattering caused by incoherent electromagnetic noise.
Specifically, we show that an electric potential fluctuating randomly in time
can backscatter electrons inelastically without constraints faced by
electron-electron interactions. We quantify noise-induced corrections to the dc
conductance in various regimes and propose an experiment to test this scenario.
| cond-mat.mes-hall | timereversal symmetry suppresses electron backscattering in a quantumspinhall edge yielding quantized conductance at zero temperature understanding the dominant corrections in finitetemperature experiments remains an unsettled issue we study a novel mechanism for conductance suppression backscattering caused by incoherent electromagnetic noise specifically we show that an electric potential fluctuating randomly in time can backscatter electrons inelastically without constraints faced by electronelectron interactions we quantify noiseinduced corrections to the dc conductance in various regimes and propose an experiment to test this scenario | [['timereversal', 'symmetry', 'suppresses', 'electron', 'backscattering', 'in', 'a', 'quantumspinhall', 'edge', 'yielding', 'quantized', 'conductance', 'at', 'zero', 'temperature', 'understanding', 'the', 'dominant', 'corrections', 'in', 'finitetemperature', 'experiments', 'remains', 'an', 'unsettled', 'issue', 'we', 'study', 'a', 'novel', 'mechanism', 'for', 'conductance', 'suppression', 'backscattering', 'caused', 'by', 'incoherent', 'electromagnetic', 'noise', 'specifically', 'we', 'show', 'that', 'an', 'electric', 'potential', 'fluctuating', 'randomly', 'in', 'time', 'can', 'backscatter', 'electrons', 'inelastically', 'without', 'constraints', 'faced', 'by', 'electronelectron', 'interactions', 'we', 'quantify', 'noiseinduced', 'corrections', 'to', 'the', 'dc', 'conductance', 'in', 'various', 'regimes', 'and', 'propose', 'an', 'experiment', 'to', 'test', 'this', 'scenario']] | [-0.2366392286727205, 0.24175288694295888, -0.04451663695581374, 0.09203614001598907, -0.007500184117816389, -0.20791562332306057, 0.08106723250239156, 0.3627978487755172, -0.3027534088352695, -0.2800717214355245, -0.08690457136835902, -0.35113255440373903, -0.17045092623448, 0.13637473674025385, -0.03852201224653982, 0.024703695776406676, -0.01691543102497235, -0.08677306619938463, -0.052396442773169835, -0.16453957674384584, 0.3045511136588175, 0.1022535951808095, 0.3360232601815369, 0.1528856267046649, 0.030629935674369335, 0.039515182227478365, 0.01621464298950741, 0.02146426789695397, -0.08834708477124878, -0.06875410254579037, 0.2450735115853604, -0.09496344130311626, 0.2220563732087612, -0.5276189542375505, -0.1968028281640727, 0.09135731820424553, 0.15283909983991179, 0.1970915137324482, -0.12439463785121915, -0.2953897607396357, 0.03092581166420132, -0.15876670043217017, -0.13452426285948604, -0.09811107168206945, -0.03191605443134904, -0.11025064444693271, -0.2862700812984258, 0.130474006748409, 0.053982759529026224, 0.024740129138808697, -0.06160277562594274, -0.024793434306047857, 0.02017023532971507, 0.035482039232738315, 0.05963122426182963, -0.0019656500808196142, 0.20847319174354198, -0.177192133225617, -0.15340886642370605, 0.33027162960497664, -0.07401131911901757, -0.13323853921028786, 0.12748663414968178, -0.16142689167172647, -0.07015380189113785, 0.18659535825136117, 0.15775184132071446, 0.05341869381372817, -0.1930975092225708, 0.060578935301600724, 0.010697843687376007, 0.1415309897158295, 0.04599184781254735, 0.07320331847877241, 0.2559210144740064, 0.17103827425744383, 0.05007824633212295, 0.1513379251700826, -0.15094307479448615, -0.02478591399267316, -0.2617963313939981, -0.05349424090236425, -0.17876271837885724, 0.09655850316630676, -0.014927970782082411, -0.12521046289475635, 0.3667759645846672, 0.2236315237125382, 0.18339470609207636, -0.030604847602080553, 0.3747149320784956, 0.17400662981090137, 0.018795302085345612, 0.04583699392387643, 0.23666572511428968, 0.1401617897732649, 0.09468205956509337, -0.37197390652727336, 0.048108861072614674, -0.02068762930575758] |
1,803.01022 | Programming Quantum Computers Using Design Automation | Recent developments in quantum hardware indicate that systems featuring more
than 50 physical qubits are within reach. At this scale, classical simulation
will no longer be feasible and there is a possibility that such quantum devices
may outperform even classical supercomputers at certain tasks. With the rapid
growth of qubit numbers and coherence times comes the increasingly difficult
challenge of quantum program compilation. This entails the translation of a
high-level description of a quantum algorithm to hardware-specific low-level
operations which can be carried out by the quantum device. Some parts of the
calculation may still be performed manually due to the lack of efficient
methods. This, in turn, may lead to a design gap, which will prevent the
programming of a quantum computer. In this paper, we discuss the challenges in
fully-automatic quantum compilation. We motivate directions for future research
to tackle these challenges. Yet, with the algorithms and approaches that exist
today, we demonstrate how to automatically perform the quantum programming flow
from algorithm to a physical quantum computer for a simple algorithmic
benchmark, namely the hidden shift problem. We present and use two tool flows
which invoke RevKit. One which is based on ProjectQ and which targets the IBM
Quantum Experience or a local simulator, and one which is based on Microsoft's
quantum programming language Q$\#$.
| quant-ph cs.ET | recent developments in quantum hardware indicate that systems featuring more than 50 physical qubits are within reach at this scale classical simulation will no longer be feasible and there is a possibility that such quantum devices may outperform even classical supercomputers at certain tasks with the rapid growth of qubit numbers and coherence times comes the increasingly difficult challenge of quantum program compilation this entails the translation of a highlevel description of a quantum algorithm to hardwarespecific lowlevel operations which can be carried out by the quantum device some parts of the calculation may still be performed manually due to the lack of efficient methods this in turn may lead to a design gap which will prevent the programming of a quantum computer in this paper we discuss the challenges in fullyautomatic quantum compilation we motivate directions for future research to tackle these challenges yet with the algorithms and approaches that exist today we demonstrate how to automatically perform the quantum programming flow from algorithm to a physical quantum computer for a simple algorithmic benchmark namely the hidden shift problem we present and use two tool flows which invoke revkit one which is based on projectq and which targets the ibm quantum experience or a local simulator and one which is based on microsofts quantum programming language q | [['recent', 'developments', 'in', 'quantum', 'hardware', 'indicate', 'that', 'systems', 'featuring', 'more', 'than', '50', 'physical', 'qubits', 'are', 'within', 'reach', 'at', 'this', 'scale', 'classical', 'simulation', 'will', 'no', 'longer', 'be', 'feasible', 'and', 'there', 'is', 'a', 'possibility', 'that', 'such', 'quantum', 'devices', 'may', 'outperform', 'even', 'classical', 'supercomputers', 'at', 'certain', 'tasks', 'with', 'the', 'rapid', 'growth', 'of', 'qubit', 'numbers', 'and', 'coherence', 'times', 'comes', 'the', 'increasingly', 'difficult', 'challenge', 'of', 'quantum', 'program', 'compilation', 'this', 'entails', 'the', 'translation', 'of', 'a', 'highlevel', 'description', 'of', 'a', 'quantum', 'algorithm', 'to', 'hardwarespecific', 'lowlevel', 'operations', 'which', 'can', 'be', 'carried', 'out', 'by', 'the', 'quantum', 'device', 'some', 'parts', 'of', 'the', 'calculation', 'may', 'still', 'be', 'performed', 'manually', 'due', 'to', 'the', 'lack', 'of', 'efficient', 'methods', 'this', 'in', 'turn', 'may', 'lead', 'to', 'a', 'design', 'gap', 'which', 'will', 'prevent', 'the', 'programming', 'of', 'a', 'quantum', 'computer', 'in', 'this', 'paper', 'we', 'discuss', 'the', 'challenges', 'in', 'fullyautomatic', 'quantum', 'compilation', 'we', 'motivate', 'directions', 'for', 'future', 'research', 'to', 'tackle', 'these', 'challenges', 'yet', 'with', 'the', 'algorithms', 'and', 'approaches', 'that', 'exist', 'today', 'we', 'demonstrate', 'how', 'to', 'automatically', 'perform', 'the', 'quantum', 'programming', 'flow', 'from', 'algorithm', 'to', 'a', 'physical', 'quantum', 'computer', 'for', 'a', 'simple', 'algorithmic', 'benchmark', 'namely', 'the', 'hidden', 'shift', 'problem', 'we', 'present', 'and', 'use', 'two', 'tool', 'flows', 'which', 'invoke', 'revkit', 'one', 'which', 'is', 'based', 'on', 'projectq', 'and', 'which', 'targets', 'the', 'ibm', 'quantum', 'experience', 'or', 'a', 'local', 'simulator', 'and', 'one', 'which', 'is', 'based', 'on', 'microsofts', 'quantum', 'programming', 'language', 'q']] | [-0.11495683899670754, 0.0900994712558751, -0.11169553319344186, 0.05052895832931288, -0.09503848767465985, -0.19282535521618266, 0.05914970469598826, 0.37007431958668996, -0.27610322684779215, -0.33538325749389175, 0.12695062947073257, -0.23215700049395352, -0.1564925247299043, 0.2749477230121858, -0.06821559243277574, 0.09974372304529638, 0.10214164020699633, 0.0046710575445799785, -0.07330683928437977, -0.2533137477110333, 0.26531348586370007, 0.03895536533498939, 0.26523089446642434, 0.06192997395176835, 0.07116189717276511, -0.03889446283265742, 0.006706258911888377, -0.0013649687471408998, -0.08399143093946247, 0.16470855110177926, 0.3187089419305702, 0.17382090735305014, 0.3230809838197748, -0.48345863804530165, -0.18279220306739416, 0.07764518507412949, 0.131902301705481, 0.1646804207316836, -0.05715581166703085, -0.2657592789600453, 0.10077895372456867, -0.17644015212933864, -0.06159743158813847, -0.1062252091561457, -0.009702786056470762, -0.049134595058633074, -0.21756941688618267, 0.007350719701241238, 0.05658838950518158, 0.06888815509005179, 0.04032557908238249, -0.07652699180571834, 0.08019055301014523, 0.12403743608327891, -0.018979684150915097, 0.04644850666166931, 0.1569063179945994, -0.13654288049054455, -0.20544185264310735, 0.407295562824758, 0.018987369885298526, -0.18158159515185257, 0.2216725485090355, -0.056999772715206315, -0.1688383241175472, 0.06187185977289479, 0.18307253997236456, 0.09249763539026616, -0.14760147327823298, 0.07090267432426545, 0.0176904797511098, 0.20121925061542867, 0.013953037171309152, 0.05518632212145177, 0.2603913583548113, 0.1719797887616203, 0.07050696477800401, 0.13035007442877744, -0.05125001878295231, -0.15629133926962036, -0.27655991158246446, -0.17383428643474222, -0.16198684357821272, 0.06409001762845687, -0.01973405818539148, -0.1511706936758973, 0.3634452269968366, 0.21887271786012047, 0.15190297703383154, 0.03647416519121297, 0.3304422713579043, 0.08023943725950836, 0.11962440506606642, 0.10495733148268153, 0.20331368278371373, 0.05258475378915359, 0.12922404351545505, -0.21188811655290432, 0.05313290976962152, 0.004552961694085241] |
1,803.01023 | Geodesic Orbit Riemannian Structures on $\mathbf{R}^n$ | A geodesic orbit manifold is a complete Riemannian manifold all of whose
geodesics are orbits of one-parameter groups of isometries. We give both a
geometric and an algebraic characterization of geodesic orbit manifolds that
are diffeomorphic to $\mathbf{R}^n$. Along the way, we establish various
structural properties of more general geodesic orbit manifolds.
| math.DG | a geodesic orbit manifold is a complete riemannian manifold all of whose geodesics are orbits of oneparameter groups of isometries we give both a geometric and an algebraic characterization of geodesic orbit manifolds that are diffeomorphic to mathbfrn along the way we establish various structural properties of more general geodesic orbit manifolds | [['a', 'geodesic', 'orbit', 'manifold', 'is', 'a', 'complete', 'riemannian', 'manifold', 'all', 'of', 'whose', 'geodesics', 'are', 'orbits', 'of', 'oneparameter', 'groups', 'of', 'isometries', 'we', 'give', 'both', 'a', 'geometric', 'and', 'an', 'algebraic', 'characterization', 'of', 'geodesic', 'orbit', 'manifolds', 'that', 'are', 'diffeomorphic', 'to', 'mathbfrn', 'along', 'the', 'way', 'we', 'establish', 'various', 'structural', 'properties', 'of', 'more', 'general', 'geodesic', 'orbit', 'manifolds']] | [-0.2976307565628443, 0.06345303291527671, -0.15042543983480966, 0.09776809617491941, -0.19099628096983695, -0.09958059939806564, -0.06212978551047854, 0.4238092562613579, -0.2732625535259453, -0.18135516076850203, 0.1275983617703717, -0.30773372983989805, -0.15285693040977305, 0.2376297753966915, -0.189778558175581, 0.06545848259702325, 0.1449369469191879, 0.10251290951362954, -0.16084922618644598, -0.2298105939363058, 0.46246242695129836, -0.06006290691976364, 0.13958974920499784, -0.0006570610678933847, 0.15020756589141315, -0.004815010022586928, 0.03958326033450878, 0.0517879980437171, -0.21712668967736065, 0.17571940840795064, 0.23294910752715972, 0.08514347747684671, 0.12230576258690025, -0.3920073619363113, -0.18235235582464016, 0.17948690171425158, 0.13991866715234488, 0.02157171557729061, -0.03946161097897297, -0.34073976703131426, 0.09095214862519732, -0.048331264227342144, -0.23496586662860444, -0.13494881572058567, 0.08987870948532453, -0.016201017818485316, -0.1237495551064897, -0.00540300143452791, 0.21019900439736935, 0.13622852629767015, -0.1027474848804279, -0.022866752012095485, -0.08510440535386667, 0.12199196769282795, 0.06004949295087359, 0.04813976597506553, 0.13655529900167424, 0.08353423859583788, -0.09786561604302663, 0.4165737206976001, -0.025190955260768533, -0.3226142348363422, 0.14238297745872003, -0.1695710476958014, -0.14507614532843804, 0.15966304395204553, 0.1747510076428835, 0.24892563236734042, -0.1748392141262929, 0.18252695391129237, -0.06503641990443262, 0.0017777526607880225, 0.09077194177259046, 0.008590774580415409, 0.175626332182079, 0.08450130376821527, 0.24930875138558733, 0.08246231806249572, -0.012393754163685326, -0.06556105071929498, -0.3399246928926844, -0.221398932653336, -0.0684494824851684, 0.18556064634154049, -0.21126344997873486, -0.2424826572264115, 0.38308555647157705, -0.07274239879244795, 0.2457849529500191, 0.15160951875777057, 0.19059620159812488, -0.047833610129041165, -0.06858084700070322, 0.13590061763982073, 0.19046274406047395, 0.24279633522606814, -0.10799962755006093, -0.11276424456781779, -0.10527723123176166, 0.18748460224686334] |
1,803.01024 | PRESISTANT: Learning based assistant for data pre-processing | Data pre-processing is one of the most time consuming and relevant steps in a
data analysis process (e.g., classification task). A given data pre-processing
operator (e.g., transformation) can have positive, negative or zero impact on
the final result of the analysis. Expert users have the required knowledge to
find the right pre-processing operators. However, when it comes to non-experts,
they are overwhelmed by the amount of pre-processing operators and it is
challenging for them to find operators that would positively impact their
analysis (e.g., increase the predictive accuracy of a classifier). Existing
solutions either assume that users have expert knowledge, or they recommend
pre-processing operators that are only "syntactically" applicable to a dataset,
without taking into account their impact on the final analysis. In this work,
we aim at providing assistance to non-expert users by recommending data
pre-processing operators that are ranked according to their impact on the final
analysis. We developed a tool PRESISTANT, that uses Random Forests to learn the
impact of pre-processing operators on the performance (e.g., predictive
accuracy) of 5 different classification algorithms, such as J48, Naive Bayes,
PART, Logistic Regression, and Nearest Neighbor. Extensive evaluations on the
recommendations provided by our tool, show that PRESISTANT can effectively help
non-experts in order to achieve improved results in their analytical tasks.
| cs.LG cs.DB | data preprocessing is one of the most time consuming and relevant steps in a data analysis process eg classification task a given data preprocessing operator eg transformation can have positive negative or zero impact on the final result of the analysis expert users have the required knowledge to find the right preprocessing operators however when it comes to nonexperts they are overwhelmed by the amount of preprocessing operators and it is challenging for them to find operators that would positively impact their analysis eg increase the predictive accuracy of a classifier existing solutions either assume that users have expert knowledge or they recommend preprocessing operators that are only syntactically applicable to a dataset without taking into account their impact on the final analysis in this work we aim at providing assistance to nonexpert users by recommending data preprocessing operators that are ranked according to their impact on the final analysis we developed a tool presistant that uses random forests to learn the impact of preprocessing operators on the performance eg predictive accuracy of 5 different classification algorithms such as j48 naive bayes part logistic regression and nearest neighbor extensive evaluations on the recommendations provided by our tool show that presistant can effectively help nonexperts in order to achieve improved results in their analytical tasks | [['data', 'preprocessing', 'is', 'one', 'of', 'the', 'most', 'time', 'consuming', 'and', 'relevant', 'steps', 'in', 'a', 'data', 'analysis', 'process', 'eg', 'classification', 'task', 'a', 'given', 'data', 'preprocessing', 'operator', 'eg', 'transformation', 'can', 'have', 'positive', 'negative', 'or', 'zero', 'impact', 'on', 'the', 'final', 'result', 'of', 'the', 'analysis', 'expert', 'users', 'have', 'the', 'required', 'knowledge', 'to', 'find', 'the', 'right', 'preprocessing', 'operators', 'however', 'when', 'it', 'comes', 'to', 'nonexperts', 'they', 'are', 'overwhelmed', 'by', 'the', 'amount', 'of', 'preprocessing', 'operators', 'and', 'it', 'is', 'challenging', 'for', 'them', 'to', 'find', 'operators', 'that', 'would', 'positively', 'impact', 'their', 'analysis', 'eg', 'increase', 'the', 'predictive', 'accuracy', 'of', 'a', 'classifier', 'existing', 'solutions', 'either', 'assume', 'that', 'users', 'have', 'expert', 'knowledge', 'or', 'they', 'recommend', 'preprocessing', 'operators', 'that', 'are', 'only', 'syntactically', 'applicable', 'to', 'a', 'dataset', 'without', 'taking', 'into', 'account', 'their', 'impact', 'on', 'the', 'final', 'analysis', 'in', 'this', 'work', 'we', 'aim', 'at', 'providing', 'assistance', 'to', 'nonexpert', 'users', 'by', 'recommending', 'data', 'preprocessing', 'operators', 'that', 'are', 'ranked', 'according', 'to', 'their', 'impact', 'on', 'the', 'final', 'analysis', 'we', 'developed', 'a', 'tool', 'presistant', 'that', 'uses', 'random', 'forests', 'to', 'learn', 'the', 'impact', 'of', 'preprocessing', 'operators', 'on', 'the', 'performance', 'eg', 'predictive', 'accuracy', 'of', '5', 'different', 'classification', 'algorithms', 'such', 'as', 'j48', 'naive', 'bayes', 'part', 'logistic', 'regression', 'and', 'nearest', 'neighbor', 'extensive', 'evaluations', 'on', 'the', 'recommendations', 'provided', 'by', 'our', 'tool', 'show', 'that', 'presistant', 'can', 'effectively', 'help', 'nonexperts', 'in', 'order', 'to', 'achieve', 'improved', 'results', 'in', 'their', 'analytical', 'tasks']] | [-0.04348297339846503, 0.016595114584801333, -0.06875376023114922, 0.09123666811368615, -0.14395202196176815, -0.17263355450528972, 0.10691925692635607, 0.4261940455257471, -0.2276491214184064, -0.36782363046593264, 0.13737060161944992, -0.33308731225969374, -0.1345392179973028, 0.1889275516070209, -0.07399885552355422, 0.07508891720471922, 0.14492990129258274, 0.07106548513753673, -0.04662697268474215, -0.34680115976392833, 0.3270501634637236, 0.06843241386748147, 0.2908226994309961, 0.04058752914908219, 0.0515755279745274, 0.0002796617512292457, -0.11977375957912784, -0.020675808037646314, -0.04125853613924228, 0.11563153948551395, 0.33026581194322063, 0.20651948601578557, 0.34133348515573536, -0.4211974100578787, -0.18246117931953193, 0.1089975853539967, 0.1549358290610813, 0.08687563717611274, -0.02612644568649077, -0.31958742432278703, 0.10034485682317952, -0.15285045988110932, -0.03557794970978614, -0.17237561822370276, -0.008780459569160879, -0.015516692757681187, -0.2993375559750382, 0.026171437351585378, 0.09013001306448132, 0.05749431674649833, -0.037656737346518435, -0.13294641982422448, -0.005250051638489273, 0.2030013884558564, 0.05006900961268671, 0.03193596531669961, 0.15672006539864256, -0.14995866238012173, -0.1286106052443842, 0.3615730533965002, -0.04090919942245819, -0.25077572804084924, 0.20172256707512545, -0.07834799344133023, -0.14755252970356214, 0.08817366383231755, 0.2429617159024654, 0.08376433565237401, -0.14347895992875048, 0.007783328476504704, 0.02399446625693016, 0.1785034057706208, 0.04638908166144008, -0.023823835525688064, 0.14696210209513083, 0.1841984477502575, 0.04521439431063866, 0.08687216922627622, -0.024087570166299865, -0.030603602923944873, -0.2267294840904761, -0.11199922012362876, -0.17392322298728, 0.00016815426496114529, -0.11423786187783061, -0.1455857776858946, 0.3736144584754069, 0.21915987440942838, 0.20424424633350804, 0.06239622879448294, 0.3448717599462296, 0.07950856816902194, 0.1163536660518181, 0.06968382351679227, 0.16858215950471173, -0.0019106462362819825, 0.12162302152631488, -0.16253287814895817, 0.13186047731059655, 0.05599126016791418] |
1,803.01025 | Derivations and differential operators on rings and fields | Let $R$ be an integral domain of characteristic zero. We prove that a
function $D\colon R\to R$ is a derivation of order $n$ if and only if $D$
belongs to the closure of the set of differential operators of degree $n$ in
the product topology of $R^R$, where the image space is endowed with the
discrete topology. In other words, $f$ is a derivation of order $n$ if and only
if, for every finite set $F\subset R$, there is a differential operator $D$ of
degree $n$ such that $f=D$ on $F$. We also prove that if $d_1, \dots, d_n$ are
nonzero derivations on $R$, then $d_1 \circ \ldots \circ d_n$ is a derivation
of exact order $n$.
| math.RA | let r be an integral domain of characteristic zero we prove that a function dcolon rto r is a derivation of order n if and only if d belongs to the closure of the set of differential operators of degree n in the product topology of rr where the image space is endowed with the discrete topology in other words f is a derivation of order n if and only if for every finite set fsubset r there is a differential operator d of degree n such that fd on f we also prove that if d_1 dots d_n are nonzero derivations on r then d_1 circ ldots circ d_n is a derivation of exact order n | [['let', 'r', 'be', 'an', 'integral', 'domain', 'of', 'characteristic', 'zero', 'we', 'prove', 'that', 'a', 'function', 'dcolon', 'rto', 'r', 'is', 'a', 'derivation', 'of', 'order', 'n', 'if', 'and', 'only', 'if', 'd', 'belongs', 'to', 'the', 'closure', 'of', 'the', 'set', 'of', 'differential', 'operators', 'of', 'degree', 'n', 'in', 'the', 'product', 'topology', 'of', 'rr', 'where', 'the', 'image', 'space', 'is', 'endowed', 'with', 'the', 'discrete', 'topology', 'in', 'other', 'words', 'f', 'is', 'a', 'derivation', 'of', 'order', 'n', 'if', 'and', 'only', 'if', 'for', 'every', 'finite', 'set', 'fsubset', 'r', 'there', 'is', 'a', 'differential', 'operator', 'd', 'of', 'degree', 'n', 'such', 'that', 'fd', 'on', 'f', 'we', 'also', 'prove', 'that', 'if', 'd_1', 'dots', 'd_n', 'are', 'nonzero', 'derivations', 'on', 'r', 'then', 'd_1', 'circ', 'ldots', 'circ', 'd_n', 'is', 'a', 'derivation', 'of', 'exact', 'order', 'n']] | [-0.2201951288132586, 0.1279883076304731, -0.04561328736301034, -0.03573663195129484, -0.05533969860611499, -0.1891432193060143, -0.005150605533391428, 0.3410882807026307, -0.3215795916974799, -0.1650244268652402, 0.06607928412616189, -0.33368547037084645, -0.12739676616998374, 0.14770851461823759, -0.03886904144006917, -0.0630732242248825, 0.020765842241036076, 0.19497715711243388, -0.06850662393869561, -0.2562852108644115, 0.32925023297723544, -0.11139814823101728, 0.12741747214737484, 0.017667747874799956, 0.11624107974716741, -0.019367425193070855, 0.02409360594808673, 0.012185666839239927, -0.18750521417951727, 0.05564883839275338, 0.2364342855528379, 0.152561994914252, 0.2515538800308783, -0.3480589354804291, -0.10783397332311441, 0.23376902824856788, 0.17639687921230993, -0.07297149713501398, 0.04098167921651282, -0.21404421139253765, 0.19427467509308177, -0.13321260938199006, -0.13098178270599273, -0.03532946054051574, 0.1936650481813838, 0.03174844916718893, -0.37666324630148834, -0.010172375452229116, 0.13049972686383268, 0.09746533987096423, 0.02857610059933912, -0.1477102258632708, -0.06098710175237467, 0.05528947521940383, -0.04185554390160255, 0.12836985159904146, 0.025260487797721807, -0.048308711686036274, -0.04721226909349107, 0.3500771485109869, -0.08564915639272708, -0.26928593434839165, 0.08233910409383412, -0.23950414585783425, -0.12225518327875015, 0.06586722341071591, 0.07442820021229932, 0.18339616809295028, -0.04760969078574234, 0.277740724321602, -0.11991380823728366, 0.18905080173514846, 0.08119165334197828, 0.03333810037479569, 0.09148244559764862, 0.08975276633555818, 0.14480779061300886, 0.06931481338414547, -0.014908992377921747, 0.02578796780644319, -0.41640835363640744, -0.17978502279366407, -0.22772779839479515, 0.17550128529497033, -0.14219133059954883, -0.1540172740450909, 0.3262402696702152, 0.049025595052820496, 0.19539674985198638, 0.08548143364361718, 0.22675489771187815, 0.12850454963696922, 0.026257804348173305, 0.09643814655848676, 0.04825553184168206, 0.19205340424863002, -0.041950362734496593, -0.20023108441800547, 0.044936460876662254, 0.15984004377347663] |
1,803.01026 | An optical and terahertz instrumentation system at the FAST linac at
Fermilab | FAST is a facility at Fermilab that consists of a photoinjector, two
superconducting capture cavities, one superconducting ILC-style cryomodule, and
a small ring for studying non-linear, integrable beam optics called IOTA. This
paper discusses the layout for the optical transport system that provides
optical radiation to an externally located streak camera for bunch length
measurements, and THz radiation to a Martin-Puplett interferometer, also for
bunch length measurements. It accepts radiation from two synchrotron radiation
ports in a chicane bunch compressor and a diffraction/transition radiation
screen downstream of the compressor. It also has the potential to access signal
from a transition radiation screen or YAG screen after the spectrometer magnet
for measurements of energy-time correlations. Initial results from both the
streak camera and Martin-Puplett will be presented.
| physics.acc-ph | fast is a facility at fermilab that consists of a photoinjector two superconducting capture cavities one superconducting ilcstyle cryomodule and a small ring for studying nonlinear integrable beam optics called iota this paper discusses the layout for the optical transport system that provides optical radiation to an externally located streak camera for bunch length measurements and thz radiation to a martinpuplett interferometer also for bunch length measurements it accepts radiation from two synchrotron radiation ports in a chicane bunch compressor and a diffractiontransition radiation screen downstream of the compressor it also has the potential to access signal from a transition radiation screen or yag screen after the spectrometer magnet for measurements of energytime correlations initial results from both the streak camera and martinpuplett will be presented | [['fast', 'is', 'a', 'facility', 'at', 'fermilab', 'that', 'consists', 'of', 'a', 'photoinjector', 'two', 'superconducting', 'capture', 'cavities', 'one', 'superconducting', 'ilcstyle', 'cryomodule', 'and', 'a', 'small', 'ring', 'for', 'studying', 'nonlinear', 'integrable', 'beam', 'optics', 'called', 'iota', 'this', 'paper', 'discusses', 'the', 'layout', 'for', 'the', 'optical', 'transport', 'system', 'that', 'provides', 'optical', 'radiation', 'to', 'an', 'externally', 'located', 'streak', 'camera', 'for', 'bunch', 'length', 'measurements', 'and', 'thz', 'radiation', 'to', 'a', 'martinpuplett', 'interferometer', 'also', 'for', 'bunch', 'length', 'measurements', 'it', 'accepts', 'radiation', 'from', 'two', 'synchrotron', 'radiation', 'ports', 'in', 'a', 'chicane', 'bunch', 'compressor', 'and', 'a', 'diffractiontransition', 'radiation', 'screen', 'downstream', 'of', 'the', 'compressor', 'it', 'also', 'has', 'the', 'potential', 'to', 'access', 'signal', 'from', 'a', 'transition', 'radiation', 'screen', 'or', 'yag', 'screen', 'after', 'the', 'spectrometer', 'magnet', 'for', 'measurements', 'of', 'energytime', 'correlations', 'initial', 'results', 'from', 'both', 'the', 'streak', 'camera', 'and', 'martinpuplett', 'will', 'be', 'presented']] | [-0.12907766148958716, 0.19300881640400244, -0.11660139541697478, 0.01183989015595627, -0.04944385903053767, -0.23664433955620492, -0.03902503110810123, 0.43993326871385496, -0.22757711139368644, -0.28043615945705, 0.06083074450068506, -0.3243709433403227, 0.0038876071057823156, 0.29663279605841625, -0.017860782539261686, 0.056864176328564366, 0.06638973795164813, -0.04460601085954676, 0.0032568837773250116, -0.10751360297417117, 0.2667921459144582, 0.15541055104545048, 0.2966592667864696, 0.03983104942862185, 0.18934585668161633, 0.03374121269265625, 0.03113582410714439, -0.03362121375187511, -0.05546680215294116, -0.0028028375067327533, 0.25290658269377964, 0.09101959044909885, 0.21444540174167243, -0.46448611878159063, -0.18401423410884285, 0.01896054476627239, 0.10176425519767368, 0.10451951166314463, -0.09780581537615357, -0.25727525230632314, 0.004464852649928822, -0.16413318488987222, -0.1388961596587192, 0.058972630567187746, 0.005280342610222438, 0.02958679104208826, -0.291198850334284, -0.08313766235697849, 0.01920709445051128, 0.053150741435538586, -0.026957962395352943, -0.024818597356751262, 0.07058402566584729, 0.03941167438695688, -0.055206002737019935, 0.1165763936155746, 0.20732264869260572, -0.12488294258195486, -0.061324850554698176, 0.3241153912423479, -0.02550879676803766, -0.09408577169562059, 0.1150505822104371, -0.20581445393467984, -0.017418869677180003, 0.1883600836078967, 0.1698007931437103, 0.05458395314335282, -0.18030432915698075, -0.018249055800674062, 0.005549837814478744, 0.23008151021936246, 0.17346934272321843, 0.06059942686096615, 0.2559444706947092, 0.19208860623409912, 0.032285488312247194, 0.20179419555314515, -0.20628999093277078, 0.04954349982642358, -0.3319777766272666, -0.13069500792170724, -0.18336869996686977, 0.014299254252334996, -0.008268290991245228, -0.13901691652849438, 0.4107644748122942, 0.1611708307398423, 0.08156568163465108, -0.05107790693798433, 0.40273127894503097, 0.04943839766013797, 0.10340797124926242, 0.04269612105934122, 0.24799189171303185, 0.1278155427688973, 0.1707865967820849, -0.2452260856197456, -0.035075287556185594, 0.004227799603775624] |
1,803.01027 | Red Misfits in the Sloan Digital Sky Survey: Properties of Star-forming
Red Galaxies | We study Red Misfits, a population of red, star-forming galaxies in the local
Universe. We classify galaxies based on inclination-corrected optical colours
and specific star formation rates derived from the Sloan Digital Sky Survey
Data Release 7. Although the majority of blue galaxies are star-forming and
most red galaxies exhibit little to no ongoing star formation, a small but
significant population of galaxies ($\sim$11 per cent at all stellar masses)
are classified as red in colour yet actively star-forming. We explore a number
of properties of these galaxies and demonstrate that Red Misfits are not simply
dusty or highly-inclined blue cloud galaxies or quiescent red galaxies with
poorly-constrained star formation. The proportion of Red Misfits is nearly
independent of environment and this population exhibits both intermediate
morphologies and an enhanced likelihood of hosting an AGN. We conclude that Red
Misfits are a transition population, gradually quenching on their way to the
red sequence and this quenching is dominated by internal processes rather than
environmentally-driven processes. We discuss the connection between Red Misfits
and other transition galaxy populations, namely S0's, red spirals and green
valley galaxies.
| astro-ph.GA | we study red misfits a population of red starforming galaxies in the local universe we classify galaxies based on inclinationcorrected optical colours and specific star formation rates derived from the sloan digital sky survey data release 7 although the majority of blue galaxies are starforming and most red galaxies exhibit little to no ongoing star formation a small but significant population of galaxies sim11 per cent at all stellar masses are classified as red in colour yet actively starforming we explore a number of properties of these galaxies and demonstrate that red misfits are not simply dusty or highlyinclined blue cloud galaxies or quiescent red galaxies with poorlyconstrained star formation the proportion of red misfits is nearly independent of environment and this population exhibits both intermediate morphologies and an enhanced likelihood of hosting an agn we conclude that red misfits are a transition population gradually quenching on their way to the red sequence and this quenching is dominated by internal processes rather than environmentallydriven processes we discuss the connection between red misfits and other transition galaxy populations namely s0s red spirals and green valley galaxies | [['we', 'study', 'red', 'misfits', 'a', 'population', 'of', 'red', 'starforming', 'galaxies', 'in', 'the', 'local', 'universe', 'we', 'classify', 'galaxies', 'based', 'on', 'inclinationcorrected', 'optical', 'colours', 'and', 'specific', 'star', 'formation', 'rates', 'derived', 'from', 'the', 'sloan', 'digital', 'sky', 'survey', 'data', 'release', '7', 'although', 'the', 'majority', 'of', 'blue', 'galaxies', 'are', 'starforming', 'and', 'most', 'red', 'galaxies', 'exhibit', 'little', 'to', 'no', 'ongoing', 'star', 'formation', 'a', 'small', 'but', 'significant', 'population', 'of', 'galaxies', 'sim11', 'per', 'cent', 'at', 'all', 'stellar', 'masses', 'are', 'classified', 'as', 'red', 'in', 'colour', 'yet', 'actively', 'starforming', 'we', 'explore', 'a', 'number', 'of', 'properties', 'of', 'these', 'galaxies', 'and', 'demonstrate', 'that', 'red', 'misfits', 'are', 'not', 'simply', 'dusty', 'or', 'highlyinclined', 'blue', 'cloud', 'galaxies', 'or', 'quiescent', 'red', 'galaxies', 'with', 'poorlyconstrained', 'star', 'formation', 'the', 'proportion', 'of', 'red', 'misfits', 'is', 'nearly', 'independent', 'of', 'environment', 'and', 'this', 'population', 'exhibits', 'both', 'intermediate', 'morphologies', 'and', 'an', 'enhanced', 'likelihood', 'of', 'hosting', 'an', 'agn', 'we', 'conclude', 'that', 'red', 'misfits', 'are', 'a', 'transition', 'population', 'gradually', 'quenching', 'on', 'their', 'way', 'to', 'the', 'red', 'sequence', 'and', 'this', 'quenching', 'is', 'dominated', 'by', 'internal', 'processes', 'rather', 'than', 'environmentallydriven', 'processes', 'we', 'discuss', 'the', 'connection', 'between', 'red', 'misfits', 'and', 'other', 'transition', 'galaxy', 'populations', 'namely', 's0s', 'red', 'spirals', 'and', 'green', 'valley', 'galaxies']] | [-0.05484850558175428, 0.1408829823830102, -0.06838766290189548, 0.1115454714595831, -0.11484009657945755, -0.00879514423400365, 0.09365043863465355, 0.5155878934304456, -0.061056387533333055, -0.32988235373553393, 0.028524169483146556, -0.3173914431720167, -0.07182085070305982, 0.15981905709297672, -0.07182663186277087, -0.143348711209271, 0.023124229561889895, -0.14705711680690983, 0.03534839461884789, -0.3249962824623327, 0.2922148916543134, -0.019920794518563795, 0.175556111982646, -0.14383003620078436, 0.0307673690771382, -0.14752463544907704, -0.10292369635977053, -0.06359209868352156, -0.1650740137264743, -0.02837476983188173, 0.23329943814189047, 0.13075479422723466, 0.2823318688601658, -0.3341386131816418, -0.14653894542842297, 0.14925221634676328, 0.2672692463443791, 0.06359872226477475, -0.1607263626857988, -0.2498861869809696, 0.0966448296188704, -0.1504352776352568, -0.163819668817057, 0.10094076514596471, 0.04221153227687889, 0.06986898476434117, -0.16428191178947107, 0.2021946577116142, 0.03502248424180859, 0.1379817282378271, -0.07660554353323941, -0.11914630994779636, -0.18797109461565678, 0.11197826639824622, -0.03407627270947135, 0.06309608834845995, 0.2561576663667487, -0.18890338766740988, 0.027823887926501197, 0.39903971352992024, -0.019137469378718477, 0.08348200456239283, 0.2708474883709002, -0.22161216341663856, -0.1703160167898278, 0.09112949968076538, 0.15180881766199664, 0.1227056435183496, -0.16572535982909234, -0.06603744599867511, 0.03763589424811102, 0.20827422828690426, 0.03150184558503128, 0.113668171332825, 0.35274690165612343, 0.11915905848523048, 0.04272560442772669, 0.10954401063688754, -0.18948261294312574, -0.05047382500047821, -0.1842381421218601, -0.046766252337476694, -0.12804171463185166, 0.11809368562212881, -0.1604809728746831, -0.1341717255427628, 0.32739559048031636, 0.016797203816099067, 0.2736951251803721, 0.10915981673106954, 0.3202268345885583, 0.05537714998653108, 0.16735073277550574, 0.10191727931661582, 0.2710738180154884, 0.1776117794835512, 0.03744686455591708, -0.2609631464876411, 0.06397249848909072, -0.03067234645069048] |
1,803.01028 | Investigating transverse Hall conductances using two-terminal setups | In this paper we present a method to numerically study transverse Hall
conductances using a two-terminal setup. Using nonlinear transport concepts we
find that the Hall voltage dependence on the model parameters can be
investigated from the difference between the injectivities from each terminal.
The method is suitable to work with non-equilibrium Green's functions as well
as for scattering matrix approaches. We illustrate the proposed idea by
studying the quantum spin Hall effect in graphene with disordered spin-orbit
scattering centers induced by adatoms. We use two distinct models, a finite
difference implementation of the Dirac Hamiltonian and a tight-binding
Hamiltonian combined with the scattering matrix approach and the
non-equilibrium Green's functions approach, respectively.
| cond-mat.mes-hall | in this paper we present a method to numerically study transverse hall conductances using a twoterminal setup using nonlinear transport concepts we find that the hall voltage dependence on the model parameters can be investigated from the difference between the injectivities from each terminal the method is suitable to work with nonequilibrium greens functions as well as for scattering matrix approaches we illustrate the proposed idea by studying the quantum spin hall effect in graphene with disordered spinorbit scattering centers induced by adatoms we use two distinct models a finite difference implementation of the dirac hamiltonian and a tightbinding hamiltonian combined with the scattering matrix approach and the nonequilibrium greens functions approach respectively | [['in', 'this', 'paper', 'we', 'present', 'a', 'method', 'to', 'numerically', 'study', 'transverse', 'hall', 'conductances', 'using', 'a', 'twoterminal', 'setup', 'using', 'nonlinear', 'transport', 'concepts', 'we', 'find', 'that', 'the', 'hall', 'voltage', 'dependence', 'on', 'the', 'model', 'parameters', 'can', 'be', 'investigated', 'from', 'the', 'difference', 'between', 'the', 'injectivities', 'from', 'each', 'terminal', 'the', 'method', 'is', 'suitable', 'to', 'work', 'with', 'nonequilibrium', 'greens', 'functions', 'as', 'well', 'as', 'for', 'scattering', 'matrix', 'approaches', 'we', 'illustrate', 'the', 'proposed', 'idea', 'by', 'studying', 'the', 'quantum', 'spin', 'hall', 'effect', 'in', 'graphene', 'with', 'disordered', 'spinorbit', 'scattering', 'centers', 'induced', 'by', 'adatoms', 'we', 'use', 'two', 'distinct', 'models', 'a', 'finite', 'difference', 'implementation', 'of', 'the', 'dirac', 'hamiltonian', 'and', 'a', 'tightbinding', 'hamiltonian', 'combined', 'with', 'the', 'scattering', 'matrix', 'approach', 'and', 'the', 'nonequilibrium', 'greens', 'functions', 'approach', 'respectively']] | [-0.111827575517159, 0.1348853510375901, -0.0969453766711254, 0.02855948811454649, -0.02176251925066509, -0.14309562922381194, 0.027073072184050306, 0.39486836221695476, -0.2806634220162786, -0.2646306206233206, -0.009123612889624407, -0.2912180431978365, -0.23234236081732454, 0.20317141601889996, 0.04374359515948897, 0.08470024693493558, 0.02631818967360377, -0.08280416245086003, -0.12630222610659503, -0.19116608486964112, 0.34257215220250387, -0.0268976912942954, 0.2890186242437798, 0.09697914955544129, 0.09374222008560874, 0.07541781427355203, 0.06257412056809505, 0.07180631259637596, -0.13795195700657664, 0.07748025651213473, 0.2340660405738871, -0.0564756003822472, 0.20871313349797135, -0.4541440073862276, -0.18892977803747737, 0.003668879776929332, 0.10334303785956143, 0.18159541999921203, -0.05176443392019389, -0.27974327861339643, 0.024902678284365518, -0.2012572168945376, -0.118818055449952, -0.07490795548279992, -0.029785089186532835, -0.004069757864159425, -0.2641262842601874, 0.08668286112277249, 0.010585098602578242, 0.0494239206510324, -0.043676003203850934, -0.12233375378810199, -0.02788481487381577, 0.07412915266416678, 0.003933763219068338, -0.014496120747871103, 0.15631065385898296, -0.07947783987037838, -0.1648736105483866, 0.34037363361072753, -0.09619774923668103, -0.23188368817049582, 0.14735329930415064, -0.14547058888834663, -0.06623208438730345, 0.05982705955682075, 0.15089757933355538, 0.13029899665739683, -0.21087514579015892, 0.10940162750039316, -0.04903570321013541, 0.0977578943562323, 0.011095387894099792, 0.023994918562372965, 0.19816035788868908, 0.1843159869148404, 0.04081062546857031, 0.15515075699710576, -0.10704080542689601, -0.08247288686750803, -0.28426569522218365, -0.13646404586106012, -0.2635766084973527, 0.0924831878690593, -0.05585996013323249, -0.16444116941677916, 0.43698481229686104, 0.1987093588032356, 0.19215038541984636, 0.02615945417005404, 0.324129634528561, 0.20927848422743248, 0.049087259020095905, 0.057035199609642796, 0.1714836090640371, 0.20110939764953426, 0.08048518342007183, -0.3315575340663833, 0.026745236241794396, 0.08758706750504805] |
1,803.01029 | Tuning thermal transport in graphene via combinations of molecular
antiresonances | We propose a method to engineer the phonon thermal transport properties of
low dimensional systems. The method relies on introducing a predetermined
combination of molecular adsorbates, which give rise to antiresonances at
frequencies specific to the molecular species. Despite their dissimilar
transmission spectra, thermal resistances due to individual molecules remain
almost the same for all species. On the other hand, thermal resistance due to
combinations of different species are not additive and show large differences
depending on the species. Using a toy model, the physics underlying the
violation of resistance summation rule is investigated. It is demonstrated that
equivalent resistance of two scatterers having the same resistances can be
close to the sum of the constituents or $\sim$70\% of it depending on the
relative positions of the antiresonances. The relative positions of the
antiresonances determine the net change in transmission, therefore the
equivalent resistance. Since the entire spectrum is involved in phonon spectrum
changes in different parts of the spectrum become important. Performing
extensive first-principles based computations, we show that these distinctive
attributes of phonon transport can be useful to tailor the thermal transport
through low dimensional materials, especially for thermoelectric and thermal
management applications.
| cond-mat.mes-hall | we propose a method to engineer the phonon thermal transport properties of low dimensional systems the method relies on introducing a predetermined combination of molecular adsorbates which give rise to antiresonances at frequencies specific to the molecular species despite their dissimilar transmission spectra thermal resistances due to individual molecules remain almost the same for all species on the other hand thermal resistance due to combinations of different species are not additive and show large differences depending on the species using a toy model the physics underlying the violation of resistance summation rule is investigated it is demonstrated that equivalent resistance of two scatterers having the same resistances can be close to the sum of the constituents or sim70 of it depending on the relative positions of the antiresonances the relative positions of the antiresonances determine the net change in transmission therefore the equivalent resistance since the entire spectrum is involved in phonon spectrum changes in different parts of the spectrum become important performing extensive firstprinciples based computations we show that these distinctive attributes of phonon transport can be useful to tailor the thermal transport through low dimensional materials especially for thermoelectric and thermal management applications | [['we', 'propose', 'a', 'method', 'to', 'engineer', 'the', 'phonon', 'thermal', 'transport', 'properties', 'of', 'low', 'dimensional', 'systems', 'the', 'method', 'relies', 'on', 'introducing', 'a', 'predetermined', 'combination', 'of', 'molecular', 'adsorbates', 'which', 'give', 'rise', 'to', 'antiresonances', 'at', 'frequencies', 'specific', 'to', 'the', 'molecular', 'species', 'despite', 'their', 'dissimilar', 'transmission', 'spectra', 'thermal', 'resistances', 'due', 'to', 'individual', 'molecules', 'remain', 'almost', 'the', 'same', 'for', 'all', 'species', 'on', 'the', 'other', 'hand', 'thermal', 'resistance', 'due', 'to', 'combinations', 'of', 'different', 'species', 'are', 'not', 'additive', 'and', 'show', 'large', 'differences', 'depending', 'on', 'the', 'species', 'using', 'a', 'toy', 'model', 'the', 'physics', 'underlying', 'the', 'violation', 'of', 'resistance', 'summation', 'rule', 'is', 'investigated', 'it', 'is', 'demonstrated', 'that', 'equivalent', 'resistance', 'of', 'two', 'scatterers', 'having', 'the', 'same', 'resistances', 'can', 'be', 'close', 'to', 'the', 'sum', 'of', 'the', 'constituents', 'or', 'sim70', 'of', 'it', 'depending', 'on', 'the', 'relative', 'positions', 'of', 'the', 'antiresonances', 'the', 'relative', 'positions', 'of', 'the', 'antiresonances', 'determine', 'the', 'net', 'change', 'in', 'transmission', 'therefore', 'the', 'equivalent', 'resistance', 'since', 'the', 'entire', 'spectrum', 'is', 'involved', 'in', 'phonon', 'spectrum', 'changes', 'in', 'different', 'parts', 'of', 'the', 'spectrum', 'become', 'important', 'performing', 'extensive', 'firstprinciples', 'based', 'computations', 'we', 'show', 'that', 'these', 'distinctive', 'attributes', 'of', 'phonon', 'transport', 'can', 'be', 'useful', 'to', 'tailor', 'the', 'thermal', 'transport', 'through', 'low', 'dimensional', 'materials', 'especially', 'for', 'thermoelectric', 'and', 'thermal', 'management', 'applications']] | [-0.13230893789127898, 0.14280737513580766, -0.08089221225490269, 0.012491328488342847, -0.04694946642893438, -0.15594348668431243, 0.07215749885982428, 0.38215352612046094, -0.2990530896645326, -0.2948612439756592, 0.034323026737174356, -0.2877503386997164, -0.12831699393617993, 0.19646482839941595, -0.011907389437636504, -0.002070280651633556, 0.04234221873995967, 0.006400008096646231, -0.038058062864897345, -0.21655873954773713, 0.28755437845889575, 0.07419030570831055, 0.3258934679465034, 0.10768922995417737, 0.08874577404155086, -0.008880743785546376, -0.00639343870541033, 0.042556384641629384, -0.1022065368580232, 0.11845458547486953, 0.2381103686355532, -0.013479574636006967, 0.19182305097675476, -0.43934696817484037, -0.21735846030358702, 0.09128712646615429, 0.13273796563347182, 0.1340286206651049, 0.020496555878661383, -0.1956166160173523, 0.04969919249534798, -0.11348249517584172, -0.1025247227449794, -0.0937179321423173, -0.004571139193677271, 0.03341653298777648, -0.21616688965079495, 0.10087703724558919, -0.00700188218727887, 0.06868996088607954, -0.0750307550582175, -0.17047384571140775, -0.06557018072702564, 0.15875485635792408, 0.03598321934811956, -0.08622153445254438, 0.20604487982077094, -0.11544095092573955, -0.08723156297436127, 0.41132069590191045, -0.050867170016639505, -0.16364975542976307, 0.23806249473411112, -0.1386047700061821, -0.08693583959904619, 0.1674819048613501, 0.15522107762308457, 0.10983177012740038, -0.1669499983318532, 0.027640707845477244, 0.011706431112580526, 0.15274093638126476, 0.09181969273262298, 0.10302520850076316, 0.2506561479459588, 0.13748032060595086, 0.04918422613961574, 0.1361740590708975, -0.08904746132186399, -0.056180672869325064, -0.23895022955794748, -0.14894031070095176, -0.19355639920462497, 0.07095473219397275, -0.07394733302375803, -0.2095739163732968, 0.4199187858460041, 0.15666851217400293, 0.20696871629796731, -0.014630936693328505, 0.30721572645438405, 0.14886294421142873, 0.08242901388245324, 0.042186238977293934, 0.2320686046165438, 0.13805512743882645, 0.07388343303583754, -0.29599022476766734, 0.10795693567786843, -0.014988101546007854] |
1,803.0103 | On Mittag-Leffler d-orthogonal polynomials | This paper presents a first result of a long term research project dealing
with the construction of d-orthogonal polynomials with Hahn's property. We
shall show that the latter class could be characterized by expanding a
polynomial as a finite sum of first derivatives of the elements of the sequence
and we shall explain how this characterization could be used to construct
Hahn-classical d-orthogonal polynomials as well. In this paper we look for
solutions of linear combinations of the first derivatives of two consecutive
elements of the sequence by considering the derivative operator and Delta
(discrete) operator. The resulting polynomials constitute a particular class of
Laguerre d-orthogonal polynomials and a generalization of Mittag-Leffler
polynomials, respectively.
| math.CA | this paper presents a first result of a long term research project dealing with the construction of dorthogonal polynomials with hahns property we shall show that the latter class could be characterized by expanding a polynomial as a finite sum of first derivatives of the elements of the sequence and we shall explain how this characterization could be used to construct hahnclassical dorthogonal polynomials as well in this paper we look for solutions of linear combinations of the first derivatives of two consecutive elements of the sequence by considering the derivative operator and delta discrete operator the resulting polynomials constitute a particular class of laguerre dorthogonal polynomials and a generalization of mittagleffler polynomials respectively | [['this', 'paper', 'presents', 'a', 'first', 'result', 'of', 'a', 'long', 'term', 'research', 'project', 'dealing', 'with', 'the', 'construction', 'of', 'dorthogonal', 'polynomials', 'with', 'hahns', 'property', 'we', 'shall', 'show', 'that', 'the', 'latter', 'class', 'could', 'be', 'characterized', 'by', 'expanding', 'a', 'polynomial', 'as', 'a', 'finite', 'sum', 'of', 'first', 'derivatives', 'of', 'the', 'elements', 'of', 'the', 'sequence', 'and', 'we', 'shall', 'explain', 'how', 'this', 'characterization', 'could', 'be', 'used', 'to', 'construct', 'hahnclassical', 'dorthogonal', 'polynomials', 'as', 'well', 'in', 'this', 'paper', 'we', 'look', 'for', 'solutions', 'of', 'linear', 'combinations', 'of', 'the', 'first', 'derivatives', 'of', 'two', 'consecutive', 'elements', 'of', 'the', 'sequence', 'by', 'considering', 'the', 'derivative', 'operator', 'and', 'delta', 'discrete', 'operator', 'the', 'resulting', 'polynomials', 'constitute', 'a', 'particular', 'class', 'of', 'laguerre', 'dorthogonal', 'polynomials', 'and', 'a', 'generalization', 'of', 'mittagleffler', 'polynomials', 'respectively']] | [-0.15050215586459478, 0.09789613168686628, -0.07979417055231247, 0.03555935836063319, -0.08601008556717266, -0.07605413633472888, -0.009378105408174143, 0.32856730036272674, -0.328466016065692, -0.2266731608815623, 0.13266886863342395, -0.23636703623409291, -0.20216869396431603, 0.16454441847065382, -0.08328176408890733, 0.03146355218600185, 0.04070907741768566, 0.031423373436308015, -0.11990493413810907, -0.25709035993446555, 0.35133248942582745, 0.0017839726812692474, 0.14436095165896468, 0.013551660541412049, 0.11873465327677869, -0.04768806348392014, -0.05712423361714237, -0.01772707807872675, -0.11694158588782565, 0.1444523172799201, 0.27881213175380126, 0.126444934129682, 0.28402035584491964, -0.36077846493571997, -0.13730958815168515, 0.191642187288509, 0.16538380561149227, 0.05446332141479366, -0.031497316937728795, -0.2431516787449343, 0.07208023910138724, -0.20032496882841586, -0.19778741149446077, -0.08958082676626149, -0.006856365920563714, 0.1093231711734449, -0.3015798453274554, 0.037029868889130256, 0.10733824390691367, 0.06640211631303378, -0.025141649377280927, -0.1421560957426189, 0.05078991519625142, 0.06962550281489317, 0.0343810720121966, 0.0030428643247722527, -0.01621743095049684, -0.0758121919682233, -0.13728686274272447, 0.3789297735104255, -0.10573943774421922, -0.2314873535744434, 0.0907113406254984, -0.16793311187024929, -0.19130576537732463, 0.04434996250835214, 0.14428981397284474, 0.17439243318595454, -0.131457102011098, 0.08153424875870495, -0.07242211786848782, 0.1015051892933856, 0.13606825701694572, 0.062205017025096225, 0.1561476103631796, 0.08588528258528198, 0.0431735604111336, 0.20548971964713944, 0.006163477154852476, -0.07914547827012375, -0.3689810445004728, -0.21829646016678164, -0.18282974230339832, 0.05047698806048231, -0.09987847980040236, -0.19539500703721974, 0.4572331454703766, 0.0865791043147148, 0.1899976457090043, 0.12098580439764578, 0.2080757502441715, 0.16404428986000077, 0.04638041060961849, 0.009171200215618694, 0.13671899291241657, 0.15763947097749442, 0.0826410723652328, -0.1517759072728274, 0.045487511610463924, 0.17416336887672676] |
1,803.01031 | Unlimited parity alternating partitions | We introduce a new type of partitions that consists of partitions whose
different parts alternate in parity (e.g., $3+2+2+1+1$). Various properties of
this partition function are studied. In particular, we obtain its asymptotic
behavior by employing Ingham's Tauberian theorem.
| math.CO | we introduce a new type of partitions that consists of partitions whose different parts alternate in parity eg 32211 various properties of this partition function are studied in particular we obtain its asymptotic behavior by employing inghams tauberian theorem | [['we', 'introduce', 'a', 'new', 'type', 'of', 'partitions', 'that', 'consists', 'of', 'partitions', 'whose', 'different', 'parts', 'alternate', 'in', 'parity', 'eg', '32211', 'various', 'properties', 'of', 'this', 'partition', 'function', 'are', 'studied', 'in', 'particular', 'we', 'obtain', 'its', 'asymptotic', 'behavior', 'by', 'employing', 'inghams', 'tauberian', 'theorem']] | [-0.17301608369636692, 0.11633638021119527, -0.13747295134970428, 0.07966968339659568, -0.060374692155930554, -0.0868229609914124, 0.04436682644346116, 0.3031642995774746, -0.2621755513705705, -0.2694511402300314, 0.0778092309085064, -0.23168625015961497, -0.1712772797204946, 0.13658209321530243, -0.07864739199316031, 0.02096085497760214, -0.026423463487605516, -0.002884533574902698, -0.08666264161001891, -0.2191045701129999, 0.3741753749353321, -0.07169334845323312, 0.254854803102238, 0.007418677382367222, 0.08153757935782012, 0.08669679084988802, -0.032672973937894166, 0.03505957214847991, -0.16890242329808594, 0.13814667241623332, 0.2243881828494762, 0.13909397141909913, 0.2636573951887457, -0.42054126794008834, -0.12053676668897663, 0.13775479332788995, 0.1456929285482865, 0.02475843484832072, -0.06462890522456483, -0.25058478760336966, 0.14213069486676863, -0.16379378358588406, -0.1665221037968111, -0.08364254808494527, 0.0012902129429245466, 0.1018625941850539, -0.2605945069195801, 0.05472539758652841, 0.10021988312272649, 0.06267455803524506, -0.03314328883884867, -0.19268618455450787, 0.06056448244673543, 0.13835771819331535, 0.024453724783502127, -0.06284403226240293, 0.03587891060956999, -0.10177628526243528, -0.14619039785190435, 0.29293796692141577, -0.019971201637465703, -0.2439282190446791, 0.16556741680343343, -0.10493244347162545, -0.21189063472526246, 0.04083837599395529, 0.10429053670285564, 0.17446739743096068, -0.15232852331705785, 0.1366109521814475, -0.10768244020934951, 0.06814659788812462, 0.14650027680602906, 0.10201725945807993, 0.1528557635059482, 0.10580517245628136, 0.03749327669165244, 0.31975882409728673, -0.019755252428646935, -0.08918481271125768, -0.31270920784261663, -0.1589842081854218, -0.18557076901197433, 0.07784269887365793, -0.13838067697361112, -0.2208480014906902, 0.45588153894794614, 0.09591784795108986, 0.22103209014197714, 0.1079702556721474, 0.22602515981385582, 0.1386589428507968, 0.021723411952782618, -0.01906468356518369, 0.13558663176617733, 0.12160815919847473, 0.03632422836381011, -0.14435346174593033, 0.05725510900006875, 0.2082611614421598] |
1,803.01032 | Drift parameter estimation for nonlinear stochastic differential
equations driven by fractional Brownian motion | We derive the strong consistency of the least squares estimator for the drift
coefficient of a fractional stochastic differential system. The drift
coeffcient is one-sided dissipative Lipschitz and the driving noise is additive
and fractional with Hurst parameter $H \in (\frac{1}{4}, 1)$. We assume that
continuous observation is possible. The main tools are ergodic theorem and
Malliavin calculus. As a by-product, we derive a maximum inequality for
Skorohod integrals, which plays an important role to obtain the strong
consistency of the least squares estimator.
| math.PR | we derive the strong consistency of the least squares estimator for the drift coefficient of a fractional stochastic differential system the drift coeffcient is onesided dissipative lipschitz and the driving noise is additive and fractional with hurst parameter h in frac14 1 we assume that continuous observation is possible the main tools are ergodic theorem and malliavin calculus as a byproduct we derive a maximum inequality for skorohod integrals which plays an important role to obtain the strong consistency of the least squares estimator | [['we', 'derive', 'the', 'strong', 'consistency', 'of', 'the', 'least', 'squares', 'estimator', 'for', 'the', 'drift', 'coefficient', 'of', 'a', 'fractional', 'stochastic', 'differential', 'system', 'the', 'drift', 'coeffcient', 'is', 'onesided', 'dissipative', 'lipschitz', 'and', 'the', 'driving', 'noise', 'is', 'additive', 'and', 'fractional', 'with', 'hurst', 'parameter', 'h', 'in', 'frac14', '1', 'we', 'assume', 'that', 'continuous', 'observation', 'is', 'possible', 'the', 'main', 'tools', 'are', 'ergodic', 'theorem', 'and', 'malliavin', 'calculus', 'as', 'a', 'byproduct', 'we', 'derive', 'a', 'maximum', 'inequality', 'for', 'skorohod', 'integrals', 'which', 'plays', 'an', 'important', 'role', 'to', 'obtain', 'the', 'strong', 'consistency', 'of', 'the', 'least', 'squares', 'estimator']] | [-0.15741222360659213, 0.053286314128594574, -0.08419261897160184, 0.12227213589912503, -0.1002026402302796, -0.17330947082622775, -0.0011261364090300742, 0.3430751057873879, -0.32155069710487233, -0.23886286589272676, 0.18156752209705745, -0.27765990383479566, -0.15659120375113117, 0.16178017728851132, -0.12582245696380379, 0.08604133125793721, 0.021607023320116457, 0.021746077682889466, -0.015407611189792598, -0.20970959408718737, 0.28855707912035067, 7.4053449290139336e-06, 0.15843018605595544, 0.002354713600306284, 0.1869798276595594, 0.025686409341038337, -0.08013601405989557, -0.022066579372178586, -0.2054895758328279, 0.08840758123967264, 0.19601059452231442, 0.027421782778609276, 0.3717355514388709, -0.32775754479336594, -0.1668811080689054, 0.13762546425485717, 0.10534120867565175, 0.013141774576589731, 0.0018489250159334568, -0.2630056317374554, 0.047082923574461824, -0.12248941439957846, -0.16766337675618984, -0.07666838673564295, 0.03680705347852338, 0.046687118154728695, -0.4018866118221056, 0.17344323548188964, 0.1617966324113132, 0.028537464317023045, -0.04451235867704132, -0.14977915949116105, -0.00996755973790728, 0.08118810081976421, 0.0697425355319865, 0.021375183336203918, 0.10022621229706731, -0.07550027907737308, -0.13860486644054099, 0.2672046703463864, -0.14614691748699574, -0.24347638777856315, 0.12246534547635488, -0.1822174998177659, -0.16511715465735288, 0.11911803806599762, 0.1303370585554235, 0.10637221628400896, -0.18273007866394306, 0.12818796449643005, -0.037430142994881385, 0.13919239171359332, 0.04740894603032973, 0.05814201495100167, 0.07055431640973049, 0.13037575555167027, 0.21950357852481484, 0.14406416205401046, -0.11559468491690322, -0.10952514707224466, -0.3850679543933698, -0.20944437216426845, -0.175036113687037, 0.07848109490060735, -0.20273888093877412, -0.19194634480074801, 0.2971225174454351, 0.1381197346407654, 0.11314727005637473, 0.10243420789733396, 0.2528511055168651, 0.26482882396556395, -0.03672347314533822, 0.07213313081523492, 0.20621674745121882, 0.23218706405411163, 0.051645565489750536, -0.20120180016827016, 0.11138264427427202, 0.14525473630055785] |
1,803.01033 | Commissioning and first results of the Electron Beam Profiler in the
Main Injector at Fermilab | The planned neutrino program at Fermilab requires large proton beam
intensities in excess of 2 MW. Measuring the transverse profiles of these high
intensity beams is challenging and often depends on non-invasive techniques.
One such technique involves measuring the deflection of a probe beam of
electrons with a trajectory perpendicular to the proton beam. A device such as
this is already in use at the Spallation Neutron Source at ORNL and a similar
device has been installed in the Main Injector at Fermilab. Commissioning of
the device is in progress with the goal of having it operational by the end of
the year. The status of the commissioning and initial results will be
presented.
| physics.acc-ph | the planned neutrino program at fermilab requires large proton beam intensities in excess of 2 mw measuring the transverse profiles of these high intensity beams is challenging and often depends on noninvasive techniques one such technique involves measuring the deflection of a probe beam of electrons with a trajectory perpendicular to the proton beam a device such as this is already in use at the spallation neutron source at ornl and a similar device has been installed in the main injector at fermilab commissioning of the device is in progress with the goal of having it operational by the end of the year the status of the commissioning and initial results will be presented | [['the', 'planned', 'neutrino', 'program', 'at', 'fermilab', 'requires', 'large', 'proton', 'beam', 'intensities', 'in', 'excess', 'of', '2', 'mw', 'measuring', 'the', 'transverse', 'profiles', 'of', 'these', 'high', 'intensity', 'beams', 'is', 'challenging', 'and', 'often', 'depends', 'on', 'noninvasive', 'techniques', 'one', 'such', 'technique', 'involves', 'measuring', 'the', 'deflection', 'of', 'a', 'probe', 'beam', 'of', 'electrons', 'with', 'a', 'trajectory', 'perpendicular', 'to', 'the', 'proton', 'beam', 'a', 'device', 'such', 'as', 'this', 'is', 'already', 'in', 'use', 'at', 'the', 'spallation', 'neutron', 'source', 'at', 'ornl', 'and', 'a', 'similar', 'device', 'has', 'been', 'installed', 'in', 'the', 'main', 'injector', 'at', 'fermilab', 'commissioning', 'of', 'the', 'device', 'is', 'in', 'progress', 'with', 'the', 'goal', 'of', 'having', 'it', 'operational', 'by', 'the', 'end', 'of', 'the', 'year', 'the', 'status', 'of', 'the', 'commissioning', 'and', 'initial', 'results', 'will', 'be', 'presented']] | [-0.07602778019939076, 0.18102432144070535, -0.09230696087245617, 0.035555677825437955, -0.029135737429258592, -0.13269807274449258, -0.015159465472638738, 0.38746237003636597, -0.1934337549630487, -0.3554761550601637, 0.0844383752422832, -0.30451887288833396, 0.026300166341427126, 0.26653464379507985, -0.020212801491939707, 0.09831003973407573, 0.09012350329532892, -0.005927403620852713, -0.04716392610990034, -0.19120737518236988, 0.2844187853482078, 0.16951204127256284, 0.3198821292291477, 0.0905781108845156, 0.15558934776038913, 0.01376035425550582, -0.032197479083072064, -0.0742147202724019, -0.035529291671864166, 0.04944316973386888, 0.2689767290854402, 0.13671547081187446, 0.22394717744502582, -0.43991054301231836, -0.11528265107169813, 0.05268564970199868, 0.1074081056009929, 0.09382521479161815, -0.06933509784427945, -0.2385127938499576, 0.06843333257558315, -0.1620718492766875, -0.2003414787417441, 0.04626780227153448, -0.009467438712977526, 0.07722605048401053, -0.23783582943009637, -0.04589043616464263, -0.017820431716053894, 0.09010038399055861, 0.00272595064649195, -0.14694411930905885, 0.01925713635507252, 0.08825453368971418, 0.05472485114321962, 0.12235295439032805, 0.17432898375115832, -0.13470124882140927, -0.08347930550052408, 0.3640920465991816, -0.040817696950398386, -0.09579552729867333, 0.14807769551611782, -0.2414634467772486, -0.10261649285492144, 0.14831462567835524, 0.19225487262500743, 0.09731697426749426, -0.18038458465353438, 0.021964761394325218, 0.02107190389978585, 0.15281205117833196, 0.10694315220768515, 0.006414961862263449, 0.2605907260195205, 0.269894260096184, 0.09918313698941156, 0.11392943976189647, -0.1960344281427464, 0.03211607551202178, -0.3484130780326954, -0.12628560275117165, -0.16240778204927778, 0.041216122252017, 0.030868375455739033, -0.04745343829129349, 0.43264317796810675, 0.11878328117247867, 0.13693202615372443, -0.07554863849164624, 0.3715020957353868, 0.06359944415274649, 0.10200148755521105, 0.008379076832186496, 0.2923545953378555, 0.11267234092954088, 0.2057195394422467, -0.24401390367890136, 0.0951393152517675, -0.022712267353199422] |
1,803.01034 | Control Contraction Metrics on Finsler Manifolds | Control Contraction Metrics (CCMs) provide a nonlinear controller design
involving an offline search for a Riemannian metric and an online search for a
shortest path between the current and desired trajectories. In this paper, we
generalize CCMs to Finsler geometry, allowing the use of non-Riemannian
metrics. We provide open loop and sampled data controllers. The sampled data
control construction presented here does not require real time computation of
globally shortest paths, simplifying computation.
| cs.SY math.DG math.OC | control contraction metrics ccms provide a nonlinear controller design involving an offline search for a riemannian metric and an online search for a shortest path between the current and desired trajectories in this paper we generalize ccms to finsler geometry allowing the use of nonriemannian metrics we provide open loop and sampled data controllers the sampled data control construction presented here does not require real time computation of globally shortest paths simplifying computation | [['control', 'contraction', 'metrics', 'ccms', 'provide', 'a', 'nonlinear', 'controller', 'design', 'involving', 'an', 'offline', 'search', 'for', 'a', 'riemannian', 'metric', 'and', 'an', 'online', 'search', 'for', 'a', 'shortest', 'path', 'between', 'the', 'current', 'and', 'desired', 'trajectories', 'in', 'this', 'paper', 'we', 'generalize', 'ccms', 'to', 'finsler', 'geometry', 'allowing', 'the', 'use', 'of', 'nonriemannian', 'metrics', 'we', 'provide', 'open', 'loop', 'and', 'sampled', 'data', 'controllers', 'the', 'sampled', 'data', 'control', 'construction', 'presented', 'here', 'does', 'not', 'require', 'real', 'time', 'computation', 'of', 'globally', 'shortest', 'paths', 'simplifying', 'computation']] | [-0.18978357963161926, 0.05358122915630739, -0.09105885424332259, 0.054749483480245796, -0.17897011857632905, -0.18129344527571373, 0.06377512114664718, 0.4417646232329003, -0.2812932277072782, -0.29636628114401475, 0.1302283635563919, -0.22199229302828852, -0.18270177159407366, 0.22886030654078476, -0.1294181794877011, 0.10323119394430151, 0.11817407710732866, 0.013688357164987605, -0.0937086906194789, -0.22637485537984192, 0.3158425715966637, 0.05844681390420827, 0.24634164316605214, -0.001260044217454142, 0.15420868646111086, 0.04629465179379921, -0.07288407110800482, 0.009300588993738368, -0.1603373012645808, 0.15260882623181105, 0.30194594653655, 0.2208926435304831, 0.23221584149215319, -0.4248834115083087, -0.17476750843582534, 0.161720861247039, 0.1377381597556276, 0.08938130299394874, -0.07536455506637488, -0.28448407977105006, 0.02966243544057624, -0.06644627201842936, -0.0868337847394486, -0.12285676230166158, -0.008763780192255157, -0.011990833364120901, -0.2548159909791836, -0.04942114669702029, 0.028613900376662407, 0.030292674388787518, -0.09163246285935787, -0.02547653106181589, 0.03261649320284798, 0.1721129381761261, -0.026733974441375635, 0.052668069655152215, 0.12755631858304348, -0.03570339852491113, -0.24276751499903731, 0.34295190863107167, -0.016062902312164437, -0.2937177401291181, 0.11571533530822968, -0.03488582793674241, -0.1181056290252568, 0.10510023446013667, 0.2461429285523418, 0.17276456556601882, -0.2107452095218309, 0.08392354463345103, 0.02461679971279347, 0.14921332267272502, 0.04107173336733592, -0.002176340835245505, 0.11436334187103107, 0.18273806076956123, 0.19209122096430764, 0.10750769804333886, -0.019787688216526215, -0.14565599916426286, -0.34866801383968904, -0.18313933844233174, -0.13630027530638322, 0.06222396178433372, -0.15365380423134736, -0.23839271596109826, 0.37811220748579666, 0.13293398059394262, 0.17070335584807478, 0.1742469152716333, 0.3157636244615463, 0.043090796914615044, 0.049319552806244324, 0.17303839438173868, 0.19842630591600724, 0.07615222355784619, 0.12949554553280954, -0.18624152249516282, 0.03166534404640328, 0.05097624209186394] |
1,803.01035 | Machine Learning Entanglement Freedom Or: How I Learned to Stop Worrying
and Love Linear Regression | Quantum many-body systems realise many different phases of matter
characterised by their exotic emergent phenomena. While some simple versions of
these properties can occur in systems of free fermions, their occurrence
generally implies that the physics is dictated by an interacting Hamiltonian.
The interaction distance has been successfully used to quantify the effect of
interactions in a variety of states of matter via the entanglement spectrum
[Nat. Commun. 8, 14926 (2017), arXiv:1705.09983]. The computation of the
interaction distance reduces to a global optimisation problem whose goal is to
search for the free-fermion entanglement spectrum closest to the given
entanglement spectrum. In this work, we employ techniques from machine learning
in order to perform this same task. In a supervised learning setting, we use
labelled data obtained by computing the interaction distance and predict its
value via linear regression. Moving to a semi-supervised setting, we train an
auto-encoder to estimate an alternative measure to the interaction distance,
and we show that it behaves in a similar manner.
| cond-mat.str-el cond-mat.dis-nn | quantum manybody systems realise many different phases of matter characterised by their exotic emergent phenomena while some simple versions of these properties can occur in systems of free fermions their occurrence generally implies that the physics is dictated by an interacting hamiltonian the interaction distance has been successfully used to quantify the effect of interactions in a variety of states of matter via the entanglement spectrum nat commun 8 14926 2017 arxiv170509983 the computation of the interaction distance reduces to a global optimisation problem whose goal is to search for the freefermion entanglement spectrum closest to the given entanglement spectrum in this work we employ techniques from machine learning in order to perform this same task in a supervised learning setting we use labelled data obtained by computing the interaction distance and predict its value via linear regression moving to a semisupervised setting we train an autoencoder to estimate an alternative measure to the interaction distance and we show that it behaves in a similar manner | [['quantum', 'manybody', 'systems', 'realise', 'many', 'different', 'phases', 'of', 'matter', 'characterised', 'by', 'their', 'exotic', 'emergent', 'phenomena', 'while', 'some', 'simple', 'versions', 'of', 'these', 'properties', 'can', 'occur', 'in', 'systems', 'of', 'free', 'fermions', 'their', 'occurrence', 'generally', 'implies', 'that', 'the', 'physics', 'is', 'dictated', 'by', 'an', 'interacting', 'hamiltonian', 'the', 'interaction', 'distance', 'has', 'been', 'successfully', 'used', 'to', 'quantify', 'the', 'effect', 'of', 'interactions', 'in', 'a', 'variety', 'of', 'states', 'of', 'matter', 'via', 'the', 'entanglement', 'spectrum', 'nat', 'commun', '8', '14926', '2017', 'arxiv170509983', 'the', 'computation', 'of', 'the', 'interaction', 'distance', 'reduces', 'to', 'a', 'global', 'optimisation', 'problem', 'whose', 'goal', 'is', 'to', 'search', 'for', 'the', 'freefermion', 'entanglement', 'spectrum', 'closest', 'to', 'the', 'given', 'entanglement', 'spectrum', 'in', 'this', 'work', 'we', 'employ', 'techniques', 'from', 'machine', 'learning', 'in', 'order', 'to', 'perform', 'this', 'same', 'task', 'in', 'a', 'supervised', 'learning', 'setting', 'we', 'use', 'labelled', 'data', 'obtained', 'by', 'computing', 'the', 'interaction', 'distance', 'and', 'predict', 'its', 'value', 'via', 'linear', 'regression', 'moving', 'to', 'a', 'semisupervised', 'setting', 'we', 'train', 'an', 'autoencoder', 'to', 'estimate', 'an', 'alternative', 'measure', 'to', 'the', 'interaction', 'distance', 'and', 'we', 'show', 'that', 'it', 'behaves', 'in', 'a', 'similar', 'manner']] | [-0.11250335043296218, 0.10668310590157158, -0.11880474724616348, 0.084709026955181, -0.06323871434750881, -0.15269563326781446, 0.020521214739666463, 0.37390394916362835, -0.2983138628050008, -0.34527263322449997, 0.04087464646295164, -0.282025860678969, -0.1497924563436148, 0.15641854185131238, -0.05337718673540759, 0.07109979302445991, 0.03161040435714478, 0.059356202027111345, -0.07485028548901689, -0.23586949021978812, 0.31160626543093134, 0.055212120141015585, 0.2794872267580958, 0.030345295485334867, 0.07317402859034976, 0.033001628313495804, 0.023419117899858535, 0.0013783137723239083, -0.12107739794168579, 0.13668558486970142, 0.26299377721734346, 0.12331737878619496, 0.2617083640162353, -0.3910917171234773, -0.22808792935966543, 0.14957582459248828, 0.13806324149940558, 0.12909294111569497, -0.029827122537024093, -0.31194835790066106, 0.02863142648570691, -0.2017425202411797, -0.11345125138477394, -0.09356332854508902, 0.014398631303938049, -0.03923044368998627, -0.25098659579896115, 0.06813408815104402, 0.04464912752507988, 0.038474140244282105, -0.03680036277016343, -0.03142733487342907, 0.014816926916440327, 0.1318471178271328, 0.011403352603542083, 0.03411573837087913, 0.10867633142819007, -0.15568324519942203, -0.1664341450245543, 0.38937678006336546, -0.06273137592590612, -0.165364874998164, 0.25597238398975497, -0.052047823037983935, -0.13205038875934075, 0.0874978281289452, 0.20201653952456333, 0.10540032577559803, -0.1649121314174298, 0.08385845915146285, -0.013518176727335561, 0.14919444136603763, 0.02492048901816209, 0.034402437420618354, 0.19578696282749827, 0.16638902877034112, 0.05628303214307931, 0.14956769467980574, -0.06063773465998979, -0.10016535086994709, -0.2426345559147497, -0.1376427401478092, -0.25268870419399303, 0.03624859391570543, -0.04238605157341667, -0.13804413955588118, 0.38957522700004504, 0.1825686865507371, 0.22772751439867783, 0.033445291834968055, 0.2532461720829209, 0.10058706159788099, 0.07496224860307958, 0.09061095129493907, 0.26501871810425215, 0.12194236527676836, 0.08224792082681123, -0.22115550340703605, 0.02177667709236795, 0.06251245956501049] |
1,803.01036 | The temperature dependence of the shell corrections | We have examined the dependence of the shell correction to the nuclear liquid
drop energy at finite excitations on the excitation energy (temperature). For
this we have calculated the shell correction to the energy and free energy in
very broad region of nuclei and deformations starting directly from their
formal definitions. We have found out that the dependence of the shell
corrections on the excitation energy differ substantially from the widely used
approximation $\delta E(E^*)=\delta E(0)\exp(-E^*/E_d)$ both at small and large
excitations. In particular, below the critical temperature at which the pairing
effects vanish, the shell correction to the free energy is rather insensitive
to the excitation energy.
We suggest a more accurate approximation for the temperature dependence of
the shell correction to the energy and free energy that is expressed in terms
of the shell correction to the energy of independent particles and the shell
correction to the pairing energy at T=0 and few fitted constants.
| nucl-th | we have examined the dependence of the shell correction to the nuclear liquid drop energy at finite excitations on the excitation energy temperature for this we have calculated the shell correction to the energy and free energy in very broad region of nuclei and deformations starting directly from their formal definitions we have found out that the dependence of the shell corrections on the excitation energy differ substantially from the widely used approximation delta eedelta e0expee_d both at small and large excitations in particular below the critical temperature at which the pairing effects vanish the shell correction to the free energy is rather insensitive to the excitation energy we suggest a more accurate approximation for the temperature dependence of the shell correction to the energy and free energy that is expressed in terms of the shell correction to the energy of independent particles and the shell correction to the pairing energy at t0 and few fitted constants | [['we', 'have', 'examined', 'the', 'dependence', 'of', 'the', 'shell', 'correction', 'to', 'the', 'nuclear', 'liquid', 'drop', 'energy', 'at', 'finite', 'excitations', 'on', 'the', 'excitation', 'energy', 'temperature', 'for', 'this', 'we', 'have', 'calculated', 'the', 'shell', 'correction', 'to', 'the', 'energy', 'and', 'free', 'energy', 'in', 'very', 'broad', 'region', 'of', 'nuclei', 'and', 'deformations', 'starting', 'directly', 'from', 'their', 'formal', 'definitions', 'we', 'have', 'found', 'out', 'that', 'the', 'dependence', 'of', 'the', 'shell', 'corrections', 'on', 'the', 'excitation', 'energy', 'differ', 'substantially', 'from', 'the', 'widely', 'used', 'approximation', 'delta', 'eedelta', 'e0expee_d', 'both', 'at', 'small', 'and', 'large', 'excitations', 'in', 'particular', 'below', 'the', 'critical', 'temperature', 'at', 'which', 'the', 'pairing', 'effects', 'vanish', 'the', 'shell', 'correction', 'to', 'the', 'free', 'energy', 'is', 'rather', 'insensitive', 'to', 'the', 'excitation', 'energy', 'we', 'suggest', 'a', 'more', 'accurate', 'approximation', 'for', 'the', 'temperature', 'dependence', 'of', 'the', 'shell', 'correction', 'to', 'the', 'energy', 'and', 'free', 'energy', 'that', 'is', 'expressed', 'in', 'terms', 'of', 'the', 'shell', 'correction', 'to', 'the', 'energy', 'of', 'independent', 'particles', 'and', 'the', 'shell', 'correction', 'to', 'the', 'pairing', 'energy', 'at', 't0', 'and', 'few', 'fitted', 'constants']] | [-0.06837036342194845, 0.14749417811511986, -0.09353053272972184, 0.13116043331176644, 0.00980123727312011, -0.07867926432180308, 0.058710355981583556, 0.3473906455982116, -0.246878867620422, -0.3331466844485652, 0.026615085552686886, -0.3119188909238625, 0.013569723517303504, 0.14927167235573213, 0.045049164118057476, -0.009745097562911049, -0.005484613858824296, 0.057457659309429504, -0.12052017733034107, -0.14329224064826004, 0.3491009139455855, 0.1450069296564306, 0.2790120041658801, 0.166803113255094, 0.06280449167074215, -0.005831980045824762, 0.041845247161484536, 0.010169228869340113, -0.1856994729704081, 0.06001383664026376, 0.23057019668481044, -0.04341510556334998, 0.19985212188574575, -0.4264077477397457, -0.2142761032066999, 0.07170793075985726, 0.13412136481023362, 0.14452387530341623, -0.027877120695155744, -0.19433635553465256, 0.03173552809636138, -0.2045361094447153, -0.16469132409716444, -0.082593134982932, 0.035513643998532525, 0.031131207476362527, -0.21573201157152652, 0.10628375114212113, 0.02253517314130741, 0.02155170196727399, -0.11920440015533278, -0.16479232600860058, -0.04634267948342547, 0.10358948416467155, 0.08808156612118886, 0.021670524706883777, 0.18236052380994924, -0.12568657068205216, 0.034917375796865074, 0.37415234351590754, -0.07065095872648301, -0.1522475090298441, 0.1489100032951683, -0.16160457420252985, -0.08320784063093484, 0.2253681432215437, 0.12509619450091475, 0.08822992649830637, -0.09864013995073977, 0.08250557551716244, 0.06569448669681385, 0.17543862347731426, 0.06464277421154323, 0.05512173641172628, 0.1767025073689799, 0.11393160213596157, -0.0058603872590127495, 0.09598086829026861, -0.14750501282453057, -0.12064747622897548, -0.3499628076990766, -0.0840075390179634, -0.19508404559305598, 0.01892023120195635, -0.0716835939169546, -0.18710811227229573, 0.40820273509429345, 0.09837634363061477, 0.16802037533733152, 0.013688048432701298, 0.26371937554569974, 0.16589437392089637, 0.11930067085120226, 0.11228104015331596, 0.31543932442943895, 0.12172851972281933, 0.0901492823155657, -0.30681254651637807, 0.01650835863584953, 0.015252877357265642] |
1,803.01037 | Nuclear quantum effects enter the mainstream | Over the past decades, atomistic simulations of chemical, biological and
materials systems have become increasingly precise and predictive thanks to the
development of accurate and efficient techniques that describe the quantum
mechanical behavior of electrons. However, the overwhelming majority of such
simulations still assume that the nuclei behave as classical particles. While
historically this approximation could sometimes be justified due to complexity
and computational overhead, the lack of nuclear quantum effects has become one
of the biggest sources of error when systems containing light atoms are treated
using current state-of-the-art descriptions of chemical interactions. Over the
past decade, this realization has spurred a series of methodological advances
that have led to dramatic reductions in the cost of including these important
physical effects in the structure and dynamics of chemical systems. Here we
show how these developments are now allowing nuclear quantum effects to become
a mainstream feature of molecular simulations. These advances have led to new
insights into chemical processes in the condensed phase and open the door to
many exciting future opportunities.
| physics.chem-ph cond-mat.mtrl-sci | over the past decades atomistic simulations of chemical biological and materials systems have become increasingly precise and predictive thanks to the development of accurate and efficient techniques that describe the quantum mechanical behavior of electrons however the overwhelming majority of such simulations still assume that the nuclei behave as classical particles while historically this approximation could sometimes be justified due to complexity and computational overhead the lack of nuclear quantum effects has become one of the biggest sources of error when systems containing light atoms are treated using current stateoftheart descriptions of chemical interactions over the past decade this realization has spurred a series of methodological advances that have led to dramatic reductions in the cost of including these important physical effects in the structure and dynamics of chemical systems here we show how these developments are now allowing nuclear quantum effects to become a mainstream feature of molecular simulations these advances have led to new insights into chemical processes in the condensed phase and open the door to many exciting future opportunities | [['over', 'the', 'past', 'decades', 'atomistic', 'simulations', 'of', 'chemical', 'biological', 'and', 'materials', 'systems', 'have', 'become', 'increasingly', 'precise', 'and', 'predictive', 'thanks', 'to', 'the', 'development', 'of', 'accurate', 'and', 'efficient', 'techniques', 'that', 'describe', 'the', 'quantum', 'mechanical', 'behavior', 'of', 'electrons', 'however', 'the', 'overwhelming', 'majority', 'of', 'such', 'simulations', 'still', 'assume', 'that', 'the', 'nuclei', 'behave', 'as', 'classical', 'particles', 'while', 'historically', 'this', 'approximation', 'could', 'sometimes', 'be', 'justified', 'due', 'to', 'complexity', 'and', 'computational', 'overhead', 'the', 'lack', 'of', 'nuclear', 'quantum', 'effects', 'has', 'become', 'one', 'of', 'the', 'biggest', 'sources', 'of', 'error', 'when', 'systems', 'containing', 'light', 'atoms', 'are', 'treated', 'using', 'current', 'stateoftheart', 'descriptions', 'of', 'chemical', 'interactions', 'over', 'the', 'past', 'decade', 'this', 'realization', 'has', 'spurred', 'a', 'series', 'of', 'methodological', 'advances', 'that', 'have', 'led', 'to', 'dramatic', 'reductions', 'in', 'the', 'cost', 'of', 'including', 'these', 'important', 'physical', 'effects', 'in', 'the', 'structure', 'and', 'dynamics', 'of', 'chemical', 'systems', 'here', 'we', 'show', 'how', 'these', 'developments', 'are', 'now', 'allowing', 'nuclear', 'quantum', 'effects', 'to', 'become', 'a', 'mainstream', 'feature', 'of', 'molecular', 'simulations', 'these', 'advances', 'have', 'led', 'to', 'new', 'insights', 'into', 'chemical', 'processes', 'in', 'the', 'condensed', 'phase', 'and', 'open', 'the', 'door', 'to', 'many', 'exciting', 'future', 'opportunities']] | [-0.0672125492993247, 0.12609993869094233, -0.09903225855736299, 0.04260366869622013, -0.049483483561686095, -0.10690098809282904, 0.03321303684948109, 0.3771063549157415, -0.2755991359122873, -0.32359141661823226, 0.1072325570354234, -0.2789245906139245, -0.15628607956035806, 0.24568294572934637, -0.02327437864110477, 0.09854746413971648, 0.07886259053696507, -0.03528405665393079, -0.05497193779571606, -0.27256925960106376, 0.25384840581261936, 0.07505883687280786, 0.26506468767537117, 0.0882727652330576, 0.07348356471326999, -0.03850149646579056, -0.043511771856715654, 0.03242570083760629, -0.08648803476640393, 0.16450031762949402, 0.2873250008236033, 0.09710021551989148, 0.32801251375181006, -0.5300254193807526, -0.3144848061284061, 0.11306802052170081, 0.17381820953777463, 0.16918556154113415, -0.1178782033125703, -0.23656777379162222, 0.027649959041588977, -0.18315524705739508, -0.13620958349403706, -0.13116393668437107, 0.05845879278861718, 0.029372318683130224, -0.1697624552718396, 0.03934204406401067, 0.022526518710905073, 0.07606159251269405, -0.017054992464150306, -0.1604274313229357, 0.041574689807273406, 0.16570939006693688, 0.048561004423832446, 0.015316982885467352, 0.1572436137593249, -0.17560101564801325, -0.14989756580948227, 0.4201671407165038, 0.023020135024777812, -0.12085325687025496, 0.2633275856274702, -0.13206451576784511, -0.16234455555354413, 0.14219294352331763, 0.19679836850583748, 0.04658657513731132, -0.15924422398441393, 0.10295980113405045, 0.05196908011903308, 0.13891334459925814, 0.01490478602377967, 0.14163203144209147, 0.26620503608944873, 0.21546719425002575, 0.0015659034100759537, 0.0642826194690562, -0.04475265908232658, -0.17498484366395742, -0.18528931423741785, -0.16467268406633878, -0.11830011969620653, 0.08326577597884516, -0.015963191209082368, -0.16367453556592615, 0.3693101124843378, 0.19233285782776632, 0.15613460690967437, -0.04498776748663385, 0.3036352043562283, 0.05528684075675485, 0.09695570520259914, 0.03505674508437945, 0.2804808178169631, 0.1390458511490095, 0.0983976677539247, -0.20359786403852628, 0.09136457565022535, -0.029810686078934657] |
1,803.01038 | Primordial gravitational waves, precisely: The role of thermodynamics in
the Standard Model | In this paper, we revisit the estimation of the spectrum of primordial
gravitational waves originated from inflation, particularly focusing on the
effect of thermodynamics in the Standard Model of particle physics. By
collecting recent results of perturbative and non-perturbative analysis of
thermodynamic quantities in the Standard Model, we obtain the effective degrees
of freedom including the corrections due to non-trivial interaction properties
of particles in the Standard Model for a wide temperature interval. The impact
of such corrections on the spectrum of primordial gravitational waves as well
as the damping effect due to free-streaming particles is investigated by
numerically solving the evolution equation of tensor perturbations in the
expanding universe. It is shown that the reevaluation of the effects of
free-streaming photons and neutrinos gives rise to some additional damping
features overlooked in previous studies. We also observe that the continuous
nature of the QCD crossover results in a smooth spectrum for modes that reenter
the horizon at around the epoch of the QCD phase transition. Furthermore, we
explicitly show that the values of the effective degrees of freedom remain
smaller than the commonly used value 106.75 even at temperature much higher
than the critical temperature of the electroweak crossover, and that the
amplitude of primordial gravitational waves at a frequency range relevant to
direct detection experiments becomes $\mathcal{O}(1)\,\%$ larger than previous
estimates that do not include such corrections. This effect can be relevant to
future high-sensitivity gravitational wave experiments such as ultimate DECIGO.
Our results on the temperature evolution of the effective degrees of freedom
are made available as tabulated data and fitting functions, which can also be
used in the analysis of other cosmological relics.
| hep-ph astro-ph.CO gr-qc | in this paper we revisit the estimation of the spectrum of primordial gravitational waves originated from inflation particularly focusing on the effect of thermodynamics in the standard model of particle physics by collecting recent results of perturbative and nonperturbative analysis of thermodynamic quantities in the standard model we obtain the effective degrees of freedom including the corrections due to nontrivial interaction properties of particles in the standard model for a wide temperature interval the impact of such corrections on the spectrum of primordial gravitational waves as well as the damping effect due to freestreaming particles is investigated by numerically solving the evolution equation of tensor perturbations in the expanding universe it is shown that the reevaluation of the effects of freestreaming photons and neutrinos gives rise to some additional damping features overlooked in previous studies we also observe that the continuous nature of the qcd crossover results in a smooth spectrum for modes that reenter the horizon at around the epoch of the qcd phase transition furthermore we explicitly show that the values of the effective degrees of freedom remain smaller than the commonly used value 10675 even at temperature much higher than the critical temperature of the electroweak crossover and that the amplitude of primordial gravitational waves at a frequency range relevant to direct detection experiments becomes mathcalo1 larger than previous estimates that do not include such corrections this effect can be relevant to future highsensitivity gravitational wave experiments such as ultimate decigo our results on the temperature evolution of the effective degrees of freedom are made available as tabulated data and fitting functions which can also be used in the analysis of other cosmological relics | [['in', 'this', 'paper', 'we', 'revisit', 'the', 'estimation', 'of', 'the', 'spectrum', 'of', 'primordial', 'gravitational', 'waves', 'originated', 'from', 'inflation', 'particularly', 'focusing', 'on', 'the', 'effect', 'of', 'thermodynamics', 'in', 'the', 'standard', 'model', 'of', 'particle', 'physics', 'by', 'collecting', 'recent', 'results', 'of', 'perturbative', 'and', 'nonperturbative', 'analysis', 'of', 'thermodynamic', 'quantities', 'in', 'the', 'standard', 'model', 'we', 'obtain', 'the', 'effective', 'degrees', 'of', 'freedom', 'including', 'the', 'corrections', 'due', 'to', 'nontrivial', 'interaction', 'properties', 'of', 'particles', 'in', 'the', 'standard', 'model', 'for', 'a', 'wide', 'temperature', 'interval', 'the', 'impact', 'of', 'such', 'corrections', 'on', 'the', 'spectrum', 'of', 'primordial', 'gravitational', 'waves', 'as', 'well', 'as', 'the', 'damping', 'effect', 'due', 'to', 'freestreaming', 'particles', 'is', 'investigated', 'by', 'numerically', 'solving', 'the', 'evolution', 'equation', 'of', 'tensor', 'perturbations', 'in', 'the', 'expanding', 'universe', 'it', 'is', 'shown', 'that', 'the', 'reevaluation', 'of', 'the', 'effects', 'of', 'freestreaming', 'photons', 'and', 'neutrinos', 'gives', 'rise', 'to', 'some', 'additional', 'damping', 'features', 'overlooked', 'in', 'previous', 'studies', 'we', 'also', 'observe', 'that', 'the', 'continuous', 'nature', 'of', 'the', 'qcd', 'crossover', 'results', 'in', 'a', 'smooth', 'spectrum', 'for', 'modes', 'that', 'reenter', 'the', 'horizon', 'at', 'around', 'the', 'epoch', 'of', 'the', 'qcd', 'phase', 'transition', 'furthermore', 'we', 'explicitly', 'show', 'that', 'the', 'values', 'of', 'the', 'effective', 'degrees', 'of', 'freedom', 'remain', 'smaller', 'than', 'the', 'commonly', 'used', 'value', '10675', 'even', 'at', 'temperature', 'much', 'higher', 'than', 'the', 'critical', 'temperature', 'of', 'the', 'electroweak', 'crossover', 'and', 'that', 'the', 'amplitude', 'of', 'primordial', 'gravitational', 'waves', 'at', 'a', 'frequency', 'range', 'relevant', 'to', 'direct', 'detection', 'experiments', 'becomes', 'mathcalo1', 'larger', 'than', 'previous', 'estimates', 'that', 'do', 'not', 'include', 'such', 'corrections', 'this', 'effect', 'can', 'be', 'relevant', 'to', 'future', 'highsensitivity', 'gravitational', 'wave', 'experiments', 'such', 'as', 'ultimate', 'decigo', 'our', 'results', 'on', 'the', 'temperature', 'evolution', 'of', 'the', 'effective', 'degrees', 'of', 'freedom', 'are', 'made', 'available', 'as', 'tabulated', 'data', 'and', 'fitting', 'functions', 'which', 'can', 'also', 'be', 'used', 'in', 'the', 'analysis', 'of', 'other', 'cosmological', 'relics']] | [-0.11663937987717529, 0.18812948174730781, -0.09199371793732533, 0.0919462631362072, -0.06792803589200629, -0.05741396241153226, -0.001718021996329417, 0.28759673875891534, -0.22464099508352522, -0.30639151328722475, 0.09317920322443926, -0.3026405659797804, -0.10229722760023846, 0.204824190914118, 0.04927239675695697, 0.043399814453511244, 0.03152468463826074, 0.027049112943527492, -0.06851074415127463, -0.207793306785828, 0.315264479064828, 0.12781040717685677, 0.23216052429642584, 0.08921469439857005, 0.06190836737548217, -0.030414436047937234, -0.02726867078530157, 0.0188406420149503, -0.1516419383062938, 0.042264277393426884, 0.2068733005793204, 0.08284310256198481, 0.20962004524324954, -0.41208787069763936, -0.2793537020793799, 0.11070115218678003, 0.16168888755087013, 0.1660662974554989, -0.035092857227225424, -0.27289830128311354, 0.038643042928753486, -0.17375873022230234, -0.13905987189576516, -0.06376013253727739, 0.014374611506144098, -0.02707096758177099, -0.2533875494002554, 0.13139217228287464, 0.02884592008279245, 0.011222413447483079, -0.05495334968335279, -0.12716255802829898, -0.025282071586158396, 0.08449237588016938, 0.10381996193124603, 0.011322421411075968, 0.1546537452056815, -0.1762504027721951, -0.08171118246210043, 0.42506032877439714, -0.11797475801991507, -0.1513495689934538, 0.1684773772806469, -0.1868643032123699, -0.1257024238820768, 0.13921868927064823, 0.18448885161036532, 0.12356568492385492, -0.10758929808271468, 0.08415704495627838, 0.028713686205330727, 0.16999634518962947, 0.06663240242304037, 0.08949669842031258, 0.26394457788631803, 0.13948539459227544, 0.02138492985766894, 0.10906046499946134, -0.06907388238840317, -0.08437652085010178, -0.33406459274229366, -0.09032746942366297, -0.17349303694799598, 0.03783392315022681, -0.11929789144451733, -0.15625505576927157, 0.40306003041315713, 0.21800403973716986, 0.17985891805142604, 0.031374791171823534, 0.29999406462994177, 0.11938128598326264, 0.07513406502666707, 0.0432872605793502, 0.33958763037388556, 0.12250279006042072, 0.10777034021684549, -0.244227097880102, 0.022847518969776, 0.01579273762130786] |
1,803.01039 | Stepanov-like Weighted Pseudo-Almost Automorphic Solutions on Time
Scales for a Novel High-order BAM Neural Network with Mixed Time-varying
Delays in the Leakage Terms | We first propose the concept of Stepanov-like weighted pseudo-almost
automorphic on time-space scales and we apply this type of oscillation to
high-order BAM neural networks with mixed delays. Then, we study the existence
and exponential stability of Sp-weighted pseudo almost automorphic on
time-space scales solutions for the suggested system. Some criteria assuring
the convergence are proposed. Our method is mainly based on the Banachs fixed
point theorem, the theory of calculus on time scales and the
Lyapunov-Krasovskii functional method. Moreover, a numerical example is given
to show the effectiveness of the main results.
| math.DS | we first propose the concept of stepanovlike weighted pseudoalmost automorphic on timespace scales and we apply this type of oscillation to highorder bam neural networks with mixed delays then we study the existence and exponential stability of spweighted pseudo almost automorphic on timespace scales solutions for the suggested system some criteria assuring the convergence are proposed our method is mainly based on the banachs fixed point theorem the theory of calculus on time scales and the lyapunovkrasovskii functional method moreover a numerical example is given to show the effectiveness of the main results | [['we', 'first', 'propose', 'the', 'concept', 'of', 'stepanovlike', 'weighted', 'pseudoalmost', 'automorphic', 'on', 'timespace', 'scales', 'and', 'we', 'apply', 'this', 'type', 'of', 'oscillation', 'to', 'highorder', 'bam', 'neural', 'networks', 'with', 'mixed', 'delays', 'then', 'we', 'study', 'the', 'existence', 'and', 'exponential', 'stability', 'of', 'spweighted', 'pseudo', 'almost', 'automorphic', 'on', 'timespace', 'scales', 'solutions', 'for', 'the', 'suggested', 'system', 'some', 'criteria', 'assuring', 'the', 'convergence', 'are', 'proposed', 'our', 'method', 'is', 'mainly', 'based', 'on', 'the', 'banachs', 'fixed', 'point', 'theorem', 'the', 'theory', 'of', 'calculus', 'on', 'time', 'scales', 'and', 'the', 'lyapunovkrasovskii', 'functional', 'method', 'moreover', 'a', 'numerical', 'example', 'is', 'given', 'to', 'show', 'the', 'effectiveness', 'of', 'the', 'main', 'results']] | [-0.1558981831492549, 0.02306388342077588, -0.14389725772479733, 0.08711489038874529, -0.059095877276446954, -0.07948422880208754, 0.052339492180220944, 0.3356027033712183, -0.2837651517692503, -0.24749320182069154, 0.15102615696633911, -0.22277302539569663, -0.2180490911283254, 0.23389892482741192, -0.0733122588493503, 0.09519650710869458, 0.04758708242449786, 0.04479363904293668, -0.0668982088944496, -0.26567545238431994, 0.3962180428462779, 0.024270500442790954, 0.2857268474443437, 0.05832568997936835, 0.12338453873091347, -0.03534716924212382, -0.054970073907707744, -0.025351755136808197, -0.14751489887239186, 0.1451521998611637, 0.1927869008383253, 0.10763161051199659, 0.31871997348063597, -0.4069230735742047, -0.18020575081131288, 0.12052797710210862, 0.09534658835996147, 0.0952835675267564, -0.04474560500398933, -0.30263348660626255, 0.15050000098666974, -0.10586677024980168, -0.12931339178684648, -0.11816596183900281, -0.028937985967066916, 0.09813777127835367, -0.2722415277468307, 0.07873013994277833, 0.10139648855796882, 0.04879914126410098, -0.1350486765354667, -0.09929518179921945, 0.01973613516611794, 0.06708795010306678, 0.05371835467067885, -0.02968463290145027, 0.05513915971208077, -0.021584996597964194, -0.14150896268272464, 0.309903815634303, -0.07319818198384083, -0.2159874608105683, 0.18443662627436386, -0.10431040442743145, -0.15722697810014033, 0.057319387880532625, 0.19797317127973496, 0.17009953415318096, -0.09428294362745933, 0.0897622003026849, -0.055669998340718035, 0.18507800707855815, 0.07715932169294619, 0.018723841326741073, 0.08661755028047732, 0.22645972679870632, 0.11459992216531556, 0.1311726335021616, -0.07153729845739, -0.13069073098537687, -0.3561892944009422, -0.11509879353036592, -0.17195491642169244, 0.026048149000136897, -0.1236641383827421, -0.1775699349038385, 0.4242454185508765, 0.16113543087759843, 0.13823835380825694, 0.17597711910135472, 0.2805796639359259, 0.15024458597142987, 0.03285816121825809, 0.058285827373885574, 0.19675328697821198, 0.15910204544990927, 0.10460903882407226, -0.23507529038137623, 0.01573697560988776, 0.18353170919958706] |
1,803.0104 | Potentials for $\mathcal{A}$-quasiconvexity | We show that each constant rank operator $\mathcal{A}$ admits an exact
potential $\mathbb{B}$ in frequency space. We use this fact to show that the
notion of $\mathcal{A}$-quasiconvexity can be tested against compactly
supported fields. We also show that $\mathcal{A}$-free Young measures are
generated by sequences $\mathbb{B}u_j$, modulo shifts by the barycentre.
| math.AP | we show that each constant rank operator mathcala admits an exact potential mathbbb in frequency space we use this fact to show that the notion of mathcalaquasiconvexity can be tested against compactly supported fields we also show that mathcalafree young measures are generated by sequences mathbbbu_j modulo shifts by the barycentre | [['we', 'show', 'that', 'each', 'constant', 'rank', 'operator', 'mathcala', 'admits', 'an', 'exact', 'potential', 'mathbbb', 'in', 'frequency', 'space', 'we', 'use', 'this', 'fact', 'to', 'show', 'that', 'the', 'notion', 'of', 'mathcalaquasiconvexity', 'can', 'be', 'tested', 'against', 'compactly', 'supported', 'fields', 'we', 'also', 'show', 'that', 'mathcalafree', 'young', 'measures', 'are', 'generated', 'by', 'sequences', 'mathbbbu_j', 'modulo', 'shifts', 'by', 'the', 'barycentre']] | [-0.16114501320585914, 0.1483354293387882, -0.0610569866079533, 0.07160651359507549, -0.055609061031089146, -0.08919817960954138, -0.00898191750961907, 0.44836973953916104, -0.32432446822676125, -0.15938362452600682, 0.07525298373574126, -0.21889084522441335, -0.19925533610928273, 0.22166193071372656, -0.1236532311886549, -0.033957622964315266, 0.1200252019287068, 0.08736197160062742, -0.05358439718601199, -0.24946028930230105, 0.41302549443682846, -0.007312362101309153, 0.2120750298799605, 0.02596464146603355, 0.10820590448090617, -0.02565560487992301, 0.0006520609770502363, 0.07102132343143054, -0.14165741290492648, 0.09348355412331162, 0.23930743955341832, 0.16909688695961114, 0.2696478302989687, -0.3456110634593939, -0.17082384764692005, 0.18424609031680286, 0.12880410503463022, 0.0437909370782424, -0.07824990408000898, -0.3489206366012899, 0.190765683026034, -0.17715629927661955, -0.16110201309225997, -0.13811394230139498, 0.05841310505935808, 0.06132181929614471, -0.29614825075378226, 0.018790394879701758, 0.057755481625184873, 0.053840892218357445, -0.10704091600883676, -0.08612200828763295, -0.03600414395237304, 0.07994246563864682, 0.025989345483938043, 0.05901974749428277, 0.10616710058850598, -0.01109629296887742, -0.14599654018612845, 0.33428880243505144, -0.13828009503836536, -0.2737787085756355, 0.12651687609601994, -0.1870112933351525, -0.11830951891155267, 0.06675787382207964, 0.07428377638665998, 0.11759373814649214, -0.05959839920028664, 0.17112247241014727, -0.10678442871692229, 0.21966360468531446, 0.12305727525975327, 0.0076107486265198305, 0.15948430073390507, 0.0250058064465316, 0.09031512977897513, 0.17035187103034816, -0.011013463975823656, -0.02813258584902375, -0.29903648285984, -0.11860409508012615, -0.1944872742110141, 0.05359166586885647, -0.08576220554318659, -0.1586852372262855, 0.33779587527280863, 0.16206643341717367, 0.17732274296636485, 0.11739347384748411, 0.24490259466122608, 0.15385421473837022, 0.06215232439405684, 0.10298258022462227, 0.1580391213754002, 0.08419121137573099, -0.046512218534338234, -0.1695342765246727, -0.0031040181900013467, 0.11360422379280231] |
1,803.01041 | Spin-wave induced phonon resonance in multiferroic BiFeO$_3$ | We report the direct observation of a "resonance" mode in the lowest-energy
optic phonon very near the zone center around (111) in the multiferroic
BiFeO$_3$ using neutron scattering methods. The phonon scattering intensity is
enhanced when antiferromagnetic (AFM) order sets in at T$_N = 640$~K, and it
increases on cooling. This "resonance" is confined to a very narrow region in
energy-momentum space where no spin-wave excitation intensity is expected, and
it can be modified by an external magnetic field. Our results suggest the
existence of a novel coupling between the lattice and spin fluctuations in this
multiferroic system in which the spin-wave excitations are mapped onto the
lattice vibrations via the Dzyaloshinskii-Moriya (DM) interaction.
| cond-mat.mtrl-sci | we report the direct observation of a resonance mode in the lowestenergy optic phonon very near the zone center around 111 in the multiferroic bifeo_3 using neutron scattering methods the phonon scattering intensity is enhanced when antiferromagnetic afm order sets in at t_n 640k and it increases on cooling this resonance is confined to a very narrow region in energymomentum space where no spinwave excitation intensity is expected and it can be modified by an external magnetic field our results suggest the existence of a novel coupling between the lattice and spin fluctuations in this multiferroic system in which the spinwave excitations are mapped onto the lattice vibrations via the dzyaloshinskiimoriya dm interaction | [['we', 'report', 'the', 'direct', 'observation', 'of', 'a', 'resonance', 'mode', 'in', 'the', 'lowestenergy', 'optic', 'phonon', 'very', 'near', 'the', 'zone', 'center', 'around', '111', 'in', 'the', 'multiferroic', 'bifeo_3', 'using', 'neutron', 'scattering', 'methods', 'the', 'phonon', 'scattering', 'intensity', 'is', 'enhanced', 'when', 'antiferromagnetic', 'afm', 'order', 'sets', 'in', 'at', 't_n', '640k', 'and', 'it', 'increases', 'on', 'cooling', 'this', 'resonance', 'is', 'confined', 'to', 'a', 'very', 'narrow', 'region', 'in', 'energymomentum', 'space', 'where', 'no', 'spinwave', 'excitation', 'intensity', 'is', 'expected', 'and', 'it', 'can', 'be', 'modified', 'by', 'an', 'external', 'magnetic', 'field', 'our', 'results', 'suggest', 'the', 'existence', 'of', 'a', 'novel', 'coupling', 'between', 'the', 'lattice', 'and', 'spin', 'fluctuations', 'in', 'this', 'multiferroic', 'system', 'in', 'which', 'the', 'spinwave', 'excitations', 'are', 'mapped', 'onto', 'the', 'lattice', 'vibrations', 'via', 'the', 'dzyaloshinskiimoriya', 'dm', 'interaction']] | [-0.17701264305979805, 0.23026760726607204, -0.04662619772021024, 0.01019939643215487, -0.08584863101585513, -0.06514783513905333, 0.05674637509592339, 0.4312356500433082, -0.28180727113730614, -0.22817872607651934, 0.028043375768805896, -0.31890488781067916, -0.0897682805729008, 0.1799566780043914, 0.0952716196114012, -0.0373715450739966, 0.001594018561979838, 0.02245212677841495, -0.0333255858034868, -0.1413079876528921, 0.26277583769411345, 0.03577467961756067, 0.2947658645236387, 0.09024130309874241, 0.03273829781920114, 0.053234170120033286, 0.15297319005301172, -0.028916131021234463, -0.13202351780888516, 0.06372793484067099, 0.2681673141263335, -0.10424984572558309, 0.17530891138120694, -0.40628403075764663, -0.1838934039944305, 0.009277343737637311, 0.19135150049227925, 0.15981975580520302, -0.04615266856519027, -0.30698823074983284, 0.021878719368467386, -0.12685850200210327, -0.11197552316156587, -0.08935111734719403, -0.03642452801928023, -0.027430359216456392, -0.258464692426285, 0.09584611399198133, 0.06430163508923971, 0.09904823205804666, -0.11316123097492135, -0.08255443006106941, -0.07742362590383046, 0.0005892096409281567, 0.06821299977476948, 0.0967276084104932, 0.17402374923262184, -0.09267475223064099, -0.10334175891259405, 0.36140153666677993, -0.08853305215984418, -0.1052701099635621, 0.14890159144008583, -0.21113844960103784, -0.07148417916001579, 0.2147721243956316, 0.12037115036128748, 0.09596325498717152, -0.1153670520697096, 0.07419668513698405, -0.001492675064148101, 0.202867066405252, 0.059419819767858865, 0.0684316033112149, 0.29257853367093917, 0.20543684310741328, 0.027828440894331553, 0.15129543573954102, -0.16308006064644892, -0.05300330787287217, -0.2508150598537012, -0.1132304977931585, -0.24963563268636435, 0.0206831727481851, -0.08299716975603282, -0.13616289724224964, 0.3607087541058396, 0.1413588384125151, 0.17091276981266199, -0.0821563268329668, 0.27177462580539613, 0.11753990455938552, 0.10188920152233502, 0.06324024372775339, 0.3334896440032573, 0.2037888429667471, 0.12921227139330146, -0.3471525073241014, 0.001947992362300412, -0.017682992882070554] |
1,803.01042 | On the Optimal Shape of Tree Roots and Branches | This paper introduces two classes of variational problems, determining
optimal shapes for tree roots and branches. Given a measure $\mu$, describing
the distribution of leaves, we introduce a sunlight functional $\S(\mu)$
computing the total amount of light captured by the leaves. On the other hand,
given a measure $\mu$ describing the distribution of root hair cells, we
consider a harvest functional $\H(\mu)$ computing the total amount of water and
nutrients gathered by the roots. In both cases, we seek to maximize these
functionals subject to a ramified transportation cost, for transporting
nutrients from the roots to the trunk and from the trunk to the leaves. The
main results establish various properties of these functionals, and the
existence of optimal distributions. In particular, we prove the upper
semicontinuity of $\S$ and $\H$, together with a priori estimates on the
support of optimal distributions.
| math.OC | this paper introduces two classes of variational problems determining optimal shapes for tree roots and branches given a measure mu describing the distribution of leaves we introduce a sunlight functional smu computing the total amount of light captured by the leaves on the other hand given a measure mu describing the distribution of root hair cells we consider a harvest functional hmu computing the total amount of water and nutrients gathered by the roots in both cases we seek to maximize these functionals subject to a ramified transportation cost for transporting nutrients from the roots to the trunk and from the trunk to the leaves the main results establish various properties of these functionals and the existence of optimal distributions in particular we prove the upper semicontinuity of s and h together with a priori estimates on the support of optimal distributions | [['this', 'paper', 'introduces', 'two', 'classes', 'of', 'variational', 'problems', 'determining', 'optimal', 'shapes', 'for', 'tree', 'roots', 'and', 'branches', 'given', 'a', 'measure', 'mu', 'describing', 'the', 'distribution', 'of', 'leaves', 'we', 'introduce', 'a', 'sunlight', 'functional', 'smu', 'computing', 'the', 'total', 'amount', 'of', 'light', 'captured', 'by', 'the', 'leaves', 'on', 'the', 'other', 'hand', 'given', 'a', 'measure', 'mu', 'describing', 'the', 'distribution', 'of', 'root', 'hair', 'cells', 'we', 'consider', 'a', 'harvest', 'functional', 'hmu', 'computing', 'the', 'total', 'amount', 'of', 'water', 'and', 'nutrients', 'gathered', 'by', 'the', 'roots', 'in', 'both', 'cases', 'we', 'seek', 'to', 'maximize', 'these', 'functionals', 'subject', 'to', 'a', 'ramified', 'transportation', 'cost', 'for', 'transporting', 'nutrients', 'from', 'the', 'roots', 'to', 'the', 'trunk', 'and', 'from', 'the', 'trunk', 'to', 'the', 'leaves', 'the', 'main', 'results', 'establish', 'various', 'properties', 'of', 'these', 'functionals', 'and', 'the', 'existence', 'of', 'optimal', 'distributions', 'in', 'particular', 'we', 'prove', 'the', 'upper', 'semicontinuity', 'of', 's', 'and', 'h', 'together', 'with', 'a', 'priori', 'estimates', 'on', 'the', 'support', 'of', 'optimal', 'distributions']] | [-0.14296528668483902, 0.10195620590656944, -0.06553337372459052, 0.07007535640396256, -0.04660977096572309, -0.07772924883527235, 0.10409176985251153, 0.2978082924727088, -0.2953498727464917, -0.30323290208380826, 0.08512697546434601, -0.3259800845940768, -0.1343086546969036, 0.16416308437277313, -0.11378940981878362, 0.05674140723290998, 0.05418295752271763, 0.06085289060466097, -0.009567529521390639, -0.216186056553032, 0.33136080925329914, 0.015429182309316287, 0.25777752899472983, 0.07154100109547587, 0.16674845357110699, 0.0026534803319906053, -0.04021036599001939, -0.012402982694420387, -0.20634739873865227, 0.20513579570753893, 0.22291529477036126, 0.1555435241406626, 0.2686544447205961, -0.4211314549328576, -0.20330513939880404, 0.19254765881579633, 0.08746490983167847, 0.03269481755183144, -0.03557687298506236, -0.21851690595274345, 0.09344071541539013, -0.09493343253672437, -0.13979064105373715, -0.021269580993709535, 0.02818797935377544, 0.08729820464685245, -0.25355945492137066, 0.027452290594302327, 0.02458746434832123, 0.04661128706315985, -0.11348280404090987, -0.15880367938350415, -0.05745258089646854, 0.159398414411018, 0.054567065622623104, -0.005080576117058665, 0.14409279233028352, -0.12679116390678297, -0.07233779793146106, 0.351411591520087, -0.04429055196167508, -0.22529860483613653, 0.1761612583896224, -0.15758381797079468, -0.13395798779551832, 0.10431207656781648, 0.20756257597593145, 0.10904880081185363, -0.16188993721439596, 0.08355785480456125, -0.04569636778840402, 0.10613735620601392, 0.11560748034799603, 0.024876756593585014, 0.1661235283417496, 0.11130855025061157, 0.15137407660704028, 0.1765041279456493, -0.07956411300594328, -0.08744702395379648, -0.3000839506882623, -0.17774284996164463, -0.17502603507403966, 0.06260190765753808, -0.09412378048092622, -0.18472042757178275, 0.39865387753176856, 0.11112924319901832, 0.21308257838737377, 0.11109728163475512, 0.24502710500915706, 0.12076703607904869, 0.0367416840708244, 0.09696411279816256, 0.1447186108652345, 0.15185385001257626, 0.05093684201259953, -0.19379540697284514, 0.086466482965092, 0.07349631147013164] |
1,803.01043 | Building a Telescope to Look Into High-Dimensional Image Spaces | An image pattern can be represented by a probability distribution whose
density is concentrated on different low-dimensional subspaces in the
high-dimensional image space. Such probability densities have an astronomical
number of local modes corresponding to typical pattern appearances. Related
groups of modes can join to form macroscopic image basins that represent
pattern concepts. Recent works use neural networks that capture high-order
image statistics to learn Gibbs models capable of synthesizing realistic images
of many patterns. However, characterizing a learned probability density to
uncover the Hopfield memories of the model, encoded by the structure of the
local modes, remains an open challenge. In this work, we present novel
computational experiments that map and visualize the local mode structure of
Gibbs densities. Efficient mapping requires identifying the global basins
without enumerating the countless modes. Inspired by Grenander's jump-diffusion
method, we propose a new MCMC tool called Attraction-Diffusion (AD) that can
capture the macroscopic structure of highly non-convex densities by measuring
metastability of local modes. AD involves altering the target density with a
magnetization potential penalizing distance from a known mode and running an
MCMC sample of the altered density to measure the stability of the initial
chain state. Using a low-dimensional generator network to facilitate
exploration, we map image spaces with up to 12,288 dimensions (64 $\times$ 64
pixels in RGB). Our work shows: (1) AD can efficiently map highly non-convex
probability densities, (2) metastable regions of pattern probability densities
contain coherent groups of images, and (3) the perceptibility of differences
between training images influences the metastability of image basins.
| stat.ML cs.LG | an image pattern can be represented by a probability distribution whose density is concentrated on different lowdimensional subspaces in the highdimensional image space such probability densities have an astronomical number of local modes corresponding to typical pattern appearances related groups of modes can join to form macroscopic image basins that represent pattern concepts recent works use neural networks that capture highorder image statistics to learn gibbs models capable of synthesizing realistic images of many patterns however characterizing a learned probability density to uncover the hopfield memories of the model encoded by the structure of the local modes remains an open challenge in this work we present novel computational experiments that map and visualize the local mode structure of gibbs densities efficient mapping requires identifying the global basins without enumerating the countless modes inspired by grenanders jumpdiffusion method we propose a new mcmc tool called attractiondiffusion ad that can capture the macroscopic structure of highly nonconvex densities by measuring metastability of local modes ad involves altering the target density with a magnetization potential penalizing distance from a known mode and running an mcmc sample of the altered density to measure the stability of the initial chain state using a lowdimensional generator network to facilitate exploration we map image spaces with up to 12288 dimensions 64 times 64 pixels in rgb our work shows 1 ad can efficiently map highly nonconvex probability densities 2 metastable regions of pattern probability densities contain coherent groups of images and 3 the perceptibility of differences between training images influences the metastability of image basins | [['an', 'image', 'pattern', 'can', 'be', 'represented', 'by', 'a', 'probability', 'distribution', 'whose', 'density', 'is', 'concentrated', 'on', 'different', 'lowdimensional', 'subspaces', 'in', 'the', 'highdimensional', 'image', 'space', 'such', 'probability', 'densities', 'have', 'an', 'astronomical', 'number', 'of', 'local', 'modes', 'corresponding', 'to', 'typical', 'pattern', 'appearances', 'related', 'groups', 'of', 'modes', 'can', 'join', 'to', 'form', 'macroscopic', 'image', 'basins', 'that', 'represent', 'pattern', 'concepts', 'recent', 'works', 'use', 'neural', 'networks', 'that', 'capture', 'highorder', 'image', 'statistics', 'to', 'learn', 'gibbs', 'models', 'capable', 'of', 'synthesizing', 'realistic', 'images', 'of', 'many', 'patterns', 'however', 'characterizing', 'a', 'learned', 'probability', 'density', 'to', 'uncover', 'the', 'hopfield', 'memories', 'of', 'the', 'model', 'encoded', 'by', 'the', 'structure', 'of', 'the', 'local', 'modes', 'remains', 'an', 'open', 'challenge', 'in', 'this', 'work', 'we', 'present', 'novel', 'computational', 'experiments', 'that', 'map', 'and', 'visualize', 'the', 'local', 'mode', 'structure', 'of', 'gibbs', 'densities', 'efficient', 'mapping', 'requires', 'identifying', 'the', 'global', 'basins', 'without', 'enumerating', 'the', 'countless', 'modes', 'inspired', 'by', 'grenanders', 'jumpdiffusion', 'method', 'we', 'propose', 'a', 'new', 'mcmc', 'tool', 'called', 'attractiondiffusion', 'ad', 'that', 'can', 'capture', 'the', 'macroscopic', 'structure', 'of', 'highly', 'nonconvex', 'densities', 'by', 'measuring', 'metastability', 'of', 'local', 'modes', 'ad', 'involves', 'altering', 'the', 'target', 'density', 'with', 'a', 'magnetization', 'potential', 'penalizing', 'distance', 'from', 'a', 'known', 'mode', 'and', 'running', 'an', 'mcmc', 'sample', 'of', 'the', 'altered', 'density', 'to', 'measure', 'the', 'stability', 'of', 'the', 'initial', 'chain', 'state', 'using', 'a', 'lowdimensional', 'generator', 'network', 'to', 'facilitate', 'exploration', 'we', 'map', 'image', 'spaces', 'with', 'up', 'to', '12288', 'dimensions', '64', 'times', '64', 'pixels', 'in', 'rgb', 'our', 'work', 'shows', '1', 'ad', 'can', 'efficiently', 'map', 'highly', 'nonconvex', 'probability', 'densities', '2', 'metastable', 'regions', 'of', 'pattern', 'probability', 'densities', 'contain', 'coherent', 'groups', 'of', 'images', 'and', '3', 'the', 'perceptibility', 'of', 'differences', 'between', 'training', 'images', 'influences', 'the', 'metastability', 'of', 'image', 'basins']] | [-0.0980161282828201, 0.11158746950929, -0.0901471144974536, 0.08207987064173163, -0.04955287027473521, -0.10259226043907933, 0.043031632300948267, 0.39732907284848423, -0.2941996183514537, -0.3257025748089043, 0.056596819790178034, -0.24530602216445171, -0.15389204084518066, 0.13808336026220516, -0.08458296430445773, 0.07248312553593794, 0.07017250236301367, 0.00969854346748282, -0.06671643630576099, -0.20098527300566552, 0.3111044040795937, 0.05147605432842492, 0.32747819605518985, -0.04624984537727826, 0.11327119314760434, -0.036362382842423505, -0.0253116015819579, -0.009660573337514295, -0.10139113566115705, 0.17053270281622265, 0.27462879417922836, 0.1740966840567437, 0.262209352884072, -0.4486704421579756, -0.2457645357901716, 0.13674917358249164, 0.1480718975351509, 0.09783166186550654, -0.04261528714858938, -0.3271999203215864, 0.0630580068648347, -0.11598184268517557, -0.09650472844570353, -0.1338865818357972, 0.017394002454069076, 0.01508735132028606, -0.2689033175910577, 0.08114117231303355, 0.044897401475724456, 0.05060366898637395, -0.04559466484861615, -0.0813371502352219, -0.038975433886761446, 0.1502099318324737, 0.0031446943042350477, 0.035427128789214425, 0.16926625323326033, -0.162187832188865, -0.10544848697285389, 0.3319329803896495, -0.03345873561444972, -0.19951821546657336, 0.19376413230892953, -0.10871489634302514, -0.11857088532295179, 0.17717063185262424, 0.17906041931476924, 0.11908946195726033, -0.14158736746681216, 0.0509338545015513, -0.02681737087833684, 0.19001717005669708, 0.07807499939731616, 0.02416124130061969, 0.2109535341042344, 0.18577094014248438, 0.08683148466013481, 0.13458823455961472, -0.15327240618834534, -0.10052648723054793, -0.21864589191665185, -0.10856194852159182, -0.21180026031507845, 0.0036035602276325808, -0.11481481543924443, -0.17153237915059039, 0.4249992243237141, 0.14995446444092153, 0.2525453368781211, 0.05481780386178352, 0.2729086929140431, 0.05726300773042316, 0.07061654139638078, 0.065562343595419, 0.13591754429788847, 0.09671412952106577, 0.056295270634749865, -0.18387887423906968, 0.08017974351994794, 0.07048863821557871] |
1,803.01044 | Multi-Agent Imitation Learning for Driving Simulation | Simulation is an appealing option for validating the safety of autonomous
vehicles. Generative Adversarial Imitation Learning (GAIL) has recently been
shown to learn representative human driver models. These human driver models
were learned through training in single-agent environments, but they have
difficulty in generalizing to multi-agent driving scenarios. We argue these
difficulties arise because observations at training and test time are sampled
from different distributions. This difference makes such models unsuitable for
the simulation of driving scenes, where multiple agents must interact
realistically over long time horizons. We extend GAIL to address these
shortcomings through a parameter-sharing approach grounded in curriculum
learning. Compared with single-agent GAIL policies, policies generated by our
PS-GAIL method prove superior at interacting stably in a multi-agent setting
and capturing the emergent behavior of human drivers.
| cs.AI | simulation is an appealing option for validating the safety of autonomous vehicles generative adversarial imitation learning gail has recently been shown to learn representative human driver models these human driver models were learned through training in singleagent environments but they have difficulty in generalizing to multiagent driving scenarios we argue these difficulties arise because observations at training and test time are sampled from different distributions this difference makes such models unsuitable for the simulation of driving scenes where multiple agents must interact realistically over long time horizons we extend gail to address these shortcomings through a parametersharing approach grounded in curriculum learning compared with singleagent gail policies policies generated by our psgail method prove superior at interacting stably in a multiagent setting and capturing the emergent behavior of human drivers | [['simulation', 'is', 'an', 'appealing', 'option', 'for', 'validating', 'the', 'safety', 'of', 'autonomous', 'vehicles', 'generative', 'adversarial', 'imitation', 'learning', 'gail', 'has', 'recently', 'been', 'shown', 'to', 'learn', 'representative', 'human', 'driver', 'models', 'these', 'human', 'driver', 'models', 'were', 'learned', 'through', 'training', 'in', 'singleagent', 'environments', 'but', 'they', 'have', 'difficulty', 'in', 'generalizing', 'to', 'multiagent', 'driving', 'scenarios', 'we', 'argue', 'these', 'difficulties', 'arise', 'because', 'observations', 'at', 'training', 'and', 'test', 'time', 'are', 'sampled', 'from', 'different', 'distributions', 'this', 'difference', 'makes', 'such', 'models', 'unsuitable', 'for', 'the', 'simulation', 'of', 'driving', 'scenes', 'where', 'multiple', 'agents', 'must', 'interact', 'realistically', 'over', 'long', 'time', 'horizons', 'we', 'extend', 'gail', 'to', 'address', 'these', 'shortcomings', 'through', 'a', 'parametersharing', 'approach', 'grounded', 'in', 'curriculum', 'learning', 'compared', 'with', 'singleagent', 'gail', 'policies', 'policies', 'generated', 'by', 'our', 'psgail', 'method', 'prove', 'superior', 'at', 'interacting', 'stably', 'in', 'a', 'multiagent', 'setting', 'and', 'capturing', 'the', 'emergent', 'behavior', 'of', 'human', 'drivers']] | [-0.05068617494318403, 0.06284207905303821, -0.09567413535402265, 0.11570246094231341, -0.12003150096798475, -0.2186161722959012, -0.007018360981623851, 0.4949919496222522, -0.26337335766978964, -0.35268756884281965, 0.05222599457068614, -0.2481318592534278, -0.1810492261731636, 0.20719940267329992, -0.2000901139027244, 0.09401534742571038, 0.10371739047131855, -0.00937695368987241, 0.018109745495815493, -0.27610823986041105, 0.286752799200977, 0.011798330094455921, 0.30613177416976106, -0.049820702627676634, 0.16550367678941566, -0.04913230477326889, -0.0033469004231656708, -0.0031837517929862637, -0.03583959732998827, 0.10663710534572601, 0.38958560194580005, 0.18883135531805167, 0.4122895745365599, -0.4695076893639657, -0.2847378478609314, 0.12391924342256068, 0.14597429208414153, 0.09814569630024796, -0.028349397088538193, -0.37440254415074986, 0.05774945801109538, -0.216571553938755, -0.055848001036792994, -0.11985481975693978, -0.031214995612931805, 0.027954595963030245, -0.2951831977756679, -0.01930059276001398, 0.05277746463151172, 0.10139483002433192, -0.08741396224819296, -0.06886879754498197, 0.030419053428611436, 0.1892357886111898, 0.08908154719234841, -0.019981073009846514, 0.15666385197131208, -0.18938996314879708, -0.1819173934826151, 0.35770741766390873, 0.0103321654479337, -0.1985809446381073, 0.2609323142132498, -0.039355142457165225, -0.13971953967210743, 0.08384357640418665, 0.23614504955467125, 0.14378741028169964, -0.18343519132815359, 0.033307084604346934, -0.008617038701393808, 0.10665211502585357, 0.025869621678667014, -0.04256893649504181, 0.19875597888820393, 0.2575617384078891, 0.034162994667295686, 0.08825978732761718, -0.017893778874950354, -0.18600665760955723, -0.21327973842709289, -0.0515869290747521, -0.14859789650338565, -0.0067584948007797085, -0.061979078109937455, -0.0839648511978868, 0.3293501818624809, 0.28187434371134856, 0.14560873118521406, 0.14838820456007365, 0.33398376594391443, 0.04497769447684274, 0.08843541083958491, 0.12057348223612463, 0.2119481579469185, -0.03092170430549471, 0.14160670601318828, -0.1750655098829072, 0.15141153581712988, -0.02088348077187791] |
1,803.01045 | Quantitatively Evaluating GANs With Divergences Proposed for Training | Generative adversarial networks (GANs) have been extremely effective in
approximating complex distributions of high-dimensional, input data samples,
and substantial progress has been made in understanding and improving GAN
performance in terms of both theory and application. However, we currently lack
quantitative methods for model assessment. Because of this, while many GAN
variants are being proposed, we have relatively little understanding of their
relative abilities. In this paper, we evaluate the performance of various types
of GANs using divergence and distance functions typically used only for
training. We observe consistency across the various proposed metrics and,
interestingly, the test-time metrics do not favour networks that use the same
training-time criterion. We also compare the proposed metrics to human
perceptual scores.
| cs.LG | generative adversarial networks gans have been extremely effective in approximating complex distributions of highdimensional input data samples and substantial progress has been made in understanding and improving gan performance in terms of both theory and application however we currently lack quantitative methods for model assessment because of this while many gan variants are being proposed we have relatively little understanding of their relative abilities in this paper we evaluate the performance of various types of gans using divergence and distance functions typically used only for training we observe consistency across the various proposed metrics and interestingly the testtime metrics do not favour networks that use the same trainingtime criterion we also compare the proposed metrics to human perceptual scores | [['generative', 'adversarial', 'networks', 'gans', 'have', 'been', 'extremely', 'effective', 'in', 'approximating', 'complex', 'distributions', 'of', 'highdimensional', 'input', 'data', 'samples', 'and', 'substantial', 'progress', 'has', 'been', 'made', 'in', 'understanding', 'and', 'improving', 'gan', 'performance', 'in', 'terms', 'of', 'both', 'theory', 'and', 'application', 'however', 'we', 'currently', 'lack', 'quantitative', 'methods', 'for', 'model', 'assessment', 'because', 'of', 'this', 'while', 'many', 'gan', 'variants', 'are', 'being', 'proposed', 'we', 'have', 'relatively', 'little', 'understanding', 'of', 'their', 'relative', 'abilities', 'in', 'this', 'paper', 'we', 'evaluate', 'the', 'performance', 'of', 'various', 'types', 'of', 'gans', 'using', 'divergence', 'and', 'distance', 'functions', 'typically', 'used', 'only', 'for', 'training', 'we', 'observe', 'consistency', 'across', 'the', 'various', 'proposed', 'metrics', 'and', 'interestingly', 'the', 'testtime', 'metrics', 'do', 'not', 'favour', 'networks', 'that', 'use', 'the', 'same', 'trainingtime', 'criterion', 'we', 'also', 'compare', 'the', 'proposed', 'metrics', 'to', 'human', 'perceptual', 'scores']] | [-0.02010570064054004, -0.01845714100832198, -0.06258450021982945, 0.13927046206638904, -0.07040365166304742, -0.13060030438976378, 0.015312189273457942, 0.4984957241148007, -0.18333077105153509, -0.3634627123848543, 0.07713291069743138, -0.2661281781263274, -0.2305243314858213, 0.18927820696311556, -0.16282903532959334, 0.14309101841537705, 0.11661303175237625, 0.006685435899118541, -0.0930806285684083, -0.3114250838412207, 0.30763408854337676, 0.06269533570245409, 0.39644722939476745, 0.07044382643310682, 0.11014392296288372, -0.0698010684186671, -0.022990959966966117, 0.041252926669960076, -0.08143462631940702, 0.177144742359509, 0.28426577485197796, 0.19994555239589148, 0.35276646529590444, -0.4233737447682549, -0.2580858731658018, 0.1582377030956363, 0.1455261463611465, 0.11002339364201644, -0.06510663265558038, -0.279418382112782, 0.1288418011708545, -0.17072837997791396, 0.013647238105660727, -0.17623373454421007, -0.02892559172170816, 0.018544394415783687, -0.23125876303167403, 0.01441197720319111, 0.07495409396836317, 0.09580684046675804, -0.05833850309111867, -0.1479257758151145, 0.010903797396106505, 0.19162862208679693, 0.09607753252997964, 0.031754420224984155, 0.08252217353345091, -0.1883489843212756, -0.1414689198116764, 0.3332077540817256, -0.051437359635851214, -0.22601132755639314, 0.24368581297893485, -0.08884683293642617, -0.15228298762343637, 0.057748185734835866, 0.2405141315495345, 0.12763258662200025, -0.16648196072137655, 0.041270459099661, 0.02347322232911692, 0.13301141529261848, 0.06839490140702169, 0.07450729821018186, 0.1332410127609311, 0.1991661883374097, -0.0047847262349864075, 0.11937055354468337, -0.09236144063947331, -0.10462663942916679, -0.20045699385785254, -0.12286210613190236, -0.1709787710961111, -0.007909122734998759, -0.10675031282024815, -0.17024824803131594, 0.40905084021139043, 0.21779613412658394, 0.2179124128335633, 0.10250394248394805, 0.3240710979311907, 0.0314077136787672, 0.09909387034297522, 0.06329715372838017, 0.2618698420320019, 0.07021928184172686, 0.08629469400733522, -0.13889708970194026, 0.16437576647980937, -0.011217688599663997] |
1,803.01046 | A Class of Multiparameter Oscillatory Singular Integral Operators:
Endpoint Hardy Space Bounds | We establish endpoint bounds on a Hardy space $H^1$ for a natural class of
multiparameter singular integral operators which do not decay away from the
support of rectangular atoms. Hence the usual argument via a Journ\'e-type
covering lemma to deduce bounds on product $H^1$ is not valid.
We consider the class of multiparameter oscillatory singular integral
operators given by convolution with the classical multiple Hilbert transform
kernel modulated by a general polynomial oscillation. Various characterisations
are known which give $L^2$ (or more generally $L^p, 1<p<\infty$) bounds. Here
we initiate an investigation of endpoint bounds on the rectangular Hardy space
$H^1$ in two dimensions; we give a characterisation when bounds hold which are
uniform over a given subspace of polynomials and somewhat surprisingly, we
discover that the Hardy space and $L^p$ theories for these operators are very
different.
| math.CA | we establish endpoint bounds on a hardy space h1 for a natural class of multiparameter singular integral operators which do not decay away from the support of rectangular atoms hence the usual argument via a journetype covering lemma to deduce bounds on product h1 is not valid we consider the class of multiparameter oscillatory singular integral operators given by convolution with the classical multiple hilbert transform kernel modulated by a general polynomial oscillation various characterisations are known which give l2 or more generally lp 1pinfty bounds here we initiate an investigation of endpoint bounds on the rectangular hardy space h1 in two dimensions we give a characterisation when bounds hold which are uniform over a given subspace of polynomials and somewhat surprisingly we discover that the hardy space and lp theories for these operators are very different | [['we', 'establish', 'endpoint', 'bounds', 'on', 'a', 'hardy', 'space', 'h1', 'for', 'a', 'natural', 'class', 'of', 'multiparameter', 'singular', 'integral', 'operators', 'which', 'do', 'not', 'decay', 'away', 'from', 'the', 'support', 'of', 'rectangular', 'atoms', 'hence', 'the', 'usual', 'argument', 'via', 'a', 'journetype', 'covering', 'lemma', 'to', 'deduce', 'bounds', 'on', 'product', 'h1', 'is', 'not', 'valid', 'we', 'consider', 'the', 'class', 'of', 'multiparameter', 'oscillatory', 'singular', 'integral', 'operators', 'given', 'by', 'convolution', 'with', 'the', 'classical', 'multiple', 'hilbert', 'transform', 'kernel', 'modulated', 'by', 'a', 'general', 'polynomial', 'oscillation', 'various', 'characterisations', 'are', 'known', 'which', 'give', 'l2', 'or', 'more', 'generally', 'lp', '1pinfty', 'bounds', 'here', 'we', 'initiate', 'an', 'investigation', 'of', 'endpoint', 'bounds', 'on', 'the', 'rectangular', 'hardy', 'space', 'h1', 'in', 'two', 'dimensions', 'we', 'give', 'a', 'characterisation', 'when', 'bounds', 'hold', 'which', 'are', 'uniform', 'over', 'a', 'given', 'subspace', 'of', 'polynomials', 'and', 'somewhat', 'surprisingly', 'we', 'discover', 'that', 'the', 'hardy', 'space', 'and', 'lp', 'theories', 'for', 'these', 'operators', 'are', 'very', 'different']] | [-0.11827537856794045, 0.12535848651478934, -0.07844970812541707, 0.1383921187610694, -0.11748817735796739, -0.13111492995556226, 0.03130794473862111, 0.34543584100217284, -0.29079444754033296, -0.17421676432679625, 0.18309288071160315, -0.2305828706440105, -0.11500042294980684, 0.27585014433733546, -0.05900963521494037, 0.05083344422489651, 0.0632539591529434, 0.05312282342792434, -0.15615453076144845, -0.26157825602636237, 0.3974174129886224, -0.045458301278652954, 0.17871038488673924, 0.02066691970685497, 0.032715121773756385, 0.022064797532306436, -0.04888513231965001, -0.0567855143083708, -0.22227856824338232, 0.17713817123063458, 0.24484150339027538, 0.0698229335625108, 0.270465922096799, -0.42404670473051204, -0.17491426922873976, 0.21233551802117076, 0.1489138923403944, 0.008808104614966878, -0.018310519091862848, -0.3158147101126173, 0.038989993926781395, -0.0938152443165617, -0.13341593689298914, -0.11913423200466615, -0.0033695996047326308, 0.04233300411108169, -0.34719675053116483, 0.07272203646168825, 0.1241783386315493, 0.04011303821222528, -0.11621090798871592, -0.13416961059299545, 0.05607195122437963, 0.03867530817040139, -0.024488534726140855, 0.03727326754768215, 0.07944599893081057, -0.05291147021275452, -0.105874361415558, 0.29632684258703035, -0.05553201921172919, -0.24827786740463445, 0.15294318904917042, -0.2141935451380799, -0.13726396080079106, 0.07855888289700755, 0.13204333696322626, 0.1505694509439362, -0.10532713920335535, 0.1758073488214423, -0.129331130784361, 0.10606182193356183, 0.12538722552263232, 0.10895784425776904, 0.07015446448862991, 0.05281570695703575, 0.20008907572071835, 0.14516047959435074, -0.011883039213738384, -0.09930992218227509, -0.3654025526043637, -0.14041090030770967, -0.1738182222470641, 0.07711668448503, -0.13667245513929896, -0.21604475182694466, 0.330185811737251, 0.06432682195436963, 0.21073558553967708, 0.1401541869948714, 0.20019635626607957, 0.13280748607084045, 0.07726024755495875, 0.05853506404331282, 0.18971443052321454, 0.1574588449062396, 0.07199344439483385, -0.09516004588048792, -0.003964092907742323, 0.22358830335125437] |
1,803.01047 | Unsupervised Odometry and Depth Learning for Endoscopic Capsule Robots | In the last decade, many medical companies and research groups have tried to
convert passive capsule endoscopes as an emerging and minimally invasive
diagnostic technology into actively steerable endoscopic capsule robots which
will provide more intuitive disease detection, targeted drug delivery and
biopsy-like operations in the gastrointestinal(GI) tract. In this study, we
introduce a fully unsupervised, real-time odometry and depth learner for
monocular endoscopic capsule robots. We establish the supervision by warping
view sequences and assigning the re-projection minimization to the loss
function, which we adopt in multi-view pose estimation and single-view depth
estimation network. Detailed quantitative and qualitative analyses of the
proposed framework performed on non-rigidly deformable ex-vivo porcine stomach
datasets proves the effectiveness of the method in terms of motion estimation
and depth recovery.
| cs.RO | in the last decade many medical companies and research groups have tried to convert passive capsule endoscopes as an emerging and minimally invasive diagnostic technology into actively steerable endoscopic capsule robots which will provide more intuitive disease detection targeted drug delivery and biopsylike operations in the gastrointestinalgi tract in this study we introduce a fully unsupervised realtime odometry and depth learner for monocular endoscopic capsule robots we establish the supervision by warping view sequences and assigning the reprojection minimization to the loss function which we adopt in multiview pose estimation and singleview depth estimation network detailed quantitative and qualitative analyses of the proposed framework performed on nonrigidly deformable exvivo porcine stomach datasets proves the effectiveness of the method in terms of motion estimation and depth recovery | [['in', 'the', 'last', 'decade', 'many', 'medical', 'companies', 'and', 'research', 'groups', 'have', 'tried', 'to', 'convert', 'passive', 'capsule', 'endoscopes', 'as', 'an', 'emerging', 'and', 'minimally', 'invasive', 'diagnostic', 'technology', 'into', 'actively', 'steerable', 'endoscopic', 'capsule', 'robots', 'which', 'will', 'provide', 'more', 'intuitive', 'disease', 'detection', 'targeted', 'drug', 'delivery', 'and', 'biopsylike', 'operations', 'in', 'the', 'gastrointestinalgi', 'tract', 'in', 'this', 'study', 'we', 'introduce', 'a', 'fully', 'unsupervised', 'realtime', 'odometry', 'and', 'depth', 'learner', 'for', 'monocular', 'endoscopic', 'capsule', 'robots', 'we', 'establish', 'the', 'supervision', 'by', 'warping', 'view', 'sequences', 'and', 'assigning', 'the', 'reprojection', 'minimization', 'to', 'the', 'loss', 'function', 'which', 'we', 'adopt', 'in', 'multiview', 'pose', 'estimation', 'and', 'singleview', 'depth', 'estimation', 'network', 'detailed', 'quantitative', 'and', 'qualitative', 'analyses', 'of', 'the', 'proposed', 'framework', 'performed', 'on', 'nonrigidly', 'deformable', 'exvivo', 'porcine', 'stomach', 'datasets', 'proves', 'the', 'effectiveness', 'of', 'the', 'method', 'in', 'terms', 'of', 'motion', 'estimation', 'and', 'depth', 'recovery']] | [-0.04312432968835046, -0.002690600814187952, -0.08158660373620448, 0.0039784497348591685, -0.08235328707979211, -0.19427132666591676, -0.007738608893217339, 0.4679281594411981, -0.2376472206801296, -0.3151033821200291, 0.09318815458109678, -0.2455648384132092, -0.2369873646286226, 0.17571711292182426, -0.2354445289857986, 0.11643631182490818, 0.15918175614112237, 0.011573519428390184, -0.007882904612474264, -0.23388491032622574, 0.23484392617941804, -0.0030637447677192187, 0.34355997849225756, 0.039009532545723265, 0.13739943835553864, 0.08674162720525337, -0.06892579205281611, -0.035832404814549766, -0.12303029393379186, 0.21463929271257873, 0.3428589142558555, 0.2058517680627354, 0.33668162275646485, -0.4557152699912436, -0.23690875566136393, 0.09206434768894987, 0.16002412028601318, 0.0673266565550406, -0.07053728453249805, -0.39280566793956584, 0.04895645279283335, -0.1904994323849678, -0.007836365409480829, -0.1337855340191914, -0.033821623209082795, -0.05063236668713451, -0.2853153563177799, 0.042809139304388795, -0.02158385822774782, 0.14575845059458045, -0.1310857148698321, -0.06231112223148586, 0.039710275663603696, 0.23851714162681734, 0.026369825396085938, 0.05303493841183222, 0.22882346399203543, -0.24089796931084786, -0.08678827790783779, 0.334941751669131, 0.0030063656928588545, -0.2073149157973427, 0.17881619608059765, -0.04985569644674298, -0.10993319218640306, 0.10771201794306116, 0.24492231805080308, 0.1261992215764739, -0.1748536008094708, -0.06249021156315481, -0.030034650073268436, 0.15373307353095902, 0.06987819941564193, -0.05024594062518689, 0.15768952987902243, 0.24055942953113588, 0.06802785375311354, 0.13610371129376994, -0.1789669330858986, -0.009608740082776715, -0.19908795344939967, -0.17001561570401874, -0.11995921866412484, -0.04968646320987553, -0.07301872890844431, -0.15395621450865762, 0.3996201059330375, 0.19457463415962975, 0.15226076289658405, 0.09174067456831014, 0.42819620037992157, -0.037550146346949344, 0.08886901133941606, 0.020943999420025297, 0.2197418086673884, 0.02964685558676607, 0.13156169210185087, -0.17434786965473434, 0.08175981651631094, 0.08471589118069518] |
1,803.01048 | Magnetic-Visual Sensor Fusion-based Dense 3D Reconstruction and
Localization for Endoscopic Capsule Robots | Reliable and real-time 3D reconstruction and localization functionality is a
crucial prerequisite for the navigation of actively controlled capsule
endoscopic robots as an emerging, minimally invasive diagnostic and therapeutic
technology for use in the gastrointestinal (GI) tract. In this study, we
propose a fully dense, non-rigidly deformable, strictly real-time,
intraoperative map fusion approach for actively controlled endoscopic capsule
robot applications which combines magnetic and vision-based localization, with
non-rigid deformations based frame-to-model map fusion. The performance of the
proposed method is demonstrated using four different ex-vivo porcine stomach
models. Across different trajectories of varying speed and complexity, and four
different endoscopic cameras, the root mean square surface reconstruction
errors 1.58 to 2.17 cm.
| cs.RO | reliable and realtime 3d reconstruction and localization functionality is a crucial prerequisite for the navigation of actively controlled capsule endoscopic robots as an emerging minimally invasive diagnostic and therapeutic technology for use in the gastrointestinal gi tract in this study we propose a fully dense nonrigidly deformable strictly realtime intraoperative map fusion approach for actively controlled endoscopic capsule robot applications which combines magnetic and visionbased localization with nonrigid deformations based frametomodel map fusion the performance of the proposed method is demonstrated using four different exvivo porcine stomach models across different trajectories of varying speed and complexity and four different endoscopic cameras the root mean square surface reconstruction errors 158 to 217 cm | [['reliable', 'and', 'realtime', '3d', 'reconstruction', 'and', 'localization', 'functionality', 'is', 'a', 'crucial', 'prerequisite', 'for', 'the', 'navigation', 'of', 'actively', 'controlled', 'capsule', 'endoscopic', 'robots', 'as', 'an', 'emerging', 'minimally', 'invasive', 'diagnostic', 'and', 'therapeutic', 'technology', 'for', 'use', 'in', 'the', 'gastrointestinal', 'gi', 'tract', 'in', 'this', 'study', 'we', 'propose', 'a', 'fully', 'dense', 'nonrigidly', 'deformable', 'strictly', 'realtime', 'intraoperative', 'map', 'fusion', 'approach', 'for', 'actively', 'controlled', 'endoscopic', 'capsule', 'robot', 'applications', 'which', 'combines', 'magnetic', 'and', 'visionbased', 'localization', 'with', 'nonrigid', 'deformations', 'based', 'frametomodel', 'map', 'fusion', 'the', 'performance', 'of', 'the', 'proposed', 'method', 'is', 'demonstrated', 'using', 'four', 'different', 'exvivo', 'porcine', 'stomach', 'models', 'across', 'different', 'trajectories', 'of', 'varying', 'speed', 'and', 'complexity', 'and', 'four', 'different', 'endoscopic', 'cameras', 'the', 'root', 'mean', 'square', 'surface', 'reconstruction', 'errors', '158', 'to', '217', 'cm']] | [-0.0674014325985419, 0.07117062203295584, -0.04690602207639521, -0.018619906488830957, -0.03406235170301183, -0.1939967138459906, -0.06257326442638649, 0.435006637359038, -0.2377233896175832, -0.3060234481568581, 0.0925111053864904, -0.20359755088325723, -0.23886440256943128, 0.24401111375274404, -0.1912414821396981, 0.14319482299366168, 0.1211030080947759, 0.0065194636772503145, -0.014046434550047187, -0.17094934374160534, 0.22526707533480866, 0.005150884597761822, 0.36922407660832895, 0.04615949403081946, 0.17355986203931803, 0.08225225359949816, -0.029335375808711563, -0.018827323063045957, -0.1003438298835785, 0.17401601978677458, 0.2890671284480634, 0.13021408176739765, 0.2661311055666634, -0.42242737470249786, -0.2170826216461137, 0.07728872592477794, 0.15895934520605287, 0.060270381979145374, -0.08542242321085983, -0.3613133570511958, 0.11494818132320818, -0.19018917978142522, -0.0757817015317934, -0.09125799588426682, -0.014056295173109643, -0.004392604761440972, -0.2974892277462849, 0.052605229371692985, -0.050421407477447895, 0.1733755487948656, -0.12881083295464382, -0.01073955511258516, 0.005793796810654125, 0.2511585283417454, -0.059868685190200006, 0.09430901920547642, 0.2712657188697319, -0.22180584211309906, -0.07586920893351946, 0.36246646331190796, 0.029373727472765104, -0.2088724320055917, 0.24435526826294204, -0.07309627298465264, -0.07571452738401215, 0.16427531478361093, 0.19969822831730458, 0.16495400427707604, -0.16865108752556676, -0.045598913589076674, 0.050021910884814655, 0.15919578887821575, 0.0648630656734375, -0.07269903081136622, 0.1876693189780261, 0.23236227665672363, 0.043111301388957406, 0.11717482943121078, -0.20941802942460136, -0.02804259245749563, -0.2172569956528605, -0.18095379664113612, -0.10485787398231748, -0.04451315950011901, -0.07640143660085284, -0.15532346821523138, 0.3998412110709718, 0.1896987435590875, 0.1508844435042452, 0.053169108439500894, 0.3953162188990973, -0.0317396117534372, 0.07887897668842925, -0.0030327590980700086, 0.19791322823480836, 0.04554226634458506, 0.10686171774536238, -0.22329973441498754, 0.004231694807198697, 0.08960063944271367] |
1,803.01049 | Classical Transitions | We introduce the calculus of Classical Transitions (CT), which extends the
research line on the relationship between linear logic and processes to
labelled transitions. The key twist from previous work is registering
parallelism in typing judgements, by generalising linear logic judgements from
one sequents to many (hypersequents). This allows us to bridge the gap between
the structures of operators used as proof terms in previous work and those of
the standard {\pi}-calculus (in particular parallel operator and restriction).
The proof theory of CT allows for new proof transformations, which we show
correspond to a labelled transition system (LTS) for processes. We prove that
CT enjoys subject reduction and progress.
| cs.LO | we introduce the calculus of classical transitions ct which extends the research line on the relationship between linear logic and processes to labelled transitions the key twist from previous work is registering parallelism in typing judgements by generalising linear logic judgements from one sequents to many hypersequents this allows us to bridge the gap between the structures of operators used as proof terms in previous work and those of the standard picalculus in particular parallel operator and restriction the proof theory of ct allows for new proof transformations which we show correspond to a labelled transition system lts for processes we prove that ct enjoys subject reduction and progress | [['we', 'introduce', 'the', 'calculus', 'of', 'classical', 'transitions', 'ct', 'which', 'extends', 'the', 'research', 'line', 'on', 'the', 'relationship', 'between', 'linear', 'logic', 'and', 'processes', 'to', 'labelled', 'transitions', 'the', 'key', 'twist', 'from', 'previous', 'work', 'is', 'registering', 'parallelism', 'in', 'typing', 'judgements', 'by', 'generalising', 'linear', 'logic', 'judgements', 'from', 'one', 'sequents', 'to', 'many', 'hypersequents', 'this', 'allows', 'us', 'to', 'bridge', 'the', 'gap', 'between', 'the', 'structures', 'of', 'operators', 'used', 'as', 'proof', 'terms', 'in', 'previous', 'work', 'and', 'those', 'of', 'the', 'standard', 'picalculus', 'in', 'particular', 'parallel', 'operator', 'and', 'restriction', 'the', 'proof', 'theory', 'of', 'ct', 'allows', 'for', 'new', 'proof', 'transformations', 'which', 'we', 'show', 'correspond', 'to', 'a', 'labelled', 'transition', 'system', 'lts', 'for', 'processes', 'we', 'prove', 'that', 'ct', 'enjoys', 'subject', 'reduction', 'and', 'progress']] | [-0.04980737740310644, 0.04126619654301759, -0.07466556029308827, 0.05658790583662484, -0.1386945559365521, -0.13512463492999247, 0.08883886379638362, 0.34698118250646176, -0.2899472293691761, -0.3116891815181856, 0.05358061244190081, -0.26448029816741286, -0.14800626586336607, 0.17754832577438803, -0.12602390020959178, 0.05770644839690708, 0.018925249004104267, 0.009400782814044335, -0.09339543163494438, -0.18512162247911915, 0.33490118430927396, -0.01566927597661494, 0.2807360442094676, 0.03597090894851936, 0.08982500031274325, 0.04011337499458924, -0.04393067832933653, 0.0051120595948838995, -0.10667374235645434, 0.179063649724212, 0.29758685887064956, 0.15788560751355638, 0.24561755242971106, -0.43564295984052737, -0.16153322716901472, 0.07392983394674957, 0.1120604182050965, 0.10080746679626611, 0.030986926636932026, -0.30456502382737505, 0.03753698160530094, -0.15436556693081052, -0.061260036476930485, -0.11445056848706456, -0.0015923037736275054, -0.006379744437429199, -0.2421181042883716, 0.027376689418932475, 0.17956467912267518, 0.09601865768317269, -0.03956969807014177, -0.06327835184526245, 0.016206059724502606, 0.10941206066177116, 0.019085168639847307, 0.04246683080825921, 0.09018116642148533, -0.0808615171149749, -0.1957433102737873, 0.3096091795986125, -0.026930294211082364, -0.18198169150321378, 0.22450211973126055, -0.11869876619445485, -0.18366125763026536, 0.09480327600613236, 0.127011113364352, 0.1311497108566515, -0.11962865181096377, 0.1261123014024433, -0.025760386498012672, 0.17389391218269362, 0.09954837044068707, 0.0324908653957718, 0.13753800665737564, 0.14947718965453566, 0.04158936058109148, 0.18087459136539677, -0.005183220167063313, -0.1536936337179547, -0.32893759125006305, -0.21323637127739573, -0.09071016068988984, 0.00859435009898259, -0.050021523378528825, -0.17023915800035272, 0.354314970527562, 0.18460417357049114, 0.1983506263857451, 0.1316383787999015, 0.2634310221530224, 0.11782665802657159, 0.13403907553677302, 0.01626544438276884, 0.1680036739941789, 0.1771764652824901, 0.12917105995392034, -0.1596111932923214, 0.06660600853742125, 0.13398349810276317] |
1,803.0105 | SN 2017ein and the Possible First Identification of a Type Ic Supernova
Progenitor | We have identified a progenitor candidate in archival Hubble Space Telescope
(HST) images for the Type Ic SN 2017ein in NGC 3938, pinpointing the
candidate's location via HST Target-of-Opportunity imaging of the SN itself.
This would be the first identification of a stellar-like object as a progenitor
candidate for any Type Ic supernova to date. We also present observations of SN
2017ein during the first ~49 days since explosion. We find that SN 2017ein most
resembles the well-studied Type Ic SN 2007gr. We infer that SN 2017ein
experienced a total visual extinction of A_V~1.0--1.9 mag, predominantly
because of dust within the host galaxy. Although the distance is not well
known, if this object is the progenitor, it was likely of high initial mass,
~47--48 M_sun if a single star, or ~60--80 M_sun if in a binary system.
However, we also find that the progenitor candidate could be a very blue and
young compact cluster, further implying a very massive (>65 M_sun) progenitor.
Furthermore, the actual progenitor might not be associated with the candidate
at all and could be far less massive. From the immediate stellar environment,
we find possible evidence for three different populations; if the SN progenitor
was a member of the youngest population, this would be consistent with an
initial mass of ~57 M_sun. After it has faded, the SN should be reobserved at
high spatial resolution and sensitivity, to determine whether the candidate is
indeed the progenitor.
| astro-ph.SR astro-ph.HE | we have identified a progenitor candidate in archival hubble space telescope hst images for the type ic sn 2017ein in ngc 3938 pinpointing the candidates location via hst targetofopportunity imaging of the sn itself this would be the first identification of a stellarlike object as a progenitor candidate for any type ic supernova to date we also present observations of sn 2017ein during the first 49 days since explosion we find that sn 2017ein most resembles the wellstudied type ic sn 2007gr we infer that sn 2017ein experienced a total visual extinction of a_v1019 mag predominantly because of dust within the host galaxy although the distance is not well known if this object is the progenitor it was likely of high initial mass 4748 m_sun if a single star or 6080 m_sun if in a binary system however we also find that the progenitor candidate could be a very blue and young compact cluster further implying a very massive 65 m_sun progenitor furthermore the actual progenitor might not be associated with the candidate at all and could be far less massive from the immediate stellar environment we find possible evidence for three different populations if the sn progenitor was a member of the youngest population this would be consistent with an initial mass of 57 m_sun after it has faded the sn should be reobserved at high spatial resolution and sensitivity to determine whether the candidate is indeed the progenitor | [['we', 'have', 'identified', 'a', 'progenitor', 'candidate', 'in', 'archival', 'hubble', 'space', 'telescope', 'hst', 'images', 'for', 'the', 'type', 'ic', 'sn', '2017ein', 'in', 'ngc', '3938', 'pinpointing', 'the', 'candidates', 'location', 'via', 'hst', 'targetofopportunity', 'imaging', 'of', 'the', 'sn', 'itself', 'this', 'would', 'be', 'the', 'first', 'identification', 'of', 'a', 'stellarlike', 'object', 'as', 'a', 'progenitor', 'candidate', 'for', 'any', 'type', 'ic', 'supernova', 'to', 'date', 'we', 'also', 'present', 'observations', 'of', 'sn', '2017ein', 'during', 'the', 'first', '49', 'days', 'since', 'explosion', 'we', 'find', 'that', 'sn', '2017ein', 'most', 'resembles', 'the', 'wellstudied', 'type', 'ic', 'sn', '2007gr', 'we', 'infer', 'that', 'sn', '2017ein', 'experienced', 'a', 'total', 'visual', 'extinction', 'of', 'a_v1019', 'mag', 'predominantly', 'because', 'of', 'dust', 'within', 'the', 'host', 'galaxy', 'although', 'the', 'distance', 'is', 'not', 'well', 'known', 'if', 'this', 'object', 'is', 'the', 'progenitor', 'it', 'was', 'likely', 'of', 'high', 'initial', 'mass', '4748', 'm_sun', 'if', 'a', 'single', 'star', 'or', '6080', 'm_sun', 'if', 'in', 'a', 'binary', 'system', 'however', 'we', 'also', 'find', 'that', 'the', 'progenitor', 'candidate', 'could', 'be', 'a', 'very', 'blue', 'and', 'young', 'compact', 'cluster', 'further', 'implying', 'a', 'very', 'massive', '65', 'm_sun', 'progenitor', 'furthermore', 'the', 'actual', 'progenitor', 'might', 'not', 'be', 'associated', 'with', 'the', 'candidate', 'at', 'all', 'and', 'could', 'be', 'far', 'less', 'massive', 'from', 'the', 'immediate', 'stellar', 'environment', 'we', 'find', 'possible', 'evidence', 'for', 'three', 'different', 'populations', 'if', 'the', 'sn', 'progenitor', 'was', 'a', 'member', 'of', 'the', 'youngest', 'population', 'this', 'would', 'be', 'consistent', 'with', 'an', 'initial', 'mass', 'of', '57', 'm_sun', 'after', 'it', 'has', 'faded', 'the', 'sn', 'should', 'be', 'reobserved', 'at', 'high', 'spatial', 'resolution', 'and', 'sensitivity', 'to', 'determine', 'whether', 'the', 'candidate', 'is', 'indeed', 'the', 'progenitor']] | [-0.03880728298465032, 0.06848968466736277, -0.07187476757208516, 0.1017066992563098, -0.15738646153196942, -0.13571683059263367, 0.07502025594860783, 0.43968608487537714, -0.15332024818315282, -0.3321860699279226, 0.10254848368074278, -0.2633270348098799, -0.06056407367456003, 0.19029074068820284, -0.07692054235844027, -0.10737184947186099, 0.15744835347819794, 0.0018351385516024907, -0.09332059112072544, -0.32810396614979376, 0.27801133544188167, 0.07156506029569454, 0.13320757584669723, -0.05308597603672531, 0.07939663945081563, -0.10760376021698523, -0.01236151582434789, -0.06653505344556111, -0.11888581359508485, -0.01345743574922959, 0.20376916461855332, 0.20660952365592855, 0.2126750465887735, -0.30736256523299416, -0.2274550476567391, 0.1245572655943951, 0.2392625150613674, 0.046822497374709365, -0.08873608925625308, -0.27666881716095115, 0.12618830889486804, -0.22963723017752297, -0.19780812305242415, 0.14887178410039476, 0.07577282078534942, 0.0023494573094722305, -0.22738340085763953, 0.13096756250748537, -0.031561973233411096, 0.025841705931670123, -0.14519055471093117, -0.07815960162001657, -0.08988087156263402, 0.04301192933241993, -0.009634456087768889, 0.0773088061708614, 0.07843106054159263, -0.13499210966521072, 0.02308097114069504, 0.4176345455955137, -0.006008376508647241, 0.027949913128212905, 0.2578050796971286, -0.17163082754831746, -0.20108976283219787, 0.15571624911136955, 0.10003389032006217, 0.1034327367394695, -0.21213066561934713, -0.02991808533924729, -0.04028430255422189, 0.22320238620073976, 0.02746720927442077, 0.09351094746540245, 0.3372268212616257, 0.164146490211922, 0.004549617626778314, 0.06877892360843281, -0.2795275260763005, 0.033826682519578766, -0.22036787692192458, -0.13481965410585464, -0.159122775789549, 0.18238649083723735, -0.1574692257936819, -0.10772877456240403, 0.2950827706445429, 0.09406232778528495, 0.2062999892582392, -0.01346368718674118, 0.23939997881308012, 0.05236860588202682, 0.14463505927847395, 0.10968770969816909, 0.3429618745917556, 0.13808740484703597, 0.07646679977212241, -0.20102833779665122, 0.11630731949652838, -0.0010677345095116597] |
1,803.01051 | Bounding $\chi$ by a fraction of $\Delta$ for graphs without large
cliques | The greedy coloring algorithm shows that a graph of maximum degree at most
$\Delta$ has chromatic number at most $\Delta + 1$, and this is tight for
cliques. Much attention has been devoted to improving this "greedy bound" for
graphs without large cliques. Brooks famously proved that this bound can be
improved by one if $\Delta \geq 3$ and the graph contains no clique of size
$\Delta + 1$. Reed's Conjecture states that the "greedy bound" can be improved
by $k$ if the graph contains no clique of size $\Delta + 1 - 2k$. Johansson
proved that the "greedy bound" can be improved by a factor of
$\Omega(\ln(\Delta)^{-1})$ or
$\Omega\left(\frac{\ln(\ln(\Delta))}{\ln(\Delta)}\right)$ for graphs with no
triangles or no cliques of any fixed size, respectively.
Notably missing is a $\textit{linear}$ improvement on the "greedy bound" for
graphs without large cliques. In this paper, we prove that for sufficiently
large $\Delta$, if $G$ is a graph with maximum degree at most $\Delta$ and no
clique of size $\omega$, then $$\chi(G) \leq
72\Delta\sqrt{\frac{\ln(\omega)}{\ln(\Delta)}}.$$ This implies that for
sufficiently large $\Delta$, if $\omega^{(72c)^2} \leq \Delta$ then $\chi(G)
\leq \Delta/c$.
This bound actually holds for the list-chromatic and even the
correspondence-chromatic number (also known as the DP-chromatic number). In
fact, we prove what we call a "local version" of it, a result implying the
existence of a coloring when the number of available colors for each vertex
depends on local parameters, like the degree and the clique number of its
neighborhood. Our result simultaneously implies the linear improvement over the
"greedy bound" and the two aforementioned results of Johansson.
| math.CO | the greedy coloring algorithm shows that a graph of maximum degree at most delta has chromatic number at most delta 1 and this is tight for cliques much attention has been devoted to improving this greedy bound for graphs without large cliques brooks famously proved that this bound can be improved by one if delta geq 3 and the graph contains no clique of size delta 1 reeds conjecture states that the greedy bound can be improved by k if the graph contains no clique of size delta 1 2k johansson proved that the greedy bound can be improved by a factor of omegalndelta1 or omegaleftfraclnlndeltalndeltaright for graphs with no triangles or no cliques of any fixed size respectively notably missing is a textitlinear improvement on the greedy bound for graphs without large cliques in this paper we prove that for sufficiently large delta if g is a graph with maximum degree at most delta and no clique of size omega then chig leq 72deltasqrtfraclnomegalndelta this implies that for sufficiently large delta if omega72c2 leq delta then chig leq deltac this bound actually holds for the listchromatic and even the correspondencechromatic number also known as the dpchromatic number in fact we prove what we call a local version of it a result implying the existence of a coloring when the number of available colors for each vertex depends on local parameters like the degree and the clique number of its neighborhood our result simultaneously implies the linear improvement over the greedy bound and the two aforementioned results of johansson | [['the', 'greedy', 'coloring', 'algorithm', 'shows', 'that', 'a', 'graph', 'of', 'maximum', 'degree', 'at', 'most', 'delta', 'has', 'chromatic', 'number', 'at', 'most', 'delta', '1', 'and', 'this', 'is', 'tight', 'for', 'cliques', 'much', 'attention', 'has', 'been', 'devoted', 'to', 'improving', 'this', 'greedy', 'bound', 'for', 'graphs', 'without', 'large', 'cliques', 'brooks', 'famously', 'proved', 'that', 'this', 'bound', 'can', 'be', 'improved', 'by', 'one', 'if', 'delta', 'geq', '3', 'and', 'the', 'graph', 'contains', 'no', 'clique', 'of', 'size', 'delta', '1', 'reeds', 'conjecture', 'states', 'that', 'the', 'greedy', 'bound', 'can', 'be', 'improved', 'by', 'k', 'if', 'the', 'graph', 'contains', 'no', 'clique', 'of', 'size', 'delta', '1', '2k', 'johansson', 'proved', 'that', 'the', 'greedy', 'bound', 'can', 'be', 'improved', 'by', 'a', 'factor', 'of', 'omegalndelta1', 'or', 'omegaleftfraclnlndeltalndeltaright', 'for', 'graphs', 'with', 'no', 'triangles', 'or', 'no', 'cliques', 'of', 'any', 'fixed', 'size', 'respectively', 'notably', 'missing', 'is', 'a', 'textitlinear', 'improvement', 'on', 'the', 'greedy', 'bound', 'for', 'graphs', 'without', 'large', 'cliques', 'in', 'this', 'paper', 'we', 'prove', 'that', 'for', 'sufficiently', 'large', 'delta', 'if', 'g', 'is', 'a', 'graph', 'with', 'maximum', 'degree', 'at', 'most', 'delta', 'and', 'no', 'clique', 'of', 'size', 'omega', 'then', 'chig', 'leq', '72deltasqrtfraclnomegalndelta', 'this', 'implies', 'that', 'for', 'sufficiently', 'large', 'delta', 'if', 'omega72c2', 'leq', 'delta', 'then', 'chig', 'leq', 'deltac', 'this', 'bound', 'actually', 'holds', 'for', 'the', 'listchromatic', 'and', 'even', 'the', 'correspondencechromatic', 'number', 'also', 'known', 'as', 'the', 'dpchromatic', 'number', 'in', 'fact', 'we', 'prove', 'what', 'we', 'call', 'a', 'local', 'version', 'of', 'it', 'a', 'result', 'implying', 'the', 'existence', 'of', 'a', 'coloring', 'when', 'the', 'number', 'of', 'available', 'colors', 'for', 'each', 'vertex', 'depends', 'on', 'local', 'parameters', 'like', 'the', 'degree', 'and', 'the', 'clique', 'number', 'of', 'its', 'neighborhood', 'our', 'result', 'simultaneously', 'implies', 'the', 'linear', 'improvement', 'over', 'the', 'greedy', 'bound', 'and', 'the', 'two', 'aforementioned', 'results', 'of', 'johansson']] | [-0.1727242190060829, 0.13606102309532567, -0.04294744089766457, 0.04482487646366037, -0.08916249239402933, -0.1745512408816703, 0.10424918074602643, 0.3336808888725643, -0.24146948186781506, -0.361287644052306, 0.08064140199855938, -0.2940402319645656, -0.12848707400794016, 0.15995707304728415, -0.08545207719897896, -0.0018113919386665857, 0.10073264363390488, 0.10963235084172779, 0.018261117322139413, -0.29353729661555933, 0.26637511957972126, -0.03484278912637676, 0.17068760629145677, 0.12475445295691373, 0.049467097599596506, 0.03124403204644231, 0.043110330336118545, 0.09267785937633498, -0.18357573991808004, 0.06540708815473623, 0.22752566711691127, 0.19141325125137096, 0.2800647760998076, -0.33940455617427123, -0.15333108567013076, 0.2488688223057529, 0.16202455282478967, 0.0623477756716751, 0.0030268705550830547, -0.18035991965998405, 0.19339903551621332, -0.10334425115118887, -0.1293558278102721, 0.008259297142540449, 0.11984186755735281, -0.003163216301922019, -0.3034691458245314, 0.02718992571895997, 0.13468839471800415, 0.02564574886612066, 0.09901970480137878, -0.23264618795438427, -0.016751500771483626, 0.06280848549233885, -0.03325620747820335, 0.1041345512971106, -0.005706330695314201, -0.15253698408184757, -0.1083124853729263, 0.3295915292091961, -0.054503446740032296, -0.15042300886973212, 0.0982865555666563, -0.15165795628018092, -0.21496208614805407, 0.12499574016720995, 0.09134641332793834, 0.15009161648542188, -0.06469028221754271, 0.1345194259215711, -0.14043495507074857, 0.20003227945820495, 0.16034455223404986, 0.04614844627808559, 0.06252586551553269, 0.14817901458921218, 0.2238698155824535, 0.14147438896374454, -0.026761003038442626, 0.03317985543614532, -0.2748436166494205, -0.10973016580146935, -0.2659978069333858, 0.05760665777997356, -0.22216002142946437, -0.13514736698808397, 0.37139503592551926, 0.08828394773680218, 0.18684510408289268, 0.13902762733531868, 0.2420914729573126, 0.08761113283213404, 0.055421099334397886, 0.21264251964130093, 0.19134260071294867, 0.1299206806909601, -0.018305469599944783, -0.1804809960532992, 0.09708446015119845, 0.11640005454322044] |
1,803.01052 | The Binary Dwarf Carbon Star SDSS J125017.90+252427.6 | Although dwarf carbon (dC) stars are thought universally to be binaries to
explain the presence of $C_2$ in their spectra while still near main sequence
luminosity, direct observational evidence for binarity is remarkably scarce.
Here we report the detection of a 2.92 d periodicity in both photometry and
radial velocity of SDSS J125017.90+252427.6, an $r=16.4$ dC star. This is the
first photometric binary dC, and only the second dC spectroscopic binary. The
relative phase of the photometric period to the spectroscopic observations
suggests that the photometric variations are a reflection effect due to heating
from an unseen companion. The observed radial velocity amplitude of the dC
component ($K = 98.8\pm10.7$ km/s) is consistent with a white dwarf companion,
presumably the evolved star that earlier donated the carbon to the dC, although
substantial orbital evolution must have occurred. Large synoptic photometric
surveys such as the Palomar Transient Factory, used for this work, may prove
useful for identifying binaries among the shorter period dC stars.
| astro-ph.SR | although dwarf carbon dc stars are thought universally to be binaries to explain the presence of c_2 in their spectra while still near main sequence luminosity direct observational evidence for binarity is remarkably scarce here we report the detection of a 292 d periodicity in both photometry and radial velocity of sdss j125017902524276 an r164 dc star this is the first photometric binary dc and only the second dc spectroscopic binary the relative phase of the photometric period to the spectroscopic observations suggests that the photometric variations are a reflection effect due to heating from an unseen companion the observed radial velocity amplitude of the dc component k 988pm107 kms is consistent with a white dwarf companion presumably the evolved star that earlier donated the carbon to the dc although substantial orbital evolution must have occurred large synoptic photometric surveys such as the palomar transient factory used for this work may prove useful for identifying binaries among the shorter period dc stars | [['although', 'dwarf', 'carbon', 'dc', 'stars', 'are', 'thought', 'universally', 'to', 'be', 'binaries', 'to', 'explain', 'the', 'presence', 'of', 'c_2', 'in', 'their', 'spectra', 'while', 'still', 'near', 'main', 'sequence', 'luminosity', 'direct', 'observational', 'evidence', 'for', 'binarity', 'is', 'remarkably', 'scarce', 'here', 'we', 'report', 'the', 'detection', 'of', 'a', '292', 'd', 'periodicity', 'in', 'both', 'photometry', 'and', 'radial', 'velocity', 'of', 'sdss', 'j125017902524276', 'an', 'r164', 'dc', 'star', 'this', 'is', 'the', 'first', 'photometric', 'binary', 'dc', 'and', 'only', 'the', 'second', 'dc', 'spectroscopic', 'binary', 'the', 'relative', 'phase', 'of', 'the', 'photometric', 'period', 'to', 'the', 'spectroscopic', 'observations', 'suggests', 'that', 'the', 'photometric', 'variations', 'are', 'a', 'reflection', 'effect', 'due', 'to', 'heating', 'from', 'an', 'unseen', 'companion', 'the', 'observed', 'radial', 'velocity', 'amplitude', 'of', 'the', 'dc', 'component', 'k', '988pm107', 'kms', 'is', 'consistent', 'with', 'a', 'white', 'dwarf', 'companion', 'presumably', 'the', 'evolved', 'star', 'that', 'earlier', 'donated', 'the', 'carbon', 'to', 'the', 'dc', 'although', 'substantial', 'orbital', 'evolution', 'must', 'have', 'occurred', 'large', 'synoptic', 'photometric', 'surveys', 'such', 'as', 'the', 'palomar', 'transient', 'factory', 'used', 'for', 'this', 'work', 'may', 'prove', 'useful', 'for', 'identifying', 'binaries', 'among', 'the', 'shorter', 'period', 'dc', 'stars']] | [-0.13616113972691996, 0.12910596377662173, -0.08015020533740146, 0.04872272421427235, -0.15973403341680145, -0.07454565662668093, 0.09277228662032494, 0.40326482000754876, -0.2008560370454717, -0.32188713357420695, 0.08091950976529962, -0.2858274494438379, -0.059947464272450166, 0.25319116448129836, -0.09499333683202195, -0.007566263921652758, 0.13498003593405838, -0.044931885473351085, -0.0421161318941733, -0.288120813070322, 0.24481775329313563, 0.03963108266390415, 0.15060522950894298, -0.058572397915845585, 0.005177213042336018, -0.07598272284914581, -0.08826887544497859, -0.027021162517942815, -0.12284421942787283, -0.006562834425094251, 0.251984722168425, 0.08916913177788773, 0.20228208858027774, -0.3130014295039593, -0.2150240609767911, 0.06255441595970085, 0.18213617083515515, 0.07888889599901934, -0.06332047325236805, -0.24985892604011456, 0.09848741996072748, -0.1943360163073155, -0.1681675644204864, 0.019078441854542907, 0.11148806807801784, 0.05025176744016309, -0.23735090498387837, 0.136539050798172, 0.07513259361050884, 0.15334489337701654, -0.1685947114660305, -0.12597222854646872, -0.08388598391540208, 0.06982880394683226, 0.03335663984286593, 0.09441063505064391, 0.09799335350182915, -0.11014858913994482, -0.03544988988681971, 0.3637870260072819, -0.09875733292304308, 0.041935332912406975, 0.21097672048593, -0.20384015999851549, -0.17638438800349832, 0.12543378363263868, 0.1517569837951154, 0.12918530837281272, -0.22138128050184902, -0.04544846365029145, 0.012844203192295518, 0.2084542322851155, 0.04719668098450082, 0.07090647290197183, 0.36295393813963767, 0.10132736241907678, 0.04054336696013855, 0.08845802834228196, -0.2732690647830191, 0.007562744398982082, -0.2232184481789481, -0.07460415910976301, -0.15043577273909306, 0.11429419788039939, -0.07085134865278261, -0.14741760986394384, 0.34263384314956813, 0.11114683009335571, 0.1983226707744055, 0.009924765018769686, 0.33726697541779177, 0.10585514019586076, 0.11977618227880478, 0.07118668796131446, 0.333522780663656, 0.19450616119019454, 0.1456244960617649, -0.2984679204343347, 0.11485675134573062, -0.01907767267581427] |
1,803.01053 | The Geometry of Most Probable Trajectories in Noise-Driven Dynamical
Systems | This paper presents a heuristic derivation of a geometric minimum action
method that can be used to determine most-probable transition paths in
noise-driven dynamical systems. Particular attention is focused on systems that
violate detailed balance, and the role of the stochastic vorticity tensor is
emphasized. The general method is explored through a detailed study of a
two-dimensional quadratic shear flow which exhibits bifurcating most-probable
transition pathways.
| cond-mat.stat-mech | this paper presents a heuristic derivation of a geometric minimum action method that can be used to determine mostprobable transition paths in noisedriven dynamical systems particular attention is focused on systems that violate detailed balance and the role of the stochastic vorticity tensor is emphasized the general method is explored through a detailed study of a twodimensional quadratic shear flow which exhibits bifurcating mostprobable transition pathways | [['this', 'paper', 'presents', 'a', 'heuristic', 'derivation', 'of', 'a', 'geometric', 'minimum', 'action', 'method', 'that', 'can', 'be', 'used', 'to', 'determine', 'mostprobable', 'transition', 'paths', 'in', 'noisedriven', 'dynamical', 'systems', 'particular', 'attention', 'is', 'focused', 'on', 'systems', 'that', 'violate', 'detailed', 'balance', 'and', 'the', 'role', 'of', 'the', 'stochastic', 'vorticity', 'tensor', 'is', 'emphasized', 'the', 'general', 'method', 'is', 'explored', 'through', 'a', 'detailed', 'study', 'of', 'a', 'twodimensional', 'quadratic', 'shear', 'flow', 'which', 'exhibits', 'bifurcating', 'mostprobable', 'transition', 'pathways']] | [-0.17171998793315707, 0.10740482438863679, -0.1351160349493677, 0.059573738923945435, -0.1149646354500543, -0.13891640753718093, 0.023775786831692763, 0.32419002620206977, -0.25623324760376953, -0.23159373379453566, 0.05973137430246976, -0.2294320459265939, -0.24469993523124492, 0.17477701328497267, -0.029517574320462616, 0.057051576427042935, 0.08059535853769348, 0.017705393715225386, -0.07319951224648817, -0.1448114565996961, 0.3167526194823343, 0.05753847027451477, 0.3093458278048219, 0.04332677259596742, 0.1258763728776213, -0.027032326483591038, -0.03035389561255491, 0.057882711037316105, -0.203573268761719, 0.10029810951726342, 0.1968413626168375, 0.08655881952974155, 0.27698205484811106, -0.41058241470124235, -0.27650727952520054, 0.107783221717303, 0.14994071129044503, 0.1437664031365068, -0.05516283569158986, -0.20536273139331376, 0.07733831928062225, -0.15196242914393995, -0.09723420428450812, -0.10553779633659305, 0.012131785169582476, 0.015642036581553068, -0.2781717689199881, 0.11725467427238596, 0.11297077379872049, 0.10284809950231151, -0.0287192899691449, -0.04722556821599772, -0.050739742166390926, 0.10343252615227054, 0.03792347439042659, 0.0269145501290702, 0.14689897924351195, -0.08210059741130946, -0.10212258496462848, 0.40866235081303975, -0.031039970861677306, -0.19547703673632702, 0.17574701053231503, -0.08599951675966043, -0.16709265242697616, 0.15414653626750363, 0.23731112195122422, 0.15871218591928482, -0.19646608939563687, 0.04988096436312789, -0.023335061798041516, 0.1382451461042475, 0.023266666784007666, -0.018730607281516615, 0.21733440904680526, 0.19975338104025772, 0.08734290614357275, 0.1835257521191979, -0.02252577634344837, -0.16783604090045573, -0.29515704252249136, -0.14254449070149072, -0.16145590867734316, 0.05193829421962922, -0.046192047588137386, -0.17518577829116222, 0.4080301259333889, 0.12639733569724768, 0.1803943331866652, 0.028586507695515385, 0.2691891669352172, 0.16947143800754214, 0.005232289377035517, 0.04540335983179058, 0.2622918082739819, 0.15934998189296687, 0.11413588381908608, -0.24928098424535358, 0.08184362456174285, 0.12410987302604498] |
1,803.01054 | Long lifetime of thermally-excited magnons in bulk yttrium iron garnet | Spin currents are generated within the bulk of magnetic materials due to heat
flow, an effect called intrinsic spin-Seebeck. This bulk bosonic spin current
consists of a diffusing thermal magnon cloud, parametrized by the magnon
chemical potential ($\mu_{m}$), with a diffusion length of several microns in
yttrium iron garnet (YIG). Transient opto-thermal measurements of the
spin-Seebeck effect (SSE) as a function of temperature reveal the time
evolution of $\mu_{m}$ due to intrinsic SSE in YIG. The interface SSE develops
at times < 2 ns while the intrinsic SSE signal continues to evolve at times >
500 $\mu$s, dominating the temperature dependence of SSE in bulk YIG.
Time-dependent SSE data are fit to a multi-temperature model of coupled
spin/heat transport using finite element method (FEM), where the magnon spin
lifetime ($\tau$) and magnon-phonon thermalization time ($\tau_{mp}$) are used
as fit parameters. From 300 K to 4 K, $\tau_{mp}$ varies from 1 to 10 ns,
whereas $\tau$ varies from 2 to 60 $\mu$s with the spin lifetime peaking at 90
K. At low temperature, a reduction in $\tau$ is observed consistent with
impurity relaxation reported in ferromagnetic resonance measurements. These
results demonstrate that the thermal magnon cloud in YIG contains extremely low
frequency magnons (~10 GHz) providing spectral insight to the microscopic
scattering processes involved in magnon spin/heat diffusion.
| cond-mat.mtrl-sci cond-mat.mes-hall | spin currents are generated within the bulk of magnetic materials due to heat flow an effect called intrinsic spinseebeck this bulk bosonic spin current consists of a diffusing thermal magnon cloud parametrized by the magnon chemical potential mu_m with a diffusion length of several microns in yttrium iron garnet yig transient optothermal measurements of the spinseebeck effect sse as a function of temperature reveal the time evolution of mu_m due to intrinsic sse in yig the interface sse develops at times 2 ns while the intrinsic sse signal continues to evolve at times 500 mus dominating the temperature dependence of sse in bulk yig timedependent sse data are fit to a multitemperature model of coupled spinheat transport using finite element method fem where the magnon spin lifetime tau and magnonphonon thermalization time tau_mp are used as fit parameters from 300 k to 4 k tau_mp varies from 1 to 10 ns whereas tau varies from 2 to 60 mus with the spin lifetime peaking at 90 k at low temperature a reduction in tau is observed consistent with impurity relaxation reported in ferromagnetic resonance measurements these results demonstrate that the thermal magnon cloud in yig contains extremely low frequency magnons 10 ghz providing spectral insight to the microscopic scattering processes involved in magnon spinheat diffusion | [['spin', 'currents', 'are', 'generated', 'within', 'the', 'bulk', 'of', 'magnetic', 'materials', 'due', 'to', 'heat', 'flow', 'an', 'effect', 'called', 'intrinsic', 'spinseebeck', 'this', 'bulk', 'bosonic', 'spin', 'current', 'consists', 'of', 'a', 'diffusing', 'thermal', 'magnon', 'cloud', 'parametrized', 'by', 'the', 'magnon', 'chemical', 'potential', 'mu_m', 'with', 'a', 'diffusion', 'length', 'of', 'several', 'microns', 'in', 'yttrium', 'iron', 'garnet', 'yig', 'transient', 'optothermal', 'measurements', 'of', 'the', 'spinseebeck', 'effect', 'sse', 'as', 'a', 'function', 'of', 'temperature', 'reveal', 'the', 'time', 'evolution', 'of', 'mu_m', 'due', 'to', 'intrinsic', 'sse', 'in', 'yig', 'the', 'interface', 'sse', 'develops', 'at', 'times', '2', 'ns', 'while', 'the', 'intrinsic', 'sse', 'signal', 'continues', 'to', 'evolve', 'at', 'times', '500', 'mus', 'dominating', 'the', 'temperature', 'dependence', 'of', 'sse', 'in', 'bulk', 'yig', 'timedependent', 'sse', 'data', 'are', 'fit', 'to', 'a', 'multitemperature', 'model', 'of', 'coupled', 'spinheat', 'transport', 'using', 'finite', 'element', 'method', 'fem', 'where', 'the', 'magnon', 'spin', 'lifetime', 'tau', 'and', 'magnonphonon', 'thermalization', 'time', 'tau_mp', 'are', 'used', 'as', 'fit', 'parameters', 'from', '300', 'k', 'to', '4', 'k', 'tau_mp', 'varies', 'from', '1', 'to', '10', 'ns', 'whereas', 'tau', 'varies', 'from', '2', 'to', '60', 'mus', 'with', 'the', 'spin', 'lifetime', 'peaking', 'at', '90', 'k', 'at', 'low', 'temperature', 'a', 'reduction', 'in', 'tau', 'is', 'observed', 'consistent', 'with', 'impurity', 'relaxation', 'reported', 'in', 'ferromagnetic', 'resonance', 'measurements', 'these', 'results', 'demonstrate', 'that', 'the', 'thermal', 'magnon', 'cloud', 'in', 'yig', 'contains', 'extremely', 'low', 'frequency', 'magnons', '10', 'ghz', 'providing', 'spectral', 'insight', 'to', 'the', 'microscopic', 'scattering', 'processes', 'involved', 'in', 'magnon', 'spinheat', 'diffusion']] | [-0.1299661531336081, 0.2427613267322107, -0.002487729623817572, -0.01025595996712505, -0.059517442830291714, -0.1175830320918609, 0.045492912919212466, 0.38537393956764343, -0.29012324517601534, -0.3248459195003281, 0.028220652993396798, -0.3501996036636438, 0.0316456694280545, 0.21162309078281055, 0.09522743679106481, 0.005929320161952309, -0.03520574905371792, -0.02051847335934954, -0.07317402371327816, -0.15805786318252132, 0.19006225463230286, 0.020599246713739465, 0.2887362451440143, 0.08228075903175758, 0.06918673849792521, -0.044146458122074746, 0.04576407518334022, -0.017160984288525062, -0.14025222398948056, 0.0036033270749407753, 0.2542157889520881, -0.0979187008028439, 0.15475351106541607, -0.4494939848185985, -0.20651913246690806, 0.008451236091650358, 0.1565761431153129, 0.11249002647376291, -0.026106571344693713, -0.2100889362010038, 0.06852452576427148, -0.15686887891814463, -0.11475400342179698, -0.005478280213849505, 0.05062237069663316, -0.058174873032020145, -0.2564633811502652, 0.16634826783523698, 0.08160767871274355, 0.08754561834492035, -0.07351663502527864, -0.1835876008683702, -0.0617709758630276, 0.028382941055168427, 0.07156452898023827, 0.0632259080753806, 0.20498525658884728, -0.059755960466124844, -0.1213927523368541, 0.3201801790068792, -0.1687982032587096, -0.06815446172556687, 0.16071768420061944, -0.2105136536861914, -0.02176888726494262, 0.21020821127778208, 0.15339002977759345, 0.08640118306852493, -0.16954873801709672, 0.07126763303755419, 0.03209601190081085, 0.2190888288940255, 0.0427531071451051, 0.06339398875369083, 0.2577820070144751, 0.22111489078108693, 0.010365739998193414, 0.13239390975708237, -0.17271168914321863, -0.027074730329810174, -0.20327762708159713, -0.13345916265350694, -0.22205265131975774, 0.14634274111343593, -0.11817694762102689, -0.14938775164035845, 0.40026572736487354, 0.1709637733847515, 0.18977935756491104, -0.001018425146939819, 0.27736766096816656, 0.14184455775345364, 0.09036297935712645, 0.0714660072568017, 0.20998097922075804, 0.20373778603916348, 0.16868846953251868, -0.35793573102703924, 0.05460794524130075, -0.035181502713231554] |
1,803.01055 | On k-11-representable graphs | Distinct letters $x$ and $y$ alternate in a word $w$ if after deleting in $w$
all letters but the copies of $x$ and $y$ we either obtain a word of the form
$xyxy\cdots$ (of even or odd length) or a word of the form $yxyx\cdots$ (of
even or odd length). A simple graph $G=(V,E)$ is word-representable if there
exists a word $w$ over the alphabet $V$ such that letters $x$ and $y$ alternate
in $w$ if and only if $xy$ is an edge in $E$. Thus, edges of $G$ are defined by
avoiding the consecutive pattern 11 in a word representing $G$, that is, by
avoiding $xx$ and $yy$.
In 2017, Jeff Remmel has introduced the notion of a $k$-$11$-representable
graph for a non-negative integer $k$, which generalizes the notion of a
word-representable graph. Under this representation, edges of $G$ are defined
by containing at most $k$ occurrences of the consecutive pattern $11$ in a word
representing $G$. Thus, word-representable graphs are precisely
$0$-$11$-representable graphs. Our key result in this paper is showing that any
graph is $2$-$11$-representable by a concatenation of permutations, which is
rather surprising taking into account that concatenation of permutations has
limited power in the case of $0$-$11$-representation. Also, we show that the
class of word-representable graphs, studied intensively in the literature, is
contained strictly in the class of $1$-$11$-representable graphs. Another
result that we prove is the fact that the class of interval graphs is precisely
the class of $1$-$11$-representable graphs that can be represented by uniform
words containing two copies of each letter. This result can be compared with
the known fact that the class of circle graphs is precisely the class of
$0$-$11$-representable graphs that can be represented by uniform words
containing two copies of each letter.
| math.CO | distinct letters x and y alternate in a word w if after deleting in w all letters but the copies of x and y we either obtain a word of the form xyxycdots of even or odd length or a word of the form yxyxcdots of even or odd length a simple graph gve is wordrepresentable if there exists a word w over the alphabet v such that letters x and y alternate in w if and only if xy is an edge in e thus edges of g are defined by avoiding the consecutive pattern 11 in a word representing g that is by avoiding xx and yy in 2017 jeff remmel has introduced the notion of a k11representable graph for a nonnegative integer k which generalizes the notion of a wordrepresentable graph under this representation edges of g are defined by containing at most k occurrences of the consecutive pattern 11 in a word representing g thus wordrepresentable graphs are precisely 011representable graphs our key result in this paper is showing that any graph is 211representable by a concatenation of permutations which is rather surprising taking into account that concatenation of permutations has limited power in the case of 011representation also we show that the class of wordrepresentable graphs studied intensively in the literature is contained strictly in the class of 111representable graphs another result that we prove is the fact that the class of interval graphs is precisely the class of 111representable graphs that can be represented by uniform words containing two copies of each letter this result can be compared with the known fact that the class of circle graphs is precisely the class of 011representable graphs that can be represented by uniform words containing two copies of each letter | [['distinct', 'letters', 'x', 'and', 'y', 'alternate', 'in', 'a', 'word', 'w', 'if', 'after', 'deleting', 'in', 'w', 'all', 'letters', 'but', 'the', 'copies', 'of', 'x', 'and', 'y', 'we', 'either', 'obtain', 'a', 'word', 'of', 'the', 'form', 'xyxycdots', 'of', 'even', 'or', 'odd', 'length', 'or', 'a', 'word', 'of', 'the', 'form', 'yxyxcdots', 'of', 'even', 'or', 'odd', 'length', 'a', 'simple', 'graph', 'gve', 'is', 'wordrepresentable', 'if', 'there', 'exists', 'a', 'word', 'w', 'over', 'the', 'alphabet', 'v', 'such', 'that', 'letters', 'x', 'and', 'y', 'alternate', 'in', 'w', 'if', 'and', 'only', 'if', 'xy', 'is', 'an', 'edge', 'in', 'e', 'thus', 'edges', 'of', 'g', 'are', 'defined', 'by', 'avoiding', 'the', 'consecutive', 'pattern', '11', 'in', 'a', 'word', 'representing', 'g', 'that', 'is', 'by', 'avoiding', 'xx', 'and', 'yy', 'in', '2017', 'jeff', 'remmel', 'has', 'introduced', 'the', 'notion', 'of', 'a', 'k11representable', 'graph', 'for', 'a', 'nonnegative', 'integer', 'k', 'which', 'generalizes', 'the', 'notion', 'of', 'a', 'wordrepresentable', 'graph', 'under', 'this', 'representation', 'edges', 'of', 'g', 'are', 'defined', 'by', 'containing', 'at', 'most', 'k', 'occurrences', 'of', 'the', 'consecutive', 'pattern', '11', 'in', 'a', 'word', 'representing', 'g', 'thus', 'wordrepresentable', 'graphs', 'are', 'precisely', '011representable', 'graphs', 'our', 'key', 'result', 'in', 'this', 'paper', 'is', 'showing', 'that', 'any', 'graph', 'is', '211representable', 'by', 'a', 'concatenation', 'of', 'permutations', 'which', 'is', 'rather', 'surprising', 'taking', 'into', 'account', 'that', 'concatenation', 'of', 'permutations', 'has', 'limited', 'power', 'in', 'the', 'case', 'of', '011representation', 'also', 'we', 'show', 'that', 'the', 'class', 'of', 'wordrepresentable', 'graphs', 'studied', 'intensively', 'in', 'the', 'literature', 'is', 'contained', 'strictly', 'in', 'the', 'class', 'of', '111representable', 'graphs', 'another', 'result', 'that', 'we', 'prove', 'is', 'the', 'fact', 'that', 'the', 'class', 'of', 'interval', 'graphs', 'is', 'precisely', 'the', 'class', 'of', '111representable', 'graphs', 'that', 'can', 'be', 'represented', 'by', 'uniform', 'words', 'containing', 'two', 'copies', 'of', 'each', 'letter', 'this', 'result', 'can', 'be', 'compared', 'with', 'the', 'known', 'fact', 'that', 'the', 'class', 'of', 'circle', 'graphs', 'is', 'precisely', 'the', 'class', 'of', '011representable', 'graphs', 'that', 'can', 'be', 'represented', 'by', 'uniform', 'words', 'containing', 'two', 'copies', 'of', 'each', 'letter']] | [-0.17352661832060523, 0.18071249480249127, -0.02772697408193599, 0.009041644780059387, -0.07033688963864661, -0.14747975558814844, 0.06007233232572896, 0.3994902518646019, -0.305331330263309, -0.28001630043883513, 0.054460739433961736, -0.30439220771245423, -0.13835769717744634, 0.1390359373337294, -0.10766317010922065, -0.029218329844804877, 0.108934302713709, 0.13580411925055216, -0.026241979229130914, -0.27922286368859445, 0.32254266636429896, -0.07673173623633302, 0.17027021854148872, 0.0031924729828904496, 0.09963826581475549, 0.02865525414008738, -0.022268674346108887, 0.08004251131479619, -0.11387325222941662, 0.08226136205221432, 0.2777863482357318, 0.1357370551119036, 0.25260913867879825, -0.3472224123749999, -0.1850096960925215, 0.19830662477720945, 0.11986024250545724, 0.044736922813501556, 0.0011254265386844865, -0.2327277979477656, 0.16623756485276361, -0.14358949536889246, -0.02715892797881147, 0.033026375936000295, 0.14799143712260218, 0.011073645043676842, -0.27591796155949205, 0.01067133036509841, 0.18698540000238484, 0.04673426527366081, 0.06554057448615648, -0.14191994309678466, -0.04603062457898275, 0.09436801303330589, -0.0052731059287197705, 0.1103585212157215, 0.01058554832129139, -0.09021101106779215, -0.16654857998966963, 0.3848313405778817, -0.05835488321136307, -0.20406802435395818, 0.1177630888797888, -0.1526963467797336, -0.1692582637392867, 0.10881206221823363, 0.07768590943640397, 0.12274044066446894, -0.10918024792384604, 0.1615539020227953, -0.16905577889899562, 0.15588565118033243, 0.1637872639663829, 0.0233361886916455, 0.16297104393978984, 0.12416885903945601, 0.0768696360602587, 0.15452094821266782, -0.002125516309133546, 0.016568861290072626, -0.29578597021357317, -0.15062460452577794, -0.23620346904763115, 0.07856535875053512, -0.11349343798561987, -0.18434071679070643, 0.4153947103979514, 0.0752124846921033, 0.21863255676738788, 0.06546935753309482, 0.1946189960043793, 0.07216159520769745, 0.05229274333756456, 0.1282496132935764, 0.08011966609503127, 0.12401902122595039, -0.038466316390253656, -0.10650172459208228, 0.09753845921613744, 0.13939386537097367] |
1,803.01056 | Predicting the spectrum of TCR repertoire sharing with a data-driven
model of recombination | Despite the extreme diversity of T cell repertoires, many identical T-cell
receptor (TCR) sequences are found in a large number of individual mice and
humans. These widely-shared sequences, often referred to as `public', have been
suggested to be over-represented due to their potential immune functionality or
their ease of generation by V(D)J recombination. Here we show that even for
large cohorts the observed degree of sharing of TCR sequences between
individuals is well predicted by a model accounting for by the known
quantitative statistical biases in the generation process, together with a
simple model of thymic selection. Whether a sequence is shared by many
individuals is predicted to depend on the number of queried individuals and the
sampling depth, as well as on the sequence itself, in agreement with the data.
We introduce the degree of publicness conditional on the queried cohort size
and the size of the sampled repertoires. Based on these observations we propose
a public/private sequence classifier, `PUBLIC' (Public Universal Binary
Likelihood Inference Classifier), based on the generation probability, which
performs very well even for small cohort sizes.
| q-bio.GN | despite the extreme diversity of t cell repertoires many identical tcell receptor tcr sequences are found in a large number of individual mice and humans these widelyshared sequences often referred to as public have been suggested to be overrepresented due to their potential immune functionality or their ease of generation by vdj recombination here we show that even for large cohorts the observed degree of sharing of tcr sequences between individuals is well predicted by a model accounting for by the known quantitative statistical biases in the generation process together with a simple model of thymic selection whether a sequence is shared by many individuals is predicted to depend on the number of queried individuals and the sampling depth as well as on the sequence itself in agreement with the data we introduce the degree of publicness conditional on the queried cohort size and the size of the sampled repertoires based on these observations we propose a publicprivate sequence classifier public public universal binary likelihood inference classifier based on the generation probability which performs very well even for small cohort sizes | [['despite', 'the', 'extreme', 'diversity', 'of', 't', 'cell', 'repertoires', 'many', 'identical', 'tcell', 'receptor', 'tcr', 'sequences', 'are', 'found', 'in', 'a', 'large', 'number', 'of', 'individual', 'mice', 'and', 'humans', 'these', 'widelyshared', 'sequences', 'often', 'referred', 'to', 'as', 'public', 'have', 'been', 'suggested', 'to', 'be', 'overrepresented', 'due', 'to', 'their', 'potential', 'immune', 'functionality', 'or', 'their', 'ease', 'of', 'generation', 'by', 'vdj', 'recombination', 'here', 'we', 'show', 'that', 'even', 'for', 'large', 'cohorts', 'the', 'observed', 'degree', 'of', 'sharing', 'of', 'tcr', 'sequences', 'between', 'individuals', 'is', 'well', 'predicted', 'by', 'a', 'model', 'accounting', 'for', 'by', 'the', 'known', 'quantitative', 'statistical', 'biases', 'in', 'the', 'generation', 'process', 'together', 'with', 'a', 'simple', 'model', 'of', 'thymic', 'selection', 'whether', 'a', 'sequence', 'is', 'shared', 'by', 'many', 'individuals', 'is', 'predicted', 'to', 'depend', 'on', 'the', 'number', 'of', 'queried', 'individuals', 'and', 'the', 'sampling', 'depth', 'as', 'well', 'as', 'on', 'the', 'sequence', 'itself', 'in', 'agreement', 'with', 'the', 'data', 'we', 'introduce', 'the', 'degree', 'of', 'publicness', 'conditional', 'on', 'the', 'queried', 'cohort', 'size', 'and', 'the', 'size', 'of', 'the', 'sampled', 'repertoires', 'based', 'on', 'these', 'observations', 'we', 'propose', 'a', 'publicprivate', 'sequence', 'classifier', 'public', 'public', 'universal', 'binary', 'likelihood', 'inference', 'classifier', 'based', 'on', 'the', 'generation', 'probability', 'which', 'performs', 'very', 'well', 'even', 'for', 'small', 'cohort', 'sizes']] | [-0.077718456574929, 0.12696681554037714, -0.02650083802827743, 0.0982086541682506, -0.044690448138797814, -0.14833742977957654, 0.10844743769385334, 0.4019890610524063, -0.25577738486729856, -0.3470134830633022, 0.08793063793271551, -0.2600540311476372, -0.16764242370227903, 0.1899682209511904, -0.12792983333262817, 0.036209044235956195, 0.09438286295977509, 0.06923484915149444, 0.07595893089248482, -0.2947575172849062, 0.28254925554056326, 0.07168594338832288, 0.3031005017672712, -0.028480665240561663, 0.09884824082934995, 0.01062665066770252, -0.06428709490661765, 0.029545275214799372, -0.07765173270938919, 0.1325759020524734, 0.26371745752462045, 0.18989594548279887, 0.3258843657212051, -0.3719270490266008, -0.18308744904215776, 0.12020808819475891, 0.1394503881225451, 0.13686583597049137, -0.04673899102932644, -0.271702030767926, 0.08157922223850293, -0.15156593876884333, -0.05814949663839818, -0.07587149365955974, 6.718867765375355e-05, 0.09400504514413714, -0.28471330169317777, 0.08287451665994175, 0.009624011367793565, 0.12006230666380188, -0.014664575919332035, -0.14942745146388448, -0.052435013219745384, 0.20192962571557133, 0.05395542161897548, 0.01983713417693806, 0.13630735757207893, -0.1425184906439533, -0.12118049904797747, 0.33750514508688084, -0.029104927312790848, -0.16493368508325443, 0.22686763282074443, -0.131616084087203, -0.13165424045112878, 0.09791563901342659, 0.18380559376680278, 0.1049042478432702, -0.1621989430859685, -0.0027103876944126657, -0.02532443241866607, 0.20388839297079842, 0.06431104253987943, 0.028703061176628828, 0.20738294336479157, 0.2126708113114927, -0.006703146242968447, 0.10794955476606005, -0.11423910007676807, -0.06952108814531947, -0.20325063106827645, -0.10423930558764932, -0.21764261312990882, 0.03992349733845669, -0.10676278625935245, -0.19974682683530967, 0.37081309166013693, 0.14701090559529859, 0.23041592446525253, 0.12793896785825387, 0.253349666793274, 0.028243122890971434, 0.1303828366838302, 0.017444117750462625, 0.14078158315846062, 0.04747904021703955, 0.05182598622817567, -0.23303873837449426, 0.19528176670103184, 0.005382818763024647] |
1,803.01057 | Canonical sphere bundles of the Grassmann manifold | For a given Hilbert space $\mathcal H$, consider the space of self-adjoint
projections $\mathcal P(\mathcal H)$. In this paper we study the differentiable
structure of a canonical sphere bundle over $\mathcal P(\mathcal H)$ given by
$$ \mathcal R=\{\, (P,f)\in \mathcal P(\mathcal H)\times \mathcal H \, : \,
Pf=f , \, \|f\|=1\, \}. $$ We establish the smooth action on $\mathcal R$ of
the group of unitary operators of $\mathcal H$, therefore $\mathcal R$ is an
homogeneous space. Then we study the metric structure of $\mathcal R$ by
endowing it first with the uniform quotient metric, which is a Finsler metric,
and we establish minimality results for the geodesics. These are given by
certain one-parameter groups of unitary operators, pushed into $\mathcal R$ by
the natural action of the unitary group. Then we study the restricted bundle
$\mathcal R_2^+$ given by considering only the projections in the restricted
Grassmannian, locally modelled by Hilbert-Schmidt operators. Therefore we endow
$\mathcal R_2^+$ with a natural Riemannian metric that can be obtained by
declaring that the action of the group is a Riemannian submersion. We study the
Levi-Civita connection of this metric and establish a Hopf-Rinow theorem for
$\mathcal R_2^+$, again obtaining a characterization of the geodesics as the
image of certain one-parameter groups with special speeds.
| math.DG math.FA math.MG | for a given hilbert space mathcal h consider the space of selfadjoint projections mathcal pmathcal h in this paper we study the differentiable structure of a canonical sphere bundle over mathcal pmathcal h given by mathcal r pfin mathcal pmathcal htimes mathcal h pff f1 we establish the smooth action on mathcal r of the group of unitary operators of mathcal h therefore mathcal r is an homogeneous space then we study the metric structure of mathcal r by endowing it first with the uniform quotient metric which is a finsler metric and we establish minimality results for the geodesics these are given by certain oneparameter groups of unitary operators pushed into mathcal r by the natural action of the unitary group then we study the restricted bundle mathcal r_2 given by considering only the projections in the restricted grassmannian locally modelled by hilbertschmidt operators therefore we endow mathcal r_2 with a natural riemannian metric that can be obtained by declaring that the action of the group is a riemannian submersion we study the levicivita connection of this metric and establish a hopfrinow theorem for mathcal r_2 again obtaining a characterization of the geodesics as the image of certain oneparameter groups with special speeds | [['for', 'a', 'given', 'hilbert', 'space', 'mathcal', 'h', 'consider', 'the', 'space', 'of', 'selfadjoint', 'projections', 'mathcal', 'pmathcal', 'h', 'in', 'this', 'paper', 'we', 'study', 'the', 'differentiable', 'structure', 'of', 'a', 'canonical', 'sphere', 'bundle', 'over', 'mathcal', 'pmathcal', 'h', 'given', 'by', 'mathcal', 'r', 'pfin', 'mathcal', 'pmathcal', 'htimes', 'mathcal', 'h', 'pff', 'f1', 'we', 'establish', 'the', 'smooth', 'action', 'on', 'mathcal', 'r', 'of', 'the', 'group', 'of', 'unitary', 'operators', 'of', 'mathcal', 'h', 'therefore', 'mathcal', 'r', 'is', 'an', 'homogeneous', 'space', 'then', 'we', 'study', 'the', 'metric', 'structure', 'of', 'mathcal', 'r', 'by', 'endowing', 'it', 'first', 'with', 'the', 'uniform', 'quotient', 'metric', 'which', 'is', 'a', 'finsler', 'metric', 'and', 'we', 'establish', 'minimality', 'results', 'for', 'the', 'geodesics', 'these', 'are', 'given', 'by', 'certain', 'oneparameter', 'groups', 'of', 'unitary', 'operators', 'pushed', 'into', 'mathcal', 'r', 'by', 'the', 'natural', 'action', 'of', 'the', 'unitary', 'group', 'then', 'we', 'study', 'the', 'restricted', 'bundle', 'mathcal', 'r_2', 'given', 'by', 'considering', 'only', 'the', 'projections', 'in', 'the', 'restricted', 'grassmannian', 'locally', 'modelled', 'by', 'hilbertschmidt', 'operators', 'therefore', 'we', 'endow', 'mathcal', 'r_2', 'with', 'a', 'natural', 'riemannian', 'metric', 'that', 'can', 'be', 'obtained', 'by', 'declaring', 'that', 'the', 'action', 'of', 'the', 'group', 'is', 'a', 'riemannian', 'submersion', 'we', 'study', 'the', 'levicivita', 'connection', 'of', 'this', 'metric', 'and', 'establish', 'a', 'hopfrinow', 'theorem', 'for', 'mathcal', 'r_2', 'again', 'obtaining', 'a', 'characterization', 'of', 'the', 'geodesics', 'as', 'the', 'image', 'of', 'certain', 'oneparameter', 'groups', 'with', 'special', 'speeds']] | [-0.19541766457351412, 0.10555187993508872, -0.04060668258794716, 0.01736571319834811, -0.07316733796144904, -0.15120617233978337, -0.021955649594987373, 0.37610717053557263, -0.3174979311271841, -0.14137489456950636, 0.0821409306220545, -0.25362818504355644, -0.12398946623483058, 0.13676631326782587, -0.1397685289015624, 0.0040472151684056365, 0.07005948119273804, 0.1440817187654928, -0.153430600707956, -0.2238690554774527, 0.43402202175058463, 0.005248630930912759, 0.18587783624973203, 0.004940385326246067, 0.11696272636671995, -0.0007750304379119661, -0.013792382177020529, 0.010806476368868192, -0.20955620410892564, 0.12559965122124098, 0.2441579723871758, 0.14429473421270295, 0.22973702056562811, -0.34644518234294475, -0.15096578936280655, 0.23486299542113773, 0.10848737169937987, -0.11096226019621941, 0.030120163672090982, -0.3456994486798353, 0.10171617075949713, -0.14353407718461428, -0.11020947462108371, -0.0947220937734277, 0.12046674554599816, -0.04506597734914331, -0.2867073622776489, -0.020623481881763474, 0.1191546120153272, 0.08508952320301033, -0.06329592560266553, -0.04772184112480855, -0.1174516523683563, 0.046031071646184904, -0.020984156365194382, 0.11966939479126389, 0.09783917352593885, -0.014301786696987933, -0.04694431619902183, 0.3919145774848649, -0.11876459065520806, -0.25345474086114633, 0.05835633134019786, -0.20260554965782746, -0.1434912653272889, 0.05134799186280226, 0.11434485824228714, 0.22156235338028135, -0.06167159676425654, 0.27413602114088487, -0.14951694268146026, 0.031113817613443423, 0.05981242043090058, 0.018893334762252904, 0.09704252983629245, 0.0892419858693416, 0.10588694477380423, 0.13495690707866276, 0.030992041900524583, -0.011326546230229545, -0.40252581110288355, -0.20159775621069623, -0.12116084059613201, 0.15683382780066338, -0.16543590847208978, -0.15574782523624783, 0.37070309184721023, 0.018034681055025, 0.2511844430164677, 0.12570733188713437, 0.1743354934263112, 0.08331027624181248, 0.04869987079047878, 0.10727172869308095, 0.1403942191560427, 0.19634951353692473, -0.07177496167516859, -0.15132416669265575, -0.06967319930522826, 0.22471297067117516] |
1,803.01058 | Riccati parametric deformations of the Cornu spiral | A parametric deformation of the Cornu spiral is introduced. The parameter is
an integration constant which appears in the general solution of the Riccati
equation related to the Fresnel integrals. Argand plots of the deformed spirals
are presented and a supersymmetric (Darboux) structure of the deformation is
revealed through the factorization approach.
| math-ph math.MP | a parametric deformation of the cornu spiral is introduced the parameter is an integration constant which appears in the general solution of the riccati equation related to the fresnel integrals argand plots of the deformed spirals are presented and a supersymmetric darboux structure of the deformation is revealed through the factorization approach | [['a', 'parametric', 'deformation', 'of', 'the', 'cornu', 'spiral', 'is', 'introduced', 'the', 'parameter', 'is', 'an', 'integration', 'constant', 'which', 'appears', 'in', 'the', 'general', 'solution', 'of', 'the', 'riccati', 'equation', 'related', 'to', 'the', 'fresnel', 'integrals', 'argand', 'plots', 'of', 'the', 'deformed', 'spirals', 'are', 'presented', 'and', 'a', 'supersymmetric', 'darboux', 'structure', 'of', 'the', 'deformation', 'is', 'revealed', 'through', 'the', 'factorization', 'approach']] | [-0.174746393190267, 0.06033938370287965, -0.13859329404882514, 0.061753355976319514, -0.12408727917891856, -0.07848217005196673, -0.054529308260848314, 0.3099779781097403, -0.29548222499971205, -0.18550810357107997, 0.07610608513081948, -0.25786180500514233, -0.2237942276809078, 0.17156023159623146, -0.04107209293243404, 0.08389522478235169, 0.0034733633689868907, 0.011232574568846477, -0.13653519896503824, -0.22373737283767417, 0.3121120355880031, 0.008649394632532047, 0.23194642771536914, -0.05138098602541364, 0.13088745530694723, -0.005879004915746359, -0.03534838689777713, -0.0334662409642568, -0.16785755979183775, 0.1164323252876504, 0.2175512172622033, 0.06025065744940478, 0.19612040382344276, -0.3501991041076298, -0.1628333365258116, 0.01464881555428012, 0.18461094897849342, 0.0961144290430149, -0.022996515214729767, -0.30889474034819825, 0.002628934927857839, -0.1295141150991325, -0.22663718171847555, -0.08082955952900542, 0.022563176372876532, 0.025706084015277717, -0.25748898844400314, 0.10942221137408453, 0.061863002743428715, 0.01521215165177217, -0.06974227274692496, -0.06364910770431519, -0.0464911823017666, 0.0022703129439972914, 0.06765971676437542, 0.03572444567600122, 0.12181136394456889, -0.12521507850704858, -0.06671910227921146, 0.39644925405445974, 0.001410798051018411, -0.25921117127514803, 0.06527696351090875, -0.12425330669905704, -0.0920558601546173, 0.17250981748713037, 0.08594742302711193, 0.1495639591370351, -0.14801127984873558, 0.1459110755726075, -0.022426914996825732, 0.14241775893158495, 0.10538069560873108, -0.06957190521755435, 0.14456756851779154, 0.15415421936016244, 0.026424429236123197, 0.15960134479861993, -0.07938198627044375, -0.17985852780447414, -0.3620410457325096, -0.1871683699114678, -0.1375051682922416, 0.04190657912896803, -0.1489236371660529, -0.2095673825018681, 0.38816525278469693, 0.010299821903642554, 0.19172224739584356, -0.011090198690698553, 0.23486646259866226, 0.2042075814679265, 0.1236076257773675, 0.0022403238645683113, 0.2668866723632583, 0.21953635999055293, 0.08103702132267734, -0.2447192036958698, 0.0022458365509429802, 0.13029253101334548] |
1,803.01059 | Perpertual Coupled Simulated Annealing for Continuous Optimization | Global optimization heuristics are popular to optimize hard non-convex
problems. Despite their irrefutably large cost-to-solution, in the lack of
other working greedy or convex approaches, global optimization algorithms
remain the no-brainer choice. Nevertheless, successful use often requires
tedious adjustments to initial parameters to avoid premature convergence. The
Coupled Simulated Annealing approach proposed a method based on the coupling of
multiple optimizers to escape premature convergence, having achieved success in
optimizing hyperparameters of many applications of machine learning; however, a
careful choice of the generation temperature is still required. In this paper
we propose the Perpetual Orbit technique as a solution to control the
generation temperature and avoid search stagnation. In principle, this
technique can also be applied to other ensemble- and population-based
algorithms that have a dispersion variable. The results of our experiments show
superior performance when using the proposed technique because it makes the
Couple Simulated Annealing totally parameter-free and capable of reaching equal
or better solutions in more than 85\% cases across all functions and competitor
methods analyzed.
| math.OC | global optimization heuristics are popular to optimize hard nonconvex problems despite their irrefutably large costtosolution in the lack of other working greedy or convex approaches global optimization algorithms remain the nobrainer choice nevertheless successful use often requires tedious adjustments to initial parameters to avoid premature convergence the coupled simulated annealing approach proposed a method based on the coupling of multiple optimizers to escape premature convergence having achieved success in optimizing hyperparameters of many applications of machine learning however a careful choice of the generation temperature is still required in this paper we propose the perpetual orbit technique as a solution to control the generation temperature and avoid search stagnation in principle this technique can also be applied to other ensemble and populationbased algorithms that have a dispersion variable the results of our experiments show superior performance when using the proposed technique because it makes the couple simulated annealing totally parameterfree and capable of reaching equal or better solutions in more than 85 cases across all functions and competitor methods analyzed | [['global', 'optimization', 'heuristics', 'are', 'popular', 'to', 'optimize', 'hard', 'nonconvex', 'problems', 'despite', 'their', 'irrefutably', 'large', 'costtosolution', 'in', 'the', 'lack', 'of', 'other', 'working', 'greedy', 'or', 'convex', 'approaches', 'global', 'optimization', 'algorithms', 'remain', 'the', 'nobrainer', 'choice', 'nevertheless', 'successful', 'use', 'often', 'requires', 'tedious', 'adjustments', 'to', 'initial', 'parameters', 'to', 'avoid', 'premature', 'convergence', 'the', 'coupled', 'simulated', 'annealing', 'approach', 'proposed', 'a', 'method', 'based', 'on', 'the', 'coupling', 'of', 'multiple', 'optimizers', 'to', 'escape', 'premature', 'convergence', 'having', 'achieved', 'success', 'in', 'optimizing', 'hyperparameters', 'of', 'many', 'applications', 'of', 'machine', 'learning', 'however', 'a', 'careful', 'choice', 'of', 'the', 'generation', 'temperature', 'is', 'still', 'required', 'in', 'this', 'paper', 'we', 'propose', 'the', 'perpetual', 'orbit', 'technique', 'as', 'a', 'solution', 'to', 'control', 'the', 'generation', 'temperature', 'and', 'avoid', 'search', 'stagnation', 'in', 'principle', 'this', 'technique', 'can', 'also', 'be', 'applied', 'to', 'other', 'ensemble', 'and', 'populationbased', 'algorithms', 'that', 'have', 'a', 'dispersion', 'variable', 'the', 'results', 'of', 'our', 'experiments', 'show', 'superior', 'performance', 'when', 'using', 'the', 'proposed', 'technique', 'because', 'it', 'makes', 'the', 'couple', 'simulated', 'annealing', 'totally', 'parameterfree', 'and', 'capable', 'of', 'reaching', 'equal', 'or', 'better', 'solutions', 'in', 'more', 'than', '85', 'cases', 'across', 'all', 'functions', 'and', 'competitor', 'methods', 'analyzed']] | [-0.05106956940729863, 0.016244210441552193, -0.09576095513787544, 0.08633341288600468, -0.0973356906631348, -0.18005440192865932, 0.09471188440799022, 0.43270036636734616, -0.2685517175262515, -0.35166936526583886, 0.1288703079739708, -0.21117531769618972, -0.14985519697789304, 0.2425661295398646, -0.09355710855054998, 0.12861927790556124, 0.11495508604353952, -0.017529024670045534, -0.099058438790265, -0.32744132471967957, 0.23461508157267097, 0.060778892908557626, 0.34118679963877635, 0.0301083598681865, 0.10901769249237137, -0.0006455924322906725, 0.003685283434192488, 0.02167395758589625, -0.06950243190928637, 0.11361302753448943, 0.27694902882888955, 0.17952862376079498, 0.37674721102871583, -0.4188926794362662, -0.19445150882050305, 0.15398526205653382, 0.1650250113769964, 0.09554638838518166, -0.06992841269069806, -0.21371160388483615, 0.074456382538666, -0.10944275509058582, -0.10276518909338705, -0.15035667157326588, -0.05327356788524967, 0.02207023012284524, -0.28966968489426026, 0.05542791050333881, 0.030864428792472632, 0.02916197044339901, -0.04025740508972332, -0.12400331900561017, 0.037355282336953066, 0.07586966631435622, 0.09105773943108311, 0.03311572038473751, 0.16178191111013182, -0.11610866263843403, -0.14821274907322612, 0.38392092421940877, -0.03801116939192473, -0.21174076471260253, 0.253922439047866, -0.029032589810549052, -0.1308999279051082, 0.16576170855519656, 0.18218390450291447, 0.17841948613435207, -0.15399703501577663, 0.038415290087651086, 0.04440161463745987, 0.15069246771159822, 0.05665240486286313, -0.00890711653966479, 0.1603816836991509, 0.20863338090719175, 0.11784765897018969, 0.11694485552937997, -0.052648772970037144, -0.12794754038771203, -0.20905309131481925, -0.0905550967530392, -0.18849326824716398, -0.008409541700464747, -0.08907851325536235, -0.17832493392226403, 0.3706283878512725, 0.23683943958328424, 0.16595475969021906, 0.058228889674723464, 0.33919072640546694, 0.07871482579712338, 0.09284192532674594, 0.08379209704953663, 0.25298607970649256, 0.060509599264276154, 0.11282743650772971, -0.23713182413554612, 0.11135068122425791, 0.02156906568272385] |
1,803.0106 | Fragmentation of charm to charmonium in $e^+e^-$ and $pp$ collisions | We perform numerical comparison of the fragmentation mechanism of charmonium
production ($g\,g\to c\,\bar{c}$ followed by $c\to\psi\,c$) with the full
leading order calculation ($g\,g\to\psi\,c\,\bar{c}$ at ${\O} (\alpha_s^4)$).
We conclude that the non-fragmentation contributions remain important up to
$J/\psi$ transverse momenta about as large as 50 GeV, thus making questionable
the applicability of the fragmentation approximation at smaller transverse
momenta.
| hep-ph | we perform numerical comparison of the fragmentation mechanism of charmonium production ggto cbarc followed by ctopsic with the full leading order calculation ggtopsicbarc at o alpha_s4 we conclude that the nonfragmentation contributions remain important up to jpsi transverse momenta about as large as 50 gev thus making questionable the applicability of the fragmentation approximation at smaller transverse momenta | [['we', 'perform', 'numerical', 'comparison', 'of', 'the', 'fragmentation', 'mechanism', 'of', 'charmonium', 'production', 'ggto', 'cbarc', 'followed', 'by', 'ctopsic', 'with', 'the', 'full', 'leading', 'order', 'calculation', 'ggtopsicbarc', 'at', 'o', 'alpha_s4', 'we', 'conclude', 'that', 'the', 'nonfragmentation', 'contributions', 'remain', 'important', 'up', 'to', 'jpsi', 'transverse', 'momenta', 'about', 'as', 'large', 'as', '50', 'gev', 'thus', 'making', 'questionable', 'the', 'applicability', 'of', 'the', 'fragmentation', 'approximation', 'at', 'smaller', 'transverse', 'momenta']] | [-0.05234546425968541, 0.2080717039560633, -0.050652306352276355, 0.15070038338723993, -0.038298011058941483, -0.06020263464493577, 0.041424144412823286, 0.3496842308834727, -0.16349161422528727, -0.2585781865553664, -0.046509266864242296, -0.296643055775868, 0.06882254642966602, 0.12608410966848688, 0.13607662982706512, 0.09593669709283859, 0.10514438674519104, -0.03380817945747237, -0.060379536086527096, -0.220343700277486, 0.31352329437088755, 0.09671678912958928, 0.18393623729103378, 0.1861600945038455, 0.02232456613065941, 0.047603158210612104, -0.06196874407864276, -0.08226196570987147, -0.14328233262871695, 0.03145429077059297, 0.2455605085041108, 0.014050587778910995, 0.22842024089602223, -0.32540510109226617, -0.058936521529436244, 0.012928367692178913, 0.20446203855265463, 0.10613458823146564, 0.022397642107015208, -0.22801533818710595, 0.13204816009757842, -0.2697410536888388, -0.1657994804055696, -0.146498529240489, 0.015440640181103455, -0.08198819209688477, -0.2905071011877486, 0.1390249259306334, 0.011500238407669323, 0.024207547327802916, 0.014020320755662397, -0.21791778889019042, -0.059699139707455676, 0.019004228292033076, 0.13101663056295365, 0.13045222758332134, 0.17680408155346022, -0.15097277722920158, -0.17750785932210938, 0.42008495623511927, -0.010329339929739945, -0.12108155951968261, 0.16048652114113793, -0.20857620606797614, -0.12024629678178046, 0.25538598842935506, 0.21219705796517832, 0.10590890523027545, -0.11772032039672402, 0.044485346464041085, 0.07543480590850647, 0.1405098803432858, 0.15236450074839272, 0.10420548772006961, 0.1553929188480002, 0.18010917676396535, -0.04856746003497392, 0.09225666882204157, -0.09401768292134095, -0.12001341698175695, -0.41293357076522497, -0.09594257557598342, -0.06585751992783376, 0.13174615073616483, -0.07558538483655346, -0.07418740041820067, 0.34205970231310595, 0.13636694415306141, 0.29377185631476876, 0.03058761519579483, 0.3717404793465643, 0.09610547596405793, 0.09423576126573607, 0.09672557416238955, 0.2894347883494837, 0.1910738177539315, 0.15083560291012482, -0.252151960698289, 0.052499417905762256, 0.010213655016351757] |
1,803.01061 | Reaction-diffusion kinetics in growing domains | Reaction-diffusion models have been used over decades to study biological
systems. In this context, evolution equations for probability distribution
functions and the associated stochastic differential equations have nowadays
become indispensable tools. In population dynamics, say, such approaches are
utilized to study many systems, e.g., colonies of microorganisms or ecological
systems. While the majority of studies focus on the case of a static domain,
the time-dependent case is also important, as it allows one to deal with
situations where the domain growth takes place over time scales that are
relevant for the computation of reaction rates and of the associated reactant
distributions. Such situations are indeed frequently encountered in the field
of developmental biology, notably in connection with pattern formation, embryo
growth or morphogen gradient formation. In this chapter, we review some recent
advances in the study of pure diffusion processes in growing domains. These
results are subsequently taken as a starting point to study the kinetics of a
simple reaction-diffusion process, i.e., the encounter-controlled annihilation
reaction. The outcome of the present work is expected to pave the way for the
study of more complex reaction-diffusion systems of possible relevance in
various fields of research.
| cond-mat.stat-mech | reactiondiffusion models have been used over decades to study biological systems in this context evolution equations for probability distribution functions and the associated stochastic differential equations have nowadays become indispensable tools in population dynamics say such approaches are utilized to study many systems eg colonies of microorganisms or ecological systems while the majority of studies focus on the case of a static domain the timedependent case is also important as it allows one to deal with situations where the domain growth takes place over time scales that are relevant for the computation of reaction rates and of the associated reactant distributions such situations are indeed frequently encountered in the field of developmental biology notably in connection with pattern formation embryo growth or morphogen gradient formation in this chapter we review some recent advances in the study of pure diffusion processes in growing domains these results are subsequently taken as a starting point to study the kinetics of a simple reactiondiffusion process ie the encountercontrolled annihilation reaction the outcome of the present work is expected to pave the way for the study of more complex reactiondiffusion systems of possible relevance in various fields of research | [['reactiondiffusion', 'models', 'have', 'been', 'used', 'over', 'decades', 'to', 'study', 'biological', 'systems', 'in', 'this', 'context', 'evolution', 'equations', 'for', 'probability', 'distribution', 'functions', 'and', 'the', 'associated', 'stochastic', 'differential', 'equations', 'have', 'nowadays', 'become', 'indispensable', 'tools', 'in', 'population', 'dynamics', 'say', 'such', 'approaches', 'are', 'utilized', 'to', 'study', 'many', 'systems', 'eg', 'colonies', 'of', 'microorganisms', 'or', 'ecological', 'systems', 'while', 'the', 'majority', 'of', 'studies', 'focus', 'on', 'the', 'case', 'of', 'a', 'static', 'domain', 'the', 'timedependent', 'case', 'is', 'also', 'important', 'as', 'it', 'allows', 'one', 'to', 'deal', 'with', 'situations', 'where', 'the', 'domain', 'growth', 'takes', 'place', 'over', 'time', 'scales', 'that', 'are', 'relevant', 'for', 'the', 'computation', 'of', 'reaction', 'rates', 'and', 'of', 'the', 'associated', 'reactant', 'distributions', 'such', 'situations', 'are', 'indeed', 'frequently', 'encountered', 'in', 'the', 'field', 'of', 'developmental', 'biology', 'notably', 'in', 'connection', 'with', 'pattern', 'formation', 'embryo', 'growth', 'or', 'morphogen', 'gradient', 'formation', 'in', 'this', 'chapter', 'we', 'review', 'some', 'recent', 'advances', 'in', 'the', 'study', 'of', 'pure', 'diffusion', 'processes', 'in', 'growing', 'domains', 'these', 'results', 'are', 'subsequently', 'taken', 'as', 'a', 'starting', 'point', 'to', 'study', 'the', 'kinetics', 'of', 'a', 'simple', 'reactiondiffusion', 'process', 'ie', 'the', 'encountercontrolled', 'annihilation', 'reaction', 'the', 'outcome', 'of', 'the', 'present', 'work', 'is', 'expected', 'to', 'pave', 'the', 'way', 'for', 'the', 'study', 'of', 'more', 'complex', 'reactiondiffusion', 'systems', 'of', 'possible', 'relevance', 'in', 'various', 'fields', 'of', 'research']] | [-0.0901133433835264, 0.09704230135527545, -0.050184755238341934, 0.06363951247316173, -0.0328203495835661, -0.08847429039264001, -0.029594477599717138, 0.34933294865801406, -0.2691366789723295, -0.26219995174429156, 0.1201083673039432, -0.25507642400636127, -0.19840159061240012, 0.22389837692146064, -0.031990035501105914, 0.06791761423432335, 0.05552616003497513, 0.02573731883438592, 0.01141451658307786, -0.23797113471904519, 0.34425417281754467, 0.01700130598283536, 0.27549005011288624, 0.010282228357571456, 0.06138362275609344, -0.02573388831008264, -0.04985922312642419, 3.215545049110024e-05, -0.15685057692061274, 0.11765243282503228, 0.28612313554322566, 0.13466405012217572, 0.3084448282318862, -0.4940459655271363, -0.29964378500626104, 0.11974607415967765, 0.17497532102334873, 0.1504555611196694, -0.08298630307324426, -0.224739179124374, 0.036799768470803795, -0.15149503002380088, -0.13754271439123014, -0.05125744510490025, 0.06409899257759553, 0.07252324218579721, -0.24060291891915186, 0.08554089622984319, 0.05419141478349272, 0.07457386047973, -0.0735508776344863, -0.1078399572276616, -0.0030061036507963903, 0.15498827468752668, 0.07575788460992944, 0.0030104650281124854, 0.15457041661456689, -0.16236000699735217, -0.14096006388252735, 0.4132782829044502, -0.022930055350238055, -0.1991091257467693, 0.26541982722929536, -0.16472677622451304, -0.17431175399310023, 0.10580345125720098, 0.24732966447661908, 0.14995725846431726, -0.18786500336736747, 0.07648819820780173, 0.02966739619888855, 0.09825972154734719, 0.056105987497691794, 0.021713634940901214, 0.1861067237260454, 0.2209169119116418, 0.04843176457132021, 0.09703567715664155, -0.022507606049610742, -0.20468682822676557, -0.2367088150223429, -0.17244165692929678, -0.10535890282943039, 0.05423614087264946, -0.03507442501677829, -0.1487620469049512, 0.3585331590063678, 0.15320812493620306, 0.20166868453883788, 0.0029121771954076807, 0.2419603845013363, 0.10245549433490204, 0.050436600173833133, -0.0030189131989057376, 0.17033244515772183, 0.135479809793154, 0.14357805400894783, -0.19755540293948629, 0.13294601784815013, -0.0033952492138025225] |
1,803.01062 | Spin decoherence in a two-qubit CPHASE gate: the critical role of
tunneling noise | Rapid progress in semiconductor spin qubits has enabled experimental
demonstrations of a two-qubit logic gate. Understanding spin decoherence in a
two-qubit logic gate is necessary for optimal qubit operation. We study spin
decoherence due to $1/f$ charge noise for two electrons in a double quantum dot
used for a two-qubit controlled-phase gate. In contrast to the usual belief,
spin decoherence can be dominated by the tunneling noise from $1/f$ charge
noise instead of the detuning noise. Tunneling noise can dominate because the
effect of tunneling noise on the spin qubit is first order in the charge
admixture; while the effect of the detuning noise is only second order. The
different orders of contributions result in different detuning dependence of
the decoherence, which provides a way to identify the noise source. We find
that decoherence in a recent two-qubit experiment was dominated by the
tunneling noise from $1/f$ charge noise. The results illustrate the importance
of considering tunneling noise to design optimal operation of spin qubits.
| cond-mat.mes-hall | rapid progress in semiconductor spin qubits has enabled experimental demonstrations of a twoqubit logic gate understanding spin decoherence in a twoqubit logic gate is necessary for optimal qubit operation we study spin decoherence due to 1f charge noise for two electrons in a double quantum dot used for a twoqubit controlledphase gate in contrast to the usual belief spin decoherence can be dominated by the tunneling noise from 1f charge noise instead of the detuning noise tunneling noise can dominate because the effect of tunneling noise on the spin qubit is first order in the charge admixture while the effect of the detuning noise is only second order the different orders of contributions result in different detuning dependence of the decoherence which provides a way to identify the noise source we find that decoherence in a recent twoqubit experiment was dominated by the tunneling noise from 1f charge noise the results illustrate the importance of considering tunneling noise to design optimal operation of spin qubits | [['rapid', 'progress', 'in', 'semiconductor', 'spin', 'qubits', 'has', 'enabled', 'experimental', 'demonstrations', 'of', 'a', 'twoqubit', 'logic', 'gate', 'understanding', 'spin', 'decoherence', 'in', 'a', 'twoqubit', 'logic', 'gate', 'is', 'necessary', 'for', 'optimal', 'qubit', 'operation', 'we', 'study', 'spin', 'decoherence', 'due', 'to', '1f', 'charge', 'noise', 'for', 'two', 'electrons', 'in', 'a', 'double', 'quantum', 'dot', 'used', 'for', 'a', 'twoqubit', 'controlledphase', 'gate', 'in', 'contrast', 'to', 'the', 'usual', 'belief', 'spin', 'decoherence', 'can', 'be', 'dominated', 'by', 'the', 'tunneling', 'noise', 'from', '1f', 'charge', 'noise', 'instead', 'of', 'the', 'detuning', 'noise', 'tunneling', 'noise', 'can', 'dominate', 'because', 'the', 'effect', 'of', 'tunneling', 'noise', 'on', 'the', 'spin', 'qubit', 'is', 'first', 'order', 'in', 'the', 'charge', 'admixture', 'while', 'the', 'effect', 'of', 'the', 'detuning', 'noise', 'is', 'only', 'second', 'order', 'the', 'different', 'orders', 'of', 'contributions', 'result', 'in', 'different', 'detuning', 'dependence', 'of', 'the', 'decoherence', 'which', 'provides', 'a', 'way', 'to', 'identify', 'the', 'noise', 'source', 'we', 'find', 'that', 'decoherence', 'in', 'a', 'recent', 'twoqubit', 'experiment', 'was', 'dominated', 'by', 'the', 'tunneling', 'noise', 'from', '1f', 'charge', 'noise', 'the', 'results', 'illustrate', 'the', 'importance', 'of', 'considering', 'tunneling', 'noise', 'to', 'design', 'optimal', 'operation', 'of', 'spin', 'qubits']] | [-0.1875853530836828, 0.21505126124247909, -0.012174037990696503, 0.06815535464451056, 0.029914233252180344, -0.21728902713141657, 0.07992754035883329, 0.3736512814225121, -0.22084952741296907, -0.28753214579527125, -0.012477802882450774, -0.2668250506659123, -0.11658312705430117, 0.24435151424823384, -0.08793486324280049, 0.06366533302052906, 0.002631681197972009, -0.03852646311349941, -0.07809686892538924, -0.23542523057002462, 0.29235971517240006, 0.0390181948085118, 0.2917569297111847, 0.02263518175618215, 0.09425808025495798, -0.000865379066178293, 0.05340764321048151, -0.0564478071173653, -0.06594101859024676, 0.0035990782851127515, 0.28406321196957973, -0.022076340586963027, 0.2429933103704543, -0.4561814969123313, -0.1673415057318793, 0.056083050437243376, 0.09564843296891812, 0.2579055054021548, -0.0465432326965542, -0.33423207374007413, -0.023139660064639016, -0.19997010906085824, -0.02713781684376017, -0.11661940422473532, 0.024368092547537704, -0.0412316686886532, -0.2965985552040917, 0.09839633460805723, 0.1382288666950031, -0.009676977072023984, 0.03507780204315416, -0.04748686534550154, 0.022762139909195178, 0.10384555144171992, -0.012902889562996499, 0.01872119358458528, 0.27524872931059113, -0.10388509207687369, -0.20808289205147462, 0.2528572933903585, -0.08014485751998357, -0.17723049130431856, 0.09774142328198208, -0.19884029346885104, -0.049435615281320434, 0.13866581154253446, 0.06539178163617511, 0.030994993956427963, -0.1902530521041516, 0.09354179535399784, 0.12324066661636937, 0.23231754324427156, 0.08238263809136256, 0.17896448790631964, 0.19313629204689553, 0.19713589443796964, 0.12394402007092581, 0.18543547040317207, -0.15248490842764803, -0.09628711533873821, -0.2698967656064214, -0.12391325618055733, -0.269446150586009, 0.18206194280223412, -0.0441694267997236, -0.10123984924320019, 0.4595719513342236, 0.19330368759533897, 0.12667458509518342, -0.04723670784539233, 0.3566530298893199, 0.1465390096616113, 0.0470994154696889, -0.012560285348445176, 0.2249067649527481, 0.22787499962741453, 0.058520794398800445, -0.37921627889066284, 0.07883176204508566, -0.08736193423074755] |
1,803.01063 | Learning Dynamic Boltzmann Distributions as Reduced Models of Spatial
Chemical Kinetics | Finding reduced models of spatially-distributed chemical reaction networks
requires an estimation of which effective dynamics are relevant. We propose a
machine learning approach to this coarse graining problem, where a maximum
entropy approximation is constructed that evolves slowly in time. The dynamical
model governing the approximation is expressed as a functional, allowing a
general treatment of spatial interactions. In contrast to typical machine
learning approaches which estimate the interaction parameters of a graphical
model, we derive Boltzmann-machine like learning algorithms to estimate
directly the functionals dictating the time evolution of these parameters. By
incorporating analytic solutions from simple reaction motifs, an efficient
simulation method is demonstrated for systems ranging from toy problems to
basic biologically relevant networks. The broadly applicable nature of our
approach to learning spatial dynamics suggests promising applications to
multiscale methods for spatial networks, as well as to further problems in
machine learning.
| physics.bio-ph cond-mat.stat-mech | finding reduced models of spatiallydistributed chemical reaction networks requires an estimation of which effective dynamics are relevant we propose a machine learning approach to this coarse graining problem where a maximum entropy approximation is constructed that evolves slowly in time the dynamical model governing the approximation is expressed as a functional allowing a general treatment of spatial interactions in contrast to typical machine learning approaches which estimate the interaction parameters of a graphical model we derive boltzmannmachine like learning algorithms to estimate directly the functionals dictating the time evolution of these parameters by incorporating analytic solutions from simple reaction motifs an efficient simulation method is demonstrated for systems ranging from toy problems to basic biologically relevant networks the broadly applicable nature of our approach to learning spatial dynamics suggests promising applications to multiscale methods for spatial networks as well as to further problems in machine learning | [['finding', 'reduced', 'models', 'of', 'spatiallydistributed', 'chemical', 'reaction', 'networks', 'requires', 'an', 'estimation', 'of', 'which', 'effective', 'dynamics', 'are', 'relevant', 'we', 'propose', 'a', 'machine', 'learning', 'approach', 'to', 'this', 'coarse', 'graining', 'problem', 'where', 'a', 'maximum', 'entropy', 'approximation', 'is', 'constructed', 'that', 'evolves', 'slowly', 'in', 'time', 'the', 'dynamical', 'model', 'governing', 'the', 'approximation', 'is', 'expressed', 'as', 'a', 'functional', 'allowing', 'a', 'general', 'treatment', 'of', 'spatial', 'interactions', 'in', 'contrast', 'to', 'typical', 'machine', 'learning', 'approaches', 'which', 'estimate', 'the', 'interaction', 'parameters', 'of', 'a', 'graphical', 'model', 'we', 'derive', 'boltzmannmachine', 'like', 'learning', 'algorithms', 'to', 'estimate', 'directly', 'the', 'functionals', 'dictating', 'the', 'time', 'evolution', 'of', 'these', 'parameters', 'by', 'incorporating', 'analytic', 'solutions', 'from', 'simple', 'reaction', 'motifs', 'an', 'efficient', 'simulation', 'method', 'is', 'demonstrated', 'for', 'systems', 'ranging', 'from', 'toy', 'problems', 'to', 'basic', 'biologically', 'relevant', 'networks', 'the', 'broadly', 'applicable', 'nature', 'of', 'our', 'approach', 'to', 'learning', 'spatial', 'dynamics', 'suggests', 'promising', 'applications', 'to', 'multiscale', 'methods', 'for', 'spatial', 'networks', 'as', 'well', 'as', 'to', 'further', 'problems', 'in', 'machine', 'learning']] | [-0.042215346269411584, 0.04988010565862729, -0.11174707583467515, 0.09806412631168974, -0.07002704255346669, -0.17455721506290775, 0.011131601880164179, 0.35600109917928197, -0.3192313234050669, -0.32360180247932263, 0.054529303704764796, -0.2063475845585743, -0.21288072701291602, 0.19903857982876927, -0.04514808153529486, 0.10976107528752947, 0.06390705558611717, 0.022865036374902073, -0.07804743192088472, -0.19904594011094473, 0.2962325655389577, 0.06279519978553465, 0.30099838913405597, 0.011429751451344115, 0.12704057726460471, -0.002424250012391234, -0.002294490330339065, 0.026319682200428112, -0.1419473816069064, 0.17045750861193296, 0.3117959133096644, 0.1559482058566, 0.32942088494357996, -0.42015701656114973, -0.32848944116307244, 0.09074500319229005, 0.17271102207381125, 0.16733801816426672, -0.012195202541116574, -0.2635983488752111, 0.02882517602498809, -0.1487949766658808, -0.09138510113124328, -0.15189744994580134, 0.012760504485388631, 0.018966867361211358, -0.3282944455723699, 0.08382244518386321, 0.022924762174338805, 0.02947971582482888, -0.07787551114587624, -0.09824698621786697, 0.0395852331237944, 0.13520524801992595, 0.025250284941324787, 0.02802577702693756, 0.16482551716114968, -0.1437004722976955, -0.13023698178386278, 0.3854310686814867, -0.048176846258846204, -0.21887758835410215, 0.22562552090855442, -0.0004336786111944342, -0.16712065935390044, 0.10357789051310759, 0.2522667365193316, 0.16510302504071686, -0.19619360525314122, 0.051721604365523755, 0.02281054745951336, 0.16441131091663894, -0.023641384559048, -0.014819222261207434, 0.15410058718008843, 0.2669788016523043, 0.036645115283796284, 0.1044089115991844, -0.049614707405092065, -0.17112309006457407, -0.23421606011305973, -0.08541385833435526, -0.18237509813529681, 0.02812497423681086, -0.14345029839761045, -0.18193828568902276, 0.3758801604582839, 0.20345585501102142, 0.18418555187495195, 0.09258602480148923, 0.30729642017642417, 0.10987853144346545, 0.0810611547123998, 0.07854828612770477, 0.18049771607413326, 0.1351665202671764, 0.11179112220080951, -0.1967671080193425, 0.08956525223457242, 0.0704314607492176] |
1,803.01064 | Holographic Approach to Entanglement Entropy in Disordered Systems | We investigate the entanglement entropy of a two-dimensional disordered
system holographically. In particular, we study the evolution of the
entanglement entropy along renormalization group flows for a conformal theory
at the UV fixed point, that is perturbed by weak disorder into a Lifshitz
theory at the IR fixed point. Through numerical fitting, we find that the
disorder correlations leads to a sub-leading power-law term in the entanglement
entropy that vanishes at the IR fixed point. Interestingly, the exponent that
controls the power-law vanishing of the sub-leading term seems to be almost
universal as it depends very weakly on the strength of the disorder. We show
that our results can be put in the context of the c-theorem by defining an
effective central charge that decreases along the RG flow. We also investigate
disorder induced long-range correlations between the two subsystems by studying
the holographic mutual information.
| hep-th | we investigate the entanglement entropy of a twodimensional disordered system holographically in particular we study the evolution of the entanglement entropy along renormalization group flows for a conformal theory at the uv fixed point that is perturbed by weak disorder into a lifshitz theory at the ir fixed point through numerical fitting we find that the disorder correlations leads to a subleading powerlaw term in the entanglement entropy that vanishes at the ir fixed point interestingly the exponent that controls the powerlaw vanishing of the subleading term seems to be almost universal as it depends very weakly on the strength of the disorder we show that our results can be put in the context of the ctheorem by defining an effective central charge that decreases along the rg flow we also investigate disorder induced longrange correlations between the two subsystems by studying the holographic mutual information | [['we', 'investigate', 'the', 'entanglement', 'entropy', 'of', 'a', 'twodimensional', 'disordered', 'system', 'holographically', 'in', 'particular', 'we', 'study', 'the', 'evolution', 'of', 'the', 'entanglement', 'entropy', 'along', 'renormalization', 'group', 'flows', 'for', 'a', 'conformal', 'theory', 'at', 'the', 'uv', 'fixed', 'point', 'that', 'is', 'perturbed', 'by', 'weak', 'disorder', 'into', 'a', 'lifshitz', 'theory', 'at', 'the', 'ir', 'fixed', 'point', 'through', 'numerical', 'fitting', 'we', 'find', 'that', 'the', 'disorder', 'correlations', 'leads', 'to', 'a', 'subleading', 'powerlaw', 'term', 'in', 'the', 'entanglement', 'entropy', 'that', 'vanishes', 'at', 'the', 'ir', 'fixed', 'point', 'interestingly', 'the', 'exponent', 'that', 'controls', 'the', 'powerlaw', 'vanishing', 'of', 'the', 'subleading', 'term', 'seems', 'to', 'be', 'almost', 'universal', 'as', 'it', 'depends', 'very', 'weakly', 'on', 'the', 'strength', 'of', 'the', 'disorder', 'we', 'show', 'that', 'our', 'results', 'can', 'be', 'put', 'in', 'the', 'context', 'of', 'the', 'ctheorem', 'by', 'defining', 'an', 'effective', 'central', 'charge', 'that', 'decreases', 'along', 'the', 'rg', 'flow', 'we', 'also', 'investigate', 'disorder', 'induced', 'longrange', 'correlations', 'between', 'the', 'two', 'subsystems', 'by', 'studying', 'the', 'holographic', 'mutual', 'information']] | [-0.1786079188642947, 0.19728112966549816, -0.12934980425052345, 0.08552766795515733, 0.02049130818460532, -0.16542571115830582, 0.030338343228883277, 0.3222275175702796, -0.2619491372104377, -0.19410370178010367, 0.04472908724740479, -0.3560602767137836, -0.15686766611259073, 0.1233998627261552, -0.001542189978190685, 0.021843688280245112, -0.033826560018048304, 0.04699577629559814, -0.11419687821045008, -0.20920379636235126, 0.3877618193996381, 0.0654437705230172, 0.3026714294077191, 0.13054520479875475, 0.056543811844751136, 0.030252695707157766, -0.006928441829162918, 0.08380458688312402, -0.16247248925635038, 0.04872103420736855, 0.2058047489358801, -0.004975247412341111, 0.23575112888468303, -0.3778432389587317, -0.2438723108004013, 0.08142695615820791, 0.14485649790053498, 0.12742270644808393, -0.03628328332537147, -0.24748635374341313, 0.07121480473840278, -0.1763477600450717, -0.1724273177654776, -0.07515448430706173, 0.02390492557426787, -0.030805916310134917, -0.2544095485920903, 0.11988077568861477, 0.06785751195394829, 0.05638944370072488, -0.03296798006759012, 0.02966203866925167, -0.08340579259196577, 0.13712892344553176, 0.10212518979176521, 0.04654522638286349, 0.1609532707849237, -0.16929730036844537, -0.07078481721452577, 0.3040677630023597, -0.10685067532316156, -0.16342308508768066, 0.17283251787829276, -0.14843035874926575, -0.1477090523208249, 0.09880154879368229, 0.10833355794463001, 0.09704894606623646, -0.1411748079723385, 0.11614323363397015, -0.03175387493245406, 0.17993424106082298, 0.027146326830891306, 0.07183749355018547, 0.23508871373503584, 0.07822791232379817, 0.07971268272257015, 0.20344603360209562, -0.05528179277940606, -0.14036815554343726, -0.3690975746139884, -0.1402724691067044, -0.2234990687766559, 0.07816577194041688, -0.19148745966041844, -0.1499886619188657, 0.3786499706441409, 0.16112791985456357, 0.2122244436823291, 0.05069254256453212, 0.20469550659548338, 0.16812228808842905, 0.06822206275792767, 0.09956680140649415, 0.2758946188913709, 0.10374781421915157, 0.07843725011629779, -0.3153230695353744, 0.009004613502614507, 0.12692389410301685] |
1,803.01065 | Secrecy Outage of Proactive Relay Selection by Eavesdropper | In this paper, we consider an active eavesdropping scenario in a cooperative
system consisting of a source, a destination, and an active eavesdropper with
multiple decode-and-forward relays. Considering an existing assumption in which
an eavesdropper is also a part of network, a proactive relay selection by the
eavesdropper is proposed. The best relay which maximizes the eavesdropping rate
is selected by the eavesdropper. A relay selection scheme is also proposed to
improve the secrecy of the system by minimizing the eavesdropping rate.
Performances of these schemes are compared with two passive eavesdropping
scenarios in which the eavesdropper performs selection and maximal ratio
combining on the relayed links. A realistic channel model with independent
non-identical links between nodes and direct links from the source to both the
destination and eavesdropper are assumed. Closed-form expressions for the
secrecy outage probability (SOP) of these schemes in Rayleigh fading channel
are obtained. It is shown that the relay selection by the proactive
eavesdropper is most detrimental to the system as not only the SOP increases
with the increase in the number of relays, but its diversity also remains
unchanged.
| eess.SP | in this paper we consider an active eavesdropping scenario in a cooperative system consisting of a source a destination and an active eavesdropper with multiple decodeandforward relays considering an existing assumption in which an eavesdropper is also a part of network a proactive relay selection by the eavesdropper is proposed the best relay which maximizes the eavesdropping rate is selected by the eavesdropper a relay selection scheme is also proposed to improve the secrecy of the system by minimizing the eavesdropping rate performances of these schemes are compared with two passive eavesdropping scenarios in which the eavesdropper performs selection and maximal ratio combining on the relayed links a realistic channel model with independent nonidentical links between nodes and direct links from the source to both the destination and eavesdropper are assumed closedform expressions for the secrecy outage probability sop of these schemes in rayleigh fading channel are obtained it is shown that the relay selection by the proactive eavesdropper is most detrimental to the system as not only the sop increases with the increase in the number of relays but its diversity also remains unchanged | [['in', 'this', 'paper', 'we', 'consider', 'an', 'active', 'eavesdropping', 'scenario', 'in', 'a', 'cooperative', 'system', 'consisting', 'of', 'a', 'source', 'a', 'destination', 'and', 'an', 'active', 'eavesdropper', 'with', 'multiple', 'decodeandforward', 'relays', 'considering', 'an', 'existing', 'assumption', 'in', 'which', 'an', 'eavesdropper', 'is', 'also', 'a', 'part', 'of', 'network', 'a', 'proactive', 'relay', 'selection', 'by', 'the', 'eavesdropper', 'is', 'proposed', 'the', 'best', 'relay', 'which', 'maximizes', 'the', 'eavesdropping', 'rate', 'is', 'selected', 'by', 'the', 'eavesdropper', 'a', 'relay', 'selection', 'scheme', 'is', 'also', 'proposed', 'to', 'improve', 'the', 'secrecy', 'of', 'the', 'system', 'by', 'minimizing', 'the', 'eavesdropping', 'rate', 'performances', 'of', 'these', 'schemes', 'are', 'compared', 'with', 'two', 'passive', 'eavesdropping', 'scenarios', 'in', 'which', 'the', 'eavesdropper', 'performs', 'selection', 'and', 'maximal', 'ratio', 'combining', 'on', 'the', 'relayed', 'links', 'a', 'realistic', 'channel', 'model', 'with', 'independent', 'nonidentical', 'links', 'between', 'nodes', 'and', 'direct', 'links', 'from', 'the', 'source', 'to', 'both', 'the', 'destination', 'and', 'eavesdropper', 'are', 'assumed', 'closedform', 'expressions', 'for', 'the', 'secrecy', 'outage', 'probability', 'sop', 'of', 'these', 'schemes', 'in', 'rayleigh', 'fading', 'channel', 'are', 'obtained', 'it', 'is', 'shown', 'that', 'the', 'relay', 'selection', 'by', 'the', 'proactive', 'eavesdropper', 'is', 'most', 'detrimental', 'to', 'the', 'system', 'as', 'not', 'only', 'the', 'sop', 'increases', 'with', 'the', 'increase', 'in', 'the', 'number', 'of', 'relays', 'but', 'its', 'diversity', 'also', 'remains', 'unchanged']] | [-0.2915969438731318, 0.02484926760127466, -0.018446615997802566, 0.0016375505195527866, -0.04453617999883922, -0.34391308725887054, 0.16448778483475482, 0.3930281573654832, -0.2398289391701739, -0.2284702093466311, 0.06810850171196098, -0.28822338557927996, -0.16340241595548954, 0.10426133966601982, -0.14133572013092202, 0.033042878740957966, -0.005753853729598828, 0.08365649125488425, 0.03457680921372328, -0.3239225611631834, 0.32163468335780343, 0.18982874600569138, 0.3663010328290732, -0.0029319791551175953, 0.08799643171951174, 0.03342187015616612, -0.02356931925121997, -0.07610257208611615, -0.06044919159459233, 0.013025070491523759, 0.32167214236750796, 0.17915867659844603, 0.2566873219166253, -0.3443709555711295, -0.28491463233288883, 0.09581219133845455, 0.18682895489792165, 0.10537805874215288, -0.0379685015606417, -0.3166566211730242, 0.12488283702625415, -0.2915248683383185, 0.0028967419739913294, 0.08647293484694249, -0.09603897510599849, 0.06811573912666456, -0.363045887868046, -0.002633050168908478, 0.0014361509298150604, 0.030737514678086785, -0.06349299395821888, -0.08641483005123667, 0.007053468952811248, 0.2062670792906067, 0.08224926374701633, -0.01806600864385129, 0.1295044909759953, -0.13087899119442178, -0.11730938165675144, 0.3212699684717164, 0.017557691894723355, -0.26305349599192474, 0.14415468749325924, -0.05091914302996687, -0.05562113420361326, 0.19183997348001278, 0.21968585206447422, 0.07571098648414419, -0.1980353862550613, -0.027430133668806506, -0.04611048612089173, 0.19543932086058163, 0.05131730545513533, 0.12125452621714086, 0.13272520330721965, 0.15928525226945814, 0.16383912659350883, 0.1760797046376644, -0.1269329673673555, -0.09482204354481419, -0.2688883268931956, -0.12469583343513109, -0.24509085218384358, 0.002759205752659614, -0.10709691176181534, -0.007772574267142477, 0.32605188596005336, 0.1185789275602941, 0.121613360911205, 0.09783334705059894, 0.4574807934211315, 0.09746929417125176, 0.004595546246934179, 0.18194678971241857, 0.2748794809438452, 0.10993948735649119, 0.04851064313253438, -0.21003074211169134, 0.15615439104621073, -0.025003707836809996] |
1,803.01066 | Specialized Interior Point Algorithm for Stable Nonlinear System
Identification | Estimation of nonlinear dynamic models from data poses many challenges,
including model instability and non-convexity of long-term simulation fidelity.
Recently Lagrangian relaxation has been proposed as a method to approximate
simulation fidelity and guarantee stability via semidefinite programming (SDP),
however the resulting SDPs have large dimension, limiting their utility in
practical problems. In this paper we develop a path-following interior point
algorithm that takes advantage of special structure in the problem and reduces
computational complexity from cubic to linear growth with the length of the
data set. The new algorithm enables empirical comparisons to established
methods including Nonlinear ARX, and we demonstrate superior generalization to
new data. We also explore the "regularizing" effect of stability constraints as
an alternative to regressor subset selection.
| cs.SY cs.LG math.OC | estimation of nonlinear dynamic models from data poses many challenges including model instability and nonconvexity of longterm simulation fidelity recently lagrangian relaxation has been proposed as a method to approximate simulation fidelity and guarantee stability via semidefinite programming sdp however the resulting sdps have large dimension limiting their utility in practical problems in this paper we develop a pathfollowing interior point algorithm that takes advantage of special structure in the problem and reduces computational complexity from cubic to linear growth with the length of the data set the new algorithm enables empirical comparisons to established methods including nonlinear arx and we demonstrate superior generalization to new data we also explore the regularizing effect of stability constraints as an alternative to regressor subset selection | [['estimation', 'of', 'nonlinear', 'dynamic', 'models', 'from', 'data', 'poses', 'many', 'challenges', 'including', 'model', 'instability', 'and', 'nonconvexity', 'of', 'longterm', 'simulation', 'fidelity', 'recently', 'lagrangian', 'relaxation', 'has', 'been', 'proposed', 'as', 'a', 'method', 'to', 'approximate', 'simulation', 'fidelity', 'and', 'guarantee', 'stability', 'via', 'semidefinite', 'programming', 'sdp', 'however', 'the', 'resulting', 'sdps', 'have', 'large', 'dimension', 'limiting', 'their', 'utility', 'in', 'practical', 'problems', 'in', 'this', 'paper', 'we', 'develop', 'a', 'pathfollowing', 'interior', 'point', 'algorithm', 'that', 'takes', 'advantage', 'of', 'special', 'structure', 'in', 'the', 'problem', 'and', 'reduces', 'computational', 'complexity', 'from', 'cubic', 'to', 'linear', 'growth', 'with', 'the', 'length', 'of', 'the', 'data', 'set', 'the', 'new', 'algorithm', 'enables', 'empirical', 'comparisons', 'to', 'established', 'methods', 'including', 'nonlinear', 'arx', 'and', 'we', 'demonstrate', 'superior', 'generalization', 'to', 'new', 'data', 'we', 'also', 'explore', 'the', 'regularizing', 'effect', 'of', 'stability', 'constraints', 'as', 'an', 'alternative', 'to', 'regressor', 'subset', 'selection']] | [-0.07334889467555757, -0.07062176135224309, -0.08875882596807266, 0.06178738953831345, -0.13697795033061166, -0.1427311035766592, 0.049744763363311746, 0.3562488213514652, -0.3284963897648987, -0.33231990712333276, 0.13790301529679266, -0.24170941278164282, -0.20188510149899053, 0.21544332529524174, -0.09914254156372897, 0.17351072333086798, 0.08148031919717608, -0.04075266102450044, -0.104128888162701, -0.2705955224005672, 0.2673477058779691, 0.068877719721295, 0.29305868972910615, 0.0353025784413141, 0.13918069212193926, -0.005592629900277872, 0.020239875227879216, 0.06547046245626606, -0.1127448905474337, 0.11073164149884104, 0.26787560961789064, 0.20143469862215888, 0.3571732320606981, -0.4284890079946537, -0.21953620328530063, 0.1083516943461557, 0.1350271012406887, 0.13791087166618224, -0.06391987803853988, -0.24016800432322108, 0.07631266123531916, -0.14180826095554683, -0.08388164311238541, -0.1511089826169295, -0.028894497897017868, -0.004335650139227055, -0.3314543291382166, 0.07030021228114847, 0.04431360341396516, 0.034618525035756006, -0.06094184604935288, -0.13539559745449362, 0.01916489040675929, 0.0756857621784481, 0.07811436540450961, -0.00684984043104256, 0.06149992662315386, -0.09150005620147093, -0.16219764339124285, 0.36368153517596363, -0.04007496730220027, -0.21812127572976478, 0.206787688474027, -0.058490899936636774, -0.15459765406605613, 0.14844416488755618, 0.26358276454928686, 0.10573894103110684, -0.1412832229942409, 0.1259095804421307, -0.03727688991684255, 0.1416335508969851, 0.021702365029784964, 0.04938668186106242, 0.12529369242247043, 0.24169336975839867, 0.10815673430660376, 0.1860230956680891, -0.08181154263031677, -0.12919634340588398, -0.2298775732335521, -0.10695725986052577, -0.1933047930308716, -0.008148899476036309, -0.13296647564786282, -0.15015080906980768, 0.4018516866329346, 0.2023509329759454, 0.15910132549233674, 0.11763135668617196, 0.33693244512669923, 0.11483413346097104, 0.05011852465501827, 0.08414479488946074, 0.21088517223658965, 0.1147943133861205, 0.068351113421055, -0.2677012886426116, 0.07244430095093643, 0.06622890333221029] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.