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.05367
|
Integrating UML with Service Refinement for Requirements Modeling and
Analysis
|
Unified Modeling Language (UML) is the de facto standard for requirements
modeling and system design. UML as a visual language can tremendously help
customers, project managers, and developers to specify the requirements of a
target system. However, UML lacks the ability to specify the requirements
precisely such as the contracts of the system operation, and verify the
consistency and refinement of the requirements. These disadvantages result in
that the potential faults of software are hard to be discovered in the early
stage of software development process, and then requiring more efforts in
software testing to find the bugs. Service refinement is a formal method, which
could be a supplement to enhance the UML. In this paper, we show how to
integrate UML with service refinement to specify requirements, and verify the
consistency and refinements of the requirements through a case study of online
shopping system. Particularly, requirements are modeled through UML diagrams,
which includes a) use case diagram, b) system sequence diagrams and c)
conceptual class diagram. Service refinement enhances the requirements model by
introducing the contracts. Furthermore, the consistency and refinements of
requirement model can be verified through service refinement. Our approach
demonstrates integrating UML with service refinement can require fewer efforts
to achieve the consistency requirements than only using UML for requirement
modeling.
|
cs.SE
|
unified modeling language uml is the de facto standard for requirements modeling and system design uml as a visual language can tremendously help customers project managers and developers to specify the requirements of a target system however uml lacks the ability to specify the requirements precisely such as the contracts of the system operation and verify the consistency and refinement of the requirements these disadvantages result in that the potential faults of software are hard to be discovered in the early stage of software development process and then requiring more efforts in software testing to find the bugs service refinement is a formal method which could be a supplement to enhance the uml in this paper we show how to integrate uml with service refinement to specify requirements and verify the consistency and refinements of the requirements through a case study of online shopping system particularly requirements are modeled through uml diagrams which includes a use case diagram b system sequence diagrams and c conceptual class diagram service refinement enhances the requirements model by introducing the contracts furthermore the consistency and refinements of requirement model can be verified through service refinement our approach demonstrates integrating uml with service refinement can require fewer efforts to achieve the consistency requirements than only using uml for requirement modeling
|
[['unified', 'modeling', 'language', 'uml', 'is', 'the', 'de', 'facto', 'standard', 'for', 'requirements', 'modeling', 'and', 'system', 'design', 'uml', 'as', 'a', 'visual', 'language', 'can', 'tremendously', 'help', 'customers', 'project', 'managers', 'and', 'developers', 'to', 'specify', 'the', 'requirements', 'of', 'a', 'target', 'system', 'however', 'uml', 'lacks', 'the', 'ability', 'to', 'specify', 'the', 'requirements', 'precisely', 'such', 'as', 'the', 'contracts', 'of', 'the', 'system', 'operation', 'and', 'verify', 'the', 'consistency', 'and', 'refinement', 'of', 'the', 'requirements', 'these', 'disadvantages', 'result', 'in', 'that', 'the', 'potential', 'faults', 'of', 'software', 'are', 'hard', 'to', 'be', 'discovered', 'in', 'the', 'early', 'stage', 'of', 'software', 'development', 'process', 'and', 'then', 'requiring', 'more', 'efforts', 'in', 'software', 'testing', 'to', 'find', 'the', 'bugs', 'service', 'refinement', 'is', 'a', 'formal', 'method', 'which', 'could', 'be', 'a', 'supplement', 'to', 'enhance', 'the', 'uml', 'in', 'this', 'paper', 'we', 'show', 'how', 'to', 'integrate', 'uml', 'with', 'service', 'refinement', 'to', 'specify', 'requirements', 'and', 'verify', 'the', 'consistency', 'and', 'refinements', 'of', 'the', 'requirements', 'through', 'a', 'case', 'study', 'of', 'online', 'shopping', 'system', 'particularly', 'requirements', 'are', 'modeled', 'through', 'uml', 'diagrams', 'which', 'includes', 'a', 'use', 'case', 'diagram', 'b', 'system', 'sequence', 'diagrams', 'and', 'c', 'conceptual', 'class', 'diagram', 'service', 'refinement', 'enhances', 'the', 'requirements', 'model', 'by', 'introducing', 'the', 'contracts', 'furthermore', 'the', 'consistency', 'and', 'refinements', 'of', 'requirement', 'model', 'can', 'be', 'verified', 'through', 'service', 'refinement', 'our', 'approach', 'demonstrates', 'integrating', 'uml', 'with', 'service', 'refinement', 'can', 'require', 'fewer', 'efforts', 'to', 'achieve', 'the', 'consistency', 'requirements', 'than', 'only', 'using', 'uml', 'for', 'requirement', 'modeling']]
|
[-0.0950613641521222, -0.007547208205471898, -0.08022321627237076, 0.07407182268992095, -0.14579558474726456, -0.17972587734287562, 0.102374675556974, 0.3919581263564354, -0.23883124464732963, -0.3893726028588622, 0.11608836215725818, -0.20876733369172312, -0.11578838139106411, 0.16929711376284357, -0.14343549145472256, 0.0861507487575372, 0.09640367693581814, -0.02128113566811175, -0.07046583158852056, -0.2640629841686161, 0.29035420109799437, 0.06471424442391063, 0.32172709361238533, 0.022987449559014897, 0.01736021301990678, -0.004366427379508698, -0.03816280040651733, -0.007242428164842517, -0.09089678211782674, 0.12774964458807264, 0.3311660158978559, 0.2755155743857802, 0.2857138475922998, -0.42390016744043246, -0.18924847181106721, 0.021313272811320807, 0.13721249509429514, 0.028611282538622617, 0.011533277023375185, -0.2963622509187824, 0.11893101053225787, -0.27054769741208834, -0.12511537633403097, -0.12498485699599218, -0.05473734896066924, 0.05170795354981322, -0.28557412024197537, -0.09884267515437895, 0.08382850953182855, 0.09922093355941565, -0.017570641000083712, -0.014229474202080001, -0.07813294236818978, 0.17843663099026957, 0.026985003878118818, 0.020981677410431034, 0.14173203716920904, -0.1479812150182159, -0.1181229409111967, 0.420253659182683, -0.008854867810678539, -0.18870916530316653, 0.19246978730255695, -0.019342552187181145, -0.21373661731066573, 0.07045805805774276, 0.14694385422003825, 0.04719379377269814, -0.2191765596656952, 0.07460800960936129, 0.09485292461765714, 0.21199094175014557, 0.03312307417739269, -0.008743629974941181, 0.2366062692258247, 0.25228182096900637, 0.027308182370697345, 0.17224974044284588, 0.01735180348027931, -0.07650310405161838, -0.29761766855886507, -0.21558524028528048, -0.08090124349434709, -0.06467976108041787, -0.08621343012383413, -0.16093755325865608, 0.3613365512341261, 0.21747713958584639, 0.08505407040370196, 0.09530084604115853, 0.3356705506440512, 0.0904091835731294, 0.10152803047987914, 0.06139343849729833, 0.15169391589791537, 0.01704104667377853, 0.18694991615146053, -0.16854823881457018, 0.1367638908001746, 0.05518872525196436]
|
1,803.05368
|
An Analysis of Home IoT Network Traffic and Behaviour
|
Internet-connected devices are increasingly present in our homes, and privacy
breaches, data thefts, and security threats are becoming commonplace. In order
to avoid these, we must first understand the behaviour of these devices.
In this work, we analyse network traces from a testbed of common IoT devices,
and describe general methods for fingerprinting their behavior. We then use the
information and insights derived from this data to assess where privacy and
security risks manifest themselves, as well as how device behavior affects
bandwidth. We demonstrate simple measures that circumvent attempts at securing
devices and protecting privacy.
|
cs.NI
|
internetconnected devices are increasingly present in our homes and privacy breaches data thefts and security threats are becoming commonplace in order to avoid these we must first understand the behaviour of these devices in this work we analyse network traces from a testbed of common iot devices and describe general methods for fingerprinting their behavior we then use the information and insights derived from this data to assess where privacy and security risks manifest themselves as well as how device behavior affects bandwidth we demonstrate simple measures that circumvent attempts at securing devices and protecting privacy
|
[['internetconnected', 'devices', 'are', 'increasingly', 'present', 'in', 'our', 'homes', 'and', 'privacy', 'breaches', 'data', 'thefts', 'and', 'security', 'threats', 'are', 'becoming', 'commonplace', 'in', 'order', 'to', 'avoid', 'these', 'we', 'must', 'first', 'understand', 'the', 'behaviour', 'of', 'these', 'devices', 'in', 'this', 'work', 'we', 'analyse', 'network', 'traces', 'from', 'a', 'testbed', 'of', 'common', 'iot', 'devices', 'and', 'describe', 'general', 'methods', 'for', 'fingerprinting', 'their', 'behavior', 'we', 'then', 'use', 'the', 'information', 'and', 'insights', 'derived', 'from', 'this', 'data', 'to', 'assess', 'where', 'privacy', 'and', 'security', 'risks', 'manifest', 'themselves', 'as', 'well', 'as', 'how', 'device', 'behavior', 'affects', 'bandwidth', 'we', 'demonstrate', 'simple', 'measures', 'that', 'circumvent', 'attempts', 'at', 'securing', 'devices', 'and', 'protecting', 'privacy']]
|
[-0.16907279653241858, -0.022302785286835086, -0.04429264986053264, 0.11530081061209785, -0.11000128454664566, -0.1954970226458196, 0.08363132806213495, 0.3670282283176978, -0.27820284439076204, -0.3400491416978184, 0.1555061364112286, -0.36936576070729643, -0.20114537031622604, 0.2117417993097964, -0.18771596491084588, 0.08607576243715205, -0.013125519052361293, -0.01483457934227772, 0.024663303112902213, -0.23993496365922815, 0.3565733451784278, 0.04398790367607338, 0.3633823049118898, 0.10241750097581341, 0.014266937803768087, -0.030040581380793203, -0.03050831426177562, -0.005693451997406858, -0.11269266503988244, 0.15408742039774856, 0.36171279250993393, 0.20426926375754798, 0.3485360271297395, -0.5035312850959599, -0.17669865044687563, 0.06925764540210366, 0.17597892016055994, 0.11250329395988956, -0.08563572325995968, -0.34166393331058015, 0.13067639488629842, -0.2270044619605566, -0.12642241979907945, -0.16996745215146802, -0.03990357783429014, 0.035010180969644956, -0.2060503967028732, -0.02596513370372122, -0.026720498701858258, 0.09201925048061337, -0.00850025125995065, -0.03586841540406264, -0.018692723046115134, 0.2245191924739629, 0.08319366806730007, -0.11260198475429206, 0.1980277279896351, -0.15335367121830737, -0.13120194349903613, 0.36412017008600134, 0.04158439979679921, -0.1124740516631088, 0.1785473238439105, -0.061268637276953086, -0.1631415051476021, 0.005552443433164929, 0.27327768386264023, 0.06690888700056045, -0.22722443548263982, 0.008445789037068607, 0.06407489976845682, 0.15508015680340273, 0.01836758742138045, 0.15965907294776116, 0.16901571136016477, 0.1832100154424552, 0.06480718215364807, 0.10531906217996341, -0.05801329863606952, -0.07630747408256866, -0.22540119367840816, -0.17293407615701048, -0.13646288601012202, 0.06304293714492815, -0.038282525654418954, -0.09519676843774505, 0.3384541224028605, 0.3155326313183953, 0.18682777404319495, 0.0520239679220443, 0.41527940685045905, 0.023759933426845237, 0.11532621085401236, 0.11936425759146611, 0.18646394796087407, 0.006670098421939959, 0.1987893588229781, -0.12990140357093574, 0.151016845289026, -0.10536493347899523]
|
1,803.05369
|
Complex activity patterns generated by short-term synaptic plasticity
|
Short-term synaptic plasticity (STSP) affects the efficiency of synaptic
transmission for persistent presynaptic activities. We consider attractor
neural networks, for which the attractors are given, in the absence of STSP, by
cell assemblies of excitatory cliques. We show that STSP may transform these
attracting states into attractor relics, inducing ongoing transient-state
dynamics in terms of sequences of transiently activated cell assemblies, the
former attractors. Subsequent cell assemblies may be both disjoint or partially
overlapping. It may hence be possible to use the resulting dynamics for the
generation of motor control sequences.
|
q-bio.NC cond-mat.dis-nn nlin.CD
|
shortterm synaptic plasticity stsp affects the efficiency of synaptic transmission for persistent presynaptic activities we consider attractor neural networks for which the attractors are given in the absence of stsp by cell assemblies of excitatory cliques we show that stsp may transform these attracting states into attractor relics inducing ongoing transientstate dynamics in terms of sequences of transiently activated cell assemblies the former attractors subsequent cell assemblies may be both disjoint or partially overlapping it may hence be possible to use the resulting dynamics for the generation of motor control sequences
|
[['shortterm', 'synaptic', 'plasticity', 'stsp', 'affects', 'the', 'efficiency', 'of', 'synaptic', 'transmission', 'for', 'persistent', 'presynaptic', 'activities', 'we', 'consider', 'attractor', 'neural', 'networks', 'for', 'which', 'the', 'attractors', 'are', 'given', 'in', 'the', 'absence', 'of', 'stsp', 'by', 'cell', 'assemblies', 'of', 'excitatory', 'cliques', 'we', 'show', 'that', 'stsp', 'may', 'transform', 'these', 'attracting', 'states', 'into', 'attractor', 'relics', 'inducing', 'ongoing', 'transientstate', 'dynamics', 'in', 'terms', 'of', 'sequences', 'of', 'transiently', 'activated', 'cell', 'assemblies', 'the', 'former', 'attractors', 'subsequent', 'cell', 'assemblies', 'may', 'be', 'both', 'disjoint', 'or', 'partially', 'overlapping', 'it', 'may', 'hence', 'be', 'possible', 'to', 'use', 'the', 'resulting', 'dynamics', 'for', 'the', 'generation', 'of', 'motor', 'control', 'sequences']]
|
[-0.20316999711628472, 0.20406261612507667, -0.0008646818415190165, 0.05599689367483114, -0.012052040350121947, -0.16139907416488444, 0.09493210480886173, 0.3945160131123695, -0.3366876269312023, -0.2231233104817815, 0.09513985991713356, -0.22148388344282796, -0.2726813196127845, 0.12358544965448616, -0.09682778483909135, -0.001390118108407318, 0.11743950581300881, 0.022642153264074535, 0.12243792935783698, -0.2406893601605239, 0.23915959901515324, 0.036805670585606125, 0.2787010883707758, -0.031247568889879264, 0.10022612552127831, -0.04755612293381121, 0.006593285517378168, 0.0013856000502358427, -0.05835166412629865, 0.1101203354774043, 0.2590941051200319, 0.14370330606310905, 0.268320837354922, -0.573467166091387, -0.28070192980058084, 0.2009328169911936, 0.20792560854217979, 0.09942344394333374, 0.004622771890813505, -0.27016348009007973, 0.1097082695284101, -0.10075912545537474, -0.06839890971493262, -0.12394788090630875, 0.04763941404379004, 0.137867076767629, -0.24564423927894005, 0.07520584883884741, 0.0950410360787678, 0.012201557849318935, -0.10238558538565105, -0.035930751638671196, -0.07170274652602089, 0.18746637928320076, 0.009830655861431016, -0.013245338666160683, 0.23812736479685753, -0.15600630570366814, -0.16433554499891107, 0.27884876920462964, -0.0005496193624132282, -0.1886611382303002, 0.19267805756816825, -0.11287663944700738, -0.15265247069688126, 0.16443682387266512, 0.1685963582227027, 0.041856070478948265, -0.14551937792982375, -0.030544949800369668, 0.023016328961782895, 0.17352039926777502, 0.124461751374938, 0.053973560190790304, 0.25845671726574937, 0.22464388904960028, 0.05633433724518169, 0.17451227376759462, -0.050036359107592604, -0.15223550827275695, -0.21178696511804565, -0.0352049347954792, -0.1174682196905161, 0.06815762130113748, -0.1082331544213038, -0.2084806882418119, 0.4407423886951509, 0.03734990979601107, 0.18463323524753963, 0.09276074795999083, 0.2016922286148746, 0.0365469529406055, 0.09701515704772057, 0.012793173087290027, 0.1833054044560253, 0.11315451417333232, 0.12945814000872466, -0.27848419921656886, 0.1275350279430603, 0.06708765708442245]
|
1,803.0537
|
Catalogue of >55 MeV Wide-longitude Solar Proton Events Observed by
SOHO, ACE, and the STEREOs at $\approx$1 AU during 2009-2016
|
Based on energetic particle observations made at $\approx$1 AU, we present a
catalogue of 46 wide-longitude (>45{\deg}) solar energetic particle (SEP)
events detected at multiple locations during 2009-2016. The particle kinetic
energies of interest were chosen as >55 MeV for protons and 0.18-0.31 MeV for
electrons. We make use of proton data from the Solar and Heliospheric
Observatory/Energetic and Relativistic Nuclei and Electron experiment
(SOHO/ERNE) and the Solar Terrestrial Relations Observatory/High Energy
Telescopes (STEREO/HET), together with electron data from the Advanced
Composition Explorer/Electron, Proton, and Alpha Monitor (ACE/EPAM) and the
STEREO/Solar Electron and Proton Telescopes (SEPT). We consider soft X-ray data
from the Geostationary Operational Environmental Satellites (GOES) and coronal
mass ejection (CME) observations made with the SOHO/Large Angle and
Spectrometric Coronagraph (LASCO) and STEREO/Coronagraphs 1 and 2 (COR1, COR2)
to establish the probable associations between SEP events and the related solar
phenomena. Event onset times and peak intensities are determined; velocity
dispersion analysis (VDA) and time-shifting analysis (TSA) are performed for
protons; TSA is performed for electrons. In our event sample, there is a
tendency for the highest peak intensities to occur when the observer is
magnetically connected to solar regions west of the flare. Our estimates for
the mean event width, derived as the standard deviation of a Gaussian curve
modelling the SEP intensities (protons $\approx$44{\deg}, electrons
$\approx$50{\deg}), largely agree with previous results for lower-energy SEPs.
SEP release times with respect to event flares, as well as the event rise
times, show no simple dependence on the observer's connection angle, suggesting
that...
|
physics.space-ph
|
based on energetic particle observations made at approx1 au we present a catalogue of 46 widelongitude 45deg solar energetic particle sep events detected at multiple locations during 20092016 the particle kinetic energies of interest were chosen as 55 mev for protons and 018031 mev for electrons we make use of proton data from the solar and heliospheric observatoryenergetic and relativistic nuclei and electron experiment sohoerne and the solar terrestrial relations observatoryhigh energy telescopes stereohet together with electron data from the advanced composition explorerelectron proton and alpha monitor aceepam and the stereosolar electron and proton telescopes sept we consider soft xray data from the geostationary operational environmental satellites goes and coronal mass ejection cme observations made with the soholarge angle and spectrometric coronagraph lasco and stereocoronagraphs 1 and 2 cor1 cor2 to establish the probable associations between sep events and the related solar phenomena event onset times and peak intensities are determined velocity dispersion analysis vda and timeshifting analysis tsa are performed for protons tsa is performed for electrons in our event sample there is a tendency for the highest peak intensities to occur when the observer is magnetically connected to solar regions west of the flare our estimates for the mean event width derived as the standard deviation of a gaussian curve modelling the sep intensities protons approx44deg electrons approx50deg largely agree with previous results for lowerenergy seps sep release times with respect to event flares as well as the event rise times show no simple dependence on the observers connection angle suggesting that
|
[['based', 'on', 'energetic', 'particle', 'observations', 'made', 'at', 'approx1', 'au', 'we', 'present', 'a', 'catalogue', 'of', '46', 'widelongitude', '45deg', 'solar', 'energetic', 'particle', 'sep', 'events', 'detected', 'at', 'multiple', 'locations', 'during', '20092016', 'the', 'particle', 'kinetic', 'energies', 'of', 'interest', 'were', 'chosen', 'as', '55', 'mev', 'for', 'protons', 'and', '018031', 'mev', 'for', 'electrons', 'we', 'make', 'use', 'of', 'proton', 'data', 'from', 'the', 'solar', 'and', 'heliospheric', 'observatoryenergetic', 'and', 'relativistic', 'nuclei', 'and', 'electron', 'experiment', 'sohoerne', 'and', 'the', 'solar', 'terrestrial', 'relations', 'observatoryhigh', 'energy', 'telescopes', 'stereohet', 'together', 'with', 'electron', 'data', 'from', 'the', 'advanced', 'composition', 'explorerelectron', 'proton', 'and', 'alpha', 'monitor', 'aceepam', 'and', 'the', 'stereosolar', 'electron', 'and', 'proton', 'telescopes', 'sept', 'we', 'consider', 'soft', 'xray', 'data', 'from', 'the', 'geostationary', 'operational', 'environmental', 'satellites', 'goes', 'and', 'coronal', 'mass', 'ejection', 'cme', 'observations', 'made', 'with', 'the', 'soholarge', 'angle', 'and', 'spectrometric', 'coronagraph', 'lasco', 'and', 'stereocoronagraphs', '1', 'and', '2', 'cor1', 'cor2', 'to', 'establish', 'the', 'probable', 'associations', 'between', 'sep', 'events', 'and', 'the', 'related', 'solar', 'phenomena', 'event', 'onset', 'times', 'and', 'peak', 'intensities', 'are', 'determined', 'velocity', 'dispersion', 'analysis', 'vda', 'and', 'timeshifting', 'analysis', 'tsa', 'are', 'performed', 'for', 'protons', 'tsa', 'is', 'performed', 'for', 'electrons', 'in', 'our', 'event', 'sample', 'there', 'is', 'a', 'tendency', 'for', 'the', 'highest', 'peak', 'intensities', 'to', 'occur', 'when', 'the', 'observer', 'is', 'magnetically', 'connected', 'to', 'solar', 'regions', 'west', 'of', 'the', 'flare', 'our', 'estimates', 'for', 'the', 'mean', 'event', 'width', 'derived', 'as', 'the', 'standard', 'deviation', 'of', 'a', 'gaussian', 'curve', 'modelling', 'the', 'sep', 'intensities', 'protons', 'approx44deg', 'electrons', 'approx50deg', 'largely', 'agree', 'with', 'previous', 'results', 'for', 'lowerenergy', 'seps', 'sep', 'release', 'times', 'with', 'respect', 'to', 'event', 'flares', 'as', 'well', 'as', 'the', 'event', 'rise', 'times', 'show', 'no', 'simple', 'dependence', 'on', 'the', 'observers', 'connection', 'angle', 'suggesting', 'that']]
|
[-0.0536286938368293, 0.23349613484154252, -0.015560277703183668, 0.17214686624967368, -0.03527458207878196, -0.07873043518368761, 0.035670194931583646, 0.4285283770120929, -0.15441290704354282, -0.420435333674306, 0.024031335249861296, -0.359246795809226, -0.009986619292585939, 0.24253837986338553, -0.0036616229486686213, 0.019102601715796648, 0.153132030922908, -0.022669956054530822, -0.04682157440018819, -0.12471494934049247, 0.21209597351209647, 0.1755756992634018, 0.20457253399316544, 0.010151654754002643, 0.14259867247940453, 0.0005810535292489907, -0.05051746218534255, -0.03701182804357858, -0.11833013589422668, 0.03938020386545317, 0.2144962884533629, 0.10499572845888727, 0.1600216041039292, -0.4304173506311955, -0.20141996113188687, 0.014749765010941544, 0.11788586673322958, -0.03277734332871738, -0.03950018076613687, -0.29168721435422945, 0.008824626699572912, -0.15121853932998922, -0.1719307149353211, 0.08342161565758441, 0.040495391544184564, 0.07630914552309723, -0.2871205483183817, 0.09934147676633126, -0.029214532641069234, 0.10282304288949741, -0.11045783909742908, -0.10568875755535999, -0.04531414108255058, 0.08478881269005901, 0.14339002838009515, 0.06337317956205259, 0.20112952464087694, -0.035562259373120936, -0.10056219478339003, 0.3652156667205133, 0.007264551796678285, -0.0201986745221937, 0.1801781285220734, -0.24271044531959748, -0.13159180048722852, 0.2104884109329509, 0.15876929955331823, 0.06289611169838427, -0.14691736051984516, -0.01693864878331246, 0.008768174866283382, 0.1672811255571835, 0.09700286619119929, 0.011101235167521968, 0.23049244991457665, 0.12318774802397568, 0.04676361329692565, 0.04013741376365194, -0.287551327171609, -0.026711544796149917, -0.2739407459694084, -0.12150950702827101, -0.10854969615185703, 0.05437271296690552, -0.08611034175555687, -0.10788875029886087, 0.37226967450131665, 0.14711477985000046, 0.20173787481272248, -0.0024406194505799147, 0.27685812101488616, 0.07298578830232744, 0.028630928454514395, 0.12029913201096464, 0.3106526191204541, 0.14338259296319275, 0.18901023466653602, -0.20028741912889475, 0.07266148184272825, 0.03718691923341296]
|
1,803.05371
|
Two remarks about multicurve graphs on infinite-type surfaces
|
After Fossas-Parlier, we consider two graphs $\mathcal{G}_{0}(S)$ and
$\mathcal{G}_{\infty}(S)$, constructed from multicurves on connected,
orientable surfaces of infinite-type. Our first result asserts that
$\mathcal{G}_{\infty}(S)$ has finite diameter, which extends a result of
Fossas-Parlier. Next, we prove that the group of (label-preserving)
automorphisms of $\mathcal{G}_{0}(S)$ is the extended mapping class group of
$S$, which may be regarded as an infinite-type analog of a theorem of Margalit
about pants complexes.
|
math.GT
|
after fossasparlier we consider two graphs mathcalg_0s and mathcalg_inftys constructed from multicurves on connected orientable surfaces of infinitetype our first result asserts that mathcalg_inftys has finite diameter which extends a result of fossasparlier next we prove that the group of labelpreserving automorphisms of mathcalg_0s is the extended mapping class group of s which may be regarded as an infinitetype analog of a theorem of margalit about pants complexes
|
[['after', 'fossasparlier', 'we', 'consider', 'two', 'graphs', 'mathcalg_0s', 'and', 'mathcalg_inftys', 'constructed', 'from', 'multicurves', 'on', 'connected', 'orientable', 'surfaces', 'of', 'infinitetype', 'our', 'first', 'result', 'asserts', 'that', 'mathcalg_inftys', 'has', 'finite', 'diameter', 'which', 'extends', 'a', 'result', 'of', 'fossasparlier', 'next', 'we', 'prove', 'that', 'the', 'group', 'of', 'labelpreserving', 'automorphisms', 'of', 'mathcalg_0s', 'is', 'the', 'extended', 'mapping', 'class', 'group', 'of', 's', 'which', 'may', 'be', 'regarded', 'as', 'an', 'infinitetype', 'analog', 'of', 'a', 'theorem', 'of', 'margalit', 'about', 'pants', 'complexes']]
|
[-0.17635026114482072, 0.09344802189439032, -0.13607363517005597, 0.03364606536061113, -0.05319385699206783, -0.1075489099678253, 0.011478949811369661, 0.3390856646564639, -0.2893616201416139, -0.24764275615434012, 0.10015702868000634, -0.23819345374020837, -0.16402488596354342, 0.2382140778260486, -0.1541088885898071, -0.07720169761488514, 0.0824962364614851, 0.09476788072366148, -0.04365961096670118, -0.23234103767636924, 0.3927278308528325, -0.08431427269392917, 0.16965120018369728, 0.08745349499006425, 0.13393349734495483, 0.04440449672420659, -0.030113060230794342, 0.04535060090523574, -0.13422708152610274, 0.13726294537510483, 0.2726915481109773, 0.0721110186817485, 0.18475186612997804, -0.37097734011589517, -0.21881715344986127, 0.18044833329716517, 0.09941186955679328, 0.046221618536829705, -0.03466435121428672, -0.28557627948541797, 0.13098031575716432, -0.15848222075991572, -0.18751085376847657, 0.03241870065610255, 0.04163923402947764, -0.0020366013951359256, -0.19630478825908335, -0.010252930193899138, 0.19208932222588168, 0.0504593750304212, -0.006368802267036611, -0.11138468414484974, -0.08325645389531049, 0.13999787724066165, -0.0375135408605509, 0.06685573635848178, 0.060554305497076244, -0.020444195537317182, -0.15683270460595528, 0.3689376133749442, -0.09762417211107188, -0.14427339213509713, 0.12477149088836965, -0.11006513317566245, -0.20703648624851578, 0.13065812894473633, 0.12378487142644101, 0.19963824221744172, -0.06162565580058482, 0.15260037112767028, -0.18823766163099678, 0.11777148288374226, 0.11652362926472579, -0.03364906143096666, 0.13351476779057375, 0.15792201201791964, 0.15270529759507026, 0.1919298674441844, 0.001947609344384663, -0.009376775616058899, -0.3382181918188449, -0.2171858136763706, -0.1955168676457458, 0.17209911931516422, -0.09349315352864646, -0.18279423841064976, 0.37283618588961903, 0.0360991965938029, 0.1876903756431514, 0.12688600065021385, 0.15399831753870052, 0.008447634048699852, 0.10176288962904964, 0.08439363369102319, 0.1253174790331433, 0.23947518933263998, -0.10241060413330072, -0.10269228091572351, 0.00138213531294417, 0.22724508091567025]
|
1,803.05372
|
Deletion in abstract Voronoi diagrams in expected linear time and
related problems
|
Updating an abstract Voronoi diagram after deletion of one site in linear
time has been a well-known open problem; similarly, for concrete Voronoi
diagrams of non-point sites. In this paper, we present an expected linear-time
algorithm to update an abstract Voronoi diagram after deletion of one site. We
introduce the concept of a Voronoi-like diagram, a relaxed version of an
abstract Voronoi construct that has a structure similar to an ordinary Voronoi
diagram, without, however, being one. We formalize the concept, and prove that
it is robust under insertion, therefore, enabling its use in incremental
constructions. The time-complexity analysis of the resulting simple randomized
incremental construction is non-standard, and interesting in its own right,
because the intermediate Voronoi-like structures are order-dependent. We
further extend the approach to compute the following structures in expected
linear time: the order-(k+1) subdivision within an order-k Voronoi region, and
the farthest abstract Voronoi diagram after the order of its regions at
infinity is known.
|
cs.CG
|
updating an abstract voronoi diagram after deletion of one site in linear time has been a wellknown open problem similarly for concrete voronoi diagrams of nonpoint sites in this paper we present an expected lineartime algorithm to update an abstract voronoi diagram after deletion of one site we introduce the concept of a voronoilike diagram a relaxed version of an abstract voronoi construct that has a structure similar to an ordinary voronoi diagram without however being one we formalize the concept and prove that it is robust under insertion therefore enabling its use in incremental constructions the timecomplexity analysis of the resulting simple randomized incremental construction is nonstandard and interesting in its own right because the intermediate voronoilike structures are orderdependent we further extend the approach to compute the following structures in expected linear time the orderk1 subdivision within an orderk voronoi region and the farthest abstract voronoi diagram after the order of its regions at infinity is known
|
[['updating', 'an', 'abstract', 'voronoi', 'diagram', 'after', 'deletion', 'of', 'one', 'site', 'in', 'linear', 'time', 'has', 'been', 'a', 'wellknown', 'open', 'problem', 'similarly', 'for', 'concrete', 'voronoi', 'diagrams', 'of', 'nonpoint', 'sites', 'in', 'this', 'paper', 'we', 'present', 'an', 'expected', 'lineartime', 'algorithm', 'to', 'update', 'an', 'abstract', 'voronoi', 'diagram', 'after', 'deletion', 'of', 'one', 'site', 'we', 'introduce', 'the', 'concept', 'of', 'a', 'voronoilike', 'diagram', 'a', 'relaxed', 'version', 'of', 'an', 'abstract', 'voronoi', 'construct', 'that', 'has', 'a', 'structure', 'similar', 'to', 'an', 'ordinary', 'voronoi', 'diagram', 'without', 'however', 'being', 'one', 'we', 'formalize', 'the', 'concept', 'and', 'prove', 'that', 'it', 'is', 'robust', 'under', 'insertion', 'therefore', 'enabling', 'its', 'use', 'in', 'incremental', 'constructions', 'the', 'timecomplexity', 'analysis', 'of', 'the', 'resulting', 'simple', 'randomized', 'incremental', 'construction', 'is', 'nonstandard', 'and', 'interesting', 'in', 'its', 'own', 'right', 'because', 'the', 'intermediate', 'voronoilike', 'structures', 'are', 'orderdependent', 'we', 'further', 'extend', 'the', 'approach', 'to', 'compute', 'the', 'following', 'structures', 'in', 'expected', 'linear', 'time', 'the', 'orderk1', 'subdivision', 'within', 'an', 'orderk', 'voronoi', 'region', 'and', 'the', 'farthest', 'abstract', 'voronoi', 'diagram', 'after', 'the', 'order', 'of', 'its', 'regions', 'at', 'infinity', 'is', 'known']]
|
[-0.09542815888866404, 0.07964361997087681, -0.12085479071446328, 0.10282206936014368, -0.10837636534949835, -0.11155432625673711, 0.12534644824962568, 0.3913276879871382, -0.3275433912802535, -0.24111943471516611, 0.10084709343043616, -0.23601236324492086, -0.1766266263431952, 0.12096983891369516, -0.11929928040138557, -0.030415111794239617, 0.030671629818197623, 0.07798394771908776, -0.07252892601094503, -0.27479643928612096, 0.2798457736668142, 0.06926475288464298, 0.22147052734648173, -0.0047372892337609555, 0.07806166987814586, 0.0417292007477954, -0.027963123162338933, 0.05977234250756829, -0.1751697763961429, 0.0876166047759559, 0.22958862273423356, 0.14661946083725536, 0.2543841868423845, -0.40042889379908014, -0.12206499104788143, 0.11803467988399081, 0.17381154193212808, 0.12457615024074205, -0.04974500418351845, -0.23033588680238287, 0.09356353039075208, -0.15536594923542918, -0.158753057112151, -0.04719275471760267, 0.01812898927321068, -0.005586914020395967, -0.22407540215195534, -0.0008705590934127192, 0.07635515362990997, 0.05327040109123233, -0.02553770235736701, -0.10537877865725115, -0.003691766620318912, 0.12113468967307406, -0.07277816180228197, 0.057091839251969055, 0.08232503515797891, -0.09006181615110062, -0.1500420176477136, 0.37634160025398944, 0.024094453472732508, -0.16106834950491408, 0.16241343684134935, -0.08181763542933931, -0.1822313792484848, 0.1479563868097678, 0.11369755600808966, 0.12179110279966947, -0.14937847104738466, 0.13082233953320632, -0.060148830328113106, 0.12439150321282612, 0.07462533992933275, -0.004280727162155547, 0.1328964547660862, 0.1860726806821443, 0.11826215555914972, 0.24449138369859208, -0.05142135568599723, -0.1269974125596353, -0.2921945302168061, -0.1625538785734488, -0.1475423779309126, -0.04889774609486428, -0.16913630376848807, -0.24637940848950604, 0.37521767393461886, 0.12484427543704787, 0.1911660707030737, 0.07683849922098408, 0.2932291978475037, 0.08532081501590842, 0.05406626953177531, 0.07633639880621075, 0.14742620115439536, 0.10700471636904049, 0.09036422148936346, -0.18041277671810477, 0.08327722955123769, 0.18945540849095846]
|
1,803.05373
|
Rigid reflections and Kac--Moody algebras
|
Given any Coxeter group, we define rigid reflections and rigid roots using
non-self-intersecting curves on a Riemann surface with labeled curves. When the
Coxeter group arises from an acyclic quiver, they are related to the rigid
representations of the quiver. For a family of rank 3 Coxeter groups, we show
that there is a surjective map from the set of reduced positive roots of a rank
2 Kac--Moody algebra onto the set of rigid reflections. We conjecture that this
map is bijective.
|
math.RT math.CO math.RA
|
given any coxeter group we define rigid reflections and rigid roots using nonselfintersecting curves on a riemann surface with labeled curves when the coxeter group arises from an acyclic quiver they are related to the rigid representations of the quiver for a family of rank 3 coxeter groups we show that there is a surjective map from the set of reduced positive roots of a rank 2 kacmoody algebra onto the set of rigid reflections we conjecture that this map is bijective
|
[['given', 'any', 'coxeter', 'group', 'we', 'define', 'rigid', 'reflections', 'and', 'rigid', 'roots', 'using', 'nonselfintersecting', 'curves', 'on', 'a', 'riemann', 'surface', 'with', 'labeled', 'curves', 'when', 'the', 'coxeter', 'group', 'arises', 'from', 'an', 'acyclic', 'quiver', 'they', 'are', 'related', 'to', 'the', 'rigid', 'representations', 'of', 'the', 'quiver', 'for', 'a', 'family', 'of', 'rank', '3', 'coxeter', 'groups', 'we', 'show', 'that', 'there', 'is', 'a', 'surjective', 'map', 'from', 'the', 'set', 'of', 'reduced', 'positive', 'roots', 'of', 'a', 'rank', '2', 'kacmoody', 'algebra', 'onto', 'the', 'set', 'of', 'rigid', 'reflections', 'we', 'conjecture', 'that', 'this', 'map', 'is', 'bijective']]
|
[-0.17881906377833065, 0.12498895256803513, -0.06691327034609347, 0.008109666664073834, -0.13828251857265103, -0.1466606613930042, 0.012954412766436978, 0.3820759135684589, -0.38973982411822894, -0.18640650915572557, 0.09257098018736919, -0.2819648953126289, -0.20328590458417992, 0.17799227871000767, -0.22030109839468467, -0.05065801981609405, 0.09308066020333548, 0.12437775470429986, -0.10713030820536404, -0.2893944203444734, 0.4249957485987646, -0.1116748484214995, 0.2103062638922072, 0.0018002789285851688, 0.16409883637935285, 0.04479240585209393, -0.007644856757507092, 0.012433511102799236, -0.11997929702760657, 0.13743677723971082, 0.32672319805147354, 0.09464659848500316, 0.12013786823045826, -0.36283828663957735, -0.09309690146105046, 0.24317165151829037, 0.09994214963417773, 0.06388913226745478, -0.05942269893527803, -0.2661305343527801, 0.09777298501533706, -0.17222117512804888, -0.17133534666741404, 0.009895517442534427, 0.09845537907250862, -0.022620818350554968, -0.2132042908541313, 0.0004870730520385068, 0.06013753658115137, 0.19108910621257452, -0.08287630981493105, -0.09822389163167738, -0.11723004234386836, 0.12226870534948653, -0.05141825289692639, 0.07040330999752326, 0.09288170119951956, -0.10312421950114119, -0.12490244850334598, 0.4102943307718705, 0.03108915799615405, -0.2749771861268616, 0.16942570654380068, -0.18142796211546605, -0.16923184978503097, 0.1831189762437489, 0.11891466119076784, 0.10573514728741606, 0.01791296197614695, 0.16267306572209658, -0.20635565433923792, 0.10533409271951447, 0.11994554347744803, -0.1506121393361288, 0.16660771982335462, 0.06372706533875316, 0.04871434135158069, 0.13999984842986324, 0.038861769322510356, 0.04435529925849107, -0.35020247397081156, -0.18072133403975607, -0.13780693599965604, 0.12909217136798473, -0.14913959558978648, -0.1919500788293279, 0.3806894772981362, 0.05418214676674546, 0.17438885737664817, 0.18101865663079592, 0.16069672543771293, 0.06932580836504845, 0.10361551226502876, 0.04587246418588797, 0.066404397434714, 0.21699896692184778, -0.13807567126946751, -0.12913730400387288, -0.05213890706825002, 0.2445781424005584]
|
1,803.05374
|
On the notion of parallel transport on $\sf RCD$ spaces
|
We propose a general notion of parallel transport on $\sf RCD$ spaces, prove
an unconditioned uniqueness result and existence under suitable assumptions on
the space.
|
math.MG
|
we propose a general notion of parallel transport on sf rcd spaces prove an unconditioned uniqueness result and existence under suitable assumptions on the space
|
[['we', 'propose', 'a', 'general', 'notion', 'of', 'parallel', 'transport', 'on', 'sf', 'rcd', 'spaces', 'prove', 'an', 'unconditioned', 'uniqueness', 'result', 'and', 'existence', 'under', 'suitable', 'assumptions', 'on', 'the', 'space']]
|
[-0.16915400847792625, 0.03935174361395184, -0.10122295551002025, 0.1275376570224762, -0.07186993673443794, -0.07924783175811172, 0.05212461473420262, 0.3974335426837206, -0.31344644010066985, -0.1622974058240652, 0.1295594554953277, -0.12811348523944616, -0.12138833828270436, 0.19417304217815398, -0.1565423246100545, 0.004912581704556942, 0.06831945966929197, 0.024435970932245255, -0.13932468995451927, -0.271607723981142, 0.44162443101406096, -0.06629570946097374, 0.3847987215220928, 0.054536052893381565, 0.15451942548155784, 0.10960735844448209, 0.008605418731458486, -0.011970993486465886, -0.2718234511837363, 0.13085091695189477, 0.14256669893860818, 0.1100403359439224, 0.3259584623575211, -0.41484768599271776, -0.16477665808051825, 0.1482385483942926, 0.043854506760835646, 0.01862112160772085, -0.08344992978498339, -0.2863607343286276, 0.11641145955771208, -0.059822113141417506, -0.1557187996059656, -0.16640125833451747, -0.03440285831689835, 0.028969201147556304, -0.3216594170033932, 0.03949827052652836, 0.1610742188990116, 0.06345519002526999, -0.1426873858086765, -0.012689195065759122, 0.02842541757039726, -0.034463087078183886, 0.014334852993488311, 0.029728350015357136, 0.10841410191729665, -0.03955054022371769, -0.14270891156047583, 0.31335785567760466, -0.08327351901680231, -0.3078312022984028, 0.23278771862387657, -0.06843146800994873, -0.21124787583947183, 0.042060088515281674, 0.14207286993041635, 0.2075592005997896, -0.09556988973170519, 0.15264616828178987, -0.1595889922976494, 0.06873109474778176, 0.06456364091485739, 0.09262699435697869, 0.06698994778096676, 0.18769874403253198, 0.2638094105198979, 0.1517057039216161, -0.014165965970605612, -0.10310746772913262, -0.36421928465366366, -0.19040391664020717, -0.10790753498673439, 0.16991872042417527, -0.14905903397069778, -0.20394000127911568, 0.29259664690122006, 0.13716195657849312, 0.14116022311151027, 0.17826592825353146, 0.2390847147256136, 0.11339222975075244, -0.06091379210352898, 0.1243887983262539, 0.15365527864545583, 0.1828547975420952, 0.10296634584665298, -0.15249184312298894, 0.15952004691585897, 0.17440360590815543]
|
1,803.05375
|
Surface Composition of (99942) Apophis
|
On April 13, 2029, near-Earth asteroid (NEA) (99942) Apophis will pass at a
distance of 6 Earth radii from Earth. This event will provide researchers with
a unique opportunity to study the effects of tidal forces experienced by an
asteroid during a close encounter with a terrestrial planet. Binzel et al.
(2010) predicted that close flybys of terrestrial planets by NEAs would cause
resurfacing of their regolith due to seismic shaking. In this work we present
the best pre-encounter near-infrared spectra of Apophis obtained so far. These
new data were obtained during the 2013 apparition using the NASA Infrared
Telescope Facility (IRTF). We found that our spectral data is consistent with
previous observations by Binzel et al. (2009) but with a much higher
signal-to-noise ratio. Spectral band parameters were extracted from the spectra
and were used to determine the composition of the asteroid. Using a naive Bayes
classifier, we computed the likelihood of Apophis being an LL chondrite to be
>99% based on mol% of Fa vs. Fs. Using the same method, we estimated a
probability of 89% for Apophis being an LL chondrite based on ol/(ol+px) and
Fs. The results from the dynamical model indicate that the most likely source
region for Apophis is the nu6 resonance in the inner main belt. Data presented
in this study (especially Band I depth) could serve as a baseline to verify
seismic shaking during the 2029 encounter.
|
astro-ph.EP astro-ph.IM
|
on april 13 2029 nearearth asteroid nea 99942 apophis will pass at a distance of 6 earth radii from earth this event will provide researchers with a unique opportunity to study the effects of tidal forces experienced by an asteroid during a close encounter with a terrestrial planet binzel et al 2010 predicted that close flybys of terrestrial planets by neas would cause resurfacing of their regolith due to seismic shaking in this work we present the best preencounter nearinfrared spectra of apophis obtained so far these new data were obtained during the 2013 apparition using the nasa infrared telescope facility irtf we found that our spectral data is consistent with previous observations by binzel et al 2009 but with a much higher signaltonoise ratio spectral band parameters were extracted from the spectra and were used to determine the composition of the asteroid using a naive bayes classifier we computed the likelihood of apophis being an ll chondrite to be 99 based on mol of fa vs fs using the same method we estimated a probability of 89 for apophis being an ll chondrite based on ololpx and fs the results from the dynamical model indicate that the most likely source region for apophis is the nu6 resonance in the inner main belt data presented in this study especially band i depth could serve as a baseline to verify seismic shaking during the 2029 encounter
|
[['on', 'april', '13', '2029', 'nearearth', 'asteroid', 'nea', '99942', 'apophis', 'will', 'pass', 'at', 'a', 'distance', 'of', '6', 'earth', 'radii', 'from', 'earth', 'this', 'event', 'will', 'provide', 'researchers', 'with', 'a', 'unique', 'opportunity', 'to', 'study', 'the', 'effects', 'of', 'tidal', 'forces', 'experienced', 'by', 'an', 'asteroid', 'during', 'a', 'close', 'encounter', 'with', 'a', 'terrestrial', 'planet', 'binzel', 'et', 'al', '2010', 'predicted', 'that', 'close', 'flybys', 'of', 'terrestrial', 'planets', 'by', 'neas', 'would', 'cause', 'resurfacing', 'of', 'their', 'regolith', 'due', 'to', 'seismic', 'shaking', 'in', 'this', 'work', 'we', 'present', 'the', 'best', 'preencounter', 'nearinfrared', 'spectra', 'of', 'apophis', 'obtained', 'so', 'far', 'these', 'new', 'data', 'were', 'obtained', 'during', 'the', '2013', 'apparition', 'using', 'the', 'nasa', 'infrared', 'telescope', 'facility', 'irtf', 'we', 'found', 'that', 'our', 'spectral', 'data', 'is', 'consistent', 'with', 'previous', 'observations', 'by', 'binzel', 'et', 'al', '2009', 'but', 'with', 'a', 'much', 'higher', 'signaltonoise', 'ratio', 'spectral', 'band', 'parameters', 'were', 'extracted', 'from', 'the', 'spectra', 'and', 'were', 'used', 'to', 'determine', 'the', 'composition', 'of', 'the', 'asteroid', 'using', 'a', 'naive', 'bayes', 'classifier', 'we', 'computed', 'the', 'likelihood', 'of', 'apophis', 'being', 'an', 'll', 'chondrite', 'to', 'be', '99', 'based', 'on', 'mol', 'of', 'fa', 'vs', 'fs', 'using', 'the', 'same', 'method', 'we', 'estimated', 'a', 'probability', 'of', '89', 'for', 'apophis', 'being', 'an', 'll', 'chondrite', 'based', 'on', 'ololpx', 'and', 'fs', 'the', 'results', 'from', 'the', 'dynamical', 'model', 'indicate', 'that', 'the', 'most', 'likely', 'source', 'region', 'for', 'apophis', 'is', 'the', 'nu6', 'resonance', 'in', 'the', 'inner', 'main', 'belt', 'data', 'presented', 'in', 'this', 'study', 'especially', 'band', 'i', 'depth', 'could', 'serve', 'as', 'a', 'baseline', 'to', 'verify', 'seismic', 'shaking', 'during', 'the', '2029', 'encounter']]
|
[-0.029014278242054086, 0.11721165422478275, -0.1204271112055255, 0.04771441754707907, -0.08126806018925789, -0.055400717321437046, 0.07856901563429393, 0.35020431506837535, -0.1741039074025053, -0.39148079082330006, 0.0889472788929617, -0.3076055141277293, -0.1275722850442458, 0.2193689662780942, -0.14091025080452732, 0.03575431597846934, 0.15286800794081531, -0.028067106875450686, -0.008088213089618705, -0.25465477177172774, 0.2234185692619405, 0.18149855244271934, 0.14276182011335006, -0.024731663797492497, 0.05733387400370049, -0.03542524474870979, -0.027958259482979458, -0.054347365792108394, -0.18790841126327804, 0.08368631734902787, 0.2435357166988015, 0.12787843922463557, 0.21173171564870968, -0.36886221052219087, -0.19265268466427413, 0.046722461390866235, 0.0832365504008296, 0.03678234303447231, -0.01442034712059296, -0.33065155354521486, 0.06667433326027125, -0.2043904386357301, -0.15610417325269038, 0.03570108972768435, 0.05856923449736757, 0.0022075957833574368, -0.2675394576926453, 0.05885520592952768, 0.03012954081051971, 0.1378569407030367, -0.13452358700685266, -0.18739905382076708, -0.0577007729092983, 0.1022770476515572, 0.04544604629124953, 0.04468082768134136, 0.14324204353257441, -0.02394002088958509, -0.05924851384857654, 0.3942957791046072, -0.06835893518639664, 0.0014951087019016219, 0.21757925684779233, -0.18985423784599537, -0.11602799670420523, 0.1637467663967982, 0.18741062457442412, 0.10294144780526304, -0.17483683411055842, 0.004156085601599855, -0.025955378969446715, 0.1841145835052698, 0.09480537719921106, -0.029986103367792744, 0.26972753489509416, 0.1449035104109436, 0.012042866290435513, 0.08776039777882795, -0.25100955013762843, -0.001469914600925727, -0.20057628628435648, -0.11046104152792861, -0.20967924853928116, 0.028700752438515678, -0.05368381773321464, -0.08616946280225475, 0.3494368651891764, 0.17057111310080075, 0.21485482649002066, 0.01765028005127564, 0.2510536978455085, 0.04584156803221593, 0.08273911120620771, 0.11200261414329657, 0.36911333434315574, 0.04953089630495932, 0.0889588724483505, -0.20522043857430944, 0.09046229422510339, 0.023265342751486052]
|
1,803.05376
|
One Net Fits All: A unifying semantics of Dynamic Fault Trees using
GSPNs
|
Dynamic Fault Trees (DFTs) are a prominent model in reliability engineering.
They are strictly more expressive than static fault trees, but this comes at a
price: their interpretation is non-trivial and leaves quite some freedom. This
paper presents a GSPN semantics for DFTs. This semantics is rather simple and
compositional. The key feature is that this GSPN semantics unifies all existing
DFT semantics from the literature. All semantic variants can be obtained by
choosing appropriate priorities and treatment of non-determinism.
|
cs.SE
|
dynamic fault trees dfts are a prominent model in reliability engineering they are strictly more expressive than static fault trees but this comes at a price their interpretation is nontrivial and leaves quite some freedom this paper presents a gspn semantics for dfts this semantics is rather simple and compositional the key feature is that this gspn semantics unifies all existing dft semantics from the literature all semantic variants can be obtained by choosing appropriate priorities and treatment of nondeterminism
|
[['dynamic', 'fault', 'trees', 'dfts', 'are', 'a', 'prominent', 'model', 'in', 'reliability', 'engineering', 'they', 'are', 'strictly', 'more', 'expressive', 'than', 'static', 'fault', 'trees', 'but', 'this', 'comes', 'at', 'a', 'price', 'their', 'interpretation', 'is', 'nontrivial', 'and', 'leaves', 'quite', 'some', 'freedom', 'this', 'paper', 'presents', 'a', 'gspn', 'semantics', 'for', 'dfts', 'this', 'semantics', 'is', 'rather', 'simple', 'and', 'compositional', 'the', 'key', 'feature', 'is', 'that', 'this', 'gspn', 'semantics', 'unifies', 'all', 'existing', 'dft', 'semantics', 'from', 'the', 'literature', 'all', 'semantic', 'variants', 'can', 'be', 'obtained', 'by', 'choosing', 'appropriate', 'priorities', 'and', 'treatment', 'of', 'nondeterminism']]
|
[-0.14424224622925977, 0.07753310624975711, -0.09626321406540228, 0.1261842668391182, -0.16928158435039223, -0.1873020535276737, 0.0671784833233687, 0.42170499749481677, -0.28372723520733417, -0.2760049097239971, 0.0636580134552787, -0.24659636474680155, -0.1387608975113835, 0.13740680534101557, -0.16759871711255983, 0.052297091198852286, 0.06361382924624195, 0.02469401168054901, -0.032161118845397144, -0.216460463963449, 0.28329591738875026, 0.07166618889023084, 0.25961620646303346, 0.02352288290785509, 0.03522913072956726, 0.016019318625330924, -0.030010251465137118, 0.0680232457787497, -0.07249348942759752, 0.16509467729483732, 0.38675189736532045, 0.21419033212587238, 0.2892969397769775, -0.39806463753338905, -0.2181381166956271, 0.06138852940930519, 0.0890604306536261, 0.12706079835188575, 0.025125675414710714, -0.266316379327327, 0.09769380864163395, -0.18564221361884847, -0.011179464508313686, -0.14637667804490775, 0.015808401023969056, -0.03205106902023545, -0.19270786489651073, -0.0021705422957893463, 0.17622642271453515, 0.1120913790538907, -0.03612704293045681, -0.1451794703199994, -0.028073942387709393, 0.06774332915083506, 0.004658117328654043, 0.005871414148714393, 0.13240018414799123, -0.09319275583839044, -0.1704444294096902, 0.40199980027973653, 0.04535624758773338, -0.205459791434987, 0.22585181774629745, -0.03250047145556891, -0.19792104625958018, 0.12356689057487528, 0.0661142916418612, 0.10923811292741448, -0.2017705428384943, 0.10034792397418642, -0.01531433422351256, 0.18179183297324925, 0.12362245116382838, 0.06710417346912437, 0.2134296969277784, 0.21834665233036504, 0.07260662596672773, 0.14429214968549786, 0.03853571960935369, -0.12251317969639786, -0.2773141037207097, -0.12474651672819163, -0.08360488951730076, -0.04830498907249421, -0.13958420124781695, -0.1947657323180465, 0.40184703685808926, 0.21421113584765408, 0.13657061110134236, 0.18539334256201984, 0.37703845659270885, 0.10489512382191606, 0.07922522902663331, 0.07249833542446141, 0.11155478913169645, 0.04537615542358253, 0.13003341591684148, -0.09252831574558514, 0.22151728578028268, 0.07025761672994121]
|
1,803.05377
|
When few survive to tell the tale: thymus and gonad as auditioning
organs: historical overview
|
Unlike other organs, the thymus and gonads generate non-uniform cell
populations, many members of which perish, and a few survive. While it is
recognized that thymic cells are 'audited' to optimize an organism's immune
repertoire, whether gametogenesis could be orchestrated similarly to favour
high quality gametes is uncertain. Ideally, such quality would be affirmed at
early stages before the commitment of extensive parental resources. A case is
here made that, along the lines of a previously proposed lymphocyte quality
control mechanism, gamete quality can be registered indirectly through
detection of incompatibilities between proteins encoded by the grandparental
DNA sequences within the parent from which haploid gametes are meiotically
derived. This 'stress test' is achieved in the same way that thymic screening
for potential immunological incompatibilities is achieved - by 'promiscuous'
expression, under the influence of the AIRE protein, of the products of genes
that are not normally specific for that organ. Consistent with this, the Aire
gene is expressed in both thymus and gonads, and AIRE deficiency impedes
function in both organs. While not excluding the subsequent emergence of hybrid
incompatibilities due to the intermixing of genomic sequences from parents
(rather than grandparents), many observations, such as the number of proteins
that are aberrantly expressed during gametogenesis, can be explained on this
basis. Indeed, promiscuous expression could have first evolved in
gamete-forming cells where incompatible proteins would be manifest as aberrant
protein aggregates that cause apoptosis. This mechanism would later have been
co-opted by thymic epithelial cells which display peptides from aggregates to
remove potentially autoreactive T cells.
|
q-bio.TO
|
unlike other organs the thymus and gonads generate nonuniform cell populations many members of which perish and a few survive while it is recognized that thymic cells are audited to optimize an organisms immune repertoire whether gametogenesis could be orchestrated similarly to favour high quality gametes is uncertain ideally such quality would be affirmed at early stages before the commitment of extensive parental resources a case is here made that along the lines of a previously proposed lymphocyte quality control mechanism gamete quality can be registered indirectly through detection of incompatibilities between proteins encoded by the grandparental dna sequences within the parent from which haploid gametes are meiotically derived this stress test is achieved in the same way that thymic screening for potential immunological incompatibilities is achieved by promiscuous expression under the influence of the aire protein of the products of genes that are not normally specific for that organ consistent with this the aire gene is expressed in both thymus and gonads and aire deficiency impedes function in both organs while not excluding the subsequent emergence of hybrid incompatibilities due to the intermixing of genomic sequences from parents rather than grandparents many observations such as the number of proteins that are aberrantly expressed during gametogenesis can be explained on this basis indeed promiscuous expression could have first evolved in gameteforming cells where incompatible proteins would be manifest as aberrant protein aggregates that cause apoptosis this mechanism would later have been coopted by thymic epithelial cells which display peptides from aggregates to remove potentially autoreactive t cells
|
[['unlike', 'other', 'organs', 'the', 'thymus', 'and', 'gonads', 'generate', 'nonuniform', 'cell', 'populations', 'many', 'members', 'of', 'which', 'perish', 'and', 'a', 'few', 'survive', 'while', 'it', 'is', 'recognized', 'that', 'thymic', 'cells', 'are', 'audited', 'to', 'optimize', 'an', 'organisms', 'immune', 'repertoire', 'whether', 'gametogenesis', 'could', 'be', 'orchestrated', 'similarly', 'to', 'favour', 'high', 'quality', 'gametes', 'is', 'uncertain', 'ideally', 'such', 'quality', 'would', 'be', 'affirmed', 'at', 'early', 'stages', 'before', 'the', 'commitment', 'of', 'extensive', 'parental', 'resources', 'a', 'case', 'is', 'here', 'made', 'that', 'along', 'the', 'lines', 'of', 'a', 'previously', 'proposed', 'lymphocyte', 'quality', 'control', 'mechanism', 'gamete', 'quality', 'can', 'be', 'registered', 'indirectly', 'through', 'detection', 'of', 'incompatibilities', 'between', 'proteins', 'encoded', 'by', 'the', 'grandparental', 'dna', 'sequences', 'within', 'the', 'parent', 'from', 'which', 'haploid', 'gametes', 'are', 'meiotically', 'derived', 'this', 'stress', 'test', 'is', 'achieved', 'in', 'the', 'same', 'way', 'that', 'thymic', 'screening', 'for', 'potential', 'immunological', 'incompatibilities', 'is', 'achieved', 'by', 'promiscuous', 'expression', 'under', 'the', 'influence', 'of', 'the', 'aire', 'protein', 'of', 'the', 'products', 'of', 'genes', 'that', 'are', 'not', 'normally', 'specific', 'for', 'that', 'organ', 'consistent', 'with', 'this', 'the', 'aire', 'gene', 'is', 'expressed', 'in', 'both', 'thymus', 'and', 'gonads', 'and', 'aire', 'deficiency', 'impedes', 'function', 'in', 'both', 'organs', 'while', 'not', 'excluding', 'the', 'subsequent', 'emergence', 'of', 'hybrid', 'incompatibilities', 'due', 'to', 'the', 'intermixing', 'of', 'genomic', 'sequences', 'from', 'parents', 'rather', 'than', 'grandparents', 'many', 'observations', 'such', 'as', 'the', 'number', 'of', 'proteins', 'that', 'are', 'aberrantly', 'expressed', 'during', 'gametogenesis', 'can', 'be', 'explained', 'on', 'this', 'basis', 'indeed', 'promiscuous', 'expression', 'could', 'have', 'first', 'evolved', 'in', 'gameteforming', 'cells', 'where', 'incompatible', 'proteins', 'would', 'be', 'manifest', 'as', 'aberrant', 'protein', 'aggregates', 'that', 'cause', 'apoptosis', 'this', 'mechanism', 'would', 'later', 'have', 'been', 'coopted', 'by', 'thymic', 'epithelial', 'cells', 'which', 'display', 'peptides', 'from', 'aggregates', 'to', 'remove', 'potentially', 'autoreactive', 't', 'cells']]
|
[-0.08068488681117496, 0.17158397386808077, -0.0363746095466473, 0.06815858385899008, -0.04785115039810924, -0.14183617596035875, 0.07554924690658116, 0.3872553612925558, -0.24937965383078806, -0.27753036436198125, 0.06675594551692832, -0.24309165953506393, -0.1958108710169614, 0.16721871246368553, -0.13572256490955756, -0.040140007124412284, 0.09636147005067938, 0.024273926976361344, 0.09292745130114347, -0.23880769314979058, 0.22928819897495567, 0.07054812635343329, 0.26842957354184105, 0.006456333743380494, 0.060650247298978804, -0.0620867965677549, 0.014075125530510548, 0.027910244001810296, -0.05864200056669097, 0.11117877343398672, 0.2954763085859646, 0.1829894291769446, 0.2967945126542057, -0.4838790034214814, -0.23913749960432965, 0.119965913178876, 0.21637793923394227, 0.11817046493501496, -0.048090862275835915, -0.2269239685756982, 0.11173606849464762, -0.1496939043072887, -0.06729010721868965, -0.0685536126767107, 0.006345177496007951, 0.04850665543912386, -0.24670728595381922, 0.12464278876740649, 0.015621170508248575, 0.0843164643599277, -0.09011449725682517, -0.12237021003838673, -0.08988763360432776, 0.20738832600251494, 0.07215540875092638, 0.03720678173959166, 0.2131888515935595, -0.12185412484839878, -0.09807994220205453, 0.35728366509732973, 0.018876187400083035, -0.19319813956870174, 0.22844618541722841, -0.12151323550784741, -0.14258606602211457, 0.15368605790144033, 0.12528973089974463, 0.09088327561085859, -0.21701257748425423, -0.02590858390224556, 0.01069362433181994, 0.18893072871116556, 0.14857912159606487, 0.023052786103082427, 0.2446393906027524, 0.15639634239691425, -0.030303751551212215, 0.09940333971549642, -0.041751301442959396, -0.057681565416468475, -0.177358344178721, -0.157413737248236, -0.13308036541918744, 0.040208691108319726, -0.04633239213682422, -0.18275484321935778, 0.3385106557089672, 0.0898701009522976, 0.18578669252671837, 0.0374386576667569, 0.22633041262596965, 0.005651306016815908, 0.18118940480702753, -0.021663581075859202, 0.18208733228113191, 0.02249407863051471, 0.047054697670398715, -0.2460033920272606, 0.231752456611104, 0.01397148225330321]
|
1,803.05378
|
Information Thermodynamics of Turing Patterns
|
We set up a rigorous thermodynamic description of reaction-diffusion systems
driven out of equilibrium by time-dependent space-distributed chemostats.
Building on the assumption of local equilibrium, nonequilibrium thermodynamic
potentials are constructed exploiting the symmetries of the chemical network
topology. It is shown that the canonical (resp. semigrand canonical)
nonequilibrium free energy works as a Lyapunov function in the relaxation to
equilibrium of a closed (resp. open) system and its variation provides the
minimum amount of work needed to manipulate the species concentrations. The
theory is used to study analytically the Turing pattern formation in a
prototypical reaction-diffusion system, the one-dimensional Brusselator model,
and to classify it as a genuine thermodynamic nonequilibrium phase transition.
|
cond-mat.stat-mech nlin.PS
|
we set up a rigorous thermodynamic description of reactiondiffusion systems driven out of equilibrium by timedependent spacedistributed chemostats building on the assumption of local equilibrium nonequilibrium thermodynamic potentials are constructed exploiting the symmetries of the chemical network topology it is shown that the canonical resp semigrand canonical nonequilibrium free energy works as a lyapunov function in the relaxation to equilibrium of a closed resp open system and its variation provides the minimum amount of work needed to manipulate the species concentrations the theory is used to study analytically the turing pattern formation in a prototypical reactiondiffusion system the onedimensional brusselator model and to classify it as a genuine thermodynamic nonequilibrium phase transition
|
[['we', 'set', 'up', 'a', 'rigorous', 'thermodynamic', 'description', 'of', 'reactiondiffusion', 'systems', 'driven', 'out', 'of', 'equilibrium', 'by', 'timedependent', 'spacedistributed', 'chemostats', 'building', 'on', 'the', 'assumption', 'of', 'local', 'equilibrium', 'nonequilibrium', 'thermodynamic', 'potentials', 'are', 'constructed', 'exploiting', 'the', 'symmetries', 'of', 'the', 'chemical', 'network', 'topology', 'it', 'is', 'shown', 'that', 'the', 'canonical', 'resp', 'semigrand', 'canonical', 'nonequilibrium', 'free', 'energy', 'works', 'as', 'a', 'lyapunov', 'function', 'in', 'the', 'relaxation', 'to', 'equilibrium', 'of', 'a', 'closed', 'resp', 'open', 'system', 'and', 'its', 'variation', 'provides', 'the', 'minimum', 'amount', 'of', 'work', 'needed', 'to', 'manipulate', 'the', 'species', 'concentrations', 'the', 'theory', 'is', 'used', 'to', 'study', 'analytically', 'the', 'turing', 'pattern', 'formation', 'in', 'a', 'prototypical', 'reactiondiffusion', 'system', 'the', 'onedimensional', 'brusselator', 'model', 'and', 'to', 'classify', 'it', 'as', 'a', 'genuine', 'thermodynamic', 'nonequilibrium', 'phase', 'transition']]
|
[-0.1496652531141818, 0.108725126329306, -0.11030116907178282, 0.07333585818986164, 0.008843885839555983, -0.13607121736381775, 0.08005443391880977, 0.2950854840508016, -0.30771657458699503, -0.2485949346997045, 0.03112690189123355, -0.262778582205568, -0.15766512759885676, 0.12892049674137687, 0.01754093783496468, 0.0968230363093778, 0.006909905525914452, 0.029819181906311092, -0.058989900365673205, -0.19295373361826212, 0.30079941565238005, 0.04041455838454862, 0.2683124954388519, 0.03132571304334445, 0.09651580072838713, -0.05170474315339045, 0.04897194209341841, 0.05016216766907255, -0.18365730248898454, 0.05917611544498721, 0.22344181548199943, 0.09608509729465319, 0.2380385106295213, -0.4338258443492557, -0.2655052467761142, 0.13686719841978237, 0.11187616447699969, 0.13671259973449884, -0.00818563834868942, -0.24079375135133396, 0.03907957311582265, -0.15302305333924623, -0.2009568215758951, -0.12556534777143719, 0.029313408492787463, 0.037314794030510356, -0.24579747731436616, 0.07718050128755134, 0.06709748546819429, 0.08271389152342873, -0.10133149665843293, -0.03666194616649132, -0.09615238629877232, 0.10732406020575615, -0.038207666755362614, 0.025734122316059364, 0.18890484332878915, -0.09090999407727304, -0.07689489660834944, 0.37719686869699676, -0.0650404997186752, -0.20897151422602972, 0.2341595059952925, -0.0953788100636925, -0.1303516299849762, 0.12885106195326526, 0.11590611281058004, 0.12645727785740485, -0.23822112697038195, 0.09752054190418373, -0.040157648147427824, 0.13844794577469016, 0.039606529778826075, 0.0004863389306240254, 0.20154348132410296, 0.20349137048732052, 0.06584531660737084, 0.18967522444992183, 0.004765698184922069, -0.22605504527654466, -0.28454841753081966, -0.13419930359583582, -0.19131859163711737, 0.1306834905534177, -0.04120968140610326, -0.21316516503501842, 0.4009357706417103, 0.12024497630563355, 0.13905931160122426, 0.04242085312862318, 0.23904373696879358, 0.12826214337667455, 0.0015719886533580385, 0.05578283701293372, 0.18989329410062447, 0.18513316797881244, 0.10415147222905748, -0.29880950972700054, 0.057228273603024786, 0.10182478680455771]
|
1,803.05379
|
Hypercontractivity and logarithmic Sobolev Inequality for non-primitive
quantum Markov semigroups and estimation of decoherence rates
|
We generalize the concepts of weak quantum logarithmic Sobolev inequality
(LSI) and weak hypercontractivity (HC), introduced in the quantum setting by
Olkiewicz and Zegarlinski, to the case of non-primitive quantum Markov
semigroups (QMS). The originality of this work resides in that this new notion
of hypercontractivity is given in terms of the so-called amalgamated
$\mathbb{L}_p$ norms introduced recently by Junge and Parcet in the context of
operator spaces theory. We make three main contributions. The first one is a
version of Gross' integration lemma: we prove that (weak) HC implies (weak)
LSI. Surprisingly, the converse implication differs from the primitive case as
we show that LSI implies HC but with a weak constant equal to the cardinal of
the center of the decoherence-free algebra. Building on the first implication,
our second contribution is the fact that strong LSI and therefore strong HC do
not hold for non-trivially primitive QMS. This implies that the amalgamated
$\mathbb{L}_p$ norms are not uniformly convex for $1\leq p \leq 2$. As a third
contribution, we derive universal bounds on the (weak) logarithmic Sobolev
constants for a QMS on a finite dimensional Hilbert space, using a similar
method as Diaconis and Saloff-Coste in the case of classical primitive Markov
chains, and Temme, Pastawski and Kastoryano in the case of primitive QMS. This
leads to new bounds on the decoherence rates of decohering QMS. Additionally,
we apply our results to the study of the tensorization of HC in non-commutative
spaces in terms of the completely bounded norms (CB norms) recently introduced
by Beigi and King for unital and trace preserving QMS. We generalize their
results to the case of a general primitive QMS and provide estimates on the
(weak) constants.
|
math-ph math.FA math.MP quant-ph
|
we generalize the concepts of weak quantum logarithmic sobolev inequality lsi and weak hypercontractivity hc introduced in the quantum setting by olkiewicz and zegarlinski to the case of nonprimitive quantum markov semigroups qms the originality of this work resides in that this new notion of hypercontractivity is given in terms of the socalled amalgamated mathbbl_p norms introduced recently by junge and parcet in the context of operator spaces theory we make three main contributions the first one is a version of gross integration lemma we prove that weak hc implies weak lsi surprisingly the converse implication differs from the primitive case as we show that lsi implies hc but with a weak constant equal to the cardinal of the center of the decoherencefree algebra building on the first implication our second contribution is the fact that strong lsi and therefore strong hc do not hold for nontrivially primitive qms this implies that the amalgamated mathbbl_p norms are not uniformly convex for 1leq p leq 2 as a third contribution we derive universal bounds on the weak logarithmic sobolev constants for a qms on a finite dimensional hilbert space using a similar method as diaconis and saloffcoste in the case of classical primitive markov chains and temme pastawski and kastoryano in the case of primitive qms this leads to new bounds on the decoherence rates of decohering qms additionally we apply our results to the study of the tensorization of hc in noncommutative spaces in terms of the completely bounded norms cb norms recently introduced by beigi and king for unital and trace preserving qms we generalize their results to the case of a general primitive qms and provide estimates on the weak constants
|
[['we', 'generalize', 'the', 'concepts', 'of', 'weak', 'quantum', 'logarithmic', 'sobolev', 'inequality', 'lsi', 'and', 'weak', 'hypercontractivity', 'hc', 'introduced', 'in', 'the', 'quantum', 'setting', 'by', 'olkiewicz', 'and', 'zegarlinski', 'to', 'the', 'case', 'of', 'nonprimitive', 'quantum', 'markov', 'semigroups', 'qms', 'the', 'originality', 'of', 'this', 'work', 'resides', 'in', 'that', 'this', 'new', 'notion', 'of', 'hypercontractivity', 'is', 'given', 'in', 'terms', 'of', 'the', 'socalled', 'amalgamated', 'mathbbl_p', 'norms', 'introduced', 'recently', 'by', 'junge', 'and', 'parcet', 'in', 'the', 'context', 'of', 'operator', 'spaces', 'theory', 'we', 'make', 'three', 'main', 'contributions', 'the', 'first', 'one', 'is', 'a', 'version', 'of', 'gross', 'integration', 'lemma', 'we', 'prove', 'that', 'weak', 'hc', 'implies', 'weak', 'lsi', 'surprisingly', 'the', 'converse', 'implication', 'differs', 'from', 'the', 'primitive', 'case', 'as', 'we', 'show', 'that', 'lsi', 'implies', 'hc', 'but', 'with', 'a', 'weak', 'constant', 'equal', 'to', 'the', 'cardinal', 'of', 'the', 'center', 'of', 'the', 'decoherencefree', 'algebra', 'building', 'on', 'the', 'first', 'implication', 'our', 'second', 'contribution', 'is', 'the', 'fact', 'that', 'strong', 'lsi', 'and', 'therefore', 'strong', 'hc', 'do', 'not', 'hold', 'for', 'nontrivially', 'primitive', 'qms', 'this', 'implies', 'that', 'the', 'amalgamated', 'mathbbl_p', 'norms', 'are', 'not', 'uniformly', 'convex', 'for', '1leq', 'p', 'leq', '2', 'as', 'a', 'third', 'contribution', 'we', 'derive', 'universal', 'bounds', 'on', 'the', 'weak', 'logarithmic', 'sobolev', 'constants', 'for', 'a', 'qms', 'on', 'a', 'finite', 'dimensional', 'hilbert', 'space', 'using', 'a', 'similar', 'method', 'as', 'diaconis', 'and', 'saloffcoste', 'in', 'the', 'case', 'of', 'classical', 'primitive', 'markov', 'chains', 'and', 'temme', 'pastawski', 'and', 'kastoryano', 'in', 'the', 'case', 'of', 'primitive', 'qms', 'this', 'leads', 'to', 'new', 'bounds', 'on', 'the', 'decoherence', 'rates', 'of', 'decohering', 'qms', 'additionally', 'we', 'apply', 'our', 'results', 'to', 'the', 'study', 'of', 'the', 'tensorization', 'of', 'hc', 'in', 'noncommutative', 'spaces', 'in', 'terms', 'of', 'the', 'completely', 'bounded', 'norms', 'cb', 'norms', 'recently', 'introduced', 'by', 'beigi', 'and', 'king', 'for', 'unital', 'and', 'trace', 'preserving', 'qms', 'we', 'generalize', 'their', 'results', 'to', 'the', 'case', 'of', 'a', 'general', 'primitive', 'qms', 'and', 'provide', 'estimates', 'on', 'the', 'weak', 'constants']]
|
[-0.10069930386574318, 0.11143684819842695, -0.06230547110688813, 0.09856126119641931, -0.04844873762691182, -0.12837788456694244, 0.04682193610529045, 0.31027486740367105, -0.29816210795448206, -0.1884538723330892, 0.11501855785828018, -0.23751689044755375, -0.11522576390560849, 0.21086902726327683, -0.12764324628952758, 0.02723290343935674, 0.03259055685509551, 0.05633424975711552, -0.08572984487313698, -0.25889688826550844, 0.3798070994242101, 0.03086778152022339, 0.2508854477795118, 0.08536200338796257, 0.07926477521908938, 0.03244456389327765, -0.024224248833637288, -0.006000971809340846, -0.16427356892632067, 0.1613524045781992, 0.2000578973113711, 0.09646378106401296, 0.2794982918460956, -0.34730630827050474, -0.15841607112397857, 0.1428400480113296, 0.09144266543898348, 0.04672873974777758, -0.045027771921323095, -0.29460761592069523, 0.11027553477093366, -0.17104292301797963, -0.12040621440045218, -0.08621189006148501, 0.013535877673206388, 0.01702155038328009, -0.29699301244922194, 0.09011771245232077, 0.187276093999307, 0.05496997374658149, -0.08299461226738619, -0.10943480516273647, 0.031202046978799296, 0.09320539763302159, 0.016573224108127865, 0.021939557145600676, 0.06552635514382141, -0.04784169456301152, -0.13380013164364013, 0.3269255580925482, -0.09803890891051983, -0.19824409846328728, 0.17418917107287668, -0.17111630229352054, -0.201451516861314, 0.045086332530787226, 0.10086601747592898, 0.13815406859360704, -0.08806730298398076, 0.18753845327499105, -0.09721716147610515, 0.1346402533322652, 0.07013044578142147, 0.07320265344229315, 0.05451792841843257, 0.045668693796024784, 0.10780738954987965, 0.1824107288055994, -0.007174645155067192, -0.11348489941558504, -0.34076911276074273, -0.21766426652366072, -0.17136605587500603, 0.08829073165306006, -0.09542851846990033, -0.15567268885536686, 0.31002043253504374, 0.12016763425958904, 0.1626703326478072, 0.10571800236728915, 0.2214365474977167, 0.0994192325453941, 0.06356907896664496, 0.0756558490808102, 0.2295192610299056, 0.2115423383896325, 0.08817970483392107, -0.1595050172977511, 0.06624695557377677, 0.18162554044504353]
|
1,803.0538
|
Greedy can beat pure dynamic programming
|
Many dynamic programming algorithms for discrete 0-1 optimizationproblems are
"pure" in that their recursion equations only use min/max and addition
operations, and do not depend on actual input weights. The well-known greedy
algorithm of Kruskal solves the minimum weight spanning tree problem on
$n$-vertex graphs using only $O(n^2\log n)$ operations. We prove that any pure
DP algorithm for this problem must perform $2^{\Omega(\sqrt{n})}$ operations.
Since the greedy algorithm can also badly fail on some optimization problems,
easily solvable by pure DP algorithms, our result shows that the computational
powers of these two types of algorithms are incomparable.
|
cs.CC
|
many dynamic programming algorithms for discrete 01 optimizationproblems are pure in that their recursion equations only use minmax and addition operations and do not depend on actual input weights the wellknown greedy algorithm of kruskal solves the minimum weight spanning tree problem on nvertex graphs using only on2log n operations we prove that any pure dp algorithm for this problem must perform 2omegasqrtn operations since the greedy algorithm can also badly fail on some optimization problems easily solvable by pure dp algorithms our result shows that the computational powers of these two types of algorithms are incomparable
|
[['many', 'dynamic', 'programming', 'algorithms', 'for', 'discrete', '01', 'optimizationproblems', 'are', 'pure', 'in', 'that', 'their', 'recursion', 'equations', 'only', 'use', 'minmax', 'and', 'addition', 'operations', 'and', 'do', 'not', 'depend', 'on', 'actual', 'input', 'weights', 'the', 'wellknown', 'greedy', 'algorithm', 'of', 'kruskal', 'solves', 'the', 'minimum', 'weight', 'spanning', 'tree', 'problem', 'on', 'nvertex', 'graphs', 'using', 'only', 'on2log', 'n', 'operations', 'we', 'prove', 'that', 'any', 'pure', 'dp', 'algorithm', 'for', 'this', 'problem', 'must', 'perform', '2omegasqrtn', 'operations', 'since', 'the', 'greedy', 'algorithm', 'can', 'also', 'badly', 'fail', 'on', 'some', 'optimization', 'problems', 'easily', 'solvable', 'by', 'pure', 'dp', 'algorithms', 'our', 'result', 'shows', 'that', 'the', 'computational', 'powers', 'of', 'these', 'two', 'types', 'of', 'algorithms', 'are', 'incomparable']]
|
[-0.11137109758662216, 0.06482892986969091, -0.0685644631254642, 0.11779820939530812, -0.10224442368295665, -0.2247464356381291, 0.09558655550548185, 0.42966110754787223, -0.3332573587152486, -0.35099073552070575, 0.13380502996612145, -0.2293768412685798, -0.18691445186899122, 0.19021447384269172, -0.10060578935857241, 0.11668158714504291, 0.1291875466267811, 0.02637356278137304, -0.07272765833234492, -0.3374517011494997, 0.27110976780143875, -0.03471328607217098, 0.22346066271226542, 0.0048557926978295045, 0.08849192603247502, 0.045834226989730574, -0.006622621032875031, 0.057847434877961255, -0.09960134145626398, 0.07601873792737024, 0.2874331132697989, 0.23881674677007445, 0.26111524070923525, -0.43800382607150823, -0.14143694704398513, 0.18400546013193284, 0.1561205257118369, 0.11439092085735562, 0.04867253525177754, -0.1698861247180806, 0.1040651248319288, -0.08607813259732211, -0.011398226279804172, -0.0887879193178378, -0.008948562724981457, 0.014202065474819392, -0.2742869433617064, -0.011021573104092871, 0.10338039248017594, -0.014675973552471078, -0.030912053426921677, -0.19400270034384448, 0.019632625095255207, 0.05052631074552968, -0.05434541706199525, 0.010131170427484903, 0.08471961556642782, -0.050041214929175716, -0.25620788652061793, 0.36066915987369913, 0.018697077146498486, -0.22759925418601293, 0.16885818981487924, -0.04164782091296123, -0.23396137445039736, 0.1463169211153096, 0.16364415646451866, 0.19494130568151982, -0.09583448582270648, 0.1693558892341874, -0.09758727536730778, 0.1463785323042733, 0.11637842138103831, -0.0043378141660165665, 0.061562367683412354, 0.08429134203955375, 0.1544083543637195, 0.13082051946548745, 0.04628348596088472, -0.09753826950327493, -0.24681805085128872, -0.08223704473736386, -0.21324109350583362, -0.005970249270073206, -0.17458185047113753, -0.17913688332676733, 0.33575791333957267, 0.14670927551196655, 0.13674451755165742, 0.16984608411439694, 0.31643822259502485, 0.10215651684969392, 0.042739230669440076, 0.202863955598635, 0.1489533080981952, 0.0767761304183902, 0.0747502422661152, -0.2052431735986223, 0.09078055989236115, 0.14266385868298434]
|
1,803.05381
|
Deep Learning Analysis of Defect and Phase Evolution During Electron
Beam Induced Transformations in WS2
|
Understanding elementary mechanisms behind solid-state phase transformations
and reactions is the key to optimizing desired functional properties of many
technologically relevant materials. Recent advances in scanning transmission
electron microscopy (STEM) allow the real-time visualization of solid-state
transformations in materials, including those induced by an electron beam and
temperature, with atomic resolution. However, despite the ever-expanding
capabilities for high-resolution data acquisition, the inferred information
about kinetics and thermodynamics of the process and single defect dynamics and
interactions is minima, due to the inherent limitations of manual ex-situ
analysis of the collected volumes of data. To circumvent this problem, we
developed a deep learning framework for dynamic STEM imaging that is trained to
find the structures (defects) that break a crystal lattice periodicity and
apply it for mapping solid state reactions and transformations in layered WS2
doped with Mo. This framework allows extracting thousands of lattice defects
from raw STEM data (single images and movies) in a matter of seconds, which are
then classified into different categories using unsupervised clustering
methods. We further expanded our framework to extract parameters of diffusion
for the sulfur vacancies and analyzed transition probabilities associated with
switching between different configurations of defect complexes consisting of Mo
dopant and sulfur vacancy, providing insight into point defect dynamics and
reactions. This approach is universal and its application to beam induced
reactions allows mapping chemical transformation pathways in solids at the
atomic level.
|
cond-mat.mtrl-sci
|
understanding elementary mechanisms behind solidstate phase transformations and reactions is the key to optimizing desired functional properties of many technologically relevant materials recent advances in scanning transmission electron microscopy stem allow the realtime visualization of solidstate transformations in materials including those induced by an electron beam and temperature with atomic resolution however despite the everexpanding capabilities for highresolution data acquisition the inferred information about kinetics and thermodynamics of the process and single defect dynamics and interactions is minima due to the inherent limitations of manual exsitu analysis of the collected volumes of data to circumvent this problem we developed a deep learning framework for dynamic stem imaging that is trained to find the structures defects that break a crystal lattice periodicity and apply it for mapping solid state reactions and transformations in layered ws2 doped with mo this framework allows extracting thousands of lattice defects from raw stem data single images and movies in a matter of seconds which are then classified into different categories using unsupervised clustering methods we further expanded our framework to extract parameters of diffusion for the sulfur vacancies and analyzed transition probabilities associated with switching between different configurations of defect complexes consisting of mo dopant and sulfur vacancy providing insight into point defect dynamics and reactions this approach is universal and its application to beam induced reactions allows mapping chemical transformation pathways in solids at the atomic level
|
[['understanding', 'elementary', 'mechanisms', 'behind', 'solidstate', 'phase', 'transformations', 'and', 'reactions', 'is', 'the', 'key', 'to', 'optimizing', 'desired', 'functional', 'properties', 'of', 'many', 'technologically', 'relevant', 'materials', 'recent', 'advances', 'in', 'scanning', 'transmission', 'electron', 'microscopy', 'stem', 'allow', 'the', 'realtime', 'visualization', 'of', 'solidstate', 'transformations', 'in', 'materials', 'including', 'those', 'induced', 'by', 'an', 'electron', 'beam', 'and', 'temperature', 'with', 'atomic', 'resolution', 'however', 'despite', 'the', 'everexpanding', 'capabilities', 'for', 'highresolution', 'data', 'acquisition', 'the', 'inferred', 'information', 'about', 'kinetics', 'and', 'thermodynamics', 'of', 'the', 'process', 'and', 'single', 'defect', 'dynamics', 'and', 'interactions', 'is', 'minima', 'due', 'to', 'the', 'inherent', 'limitations', 'of', 'manual', 'exsitu', 'analysis', 'of', 'the', 'collected', 'volumes', 'of', 'data', 'to', 'circumvent', 'this', 'problem', 'we', 'developed', 'a', 'deep', 'learning', 'framework', 'for', 'dynamic', 'stem', 'imaging', 'that', 'is', 'trained', 'to', 'find', 'the', 'structures', 'defects', 'that', 'break', 'a', 'crystal', 'lattice', 'periodicity', 'and', 'apply', 'it', 'for', 'mapping', 'solid', 'state', 'reactions', 'and', 'transformations', 'in', 'layered', 'ws2', 'doped', 'with', 'mo', 'this', 'framework', 'allows', 'extracting', 'thousands', 'of', 'lattice', 'defects', 'from', 'raw', 'stem', 'data', 'single', 'images', 'and', 'movies', 'in', 'a', 'matter', 'of', 'seconds', 'which', 'are', 'then', 'classified', 'into', 'different', 'categories', 'using', 'unsupervised', 'clustering', 'methods', 'we', 'further', 'expanded', 'our', 'framework', 'to', 'extract', 'parameters', 'of', 'diffusion', 'for', 'the', 'sulfur', 'vacancies', 'and', 'analyzed', 'transition', 'probabilities', 'associated', 'with', 'switching', 'between', 'different', 'configurations', 'of', 'defect', 'complexes', 'consisting', 'of', 'mo', 'dopant', 'and', 'sulfur', 'vacancy', 'providing', 'insight', 'into', 'point', 'defect', 'dynamics', 'and', 'reactions', 'this', 'approach', 'is', 'universal', 'and', 'its', 'application', 'to', 'beam', 'induced', 'reactions', 'allows', 'mapping', 'chemical', 'transformation', 'pathways', 'in', 'solids', 'at', 'the', 'atomic', 'level']]
|
[-0.048543742903465276, 0.12585468893095525, -0.053146808356488356, 0.034805143140385374, -0.03272823330870322, -0.14740734007519313, 0.09057625846776415, 0.4223981887629743, -0.3097734169259092, -0.3201318911372688, 0.020933227628057768, -0.3161018420763508, -0.13589552519548198, 0.16809694338894685, -0.0075240125519907015, 0.056342842334895414, 0.05369083027759079, -0.06510506377579413, -0.08127016047527413, -0.19920353627865614, 0.2938095585866771, 0.0689568980725616, 0.35075306649871424, 0.0660974323997362, 0.11317302792207158, 0.02371138669699061, 0.0019862005115354776, -0.01700268554063554, -0.1284758653165098, 0.16364705322316325, 0.3061149021472718, 0.0859578475615913, 0.21262020466633366, -0.5063678733205079, -0.2539596293719142, 0.03112260138676172, 0.13121878837191303, 0.15048606046965113, -0.10527893284019962, -0.27674462294501806, 0.04251010541088655, -0.09830256175777431, -0.09021648223603808, -0.12569892191719823, -0.003954722145832115, 0.014469234745993475, -0.24531965910533518, 0.058354302016713294, 0.019038678758453914, 0.10243380506664851, -0.11109621977021862, -0.07495045718585057, -0.04067993390997432, 0.1335937822469442, -0.004382441777764927, 0.006077030326000939, 0.23272575378665789, -0.13217150644687017, -0.12135410492404368, 0.40492537306110044, 0.01734730478200278, -0.11124474269661716, 0.20621154804877906, -0.11423634849648619, -0.14269945443140206, 0.19463696574458508, 0.14419604249197646, 0.10248859544722323, -0.19923462786875634, 0.03979665814507193, 0.04700400100325438, 0.18277963814527984, 0.08414040025435549, 0.0541417610715643, 0.20477243191377728, 0.2315407934011052, -0.003605635603140368, 0.10610452779546747, -0.11604791341620285, -0.06712676645976055, -0.1931888859503195, -0.1712762415326648, -0.1558958214983472, 0.04311805933038404, -0.07045710525428477, -0.142338432128793, 0.37350727113207616, 0.14691709635415526, 0.18430240903811154, -0.06499534203968703, 0.26310706318080296, 0.03251914229581748, 0.10114722560227812, -0.03266775916238583, 0.1681039918058196, 0.13314253258390968, 0.11264242043183086, -0.22549180561065066, 0.05863210646477588, 0.024692100543197038]
|
1,803.05382
|
$F$-rationality of Rees algebras
|
In this paper, we study the $F$-rationality of the Rees algebra and the
extended Rees algebra of $\mathfrak{m}$-primary ideals in excellent local rings
$(R, \mathfrak{m})$ of prime characteristic. We partially answer some
conjectures and questions raised by N. Hara, K.-i. Watanabe and K.-i. Yoshida
(J. Algebra, pp.153--190, vol 247, 2002).
|
math.AC
|
in this paper we study the frationality of the rees algebra and the extended rees algebra of mathfrakmprimary ideals in excellent local rings r mathfrakm of prime characteristic we partially answer some conjectures and questions raised by n hara ki watanabe and ki yoshida j algebra pp153190 vol 247 2002
|
[['in', 'this', 'paper', 'we', 'study', 'the', 'frationality', 'of', 'the', 'rees', 'algebra', 'and', 'the', 'extended', 'rees', 'algebra', 'of', 'mathfrakmprimary', 'ideals', 'in', 'excellent', 'local', 'rings', 'r', 'mathfrakm', 'of', 'prime', 'characteristic', 'we', 'partially', 'answer', 'some', 'conjectures', 'and', 'questions', 'raised', 'by', 'n', 'hara', 'ki', 'watanabe', 'and', 'ki', 'yoshida', 'j', 'algebra', 'pp153190', 'vol', '247', '2002']]
|
[-0.1745217619653867, -0.048901314524059394, -0.06414184838828003, 0.027068858004023075, -0.07851381961028187, -0.21197421757542356, -0.04238618442513125, 0.2830415579053212, -0.36282661356202955, -0.2702604237259651, 0.10121830157004297, -0.27471422936235157, -0.1170500642192379, 0.1071629447634427, -0.2027935652556468, -0.05163401137201153, -0.014433374590411479, -0.033539108285794456, -0.005854955855376867, -0.395833304684077, 0.344071763453587, 0.115129735206767, 0.11471343460333609, 0.04971859239193858, 0.02320123643006141, 0.06716489648370415, -0.11858039332211626, 0.01994818831052707, -0.3149057016422858, 0.11091861746045856, 0.334002978073395, 0.10141020009712297, 0.24791431347174303, -0.34110621220375203, -0.01047225712741516, 0.14268832950263607, 0.1159659603528075, -0.08918860820787293, 0.020239863202584033, -0.24557263400329618, 0.09419019316912305, -0.2708552736712962, -0.14452006224048686, -0.048382672433722386, 0.23179012286115666, -0.02640373545356703, -0.30121627830120984, 0.04224293015669195, 0.2197674121327546, 0.29257223456717873, -0.06144499060298715, -0.15181639167119046, -0.04226781988554463, -0.03653847514556683, -0.0934691236451708, 0.007997291433453863, 0.0827523898523377, -0.07314677707546828, -0.1975070204661817, 0.267869166421647, -0.036503066479855656, -0.058649811936466366, 0.12831592016226176, -0.22347707710019787, -0.15247195867859586, 0.07852144765534572, -0.031721766448902844, 0.10404304179305933, 0.004625836406283232, 0.3000870810272837, -0.2829686488233963, 0.012926138443302135, 0.17675465189528708, -0.03169801778026989, 0.11628097470621673, -0.03060479637007324, -0.07684474920245762, 0.08198142355802107, 0.08145151849912137, 0.05316223261155644, -0.28806971355664485, -0.2262070041924373, -0.0928058134753029, 0.17616419802058716, -0.05874758050687925, -0.06109607582721783, 0.39767969369280093, 0.16086867531495436, 0.1445033051529709, -0.00045522009687764306, 0.09493623148383838, 0.002460223299508192, -0.048613459632104755, 0.1546697275218915, 0.06372457418925775, 0.3286130895543539, 0.07428143507972056, -0.14317905131195272, -0.05323871760153953, 0.21031546735261775]
|
1,803.05383
|
Use of recurrent infomax to improve the memory capability of
input-driven recurrent neural networks
|
The inherent transient dynamics of recurrent neural networks (RNNs) have been
exploited as a computational resource in input-driven RNNs. However, the
information processing capability varies from RNN to RNN, depending on their
properties. Many authors have investigated the dynamics of RNNs and their
relevance to the information processing capability. In this study, we present a
detailed analysis of the information processing capability of an RNN optimized
by recurrent infomax (RI), which is an unsupervised learning scheme that
maximizes the mutual information of RNNs by adjusting the connection strengths
of the network. Thus, we observe that a delay-line structure emerges from the
RI and the network optimized by the RI possesses superior short-term memory,
which is the ability to store the temporal information of the input stream in
its transient dynamics.
|
cs.NE cond-mat.dis-nn
|
the inherent transient dynamics of recurrent neural networks rnns have been exploited as a computational resource in inputdriven rnns however the information processing capability varies from rnn to rnn depending on their properties many authors have investigated the dynamics of rnns and their relevance to the information processing capability in this study we present a detailed analysis of the information processing capability of an rnn optimized by recurrent infomax ri which is an unsupervised learning scheme that maximizes the mutual information of rnns by adjusting the connection strengths of the network thus we observe that a delayline structure emerges from the ri and the network optimized by the ri possesses superior shortterm memory which is the ability to store the temporal information of the input stream in its transient dynamics
|
[['the', 'inherent', 'transient', 'dynamics', 'of', 'recurrent', 'neural', 'networks', 'rnns', 'have', 'been', 'exploited', 'as', 'a', 'computational', 'resource', 'in', 'inputdriven', 'rnns', 'however', 'the', 'information', 'processing', 'capability', 'varies', 'from', 'rnn', 'to', 'rnn', 'depending', 'on', 'their', 'properties', 'many', 'authors', 'have', 'investigated', 'the', 'dynamics', 'of', 'rnns', 'and', 'their', 'relevance', 'to', 'the', 'information', 'processing', 'capability', 'in', 'this', 'study', 'we', 'present', 'a', 'detailed', 'analysis', 'of', 'the', 'information', 'processing', 'capability', 'of', 'an', 'rnn', 'optimized', 'by', 'recurrent', 'infomax', 'ri', 'which', 'is', 'an', 'unsupervised', 'learning', 'scheme', 'that', 'maximizes', 'the', 'mutual', 'information', 'of', 'rnns', 'by', 'adjusting', 'the', 'connection', 'strengths', 'of', 'the', 'network', 'thus', 'we', 'observe', 'that', 'a', 'delayline', 'structure', 'emerges', 'from', 'the', 'ri', 'and', 'the', 'network', 'optimized', 'by', 'the', 'ri', 'possesses', 'superior', 'shortterm', 'memory', 'which', 'is', 'the', 'ability', 'to', 'store', 'the', 'temporal', 'information', 'of', 'the', 'input', 'stream', 'in', 'its', 'transient', 'dynamics']]
|
[-0.10386546797718228, 0.031645681621515764, -0.09459137714897783, 0.08540365673118056, -0.07657310038518447, -0.17264214266951267, 0.03748878189362585, 0.46466215178370474, -0.3521959223712866, -0.2971922665283693, 0.09339546323485243, -0.23808579914844952, -0.23066326302762788, 0.1540424635526366, -0.10567374291758125, 0.07453956641928436, 0.10444541334246214, 0.09725659574525287, -0.061263866776313916, -0.23744465284443533, 0.23997399761126592, 0.11028237208867302, 0.3517501432609816, -0.019309594120400456, 0.15177337056598983, -0.011647564495125643, -0.045190628381589285, -0.03145382731902198, -0.07892283020023919, 0.18585219078589804, 0.24526281512987155, 0.1880088583781169, 0.3389021628840755, -0.4575912842956873, -0.27626256845318353, 0.0853684860550297, 0.13323780184683318, 0.07997951975199752, -0.008137953805271537, -0.30249863697502477, 0.09459519509154443, -0.16866364730701136, 0.016034403762135368, -0.129410400821899, 0.02113247370490661, 0.05286006517797852, -0.23886464433610224, 0.019517382255827005, 0.11689156788544586, 0.04190492565528704, -0.01939206352332034, -0.04727034853914609, -0.045525589653362446, 0.19783835609873326, 0.006991135742730246, 0.023042773950594262, 0.1426822560481154, -0.206876054197514, -0.14556573640483503, 0.3153123819054319, -0.05664516013079824, -0.18511588828494915, 0.15573278907686472, -0.02978800483800184, -0.1336371063326414, 0.11237429041379633, 0.21172770150005818, 0.06994921721231478, -0.18482799411509543, 0.03660647171603229, -0.009088720245143542, 0.19809496263758494, 0.044473262675679644, 0.12429239133086342, 0.19314849993008046, 0.2924127379503961, -0.01907825001130382, 0.15917190255310673, -0.14883789754150292, -0.09248131721531255, -0.1534164803604094, -0.09750589169561863, -0.20781977533434445, 0.03278231896692887, -0.11172927698778669, -0.1122683855991524, 0.4482775777785159, 0.21127891988994985, 0.18297815855162647, 0.07113889432333123, 0.3349858324544934, 0.03359880408612438, 0.15596565887188682, 0.0946286183495361, 0.20009942839566905, 0.10503244877685435, 0.20053618441049295, -0.2561581109614613, 0.12846845061912274, 0.025962854477648553]
|
1,803.05384
|
Familywise error control in multi-armed response-adaptive trials
|
Response-adaptive designs allow the randomization probabilities to change
during the course of a trial based on cumulated response data, so that a
greater proportion of patients can be allocated to the better performing
treatments. A major concern over the use of response-adaptive designs in
practice, particularly from a regulatory viewpoint, is controlling the type I
error rate. In particular, we show that the naive z-test can have an inflated
type I error rate even after applying a Bonferroni correction. Simulation
studies have often been used to demonstrate error control, but do not provide a
guarantee. In this paper, we present adaptive testing procedures for normally
distributed outcomes that ensure strong familywise error control, by
iteratively applying the conditional invariance principle. Our approach can be
used for fully sequential and block randomized trials, and for a large class of
adaptive randomization rules found in the literature. We show there is a high
price to pay in terms of power to guarantee familywise error control for
randomization schemes with extreme allocation probabilities. However, for
proposed Bayesian adaptive randomization schemes in the literature, our
adaptive tests maintain or increase the power of the trial compared to the
z-test. We illustrate our method using a three-armed trial in primary
hypercholesterolemia.
|
stat.ME
|
responseadaptive designs allow the randomization probabilities to change during the course of a trial based on cumulated response data so that a greater proportion of patients can be allocated to the better performing treatments a major concern over the use of responseadaptive designs in practice particularly from a regulatory viewpoint is controlling the type i error rate in particular we show that the naive ztest can have an inflated type i error rate even after applying a bonferroni correction simulation studies have often been used to demonstrate error control but do not provide a guarantee in this paper we present adaptive testing procedures for normally distributed outcomes that ensure strong familywise error control by iteratively applying the conditional invariance principle our approach can be used for fully sequential and block randomized trials and for a large class of adaptive randomization rules found in the literature we show there is a high price to pay in terms of power to guarantee familywise error control for randomization schemes with extreme allocation probabilities however for proposed bayesian adaptive randomization schemes in the literature our adaptive tests maintain or increase the power of the trial compared to the ztest we illustrate our method using a threearmed trial in primary hypercholesterolemia
|
[['responseadaptive', 'designs', 'allow', 'the', 'randomization', 'probabilities', 'to', 'change', 'during', 'the', 'course', 'of', 'a', 'trial', 'based', 'on', 'cumulated', 'response', 'data', 'so', 'that', 'a', 'greater', 'proportion', 'of', 'patients', 'can', 'be', 'allocated', 'to', 'the', 'better', 'performing', 'treatments', 'a', 'major', 'concern', 'over', 'the', 'use', 'of', 'responseadaptive', 'designs', 'in', 'practice', 'particularly', 'from', 'a', 'regulatory', 'viewpoint', 'is', 'controlling', 'the', 'type', 'i', 'error', 'rate', 'in', 'particular', 'we', 'show', 'that', 'the', 'naive', 'ztest', 'can', 'have', 'an', 'inflated', 'type', 'i', 'error', 'rate', 'even', 'after', 'applying', 'a', 'bonferroni', 'correction', 'simulation', 'studies', 'have', 'often', 'been', 'used', 'to', 'demonstrate', 'error', 'control', 'but', 'do', 'not', 'provide', 'a', 'guarantee', 'in', 'this', 'paper', 'we', 'present', 'adaptive', 'testing', 'procedures', 'for', 'normally', 'distributed', 'outcomes', 'that', 'ensure', 'strong', 'familywise', 'error', 'control', 'by', 'iteratively', 'applying', 'the', 'conditional', 'invariance', 'principle', 'our', 'approach', 'can', 'be', 'used', 'for', 'fully', 'sequential', 'and', 'block', 'randomized', 'trials', 'and', 'for', 'a', 'large', 'class', 'of', 'adaptive', 'randomization', 'rules', 'found', 'in', 'the', 'literature', 'we', 'show', 'there', 'is', 'a', 'high', 'price', 'to', 'pay', 'in', 'terms', 'of', 'power', 'to', 'guarantee', 'familywise', 'error', 'control', 'for', 'randomization', 'schemes', 'with', 'extreme', 'allocation', 'probabilities', 'however', 'for', 'proposed', 'bayesian', 'adaptive', 'randomization', 'schemes', 'in', 'the', 'literature', 'our', 'adaptive', 'tests', 'maintain', 'or', 'increase', 'the', 'power', 'of', 'the', 'trial', 'compared', 'to', 'the', 'ztest', 'we', 'illustrate', 'our', 'method', 'using', 'a', 'threearmed', 'trial', 'in', 'primary', 'hypercholesterolemia']]
|
[-0.05997564914272871, 0.025092489416100563, -0.09457944799668905, 0.0932832731598443, -0.06102058654991774, -0.178557627474344, 0.14031580379403127, 0.41548132522077097, -0.21937000822366737, -0.2837380399882067, 0.15177633325944132, -0.19120692341338572, -0.16125626035329954, 0.22722381963337795, -0.1751031219732107, 0.10443366669209266, 0.08011770008540735, 0.0003034515012475866, -0.05606406460084566, -0.31652898886922476, 0.25946289173088877, 0.10600394875083755, 0.3431460353205117, -0.035797149926514886, 0.08530774101808031, 0.016158638323554995, -0.04646621380489683, 0.04202547678099264, -0.10508641179636115, 0.09065500063730812, 0.2880024193229563, 0.17565564720936847, 0.4121240865257455, -0.4130162909036366, -0.19774143111369596, 0.13385951231665363, 0.13016273447925725, 0.1365656405187598, -0.06675434437262394, -0.23063481691770438, 0.11232010867083218, -0.20565150879868646, -0.07622547446886395, -0.09742354796319155, -0.07174992681730812, 0.04900259093108882, -0.39185842283172306, 0.07602751036742475, 0.020775867012760987, 0.07927656280694576, -0.016165941232451943, -0.12537888171514724, 0.06246863122143578, 0.13277099721542582, 0.06745281018680188, 0.004981786389721603, 0.11974243831184761, -0.07448281058019436, -0.17650654560818177, 0.3268486950069484, 0.000628606529577022, -0.22916342099083634, 0.1327440439978978, -0.08867809820079767, -0.13002591667889912, 0.12948920552550655, 0.21404712886163374, 0.10199494811183796, -0.13805004546146205, 0.0017726308228902337, 0.02423388995230198, 0.18712990585964445, 0.028298628925368552, 0.016595687354892127, 0.1218958080450936, 0.1526926604315366, 0.08877888499395695, 0.09881370398670253, -0.09651349115458022, -0.10026010712154391, -0.30392256666247436, -0.14286301713096114, -0.15313909854172025, 0.007199318195968617, -0.07409438394768186, -0.14570126259336022, 0.35735181901751584, 0.19500428330743821, 0.12058884040580313, 0.09604518111204592, 0.29791305229158666, 0.10724452282018142, 0.08818670086471772, 0.08669904938717259, 0.25216635592372677, 0.0454341118215447, 0.04250600574504039, -0.22367691778657367, 0.16177009776484494, 0.03260857911280742]
|
1,803.05385
|
Distributed Random Number Generation for the Needs of Public Governance
|
We propose distributed protocol for generation of random numbers via computer
systems. The protocol is specifically designed to fit the needs of random
selection as it is performed in public sphere and is inspired by real problems,
which are posing difficulties for Bulgarian judicial system. Random selection
in public sphere is meant to be mechanism for increasing the transparency and
reducing the possibilities of collusion between various government actors.
Usage of computers reduces transparency and when done improperly, can lead to
disastrous consequences concerning the public trust in the institutions of
government. This protocol tries to provide technical solution to the
transparency problem by allowing third parties to guarantee for the fairness of
the random selection without giving these parties the ability to influence
maliciously the result.
|
cs.CR cs.CY
|
we propose distributed protocol for generation of random numbers via computer systems the protocol is specifically designed to fit the needs of random selection as it is performed in public sphere and is inspired by real problems which are posing difficulties for bulgarian judicial system random selection in public sphere is meant to be mechanism for increasing the transparency and reducing the possibilities of collusion between various government actors usage of computers reduces transparency and when done improperly can lead to disastrous consequences concerning the public trust in the institutions of government this protocol tries to provide technical solution to the transparency problem by allowing third parties to guarantee for the fairness of the random selection without giving these parties the ability to influence maliciously the result
|
[['we', 'propose', 'distributed', 'protocol', 'for', 'generation', 'of', 'random', 'numbers', 'via', 'computer', 'systems', 'the', 'protocol', 'is', 'specifically', 'designed', 'to', 'fit', 'the', 'needs', 'of', 'random', 'selection', 'as', 'it', 'is', 'performed', 'in', 'public', 'sphere', 'and', 'is', 'inspired', 'by', 'real', 'problems', 'which', 'are', 'posing', 'difficulties', 'for', 'bulgarian', 'judicial', 'system', 'random', 'selection', 'in', 'public', 'sphere', 'is', 'meant', 'to', 'be', 'mechanism', 'for', 'increasing', 'the', 'transparency', 'and', 'reducing', 'the', 'possibilities', 'of', 'collusion', 'between', 'various', 'government', 'actors', 'usage', 'of', 'computers', 'reduces', 'transparency', 'and', 'when', 'done', 'improperly', 'can', 'lead', 'to', 'disastrous', 'consequences', 'concerning', 'the', 'public', 'trust', 'in', 'the', 'institutions', 'of', 'government', 'this', 'protocol', 'tries', 'to', 'provide', 'technical', 'solution', 'to', 'the', 'transparency', 'problem', 'by', 'allowing', 'third', 'parties', 'to', 'guarantee', 'for', 'the', 'fairness', 'of', 'the', 'random', 'selection', 'without', 'giving', 'these', 'parties', 'the', 'ability', 'to', 'influence', 'maliciously', 'the', 'result']]
|
[-0.14917737676204718, 0.07512656950545828, -0.07019999299512802, 0.06671457821191619, -0.12362785822176557, -0.2017231046801477, 0.13262459935297763, 0.3727244484553656, -0.27831005940111136, -0.34775217585852297, 0.11555611668246263, -0.2563014440751803, -0.11536976076501208, 0.1917432508042713, -0.15423647683905803, 0.0959726744551417, 0.02854662356113531, -0.007069161594212862, 0.07828819034547788, -0.34081799387528494, 0.3307173496660388, 0.0803454784955096, 0.3134850024091681, 0.0841743580549662, 0.0420676097035496, 0.055226555728448895, -0.0453268321832334, -0.0200717005494608, -0.053746856677558595, 0.1281794290577142, 0.29656720311952917, 0.20903252117981122, 0.3807485020301473, -0.41348146993344226, -0.1640215936285539, 0.12901456739320824, 0.09776562856194952, 0.11544596931739438, -0.030079196104559842, -0.33460201301582626, 0.0890866294209882, -0.2157935520020354, -0.12389019664787636, -0.0826798005498887, -0.04000942444604799, 0.024526110045450526, -0.2923377340395502, 0.0031424037246840205, 0.02440766404533216, 0.05807328172482726, 0.0057095313200903105, -0.044615266128721846, 0.02831613358319187, 0.21658540659471356, 0.066202559647715, -0.02791964186274806, 0.12601308847317383, -0.13687110278484096, -0.16273778490813845, 0.42805634745521337, 0.021889417995075423, -0.1976208783920825, 0.16123372626373558, -0.054559078975030637, -0.10418420275819935, 0.05442245827399297, 0.21314393167244636, 0.03512298759425015, -0.17119943709756655, 0.0368680811746552, 0.0009249505975584346, 0.16879780956463317, 0.0685352378260843, 0.021006130197224773, 0.1663892798155077, 0.15341691672985303, 0.11703995489157869, 0.17029009127575082, -0.015529933693547418, -0.14026621135509038, -0.24022724880565574, -0.13167962838169628, -0.1561551284866305, 0.03077085612444427, -0.0680600254147682, -0.11526821874170087, 0.34996521884326154, 0.19860160665762588, 0.11774664888466436, 0.011408365184008546, 0.3428687461483197, 0.043922892855535314, 0.08232220621434898, 0.06099883407559686, 0.19740063694899712, 0.059188272039530664, 0.15230281136225998, -0.16321160124365505, 0.1626406182827406, 0.026054429972001653]
|
1,803.05386
|
Line and rational curve arrangements, and Walther's inequality
|
There are two invariants associated to any line arrangement: the freeness
defect $\nu(C)$ and an upper bound for it, denoted by $\nu'(C)$, coming from a
recent result by Uli Walther. We show that $\nu'(C)$ is combinatorially
determined, at least when the number of lines in $C$ is odd, while the same
property is conjectural for $\nu(C)$. In addition, we conjecture that the
equality $\nu(C)=\nu'(C)$ holds if and only if the essential arrangement $C$ of
$d$ lines has either a point of multiplicity $d-1$, or has only double and
triple points. We prove both conjectures in some cases, in particular when the
number of lines is at most 10. We also extend a result by H. Schenck on the
Castenuovo-Mumford regularity of line arrangements to arrangements of possibly
singular rational curves.
|
math.AG math.AC
|
there are two invariants associated to any line arrangement the freeness defect nuc and an upper bound for it denoted by nuc coming from a recent result by uli walther we show that nuc is combinatorially determined at least when the number of lines in c is odd while the same property is conjectural for nuc in addition we conjecture that the equality nucnuc holds if and only if the essential arrangement c of d lines has either a point of multiplicity d1 or has only double and triple points we prove both conjectures in some cases in particular when the number of lines is at most 10 we also extend a result by h schenck on the castenuovomumford regularity of line arrangements to arrangements of possibly singular rational curves
|
[['there', 'are', 'two', 'invariants', 'associated', 'to', 'any', 'line', 'arrangement', 'the', 'freeness', 'defect', 'nuc', 'and', 'an', 'upper', 'bound', 'for', 'it', 'denoted', 'by', 'nuc', 'coming', 'from', 'a', 'recent', 'result', 'by', 'uli', 'walther', 'we', 'show', 'that', 'nuc', 'is', 'combinatorially', 'determined', 'at', 'least', 'when', 'the', 'number', 'of', 'lines', 'in', 'c', 'is', 'odd', 'while', 'the', 'same', 'property', 'is', 'conjectural', 'for', 'nuc', 'in', 'addition', 'we', 'conjecture', 'that', 'the', 'equality', 'nucnuc', 'holds', 'if', 'and', 'only', 'if', 'the', 'essential', 'arrangement', 'c', 'of', 'd', 'lines', 'has', 'either', 'a', 'point', 'of', 'multiplicity', 'd1', 'or', 'has', 'only', 'double', 'and', 'triple', 'points', 'we', 'prove', 'both', 'conjectures', 'in', 'some', 'cases', 'in', 'particular', 'when', 'the', 'number', 'of', 'lines', 'is', 'at', 'most', '10', 'we', 'also', 'extend', 'a', 'result', 'by', 'h', 'schenck', 'on', 'the', 'castenuovomumford', 'regularity', 'of', 'line', 'arrangements', 'to', 'arrangements', 'of', 'possibly', 'singular', 'rational', 'curves']]
|
[-0.17597574907631497, 0.09434108933521657, -0.030369816380698467, 0.01978559354392928, -0.01779471687041223, -0.19194463892563363, 0.04491917155610281, 0.35777004593546735, -0.22681315762838494, -0.2678268495656084, 0.09511330309396726, -0.2883090429222648, -0.1347194049249083, 0.20408582063282665, -0.07852632328285836, -0.02429590834890405, 0.03697138915231335, 0.05980759925660095, -0.03451406603198848, -0.3038243232294917, 0.35228182161517907, -0.02775910971149642, 0.19840051027131267, 0.12509614613372833, 0.032752523526141886, 0.025113555004281807, 0.03270902048825519, 0.04072291020484897, -0.15356103337819604, 0.11272937490730328, 0.24041236127959564, 0.1296175592306099, 0.1948561409735703, -0.33277504047146067, -0.1380449966482047, 0.15636764902228606, 0.14491908241518558, 0.055764234142770874, -0.008194675446247857, -0.1836295186294592, 0.16002257693799038, -0.0878999587148428, -0.18974381544467178, -0.0021952375973341987, 0.08675709366434603, 0.020455906105325994, -0.24670907785184681, 0.010949009785463204, 0.13091816624364583, 0.11790549872034717, -0.014919012705831847, -0.13025234943233954, -0.06714185726741562, 0.04433947659026671, 0.021216038749116706, 0.03697393516995362, 0.030988752896519145, -0.12860940747486893, -0.11890892466635705, 0.3598102897321951, -0.03529812828219292, -0.1697268309114861, 0.16727827432987397, -0.17803801672653208, -0.18868616830877727, 0.16597738239033788, 0.04970420813333476, 0.13366067282186123, -0.027292845368037888, 0.1515566341208796, -0.13435044818470487, 0.11269995129191557, 0.1479824086309236, -0.01595221493153076, 0.1448612078165752, 0.0285258941767097, 0.09997195325104258, 0.12188580006522898, -0.0737317693588011, -0.002658422730746679, -0.3225364234967856, -0.19724921551687657, -0.19033231795037864, 0.08745670853932097, -0.08167139411273183, -0.1220010697725229, 0.32523967664747033, 0.06916955790075008, 0.2412661646894776, 0.0391681131468431, 0.22674467638717033, 0.10115179223066662, 0.04161700396252854, 0.08193391419308682, 0.20056169319036599, 0.1617191315508535, 0.008837962452162174, -0.14614885573064385, 0.05904767705669656, 0.1399232165858848]
|
1,803.05387
|
Towards Monocular Digital Elevation Model (DEM) Estimation by
Convolutional Neural Networks - Application on Synthetic Aperture Radar
Images
|
Synthetic aperture radar (SAR) interferometry (InSAR) is performed using
repeat-pass geometry. InSAR technique is used to estimate the topographic
reconstruction of the earth surface. The main problem of the range-Doppler
focusing technique is the nature of the two-dimensional SAR result, affected by
the layover indetermination. In order to resolve this problem, a minimum of two
sensor acquisitions, separated by a baseline and extended in the
cross-slant-range, are needed. However, given its multi-temporal nature, these
techniques are vulnerable to atmosphere and Earth environment parameters
variation in addition to physical platform instabilities. Furthermore, either
two radars are needed or an interferometric cycle is required (that spans from
days to weeks), which makes real time DEM estimation impossible. In this work,
the authors propose a novel experimental alternative to the InSAR method that
uses single-pass acquisitions, using a data driven approach implemented by Deep
Neural Networks. We propose a fully Convolutional Neural Network (CNN)
Encoder-Decoder architecture, training it on radar images in order to estimate
DEMs from single pass image acquisitions. Our results on a set of Sentinel
images show that this method is able to learn to some extent the statistical
properties of the DEM. The results of this exploratory analysis are encouraging
and open the way to the solution of single-pass DEM estimation problem with
data driven approaches.
|
eess.SP cs.CV
|
synthetic aperture radar sar interferometry insar is performed using repeatpass geometry insar technique is used to estimate the topographic reconstruction of the earth surface the main problem of the rangedoppler focusing technique is the nature of the twodimensional sar result affected by the layover indetermination in order to resolve this problem a minimum of two sensor acquisitions separated by a baseline and extended in the crossslantrange are needed however given its multitemporal nature these techniques are vulnerable to atmosphere and earth environment parameters variation in addition to physical platform instabilities furthermore either two radars are needed or an interferometric cycle is required that spans from days to weeks which makes real time dem estimation impossible in this work the authors propose a novel experimental alternative to the insar method that uses singlepass acquisitions using a data driven approach implemented by deep neural networks we propose a fully convolutional neural network cnn encoderdecoder architecture training it on radar images in order to estimate dems from single pass image acquisitions our results on a set of sentinel images show that this method is able to learn to some extent the statistical properties of the dem the results of this exploratory analysis are encouraging and open the way to the solution of singlepass dem estimation problem with data driven approaches
|
[['synthetic', 'aperture', 'radar', 'sar', 'interferometry', 'insar', 'is', 'performed', 'using', 'repeatpass', 'geometry', 'insar', 'technique', 'is', 'used', 'to', 'estimate', 'the', 'topographic', 'reconstruction', 'of', 'the', 'earth', 'surface', 'the', 'main', 'problem', 'of', 'the', 'rangedoppler', 'focusing', 'technique', 'is', 'the', 'nature', 'of', 'the', 'twodimensional', 'sar', 'result', 'affected', 'by', 'the', 'layover', 'indetermination', 'in', 'order', 'to', 'resolve', 'this', 'problem', 'a', 'minimum', 'of', 'two', 'sensor', 'acquisitions', 'separated', 'by', 'a', 'baseline', 'and', 'extended', 'in', 'the', 'crossslantrange', 'are', 'needed', 'however', 'given', 'its', 'multitemporal', 'nature', 'these', 'techniques', 'are', 'vulnerable', 'to', 'atmosphere', 'and', 'earth', 'environment', 'parameters', 'variation', 'in', 'addition', 'to', 'physical', 'platform', 'instabilities', 'furthermore', 'either', 'two', 'radars', 'are', 'needed', 'or', 'an', 'interferometric', 'cycle', 'is', 'required', 'that', 'spans', 'from', 'days', 'to', 'weeks', 'which', 'makes', 'real', 'time', 'dem', 'estimation', 'impossible', 'in', 'this', 'work', 'the', 'authors', 'propose', 'a', 'novel', 'experimental', 'alternative', 'to', 'the', 'insar', 'method', 'that', 'uses', 'singlepass', 'acquisitions', 'using', 'a', 'data', 'driven', 'approach', 'implemented', 'by', 'deep', 'neural', 'networks', 'we', 'propose', 'a', 'fully', 'convolutional', 'neural', 'network', 'cnn', 'encoderdecoder', 'architecture', 'training', 'it', 'on', 'radar', 'images', 'in', 'order', 'to', 'estimate', 'dems', 'from', 'single', 'pass', 'image', 'acquisitions', 'our', 'results', 'on', 'a', 'set', 'of', 'sentinel', 'images', 'show', 'that', 'this', 'method', 'is', 'able', 'to', 'learn', 'to', 'some', 'extent', 'the', 'statistical', 'properties', 'of', 'the', 'dem', 'the', 'results', 'of', 'this', 'exploratory', 'analysis', 'are', 'encouraging', 'and', 'open', 'the', 'way', 'to', 'the', 'solution', 'of', 'singlepass', 'dem', 'estimation', 'problem', 'with', 'data', 'driven', 'approaches']]
|
[-0.05402342970807885, 0.030293061721292973, -0.0871585366554385, 0.05290874617802369, -0.07841416617725477, -0.13742670856719447, 0.020388551420250603, 0.4353103289456475, -0.27616293674638104, -0.3398877199912487, 0.12955002247269243, -0.254726784407746, -0.19965647803010353, 0.219539857795462, -0.12620241749425268, 0.11915306567653017, 0.12268229878864922, -0.03290702718375034, -0.045749783509026476, -0.24097399835279862, 0.27030915493622076, 0.0661548129915054, 0.2943271300441391, -0.016076129811361084, 0.11622555274841224, -0.032415599813468234, -0.05711875342179176, -0.012655210380745662, -0.06815524791244845, 0.14975002266217544, 0.27776005022623035, 0.17527475303558762, 0.25817617428554007, -0.4343898862513692, -0.25243865384958514, 0.07936943750178745, 0.1243326908865467, 0.0956272052920445, -0.030702175255215097, -0.32149790922872895, 0.06905266587340901, -0.1314323135976528, -0.0631997833981417, -0.06412077222755828, -0.04162754467038741, -0.015249384906641099, -0.30417040517380417, 0.049035383689455515, 0.02975913478510974, 0.0632769531700327, -0.07064627506364093, -0.053190422388400105, 0.03993008580643597, 0.14972170958468733, -0.003895637643155317, 0.070287173304187, 0.10659994894833585, -0.08321206880148586, -0.10612049467515114, 0.36866701079835723, -0.05089408250330666, -0.17472611834121823, 0.19412077796147315, -0.07975393715206273, -0.09547130500377957, 0.1532853480255188, 0.21492142307593726, 0.12083630504758032, -0.17311815422916307, -0.004154859973540053, -0.0348528531748195, 0.2055754864149792, 0.04925646464405365, -0.039029723117777776, 0.17386106662452222, 0.23226146676989143, 0.055682973009209304, 0.14278635900889977, -0.2262950896502061, -0.03427494540214972, -0.20932328533381223, -0.08244364604321416, -0.21734764238624552, 0.0005239299785475745, -0.0543822846330058, -0.14214811643110425, 0.3930110963711212, 0.24687683975194083, 0.17836299301666575, 0.038861060127897494, 0.4048809763152412, 0.04048108109144418, 0.10840162016007356, 0.05005715425061279, 0.20697939976695168, 0.0890679505772802, 0.14524386926922342, -0.17465723410714418, 0.0529312718908714, 0.05909798666834831]
|
1,803.05388
|
Recent advances in and future challenges for mesoscopic hydrodynamic
modelling of complex wetting
|
We highlight some recent developments that widen the scope and reach of
mesoscopic thin-film (or long-wave) hydrodynamic models employed to describe
the dynamics of thin films, drops and contact lines of simple and complex
liquids on solid substrates. The basis of the discussed developments is the
reformulation of various mesoscopic thin-film hydrodynamic models as gradient
dynamics on underlying energy functionals. After briefly presenting the general
approach, the following sections discuss how to improve these models by
amending the energy functional and the mobility function, how to obtain
gradient dynamics models for some complex liquids, and how to incorporate
processes beyond relaxational dynamics.
|
physics.flu-dyn cond-mat.soft
|
we highlight some recent developments that widen the scope and reach of mesoscopic thinfilm or longwave hydrodynamic models employed to describe the dynamics of thin films drops and contact lines of simple and complex liquids on solid substrates the basis of the discussed developments is the reformulation of various mesoscopic thinfilm hydrodynamic models as gradient dynamics on underlying energy functionals after briefly presenting the general approach the following sections discuss how to improve these models by amending the energy functional and the mobility function how to obtain gradient dynamics models for some complex liquids and how to incorporate processes beyond relaxational dynamics
|
[['we', 'highlight', 'some', 'recent', 'developments', 'that', 'widen', 'the', 'scope', 'and', 'reach', 'of', 'mesoscopic', 'thinfilm', 'or', 'longwave', 'hydrodynamic', 'models', 'employed', 'to', 'describe', 'the', 'dynamics', 'of', 'thin', 'films', 'drops', 'and', 'contact', 'lines', 'of', 'simple', 'and', 'complex', 'liquids', 'on', 'solid', 'substrates', 'the', 'basis', 'of', 'the', 'discussed', 'developments', 'is', 'the', 'reformulation', 'of', 'various', 'mesoscopic', 'thinfilm', 'hydrodynamic', 'models', 'as', 'gradient', 'dynamics', 'on', 'underlying', 'energy', 'functionals', 'after', 'briefly', 'presenting', 'the', 'general', 'approach', 'the', 'following', 'sections', 'discuss', 'how', 'to', 'improve', 'these', 'models', 'by', 'amending', 'the', 'energy', 'functional', 'and', 'the', 'mobility', 'function', 'how', 'to', 'obtain', 'gradient', 'dynamics', 'models', 'for', 'some', 'complex', 'liquids', 'and', 'how', 'to', 'incorporate', 'processes', 'beyond', 'relaxational', 'dynamics']]
|
[-0.061056891353526974, 0.12139423438073958, -0.08340689649476725, 0.07466609785264797, -0.03387009168692006, -0.12381308181576577, 0.009573724823912569, 0.35988731030374765, -0.2934406245602112, -0.262779194660777, 0.08324739291770931, -0.24577414056322738, -0.1862726596243424, 0.2004850861575345, -0.015549521235858692, 0.06702513355469587, 0.0059425436352909195, -0.08506185946958687, -0.08289851562129151, -0.2213893590549774, 0.31415889247813644, 0.07262009387498028, 0.2797873281398971, 0.10644948344641164, 0.08205878483953283, -0.004774795105571256, 0.020208272809053168, 0.025610413219706685, -0.22838407682117096, 0.11969410963173882, 0.23134160527286654, 0.03969725660578001, 0.22494293470848717, -0.5761712594688231, -0.3142472442294307, 0.014901533266346828, 0.10463858249040284, 0.12687499562789703, -0.01974884728106725, -0.24582066018517842, 0.014309411777146891, -0.13886374876122265, -0.17711431540859243, -0.1561771641010601, -0.0008467104852053465, 0.09224399745318235, -0.14541300336828036, 0.07535531452181292, 0.07007246987675042, 0.022730049010658383, -0.06164783555397983, -0.13005823310003525, -0.006433186239982937, 0.07597453433189395, 0.05300735271086131, -0.016537492268481384, 0.24211630674864293, -0.17870826813319296, -0.11984618202618816, 0.37178406891796517, -0.05994450134298235, -0.20341442862306447, 0.24423102026476579, -0.11739872867131934, -0.10443105944432318, 0.0938321425278178, 0.20069079328209674, 0.11785492942412841, -0.15813473961886712, 0.08043433159450526, 0.03259266575332731, 0.12921446508171, 0.00704275166351056, 0.009426934106444356, 0.2065702828158643, 0.2336019015432719, -0.010772840270553441, 0.08509802385792593, -0.05186175479206676, -0.16459118648815682, -0.29173524641230997, -0.14407429194041327, -0.11882206719761312, 0.043517276665250605, -0.07649842173921963, -0.16884854928973844, 0.41319636101651863, 0.19168459432309165, 0.18208051144200213, 0.03569009051630821, 0.26033595409678, 0.09385551198947188, 0.004887193167472587, 0.009675048472012813, 0.2326066463246403, 0.1893765940559188, 0.13495190606658533, -0.23566929281543136, 0.04797870368358916, 0.058048651697497594]
|
1,803.05389
|
Self-Similar Epochs: Value in Arrangement
|
Optimization of machine learning models is commonly performed through
stochastic gradient updates on randomly ordered training examples. This
practice means that sub-epochs comprise of independent random samples of the
training data that may not preserve informative structure present in the full
data. We hypothesize that the training can be more effective with {\em
self-similar} arrangements that potentially allow each epoch to provide
benefits of multiple ones. We study this for "matrix factorization" -- the
common task of learning metric embeddings of entities such as queries, videos,
or words from example pairwise associations. We construct arrangements that
preserve the weighted Jaccard similarities of rows and columns and
experimentally observe training acceleration of 3\%-37\% on synthetic and
recommendation datasets. Principled arrangements of training examples emerge as
a novel and potentially powerful enhancement to SGD that merits further
exploration.
|
cs.LG
|
optimization of machine learning models is commonly performed through stochastic gradient updates on randomly ordered training examples this practice means that subepochs comprise of independent random samples of the training data that may not preserve informative structure present in the full data we hypothesize that the training can be more effective with em selfsimilar arrangements that potentially allow each epoch to provide benefits of multiple ones we study this for matrix factorization the common task of learning metric embeddings of entities such as queries videos or words from example pairwise associations we construct arrangements that preserve the weighted jaccard similarities of rows and columns and experimentally observe training acceleration of 337 on synthetic and recommendation datasets principled arrangements of training examples emerge as a novel and potentially powerful enhancement to sgd that merits further exploration
|
[['optimization', 'of', 'machine', 'learning', 'models', 'is', 'commonly', 'performed', 'through', 'stochastic', 'gradient', 'updates', 'on', 'randomly', 'ordered', 'training', 'examples', 'this', 'practice', 'means', 'that', 'subepochs', 'comprise', 'of', 'independent', 'random', 'samples', 'of', 'the', 'training', 'data', 'that', 'may', 'not', 'preserve', 'informative', 'structure', 'present', 'in', 'the', 'full', 'data', 'we', 'hypothesize', 'that', 'the', 'training', 'can', 'be', 'more', 'effective', 'with', 'em', 'selfsimilar', 'arrangements', 'that', 'potentially', 'allow', 'each', 'epoch', 'to', 'provide', 'benefits', 'of', 'multiple', 'ones', 'we', 'study', 'this', 'for', 'matrix', 'factorization', 'the', 'common', 'task', 'of', 'learning', 'metric', 'embeddings', 'of', 'entities', 'such', 'as', 'queries', 'videos', 'or', 'words', 'from', 'example', 'pairwise', 'associations', 'we', 'construct', 'arrangements', 'that', 'preserve', 'the', 'weighted', 'jaccard', 'similarities', 'of', 'rows', 'and', 'columns', 'and', 'experimentally', 'observe', 'training', 'acceleration', 'of', '337', 'on', 'synthetic', 'and', 'recommendation', 'datasets', 'principled', 'arrangements', 'of', 'training', 'examples', 'emerge', 'as', 'a', 'novel', 'and', 'potentially', 'powerful', 'enhancement', 'to', 'sgd', 'that', 'merits', 'further', 'exploration']]
|
[-0.05735219330893381, 0.07830080479573183, -0.05257878652946265, 0.10174659798525412, -0.1462355515298744, -0.1573591393177156, 0.07491887468430732, 0.46908051690293684, -0.29481493343633636, -0.32272673872540947, 0.06350667865653695, -0.3024949725665566, -0.18326340759759424, 0.15465658264864168, -0.08967010812419984, 0.026655453857448365, 0.1553782170129664, 0.011471433151315, -0.0772863477502984, -0.314554621056757, 0.304300153615919, 0.038461959330985944, 0.3025826031825057, -0.04849915444781935, 0.12159647549916473, -0.019393442467682893, -0.018550458354702978, 0.028323106046904016, -0.06244522073485078, 0.16522719496171231, 0.3394358052746274, 0.2470634242402782, 0.3135684329292013, -0.4075129652223377, -0.20759270041663613, 0.13601114349784674, 0.1585587166532167, 0.09646521856139535, -0.0701269203940346, -0.29879213501181867, 0.07497300317821404, -0.12215948182123679, -0.00724261966706426, -0.19527603050831843, -0.01102219163612635, 0.04061587317156847, -0.30701750129228456, 0.046756598504079094, 0.06952594416517834, 0.07666925919690618, -0.020345905443860425, -0.10965004772189314, 0.017085705538866697, 0.11872277024064075, 0.043940000310195265, 0.003299398956544421, 0.1427896885442789, -0.10271661311336276, -0.17580759888687345, 0.36374785122634085, -0.019045444474452073, -0.19831831855354487, 0.20243491077174744, -0.041982234262481884, -0.15435824666379228, 0.11294890361734562, 0.24309908124031843, 0.11124463176561726, -0.1589831499525139, -0.003492491037360634, -0.07956205772718898, 0.1602305412999596, 0.059045038020445244, 0.009844439088677366, 0.15431924861924792, 0.16976544488635328, 0.0538199658540112, 0.153930879414461, -0.08155481375201985, -0.06784452891874093, -0.25243684392362076, -0.12731189640169893, -0.20541412963152483, 0.016727368526820403, -0.18144912859985468, -0.19089710668884907, 0.36648054186392715, 0.2223492799749322, 0.24596947258752253, 0.0801126595577915, 0.30019343906530627, -0.019998889839000725, 0.11569567738204367, 0.0927616925000351, 0.1470265185770889, 0.03620476351567992, 0.07430738008201675, -0.13466781676332984, 0.1029879837245163, 0.038219902271197904]
|
1,803.0539
|
Computational Techniques for the Analysis of Small Signals in
High-Statistics Neutrino Oscillation Experiments
|
The current and upcoming generation of Very Large Volume Neutrino
Telescopes---collecting unprecedented quantities of neutrino events---can be
used to explore subtle effects in oscillation physics, such as (but not
restricted to) the neutrino mass ordering. The sensitivity of an experiment to
these effects can be estimated from Monte Carlo simulations. With the high
number of events that will be collected, there is a trade-off between the
computational expense of running such simulations and the inherent statistical
uncertainty in the determined values. In such a scenario, it becomes
impractical to produce and use adequately-sized sets of simulated events with
traditional methods, such as Monte Carlo weighting. In this work we present a
staged approach to the generation of binned event distributions in order to
overcome these challenges. By combining multiple integration and smoothing
techniques which address limited statistics from simulation it arrives at
reliable analysis results using modest computational resources.
|
physics.data-an astro-ph.IM hep-ex
|
the current and upcoming generation of very large volume neutrino telescopescollecting unprecedented quantities of neutrino eventscan be used to explore subtle effects in oscillation physics such as but not restricted to the neutrino mass ordering the sensitivity of an experiment to these effects can be estimated from monte carlo simulations with the high number of events that will be collected there is a tradeoff between the computational expense of running such simulations and the inherent statistical uncertainty in the determined values in such a scenario it becomes impractical to produce and use adequatelysized sets of simulated events with traditional methods such as monte carlo weighting in this work we present a staged approach to the generation of binned event distributions in order to overcome these challenges by combining multiple integration and smoothing techniques which address limited statistics from simulation it arrives at reliable analysis results using modest computational resources
|
[['the', 'current', 'and', 'upcoming', 'generation', 'of', 'very', 'large', 'volume', 'neutrino', 'telescopescollecting', 'unprecedented', 'quantities', 'of', 'neutrino', 'eventscan', 'be', 'used', 'to', 'explore', 'subtle', 'effects', 'in', 'oscillation', 'physics', 'such', 'as', 'but', 'not', 'restricted', 'to', 'the', 'neutrino', 'mass', 'ordering', 'the', 'sensitivity', 'of', 'an', 'experiment', 'to', 'these', 'effects', 'can', 'be', 'estimated', 'from', 'monte', 'carlo', 'simulations', 'with', 'the', 'high', 'number', 'of', 'events', 'that', 'will', 'be', 'collected', 'there', 'is', 'a', 'tradeoff', 'between', 'the', 'computational', 'expense', 'of', 'running', 'such', 'simulations', 'and', 'the', 'inherent', 'statistical', 'uncertainty', 'in', 'the', 'determined', 'values', 'in', 'such', 'a', 'scenario', 'it', 'becomes', 'impractical', 'to', 'produce', 'and', 'use', 'adequatelysized', 'sets', 'of', 'simulated', 'events', 'with', 'traditional', 'methods', 'such', 'as', 'monte', 'carlo', 'weighting', 'in', 'this', 'work', 'we', 'present', 'a', 'staged', 'approach', 'to', 'the', 'generation', 'of', 'binned', 'event', 'distributions', 'in', 'order', 'to', 'overcome', 'these', 'challenges', 'by', 'combining', 'multiple', 'integration', 'and', 'smoothing', 'techniques', 'which', 'address', 'limited', 'statistics', 'from', 'simulation', 'it', 'arrives', 'at', 'reliable', 'analysis', 'results', 'using', 'modest', 'computational', 'resources']]
|
[-0.062258009758956526, 0.12799411947124922, -0.06760283196919074, 0.1433771731274534, -0.05837458212005153, -0.0839233967724371, 0.06541335130627075, 0.37282553350884623, -0.2961253875400871, -0.40859926663887725, 0.12066883059483251, -0.29587720826982633, -0.07949142826701935, 0.23690424957759168, -0.027766205791435013, 0.07943347163989978, 0.12861381425228838, -0.05422205628814456, -0.09329746566132374, -0.23068120479519952, 0.2505724561266754, 0.14487281197694782, 0.2743844514432019, 0.02663826304551673, 0.11659979962341947, -0.02359701952042237, -0.08439790155445162, 0.043548506883145245, -0.11438203809731233, 0.09408518601502355, 0.2830207660325407, 0.15466563224358715, 0.2655733113132468, -0.4324703589209343, -0.21141950040417787, 0.15219121829172827, 0.1472075902155205, 0.1116052702695613, -0.07142061658669263, -0.2589734621243934, 0.06176567407426973, -0.20569118673670783, -0.09864896290603872, -0.09745095876663583, -0.06146984271807213, 0.025669540934047778, -0.28465567503366873, 0.07624601195310451, -0.0566745954310547, 0.04860625340769144, 0.03738459468379055, -0.11024510521403424, 0.027710974516270505, 0.12145129078361269, 0.07340031149414407, 0.012374124681092289, 0.09987377119330332, -0.13466804286174808, -0.13562656422974925, 0.38703672331757843, -0.030371088224418512, -0.19956124077087797, 0.20889425503842737, -0.15420538013520307, -0.14875766130687337, 0.13639653103317656, 0.19631424735974815, 0.07601763827451952, -0.14706783977094784, 0.022668534964769567, 0.04690384292617848, 0.18427994991780247, 0.01830390697243075, 0.02549782094038538, 0.2173037683509118, 0.23441743124467768, 0.04382154145533194, 0.08030028085819164, -0.1347439671987795, -0.07782866034580216, -0.29444157980320246, -0.09077612445881106, -0.19861480487791233, 0.0413684147324976, -0.07231940309100861, -0.1409067468660284, 0.3314660318412703, 0.2612086723140785, 0.19795823860865674, 0.028402188520923206, 0.339925277965424, 0.10408123512911827, 0.09547343476171516, 0.031516939419168624, 0.22073301328234501, 0.06194082391926738, 0.10491375898151364, -0.21533545301764667, 0.06824281075746076, -0.003468218642248683]
|
1,803.05391
|
On the Universal Approximation Property and Equivalence of Stochastic
Computing-based Neural Networks and Binary Neural Networks
|
Large-scale deep neural networks are both memory intensive and
computation-intensive, thereby posing stringent requirements on the computing
platforms. Hardware accelerations of deep neural networks have been extensively
investigated in both industry and academia. Specific forms of binary neural
networks (BNNs) and stochastic computing based neural networks (SCNNs) are
particularly appealing to hardware implementations since they can be
implemented almost entirely with binary operations. Despite the obvious
advantages in hardware implementation, these approximate computing techniques
are questioned by researchers in terms of accuracy and universal applicability.
Also it is important to understand the relative pros and cons of SCNNs and BNNs
in theory and in actual hardware implementations. In order to address these
concerns, in this paper we prove that the "ideal" SCNNs and BNNs satisfy the
universal approximation property with probability 1 (due to the stochastic
behavior). The proof is conducted by first proving the property for SCNNs from
the strong law of large numbers, and then using SCNNs as a "bridge" to prove
for BNNs. Based on the universal approximation property, we further prove that
SCNNs and BNNs exhibit the same energy complexity. In other words, they have
the same asymptotic energy consumption with the growing of network size. We
also provide a detailed analysis of the pros and cons of SCNNs and BNNs for
hardware implementations and conclude that SCNNs are more suitable for
hardware.
|
cs.LG stat.ML
|
largescale deep neural networks are both memory intensive and computationintensive thereby posing stringent requirements on the computing platforms hardware accelerations of deep neural networks have been extensively investigated in both industry and academia specific forms of binary neural networks bnns and stochastic computing based neural networks scnns are particularly appealing to hardware implementations since they can be implemented almost entirely with binary operations despite the obvious advantages in hardware implementation these approximate computing techniques are questioned by researchers in terms of accuracy and universal applicability also it is important to understand the relative pros and cons of scnns and bnns in theory and in actual hardware implementations in order to address these concerns in this paper we prove that the ideal scnns and bnns satisfy the universal approximation property with probability 1 due to the stochastic behavior the proof is conducted by first proving the property for scnns from the strong law of large numbers and then using scnns as a bridge to prove for bnns based on the universal approximation property we further prove that scnns and bnns exhibit the same energy complexity in other words they have the same asymptotic energy consumption with the growing of network size we also provide a detailed analysis of the pros and cons of scnns and bnns for hardware implementations and conclude that scnns are more suitable for hardware
|
[['largescale', 'deep', 'neural', 'networks', 'are', 'both', 'memory', 'intensive', 'and', 'computationintensive', 'thereby', 'posing', 'stringent', 'requirements', 'on', 'the', 'computing', 'platforms', 'hardware', 'accelerations', 'of', 'deep', 'neural', 'networks', 'have', 'been', 'extensively', 'investigated', 'in', 'both', 'industry', 'and', 'academia', 'specific', 'forms', 'of', 'binary', 'neural', 'networks', 'bnns', 'and', 'stochastic', 'computing', 'based', 'neural', 'networks', 'scnns', 'are', 'particularly', 'appealing', 'to', 'hardware', 'implementations', 'since', 'they', 'can', 'be', 'implemented', 'almost', 'entirely', 'with', 'binary', 'operations', 'despite', 'the', 'obvious', 'advantages', 'in', 'hardware', 'implementation', 'these', 'approximate', 'computing', 'techniques', 'are', 'questioned', 'by', 'researchers', 'in', 'terms', 'of', 'accuracy', 'and', 'universal', 'applicability', 'also', 'it', 'is', 'important', 'to', 'understand', 'the', 'relative', 'pros', 'and', 'cons', 'of', 'scnns', 'and', 'bnns', 'in', 'theory', 'and', 'in', 'actual', 'hardware', 'implementations', 'in', 'order', 'to', 'address', 'these', 'concerns', 'in', 'this', 'paper', 'we', 'prove', 'that', 'the', 'ideal', 'scnns', 'and', 'bnns', 'satisfy', 'the', 'universal', 'approximation', 'property', 'with', 'probability', '1', 'due', 'to', 'the', 'stochastic', 'behavior', 'the', 'proof', 'is', 'conducted', 'by', 'first', 'proving', 'the', 'property', 'for', 'scnns', 'from', 'the', 'strong', 'law', 'of', 'large', 'numbers', 'and', 'then', 'using', 'scnns', 'as', 'a', 'bridge', 'to', 'prove', 'for', 'bnns', 'based', 'on', 'the', 'universal', 'approximation', 'property', 'we', 'further', 'prove', 'that', 'scnns', 'and', 'bnns', 'exhibit', 'the', 'same', 'energy', 'complexity', 'in', 'other', 'words', 'they', 'have', 'the', 'same', 'asymptotic', 'energy', 'consumption', 'with', 'the', 'growing', 'of', 'network', 'size', 'we', 'also', 'provide', 'a', 'detailed', 'analysis', 'of', 'the', 'pros', 'and', 'cons', 'of', 'scnns', 'and', 'bnns', 'for', 'hardware', 'implementations', 'and', 'conclude', 'that', 'scnns', 'are', 'more', 'suitable', 'for', 'hardware']]
|
[-0.11713288041008103, 0.019372341556408924, -0.0742376538953592, 0.08798326514425404, -0.07888004109509585, -0.1709577675318009, 0.036220781997436995, 0.43523459716293333, -0.2716923752134986, -0.29822615123587753, 0.12130645022723446, -0.22952741149290862, -0.19344367606550997, 0.24152300365311238, -0.10189035098737163, 0.12386002882880195, 0.09419086436322574, 0.008264271373320002, -0.08309686676925253, -0.2825093998128573, 0.28318031977899044, 0.07587695846078704, 0.32641663178309205, 0.06906720361619006, 0.08965432778050064, -0.07017276476912758, -0.018485048205267623, -0.0009118606329235015, -0.07643028119696783, 0.16103544524595928, 0.2770919649921243, 0.18821665635619658, 0.3324344169003848, -0.49101090116738155, -0.18079298826156076, 0.09914066843762337, 0.1396692148017459, 0.05078172171283267, -0.04698950958896955, -0.26480514019530776, 0.14750153062216906, -0.19904277537280637, -0.07579285587852878, -0.14812155390806528, 0.03213095491842289, 0.08883651287606732, -0.1916298253352996, -0.008054023760623228, 0.08599962172727844, 0.06231803558192458, -0.002155163764362818, -0.1334130589928199, 0.030254992685128938, 0.11618707615816515, 0.034012539782007495, -0.017345214050800625, 0.10076195840818175, -0.1647823323374655, -0.139736459367408, 0.34835522413450715, 0.005350580781037686, -0.18597710709854764, 0.2117980664764174, -0.03910121268342508, -0.18780184712564565, 0.04315753155777698, 0.20053230087264617, 0.039308364544786145, -0.1445959194231007, 0.10869840027852648, 0.04086812843244506, 0.13454356547116839, 0.05080000897418166, 0.08692651615957094, 0.17310062835161216, 0.2064313560986834, 0.009251568447962601, 0.1323351840617336, -0.048829054626090544, -0.12657213423991912, -0.20888515751673492, -0.15078811132577802, -0.18385870845081687, 0.020107048881621743, -0.10302424977351717, -0.14018663929545605, 0.3633630731294859, 0.194769897255167, 0.15246018300259626, 0.14429655412646905, 0.35395725332364636, 0.0909541103273983, 0.11599078891585511, 0.14475629663316425, 0.21507768014226405, 0.10191787399212103, 0.1218439837638699, -0.1569759679926428, 0.09113880940036036, 0.030447926835899572]
|
1,803.05392
|
Automated Construction of Bounded-Loss Imperfect-Recall Abstractions in
Extensive-Form Games
|
Extensive-form games (EFGs) model finite sequential interactions between
players. The amount of memory required to represent these games is the main
bottleneck of algorithms for computing optimal strategies and the size of these
strategies is often impractical for real-world applications. A common approach
to tackle the memory bottleneck is to use information abstraction that removes
parts of information available to players thus reducing the number of decision
points in the game. However, existing information-abstraction techniques are
either specific for a particular domain, they do not provide any quality
guarantees, or they are applicable to very small subclasses of EFGs. We present
domain-independent abstraction methods for creating imperfect recall
abstractions in extensive-form games that allow computing strategies that are
(near) optimal in the original game. To this end, we introduce two novel
algorithms, FPIRA and CFR+IRA, based on fictitious play and counterfactual
regret minimization. These algorithms can start with an arbitrary domain
specific, or the coarsest possible, abstraction of the original game. The
algorithms iteratively detect the missing information they require for
computing a strategy for the abstract game that is (near) optimal in the
original game. This information is then included back into the abstract game.
Moreover, our algorithms are able to exploit imperfect-recall abstractions that
allow players to forget even history of their own actions. However, the
algorithms require traversing the complete unabstracted game tree. We
experimentally show that our algorithms can closely approximate Nash
equilibrium of large games using abstraction with as little as 0.9% of
information sets of the original game. Moreover, the results suggest that
memory savings increase with the increasing size of the original games.
|
cs.GT
|
extensiveform games efgs model finite sequential interactions between players the amount of memory required to represent these games is the main bottleneck of algorithms for computing optimal strategies and the size of these strategies is often impractical for realworld applications a common approach to tackle the memory bottleneck is to use information abstraction that removes parts of information available to players thus reducing the number of decision points in the game however existing informationabstraction techniques are either specific for a particular domain they do not provide any quality guarantees or they are applicable to very small subclasses of efgs we present domainindependent abstraction methods for creating imperfect recall abstractions in extensiveform games that allow computing strategies that are near optimal in the original game to this end we introduce two novel algorithms fpira and cfrira based on fictitious play and counterfactual regret minimization these algorithms can start with an arbitrary domain specific or the coarsest possible abstraction of the original game the algorithms iteratively detect the missing information they require for computing a strategy for the abstract game that is near optimal in the original game this information is then included back into the abstract game moreover our algorithms are able to exploit imperfectrecall abstractions that allow players to forget even history of their own actions however the algorithms require traversing the complete unabstracted game tree we experimentally show that our algorithms can closely approximate nash equilibrium of large games using abstraction with as little as 09 of information sets of the original game moreover the results suggest that memory savings increase with the increasing size of the original games
|
[['extensiveform', 'games', 'efgs', 'model', 'finite', 'sequential', 'interactions', 'between', 'players', 'the', 'amount', 'of', 'memory', 'required', 'to', 'represent', 'these', 'games', 'is', 'the', 'main', 'bottleneck', 'of', 'algorithms', 'for', 'computing', 'optimal', 'strategies', 'and', 'the', 'size', 'of', 'these', 'strategies', 'is', 'often', 'impractical', 'for', 'realworld', 'applications', 'a', 'common', 'approach', 'to', 'tackle', 'the', 'memory', 'bottleneck', 'is', 'to', 'use', 'information', 'abstraction', 'that', 'removes', 'parts', 'of', 'information', 'available', 'to', 'players', 'thus', 'reducing', 'the', 'number', 'of', 'decision', 'points', 'in', 'the', 'game', 'however', 'existing', 'informationabstraction', 'techniques', 'are', 'either', 'specific', 'for', 'a', 'particular', 'domain', 'they', 'do', 'not', 'provide', 'any', 'quality', 'guarantees', 'or', 'they', 'are', 'applicable', 'to', 'very', 'small', 'subclasses', 'of', 'efgs', 'we', 'present', 'domainindependent', 'abstraction', 'methods', 'for', 'creating', 'imperfect', 'recall', 'abstractions', 'in', 'extensiveform', 'games', 'that', 'allow', 'computing', 'strategies', 'that', 'are', 'near', 'optimal', 'in', 'the', 'original', 'game', 'to', 'this', 'end', 'we', 'introduce', 'two', 'novel', 'algorithms', 'fpira', 'and', 'cfrira', 'based', 'on', 'fictitious', 'play', 'and', 'counterfactual', 'regret', 'minimization', 'these', 'algorithms', 'can', 'start', 'with', 'an', 'arbitrary', 'domain', 'specific', 'or', 'the', 'coarsest', 'possible', 'abstraction', 'of', 'the', 'original', 'game', 'the', 'algorithms', 'iteratively', 'detect', 'the', 'missing', 'information', 'they', 'require', 'for', 'computing', 'a', 'strategy', 'for', 'the', 'abstract', 'game', 'that', 'is', 'near', 'optimal', 'in', 'the', 'original', 'game', 'this', 'information', 'is', 'then', 'included', 'back', 'into', 'the', 'abstract', 'game', 'moreover', 'our', 'algorithms', 'are', 'able', 'to', 'exploit', 'imperfectrecall', 'abstractions', 'that', 'allow', 'players', 'to', 'forget', 'even', 'history', 'of', 'their', 'own', 'actions', 'however', 'the', 'algorithms', 'require', 'traversing', 'the', 'complete', 'unabstracted', 'game', 'tree', 'we', 'experimentally', 'show', 'that', 'our', 'algorithms', 'can', 'closely', 'approximate', 'nash', 'equilibrium', 'of', 'large', 'games', 'using', 'abstraction', 'with', 'as', 'little', 'as', '09', 'of', 'information', 'sets', 'of', 'the', 'original', 'game', 'moreover', 'the', 'results', 'suggest', 'that', 'memory', 'savings', 'increase', 'with', 'the', 'increasing', 'size', 'of', 'the', 'original', 'games']]
|
[-0.08244844096852728, 0.041933107334208734, -0.11727473981675651, 0.12971060446416435, -0.10924766751961985, -0.19401242391272597, 0.1105858085161225, 0.4294460265433297, -0.29103826814460176, -0.3449772281610592, 0.1196695763582001, -0.23584542403081327, -0.15013060365691921, 0.1197163480545886, -0.15938605911932077, 0.05621065548185106, 0.11435245753358352, 0.05308642363350591, 0.0015287659829046423, -0.30722524694076386, 0.32528318008686996, 0.027961781223161557, 0.24253782581482153, 0.03573323606359964, 0.10580879829218785, -0.005362160773755989, -0.017243045889720154, 0.0672319333996861, -0.1030389016690306, 0.1364261085683766, 0.3377350813016812, 0.22758136282950528, 0.37765736358540225, -0.4607101155772861, -0.13668604630171163, 0.14700354398350313, 0.13950234652699184, 0.1580820152133159, -0.01537555389887608, -0.25301918374834065, 0.10450501962933752, -0.13466399211579522, -0.030874535939324828, -0.10736230621942797, -0.03545165295348143, 0.02120455862014216, -0.29496521027654077, -0.039458105356296465, 0.06051486388567402, 0.025566906943805656, -0.03369785635644912, -0.14629332043321225, 0.0009419090281962679, 0.19885949768415523, -0.015567473988292899, -0.014126413896390366, 0.139863827299808, -0.1466925921065084, -0.22365648656724238, 0.3658551946003339, -0.013034740884087227, -0.18295082053664918, 0.20032733955162435, -0.03665284581625423, -0.14334635397337364, 0.13566517339817036, 0.17755325524303636, 0.11829763857389657, -0.1323742466570621, 0.06257727352683415, -0.04792438668010526, 0.18974891649942832, 0.055975716494805136, 0.07475195726473931, 0.15187319703679183, 0.16289988988796808, 0.14340990476488147, 0.12932001563811096, 0.01005988878377605, -0.1827260990139212, -0.24226639350729712, -0.11962033507557174, -0.15993102883731716, -0.025259578156501684, -0.1124010067754133, -0.1734045600476727, 0.3217671952778927, 0.21237677543640768, 0.1277726945774246, 0.1252660965738811, 0.34863759873065164, 0.062147755106066946, 0.07579313648916076, 0.1277749619589707, 0.17034511784682824, 0.03809820708891984, 0.1549548609862418, -0.20546222351031895, 0.13674449028049626, 0.04352787763973844]
|
1,803.05393
|
The Witt vectors for Green functors
|
We define twisted Hochschild homology for Green functors. This construction
is the algebraic analogue of the relative topological Hochschild homology
$THH_{C_n}(-)$, and it describes the $E_2$ term of the K\"unneth spectral
sequence for relative $THH$. Applied to ordinary rings, we obtain new algebraic
invariants. Extending Hesselholt's construction of the Witt vectors of
noncommutative rings, we interpret our construction as providing Witt vectors
for Green functors.
|
math.AT math.GR math.KT
|
we define twisted hochschild homology for green functors this construction is the algebraic analogue of the relative topological hochschild homology thh_c_n and it describes the e_2 term of the kunneth spectral sequence for relative thh applied to ordinary rings we obtain new algebraic invariants extending hesselholts construction of the witt vectors of noncommutative rings we interpret our construction as providing witt vectors for green functors
|
[['we', 'define', 'twisted', 'hochschild', 'homology', 'for', 'green', 'functors', 'this', 'construction', 'is', 'the', 'algebraic', 'analogue', 'of', 'the', 'relative', 'topological', 'hochschild', 'homology', 'thh_c_n', 'and', 'it', 'describes', 'the', 'e_2', 'term', 'of', 'the', 'kunneth', 'spectral', 'sequence', 'for', 'relative', 'thh', 'applied', 'to', 'ordinary', 'rings', 'we', 'obtain', 'new', 'algebraic', 'invariants', 'extending', 'hesselholts', 'construction', 'of', 'the', 'witt', 'vectors', 'of', 'noncommutative', 'rings', 'we', 'interpret', 'our', 'construction', 'as', 'providing', 'witt', 'vectors', 'for', 'green', 'functors']]
|
[-0.2741354674799368, -0.009988940335460939, -0.15682482428383082, 0.15777084358705906, -0.1362857866261038, -0.1065190939571039, -0.07509195472630381, 0.28289795806631446, -0.4289222220395459, -0.17771044420078397, 0.07089790282770991, -0.15785806519852486, -0.17662187857786193, 0.1701440141769126, -0.20770771641400643, -0.05507289532943105, 0.008447291445918381, 0.060060472580516944, -0.1282434331224067, -0.2577321117860265, 0.4497905997413909, 0.01238341356292949, 0.203099923535774, 0.0056106330375769176, 0.06485735309979646, 0.04310252397408476, -0.10039958361085155, -0.1070790057128761, -0.1999026146804681, 0.18158504313032608, 0.37294447753811255, 0.017248277581529692, 0.06186509317922173, -0.3379399528785143, -0.047382866245698096, 0.1412985692586517, 0.11955234366905643, 0.06667104505686439, 0.002847534582542721, -0.27276749722500426, 0.13405377519666217, -0.2861411624962784, -0.1332670239644358, -0.1372537851857487, 0.09299480338086141, 0.032062732105259784, -0.22353767702588812, -0.02379793501313543, 0.09646977940542456, 0.1353344746021321, -0.12436381531006191, -0.09919173369053169, -0.06609553780799615, 0.10416187072405592, -0.05383460867233225, 0.032278824008244555, 0.14499814138252987, -0.03499828601707122, -0.18286397980409674, 0.3386809556395747, -0.09473024845283362, -0.1669396641741514, 0.08454709846409969, -0.10940199697506614, -0.20403117319801822, 0.14380722459463868, -0.050566376390634105, 0.16871057226671837, 0.04899965199001599, 0.19721030036362208, -0.10411111285065999, 0.016570626619795803, 0.1524558376695495, 0.06952195288613439, 0.17298947602103, 0.024468920802974026, 0.05287871431210078, 0.21205480601929594, 0.013645618229929823, -0.07190645682567265, -0.33697729447158054, -0.29690275888196993, -0.11397202293301234, 0.192461156155332, -0.11986504086212335, -0.2087987002742011, 0.4647401284018997, 0.12709262338103144, 0.16627328484901227, 0.21554956409090664, 0.25053618866877514, 0.07163623894302873, 0.10485229923506267, -0.035101319597742986, 0.07506837877008365, 0.32642810727702454, 0.0500836564679048, -0.1169002060269122, -0.08588175114709884, 0.35743918398657115]
|
1,803.05394
|
Super-positivity of a family of L-functions in the level aspect
|
An automorphic self dual L-function has the super-positivity property if all
derivatives of the completed L-function at the central point $s=1/2$ are
non-negative and all derivatives at a real point $s > 1/2$ are positive. In
this paper we prove that at least 12% of L-functions associated to Hecke basis
cusp forms of weight $2$ and large prime level $q$ have the super-positivity
property. It is also shown that at least 49% of such L-functions have no real
zeros on $ \Re(s) > 0$ except possibly at $s = 1/2.$
|
math.NT
|
an automorphic self dual lfunction has the superpositivity property if all derivatives of the completed lfunction at the central point s12 are nonnegative and all derivatives at a real point s 12 are positive in this paper we prove that at least 12 of lfunctions associated to hecke basis cusp forms of weight 2 and large prime level q have the superpositivity property it is also shown that at least 49 of such lfunctions have no real zeros on res 0 except possibly at s 12
|
[['an', 'automorphic', 'self', 'dual', 'lfunction', 'has', 'the', 'superpositivity', 'property', 'if', 'all', 'derivatives', 'of', 'the', 'completed', 'lfunction', 'at', 'the', 'central', 'point', 's12', 'are', 'nonnegative', 'and', 'all', 'derivatives', 'at', 'a', 'real', 'point', 's', '12', 'are', 'positive', 'in', 'this', 'paper', 'we', 'prove', 'that', 'at', 'least', '12', 'of', 'lfunctions', 'associated', 'to', 'hecke', 'basis', 'cusp', 'forms', 'of', 'weight', '2', 'and', 'large', 'prime', 'level', 'q', 'have', 'the', 'superpositivity', 'property', 'it', 'is', 'also', 'shown', 'that', 'at', 'least', '49', 'of', 'such', 'lfunctions', 'have', 'no', 'real', 'zeros', 'on', 'res', '0', 'except', 'possibly', 'at', 's', '12']]
|
[-0.20901652382074876, 0.060569650034838475, -0.10504883118948444, 0.05334991814438687, -0.04702356461500532, -0.16333933646227558, -0.01711203985127382, 0.3076628177253486, -0.24102456799470062, -0.21804360006286136, 0.12602630592097508, -0.35698040912664214, -0.10859955065385547, 0.17612753286524568, 0.0022156498459882513, 0.032143253337613545, 0.008885448040483995, 0.16897496755429825, -0.08939817030697542, -0.331712679027818, 0.36936861902020524, -0.022174221244207475, 0.15268757174787825, 0.06704891421615558, 0.11164953190086106, -0.015761619190100665, 0.06407419982539533, -0.14182999327259008, -0.08250306375127768, 0.07868578801267283, 0.3061551078937428, 0.014189556546964098, 0.30041333899270134, -0.3567644955677002, -0.09137593438377777, 0.2298998081905031, 0.11000197332049179, -0.06596722786293127, 0.02348891574331711, -0.18597339607536967, 0.19402901990864382, -0.15955138308277658, -0.2102193422182355, -0.06399509291229553, 0.09095943751636633, 0.0035255214275229114, -0.28083792477196384, 0.042346424106061785, 0.059732734886279636, 0.18665385821314398, -0.08022793288191044, -0.2754367224081571, -0.05104952160983758, 0.04619035464278314, 0.043634965449983125, 0.09860005274687103, 0.04227953810288116, -0.1158453589332355, -0.09611750361076447, 0.2841641863613108, -0.028716623793940906, -0.170243265562106, 0.1336762028486403, -0.2929728299021981, -0.22708537619084465, 0.17672043165928403, 0.07555629423992752, 0.10388618856560179, -0.036144902500551364, 0.17366887517354646, -0.09986150713074346, 0.09882177709572039, 0.15848046813030228, -0.06069019301604956, 0.21581920621873335, -0.018409356279948424, 0.09628657980410513, 0.07114148684669026, -0.0645113063544349, -0.016561146506086685, -0.36544419502362957, -0.19113199299114736, -0.19391925794581427, 0.11500776707476308, -0.10188079570104681, -0.1296804029136479, 0.35489266907233136, 0.08764835375057924, 0.20098634207144725, 0.1226235570719054, 0.1485216112937345, 0.17878666116726086, 0.11119293495146342, 0.10744710473971832, 0.1212780591219577, 0.12546743017209824, 0.011978823123066577, -0.12088315179679802, 0.005039936656113389, 0.1041684422620334]
|
1,803.05395
|
Shift-invert diagonalization of large many-body localizing spin chains
|
We provide a pedagogical review on the calculation of highly excited
eigenstates of disordered interacting quantum systems which can undergo a
many-body localization (MBL) transition, using shift-invert exact
diagonalization. We also provide an example code at
https://bitbucket.org/dluitz/sinvert_mbl/. Through a detailed analysis of the
simulational parameters of the random field Heisenberg spin chain, we provide a
practical guide on how to perform efficient computations. We present data for
mid-spectrum eigenstates of spin chains of sizes up to $L=26$. This work is
also geared towards readers with interest in efficiency of parallel sparse
linear algebra techniques that will find a challenging application in the MBL
problem.
|
cond-mat.dis-nn physics.comp-ph
|
we provide a pedagogical review on the calculation of highly excited eigenstates of disordered interacting quantum systems which can undergo a manybody localization mbl transition using shiftinvert exact diagonalization we also provide an example code at httpsbitbucketorgdluitzsinvert_mbl through a detailed analysis of the simulational parameters of the random field heisenberg spin chain we provide a practical guide on how to perform efficient computations we present data for midspectrum eigenstates of spin chains of sizes up to l26 this work is also geared towards readers with interest in efficiency of parallel sparse linear algebra techniques that will find a challenging application in the mbl problem
|
[['we', 'provide', 'a', 'pedagogical', 'review', 'on', 'the', 'calculation', 'of', 'highly', 'excited', 'eigenstates', 'of', 'disordered', 'interacting', 'quantum', 'systems', 'which', 'can', 'undergo', 'a', 'manybody', 'localization', 'mbl', 'transition', 'using', 'shiftinvert', 'exact', 'diagonalization', 'we', 'also', 'provide', 'an', 'example', 'code', 'at', 'httpsbitbucketorgdluitzsinvert_mbl', 'through', 'a', 'detailed', 'analysis', 'of', 'the', 'simulational', 'parameters', 'of', 'the', 'random', 'field', 'heisenberg', 'spin', 'chain', 'we', 'provide', 'a', 'practical', 'guide', 'on', 'how', 'to', 'perform', 'efficient', 'computations', 'we', 'present', 'data', 'for', 'midspectrum', 'eigenstates', 'of', 'spin', 'chains', 'of', 'sizes', 'up', 'to', 'l26', 'this', 'work', 'is', 'also', 'geared', 'towards', 'readers', 'with', 'interest', 'in', 'efficiency', 'of', 'parallel', 'sparse', 'linear', 'algebra', 'techniques', 'that', 'will', 'find', 'a', 'challenging', 'application', 'in', 'the', 'mbl', 'problem']]
|
[-0.13529020791547824, 0.13347088235096433, -0.07270325678265066, 0.04388861012310513, -0.05951024905679006, -0.16374417345120923, 0.052824937978090306, 0.397690478531481, -0.20728913721293935, -0.24623547246661578, 0.09272253411161957, -0.2621889613677286, -0.151962501182248, 0.21519764204446262, 0.022889753352130567, 0.055293010739898944, 0.13022811405216028, 0.012021665089227964, -0.13620017610210022, -0.20844990006892136, 0.2487836382216186, 0.08622723650435908, 0.25121662548734147, 0.0577221449071234, 0.049942472600378096, 0.04343431925364924, 0.03591904900425557, -0.024846780665435837, -0.17568469827451338, 0.1347338348588662, 0.31786946912332287, 0.0821142623888202, 0.2543822012624694, -0.4459470649457817, -0.16687054868145548, 0.030963035804463676, 0.21212705053859254, 0.21234855077848816, -0.08815187442984468, -0.3025017822143233, 0.0367497415620906, -0.20933822732536322, -0.13453276364982708, -0.16102296592061888, 2.410482203822981e-05, -0.017319959344215763, -0.24809896335620613, 0.0719236790409393, 0.062346482635882584, 0.10719712369496599, -0.0011256467822251968, -0.06570984210674334, 0.05031485400768449, 0.1323470757614134, -0.0024642772626869824, -0.007847365412354758, 0.130754523928666, -0.0802068401024071, -0.1526784936985616, 0.3697213170941449, -0.035790522912860785, -0.21300305160286936, 0.20131522152364906, -0.08005669550490972, -0.19911880476300794, 0.12753683700253374, 0.20458962099888878, 0.12418266286332051, -0.1241800797508704, 0.08561098501900012, -0.037218320618600594, 0.17138766794628238, -0.06276638879106172, 0.04934008151871487, 0.23044232713302723, 0.19068204191992583, 0.08399136303426716, 0.20440205599823333, -0.0339626956740123, -0.12423800242142481, -0.25753582534787145, -0.14214509822658797, -0.22342020578827093, 0.09533231920739003, -0.050511863055521425, -0.19813194746169652, 0.42311779431347707, 0.23844180889151634, 0.16491939482794513, 0.0593023190842218, 0.25947578884751615, 0.10124708064922212, -0.011817327763849092, 0.050477523989613776, 0.18187924971220815, 0.14794702521407777, 0.09828300942730123, -0.23571085214085913, -0.02048976182964748, 0.06087838864921438]
|
1,803.05396
|
$H$-colouring $P_t$-free graphs in subexponential time
|
A graph is called $P_t$-free if it does not contain the path on $t$ vertices
as an induced subgraph. Let $H$ be a multigraph with the property that any two
distinct vertices share at most one common neighbour. We show that the
generating function for (list) graph homomorphisms from $G$ to $H$ can be
calculated in subexponential time $2^{O\left(\sqrt{tn\log(n)}\right)}$ for
$n=|V(G)|$ in the class of $P_t$-free graphs $G$. As a corollary, we show that
the number of 3-colourings of a $P_t$-free graph $G$ can be found in
subexponential time. On the other hand, no subexponential time algorithm exists
for 4-colourability of $P_t$-free graphs assuming the Exponential Time
Hypothesis. Along the way, we prove that $P_t$-free graphs have pathwidth that
is linear in their maximum degree.
|
cs.DM math.CO
|
a graph is called p_tfree if it does not contain the path on t vertices as an induced subgraph let h be a multigraph with the property that any two distinct vertices share at most one common neighbour we show that the generating function for list graph homomorphisms from g to h can be calculated in subexponential time 2oleftsqrttnlognright for nvg in the class of p_tfree graphs g as a corollary we show that the number of 3colourings of a p_tfree graph g can be found in subexponential time on the other hand no subexponential time algorithm exists for 4colourability of p_tfree graphs assuming the exponential time hypothesis along the way we prove that p_tfree graphs have pathwidth that is linear in their maximum degree
|
[['a', 'graph', 'is', 'called', 'p_tfree', 'if', 'it', 'does', 'not', 'contain', 'the', 'path', 'on', 't', 'vertices', 'as', 'an', 'induced', 'subgraph', 'let', 'h', 'be', 'a', 'multigraph', 'with', 'the', 'property', 'that', 'any', 'two', 'distinct', 'vertices', 'share', 'at', 'most', 'one', 'common', 'neighbour', 'we', 'show', 'that', 'the', 'generating', 'function', 'for', 'list', 'graph', 'homomorphisms', 'from', 'g', 'to', 'h', 'can', 'be', 'calculated', 'in', 'subexponential', 'time', '2oleftsqrttnlognright', 'for', 'nvg', 'in', 'the', 'class', 'of', 'p_tfree', 'graphs', 'g', 'as', 'a', 'corollary', 'we', 'show', 'that', 'the', 'number', 'of', '3colourings', 'of', 'a', 'p_tfree', 'graph', 'g', 'can', 'be', 'found', 'in', 'subexponential', 'time', 'on', 'the', 'other', 'hand', 'no', 'subexponential', 'time', 'algorithm', 'exists', 'for', '4colourability', 'of', 'p_tfree', 'graphs', 'assuming', 'the', 'exponential', 'time', 'hypothesis', 'along', 'the', 'way', 'we', 'prove', 'that', 'p_tfree', 'graphs', 'have', 'pathwidth', 'that', 'is', 'linear', 'in', 'their', 'maximum', 'degree']]
|
[-0.1595610266142502, 0.14227645763688687, -0.09153660760465555, 0.030225802127771626, -0.12882121608448707, -0.14914644323289394, 0.02811306237992717, 0.4457201647867517, -0.3027936670128483, -0.3075996784387323, 0.07939101394021703, -0.2843565202764864, -0.13174862237420024, 0.1602640488616577, -0.06154617835290548, -0.01292741909359082, 0.1190449191802522, 0.15316517002941146, 0.030891568991507034, -0.2614759926689406, 0.27649088218671886, -0.06651949622607752, 0.15057494373219768, 0.08511559768178599, 0.08121772329758369, 0.005420688956188477, 0.019739550091629105, 0.1093494926401361, -0.15088997110001587, -0.009224917012743833, 0.2573123023186515, 0.17417468695250166, 0.26744421817574315, -0.38762587754101285, -0.17894386284136615, 0.280580182453784, 0.12271767666817045, 0.04462125203837224, -0.016925521259294536, -0.18573550380221227, 0.16652341243788238, -0.09694584077747058, -0.08493839960727023, 0.009810430391472044, 0.11200958913631313, 0.010192786568654626, -0.27929835560224286, -0.005274803305756513, 0.137269403092654, 0.013177761766393252, 0.0836362445185612, -0.14600224757370184, -0.06883405552556117, 0.08705594339900143, -0.04924276543448005, 0.10158157265343802, 0.023646347485936997, -0.09068265123239802, -0.19222376599805657, 0.3691516175517828, -0.10446369354953854, -0.14213951723271512, 0.12763721690081606, -0.15630500118164875, -0.2261033464257219, 0.1084575603784221, 0.13052141595048813, 0.1629145611077547, -0.10160013932234994, 0.15160284326903947, -0.14002395406880272, 0.15474201524743764, 0.108147716588848, 0.015458596479412683, 0.09021547862795433, 0.08938079784487987, 0.18186153440615085, 0.15333482762940637, 0.016876082102639405, 0.03395633664875617, -0.30747566439544527, -0.13016236713345397, -0.2646375095464168, 0.07315457730596162, -0.20992367883871604, -0.20074644449310816, 0.40932148798724743, 0.08948606035550981, 0.21596932441102173, 0.16601081692227504, 0.18574397867958145, 0.09653322183057605, 0.09162393047254745, 0.20698354684678427, 0.11432671029029823, 0.11895175500984902, -0.0608354175682899, -0.16822000237643658, 0.1343633112463555, 0.14767060822776965]
|
1,803.05397
|
Redundancy Techniques for Straggler Mitigation in Distributed
Optimization and Learning
|
Performance of distributed optimization and learning systems is bottlenecked
by "straggler" nodes and slow communication links, which significantly delay
computation. We propose a distributed optimization framework where the dataset
is "encoded" to have an over-complete representation with built-in redundancy,
and the straggling nodes in the system are dynamically left out of the
computation at every iteration, whose loss is compensated by the embedded
redundancy. We show that oblivious application of several popular optimization
algorithms on encoded data, including gradient descent, L-BFGS, proximal
gradient under data parallelism, and coordinate descent under model
parallelism, converge to either approximate or exact solutions of the original
problem when stragglers are treated as erasures. These convergence results are
deterministic, i.e., they establish sample path convergence for arbitrary
sequences of delay patterns or distributions on the nodes, and are independent
of the tail behavior of the delay distribution. We demonstrate that equiangular
tight frames have desirable properties as encoding matrices, and propose
efficient mechanisms for encoding large-scale data. We implement the proposed
technique on Amazon EC2 clusters, and demonstrate its performance over several
learning problems, including matrix factorization, LASSO, ridge regression and
logistic regression, and compare the proposed method with uncoded,
asynchronous, and data replication strategies.
|
stat.ML cs.DC cs.LG math.OC
|
performance of distributed optimization and learning systems is bottlenecked by straggler nodes and slow communication links which significantly delay computation we propose a distributed optimization framework where the dataset is encoded to have an overcomplete representation with builtin redundancy and the straggling nodes in the system are dynamically left out of the computation at every iteration whose loss is compensated by the embedded redundancy we show that oblivious application of several popular optimization algorithms on encoded data including gradient descent lbfgs proximal gradient under data parallelism and coordinate descent under model parallelism converge to either approximate or exact solutions of the original problem when stragglers are treated as erasures these convergence results are deterministic ie they establish sample path convergence for arbitrary sequences of delay patterns or distributions on the nodes and are independent of the tail behavior of the delay distribution we demonstrate that equiangular tight frames have desirable properties as encoding matrices and propose efficient mechanisms for encoding largescale data we implement the proposed technique on amazon ec2 clusters and demonstrate its performance over several learning problems including matrix factorization lasso ridge regression and logistic regression and compare the proposed method with uncoded asynchronous and data replication strategies
|
[['performance', 'of', 'distributed', 'optimization', 'and', 'learning', 'systems', 'is', 'bottlenecked', 'by', 'straggler', 'nodes', 'and', 'slow', 'communication', 'links', 'which', 'significantly', 'delay', 'computation', 'we', 'propose', 'a', 'distributed', 'optimization', 'framework', 'where', 'the', 'dataset', 'is', 'encoded', 'to', 'have', 'an', 'overcomplete', 'representation', 'with', 'builtin', 'redundancy', 'and', 'the', 'straggling', 'nodes', 'in', 'the', 'system', 'are', 'dynamically', 'left', 'out', 'of', 'the', 'computation', 'at', 'every', 'iteration', 'whose', 'loss', 'is', 'compensated', 'by', 'the', 'embedded', 'redundancy', 'we', 'show', 'that', 'oblivious', 'application', 'of', 'several', 'popular', 'optimization', 'algorithms', 'on', 'encoded', 'data', 'including', 'gradient', 'descent', 'lbfgs', 'proximal', 'gradient', 'under', 'data', 'parallelism', 'and', 'coordinate', 'descent', 'under', 'model', 'parallelism', 'converge', 'to', 'either', 'approximate', 'or', 'exact', 'solutions', 'of', 'the', 'original', 'problem', 'when', 'stragglers', 'are', 'treated', 'as', 'erasures', 'these', 'convergence', 'results', 'are', 'deterministic', 'ie', 'they', 'establish', 'sample', 'path', 'convergence', 'for', 'arbitrary', 'sequences', 'of', 'delay', 'patterns', 'or', 'distributions', 'on', 'the', 'nodes', 'and', 'are', 'independent', 'of', 'the', 'tail', 'behavior', 'of', 'the', 'delay', 'distribution', 'we', 'demonstrate', 'that', 'equiangular', 'tight', 'frames', 'have', 'desirable', 'properties', 'as', 'encoding', 'matrices', 'and', 'propose', 'efficient', 'mechanisms', 'for', 'encoding', 'largescale', 'data', 'we', 'implement', 'the', 'proposed', 'technique', 'on', 'amazon', 'ec2', 'clusters', 'and', 'demonstrate', 'its', 'performance', 'over', 'several', 'learning', 'problems', 'including', 'matrix', 'factorization', 'lasso', 'ridge', 'regression', 'and', 'logistic', 'regression', 'and', 'compare', 'the', 'proposed', 'method', 'with', 'uncoded', 'asynchronous', 'and', 'data', 'replication', 'strategies']]
|
[-0.14829570959322155, 0.005983417252500658, -0.07156579474220053, 0.05987906767462846, -0.05272327629616484, -0.21472822807962075, 0.0745709878631169, 0.4733212167210877, -0.3339611806022003, -0.3023464997136034, 0.1296741084131645, -0.2605535656827851, -0.16831325901090166, 0.16428297622012905, -0.11400709365872899, 0.12132994946994585, 0.12834196589654312, 0.028720489154802634, -0.06897513571020682, -0.32582910017576067, 0.2686464072682429, 0.05517993861343712, 0.31609495891840195, -0.049750311046955174, 0.14164283118094317, 0.007702331690816209, -0.020618853562045843, -0.01214069098001346, -0.03636755871099012, 0.13598359039373464, 0.26964056784752755, 0.21644910751518182, 0.31442869117017835, -0.41741990672100654, -0.17819618086330594, 0.11165429220869555, 0.19027275265194477, 0.08269801520451438, -0.06382321407494601, -0.27360777705442163, 0.11385254638968036, -0.1473217028309591, -0.014432107426109723, -0.13642698505544104, -0.030781314156483858, 0.07668517530313693, -0.30850093287648633, 0.05768822979182005, 0.037349131850642155, 0.039038166510872545, -0.038171463376493193, -0.13617358603223692, 0.038738122961949555, 0.08482813102382351, 0.03902233007305767, -0.0014799740398302673, 0.1586429364324431, -0.07425473000155762, -0.16463778180885127, 0.3594294525613077, -0.009958659169496968, -0.22182024856563656, 0.16428464379503566, 0.01409960537999723, -0.13208031478337945, 0.1018877130956389, 0.26012027877397487, 0.12474921812536195, -0.1514372231617017, 0.06326995251642074, -0.020310219040839003, 0.137586850351654, 0.073680346023757, 0.06031879634829238, 0.09116978228197695, 0.1612004694735515, 0.12528908441308886, 0.1471171465748921, -0.09293407187913544, -0.14140688157174736, -0.2243100276007317, -0.10848208760377019, -0.1842401314608287, -0.0330837932229042, -0.17649773621858914, -0.1623579374747351, 0.34011548532638697, 0.13339913047617302, 0.19605014622211456, 0.15497722113686904, 0.3617100897058845, 0.08296801909222268, 0.09276599474862451, 0.20107672768877818, 0.1416797213081736, 0.10014707863563671, 0.08547650714346673, -0.22669709736481308, 0.11297969083898352, 0.055115272689581614]
|
1,803.05398
|
Model of a motion of substance in a channel of a network consisting of
two arms
|
We study the problem of the motion of substance in a channel of a network for
the case of channel having two arms. Stationary regime of the flow of the
substance is considered. Analytical relationships for the distribution of the
substance in the nodes of the arms of the channel are obtained. The obtained
results are discussed from the point of view of technological applications of
the model (e.g., motion of substances such as water in complex technological
facilities).
|
nlin.AO stat.AP
|
we study the problem of the motion of substance in a channel of a network for the case of channel having two arms stationary regime of the flow of the substance is considered analytical relationships for the distribution of the substance in the nodes of the arms of the channel are obtained the obtained results are discussed from the point of view of technological applications of the model eg motion of substances such as water in complex technological facilities
|
[['we', 'study', 'the', 'problem', 'of', 'the', 'motion', 'of', 'substance', 'in', 'a', 'channel', 'of', 'a', 'network', 'for', 'the', 'case', 'of', 'channel', 'having', 'two', 'arms', 'stationary', 'regime', 'of', 'the', 'flow', 'of', 'the', 'substance', 'is', 'considered', 'analytical', 'relationships', 'for', 'the', 'distribution', 'of', 'the', 'substance', 'in', 'the', 'nodes', 'of', 'the', 'arms', 'of', 'the', 'channel', 'are', 'obtained', 'the', 'obtained', 'results', 'are', 'discussed', 'from', 'the', 'point', 'of', 'view', 'of', 'technological', 'applications', 'of', 'the', 'model', 'eg', 'motion', 'of', 'substances', 'such', 'as', 'water', 'in', 'complex', 'technological', 'facilities']]
|
[-0.17895612941135333, 0.07285264398478254, -0.035969262129238136, -0.007933451344636328, 0.001391557487364434, -0.08927203521509713, 0.05957442937017996, 0.33237400061533423, -0.27415438052974167, -0.2864007539575613, 0.11416684001053483, -0.2944580713475618, -0.12527460161643691, 0.19174625410674775, -0.02337029701853289, 0.05536041623335096, 0.04093919294780191, 0.08482409611674427, -0.0017039126162476177, -0.15042541951200442, 0.3442893089325745, 0.01820116972291394, 0.26267224033893666, 0.03074026417835981, 0.11595395381880712, -0.017080855396682325, -0.03470554025519545, 0.011738099722203481, -0.12538098861887767, 0.12031530694817959, 0.24151456882422673, 0.1212785229075087, 0.24435447962789597, -0.4487378738018908, -0.26907507980926126, 0.06269458384264874, 0.10983209793298959, 0.10631773195264838, -0.0359944206503326, -0.29876755804849103, 0.049655320270199185, -0.14988777398330172, -0.16212949601202448, 0.04546104623830017, 0.0027270566353786597, 0.09929131193947094, -0.2609820930829531, 0.0739581217706392, 0.06541830808207204, 0.04867294973021821, -0.10140683838531753, -0.15065293358285217, -0.007974160104235517, 0.21691048220743106, 0.07737478171033148, -0.03471823240913262, 0.15020662400565005, -0.24637624502323474, -0.09423366373793894, 0.4208448859921928, -0.03162613211647619, -0.19909910973208614, 0.1682731281233586, -0.16546841196810144, -0.07385826048948153, 0.10729729361784986, 0.2015229867494229, 0.12030210819602295, -0.17189188103509856, 0.04205696746895585, -0.05366723543575293, 0.06221903540095303, 0.04409769169184603, 0.04745062077535859, 0.2167135984224232, 0.21799104142038128, 0.039153894692470756, 0.18158282895124506, -0.11451124006151399, -0.14912977538814273, -0.3037097732406817, -0.21071020045164454, -0.20137467118616723, -0.003998070849176449, -0.09850074507626175, -0.14528968149819707, 0.403140821505951, 0.12335011951295258, 0.17281325828708424, -0.005195486052787002, 0.2578476810285562, 0.06143614792270893, 0.012158439388569397, 0.021394382614076515, 0.26046923245008613, 0.1143109958760346, 0.1284144483565624, -0.19197402362817828, 0.10302873330096467, -0.021804520285605818]
|
1,803.05399
|
Which differences can be expected when two universities in the Leiden
Ranking are compared? Some benchmarks for institutional research evaluations
|
The comparison of two universities in terms of bibliometric indicators
frequently faces the problem of assessing the differences as meaningful or not.
This Letter to the Editor proposes some benchmarks which can be used for
supporting the interpretation of institutional differences.
|
cs.DL
|
the comparison of two universities in terms of bibliometric indicators frequently faces the problem of assessing the differences as meaningful or not this letter to the editor proposes some benchmarks which can be used for supporting the interpretation of institutional differences
|
[['the', 'comparison', 'of', 'two', 'universities', 'in', 'terms', 'of', 'bibliometric', 'indicators', 'frequently', 'faces', 'the', 'problem', 'of', 'assessing', 'the', 'differences', 'as', 'meaningful', 'or', 'not', 'this', 'letter', 'to', 'the', 'editor', 'proposes', 'some', 'benchmarks', 'which', 'can', 'be', 'used', 'for', 'supporting', 'the', 'interpretation', 'of', 'institutional', 'differences']]
|
[-0.07218807124782627, 0.01513856358644439, -0.08743213324966591, 0.14800460621566944, -0.10120783923420965, -0.08022291083797449, 0.07830568825508036, 0.3782374401826684, -0.23046742970260178, -0.3762596622109413, 0.10615224635126297, -0.29506834578223345, -0.15350843437311307, 0.20365479851436868, -0.1346125330139951, 0.021905307771592605, 0.07032095818076192, 0.015353103168308735, -0.050982437505409484, -0.2518737541920528, 0.3259626759625063, 0.058619355373993154, 0.3043744404822951, 0.12500653026352931, -5.011276977999908e-05, -0.09100973517946308, -0.12150646362271977, 0.06833569077411439, -0.06549712283559507, 0.2266101768984255, 0.37555100968698174, 0.2137772562209426, 0.3406482394330385, -0.39414203030670564, -0.14904530307777772, 0.11919221443283122, 0.1520453968323858, 0.04272770472495567, 0.017228244715824542, -0.27687145142657, 0.039681891981716746, -0.20083676695414795, -0.054759824875651335, -0.06638801381809682, -0.002579035593775987, 0.004140928841945602, -0.22963747283352948, 0.057518988207448274, 0.03457289943244399, 0.15608579415555407, -0.021088234353356244, -0.15447432384258364, 0.030269611649578664, 0.23839790950438416, 0.1122526700591396, 0.0008976811077445745, 0.11889147505209577, -0.12245093358158157, -0.1828430365776734, 0.4617520454453259, -0.011634122398568363, -0.22326756952466761, 0.21331086073343347, -0.08523532331398712, -0.1617912284393863, -0.0352173615474163, 0.19556816358391832, 0.055990988615809416, -0.18887383390854046, -0.029207737082842647, -0.046542018038652294, 0.15709510986216185, 0.1049298789897343, 0.04354474116571066, 0.23973427567540145, 0.12535385049527464, -0.013863489304373904, 0.1286023228923313, -0.0391211633048043, -0.061173191339504426, -0.3186171415897949, -0.19893999688509034, -0.12887935556198765, -0.03868550536891434, -0.10038408497348428, -0.2250506043797586, 0.4422062810328675, 0.1800072727747625, 0.13987459891998186, -0.0193555763803377, 0.2797528719756661, 0.06472025920421158, 0.05685089578534045, 0.036977694846871426, 0.20285349890444904, 0.009953812900476339, 0.13405617381014476, -0.15499830480505963, 0.1703161512524253, 0.031491437262469314]
|
1,803.054
|
Image Colorization with Generative Adversarial Networks
|
Over the last decade, the process of automatic image colorization has been of
significant interest for several application areas including restoration of
aged or degraded images. This problem is highly ill-posed due to the large
degrees of freedom during the assignment of color information. Many of the
recent developments in automatic colorization involve images that contain a
common theme or require highly processed data such as semantic maps as input.
In our approach, we attempt to fully generalize the colorization procedure
using a conditional Deep Convolutional Generative Adversarial Network (DCGAN),
extend current methods to high-resolution images and suggest training
strategies that speed up the process and greatly stabilize it. The network is
trained over datasets that are publicly available such as CIFAR-10 and
Places365. The results of the generative model and traditional deep neural
networks are compared.
|
cs.CV
|
over the last decade the process of automatic image colorization has been of significant interest for several application areas including restoration of aged or degraded images this problem is highly illposed due to the large degrees of freedom during the assignment of color information many of the recent developments in automatic colorization involve images that contain a common theme or require highly processed data such as semantic maps as input in our approach we attempt to fully generalize the colorization procedure using a conditional deep convolutional generative adversarial network dcgan extend current methods to highresolution images and suggest training strategies that speed up the process and greatly stabilize it the network is trained over datasets that are publicly available such as cifar10 and places365 the results of the generative model and traditional deep neural networks are compared
|
[['over', 'the', 'last', 'decade', 'the', 'process', 'of', 'automatic', 'image', 'colorization', 'has', 'been', 'of', 'significant', 'interest', 'for', 'several', 'application', 'areas', 'including', 'restoration', 'of', 'aged', 'or', 'degraded', 'images', 'this', 'problem', 'is', 'highly', 'illposed', 'due', 'to', 'the', 'large', 'degrees', 'of', 'freedom', 'during', 'the', 'assignment', 'of', 'color', 'information', 'many', 'of', 'the', 'recent', 'developments', 'in', 'automatic', 'colorization', 'involve', 'images', 'that', 'contain', 'a', 'common', 'theme', 'or', 'require', 'highly', 'processed', 'data', 'such', 'as', 'semantic', 'maps', 'as', 'input', 'in', 'our', 'approach', 'we', 'attempt', 'to', 'fully', 'generalize', 'the', 'colorization', 'procedure', 'using', 'a', 'conditional', 'deep', 'convolutional', 'generative', 'adversarial', 'network', 'dcgan', 'extend', 'current', 'methods', 'to', 'highresolution', 'images', 'and', 'suggest', 'training', 'strategies', 'that', 'speed', 'up', 'the', 'process', 'and', 'greatly', 'stabilize', 'it', 'the', 'network', 'is', 'trained', 'over', 'datasets', 'that', 'are', 'publicly', 'available', 'such', 'as', 'cifar10', 'and', 'places365', 'the', 'results', 'of', 'the', 'generative', 'model', 'and', 'traditional', 'deep', 'neural', 'networks', 'are', 'compared']]
|
[-0.009800657636764711, -0.0009199643055534493, -0.04322635743386336, 0.04967301882082536, -0.09632778130675645, -0.14313734158955133, -0.008389680175600153, 0.47490756719774246, -0.2792238306940744, -0.3470763241341949, 0.13824282109271735, -0.2772629445887776, -0.19242843338730234, 0.19879469604836436, -0.16728992149043476, 0.11411829623835583, 0.17175033193652647, 0.018942941128051956, -0.034986068615281994, -0.32087183817303366, 0.2986601174207418, 0.024478696408616992, 0.35433777411515915, 0.013109827762551225, 0.14204878351025718, -0.025020418651266037, -0.07144993533597865, -0.030813752365957972, -0.01957487200473284, 0.15579967677209144, 0.3132923122777529, 0.22527389275165016, 0.3106629718944811, -0.45543906843819976, -0.29132164253370607, 0.1010694206542723, 0.14716111205817356, 0.13726572542764454, -0.04795342596438135, -0.3278264490833139, 0.07815749265370808, -0.1760401368085091, 0.028949417068493844, -0.1435515832726973, -0.04281789477809203, -0.01170035410182972, -0.281284838704134, 0.06694256409961921, 0.08847533621193066, 0.06801605041743848, -0.021977162420287404, -0.12737236102833924, -0.01998732665240982, 0.17635692654680596, 0.04108286636964806, 0.1067193620693768, 0.11749074457172495, -0.24932686818498492, -0.14155888146836393, 0.3344705316924701, -0.047411597474906454, -0.15507327317919609, 0.19576750890467398, -0.011540029490244215, -0.15592630388279766, 0.14372904232981867, 0.2355169192208045, 0.1504358213503648, -0.14657253145416996, 0.009479530956120278, -0.05466952801165409, 0.1635708245482758, 0.04596593773441158, 0.025125762896381156, 0.1823620840789832, 0.25664124834303653, 0.00975529344567186, 0.14820804272737545, -0.1744240226740711, -0.06303520377446646, -0.19543343868079413, -0.08372875607579294, -0.18621807007363786, -0.009016259400051659, -0.0793865255524581, -0.14523771358823853, 0.3966894024017736, 0.26577363235206364, 0.2208341904457006, 0.0655523158251274, 0.35649703916189446, -0.005705905389924445, 0.18270050318585368, 0.06391368747559668, 0.19033239705719218, 0.058680768355890346, 0.14624705886719816, -0.10557595491545262, 0.09048508669259911, 0.013814116299601041]
|
1,803.05401
|
Approximate Query Matching for Image Retrieval
|
Traditional image recognition involves identifying the key object in a
portrait-type image with a single object focus (ILSVRC, AlexNet, and VGG). More
recent approaches consider dense image recognition - segmenting an image with
appropriate bounding boxes and performing image recognition within these
bounding boxes (Semantic segmentation). The Visual Genome dataset [5] is an
attempt to bridge these various approaches to a cohesive dataset for each
subtask - bounding box generation, image recognition, captioning, and a new
operation: scene graph generation. Our focus is on using such scene graphs to
perform graph search on image databases to holistically retrieve images based
on a search criteria. We develop a method to store scene graphs and metadata in
graph databases (using Neo4J) and to perform fast approximate retrieval of
images based on a graph search query. We process more complex queries than
single object search, e.g. "girl eating cake" retrieves images that contain the
specified relation as well as variations.
|
cs.CV cs.IR
|
traditional image recognition involves identifying the key object in a portraittype image with a single object focus ilsvrc alexnet and vgg more recent approaches consider dense image recognition segmenting an image with appropriate bounding boxes and performing image recognition within these bounding boxes semantic segmentation the visual genome dataset 5 is an attempt to bridge these various approaches to a cohesive dataset for each subtask bounding box generation image recognition captioning and a new operation scene graph generation our focus is on using such scene graphs to perform graph search on image databases to holistically retrieve images based on a search criteria we develop a method to store scene graphs and metadata in graph databases using neo4j and to perform fast approximate retrieval of images based on a graph search query we process more complex queries than single object search eg girl eating cake retrieves images that contain the specified relation as well as variations
|
[['traditional', 'image', 'recognition', 'involves', 'identifying', 'the', 'key', 'object', 'in', 'a', 'portraittype', 'image', 'with', 'a', 'single', 'object', 'focus', 'ilsvrc', 'alexnet', 'and', 'vgg', 'more', 'recent', 'approaches', 'consider', 'dense', 'image', 'recognition', 'segmenting', 'an', 'image', 'with', 'appropriate', 'bounding', 'boxes', 'and', 'performing', 'image', 'recognition', 'within', 'these', 'bounding', 'boxes', 'semantic', 'segmentation', 'the', 'visual', 'genome', 'dataset', '5', 'is', 'an', 'attempt', 'to', 'bridge', 'these', 'various', 'approaches', 'to', 'a', 'cohesive', 'dataset', 'for', 'each', 'subtask', 'bounding', 'box', 'generation', 'image', 'recognition', 'captioning', 'and', 'a', 'new', 'operation', 'scene', 'graph', 'generation', 'our', 'focus', 'is', 'on', 'using', 'such', 'scene', 'graphs', 'to', 'perform', 'graph', 'search', 'on', 'image', 'databases', 'to', 'holistically', 'retrieve', 'images', 'based', 'on', 'a', 'search', 'criteria', 'we', 'develop', 'a', 'method', 'to', 'store', 'scene', 'graphs', 'and', 'metadata', 'in', 'graph', 'databases', 'using', 'neo4j', 'and', 'to', 'perform', 'fast', 'approximate', 'retrieval', 'of', 'images', 'based', 'on', 'a', 'graph', 'search', 'query', 'we', 'process', 'more', 'complex', 'queries', 'than', 'single', 'object', 'search', 'eg', 'girl', 'eating', 'cake', 'retrieves', 'images', 'that', 'contain', 'the', 'specified', 'relation', 'as', 'well', 'as', 'variations']]
|
[-0.03351924355230311, -0.07063990062259155, -0.04330079593429608, 0.0762357790467418, -0.14915171387535822, -0.19147308444447042, 0.03378071795616831, 0.483856879071901, -0.221221329072829, -0.410049653708838, 0.10133263005953669, -0.32077182080693445, -0.12022792011221217, 0.16749765632096558, -0.1920159396143969, 0.1051198237034335, 0.17361366578268927, 0.10087321406266615, -0.020452282792138687, -0.26460932945611876, 0.27511530074399787, -0.007966362831920579, 0.2924414010727536, -0.008348130614968476, 0.11294026390495165, 0.0071014546873894606, -0.08954088685145094, -0.037349676870583715, -0.06337617847082158, 0.2022615467869471, 0.330156512253059, 0.24723358050006888, 0.2398668736394785, -0.40101198186831816, -0.19825962317696252, 0.07417996222676419, 0.1502546488715437, 0.08764490933012363, -0.07254167716415726, -0.409888771519839, 0.10688272574553628, -0.11481281622712101, 0.14362075722582832, -0.13125477820731601, 0.05667099218993968, -0.06343428972600536, -0.2673109798849403, 0.00039302122132102777, 0.09635841825677614, 0.1166028155682173, -0.027518053146006614, -0.060224281102358425, 0.052466832439251876, 0.22937272974386713, -0.05521845086511715, 0.11801369441068404, 0.21375619561347942, -0.2629431550989726, -0.18694496332734292, 0.4414805952193482, -0.028246543768286107, -0.2232084640047767, 0.18794049531850335, -0.020076430254531177, -0.17669746826433835, 0.10711656859168758, 0.22795095173762991, 0.179280065848226, -0.15756896992709923, -0.026844878861296606, -0.10249183038760228, 0.2378572654583818, 0.1190009738345836, -0.03841864386900001, 0.20330939481228397, 0.30577311937564183, 0.054401256181466, 0.19197867412192673, -0.2084318144192508, -0.013868897155459439, -0.1647376416027304, -0.11045667839043036, -0.22370977984596188, -0.07219402604908742, -0.15514958718163793, -0.21760895983739334, 0.39778859723456106, 0.24429174505821247, 0.2251696730453624, 0.09036095358282796, 0.36302016628150185, -0.03715756676815958, 0.15197214499841555, 0.07839372672757448, 0.07033782082990828, -0.04447128322556034, 0.11917325382592617, -0.08969571713400497, 0.0388726963905025, 0.15736436709162913]
|
1,803.05402
|
Imitation Learning with Concurrent Actions in 3D Games
|
In this work we describe a novel deep reinforcement learning architecture
that allows multiple actions to be selected at every time-step in an efficient
manner. Multi-action policies allow complex behaviours to be learnt that would
otherwise be hard to achieve when using single action selection techniques. We
use both imitation learning and temporal difference (TD) reinforcement learning
(RL) to provide a 4x improvement in training time and 2.5x improvement in
performance over single action selection TD RL. We demonstrate the capabilities
of this network using a complex in-house 3D game. Mimicking the behavior of the
expert teacher significantly improves world state exploration and allows the
agents vision system to be trained more rapidly than TD RL alone. This initial
training technique kick-starts TD learning and the agent quickly learns to
surpass the capabilities of the expert.
|
cs.AI cs.LG stat.ML
|
in this work we describe a novel deep reinforcement learning architecture that allows multiple actions to be selected at every timestep in an efficient manner multiaction policies allow complex behaviours to be learnt that would otherwise be hard to achieve when using single action selection techniques we use both imitation learning and temporal difference td reinforcement learning rl to provide a 4x improvement in training time and 25x improvement in performance over single action selection td rl we demonstrate the capabilities of this network using a complex inhouse 3d game mimicking the behavior of the expert teacher significantly improves world state exploration and allows the agents vision system to be trained more rapidly than td rl alone this initial training technique kickstarts td learning and the agent quickly learns to surpass the capabilities of the expert
|
[['in', 'this', 'work', 'we', 'describe', 'a', 'novel', 'deep', 'reinforcement', 'learning', 'architecture', 'that', 'allows', 'multiple', 'actions', 'to', 'be', 'selected', 'at', 'every', 'timestep', 'in', 'an', 'efficient', 'manner', 'multiaction', 'policies', 'allow', 'complex', 'behaviours', 'to', 'be', 'learnt', 'that', 'would', 'otherwise', 'be', 'hard', 'to', 'achieve', 'when', 'using', 'single', 'action', 'selection', 'techniques', 'we', 'use', 'both', 'imitation', 'learning', 'and', 'temporal', 'difference', 'td', 'reinforcement', 'learning', 'rl', 'to', 'provide', 'a', '4x', 'improvement', 'in', 'training', 'time', 'and', '25x', 'improvement', 'in', 'performance', 'over', 'single', 'action', 'selection', 'td', 'rl', 'we', 'demonstrate', 'the', 'capabilities', 'of', 'this', 'network', 'using', 'a', 'complex', 'inhouse', '3d', 'game', 'mimicking', 'the', 'behavior', 'of', 'the', 'expert', 'teacher', 'significantly', 'improves', 'world', 'state', 'exploration', 'and', 'allows', 'the', 'agents', 'vision', 'system', 'to', 'be', 'trained', 'more', 'rapidly', 'than', 'td', 'rl', 'alone', 'this', 'initial', 'training', 'technique', 'kickstarts', 'td', 'learning', 'and', 'the', 'agent', 'quickly', 'learns', 'to', 'surpass', 'the', 'capabilities', 'of', 'the', 'expert']]
|
[-0.008868947710531453, 0.03223329316576753, -0.1161232133809891, 0.04505260026910239, -0.1723833261506149, -0.2166383987672075, 0.0775025992895718, 0.5084889090171567, -0.27878332825515556, -0.348704492011004, 0.04456920903467108, -0.2106604384639973, -0.1703574340376589, 0.1725347175711283, -0.1435326501192456, 0.04782434130708377, 0.12280736678383417, 0.03567032212309574, -0.04507956901841142, -0.3098380491965347, 0.26777910795752646, 0.050929568305878935, 0.3071434157659058, -0.05401312518795883, 0.14904212565333755, -0.0017722489398524718, 0.050012539078576355, 0.003482963523344585, -0.036899891285833694, 0.16735795581566723, 0.3567619277888702, 0.22382080013415329, 0.3933829214285921, -0.398891144124058, -0.21308681265347534, 0.12837599386219625, 0.16025777530201055, 0.10296902834541267, -0.004641511714348949, -0.3291318981114913, 0.06390726842779529, -0.21487211386405827, -0.010416665611167749, -0.16458700525194958, -0.06593370514197482, -0.0555035878955904, -0.3378599328713285, -0.059439980845760416, 0.07364074868943404, 0.04675570009621205, -0.07603316467721015, -0.07631662586289975, 0.06362364015162543, 0.18643067710174904, 0.0032650411525672234, 0.10096952113823068, 0.19159171570877165, -0.2059593929650469, -0.17656827630406177, 0.3135435388871917, -0.07138842091328654, -0.1942967914665739, 0.23488030942087923, -0.03900837287284149, -0.11657051177074512, 0.13966748880187946, 0.26045902251369424, 0.14983672664535266, -0.1432968173328037, 0.021745093911886216, -0.0053433810567690265, 0.21733508727133827, -0.0022508488157419143, -0.03051264586823958, 0.12010272118280194, 0.2974633133435553, 0.06603885333709143, 0.10999854599919032, -0.08189092405761282, -0.12967944066212686, -0.1667353449048716, -0.11613980020154957, -0.1522309158463031, 0.037467012202574146, -0.1242489196390293, -0.07769294109505911, 0.3376927302253467, 0.2532414987614309, 0.2122414136443425, 0.15288491481570182, 0.3405799073063665, 0.05501832262164465, 0.1237595846876502, 0.13372584139859234, 0.21657720552843615, -0.05412963589446412, 0.16179663585412696, -0.23298871713707706, 0.08415890396055248, 0.027005121322279727]
|
1,803.05403
|
Additive quantile regression for clustered data with an application to
children's physical activity
|
Additive models are flexible regression tools that handle linear as well as
nonlinear terms. The latter are typically modelled via smoothing splines.
Additive mixed models extend additive models to include random terms when the
data are sampled according to cluster designs (e.g., longitudinal). These
models find applications in the study of phenomena like growth, certain disease
mechanisms and energy consumption in humans, when repeated measurements are
available. In this paper, we propose a novel additive mixed model for quantile
regression. Our methods are motivated by an application to physical activity
based on a dataset with more than half million accelerometer measurements in
children of the UK Millennium Cohort Study. In a simulation study, we assess
the proposed methods against existing alternatives.
|
stat.ME
|
additive models are flexible regression tools that handle linear as well as nonlinear terms the latter are typically modelled via smoothing splines additive mixed models extend additive models to include random terms when the data are sampled according to cluster designs eg longitudinal these models find applications in the study of phenomena like growth certain disease mechanisms and energy consumption in humans when repeated measurements are available in this paper we propose a novel additive mixed model for quantile regression our methods are motivated by an application to physical activity based on a dataset with more than half million accelerometer measurements in children of the uk millennium cohort study in a simulation study we assess the proposed methods against existing alternatives
|
[['additive', 'models', 'are', 'flexible', 'regression', 'tools', 'that', 'handle', 'linear', 'as', 'well', 'as', 'nonlinear', 'terms', 'the', 'latter', 'are', 'typically', 'modelled', 'via', 'smoothing', 'splines', 'additive', 'mixed', 'models', 'extend', 'additive', 'models', 'to', 'include', 'random', 'terms', 'when', 'the', 'data', 'are', 'sampled', 'according', 'to', 'cluster', 'designs', 'eg', 'longitudinal', 'these', 'models', 'find', 'applications', 'in', 'the', 'study', 'of', 'phenomena', 'like', 'growth', 'certain', 'disease', 'mechanisms', 'and', 'energy', 'consumption', 'in', 'humans', 'when', 'repeated', 'measurements', 'are', 'available', 'in', 'this', 'paper', 'we', 'propose', 'a', 'novel', 'additive', 'mixed', 'model', 'for', 'quantile', 'regression', 'our', 'methods', 'are', 'motivated', 'by', 'an', 'application', 'to', 'physical', 'activity', 'based', 'on', 'a', 'dataset', 'with', 'more', 'than', 'half', 'million', 'accelerometer', 'measurements', 'in', 'children', 'of', 'the', 'uk', 'millennium', 'cohort', 'study', 'in', 'a', 'simulation', 'study', 'we', 'assess', 'the', 'proposed', 'methods', 'against', 'existing', 'alternatives']]
|
[-0.024662520820159496, 0.05347334981733868, -0.0543939496298159, 0.10759872032333288, -0.07774535324886318, -0.17774949922834424, 0.008867128745437223, 0.39862151663319384, -0.25704451316721305, -0.3138042792893392, 0.1594738610741136, -0.2922003954833697, -0.19531826886025158, 0.2352693920728004, -0.1262759020444283, 0.07454204044404848, 0.07933818216797364, -0.0006751127056161727, -0.02332295039245351, -0.306229508920642, 0.28985323238933136, 0.044385519958666936, 0.2866045840638728, -0.06375626088235496, 0.07278522667821405, 0.005595240774679898, -0.10595692860824633, 0.018779414103110032, -0.13497060020715201, 0.13080260458340762, 0.30069376813588866, 0.10208694644903471, 0.3471161277256598, -0.4331392990040385, -0.27144022025014003, 0.11953235569617841, 0.09228677464077106, 0.10155222769672713, -0.012050739381378631, -0.2581306774292357, 0.08222597427589219, -0.20608067095726113, -0.05524526941513042, -0.11290748514815171, -0.055955917208863434, 0.06474257234824544, -0.3116118965501135, 0.11544965587802662, -0.0007877719832953712, 0.1107167767068325, -0.06323344706103576, -0.1605346057571717, 0.004882280649386408, 0.08983894104132244, 0.05221098006321964, -0.03574668496947212, 0.14389784595244065, -0.12999997354157786, -0.175879299898501, 0.3555737625468861, -0.061631734566286796, -0.22577433407783878, 0.2119588643651117, -0.08042957213676481, -0.12697531669092757, 0.050146853924567296, 0.27375295285658896, 0.0981617593937669, -0.19106585366679318, 0.03582291488202812, -0.02479515662262878, 0.14881932313654048, 0.015177059343300206, -0.014510088164502685, 0.15637927708333388, 0.19316548171784143, 0.01978413663681381, 0.1422527393726401, -0.08487435985233419, -0.10369530100036752, -0.24426313098289135, -0.0821619754356971, -0.13082195497079452, -0.022462453639273308, -0.09367503239645734, -0.19338064037324967, 0.3711278797550635, 0.1860010328956746, 0.17235535874285482, 0.10137884480847924, 0.33937346067064067, 0.06368200107735451, 0.0681237580893515, 0.05440456267015254, 0.14062742821964597, 0.09750741233107295, 0.0540986238085965, -0.14873202120469622, 0.11523357212928573, -0.015438967763469362]
|
1,803.05404
|
Coupling the Yoccoz-Birkeland population model with price dynamics:
chaotic livestock commodities market cycles
|
We propose a new model for the time evolution of livestock commodities which
exhibits endogenous deterministic stochastic behaviour. The model is based on
the Yoccoz-Birkeland integral equation, a model first developed for studying
the time-evolution of single species with high average fertility, a relatively
short mating season and density dependent reproduction rates. This equation is
then coupled with a differential equation describing the price of a livestock
commodity driven by the unbalance between its demand and supply. At its birth
the cattle population is split into two parts: reproducing females and cattle
for butchery. The relative amount of the two is determined by the spot price of
the meat. We prove the existence of an attractor and we investigate numerically
its properties: the strange attractor existing for the original
Yoccoz-Birkeland model is persistent but its chaotic behaviour depends also
from the price evolution in an essential way.
|
math.DS q-bio.PE
|
we propose a new model for the time evolution of livestock commodities which exhibits endogenous deterministic stochastic behaviour the model is based on the yoccozbirkeland integral equation a model first developed for studying the timeevolution of single species with high average fertility a relatively short mating season and density dependent reproduction rates this equation is then coupled with a differential equation describing the price of a livestock commodity driven by the unbalance between its demand and supply at its birth the cattle population is split into two parts reproducing females and cattle for butchery the relative amount of the two is determined by the spot price of the meat we prove the existence of an attractor and we investigate numerically its properties the strange attractor existing for the original yoccozbirkeland model is persistent but its chaotic behaviour depends also from the price evolution in an essential way
|
[['we', 'propose', 'a', 'new', 'model', 'for', 'the', 'time', 'evolution', 'of', 'livestock', 'commodities', 'which', 'exhibits', 'endogenous', 'deterministic', 'stochastic', 'behaviour', 'the', 'model', 'is', 'based', 'on', 'the', 'yoccozbirkeland', 'integral', 'equation', 'a', 'model', 'first', 'developed', 'for', 'studying', 'the', 'timeevolution', 'of', 'single', 'species', 'with', 'high', 'average', 'fertility', 'a', 'relatively', 'short', 'mating', 'season', 'and', 'density', 'dependent', 'reproduction', 'rates', 'this', 'equation', 'is', 'then', 'coupled', 'with', 'a', 'differential', 'equation', 'describing', 'the', 'price', 'of', 'a', 'livestock', 'commodity', 'driven', 'by', 'the', 'unbalance', 'between', 'its', 'demand', 'and', 'supply', 'at', 'its', 'birth', 'the', 'cattle', 'population', 'is', 'split', 'into', 'two', 'parts', 'reproducing', 'females', 'and', 'cattle', 'for', 'butchery', 'the', 'relative', 'amount', 'of', 'the', 'two', 'is', 'determined', 'by', 'the', 'spot', 'price', 'of', 'the', 'meat', 'we', 'prove', 'the', 'existence', 'of', 'an', 'attractor', 'and', 'we', 'investigate', 'numerically', 'its', 'properties', 'the', 'strange', 'attractor', 'existing', 'for', 'the', 'original', 'yoccozbirkeland', 'model', 'is', 'persistent', 'but', 'its', 'chaotic', 'behaviour', 'depends', 'also', 'from', 'the', 'price', 'evolution', 'in', 'an', 'essential', 'way']]
|
[-0.12022413739396143, 0.13786870813399016, -0.12267723642354314, 0.09870939493056438, -0.038859099140002705, -0.1287691342327485, 0.060587023371934064, 0.3271076935925521, -0.2820090878716049, -0.25356530532008037, 0.12070275492846526, -0.28046662067451206, -0.14294916443112823, 0.1647509803685049, -0.06756248568934906, -0.008997354971749397, 0.038505389320360135, 0.03979244120677726, 0.04017441002522699, -0.24937908576490977, 0.30382800779383007, 0.0460452743282076, 0.26964050266865847, 0.02920661144889891, 0.17122123358098584, -0.029639211774338037, -0.03383652926034605, -0.02467620732527899, -0.1372935138869151, 0.13488233000195274, 0.1685103395155036, 0.12304850184753174, 0.31590469603219795, -0.4259118668625079, -0.18427932224343144, 0.1429708752548322, 0.09021719896574926, 0.08549327375739166, -0.03977425079453193, -0.23907117614322082, 0.020400584135333903, -0.1868808813661518, -0.15678813461353355, -0.028940968055394478, 0.06814675952126789, 0.07324978630640544, -0.2597466180304764, 0.12212469600308395, 0.023368448965963278, 0.05772193084602703, -0.09311656086194692, -0.06604340703941286, -0.10021558765179685, 0.1555773998580763, 0.0682012327484295, -0.04696343718872716, 0.11469451970960007, -0.16331265646860832, -0.0854459049797798, 0.35811938238071483, -0.11003551300382242, -0.18180899704000492, 0.167450063171499, -0.15545412028586725, -0.10291609155441013, 0.11140758244437166, 0.1721687628952269, 0.09854466259841704, -0.18989461404271424, 0.05444367552505961, -0.0291373670956495, 0.172612445683626, 0.023981831030040566, -0.02028301600754882, 0.20985704591213208, 0.251126599214735, 0.0677736622650021, 0.13529725859795386, -0.09036998637505651, -0.17603247795098773, -0.23637187080789268, -0.12974805056486124, -0.1168741327451749, 0.04686996777470793, -0.1191051827073453, -0.16829475179030043, 0.45672762233556974, 0.10662692683440077, 0.20046821112514912, 0.08826923515961324, 0.28703240904077476, 0.17105152064080661, -0.015832519700779812, 0.08372755395248532, 0.15936550039138334, 0.07371705967428473, 0.13122153651379953, -0.274488541057508, 0.1839734613604378, 0.059456603174718715]
|
1,803.05405
|
Optimal energy decay for the wave-heat system on a rectangular domain
|
We study the rate of energy decay for solutions of a coupled wave-heat system
on a rectangular domain. Using techniques from the theory of $C_0$-semigroups,
and in particular a well-known result due to Borichev and Tomilov, we prove
that the energy of classical solutions decays like $t^{-2/3}$ as $t\to\infty$.
This rate is moreover shown to be sharp. Our result implies in particular that
a general estimate in the literature, which predicts at least logarithmic decay
and is known to be best possible in general, is suboptimal in the special case
under consideration here. Our strategy of proof involves direct estimates based
on separation of variables and a refined version of the technique developed in
our earlier paper for a one-dimensional wave-heat system.
|
math.AP math.FA math.OC math.SP
|
we study the rate of energy decay for solutions of a coupled waveheat system on a rectangular domain using techniques from the theory of c_0semigroups and in particular a wellknown result due to borichev and tomilov we prove that the energy of classical solutions decays like t23 as ttoinfty this rate is moreover shown to be sharp our result implies in particular that a general estimate in the literature which predicts at least logarithmic decay and is known to be best possible in general is suboptimal in the special case under consideration here our strategy of proof involves direct estimates based on separation of variables and a refined version of the technique developed in our earlier paper for a onedimensional waveheat system
|
[['we', 'study', 'the', 'rate', 'of', 'energy', 'decay', 'for', 'solutions', 'of', 'a', 'coupled', 'waveheat', 'system', 'on', 'a', 'rectangular', 'domain', 'using', 'techniques', 'from', 'the', 'theory', 'of', 'c_0semigroups', 'and', 'in', 'particular', 'a', 'wellknown', 'result', 'due', 'to', 'borichev', 'and', 'tomilov', 'we', 'prove', 'that', 'the', 'energy', 'of', 'classical', 'solutions', 'decays', 'like', 't23', 'as', 'ttoinfty', 'this', 'rate', 'is', 'moreover', 'shown', 'to', 'be', 'sharp', 'our', 'result', 'implies', 'in', 'particular', 'that', 'a', 'general', 'estimate', 'in', 'the', 'literature', 'which', 'predicts', 'at', 'least', 'logarithmic', 'decay', 'and', 'is', 'known', 'to', 'be', 'best', 'possible', 'in', 'general', 'is', 'suboptimal', 'in', 'the', 'special', 'case', 'under', 'consideration', 'here', 'our', 'strategy', 'of', 'proof', 'involves', 'direct', 'estimates', 'based', 'on', 'separation', 'of', 'variables', 'and', 'a', 'refined', 'version', 'of', 'the', 'technique', 'developed', 'in', 'our', 'earlier', 'paper', 'for', 'a', 'onedimensional', 'waveheat', 'system']]
|
[-0.07847874020474398, 0.04468114667984306, -0.1094832159769645, 0.07592824603942391, -0.033518253825604916, -0.12305829933554423, 0.06538336016223423, 0.2911471812833162, -0.2459207810022578, -0.24648239852891105, 0.13678603687564095, -0.23848564641098835, -0.16564158336345305, 0.24873890813256874, -0.08847592491274853, 0.05680052467362314, 0.060943616901478564, 0.05384657784273512, -0.050162778106674584, -0.22744223217052392, 0.326035011040627, 0.03720898633883869, 0.25904402434138857, 0.0775262898585156, 0.06592087926663702, 0.016662817150659738, -0.011892325000562629, 0.01210549180624915, -0.18079111661791103, 0.09511320042561312, 0.19322365318371562, 0.0854195270202596, 0.2527085432446882, -0.3814848813640534, -0.18232476327961433, 0.10428467512104019, 0.15753571442557407, 0.13285677166193816, -0.057296342373879046, -0.24439891571079794, 0.10729727268860233, -0.1487189907805811, -0.15106569847748538, -0.05556923363235642, 0.006718762925077901, 0.04633452420000781, -0.33276623340140354, 0.10859618354283396, 0.10990291840175441, -0.008461811507242869, -0.07887277494902249, -0.09789154846717404, 0.047159652158877526, 0.06564461671151832, 0.09596058874597131, 0.061390377774827, 0.05118873776375606, -0.0908377498147826, -0.11378967232208272, 0.3479260894943212, -0.10459912650394024, -0.18387563594380302, 0.20073874622438348, -0.12582688708407958, -0.15880837896457095, 0.10473956441464757, 0.1709390933411654, 0.17597387648057802, -0.13596793751949904, 0.10254844509973572, -0.0747516850910348, 0.17146613390245055, 0.0732138217884864, 0.04096506973136919, 0.1033017311061992, 0.18071891399115692, 0.10779715971410518, 0.16004791704090465, -0.03149709867725729, -0.10951675742637504, -0.3185530890067505, -0.1802716943908666, -0.18032158333159312, 0.06460868363596926, -0.04872369446212495, -0.14201697031657218, 0.3727591431272201, 0.11326036933326682, 0.18514779256275077, 0.08975350488927673, 0.26698927614517265, 0.14410498685043183, 0.03878391103162507, 0.06899649416646142, 0.25215179943116994, 0.12808848954603594, 0.09253685322750482, -0.17430990777688377, 0.04060966207371017, 0.10489346291564527]
|
1,803.05406
|
Variational estimates for discrete operators modeled on
multi-dimensional polynomial subsets of primes
|
We prove the extensions of Birkhoff's and Cotlar's ergodic theorems to
multi-dimensional polynomial subsets of prime numbers $\mathbb{P}^k$. We deduce
them from $\ell^p$-boundedness of $r$-variational seminorms for the
corresponding discrete operators of Radon type, where $p > 1$ and $r > 2$.
|
math.CA
|
we prove the extensions of birkhoffs and cotlars ergodic theorems to multidimensional polynomial subsets of prime numbers mathbbpk we deduce them from ellpboundedness of rvariational seminorms for the corresponding discrete operators of radon type where p 1 and r 2
|
[['we', 'prove', 'the', 'extensions', 'of', 'birkhoffs', 'and', 'cotlars', 'ergodic', 'theorems', 'to', 'multidimensional', 'polynomial', 'subsets', 'of', 'prime', 'numbers', 'mathbbpk', 'we', 'deduce', 'them', 'from', 'ellpboundedness', 'of', 'rvariational', 'seminorms', 'for', 'the', 'corresponding', 'discrete', 'operators', 'of', 'radon', 'type', 'where', 'p', '1', 'and', 'r', '2']]
|
[-0.14407024995829815, 0.08247408656797443, -0.08074866102721828, 0.14937785774087295, -0.03431704614717418, -0.16467666996117586, 0.06478227626006955, 0.24602077189737406, -0.3816576393750998, -0.15392058690150195, 0.13721686236273783, -0.2921863996352141, -0.07391956240798418, 0.22362592885605034, -0.13505038189200255, 0.06558072515046941, -0.02102850886205068, 0.09471288550263032, -0.0822287753272133, -0.2609167627793235, 0.38381461369303554, -0.12404494847242649, 0.14187447640758294, 0.03558956992884095, 0.10600495449482249, 0.04610607507996834, -0.10759538956559621, -0.03555617052822923, -0.2162547186972239, 0.13969295909508872, 0.28872640325854987, 0.1429076397445244, 0.24046274969497552, -0.34951039945754486, -0.10102791058568236, 0.26513937595658577, 0.10168817622634845, -0.06474628734091918, 0.007074281802394977, -0.2926165365661757, 0.16744727049118432, -0.14146870884518975, -0.17731808044482023, -0.09107880026866229, 0.08997189176256935, 0.14232976338229117, -0.36166947067548066, 0.04458280202622215, 0.1766320357624537, 0.1275980091916445, -0.08943668484854965, -0.16306157467456964, 0.018400845177567158, 0.046160206222572386, 0.027945157140493393, -0.016836155898486957, 0.04520090485517031, -0.0047027825927123046, -0.1417151354253292, 0.3225306814106611, -0.04113621541704887, -0.2270578275888394, 0.12212497701581854, -0.22813841296980777, -0.1918293494038666, 0.08524273531750226, 0.1182249229735671, 0.14057778251858857, -0.03313209424511744, 0.21870271759764412, -0.10409441456580773, 0.08382799454893057, 0.13296879161722386, 0.07418815569522288, 0.05130759786623411, -0.008023407931129137, 0.12774003064259887, 0.15830378845716134, -0.04097815009374291, -0.020625291344447013, -0.35118336173204273, -0.2035839670839218, -0.14653395424382046, 0.16887894072211707, -0.1435731926758308, -0.13345583518728232, 0.3382264264405538, 0.053515455518395476, 0.11248130566225602, 0.19178298827356252, 0.1439136310170094, 0.08708095581581195, -0.018058937723533466, 0.06140294819115064, 0.05099380417512013, 0.2260084417529213, 0.023116626012592744, -0.09549851196770294, -0.08935372040678675, 0.2443804387600185]
|
1,803.05407
|
Averaging Weights Leads to Wider Optima and Better Generalization
|
Deep neural networks are typically trained by optimizing a loss function with
an SGD variant, in conjunction with a decaying learning rate, until
convergence. We show that simple averaging of multiple points along the
trajectory of SGD, with a cyclical or constant learning rate, leads to better
generalization than conventional training. We also show that this Stochastic
Weight Averaging (SWA) procedure finds much flatter solutions than SGD, and
approximates the recent Fast Geometric Ensembling (FGE) approach with a single
model. Using SWA we achieve notable improvement in test accuracy over
conventional SGD training on a range of state-of-the-art residual networks,
PyramidNets, DenseNets, and Shake-Shake networks on CIFAR-10, CIFAR-100, and
ImageNet. In short, SWA is extremely easy to implement, improves
generalization, and has almost no computational overhead.
|
cs.LG cs.AI cs.CV stat.ML
|
deep neural networks are typically trained by optimizing a loss function with an sgd variant in conjunction with a decaying learning rate until convergence we show that simple averaging of multiple points along the trajectory of sgd with a cyclical or constant learning rate leads to better generalization than conventional training we also show that this stochastic weight averaging swa procedure finds much flatter solutions than sgd and approximates the recent fast geometric ensembling fge approach with a single model using swa we achieve notable improvement in test accuracy over conventional sgd training on a range of stateoftheart residual networks pyramidnets densenets and shakeshake networks on cifar10 cifar100 and imagenet in short swa is extremely easy to implement improves generalization and has almost no computational overhead
|
[['deep', 'neural', 'networks', 'are', 'typically', 'trained', 'by', 'optimizing', 'a', 'loss', 'function', 'with', 'an', 'sgd', 'variant', 'in', 'conjunction', 'with', 'a', 'decaying', 'learning', 'rate', 'until', 'convergence', 'we', 'show', 'that', 'simple', 'averaging', 'of', 'multiple', 'points', 'along', 'the', 'trajectory', 'of', 'sgd', 'with', 'a', 'cyclical', 'or', 'constant', 'learning', 'rate', 'leads', 'to', 'better', 'generalization', 'than', 'conventional', 'training', 'we', 'also', 'show', 'that', 'this', 'stochastic', 'weight', 'averaging', 'swa', 'procedure', 'finds', 'much', 'flatter', 'solutions', 'than', 'sgd', 'and', 'approximates', 'the', 'recent', 'fast', 'geometric', 'ensembling', 'fge', 'approach', 'with', 'a', 'single', 'model', 'using', 'swa', 'we', 'achieve', 'notable', 'improvement', 'in', 'test', 'accuracy', 'over', 'conventional', 'sgd', 'training', 'on', 'a', 'range', 'of', 'stateoftheart', 'residual', 'networks', 'pyramidnets', 'densenets', 'and', 'shakeshake', 'networks', 'on', 'cifar10', 'cifar100', 'and', 'imagenet', 'in', 'short', 'swa', 'is', 'extremely', 'easy', 'to', 'implement', 'improves', 'generalization', 'and', 'has', 'almost', 'no', 'computational', 'overhead']]
|
[-0.0597514343559742, -0.015941346579114907, -0.06362810945138335, 0.08973738987371326, -0.08480994204431772, -0.21528508527576923, 0.06819011504296213, 0.4966776199713349, -0.26118707996606827, -0.3270094929784536, 0.0492447191895917, -0.24136992401629687, -0.1753236851207912, 0.25955696546658874, -0.15889503571018576, 0.08376117848791181, 0.20455449153296648, 0.030948958843946456, -0.13549970544665121, -0.3582058209776878, 0.19058404009602964, 0.10760925800888799, 0.3473914635255933, -0.03153579423110932, 0.17528093895688654, -0.03198461341112852, 0.047915163446217775, -0.0012096624784171581, -0.031187420186237432, 0.13218072341755033, 0.19348918983899058, 0.15649551637098194, 0.356150381103158, -0.3903364377208054, -0.2405940934922546, 0.1433944379761815, 0.17604863963625395, 0.11009419257193803, -0.03378204152546823, -0.2445662756115198, 0.11912966067250819, -0.1726468917876482, 0.012965755742043257, -0.17229107133671642, -0.064694625351578, 0.030483782651834188, -0.31925365614145995, 0.09550018991320394, 0.08573116839677096, 0.07669866397348232, -0.008315877111628652, -0.15094418726861478, 0.04494788550585509, 0.03168529147468507, 0.05214021994639188, 0.14419623465463519, 0.12094407243235036, -0.15428543864004313, -0.15105331936106087, 0.2940999894812703, -0.13656490655732342, -0.1816917580664158, 0.20083272189646958, -0.0030798478880897165, -0.11654604225605726, 0.12758790687471627, 0.21984080325067043, 0.13847945766896008, -0.10215091294422746, 0.01757147085107863, -0.02635602743923664, 0.18192516806721687, 0.07698660033196211, -0.010148887370713055, 0.05959187219012529, 0.2985687353312969, 0.11745575115829707, 0.1324189661704004, -0.1240034998357296, -0.15616335596889258, -0.18474653166206553, -0.07896462902612984, -0.18011776210926472, 0.050741298846900464, -0.15590411273716018, -0.15080029064975678, 0.3744619994983077, 0.1745827670171857, 0.24918661415949464, 0.21753744774870573, 0.34593889209628104, 0.04729799397662282, 0.14032323285751044, 0.16905554502084852, 0.22507924163341522, 0.036085167311131955, 0.1296392617477104, -0.16613190071098508, 0.08788822755613364, 0.06212138112331741]
|
1,803.05408
|
Maximum likelihood drift estimation for a threshold diffusion
|
We study the maximum likelihood estimator of the drift parameters of a
stochastic differential equation, with both drift and diffusion coefficients
constant on the positive and negative axis, yet discontinuous at zero. This
threshold diffusion is called drifted Oscillating Brownian motion.For this
continuously observed diffusion, the maximum likelihood estimator coincide with
a quasi-likelihood estimator with constant diffusion term. We show that this
estimator is the limit, as observations become dense in time, of the
(quasi)-maximum likelihood estimator based on discrete observations. In long
time, the asymptotic behaviors of the positive and negative occupation times
rule the ones of the estimators. Differently from most known results in the
literature, we do not restrict ourselves to the ergodic framework: indeed,
depending on the signs of the drift, the process may be ergodic, transient or
null recurrent. For each regime, we establish whether or not the estimators are
consistent; if they are, we prove the convergence in long time of the properly
rescaled difference of the estimators towards a normal or mixed normal
distribution. These theoretical results are backed by numerical simulations.
|
math.PR math.ST stat.TH
|
we study the maximum likelihood estimator of the drift parameters of a stochastic differential equation with both drift and diffusion coefficients constant on the positive and negative axis yet discontinuous at zero this threshold diffusion is called drifted oscillating brownian motionfor this continuously observed diffusion the maximum likelihood estimator coincide with a quasilikelihood estimator with constant diffusion term we show that this estimator is the limit as observations become dense in time of the quasimaximum likelihood estimator based on discrete observations in long time the asymptotic behaviors of the positive and negative occupation times rule the ones of the estimators differently from most known results in the literature we do not restrict ourselves to the ergodic framework indeed depending on the signs of the drift the process may be ergodic transient or null recurrent for each regime we establish whether or not the estimators are consistent if they are we prove the convergence in long time of the properly rescaled difference of the estimators towards a normal or mixed normal distribution these theoretical results are backed by numerical simulations
|
[['we', 'study', 'the', 'maximum', 'likelihood', 'estimator', 'of', 'the', 'drift', 'parameters', 'of', 'a', 'stochastic', 'differential', 'equation', 'with', 'both', 'drift', 'and', 'diffusion', 'coefficients', 'constant', 'on', 'the', 'positive', 'and', 'negative', 'axis', 'yet', 'discontinuous', 'at', 'zero', 'this', 'threshold', 'diffusion', 'is', 'called', 'drifted', 'oscillating', 'brownian', 'motionfor', 'this', 'continuously', 'observed', 'diffusion', 'the', 'maximum', 'likelihood', 'estimator', 'coincide', 'with', 'a', 'quasilikelihood', 'estimator', 'with', 'constant', 'diffusion', 'term', 'we', 'show', 'that', 'this', 'estimator', 'is', 'the', 'limit', 'as', 'observations', 'become', 'dense', 'in', 'time', 'of', 'the', 'quasimaximum', 'likelihood', 'estimator', 'based', 'on', 'discrete', 'observations', 'in', 'long', 'time', 'the', 'asymptotic', 'behaviors', 'of', 'the', 'positive', 'and', 'negative', 'occupation', 'times', 'rule', 'the', 'ones', 'of', 'the', 'estimators', 'differently', 'from', 'most', 'known', 'results', 'in', 'the', 'literature', 'we', 'do', 'not', 'restrict', 'ourselves', 'to', 'the', 'ergodic', 'framework', 'indeed', 'depending', 'on', 'the', 'signs', 'of', 'the', 'drift', 'the', 'process', 'may', 'be', 'ergodic', 'transient', 'or', 'null', 'recurrent', 'for', 'each', 'regime', 'we', 'establish', 'whether', 'or', 'not', 'the', 'estimators', 'are', 'consistent', 'if', 'they', 'are', 'we', 'prove', 'the', 'convergence', 'in', 'long', 'time', 'of', 'the', 'properly', 'rescaled', 'difference', 'of', 'the', 'estimators', 'towards', 'a', 'normal', 'or', 'mixed', 'normal', 'distribution', 'these', 'theoretical', 'results', 'are', 'backed', 'by', 'numerical', 'simulations']]
|
[-0.10362540657914589, 0.109510389732176, -0.105180645722561, 0.08141330284891747, -0.07005891510745867, -0.15720279142129748, 0.051903756455717126, 0.40376344626622923, -0.2728935042795139, -0.22859695142140257, 0.1697998360640453, -0.2975276946665698, -0.13658976744405213, 0.16506597647388477, -0.06339511130586749, 0.06565471155519252, 0.053764667195853974, 0.037549651604606195, -0.06342196869179921, -0.25787913269334567, 0.27302714290484537, 0.050036251153849236, 0.2721984593427918, -0.016202031004273993, 0.1197767905482834, -0.030929365626986276, -0.0547053924358837, 0.03488941713016522, -0.177577257876324, 0.04179311900797269, 0.17837256099505538, 0.07118379007998771, 0.3211523596134581, -0.3722810373416568, -0.19721031425981206, 0.14185142211597726, 0.15081340226647574, 0.0752987046830691, -0.00747437408165169, -0.2535893518707893, 0.059226985290918625, -0.12492224381807564, -0.1293231811128515, -0.037063622480948986, -0.020633044521837087, 0.08345623101301365, -0.31263021331050256, 0.15510694129429128, 0.09401077817173235, 0.010988407778773414, -0.055019701103774014, -0.13741739375223772, -0.0023667176039575528, 0.08068901063348533, 0.11575901443240091, -0.04570652999172217, 0.11387644901844213, -0.08738830313478921, -0.0858419127526871, 0.27670611745646495, -0.13564793862862867, -0.24866188426889227, 0.16037139549898508, -0.23311339090892186, -0.11920953483917238, 0.14162525302453197, 0.16780011911531179, 0.13308868928697337, -0.1531386703019471, 0.06923972999348744, -0.037944158230479176, 0.11018034676613098, 0.03405126804496381, -0.022160886268895327, 0.18646368330993343, 0.1283285913575608, 0.11879996140356688, 0.08061608066193739, -0.10410372387772175, -0.12155236295958081, -0.3270897887244276, -0.13056596625188177, -0.22492248166530404, 0.05257789986786888, -0.14172577961608623, -0.22042680215652968, 0.3435232626127728, 0.15531853279667865, 0.20128749004889573, 0.13739964055300302, 0.2667731571827461, 0.18389120601114994, 0.008000009805696566, 0.11624328382025484, 0.2366485426887828, 0.1441260182934426, 0.07637528815892723, -0.22329537355827608, 0.1563429871987384, 0.038551044281509315]
|
1,803.05409
|
Thermodynamic limit in high-multiplicity $pp$ collisions at $\sqrt{s}$ =
7 TeV
|
An analysis is made of the particle composition in the final state of $pp$
collisions at 7 TeV as a function of the charged particle multiplicity
($dN_{ch}/d\eta$). The thermal model is used to determine the chemical
freeze-out temperature as well as the radius and strangeness suppression factor
$\gamma_s$. Three different ensembles are used in the analysis. The grand
canonical ensemble, the canonical ensemble with exact strangeness conservation
and the canonical ensemble with exact baryon number, strangeness and electric
charge conservation. It is shown that for the highest multiplicity class the
three ensembles lead to the same result. This allows us to conclude that this
multiplicity class is close to the thermodynamic limit. It is estimated that
the final state in $pp$ collisions could reach the thermodynamic limit when
$dN_{ch}/d\eta$ is larger than twenty per unit of rapidity, corresponding to
about 300 particles in the final state when integrated over the full rapidity
interval.
|
hep-ph nucl-th
|
an analysis is made of the particle composition in the final state of pp collisions at 7 tev as a function of the charged particle multiplicity dn_chdeta the thermal model is used to determine the chemical freezeout temperature as well as the radius and strangeness suppression factor gamma_s three different ensembles are used in the analysis the grand canonical ensemble the canonical ensemble with exact strangeness conservation and the canonical ensemble with exact baryon number strangeness and electric charge conservation it is shown that for the highest multiplicity class the three ensembles lead to the same result this allows us to conclude that this multiplicity class is close to the thermodynamic limit it is estimated that the final state in pp collisions could reach the thermodynamic limit when dn_chdeta is larger than twenty per unit of rapidity corresponding to about 300 particles in the final state when integrated over the full rapidity interval
|
[['an', 'analysis', 'is', 'made', 'of', 'the', 'particle', 'composition', 'in', 'the', 'final', 'state', 'of', 'pp', 'collisions', 'at', '7', 'tev', 'as', 'a', 'function', 'of', 'the', 'charged', 'particle', 'multiplicity', 'dn_chdeta', 'the', 'thermal', 'model', 'is', 'used', 'to', 'determine', 'the', 'chemical', 'freezeout', 'temperature', 'as', 'well', 'as', 'the', 'radius', 'and', 'strangeness', 'suppression', 'factor', 'gamma_s', 'three', 'different', 'ensembles', 'are', 'used', 'in', 'the', 'analysis', 'the', 'grand', 'canonical', 'ensemble', 'the', 'canonical', 'ensemble', 'with', 'exact', 'strangeness', 'conservation', 'and', 'the', 'canonical', 'ensemble', 'with', 'exact', 'baryon', 'number', 'strangeness', 'and', 'electric', 'charge', 'conservation', 'it', 'is', 'shown', 'that', 'for', 'the', 'highest', 'multiplicity', 'class', 'the', 'three', 'ensembles', 'lead', 'to', 'the', 'same', 'result', 'this', 'allows', 'us', 'to', 'conclude', 'that', 'this', 'multiplicity', 'class', 'is', 'close', 'to', 'the', 'thermodynamic', 'limit', 'it', 'is', 'estimated', 'that', 'the', 'final', 'state', 'in', 'pp', 'collisions', 'could', 'reach', 'the', 'thermodynamic', 'limit', 'when', 'dn_chdeta', 'is', 'larger', 'than', 'twenty', 'per', 'unit', 'of', 'rapidity', 'corresponding', 'to', 'about', '300', 'particles', 'in', 'the', 'final', 'state', 'when', 'integrated', 'over', 'the', 'full', 'rapidity', 'interval']]
|
[-0.050900408061482987, 0.20363996556537375, -0.10851845337272761, 0.12046440242442723, 0.05230418582343393, -0.06431629309077667, -0.012327430176311265, 0.302886902022912, -0.2112443187864485, -0.3445433547318566, -0.008513582839928811, -0.3277079544953273, 0.043899751170934025, 0.11738423892948167, 0.03362383070140103, 0.09607212299943652, 0.0825636022369639, 0.09758678832231393, -0.0701771476899511, -0.22667242178322103, 0.2913501730304382, 0.11680181690315211, 0.26308459769082226, 0.09480482013667842, 0.08421562691797423, 0.03223066270546196, 0.011995549718514572, 0.02013671395956277, -0.1226046452765468, 0.04803484326473504, 0.2328795541026112, 0.07568964408406245, 0.18654521909889346, -0.33576374968477324, -0.14503675518447862, 0.1835168820678019, 0.1555490495387489, 0.11613770959490996, 0.015722118914614315, -0.1997836126148506, 0.11629621995420095, -0.21693214939700234, -0.19033337277938533, -0.054785245603400895, 0.02582375492194509, 0.02360275322175737, -0.2791135705325728, 0.12355072855085038, 0.019689696164515623, 0.047411436056779103, -0.05901697933334504, -0.20535415684000827, -0.07771211563536495, 0.07217914950645839, 0.07088506481917636, 0.08023542305987232, 0.20845813363839208, -0.10869023780219768, -0.0930467224451622, 0.3570553999929841, -0.012463017633611647, -0.18717586985344883, 0.18206605638736506, -0.17897850582436994, -0.12442628402275101, 0.15368946676227732, 0.14521223915972156, 0.08777385115246075, -0.2000942174689555, 0.039717556938020745, -0.041797532677936546, 0.18903042648590224, 0.07158819692866768, 0.04581425295156591, 0.20870651643163238, 0.17484563545269124, 0.05411070800733333, 0.11476112233499199, -0.09970184971328849, -0.1568817238603396, -0.350317381894569, -0.15456259215183654, -0.15940497775434279, 0.10016582340604681, -0.1203687677303142, -0.10569507385253316, 0.36921124126202143, 0.13071750691221432, 0.2666773202287313, 0.011632422965287773, 0.25825244511456347, 0.1255457384026384, 0.05099282774684671, 0.07856992408450619, 0.2561500017223819, 0.1812742566887679, 0.17592502981606944, -0.2608347683125389, 0.005149465143297087, 0.06920838130796267]
|
1,803.0541
|
Effective non-linear spinor dynamics in a spin-1 Bose-Einstein
condensate
|
We derive from first principles the experimentally observed effective
dynamics of a spinor Bose gas initially prepared as a Bose-Einstein condensate
and then left free to expand ballistically. In spinor condensates, which
represent one of the recent frontiers in the manipulation of ultra-cold atoms,
particles interact with a two-body spatial interaction and a spin-spin
interaction. The effective dynamics is governed by a system of coupled
semi-linear Schr\"odinger equations: we recover this system, in the sense of
marginals in the limit of infinitely many particles, with a mean-field
re-scaling of the many-body Hamiltonian. When the resulting control of the
dynamical persistence of condensation is quantified with the parameters of
modern observations, we obtain a bound that remains quite accurate for the
whole typical duration of the experiment.
|
math-ph math.MP
|
we derive from first principles the experimentally observed effective dynamics of a spinor bose gas initially prepared as a boseeinstein condensate and then left free to expand ballistically in spinor condensates which represent one of the recent frontiers in the manipulation of ultracold atoms particles interact with a twobody spatial interaction and a spinspin interaction the effective dynamics is governed by a system of coupled semilinear schrodinger equations we recover this system in the sense of marginals in the limit of infinitely many particles with a meanfield rescaling of the manybody hamiltonian when the resulting control of the dynamical persistence of condensation is quantified with the parameters of modern observations we obtain a bound that remains quite accurate for the whole typical duration of the experiment
|
[['we', 'derive', 'from', 'first', 'principles', 'the', 'experimentally', 'observed', 'effective', 'dynamics', 'of', 'a', 'spinor', 'bose', 'gas', 'initially', 'prepared', 'as', 'a', 'boseeinstein', 'condensate', 'and', 'then', 'left', 'free', 'to', 'expand', 'ballistically', 'in', 'spinor', 'condensates', 'which', 'represent', 'one', 'of', 'the', 'recent', 'frontiers', 'in', 'the', 'manipulation', 'of', 'ultracold', 'atoms', 'particles', 'interact', 'with', 'a', 'twobody', 'spatial', 'interaction', 'and', 'a', 'spinspin', 'interaction', 'the', 'effective', 'dynamics', 'is', 'governed', 'by', 'a', 'system', 'of', 'coupled', 'semilinear', 'schrodinger', 'equations', 'we', 'recover', 'this', 'system', 'in', 'the', 'sense', 'of', 'marginals', 'in', 'the', 'limit', 'of', 'infinitely', 'many', 'particles', 'with', 'a', 'meanfield', 'rescaling', 'of', 'the', 'manybody', 'hamiltonian', 'when', 'the', 'resulting', 'control', 'of', 'the', 'dynamical', 'persistence', 'of', 'condensation', 'is', 'quantified', 'with', 'the', 'parameters', 'of', 'modern', 'observations', 'we', 'obtain', 'a', 'bound', 'that', 'remains', 'quite', 'accurate', 'for', 'the', 'whole', 'typical', 'duration', 'of', 'the', 'experiment']]
|
[-0.14636068510691755, 0.2327974589896344, -0.10325560095490859, 0.046561588863066085, 0.017768832585138696, -0.13993925429854748, -0.0020342938646319367, 0.29696355039431227, -0.2501288592678657, -0.26710616590248215, 0.022675238930368945, -0.2934049806254546, -0.10136815487954115, 0.14697719553655517, 0.05978138506456855, 0.06367144005286271, 0.05012763627908296, 0.04448127219202145, -0.06428099094912232, -0.24126263460262665, 0.32566612494725083, -0.001920201298263338, 0.22336816274383592, 0.041563505602497906, 0.1412767951313447, 0.018676130703487802, 0.06381490540003315, -0.00960986093721456, -0.13997046903196383, 0.11549885142298918, 0.20501345094563145, 0.04197624628709275, 0.25179987907084445, -0.4586168779577646, -0.22849853769949977, 0.08113471784495882, 0.20323059956232706, 0.17504714842098543, -0.038226441318531416, -0.3347424563567435, -0.060795190773667795, -0.17863766877867637, -0.20664870549392486, -0.07665080355761188, 0.05926584539609769, 0.059196285574534345, -0.2603529873636684, 0.1049285759379725, 0.06685472940097541, 0.05419237684783718, -0.10532435825065015, -0.020831969646101314, 0.012729437053499241, 0.08680187774723255, -0.0017665812416770865, 0.01878275992792277, 0.13160610593677985, -0.189398195167693, -0.06589008400323874, 0.41383398632289814, -0.12345270843278351, -0.19396662213913504, 0.19539010422008615, -0.15654592469541562, -0.0805282337805404, 0.12304524274631626, 0.15020425083246894, 0.12301474620425512, -0.1779105849773115, 0.10023209445145247, -0.06372808691646371, 0.16148419663705493, 0.04816948824251691, 0.05037394592109772, 0.22210382308629859, 0.20042950349919025, 0.04188915742478067, 0.15524225384883938, -0.030318612870316775, -0.17410331940101015, -0.2691121442273023, -0.13715832715885, -0.21317329756649478, 0.07637884719149461, -0.0416958257590609, -0.17058470362930425, 0.39165142247275936, 0.17653208920207347, 0.19906718668801385, 0.01991481608470961, 0.2589461142862482, 0.14604701260603697, 0.018159355517358533, 0.03798517927763954, 0.25608355871638255, 0.15675133380055842, 0.07761356474772568, -0.26438908832746427, -0.0013759907229714805, 0.06914089603852185]
|
1,803.05411
|
On trend and its derivatives estimation in repeated time series with
subordinated long-range dependent errors
|
For temporal regularly spaced datasets, a lot of methods are available and
the properties of these methods are extensively investigated. Less research has
been performed on irregular temporal datasets subject to measurement error with
complex dependence structures, while this type of datasets is widely available.
In this paper, the performance of kernel smoother for trend and its derivatives
is considered under dependent measurement errors and irregularly spaced
sampling scheme. The error processes are assumed to be subordinated Gaussian
long memory processes and have varying marginal distributions. The functional
central limit theorem for the estimators of trend and its derivatives are
derived and bandwidth selection problem is addressed.
|
stat.ME
|
for temporal regularly spaced datasets a lot of methods are available and the properties of these methods are extensively investigated less research has been performed on irregular temporal datasets subject to measurement error with complex dependence structures while this type of datasets is widely available in this paper the performance of kernel smoother for trend and its derivatives is considered under dependent measurement errors and irregularly spaced sampling scheme the error processes are assumed to be subordinated gaussian long memory processes and have varying marginal distributions the functional central limit theorem for the estimators of trend and its derivatives are derived and bandwidth selection problem is addressed
|
[['for', 'temporal', 'regularly', 'spaced', 'datasets', 'a', 'lot', 'of', 'methods', 'are', 'available', 'and', 'the', 'properties', 'of', 'these', 'methods', 'are', 'extensively', 'investigated', 'less', 'research', 'has', 'been', 'performed', 'on', 'irregular', 'temporal', 'datasets', 'subject', 'to', 'measurement', 'error', 'with', 'complex', 'dependence', 'structures', 'while', 'this', 'type', 'of', 'datasets', 'is', 'widely', 'available', 'in', 'this', 'paper', 'the', 'performance', 'of', 'kernel', 'smoother', 'for', 'trend', 'and', 'its', 'derivatives', 'is', 'considered', 'under', 'dependent', 'measurement', 'errors', 'and', 'irregularly', 'spaced', 'sampling', 'scheme', 'the', 'error', 'processes', 'are', 'assumed', 'to', 'be', 'subordinated', 'gaussian', 'long', 'memory', 'processes', 'and', 'have', 'varying', 'marginal', 'distributions', 'the', 'functional', 'central', 'limit', 'theorem', 'for', 'the', 'estimators', 'of', 'trend', 'and', 'its', 'derivatives', 'are', 'derived', 'and', 'bandwidth', 'selection', 'problem', 'is', 'addressed']]
|
[-0.08818289567934018, 0.056555084144331025, -0.08563258711283452, 0.11242491168418255, -0.04543761084744028, -0.1636664623821102, -0.007541325653763923, 0.5022951044211877, -0.25055024370760004, -0.2974487369375251, 0.1914122592207375, -0.26964793164526746, -0.09117259562154796, 0.225426912351259, -0.098410013871633, 0.12698242637855392, 0.07587119521764672, 0.0035636425018310547, -0.06593217253772037, -0.3013990329334808, 0.27496107537778114, 0.075181484583626, 0.32453927387500825, -0.005641002180250623, 0.09331513206021878, -0.031242708845562347, -0.10051175620119636, -0.007812539463706105, -0.10104583540417811, 0.11811536571737727, 0.249507826182852, 0.07631875381143502, 0.330269044783036, -0.39467014233085596, -0.2489571493362712, 0.10200186502449562, 0.12576425717664866, 0.05022512574908084, -0.006868732941911391, -0.2796367624443825, 0.06074486009202132, -0.13126523991873723, -0.06164381237348072, -0.08240017532501544, 0.05701247926488101, 0.06774415926535605, -0.30019153087077854, 0.14277256367767283, 0.04255509243355455, 0.08938433921016822, -0.025948282751193808, -0.16435410986354174, 0.028654542251133196, 0.1284581266259818, 0.10037779688147531, -0.015577395759940705, 0.1245987773002517, -0.05914922244411623, -0.10060321438674615, 0.33179223934127555, -0.03061715939090909, -0.24620615523830752, 0.18132262732441945, -0.12372110454174125, -0.1493377040453673, 0.12405704112862732, 0.19804919876645657, 0.13159826192917806, -0.19901590799547245, 0.09058300288781419, 0.02610486570014575, 0.15583924783794123, 0.06687151717574762, 0.08344012546727311, 0.1463227323408752, 0.18694223467016888, 0.03755080627895474, 0.107441735570319, -0.12441845622705731, -0.13832126096517683, -0.2364446394772173, -0.05407433707058151, -0.20263357754692296, -0.03760237548778826, -0.08029761709295709, -0.17861815192519087, 0.3584255983468695, 0.13384019431362154, 0.15132425886047918, 0.06718668862132826, 0.2901379996475494, 0.14809365531377425, 0.09303273026674777, 0.0710664954097402, 0.15876708294169228, 0.1482720255642851, 0.11066766523877943, -0.13980725961389176, 0.13504419061050654, -0.03525974581923301]
|
1,803.05412
|
Effective field theory for the nucleon-quarkonium interaction
|
We develop an effective field theory approach for the $S$-wave
quarkonium-nucleon system. We adopt a natural power counting equivalent to
Weinberg's power counting in nucleon-nucleon effective field theories and
compute the quarkonium-nucleon potential, scattering length and effective range
up to $\mathcal{O}(m^3_{\pi}/\Lambda^3_{\chi})$ accuracy, including the full
light-quark mass dependence. We compare our results with lattice QCD studies of
quarkonium-nucleon system, obtain an estimation of the leading order
quarkonium-nucleon contact term and determine the $J/\psi$ and $\eta_c$
chromopolarizabilities.
|
hep-ph nucl-th
|
we develop an effective field theory approach for the swave quarkoniumnucleon system we adopt a natural power counting equivalent to weinbergs power counting in nucleonnucleon effective field theories and compute the quarkoniumnucleon potential scattering length and effective range up to mathcalom3_pilambda3_chi accuracy including the full lightquark mass dependence we compare our results with lattice qcd studies of quarkoniumnucleon system obtain an estimation of the leading order quarkoniumnucleon contact term and determine the jpsi and eta_c chromopolarizabilities
|
[['we', 'develop', 'an', 'effective', 'field', 'theory', 'approach', 'for', 'the', 'swave', 'quarkoniumnucleon', 'system', 'we', 'adopt', 'a', 'natural', 'power', 'counting', 'equivalent', 'to', 'weinbergs', 'power', 'counting', 'in', 'nucleonnucleon', 'effective', 'field', 'theories', 'and', 'compute', 'the', 'quarkoniumnucleon', 'potential', 'scattering', 'length', 'and', 'effective', 'range', 'up', 'to', 'mathcalom3_pilambda3_chi', 'accuracy', 'including', 'the', 'full', 'lightquark', 'mass', 'dependence', 'we', 'compare', 'our', 'results', 'with', 'lattice', 'qcd', 'studies', 'of', 'quarkoniumnucleon', 'system', 'obtain', 'an', 'estimation', 'of', 'the', 'leading', 'order', 'quarkoniumnucleon', 'contact', 'term', 'and', 'determine', 'the', 'jpsi', 'and', 'eta_c', 'chromopolarizabilities']]
|
[-0.09810490379537884, 0.10704288842837717, -0.11334358072663481, 0.09928229307548168, -0.05795491858058282, -0.10088376064684142, 0.03999229883491943, 0.3136015297794664, -0.16958846418640097, -0.29391143433875533, -0.00897407005194927, -0.31251673449485284, -0.0848491461192434, 0.13335174553700396, 0.018674199683340015, 0.11857986340072711, 0.008896126688734905, 0.07206550906286449, -0.0899606001928348, -0.22248284640954807, 0.3243698580756884, 0.031046193193744968, 0.25094367869550716, 0.17864596574391062, 0.07611984471362587, 0.09878821214157585, -0.007368720778440301, -0.008907186219821105, -0.2061702834844992, 0.11681426939793636, 0.2138420785525562, 0.012608509913489625, 0.14782614014237314, -0.35952481891758536, -0.1817170676548739, 0.08726432789872224, 0.15515995597013751, 0.14236859754797676, 0.018798489598879854, -0.24982186989556696, 0.10181549282090084, -0.2598983134092713, -0.14749631072816163, -0.1568467698399783, 0.017762503980004507, -0.03801467815867147, -0.33464690019703797, 0.04195559944531163, -0.04380197485128569, 0.05471139777502095, -0.06361838838563778, -0.13524130284094024, 0.08473477115212763, 0.11479133054790264, 0.08454105442993946, 0.10481909082925601, 0.14214276390880146, -0.18324730263368502, -0.13102903679277547, 0.4113783763117484, -0.09141344285249156, -0.15302374762659138, 0.13135998088212028, -0.08900780617133588, -0.08149219193571322, 0.14144497478028406, 0.19963546118673844, 0.10070600957103149, -0.14797052333282457, 0.11460676660597627, 0.007173771828387839, 0.21048334122610254, 0.05029123049934168, 0.04988538757783858, 0.16777322373378115, 0.1670818201492767, 0.028543663148239657, 0.1006103905729597, -0.07793865731061511, -0.09485600386570031, -0.32254375195181045, -0.08092770467487138, -0.10261105132490597, 0.06139584528785702, -0.134790481186969, -0.14047328823220892, 0.36129941511899233, 0.18803644423826119, 0.20198708919908953, 0.11732808542060288, 0.2967442486032441, 0.19473193820748427, 0.046383138547802495, 0.049736461671371315, 0.23676379332067193, 0.20516720099053723, 0.08449252241769352, -0.3094248329415112, -0.08614115857494038, 0.07979662319318064]
|
1,803.05413
|
Ground state energy of mixture of Bose gases
|
We consider the asymptotic behavior of a system of multi-component trapped
bosons, when the total particle number $N$ becomes large. In the dilute regime,
when the interaction potentials have the length scale of order $O(N^{-1})$, we
show that the leading order of the ground state energy is captured correctly by
the Gross-Pitaevskii energy functional and that the many-body ground state
fully condensates on the Gross-Pitaevskii minimizers. In the mean-field regime,
when the interaction length scale is $O(1)$, we are able to verify Bogoliubov's
approximation and obtain the second order expansion of the ground state energy.
While such asymptotic results have several precursors in the literature on
one-component condensates, the adaption to the multi-component setting is
non-trivial in various respects and the analysis will be presented in details.
|
math-ph math.AP math.MP
|
we consider the asymptotic behavior of a system of multicomponent trapped bosons when the total particle number n becomes large in the dilute regime when the interaction potentials have the length scale of order on1 we show that the leading order of the ground state energy is captured correctly by the grosspitaevskii energy functional and that the manybody ground state fully condensates on the grosspitaevskii minimizers in the meanfield regime when the interaction length scale is o1 we are able to verify bogoliubovs approximation and obtain the second order expansion of the ground state energy while such asymptotic results have several precursors in the literature on onecomponent condensates the adaption to the multicomponent setting is nontrivial in various respects and the analysis will be presented in details
|
[['we', 'consider', 'the', 'asymptotic', 'behavior', 'of', 'a', 'system', 'of', 'multicomponent', 'trapped', 'bosons', 'when', 'the', 'total', 'particle', 'number', 'n', 'becomes', 'large', 'in', 'the', 'dilute', 'regime', 'when', 'the', 'interaction', 'potentials', 'have', 'the', 'length', 'scale', 'of', 'order', 'on1', 'we', 'show', 'that', 'the', 'leading', 'order', 'of', 'the', 'ground', 'state', 'energy', 'is', 'captured', 'correctly', 'by', 'the', 'grosspitaevskii', 'energy', 'functional', 'and', 'that', 'the', 'manybody', 'ground', 'state', 'fully', 'condensates', 'on', 'the', 'grosspitaevskii', 'minimizers', 'in', 'the', 'meanfield', 'regime', 'when', 'the', 'interaction', 'length', 'scale', 'is', 'o1', 'we', 'are', 'able', 'to', 'verify', 'bogoliubovs', 'approximation', 'and', 'obtain', 'the', 'second', 'order', 'expansion', 'of', 'the', 'ground', 'state', 'energy', 'while', 'such', 'asymptotic', 'results', 'have', 'several', 'precursors', 'in', 'the', 'literature', 'on', 'onecomponent', 'condensates', 'the', 'adaption', 'to', 'the', 'multicomponent', 'setting', 'is', 'nontrivial', 'in', 'various', 'respects', 'and', 'the', 'analysis', 'will', 'be', 'presented', 'in', 'details']]
|
[-0.14207997184987436, 0.16548330141928078, -0.0694877302574771, 0.09907933121352772, 0.016254590200920273, -0.07698465296476126, -0.0067788268857466895, 0.3038266827315679, -0.23117866777763593, -0.2968240660664765, 0.08627819991762214, -0.2954856505338836, -0.09574459029882267, 0.11255402685652714, 0.06116628354528963, 0.0838117818531441, 0.0382633622484575, 0.07716972820688127, -0.030373491893163112, -0.2654769258723983, 0.33458794465684516, 0.016105255104718715, 0.27341608980699905, 0.07139368535672116, 0.04949306829018504, -0.0071792751880670625, 0.09362574133428005, 0.01559113763505593, -0.15087106786578927, 0.05325889563202623, 0.2266844286130536, 0.003057673635826571, 0.26132631879739876, -0.46584189467601417, -0.20168038713562442, 0.09330499771703768, 0.18273627595777997, 0.17115490498409908, 0.011029126574505325, -0.3022618243529454, 0.048516058929513876, -0.17672708595362235, -0.1853079018843045, -0.1383738993249071, 0.0007197474034165772, 0.05939717679468847, -0.25349108641783846, 0.10420351085348392, 0.046496226993118096, -0.01111867011884066, -0.09332489491418355, -0.07936313391505469, 0.00698294539983553, 0.09736409390186634, 0.057229099195500045, 0.005381546533248556, 0.07605922019006464, -0.185097862504364, -0.04311894131897707, 0.3923399657539026, -0.09184922692714274, -0.18759946826493412, 0.19827602870439684, -0.15500328466149532, -0.09022760150704796, 0.14896353698284256, 0.13579467497766018, 0.10257357777615159, -0.11620303889446411, 0.13939383467448524, -0.038075466024300716, 0.213493708176465, 0.016961389430248597, 0.055536115762051634, 0.14779472958267204, 0.18005244511795618, 0.04711837855380351, 0.1477278051137059, -0.10248544647066861, -0.17620970716509293, -0.3104146582287128, -0.14247077436545702, -0.21174202766269445, 0.014973124688102564, -0.07701709130231207, -0.1352245956627234, 0.39269025092504506, 0.16263598254625136, 0.1844460799791447, 0.05510403397933059, 0.26749420320013845, 0.16381634177830745, 0.01349427700262722, 0.06126186654327335, 0.271186164858949, 0.09599131109618296, 0.08065084629237476, -0.2679691005218132, 0.017336741441816794, 0.11074470845967765]
|
1,803.05414
|
Linearity is Strictly More Powerful than Contiguity for Encoding Graphs
|
Linearity and contiguity are two parameters devoted to graph encoding.
Linearity is a generalisation of contiguity in the sense that every encoding
achieving contiguity $k$ induces an encoding achieving linearity $k$, both
encoding having size $\Theta(k.n)$, where $n$ is the number of vertices of $G$.
In this paper, we prove that linearity is a strictly more powerful encoding
than contiguity, i.e. there exists some graph family such that the linearity is
asymptotically negligible in front of the contiguity. We prove this by
answering an open question asking for the worst case linearity of a cograph on
$n$ vertices: we provide an $O(\log n/\log\log n)$ upper bound which matches
the previously known lower bound.
|
cs.DM
|
linearity and contiguity are two parameters devoted to graph encoding linearity is a generalisation of contiguity in the sense that every encoding achieving contiguity k induces an encoding achieving linearity k both encoding having size thetakn where n is the number of vertices of g in this paper we prove that linearity is a strictly more powerful encoding than contiguity ie there exists some graph family such that the linearity is asymptotically negligible in front of the contiguity we prove this by answering an open question asking for the worst case linearity of a cograph on n vertices we provide an olog nloglog n upper bound which matches the previously known lower bound
|
[['linearity', 'and', 'contiguity', 'are', 'two', 'parameters', 'devoted', 'to', 'graph', 'encoding', 'linearity', 'is', 'a', 'generalisation', 'of', 'contiguity', 'in', 'the', 'sense', 'that', 'every', 'encoding', 'achieving', 'contiguity', 'k', 'induces', 'an', 'encoding', 'achieving', 'linearity', 'k', 'both', 'encoding', 'having', 'size', 'thetakn', 'where', 'n', 'is', 'the', 'number', 'of', 'vertices', 'of', 'g', 'in', 'this', 'paper', 'we', 'prove', 'that', 'linearity', 'is', 'a', 'strictly', 'more', 'powerful', 'encoding', 'than', 'contiguity', 'ie', 'there', 'exists', 'some', 'graph', 'family', 'such', 'that', 'the', 'linearity', 'is', 'asymptotically', 'negligible', 'in', 'front', 'of', 'the', 'contiguity', 'we', 'prove', 'this', 'by', 'answering', 'an', 'open', 'question', 'asking', 'for', 'the', 'worst', 'case', 'linearity', 'of', 'a', 'cograph', 'on', 'n', 'vertices', 'we', 'provide', 'an', 'olog', 'nloglog', 'n', 'upper', 'bound', 'which', 'matches', 'the', 'previously', 'known', 'lower', 'bound']]
|
[-0.18028703857258588, 0.11008120940076661, -0.04647629941706505, 0.07239903118337744, -0.06800296494275727, -0.20909342985699134, 0.06419531697823576, 0.35432533053598836, -0.2563001260705358, -0.329521925427613, 0.04680850722443774, -0.27495990139720716, -0.1678194221978661, 0.1467737969818764, -0.1321923379792494, 0.021686030436406094, 0.041749132228438304, 0.12271831872635026, -0.03371034054687263, -0.3233918644785593, 0.2692321457104774, 0.047962125864671135, 0.23452983135604752, 0.05685851722543614, 0.09804768510476018, 0.019189716036538636, -0.005589364790893366, 0.008097385563187103, -0.16180151492346695, 0.12373322612746099, 0.26059227181285355, 0.18466140693712946, 0.2811102544377863, -0.34683857653346695, -0.14583654883853367, 0.16578359068865864, 0.14718070609363176, 0.06615479403707009, -0.030105465474621954, -0.1967874268003929, 0.1361279930317758, -0.0621012492575147, -0.08476817888718725, -0.01842859282314909, 0.07650501186654499, -0.04302545309693149, -0.28571919355112896, 0.00528880319994899, 0.20775800133618502, 0.05121973948321404, 0.030510420709090158, -0.13947579654477602, 0.021680525685372078, 0.11745565408939677, -0.032904181950849244, 0.08675917263340567, 0.032014254509961745, -0.14674022705685677, -0.10368080616133304, 0.3277706520119888, -0.047220221208228184, -0.20717302758444464, 0.13089399115157735, -0.13248475322466904, -0.17060949491435842, 0.11929450849219497, 0.08493777425481683, 0.1150951850252737, -0.08162048646965914, 0.1600081266817818, -0.1555213873126272, 0.23874620097973673, 0.21817064946682185, 0.09562773060927217, 0.0689671647495928, 0.16965265908954352, 0.17910416785677055, 0.1739301010719047, 0.0007069284627955835, -0.01264863425404229, -0.3198003006555074, -0.14632744991541963, -0.19415155718869537, 0.09608752624156465, -0.17216769364171566, -0.1655065045914555, 0.3083686832569342, 0.10108777101201095, 0.22162825970259387, 0.17877355348257, 0.2606485638617068, 0.10025142095323684, 0.00897813741266068, 0.17523468712228094, 0.128930708885129, 0.11909599447482785, -0.021306297644989286, -0.16497735018157852, 0.1180328870752612, 0.12854872411529047]
|
1,803.05415
|
Research towards high-repetition rate laser-driven X-ray sources for
imaging applications
|
Laser wakefield acceleration of electrons represents a basis for several
types of novel X-ray sources based on Thomson scattering or betatron radiation.
The latter provides a high photon flux and a small source size, both being
prerequisites for high-quality X-ray imaging. Furthermore, proof-of-principle
experiments have demonstrated its application for tomographic imaging. So far
this required several hours of acquisition time for a complete tomographic data
set. Based on improvements to the laser system, detectors and reconstruction
algorithms, we were able to reduce this time for a full tomographic scan to 3
minutes. In this paper, we discuss these results and give a prospect to future
imaging systems.
|
physics.med-ph physics.acc-ph physics.optics physics.plasm-ph
|
laser wakefield acceleration of electrons represents a basis for several types of novel xray sources based on thomson scattering or betatron radiation the latter provides a high photon flux and a small source size both being prerequisites for highquality xray imaging furthermore proofofprinciple experiments have demonstrated its application for tomographic imaging so far this required several hours of acquisition time for a complete tomographic data set based on improvements to the laser system detectors and reconstruction algorithms we were able to reduce this time for a full tomographic scan to 3 minutes in this paper we discuss these results and give a prospect to future imaging systems
|
[['laser', 'wakefield', 'acceleration', 'of', 'electrons', 'represents', 'a', 'basis', 'for', 'several', 'types', 'of', 'novel', 'xray', 'sources', 'based', 'on', 'thomson', 'scattering', 'or', 'betatron', 'radiation', 'the', 'latter', 'provides', 'a', 'high', 'photon', 'flux', 'and', 'a', 'small', 'source', 'size', 'both', 'being', 'prerequisites', 'for', 'highquality', 'xray', 'imaging', 'furthermore', 'proofofprinciple', 'experiments', 'have', 'demonstrated', 'its', 'application', 'for', 'tomographic', 'imaging', 'so', 'far', 'this', 'required', 'several', 'hours', 'of', 'acquisition', 'time', 'for', 'a', 'complete', 'tomographic', 'data', 'set', 'based', 'on', 'improvements', 'to', 'the', 'laser', 'system', 'detectors', 'and', 'reconstruction', 'algorithms', 'we', 'were', 'able', 'to', 'reduce', 'this', 'time', 'for', 'a', 'full', 'tomographic', 'scan', 'to', '3', 'minutes', 'in', 'this', 'paper', 'we', 'discuss', 'these', 'results', 'and', 'give', 'a', 'prospect', 'to', 'future', 'imaging', 'systems']]
|
[-0.05454496678321788, 0.10566926802395382, -0.0536302472160102, 0.0772051448622614, -0.062428717162007485, -0.10396301975717472, 0.03553938544159494, 0.44597611165492335, -0.2227163961957966, -0.3488554121604381, 0.1138240613770088, -0.28256077943456787, -0.05105478462989433, 0.3188363520459002, -0.032388333527144986, 0.11352946128746251, 0.11560776995856176, -0.05625333274697241, -0.07557432806537112, -0.22503437672820048, 0.24207121143161067, 0.12325123167013592, 0.28549258764528573, 0.06255034000882617, 0.15358622033240396, 0.03678688870211976, -0.0520096071609557, -0.011175085385721699, -0.10551469221414136, 0.10792714868297923, 0.26603096058574793, 0.17026745659956344, 0.26750056053920884, -0.4574072273952939, -0.24336143929041296, 0.05979838803471458, 0.14715453188335437, 0.1288201408199618, -0.12811419180437714, -0.249398622315847, 0.023968003913825465, -0.13532842796236857, -0.09302260302372764, -0.08808308680950899, 0.007485858469365913, 0.016725526117310624, -0.2795841826569881, 0.021625059976668977, -0.01902821962504047, 0.05833824886722821, -0.0878369128494741, -0.05246059858853815, 0.09043148790799499, 0.0830316635166408, -0.03205228894600801, 0.057293802630330355, 0.12348534453608026, -0.12400951295890889, -0.13932367150941602, 0.3594813935946081, -0.018770363682306536, -0.12157134170356755, 0.17890932305855242, -0.17993324805729996, -0.13585941012618002, 0.18569051998310557, 0.18773601456571407, 0.12533497170623498, -0.15549224179246784, -0.0037439324012870476, 0.024821664963927223, 0.21849442620339551, 0.08170376123346945, 0.07682583096358821, 0.187154963688716, 0.2311797152952265, 0.0627090131807376, 0.14865139271698405, -0.2212424395022757, 0.05598173335316443, -0.2964064139072026, -0.15465153809462753, -0.15598770947343557, 0.04733517981856783, -0.02396823706012328, -0.14502456888206147, 0.42877879168699, 0.20683849527213338, 0.13182673461421907, 0.01569667966627281, 0.38398728436120205, 0.08553749072122296, 0.06083492072142452, 0.0030956630786515287, 0.25821470000746305, 0.08252334512909439, 0.14757276686108628, -0.1749734847989177, -0.02421832059849506, -0.021362950128860005]
|
1,803.05416
|
Onsager's conjecture and anomalous dissipation on domains with boundary
|
We give a localized regularity condition for energy conservation of weak
solutions of the Euler equations on a domain $\Omega\subset \mathbb{R}^d$,
$d\ge 2$, with boundary. In the bulk of fluid, we assume Besov regularity of
the velocity $u\in L^3(0,T;B_{3}^{1/3, c_0})$. On an arbitrary thin
neighborhood of the boundary, we assume boundedness of velocity and pressure
and, at the boundary, we assume continuity of wall-normal velocity. We also
prove two theorems which establish that the global viscous dissipation vanishes
in the inviscid limit for Leray--Hopf solutions $u^\nu$ of the Navier-Stokes
equations under the similar assumptions, but holding uniformly in a thin
boundary layer of width $O(\nu^{\min\{1,\frac{1}{2(1-\sigma)}\}})$ when $u\in
L^3(0, T; B_3^{\sigma, c_0})$ in the interior for any $\sigma\in [1/3,1]$. The
first theorem assumes continuity of the velocity in the boundary layer whereas
the second assumes a condition on the vanishing of energy dissipation within
the layer. In both cases, strong $L^3_tL^3_{x,loc}$ convergence holds to a weak
solution of the Euler equations. Finally, if a strong Euler solution exists in
the background, we show that equicontinuity at the boundary within a $O(\nu)$
strip alone suffices to conclude the absence of anomalous dissipation.
|
math.AP physics.flu-dyn
|
we give a localized regularity condition for energy conservation of weak solutions of the euler equations on a domain omegasubset mathbbrd dge 2 with boundary in the bulk of fluid we assume besov regularity of the velocity uin l30tb_313 c_0 on an arbitrary thin neighborhood of the boundary we assume boundedness of velocity and pressure and at the boundary we assume continuity of wallnormal velocity we also prove two theorems which establish that the global viscous dissipation vanishes in the inviscid limit for lerayhopf solutions unu of the navierstokes equations under the similar assumptions but holding uniformly in a thin boundary layer of width onumin1frac121sigma when uin l30 t b_3sigma c_0 in the interior for any sigmain 131 the first theorem assumes continuity of the velocity in the boundary layer whereas the second assumes a condition on the vanishing of energy dissipation within the layer in both cases strong l3_tl3_xloc convergence holds to a weak solution of the euler equations finally if a strong euler solution exists in the background we show that equicontinuity at the boundary within a onu strip alone suffices to conclude the absence of anomalous dissipation
|
[['we', 'give', 'a', 'localized', 'regularity', 'condition', 'for', 'energy', 'conservation', 'of', 'weak', 'solutions', 'of', 'the', 'euler', 'equations', 'on', 'a', 'domain', 'omegasubset', 'mathbbrd', 'dge', '2', 'with', 'boundary', 'in', 'the', 'bulk', 'of', 'fluid', 'we', 'assume', 'besov', 'regularity', 'of', 'the', 'velocity', 'uin', 'l30tb_313', 'c_0', 'on', 'an', 'arbitrary', 'thin', 'neighborhood', 'of', 'the', 'boundary', 'we', 'assume', 'boundedness', 'of', 'velocity', 'and', 'pressure', 'and', 'at', 'the', 'boundary', 'we', 'assume', 'continuity', 'of', 'wallnormal', 'velocity', 'we', 'also', 'prove', 'two', 'theorems', 'which', 'establish', 'that', 'the', 'global', 'viscous', 'dissipation', 'vanishes', 'in', 'the', 'inviscid', 'limit', 'for', 'lerayhopf', 'solutions', 'unu', 'of', 'the', 'navierstokes', 'equations', 'under', 'the', 'similar', 'assumptions', 'but', 'holding', 'uniformly', 'in', 'a', 'thin', 'boundary', 'layer', 'of', 'width', 'onumin1frac121sigma', 'when', 'uin', 'l30', 't', 'b_3sigma', 'c_0', 'in', 'the', 'interior', 'for', 'any', 'sigmain', '131', 'the', 'first', 'theorem', 'assumes', 'continuity', 'of', 'the', 'velocity', 'in', 'the', 'boundary', 'layer', 'whereas', 'the', 'second', 'assumes', 'a', 'condition', 'on', 'the', 'vanishing', 'of', 'energy', 'dissipation', 'within', 'the', 'layer', 'in', 'both', 'cases', 'strong', 'l3_tl3_xloc', 'convergence', 'holds', 'to', 'a', 'weak', 'solution', 'of', 'the', 'euler', 'equations', 'finally', 'if', 'a', 'strong', 'euler', 'solution', 'exists', 'in', 'the', 'background', 'we', 'show', 'that', 'equicontinuity', 'at', 'the', 'boundary', 'within', 'a', 'onu', 'strip', 'alone', 'suffices', 'to', 'conclude', 'the', 'absence', 'of', 'anomalous', 'dissipation']]
|
[-0.21451605746136998, 0.08146074896258045, -0.06769646016720643, 0.03356186093472104, -0.04357677575805405, -0.1158524056200579, -0.0015264603419489757, 0.28434482303458036, -0.30516581160456985, -0.18183896833810434, 0.1255212373341814, -0.26771475378328796, -0.03022901432824031, 0.14672899006124868, -0.05960897160118185, 0.07257740538547276, 0.05707294587546619, 0.06296684160347908, -0.08660430123438678, -0.1945432653044781, 0.3872641728034929, -0.09709961924035983, 0.24661534723214884, 0.09577340876867604, 0.14810754368156795, -0.056821474312273884, 0.04455102633519639, 0.027037097508611857, -0.24161960768191987, 0.016793241122579804, 0.1652364531902456, -0.007547321928394658, 0.3151641654060973, -0.4561611230294871, -0.22445059410716978, 0.09959645508738454, 0.12437386986278799, 0.03244460316472537, -0.02487107636331911, -0.25691235716384586, 0.13593093794019473, -0.07070179120637476, -0.21609214665268056, 0.0072060571410768335, 0.034956652721169816, 0.06435232649066595, -0.33731476098151314, 0.1513298855860084, 0.15183518167274693, 0.04651801752036698, -0.18863687512179417, -0.06027917473036195, -0.10213455137476245, 0.059527802057795835, 0.0618189772032702, 0.035127444672197985, 0.06671035803493953, -0.16864571585169724, 0.011678891609452905, 0.3420856470086922, -0.12387300994133287, -0.27802754657202833, 0.16687661477975468, -0.20571833327212322, -0.10386313943402661, 0.11249927100374975, 0.12536882848218484, 0.13387253495203633, -0.09998983039368277, 0.16769917868015166, -0.08958879623797432, 0.16155136820750052, 0.13396480376331477, 0.0013764455804340942, 0.10524198149521184, 0.11289541092726292, 0.17903067915317333, 0.12773315806908192, -0.09473618210748061, -0.056671914764710014, -0.42720506238120215, -0.1840328796959472, -0.15864840420388607, 0.10589520755894882, -0.15412906864492137, -0.21907211612016264, 0.3123040964147226, 0.14500567963802485, 0.14505588972029748, 0.08510576016319696, 0.24288288268864014, 0.13774762933032328, -0.0020890399232827207, 0.1709694728926225, 0.2509170153481205, 0.1582959113424764, 0.15139986834346733, -0.2070479307898573, 0.048624951771700814, 0.16640499786483826]
|
1,803.05417
|
Potential quality improvement of stochastic optical localization
nanoscopy images obtained by frame by frame localization algorithms
|
A data movie of stochastic optical localization nanoscopy contains spatial
and temporal correlations, both providing information of emitter locations. The
majority of localization algorithms in the literature estimate emitter
locations by frame-by-frame localization (FFL), which exploit only the spatial
correlation and leave the temporal correlation into the FFL nanoscopy images.
The temporal correlation contained in the FFL images, if exploited, can improve
the localization accuracy and the image quality. In this paper, we analyze the
properties of the FFL images in terms of root mean square minimum distance
(RMSMD) and root mean square error (RMSE). It is shown that RMSMD and RMSE can
be potentially reduced by a maximum fold equal to the square root of the
average number of activations per emitter. Analyzed and revealed are also
several statistical properties of RMSMD and RMSE and their relationship with
respect to a large number of data frames, bias and variance of localization
errors, small localization errors, sample drift, and the worst FFL image.
Numerical examples are taken and the results confirm the prediction of
analysis. The ideas about how to develop an algorithm to exploit the temporal
correlation of FFL images are also briefly discussed. The results suggest
development of two kinds of localization algorithms: the algorithms that can
exploit the temporal correlation of FFL images and the unbiased localization
algorithms.
|
eess.IV
|
a data movie of stochastic optical localization nanoscopy contains spatial and temporal correlations both providing information of emitter locations the majority of localization algorithms in the literature estimate emitter locations by framebyframe localization ffl which exploit only the spatial correlation and leave the temporal correlation into the ffl nanoscopy images the temporal correlation contained in the ffl images if exploited can improve the localization accuracy and the image quality in this paper we analyze the properties of the ffl images in terms of root mean square minimum distance rmsmd and root mean square error rmse it is shown that rmsmd and rmse can be potentially reduced by a maximum fold equal to the square root of the average number of activations per emitter analyzed and revealed are also several statistical properties of rmsmd and rmse and their relationship with respect to a large number of data frames bias and variance of localization errors small localization errors sample drift and the worst ffl image numerical examples are taken and the results confirm the prediction of analysis the ideas about how to develop an algorithm to exploit the temporal correlation of ffl images are also briefly discussed the results suggest development of two kinds of localization algorithms the algorithms that can exploit the temporal correlation of ffl images and the unbiased localization algorithms
|
[['a', 'data', 'movie', 'of', 'stochastic', 'optical', 'localization', 'nanoscopy', 'contains', 'spatial', 'and', 'temporal', 'correlations', 'both', 'providing', 'information', 'of', 'emitter', 'locations', 'the', 'majority', 'of', 'localization', 'algorithms', 'in', 'the', 'literature', 'estimate', 'emitter', 'locations', 'by', 'framebyframe', 'localization', 'ffl', 'which', 'exploit', 'only', 'the', 'spatial', 'correlation', 'and', 'leave', 'the', 'temporal', 'correlation', 'into', 'the', 'ffl', 'nanoscopy', 'images', 'the', 'temporal', 'correlation', 'contained', 'in', 'the', 'ffl', 'images', 'if', 'exploited', 'can', 'improve', 'the', 'localization', 'accuracy', 'and', 'the', 'image', 'quality', 'in', 'this', 'paper', 'we', 'analyze', 'the', 'properties', 'of', 'the', 'ffl', 'images', 'in', 'terms', 'of', 'root', 'mean', 'square', 'minimum', 'distance', 'rmsmd', 'and', 'root', 'mean', 'square', 'error', 'rmse', 'it', 'is', 'shown', 'that', 'rmsmd', 'and', 'rmse', 'can', 'be', 'potentially', 'reduced', 'by', 'a', 'maximum', 'fold', 'equal', 'to', 'the', 'square', 'root', 'of', 'the', 'average', 'number', 'of', 'activations', 'per', 'emitter', 'analyzed', 'and', 'revealed', 'are', 'also', 'several', 'statistical', 'properties', 'of', 'rmsmd', 'and', 'rmse', 'and', 'their', 'relationship', 'with', 'respect', 'to', 'a', 'large', 'number', 'of', 'data', 'frames', 'bias', 'and', 'variance', 'of', 'localization', 'errors', 'small', 'localization', 'errors', 'sample', 'drift', 'and', 'the', 'worst', 'ffl', 'image', 'numerical', 'examples', 'are', 'taken', 'and', 'the', 'results', 'confirm', 'the', 'prediction', 'of', 'analysis', 'the', 'ideas', 'about', 'how', 'to', 'develop', 'an', 'algorithm', 'to', 'exploit', 'the', 'temporal', 'correlation', 'of', 'ffl', 'images', 'are', 'also', 'briefly', 'discussed', 'the', 'results', 'suggest', 'development', 'of', 'two', 'kinds', 'of', 'localization', 'algorithms', 'the', 'algorithms', 'that', 'can', 'exploit', 'the', 'temporal', 'correlation', 'of', 'ffl', 'images', 'and', 'the', 'unbiased', 'localization', 'algorithms']]
|
[-0.10330620372606804, 0.024099593157513907, -0.053719503570103605, 0.11951944016434286, 0.00420511595281136, -0.13042074521135422, 0.00731695646934245, 0.43422423812088756, -0.2724969999915267, -0.3355362568636914, 0.11311544125216984, -0.3116667574372699, -0.17225340932815197, 0.16947417643671325, -0.09071600879647883, 0.04916103631605676, 0.09201497981288972, 0.06644469361364572, -0.10215307040152148, -0.2639562023658204, 0.23061083038906435, 0.08508627949392095, 0.3115750258910676, 0.03938464494000665, 0.12447819259856317, 0.016526912639815174, -0.07295115388154444, 0.05692921130079354, -0.0819802376090963, 0.16118575632572174, 0.22311030312260083, 0.1391706128564676, 0.28603071547050146, -0.37126907456767766, -0.185141684715025, 0.09221211684303046, 0.18197451582496113, 0.08851485812722608, -0.012745213097517643, -0.3321360555473226, 0.07462327424684388, -0.09426519383436145, -0.04592494490847194, -0.05904088391842346, -0.016176576325269542, 0.07494588909729709, -0.2513573393267811, 0.12718964210891573, 0.03448754451001891, 0.08770225529993012, -0.040714750558925934, -0.09904051577562795, -0.0010475270087700085, 0.20444149512911375, 0.026023727718412, 0.023610398967695588, 0.12418916302720481, -0.15560285097008625, -0.13950118948299883, 0.3362379764581765, -0.02983192750042077, -0.19891928403945935, 0.14843668057941473, -0.15490361697744257, -0.06083584304823123, 0.15896944457673515, 0.20502873991007128, 0.052591637334242734, -0.15121639056164957, -0.005455808670837348, -0.00043044456415620053, 0.2262750850543717, 0.04938190616035151, 0.10242505993576072, 0.1536790793045209, 0.15213678121710053, 0.04471872092911561, 0.137801282945915, -0.22185014384668067, -0.040125576436848324, -0.2610341462504742, -0.12603217056779636, -0.21118234193618346, -0.022520608333470426, -0.1599235948740412, -0.15359850803522362, 0.4303951007208673, 0.2149416331730665, 0.19055909803137183, 0.092342591360401, 0.2952165565921238, 0.06700575435997674, 0.09423035969725932, 0.04874290910663243, 0.20932635823075083, 0.11065300599338984, 0.06237117068976906, -0.2373833221718416, 0.06996694249859527, 0.059476215092094435]
|
1,803.05418
|
The DOZZ Formula from the Path Integral
|
We present a rigorous proof of the Dorn, Otto, Zamolodchikov, Zamolodchikov
formula (the DOZZ formula) for the 3 point structure constants of Liouville
Conformal Field Theory (LCFT) starting from a rigorous probabilistic
construction of the functional integral defining LCFT given earlier by the
authors and David. A crucial ingredient in our argument is a probabilistic
derivation of the reflection relation in LCFT based on a refined tail analysis
of Gaussian multiplicative chaos measures.
|
hep-th math-ph math.MP
|
we present a rigorous proof of the dorn otto zamolodchikov zamolodchikov formula the dozz formula for the 3 point structure constants of liouville conformal field theory lcft starting from a rigorous probabilistic construction of the functional integral defining lcft given earlier by the authors and david a crucial ingredient in our argument is a probabilistic derivation of the reflection relation in lcft based on a refined tail analysis of gaussian multiplicative chaos measures
|
[['we', 'present', 'a', 'rigorous', 'proof', 'of', 'the', 'dorn', 'otto', 'zamolodchikov', 'zamolodchikov', 'formula', 'the', 'dozz', 'formula', 'for', 'the', '3', 'point', 'structure', 'constants', 'of', 'liouville', 'conformal', 'field', 'theory', 'lcft', 'starting', 'from', 'a', 'rigorous', 'probabilistic', 'construction', 'of', 'the', 'functional', 'integral', 'defining', 'lcft', 'given', 'earlier', 'by', 'the', 'authors', 'and', 'david', 'a', 'crucial', 'ingredient', 'in', 'our', 'argument', 'is', 'a', 'probabilistic', 'derivation', 'of', 'the', 'reflection', 'relation', 'in', 'lcft', 'based', 'on', 'a', 'refined', 'tail', 'analysis', 'of', 'gaussian', 'multiplicative', 'chaos', 'measures']]
|
[-0.13978396467736934, 0.027608536872757623, -0.2234221541718261, 0.11617237478271382, -0.12262795361600919, -0.12093348620612532, 0.09149408760506099, 0.22213703177052818, -0.19448864050145734, -0.2229344723873759, 0.07221033252864974, -0.22616771868851088, -0.23408435454132825, 0.19822001077030618, -0.07440782400096882, 0.09111591973278212, -0.0041228328219117365, 0.03353637243200042, -0.09593702588638622, -0.18782133639356352, 0.3370076397574213, 0.07187952110161112, 0.2536599046569828, 0.05122918414258181, 0.10387860771192059, 0.1036418443800856, -0.1227894586778871, -0.058692693965484016, -0.2225696300602939, 0.19085812806598332, 0.21065613355691712, 0.07927752593580047, 0.2565133873124492, -0.4022048477797884, -0.20526997000895988, -0.00777772731109433, 0.0986486842962658, 0.10371927178324494, -0.0039138558993677365, -0.31158675394365437, 0.020282127141748388, -0.15298691287330568, -0.23470701932371274, -0.04902803548292754, 0.053150704521239316, -0.035223959932384426, -0.24173091693098772, 0.1022822835725056, 0.1593107396723983, 0.14209622000535466, -0.053641282857638105, -0.09405254695105227, 0.04085223065778511, 0.07694445801771259, 0.004632517124513445, 0.1082856477148933, 0.09828786685271826, -0.07095591320452115, -0.1533290767302252, 0.2581015467605464, -0.10407659859230665, -0.18985784538600542, 0.08109774285040745, -0.1168561810691369, -0.21041480003384083, 0.07132593982483018, -0.0009062704375039224, 0.13310485255381424, -0.15573998414416965, 0.20819852505539455, -0.09051575961407937, 0.09194084657683063, 0.11739673055963565, -0.009978637252360175, 0.15612482927637558, 0.09352283801066957, 0.004131739455185933, 0.13938181016798298, 0.04878695507865552, -0.16122143069435269, -0.43182090532085665, -0.1902088717121331, -0.22574017405484434, 0.1560740476260472, -0.19921926449811284, -0.22229750423806988, 0.36095122709768274, 0.10979023336154593, 0.12440425295969598, 0.13969160398238734, 0.21555503428441614, 0.21176554157545358, 0.02094754666625841, 0.04045636193469575, 0.1788790300695787, 0.2751434564698896, 0.09881789307269484, -0.13807666146400552, -0.0014255050480467815, 0.30748685056739167]
|
1,803.05419
|
Generalised Structural CNNs (SCNNs) for time series data with arbitrary
graph topology
|
Deep Learning methods, specifically convolutional neural networks (CNNs),
have seen a lot of success in the domain of image-based data, where the data
offers a clearly structured topology in the regular lattice of pixels. This
4-neighbourhood topological simplicity makes the application of convolutional
masks straightforward for time series data, such as video applications, but
many high-dimensional time series data are not organised in regular lattices,
and instead values may have adjacency relationships with non-trivial
topologies, such as small-world networks or trees. In our application case,
human kinematics, it is currently unclear how to generalise convolutional
kernels in a principled manner. Therefore we define and implement here a
framework for general graph-structured CNNs for time series analysis. Our
algorithm automatically builds convolutional layers using the specified
adjacency matrix of the data dimensions and convolutional masks that scale with
the hop distance. In the limit of a lattice-topology our method produces the
well-known image convolutional masks. We test our method first on synthetic
data of arbitrarily-connected graphs and human hand motion capture data, where
the hand is represented by a tree capturing the mechanical dependencies of the
joints. We are able to demonstrate, amongst other things, that inclusion of the
graph structure of the data dimensions improves model prediction significantly,
when compared against a benchmark CNN model with only time convolution layers.
|
stat.ML cs.LG
|
deep learning methods specifically convolutional neural networks cnns have seen a lot of success in the domain of imagebased data where the data offers a clearly structured topology in the regular lattice of pixels this 4neighbourhood topological simplicity makes the application of convolutional masks straightforward for time series data such as video applications but many highdimensional time series data are not organised in regular lattices and instead values may have adjacency relationships with nontrivial topologies such as smallworld networks or trees in our application case human kinematics it is currently unclear how to generalise convolutional kernels in a principled manner therefore we define and implement here a framework for general graphstructured cnns for time series analysis our algorithm automatically builds convolutional layers using the specified adjacency matrix of the data dimensions and convolutional masks that scale with the hop distance in the limit of a latticetopology our method produces the wellknown image convolutional masks we test our method first on synthetic data of arbitrarilyconnected graphs and human hand motion capture data where the hand is represented by a tree capturing the mechanical dependencies of the joints we are able to demonstrate amongst other things that inclusion of the graph structure of the data dimensions improves model prediction significantly when compared against a benchmark cnn model with only time convolution layers
|
[['deep', 'learning', 'methods', 'specifically', 'convolutional', 'neural', 'networks', 'cnns', 'have', 'seen', 'a', 'lot', 'of', 'success', 'in', 'the', 'domain', 'of', 'imagebased', 'data', 'where', 'the', 'data', 'offers', 'a', 'clearly', 'structured', 'topology', 'in', 'the', 'regular', 'lattice', 'of', 'pixels', 'this', '4neighbourhood', 'topological', 'simplicity', 'makes', 'the', 'application', 'of', 'convolutional', 'masks', 'straightforward', 'for', 'time', 'series', 'data', 'such', 'as', 'video', 'applications', 'but', 'many', 'highdimensional', 'time', 'series', 'data', 'are', 'not', 'organised', 'in', 'regular', 'lattices', 'and', 'instead', 'values', 'may', 'have', 'adjacency', 'relationships', 'with', 'nontrivial', 'topologies', 'such', 'as', 'smallworld', 'networks', 'or', 'trees', 'in', 'our', 'application', 'case', 'human', 'kinematics', 'it', 'is', 'currently', 'unclear', 'how', 'to', 'generalise', 'convolutional', 'kernels', 'in', 'a', 'principled', 'manner', 'therefore', 'we', 'define', 'and', 'implement', 'here', 'a', 'framework', 'for', 'general', 'graphstructured', 'cnns', 'for', 'time', 'series', 'analysis', 'our', 'algorithm', 'automatically', 'builds', 'convolutional', 'layers', 'using', 'the', 'specified', 'adjacency', 'matrix', 'of', 'the', 'data', 'dimensions', 'and', 'convolutional', 'masks', 'that', 'scale', 'with', 'the', 'hop', 'distance', 'in', 'the', 'limit', 'of', 'a', 'latticetopology', 'our', 'method', 'produces', 'the', 'wellknown', 'image', 'convolutional', 'masks', 'we', 'test', 'our', 'method', 'first', 'on', 'synthetic', 'data', 'of', 'arbitrarilyconnected', 'graphs', 'and', 'human', 'hand', 'motion', 'capture', 'data', 'where', 'the', 'hand', 'is', 'represented', 'by', 'a', 'tree', 'capturing', 'the', 'mechanical', 'dependencies', 'of', 'the', 'joints', 'we', 'are', 'able', 'to', 'demonstrate', 'amongst', 'other', 'things', 'that', 'inclusion', 'of', 'the', 'graph', 'structure', 'of', 'the', 'data', 'dimensions', 'improves', 'model', 'prediction', 'significantly', 'when', 'compared', 'against', 'a', 'benchmark', 'cnn', 'model', 'with', 'only', 'time', 'convolution', 'layers']]
|
[-0.05778082878079935, 0.018484534186092184, -0.06318334119892272, 0.06557416208871653, -0.10612751019921171, -0.1655986934196427, 0.011784380592603219, 0.46464298464666864, -0.289691588339237, -0.30428356444355836, 0.08813636462431625, -0.280220902716947, -0.23058261468787655, 0.17989250548797647, -0.09550879618758121, 0.09091495526993426, 0.15848932106826832, 0.04455159559317764, -0.042960386388518845, -0.27021031622135955, 0.321893719636539, 0.035681489516936955, 0.32956158981147793, -0.0046352153549545924, 0.11074521996441387, -0.02111457791909026, -0.04658592235302866, 0.014618789075448902, -0.05307700739314292, 0.16233425475077592, 0.2939502621779845, 0.15354543468005064, 0.2605814437632994, -0.46024022797285685, -0.24879958983435627, 0.09074013796849563, 0.1428023360271011, 0.10835305674319168, -0.0024729960320156908, -0.32417789405353437, 0.0799661583228526, -0.15455249263389972, -0.012333612964158096, -0.14794057165701716, 0.00799366426632701, -0.0014201977036996372, -0.2827418069872889, 0.040335544408620916, 0.08250225099953844, 0.05811764518215325, -0.024074391575105283, -0.08165714821042193, -0.0004960512482209242, 0.16860882731110033, 0.0036217379356919, 0.02964274668293546, 0.10669826965109544, -0.16936810106287972, -0.139897847338365, 0.35448333799564347, -0.035036440579808634, -0.2093265376403533, 0.18944159504627028, -0.09065170631280452, -0.1765257636029359, 0.07800252529500645, 0.21751633761150221, 0.12061886704840144, -0.137074822544462, 0.05418419058451832, -0.0721103884751827, 0.1817577901309193, 0.06589560099546948, 0.005195800716342825, 0.15302396462672316, 0.26782773703461177, 0.02873171816772056, 0.1434465846787679, -0.13254060458567868, -0.06488441229124085, -0.20805063102370738, -0.08191587073161924, -0.22652717445298926, -0.03148323373727163, -0.16361650901557964, -0.19543066189982736, 0.42802787007343385, 0.1994915145437538, 0.24734294889945416, 0.13840331739321146, 0.33682003749367107, 0.00876188622937808, 0.16838201849983173, 0.09516650153869068, 0.15293725999320315, 0.06298941015995489, 0.12025188973542594, -0.10495051637630962, 0.08048286071060062, 0.0747860109647854]
|
1,803.0542
|
Magnetic-Field Tuning of Light-Induced Superconductivity in Striped
La$_{2-x}$Ba$_x$CuO$_4$
|
Optical excitation of stripe-ordered La$_{2-x}$Ba$_x$CuO$_4$ has been shown
to transiently enhance superconducting tunneling between the CuO$_2$ planes.
This effect was revealed by a blue-shift, or by the appearance of a Josephson
Plasma Resonance in the terahertz-frequency optical properties. Here, we show
that this photo-induced state can be strengthened by the application of high
external magnetic fields oriented along the c-axis. For a 7-Tesla field, we
observe up to a ten-fold enhancement in the transient interlayer phase
correlation length, accompanied by a two-fold increase in the relaxation time
of the photo-induced state. These observations are highly surprising, since
static magnetic fields suppress interlayer Josephson tunneling and stabilize
stripe order at equilibrium. We interpret our data as an indication that
optically-enhanced interlayer coupling in La$_{2-x}$Ba$_x$CuO$_4$ does not
originate from a simple optical melting of stripes, as previously hypothesized.
Rather, we speculate that the photo-induced state may emerge from activated
tunneling between optically-excited stripes in adjacent planes.
|
cond-mat.supr-con cond-mat.str-el
|
optical excitation of stripeordered la_2xba_xcuo_4 has been shown to transiently enhance superconducting tunneling between the cuo_2 planes this effect was revealed by a blueshift or by the appearance of a josephson plasma resonance in the terahertzfrequency optical properties here we show that this photoinduced state can be strengthened by the application of high external magnetic fields oriented along the caxis for a 7tesla field we observe up to a tenfold enhancement in the transient interlayer phase correlation length accompanied by a twofold increase in the relaxation time of the photoinduced state these observations are highly surprising since static magnetic fields suppress interlayer josephson tunneling and stabilize stripe order at equilibrium we interpret our data as an indication that opticallyenhanced interlayer coupling in la_2xba_xcuo_4 does not originate from a simple optical melting of stripes as previously hypothesized rather we speculate that the photoinduced state may emerge from activated tunneling between opticallyexcited stripes in adjacent planes
|
[['optical', 'excitation', 'of', 'stripeordered', 'la_2xba_xcuo_4', 'has', 'been', 'shown', 'to', 'transiently', 'enhance', 'superconducting', 'tunneling', 'between', 'the', 'cuo_2', 'planes', 'this', 'effect', 'was', 'revealed', 'by', 'a', 'blueshift', 'or', 'by', 'the', 'appearance', 'of', 'a', 'josephson', 'plasma', 'resonance', 'in', 'the', 'terahertzfrequency', 'optical', 'properties', 'here', 'we', 'show', 'that', 'this', 'photoinduced', 'state', 'can', 'be', 'strengthened', 'by', 'the', 'application', 'of', 'high', 'external', 'magnetic', 'fields', 'oriented', 'along', 'the', 'caxis', 'for', 'a', '7tesla', 'field', 'we', 'observe', 'up', 'to', 'a', 'tenfold', 'enhancement', 'in', 'the', 'transient', 'interlayer', 'phase', 'correlation', 'length', 'accompanied', 'by', 'a', 'twofold', 'increase', 'in', 'the', 'relaxation', 'time', 'of', 'the', 'photoinduced', 'state', 'these', 'observations', 'are', 'highly', 'surprising', 'since', 'static', 'magnetic', 'fields', 'suppress', 'interlayer', 'josephson', 'tunneling', 'and', 'stabilize', 'stripe', 'order', 'at', 'equilibrium', 'we', 'interpret', 'our', 'data', 'as', 'an', 'indication', 'that', 'opticallyenhanced', 'interlayer', 'coupling', 'in', 'la_2xba_xcuo_4', 'does', 'not', 'originate', 'from', 'a', 'simple', 'optical', 'melting', 'of', 'stripes', 'as', 'previously', 'hypothesized', 'rather', 'we', 'speculate', 'that', 'the', 'photoinduced', 'state', 'may', 'emerge', 'from', 'activated', 'tunneling', 'between', 'opticallyexcited', 'stripes', 'in', 'adjacent', 'planes']]
|
[-0.20819212540183704, 0.23422267853848872, -0.051135817270872935, 0.037113007132931815, -0.05051861381998249, -0.1154025217481688, 0.10167014019813364, 0.43278877965472884, -0.28281137383743826, -0.28664234092039076, -0.006930006997434581, -0.29061103120653164, -0.14088190125234523, 0.17093655919759637, 0.03728186695538218, -0.05320656198241255, -0.03003668301248789, -0.04667113260883424, -0.06711432280694592, -0.17459788003607707, 0.2673835507381001, 0.0014577472561154686, 0.3381239517798854, 0.1010405191135124, 0.040640660869779396, -0.014287554016762894, 0.10665085438176308, 0.0513910784072614, -0.12945788615525683, -0.002162877994218957, 0.25262029098919014, -0.09108923260931738, 0.18777675528894938, -0.4700108672723515, -0.2262538802548269, 0.033106083904082574, 0.2108755826134405, 0.1921733377951812, -0.06109163645743179, -0.2804249683212416, 0.03441264868860005, -0.1189419403246123, -0.1124519319243096, -0.08683495226870078, -0.001091900947382004, 0.008750701484459094, -0.23660375788089594, 0.11979014786976858, 0.08521467042186, 0.09252552028121107, -0.08690682315766762, -0.05094071712612716, -0.08498774679359414, 0.030283600032585217, 0.05299208930836613, 0.11163341283670389, 0.1570893269202678, -0.10470923448964539, -0.14460597485204965, 0.2820784017273219, -0.08390216113850353, -0.05097223953739588, 0.15370575274687773, -0.19577636719480448, -0.05520246078159806, 0.2239553982078469, 0.10322055110561028, 0.07679526658053053, -0.12858470561275004, -0.0020194709992638845, 0.004345524118714084, 0.20243514015101918, 0.09830549452149498, 0.08862604176834092, 0.2911364906033793, 0.17063158330145395, 0.039673861237912396, 0.17981512524306262, -0.15607251214727857, -0.036199908143554636, -0.2077576143034046, -0.13162605733355032, -0.19305057569826936, 0.09109928061300356, -0.023870773089869294, -0.17797316651653614, 0.3790678612283337, 0.16326677995533043, 0.21818643461401557, -0.1041357817198302, 0.23583738146702837, 0.09010084099638477, 0.1029495987919421, 0.00928829179611057, 0.31880358960844724, 0.16313556769597984, 0.14299081142358724, -0.3074990043666189, 0.09567109844951702, -0.01600157945520348]
|
1,803.05421
|
Totally Ordered Measured Trees and Splitting Trees with Infinite
Variation II: Prolific Skeleton Decomposition
|
The first part of this paper ( arXiv:1607.02114 ) introduced splitting trees,
those chronological trees admitting the self-similarity property where
individuals give birth, at constant rate, to iid copies of themselves. It also
established the intimate relationship between splitting trees and L\'evy
processes. The chronological trees involved were formalized as Totally Ordered
Measured (TOM) trees.
The aim of this paper is to continue this line of research in two directions:
we first decompose locally compact TOM trees in terms of their prolific
skeleton (consisting of its infinite lines of descent). When applied to
splitting trees, this implies the construction of the supercritical ones (which
are locally compact) in terms of the subcritical ones (which are compact)
grafted onto a Yule tree (which corresponds to the prolific skeleton).
As a second (related) direction, we study the genealogical tree associated to
our chronological construction. This is done through the technology of the
height process introduced by Duquesne and Le Gall. In particular we prove a
Ray-Knight type theorem which extends the one for (sub)critical L\'evy trees to
the supercritical case.
|
math.PR
|
the first part of this paper arxiv160702114 introduced splitting trees those chronological trees admitting the selfsimilarity property where individuals give birth at constant rate to iid copies of themselves it also established the intimate relationship between splitting trees and levy processes the chronological trees involved were formalized as totally ordered measured tom trees the aim of this paper is to continue this line of research in two directions we first decompose locally compact tom trees in terms of their prolific skeleton consisting of its infinite lines of descent when applied to splitting trees this implies the construction of the supercritical ones which are locally compact in terms of the subcritical ones which are compact grafted onto a yule tree which corresponds to the prolific skeleton as a second related direction we study the genealogical tree associated to our chronological construction this is done through the technology of the height process introduced by duquesne and le gall in particular we prove a rayknight type theorem which extends the one for subcritical levy trees to the supercritical case
|
[['the', 'first', 'part', 'of', 'this', 'paper', 'arxiv160702114', 'introduced', 'splitting', 'trees', 'those', 'chronological', 'trees', 'admitting', 'the', 'selfsimilarity', 'property', 'where', 'individuals', 'give', 'birth', 'at', 'constant', 'rate', 'to', 'iid', 'copies', 'of', 'themselves', 'it', 'also', 'established', 'the', 'intimate', 'relationship', 'between', 'splitting', 'trees', 'and', 'levy', 'processes', 'the', 'chronological', 'trees', 'involved', 'were', 'formalized', 'as', 'totally', 'ordered', 'measured', 'tom', 'trees', 'the', 'aim', 'of', 'this', 'paper', 'is', 'to', 'continue', 'this', 'line', 'of', 'research', 'in', 'two', 'directions', 'we', 'first', 'decompose', 'locally', 'compact', 'tom', 'trees', 'in', 'terms', 'of', 'their', 'prolific', 'skeleton', 'consisting', 'of', 'its', 'infinite', 'lines', 'of', 'descent', 'when', 'applied', 'to', 'splitting', 'trees', 'this', 'implies', 'the', 'construction', 'of', 'the', 'supercritical', 'ones', 'which', 'are', 'locally', 'compact', 'in', 'terms', 'of', 'the', 'subcritical', 'ones', 'which', 'are', 'compact', 'grafted', 'onto', 'a', 'yule', 'tree', 'which', 'corresponds', 'to', 'the', 'prolific', 'skeleton', 'as', 'a', 'second', 'related', 'direction', 'we', 'study', 'the', 'genealogical', 'tree', 'associated', 'to', 'our', 'chronological', 'construction', 'this', 'is', 'done', 'through', 'the', 'technology', 'of', 'the', 'height', 'process', 'introduced', 'by', 'duquesne', 'and', 'le', 'gall', 'in', 'particular', 'we', 'prove', 'a', 'rayknight', 'type', 'theorem', 'which', 'extends', 'the', 'one', 'for', 'subcritical', 'levy', 'trees', 'to', 'the', 'supercritical', 'case']]
|
[-0.11426398130266795, 0.16774723778079664, -0.05942069638919618, 0.09560710596956987, -0.10923022050144417, -0.08394223029060023, 0.06614490814640053, 0.3502127822175888, -0.3060724346446139, -0.2297872207686305, 0.11596555487918002, -0.2401555175547089, -0.14791792408762766, 0.15689903791461673, -0.07887654576450587, -0.019989962524934006, 0.05531997471781713, 0.05480270929102387, 0.011198041619999068, -0.28808739966114183, 0.36693428176588244, 0.04579549393483571, 0.2554870369591351, -0.01304960422483938, 0.1089674342503505, 0.030442427809217146, -0.0807622238541288, 0.008682014042777674, -0.16679100818932058, 0.1265796889271587, 0.27858850843406147, 0.11059064855133849, 0.23867248844355346, -0.3544240988152368, -0.14818614994009424, 0.1574190271379692, 0.15364899173112853, 0.06834197164380125, 0.0056765163809593235, -0.2816445937300367, 0.10100951782560774, -0.14286845608481338, -0.15766548047906587, 0.024359833348010267, 0.05214995405536943, 0.030357016972931368, -0.20577492116950452, 0.03962870186710331, 0.1636725425241249, 0.026083504312139537, -0.0014877273627955999, -0.11433047203679703, -0.05254340155449297, 0.13062240738637879, 0.0381916267077239, 0.051500891517581686, 0.08997913077207548, -0.05345758739991912, -0.16247926786076278, 0.3069216241155352, -0.0567689374109198, -0.1737348300019013, 0.20136972536465952, -0.13583845005104583, -0.21302613798795003, 0.10832995167268174, 0.1606350166350603, 0.1585178931775902, -0.15572031336079817, 0.10426049558512335, -0.04192221827272858, 0.05084570717864803, 0.15654942015185952, -0.06259826038698, 0.15258036961778998, 0.15828823517143195, 0.10359203160091836, 0.18972128699766472, -0.002493119008639561, -0.11750822209886143, -0.27153717780219655, -0.15796934090055792, -0.13351124438058054, 0.06489758490185653, -0.11251220115842962, -0.22283222157907273, 0.36241867924375193, 0.08849043308890292, 0.21921364404793298, 0.126847933139652, 0.22244498739551222, 0.07381065870834781, 0.023344358362789665, 0.057538165515621326, 0.1286858708517892, 0.20323447427845426, 0.10168382103687951, -0.11987914131305713, 0.10003458001783916, 0.15738014797813127]
|
1,803.05422
|
Cartan's theorem for some topological generalized groups
|
In this paper we show that topological subgroupoids of Lie groupoids, under
special circumstances are Lie subgroupoids. Giving an example, we indicate that
having the same topological dimension is a necessary condition for topological
subgroupoids to be Lie subgroupoids. Also, we provide some conditions for
double subgroupoids to become double Lie subgroupoids. Moreover, we illustrate
that having the same conditions as the Cartan's theorem for Lie groups, helps
us prove the same theorem for generalized Lie groups.
|
math.DG
|
in this paper we show that topological subgroupoids of lie groupoids under special circumstances are lie subgroupoids giving an example we indicate that having the same topological dimension is a necessary condition for topological subgroupoids to be lie subgroupoids also we provide some conditions for double subgroupoids to become double lie subgroupoids moreover we illustrate that having the same conditions as the cartans theorem for lie groups helps us prove the same theorem for generalized lie groups
|
[['in', 'this', 'paper', 'we', 'show', 'that', 'topological', 'subgroupoids', 'of', 'lie', 'groupoids', 'under', 'special', 'circumstances', 'are', 'lie', 'subgroupoids', 'giving', 'an', 'example', 'we', 'indicate', 'that', 'having', 'the', 'same', 'topological', 'dimension', 'is', 'a', 'necessary', 'condition', 'for', 'topological', 'subgroupoids', 'to', 'be', 'lie', 'subgroupoids', 'also', 'we', 'provide', 'some', 'conditions', 'for', 'double', 'subgroupoids', 'to', 'become', 'double', 'lie', 'subgroupoids', 'moreover', 'we', 'illustrate', 'that', 'having', 'the', 'same', 'conditions', 'as', 'the', 'cartans', 'theorem', 'for', 'lie', 'groups', 'helps', 'us', 'prove', 'the', 'same', 'theorem', 'for', 'generalized', 'lie', 'groups']]
|
[-0.18912426316989706, 0.0817154802145004, -0.12773540833747232, 0.12727196096116072, -0.18673974706779245, -0.15394493353903874, 0.046596103443086824, 0.4098278364868133, -0.27617914981946545, -0.21647656024373196, 0.12301330256136739, -0.15961160884819345, -0.17902448201285942, 0.27054461668693014, -0.1613873333440392, -0.05953780096024275, 0.04935493595390157, 0.1262551067830154, -0.13617749287529135, -0.2922761718948166, 0.41918108926771525, -0.03781888580294447, 0.2671739285110266, 0.06700044657124883, 0.08868544341923741, -0.0067645508142841326, 0.06899852271179681, 0.0030476197769696064, -0.17170333958904838, 0.06961329783276692, 0.3187734958800403, 0.02451059195612158, 0.20762164111841808, -0.3542264081392582, -0.12470490040330144, 0.15507949698510787, 0.11375739055915506, 0.0766459789683486, -0.07361726484914588, -0.3158549169296181, 0.18170077013843633, -0.1683163701597444, -0.20229252859611402, -0.09940075934199351, 0.006257091419069798, -0.02578175060644552, -0.21753107020994286, 0.015757669618749363, 0.1449916185932113, 0.09683884119058585, -0.0985170458201561, -0.06620661850244582, -0.052034085332234574, 0.11916245487306944, -0.05014305864460766, -0.08381032135773014, 0.09112102447634006, -0.03652381816237875, -0.1347077979476421, 0.4048559794311303, 0.03381374068316314, -0.20997961946799384, 0.19949631494554607, -0.176546452530696, -0.2691836216269279, 0.07116445899463271, 0.06049655809659849, 0.10742197096251048, -0.07458337643123292, 0.14310685152115374, -0.14664998180051517, -0.017475934578226757, 0.10649389609718671, 0.04322611602845711, 0.12801800108236538, 0.11742689006949787, 0.16767244385071584, 0.15460221916769765, 0.02222607732302957, -0.017527470824780404, -0.3968582801859487, -0.2565805742323592, -0.038387011295160305, 0.10845756327866443, -0.08739662920306256, -0.17142797262686027, 0.3894602403093081, 0.14422766495399275, 0.1662586110087668, 0.13074941719676575, 0.1339562742837838, 0.11505861772532731, 0.11242503372879771, 0.05001700539504746, 0.160512419437533, 0.2633719320179193, -0.04322497241876342, -0.08850226706716341, -0.08874799229519127, 0.15021061044573397]
|
1,803.05423
|
Distinguishing topological Majorana bound states from trivial Andreev
bound states: Proposed tests through differential tunneling conductance
spectroscopy
|
Trivial Andreev bound states arising from chemical potential variations could
lead to zero-bias tunneling conductance peaks at finite magnetic fields in
class $D$ nanowires, precisely mimicking the predicted zero-bias conductance
peaks arising from the topological Majorana bound states. This finding raises a
serious question on the efficacy of using zero-bias tunneling conductance
peaks, by themselves, as evidence supporting the existence of topological
Majorana bound states in nanowires. In the current work, we provide specific
experimental protocols for tunneling spectroscopy measure- ments to distinguish
between Andreev and Majorana bound states without invoking more demand- ing
nonlocal measurements which have not yet been successfully performed in
nanowire systems. In particular, we discuss three distinct experimental schemes
involving response of the zero-bias peak to local perturbations of the tunnel
barrier, overlap of bound states from the wire ends, and most compellingly,
introducing a sharp localized potential in the wire itself to perturb the
zero-bias tun- neling peaks. We provide extensive numerical simulations
clarifying and supporting our theoretical predictions.
|
cond-mat.mes-hall
|
trivial andreev bound states arising from chemical potential variations could lead to zerobias tunneling conductance peaks at finite magnetic fields in class d nanowires precisely mimicking the predicted zerobias conductance peaks arising from the topological majorana bound states this finding raises a serious question on the efficacy of using zerobias tunneling conductance peaks by themselves as evidence supporting the existence of topological majorana bound states in nanowires in the current work we provide specific experimental protocols for tunneling spectroscopy measure ments to distinguish between andreev and majorana bound states without invoking more demand ing nonlocal measurements which have not yet been successfully performed in nanowire systems in particular we discuss three distinct experimental schemes involving response of the zerobias peak to local perturbations of the tunnel barrier overlap of bound states from the wire ends and most compellingly introducing a sharp localized potential in the wire itself to perturb the zerobias tun neling peaks we provide extensive numerical simulations clarifying and supporting our theoretical predictions
|
[['trivial', 'andreev', 'bound', 'states', 'arising', 'from', 'chemical', 'potential', 'variations', 'could', 'lead', 'to', 'zerobias', 'tunneling', 'conductance', 'peaks', 'at', 'finite', 'magnetic', 'fields', 'in', 'class', 'd', 'nanowires', 'precisely', 'mimicking', 'the', 'predicted', 'zerobias', 'conductance', 'peaks', 'arising', 'from', 'the', 'topological', 'majorana', 'bound', 'states', 'this', 'finding', 'raises', 'a', 'serious', 'question', 'on', 'the', 'efficacy', 'of', 'using', 'zerobias', 'tunneling', 'conductance', 'peaks', 'by', 'themselves', 'as', 'evidence', 'supporting', 'the', 'existence', 'of', 'topological', 'majorana', 'bound', 'states', 'in', 'nanowires', 'in', 'the', 'current', 'work', 'we', 'provide', 'specific', 'experimental', 'protocols', 'for', 'tunneling', 'spectroscopy', 'measure', 'ments', 'to', 'distinguish', 'between', 'andreev', 'and', 'majorana', 'bound', 'states', 'without', 'invoking', 'more', 'demand', 'ing', 'nonlocal', 'measurements', 'which', 'have', 'not', 'yet', 'been', 'successfully', 'performed', 'in', 'nanowire', 'systems', 'in', 'particular', 'we', 'discuss', 'three', 'distinct', 'experimental', 'schemes', 'involving', 'response', 'of', 'the', 'zerobias', 'peak', 'to', 'local', 'perturbations', 'of', 'the', 'tunnel', 'barrier', 'overlap', 'of', 'bound', 'states', 'from', 'the', 'wire', 'ends', 'and', 'most', 'compellingly', 'introducing', 'a', 'sharp', 'localized', 'potential', 'in', 'the', 'wire', 'itself', 'to', 'perturb', 'the', 'zerobias', 'tun', 'neling', 'peaks', 'we', 'provide', 'extensive', 'numerical', 'simulations', 'clarifying', 'and', 'supporting', 'our', 'theoretical', 'predictions']]
|
[-0.21036153394379653, 0.15590651688008375, -0.09431112626646986, 0.07438125181588254, -0.033492872650485214, -0.23398320197990938, 0.12750492125278248, 0.34019496411130556, -0.2129426730701575, -0.35274028337401586, -0.03850431470825087, -0.32954032791823873, -0.14490163178805499, 0.20631697484030864, -0.017793670428701017, 0.06341152510778955, 0.05324207033348701, -0.025831554441715636, -0.058049958967319806, -0.20557005203999124, 0.33243238396528063, 0.006184360028028761, 0.3129351252985255, 0.17529088143463722, -0.0392827802144627, -0.04415788359815118, 0.07041892688153539, 0.0037256727625456887, -0.15021203846454892, 0.04510141577445277, 0.27518839942653045, -0.05684970185109528, 0.17738929314003965, -0.5144112280956129, -0.19288389237026865, 0.07433780644608239, 0.1845025628259996, 0.16413879616359225, -0.09088643397910523, -0.3554545501360624, 0.05675145579933575, -0.09626891199930958, -0.11823195298259123, -0.07365844229508828, -0.03382000053605269, -0.06287508752060736, -0.2059768766431683, 0.13384447465139646, 0.01709400951967393, 0.06202094665467285, -0.04299925908406561, -0.0989872058221741, -0.0420541133484576, 0.07158944310645982, 0.012719204697598954, -0.04185303214230438, 0.1679703363912356, -0.10894344909373592, -0.17921473735818502, 0.24480208914859006, -0.09245673671262566, -0.09078806989241346, 0.18400358561165175, -0.16507091637553148, -0.07488530436701073, 0.12232264781245826, 0.08931120560027478, 0.07038703099710912, -0.11227021880111396, 0.05124791523352231, -0.02573618387644429, 0.11062812641484482, 0.108959293570767, 0.10915139697707917, 0.28083056019528246, 0.14562334880806369, 0.09024031926656323, 0.10568777434016782, -0.13615871296355092, -0.04990347152825717, -0.2954898484096658, -0.12105669897999444, -0.21227283895061147, 0.08444126640461036, 0.011388935700890172, -0.20738630035250424, 0.44114587015881224, 0.1531402072259658, 0.2339908988584151, -0.003967857921762937, 0.26428996467474486, 0.15369308215960656, 0.070657607706735, 0.025371354996090438, 0.2079536487691235, 0.19216968731460637, 0.06695758358564047, -0.30458053215208075, 0.0715187100559422, -0.03138765326428523]
|
1,803.05424
|
Warm FIRE: Simulating Galaxy Formation with Resonant Sterile Neutrino
Dark Matter
|
We study the impact of a warm dark matter (WDM) cosmology on dwarf galaxy
formation through a suite of cosmological hydrodynamical zoom-in simulations of
$M_{\rm halo} \approx10^{10}\,M_{\odot}$ dark matter halos as part of the
Feedback in Realistic Environments (FIRE) project. A main focus of this paper
is to evaluate the combined effects of dark matter physics and stellar feedback
on the well-known small-scale issues found in cold dark matter (CDM) models. We
find that the $z=0$ stellar mass of a galaxy is strongly correlated with the
central density of its host dark matter halo at the time of formation, $z_{\rm
f}$, in both CDM and WDM models. WDM halos follow the same
$M_{\star}(z=0)-V_{\rm max}(z_{\rm f})$ relation as in CDM, but they form
later, are less centrally dense, and therefore contain galaxies that are less
massive than their CDM counterparts. As a result, the impact of baryonic
effects on the central gravitational potential is typically diminished relative
to CDM. However, the combination of delayed formation in WDM and energy input
from stellar feedback results in dark matter profiles with lower overall
densities. The WDM galaxies studied here have a wider diversity of star
formation histories (SFHs) than the same systems simulated in CDM, and the two
lowest $M_{\star}$ WDM galaxies form all of their stars at late times. The
discovery of young ultra-faint dwarf galaxies with no ancient star formation --
which do not exist in our CDM simulations -- would therefore provide evidence
in support of WDM.
|
astro-ph.GA astro-ph.CO
|
we study the impact of a warm dark matter wdm cosmology on dwarf galaxy formation through a suite of cosmological hydrodynamical zoomin simulations of m_rm halo approx1010m_odot dark matter halos as part of the feedback in realistic environments fire project a main focus of this paper is to evaluate the combined effects of dark matter physics and stellar feedback on the wellknown smallscale issues found in cold dark matter cdm models we find that the z0 stellar mass of a galaxy is strongly correlated with the central density of its host dark matter halo at the time of formation z_rm f in both cdm and wdm models wdm halos follow the same m_starz0v_rm maxz_rm f relation as in cdm but they form later are less centrally dense and therefore contain galaxies that are less massive than their cdm counterparts as a result the impact of baryonic effects on the central gravitational potential is typically diminished relative to cdm however the combination of delayed formation in wdm and energy input from stellar feedback results in dark matter profiles with lower overall densities the wdm galaxies studied here have a wider diversity of star formation histories sfhs than the same systems simulated in cdm and the two lowest m_star wdm galaxies form all of their stars at late times the discovery of young ultrafaint dwarf galaxies with no ancient star formation which do not exist in our cdm simulations would therefore provide evidence in support of wdm
|
[['we', 'study', 'the', 'impact', 'of', 'a', 'warm', 'dark', 'matter', 'wdm', 'cosmology', 'on', 'dwarf', 'galaxy', 'formation', 'through', 'a', 'suite', 'of', 'cosmological', 'hydrodynamical', 'zoomin', 'simulations', 'of', 'm_rm', 'halo', 'approx1010m_odot', 'dark', 'matter', 'halos', 'as', 'part', 'of', 'the', 'feedback', 'in', 'realistic', 'environments', 'fire', 'project', 'a', 'main', 'focus', 'of', 'this', 'paper', 'is', 'to', 'evaluate', 'the', 'combined', 'effects', 'of', 'dark', 'matter', 'physics', 'and', 'stellar', 'feedback', 'on', 'the', 'wellknown', 'smallscale', 'issues', 'found', 'in', 'cold', 'dark', 'matter', 'cdm', 'models', 'we', 'find', 'that', 'the', 'z0', 'stellar', 'mass', 'of', 'a', 'galaxy', 'is', 'strongly', 'correlated', 'with', 'the', 'central', 'density', 'of', 'its', 'host', 'dark', 'matter', 'halo', 'at', 'the', 'time', 'of', 'formation', 'z_rm', 'f', 'in', 'both', 'cdm', 'and', 'wdm', 'models', 'wdm', 'halos', 'follow', 'the', 'same', 'm_starz0v_rm', 'maxz_rm', 'f', 'relation', 'as', 'in', 'cdm', 'but', 'they', 'form', 'later', 'are', 'less', 'centrally', 'dense', 'and', 'therefore', 'contain', 'galaxies', 'that', 'are', 'less', 'massive', 'than', 'their', 'cdm', 'counterparts', 'as', 'a', 'result', 'the', 'impact', 'of', 'baryonic', 'effects', 'on', 'the', 'central', 'gravitational', 'potential', 'is', 'typically', 'diminished', 'relative', 'to', 'cdm', 'however', 'the', 'combination', 'of', 'delayed', 'formation', 'in', 'wdm', 'and', 'energy', 'input', 'from', 'stellar', 'feedback', 'results', 'in', 'dark', 'matter', 'profiles', 'with', 'lower', 'overall', 'densities', 'the', 'wdm', 'galaxies', 'studied', 'here', 'have', 'a', 'wider', 'diversity', 'of', 'star', 'formation', 'histories', 'sfhs', 'than', 'the', 'same', 'systems', 'simulated', 'in', 'cdm', 'and', 'the', 'two', 'lowest', 'm_star', 'wdm', 'galaxies', 'form', 'all', 'of', 'their', 'stars', 'at', 'late', 'times', 'the', 'discovery', 'of', 'young', 'ultrafaint', 'dwarf', 'galaxies', 'with', 'no', 'ancient', 'star', 'formation', 'which', 'do', 'not', 'exist', 'in', 'our', 'cdm', 'simulations', 'would', 'therefore', 'provide', 'evidence', 'in', 'support', 'of', 'wdm']]
|
[-0.09108708217891111, 0.1250573734806712, -0.1315176919052639, 0.15955451209086555, -0.114283845758004, -0.04638739348743265, -0.04022773473440816, 0.3657380819382254, -0.10801351699624057, -0.38091719780532907, 0.007718318151136907, -0.25342751508732597, -0.023182097291583503, 0.17116068111788404, 0.013782437752224198, -0.02417734498759416, 0.015560102912410709, -0.046265154160931514, -0.029872526068813823, -0.34632329373959114, 0.34310125620806714, 0.09363678703758065, 0.13836310435305849, -0.04984478020563352, 0.038159230338652, -0.13450241157080794, -0.1097798979117666, -0.0714802044075298, -0.19966382374930483, -0.030740241162201837, 0.21820501863325908, 0.1453614815788667, 0.2632331593916559, -0.4213909749018629, -0.2632045902173258, 0.17081466413387827, 0.2237194807197483, 0.07851665185077486, -0.16850912375981758, -0.2527294588575432, 0.09953045394764212, -0.2457350932286806, -0.09215254701812528, 0.08994619567755394, 0.011367108307255448, 0.033457729388234936, -0.18488215446695377, 0.2254882834102258, -0.011051772340338663, -0.04308500459556244, -0.08222249810331816, -0.10093374686000084, -0.07990199762246425, -0.008432442304093297, -0.017640357203050402, 0.0019883294984282666, 0.26065603238270685, -0.23190084285429782, -0.01959477049059981, 0.5077497981034589, -0.09128966900457008, -0.0337837348376547, 0.27102909183653057, -0.19585968882640659, -0.1712589480352303, 0.060355212689643875, 0.16220399603817212, 0.049173999258340144, -0.11584941164902142, 0.04889800797061695, -0.039509328708056485, 0.2424188037229748, 0.049639140348111795, 0.06873665894691983, 0.40577264811097036, 0.16050428611010867, 0.05260207933688359, -0.02331072837787811, -0.07865389616590393, -0.08915774141676909, -0.21947914395964327, -0.08395976683486653, -0.13727370733905137, 0.03227598776696644, -0.12809018076998557, -0.12218201989000124, 0.31931146251014625, 0.1247756445803487, 0.215590385398789, 0.11412320909416736, 0.3617125329838619, 0.04174628003244481, 0.07336399800465, 0.09669938976183719, 0.27807174932282835, 0.1827053019607609, 0.05934839416680134, -0.2592472137278619, -0.005953709408256017, -0.06841629268101239]
|
1,803.05425
|
Discovery of a new classical nova shell around a nova-like cataclysmic
variable
|
The morphology and optical spectrum of IPHASXJ210205+471015, a nebula
classified as a possible planetary nebula, are however strikingly similar to
those of ATCnc, a classical nova shell around a dwarf nova. To investigate its
true nature, we have obtained high-resolution narrow-band [O III] and [N II]
images and deep GTC OSIRIS optical spectra. The nebula shows an arc of [N
II]-bright knots notably enriched in nitrogen, whilst an [O III]-bright
bow-shock is progressing throughout the ISM. Diagnostic line ratios indicate
that shocks are associated with the arc and bow-shock. The central star of this
nebula has been identified by its photometric variability. Time-resolved
photometric and spectroscopic data of this source reveal a period of 4.26
hours, which is attributed to a binary system. The optical spectrum is notably
similar to that of RWSex, a cataclysmic variable star (CV) of the UXUMa
nova-like (NL) type. Based on these results, we propose that IPHASX
J210205+471015 is a classical nova shell observed around a CV-NL system in
quiescence.
|
astro-ph.SR
|
the morphology and optical spectrum of iphasxj210205471015 a nebula classified as a possible planetary nebula are however strikingly similar to those of atcnc a classical nova shell around a dwarf nova to investigate its true nature we have obtained highresolution narrowband o iii and n ii images and deep gtc osiris optical spectra the nebula shows an arc of n iibright knots notably enriched in nitrogen whilst an o iiibright bowshock is progressing throughout the ism diagnostic line ratios indicate that shocks are associated with the arc and bowshock the central star of this nebula has been identified by its photometric variability timeresolved photometric and spectroscopic data of this source reveal a period of 426 hours which is attributed to a binary system the optical spectrum is notably similar to that of rwsex a cataclysmic variable star cv of the uxuma novalike nl type based on these results we propose that iphasx j210205471015 is a classical nova shell observed around a cvnl system in quiescence
|
[['the', 'morphology', 'and', 'optical', 'spectrum', 'of', 'iphasxj210205471015', 'a', 'nebula', 'classified', 'as', 'a', 'possible', 'planetary', 'nebula', 'are', 'however', 'strikingly', 'similar', 'to', 'those', 'of', 'atcnc', 'a', 'classical', 'nova', 'shell', 'around', 'a', 'dwarf', 'nova', 'to', 'investigate', 'its', 'true', 'nature', 'we', 'have', 'obtained', 'highresolution', 'narrowband', 'o', 'iii', 'and', 'n', 'ii', 'images', 'and', 'deep', 'gtc', 'osiris', 'optical', 'spectra', 'the', 'nebula', 'shows', 'an', 'arc', 'of', 'n', 'iibright', 'knots', 'notably', 'enriched', 'in', 'nitrogen', 'whilst', 'an', 'o', 'iiibright', 'bowshock', 'is', 'progressing', 'throughout', 'the', 'ism', 'diagnostic', 'line', 'ratios', 'indicate', 'that', 'shocks', 'are', 'associated', 'with', 'the', 'arc', 'and', 'bowshock', 'the', 'central', 'star', 'of', 'this', 'nebula', 'has', 'been', 'identified', 'by', 'its', 'photometric', 'variability', 'timeresolved', 'photometric', 'and', 'spectroscopic', 'data', 'of', 'this', 'source', 'reveal', 'a', 'period', 'of', '426', 'hours', 'which', 'is', 'attributed', 'to', 'a', 'binary', 'system', 'the', 'optical', 'spectrum', 'is', 'notably', 'similar', 'to', 'that', 'of', 'rwsex', 'a', 'cataclysmic', 'variable', 'star', 'cv', 'of', 'the', 'uxuma', 'novalike', 'nl', 'type', 'based', 'on', 'these', 'results', 'we', 'propose', 'that', 'iphasx', 'j210205471015', 'is', 'a', 'classical', 'nova', 'shell', 'observed', 'around', 'a', 'cvnl', 'system', 'in', 'quiescence']]
|
[-0.08036427584121629, 0.038349370120124175, -0.08681809869771705, 0.05864755155465601, -0.08665460910312124, -0.14005866898164812, 0.049992356492100355, 0.4436970256221823, -0.18935146077412263, -0.3161658197877151, 0.08329806070998783, -0.2893328648532116, -0.0758579524139626, 0.20503212266330478, -0.0757575470422206, -0.027484119341478836, 0.1281079315253286, -0.05444257363199575, -0.027470389834555055, -0.23875569050358514, 0.26534610487615745, 0.0674079457411021, 0.12794692785762063, -0.07133499794504075, 0.04489637787610033, -0.10328689067848498, -0.057200052138289756, -0.04183999753389154, -0.0978489683732767, 0.0610804004915931, 0.2072661217682276, 0.13256102429755928, 0.17715278487723274, -0.3493032617138218, -0.24747638775130051, 0.01869199375763441, 0.2142087612927396, -0.002562130463185803, -0.03424592434408002, -0.27415542143671123, 0.07124441419433378, -0.18663741318402882, -0.17434328311134742, 0.0705002357039742, 0.09184147510456535, 0.04994750607543613, -0.20791476164484704, 0.08514467734678448, 0.04532824505026205, 0.13255124717443897, -0.1336970687814387, -0.08441088873306525, -0.06418352958133232, 0.05762656598316529, -0.015233398743026854, 0.0872210023683036, 0.11104316462444354, -0.1391592763034226, -0.04484165011893345, 0.40542705075320185, -0.06910537935416156, 0.06274500534916887, 0.23799916769560614, -0.20647443768743698, -0.17867256813208113, 0.20042275497100398, 0.10379636826441635, 0.12691477245851596, -0.1470917173177947, 0.00638461149190081, -0.06417144961725874, 0.21613575252881156, 0.014929163593893187, 0.07911926330526985, 0.28841610177997734, 0.12418857335902844, -0.03255226944582065, 0.14115776225063903, -0.2845134023872434, -0.01897151821589133, -0.21503905676706117, -0.14249524378064501, -0.13749554487611343, 0.09606685313614251, -0.08427623587119308, -0.14426579885332125, 0.3806632472131449, 0.05415973735345481, 0.21397852513031398, -0.04715781852594117, 0.2526417531226349, 0.08973731264940617, 0.07752888619686445, 0.09846585544851856, 0.30860805626821564, 0.16613376442979597, 0.15095955368921254, -0.2527910130469812, 0.09752938515636363, 0.02069132862453455]
|
1,803.05426
|
Memory-efficient tracking of complex temporal and symbolic dynamics with
quantum simulators
|
Tracking the behaviour of stochastic systems is a crucial task in the
statistical sciences. It has recently been shown that quantum models can
faithfully simulate such processes whilst retaining less information about the
past behaviour of the system than the optimal classical models. We extend these
results to general temporal and symbolic dynamics. Our systematic protocol for
quantum model construction relies only on an elementary description of the
dynamics of the process. This circumvents restrictions on corresponding
classical construction protocols, and allows for a broader range of processes
to be modelled efficiently. We illustrate our method with an example exhibiting
an apparent unbounded memory advantage of the quantum model compared to its
optimal classical counterpart.
|
quant-ph cond-mat.stat-mech
|
tracking the behaviour of stochastic systems is a crucial task in the statistical sciences it has recently been shown that quantum models can faithfully simulate such processes whilst retaining less information about the past behaviour of the system than the optimal classical models we extend these results to general temporal and symbolic dynamics our systematic protocol for quantum model construction relies only on an elementary description of the dynamics of the process this circumvents restrictions on corresponding classical construction protocols and allows for a broader range of processes to be modelled efficiently we illustrate our method with an example exhibiting an apparent unbounded memory advantage of the quantum model compared to its optimal classical counterpart
|
[['tracking', 'the', 'behaviour', 'of', 'stochastic', 'systems', 'is', 'a', 'crucial', 'task', 'in', 'the', 'statistical', 'sciences', 'it', 'has', 'recently', 'been', 'shown', 'that', 'quantum', 'models', 'can', 'faithfully', 'simulate', 'such', 'processes', 'whilst', 'retaining', 'less', 'information', 'about', 'the', 'past', 'behaviour', 'of', 'the', 'system', 'than', 'the', 'optimal', 'classical', 'models', 'we', 'extend', 'these', 'results', 'to', 'general', 'temporal', 'and', 'symbolic', 'dynamics', 'our', 'systematic', 'protocol', 'for', 'quantum', 'model', 'construction', 'relies', 'only', 'on', 'an', 'elementary', 'description', 'of', 'the', 'dynamics', 'of', 'the', 'process', 'this', 'circumvents', 'restrictions', 'on', 'corresponding', 'classical', 'construction', 'protocols', 'and', 'allows', 'for', 'a', 'broader', 'range', 'of', 'processes', 'to', 'be', 'modelled', 'efficiently', 'we', 'illustrate', 'our', 'method', 'with', 'an', 'example', 'exhibiting', 'an', 'apparent', 'unbounded', 'memory', 'advantage', 'of', 'the', 'quantum', 'model', 'compared', 'to', 'its', 'optimal', 'classical', 'counterpart']]
|
[-0.06786971019236776, 0.05490949859921112, -0.12831022451105326, 0.08477172156166014, -0.06886933477919387, -0.14063281402720706, 0.020884511767603132, 0.3647136197141979, -0.28502853715022947, -0.313877929487954, 0.10031115903681063, -0.2283467807707063, -0.1719215057795341, 0.2749244471890447, -0.09762365211449239, 0.10475873476167655, 0.06084347603356709, 0.04182114155517648, -0.04391635198186597, -0.2288042819734825, 0.2665209878721963, 0.10078252453012797, 0.2842418211087099, 0.010736172204918187, 0.13425752668762986, 0.025226873955081986, -0.032587666133337696, -0.014351922978201637, -0.10632278725091095, 0.1253318469485511, 0.21571059836835205, 0.13047799367012214, 0.2764956758155123, -0.43240251988779915, -0.27627985558508006, 0.11764233630636464, 0.135065945363148, 0.16854884703846082, 0.005494345382422857, -0.2917756270131339, 0.07209837098160515, -0.1762545461118545, -0.1256965261357634, -0.11555770729546962, 0.0064749063539278244, -0.013005765567979086, -0.2320438953465782, 0.04080617948151801, 0.12949202105240978, 0.050950556944893755, -0.037632859054365725, -0.06528687936091876, 0.02764743432888518, 0.13611267139608768, -0.010326553780190728, -0.03117365294702999, 0.11872682936651552, -0.12362185482381155, -0.18563860721238282, 0.3813725008669755, -0.017234651613398454, -0.20210424914308217, 0.2295158443952222, -0.1029855402753405, -0.12777174801930138, 0.10675270330646763, 0.1667679307334449, 0.1431572538436107, -0.16175056187355, 0.10681252409400338, -0.017932855949291716, 0.20167102584635596, -0.014890660847658697, 0.06676821418197663, 0.1645862817602313, 0.20421910337779833, 0.04722506131005028, 0.1446302661034481, -0.017368379733322756, -0.23481576488879713, -0.2682647549709224, -0.15357593398429858, -0.15147558275822792, 0.04883635088234492, -0.09402264979359208, -0.14004787085577847, 0.3785369896370432, 0.203984854632037, 0.16091369682032128, 0.05971008017051803, 0.30032534414659373, 0.13633676702764047, 0.053224380002559524, 0.06839302658943622, 0.19831925670656822, 0.12601644560370756, 0.09429970531036025, -0.2084352214091822, 0.10405856387932663, 0.03373705790702092]
|
1,803.05427
|
Speaker Verification using Convolutional Neural Networks
|
In this paper, a novel Convolutional Neural Network architecture has been
developed for speaker verification in order to simultaneously capture and
discard speaker and non-speaker information, respectively. In training phase,
the network is trained to distinguish between different speaker identities for
creating the background model. One of the crucial parts is to create the
speaker models. Most of the previous approaches create speaker models based on
averaging the speaker representations provided by the background model. We
overturn this problem by further fine-tuning the trained model using the
Siamese framework for generating a discriminative feature space to distinguish
between same and different speakers regardless of their identity. This provides
a mechanism which simultaneously captures the speaker-related information and
create robustness to within-speaker variations. It is demonstrated that the
proposed method outperforms the traditional verification methods which create
speaker models directly from the background model.
|
eess.AS cs.SD
|
in this paper a novel convolutional neural network architecture has been developed for speaker verification in order to simultaneously capture and discard speaker and nonspeaker information respectively in training phase the network is trained to distinguish between different speaker identities for creating the background model one of the crucial parts is to create the speaker models most of the previous approaches create speaker models based on averaging the speaker representations provided by the background model we overturn this problem by further finetuning the trained model using the siamese framework for generating a discriminative feature space to distinguish between same and different speakers regardless of their identity this provides a mechanism which simultaneously captures the speakerrelated information and create robustness to withinspeaker variations it is demonstrated that the proposed method outperforms the traditional verification methods which create speaker models directly from the background model
|
[['in', 'this', 'paper', 'a', 'novel', 'convolutional', 'neural', 'network', 'architecture', 'has', 'been', 'developed', 'for', 'speaker', 'verification', 'in', 'order', 'to', 'simultaneously', 'capture', 'and', 'discard', 'speaker', 'and', 'nonspeaker', 'information', 'respectively', 'in', 'training', 'phase', 'the', 'network', 'is', 'trained', 'to', 'distinguish', 'between', 'different', 'speaker', 'identities', 'for', 'creating', 'the', 'background', 'model', 'one', 'of', 'the', 'crucial', 'parts', 'is', 'to', 'create', 'the', 'speaker', 'models', 'most', 'of', 'the', 'previous', 'approaches', 'create', 'speaker', 'models', 'based', 'on', 'averaging', 'the', 'speaker', 'representations', 'provided', 'by', 'the', 'background', 'model', 'we', 'overturn', 'this', 'problem', 'by', 'further', 'finetuning', 'the', 'trained', 'model', 'using', 'the', 'siamese', 'framework', 'for', 'generating', 'a', 'discriminative', 'feature', 'space', 'to', 'distinguish', 'between', 'same', 'and', 'different', 'speakers', 'regardless', 'of', 'their', 'identity', 'this', 'provides', 'a', 'mechanism', 'which', 'simultaneously', 'captures', 'the', 'speakerrelated', 'information', 'and', 'create', 'robustness', 'to', 'withinspeaker', 'variations', 'it', 'is', 'demonstrated', 'that', 'the', 'proposed', 'method', 'outperforms', 'the', 'traditional', 'verification', 'methods', 'which', 'create', 'speaker', 'models', 'directly', 'from', 'the', 'background', 'model']]
|
[-0.01982025973971041, -0.003128885639123094, -0.10398563278124104, 0.0617949462062876, -0.10682264527856884, -0.23400042414940683, -0.006558333043973158, 0.403079240891138, -0.2723869232331324, -0.3309678110543271, 0.015260184528863609, -0.25766592995512866, -0.1772557547788175, 0.15970219716324774, -0.11275915974016551, 0.0682285739425373, 0.07028250677288103, 0.044970254164556384, -0.04268281655976365, -0.2764937588354756, 0.3266553174914189, 0.050073384991469856, 0.3822966206189192, -0.005125503306618144, 0.1664809445968606, -0.048677208020128836, -0.054576591541826674, -0.07491571780373703, -0.009299569510992922, 0.17482295156125321, 0.304220160635197, 0.20886602883496072, 0.273271109277553, -0.399631266187037, -0.2543891388840947, 0.11457641674271248, 0.11500751904316876, 0.14144892117474228, -0.00970892928307876, -0.3889938768747092, 0.10698207728827083, -0.17777183910661284, 0.02094548883598665, -0.1237988736378816, -0.03465877054587112, -0.05470836261356197, -0.2993701548077015, 0.046251160092651844, 0.1327835263825402, 0.04078258496617347, -0.06628297428718545, -0.06295702144713469, -0.004518273981734061, 0.1948699032441831, 0.0580105948029086, 0.05332311117713353, 0.09663702285533744, -0.16549210456481964, -0.11647528449965405, 0.34517814124553975, -0.06460421500173331, -0.2602372397340729, 0.20196786993937435, 0.005233684253000038, -0.1304344231079162, 0.058339165180960904, 0.22669879018499609, 0.09616311507719294, -0.20902000553905964, -0.030667200245120575, -0.022077959043983842, 0.2403377375695002, 0.053833823008331616, -0.017098076330025642, 0.22070065411102865, 0.23634679761098723, -0.02090267891811968, 0.15492725148337932, -0.15405348511773465, -0.043972400600798954, -0.21069562764392352, -0.0818314189816871, -0.17466619890019244, -0.08013424754444458, -0.0787496776971802, -0.1300560149715059, 0.4553845097658447, 0.27010786054577207, 0.19685461992909475, 0.10257858065658734, 0.34719768156048275, 0.03621704036920843, 0.13701173768568994, 0.06776409944794862, 0.21228470569017382, 0.03332491181987587, 0.11261635721402086, -0.17286807963867265, 0.1402638612501979, 0.08156356114638366]
|
1,803.05428
|
A Hierarchical Latent Vector Model for Learning Long-Term Structure in
Music
|
The Variational Autoencoder (VAE) has proven to be an effective model for
producing semantically meaningful latent representations for natural data.
However, it has thus far seen limited application to sequential data, and, as
we demonstrate, existing recurrent VAE models have difficulty modeling
sequences with long-term structure. To address this issue, we propose the use
of a hierarchical decoder, which first outputs embeddings for subsequences of
the input and then uses these embeddings to generate each subsequence
independently. This structure encourages the model to utilize its latent code,
thereby avoiding the "posterior collapse" problem, which remains an issue for
recurrent VAEs. We apply this architecture to modeling sequences of musical
notes and find that it exhibits dramatically better sampling, interpolation,
and reconstruction performance than a "flat" baseline model. An implementation
of our "MusicVAE" is available online at http://g.co/magenta/musicvae-code.
|
cs.LG cs.SD eess.AS stat.ML
|
the variational autoencoder vae has proven to be an effective model for producing semantically meaningful latent representations for natural data however it has thus far seen limited application to sequential data and as we demonstrate existing recurrent vae models have difficulty modeling sequences with longterm structure to address this issue we propose the use of a hierarchical decoder which first outputs embeddings for subsequences of the input and then uses these embeddings to generate each subsequence independently this structure encourages the model to utilize its latent code thereby avoiding the posterior collapse problem which remains an issue for recurrent vaes we apply this architecture to modeling sequences of musical notes and find that it exhibits dramatically better sampling interpolation and reconstruction performance than a flat baseline model an implementation of our musicvae is available online at httpgcomagentamusicvaecode
|
[['the', 'variational', 'autoencoder', 'vae', 'has', 'proven', 'to', 'be', 'an', 'effective', 'model', 'for', 'producing', 'semantically', 'meaningful', 'latent', 'representations', 'for', 'natural', 'data', 'however', 'it', 'has', 'thus', 'far', 'seen', 'limited', 'application', 'to', 'sequential', 'data', 'and', 'as', 'we', 'demonstrate', 'existing', 'recurrent', 'vae', 'models', 'have', 'difficulty', 'modeling', 'sequences', 'with', 'longterm', 'structure', 'to', 'address', 'this', 'issue', 'we', 'propose', 'the', 'use', 'of', 'a', 'hierarchical', 'decoder', 'which', 'first', 'outputs', 'embeddings', 'for', 'subsequences', 'of', 'the', 'input', 'and', 'then', 'uses', 'these', 'embeddings', 'to', 'generate', 'each', 'subsequence', 'independently', 'this', 'structure', 'encourages', 'the', 'model', 'to', 'utilize', 'its', 'latent', 'code', 'thereby', 'avoiding', 'the', 'posterior', 'collapse', 'problem', 'which', 'remains', 'an', 'issue', 'for', 'recurrent', 'vaes', 'we', 'apply', 'this', 'architecture', 'to', 'modeling', 'sequences', 'of', 'musical', 'notes', 'and', 'find', 'that', 'it', 'exhibits', 'dramatically', 'better', 'sampling', 'interpolation', 'and', 'reconstruction', 'performance', 'than', 'a', 'flat', 'baseline', 'model', 'an', 'implementation', 'of', 'our', 'musicvae', 'is', 'available', 'online', 'at', 'httpgcomagentamusicvaecode']]
|
[-0.014603472790708217, 0.015863121459273422, -0.09355687969432705, 0.13062988468343117, -0.1397264660746955, -0.1703557459404692, 0.04170079414239701, 0.47641348877154727, -0.3503019310506609, -0.31992564392738343, 0.07686829527066198, -0.2573680886442376, -0.17534671203397653, 0.15351697679793955, -0.12957245079280041, 0.08353345560017796, 0.13730702102282735, 0.029334433434996754, -0.06902595576984287, -0.27013061885458334, 0.29417393748436177, 0.1016812430393389, 0.325304133908289, -0.04120587933849653, 0.15895554649828494, -0.02676738744177034, -0.020279386779293418, -0.07559272142209332, -0.07661125226904379, 0.19023219700337743, 0.29050164560305136, 0.2173290304011008, 0.31807057152207774, -0.40395145483232814, -0.27727797342231497, 0.09378707397605895, 0.15902265671277693, 0.138865399727365, -0.029857137011062792, -0.2947755415156922, 0.10205575077698621, -0.16558622758791042, -0.0050232069060096845, -0.1680036067195675, -0.02499627331545686, -0.04993687421023531, -0.3059841946686741, 0.025210177220073734, 0.11186845210142886, 0.018229477791464888, -0.05411303151991246, -0.09531273381264113, 0.0243355100212605, 0.1572081691599177, 0.06740960639281719, 0.09681599991231718, 0.03522941723178305, -0.13066072598303435, -0.11569914388254642, 0.3395886411068632, -0.03768100358619824, -0.2339911101906396, 0.18232939086224445, -0.01769579086206196, -0.1783695799189017, 0.09191549969974029, 0.18564997662778135, 0.09468275633148818, -0.16524910068512647, 0.019728241267490804, -0.0556787644579933, 0.20682951631469598, 0.041588922276038345, 0.019141036667861044, 0.18878100066349895, 0.24978807696606964, 0.03676895688712487, 0.1656245939854724, -0.10889643884729594, -0.06731503447243835, -0.19061961965053342, -0.10701436213489882, -0.17929950850392581, -0.01500973167575841, -0.09008007152442588, -0.21156904415350736, 0.40774808252257677, 0.2463454433805857, 0.2296784134266679, 0.14620472053374053, 0.31632383052697954, 0.05219547930242056, 0.09237748276791535, 0.11442229997791241, 0.13083555439644604, 0.05779186507467838, 0.08083411839598899, -0.1222556034763864, 0.11000031201162047, 0.062222829612437636]
|
1,803.05429
|
A system-wide network reconstruction of gene regulation and metabolism
in Escherichia coli
|
Genome-scale metabolic models have become a fundamental tool for examining
metabolic principles. However, metabolism is not solely characterized by the
underlying biochemical reactions and catalyzing enzymes, but also affected by
regulatory events. Since the pioneering work of Covert and co-workers as well
as Shlomi and co-workers it is debated, how regulation and metabolism
synergistically characterize a coherent cellular state. The first approaches
started from metabolic models which were extended by the regulation of the
encoding genes of the catalyzing enzymes. By now, bioinformatics databases in
principle allow addressing the challenge of integrating regulation and
metabolism on a system-wide level. Collecting information from several
databases we provide a network representation of the integrated gene regulatory
and metabolic system for Escherichia coli, including major cellular processes,
from metabolic processes via protein modification to a variety of regulatory
events. Besides transcriptional regulation, we also take into account
regulation of translation, enzyme activities and reactions. Our network model
provides novel topological characterizations of system components based on
their positions in the network. We show that network characteristics suggest a
representation of the integrated system as three network domains (regulatory,
metabolic and interface networks) instead of two. This new three-domain
representation reveals the structural centrality of components with known high
functional relevance. This integrated network can serve as a platform for
understanding coherent cellular states as active subnetworks and to elucidate
crossover effects between metabolism and gene regulation.
|
q-bio.MN
|
genomescale metabolic models have become a fundamental tool for examining metabolic principles however metabolism is not solely characterized by the underlying biochemical reactions and catalyzing enzymes but also affected by regulatory events since the pioneering work of covert and coworkers as well as shlomi and coworkers it is debated how regulation and metabolism synergistically characterize a coherent cellular state the first approaches started from metabolic models which were extended by the regulation of the encoding genes of the catalyzing enzymes by now bioinformatics databases in principle allow addressing the challenge of integrating regulation and metabolism on a systemwide level collecting information from several databases we provide a network representation of the integrated gene regulatory and metabolic system for escherichia coli including major cellular processes from metabolic processes via protein modification to a variety of regulatory events besides transcriptional regulation we also take into account regulation of translation enzyme activities and reactions our network model provides novel topological characterizations of system components based on their positions in the network we show that network characteristics suggest a representation of the integrated system as three network domains regulatory metabolic and interface networks instead of two this new threedomain representation reveals the structural centrality of components with known high functional relevance this integrated network can serve as a platform for understanding coherent cellular states as active subnetworks and to elucidate crossover effects between metabolism and gene regulation
|
[['genomescale', 'metabolic', 'models', 'have', 'become', 'a', 'fundamental', 'tool', 'for', 'examining', 'metabolic', 'principles', 'however', 'metabolism', 'is', 'not', 'solely', 'characterized', 'by', 'the', 'underlying', 'biochemical', 'reactions', 'and', 'catalyzing', 'enzymes', 'but', 'also', 'affected', 'by', 'regulatory', 'events', 'since', 'the', 'pioneering', 'work', 'of', 'covert', 'and', 'coworkers', 'as', 'well', 'as', 'shlomi', 'and', 'coworkers', 'it', 'is', 'debated', 'how', 'regulation', 'and', 'metabolism', 'synergistically', 'characterize', 'a', 'coherent', 'cellular', 'state', 'the', 'first', 'approaches', 'started', 'from', 'metabolic', 'models', 'which', 'were', 'extended', 'by', 'the', 'regulation', 'of', 'the', 'encoding', 'genes', 'of', 'the', 'catalyzing', 'enzymes', 'by', 'now', 'bioinformatics', 'databases', 'in', 'principle', 'allow', 'addressing', 'the', 'challenge', 'of', 'integrating', 'regulation', 'and', 'metabolism', 'on', 'a', 'systemwide', 'level', 'collecting', 'information', 'from', 'several', 'databases', 'we', 'provide', 'a', 'network', 'representation', 'of', 'the', 'integrated', 'gene', 'regulatory', 'and', 'metabolic', 'system', 'for', 'escherichia', 'coli', 'including', 'major', 'cellular', 'processes', 'from', 'metabolic', 'processes', 'via', 'protein', 'modification', 'to', 'a', 'variety', 'of', 'regulatory', 'events', 'besides', 'transcriptional', 'regulation', 'we', 'also', 'take', 'into', 'account', 'regulation', 'of', 'translation', 'enzyme', 'activities', 'and', 'reactions', 'our', 'network', 'model', 'provides', 'novel', 'topological', 'characterizations', 'of', 'system', 'components', 'based', 'on', 'their', 'positions', 'in', 'the', 'network', 'we', 'show', 'that', 'network', 'characteristics', 'suggest', 'a', 'representation', 'of', 'the', 'integrated', 'system', 'as', 'three', 'network', 'domains', 'regulatory', 'metabolic', 'and', 'interface', 'networks', 'instead', 'of', 'two', 'this', 'new', 'threedomain', 'representation', 'reveals', 'the', 'structural', 'centrality', 'of', 'components', 'with', 'known', 'high', 'functional', 'relevance', 'this', 'integrated', 'network', 'can', 'serve', 'as', 'a', 'platform', 'for', 'understanding', 'coherent', 'cellular', 'states', 'as', 'active', 'subnetworks', 'and', 'to', 'elucidate', 'crossover', 'effects', 'between', 'metabolism', 'and', 'gene', 'regulation']]
|
[-0.09250752900020573, 0.08194373546023692, -0.014194398319573495, 0.09278304017538301, -0.03240333330127057, -0.149002047964163, 0.1002983353612543, 0.3519792110530724, -0.2736728466978971, -0.27336429487030695, 0.04140379614545964, -0.2353428188412338, -0.2992460463629586, 0.1946487316715226, -0.04967458875988337, 0.02791742314905699, 0.08653224718652601, -0.013977304677923555, 0.12135474992803587, -0.14374582718000026, 0.28431695136482477, 0.10212962369129447, 0.33451614767345117, 0.06955475623494592, 0.13447796233632633, -0.06011503472109325, -0.0476332936902101, -0.028945090798139252, -0.0965143172232525, 0.20414966037562157, 0.3424595703951001, 0.2279081496988134, 0.28183835136286656, -0.5141800313481483, -0.29344721025173104, 0.10679711803747742, 0.14799116347170765, 0.12210281919196232, -0.009877032183857378, -0.2725180731725012, 0.05961853655527852, -0.19024571899228312, -0.02037450861073388, -0.12637958308312527, 0.029785729476033935, 0.05455552937527155, -0.22511877116530427, 0.08223882428200309, 0.031391279068414185, 0.13169263941155554, -0.11273198836916608, -0.12162350795827886, -0.09924856592812736, 0.23607003797801082, 0.033903760661407184, -0.01779080699195439, 0.2645844445194535, -0.13594502746027187, -0.1696871186482142, 0.3266872491964524, 0.03226386353921482, -0.19221981853680237, 0.2151559143505814, -0.04622379116862531, -0.2095956326269641, 0.08335277276788035, 0.19836948809900384, 0.03848888118578731, -0.26754152995799185, 0.015255004473146982, 0.044063506556618635, 0.17450043034001156, 0.07052124322066887, 0.032005494215589916, 0.18465153671247114, 0.274649190248777, 0.029870787954019637, 0.1153780236290286, -0.04886530064385593, -0.10766559686303011, -0.19968967915052604, -0.1267555461175828, -0.11648339806786931, 0.07869351216586123, -0.06193369341317207, -0.13217829546393378, 0.42563700966199797, 0.06674160677031413, 0.17603801532526758, 0.05547803204059039, 0.24251427538723058, 0.009583460788392052, 0.11903069780011469, 0.004069283331648029, 0.15505012497054976, 0.11390846552315233, 0.13888454345102091, -0.24414540590328998, 0.1820165457661617, 0.020230764105659108]
|
1,803.0543
|
The use of the Rietveld method and pairs distribution function analysis
to study the pressure dependence of the trigonal SnSe2 and SnS2 structure
|
A nanostructured trigonal SnSe2 was produced by mechanical alloying, and the
effect of high-pressures up to 25.8 GPa on it was investigated. The literature
reports refined structural data for SnS2 for pressures up to 20 GPa. These data
were used as input data in a crystallographic software to calculate the shell
structures around the Sn, Se, and S atoms placed at the origin. The shell
structures were used to simulate the partial and total structure factors Sij(K)
and S(K), and by Fourier transformation the partial and total pairs
distribution functions Gij(R) and G(R) were obtained. The effect of
high-pressure on the SnSe2 and SnS2 structures were followed by observing the
changes in the Gij(R) functions. Also, the effect of high-pressure on the
smallest angle Sn-X (X=Se,S)-Sn, intralayer distance Sn-X (X=Se,S), and
interlayers distance X-X (X=Se,S) was studied. The interlayers distance X-X
(X=Se,S) changes faster than the intralayer distance Sn-X (X=Se,S). An
enhancement of the average power factor at 20 GPa and 800 K for SnS2 was
reported. Using the interlayers distance S-S and intralayer distance Sn-S, it
was evidenced that the enhancement of average power factor may be associated
with the changes of the interlayers distance S-S that is faster than that of
the intralayer distance Sn-S.
|
cond-mat.mtrl-sci
|
a nanostructured trigonal snse2 was produced by mechanical alloying and the effect of highpressures up to 258 gpa on it was investigated the literature reports refined structural data for sns2 for pressures up to 20 gpa these data were used as input data in a crystallographic software to calculate the shell structures around the sn se and s atoms placed at the origin the shell structures were used to simulate the partial and total structure factors sijk and sk and by fourier transformation the partial and total pairs distribution functions gijr and gr were obtained the effect of highpressure on the snse2 and sns2 structures were followed by observing the changes in the gijr functions also the effect of highpressure on the smallest angle snx xsessn intralayer distance snx xses and interlayers distance xx xses was studied the interlayers distance xx xses changes faster than the intralayer distance snx xses an enhancement of the average power factor at 20 gpa and 800 k for sns2 was reported using the interlayers distance ss and intralayer distance sns it was evidenced that the enhancement of average power factor may be associated with the changes of the interlayers distance ss that is faster than that of the intralayer distance sns
|
[['a', 'nanostructured', 'trigonal', 'snse2', 'was', 'produced', 'by', 'mechanical', 'alloying', 'and', 'the', 'effect', 'of', 'highpressures', 'up', 'to', '258', 'gpa', 'on', 'it', 'was', 'investigated', 'the', 'literature', 'reports', 'refined', 'structural', 'data', 'for', 'sns2', 'for', 'pressures', 'up', 'to', '20', 'gpa', 'these', 'data', 'were', 'used', 'as', 'input', 'data', 'in', 'a', 'crystallographic', 'software', 'to', 'calculate', 'the', 'shell', 'structures', 'around', 'the', 'sn', 'se', 'and', 's', 'atoms', 'placed', 'at', 'the', 'origin', 'the', 'shell', 'structures', 'were', 'used', 'to', 'simulate', 'the', 'partial', 'and', 'total', 'structure', 'factors', 'sijk', 'and', 'sk', 'and', 'by', 'fourier', 'transformation', 'the', 'partial', 'and', 'total', 'pairs', 'distribution', 'functions', 'gijr', 'and', 'gr', 'were', 'obtained', 'the', 'effect', 'of', 'highpressure', 'on', 'the', 'snse2', 'and', 'sns2', 'structures', 'were', 'followed', 'by', 'observing', 'the', 'changes', 'in', 'the', 'gijr', 'functions', 'also', 'the', 'effect', 'of', 'highpressure', 'on', 'the', 'smallest', 'angle', 'snx', 'xsessn', 'intralayer', 'distance', 'snx', 'xses', 'and', 'interlayers', 'distance', 'xx', 'xses', 'was', 'studied', 'the', 'interlayers', 'distance', 'xx', 'xses', 'changes', 'faster', 'than', 'the', 'intralayer', 'distance', 'snx', 'xses', 'an', 'enhancement', 'of', 'the', 'average', 'power', 'factor', 'at', '20', 'gpa', 'and', '800', 'k', 'for', 'sns2', 'was', 'reported', 'using', 'the', 'interlayers', 'distance', 'ss', 'and', 'intralayer', 'distance', 'sns', 'it', 'was', 'evidenced', 'that', 'the', 'enhancement', 'of', 'average', 'power', 'factor', 'may', 'be', 'associated', 'with', 'the', 'changes', 'of', 'the', 'interlayers', 'distance', 'ss', 'that', 'is', 'faster', 'than', 'that', 'of', 'the', 'intralayer', 'distance', 'sns']]
|
[-0.12369918737486743, 0.1286714530238302, -0.036137498813764296, 0.034686021400168354, -0.014781896465245893, -0.12043828496220751, 0.09121759347778995, 0.4289020873550879, -0.28754875522641704, -0.33212152123451233, 0.03847407007308695, -0.35892639851594105, -0.08919684097313756, 0.16895308014982852, 0.06540228082051519, 0.010322453929595465, -0.006358618156449629, -0.0041006018135622884, -0.13995778971088885, -0.24402154166836956, 0.25516559786190934, 0.11242881956703887, 0.30435565203465154, 0.0600781049625487, 0.04299993274645825, -0.01046563613938518, 0.050428364105467305, 0.03325798223313811, -0.16222810395946466, 0.07442806322498006, 0.18532224185188476, -0.005731209686099745, 0.15518810755992768, -0.4013456608869578, -0.1935658349268286, 0.006690239815022981, 0.06981138688959365, 0.045822518485791906, 0.010283599083777517, -0.2741599993614277, 0.11897520267515269, -0.12831146982014363, -0.08734582086315028, 0.0059729581329934665, 0.06924993254931293, 0.01277511460374635, -0.21856349748980006, 0.11151268493402781, 0.015588224230686867, 0.10744873339559256, -0.06409987911932391, -0.20048977858052672, -0.06727103115575812, 0.07524082246513134, 0.027249592244578985, 0.10141220358477002, 0.16367766204391523, -0.045077004739645835, -0.07168456386500453, 0.3720038772035058, -0.045822934859166026, -0.04167994818567197, 0.15732047146204675, -0.1374125685427559, -0.020160741209614984, 0.1717882582521306, 0.12396375343231207, 0.08584908015869262, -0.1446813264170703, 0.03602212662076679, 0.03896743527240129, 0.19355524281307243, 0.14422164921127814, 0.0064132199784058454, 0.11902040393681883, 0.13720528930592774, 0.005657909036899852, 0.1480410037865392, -0.160185487331456, -0.012243062875574768, -0.17276144485533385, -0.17047047132792154, -0.15874103540416326, 0.06480358077713408, -0.11390202143524905, -0.11057844639313177, 0.35479803184176434, 0.047394452741632405, 0.18820294047853364, -0.030886353763502718, 0.1925839289145701, 0.05471926807174644, 0.12809685689955028, 0.06432693019868935, 0.28062732835844306, 0.16375661863931593, 0.09053712358495386, -0.254339078747861, 0.12278607047490296, 0.011153842470064611]
|
1,803.05431
|
An application of cascaded 3D fully convolutional networks for medical
image segmentation
|
Recent advances in 3D fully convolutional networks (FCN) have made it
feasible to produce dense voxel-wise predictions of volumetric images. In this
work, we show that a multi-class 3D FCN trained on manually labeled CT scans of
several anatomical structures (ranging from the large organs to thin vessels)
can achieve competitive segmentation results, while avoiding the need for
handcrafting features or training class-specific models.
To this end, we propose a two-stage, coarse-to-fine approach that will first
use a 3D FCN to roughly define a candidate region, which will then be used as
input to a second 3D FCN. This reduces the number of voxels the second FCN has
to classify to ~10% and allows it to focus on more detailed segmentation of the
organs and vessels.
We utilize training and validation sets consisting of 331 clinical CT images
and test our models on a completely unseen data collection acquired at a
different hospital that includes 150 CT scans, targeting three anatomical
organs (liver, spleen, and pancreas). In challenging organs such as the
pancreas, our cascaded approach improves the mean Dice score from 68.5 to
82.2%, achieving the highest reported average score on this dataset. We compare
with a 2D FCN method on a separate dataset of 240 CT scans with 18 classes and
achieve a significantly higher performance in small organs and vessels.
Furthermore, we explore fine-tuning our models to different datasets.
Our experiments illustrate the promise and robustness of current 3D FCN based
semantic segmentation of medical images, achieving state-of-the-art results.
Our code and trained models are available for download:
https://github.com/holgerroth/3Dunet_abdomen_cascade.
|
cs.CV
|
recent advances in 3d fully convolutional networks fcn have made it feasible to produce dense voxelwise predictions of volumetric images in this work we show that a multiclass 3d fcn trained on manually labeled ct scans of several anatomical structures ranging from the large organs to thin vessels can achieve competitive segmentation results while avoiding the need for handcrafting features or training classspecific models to this end we propose a twostage coarsetofine approach that will first use a 3d fcn to roughly define a candidate region which will then be used as input to a second 3d fcn this reduces the number of voxels the second fcn has to classify to 10 and allows it to focus on more detailed segmentation of the organs and vessels we utilize training and validation sets consisting of 331 clinical ct images and test our models on a completely unseen data collection acquired at a different hospital that includes 150 ct scans targeting three anatomical organs liver spleen and pancreas in challenging organs such as the pancreas our cascaded approach improves the mean dice score from 685 to 822 achieving the highest reported average score on this dataset we compare with a 2d fcn method on a separate dataset of 240 ct scans with 18 classes and achieve a significantly higher performance in small organs and vessels furthermore we explore finetuning our models to different datasets our experiments illustrate the promise and robustness of current 3d fcn based semantic segmentation of medical images achieving stateoftheart results our code and trained models are available for download httpsgithubcomholgerroth3dunet_abdomen_cascade
|
[['recent', 'advances', 'in', '3d', 'fully', 'convolutional', 'networks', 'fcn', 'have', 'made', 'it', 'feasible', 'to', 'produce', 'dense', 'voxelwise', 'predictions', 'of', 'volumetric', 'images', 'in', 'this', 'work', 'we', 'show', 'that', 'a', 'multiclass', '3d', 'fcn', 'trained', 'on', 'manually', 'labeled', 'ct', 'scans', 'of', 'several', 'anatomical', 'structures', 'ranging', 'from', 'the', 'large', 'organs', 'to', 'thin', 'vessels', 'can', 'achieve', 'competitive', 'segmentation', 'results', 'while', 'avoiding', 'the', 'need', 'for', 'handcrafting', 'features', 'or', 'training', 'classspecific', 'models', 'to', 'this', 'end', 'we', 'propose', 'a', 'twostage', 'coarsetofine', 'approach', 'that', 'will', 'first', 'use', 'a', '3d', 'fcn', 'to', 'roughly', 'define', 'a', 'candidate', 'region', 'which', 'will', 'then', 'be', 'used', 'as', 'input', 'to', 'a', 'second', '3d', 'fcn', 'this', 'reduces', 'the', 'number', 'of', 'voxels', 'the', 'second', 'fcn', 'has', 'to', 'classify', 'to', '10', 'and', 'allows', 'it', 'to', 'focus', 'on', 'more', 'detailed', 'segmentation', 'of', 'the', 'organs', 'and', 'vessels', 'we', 'utilize', 'training', 'and', 'validation', 'sets', 'consisting', 'of', '331', 'clinical', 'ct', 'images', 'and', 'test', 'our', 'models', 'on', 'a', 'completely', 'unseen', 'data', 'collection', 'acquired', 'at', 'a', 'different', 'hospital', 'that', 'includes', '150', 'ct', 'scans', 'targeting', 'three', 'anatomical', 'organs', 'liver', 'spleen', 'and', 'pancreas', 'in', 'challenging', 'organs', 'such', 'as', 'the', 'pancreas', 'our', 'cascaded', 'approach', 'improves', 'the', 'mean', 'dice', 'score', 'from', '685', 'to', '822', 'achieving', 'the', 'highest', 'reported', 'average', 'score', 'on', 'this', 'dataset', 'we', 'compare', 'with', 'a', '2d', 'fcn', 'method', 'on', 'a', 'separate', 'dataset', 'of', '240', 'ct', 'scans', 'with', '18', 'classes', 'and', 'achieve', 'a', 'significantly', 'higher', 'performance', 'in', 'small', 'organs', 'and', 'vessels', 'furthermore', 'we', 'explore', 'finetuning', 'our', 'models', 'to', 'different', 'datasets', 'our', 'experiments', 'illustrate', 'the', 'promise', 'and', 'robustness', 'of', 'current', '3d', 'fcn', 'based', 'semantic', 'segmentation', 'of', 'medical', 'images', 'achieving', 'stateoftheart', 'results', 'our', 'code', 'and', 'trained', 'models', 'are', 'available', 'for', 'download', 'httpsgithubcomholgerroth3dunet_abdomen_cascade']]
|
[0.028355293320688167, -0.007715210343543368, -0.0040791457005102056, 0.035161137743228585, -0.06570923847228403, -0.1612179462772962, 0.029490428013277465, 0.4595768274792909, -0.19323089363238993, -0.35459773136673933, 0.07967505379315908, -0.29654651930850306, -0.1508190832930435, 0.1970324432200813, -0.17176628197640112, 0.08908594315835913, 0.19420452586953238, 0.03207531341947473, -0.06788185593525797, -0.29361423855010504, 0.2617813638291925, 0.013550250582268527, 0.3505366347851481, 0.01513150736994656, 0.14717361678938484, -0.10226844145534596, -0.029601783403356015, 0.012609040889161071, -0.08888768306413154, 0.1912730194766956, 0.31804113955241653, 0.18186895137338746, 0.2827683760681086, -0.4221247628164367, -0.23947567005028014, 0.08311549571460519, 0.13523646206345225, 0.11309572152702639, -0.00900010806866306, -0.35375919008995066, 0.1148279564485482, -0.15138842504635683, 0.04080938801911599, -0.1337668352556982, -0.04198145395781759, -0.060179550960968636, -0.3209087099312177, 0.09178379322830374, 0.004746221590223383, 0.08686967942706698, -0.10711971941779606, -0.11003443997057148, -0.02625826114371162, 0.20816382630977964, -0.013508647172693948, 0.12011263227550549, 0.1563457268316092, -0.21848625501517877, -0.1077213510763885, 0.3416563674425742, -0.01638439193392936, -0.2061769282213373, 0.21984418766560582, -0.09701624301073081, -0.13673705114337162, 0.14973662701931378, 0.2448697329991251, 0.1513067005287813, -0.1518944321892499, -0.06863614619763968, -0.043603919864849856, 0.20394686540817106, 0.0652363407345296, -0.0911137489480425, 0.14693277215556566, 0.290856234529466, -0.03690493375600862, 0.1572777744809922, -0.27191622849037317, 0.013601033195453586, -0.21760866682712432, -0.12767342391323355, -0.16558620539383243, -0.025271596397510532, -0.08895480177686166, -0.1782145355685375, 0.4241926089514375, 0.2568762650629916, 0.23075063984084632, 0.1354948173038897, 0.3574696081834114, -0.06651933922591152, 0.1682663420964589, 0.022584154054708067, 0.17804682456839863, -0.019742114361538037, 0.10740600997173733, -0.14526647936139733, 0.04364166282415319, 0.04198718089182144]
|
1,803.05432
|
The statistics of mesoscopic systems and the physical interpretation of
extensive and non-extensive entropies
|
The postulates of thermodynamics were originally formulated for macroscopic
systems. They lead to the definition of the entropy, which, for a homogeneous
system, is a homogeneous function of order one in the extensive variables and
is maximized at equilibrium. We say that the macroscopic systems are extensive
and so it is also the entropy. For a mesoscopic system, by definition, the size
and the contacts with other systems influence its thermodynamic properties and
therefore, if we define an entropy, this cannot be a homogeneous of order one
function in the extensive variables. So, mesoscopic systems and their entropies
are non-extensive. While for macroscopic systems and homogeneous entropies the
equilibrium conditions are clearly defined, it is not so clear how the
non-extensive entropies should be applied for the calculation of equilibrium
properties of mesoscopic systems--for example it is not clear what is the role
played by the boundaries and the contacts between the subsystems. We propose
here a general definition of the entropy in the equilibrium state, which is
applicable to both, macroscopic and mesoscopic systems. This definition still
leaves an apparent ambiguity in the definition of the entropy of a mesoscopic
system, but this we recognize as the signature of the anthropomorphic character
of the entropy (see Jaynes, Am. J. Phys. 33, 391, 1965).
To exemplify our approach, we analyze four formulas for the entropy (two for
extensive and two for non-extensive entropies) and calculate the equilibrium
(canonical) distribution of probabilities by two methods for each. We show that
these methods, although widely used, are not equivalent and one of them is a
consequence of our definition of the entropy of a compound system.
|
cond-mat.stat-mech quant-ph
|
the postulates of thermodynamics were originally formulated for macroscopic systems they lead to the definition of the entropy which for a homogeneous system is a homogeneous function of order one in the extensive variables and is maximized at equilibrium we say that the macroscopic systems are extensive and so it is also the entropy for a mesoscopic system by definition the size and the contacts with other systems influence its thermodynamic properties and therefore if we define an entropy this cannot be a homogeneous of order one function in the extensive variables so mesoscopic systems and their entropies are nonextensive while for macroscopic systems and homogeneous entropies the equilibrium conditions are clearly defined it is not so clear how the nonextensive entropies should be applied for the calculation of equilibrium properties of mesoscopic systemsfor example it is not clear what is the role played by the boundaries and the contacts between the subsystems we propose here a general definition of the entropy in the equilibrium state which is applicable to both macroscopic and mesoscopic systems this definition still leaves an apparent ambiguity in the definition of the entropy of a mesoscopic system but this we recognize as the signature of the anthropomorphic character of the entropy see jaynes am j phys 33 391 1965 to exemplify our approach we analyze four formulas for the entropy two for extensive and two for nonextensive entropies and calculate the equilibrium canonical distribution of probabilities by two methods for each we show that these methods although widely used are not equivalent and one of them is a consequence of our definition of the entropy of a compound system
|
[['the', 'postulates', 'of', 'thermodynamics', 'were', 'originally', 'formulated', 'for', 'macroscopic', 'systems', 'they', 'lead', 'to', 'the', 'definition', 'of', 'the', 'entropy', 'which', 'for', 'a', 'homogeneous', 'system', 'is', 'a', 'homogeneous', 'function', 'of', 'order', 'one', 'in', 'the', 'extensive', 'variables', 'and', 'is', 'maximized', 'at', 'equilibrium', 'we', 'say', 'that', 'the', 'macroscopic', 'systems', 'are', 'extensive', 'and', 'so', 'it', 'is', 'also', 'the', 'entropy', 'for', 'a', 'mesoscopic', 'system', 'by', 'definition', 'the', 'size', 'and', 'the', 'contacts', 'with', 'other', 'systems', 'influence', 'its', 'thermodynamic', 'properties', 'and', 'therefore', 'if', 'we', 'define', 'an', 'entropy', 'this', 'can', 'not', 'be', 'a', 'homogeneous', 'of', 'order', 'one', 'function', 'in', 'the', 'extensive', 'variables', 'so', 'mesoscopic', 'systems', 'and', 'their', 'entropies', 'are', 'nonextensive', 'while', 'for', 'macroscopic', 'systems', 'and', 'homogeneous', 'entropies', 'the', 'equilibrium', 'conditions', 'are', 'clearly', 'defined', 'it', 'is', 'not', 'so', 'clear', 'how', 'the', 'nonextensive', 'entropies', 'should', 'be', 'applied', 'for', 'the', 'calculation', 'of', 'equilibrium', 'properties', 'of', 'mesoscopic', 'systemsfor', 'example', 'it', 'is', 'not', 'clear', 'what', 'is', 'the', 'role', 'played', 'by', 'the', 'boundaries', 'and', 'the', 'contacts', 'between', 'the', 'subsystems', 'we', 'propose', 'here', 'a', 'general', 'definition', 'of', 'the', 'entropy', 'in', 'the', 'equilibrium', 'state', 'which', 'is', 'applicable', 'to', 'both', 'macroscopic', 'and', 'mesoscopic', 'systems', 'this', 'definition', 'still', 'leaves', 'an', 'apparent', 'ambiguity', 'in', 'the', 'definition', 'of', 'the', 'entropy', 'of', 'a', 'mesoscopic', 'system', 'but', 'this', 'we', 'recognize', 'as', 'the', 'signature', 'of', 'the', 'anthropomorphic', 'character', 'of', 'the', 'entropy', 'see', 'jaynes', 'am', 'j', 'phys', '33', '391', '1965', 'to', 'exemplify', 'our', 'approach', 'we', 'analyze', 'four', 'formulas', 'for', 'the', 'entropy', 'two', 'for', 'extensive', 'and', 'two', 'for', 'nonextensive', 'entropies', 'and', 'calculate', 'the', 'equilibrium', 'canonical', 'distribution', 'of', 'probabilities', 'by', 'two', 'methods', 'for', 'each', 'we', 'show', 'that', 'these', 'methods', 'although', 'widely', 'used', 'are', 'not', 'equivalent', 'and', 'one', 'of', 'them', 'is', 'a', 'consequence', 'of', 'our', 'definition', 'of', 'the', 'entropy', 'of', 'a', 'compound', 'system']]
|
[-0.11052804484878752, 0.13567668272870254, -0.1489893910915337, 0.07930711095179008, 0.000919776867905801, -0.13169986093501476, 0.035966890726915814, 0.3164983986182646, -0.2637161431713453, -0.27986206857180645, 0.07747373634525997, -0.3038649241626263, -0.1388192409141497, 0.17455177507278594, -0.049327670723273924, 0.06090333436848596, 0.019504881030456587, 0.07316484583372419, -0.07506903436923908, -0.22874950691718945, 0.33841437955048276, 0.039878389425575735, 0.27838449744560584, 0.07435572915244848, 0.09674222153188153, -0.02533345639366995, 0.014085362225093625, 0.09996934941038489, -0.1538372673520247, 0.10108902762157165, 0.23257805560800163, 0.13581854360347445, 0.26378517115319317, -0.37596184599128635, -0.21345444919933057, 0.11537633822553538, 0.09351780655201186, 0.1136902434446595, 0.029758886506421153, -0.2352413704085418, 0.05380648297294763, -0.19605185259980235, -0.12036994779143821, -0.10268900562077761, 0.055755830186165194, 0.025153241559482096, -0.2332735812291503, 0.0999140519469934, 0.11420466771772639, 0.07522728883407333, -0.06664731046989221, -0.08061112579931928, -0.02645365062085065, 0.12835721228271724, 0.006480677581646226, -0.02867400869896466, 0.13686955069361084, -0.10459876618517393, -0.10350106950510632, 0.37539538406512957, -0.01123576922934841, -0.23536933858127504, 0.21038191397674383, -0.12733259927312082, -0.13123947825452142, 0.06708720031448386, 0.09472214468416165, 0.15028983725742862, -0.20039540275254034, 0.04194210979008031, -0.04065983156927607, 0.15611933690749785, 0.0244139872897755, 0.05524736501890319, 0.23522991646419872, 0.12178159772333774, 0.03605850984427062, 0.17096043022370644, -0.047373435957124455, -0.16017761909826236, -0.31370365875688466, -0.22725224407728423, -0.2191731169263155, 0.0613529237869873, -0.0519885315841847, -0.1710370677794245, 0.35185724773020904, 0.16730573582208969, 0.18265385599637574, 0.020227283521301365, 0.2575811464195563, 0.14620348990175197, 0.03301351660227572, 0.06905654147944668, 0.24385558266362006, 0.13112557440488176, 0.08804899363143538, -0.2198362631799484, 0.08822476001117717, 0.061266278228299186]
|
1,803.05433
|
A generalization of Rohn's theorem on full-rank interval matrices
|
A general closed interval matrix is a matrix whose entries are closed
connected nonempty subsets of the set of the real numbers, while an interval
matrix is defined to be a matrix whose entries are closed bounded nonempty
intervals in the set of real numbers. We say that a matrix $A$ with constant
entries is contained in a general closed interval matrix $\mu$ if and only if,
for every $i,j$, we have that $A_{i,j} \in \mu_{i,j}$. Rhon characterized
full-rank square interval matrices, that is, square interval matrices $\mu$
such that every constant matrix contained in $\mu$ is nonsingular. In this
paper we generalize this result to general closed interval matrices.
|
math.RA
|
a general closed interval matrix is a matrix whose entries are closed connected nonempty subsets of the set of the real numbers while an interval matrix is defined to be a matrix whose entries are closed bounded nonempty intervals in the set of real numbers we say that a matrix a with constant entries is contained in a general closed interval matrix mu if and only if for every ij we have that a_ij in mu_ij rhon characterized fullrank square interval matrices that is square interval matrices mu such that every constant matrix contained in mu is nonsingular in this paper we generalize this result to general closed interval matrices
|
[['a', 'general', 'closed', 'interval', 'matrix', 'is', 'a', 'matrix', 'whose', 'entries', 'are', 'closed', 'connected', 'nonempty', 'subsets', 'of', 'the', 'set', 'of', 'the', 'real', 'numbers', 'while', 'an', 'interval', 'matrix', 'is', 'defined', 'to', 'be', 'a', 'matrix', 'whose', 'entries', 'are', 'closed', 'bounded', 'nonempty', 'intervals', 'in', 'the', 'set', 'of', 'real', 'numbers', 'we', 'say', 'that', 'a', 'matrix', 'a', 'with', 'constant', 'entries', 'is', 'contained', 'in', 'a', 'general', 'closed', 'interval', 'matrix', 'mu', 'if', 'and', 'only', 'if', 'for', 'every', 'ij', 'we', 'have', 'that', 'a_ij', 'in', 'mu_ij', 'rhon', 'characterized', 'fullrank', 'square', 'interval', 'matrices', 'that', 'is', 'square', 'interval', 'matrices', 'mu', 'such', 'that', 'every', 'constant', 'matrix', 'contained', 'in', 'mu', 'is', 'nonsingular', 'in', 'this', 'paper', 'we', 'generalize', 'this', 'result', 'to', 'general', 'closed', 'interval', 'matrices']]
|
[-0.19836718299510805, 0.1869199060084859, 0.036630119671198454, 0.016413930277551777, -0.03773138639940457, -0.15182132760740139, 0.04540063348831609, 0.3913311253894459, -0.2981299612332474, -0.12291264542965853, 0.14930160541235554, -0.31635905810716475, -0.14807955301366746, 0.11887639765627682, -0.09139898113313724, 0.011308489299633287, 0.09927960235456174, 0.149860361375084, -0.12228002570230853, -0.2841366416520693, 0.33315749494782226, -0.10432783473621715, 0.1349877088584683, 0.05012240024357611, 0.14944864276119255, -0.00583891546015035, 0.025555061214518816, 0.06800301261246204, -0.10858626298908017, 0.06645438924050805, 0.28721420533785763, 0.17384175538000735, 0.26374755798077043, -0.3483271567209158, -0.12174723970449784, 0.2857279198836874, 0.1264567999338562, -0.03802167576187375, 0.006841509323567152, -0.22799833589656787, 0.1923750097609379, -0.1395863017067313, -0.1347003614318303, 0.0011705929519269954, 0.1503633988174525, -0.026120427200591868, -0.4034747778692029, 0.03204506335102699, 0.04801602923226628, 0.05944056357680397, 0.018788254023952917, -0.18764374943725257, 0.06293828519145873, 0.09276444607583637, -0.039668992917392065, 0.057770423002710396, 0.06918763980661011, 0.0641454797619107, -0.045596478405323895, 0.3344391606875103, -0.06800352500074289, -0.3279306566681374, 0.02822511632164771, -0.22348272582854736, -0.13818499143658713, 0.14400233003226193, 0.11208432356467132, 0.10685378310524604, -0.1299728213132105, 0.23882883382400244, -0.20612883391705425, 0.16913773287934336, 0.08802391615780918, -0.00010844788101332432, 0.1604104691269723, 0.05871542415750975, 0.12334510563153096, 0.07961911470100114, 0.0406993787905032, -0.05188586090014062, -0.3693639512258497, -0.1382680712437088, -0.297316497462717, 0.11897908873348073, -0.14138731111505132, -0.2713407529348677, 0.37914262471551247, 0.03221713162704625, 0.23801526374776255, 0.12824885554781015, 0.2172732967968014, 0.13241654668156777, 0.019779689914800905, 0.1313441734083674, 0.024642138521779666, 0.19673781310292807, -0.022362192641859027, -0.08305703892626545, 0.03905605371956798, 0.10967549517451765]
|
1,803.05434
|
The OMG-Emotion Behavior Dataset
|
This paper is the basis paper for the accepted IJCNN challenge One-Minute
Gradual-Emotion Recognition (OMG-Emotion) by which we hope to foster
long-emotion classification using neural models for the benefit of the IJCNN
community. The proposed corpus has as the novelty the data collection and
annotation strategy based on emotion expressions which evolve over time into a
specific context. Different from other corpora, we propose a novel multimodal
corpus for emotion expression recognition, which uses gradual annotations with
a focus on contextual emotion expressions. Our dataset was collected from
Youtube videos using a specific search strategy based on restricted keywords
and filtering which guaranteed that the data follow a gradual emotion
expression transition, i.e. emotion expressions evolve over time in a natural
and continuous fashion. We also provide an experimental protocol and a series
of unimodal baseline experiments which can be used to evaluate deep and
recurrent neural models in a fair and standard manner.
|
cs.HC
|
this paper is the basis paper for the accepted ijcnn challenge oneminute gradualemotion recognition omgemotion by which we hope to foster longemotion classification using neural models for the benefit of the ijcnn community the proposed corpus has as the novelty the data collection and annotation strategy based on emotion expressions which evolve over time into a specific context different from other corpora we propose a novel multimodal corpus for emotion expression recognition which uses gradual annotations with a focus on contextual emotion expressions our dataset was collected from youtube videos using a specific search strategy based on restricted keywords and filtering which guaranteed that the data follow a gradual emotion expression transition ie emotion expressions evolve over time in a natural and continuous fashion we also provide an experimental protocol and a series of unimodal baseline experiments which can be used to evaluate deep and recurrent neural models in a fair and standard manner
|
[['this', 'paper', 'is', 'the', 'basis', 'paper', 'for', 'the', 'accepted', 'ijcnn', 'challenge', 'oneminute', 'gradualemotion', 'recognition', 'omgemotion', 'by', 'which', 'we', 'hope', 'to', 'foster', 'longemotion', 'classification', 'using', 'neural', 'models', 'for', 'the', 'benefit', 'of', 'the', 'ijcnn', 'community', 'the', 'proposed', 'corpus', 'has', 'as', 'the', 'novelty', 'the', 'data', 'collection', 'and', 'annotation', 'strategy', 'based', 'on', 'emotion', 'expressions', 'which', 'evolve', 'over', 'time', 'into', 'a', 'specific', 'context', 'different', 'from', 'other', 'corpora', 'we', 'propose', 'a', 'novel', 'multimodal', 'corpus', 'for', 'emotion', 'expression', 'recognition', 'which', 'uses', 'gradual', 'annotations', 'with', 'a', 'focus', 'on', 'contextual', 'emotion', 'expressions', 'our', 'dataset', 'was', 'collected', 'from', 'youtube', 'videos', 'using', 'a', 'specific', 'search', 'strategy', 'based', 'on', 'restricted', 'keywords', 'and', 'filtering', 'which', 'guaranteed', 'that', 'the', 'data', 'follow', 'a', 'gradual', 'emotion', 'expression', 'transition', 'ie', 'emotion', 'expressions', 'evolve', 'over', 'time', 'in', 'a', 'natural', 'and', 'continuous', 'fashion', 'we', 'also', 'provide', 'an', 'experimental', 'protocol', 'and', 'a', 'series', 'of', 'unimodal', 'baseline', 'experiments', 'which', 'can', 'be', 'used', 'to', 'evaluate', 'deep', 'and', 'recurrent', 'neural', 'models', 'in', 'a', 'fair', 'and', 'standard', 'manner']]
|
[-0.027461426387376645, 0.011412562307193296, -0.09907130701954361, 0.053198544883771855, -0.13030916452407837, -0.16822251052370454, 0.06559193164591062, 0.4284442975094505, -0.21659639618341245, -0.3078269083722452, 0.07508028276855114, -0.2766066119927012, -0.19841812493803065, 0.21058186901934153, -0.10987604834562399, 0.0453904535730972, 0.14070276012705044, 0.09571822015800684, -0.02656604103238803, -0.2559650496768406, 0.30777501530665297, 0.045888724759505645, 0.38402959362305455, 0.027810665556637484, 0.1462874270966459, -0.03991899880416253, -0.07717235473816259, -0.029582363924656817, -0.07109728410675113, 0.18269087157053934, 0.334351329132011, 0.24401223254420495, 0.31229164185964203, -0.40152364371502713, -0.19359466669094913, 0.06739849468702268, 0.15474909477641965, 0.12944970505990794, -0.06488919357260921, -0.389905314658178, 0.054583355452670575, -0.230854321745973, 0.06716086169753492, -0.131585900330143, 0.03136413588547726, -0.011271981680514655, -0.30225664467301244, 0.04870134469991386, 0.0759027014194312, 0.13220917731158288, -0.07630051500194408, -0.09796693425905569, 0.04912362969784809, 0.18203912127087368, 0.034933643653727094, 0.0722073308288065, 0.10089627720926907, -0.14107149605310387, -0.17468711625468109, 0.3716640547039657, -0.1142287896363996, -0.19889554762725833, 0.1800613807098867, -0.03387234961687058, -0.15405901020934526, 0.07689291428092843, 0.2618227135694397, 0.11808799350104641, -0.20947142694681103, -0.0271914298303754, -0.0798250769015426, 0.21978856802741492, 0.05452855286687564, -0.04513555329317361, 0.18207563691372294, 0.25266658543042986, -0.004259006604187044, 0.13714438388344766, -0.10601413600128509, -0.06551568902834179, -0.21949928058493956, -0.10028779181937864, -0.16518418643672286, -0.025706496074479196, -0.05247627676778863, -0.14759355789853953, 0.4208221843380944, 0.20875700904696334, 0.18140352817154884, 0.1531087229906405, 0.28984894865539435, 0.05895843796638979, 0.10411627409014139, 0.06105737266696844, 0.10896024529006502, -0.058195521785676774, 0.17719711744518696, -0.13980534195662567, 0.09823565054121823, 0.05536352084900916]
|
1,803.05435
|
Phase Sensitive Amplification Enabled by Coherent Population Trapping
|
We isolate a novel four-wave mixing process, enabled by Coherent Population
Trapping (CPT), leading to efficient phase sensitive amplification. This
process is permitted by the exploitation of two transitions starting from the
same twofold degenerate ground state. One of the transitions is used for CPT,
defining bright and dark states from which ultra intense four-wave mixing is
obtained via the other transition. This leads to the measurement of a strong
phase sensitive gain even for low optical densities and out-of-resonance
excitation. The enhancement of four-wave mixing is interpreted in the framework
of the dark-state polariton formalism.
|
quant-ph
|
we isolate a novel fourwave mixing process enabled by coherent population trapping cpt leading to efficient phase sensitive amplification this process is permitted by the exploitation of two transitions starting from the same twofold degenerate ground state one of the transitions is used for cpt defining bright and dark states from which ultra intense fourwave mixing is obtained via the other transition this leads to the measurement of a strong phase sensitive gain even for low optical densities and outofresonance excitation the enhancement of fourwave mixing is interpreted in the framework of the darkstate polariton formalism
|
[['we', 'isolate', 'a', 'novel', 'fourwave', 'mixing', 'process', 'enabled', 'by', 'coherent', 'population', 'trapping', 'cpt', 'leading', 'to', 'efficient', 'phase', 'sensitive', 'amplification', 'this', 'process', 'is', 'permitted', 'by', 'the', 'exploitation', 'of', 'two', 'transitions', 'starting', 'from', 'the', 'same', 'twofold', 'degenerate', 'ground', 'state', 'one', 'of', 'the', 'transitions', 'is', 'used', 'for', 'cpt', 'defining', 'bright', 'and', 'dark', 'states', 'from', 'which', 'ultra', 'intense', 'fourwave', 'mixing', 'is', 'obtained', 'via', 'the', 'other', 'transition', 'this', 'leads', 'to', 'the', 'measurement', 'of', 'a', 'strong', 'phase', 'sensitive', 'gain', 'even', 'for', 'low', 'optical', 'densities', 'and', 'outofresonance', 'excitation', 'the', 'enhancement', 'of', 'fourwave', 'mixing', 'is', 'interpreted', 'in', 'the', 'framework', 'of', 'the', 'darkstate', 'polariton', 'formalism']]
|
[-0.12335674175604557, 0.2587159625448597, -0.06221484756679274, 0.06683372358766822, -0.01628286352934083, -0.1303662227874156, 0.11623875785638423, 0.36381434618184966, -0.26326733486105997, -0.27079926637816243, 0.03970377929120635, -0.2310276381128157, -0.06913171421911102, 0.1538406963130304, 0.04309386072660951, 0.044256527558900416, 0.025705675570255455, -0.07766496256226674, -0.013880736022353327, -0.10556125892859806, 0.3223183959247156, 0.032273307546953824, 0.34837539184566896, 0.025554674551434193, 0.11188814938941505, -0.029200232786630902, -0.002761383118922822, -0.12721412750155045, -0.083899382201101, 0.09457952581275701, 0.22778382579175135, 0.04274158768627482, 0.20253900481475284, -0.39937794556317385, -0.21713958556453386, 0.11771651584179683, 0.14304856631527704, 0.1885720436584961, -0.10946277108935949, -0.3425757033498182, -0.0326825859665405, -0.14052027568686754, -0.12685985789479068, -0.09576293804760401, -0.05629245553852039, -0.051640797134799264, -0.3319218906496341, 0.09321544496439553, 0.047275004028051626, 0.022986467365020264, 0.027870302471759107, -0.04182193742599338, -0.04204700908788558, 0.08165178478035766, -0.01824400492538795, -0.007435674614195402, 0.12155462564745297, -0.12437015178632767, -0.08791869671646661, 0.41018522129161283, -0.1433173292413509, -0.07185125478523939, 0.19373807864030823, -0.15360920903428146, -0.08054538578653592, 0.23549473565799417, 0.1327684325466786, 0.12791945305980335, -0.14360022155839638, 0.013678630963416557, 0.02514700589138859, 0.14891923056954207, 0.09608877142212198, 0.13451592521353936, 0.2023652735806536, 0.19301454510423355, 0.0830952523489638, 0.15588350224970782, -0.11145829128023858, -0.11192662047687918, -0.28304323833435774, -0.11182729755792782, -0.16198573809621544, 0.08536577309132554, -0.030175385360962537, -0.10384211252676323, 0.4187679467383229, 0.11725457624803919, 0.16303956105548423, -0.07874721948246588, 0.32298256903595757, 0.1686409786925651, 0.03866502969079496, -0.010914292657010568, 0.3453772315988317, 0.19339395789817596, 0.08632087805017363, -0.29005243357096333, 0.055921543957083486, -0.0043400832898138715]
|
1,803.05436
|
Evidence for a New Component of High-Energy Solar Gamma-Ray Production
|
The observed multi-GeV gamma-ray emission from the solar disk --- sourced by
hadronic cosmic rays interacting with gas, and affected by complex magnetic
fields --- is not understood. Utilizing an improved analysis of the Fermi-LAT
data that includes the first resolved imaging of the disk, we find strong
evidence that this emission is produced by two separate mechanisms. Between
2010-2017 (the rise to and fall from solar maximum), the gamma-ray emission is
dominated by a polar component. Between 2008-2009 (solar minimum) this
component remains present, but the total emission is instead dominated by a new
equatorial component with a brighter flux and harder spectrum. Most strikingly,
although 6 gamma rays above 100 GeV are observed during the 1.4 years of solar
minimum, none are observed during the next 7.8 years. These features, along
with a 30-50 GeV spectral dip which will be discussed in a companion paper,
were not anticipated by theory. To understand the underlying physics, Fermi and
HAWC observations of the imminent Cycle 25 solar minimum are crucial.
|
astro-ph.HE astro-ph.SR hep-ph
|
the observed multigev gammaray emission from the solar disk sourced by hadronic cosmic rays interacting with gas and affected by complex magnetic fields is not understood utilizing an improved analysis of the fermilat data that includes the first resolved imaging of the disk we find strong evidence that this emission is produced by two separate mechanisms between 20102017 the rise to and fall from solar maximum the gammaray emission is dominated by a polar component between 20082009 solar minimum this component remains present but the total emission is instead dominated by a new equatorial component with a brighter flux and harder spectrum most strikingly although 6 gamma rays above 100 gev are observed during the 14 years of solar minimum none are observed during the next 78 years these features along with a 3050 gev spectral dip which will be discussed in a companion paper were not anticipated by theory to understand the underlying physics fermi and hawc observations of the imminent cycle 25 solar minimum are crucial
|
[['the', 'observed', 'multigev', 'gammaray', 'emission', 'from', 'the', 'solar', 'disk', 'sourced', 'by', 'hadronic', 'cosmic', 'rays', 'interacting', 'with', 'gas', 'and', 'affected', 'by', 'complex', 'magnetic', 'fields', 'is', 'not', 'understood', 'utilizing', 'an', 'improved', 'analysis', 'of', 'the', 'fermilat', 'data', 'that', 'includes', 'the', 'first', 'resolved', 'imaging', 'of', 'the', 'disk', 'we', 'find', 'strong', 'evidence', 'that', 'this', 'emission', 'is', 'produced', 'by', 'two', 'separate', 'mechanisms', 'between', '20102017', 'the', 'rise', 'to', 'and', 'fall', 'from', 'solar', 'maximum', 'the', 'gammaray', 'emission', 'is', 'dominated', 'by', 'a', 'polar', 'component', 'between', '20082009', 'solar', 'minimum', 'this', 'component', 'remains', 'present', 'but', 'the', 'total', 'emission', 'is', 'instead', 'dominated', 'by', 'a', 'new', 'equatorial', 'component', 'with', 'a', 'brighter', 'flux', 'and', 'harder', 'spectrum', 'most', 'strikingly', 'although', '6', 'gamma', 'rays', 'above', '100', 'gev', 'are', 'observed', 'during', 'the', '14', 'years', 'of', 'solar', 'minimum', 'none', 'are', 'observed', 'during', 'the', 'next', '78', 'years', 'these', 'features', 'along', 'with', 'a', '3050', 'gev', 'spectral', 'dip', 'which', 'will', 'be', 'discussed', 'in', 'a', 'companion', 'paper', 'were', 'not', 'anticipated', 'by', 'theory', 'to', 'understand', 'the', 'underlying', 'physics', 'fermi', 'and', 'hawc', 'observations', 'of', 'the', 'imminent', 'cycle', '25', 'solar', 'minimum', 'are', 'crucial']]
|
[-0.07831145349059841, 0.225972550233131, -0.024592385704939563, 0.1314976337529342, -0.07257326333672695, -0.0749606188785817, -0.0013959449036822964, 0.3974814775768512, -0.22101146232550187, -0.3940679174626157, 0.05778897250933196, -0.30774325325841173, -0.06260116595409013, 0.2284915882143347, -0.00932855258551648, -0.04817913967902617, 0.08769279329100668, -0.04879802949948325, -0.0297421799803574, -0.19905344388929994, 0.2517425837022962, 0.14818678469496913, 0.1796320622781336, 0.061574823677628523, 0.05234461079332201, -0.07250080564283833, -0.07252943479189915, -0.02057694169482039, -0.08581638016914353, 0.09710273420898288, 0.21762225654951872, 0.11509546459170192, 0.1746449682423623, -0.39139869812476846, -0.24796046762328064, 0.10806252545721474, 0.1515747442878949, -0.031037676739201527, -0.045944390136615505, -0.24535920613423168, 0.08065443697878869, -0.1583944677120252, -0.14991530482768126, 0.07807708326643999, 0.015140304461099385, -0.009630428269572024, -0.18214371336736285, 0.09984022684927497, 0.03545765501656292, 0.09692177410414886, -0.09938670902573947, -0.08555077340930611, -0.045322449051863736, 0.05367882954583149, 0.08636756753618274, 0.0819224729493726, 0.1609423055723753, -0.10589537654734504, -0.09215498812651883, 0.38509456518139423, -0.08071523220375336, 0.018792807069119243, 0.1828285089716138, -0.2163681291775512, -0.16752543199496964, 0.2601031281187066, 0.1288479768194347, 0.06807936144815314, -0.20040097763662093, 0.01936885213806471, -0.010455444566018525, 0.18434670853561588, 0.056966246818081434, 0.01822532305959612, 0.31675957239210784, 0.1435077973361504, 0.05425419473405262, 0.10198646447263725, -0.22609709070058584, -0.04485474583981115, -0.29167110033865484, -0.06054319751205012, -0.1503702099698352, 0.1022799748019939, -0.03952215755201732, -0.09150399564809743, 0.421323580808738, 0.09819558396148273, 0.22125191634265884, -0.03198815427285375, 0.2968766136549502, 0.09712882048500303, 0.07267717294979818, 0.14845518138359434, 0.3826593219502164, 0.14194381394606484, 0.13681583109843945, -0.18048593212041028, 0.065344648380276, -0.01460369071269053]
|
1,803.05437
|
New constraints on turbulence and embedded planet mass in the HD 163296
disk from planet-disk hydrodynamic simulations
|
Recent Atacama Large Millimeter and Submillimeter Array (ALMA) observations
of the protoplanetary disk around the Herbig Ae star HD 163296 revealed three
depleted dust gaps at 60, 100 and 160 au in the 1.3 mm continuum as well as CO
depletion in the middle and outer dust gaps. However, no CO depletion was found
in the inner dust gap. To examine the planet--disk interaction model, we
present results of two-dimensional two fluid (gas + dust) hydrodynamic
simulations coupled with three-dimensional radiative transfer simulations. In
order to fit the high gas-to-dust ratio of the first gap, we find the
Shakura--Sunyaev viscosity parameter $\alpha$ must be very small ($\lesssim
10^{-4}$) in the inner disk. On the other hand, a relatively large $\alpha$
($\sim 7.5\times 10^{-3}$) is required to reproduce the dust surface density in
the outer disk. We interpret the variation of $\alpha$ as an indicator of the
transition from an inner dead zone to the outer magnetorotational instability
(MRI) active zone. Within $\sim 100$ au, the HD 163296 disk's ionization level
is low, and non-ideal magnetohydrodynamic (MHD) effects could suppress the MRI,
so the disk can be largely laminar. The disk's ionization level gradually
increases toward larger radii, and the outermost disk ($r > 300$ au) becomes
turbulent due to MRI. Under this condition, we find that the observed dust
continuum and CO gas line emissions can be reasonably fit by three
half-Jovian-mass planets (0.46, 0.46 and 0.58 $M_\textrm{J}$) at 59, 105 and
160 au, respectively.
|
astro-ph.EP
|
recent atacama large millimeter and submillimeter array alma observations of the protoplanetary disk around the herbig ae star hd 163296 revealed three depleted dust gaps at 60 100 and 160 au in the 13 mm continuum as well as co depletion in the middle and outer dust gaps however no co depletion was found in the inner dust gap to examine the planetdisk interaction model we present results of twodimensional two fluid gas dust hydrodynamic simulations coupled with threedimensional radiative transfer simulations in order to fit the high gastodust ratio of the first gap we find the shakurasunyaev viscosity parameter alpha must be very small lesssim 104 in the inner disk on the other hand a relatively large alpha sim 75times 103 is required to reproduce the dust surface density in the outer disk we interpret the variation of alpha as an indicator of the transition from an inner dead zone to the outer magnetorotational instability mri active zone within sim 100 au the hd 163296 disks ionization level is low and nonideal magnetohydrodynamic mhd effects could suppress the mri so the disk can be largely laminar the disks ionization level gradually increases toward larger radii and the outermost disk r 300 au becomes turbulent due to mri under this condition we find that the observed dust continuum and co gas line emissions can be reasonably fit by three halfjovianmass planets 046 046 and 058 m_textrmj at 59 105 and 160 au respectively
|
[['recent', 'atacama', 'large', 'millimeter', 'and', 'submillimeter', 'array', 'alma', 'observations', 'of', 'the', 'protoplanetary', 'disk', 'around', 'the', 'herbig', 'ae', 'star', 'hd', '163296', 'revealed', 'three', 'depleted', 'dust', 'gaps', 'at', '60', '100', 'and', '160', 'au', 'in', 'the', '13', 'mm', 'continuum', 'as', 'well', 'as', 'co', 'depletion', 'in', 'the', 'middle', 'and', 'outer', 'dust', 'gaps', 'however', 'no', 'co', 'depletion', 'was', 'found', 'in', 'the', 'inner', 'dust', 'gap', 'to', 'examine', 'the', 'planetdisk', 'interaction', 'model', 'we', 'present', 'results', 'of', 'twodimensional', 'two', 'fluid', 'gas', 'dust', 'hydrodynamic', 'simulations', 'coupled', 'with', 'threedimensional', 'radiative', 'transfer', 'simulations', 'in', 'order', 'to', 'fit', 'the', 'high', 'gastodust', 'ratio', 'of', 'the', 'first', 'gap', 'we', 'find', 'the', 'shakurasunyaev', 'viscosity', 'parameter', 'alpha', 'must', 'be', 'very', 'small', 'lesssim', '104', 'in', 'the', 'inner', 'disk', 'on', 'the', 'other', 'hand', 'a', 'relatively', 'large', 'alpha', 'sim', '75times', '103', 'is', 'required', 'to', 'reproduce', 'the', 'dust', 'surface', 'density', 'in', 'the', 'outer', 'disk', 'we', 'interpret', 'the', 'variation', 'of', 'alpha', 'as', 'an', 'indicator', 'of', 'the', 'transition', 'from', 'an', 'inner', 'dead', 'zone', 'to', 'the', 'outer', 'magnetorotational', 'instability', 'mri', 'active', 'zone', 'within', 'sim', '100', 'au', 'the', 'hd', '163296', 'disks', 'ionization', 'level', 'is', 'low', 'and', 'nonideal', 'magnetohydrodynamic', 'mhd', 'effects', 'could', 'suppress', 'the', 'mri', 'so', 'the', 'disk', 'can', 'be', 'largely', 'laminar', 'the', 'disks', 'ionization', 'level', 'gradually', 'increases', 'toward', 'larger', 'radii', 'and', 'the', 'outermost', 'disk', 'r', '300', 'au', 'becomes', 'turbulent', 'due', 'to', 'mri', 'under', 'this', 'condition', 'we', 'find', 'that', 'the', 'observed', 'dust', 'continuum', 'and', 'co', 'gas', 'line', 'emissions', 'can', 'be', 'reasonably', 'fit', 'by', 'three', 'halfjovianmass', 'planets', '046', '046', 'and', '058', 'm_textrmj', 'at', '59', '105', 'and', '160', 'au', 'respectively']]
|
[-0.08229819086355288, 0.14720616798113342, 0.025371032755452494, 0.06345459949542684, -0.009371524924401365, -0.07225280894112797, -0.01134041546721758, 0.37521153595274476, -0.22966878554853035, -0.36529353270230214, 0.07407813755966615, -0.2786494608706802, 0.01169841410023952, 0.12471031580863073, 0.0020788778095844796, 0.007619746645127446, 0.044139361552112885, -0.1702793551424195, -0.032154370154146385, -0.16942940529990047, 0.25087474337163235, 0.14422881672320473, 0.09622260923728285, 0.047596895962151164, -0.02487039721709453, -0.19223446550602016, -0.012768115084387424, -0.0488877927591978, -0.23852299929954027, -0.002445568924207887, 0.23102818541579942, 0.0018829431380953424, 0.2226200726745296, -0.431935102928984, -0.21878127004635667, -0.007738914607238979, 0.20674756355295035, 0.009872992792405373, 0.01871847467687489, -0.20762601367983013, 0.09840634887006657, -0.21416303280102136, -0.16412524686195917, 0.09319512210863311, 0.0739043893875585, -0.05488324117479261, -0.29357574806329295, 0.13001952199496267, 0.050642121239268985, 0.11563627725882718, -0.15423835221339355, -0.14565322458289934, -0.1164209468738553, 0.04056051624736803, 0.011061197966972197, 0.10633439359313823, 0.25908765999777317, -0.09113995771381758, 0.03235443683402721, 0.3704383015211225, -0.14964220790896748, -0.050947221092233236, 0.2776354746190708, -0.3033059582831954, -0.09086013734516253, 0.2470165120364621, 0.13757074318300885, 0.1290352653359902, -0.08278503515834588, 0.02013076123387518, -0.05604531038273511, 0.24818636801128452, 0.09667002243540165, 0.020161217145433202, 0.3608543871563267, 0.14369944578242558, 0.018682122726016485, 0.10945907027113314, -0.3086602723510736, -0.07041922018118588, -0.20534705969962977, -0.12495707286029192, -0.14637094079843946, 0.07629921119025146, -0.15705622925013227, -0.0938753667614646, 0.2550046123210187, 0.11316723077007654, 0.24915496335164758, 0.0267801132718917, 0.3197139055672109, 0.0615564507440941, 0.10759539400373609, 0.16576354107857982, 0.3403924991115004, 0.16593044559559822, 0.12777425537524698, -0.26269250109403064, 0.06621945244577629, -0.036206475111717464]
|
1,803.05438
|
Exotic Gravitational Wave Signatures from Simultaneous Phase Transitions
|
We demonstrate that the relic gravitational wave background from a multi-step
phase transition may deviate from the simple sum of the single spectra, for
phase transitions with similar nucleation temperatures $T_N$. We demonstrate
that the temperature range $\Delta T$ between the volume fractions $f(T)=0.1$
and $f(T)=0.9$ occupied by the vacuum bubbles can span $\sim 20$ GeV. This
allows for a situation in which phase transitions overlap, such that the later
bubbles may nucleate both in high temperature and intermediate temperature
phases. Such scenarios may lead to more exotic gravitational wave spectra,
which cannot be fitted that of a consecutive PTs. We demonstrate this
explicitly in the singlet extension of the Standard Model. Finally, we comment
on potential additional effects due to the more exotic dynamics of overlapping
phase transitions.
|
hep-ph astro-ph.CO
|
we demonstrate that the relic gravitational wave background from a multistep phase transition may deviate from the simple sum of the single spectra for phase transitions with similar nucleation temperatures t_n we demonstrate that the temperature range delta t between the volume fractions ft01 and ft09 occupied by the vacuum bubbles can span sim 20 gev this allows for a situation in which phase transitions overlap such that the later bubbles may nucleate both in high temperature and intermediate temperature phases such scenarios may lead to more exotic gravitational wave spectra which cannot be fitted that of a consecutive pts we demonstrate this explicitly in the singlet extension of the standard model finally we comment on potential additional effects due to the more exotic dynamics of overlapping phase transitions
|
[['we', 'demonstrate', 'that', 'the', 'relic', 'gravitational', 'wave', 'background', 'from', 'a', 'multistep', 'phase', 'transition', 'may', 'deviate', 'from', 'the', 'simple', 'sum', 'of', 'the', 'single', 'spectra', 'for', 'phase', 'transitions', 'with', 'similar', 'nucleation', 'temperatures', 't_n', 'we', 'demonstrate', 'that', 'the', 'temperature', 'range', 'delta', 't', 'between', 'the', 'volume', 'fractions', 'ft01', 'and', 'ft09', 'occupied', 'by', 'the', 'vacuum', 'bubbles', 'can', 'span', 'sim', '20', 'gev', 'this', 'allows', 'for', 'a', 'situation', 'in', 'which', 'phase', 'transitions', 'overlap', 'such', 'that', 'the', 'later', 'bubbles', 'may', 'nucleate', 'both', 'in', 'high', 'temperature', 'and', 'intermediate', 'temperature', 'phases', 'such', 'scenarios', 'may', 'lead', 'to', 'more', 'exotic', 'gravitational', 'wave', 'spectra', 'which', 'can', 'not', 'be', 'fitted', 'that', 'of', 'a', 'consecutive', 'pts', 'we', 'demonstrate', 'this', 'explicitly', 'in', 'the', 'singlet', 'extension', 'of', 'the', 'standard', 'model', 'finally', 'we', 'comment', 'on', 'potential', 'additional', 'effects', 'due', 'to', 'the', 'more', 'exotic', 'dynamics', 'of', 'overlapping', 'phase', 'transitions']]
|
[-0.11417262064605893, 0.25787349346501287, -0.09564984345706762, 0.07616446256542986, -0.033853402517706854, -0.08831476694103912, 0.09866043382135103, 0.3752237457956653, -0.24022305633479846, -0.3178080134821357, 0.04801427074289677, -0.28127377199223247, -0.11679105020630232, 0.14838387262534525, 0.03300465512438677, -0.026600439377943985, -0.012693055905401707, -0.0034392767561257642, -0.11265062917300384, -0.17762600515197846, 0.2831809687122586, 0.020612000378605444, 0.24057962457300164, 0.0789625096549571, 0.026605352468322963, -0.048555178512287966, 0.05371263747656485, 0.026976430279319175, -0.1308459147232952, -0.014140232230602123, 0.23410898539077607, 0.06166969556215918, 0.17467526784457732, -0.42056764113294776, -0.24822046911140205, 0.16105670941578865, 0.153064302947314, 0.137212211955557, -0.05353440892417893, -0.30200093836174347, 0.01863031892935396, -0.17703869819524698, -0.11801216799156578, -0.09760507040664379, -0.00905651045468403, -0.007007075024375808, -0.257555586136732, 0.12926295549186761, 0.0038486780977109447, -0.022993273281826987, -0.059219788438440446, -0.11449687449930934, -0.06236081632960122, 0.05634056102644536, 0.03425770052763255, 0.01693659739589748, 0.13701783191572758, -0.12685449630589574, -0.09854996148305872, 0.38264592028281186, -0.10149102598415993, -0.07864638938190183, 0.2086664877460862, -0.21361684900887212, -0.1050916214226163, 0.22766985795169603, 0.14980361135530984, 0.10220366855355678, -0.10041518226353219, 0.036548475935887836, 0.031947333780635745, 0.18510873405830353, 0.08851175904055708, 0.03971044524223544, 0.28760568379220786, 0.12801584039698355, 0.017452230902563315, 0.14148913944382002, -0.1151970288474331, -0.09446294090594165, -0.3221768117246029, -0.13030162579889293, -0.1438903469897923, 0.03368646974820422, -0.10370113929070612, -0.13342211831331952, 0.3843297572020674, 0.16656946530747518, 0.23444546808241284, 0.00653803655950469, 0.25061413439470925, 0.0942567774127383, 0.0579493773439026, 0.03699496719491435, 0.26782782840564323, 0.08019764326127188, 0.1126155186102551, -0.22199718197407492, 0.018460991432220908, 0.009110661187150981]
|
1,803.05439
|
Inequivalence of the zero-momentum Limits of Transverse and Longitudinal
Dielectric Response in the Cuprates
|
We address the question of the mismatch between the zero momentum limits of
the transverse and longitudinal dielectric functions for a fixed direction of
the driving field observed in the cuprates. This question translates to whether
or not the order in which the longitudinal and transverse momentum transfers
are taken to zero commute. While the two limits commute for both isotropic and
anisotropic Drude metals, we argue that a scaleless vertex interaction that
depends solely on the angle between scattered electron momenta is sufficient to
achieve non-commutativity of the two limits even for a system that is
inherently isotropic. We demonstrate this claim for a simple case of the Drude
conductivity modified by electron-boson interactions through appropriate vertex
corrections, and outline possible consequences of our result to optical and
electron energy loss spectroscopy (EELS) measurements close to zero momentum
transfer
|
cond-mat.str-el
|
we address the question of the mismatch between the zero momentum limits of the transverse and longitudinal dielectric functions for a fixed direction of the driving field observed in the cuprates this question translates to whether or not the order in which the longitudinal and transverse momentum transfers are taken to zero commute while the two limits commute for both isotropic and anisotropic drude metals we argue that a scaleless vertex interaction that depends solely on the angle between scattered electron momenta is sufficient to achieve noncommutativity of the two limits even for a system that is inherently isotropic we demonstrate this claim for a simple case of the drude conductivity modified by electronboson interactions through appropriate vertex corrections and outline possible consequences of our result to optical and electron energy loss spectroscopy eels measurements close to zero momentum transfer
|
[['we', 'address', 'the', 'question', 'of', 'the', 'mismatch', 'between', 'the', 'zero', 'momentum', 'limits', 'of', 'the', 'transverse', 'and', 'longitudinal', 'dielectric', 'functions', 'for', 'a', 'fixed', 'direction', 'of', 'the', 'driving', 'field', 'observed', 'in', 'the', 'cuprates', 'this', 'question', 'translates', 'to', 'whether', 'or', 'not', 'the', 'order', 'in', 'which', 'the', 'longitudinal', 'and', 'transverse', 'momentum', 'transfers', 'are', 'taken', 'to', 'zero', 'commute', 'while', 'the', 'two', 'limits', 'commute', 'for', 'both', 'isotropic', 'and', 'anisotropic', 'drude', 'metals', 'we', 'argue', 'that', 'a', 'scaleless', 'vertex', 'interaction', 'that', 'depends', 'solely', 'on', 'the', 'angle', 'between', 'scattered', 'electron', 'momenta', 'is', 'sufficient', 'to', 'achieve', 'noncommutativity', 'of', 'the', 'two', 'limits', 'even', 'for', 'a', 'system', 'that', 'is', 'inherently', 'isotropic', 'we', 'demonstrate', 'this', 'claim', 'for', 'a', 'simple', 'case', 'of', 'the', 'drude', 'conductivity', 'modified', 'by', 'electronboson', 'interactions', 'through', 'appropriate', 'vertex', 'corrections', 'and', 'outline', 'possible', 'consequences', 'of', 'our', 'result', 'to', 'optical', 'and', 'electron', 'energy', 'loss', 'spectroscopy', 'eels', 'measurements', 'close', 'to', 'zero', 'momentum', 'transfer']]
|
[-0.1487618382438086, 0.19286686378015605, -0.05816356396576988, 0.0926897398728345, -0.09083627209765836, -0.13266698007604905, 0.05076452927730445, 0.40050818785758957, -0.2693045523217214, -0.2568217119734202, 0.005007501566849116, -0.3020913544244, -0.08100373574166692, 0.17691019941620262, 0.006752183741939787, 0.020847730518185666, 0.035932893086490884, -0.003946046629321895, -0.09551443030899723, -0.1968631251417849, 0.36209648188669236, 0.04444117114014391, 0.30351616327451275, 0.14318910155644907, 0.12583601725221213, 0.07668925956822932, 0.009599211048667452, 0.0353553936883275, -0.1119556977936944, 0.0755017469005127, 0.22492302616301457, -0.027613424632831344, 0.220733738412881, -0.39565107045429093, -0.1778290712208088, 0.07493798569443502, 0.13722932505354818, 0.10636780400111873, -0.007166529475944117, -0.18369808818512995, 0.011653740694081144, -0.16648416384289574, -0.14871516134257295, -0.0673473542456382, 0.02116661755883667, -0.0034481217357097194, -0.28711461370611296, 0.10810996306411523, 0.10374765330925584, 0.03195050091349653, -0.08934211401002748, -0.09540805971565923, -0.04432349635587473, 0.10637997791387274, 0.08369554495106318, 0.049823039597166434, 0.12269156259010612, -0.14529394926170686, -0.0902715533306556, 0.3655990899806576, -0.06392872741146545, -0.22535222679975309, 0.16761921155100157, -0.21305684070019718, -0.04172083824606879, 0.11914474946845854, 0.13683338577060827, 0.06338099604472518, -0.13803722183220088, 0.08526331922330428, -0.007570442031802876, 0.14105907565681264, 0.07247808747259633, 0.07819884465009506, 0.23418915841196264, 0.09164207542780786, 0.04008193349997912, 0.10624892394657114, -0.09232718320064513, -0.029466488147902835, -0.3039143845106342, -0.12956730283331125, -0.22827738228952513, 0.08730025380760448, -0.0657522985057897, -0.14200415846592349, 0.38840138790131146, 0.1808828217755945, 0.2504339373005288, 0.008419091453210318, 0.31089533916009326, 0.13956576356389894, 0.0679899261632402, 0.06360297131385388, 0.29512080585118383, 0.14239815709879622, 0.11180151354721082, -0.28155215683925366, 0.011635686247609555, 0.03331712521446337]
|
1,803.0544
|
Current-induced forces for nonadiabatic molecular dynamics
|
We present general first principles derivation of expression for
current-induced forces. The expression is applicable in non-equilibrium
molecular systems with arbitrary intra-molecular interactions and for any
electron-nuclei coupling. It provides a controlled consistent way to account
for quantum effects of nuclear motion, accounts for electronic non-Markov
character of the friction tensor, and opens way to treatments beyond strictly
adiabatic approximation. We show connection of the expression with previous
studies, and discuss effective ways to evaluate the friction tensor.
|
cond-mat.mes-hall
|
we present general first principles derivation of expression for currentinduced forces the expression is applicable in nonequilibrium molecular systems with arbitrary intramolecular interactions and for any electronnuclei coupling it provides a controlled consistent way to account for quantum effects of nuclear motion accounts for electronic nonmarkov character of the friction tensor and opens way to treatments beyond strictly adiabatic approximation we show connection of the expression with previous studies and discuss effective ways to evaluate the friction tensor
|
[['we', 'present', 'general', 'first', 'principles', 'derivation', 'of', 'expression', 'for', 'currentinduced', 'forces', 'the', 'expression', 'is', 'applicable', 'in', 'nonequilibrium', 'molecular', 'systems', 'with', 'arbitrary', 'intramolecular', 'interactions', 'and', 'for', 'any', 'electronnuclei', 'coupling', 'it', 'provides', 'a', 'controlled', 'consistent', 'way', 'to', 'account', 'for', 'quantum', 'effects', 'of', 'nuclear', 'motion', 'accounts', 'for', 'electronic', 'nonmarkov', 'character', 'of', 'the', 'friction', 'tensor', 'and', 'opens', 'way', 'to', 'treatments', 'beyond', 'strictly', 'adiabatic', 'approximation', 'we', 'show', 'connection', 'of', 'the', 'expression', 'with', 'previous', 'studies', 'and', 'discuss', 'effective', 'ways', 'to', 'evaluate', 'the', 'friction', 'tensor']]
|
[-0.16805977758784324, 0.12127653979815733, -0.10862543105926867, 0.0675613276902228, -0.07768585929312767, -0.14547515778133693, 0.04373007531439026, 0.3516959645665991, -0.22741512190072966, -0.2739345297838251, -0.04074822867271276, -0.2208822392142163, -0.20800582009206453, 0.20017451324906105, 0.03657358214975549, 0.03137965580352988, 0.028907755819650795, -0.02014900827541565, -0.04409146721128565, -0.11462335324344727, 0.3100094683945943, 0.022984496143180877, 0.2543956517982177, 0.1395872503053397, 0.11374112571446368, 0.05924826769086604, -0.024269004659846615, 0.024891766015058145, -0.17855347417748701, 0.14126751224438733, 0.24921511539902824, 0.014668367110574856, 0.22009684529919654, -0.485953626031868, -0.23280976281668514, 0.0323076958123308, 0.11627145951840645, 0.23935415817854497, -0.03835206084216061, -0.24635046912739292, 0.013879340404692369, -0.22506437596315756, -0.1517473417267096, -0.1920645796105815, 0.08057757229723322, -0.025408624790799923, -0.2907875671546954, 0.1573350410054002, 0.07090938044114946, 0.035264548320227705, -0.1388737731344568, -0.10927710230671203, 0.08317569485650612, 0.15419482798554385, 0.024765873186809655, 0.014353591554726545, 0.20703966484870762, -0.12830129477338348, -0.11127112061382295, 0.4402372100844215, -0.07923468092802721, -0.22537066935537717, 0.19042499635655147, -0.14167994104672033, -0.1115523630585999, 0.07917271845806868, 0.1269068421366123, 0.09154851413451326, -0.20591238607318166, 0.0883717569112121, 0.07309592181506257, 0.10801382924024111, 0.02155831539764618, 0.043879431610455356, 0.18009638773181882, 0.13668148919868356, 0.05078306469994669, 0.16678850880513588, -0.03597932375776462, -0.1531995022788835, -0.28673177286504936, -0.1586746448197235, -0.13595877157357067, 0.08421277051839308, -0.07920956840228964, -0.13754307124047324, 0.3558729347319175, 0.17838140470811573, 0.1200951608688905, 0.08513892704370217, 0.31524796783924103, 0.12584819555139312, 0.05972131351844814, 0.042872878233305156, 0.2468431522974219, 0.20308270583000892, 0.03496773435304371, -0.27068955288865626, 0.10436135709572297, 0.045074932056311995]
|
1,803.05441
|
A Higgsploding Theory of Dark Matter
|
We show that the Higgsplosion mechanism makes a prediction for the mass and
coupling of a WIMP-like minimal scalar dark matter model. In particular the
currently favoured minimal value for the Higgsplosion scale, $E_\mathrm{H}\sim
25$ TeV, implies a dark matter mass $m_\mathrm{DM} \sim 1.25$ TeV and a
moderate quartic coupling with the Standard Model Higgs field
$\lambda_\mathrm{H,DM} \sim 0.4$. This point in the parameter space is still
allowed by all current experimental bounds, including direct detection (XENON),
indirect detection (HESS, Fermi, Planck) and collider searches. We have updated
the scalar dark matter bounds to reflect the latest results from XENON and HESS
experiments. We also comment on vacuum stability and dark matter
self-interactions in this model.
|
hep-ph astro-ph.CO
|
we show that the higgsplosion mechanism makes a prediction for the mass and coupling of a wimplike minimal scalar dark matter model in particular the currently favoured minimal value for the higgsplosion scale e_mathrmhsim 25 tev implies a dark matter mass m_mathrmdm sim 125 tev and a moderate quartic coupling with the standard model higgs field lambda_mathrmhdm sim 04 this point in the parameter space is still allowed by all current experimental bounds including direct detection xenon indirect detection hess fermi planck and collider searches we have updated the scalar dark matter bounds to reflect the latest results from xenon and hess experiments we also comment on vacuum stability and dark matter selfinteractions in this model
|
[['we', 'show', 'that', 'the', 'higgsplosion', 'mechanism', 'makes', 'a', 'prediction', 'for', 'the', 'mass', 'and', 'coupling', 'of', 'a', 'wimplike', 'minimal', 'scalar', 'dark', 'matter', 'model', 'in', 'particular', 'the', 'currently', 'favoured', 'minimal', 'value', 'for', 'the', 'higgsplosion', 'scale', 'e_mathrmhsim', '25', 'tev', 'implies', 'a', 'dark', 'matter', 'mass', 'm_mathrmdm', 'sim', '125', 'tev', 'and', 'a', 'moderate', 'quartic', 'coupling', 'with', 'the', 'standard', 'model', 'higgs', 'field', 'lambda_mathrmhdm', 'sim', '04', 'this', 'point', 'in', 'the', 'parameter', 'space', 'is', 'still', 'allowed', 'by', 'all', 'current', 'experimental', 'bounds', 'including', 'direct', 'detection', 'xenon', 'indirect', 'detection', 'hess', 'fermi', 'planck', 'and', 'collider', 'searches', 'we', 'have', 'updated', 'the', 'scalar', 'dark', 'matter', 'bounds', 'to', 'reflect', 'the', 'latest', 'results', 'from', 'xenon', 'and', 'hess', 'experiments', 'we', 'also', 'comment', 'on', 'vacuum', 'stability', 'and', 'dark', 'matter', 'selfinteractions', 'in', 'this', 'model']]
|
[-0.11123255420713113, 0.23189043508140011, -0.04762648262304107, 0.16311831785704972, -0.12179340776709612, -0.16360468060603334, 0.023409966689844925, 0.2947826781636921, -0.18518945621735042, -0.407601673156023, 0.04055895407688232, -0.2957925535983553, -0.006298796657734273, 0.17735386528115588, 0.07127810720499327, 0.05767006688473517, 0.04524040458266411, 0.008419624864728305, -0.05560700491013561, -0.25592907751081184, 0.26719138925699026, 0.11709265615545998, 0.18732275052420927, 0.1548252505446343, 0.0911549829894252, -0.05334937396018129, -0.038013798691201625, -0.09203611924992099, -0.19398526025747342, 0.04710511994198896, 0.1737374027725309, 0.07916847660140902, 0.13449751753196643, -0.3387939608594599, -0.1854607149409212, 0.22331013141624761, 0.1171451714298312, 0.0787146437725281, -0.141943841295423, -0.3573899345080319, 0.054542025473589696, -0.2549929324100448, -0.1110142575405342, -0.013570657661674838, -0.05036857715101194, -0.08947764883704255, -0.2625584758066556, 0.13813921950911703, -0.07247591729831408, -0.038177387266044034, -0.10950327080086265, -0.1501126693757741, -0.009933781132036657, -0.1112259840511047, 0.11834520154546849, 0.015361308581767636, 0.2040307188382078, -0.2465989363355268, -0.10321182801118611, 0.3908255589276291, -0.1681685461233811, -0.11793071925721801, 0.17062512323619766, -0.17229439610239575, -0.17264406113035716, 0.12432696778131158, 0.13832490448839962, 0.03957290613509126, -0.1219955039447533, 0.2221721800104429, -0.062111620178544207, 0.23059666475506801, 0.03253292020924978, 0.027706406181351395, 0.32303227221168446, 0.2309830514530308, 0.08741608119300126, 0.002912198775447905, -0.15923630278516693, -0.06522668003137305, -0.38896209704934764, -0.11095348025034917, -0.1101528743962071, 0.010011581369071152, -0.11354147664717043, -0.06377123783775523, 0.3674046952694066, 0.16451213213108612, 0.23413678892201892, 0.042844013123070464, 0.3120767720566507, 0.039625080302357674, 0.057281752312280186, 0.04450000442496579, 0.41290009480884726, 0.10145793451821399, 0.11032600229883795, -0.19129034778176757, -0.039568284828738684, 0.00023639497036735216]
|
1,803.05442
|
Detection of HOCO+ in the protostar IRAS 16293-2422
|
The protonated form of CO2, HOCO+, is assumed to be an indirect tracer of CO2
in the millimeter/submillimeter regime since CO2 lacks a permanent dipole
moment. Here, we report the detection of two rotational emission lines (4 0,4-3
0,3) and (5 0,5-4 0,4) of HOCO+ in IRAS 16293-2422. For our observations, we
have used EMIR heterodyne 3 mm receiver of the IRAM 30m telescope. The observed
abundance of HOCO+ is compared with the simulations using the 3-phase NAUTILUS
chemical model. Implications of the measured abundances of HOCO+ to study the
chemistry of CO2 ices using JWST-MIRI and NIRSpec are discussed as well.
|
astro-ph.GA
|
the protonated form of co2 hoco is assumed to be an indirect tracer of co2 in the millimetersubmillimeter regime since co2 lacks a permanent dipole moment here we report the detection of two rotational emission lines 4 043 03 and 5 054 04 of hoco in iras 162932422 for our observations we have used emir heterodyne 3 mm receiver of the iram 30m telescope the observed abundance of hoco is compared with the simulations using the 3phase nautilus chemical model implications of the measured abundances of hoco to study the chemistry of co2 ices using jwstmiri and nirspec are discussed as well
|
[['the', 'protonated', 'form', 'of', 'co2', 'hoco', 'is', 'assumed', 'to', 'be', 'an', 'indirect', 'tracer', 'of', 'co2', 'in', 'the', 'millimetersubmillimeter', 'regime', 'since', 'co2', 'lacks', 'a', 'permanent', 'dipole', 'moment', 'here', 'we', 'report', 'the', 'detection', 'of', 'two', 'rotational', 'emission', 'lines', '4', '043', '03', 'and', '5', '054', '04', 'of', 'hoco', 'in', 'iras', '162932422', 'for', 'our', 'observations', 'we', 'have', 'used', 'emir', 'heterodyne', '3', 'mm', 'receiver', 'of', 'the', 'iram', '30m', 'telescope', 'the', 'observed', 'abundance', 'of', 'hoco', 'is', 'compared', 'with', 'the', 'simulations', 'using', 'the', '3phase', 'nautilus', 'chemical', 'model', 'implications', 'of', 'the', 'measured', 'abundances', 'of', 'hoco', 'to', 'study', 'the', 'chemistry', 'of', 'co2', 'ices', 'using', 'jwstmiri', 'and', 'nirspec', 'are', 'discussed', 'as', 'well']]
|
[-0.04600098808113413, 0.10350659236385529, 0.02679399585159605, 0.007364845083679492, 0.013329402309632404, -0.09143880180850186, 0.014731752159480261, 0.43854544925339084, -0.13424386597676752, -0.34910607568043117, 0.12190176490648631, -0.2905706822799117, -0.04181232538494263, 0.11198099111845973, 0.044446903299175056, -0.021664882787530693, 0.026117995235550803, -0.1531335791965545, 0.0035177819960403676, -0.1725273337032573, 0.17820316750907758, 0.15345754479879842, 0.17053958849739467, 0.06122330298154231, 0.06932180268945647, -0.20054049131360052, -0.04369789640893977, -0.07565349184305352, -0.17230403460744842, 0.04987847926460352, 0.28392192194987015, 0.11264000180274118, 0.12176496742804553, -0.40021099487100453, -0.1913592362885966, 0.06976660133759473, 0.11436672828288055, 0.06318404336514719, -0.042218389217833094, -0.2856966903451465, 0.008853598369979392, -0.17969300516415387, -0.17931425829838013, 0.05620595257199716, 0.017382383227859642, 0.029605115693080806, -0.2530727286220473, 0.07863452688644768, -0.060550909238301365, 0.18924999014273577, -0.15713679133549185, -0.25560167921688776, -0.11510626135928118, 0.0644024038064184, -0.061198133122696376, 0.06122038633033049, 0.1864311997322183, -0.08068380463758812, -0.056066990830004215, 0.42385367031081345, -0.1780155848052042, -0.010839460983726323, 0.206617365591228, -0.22075614625788934, -0.2545980963645978, 0.22060141255439936, 0.10356652681880138, 0.1516782348164056, -0.1325119254361911, 0.01368216667940621, -0.02462800723664901, 0.2736424012657474, 0.0759871896383736, 0.05019211285866285, 0.2675796228588796, 0.1696071575256521, 0.01297569124361354, 0.13385842115031646, -0.3328869226297327, -0.06481357358622036, -0.16405354655466461, -0.21774536781195625, -0.1583905440809972, 0.0881602066847514, -0.07834594946453922, -0.057739674460654165, 0.2698556943591136, 0.11562732289380886, 0.16061471963493043, -0.002676416492071368, 0.31368315454535917, 0.03202362106108636, 0.05546035468925017, 0.0034278082095232664, 0.32561495366469756, 0.20488654133662873, 0.13450325167664856, -0.26410619478544917, 0.11104407439729673, -0.0263881278463968]
|
1,803.05443
|
Quasinormal modes and strong cosmic censorship in near-extremal
Kerr-Newman-de Sitter black-hole spacetimes
|
The quasinormal resonant modes of massless neutral fields in near-extremal
Kerr-Newman-de Sitter black-hole spacetimes are calculated in the eikonal
regime. It is explicitly proved that, in the angular momentum regime ${\bar a}>
\sqrt{{{1-2{\bar\Lambda}}\over{4+{\bar\Lambda}/3}}}$, the black-hole spacetimes
are characterized by slowly decaying resonant modes which are described by the
compact formula $\Im\omega(n)=\kappa_+\cdot(n+{1\over2})$ [here the physical
parameters $\{{\bar a},\kappa_+,{\bar\Lambda},n\}$ are respectively the
dimensionless angular momentum of the black hole, its characteristic surface
gravity, the dimensionless cosmological constant of the spacetime, and the
integer resonance parameter]. Our results support the validity of the Penrose
strong cosmic censorship conjecture in these black-hole spacetimes.
|
gr-qc astro-ph.HE hep-th
|
the quasinormal resonant modes of massless neutral fields in nearextremal kerrnewmande sitter blackhole spacetimes are calculated in the eikonal regime it is explicitly proved that in the angular momentum regime bar a sqrt12barlambdaover4barlambda3 the blackhole spacetimes are characterized by slowly decaying resonant modes which are described by the compact formula imomegankappa_cdotn1over2 here the physical parameters bar akappa_barlambdan are respectively the dimensionless angular momentum of the black hole its characteristic surface gravity the dimensionless cosmological constant of the spacetime and the integer resonance parameter our results support the validity of the penrose strong cosmic censorship conjecture in these blackhole spacetimes
|
[['the', 'quasinormal', 'resonant', 'modes', 'of', 'massless', 'neutral', 'fields', 'in', 'nearextremal', 'kerrnewmande', 'sitter', 'blackhole', 'spacetimes', 'are', 'calculated', 'in', 'the', 'eikonal', 'regime', 'it', 'is', 'explicitly', 'proved', 'that', 'in', 'the', 'angular', 'momentum', 'regime', 'bar', 'a', 'sqrt12barlambdaover4barlambda3', 'the', 'blackhole', 'spacetimes', 'are', 'characterized', 'by', 'slowly', 'decaying', 'resonant', 'modes', 'which', 'are', 'described', 'by', 'the', 'compact', 'formula', 'imomegankappa_cdotn1over2', 'here', 'the', 'physical', 'parameters', 'bar', 'akappa_barlambdan', 'are', 'respectively', 'the', 'dimensionless', 'angular', 'momentum', 'of', 'the', 'black', 'hole', 'its', 'characteristic', 'surface', 'gravity', 'the', 'dimensionless', 'cosmological', 'constant', 'of', 'the', 'spacetime', 'and', 'the', 'integer', 'resonance', 'parameter', 'our', 'results', 'support', 'the', 'validity', 'of', 'the', 'penrose', 'strong', 'cosmic', 'censorship', 'conjecture', 'in', 'these', 'blackhole', 'spacetimes']]
|
[-0.23388789348852393, 0.21563504095441507, -0.06330555816627263, 0.15652653503760425, -0.09658244164893404, -0.15115773712750524, -0.05820319056510925, 0.251098774150402, -0.15122004570245431, -0.23787581584959602, 0.032903861943244316, -0.279824788873763, -0.0679784154247803, 0.2056775291081673, 0.026858880451375928, 0.0775129043461978, -0.019207393917895388, -0.0014055308711249381, -0.03247628233657451, -0.20756001283007208, 0.4212438953303111, 0.08535169476332764, 0.22132751773218237, 0.008722952727111988, 0.0845331875073801, -0.014666022784998253, 0.008784803067101166, 0.02809099586738739, -0.21886861356604945, -0.028717928821909783, 0.22343587586268163, 0.0960936169043028, 0.14897915774933304, -0.35907642989574623, -0.20674633617212143, 0.025061155664540518, 0.20092491509664492, 0.1512548086696673, -0.04786241694819182, -0.3068659388227388, 0.061367525942235567, -0.16879279296457148, -0.2062955386354588, -0.07240994646175143, 0.08537016083816222, -0.047077912366754994, -0.2061664930661209, 0.1702835694886744, 0.09358937918174585, -0.06330918823975178, -0.13542984764353605, -0.03757882976788096, -0.08418685984846282, 0.021969681736663915, 0.1909447049620212, 0.031678089440295785, 0.19526984373806044, -0.10038287656304117, -0.12496967973189992, 0.30335261037544115, -0.05509189145717149, -0.25363562085355323, 0.13065310338667283, -0.3044790936595139, -0.0670547302045937, 0.13850048119881345, 0.11759399493166711, 0.21299516766642532, -0.11636675740010105, 0.21798267900347432, -0.004568910667633948, 0.11838513434971294, 0.18058123938196027, 0.09282141969015356, 0.3664103920824952, 0.051174916268792, -0.07019263249821961, 0.09795472342375433, -0.05629893688698454, -0.06765108458603208, -0.33950882862942916, -0.13089134053734597, -0.19312965656475475, 0.09402191048138775, -0.2326485711090148, -0.16909293755694912, 0.3326081507111667, 0.041774327284656465, 0.15561133732262533, 0.027379609029594576, 0.25183062042439514, 0.11982045451077283, 0.006112711618091756, 0.13024171664437745, 0.40842676160779473, 0.1834352140382786, 0.12648435601295205, -0.2988209527199312, -0.09414465106480445, 0.08033263475226704]
|
1,803.05444
|
When do star clusters become multiple star systems? II. Toward a
half-life formalism with four bodies
|
We present a half-life formalism for describing the disruption of
gravitationally-bound few-body systems, with a focus on binary-binary
scattering. For negative total encounter energies, the four-body problem has
three possible decay products in the point particle limit. For each decay
product and a given set of initial conditions, we obtain directly from
numerical scattering simulations the half-life for the distribution of
disruption times. As in radioactive decay, the half-lives should provide a
direct prediction for the relative fractions of each decay product. We test
this prediction with simulated data and find good agreement with our
hypothesis. We briefly discuss applications of this feature of the
gravitational four-body problem to populations of black holes in globular
clusters. This paper, the second in the series, builds on extending the
remarkable similarity between gravitational chaos at the macroscopic scale and
radioactive decay at the microscopic scale to larger-N systems.
|
astro-ph.SR physics.class-ph
|
we present a halflife formalism for describing the disruption of gravitationallybound fewbody systems with a focus on binarybinary scattering for negative total encounter energies the fourbody problem has three possible decay products in the point particle limit for each decay product and a given set of initial conditions we obtain directly from numerical scattering simulations the halflife for the distribution of disruption times as in radioactive decay the halflives should provide a direct prediction for the relative fractions of each decay product we test this prediction with simulated data and find good agreement with our hypothesis we briefly discuss applications of this feature of the gravitational fourbody problem to populations of black holes in globular clusters this paper the second in the series builds on extending the remarkable similarity between gravitational chaos at the macroscopic scale and radioactive decay at the microscopic scale to largern systems
|
[['we', 'present', 'a', 'halflife', 'formalism', 'for', 'describing', 'the', 'disruption', 'of', 'gravitationallybound', 'fewbody', 'systems', 'with', 'a', 'focus', 'on', 'binarybinary', 'scattering', 'for', 'negative', 'total', 'encounter', 'energies', 'the', 'fourbody', 'problem', 'has', 'three', 'possible', 'decay', 'products', 'in', 'the', 'point', 'particle', 'limit', 'for', 'each', 'decay', 'product', 'and', 'a', 'given', 'set', 'of', 'initial', 'conditions', 'we', 'obtain', 'directly', 'from', 'numerical', 'scattering', 'simulations', 'the', 'halflife', 'for', 'the', 'distribution', 'of', 'disruption', 'times', 'as', 'in', 'radioactive', 'decay', 'the', 'halflives', 'should', 'provide', 'a', 'direct', 'prediction', 'for', 'the', 'relative', 'fractions', 'of', 'each', 'decay', 'product', 'we', 'test', 'this', 'prediction', 'with', 'simulated', 'data', 'and', 'find', 'good', 'agreement', 'with', 'our', 'hypothesis', 'we', 'briefly', 'discuss', 'applications', 'of', 'this', 'feature', 'of', 'the', 'gravitational', 'fourbody', 'problem', 'to', 'populations', 'of', 'black', 'holes', 'in', 'globular', 'clusters', 'this', 'paper', 'the', 'second', 'in', 'the', 'series', 'builds', 'on', 'extending', 'the', 'remarkable', 'similarity', 'between', 'gravitational', 'chaos', 'at', 'the', 'macroscopic', 'scale', 'and', 'radioactive', 'decay', 'at', 'the', 'microscopic', 'scale', 'to', 'largern', 'systems']]
|
[-0.0867504775715507, 0.12433850978284258, -0.08380291567260578, 0.10658963915831346, 0.027399751214208463, -0.06770061581293503, 0.049935500261099525, 0.31323916099531807, -0.2328042272982277, -0.2893228395172229, 0.0457351371719285, -0.3025488075162348, -0.052533878313300954, 0.2118253422979176, 0.0303203953965886, 0.08225628071502872, 0.12547679115660898, 0.05498073362503743, -0.08786488336563582, -0.2198665836086012, 0.3403151550725715, 0.07253289387293466, 0.19438777535624344, 0.05651781212200398, 0.05412847085374293, 0.008449453331070812, -0.030104086702459888, -0.05398993177836991, -0.16494580928323158, 0.10352386549882246, 0.19639234541443318, 0.12419920336863358, 0.22125026283862248, -0.41841386240741163, -0.16454762859550648, 0.11445121783508014, 0.16216021756424684, 0.13339009015080966, -0.09131270478166997, -0.3051419376127728, 0.048110892096764016, -0.21054708241957099, -0.13753246273590278, -0.025626526395981647, 0.09477230287093209, 0.03317292708479353, -0.2675347857381383, 0.12173404196940668, -0.040162362299980325, 0.006770144432602922, -0.11487935429792978, -0.11512205877328573, 0.05676020002343424, 0.11347808220745893, 0.11263179273523186, -0.013111693811704954, 0.1610574042552138, -0.09253986549646633, -0.11441557100425435, 0.398963014556937, -0.04933832276114964, -0.13576500798409727, 0.21071045963119153, -0.2012327827755617, -0.19708782478797007, 0.1398464070939242, 0.1805148048498604, 0.09984389578681184, -0.16121263516913742, 0.04953221030962296, -0.022048055315517807, 0.16494322595707211, 0.08985837648482356, 0.04017855081509293, 0.2504137913721984, 0.23710852083175965, 0.0040305666984314075, 0.12198382249135485, -0.10932922872319205, -0.08463183739453822, -0.3211193610922025, -0.13985947865260903, -0.13190109574886627, 0.08578070472887628, -0.08466290880171247, -0.16293302348859556, 0.3527963173588457, 0.11476688853095043, 0.2158256123713154, 0.09391794290891146, 0.2642793355280446, 0.1029782049807007, 0.039292332539271106, 0.03139906068498345, 0.285022196883004, 0.1338065874520434, 0.07030113355881751, -0.25385487804923695, 0.05156449409048647, 0.05295349988511888]
|
1,803.05445
|
Chaos and Variance in Galaxy Formation
|
The evolution of galaxies is governed by equations with chaotic solutions:
gravity and compressible hydrodynamics. While this micro-scale chaos and
stochasticity has been well studied, it is poorly understood how it couples to
macro-scale properties examined in simulations of galaxy formation. In this
paper, we show how perturbations introduced by floating-point roundoff, random
number generators, and seemingly trivial differences in algorithmic behaviour
can produce non-trivial differences in star formation histories, circumgalactic
medium (CGM) properties, and the distribution of stellar mass. We examine the
importance of stochasticity due to discreteness noise, variations in merger
timings and how self-regulation moderates the effects of this stochasticity. We
show that chaotic variations in stellar mass can grow until halted by
feedback-driven self-regulation or gas exhaustion. We also find that galaxy
mergers are critical points from which large (as much as a factor of 2)
variations in quantities such as the galaxy stellar mass can grow. These
variations can grow and persist for more than a Gyr before regressing towards
the mean. These results show that detailed comparisons of simulations require
serious consideration of the magnitude of effects compared to run-to-run
chaotic variation, and may significantly complicate interpreting the impact of
different physical models. Understanding the results of simulations requires us
to understand that the process of simulation is not a mapping of an
infinitesimal point in configuration space to another, final infinitesimal
point. Instead, simulations map a point in a space of possible initial
conditions points to a volume of possible final states.
|
astro-ph.GA
|
the evolution of galaxies is governed by equations with chaotic solutions gravity and compressible hydrodynamics while this microscale chaos and stochasticity has been well studied it is poorly understood how it couples to macroscale properties examined in simulations of galaxy formation in this paper we show how perturbations introduced by floatingpoint roundoff random number generators and seemingly trivial differences in algorithmic behaviour can produce nontrivial differences in star formation histories circumgalactic medium cgm properties and the distribution of stellar mass we examine the importance of stochasticity due to discreteness noise variations in merger timings and how selfregulation moderates the effects of this stochasticity we show that chaotic variations in stellar mass can grow until halted by feedbackdriven selfregulation or gas exhaustion we also find that galaxy mergers are critical points from which large as much as a factor of 2 variations in quantities such as the galaxy stellar mass can grow these variations can grow and persist for more than a gyr before regressing towards the mean these results show that detailed comparisons of simulations require serious consideration of the magnitude of effects compared to runtorun chaotic variation and may significantly complicate interpreting the impact of different physical models understanding the results of simulations requires us to understand that the process of simulation is not a mapping of an infinitesimal point in configuration space to another final infinitesimal point instead simulations map a point in a space of possible initial conditions points to a volume of possible final states
|
[['the', 'evolution', 'of', 'galaxies', 'is', 'governed', 'by', 'equations', 'with', 'chaotic', 'solutions', 'gravity', 'and', 'compressible', 'hydrodynamics', 'while', 'this', 'microscale', 'chaos', 'and', 'stochasticity', 'has', 'been', 'well', 'studied', 'it', 'is', 'poorly', 'understood', 'how', 'it', 'couples', 'to', 'macroscale', 'properties', 'examined', 'in', 'simulations', 'of', 'galaxy', 'formation', 'in', 'this', 'paper', 'we', 'show', 'how', 'perturbations', 'introduced', 'by', 'floatingpoint', 'roundoff', 'random', 'number', 'generators', 'and', 'seemingly', 'trivial', 'differences', 'in', 'algorithmic', 'behaviour', 'can', 'produce', 'nontrivial', 'differences', 'in', 'star', 'formation', 'histories', 'circumgalactic', 'medium', 'cgm', 'properties', 'and', 'the', 'distribution', 'of', 'stellar', 'mass', 'we', 'examine', 'the', 'importance', 'of', 'stochasticity', 'due', 'to', 'discreteness', 'noise', 'variations', 'in', 'merger', 'timings', 'and', 'how', 'selfregulation', 'moderates', 'the', 'effects', 'of', 'this', 'stochasticity', 'we', 'show', 'that', 'chaotic', 'variations', 'in', 'stellar', 'mass', 'can', 'grow', 'until', 'halted', 'by', 'feedbackdriven', 'selfregulation', 'or', 'gas', 'exhaustion', 'we', 'also', 'find', 'that', 'galaxy', 'mergers', 'are', 'critical', 'points', 'from', 'which', 'large', 'as', 'much', 'as', 'a', 'factor', 'of', '2', 'variations', 'in', 'quantities', 'such', 'as', 'the', 'galaxy', 'stellar', 'mass', 'can', 'grow', 'these', 'variations', 'can', 'grow', 'and', 'persist', 'for', 'more', 'than', 'a', 'gyr', 'before', 'regressing', 'towards', 'the', 'mean', 'these', 'results', 'show', 'that', 'detailed', 'comparisons', 'of', 'simulations', 'require', 'serious', 'consideration', 'of', 'the', 'magnitude', 'of', 'effects', 'compared', 'to', 'runtorun', 'chaotic', 'variation', 'and', 'may', 'significantly', 'complicate', 'interpreting', 'the', 'impact', 'of', 'different', 'physical', 'models', 'understanding', 'the', 'results', 'of', 'simulations', 'requires', 'us', 'to', 'understand', 'that', 'the', 'process', 'of', 'simulation', 'is', 'not', 'a', 'mapping', 'of', 'an', 'infinitesimal', 'point', 'in', 'configuration', 'space', 'to', 'another', 'final', 'infinitesimal', 'point', 'instead', 'simulations', 'map', 'a', 'point', 'in', 'a', 'space', 'of', 'possible', 'initial', 'conditions', 'points', 'to', 'a', 'volume', 'of', 'possible', 'final', 'states']]
|
[-0.10544683840513851, 0.14592957102286164, -0.10469790633363896, 0.12557517287318495, -0.057205018152606237, -0.03971070601851735, 0.02225281346176029, 0.3593614424268405, -0.2497595078723288, -0.32837240842272, 0.08722158940088183, -0.2542866977859975, -0.14918346558982715, 0.17758988089607955, -0.08133422814650573, 0.029095577131246168, 0.07692354094109921, -0.06714568950280726, -0.07886032918776688, -0.2703632722916381, 0.3284319214201177, 0.08082175391714976, 0.181536874938644, 0.01151500042199707, 0.07926324327489413, -0.08176676102214489, -0.05754265082480169, 0.032208324493943195, -0.15004900776106495, 0.008836641454887783, 0.22105973707520496, 0.11082563918349464, 0.28313106088618556, -0.4431489070869952, -0.249558119676506, 0.10235344229198723, 0.20779100646747342, 0.10981837507705747, -0.06906743975521962, -0.23566699334341717, 0.07738921735211308, -0.16750332610737756, -0.15683080968877158, -0.05114785343058871, 0.041345451443491645, 0.03021902576636852, -0.23380207615889548, 0.12776331126539833, 0.07014351792822417, 0.05344002463492045, -0.046162804203429615, -0.049052684616491975, -0.09163123596717704, 0.14082026802822498, 0.06141676576927316, 0.018226461000665724, 0.20205361060760765, -0.1565042012997615, -0.05935439120989338, 0.41585467496969136, -0.03201986213634772, -0.16526528117228226, 0.23587422658704282, -0.1901520889427281, -0.14141151052432127, 0.12526885733791734, 0.19496204759214955, 0.07353368403000128, -0.11975982730491597, 0.023376097578422565, 0.005329600533463031, 0.19525598844755945, 0.05223350587626358, 0.029885558493004786, 0.2528778701407244, 0.15964285464934916, 0.04645030366922598, 0.08997151246140093, -0.0745380505943768, -0.12987621388179307, -0.25044776874792624, -0.10643393618529699, -0.14062088292959823, 0.09825005867041836, -0.11931833145672682, -0.1535109232037691, 0.36477425959649457, 0.19716617482271134, 0.23445983448937296, 0.034095396798751114, 0.28651595238809396, 0.09638066628216635, 0.06827315465027249, 0.07556374613981111, 0.2487109493366985, 0.13373083693964638, 0.0682352978986759, -0.25049393477729975, 0.11248434455896986, 0.008689696189898804]
|
1,803.05446
|
Does circumgalactic OVI trace low-pressure gas beyond the accretion
shock? Clues from HI and low-ion absorption, line kinematics, and dust
extinction
|
Large OVI columns are observed around star-forming, low-redshift ~L*
galaxies, with a dependence on impact parameter indicating that most O^5+
particles reside beyond half the halo virial radius (>~100 kpc). In order to
constrain the nature of the gas traced by OVI, we analyze additional
observables of the outer halo, namely HI to OVI column ratios of 1-10, an
absence of low-ion absorption, a mean differential extinction of E(B-V)~10^-3,
and a linear relation between OVI column and velocity width. We contrast these
observations with two physical scenarios: (1) OVI traces high-pressure (~30
cm^-3 K) collisionally-ionized gas cooling from a virially-shocked phase, and
(2) OVI traces low-pressure (<~1 cm^-3 K) gas beyond the accretion shock, where
the gas is in ionization and thermal equilibrium with the UV background. We
demonstrate that the high-pressure scenario requires multiple gas phases to
explain the observations, and a large deposition of energy at >~100 kpc to
offset the energy radiated by the cooling gas. In contrast, the low-pressure
scenario can explain all considered observations with a single gas phase in
thermal equilibrium, provided that the baryon overdensity is comparable to the
dark-matter overdensity, and that the gas is enriched to >~Z_sun/3 with an
ISM-like dust-to-metal ratio. The low-pressure scenario implies that OVI traces
a cool flow with mass flow rate of ~5 M_sun yr^-1, comparable to the star
formation rate of the central galaxies. The OVI line widths are consistent with
the velocity shear expected within this flow. The low-pressure scenario
predicts a bimodality in absorption line ratios at ~100 kpc, due to the
pressure jump across the accretion shock.
|
astro-ph.GA astro-ph.CO
|
large ovi columns are observed around starforming lowredshift l galaxies with a dependence on impact parameter indicating that most o5 particles reside beyond half the halo virial radius 100 kpc in order to constrain the nature of the gas traced by ovi we analyze additional observables of the outer halo namely hi to ovi column ratios of 110 an absence of lowion absorption a mean differential extinction of ebv103 and a linear relation between ovi column and velocity width we contrast these observations with two physical scenarios 1 ovi traces highpressure 30 cm3 k collisionallyionized gas cooling from a viriallyshocked phase and 2 ovi traces lowpressure 1 cm3 k gas beyond the accretion shock where the gas is in ionization and thermal equilibrium with the uv background we demonstrate that the highpressure scenario requires multiple gas phases to explain the observations and a large deposition of energy at 100 kpc to offset the energy radiated by the cooling gas in contrast the lowpressure scenario can explain all considered observations with a single gas phase in thermal equilibrium provided that the baryon overdensity is comparable to the darkmatter overdensity and that the gas is enriched to z_sun3 with an ismlike dusttometal ratio the lowpressure scenario implies that ovi traces a cool flow with mass flow rate of 5 m_sun yr1 comparable to the star formation rate of the central galaxies the ovi line widths are consistent with the velocity shear expected within this flow the lowpressure scenario predicts a bimodality in absorption line ratios at 100 kpc due to the pressure jump across the accretion shock
|
[['large', 'ovi', 'columns', 'are', 'observed', 'around', 'starforming', 'lowredshift', 'l', 'galaxies', 'with', 'a', 'dependence', 'on', 'impact', 'parameter', 'indicating', 'that', 'most', 'o5', 'particles', 'reside', 'beyond', 'half', 'the', 'halo', 'virial', 'radius', '100', 'kpc', 'in', 'order', 'to', 'constrain', 'the', 'nature', 'of', 'the', 'gas', 'traced', 'by', 'ovi', 'we', 'analyze', 'additional', 'observables', 'of', 'the', 'outer', 'halo', 'namely', 'hi', 'to', 'ovi', 'column', 'ratios', 'of', '110', 'an', 'absence', 'of', 'lowion', 'absorption', 'a', 'mean', 'differential', 'extinction', 'of', 'ebv103', 'and', 'a', 'linear', 'relation', 'between', 'ovi', 'column', 'and', 'velocity', 'width', 'we', 'contrast', 'these', 'observations', 'with', 'two', 'physical', 'scenarios', '1', 'ovi', 'traces', 'highpressure', '30', 'cm3', 'k', 'collisionallyionized', 'gas', 'cooling', 'from', 'a', 'viriallyshocked', 'phase', 'and', '2', 'ovi', 'traces', 'lowpressure', '1', 'cm3', 'k', 'gas', 'beyond', 'the', 'accretion', 'shock', 'where', 'the', 'gas', 'is', 'in', 'ionization', 'and', 'thermal', 'equilibrium', 'with', 'the', 'uv', 'background', 'we', 'demonstrate', 'that', 'the', 'highpressure', 'scenario', 'requires', 'multiple', 'gas', 'phases', 'to', 'explain', 'the', 'observations', 'and', 'a', 'large', 'deposition', 'of', 'energy', 'at', '100', 'kpc', 'to', 'offset', 'the', 'energy', 'radiated', 'by', 'the', 'cooling', 'gas', 'in', 'contrast', 'the', 'lowpressure', 'scenario', 'can', 'explain', 'all', 'considered', 'observations', 'with', 'a', 'single', 'gas', 'phase', 'in', 'thermal', 'equilibrium', 'provided', 'that', 'the', 'baryon', 'overdensity', 'is', 'comparable', 'to', 'the', 'darkmatter', 'overdensity', 'and', 'that', 'the', 'gas', 'is', 'enriched', 'to', 'z_sun3', 'with', 'an', 'ismlike', 'dusttometal', 'ratio', 'the', 'lowpressure', 'scenario', 'implies', 'that', 'ovi', 'traces', 'a', 'cool', 'flow', 'with', 'mass', 'flow', 'rate', 'of', '5', 'm_sun', 'yr1', 'comparable', 'to', 'the', 'star', 'formation', 'rate', 'of', 'the', 'central', 'galaxies', 'the', 'ovi', 'line', 'widths', 'are', 'consistent', 'with', 'the', 'velocity', 'shear', 'expected', 'within', 'this', 'flow', 'the', 'lowpressure', 'scenario', 'predicts', 'a', 'bimodality', 'in', 'absorption', 'line', 'ratios', 'at', '100', 'kpc', 'due', 'to', 'the', 'pressure', 'jump', 'across', 'the', 'accretion', 'shock']]
|
[-0.08714778400168448, 0.14051705180902394, -0.004116880584806772, 0.034602432953414176, -0.01664010616897371, -0.05441131903470017, 0.04965610225473438, 0.4203489630248483, -0.16865570546094086, -0.32912807133873456, 0.0235641646365109, -0.3122207874944078, 0.05520937549490624, 0.11683552779740732, 0.041319220882257486, -0.026997708686616783, -0.036295595268260344, -0.09108343563497578, -0.07325690723191378, -0.2424970998114174, 0.281681519154573, 0.06323722714757304, 0.16720138463184578, 0.039026857375519225, 0.0733274386196845, -0.16121625853702426, -0.01378870417029803, -0.008169165321888815, -0.18493283442593156, 0.0008566036041939759, 0.23685757856183323, 0.08552438269888285, 0.20913701441195856, -0.35864731117741755, -0.23287525899505654, 0.08345765247941017, 0.1956575193912509, 0.01957239194076423, -0.05726629656513812, -0.23262552625520994, 0.035322163196148185, -0.19664634079388024, -0.1894330064875415, 0.10433018426495277, 0.010988464769160817, 0.01291198547901088, -0.2434947332473941, 0.2199186122556793, -0.006185592326356937, 0.06553507884626654, -0.07544652281688057, -0.0750494212354711, -0.083738001857934, -0.0379568335550432, 0.010948404600723372, 0.04358500406281127, 0.3109613469133566, -0.13441842533061493, 0.04001323689834591, 0.4420084898495151, -0.12984612777176888, 0.030679937085947236, 0.24215024171347324, -0.2617171151785803, -0.13012081074780776, 0.25409179451903824, 0.1177260048788766, 0.04858546516722964, -0.1104573071955944, -0.010377293487722835, -0.07966445046094893, 0.2460891349553948, 0.059720858509424816, 0.03212637033443258, 0.3141218385684041, 0.08226645693941867, 0.06643895827276447, 0.05230847249191453, -0.21634906485324853, -0.05002361035706717, -0.24789708532736893, -0.12689135369457277, -0.09849742438465549, 0.05375842994455789, -0.16130151076543142, -0.09046192534395871, 0.2781387476100789, 0.14808502995194903, 0.3027921440395285, 0.03543652010224457, 0.3448965243447771, 0.09728945439542779, 0.0784206161611422, 0.15566722900279661, 0.2819589680693475, 0.23603611145317838, 0.10366226470574225, -0.2863951934508638, 0.07985131666846289, -0.0005868977506268229]
|
1,803.05447
|
The Origin of Faint Tidal Features Around Galaxies in the RESOLVE Survey
|
We study tidal features (TFs) around galaxies in the REsolved Spectroscopy of
a Local VolumE (RESOLVE) survey. Our sample consists of 1048 RESOLVE galaxies
that overlap with the DECam Legacy Survey, which reaches an r-band 3$\sigma$
depth of $\sim$27.9 mag arcsec$^{-2}$ for a 100 arcsec$^{2}$ feature. Images
were masked, smoothed, and inspected for TFs like streams, shells, or
tails/arms. We find TFs in 17$^{\pm 2} \%$ of our galaxies, setting a lower
limit on the true frequency. The frequency of TFs in the gas-poor
(gas-to-stellar mass ratio $<$ 0.1) subsample is lower than in the gas-rich
subsample (13$^{\pm 3} \%$ vs. 19$^{\pm 2} \%$). Within the gas-poor subsample,
galaxies with TFs have higher stellar and halo masses, $\sim 3\times$ closer
distances to nearest neighbors (in the same group), and possibly fewer group
members at fixed halo mass than galaxies without TFs, but similar specific star
formation rates. These results suggest TFs in gas-poor galaxies are typically
streams/shells from dry mergers or satellite disruption. In contrast, the
presence of TFs around gas-rich galaxies does not correlate with stellar or
halo mass, suggesting these TFs are often tails/arms from resonant
interactions. Similar to TFs in gas-poor galaxies, TFs in gas-rich galaxies
imply 1.7x closer nearest neighbors in the same group; however, TFs in gas-rich
galaxies are associated with diskier morphologies, higher star formation rates,
and higher gas content. In addition to interactions with known neighbors, we
suggest that TFs in gas-rich galaxies may arise from accretion of cosmic gas
and/or gas-rich satellites below the survey limit.
|
astro-ph.GA
|
we study tidal features tfs around galaxies in the resolved spectroscopy of a local volume resolve survey our sample consists of 1048 resolve galaxies that overlap with the decam legacy survey which reaches an rband 3sigma depth of sim279 mag arcsec2 for a 100 arcsec2 feature images were masked smoothed and inspected for tfs like streams shells or tailsarms we find tfs in 17pm 2 of our galaxies setting a lower limit on the true frequency the frequency of tfs in the gaspoor gastostellar mass ratio 01 subsample is lower than in the gasrich subsample 13pm 3 vs 19pm 2 within the gaspoor subsample galaxies with tfs have higher stellar and halo masses sim 3times closer distances to nearest neighbors in the same group and possibly fewer group members at fixed halo mass than galaxies without tfs but similar specific star formation rates these results suggest tfs in gaspoor galaxies are typically streamsshells from dry mergers or satellite disruption in contrast the presence of tfs around gasrich galaxies does not correlate with stellar or halo mass suggesting these tfs are often tailsarms from resonant interactions similar to tfs in gaspoor galaxies tfs in gasrich galaxies imply 17x closer nearest neighbors in the same group however tfs in gasrich galaxies are associated with diskier morphologies higher star formation rates and higher gas content in addition to interactions with known neighbors we suggest that tfs in gasrich galaxies may arise from accretion of cosmic gas andor gasrich satellites below the survey limit
|
[['we', 'study', 'tidal', 'features', 'tfs', 'around', 'galaxies', 'in', 'the', 'resolved', 'spectroscopy', 'of', 'a', 'local', 'volume', 'resolve', 'survey', 'our', 'sample', 'consists', 'of', '1048', 'resolve', 'galaxies', 'that', 'overlap', 'with', 'the', 'decam', 'legacy', 'survey', 'which', 'reaches', 'an', 'rband', '3sigma', 'depth', 'of', 'sim279', 'mag', 'arcsec2', 'for', 'a', '100', 'arcsec2', 'feature', 'images', 'were', 'masked', 'smoothed', 'and', 'inspected', 'for', 'tfs', 'like', 'streams', 'shells', 'or', 'tailsarms', 'we', 'find', 'tfs', 'in', '17pm', '2', 'of', 'our', 'galaxies', 'setting', 'a', 'lower', 'limit', 'on', 'the', 'true', 'frequency', 'the', 'frequency', 'of', 'tfs', 'in', 'the', 'gaspoor', 'gastostellar', 'mass', 'ratio', '01', 'subsample', 'is', 'lower', 'than', 'in', 'the', 'gasrich', 'subsample', '13pm', '3', 'vs', '19pm', '2', 'within', 'the', 'gaspoor', 'subsample', 'galaxies', 'with', 'tfs', 'have', 'higher', 'stellar', 'and', 'halo', 'masses', 'sim', '3times', 'closer', 'distances', 'to', 'nearest', 'neighbors', 'in', 'the', 'same', 'group', 'and', 'possibly', 'fewer', 'group', 'members', 'at', 'fixed', 'halo', 'mass', 'than', 'galaxies', 'without', 'tfs', 'but', 'similar', 'specific', 'star', 'formation', 'rates', 'these', 'results', 'suggest', 'tfs', 'in', 'gaspoor', 'galaxies', 'are', 'typically', 'streamsshells', 'from', 'dry', 'mergers', 'or', 'satellite', 'disruption', 'in', 'contrast', 'the', 'presence', 'of', 'tfs', 'around', 'gasrich', 'galaxies', 'does', 'not', 'correlate', 'with', 'stellar', 'or', 'halo', 'mass', 'suggesting', 'these', 'tfs', 'are', 'often', 'tailsarms', 'from', 'resonant', 'interactions', 'similar', 'to', 'tfs', 'in', 'gaspoor', 'galaxies', 'tfs', 'in', 'gasrich', 'galaxies', 'imply', '17x', 'closer', 'nearest', 'neighbors', 'in', 'the', 'same', 'group', 'however', 'tfs', 'in', 'gasrich', 'galaxies', 'are', 'associated', 'with', 'diskier', 'morphologies', 'higher', 'star', 'formation', 'rates', 'and', 'higher', 'gas', 'content', 'in', 'addition', 'to', 'interactions', 'with', 'known', 'neighbors', 'we', 'suggest', 'that', 'tfs', 'in', 'gasrich', 'galaxies', 'may', 'arise', 'from', 'accretion', 'of', 'cosmic', 'gas', 'andor', 'gasrich', 'satellites', 'below', 'the', 'survey', 'limit']]
|
[-0.07191853135837455, 0.10739208118498138, 0.004830824941438358, 0.14614001455824685, -0.0793142806657219, -0.035573267073150935, 0.0813935411842237, 0.46952106487157386, -0.07553224311384364, -0.3589504728305752, -0.001263990072151116, -0.3423802492178492, -0.05455174981578579, 0.15438523562080833, -0.03368362248591261, -0.0985709206585697, 0.05077358828365379, -0.10313690113418592, -0.05570259447042959, -0.33211826359449953, 0.29678070491437264, 0.05430503812716986, 0.13163290065486075, -0.12036939040848577, 0.033219153445241956, -0.10019235149200066, -0.09049904978137494, -0.0874140794441952, -0.1683860572334308, -0.004808267721739135, 0.30512029046869016, 0.05517119907100147, 0.28188956483093097, -0.3725169136611462, -0.14943595236258173, 0.09062085237318074, 0.2781713854491226, 0.04292550399223706, -0.10330126209447645, -0.28139853810160836, 0.08407950198147218, -0.1755961914039482, -0.1299684524225692, 0.08953296934156035, 0.030091364311936455, 0.06040068688978464, -0.2115978750379423, 0.2726191858632293, 0.02807524883305669, 0.1127469814316241, -0.12665071021632965, -0.1196955439305251, -0.08900879032728148, 0.09312728238651695, -0.00024554004411902125, 0.09557196427026869, 0.29019418413319237, -0.17776234916551417, 0.027876418119871883, 0.42482854323168245, -0.017854541775460992, -0.001976074964163931, 0.31067090625761123, -0.27893930921005466, -0.19359211917593697, 0.14083451055779644, 0.17585552910688745, 0.08181183530316817, -0.14206438313893277, -0.05620848113193926, -0.0031321203597344275, 0.2597707758763638, 0.09430728707702951, 0.05818740002161679, 0.323056562544354, 0.08244974192845203, 0.08301689905186403, 0.024479320221457525, -0.17080077432532326, -0.005926913384450372, -0.14373348953156936, -0.07250156337811756, -0.1424035020943966, 0.0840198210151549, -0.17755458976413743, -0.042226293485808544, 0.26898546865762674, 0.06827393591225789, 0.2823115635305507, 0.1255631655221805, 0.25545932691519685, 0.027133654139564957, 0.220648588729091, 0.12219249644710463, 0.29182892426946844, 0.12944846579803124, -0.02749717791992565, -0.22966120409357127, 0.06793557320403434, -0.012966883936669768]
|
1,803.05448
|
Did ASAS-SN Kill the Supermassive Black Hole Binary Candidate
PG1302-102?
|
Graham et al. (2015a) reported a periodically varying quasar and supermassive
black hole binary candidate, PG1302-102 (hereafter PG1302), which was
discovered in the Catalina Real-Time Transient Survey (CRTS). Its combined
Lincoln Near-Earth Asteroid Research (LINEAR) and CRTS optical light curve is
well fitted to a sinusoid of an observed period of $\approx 1,884$ days and
well modeled by the relativistic Doppler boosting of the secondary mini-disk
(D'Orazio et al. 2015). However, the LINEAR+CRTS light curve from MJD $\approx
52700$ to MJD $\approx 56400$ covers only $\sim 2$ cycles of periodic
variation, which is a short baseline that can be highly susceptible to normal,
stochastic quasar variability (Vaughan et al. 2016). In this Letter, we present
a re-analysis of PG1302, using the latest light curve from the All-Sky
Automated Survey for Supernovae (ASAS-SN), which extends the observational
baseline to the present day (MJD $\approx 58200$), and adopting a maximum
likelihood method which searches for a periodic component in addition to
stochastic quasar variability. When the ASAS-SN data are combined with the
previous LINEAR+CRTS data, the evidence for periodicity decreases. For genuine
periodicity one would expect that additional data would strengthen the
evidence, so the decrease in significance may be an indication that the binary
model is disfavored.
|
astro-ph.HE
|
graham et al 2015a reported a periodically varying quasar and supermassive black hole binary candidate pg1302102 hereafter pg1302 which was discovered in the catalina realtime transient survey crts its combined lincoln nearearth asteroid research linear and crts optical light curve is well fitted to a sinusoid of an observed period of approx 1884 days and well modeled by the relativistic doppler boosting of the secondary minidisk dorazio et al 2015 however the linearcrts light curve from mjd approx 52700 to mjd approx 56400 covers only sim 2 cycles of periodic variation which is a short baseline that can be highly susceptible to normal stochastic quasar variability vaughan et al 2016 in this letter we present a reanalysis of pg1302 using the latest light curve from the allsky automated survey for supernovae asassn which extends the observational baseline to the present day mjd approx 58200 and adopting a maximum likelihood method which searches for a periodic component in addition to stochastic quasar variability when the asassn data are combined with the previous linearcrts data the evidence for periodicity decreases for genuine periodicity one would expect that additional data would strengthen the evidence so the decrease in significance may be an indication that the binary model is disfavored
|
[['graham', 'et', 'al', '2015a', 'reported', 'a', 'periodically', 'varying', 'quasar', 'and', 'supermassive', 'black', 'hole', 'binary', 'candidate', 'pg1302102', 'hereafter', 'pg1302', 'which', 'was', 'discovered', 'in', 'the', 'catalina', 'realtime', 'transient', 'survey', 'crts', 'its', 'combined', 'lincoln', 'nearearth', 'asteroid', 'research', 'linear', 'and', 'crts', 'optical', 'light', 'curve', 'is', 'well', 'fitted', 'to', 'a', 'sinusoid', 'of', 'an', 'observed', 'period', 'of', 'approx', '1884', 'days', 'and', 'well', 'modeled', 'by', 'the', 'relativistic', 'doppler', 'boosting', 'of', 'the', 'secondary', 'minidisk', 'dorazio', 'et', 'al', '2015', 'however', 'the', 'linearcrts', 'light', 'curve', 'from', 'mjd', 'approx', '52700', 'to', 'mjd', 'approx', '56400', 'covers', 'only', 'sim', '2', 'cycles', 'of', 'periodic', 'variation', 'which', 'is', 'a', 'short', 'baseline', 'that', 'can', 'be', 'highly', 'susceptible', 'to', 'normal', 'stochastic', 'quasar', 'variability', 'vaughan', 'et', 'al', '2016', 'in', 'this', 'letter', 'we', 'present', 'a', 'reanalysis', 'of', 'pg1302', 'using', 'the', 'latest', 'light', 'curve', 'from', 'the', 'allsky', 'automated', 'survey', 'for', 'supernovae', 'asassn', 'which', 'extends', 'the', 'observational', 'baseline', 'to', 'the', 'present', 'day', 'mjd', 'approx', '58200', 'and', 'adopting', 'a', 'maximum', 'likelihood', 'method', 'which', 'searches', 'for', 'a', 'periodic', 'component', 'in', 'addition', 'to', 'stochastic', 'quasar', 'variability', 'when', 'the', 'asassn', 'data', 'are', 'combined', 'with', 'the', 'previous', 'linearcrts', 'data', 'the', 'evidence', 'for', 'periodicity', 'decreases', 'for', 'genuine', 'periodicity', 'one', 'would', 'expect', 'that', 'additional', 'data', 'would', 'strengthen', 'the', 'evidence', 'so', 'the', 'decrease', 'in', 'significance', 'may', 'be', 'an', 'indication', 'that', 'the', 'binary', 'model', 'is', 'disfavored']]
|
[-0.09940634881611914, 0.10622046696735196, -0.08536761329742149, 0.06885534824687056, -0.15759914598427713, -0.12748576797777786, 0.10508955288678408, 0.36298298380337657, -0.19768913014326245, -0.358650501613738, 0.1305436600325629, -0.3378816983802244, -0.1081916475854814, 0.25380669281235896, -0.11892675877174043, 0.02077845986437751, 0.10337650484638289, -0.10330159826902673, -0.015191078408097382, -0.2859010067861527, 0.18347308853175492, 0.1213899679435417, 0.18431442816188792, -0.050932915286393834, 0.06694667314353865, 0.024091684273444117, -0.09873809046999668, -0.01485353627242148, -0.11020931627306708, 0.023383665826404467, 0.2161275340465363, 0.1538109801779501, 0.19429470734205098, -0.30089944903505966, -0.23111749491596129, 0.09927023789845407, 0.13873292424395914, 0.07619677524140571, -0.02686154558788985, -0.3019830751942936, 0.03204717842047103, -0.21362541073933244, -0.16453819113550708, 0.0322957347240299, 0.11420652917819098, 0.034759525737135845, -0.2512913121422753, 0.13776749581680633, 0.054529670445481314, 0.1142471623281017, -0.09787487229623366, -0.08207237101392821, -0.038211377277038994, 0.01204038039970328, 0.028773803213844075, 0.13313100493236563, 0.06631080193139496, -0.05619138286449015, -0.11763033870985964, 0.339879806782119, -0.10353905163006857, 0.06372869462706149, 0.1400380643818062, -0.12906565888551996, -0.1780642565700691, 0.1554441762145143, 0.18521547661628573, 0.10186345535912551, -0.17740899217467812, -0.001739231861429289, -0.040053519832436, 0.25447117392672225, 0.06233183848438784, -0.01790296863997355, 0.2842300868825987, 0.13850342576683033, 0.0011592057545203715, 0.08355840898817406, -0.23324585903785192, -0.015518864553596358, -0.23506517617963255, -0.04943759008077905, -0.13662883545737714, 0.0918173336496693, -0.0724491426788154, -0.11716501678340137, 0.37844380090013147, 0.11184690273890738, 0.21486268273321912, 0.027969180372310803, 0.2540134667069651, 0.09255645807788823, 0.0427488503044151, 0.1261760945688002, 0.34721797827980483, 0.08975634131929837, 0.14488919109513518, -0.1845706513512414, 0.07626469609327614, 0.008747546083759517]
|
1,803.05449
|
SentEval: An Evaluation Toolkit for Universal Sentence Representations
|
We introduce SentEval, a toolkit for evaluating the quality of universal
sentence representations. SentEval encompasses a variety of tasks, including
binary and multi-class classification, natural language inference and sentence
similarity. The set of tasks was selected based on what appears to be the
community consensus regarding the appropriate evaluations for universal
sentence representations. The toolkit comes with scripts to download and
preprocess datasets, and an easy interface to evaluate sentence encoders. The
aim is to provide a fairer, less cumbersome and more centralized way for
evaluating sentence representations.
|
cs.CL
|
we introduce senteval a toolkit for evaluating the quality of universal sentence representations senteval encompasses a variety of tasks including binary and multiclass classification natural language inference and sentence similarity the set of tasks was selected based on what appears to be the community consensus regarding the appropriate evaluations for universal sentence representations the toolkit comes with scripts to download and preprocess datasets and an easy interface to evaluate sentence encoders the aim is to provide a fairer less cumbersome and more centralized way for evaluating sentence representations
|
[['we', 'introduce', 'senteval', 'a', 'toolkit', 'for', 'evaluating', 'the', 'quality', 'of', 'universal', 'sentence', 'representations', 'senteval', 'encompasses', 'a', 'variety', 'of', 'tasks', 'including', 'binary', 'and', 'multiclass', 'classification', 'natural', 'language', 'inference', 'and', 'sentence', 'similarity', 'the', 'set', 'of', 'tasks', 'was', 'selected', 'based', 'on', 'what', 'appears', 'to', 'be', 'the', 'community', 'consensus', 'regarding', 'the', 'appropriate', 'evaluations', 'for', 'universal', 'sentence', 'representations', 'the', 'toolkit', 'comes', 'with', 'scripts', 'to', 'download', 'and', 'preprocess', 'datasets', 'and', 'an', 'easy', 'interface', 'to', 'evaluate', 'sentence', 'encoders', 'the', 'aim', 'is', 'to', 'provide', 'a', 'fairer', 'less', 'cumbersome', 'and', 'more', 'centralized', 'way', 'for', 'evaluating', 'sentence', 'representations']]
|
[-0.061251737371838484, -0.04285084524053673, -0.07389411291065202, 0.13890224863081874, -0.21564686902142552, -0.1965092055615969, 0.0726753609699451, 0.4633325699039481, -0.2587829376253384, -0.31072119451974606, 0.04099867264316841, -0.26842728904871777, -0.10903915640136058, 0.21912852048461157, -0.10764801257226447, 0.10310947081201118, 0.14235159301262518, 0.11018058113437622, -0.07059983543480154, -0.31631240592502186, 0.34467161721012085, 0.07106247538997029, 0.33930319331755693, 0.03400490571617742, 0.1341432533808984, -0.029999111382163723, -0.06305500952558676, -0.07258237242405646, -0.06650387761394748, 0.18811656216646291, 0.4044049182398753, 0.283315985204271, 0.2840231239335315, -0.34377542343413964, -0.13492240106940948, 0.046983225059441545, 0.12024003973188387, 0.11751522380340744, 0.01150966156323689, -0.33936985692972405, 0.12257639635274907, -0.1820089599032971, 0.09404020246107724, -0.1676819771364535, 0.03640614433044737, -0.05171302670020272, -0.2651981194331628, -0.009463763414797459, 0.09500803685725921, 0.11319120438896459, -0.03022652127864686, -0.10901151783235202, 0.050519954987314784, 0.2026847855463116, 0.03504872390608811, 0.1280095089552395, 0.1418082658995197, -0.19815612360972326, -0.17889366259756076, 0.4441846960372376, -0.02340476661497219, -0.2282778093295664, 0.21602900178351608, 0.014912705318155613, -0.16703445416748186, 0.052265040613499215, 0.21975284521150487, 0.09198432540341112, -0.2004066524624994, 0.020268163058393508, -0.03617637398102405, 0.22914201459471686, 0.08555032214975324, -0.04267045427927356, 0.18456294243647295, 0.23797763399356467, -0.019477120791138572, 0.20403512107904218, -0.03897287014776587, -0.03541938932506706, -0.22488019391047684, -0.17532472817269576, -0.15169486272762614, -0.047062240138819274, -0.11868758549016176, -0.19391572249746372, 0.3971799591302194, 0.20440073928330094, 0.163663341245741, 0.1764813966900957, 0.30124248373745516, 0.03396492214381975, 0.09839449662831612, 0.11397845289585265, 0.05174367457882247, 0.02520256689537994, 0.09411966261475092, -0.11275882553838362, 0.10905159031972289, 0.0736969411902299]
|
1,803.0545
|
Probing the nature of Dark Matter through the metal enrichment of the
intergalactic medium
|
We focus on exploring the metal enrichment of the intergalactic medium (IGM)
in Cold and Warm (1.5 and 3 keV) Dark Matter (DM) cosmologies, and the
constraints this yields on the DM particle mass, using a semi-analytic model,
Delphi, that jointly tracks the Dark Matter and baryonic assembly of galaxies
at $z \simeq 4-20$ including both Supernova and (a range of) reionization
feedback (models). We find that while ${\rm M_{UV}} \geq -15$ galaxies
contribute half of all IGM metals in the Cold Dark Matter model by $z \simeq
4.5$, given the suppression of low-mass halos, larger halos with ${\rm M_{UV}}
\leq -15$ provide about 80\% of the IGM metal budget in 1.5 keV Warm Dark
Matter models using two different models for the metallicity of the
interstellar medium. Our results also show that the only models compatible with
two different high-redshift data sets, provided by the evolving Ultra-Violet
luminosity function at $z \simeq 6-10$ and IGM metal density (e.g. Simcoe et
al. 2011), are standard Cold Dark Matter and 3 keV Warm DM that do not include
any reionization feedback; a combination of the UV LF and the Diaz et al.
(2016) points provides a weaker constraint, allowing Cold and 3 keV and 1.5 keV
Warm DM models with SN feedback only, as well as CDM with complete gas
suppression of all halos with $v_{circ} \leq 30\, {\rm km\, s^{-1}}$.
Tightening the error bars on the IGM metal enrichment, future observations, at
$z \geq 5.5$, could therefore represent an alternative way of shedding light on
the nature of Dark Matter.
|
astro-ph.GA
|
we focus on exploring the metal enrichment of the intergalactic medium igm in cold and warm 15 and 3 kev dark matter dm cosmologies and the constraints this yields on the dm particle mass using a semianalytic model delphi that jointly tracks the dark matter and baryonic assembly of galaxies at z simeq 420 including both supernova and a range of reionization feedback models we find that while rm m_uv geq 15 galaxies contribute half of all igm metals in the cold dark matter model by z simeq 45 given the suppression of lowmass halos larger halos with rm m_uv leq 15 provide about 80 of the igm metal budget in 15 kev warm dark matter models using two different models for the metallicity of the interstellar medium our results also show that the only models compatible with two different highredshift data sets provided by the evolving ultraviolet luminosity function at z simeq 610 and igm metal density eg simcoe et al 2011 are standard cold dark matter and 3 kev warm dm that do not include any reionization feedback a combination of the uv lf and the diaz et al 2016 points provides a weaker constraint allowing cold and 3 kev and 15 kev warm dm models with sn feedback only as well as cdm with complete gas suppression of all halos with v_circ leq 30 rm km s1 tightening the error bars on the igm metal enrichment future observations at z geq 55 could therefore represent an alternative way of shedding light on the nature of dark matter
|
[['we', 'focus', 'on', 'exploring', 'the', 'metal', 'enrichment', 'of', 'the', 'intergalactic', 'medium', 'igm', 'in', 'cold', 'and', 'warm', '15', 'and', '3', 'kev', 'dark', 'matter', 'dm', 'cosmologies', 'and', 'the', 'constraints', 'this', 'yields', 'on', 'the', 'dm', 'particle', 'mass', 'using', 'a', 'semianalytic', 'model', 'delphi', 'that', 'jointly', 'tracks', 'the', 'dark', 'matter', 'and', 'baryonic', 'assembly', 'of', 'galaxies', 'at', 'z', 'simeq', '420', 'including', 'both', 'supernova', 'and', 'a', 'range', 'of', 'reionization', 'feedback', 'models', 'we', 'find', 'that', 'while', 'rm', 'm_uv', 'geq', '15', 'galaxies', 'contribute', 'half', 'of', 'all', 'igm', 'metals', 'in', 'the', 'cold', 'dark', 'matter', 'model', 'by', 'z', 'simeq', '45', 'given', 'the', 'suppression', 'of', 'lowmass', 'halos', 'larger', 'halos', 'with', 'rm', 'm_uv', 'leq', '15', 'provide', 'about', '80', 'of', 'the', 'igm', 'metal', 'budget', 'in', '15', 'kev', 'warm', 'dark', 'matter', 'models', 'using', 'two', 'different', 'models', 'for', 'the', 'metallicity', 'of', 'the', 'interstellar', 'medium', 'our', 'results', 'also', 'show', 'that', 'the', 'only', 'models', 'compatible', 'with', 'two', 'different', 'highredshift', 'data', 'sets', 'provided', 'by', 'the', 'evolving', 'ultraviolet', 'luminosity', 'function', 'at', 'z', 'simeq', '610', 'and', 'igm', 'metal', 'density', 'eg', 'simcoe', 'et', 'al', '2011', 'are', 'standard', 'cold', 'dark', 'matter', 'and', '3', 'kev', 'warm', 'dm', 'that', 'do', 'not', 'include', 'any', 'reionization', 'feedback', 'a', 'combination', 'of', 'the', 'uv', 'lf', 'and', 'the', 'diaz', 'et', 'al', '2016', 'points', 'provides', 'a', 'weaker', 'constraint', 'allowing', 'cold', 'and', '3', 'kev', 'and', '15', 'kev', 'warm', 'dm', 'models', 'with', 'sn', 'feedback', 'only', 'as', 'well', 'as', 'cdm', 'with', 'complete', 'gas', 'suppression', 'of', 'all', 'halos', 'with', 'v_circ', 'leq', '30', 'rm', 'km', 's1', 'tightening', 'the', 'error', 'bars', 'on', 'the', 'igm', 'metal', 'enrichment', 'future', 'observations', 'at', 'z', 'geq', '55', 'could', 'therefore', 'represent', 'an', 'alternative', 'way', 'of', 'shedding', 'light', 'on', 'the', 'nature', 'of', 'dark', 'matter']]
|
[-0.04123654948865715, 0.1831846400807386, -0.031734156223646864, 0.10742481113420475, -0.08348358790821694, -0.09748772977631985, 0.02909697134687806, 0.392992249132641, -0.13006760290928157, -0.4269584059377262, -0.004716078734158405, -0.3225505231164079, 0.055141886020201515, 0.16846329633831533, 0.06476225746745193, -0.04123475595712698, -0.035610395760102824, -0.12959842548180195, -0.041832454812723754, -0.3380653640658965, 0.2740306386797829, 0.08618162625422521, 0.13199781638688793, 0.00922512706426695, 0.09121786969561943, -0.08674063162453846, -0.09042219694301083, -0.09196123096985837, -0.21010318000326256, -0.012300740699009596, 0.20389163934360324, 0.1293626496112999, 0.20683268848698744, -0.36274227698856754, -0.2559208953860989, 0.1461884172859828, 0.1756984303544368, 0.0337743898417664, -0.1038703989708602, -0.2882854434855743, 0.06529813178236916, -0.20966556143468698, -0.10236496278570253, 0.08256194960509344, -0.0011089855272855078, -0.01613156569278, -0.2266660477160602, 0.18909845299356703, -0.0018456838714879394, 0.0057430579345026074, -0.06469431108863427, -0.15234095115406965, -0.06574427040696547, -0.0645755430338293, -0.0342023319422724, 0.0665721263858745, 0.2503926476219158, -0.19350578928632395, 0.008730608852163072, 0.43530480507185904, -0.12562089269391072, 0.03354257370010881, 0.22612659107627614, -0.17434276313193747, -0.1513439765178444, 0.15444169780706923, 0.1322838414161966, 0.03994789799229461, -0.10970542982084008, 0.09336736022438998, -0.06801462517898443, 0.25983169853227017, 0.04444990672250224, 0.037470123039664835, 0.33441663958837053, 0.13705513066824337, 0.03634846215064432, -0.038148678022052046, -0.12513621058135246, 0.03607094299345292, -0.2870005870990376, -0.11611346145791791, -0.07820252263037539, 0.07336440840094399, -0.16890736957092797, -0.059714010287378286, 0.30204310588732824, 0.1233821752495546, 0.27027235436612834, 0.07231867210004608, 0.32499716336871265, 0.04052793252565916, 0.0018988699961496826, 0.140148894266229, 0.28595989627195484, 0.19493298908843007, 0.09047178481076215, -0.1993588619662312, -0.0085036582852854, -0.041431217618658776]
|
1,803.05451
|
Dynamics of Majorana-based qubits operated with an array of tunable
gates
|
We study the dynamics of Majorana zero modes that are shuttled via local
tuning of the electrochemical potential in a superconducting wire. By
performing time-dependent simulations of microscopic lattice models, we show
that diabatic corrections associated with the moving Majorana modes are
quantitatively captured by a simple Landau-Zener description. We further
simulate a Rabi-oscillation protocol in a specific qubit design with four
Majorana zero modes in a single wire and quantify constraints on the timescales
for performing qubit operations in this setup. Our simulations utilize a
Majorana representation of the system, which greatly simplifies simulations of
superconductors at the mean-field level.
|
cond-mat.mes-hall
|
we study the dynamics of majorana zero modes that are shuttled via local tuning of the electrochemical potential in a superconducting wire by performing timedependent simulations of microscopic lattice models we show that diabatic corrections associated with the moving majorana modes are quantitatively captured by a simple landauzener description we further simulate a rabioscillation protocol in a specific qubit design with four majorana zero modes in a single wire and quantify constraints on the timescales for performing qubit operations in this setup our simulations utilize a majorana representation of the system which greatly simplifies simulations of superconductors at the meanfield level
|
[['we', 'study', 'the', 'dynamics', 'of', 'majorana', 'zero', 'modes', 'that', 'are', 'shuttled', 'via', 'local', 'tuning', 'of', 'the', 'electrochemical', 'potential', 'in', 'a', 'superconducting', 'wire', 'by', 'performing', 'timedependent', 'simulations', 'of', 'microscopic', 'lattice', 'models', 'we', 'show', 'that', 'diabatic', 'corrections', 'associated', 'with', 'the', 'moving', 'majorana', 'modes', 'are', 'quantitatively', 'captured', 'by', 'a', 'simple', 'landauzener', 'description', 'we', 'further', 'simulate', 'a', 'rabioscillation', 'protocol', 'in', 'a', 'specific', 'qubit', 'design', 'with', 'four', 'majorana', 'zero', 'modes', 'in', 'a', 'single', 'wire', 'and', 'quantify', 'constraints', 'on', 'the', 'timescales', 'for', 'performing', 'qubit', 'operations', 'in', 'this', 'setup', 'our', 'simulations', 'utilize', 'a', 'majorana', 'representation', 'of', 'the', 'system', 'which', 'greatly', 'simplifies', 'simulations', 'of', 'superconductors', 'at', 'the', 'meanfield', 'level']]
|
[-0.19388464945230152, 0.20524322652110444, -0.07663016468557382, 0.02179479910093037, 0.018148094701516158, -0.21963940600468085, 0.12083775184139157, 0.3452179176769782, -0.21286942516130827, -0.2777208199189736, -0.0021246131279017075, -0.25070549555971183, -0.12810145776562099, 0.20275948558113363, 0.027303934982507536, 0.05965727894096681, 0.10495039848334128, -0.006213557964080189, -0.11603253631216318, -0.20633345667162153, 0.29959023009183455, 0.04258268063952501, 0.2865034471459613, 0.013767134186138612, 0.04623417678579578, -0.0018693607572539902, 0.0440538169004687, -0.023063832875525596, -0.14164362069623346, 0.05283609205986013, 0.21158992017016057, -0.010484847567496028, 0.21927344243936608, -0.5211230560694591, -0.2308348996984302, 0.03477347612215003, 0.16457167526909916, 0.18877003061940137, -0.03129672859380446, -0.3073231161083325, 0.04335624898442685, -0.19222410750750563, -0.1157367696183374, -0.12054303249731513, -0.056468017867277606, -0.020813292300439264, -0.2511370961167066, 0.06600918322063909, 0.009641211507565315, 0.06315836909752671, -0.015540242540917478, -0.017784494527449627, -0.012711023056584567, 0.08911437800011164, -0.02779361416296434, -0.03177237923062259, 0.17254907167562755, -0.12193593170521504, -0.166187540328333, 0.3403497015720805, -0.08185216204244827, -0.21643553312987754, 0.17824885803781967, -0.11963542677591195, -0.07636031324025427, 0.09877697800719502, 0.12032368360087276, 0.0810006839767246, -0.1581326470535138, 0.0739847398495606, -0.014381114172168297, 0.16164982400023112, 0.004861851976631154, 0.04384056072091997, 0.25470983109778106, 0.22958978336525732, 0.033704924858221325, 0.12542885221946654, -0.09494472802028817, -0.09551726738083186, -0.32613199321313363, -0.14337300053926758, -0.2228805874059401, 0.030771879647572588, -0.04086856704449055, -0.1542811135918197, 0.4780423659370235, 0.1578296129477941, 0.1674221307592522, 0.021111489413075592, 0.30073019072856055, 0.1315768154644601, 0.07348026132377067, 0.023614879629844432, 0.2225182617024408, 0.15104850117891733, 0.05043324050816274, -0.36443168448634666, -0.029584405512668856, 0.0345271230919637]
|
1,803.05452
|
Heterotic and bosonic string amplitudes via field theory
|
Previous work has shown that massless tree amplitudes of the type I and IIA/B
superstrings can be dramatically simplified by expressing them as double copies
between field-theory amplitudes and scalar disk/sphere integrals, the latter
containing all the $\alpha'$-corrections. In this work, we pinpoint similar
double-copy constructions for the heterotic and bosonic string theories using
an $\alpha'$-dependent field theory and the same disk/sphere integrals.
Surprisingly, this field theory, built out of dimension-six operators such as
$(D_\mu F^{\mu \nu})^2$, has previously appeared in the double-copy
construction of conformal supergravity. We elaborate on the $\alpha'
\rightarrow \infty$ limit in this picture and derive new amplitude relations
for various gauge-gravity theories from those of the heterotic string.
|
hep-th
|
previous work has shown that massless tree amplitudes of the type i and iiab superstrings can be dramatically simplified by expressing them as double copies between fieldtheory amplitudes and scalar disksphere integrals the latter containing all the alphacorrections in this work we pinpoint similar doublecopy constructions for the heterotic and bosonic string theories using an alphadependent field theory and the same disksphere integrals surprisingly this field theory built out of dimensionsix operators such as d_mu fmu nu2 has previously appeared in the doublecopy construction of conformal supergravity we elaborate on the alpha rightarrow infty limit in this picture and derive new amplitude relations for various gaugegravity theories from those of the heterotic string
|
[['previous', 'work', 'has', 'shown', 'that', 'massless', 'tree', 'amplitudes', 'of', 'the', 'type', 'i', 'and', 'iiab', 'superstrings', 'can', 'be', 'dramatically', 'simplified', 'by', 'expressing', 'them', 'as', 'double', 'copies', 'between', 'fieldtheory', 'amplitudes', 'and', 'scalar', 'disksphere', 'integrals', 'the', 'latter', 'containing', 'all', 'the', 'alphacorrections', 'in', 'this', 'work', 'we', 'pinpoint', 'similar', 'doublecopy', 'constructions', 'for', 'the', 'heterotic', 'and', 'bosonic', 'string', 'theories', 'using', 'an', 'alphadependent', 'field', 'theory', 'and', 'the', 'same', 'disksphere', 'integrals', 'surprisingly', 'this', 'field', 'theory', 'built', 'out', 'of', 'dimensionsix', 'operators', 'such', 'as', 'd_mu', 'fmu', 'nu2', 'has', 'previously', 'appeared', 'in', 'the', 'doublecopy', 'construction', 'of', 'conformal', 'supergravity', 'we', 'elaborate', 'on', 'the', 'alpha', 'rightarrow', 'infty', 'limit', 'in', 'this', 'picture', 'and', 'derive', 'new', 'amplitude', 'relations', 'for', 'various', 'gaugegravity', 'theories', 'from', 'those', 'of', 'the', 'heterotic', 'string']]
|
[-0.1315162572999427, 0.1784691300390719, -0.06648602805706152, 0.12829907100948512, -0.07460170208715496, -0.15307560118030658, 0.023395956895701522, 0.27043272270120483, -0.161700513825826, -0.24360148455387196, 0.030793839444373364, -0.2665801561155266, -0.1864410142653284, 0.13851900968445152, -0.04743140668863744, 0.02165193982686089, -0.03429798875416143, 0.06295018489843449, -0.09946089478640248, -0.2583775825188619, 0.3208002776434991, -0.009861575020271131, 0.26109103713415366, 0.030384641621814035, 0.04139138975559808, 0.023433793896594935, -0.03407841594271625, -0.027345619499230082, -0.16247946528370946, 0.09688858734237739, 0.2439944727193828, 0.09077136080909882, 0.07536414062884529, -0.45390316422006727, -0.20468852159426038, 0.07550505819046392, 0.22279054035465604, 0.15451093637425684, 0.05172992814682523, -0.29037579849560174, 0.024241878020585375, -0.18352610167668126, -0.15077080055494355, -0.10531917117140462, 0.03372116584899481, -0.07771500961265766, -0.22987059760731604, 0.0341010450022872, 0.028607849884712325, 0.04026641675880987, -0.02265812815125801, -0.12966721537893852, -0.024302904721786294, 0.07188318368970556, 0.12820261932880642, 0.10025618500405906, 0.08524933428940389, -0.18868321627666926, -0.18240724771337138, 0.30163593833804525, -0.08983709751545921, -0.19201485552223382, 0.13942456599201314, -0.13481522034142843, -0.23640605365132203, 0.08135679944632657, 0.04792594880821694, 0.1655661387830577, -0.17849180174876103, 0.2616135624450615, -0.040981490692469924, 0.08853016113779977, 0.1638834999592017, 0.07473769103613707, 0.22966573176806612, 0.07069632823916927, -0.02071000945978938, 0.11721241623225037, 0.007258820833496139, -0.10008610632946402, -0.42198290751703016, -0.10837630189329889, -0.07134339464848977, 0.1449717738237067, -0.13972303646642908, -0.18196066748428125, 0.3302034447381718, 0.1026690640558635, 0.1481433023690386, 0.09923869632369946, 0.18383266970482284, 0.15170792503276245, 0.11346660650013822, 0.01646935235939722, 0.24224944623698175, 0.18162253414346646, 0.08274751224048205, -0.20499024877069205, -0.12016175282641059, 0.2036163359179895]
|
1,803.05453
|
Using Ground-Based Telescopes to Mature Key Technologies and Advance
Science for Future NASA Exoplanet Direct Imaging Missions
|
Ground-based telescopes have been playing a leading role in exoplanet direct
imaging science and technological development for the past two decades and will
continue to have an indispensable role for the next decade and beyond. Extreme
adaptive optics (AO) systems will advance focal-plane wavefront control and
coronagraphy, augmenting the performance of and mitigating risk for WFIRST-CGI,
while validating performance requirements and motivating improvements to
atmosphere models needed to unambiguously characterize solar system-analogues
with HabEx/LUVOIR. Specialized instruments for Extremely Large Telescopes may
deliver the first thermal infrared images of rocky planets around Sun-like
stars, providing HabEx/LUVOIR with numerous exo-Earth candidates and key
ancillary information that can help clarify whether the planets are habitable.
|
astro-ph.IM astro-ph.EP
|
groundbased telescopes have been playing a leading role in exoplanet direct imaging science and technological development for the past two decades and will continue to have an indispensable role for the next decade and beyond extreme adaptive optics ao systems will advance focalplane wavefront control and coronagraphy augmenting the performance of and mitigating risk for wfirstcgi while validating performance requirements and motivating improvements to atmosphere models needed to unambiguously characterize solar systemanalogues with habexluvoir specialized instruments for extremely large telescopes may deliver the first thermal infrared images of rocky planets around sunlike stars providing habexluvoir with numerous exoearth candidates and key ancillary information that can help clarify whether the planets are habitable
|
[['groundbased', 'telescopes', 'have', 'been', 'playing', 'a', 'leading', 'role', 'in', 'exoplanet', 'direct', 'imaging', 'science', 'and', 'technological', 'development', 'for', 'the', 'past', 'two', 'decades', 'and', 'will', 'continue', 'to', 'have', 'an', 'indispensable', 'role', 'for', 'the', 'next', 'decade', 'and', 'beyond', 'extreme', 'adaptive', 'optics', 'ao', 'systems', 'will', 'advance', 'focalplane', 'wavefront', 'control', 'and', 'coronagraphy', 'augmenting', 'the', 'performance', 'of', 'and', 'mitigating', 'risk', 'for', 'wfirstcgi', 'while', 'validating', 'performance', 'requirements', 'and', 'motivating', 'improvements', 'to', 'atmosphere', 'models', 'needed', 'to', 'unambiguously', 'characterize', 'solar', 'systemanalogues', 'with', 'habexluvoir', 'specialized', 'instruments', 'for', 'extremely', 'large', 'telescopes', 'may', 'deliver', 'the', 'first', 'thermal', 'infrared', 'images', 'of', 'rocky', 'planets', 'around', 'sunlike', 'stars', 'providing', 'habexluvoir', 'with', 'numerous', 'exoearth', 'candidates', 'and', 'key', 'ancillary', 'information', 'that', 'can', 'help', 'clarify', 'whether', 'the', 'planets', 'are', 'habitable']]
|
[-0.07254123809193638, 0.12551335761911417, -0.046464233386523286, 0.06397714783848675, -0.1540861282631889, -0.11735243078002387, 0.007078827522393014, 0.3941915466508887, -0.16006306207713647, -0.3908705289920305, 0.18140755459007615, -0.2933333079783699, -0.13350091598558803, 0.29066064482898796, -0.13237421450347783, 0.12135513196594443, 0.17804818789197788, -0.09233162135120716, -0.0067931197453625835, -0.2954734582076403, 0.24050342062119026, 0.18982016842871033, 0.13474951978135216, -0.0049711801803897365, 0.037244407309068216, -0.0317928410546334, -0.07354668904985259, -0.05874066755200762, -0.1292359692169493, 0.11227496871137405, 0.38891170867069164, 0.16464177888046178, 0.33308747165253266, -0.4536433521624621, -0.24380229113136861, 0.09267561818968069, 0.16958705097990665, -0.013263709878817469, -0.08730750556968085, -0.2586389078678949, 0.030091416938146494, -0.14500296354998607, -0.18684394401707896, -0.08750053747297004, 0.023299157440133795, 0.007932127163397265, -0.2756797799353932, -0.062221942237695796, -0.00741129230942812, 0.13601995266130748, -0.08728216387969148, -0.1562624616665883, -0.010075269308914472, 0.21626164243548168, -0.02904526286534042, -0.0007154825237906865, 0.12379896373966255, -0.1857203249253232, -0.10899784015743313, 0.3722832477609585, -0.05760078111386581, -0.02423618592506459, 0.22054520635949532, -0.17810403703720318, -0.14855062039065603, 0.11816692957864353, 0.2040494506431928, 0.09084081700908624, -0.17666177288943752, 0.006402386082357282, 0.08365869769398626, 0.15943992751029631, 0.07215319404814828, 0.15198237414950053, 0.38128943876824806, 0.21407727553165173, 0.11597686155640462, 0.05062375963573252, -0.23009038248376265, -0.054178743470074224, -0.17121293229629864, -0.19690071112635704, -0.10565536759105755, 0.0013877934763661108, -0.052717151711689655, -0.08329761660813044, 0.31658441999398573, 0.24002586342163618, 0.042271219237984436, -0.020999403391452925, 0.3556958893397907, 0.010620942259593322, 0.14334350479934532, 0.02247364661312318, 0.37095321371295564, 0.09475235316717813, 0.15901531155579324, -0.19338629980412153, 0.0955571621689979, -0.028067408695917676]
|
1,803.05454
|
Homological criteria for minimal multiplicity
|
Lower bounds on Hilbert-Samuel multiplicity are known for several types of
commutative noetherian local rings, and rings with multiplicities which achieve
these lower bounds are said to have minimal multiplicity. The first part of
this paper gives characterizations of rings of minimal multiplicity in terms of
the Ext-algebra of the ring; in particular, we show that minimal multiplicity
can be detected via an Ext-algebra which is Gorenstein or Koszul AS-regular.
The second part of this paper characterizes rings of minimal multiplicity via a
numerical homological invariant introduced by J. Herzog and S. B. Iyengar
called linearity defect. Our characterizations allow us to answer in two
special cases a question raised by Herzog and Iyengar.
|
math.AC math.RA
|
lower bounds on hilbertsamuel multiplicity are known for several types of commutative noetherian local rings and rings with multiplicities which achieve these lower bounds are said to have minimal multiplicity the first part of this paper gives characterizations of rings of minimal multiplicity in terms of the extalgebra of the ring in particular we show that minimal multiplicity can be detected via an extalgebra which is gorenstein or koszul asregular the second part of this paper characterizes rings of minimal multiplicity via a numerical homological invariant introduced by j herzog and s b iyengar called linearity defect our characterizations allow us to answer in two special cases a question raised by herzog and iyengar
|
[['lower', 'bounds', 'on', 'hilbertsamuel', 'multiplicity', 'are', 'known', 'for', 'several', 'types', 'of', 'commutative', 'noetherian', 'local', 'rings', 'and', 'rings', 'with', 'multiplicities', 'which', 'achieve', 'these', 'lower', 'bounds', 'are', 'said', 'to', 'have', 'minimal', 'multiplicity', 'the', 'first', 'part', 'of', 'this', 'paper', 'gives', 'characterizations', 'of', 'rings', 'of', 'minimal', 'multiplicity', 'in', 'terms', 'of', 'the', 'extalgebra', 'of', 'the', 'ring', 'in', 'particular', 'we', 'show', 'that', 'minimal', 'multiplicity', 'can', 'be', 'detected', 'via', 'an', 'extalgebra', 'which', 'is', 'gorenstein', 'or', 'koszul', 'asregular', 'the', 'second', 'part', 'of', 'this', 'paper', 'characterizes', 'rings', 'of', 'minimal', 'multiplicity', 'via', 'a', 'numerical', 'homological', 'invariant', 'introduced', 'by', 'j', 'herzog', 'and', 's', 'b', 'iyengar', 'called', 'linearity', 'defect', 'our', 'characterizations', 'allow', 'us', 'to', 'answer', 'in', 'two', 'special', 'cases', 'a', 'question', 'raised', 'by', 'herzog', 'and', 'iyengar']]
|
[-0.18037692542400277, 0.029900644796725828, -0.07415622427013882, 0.08525797841853969, -0.05785894355524266, -0.17016213256130486, -0.07512528007939916, 0.28922267724645506, -0.3166963220165487, -0.25803608326404764, 0.09180595948495657, -0.22789450284101787, -0.09265922840169974, 0.18501228589070307, -0.18604166101533592, -0.013598833265796043, 0.03880270216368923, 0.07727571015385094, -0.0590216875415328, -0.35482503874064014, 0.38657310810920437, 0.05718007036321388, 0.16366918444589573, 0.120332420828115, 0.04262700395274646, 0.028951590954277077, -0.05619027805024464, 0.047408605181405154, -0.2622102666424772, 0.16272014133599505, 0.2991055875216006, 0.08398738904169907, 0.19141902904467364, -0.37140895152850517, -0.06312905061630565, 0.20581355755597255, 0.1435083120963291, -0.002130703965871873, -0.03144126384531295, -0.21919768762758426, 0.18768354835756645, -0.22875710190559753, -0.14900626332842207, -0.09649860612198449, 0.06058069891623107, 0.04201371620282564, -0.25708890618070174, 0.04345813420552172, 0.17408732213937728, 0.14198527078291304, -0.024127883468999675, -0.10115033962453406, -0.055695086303003655, 0.0321312562680983, -0.0025996051831817454, -0.037478650801635364, 0.0598204270282989, -0.06942166145247604, -0.19789194145746397, 0.2963315891918906, -0.040849995638015106, -0.18943475993358316, 0.1839069036211361, -0.20958068587800913, -0.13292464305107532, 0.12991966611579092, 0.05937763463640422, 0.1715416282725831, -0.08914266029176743, 0.17453100760886037, -0.19600853233255053, 0.06098720685399154, 0.16647949103233323, 0.083769488152476, 0.15505976804630145, 0.06415297319753129, 0.08207762285606454, 0.15600195238591386, -0.0012656561315484475, 0.012926533707956734, -0.32799460763405813, -0.21217157718676485, -0.13106323951414148, 0.10317767008305773, -0.04857244451998492, -0.1182319575598006, 0.4277819950264274, 0.08516972599828844, 0.21203671533434668, 0.08728833342371345, 0.2229334545636288, 0.043336849950719625, 0.04220215951959529, 0.05801226002375571, 0.1562596600800916, 0.2416884482862722, 0.022667142738212357, -0.1491810493970294, 0.02510392059686414, 0.21378211680750706]
|
1,803.05455
|
Deep JVLA Imaging of GOODS-N at 20cm
|
New wideband continuum observations in the 1 - 2 GHz band of the GOODS-N
field using NSF's Karl G. Jansky Very Large Array (VLA) are presented. The best
image with an effective frequency of 1525 MHz reaches an rms noise in the field
center of 2.2 uJy with 1.6" resolution. A catalog of 795 sources is presented
covering a radius of nine arcminutes centered near the nominal center for the
GOODS-N field, very near the nominal VLA pointing center for the observations.
Optical/NIR identifications and redshift estimates both from ground-based and
HST observations are discussed. Using these optical/NIR data, it is most likely
that fewer than 2 per cent of the sources without confusion problems do not
have a correct identification. A large subset of the detected sources have
radio sizes > 1". It is shown that the radio orientations for such sources
correlate well with the HST source orientations especially for z < 1. This
suggests that a least a large subset of the 10kpc-scale disks of LIRG/ULIRG
galaxies have strong star-formation, not just in the nucleus. For the half of
the objects with z > 1, the sample must be some mixture of very high
star-formation rates, typically 300 M_sun/yr assuming pure star-formation, and
an AGN or a mixed AGN/star-formation population.
|
astro-ph.GA
|
new wideband continuum observations in the 1 2 ghz band of the goodsn field using nsfs karl g jansky very large array vla are presented the best image with an effective frequency of 1525 mhz reaches an rms noise in the field center of 22 ujy with 16 resolution a catalog of 795 sources is presented covering a radius of nine arcminutes centered near the nominal center for the goodsn field very near the nominal vla pointing center for the observations opticalnir identifications and redshift estimates both from groundbased and hst observations are discussed using these opticalnir data it is most likely that fewer than 2 per cent of the sources without confusion problems do not have a correct identification a large subset of the detected sources have radio sizes 1 it is shown that the radio orientations for such sources correlate well with the hst source orientations especially for z 1 this suggests that a least a large subset of the 10kpcscale disks of lirgulirg galaxies have strong starformation not just in the nucleus for the half of the objects with z 1 the sample must be some mixture of very high starformation rates typically 300 m_sunyr assuming pure starformation and an agn or a mixed agnstarformation population
|
[['new', 'wideband', 'continuum', 'observations', 'in', 'the', '1', '2', 'ghz', 'band', 'of', 'the', 'goodsn', 'field', 'using', 'nsfs', 'karl', 'g', 'jansky', 'very', 'large', 'array', 'vla', 'are', 'presented', 'the', 'best', 'image', 'with', 'an', 'effective', 'frequency', 'of', '1525', 'mhz', 'reaches', 'an', 'rms', 'noise', 'in', 'the', 'field', 'center', 'of', '22', 'ujy', 'with', '16', 'resolution', 'a', 'catalog', 'of', '795', 'sources', 'is', 'presented', 'covering', 'a', 'radius', 'of', 'nine', 'arcminutes', 'centered', 'near', 'the', 'nominal', 'center', 'for', 'the', 'goodsn', 'field', 'very', 'near', 'the', 'nominal', 'vla', 'pointing', 'center', 'for', 'the', 'observations', 'opticalnir', 'identifications', 'and', 'redshift', 'estimates', 'both', 'from', 'groundbased', 'and', 'hst', 'observations', 'are', 'discussed', 'using', 'these', 'opticalnir', 'data', 'it', 'is', 'most', 'likely', 'that', 'fewer', 'than', '2', 'per', 'cent', 'of', 'the', 'sources', 'without', 'confusion', 'problems', 'do', 'not', 'have', 'a', 'correct', 'identification', 'a', 'large', 'subset', 'of', 'the', 'detected', 'sources', 'have', 'radio', 'sizes', '1', 'it', 'is', 'shown', 'that', 'the', 'radio', 'orientations', 'for', 'such', 'sources', 'correlate', 'well', 'with', 'the', 'hst', 'source', 'orientations', 'especially', 'for', 'z', '1', 'this', 'suggests', 'that', 'a', 'least', 'a', 'large', 'subset', 'of', 'the', '10kpcscale', 'disks', 'of', 'lirgulirg', 'galaxies', 'have', 'strong', 'starformation', 'not', 'just', 'in', 'the', 'nucleus', 'for', 'the', 'half', 'of', 'the', 'objects', 'with', 'z', '1', 'the', 'sample', 'must', 'be', 'some', 'mixture', 'of', 'very', 'high', 'starformation', 'rates', 'typically', '300', 'm_sunyr', 'assuming', 'pure', 'starformation', 'and', 'an', 'agn', 'or', 'a', 'mixed', 'agnstarformation', 'population']]
|
[-0.07560213368546526, 0.09141821107787286, -0.004390789277272896, 0.06394917191598493, -0.0792571044723657, -0.09718064526638505, 0.05291685984058541, 0.4727732302277412, -0.13822608485702625, -0.361682590626144, 0.15521439389965397, -0.3061610337174995, 0.006783999813476451, 0.20047891394458983, -0.030623829244292404, -0.04346601006143175, 0.07123377558535635, -0.06483099016008302, -0.028952636973504586, -0.24989565219436274, 0.24689473686242494, 0.10361448405491351, 0.2028346009489185, -0.04799181760852626, 0.11315878121311171, -0.09346595987252601, -0.07914580399559322, -0.006189343989691109, -0.09512853626897462, 0.053542784471697746, 0.2858799660320674, 0.12085648422418795, 0.2638977364008541, -0.3079987376049493, -0.18861636278915753, 0.07410508247648447, 0.13493358904950195, 0.053777057162115297, -0.03179915574406391, -0.2834075561824065, 0.1177303932033009, -0.15967326578051214, -0.16289657226877255, 0.09371586571203418, 0.046928557318079205, 0.04815478516331178, -0.21139173969757535, 0.09936503505543919, -0.029779864870151957, 0.13861598327159158, -0.12507181817968602, -0.16725486484853533, -0.024309730888525186, 0.08802063281769927, -0.03413642247465159, 0.1360469069444909, 0.13010836477635554, -0.18023700759072508, -0.056974134853254386, 0.36594899879198844, -0.04764881605674904, -0.0306292645701318, 0.2142685792291338, -0.243317991612678, -0.20940831761346063, 0.21306138213845965, 0.12366287639473104, 0.11020356105263028, -0.1436208789027748, 0.04483504513096634, -0.026897273179555075, 0.2904124846049015, 0.06199214918972942, 0.09348920918322955, 0.28839755773056047, 0.10067945395401923, 0.08719180592898623, 0.10040544984394287, -0.29128227417483854, 0.031096271013171927, -0.2921821921702149, -0.05456651462856861, -0.18431466733087395, 0.1242941646664053, -0.15768704203487818, -0.09479711464427082, 0.3409689818802787, 0.10179148573039588, 0.21215125538399715, 0.0853379306641127, 0.27269600043344555, 0.06426908107117289, 0.14546364657716482, 0.11891476572852908, 0.30807867641314907, 0.15207917501955537, 0.06368219000694242, -0.13297087507767746, -0.026217066655749258, -0.07035043378003412]
|
1,803.05456
|
Many associated primes of powers of primes
|
We construct families of prime ideals in polynomial rings for which the
number of associated primes of the second power (or higher powers) is
exponential in the number of variables in the ring. We give a lower bound on
the Ananyan-Hochster constant for the number of associated primes.
|
math.AC
|
we construct families of prime ideals in polynomial rings for which the number of associated primes of the second power or higher powers is exponential in the number of variables in the ring we give a lower bound on the ananyanhochster constant for the number of associated primes
|
[['we', 'construct', 'families', 'of', 'prime', 'ideals', 'in', 'polynomial', 'rings', 'for', 'which', 'the', 'number', 'of', 'associated', 'primes', 'of', 'the', 'second', 'power', 'or', 'higher', 'powers', 'is', 'exponential', 'in', 'the', 'number', 'of', 'variables', 'in', 'the', 'ring', 'we', 'give', 'a', 'lower', 'bound', 'on', 'the', 'ananyanhochster', 'constant', 'for', 'the', 'number', 'of', 'associated', 'primes']]
|
[-0.26158632916243124, 0.09843787527643144, -0.05884530690188209, 0.054867581204841066, -0.02923451948057239, -0.09112263702748653, -0.010279430639153967, 0.23624477514143413, -0.29052377957850695, -0.2892295059573371, 0.07554099301584453, -0.24905135855078697, -0.05550197886865741, 0.25615070620066643, -0.07213405013317242, 0.008702894405966314, -0.0437376314997285, 0.16783374443184584, -0.009614979334097976, -0.34374214817459386, 0.38134415028616786, 0.0251181620794038, 0.15646410840175426, -0.0025924328656401485, 0.043887010659091175, -0.033249045353538044, -0.014874959248118103, -0.013738831815620264, -0.16271732268311703, 0.16312257985312803, 0.2549642913218122, 0.09546903329707372, 0.2822037683023761, -0.4363398012161876, -0.05271675925663052, 0.23981112292191634, 0.12641666102960394, 0.01196468645503046, -0.036501154247768376, -0.1119510845746845, 0.14718049929554886, -0.2083287509934356, -0.18718582983516777, -0.05365457830096906, 0.0829515701237445, 0.11498490556065614, -0.30636464757844806, 0.06880915227035682, 0.110392251003456, 0.12454892358315799, -0.024107060618310545, -0.17228744487510994, 0.042526677202355735, 0.025808882458174292, 0.019686003288370557, -0.06500701051360618, 0.0028379480184715553, -0.165073283133097, -0.1306881370061698, 0.3141902287413056, -0.05185892070100332, -0.1718706205332031, 0.10815304552670568, -0.21023979214563346, -0.1491267776097326, 0.18079245750171444, 0.16160015076942122, 0.12805805448442698, 0.02340831859813382, 0.13474969348559776, -0.1382234417445337, 0.12771784234791994, 0.15084668945443505, 0.08325984978970762, 0.14055817037782012, 0.045197724539320916, 0.10967521956445125, 0.19890346564352512, -0.046209402273234446, -0.011440217145718634, -0.352997554524336, -0.19570069282417535, -0.2069714077806566, 0.07971534693691258, -0.13916998884330192, -0.17686624151732153, 0.4510270757600665, 0.0648971664243921, 0.2216225522570312, 0.13651547039868697, 0.23755848167153695, 0.12645516888490724, 0.06911007581220474, 0.06483066113817888, 0.11620600040381153, 0.17060522952427468, -0.05833325672817106, -0.16824646113248795, 0.024427579971719144, 0.17419927340233698]
|
1,803.05457
|
Think you have Solved Question Answering? Try ARC, the AI2 Reasoning
Challenge
|
We present a new question set, text corpus, and baselines assembled to
encourage AI research in advanced question answering. Together, these
constitute the AI2 Reasoning Challenge (ARC), which requires far more powerful
knowledge and reasoning than previous challenges such as SQuAD or SNLI. The ARC
question set is partitioned into a Challenge Set and an Easy Set, where the
Challenge Set contains only questions answered incorrectly by both a
retrieval-based algorithm and a word co-occurence algorithm. The dataset
contains only natural, grade-school science questions (authored for human
tests), and is the largest public-domain set of this kind (7,787 questions). We
test several baselines on the Challenge Set, including leading neural models
from the SQuAD and SNLI tasks, and find that none are able to significantly
outperform a random baseline, reflecting the difficult nature of this task. We
are also releasing the ARC Corpus, a corpus of 14M science sentences relevant
to the task, and implementations of the three neural baseline models tested.
Can your model perform better? We pose ARC as a challenge to the community.
|
cs.AI cs.CL cs.IR
|
we present a new question set text corpus and baselines assembled to encourage ai research in advanced question answering together these constitute the ai2 reasoning challenge arc which requires far more powerful knowledge and reasoning than previous challenges such as squad or snli the arc question set is partitioned into a challenge set and an easy set where the challenge set contains only questions answered incorrectly by both a retrievalbased algorithm and a word cooccurence algorithm the dataset contains only natural gradeschool science questions authored for human tests and is the largest publicdomain set of this kind 7787 questions we test several baselines on the challenge set including leading neural models from the squad and snli tasks and find that none are able to significantly outperform a random baseline reflecting the difficult nature of this task we are also releasing the arc corpus a corpus of 14m science sentences relevant to the task and implementations of the three neural baseline models tested can your model perform better we pose arc as a challenge to the community
|
[['we', 'present', 'a', 'new', 'question', 'set', 'text', 'corpus', 'and', 'baselines', 'assembled', 'to', 'encourage', 'ai', 'research', 'in', 'advanced', 'question', 'answering', 'together', 'these', 'constitute', 'the', 'ai2', 'reasoning', 'challenge', 'arc', 'which', 'requires', 'far', 'more', 'powerful', 'knowledge', 'and', 'reasoning', 'than', 'previous', 'challenges', 'such', 'as', 'squad', 'or', 'snli', 'the', 'arc', 'question', 'set', 'is', 'partitioned', 'into', 'a', 'challenge', 'set', 'and', 'an', 'easy', 'set', 'where', 'the', 'challenge', 'set', 'contains', 'only', 'questions', 'answered', 'incorrectly', 'by', 'both', 'a', 'retrievalbased', 'algorithm', 'and', 'a', 'word', 'cooccurence', 'algorithm', 'the', 'dataset', 'contains', 'only', 'natural', 'gradeschool', 'science', 'questions', 'authored', 'for', 'human', 'tests', 'and', 'is', 'the', 'largest', 'publicdomain', 'set', 'of', 'this', 'kind', '7787', 'questions', 'we', 'test', 'several', 'baselines', 'on', 'the', 'challenge', 'set', 'including', 'leading', 'neural', 'models', 'from', 'the', 'squad', 'and', 'snli', 'tasks', 'and', 'find', 'that', 'none', 'are', 'able', 'to', 'significantly', 'outperform', 'a', 'random', 'baseline', 'reflecting', 'the', 'difficult', 'nature', 'of', 'this', 'task', 'we', 'are', 'also', 'releasing', 'the', 'arc', 'corpus', 'a', 'corpus', 'of', '14m', 'science', 'sentences', 'relevant', 'to', 'the', 'task', 'and', 'implementations', 'of', 'the', 'three', 'neural', 'baseline', 'models', 'tested', 'can', 'your', 'model', 'perform', 'better', 'we', 'pose', 'arc', 'as', 'a', 'challenge', 'to', 'the', 'community']]
|
[-0.05268350050094093, 0.014600623852857098, -0.01967010930027093, 0.1020948843003928, -0.1754533405050593, -0.1724840237796095, 0.06614442520235157, 0.40134773298632354, -0.24415430665513585, -0.3986711779778654, 0.08946160292080921, -0.3190169346476482, -0.13323456939145795, 0.2549919768379451, -0.10487181623466313, 0.07919246135572228, 0.17486441514748466, 0.04682347053775712, 0.02197980707966384, -0.32666545237523015, 0.29133498192426155, 0.018416702914030546, 0.28161391403674235, 0.037110432642459106, 0.12838730690418743, -0.08450926235474815, -0.043728794997150544, 0.01064500257118859, -0.0661881400720135, 0.1596021128762831, 0.3254249012169236, 0.26675986780636857, 0.3586788763429716, -0.39189857632895425, -0.16332567640082826, 0.06015816058921204, 0.10435738828660264, 0.10538506242962532, 0.010291507889881112, -0.3449861242552288, 0.08298065733701647, -0.150481781154998, -0.0021361858763901346, -0.11177863356847824, 0.033415170063645666, -0.06849065694537289, -0.23807374174198645, 0.013979847193530242, 0.12669038026003612, 0.08361795643709642, -0.0019485115309097719, -0.14687474019063468, 0.07342472155604893, 0.17699045021568469, 0.008486559487540613, 0.11114471295811447, 0.09518351414060983, -0.1677818564176877, -0.16900895710039715, 0.41913766907104716, -0.036582283561322336, -0.1860819892978973, 0.20353130912884476, -0.048402018374128435, -0.18234358126805586, 0.04303596852101195, 0.18474744116379457, 0.09950894011225583, -0.16312789053931323, 0.010459740775827826, -0.11460636218808676, 0.22759560010903937, 0.07752953941698335, -0.038203901174711064, 0.22882402983536435, 0.2596298238707029, 0.0020896896947471596, 0.11340070148633624, -0.08021658531982791, -0.0324540637620058, -0.21139992993068352, -0.08087311358593235, -0.14560604707036295, 0.013010666204288347, -0.01781495670531347, -0.1597429877834987, 0.4100708289254478, 0.24691675366590393, 0.1765072911829603, 0.08127794709831836, 0.2761974766511809, -0.05734477530040749, 0.07330239644480488, 0.11307121363444655, 0.10759282853740099, -0.01280198057198008, 0.09421844244405458, -0.12159796838981989, 0.07576004140057856, 0.032707241329427976]
|
1,803.05458
|
Three charges on a plane in a magnetic field: Special trajectories
|
As a generalization and extension of JMP 54 (2013) 022901, the classical
dynamics of three non-relativistic Coulomb charges $(e_1, m_1)$, $(e_2, m_2)$
and $(e_3, m_3)$ on the plane placed in a constant magnetic field perpendicular
to the plane is considered. Special trajectories for which the distances
between the charges remain unchanged are presented and their corresponding
integrals of motion are indicated. For these special trajectories the number of
integrals of motion is larger than the dimension of the configuration space and
hence they can be called \emph{particularly superintegrable}. Three physically
relevant cases are analyzed in detail, namely that of three electrons, a
neutral system and a Helium-like system. The $n$-body case is discussed as
well.
|
math-ph math.MP
|
as a generalization and extension of jmp 54 2013 022901 the classical dynamics of three nonrelativistic coulomb charges e_1 m_1 e_2 m_2 and e_3 m_3 on the plane placed in a constant magnetic field perpendicular to the plane is considered special trajectories for which the distances between the charges remain unchanged are presented and their corresponding integrals of motion are indicated for these special trajectories the number of integrals of motion is larger than the dimension of the configuration space and hence they can be called emphparticularly superintegrable three physically relevant cases are analyzed in detail namely that of three electrons a neutral system and a heliumlike system the nbody case is discussed as well
|
[['as', 'a', 'generalization', 'and', 'extension', 'of', 'jmp', '54', '2013', '022901', 'the', 'classical', 'dynamics', 'of', 'three', 'nonrelativistic', 'coulomb', 'charges', 'e_1', 'm_1', 'e_2', 'm_2', 'and', 'e_3', 'm_3', 'on', 'the', 'plane', 'placed', 'in', 'a', 'constant', 'magnetic', 'field', 'perpendicular', 'to', 'the', 'plane', 'is', 'considered', 'special', 'trajectories', 'for', 'which', 'the', 'distances', 'between', 'the', 'charges', 'remain', 'unchanged', 'are', 'presented', 'and', 'their', 'corresponding', 'integrals', 'of', 'motion', 'are', 'indicated', 'for', 'these', 'special', 'trajectories', 'the', 'number', 'of', 'integrals', 'of', 'motion', 'is', 'larger', 'than', 'the', 'dimension', 'of', 'the', 'configuration', 'space', 'and', 'hence', 'they', 'can', 'be', 'called', 'emphparticularly', 'superintegrable', 'three', 'physically', 'relevant', 'cases', 'are', 'analyzed', 'in', 'detail', 'namely', 'that', 'of', 'three', 'electrons', 'a', 'neutral', 'system', 'and', 'a', 'heliumlike', 'system', 'the', 'nbody', 'case', 'is', 'discussed', 'as', 'well']]
|
[-0.19406401288110467, 0.17343443574742373, 0.010170993568227354, 0.0953024820933547, -0.015301678490421149, -0.12784090053611558, -0.027660081296977876, 0.3569328028016386, -0.22826380540608568, -0.2975366098097468, 0.08486008763919065, -0.2935632727257248, -0.08838222927488057, 0.2212435460476353, -0.016265577162756065, 0.004325407510314269, 0.05757970517023211, 0.06560097470368563, -0.07465482613100645, -0.2351308274484627, 0.2950841989821499, -0.006513198983929722, 0.18627360881825464, 0.003588608882299303, 0.07980539985784058, 0.026409309662351037, 0.03891006177208856, 0.03948057162977147, -0.11838725843680332, 0.08512116823576193, 0.183676789154142, 0.04181038190000814, 0.17677813614265317, -0.3566836417792777, -0.1490982672595213, 0.09078732845002571, 0.17190088145022767, 0.06463369566316725, 0.002796651353540344, -0.2798654469096079, 0.03082777523081255, -0.15043995931612708, -0.16177200329020225, -0.05817947847422509, 0.08004750909007657, 0.0352710469974106, -0.23324723585418103, 0.09350099678324388, 0.0663189491415726, 0.0368238540189351, -0.08691823567403892, -0.16814258087846756, -0.0810667608918177, 0.11518531124853422, 0.0635566908507649, 0.041017728655772134, 0.1162870920930816, -0.07517562370615459, -0.09803523823816691, 0.44914714588610605, 0.0020822383811340906, -0.2657144693451711, 0.17606330829037897, -0.15606125366700963, -0.10686435859621528, 0.1253929599868216, 0.1178561830810741, 0.16009599987862516, -0.15277848050690593, 0.12179075116116504, -0.03574930682399236, 0.08633268428801567, 0.09717140572178548, 0.02336080069447645, 0.23031467095891064, 0.09684711500211099, 0.040959829665448484, 0.11486172366916177, -0.08226326529752562, -0.14844364119462866, -0.3348171718385631, -0.1511566216101359, -0.15234148486072313, 0.05396684524561979, -0.07572718135189921, -0.14078076164015627, 0.36892860782445014, 0.08234098156969748, 0.21883035182697386, -0.013877821285730904, 0.2583557481308822, 0.10196377488009764, 0.018917155987789147, 0.06289260528684981, 0.2646498834813195, 0.15017113981323432, 0.0632009117913523, -0.1864800687428086, -0.04872659741760751, 0.09025532565804907]
|
1,803.05459
|
Subcritical transition to turbulence in accretion disc boundary layer
|
Enhanced angular momentum transfer through the boundary layer near the
surface of weakly magnetised accreting star is required in order to explain the
observed accretion timescales in low-mass X-ray binaries, cataclysmic variables
or young stars with massive protoplanetary discs. Accretion disc boundary layer
is locally represented by incompressible homogeneous and boundless flow of the
cyclonic type, which is linearly stable. Its non-linear instability at the
shear rates of order of the rotational frequency remains an issue. We argue
that hydrodynamical subcritical turbulence in such a flow is sustained by the
non-linear feedback from essentially three-dimensional vortices, which are
generated by quasi-two-dimensional trailing shearing spirals grown to high
amplitude via the swing amplification. We refer to those three-dimensional
vortices as cross-rolls, since they are aligned in the shearwise direction in
contrast to streamwise rolls generated by the anti-lift-up mechanism in
rotating shear flow on the Rayleigh line. Transient growth of cross-rolls is
studied analytically and further confronted with direct numerical simulations
(DNS) of dynamics of non-linear erturbations. DNS performed in a tall box show
that transition Reynolds number $R_T$ as function of shear rate accords with
the line of constant maximum transient growth of cross-rolls. The transition in
the tall box has been observed until the shear rate three times higher than the
rotational frequency, when $R_T\sim 50000$. Assuming that the cross-rolls are
also responsible for turbulence in the Keplerian flow, we estimate $R_T\lesssim
10^8$ in this case. The most favourable shear rate to test the existence of
turbulence in the quasi-Keplerian regime may be sub-Keplerian and equal
approximately to $1/2$.
|
astro-ph.HE astro-ph.EP
|
enhanced angular momentum transfer through the boundary layer near the surface of weakly magnetised accreting star is required in order to explain the observed accretion timescales in lowmass xray binaries cataclysmic variables or young stars with massive protoplanetary discs accretion disc boundary layer is locally represented by incompressible homogeneous and boundless flow of the cyclonic type which is linearly stable its nonlinear instability at the shear rates of order of the rotational frequency remains an issue we argue that hydrodynamical subcritical turbulence in such a flow is sustained by the nonlinear feedback from essentially threedimensional vortices which are generated by quasitwodimensional trailing shearing spirals grown to high amplitude via the swing amplification we refer to those threedimensional vortices as crossrolls since they are aligned in the shearwise direction in contrast to streamwise rolls generated by the antiliftup mechanism in rotating shear flow on the rayleigh line transient growth of crossrolls is studied analytically and further confronted with direct numerical simulations dns of dynamics of nonlinear erturbations dns performed in a tall box show that transition reynolds number r_t as function of shear rate accords with the line of constant maximum transient growth of crossrolls the transition in the tall box has been observed until the shear rate three times higher than the rotational frequency when r_tsim 50000 assuming that the crossrolls are also responsible for turbulence in the keplerian flow we estimate r_tlesssim 108 in this case the most favourable shear rate to test the existence of turbulence in the quasikeplerian regime may be subkeplerian and equal approximately to 12
|
[['enhanced', 'angular', 'momentum', 'transfer', 'through', 'the', 'boundary', 'layer', 'near', 'the', 'surface', 'of', 'weakly', 'magnetised', 'accreting', 'star', 'is', 'required', 'in', 'order', 'to', 'explain', 'the', 'observed', 'accretion', 'timescales', 'in', 'lowmass', 'xray', 'binaries', 'cataclysmic', 'variables', 'or', 'young', 'stars', 'with', 'massive', 'protoplanetary', 'discs', 'accretion', 'disc', 'boundary', 'layer', 'is', 'locally', 'represented', 'by', 'incompressible', 'homogeneous', 'and', 'boundless', 'flow', 'of', 'the', 'cyclonic', 'type', 'which', 'is', 'linearly', 'stable', 'its', 'nonlinear', 'instability', 'at', 'the', 'shear', 'rates', 'of', 'order', 'of', 'the', 'rotational', 'frequency', 'remains', 'an', 'issue', 'we', 'argue', 'that', 'hydrodynamical', 'subcritical', 'turbulence', 'in', 'such', 'a', 'flow', 'is', 'sustained', 'by', 'the', 'nonlinear', 'feedback', 'from', 'essentially', 'threedimensional', 'vortices', 'which', 'are', 'generated', 'by', 'quasitwodimensional', 'trailing', 'shearing', 'spirals', 'grown', 'to', 'high', 'amplitude', 'via', 'the', 'swing', 'amplification', 'we', 'refer', 'to', 'those', 'threedimensional', 'vortices', 'as', 'crossrolls', 'since', 'they', 'are', 'aligned', 'in', 'the', 'shearwise', 'direction', 'in', 'contrast', 'to', 'streamwise', 'rolls', 'generated', 'by', 'the', 'antiliftup', 'mechanism', 'in', 'rotating', 'shear', 'flow', 'on', 'the', 'rayleigh', 'line', 'transient', 'growth', 'of', 'crossrolls', 'is', 'studied', 'analytically', 'and', 'further', 'confronted', 'with', 'direct', 'numerical', 'simulations', 'dns', 'of', 'dynamics', 'of', 'nonlinear', 'erturbations', 'dns', 'performed', 'in', 'a', 'tall', 'box', 'show', 'that', 'transition', 'reynolds', 'number', 'r_t', 'as', 'function', 'of', 'shear', 'rate', 'accords', 'with', 'the', 'line', 'of', 'constant', 'maximum', 'transient', 'growth', 'of', 'crossrolls', 'the', 'transition', 'in', 'the', 'tall', 'box', 'has', 'been', 'observed', 'until', 'the', 'shear', 'rate', 'three', 'times', 'higher', 'than', 'the', 'rotational', 'frequency', 'when', 'r_tsim', '50000', 'assuming', 'that', 'the', 'crossrolls', 'are', 'also', 'responsible', 'for', 'turbulence', 'in', 'the', 'keplerian', 'flow', 'we', 'estimate', 'r_tlesssim', '108', 'in', 'this', 'case', 'the', 'most', 'favourable', 'shear', 'rate', 'to', 'test', 'the', 'existence', 'of', 'turbulence', 'in', 'the', 'quasikeplerian', 'regime', 'may', 'be', 'subkeplerian', 'and', 'equal', 'approximately', 'to', '12']]
|
[-0.1771900974325927, 0.2030674773876158, -0.022332254258514036, 0.04186286711974033, -0.06148344647760193, -0.07253039014507451, -0.02038644743973718, 0.33497916730668614, -0.2652687850997181, -0.26374309760536635, 0.11926042520505029, -0.23496616689999605, -0.06669572978942453, 0.21827755580546662, -0.006727232652551988, 0.06596496542938528, 0.030517503210599078, -0.03394750029159089, -0.008593059536160937, -0.21946527576804453, 0.31134103537336283, 0.06765014229287558, 0.24112440078957553, -0.04429127721700306, 0.054399585163713814, -0.1076739130925168, -0.019284615802633413, 0.028334284669208322, -0.20437144508911181, -0.00994318719021976, 0.21638898455181763, 0.010199295301172955, 0.23499251002007548, -0.44886338758264105, -0.23576105501977543, 0.025896871425941877, 0.20580769209693386, 0.08779491411942039, -0.043091789041371904, -0.20553809345024182, 0.12369363837163239, -0.18348130194251153, -0.14690114564317114, -0.00037840354055458425, 0.049395774713005214, 0.05090262109500626, -0.27221908248303567, 0.19036435897395873, 0.08216485526850995, 0.06452766034350384, -0.0948942826590592, -0.012934323389302282, -0.12114868781474583, 0.051721018650591845, 0.11173940052912631, 0.06969612537992789, 0.17243854917914553, -0.1800719951434682, -0.039245599827857, 0.37506875594822214, -0.0820100340233658, -0.15647606633822708, 0.22531524620877177, -0.2396036344445676, -0.052089454593849095, 0.20236767014926849, 0.1951924352888383, 0.1360601767824561, -0.07155662788124983, -0.017301287530127035, -0.05320869754981615, 0.16945230162739022, 0.11078009378968501, -0.03434045510549171, 0.2858008276105073, 0.16312109994126814, 0.040016811751011835, 0.13229237956990142, -0.1630870948609549, -0.09716961687503785, -0.23427320969309293, -0.09788491870915773, -0.15410792019181685, 0.06984469407858948, -0.08753147571109117, -0.1592609315562774, 0.3109926833451598, 0.0852978318240311, 0.2055726992623771, 0.017597479112081083, 0.2983941207055514, 0.1244290281845001, 0.06200887705655951, 0.1631996812864992, 0.3115424483430152, 0.16680751015687836, 0.13229879069361178, -0.25759146180935205, 0.06904166894690955, 0.05958336171438443]
|
1,803.0546
|
Autonomous Efficient Experiment Design for Materials Discovery with
Bayesian Model Averaging
|
The accelerated exploration of the materials space in order to identify
configurations with optimal properties is an ongoing challenge. Current
paradigms are typically centered around the idea of performing this exploration
through high-throughput experimentation/computation. Such approaches, however,
do not account fo the always present constraints in resources available.
Recently, this problem has been addressed by framing materials discovery as an
optimal experiment design. This work augments earlier efforts by putting
forward a framework that efficiently explores the materials design space not
only accounting for resource constraints but also incorporating the notion of
model uncertainty. The resulting approach combines Bayesian Model Averaging
within Bayesian Optimization in order to realize a system capable of
autonomously and adaptively learning not only the most promising regions in the
materials space but also the models that most efficiently guide such
exploration. The framework is demonstrated by efficiently exploring the MAX
ternary carbide/nitride space through Density Functional Theory (DFT)
calculations.
|
physics.comp-ph cond-mat.mtrl-sci
|
the accelerated exploration of the materials space in order to identify configurations with optimal properties is an ongoing challenge current paradigms are typically centered around the idea of performing this exploration through highthroughput experimentationcomputation such approaches however do not account fo the always present constraints in resources available recently this problem has been addressed by framing materials discovery as an optimal experiment design this work augments earlier efforts by putting forward a framework that efficiently explores the materials design space not only accounting for resource constraints but also incorporating the notion of model uncertainty the resulting approach combines bayesian model averaging within bayesian optimization in order to realize a system capable of autonomously and adaptively learning not only the most promising regions in the materials space but also the models that most efficiently guide such exploration the framework is demonstrated by efficiently exploring the max ternary carbidenitride space through density functional theory dft calculations
|
[['the', 'accelerated', 'exploration', 'of', 'the', 'materials', 'space', 'in', 'order', 'to', 'identify', 'configurations', 'with', 'optimal', 'properties', 'is', 'an', 'ongoing', 'challenge', 'current', 'paradigms', 'are', 'typically', 'centered', 'around', 'the', 'idea', 'of', 'performing', 'this', 'exploration', 'through', 'highthroughput', 'experimentationcomputation', 'such', 'approaches', 'however', 'do', 'not', 'account', 'fo', 'the', 'always', 'present', 'constraints', 'in', 'resources', 'available', 'recently', 'this', 'problem', 'has', 'been', 'addressed', 'by', 'framing', 'materials', 'discovery', 'as', 'an', 'optimal', 'experiment', 'design', 'this', 'work', 'augments', 'earlier', 'efforts', 'by', 'putting', 'forward', 'a', 'framework', 'that', 'efficiently', 'explores', 'the', 'materials', 'design', 'space', 'not', 'only', 'accounting', 'for', 'resource', 'constraints', 'but', 'also', 'incorporating', 'the', 'notion', 'of', 'model', 'uncertainty', 'the', 'resulting', 'approach', 'combines', 'bayesian', 'model', 'averaging', 'within', 'bayesian', 'optimization', 'in', 'order', 'to', 'realize', 'a', 'system', 'capable', 'of', 'autonomously', 'and', 'adaptively', 'learning', 'not', 'only', 'the', 'most', 'promising', 'regions', 'in', 'the', 'materials', 'space', 'but', 'also', 'the', 'models', 'that', 'most', 'efficiently', 'guide', 'such', 'exploration', 'the', 'framework', 'is', 'demonstrated', 'by', 'efficiently', 'exploring', 'the', 'max', 'ternary', 'carbidenitride', 'space', 'through', 'density', 'functional', 'theory', 'dft', 'calculations']]
|
[-0.07858357746519294, 0.08017935798205952, -0.08581190766748406, 0.048878865858640375, -0.12071703672043833, -0.1351295916631428, 0.07431549554480714, 0.40123913757308244, -0.29649444794726676, -0.3587563625153373, 0.09335663114686564, -0.2161036266890519, -0.19049119112063564, 0.17772123175810145, -0.044224507560393485, 0.09439543732959363, 0.05437378809951684, -0.041318382932408866, -0.06723140581857924, -0.22455669118980176, 0.2628991764824034, 0.11298263068078847, 0.31139854279048496, -0.014022961876726423, 0.09208912961489332, 0.015047094475757939, -0.029915722500946786, 0.03329479336370318, -0.13233980795970032, 0.1801299008995818, 0.312032150677897, 0.16107910074555357, 0.35731478947902623, -0.44283350583871983, -0.2924828337797639, 0.09658102806523637, 0.14906332387095866, 0.10083759648822783, -0.06927824763237236, -0.2677608535935481, 0.049740385069371826, -0.16938064655812543, -0.06575880990686273, -0.15077056517227996, -0.023410271320589423, -0.02317921936381121, -0.25341504075247917, -0.011753780816398635, 0.03286267807281095, 0.005669794907803675, -0.0811851638752748, -0.11735765144359807, 0.021407354335464975, 0.09532029346678576, 0.015568560302056665, 0.055099438221552985, 0.1272291226169472, -0.12797250984133118, -0.14254115025050257, 0.39076530523168296, 0.007504708842782219, -0.1897748954399349, 0.15202947084950222, -0.08676241059084515, -0.17617087260959974, 0.11678888950819527, 0.15835604543593754, 0.13467483885975834, -0.2032388726118465, 0.11268201401553062, 0.006077809132227759, 0.1732429758542114, -0.027282706189450192, 0.02431535350122288, 0.23144783743876307, 0.24344346811234024, 0.07759562730210913, 0.10303564381548296, -0.05539221262705384, -0.11700120959065709, -0.2550687672603827, -0.13761588170199224, -0.18406993786810466, -0.068065734974012, -0.028522600042325555, -0.11241728436427033, 0.35136126937478585, 0.19749282987550923, 0.17020399467350025, 0.017481521705585513, 0.32603480612092156, 0.06612944872928114, 0.10318690912152817, 0.09458432593413331, 0.24484902104131537, 0.047633261284395274, 0.08576985107418271, -0.1863677695369214, 0.12098313766848175, 0.04043489146301998]
|
1,803.05461
|
On universal continuous actions on the Cantor set
|
Using the notion of proper Cantor colorings we prove the following theorem.
For any countably infinite group $\Gamma$, there exists a free continuous
action $\zeta: \Gamma \curvearrowright C$ on the Cantor set, which is universal
in the following sense: for any free Borel action $\alpha: \Gamma
\curvearrowright X$ on the standard Borel space, there exists an injective
Borel map $\Theta_\alpha: X\to C$ such that $\Theta_\alpha\circ \alpha=\zeta
\circ \Theta_\alpha$. We extend our theorem for (nonfree) Borel
$(\Gamma,Z)$-actions, where $Z$ is a uniformly recurrent subgroup.
|
math.DS
|
using the notion of proper cantor colorings we prove the following theorem for any countably infinite group gamma there exists a free continuous action zeta gamma curvearrowright c on the cantor set which is universal in the following sense for any free borel action alpha gamma curvearrowright x on the standard borel space there exists an injective borel map theta_alpha xto c such that theta_alphacirc alphazeta circ theta_alpha we extend our theorem for nonfree borel gammazactions where z is a uniformly recurrent subgroup
|
[['using', 'the', 'notion', 'of', 'proper', 'cantor', 'colorings', 'we', 'prove', 'the', 'following', 'theorem', 'for', 'any', 'countably', 'infinite', 'group', 'gamma', 'there', 'exists', 'a', 'free', 'continuous', 'action', 'zeta', 'gamma', 'curvearrowright', 'c', 'on', 'the', 'cantor', 'set', 'which', 'is', 'universal', 'in', 'the', 'following', 'sense', 'for', 'any', 'free', 'borel', 'action', 'alpha', 'gamma', 'curvearrowright', 'x', 'on', 'the', 'standard', 'borel', 'space', 'there', 'exists', 'an', 'injective', 'borel', 'map', 'theta_alpha', 'xto', 'c', 'such', 'that', 'theta_alphacirc', 'alphazeta', 'circ', 'theta_alpha', 'we', 'extend', 'our', 'theorem', 'for', 'nonfree', 'borel', 'gammazactions', 'where', 'z', 'is', 'a', 'uniformly', 'recurrent', 'subgroup']]
|
[-0.18294639986606293, 0.19160827568514463, -0.10813734913244843, 0.07160040930798853, -0.07742738424236943, -0.1551626742369047, 0.10889246527473499, 0.40280375022579124, -0.3507970023302384, -0.03896243624205207, 0.0400882160756737, -0.2898957752845434, -0.07002123843384102, 0.23408648288912243, -0.14381543694661908, 0.019077722167159306, 0.04868064010170875, 0.1496914714620805, -0.05498749909658031, -0.17526482422778636, 0.3868312259538122, -0.15917472685054865, 0.18137258229156336, 0.036717636947646556, 0.17494706208760172, 0.02032946583090557, -0.03948386441801249, -0.031711050119886265, -0.23817046953375626, -0.0018690851183585178, 0.25324230257962127, 0.14120271907890083, 0.26482447687490485, -0.220430519889586, -0.16680390842511883, 0.31372860581096673, 0.05856271798687952, -0.1622843542035646, -0.016123206532893727, -0.30233869953425946, 0.1406775133477317, -0.20157695420224359, -0.13480014210842825, -0.05747200214062576, 0.1651660872416364, -0.029038866389726782, -0.3045688969037139, -0.005892012187820158, 0.17123210177193454, 0.11680684557017859, -0.0005886190639877761, -0.0698512144110821, -0.08392049192542923, 0.09264854362441434, 0.009396173537099435, 0.1993608782182873, 0.09291010241334637, 0.0027005294809278883, -0.13104303569941103, 0.3988857586396697, -0.13287263610227792, -0.276898288294489, 0.13983930885952747, -0.22447645275589126, -0.26421491231447386, 0.11643171158653719, 0.00509998671721989, 0.13812392292383277, -0.013598723992429397, 0.3589639572173725, -0.1997184419751535, 0.1271909684299227, 0.13183589898233797, -0.0364599913922081, 0.09337761064841883, 0.053908167681426825, 0.13318242622470414, 0.07473684953134736, 0.06079029095830557, 0.05599949159372, -0.42029238809589986, -0.14400747059671967, -0.11183891178361703, 0.21787965043597382, -0.1432058450443969, -0.26771714517639744, 0.2769325299154001, 0.055051221058094575, 0.12542847381835734, 0.17789213491437014, 0.17537344456075427, 0.10176797047344376, -0.011593396939268266, 0.11114568206953046, 0.04106574645553382, 0.1582313453272721, -0.1522156690120881, -0.13091737923016886, -0.019932826664758686, 0.2475480556740989]
|
1,803.05462
|
Towards predictive many-body calculations of phonon-limited carrier
mobilities in semiconductors
|
We probe the accuracy limit of {\it ab initio} calculations of carrier
mobilities in semiconductors, within the framework of the Boltzmann transport
equation. By focusing on the paradigmatic case of silicon, we show that fully
predictive calculations of electron and hole mobilities require many-body
quasiparticle corrections to band structures and electron-phonon matrix
elements, the inclusion of spin-orbit coupling, and an extremely fine sampling
of inelastic scattering processes in momentum space. By considering all these
factors we obtain excellent agreement with experiment, and we identify the band
effective masses as the most critical parameters to achieve predictive
accuracy. Our findings set a blueprint for future calculations of carrier
mobilities, and pave the way to engineering transport properties in
semiconductors by design.
|
cond-mat.mtrl-sci
|
we probe the accuracy limit of it ab initio calculations of carrier mobilities in semiconductors within the framework of the boltzmann transport equation by focusing on the paradigmatic case of silicon we show that fully predictive calculations of electron and hole mobilities require manybody quasiparticle corrections to band structures and electronphonon matrix elements the inclusion of spinorbit coupling and an extremely fine sampling of inelastic scattering processes in momentum space by considering all these factors we obtain excellent agreement with experiment and we identify the band effective masses as the most critical parameters to achieve predictive accuracy our findings set a blueprint for future calculations of carrier mobilities and pave the way to engineering transport properties in semiconductors by design
|
[['we', 'probe', 'the', 'accuracy', 'limit', 'of', 'it', 'ab', 'initio', 'calculations', 'of', 'carrier', 'mobilities', 'in', 'semiconductors', 'within', 'the', 'framework', 'of', 'the', 'boltzmann', 'transport', 'equation', 'by', 'focusing', 'on', 'the', 'paradigmatic', 'case', 'of', 'silicon', 'we', 'show', 'that', 'fully', 'predictive', 'calculations', 'of', 'electron', 'and', 'hole', 'mobilities', 'require', 'manybody', 'quasiparticle', 'corrections', 'to', 'band', 'structures', 'and', 'electronphonon', 'matrix', 'elements', 'the', 'inclusion', 'of', 'spinorbit', 'coupling', 'and', 'an', 'extremely', 'fine', 'sampling', 'of', 'inelastic', 'scattering', 'processes', 'in', 'momentum', 'space', 'by', 'considering', 'all', 'these', 'factors', 'we', 'obtain', 'excellent', 'agreement', 'with', 'experiment', 'and', 'we', 'identify', 'the', 'band', 'effective', 'masses', 'as', 'the', 'most', 'critical', 'parameters', 'to', 'achieve', 'predictive', 'accuracy', 'our', 'findings', 'set', 'a', 'blueprint', 'for', 'future', 'calculations', 'of', 'carrier', 'mobilities', 'and', 'pave', 'the', 'way', 'to', 'engineering', 'transport', 'properties', 'in', 'semiconductors', 'by', 'design']]
|
[-0.10270554676341513, 0.11220114474720806, -0.033200761613746486, 0.04522910360246897, -0.004031664226204157, -0.1169583186856471, 0.10561069984299441, 0.4326059398241341, -0.23246190237987321, -0.32597308037414524, -0.019207135717685255, -0.32272672386995205, -0.12737960408752164, 0.2183801402861718, 0.04922795628081076, 0.08752815254362455, 0.06905339874404794, -0.10086778133021047, -0.10633966940416334, -0.20072072988453632, 0.2871165900956839, 0.10190126907158022, 0.27928035892158126, 0.11732673506097248, 0.05879620927153155, 0.04774810702074319, 0.05942573037852223, 0.015340154687631486, -0.17354721550564137, 0.1397853162624718, 0.30844300996977836, -0.07348718805975901, 0.20667143540146451, -0.45116523997858166, -0.2408997084130533, -0.03160543852912572, 0.1430985100082277, 0.16146653252265727, -0.08366022533446085, -0.24962917271186597, 0.04449240485506986, -0.17774194644686456, -0.1267576946178451, -0.17090490216505713, -0.021343552926555275, 0.008296978885482531, -0.2629426400565232, 0.09116944855656281, -0.022012111738634606, -0.007774004568818782, -0.10481922201385412, -0.15717666503818084, -0.021726555020237962, 0.09831573103292612, 0.0237697742258509, -0.013203637880117943, 0.18569242369073133, -0.14005015343621682, -0.12964354282012208, 0.4255253989559909, -0.07810060096283754, -0.15215046107769012, 0.1597959661235412, -0.18720753287198022, -0.07851127742324024, 0.13583646042194839, 0.14351543734471003, 0.08913689789672692, -0.1728063667891547, 0.09683501314284512, 0.004969647887628525, 0.15347293408898016, 0.006513098805832366, 0.12095937149564027, 0.2093391583650373, 0.2515575113706291, 0.026263938444511345, -0.003005746410538753, -0.08986885262226375, -0.050983287366883207, -0.2426433595479466, -0.15702207903377713, -0.19848517564532814, 0.08224931476676527, -0.1136426274037755, -0.15501549287776772, 0.3979759781466176, 0.2217530807829462, 0.16923755830115017, 0.011428524879738689, 0.2404010285778592, 0.12069410588895456, 0.05763139829117184, 0.06798420502260948, 0.2579717527575364, 0.17542324682193186, 0.053164096180504807, -0.29441391685201473, 0.02901703743264079, 0.018793130475872506]
|
1,803.05463
|
Local version of the no-hair theorem
|
Non-extremal isolated horizons embeddable in 4-dimensional spacetimes
satisfying the vacuum Einstein equations with cosmological constant are
studied. The horizons are assumed to be stationary to the second order. The
Weyl tensor at the horizon is assumed to be of the Petrov type D. The
corresponding equation on the intrinsic horizon geometry is solved in the
axisymmetric case. The family of the solutions is $2$-dimensional, it is
parametrized by the area and the angular momentum. The embeddability in the
Kerr - de Sitter, the Kerr - anti de Sitter and the Near extremal Horizon
spacetimes obtained by the Horowitz limit from the extremal Kerr - de Sitter
and extremal Kerr - anti de Sitter is discussed. This uniqueness of the
axisymmetric type D isolated horizons is a generalization of the similar
earlier result valid in the cosmological constant free case.
|
gr-qc hep-th math-ph math.MP
|
nonextremal isolated horizons embeddable in 4dimensional spacetimes satisfying the vacuum einstein equations with cosmological constant are studied the horizons are assumed to be stationary to the second order the weyl tensor at the horizon is assumed to be of the petrov type d the corresponding equation on the intrinsic horizon geometry is solved in the axisymmetric case the family of the solutions is 2dimensional it is parametrized by the area and the angular momentum the embeddability in the kerr de sitter the kerr anti de sitter and the near extremal horizon spacetimes obtained by the horowitz limit from the extremal kerr de sitter and extremal kerr anti de sitter is discussed this uniqueness of the axisymmetric type d isolated horizons is a generalization of the similar earlier result valid in the cosmological constant free case
|
[['nonextremal', 'isolated', 'horizons', 'embeddable', 'in', '4dimensional', 'spacetimes', 'satisfying', 'the', 'vacuum', 'einstein', 'equations', 'with', 'cosmological', 'constant', 'are', 'studied', 'the', 'horizons', 'are', 'assumed', 'to', 'be', 'stationary', 'to', 'the', 'second', 'order', 'the', 'weyl', 'tensor', 'at', 'the', 'horizon', 'is', 'assumed', 'to', 'be', 'of', 'the', 'petrov', 'type', 'd', 'the', 'corresponding', 'equation', 'on', 'the', 'intrinsic', 'horizon', 'geometry', 'is', 'solved', 'in', 'the', 'axisymmetric', 'case', 'the', 'family', 'of', 'the', 'solutions', 'is', '2dimensional', 'it', 'is', 'parametrized', 'by', 'the', 'area', 'and', 'the', 'angular', 'momentum', 'the', 'embeddability', 'in', 'the', 'kerr', 'de', 'sitter', 'the', 'kerr', 'anti', 'de', 'sitter', 'and', 'the', 'near', 'extremal', 'horizon', 'spacetimes', 'obtained', 'by', 'the', 'horowitz', 'limit', 'from', 'the', 'extremal', 'kerr', 'de', 'sitter', 'and', 'extremal', 'kerr', 'anti', 'de', 'sitter', 'is', 'discussed', 'this', 'uniqueness', 'of', 'the', 'axisymmetric', 'type', 'd', 'isolated', 'horizons', 'is', 'a', 'generalization', 'of', 'the', 'similar', 'earlier', 'result', 'valid', 'in', 'the', 'cosmological', 'constant', 'free', 'case']]
|
[-0.1869219328518267, 0.10803541455814546, -0.0874315010280245, 0.12405693136517787, -0.11883665566436119, -0.13970746777744758, -0.1259473354107252, 0.2458695053709326, -0.14721323048902882, -0.22821568959151153, 0.14102191908836917, -0.31022115939607225, -0.04989087910701831, 0.15403733617729612, -0.08708259318782775, 0.07069751428164266, -0.045294041534954754, 0.07822635993361474, -0.07993878985375717, -0.27693493128926666, 0.4331691229715943, 0.09621864775264705, 0.283084194527732, -0.06677273733334409, 0.127535338823994, 0.014891807534904392, 0.005065814930842154, 0.09498184022873088, -0.24440204489424272, 0.01756054591042576, 0.2509332027389771, 0.0715747136760641, 0.15223126000276319, -0.33801216599703937, -0.20103818825273603, 0.11354835810553697, 0.1415084091325601, 0.18047514682014784, -0.03877026876520917, -0.34887945770320516, 0.0551646568019081, -0.13753706023648934, -0.23766424541396122, -0.012524730215469996, 0.05584064375747133, -0.08378656768688449, -0.16786837248062647, 0.13870615883281937, 0.1119448391030784, -0.06569904572517973, -0.16952247072218193, -0.013099873028005716, -0.08221983345639375, 0.028301734832563884, 0.12219117426106499, 0.01627367747326692, 0.0977596503716928, -0.021143254025459843, -0.11463831891478211, 0.32764229691130353, -0.08119309437374964, -0.26758075722113805, 0.11439084156105915, -0.25315354436773946, -0.031805907821075785, 0.11172221064291618, 0.09076332074969455, 0.26028246061393506, -0.09500036971229646, 0.2862297564732014, 0.005267311436883001, 0.06903148258311881, 0.22290663579133926, -0.0031085562167896164, 0.2887147385765005, 0.05394535922548837, 0.06011620735818589, 0.12574861063277004, 0.006779062425441764, -0.11998086317045684, -0.39078278756803936, -0.16319161200792426, -0.1639885139134195, 0.15642508218685786, -0.22245172870795984, -0.21529962771606667, 0.2922471518593806, 0.010545082276480065, 0.13403978140170997, 0.008997164721842166, 0.1989583974911107, 0.06460114642287847, -0.016263410352446415, 0.15890746516072088, 0.36370726656858565, 0.11269873878056252, 0.1821046628644345, -0.2631542916834372, -0.06993932494617723, 0.16114529464911256]
|
1,803.05464
|
Review of Multi-Agent Algorithms for Collective Behavior: a Structural
Taxonomy
|
In this paper, we review multi-agent collective behavior algorithms in the
literature and classify them according to their underlying mathematical
structure. For each mathematical technique, we identify the multi-agent
coordination tasks it can be applied to, and we analyze its scalability,
bandwidth use, and demonstrated maturity. We highlight how versatile techniques
such as artificial potential functions can be used for applications ranging
from low-level position control to high-level coordination and task allocation,
we discuss possible reasons for the slow adoption of complex distributed
coordination algorithms in the field, and we highlight areas for further
research and development.
|
cs.RO cs.MA
|
in this paper we review multiagent collective behavior algorithms in the literature and classify them according to their underlying mathematical structure for each mathematical technique we identify the multiagent coordination tasks it can be applied to and we analyze its scalability bandwidth use and demonstrated maturity we highlight how versatile techniques such as artificial potential functions can be used for applications ranging from lowlevel position control to highlevel coordination and task allocation we discuss possible reasons for the slow adoption of complex distributed coordination algorithms in the field and we highlight areas for further research and development
|
[['in', 'this', 'paper', 'we', 'review', 'multiagent', 'collective', 'behavior', 'algorithms', 'in', 'the', 'literature', 'and', 'classify', 'them', 'according', 'to', 'their', 'underlying', 'mathematical', 'structure', 'for', 'each', 'mathematical', 'technique', 'we', 'identify', 'the', 'multiagent', 'coordination', 'tasks', 'it', 'can', 'be', 'applied', 'to', 'and', 'we', 'analyze', 'its', 'scalability', 'bandwidth', 'use', 'and', 'demonstrated', 'maturity', 'we', 'highlight', 'how', 'versatile', 'techniques', 'such', 'as', 'artificial', 'potential', 'functions', 'can', 'be', 'used', 'for', 'applications', 'ranging', 'from', 'lowlevel', 'position', 'control', 'to', 'highlevel', 'coordination', 'and', 'task', 'allocation', 'we', 'discuss', 'possible', 'reasons', 'for', 'the', 'slow', 'adoption', 'of', 'complex', 'distributed', 'coordination', 'algorithms', 'in', 'the', 'field', 'and', 'we', 'highlight', 'areas', 'for', 'further', 'research', 'and', 'development']]
|
[-0.08473346090501117, -0.0008855389872777093, -0.049065116034417426, 0.07112516463162934, -0.12865015140436975, -0.1485529728665871, 0.07037599316735742, 0.49007543205696436, -0.3378152954536154, -0.3207137009378561, 0.11437202145023867, -0.19576166923033053, -0.2395242668457867, 0.18903739471528583, -0.13635415013053828, 0.0751699511022979, 0.025574993226946015, -0.0049733276210110824, -0.029709805178182374, -0.23383050949370354, 0.26410662528900336, 0.023843451143847297, 0.3251427050953558, 0.07346386670317386, 0.06794244103306502, 0.010872882430816126, -0.015931043036992557, 0.016200067606780406, -0.13330101685540885, 0.17388620330308824, 0.37070376447104303, 0.2227672510636375, 0.3294037346051257, -0.4590524563316217, -0.1881335010060791, 0.08007688848205756, 0.16535962132986673, 0.12851168303006358, -0.0385456248234535, -0.26187465064582827, 0.07855262154636462, -0.19111660416670068, -0.12623693237138778, -0.17265412314151674, 0.012092529950884277, 0.07806992615373883, -0.22802369651617482, -0.033170342915835455, 0.01654087367093133, 0.09873577564973961, -0.06323707077445789, -0.11861598436461435, 0.08350452485484715, 0.21535670457734274, 0.04630789765608065, -0.023452152344446208, 0.17025071786735782, -0.14705922798080773, -0.18554377566888622, 0.4148706260434899, 0.025620829277988717, -0.18490348404907075, 0.25079333537363824, -0.02212988374485951, -0.20658251037821174, 0.035236235343150256, 0.28149660365636814, 0.0859084396517161, -0.16187482471301787, 0.049524483574583125, 0.06830583955401305, 0.16086522656848135, 0.025797435255317958, 0.04020654195055519, 0.18712092472297936, 0.23157226340365164, 0.08017008792916216, 0.14687195492514707, -0.06612902757088826, -0.14308980264828167, -0.22882944233139457, -0.153470729670929, -0.12431336315252732, -0.0027244775087966284, -0.051608638808229634, -0.09481283640200944, 0.40658259080703724, 0.2375977585745073, 0.13175148504891807, 0.03250050855819712, 0.2965787959083454, 0.08095498945079167, 0.06470134964971275, 0.07961405833796646, 0.18596335758872753, 0.07779031834017831, 0.16657261259508194, -0.20890575693080143, 0.0614455625001994, -0.03396835230943775]
|
1,803.05465
|
Subexponential-Time and FPT Algorithms for Embedded Flat Clustered
Planarity
|
The C-Planarity problem asks for a drawing of a $\textit{clustered graph}$,
i.e., a graph whose vertices belong to properly nested clusters, in which each
cluster is represented by a simple closed region with no edge-edge crossings,
no region-region crossings, and no unnecessary edge-region crossings. We study
C-Planarity for $\textit{embedded flat clustered graphs}$, graphs with a fixed
combinatorial embedding whose clusters partition the vertex set. Our main
result is a subexponential-time algorithm to test C-Planarity for these graphs
when their face size is bounded. Furthermore, we consider a variation of the
notion of $\textit{embedded tree decomposition}$ in which, for each face,
including the outer face, there is a bag that contains every vertex of the
face. We show that C-Planarity is fixed-parameter tractable with the
embedded-width of the underlying graph and the number of disconnected clusters
as parameters.
|
cs.DS cs.CG
|
the cplanarity problem asks for a drawing of a textitclustered graph ie a graph whose vertices belong to properly nested clusters in which each cluster is represented by a simple closed region with no edgeedge crossings no regionregion crossings and no unnecessary edgeregion crossings we study cplanarity for textitembedded flat clustered graphs graphs with a fixed combinatorial embedding whose clusters partition the vertex set our main result is a subexponentialtime algorithm to test cplanarity for these graphs when their face size is bounded furthermore we consider a variation of the notion of textitembedded tree decomposition in which for each face including the outer face there is a bag that contains every vertex of the face we show that cplanarity is fixedparameter tractable with the embeddedwidth of the underlying graph and the number of disconnected clusters as parameters
|
[['the', 'cplanarity', 'problem', 'asks', 'for', 'a', 'drawing', 'of', 'a', 'textitclustered', 'graph', 'ie', 'a', 'graph', 'whose', 'vertices', 'belong', 'to', 'properly', 'nested', 'clusters', 'in', 'which', 'each', 'cluster', 'is', 'represented', 'by', 'a', 'simple', 'closed', 'region', 'with', 'no', 'edgeedge', 'crossings', 'no', 'regionregion', 'crossings', 'and', 'no', 'unnecessary', 'edgeregion', 'crossings', 'we', 'study', 'cplanarity', 'for', 'textitembedded', 'flat', 'clustered', 'graphs', 'graphs', 'with', 'a', 'fixed', 'combinatorial', 'embedding', 'whose', 'clusters', 'partition', 'the', 'vertex', 'set', 'our', 'main', 'result', 'is', 'a', 'subexponentialtime', 'algorithm', 'to', 'test', 'cplanarity', 'for', 'these', 'graphs', 'when', 'their', 'face', 'size', 'is', 'bounded', 'furthermore', 'we', 'consider', 'a', 'variation', 'of', 'the', 'notion', 'of', 'textitembedded', 'tree', 'decomposition', 'in', 'which', 'for', 'each', 'face', 'including', 'the', 'outer', 'face', 'there', 'is', 'a', 'bag', 'that', 'contains', 'every', 'vertex', 'of', 'the', 'face', 'we', 'show', 'that', 'cplanarity', 'is', 'fixedparameter', 'tractable', 'with', 'the', 'embeddedwidth', 'of', 'the', 'underlying', 'graph', 'and', 'the', 'number', 'of', 'disconnected', 'clusters', 'as', 'parameters']]
|
[-0.14720751204432042, 0.08316061183808522, -0.04864747395314386, 0.07533804428684936, -0.1242302263066556, -0.14816949511056438, 0.07754272700335338, 0.4011062879170127, -0.26227219669860513, -0.30266919279700444, 0.08365040182252415, -0.2829005914459498, -0.15056321045780993, 0.10966320874457083, -0.10112498696959366, 0.00045013813959325063, 0.15137356178328285, 0.09870533906745121, 0.014709508783573041, -0.25768630883056387, 0.3438741267634802, -0.053966868074734095, 0.16356227533234394, 0.057452282498535866, 0.09731211999700035, 0.03182999388766749, 0.01947116630617529, 0.11363734700032235, -0.14928936495273185, 0.09898259804921349, 0.2608595794573536, 0.16630510849576882, 0.26246139481971864, -0.3762036375451049, -0.1487471619141562, 0.2093580418937456, 0.12481428871807806, 0.07302756040692604, -0.016674518485909656, -0.23273116766016327, 0.1385221757210435, -0.09044125020120512, -0.09184802969000028, 0.04774851949460914, 0.06250542520908364, -0.026150153715314123, -0.2517104454215287, -0.014759193777161487, 0.10452832890030764, 0.018157235723372328, 0.021567825096152612, -0.13408571474471553, -0.04743662992704605, 0.12037159398010665, -0.06860884179631659, 0.07227621230498806, 0.036303602401697874, -0.13437047799229998, -0.15531521517550573, 0.38799480945967574, 0.05273699062287479, -0.2030851988512201, 0.14847444477901958, -0.09582357411272824, -0.21317421838038547, 0.13134456551222898, 0.11136675793814528, 0.10863009743008982, -0.10547022333059217, 0.12369116667147917, -0.13794385822599425, 0.13836664342157104, 0.13333898986799314, -0.03592795139668263, 0.16439630853368298, 0.15846497939577708, 0.15061934465569826, 0.21968890956657774, -0.033058324715752596, -0.04344522953119047, -0.29303822343182917, -0.0846851661678075, -0.19719885916599786, -0.008067439933417036, -0.18867431203719154, -0.2989957972895354, 0.4280620939372217, 0.05002846966689343, 0.2328551291138865, 0.121768238103387, 0.25800112790345925, 0.0682689853840523, 0.07676764888139373, 0.18355036745710737, 0.10394878442543011, 0.10831714359408258, -0.06308499594931216, -0.1686620788052952, 0.07646012802348089, 0.10594157638532874]
|
1,803.05466
|
Hunting All the Hidden Photons
|
We explore constraints on gauge bosons of a weakly coupled $U(1)_{B-L}$,
$U(1)_{L_\mu-L_e}$, $U(1)_{L_e-L_\tau}$ and $U(1)_{L_\mu-L_\tau}$. To do so we
apply the full constraining power of experimental bounds derived for a hidden
photon of a secluded $U(1)_{X}$ and translate them to the considered gauge
groups. In contrast to the secluded hidden photon that acquires universal
couplings to charged Standard Model particles through kinetic mixing with the
photon, for these gauge groups the couplings to the different Standard Model
particles can vary widely. We take finite, computable loop-induced kinetic
mixing effects into account, which provide additional sensitivity in a range of
experiments. In addition, we collect and extend limits from neutrino
experiments as well as astrophysical and cosmological observations and include
new constraints from white dwarf cooling. We discuss the reach of future
experiments in searching for these gauge bosons.
|
hep-ph
|
we explore constraints on gauge bosons of a weakly coupled u1_bl u1_l_mul_e u1_l_el_tau and u1_l_mul_tau to do so we apply the full constraining power of experimental bounds derived for a hidden photon of a secluded u1_x and translate them to the considered gauge groups in contrast to the secluded hidden photon that acquires universal couplings to charged standard model particles through kinetic mixing with the photon for these gauge groups the couplings to the different standard model particles can vary widely we take finite computable loopinduced kinetic mixing effects into account which provide additional sensitivity in a range of experiments in addition we collect and extend limits from neutrino experiments as well as astrophysical and cosmological observations and include new constraints from white dwarf cooling we discuss the reach of future experiments in searching for these gauge bosons
|
[['we', 'explore', 'constraints', 'on', 'gauge', 'bosons', 'of', 'a', 'weakly', 'coupled', 'u1_bl', 'u1_l_mul_e', 'u1_l_el_tau', 'and', 'u1_l_mul_tau', 'to', 'do', 'so', 'we', 'apply', 'the', 'full', 'constraining', 'power', 'of', 'experimental', 'bounds', 'derived', 'for', 'a', 'hidden', 'photon', 'of', 'a', 'secluded', 'u1_x', 'and', 'translate', 'them', 'to', 'the', 'considered', 'gauge', 'groups', 'in', 'contrast', 'to', 'the', 'secluded', 'hidden', 'photon', 'that', 'acquires', 'universal', 'couplings', 'to', 'charged', 'standard', 'model', 'particles', 'through', 'kinetic', 'mixing', 'with', 'the', 'photon', 'for', 'these', 'gauge', 'groups', 'the', 'couplings', 'to', 'the', 'different', 'standard', 'model', 'particles', 'can', 'vary', 'widely', 'we', 'take', 'finite', 'computable', 'loopinduced', 'kinetic', 'mixing', 'effects', 'into', 'account', 'which', 'provide', 'additional', 'sensitivity', 'in', 'a', 'range', 'of', 'experiments', 'in', 'addition', 'we', 'collect', 'and', 'extend', 'limits', 'from', 'neutrino', 'experiments', 'as', 'well', 'as', 'astrophysical', 'and', 'cosmological', 'observations', 'and', 'include', 'new', 'constraints', 'from', 'white', 'dwarf', 'cooling', 'we', 'discuss', 'the', 'reach', 'of', 'future', 'experiments', 'in', 'searching', 'for', 'these', 'gauge', 'bosons']]
|
[-0.05962929085944779, 0.2504307605627486, -0.035994057493928054, 0.1507165856549845, -0.12234666460084126, -0.16577700725482666, 0.06641386636757114, 0.343458847313955, -0.22527555843322156, -0.33457981317769736, 0.03304846817285151, -0.2797659423924736, -0.03933959602213958, 0.15577707671207677, 0.03375678223229068, 0.029679795569630667, 0.022132891184061438, 0.004246375810907921, -0.05199909531203208, -0.246612677569775, 0.2742382353514104, 0.03234325725283912, 0.20159745938144624, 0.07177959141485832, 0.14161746225984054, -0.006916698181371698, -0.06441131927867365, -0.04840535633539891, -0.14288648024980563, 0.0561075286789085, 0.1955910577740082, 0.0780394885189119, 0.12046775762128699, -0.4439467474927797, -0.24003165132051116, 0.17105350765974864, 0.1680288025390302, 0.11358533108261112, -0.08166097559767556, -0.3314539134187405, 0.035330411202962486, -0.2039338902960641, -0.056887670937131214, -0.09620706746971015, -0.07143994062618517, -0.02499739426831879, -0.3288124918643221, 0.06683974539833691, -0.0035281223307024713, -0.0166018842257258, -0.02412800438126878, -0.10594760082655258, -0.02138178047607653, 0.08188934955978766, 0.12946982872638138, -0.04193165435914553, 0.17281440291416778, -0.18560579821453704, -0.13277490333455397, 0.4438455448839437, -0.14533623170470544, -0.19855788478590136, 0.21208072250010446, -0.11746135274605717, -0.2077660857912098, 0.09093403614208322, 0.23032051896820227, 0.06857215370024171, -0.15538154300713145, 0.1569624236174551, -0.06301034299437613, 0.14830425030531308, 0.004879896943320465, 0.07512008777035482, 0.24714248741100378, 0.15671745633624276, 0.04506713925580056, 0.09902115508242894, -0.08471879696234656, -0.09371878631303415, -0.3747304177719771, -0.1450394267887853, -0.0891591435750289, 0.06150398524679237, -0.0750032080706981, -0.09299209944968906, 0.3836533588165527, 0.21682387381203144, 0.21676809650585604, 0.06853166209818001, 0.25847646480970604, 0.078680521752069, 0.09731016168370843, -0.00021027662681744378, 0.3042504199753132, 0.14984559110941037, 0.042482069803073126, -0.1983503937491846, -0.060664474420585014, 0.028160798606490168]
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.