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.06867
|
Cloud Infrastructure Provenance Collection and Management to Reproduce
Scientific Workflow Execution
|
The emergence of Cloud computing provides a new computing paradigm for
scientific workflow execution. It provides dynamic, on-demand and scalable
resources that enable the processing of complex workflow-based experiments.
With the ever growing size of the experimental data and increasingly complex
processing workflows, the need for reproducibility has also become essential.
Provenance has been thought of a mechanism to verify a workflow and to provide
workflow reproducibility. One of the obstacles in reproducing an experiment
execution is the lack of information about the execution infrastructure in the
collected provenance. This information becomes critical in the context of Cloud
in which resources are provisioned on-demand and by specifying resource
configurations. Therefore, a mechanism is required that enables capturing of
infrastructure information along with the provenance of workflows executing on
the Cloud to facilitate the re-creation of execution environment on the Cloud.
This paper presents a framework, ReCAP, along with the proposed mapping
approaches that aid in capturing the Cloud-aware provenance information and
help in re-provisioning the execution resource on the Cloud with similar
configurations. Experimental evaluation has shown the impact of different
resource configurations on the workflow execution performance, therefore
justifies the need for collecting such provenance information in the context of
Cloud. The evaluation has also demonstrated that the proposed mapping
approaches can capture Cloud information in various Cloud usage scenarios
without causing performance overhead and can also enable the re-provisioning of
resources on Cloud. Experiments were conducted using workflows from different
scientific domains such as astronomy and neuroscience to demonstrate the
applicability of this research for different workflows.
|
cs.DC
|
the emergence of cloud computing provides a new computing paradigm for scientific workflow execution it provides dynamic ondemand and scalable resources that enable the processing of complex workflowbased experiments with the ever growing size of the experimental data and increasingly complex processing workflows the need for reproducibility has also become essential provenance has been thought of a mechanism to verify a workflow and to provide workflow reproducibility one of the obstacles in reproducing an experiment execution is the lack of information about the execution infrastructure in the collected provenance this information becomes critical in the context of cloud in which resources are provisioned ondemand and by specifying resource configurations therefore a mechanism is required that enables capturing of infrastructure information along with the provenance of workflows executing on the cloud to facilitate the recreation of execution environment on the cloud this paper presents a framework recap along with the proposed mapping approaches that aid in capturing the cloudaware provenance information and help in reprovisioning the execution resource on the cloud with similar configurations experimental evaluation has shown the impact of different resource configurations on the workflow execution performance therefore justifies the need for collecting such provenance information in the context of cloud the evaluation has also demonstrated that the proposed mapping approaches can capture cloud information in various cloud usage scenarios without causing performance overhead and can also enable the reprovisioning of resources on cloud experiments were conducted using workflows from different scientific domains such as astronomy and neuroscience to demonstrate the applicability of this research for different workflows
|
[['the', 'emergence', 'of', 'cloud', 'computing', 'provides', 'a', 'new', 'computing', 'paradigm', 'for', 'scientific', 'workflow', 'execution', 'it', 'provides', 'dynamic', 'ondemand', 'and', 'scalable', 'resources', 'that', 'enable', 'the', 'processing', 'of', 'complex', 'workflowbased', 'experiments', 'with', 'the', 'ever', 'growing', 'size', 'of', 'the', 'experimental', 'data', 'and', 'increasingly', 'complex', 'processing', 'workflows', 'the', 'need', 'for', 'reproducibility', 'has', 'also', 'become', 'essential', 'provenance', 'has', 'been', 'thought', 'of', 'a', 'mechanism', 'to', 'verify', 'a', 'workflow', 'and', 'to', 'provide', 'workflow', 'reproducibility', 'one', 'of', 'the', 'obstacles', 'in', 'reproducing', 'an', 'experiment', 'execution', 'is', 'the', 'lack', 'of', 'information', 'about', 'the', 'execution', 'infrastructure', 'in', 'the', 'collected', 'provenance', 'this', 'information', 'becomes', 'critical', 'in', 'the', 'context', 'of', 'cloud', 'in', 'which', 'resources', 'are', 'provisioned', 'ondemand', 'and', 'by', 'specifying', 'resource', 'configurations', 'therefore', 'a', 'mechanism', 'is', 'required', 'that', 'enables', 'capturing', 'of', 'infrastructure', 'information', 'along', 'with', 'the', 'provenance', 'of', 'workflows', 'executing', 'on', 'the', 'cloud', 'to', 'facilitate', 'the', 'recreation', 'of', 'execution', 'environment', 'on', 'the', 'cloud', 'this', 'paper', 'presents', 'a', 'framework', 'recap', 'along', 'with', 'the', 'proposed', 'mapping', 'approaches', 'that', 'aid', 'in', 'capturing', 'the', 'cloudaware', 'provenance', 'information', 'and', 'help', 'in', 'reprovisioning', 'the', 'execution', 'resource', 'on', 'the', 'cloud', 'with', 'similar', 'configurations', 'experimental', 'evaluation', 'has', 'shown', 'the', 'impact', 'of', 'different', 'resource', 'configurations', 'on', 'the', 'workflow', 'execution', 'performance', 'therefore', 'justifies', 'the', 'need', 'for', 'collecting', 'such', 'provenance', 'information', 'in', 'the', 'context', 'of', 'cloud', 'the', 'evaluation', 'has', 'also', 'demonstrated', 'that', 'the', 'proposed', 'mapping', 'approaches', 'can', 'capture', 'cloud', 'information', 'in', 'various', 'cloud', 'usage', 'scenarios', 'without', 'causing', 'performance', 'overhead', 'and', 'can', 'also', 'enable', 'the', 'reprovisioning', 'of', 'resources', 'on', 'cloud', 'experiments', 'were', 'conducted', 'using', 'workflows', 'from', 'different', 'scientific', 'domains', 'such', 'as', 'astronomy', 'and', 'neuroscience', 'to', 'demonstrate', 'the', 'applicability', 'of', 'this', 'research', 'for', 'different', 'workflows']]
|
[-0.14204500024270109, 0.014774499318976219, -0.08149080080983713, 0.02942435760294672, -0.10795841948648142, -0.08701694391978283, 0.056150516609267814, 0.4035996861236717, -0.2524650044695929, -0.3791994340645597, 0.11926114999340819, -0.23916466735202327, -0.09336483224214762, 0.2345720832885871, -0.08336961849289405, 0.11430326910046933, 0.11637395212802198, 0.01675188851232781, 0.008949138456053107, -0.23425458945954838, 0.2970214081276569, 0.09683838842054035, 0.3599155282081906, 0.12202762276685053, 0.0398331301872503, -0.016232765463808942, -0.07202093379189398, -0.027535372472353742, -0.05651812347488265, 0.2021742783425477, 0.32141421932651293, 0.29869255009775103, 0.31683389151598823, -0.48170620275935694, -0.21091116007910174, 0.06289894088593767, 0.16977253113963547, 0.05285113163846509, -0.056912976516096656, -0.29978509002289366, 0.08161760326438808, -0.21390193963988302, -0.08410567530907344, -0.13185532607657965, 0.03147962262577381, 0.005547654100282248, -0.24511325420169233, -0.04696150280500477, -0.006230143365421326, 0.10346956813144823, -0.04077362632848207, -0.04719847513727353, 0.013439742339298476, 0.194854254265814, 0.0011407795694725255, 0.014768846844712835, 0.17721243261198547, -0.1501680765627674, -0.15992189243854593, 0.41830192574899094, 0.03237451825655506, -0.14503254581291533, 0.20806346314529664, -0.051865235168230536, -0.16723367024408003, 0.09663623043465926, 0.18067356832361556, 0.044187856170072676, -0.19984711850487966, 0.07216936634793018, 0.039866725989985606, 0.16807818056518292, 0.03903417457472677, 0.06908364348213257, 0.22441938653129853, 0.24980126276464282, 0.06537408918835395, 0.17319028187577445, -0.06333654645971175, -0.14412170711903863, -0.2175549491427752, -0.19458232661745287, -0.1664615344281431, -0.033840313635932553, -0.08947430972815103, -0.14067516236621508, 0.36786698182510547, 0.24672033181125225, 0.15262046985575467, 0.0372146280512192, 0.39071906835938147, 0.014870721679189885, 0.143451126404251, 0.12097837270576825, 0.1236361679909823, -0.0222912103446677, 0.22271936960958752, -0.2006884406107774, 0.14586176748690738, -0.04838455145341135]
|
1,803.06868
|
Generation of ten kilotesla longitudinal magnetic fields in ultraintense
laser-solenoid target interactions
|
Production of the huge longitudinal magnetic fields by using an ultraintense
laser pulse irradiating a solenoid target is considered. Through
three-dimensional particle-in-cell simulations, it is shown that the
longitudinal magnetic field up to ten kilotesla can be observed in the
ultraintense laser-solenoid target interactions. The finding is associated with
both fast and return electron currents in the solenoid target. The huge
longitudinal magnetic field is of interest for a number of important
applications, which include controlling the divergence of laser-driven
energetic particles for medical treatment, fast-ignition in inertial fusion,
etc., as an example, the well focused and confined directional electron beams
are realized by using the solenoid target.
|
physics.plasm-ph physics.optics
|
production of the huge longitudinal magnetic fields by using an ultraintense laser pulse irradiating a solenoid target is considered through threedimensional particleincell simulations it is shown that the longitudinal magnetic field up to ten kilotesla can be observed in the ultraintense lasersolenoid target interactions the finding is associated with both fast and return electron currents in the solenoid target the huge longitudinal magnetic field is of interest for a number of important applications which include controlling the divergence of laserdriven energetic particles for medical treatment fastignition in inertial fusion etc as an example the well focused and confined directional electron beams are realized by using the solenoid target
|
[['production', 'of', 'the', 'huge', 'longitudinal', 'magnetic', 'fields', 'by', 'using', 'an', 'ultraintense', 'laser', 'pulse', 'irradiating', 'a', 'solenoid', 'target', 'is', 'considered', 'through', 'threedimensional', 'particleincell', 'simulations', 'it', 'is', 'shown', 'that', 'the', 'longitudinal', 'magnetic', 'field', 'up', 'to', 'ten', 'kilotesla', 'can', 'be', 'observed', 'in', 'the', 'ultraintense', 'lasersolenoid', 'target', 'interactions', 'the', 'finding', 'is', 'associated', 'with', 'both', 'fast', 'and', 'return', 'electron', 'currents', 'in', 'the', 'solenoid', 'target', 'the', 'huge', 'longitudinal', 'magnetic', 'field', 'is', 'of', 'interest', 'for', 'a', 'number', 'of', 'important', 'applications', 'which', 'include', 'controlling', 'the', 'divergence', 'of', 'laserdriven', 'energetic', 'particles', 'for', 'medical', 'treatment', 'fastignition', 'in', 'inertial', 'fusion', 'etc', 'as', 'an', 'example', 'the', 'well', 'focused', 'and', 'confined', 'directional', 'electron', 'beams', 'are', 'realized', 'by', 'using', 'the', 'solenoid', 'target']]
|
[-0.11821800906964029, 0.2711314357859061, -0.004222496128184112, 0.07351409083354139, -0.01129075610644628, -0.10088310884224756, -0.07861602417341321, 0.4448404697892822, -0.22548211603556004, -0.32495201164943593, 0.034623456066778954, -0.255335168192755, -0.0354731512717276, 0.2953475337719249, 0.020073018267437397, 0.06220039125166346, 0.047369864168707455, 0.048820905644168085, 0.009575050900838225, -0.16106325362713259, 0.26605424499487346, 0.1113384852412148, 0.32576416754903637, 0.06343027970222669, 0.14515353764938277, 0.05179784927847926, -0.009487945209453143, 0.03400904379750245, -0.04444349775882057, 0.07697114427617499, 0.23361122934147716, 0.04320216681547115, 0.25854630631647096, -0.48041542577687824, -0.23363548431058076, 0.041022830459976865, 0.1422114183769396, 0.10245603225824954, -0.15920386768912323, -0.28398377145422954, 0.01426632256273215, -0.17200236758391294, -0.14029358898803035, -0.06600108879365932, 0.025511745496209118, 0.11120380668261166, -0.31684927724162554, 0.0053232448158141606, 0.03759748189031173, 0.09249640152807061, -0.061055436514962085, -0.038356301457420965, 0.008875732468963365, 0.0689389065362809, 0.1110879810022138, 0.12703729297739463, 0.21649817905223398, -0.16912363259237104, -0.10878530709360178, 0.3613269699511127, -0.03108783825474713, -0.17560303934075147, 0.15946101405109478, -0.18942888571106106, -0.012303665702483643, 0.2086277929630792, 0.1907323091878408, 0.11668319270780711, -0.16899306542092116, 0.056249240312124735, -0.01730486670091191, 0.11300407518049545, 0.09986749699417606, -0.008271603216199535, 0.24819943972941594, 0.20567226770690808, 0.03637603343525362, 0.16018550497780024, -0.1638805522897855, -0.03379207384276474, -0.29060372971346443, -0.15033744683785139, -0.17721540766341665, 0.05202916519559711, 0.005737228005978705, -0.13833065257080238, 0.37586301977519887, 0.12320268869003723, 0.1249839556773376, -0.15180478848312398, 0.31783833476566825, 0.09195120722625544, 0.08184248555852013, 0.04299508242554545, 0.2444228785129908, 0.18694866894283027, 0.11045949634982744, -0.23526454055203108, 0.00895431101165503, 0.006140709558728142]
|
1,803.06869
|
Realistic Floquet semimetal with exotic topological linkages between
arbitrarily many nodal loops
|
Valence and conduction bands in nodal loop semimetals (NLSMs) touch along
closed loops in momentum space. If such loops can proliferate and link
intricately, NLSMs become exotic topological phases with unconventional
topological characteristics and potentially peculiar transport properties. In
conventional quantum materials or cold atom systems alike, such exotic phases
necessarily require non-local hopping and are therefore intrinsically
unrealistic. In this work, we show how this hurdle can be surmounted through an
experimentally feasible periodic driving scheme. In particular, by tuning the
period of a two-step periodic driving or some experimentally accessible
parameters, we show how to generate arbitrarily many nodal loops that are
linked with various levels of complexity. Furthermore, we propose to use both
the Berry phase winding and the Alexander polynomial topological invariant to
characterize the fascinating linkages among the nodal loops. This work thus
presents a class of exotic Floquet topological phase that has hitherto not been
proposed in any realistic setup.
|
cond-mat.mes-hall
|
valence and conduction bands in nodal loop semimetals nlsms touch along closed loops in momentum space if such loops can proliferate and link intricately nlsms become exotic topological phases with unconventional topological characteristics and potentially peculiar transport properties in conventional quantum materials or cold atom systems alike such exotic phases necessarily require nonlocal hopping and are therefore intrinsically unrealistic in this work we show how this hurdle can be surmounted through an experimentally feasible periodic driving scheme in particular by tuning the period of a twostep periodic driving or some experimentally accessible parameters we show how to generate arbitrarily many nodal loops that are linked with various levels of complexity furthermore we propose to use both the berry phase winding and the alexander polynomial topological invariant to characterize the fascinating linkages among the nodal loops this work thus presents a class of exotic floquet topological phase that has hitherto not been proposed in any realistic setup
|
[['valence', 'and', 'conduction', 'bands', 'in', 'nodal', 'loop', 'semimetals', 'nlsms', 'touch', 'along', 'closed', 'loops', 'in', 'momentum', 'space', 'if', 'such', 'loops', 'can', 'proliferate', 'and', 'link', 'intricately', 'nlsms', 'become', 'exotic', 'topological', 'phases', 'with', 'unconventional', 'topological', 'characteristics', 'and', 'potentially', 'peculiar', 'transport', 'properties', 'in', 'conventional', 'quantum', 'materials', 'or', 'cold', 'atom', 'systems', 'alike', 'such', 'exotic', 'phases', 'necessarily', 'require', 'nonlocal', 'hopping', 'and', 'are', 'therefore', 'intrinsically', 'unrealistic', 'in', 'this', 'work', 'we', 'show', 'how', 'this', 'hurdle', 'can', 'be', 'surmounted', 'through', 'an', 'experimentally', 'feasible', 'periodic', 'driving', 'scheme', 'in', 'particular', 'by', 'tuning', 'the', 'period', 'of', 'a', 'twostep', 'periodic', 'driving', 'or', 'some', 'experimentally', 'accessible', 'parameters', 'we', 'show', 'how', 'to', 'generate', 'arbitrarily', 'many', 'nodal', 'loops', 'that', 'are', 'linked', 'with', 'various', 'levels', 'of', 'complexity', 'furthermore', 'we', 'propose', 'to', 'use', 'both', 'the', 'berry', 'phase', 'winding', 'and', 'the', 'alexander', 'polynomial', 'topological', 'invariant', 'to', 'characterize', 'the', 'fascinating', 'linkages', 'among', 'the', 'nodal', 'loops', 'this', 'work', 'thus', 'presents', 'a', 'class', 'of', 'exotic', 'floquet', 'topological', 'phase', 'that', 'has', 'hitherto', 'not', 'been', 'proposed', 'in', 'any', 'realistic', 'setup']]
|
[-0.2209118866445258, 0.26727762087466544, -0.06683280451659065, 0.07440665944327171, -0.12061952949406053, -0.2162461505832676, 0.077848290954418, 0.41782368047876306, -0.2739262539678468, -0.27665272407317293, 0.05116187384387908, -0.2463027363201269, -0.22260438023696247, 0.1878222301005362, -0.054639991737367846, 0.0642100562645982, 0.006340259360746505, -0.029555929943363972, -0.06893942861829717, -0.2160833710252355, 0.3328458316301784, -0.05141790464105538, 0.27555472049444246, 0.07178640343213025, 0.013551341683173982, -0.05660802415178086, 0.06506997890354772, 0.04303548634272421, -0.12855315114985644, 0.08772583556651042, 0.27488100103054863, -0.036599290072141834, 0.1752184553621098, -0.4625580688777681, -0.2557829634871525, 0.1118974596566449, 0.19425662501434532, 0.11450662187790164, -0.05355553457794043, -0.28267243940932435, 0.0499719163396945, -0.1662577332746691, -0.15602249941842344, -0.17727854358142792, 0.006695498140731779, -0.03074042562086386, -0.1756113296600793, 0.024577561918144617, 0.03288318208591917, 0.07087525882077618, -0.025228854856835917, -0.04479036834210348, -0.055425007589525566, 0.0998364236826698, 0.02513673518730614, -0.0005870780352359781, 0.08186953621677673, -0.11647951982666153, -0.1858102343439196, 0.3766193063899827, -0.005399387777568056, -0.18861633576736309, 0.2159321852176128, -0.14363558054621814, -0.15121282741594583, 0.15362796454857558, 0.12604601981822783, 0.0782160374115054, -0.11001212791336748, 0.07984402163054209, -0.018834791214873966, 0.11376415240393283, 0.033255153452046216, 0.10467295358196282, 0.2788235922941031, 0.10282886386043034, 0.07225627246579955, 0.14047662553135665, -0.05668832236029303, -0.11480494725028387, -0.2640938318113629, -0.17986058251251683, -0.18236475612801045, 0.04018178691601348, -0.012834177975888358, -0.22329876269512355, 0.4360515975344802, 0.15535125658901122, 0.20799571106759593, -0.06511746785298993, 0.26954525752733344, 0.07352705451791199, 0.06430736384983249, 0.08010038474383645, 0.20843673514620883, 0.08418837286537895, 0.07383218966125964, -0.2349398161033885, 0.06661510795208578, 0.050830743327820435]
|
1,803.0687
|
An invitation to higher Teichm\"uller theory
|
The goal of this article is to invite the reader to get to know and to get
involved into higher Teichm\"uller theory by describing some of its many
facets.
|
math.GT
|
the goal of this article is to invite the reader to get to know and to get involved into higher teichmuller theory by describing some of its many facets
|
[['the', 'goal', 'of', 'this', 'article', 'is', 'to', 'invite', 'the', 'reader', 'to', 'get', 'to', 'know', 'and', 'to', 'get', 'involved', 'into', 'higher', 'teichmuller', 'theory', 'by', 'describing', 'some', 'of', 'its', 'many', 'facets']]
|
[-0.04526258335480916, 0.07191745262464573, -0.11224642669749928, 0.08394717270958013, -0.1830031650847402, -0.1160043195885574, 0.030693282497693496, 0.3134940694375285, -0.30183494810400335, -0.32398682177580634, 0.08116320369700933, -0.3065556375117138, -0.16058738118615642, 0.1668442591125595, -0.17480203175339207, -0.030453241014740718, -0.020998114880559773, 0.13483616830138812, -0.01657810177782486, -0.3345909922801215, 0.3429311969445954, 0.09500324109504962, 0.15607248719556835, 0.08438558927897749, 0.040591931837643015, -0.010609755613680544, -0.050454091922990205, -0.04568987275505888, -0.20219209600753826, 0.23373296860091644, 0.3260931150409682, 0.17719243858651867, 0.3116050056856254, -0.49020996002544615, -0.15640590542220864, 0.0711776901775136, 0.1517431598501922, 0.11015126443114774, 0.03703152206886945, -0.2616326134523441, 0.12985712386153894, -0.12193402519513821, -0.2004838203208457, -0.09759196920063475, 0.009355506950041986, -0.020438662890730232, -0.1287524438431037, -0.09717759852907781, 0.07938394033960228, 0.015254988763601807, 0.016023057155664367, -0.09056066532201808, -0.00976095457786116, 0.23819265195072212, 0.14803630504596593, 0.10115496785347831, 0.07482190004646264, -0.14455439438561685, -0.05483843363693048, 0.44823139649012994, 0.041623753399170675, -0.21867361664772034, 0.19386045811376695, -0.1999173685266026, -0.13247379005469126, 0.11198580682534597, 0.18330576653784975, 0.0654478963657186, -0.15989477203452382, 0.0362268624293361, 0.006461029711725383, 0.11480548230385215, 0.07071904349943688, 0.03701497668978469, 0.15660446633359995, 0.11004488541070244, 0.07803895304999153, 0.12569048404211886, 0.08104570781619384, -0.10692264500941182, -0.3128359866296423, -0.2235416635742475, -0.12444714662329905, 0.08413797170566074, 0.01861545125650772, -0.16252703431608348, 0.4080458333523109, 0.22807063422454843, 0.22067705291355477, 0.06412408414200463, 0.2487674281001091, 0.05892202887555648, -0.0024808589529631466, -0.0022152417644472986, 0.1884980608341846, 0.16959455141251714, 0.11595107833373136, -0.09851434436658847, 0.01722722921263555, 0.08908427476176414]
|
1,803.06871
|
Symbol-Level Precoding Design for Max-Min SINR in Multiuser MISO
Broadcast Channels
|
In this paper, we address the symbol level precoding (SLP) design problem
under max-min SINR criterion in the downlink of multiuser multiple-input
single-output (MISO) channels. First, we show that the distance preserving
constructive interference regions (DPCIR) are always polyhedral angles (shifted
pointed cones) for any given constellation point with unbounded decision
region. Then we prove that any signal in a given unbounded DPCIR has a norm
larger than the norm of the corresponding vertex if and only if the convex hull
of the constellation contains the origin. Using these properties, we show that
the power of the noiseless received signal lying on an unbounded DPCIR is an
strictly increasing function of two parameters. This allows us to reformulate
the originally non-convex SLP max-min SINR as a convex optimization problem. We
discuss the loss due to our proposed convex reformulation and provide some
simulation results.
|
cs.IT eess.SP math.IT
|
in this paper we address the symbol level precoding slp design problem under maxmin sinr criterion in the downlink of multiuser multipleinput singleoutput miso channels first we show that the distance preserving constructive interference regions dpcir are always polyhedral angles shifted pointed cones for any given constellation point with unbounded decision region then we prove that any signal in a given unbounded dpcir has a norm larger than the norm of the corresponding vertex if and only if the convex hull of the constellation contains the origin using these properties we show that the power of the noiseless received signal lying on an unbounded dpcir is an strictly increasing function of two parameters this allows us to reformulate the originally nonconvex slp maxmin sinr as a convex optimization problem we discuss the loss due to our proposed convex reformulation and provide some simulation results
|
[['in', 'this', 'paper', 'we', 'address', 'the', 'symbol', 'level', 'precoding', 'slp', 'design', 'problem', 'under', 'maxmin', 'sinr', 'criterion', 'in', 'the', 'downlink', 'of', 'multiuser', 'multipleinput', 'singleoutput', 'miso', 'channels', 'first', 'we', 'show', 'that', 'the', 'distance', 'preserving', 'constructive', 'interference', 'regions', 'dpcir', 'are', 'always', 'polyhedral', 'angles', 'shifted', 'pointed', 'cones', 'for', 'any', 'given', 'constellation', 'point', 'with', 'unbounded', 'decision', 'region', 'then', 'we', 'prove', 'that', 'any', 'signal', 'in', 'a', 'given', 'unbounded', 'dpcir', 'has', 'a', 'norm', 'larger', 'than', 'the', 'norm', 'of', 'the', 'corresponding', 'vertex', 'if', 'and', 'only', 'if', 'the', 'convex', 'hull', 'of', 'the', 'constellation', 'contains', 'the', 'origin', 'using', 'these', 'properties', 'we', 'show', 'that', 'the', 'power', 'of', 'the', 'noiseless', 'received', 'signal', 'lying', 'on', 'an', 'unbounded', 'dpcir', 'is', 'an', 'strictly', 'increasing', 'function', 'of', 'two', 'parameters', 'this', 'allows', 'us', 'to', 'reformulate', 'the', 'originally', 'nonconvex', 'slp', 'maxmin', 'sinr', 'as', 'a', 'convex', 'optimization', 'problem', 'we', 'discuss', 'the', 'loss', 'due', 'to', 'our', 'proposed', 'convex', 'reformulation', 'and', 'provide', 'some', 'simulation', 'results']]
|
[-0.20214447751964648, 0.00031744276990745374, -0.03683331745924079, 0.046772667021691125, -0.09494886876200326, -0.18637311564978315, 0.07166919113094788, 0.3685667733209104, -0.31189123813399217, -0.1930043162428774, 0.09376977420712744, -0.2606506984012513, -0.21144368002165315, 0.11939845512258923, -0.1562042810855928, 0.07109245501406905, 0.051354218552458204, 0.04117388186265695, -0.10166109510302906, -0.2682435330449759, 0.32135136945483583, 0.0439964187098667, 0.25778892915695906, 0.059607806775198294, 0.11958114181627227, 0.045863355862416536, 0.034615988616779864, 0.0029922685142891067, -0.12360998434284436, 0.08974898827081132, 0.3254820155076838, 0.25203330150462633, 0.30750609039710575, -0.3806099813923033, -0.19821768239792922, 0.18289072897621533, 0.14669914828522856, 0.014039636670430709, -0.058109778127699324, -0.24409528151348545, 0.13533472126437118, -0.14852267224826696, -0.06804560000697772, 0.04415941147534694, -0.05326343448703281, -0.0009574432721516738, -0.35962759612205747, 0.002241617039544508, 0.07231494608519522, 0.03444044982057272, -0.08829796362462933, -0.1703646636095881, 0.023404752293976747, 0.061343420241933524, 0.027397394207784802, 0.03445645310360609, 0.06292315063183196, -0.05021407745738947, -0.10288188419912735, 0.35864952466605854, 0.019315072051843647, -0.2935598601955765, 0.1272034459786179, -0.15860096658838707, -0.08376125370462735, 0.16422665667940034, 0.2104244937234196, 0.11258201336992595, -0.14550518550418523, 0.10575922425535585, -0.10730144743380758, 0.15519232307047381, 0.1231136255891114, 0.09639087372569419, 0.12666609296219475, 0.1313408218168964, 0.23135489054968478, 0.21360906737552593, -0.10107109060239357, -0.10680508385283044, -0.2953707328156775, -0.10106351431911914, -0.20130091424410543, 0.01346663113993903, -0.11792580760387257, -0.11914442281057644, 0.34423232978830737, 0.1143582615526005, 0.1684364205575548, 0.16448043833305645, 0.3614876816217374, 0.16779024585654648, 0.01079689187463373, 0.12580664104704434, 0.21528478698362757, 0.15004725442688344, 0.051704185587974884, -0.22052726840774994, 0.042043495197301835, 0.06201728760303619]
|
1,803.06872
|
The group generated by Riordan involutions
|
We prove that any element in the group generated by the Riordan involutions
is the product of at most four of them. We also give a description of this
subgroup as a semidirect product of a special subgroup of the commutator
subgroup and the Klein four-group.
|
math.GR
|
we prove that any element in the group generated by the riordan involutions is the product of at most four of them we also give a description of this subgroup as a semidirect product of a special subgroup of the commutator subgroup and the klein fourgroup
|
[['we', 'prove', 'that', 'any', 'element', 'in', 'the', 'group', 'generated', 'by', 'the', 'riordan', 'involutions', 'is', 'the', 'product', 'of', 'at', 'most', 'four', 'of', 'them', 'we', 'also', 'give', 'a', 'description', 'of', 'this', 'subgroup', 'as', 'a', 'semidirect', 'product', 'of', 'a', 'special', 'subgroup', 'of', 'the', 'commutator', 'subgroup', 'and', 'the', 'klein', 'fourgroup']]
|
[-0.19593003382096472, 0.10553561414227537, -0.07634501941704555, 0.015507712879258654, -0.09970254082556652, -0.05135120055638254, 0.06279847303243435, 0.3505557421594858, -0.32729462089027156, -0.21611060975524393, 0.14823266263271723, -0.28793468043390336, -0.11998870893907936, 0.20116704615318906, -0.11765907198676596, -0.07973619166861444, 0.04971947480479012, 0.14203787396621445, -0.11099441299397174, -0.23001676392943962, 0.4116898967843989, -0.047826511380465134, 0.22769857135236912, 0.003210150656978721, 0.08961560011274465, 0.00010265935333850591, -0.04081779131260903, -0.07263230963650605, -0.08262108479523347, 0.0933789259997075, 0.23741272067570168, 0.05894806492648533, 0.19689804611160702, -0.37462594720494485, -0.11506144484788504, 0.18954158169419869, 0.14741063208076294, 0.00782897282877694, -0.10617958428844324, -0.2841983326184361, 0.08780105005058905, -0.26865666509484465, -0.13430471417656087, -0.01860316238447052, 0.08368707472539466, -0.04740690897502329, -0.21110653345797048, -0.013715208473276225, 0.09292409443498953, 0.10287408773665843, 0.021220533647979406, -0.10190402633389053, -0.03389417794128151, 0.10789901065721136, 0.03209061529386141, -0.013633473124608154, 0.06786249231790072, -0.0747051254755048, -0.14911000636082306, 0.4690552499631177, -0.0824346685093706, -0.21009415080365929, 0.0930400720352064, -0.19721653720404467, -0.2044590352629514, 0.05595724798141695, 0.06440783879193275, 0.1627287717698061, -0.04579882601114071, 0.1525913458102403, -0.21154543354540414, 0.047500433491380965, 0.08446201586933888, -0.04128361913456541, 0.0605360597938947, 0.09627835472802752, 0.06901939326654309, 0.15403058145033277, 0.06027982135381772, 0.09168281928514657, -0.4004978847730419, -0.28866587585324177, -0.11657024270085536, 0.1170703468479864, -0.13159421071095098, -0.20132171127783216, 0.4827996320698572, 0.06573509631435508, 0.11997501022668312, 0.06664296519011259, 0.18096678468155797, 0.07425439934519565, 0.10431026910310207, 0.1007871334137314, 0.1051940284062015, 0.21768520862046306, -0.1549020994292653, -0.17416261890700654, -0.027763571154893092, 0.22906226195071056]
|
1,803.06873
|
The eBDIMS path-sampling server: generation, classification and
interactive visualization of protein ensembles and transition pathways in
2D-motion space
|
The recent rise of cryo-EM and X-ray high-throughput techniques is providing
a wealth of new structures trapped in different conformations. Understanding
how proteins transition between different conformers, and how they relate to
each other in terms of function is not straightforward, and highly depends on
the choice of the right set of degrees of freedom. Here we present eBDIMS
server, an online tool and software for automatic classification of structural
ensembles and reconstruction of transition pathways using coarse-grained (CG)
simulations. The server generates CG-pathways between two protein conformations
along with a representation in a simplified 2D-motion landscape based on the
Principal Components (PCs) from experimental structures. For a conformationally
rich ensemble, the PCs provide powerful reaction coordinates for automatic
structure classification, detection of on-pathway intermediates and validation
of in silico pathways. When the number of available structures is low or
sampling is limited, Normal Modes (NMs) provide alternative motion axes for
trajectory analysis. The path-generation eBDIMS method is available at a
user-friendly website: https://login.biophysics.kth.se/eBDIMS/ or as standalone
software. The server incorporates a powerful interactive graphical interface
for simultaneous visualization of transition pathways in 2D-motion space and
3D-molecular graphics, which greatly facilitates the exploration of the
relationships between different conformations.
|
q-bio.BM
|
the recent rise of cryoem and xray highthroughput techniques is providing a wealth of new structures trapped in different conformations understanding how proteins transition between different conformers and how they relate to each other in terms of function is not straightforward and highly depends on the choice of the right set of degrees of freedom here we present ebdims server an online tool and software for automatic classification of structural ensembles and reconstruction of transition pathways using coarsegrained cg simulations the server generates cgpathways between two protein conformations along with a representation in a simplified 2dmotion landscape based on the principal components pcs from experimental structures for a conformationally rich ensemble the pcs provide powerful reaction coordinates for automatic structure classification detection of onpathway intermediates and validation of in silico pathways when the number of available structures is low or sampling is limited normal modes nms provide alternative motion axes for trajectory analysis the pathgeneration ebdims method is available at a userfriendly website httpsloginbiophysicskthseebdims or as standalone software the server incorporates a powerful interactive graphical interface for simultaneous visualization of transition pathways in 2dmotion space and 3dmolecular graphics which greatly facilitates the exploration of the relationships between different conformations
|
[['the', 'recent', 'rise', 'of', 'cryoem', 'and', 'xray', 'highthroughput', 'techniques', 'is', 'providing', 'a', 'wealth', 'of', 'new', 'structures', 'trapped', 'in', 'different', 'conformations', 'understanding', 'how', 'proteins', 'transition', 'between', 'different', 'conformers', 'and', 'how', 'they', 'relate', 'to', 'each', 'other', 'in', 'terms', 'of', 'function', 'is', 'not', 'straightforward', 'and', 'highly', 'depends', 'on', 'the', 'choice', 'of', 'the', 'right', 'set', 'of', 'degrees', 'of', 'freedom', 'here', 'we', 'present', 'ebdims', 'server', 'an', 'online', 'tool', 'and', 'software', 'for', 'automatic', 'classification', 'of', 'structural', 'ensembles', 'and', 'reconstruction', 'of', 'transition', 'pathways', 'using', 'coarsegrained', 'cg', 'simulations', 'the', 'server', 'generates', 'cgpathways', 'between', 'two', 'protein', 'conformations', 'along', 'with', 'a', 'representation', 'in', 'a', 'simplified', '2dmotion', 'landscape', 'based', 'on', 'the', 'principal', 'components', 'pcs', 'from', 'experimental', 'structures', 'for', 'a', 'conformationally', 'rich', 'ensemble', 'the', 'pcs', 'provide', 'powerful', 'reaction', 'coordinates', 'for', 'automatic', 'structure', 'classification', 'detection', 'of', 'onpathway', 'intermediates', 'and', 'validation', 'of', 'in', 'silico', 'pathways', 'when', 'the', 'number', 'of', 'available', 'structures', 'is', 'low', 'or', 'sampling', 'is', 'limited', 'normal', 'modes', 'nms', 'provide', 'alternative', 'motion', 'axes', 'for', 'trajectory', 'analysis', 'the', 'pathgeneration', 'ebdims', 'method', 'is', 'available', 'at', 'a', 'userfriendly', 'website', 'httpsloginbiophysicskthseebdims', 'or', 'as', 'standalone', 'software', 'the', 'server', 'incorporates', 'a', 'powerful', 'interactive', 'graphical', 'interface', 'for', 'simultaneous', 'visualization', 'of', 'transition', 'pathways', 'in', '2dmotion', 'space', 'and', '3dmolecular', 'graphics', 'which', 'greatly', 'facilitates', 'the', 'exploration', 'of', 'the', 'relationships', 'between', 'different', 'conformations']]
|
[-0.10370814793506744, 0.08665176688573127, -0.09658638629088193, 0.03621088398603597, -0.088069597977561, -0.16903883576817771, 0.05775190394255936, 0.41104577134551545, -0.2714245843150957, -0.310426760735135, 0.04233824003697735, -0.25288999425199055, -0.15661473762137826, 0.20786408426896355, -0.006370774071562282, 0.018616539513007038, 0.12262548897125869, 0.004171919963416677, -0.03462751326090873, -0.16494745266903674, 0.25112544878028875, 0.07403166455318042, 0.3155641404868446, 0.03596057944540224, 0.1053981811068759, 0.03323150434594003, -0.025611941987368728, -0.02220917957273331, -0.13922972792947733, 0.1849640579131152, 0.2874267735202444, 0.17287936102878784, 0.24393747253415846, -0.4360721803033831, -0.1832944674277437, 0.043110154102281355, 0.16426553599864555, 0.12330370800692704, -0.05751687769990395, -0.2616513099164311, 0.05275595072690648, -0.14465226160381664, -0.0631502663422318, -0.1274015211447147, -0.008306137424256711, 0.041649696115558785, -0.23947508851400398, 0.08341460791657741, -0.016612053861017606, 0.13471824596298212, -0.04790904642676288, -0.09665356096304914, -0.036879368607736544, 0.18067065506484095, 0.00027470308635866393, 0.016945737776728927, 0.18224008575397294, -0.13304268525324647, -0.1363810006302294, 0.3739499796273602, 0.007960704283142182, -0.20089043627391748, 0.2547414424320094, -0.04102222770066459, -0.1862365709656338, 0.15381826483282632, 0.16601449351274009, 0.1166211558298396, -0.17137241162972855, 0.03428821430051183, 0.03605690282206123, 0.19353197183981152, 0.044702037654990825, 0.0010752472833493831, 0.2204280032202061, 0.22304506820368392, 0.037307176307961765, 0.1534469963875937, -0.0796417466948687, -0.08819802252363433, -0.23824022741447845, -0.1889096516416133, -0.16543711941216355, -0.02172491479097441, -0.1048980354002847, -0.21573962978150096, 0.404417037770847, 0.10083255927269033, 0.18314300378702503, 0.020169427778229235, 0.30875370330285823, -0.009653358595910811, 0.06840258707905217, 0.04389020181116238, 0.1448693591455924, 0.07800774245252688, 0.07192518097623565, -0.18680769773598258, 0.10523699455076607, 0.03532418603478048]
|
1,803.06874
|
Multi-Codec DASH Dataset
|
The number of bandwidth-hungry applications and services is constantly
growing. HTTP adaptive streaming of audio-visual content accounts for the
majority of today's internet traffic. Although the internet bandwidth increases
also constantly, audio-visual compression technology is inevitable and we are
currently facing the challenge to be confronted with multiple video codecs.
This paper proposes a multi-codec DASH dataset comprising AVC, HEVC, VP9, and
AV1 in order to enable interoperability testing and streaming experiments for
the efficient usage of these codecs under various conditions. We adopt state of
the art encoding and packaging options and also provide basic quality metrics
along with the DASH segments. Additionally, we briefly introduce a multi-codec
DASH scheme and possible usage scenarios. Finally, we provide a preliminary
evaluation of the encoding efficiency in the context of HTTP adaptive streaming
services and applications.
|
cs.MM
|
the number of bandwidthhungry applications and services is constantly growing http adaptive streaming of audiovisual content accounts for the majority of todays internet traffic although the internet bandwidth increases also constantly audiovisual compression technology is inevitable and we are currently facing the challenge to be confronted with multiple video codecs this paper proposes a multicodec dash dataset comprising avc hevc vp9 and av1 in order to enable interoperability testing and streaming experiments for the efficient usage of these codecs under various conditions we adopt state of the art encoding and packaging options and also provide basic quality metrics along with the dash segments additionally we briefly introduce a multicodec dash scheme and possible usage scenarios finally we provide a preliminary evaluation of the encoding efficiency in the context of http adaptive streaming services and applications
|
[['the', 'number', 'of', 'bandwidthhungry', 'applications', 'and', 'services', 'is', 'constantly', 'growing', 'http', 'adaptive', 'streaming', 'of', 'audiovisual', 'content', 'accounts', 'for', 'the', 'majority', 'of', 'todays', 'internet', 'traffic', 'although', 'the', 'internet', 'bandwidth', 'increases', 'also', 'constantly', 'audiovisual', 'compression', 'technology', 'is', 'inevitable', 'and', 'we', 'are', 'currently', 'facing', 'the', 'challenge', 'to', 'be', 'confronted', 'with', 'multiple', 'video', 'codecs', 'this', 'paper', 'proposes', 'a', 'multicodec', 'dash', 'dataset', 'comprising', 'avc', 'hevc', 'vp9', 'and', 'av1', 'in', 'order', 'to', 'enable', 'interoperability', 'testing', 'and', 'streaming', 'experiments', 'for', 'the', 'efficient', 'usage', 'of', 'these', 'codecs', 'under', 'various', 'conditions', 'we', 'adopt', 'state', 'of', 'the', 'art', 'encoding', 'and', 'packaging', 'options', 'and', 'also', 'provide', 'basic', 'quality', 'metrics', 'along', 'with', 'the', 'dash', 'segments', 'additionally', 'we', 'briefly', 'introduce', 'a', 'multicodec', 'dash', 'scheme', 'and', 'possible', 'usage', 'scenarios', 'finally', 'we', 'provide', 'a', 'preliminary', 'evaluation', 'of', 'the', 'encoding', 'efficiency', 'in', 'the', 'context', 'of', 'http', 'adaptive', 'streaming', 'services', 'and', 'applications']]
|
[-0.17467012955581374, 0.05400246153691445, -0.01776885359096482, 0.01593173667876699, -0.09787840709472992, -0.1564545324954176, 0.0659539801444308, 0.4474739328140982, -0.266447205837308, -0.31533055950069067, 0.14635002567030658, -0.2737664031640937, -0.14468362855470993, 0.23551941746281405, -0.1580381949421611, 0.07922679839380593, 0.09085765039851663, 0.008458159635086882, 0.004661437652733487, -0.313517451700825, 0.28363535932801437, 0.09537835132725762, 0.40366854862959095, 0.058323280848333416, 0.08522273262849811, 0.011287246804303404, -0.1079834955479865, -0.0342615739456519, -0.11235923759963815, 0.17187761961637685, 0.32174324201927945, 0.2502753542104267, 0.3050818783478021, -0.43235269770251983, -0.19732188041874024, 0.039841827430130004, 0.16655977908345504, 0.09503648465276153, -0.14333332263126838, -0.2899940832038269, 0.13158689570352153, -0.26323860519650305, -0.032549469384266005, -0.07165037064502637, -0.000668278231773222, 0.05337407772965504, -0.281382818325338, -0.0012810190307914816, -0.034558641831884444, 0.05670993080694285, -0.0597313595256613, -0.05486154632473534, 0.059408330703401145, 0.17786418721362046, 0.03591006574093957, -0.00035552541852336037, 0.1504949146782923, -0.17626404353712022, -0.13210151339422516, 0.4288956001824276, -0.031805318723358636, -0.14099234330492574, 0.19573462215449774, 0.04148896057934811, -0.10110946464335553, 0.0592291509330442, 0.23249933043861706, 0.04780255858504185, -0.15718535258025496, 0.03926674964499067, 0.013637693076761383, 0.18880103476641868, 0.09007238965502685, 0.11129045750324924, 0.1541486631260451, 0.2509441503524696, 0.05077608103976783, 0.13776060633597698, -0.09921346136693363, -0.09444496141452075, -0.2080492205343696, -0.18162267917245062, -0.09895367093849927, -0.05907773938396889, -0.10888227152507611, -0.14153314203334352, 0.3687867579804361, 0.2569115770500944, 0.12935179989665013, 0.07075017268741221, 0.4152206903972635, -0.022592002443023815, 0.0925435941916834, 0.14173135562150768, 0.09303700309035114, -0.04018616872472745, 0.22173423261494574, -0.13571867036146365, 0.06954488844370865, -0.014716007758000738]
|
1,803.06875
|
On the streaming complexity of fundamental geometric problems
|
In this paper, we focus on lower bounds and algorithms for some basic
geometric problems in the one-pass (insertion only) streaming model. The
problems considered are grouped into three categories:
(i) Klee's measure
(ii) Convex body approximation, geometric query, and
(iii) Discrepancy
Klee's measure is the problem of finding the area of the union of
hyperrectangles. Under convex body approximation, we consider the problems of
convex hull, convex body approximation, linear programming in fixed dimensions.
The results for convex body approximation implies a property testing type
result to find if a query point lies inside a convex polyhedron. Under
discrepancy, we consider both the geometric and combinatorial discrepancy. For
all the problems considered, we present (randomized) lower bounds on space.
Most of our lower bounds are in terms of approximating the solution with
respect to an error parameter $\epsilon$. We provide approximation algorithms
that closely match the lower bound on space for most of the problems.
|
cs.CG
|
in this paper we focus on lower bounds and algorithms for some basic geometric problems in the onepass insertion only streaming model the problems considered are grouped into three categories i klees measure ii convex body approximation geometric query and iii discrepancy klees measure is the problem of finding the area of the union of hyperrectangles under convex body approximation we consider the problems of convex hull convex body approximation linear programming in fixed dimensions the results for convex body approximation implies a property testing type result to find if a query point lies inside a convex polyhedron under discrepancy we consider both the geometric and combinatorial discrepancy for all the problems considered we present randomized lower bounds on space most of our lower bounds are in terms of approximating the solution with respect to an error parameter epsilon we provide approximation algorithms that closely match the lower bound on space for most of the problems
|
[['in', 'this', 'paper', 'we', 'focus', 'on', 'lower', 'bounds', 'and', 'algorithms', 'for', 'some', 'basic', 'geometric', 'problems', 'in', 'the', 'onepass', 'insertion', 'only', 'streaming', 'model', 'the', 'problems', 'considered', 'are', 'grouped', 'into', 'three', 'categories', 'i', 'klees', 'measure', 'ii', 'convex', 'body', 'approximation', 'geometric', 'query', 'and', 'iii', 'discrepancy', 'klees', 'measure', 'is', 'the', 'problem', 'of', 'finding', 'the', 'area', 'of', 'the', 'union', 'of', 'hyperrectangles', 'under', 'convex', 'body', 'approximation', 'we', 'consider', 'the', 'problems', 'of', 'convex', 'hull', 'convex', 'body', 'approximation', 'linear', 'programming', 'in', 'fixed', 'dimensions', 'the', 'results', 'for', 'convex', 'body', 'approximation', 'implies', 'a', 'property', 'testing', 'type', 'result', 'to', 'find', 'if', 'a', 'query', 'point', 'lies', 'inside', 'a', 'convex', 'polyhedron', 'under', 'discrepancy', 'we', 'consider', 'both', 'the', 'geometric', 'and', 'combinatorial', 'discrepancy', 'for', 'all', 'the', 'problems', 'considered', 'we', 'present', 'randomized', 'lower', 'bounds', 'on', 'space', 'most', 'of', 'our', 'lower', 'bounds', 'are', 'in', 'terms', 'of', 'approximating', 'the', 'solution', 'with', 'respect', 'to', 'an', 'error', 'parameter', 'epsilon', 'we', 'provide', 'approximation', 'algorithms', 'that', 'closely', 'match', 'the', 'lower', 'bound', 'on', 'space', 'for', 'most', 'of', 'the', 'problems']]
|
[-0.10227811469947203, 0.015930270632219246, -0.053587716252551244, 0.10067445636153795, -0.061380153126381815, -0.1443286003359856, 0.07990029771164513, 0.34042271384252953, -0.29545904580915633, -0.2778674541806163, 0.1309413158794483, -0.2795538746465284, -0.1378504671365357, 0.21222489126450503, -0.15556439331983432, 0.08669191867095204, 0.05911653673646446, 0.013575562507470842, -0.10478484365138194, -0.28238831014217186, 0.33131154011099195, -0.05652967486411142, 0.21677810493379068, 0.07026574454264334, 0.08468271945961393, 0.0035453769258963755, 0.008551798866858754, 0.0800992293243792, -0.1956496287784364, 0.16902539394392918, 0.2642846522518458, 0.21608871776753893, 0.2887184342476897, -0.41015933282100236, -0.14622426795391127, 0.13049941942191276, 0.11579720461024688, 0.046718081361457456, -0.052184798377894394, -0.20847645969330095, 0.0788338590437212, -0.06348168420103881, -0.08983555898810618, -0.014265916584871518, 0.0200657882870963, -0.008999554726939935, -0.30528907790684545, 0.03919284807470364, 0.10100151551215766, 0.02494894802508404, -0.12691485292564791, -0.1727369046154005, 0.11713371744218211, 0.05937141683907845, 0.040759907133178785, 0.06129049622000028, 0.08248204263882378, -0.0815006101799484, -0.1448940296324555, 0.4019119242588297, -0.02535557726887652, -0.27203418351844166, 0.16076056784890497, -0.13820503613887689, -0.1650019797618883, 0.10735749434799147, 0.23229499354074973, 0.1572152632437885, -0.11709714640313998, 0.1630911251357667, -0.10854883626915324, 0.10252693689518566, 0.07527530830329618, 0.03235917961081633, 0.10145933876554362, 0.14814107375852287, 0.19060262072329912, 0.18354705975611862, -0.048087860826247684, -0.12101533687195908, -0.33112067337004614, -0.11516012263802203, -0.21332887269911738, -0.053433328204286784, -0.17934787196962787, -0.20212408127516915, 0.32825217726162803, 0.08489729798972033, 0.1893395915006598, 0.15941072141494936, 0.2947799841192766, 0.11771469417651996, -0.0027130502947749426, 0.14219760224342537, 0.22043083511081746, 0.1027493708474466, -0.016828889791400004, -0.18452134462467468, 0.09277272225023271, 0.15313759133464488]
|
1,803.06876
|
Generalised Net Convergence Structures in Posets
|
In this paper, we introduce the notion of $\mathcal{M}$-convergence and
$\mathcal{MN}$-convergence structures in posets, which, in some sense,
generalise the well-known Scott-convergence and order-convergence structures.
As results, we give a necessary and sufficient conditions for each generalised
convergence structures being topological. These results then imply the
following two well-established results: (1) The Scott-convergence structure in
a poset $P$ is topological if and only if $P$ is continuous, and (2) The
order-convergence structure in a poset $P$ is topological if and only if $P$ is
$\mathcal{R}^*$-doubly continuous.
|
math.GN
|
in this paper we introduce the notion of mathcalmconvergence and mathcalmnconvergence structures in posets which in some sense generalise the wellknown scottconvergence and orderconvergence structures as results we give a necessary and sufficient conditions for each generalised convergence structures being topological these results then imply the following two wellestablished results 1 the scottconvergence structure in a poset p is topological if and only if p is continuous and 2 the orderconvergence structure in a poset p is topological if and only if p is mathcalrdoubly continuous
|
[['in', 'this', 'paper', 'we', 'introduce', 'the', 'notion', 'of', 'mathcalmconvergence', 'and', 'mathcalmnconvergence', 'structures', 'in', 'posets', 'which', 'in', 'some', 'sense', 'generalise', 'the', 'wellknown', 'scottconvergence', 'and', 'orderconvergence', 'structures', 'as', 'results', 'we', 'give', 'a', 'necessary', 'and', 'sufficient', 'conditions', 'for', 'each', 'generalised', 'convergence', 'structures', 'being', 'topological', 'these', 'results', 'then', 'imply', 'the', 'following', 'two', 'wellestablished', 'results', '1', 'the', 'scottconvergence', 'structure', 'in', 'a', 'poset', 'p', 'is', 'topological', 'if', 'and', 'only', 'if', 'p', 'is', 'continuous', 'and', '2', 'the', 'orderconvergence', 'structure', 'in', 'a', 'poset', 'p', 'is', 'topological', 'if', 'and', 'only', 'if', 'p', 'is', 'mathcalrdoubly', 'continuous']]
|
[-0.12225302099537702, 0.15129305118189, -0.10440537973916457, 0.0811263226579162, -0.07712551064639823, -0.13384560292678666, 0.007732812101078898, 0.36807860861773845, -0.33774095670216614, -0.21638968774335987, 0.10990506452996927, -0.22603527957826486, -0.21133660423902817, 0.14322711069734745, -0.09972651732832562, 0.009187742475604202, 0.03892266077713834, 0.08801207036630791, -0.07014407199106099, -0.2724798838004332, 0.37207890430718293, -0.05972937664683954, 0.22945839801320322, 0.086327117373362, 0.050756239188536084, -0.014016657464068246, 0.03175519540385677, 0.06967444663269469, -0.21240841639860544, 0.08770659964180977, 0.2300876089728173, 0.12434770799253458, 0.25924493306327934, -0.35956295502636537, -0.13163633178344664, 0.1362546164151511, 0.09016834881823556, 0.05340904563257218, -0.031752678473698503, -0.23968393583839506, 0.2139876173855162, -0.1275197202196046, -0.09095159703348246, -0.08704652533762985, 0.0820727697401135, 0.03641686963354364, -0.2924585363175145, -0.0014112436235594896, 0.17185941752460268, 0.06242556322687938, -0.08020219828841495, -0.07805655417205007, -0.05454354743289267, 0.06704162697043316, -0.031107053057187133, 0.023330336361893533, 0.011135536976112628, -0.09084234823311829, -0.1551130140548066, 0.40462277089188126, -0.0023084883980544996, -0.23092305779825023, 0.1795210782898429, -0.21006198237034965, -0.2086128466475157, 0.09018523403569872, 0.06868310045899341, 0.11718927040972092, -0.04930973099113477, 0.14554621865771664, -0.10591417068132648, 0.13438201507835154, 0.09033884211546844, 0.034885427351167175, 0.11752147594880727, 0.12713628017378073, 0.12672652412251925, 0.14147855779213578, -0.022025955748962767, -0.0019554312076465585, -0.3475409784155932, -0.18360925265760333, -0.1442014925888981, 0.05338463959870515, -0.04019421041708865, -0.15600856270692828, 0.37250364001518416, 0.11806214081100476, 0.23063810691697362, 0.05893040327843922, 0.2452919876984792, 0.06047144013149434, 0.010750932889174164, 0.08209444353655901, 0.1377395954357466, 0.17384345758200428, 0.01502717273125862, -0.10200206999218574, 0.0802895121195894, 0.1190046293741483]
|
1,803.06877
|
The mm-wave compact component of AGN
|
mm-wave emission from Active Galactic Nuclei (AGN) may hold the key to
understanding the physical origin of their radio cores. The correlation between
radio/mm and X-ray luminosity may suggest a similar physical origin of the two
sources. Since synchrotron self absorption decreases with frequency, mm-waves
probe smaller length scales than cm-waves. We report on 100 GHz (3 mm)
observations with CARMA of 26 AGNs selected from the hard X-ray Swift/BAT
survey. 20/26 targets were detected at 100 GHz down to the 1 mJy (3 $\sigma$)
sensitivity, which corresponds to optically thick synchrotron source sizes of
10$^{-4}$ - 10$^{-3}$ pc). Most sources show a 100 GHz flux excess with respect
to the spectral slope extrapolated from low frequencies. This mm spectral
component likely originates from smaller scales than the few-GHz emission. The
measured mm sources lie roughly around the L$_{mm}$ (100 GHz) $\sim$ 10$^{-1}$
L$_{X}$ (2-10 keV) relation, similar to a few previously published X-ray
selected sources, and hinting perhaps at a common coronal origin.
|
astro-ph.GA astro-ph.HE
|
mmwave emission from active galactic nuclei agn may hold the key to understanding the physical origin of their radio cores the correlation between radiomm and xray luminosity may suggest a similar physical origin of the two sources since synchrotron self absorption decreases with frequency mmwaves probe smaller length scales than cmwaves we report on 100 ghz 3 mm observations with carma of 26 agns selected from the hard xray swiftbat survey 2026 targets were detected at 100 ghz down to the 1 mjy 3 sigma sensitivity which corresponds to optically thick synchrotron source sizes of 104 103 pc most sources show a 100 ghz flux excess with respect to the spectral slope extrapolated from low frequencies this mm spectral component likely originates from smaller scales than the fewghz emission the measured mm sources lie roughly around the l_mm 100 ghz sim 101 l_x 210 kev relation similar to a few previously published xray selected sources and hinting perhaps at a common coronal origin
|
[['mmwave', 'emission', 'from', 'active', 'galactic', 'nuclei', 'agn', 'may', 'hold', 'the', 'key', 'to', 'understanding', 'the', 'physical', 'origin', 'of', 'their', 'radio', 'cores', 'the', 'correlation', 'between', 'radiomm', 'and', 'xray', 'luminosity', 'may', 'suggest', 'a', 'similar', 'physical', 'origin', 'of', 'the', 'two', 'sources', 'since', 'synchrotron', 'self', 'absorption', 'decreases', 'with', 'frequency', 'mmwaves', 'probe', 'smaller', 'length', 'scales', 'than', 'cmwaves', 'we', 'report', 'on', '100', 'ghz', '3', 'mm', 'observations', 'with', 'carma', 'of', '26', 'agns', 'selected', 'from', 'the', 'hard', 'xray', 'swiftbat', 'survey', '2026', 'targets', 'were', 'detected', 'at', '100', 'ghz', 'down', 'to', 'the', '1', 'mjy', '3', 'sigma', 'sensitivity', 'which', 'corresponds', 'to', 'optically', 'thick', 'synchrotron', 'source', 'sizes', 'of', '104', '103', 'pc', 'most', 'sources', 'show', 'a', '100', 'ghz', 'flux', 'excess', 'with', 'respect', 'to', 'the', 'spectral', 'slope', 'extrapolated', 'from', 'low', 'frequencies', 'this', 'mm', 'spectral', 'component', 'likely', 'originates', 'from', 'smaller', 'scales', 'than', 'the', 'fewghz', 'emission', 'the', 'measured', 'mm', 'sources', 'lie', 'roughly', 'around', 'the', 'l_mm', '100', 'ghz', 'sim', '101', 'l_x', '210', 'kev', 'relation', 'similar', 'to', 'a', 'few', 'previously', 'published', 'xray', 'selected', 'sources', 'and', 'hinting', 'perhaps', 'at', 'a', 'common', 'coronal', 'origin']]
|
[-0.03660075830433656, 0.16988090014539337, 0.018995025925292276, 0.12873525028390073, -0.08206716928498843, -0.11558031385626506, 0.07859203364286158, 0.47204614407670353, -0.15694763614971444, -0.3948587281561175, 0.08045502037485777, -0.3503709412726033, 0.07941252781354168, 0.20552008223854995, 0.046635918499597195, -0.04249027476898958, -0.034695811549569536, -0.13156498753017298, -0.04642497643506453, -0.13758090119463978, 0.20745315286762048, 0.14547436252196125, 0.23025532398533857, 0.007338871963805071, 0.07807289310127359, -0.14155182808085723, -0.08657378321484789, -0.07995473054226165, -0.07490180329459915, 0.04052263845827569, 0.2902613712106774, 0.061545332683534876, 0.20654780637576348, -0.3250549644933163, -0.21359942626800205, 0.06190558565481578, 0.15734405330824952, -0.049993463829993326, 0.04264750350252323, -0.23313089804206458, 0.10169368635763897, -0.15917551675006564, -0.19520007362186817, 0.167665670819891, 0.055639104474979786, -0.0010010396722520208, -0.14503446882116366, 0.16269875343969484, -0.023475074766916626, 0.101362402861317, -0.14948791580671375, -0.16689712353004718, -0.005546509676302473, 0.009460587906047565, 0.003640364274888495, 0.12620988894788618, 0.23599871229035435, -0.06834025014002153, -0.09841755142594964, 0.36397971204240565, -0.02638029979120072, 0.0635218802123779, 0.24709224286036463, -0.2610102561244994, -0.1786638506397858, 0.2670091934262108, 0.12974747194460146, 0.07017734107549911, -0.12274428564741817, -0.059798010881310384, 0.007967343539528457, 0.3455309382881279, 0.10403314500006583, 0.10730441342349406, 0.31003271219217116, 0.10565081613144067, 0.02140942904063397, 0.1390762415327948, -0.3044950895767406, 0.035275673062575084, -0.26090016187007686, 0.0028968256823488593, -0.12194910453471505, 0.20822960827039716, -0.15046870280154204, -0.0425931415168488, 0.3334035623393217, 0.12521913153389583, 0.21973217179119173, 0.0787985787366195, 0.274239594358261, 0.06665764029808256, 0.12615170459590713, 0.1558125199664551, 0.33706334290773043, 0.1675745187748373, 0.11049898967353834, -0.15756956920499143, -0.007254086329923644, -0.09325368922307259]
|
1,803.06878
|
Parameterized Complexity of Fair Vertex Evaluation Problems
|
A prototypical graph problem is centered around a graph-theoretic property
for a set of vertices and a solution to it is a set of vertices for which the
desired property holds. The task is to decide whether, in the given graph,
there exists a solution of a certain quality, where we use size as a quality
measure. In this work, we are changing the measure to the fair measure
[Lin&Sahni: Fair edge deletion problems. IEEE Trans. Comput. 89]. The measure
is k if the number of solution neighbors does not exceed k for any vertex in
the graph. One possible way to study graph problems is by defining the property
in a certain logic. For a given objective an evaluation problem is to find a
set (of vertices) that simultaneously minimizes the assumed measure and
satisfies an appropriate formula.
In the presented paper we show that there is an FPT algorithm for the MSO
Fair Vertex Evaluation problem for formulas with one free variable
parameterized by the twin cover number of the input graph. Here, the free
variable corresponds to the solution sought. One may define an extended variant
of MSO Fair Vertex Evaluation for formulas with l free variables; here we
measure a maximum number of neighbors in each of the l sets. However, such
variant is W[1]-hard for parameter l even on graphs with twin cover one.
Furthermore, we study the Fair Vertex Cover (Fair VC) problem. Fair VC is among
the simplest problems with respect to the demanded property (i.e., the rest
forms an edgeless graph). On the negative side, Fair VC is W[1]-hard when
parameterized by both treedepth and feedback vertex set of the input graph. On
the positive side, we provide an FPT algorithm for the parameter modular width.
|
cs.CC cs.DS cs.LO
|
a prototypical graph problem is centered around a graphtheoretic property for a set of vertices and a solution to it is a set of vertices for which the desired property holds the task is to decide whether in the given graph there exists a solution of a certain quality where we use size as a quality measure in this work we are changing the measure to the fair measure linsahni fair edge deletion problems ieee trans comput 89 the measure is k if the number of solution neighbors does not exceed k for any vertex in the graph one possible way to study graph problems is by defining the property in a certain logic for a given objective an evaluation problem is to find a set of vertices that simultaneously minimizes the assumed measure and satisfies an appropriate formula in the presented paper we show that there is an fpt algorithm for the mso fair vertex evaluation problem for formulas with one free variable parameterized by the twin cover number of the input graph here the free variable corresponds to the solution sought one may define an extended variant of mso fair vertex evaluation for formulas with l free variables here we measure a maximum number of neighbors in each of the l sets however such variant is w1hard for parameter l even on graphs with twin cover one furthermore we study the fair vertex cover fair vc problem fair vc is among the simplest problems with respect to the demanded property ie the rest forms an edgeless graph on the negative side fair vc is w1hard when parameterized by both treedepth and feedback vertex set of the input graph on the positive side we provide an fpt algorithm for the parameter modular width
|
[['a', 'prototypical', 'graph', 'problem', 'is', 'centered', 'around', 'a', 'graphtheoretic', 'property', 'for', 'a', 'set', 'of', 'vertices', 'and', 'a', 'solution', 'to', 'it', 'is', 'a', 'set', 'of', 'vertices', 'for', 'which', 'the', 'desired', 'property', 'holds', 'the', 'task', 'is', 'to', 'decide', 'whether', 'in', 'the', 'given', 'graph', 'there', 'exists', 'a', 'solution', 'of', 'a', 'certain', 'quality', 'where', 'we', 'use', 'size', 'as', 'a', 'quality', 'measure', 'in', 'this', 'work', 'we', 'are', 'changing', 'the', 'measure', 'to', 'the', 'fair', 'measure', 'linsahni', 'fair', 'edge', 'deletion', 'problems', 'ieee', 'trans', 'comput', '89', 'the', 'measure', 'is', 'k', 'if', 'the', 'number', 'of', 'solution', 'neighbors', 'does', 'not', 'exceed', 'k', 'for', 'any', 'vertex', 'in', 'the', 'graph', 'one', 'possible', 'way', 'to', 'study', 'graph', 'problems', 'is', 'by', 'defining', 'the', 'property', 'in', 'a', 'certain', 'logic', 'for', 'a', 'given', 'objective', 'an', 'evaluation', 'problem', 'is', 'to', 'find', 'a', 'set', 'of', 'vertices', 'that', 'simultaneously', 'minimizes', 'the', 'assumed', 'measure', 'and', 'satisfies', 'an', 'appropriate', 'formula', 'in', 'the', 'presented', 'paper', 'we', 'show', 'that', 'there', 'is', 'an', 'fpt', 'algorithm', 'for', 'the', 'mso', 'fair', 'vertex', 'evaluation', 'problem', 'for', 'formulas', 'with', 'one', 'free', 'variable', 'parameterized', 'by', 'the', 'twin', 'cover', 'number', 'of', 'the', 'input', 'graph', 'here', 'the', 'free', 'variable', 'corresponds', 'to', 'the', 'solution', 'sought', 'one', 'may', 'define', 'an', 'extended', 'variant', 'of', 'mso', 'fair', 'vertex', 'evaluation', 'for', 'formulas', 'with', 'l', 'free', 'variables', 'here', 'we', 'measure', 'a', 'maximum', 'number', 'of', 'neighbors', 'in', 'each', 'of', 'the', 'l', 'sets', 'however', 'such', 'variant', 'is', 'w1hard', 'for', 'parameter', 'l', 'even', 'on', 'graphs', 'with', 'twin', 'cover', 'one', 'furthermore', 'we', 'study', 'the', 'fair', 'vertex', 'cover', 'fair', 'vc', 'problem', 'fair', 'vc', 'is', 'among', 'the', 'simplest', 'problems', 'with', 'respect', 'to', 'the', 'demanded', 'property', 'ie', 'the', 'rest', 'forms', 'an', 'edgeless', 'graph', 'on', 'the', 'negative', 'side', 'fair', 'vc', 'is', 'w1hard', 'when', 'parameterized', 'by', 'both', 'treedepth', 'and', 'feedback', 'vertex', 'set', 'of', 'the', 'input', 'graph', 'on', 'the', 'positive', 'side', 'we', 'provide', 'an', 'fpt', 'algorithm', 'for', 'the', 'parameter', 'modular', 'width']]
|
[-0.1404509238180396, 0.06402806666989194, -0.05279462915644965, 0.05448347353336716, -0.13930348615851826, -0.17969016431999288, 0.09491827557977518, 0.3812940265918182, -0.3080131748211236, -0.29662591113201137, 0.08038829670465669, -0.30820641507404145, -0.09629271003026706, 0.14827840938550696, -0.10490973746559405, 0.06459685718901328, 0.08744419537367039, 0.12355247168547837, 0.013118245593413597, -0.2445291944944543, 0.31590230199317654, 0.006550031781686095, 0.22262300874198765, 0.07869621983382838, 0.10917418172905609, 0.047212624773548026, 0.005081095878962974, 0.08959640300977315, -0.16139931201337043, 0.0677184215375324, 0.26636766761210795, 0.1959612303852094, 0.3133642131322836, -0.35271309891003644, -0.12952771934652033, 0.19947415148146425, 0.08100735171222836, 0.056117690827478195, -0.0027359586611148544, -0.18180113867220848, 0.12409793469203007, -0.12501190197034245, -0.10413476013746939, 0.008131892975012902, 0.0932190140880924, -0.01147238328729381, -0.3238842365802377, -0.020152193443283898, 0.07309760511995837, 0.018853131589501994, -0.006412318403079292, -0.12435681350630909, 0.008952676473541421, 0.10182044046913884, -0.039194037614917895, 0.09068436627697403, 0.058766686716736787, -0.13172325336949664, -0.15665284479227642, 0.3937185297691527, -0.02305043115774837, -0.21608864356296412, 0.1221705140854286, -0.10699992704303751, -0.16105815643482801, 0.09478341441270943, 0.11532313372532968, 0.12959402989844057, -0.13389079487246244, 0.1026876935198563, -0.12033403858482049, 0.1710369618778012, 0.09053404620489416, 0.014053827736514013, 0.125375090319498, 0.16925283618797404, 0.17972073305728797, 0.18054680558916422, 0.0023050599822094313, -0.05220236359247556, -0.3092288746221989, -0.124432934609833, -0.21581404727212958, -0.0033146304824074042, -0.13205990961613967, -0.2033573497951336, 0.3997930968657085, 0.12382268742856858, 0.21502786242234626, 0.09549024950358508, 0.25388937010771495, 0.13380622994230182, 0.03896209108325376, 0.1348051415961363, 0.153028723032058, 0.11577451658600452, 0.011540061422328086, -0.2030355925179077, 0.0969247510267339, 0.10712115663507438]
|
1,803.06879
|
The tree of numerical semigroups with low multiplicity
|
We show that the number of numerical semigroups with multiplicity three, four
or five and fixed genus is increasing as a function in the genus. To this end
we use the Kunz polytope for these multiplicities. Counting numerical
semigroups with fixed multiplicity and genus is then an integer partition
problem with some extra conditions (those of membership to the Kunz polytope).
For the particular case of multiplicity four, we are able to prove that the
number of numerical semigroups with multiplicity four and genus $g$ is the
number of partitions $x+y+z=g+6$ with $0<x\le y\le z$, $x\neq 1$, $y\neq 2$ and
$z\neq 3$.
|
math.CO math.AC
|
we show that the number of numerical semigroups with multiplicity three four or five and fixed genus is increasing as a function in the genus to this end we use the kunz polytope for these multiplicities counting numerical semigroups with fixed multiplicity and genus is then an integer partition problem with some extra conditions those of membership to the kunz polytope for the particular case of multiplicity four we are able to prove that the number of numerical semigroups with multiplicity four and genus g is the number of partitions xyzg6 with 0xle yle z xneq 1 yneq 2 and zneq 3
|
[['we', 'show', 'that', 'the', 'number', 'of', 'numerical', 'semigroups', 'with', 'multiplicity', 'three', 'four', 'or', 'five', 'and', 'fixed', 'genus', 'is', 'increasing', 'as', 'a', 'function', 'in', 'the', 'genus', 'to', 'this', 'end', 'we', 'use', 'the', 'kunz', 'polytope', 'for', 'these', 'multiplicities', 'counting', 'numerical', 'semigroups', 'with', 'fixed', 'multiplicity', 'and', 'genus', 'is', 'then', 'an', 'integer', 'partition', 'problem', 'with', 'some', 'extra', 'conditions', 'those', 'of', 'membership', 'to', 'the', 'kunz', 'polytope', 'for', 'the', 'particular', 'case', 'of', 'multiplicity', 'four', 'we', 'are', 'able', 'to', 'prove', 'that', 'the', 'number', 'of', 'numerical', 'semigroups', 'with', 'multiplicity', 'four', 'and', 'genus', 'g', 'is', 'the', 'number', 'of', 'partitions', 'xyzg6', 'with', '0xle', 'yle', 'z', 'xneq', '1', 'yneq', '2', 'and', 'zneq', '3']]
|
[-0.1428013727348298, 0.11714324166896403, -0.06604049304733053, 0.0594527358119376, -0.0437824221723713, -0.1388228205870837, -0.018449132423847915, 0.3440581401064992, -0.2562733181566, -0.3169496964942664, 0.11436115334625356, -0.3545360477268696, -0.10280062821926549, 0.18711407918832265, -0.07954528471454977, 0.08228409012197517, 0.043759512094547974, 0.09646908191032708, -0.0646118056261912, -0.3281251002603676, 0.39789286779239774, -0.06215915933251381, 0.1238102431036532, 0.06804981624474749, 0.059571767151355745, 0.004572446909733117, 0.002903010668233037, 0.04826428098604083, -0.1594889957162377, 0.08283456698874943, 0.272513671554625, 0.12127173995831982, 0.22901095600798727, -0.3584863822720945, -0.11066187663935124, 0.2183001304604113, 0.1281696430547163, 0.015599401704967021, -0.0309296767890919, -0.15843340553576127, 0.166831739153713, -0.1683903043344617, -0.18508988542016597, -0.03521576260682195, 0.059916893343906846, 0.05043491803109646, -0.2764260660111904, -0.011752648521214723, 0.04780023435363546, 0.10618535976391286, -0.011207783273421227, -0.2038593494705856, -0.0809858362749219, 0.07835794477025047, 0.050941705575678495, 0.05159643777180463, 0.0005376740172505378, -0.11948216652264819, -0.1605465796776116, 0.3039270201511681, 0.024708911208435894, -0.25006621988490224, 0.19051068944856525, -0.23003503896296024, -0.1918589664902538, 0.15552683518268168, 0.08198759553954005, 0.156970586925745, -0.028376916749402882, 0.09850350538501516, -0.11199432667344808, 0.12611880712211132, 0.10966493092942983, -0.0325705855502747, 0.1169026817008853, 0.10335392180364579, 0.07574728290113854, 0.16493958643171935, -0.06805371654219926, 0.004969650618731975, -0.35359007321298125, -0.1792716544866562, -0.14108669699169696, 0.09678206369746477, -0.15600360455864576, -0.1426645750273019, 0.3946460645273328, 0.09624726281501353, 0.20549522211775184, 0.18652416334487498, 0.21704273708164692, 0.09026656121830456, -0.023000668045424392, 0.09060625401791185, 0.08526797564118169, 0.1468721482134424, -0.015807143226265908, -0.1689076863694936, -0.0444219457032159, 0.18831926113925873]
|
1,803.0688
|
Scaling of energy amplification in viscoelastic channel and Couette flow
|
The linear amplification of disturbances is critical in setting up transition
scenarios in viscoelastic channel and Couette flow, and may also play an
important role when such flows are fully turbulent. As such, it is of interest
to assess how this amplification, defined as the steady-state variance
maintained under Gaussian white noise forcing, scales with the main
nondimensional parameters: the Reynolds ($Re$) and Weissenberg ($Wi$) numbers.
This scaling is derived analytically in the two limits of strong and weak
elasticity for when the forcing is streamwise-constant. The latter is the
relevant forcing for capturing the overall behaviour because it was previously
shown to have the dominant contribution to amplification. The final expressions
show that for weak elasticity the scaling retains a form similar to the
well-known O($Re^3$) relationship with an added elastic correction. For strong
elasticity, however, the scaling is O($Wi^3$) with a viscous correction. The
key factor leading to such a mirroring in the scaling is the introduction of
forcing in the polymer stress. The results demonstrate that energy
amplification in a viscoelastic flow can be very sensitive to the model
parameters even at low $Re$. They also suggest that energy amplification can be
significantly increased by forcing the polymer stress, thereby opening up
possibilities such as flow control using systematically designed polymer stress
perturbations.
|
physics.flu-dyn physics.comp-ph
|
the linear amplification of disturbances is critical in setting up transition scenarios in viscoelastic channel and couette flow and may also play an important role when such flows are fully turbulent as such it is of interest to assess how this amplification defined as the steadystate variance maintained under gaussian white noise forcing scales with the main nondimensional parameters the reynolds re and weissenberg wi numbers this scaling is derived analytically in the two limits of strong and weak elasticity for when the forcing is streamwiseconstant the latter is the relevant forcing for capturing the overall behaviour because it was previously shown to have the dominant contribution to amplification the final expressions show that for weak elasticity the scaling retains a form similar to the wellknown ore3 relationship with an added elastic correction for strong elasticity however the scaling is owi3 with a viscous correction the key factor leading to such a mirroring in the scaling is the introduction of forcing in the polymer stress the results demonstrate that energy amplification in a viscoelastic flow can be very sensitive to the model parameters even at low re they also suggest that energy amplification can be significantly increased by forcing the polymer stress thereby opening up possibilities such as flow control using systematically designed polymer stress perturbations
|
[['the', 'linear', 'amplification', 'of', 'disturbances', 'is', 'critical', 'in', 'setting', 'up', 'transition', 'scenarios', 'in', 'viscoelastic', 'channel', 'and', 'couette', 'flow', 'and', 'may', 'also', 'play', 'an', 'important', 'role', 'when', 'such', 'flows', 'are', 'fully', 'turbulent', 'as', 'such', 'it', 'is', 'of', 'interest', 'to', 'assess', 'how', 'this', 'amplification', 'defined', 'as', 'the', 'steadystate', 'variance', 'maintained', 'under', 'gaussian', 'white', 'noise', 'forcing', 'scales', 'with', 'the', 'main', 'nondimensional', 'parameters', 'the', 'reynolds', 're', 'and', 'weissenberg', 'wi', 'numbers', 'this', 'scaling', 'is', 'derived', 'analytically', 'in', 'the', 'two', 'limits', 'of', 'strong', 'and', 'weak', 'elasticity', 'for', 'when', 'the', 'forcing', 'is', 'streamwiseconstant', 'the', 'latter', 'is', 'the', 'relevant', 'forcing', 'for', 'capturing', 'the', 'overall', 'behaviour', 'because', 'it', 'was', 'previously', 'shown', 'to', 'have', 'the', 'dominant', 'contribution', 'to', 'amplification', 'the', 'final', 'expressions', 'show', 'that', 'for', 'weak', 'elasticity', 'the', 'scaling', 'retains', 'a', 'form', 'similar', 'to', 'the', 'wellknown', 'ore3', 'relationship', 'with', 'an', 'added', 'elastic', 'correction', 'for', 'strong', 'elasticity', 'however', 'the', 'scaling', 'is', 'owi3', 'with', 'a', 'viscous', 'correction', 'the', 'key', 'factor', 'leading', 'to', 'such', 'a', 'mirroring', 'in', 'the', 'scaling', 'is', 'the', 'introduction', 'of', 'forcing', 'in', 'the', 'polymer', 'stress', 'the', 'results', 'demonstrate', 'that', 'energy', 'amplification', 'in', 'a', 'viscoelastic', 'flow', 'can', 'be', 'very', 'sensitive', 'to', 'the', 'model', 'parameters', 'even', 'at', 'low', 're', 'they', 'also', 'suggest', 'that', 'energy', 'amplification', 'can', 'be', 'significantly', 'increased', 'by', 'forcing', 'the', 'polymer', 'stress', 'thereby', 'opening', 'up', 'possibilities', 'such', 'as', 'flow', 'control', 'using', 'systematically', 'designed', 'polymer', 'stress', 'perturbations']]
|
[-0.1426392348627908, 0.17984422660994703, -0.06881577144681572, 0.06016738586634763, -0.02890881007672157, -0.1290659009017677, -0.024663337623313172, 0.2938443110367962, -0.32959103421960895, -0.284616103678698, 0.11079453768493677, -0.23260464352527285, -0.158842784453784, 0.21147325831121616, -0.04451774628332459, 0.07773856918336214, 0.008134914729657156, 0.009459489412229316, 0.005423403487575597, -0.18649187932883293, 0.2919996891357875, 0.11341583837154452, 0.3173798402928025, 0.06120816908344827, 0.07847188623996329, -0.05601024815255654, 0.010175586869574595, 0.08175369795786094, -0.15698616623507336, 0.033804224915019124, 0.23378569355677045, 0.011883664771775219, 0.27930660726432904, -0.41395379219064926, -0.24459494993299524, 0.05157482208984373, 0.14540122218525786, 0.1278489443482222, -0.010338297786156291, -0.19710558054698893, 0.09761376918601437, -0.1706153601897602, -0.10688471554117016, -0.09462125993238013, 0.053752102314659926, 0.06349605741686509, -0.30372832613675116, 0.11192089473370628, 0.09039812939672374, 0.05007466127678195, -0.05109564442512314, -0.06396804462626542, -0.033527545583060134, 0.13583694647254518, 0.11879485298854081, 0.013627813038825293, 0.15215477277742367, -0.20055024858094125, -0.011437794040218344, 0.39416281605453807, -0.07062473679483633, -0.22611412802378203, 0.20397656463509833, -0.12859019983307432, -0.08093769022124324, 0.1536602825165735, 0.1697234122793051, 0.03676173357683599, -0.11983831241908026, 0.02888000283673706, -0.018726916249871915, 0.17965105376489215, 0.0790386029299366, -0.00019399672050342381, 0.16567864320153874, 0.1771105605429996, 0.07331094095645534, 0.16073694346455214, -0.08850743243353557, -0.08853264213387341, -0.31013347600776026, -0.12117029929960094, -0.13941043183407703, 0.056823407232497, -0.12984308704356315, -0.15639741249667005, 0.34775594412457966, 0.15485587981192256, 0.16931890709778277, 0.05849549688276983, 0.29693304508746055, 0.1614148710252147, 0.09573895542824719, 0.10027941067433246, 0.32094734797480506, 0.1584850458752486, 0.1120438394114967, -0.23378037419779418, 0.11539992755801182, 0.022763259526098444]
|
1,803.06881
|
Convex resource theory of non-Markovianity
|
We establish a convex resource theory of non-Markovianity under the
constraint of small time intervals within the temporal evolution. We construct
the free operations, free states and a generalized bona-fide measure of
non-Markovianity. The framework satisfies the basic properties of a consistent
resource theory. The proposed resource quantifier is lower bounded by the
optimization free Rivas-Huelga-Plenio (RHP) measure of nonMarkovianity. We
further define the robustness of non-Markovianity and show that it can directly
be expressed as a function of the RHP measure of non-Markovianity. This enables
a physical interpretation of the RHP measure.
|
quant-ph
|
we establish a convex resource theory of nonmarkovianity under the constraint of small time intervals within the temporal evolution we construct the free operations free states and a generalized bonafide measure of nonmarkovianity the framework satisfies the basic properties of a consistent resource theory the proposed resource quantifier is lower bounded by the optimization free rivashuelgaplenio rhp measure of nonmarkovianity we further define the robustness of nonmarkovianity and show that it can directly be expressed as a function of the rhp measure of nonmarkovianity this enables a physical interpretation of the rhp measure
|
[['we', 'establish', 'a', 'convex', 'resource', 'theory', 'of', 'nonmarkovianity', 'under', 'the', 'constraint', 'of', 'small', 'time', 'intervals', 'within', 'the', 'temporal', 'evolution', 'we', 'construct', 'the', 'free', 'operations', 'free', 'states', 'and', 'a', 'generalized', 'bonafide', 'measure', 'of', 'nonmarkovianity', 'the', 'framework', 'satisfies', 'the', 'basic', 'properties', 'of', 'a', 'consistent', 'resource', 'theory', 'the', 'proposed', 'resource', 'quantifier', 'is', 'lower', 'bounded', 'by', 'the', 'optimization', 'free', 'rivashuelgaplenio', 'rhp', 'measure', 'of', 'nonmarkovianity', 'we', 'further', 'define', 'the', 'robustness', 'of', 'nonmarkovianity', 'and', 'show', 'that', 'it', 'can', 'directly', 'be', 'expressed', 'as', 'a', 'function', 'of', 'the', 'rhp', 'measure', 'of', 'nonmarkovianity', 'this', 'enables', 'a', 'physical', 'interpretation', 'of', 'the', 'rhp', 'measure']]
|
[-0.15433808052709894, 0.09743322400659647, -0.16416242843716528, 0.12379811340740518, -0.03618209472978893, -0.14550163744159206, 0.07725838734515254, 0.3115352928997827, -0.3244832198176047, -0.27209571817808825, 0.06255137540764459, -0.18401036804298992, -0.1391085944259944, 0.16465693497625383, -0.10263999530529279, 0.09832836770574035, 0.05029314593411982, 0.07338742746556502, -0.07339355574525974, -0.20568818036649053, 0.3246987625936289, 0.02640434928901453, 0.27675428767891036, 0.11526010031040008, 0.15428017237750086, -0.006233863436374004, -0.017495493348890348, 0.0402253294950756, -0.1840382027873958, 0.13625112652421786, 0.21700044309355968, 0.2556210818052616, 0.3234931859795166, -0.3379665929419191, -0.2306455579262389, 0.11419164084667421, 0.07866771081108195, 0.04119481174775106, 0.03727091201985984, -0.3232723099341535, 0.030565590020674077, -0.1672649144893512, -0.1406970597429039, -0.09610170750554813, 0.027876794591303104, -0.006860089585762066, -0.25930254837579053, 0.08721075778948548, 0.041061685137126755, 0.04590660655547096, -0.06993586625195229, -0.008236127004594258, -0.0066672423449547396, 0.10596922367467018, -0.03208647043388539, 0.01837176954596425, 0.14900232302328653, -0.07612716648778271, -0.15333592059576642, 0.335570089397547, -0.10587475498702945, -0.25988068950929394, 0.1510376805520576, -0.1254718526792915, -0.13910346239319313, 0.06443925601754176, 0.11177501338913673, 0.1417055908266617, -0.19307669351363313, 0.10953102080004654, -0.0866401468342899, 0.18436189107191953, 0.06009855166168721, 0.15680118744089472, 0.15044266190734165, 0.14839873950151503, 0.12002709639542129, 0.23286200029163054, -0.03322913818081598, -0.11948270407383857, -0.3392724450778864, -0.20660846967897986, -0.21066587503351594, 0.06493462099309039, -0.12658903699174634, -0.14609877311918157, 0.4232370034062668, 0.1419950427396385, 0.1427201458921089, 0.1146296504277574, 0.24364451761104408, 0.2120524430533608, 0.049861378957638924, 0.04258033884790442, 0.13862679153174648, 0.18475918307819444, 0.03259354747791329, -0.29193396230339597, 0.10081024643580389, 0.06292069707943364]
|
1,803.06882
|
The correct formulation of Gleason's theorem in quaternionic Hilbert
spaces
|
From the viewpoint of the theory of orthomodular lattices of elementary
propositions, Quantum Theories can be formulated in real, complex or
quaternionic Hilbert spaces as established in Sol\'er's theorem. The said
lattice eventually coincides with the lattice of all orthogonal projectors on a
separable Hilbert space over R, C, or over the algebra of quaternions H.
Quantum states are $\sigma$-additive probability measures on that non-Boolean
lattice. Gleason's theorem proves that, if the Hilbert space is separable with
dimension >2 and the Hilbert space is either real or complex, then states are
one-to-one with standard density matrices (self-adjoint, positive, unit-trace,
trace-class operators). The extension of this result to quaternionic Hilbert
spaces was obtained by Varadarajan in 1968. Unfortunately, even if the hard
part of the proof is correct, the formulation of this extension is
mathematically incorrect. This is due to some peculiarities of the notion of
trace in quaternionic Hilbert spaces, e.g., basis dependence, making the theory
of trace-class operators in quaternionic Hilbert spaces different from the
standard theory in real and complex Hilbert spaces. A minor issue also affects
Varadarajan's statement for real Hilbert space formulation. This paper is
mainly devoted to present Gleason-Varadarajan's theorem into a technically
correct form valid for the three types of Hilbert spaces. After having develped
part of the general mathematical technology of trace-class operators in
(generally non-separable) quaternionic Hilbert spaces, we prove that only the
{\em real part} of the trace enters the formalism of quantum theories (also
dealing with unbounded observables and symmetries) and it can be safely used to
formulate and prove a common statement of Gleason's theorem.
|
math-ph hep-th math.CV math.MP math.OA quant-ph
|
from the viewpoint of the theory of orthomodular lattices of elementary propositions quantum theories can be formulated in real complex or quaternionic hilbert spaces as established in solers theorem the said lattice eventually coincides with the lattice of all orthogonal projectors on a separable hilbert space over r c or over the algebra of quaternions h quantum states are sigmaadditive probability measures on that nonboolean lattice gleasons theorem proves that if the hilbert space is separable with dimension 2 and the hilbert space is either real or complex then states are onetoone with standard density matrices selfadjoint positive unittrace traceclass operators the extension of this result to quaternionic hilbert spaces was obtained by varadarajan in 1968 unfortunately even if the hard part of the proof is correct the formulation of this extension is mathematically incorrect this is due to some peculiarities of the notion of trace in quaternionic hilbert spaces eg basis dependence making the theory of traceclass operators in quaternionic hilbert spaces different from the standard theory in real and complex hilbert spaces a minor issue also affects varadarajans statement for real hilbert space formulation this paper is mainly devoted to present gleasonvaradarajans theorem into a technically correct form valid for the three types of hilbert spaces after having develped part of the general mathematical technology of traceclass operators in generally nonseparable quaternionic hilbert spaces we prove that only the em real part of the trace enters the formalism of quantum theories also dealing with unbounded observables and symmetries and it can be safely used to formulate and prove a common statement of gleasons theorem
|
[['from', 'the', 'viewpoint', 'of', 'the', 'theory', 'of', 'orthomodular', 'lattices', 'of', 'elementary', 'propositions', 'quantum', 'theories', 'can', 'be', 'formulated', 'in', 'real', 'complex', 'or', 'quaternionic', 'hilbert', 'spaces', 'as', 'established', 'in', 'solers', 'theorem', 'the', 'said', 'lattice', 'eventually', 'coincides', 'with', 'the', 'lattice', 'of', 'all', 'orthogonal', 'projectors', 'on', 'a', 'separable', 'hilbert', 'space', 'over', 'r', 'c', 'or', 'over', 'the', 'algebra', 'of', 'quaternions', 'h', 'quantum', 'states', 'are', 'sigmaadditive', 'probability', 'measures', 'on', 'that', 'nonboolean', 'lattice', 'gleasons', 'theorem', 'proves', 'that', 'if', 'the', 'hilbert', 'space', 'is', 'separable', 'with', 'dimension', '2', 'and', 'the', 'hilbert', 'space', 'is', 'either', 'real', 'or', 'complex', 'then', 'states', 'are', 'onetoone', 'with', 'standard', 'density', 'matrices', 'selfadjoint', 'positive', 'unittrace', 'traceclass', 'operators', 'the', 'extension', 'of', 'this', 'result', 'to', 'quaternionic', 'hilbert', 'spaces', 'was', 'obtained', 'by', 'varadarajan', 'in', '1968', 'unfortunately', 'even', 'if', 'the', 'hard', 'part', 'of', 'the', 'proof', 'is', 'correct', 'the', 'formulation', 'of', 'this', 'extension', 'is', 'mathematically', 'incorrect', 'this', 'is', 'due', 'to', 'some', 'peculiarities', 'of', 'the', 'notion', 'of', 'trace', 'in', 'quaternionic', 'hilbert', 'spaces', 'eg', 'basis', 'dependence', 'making', 'the', 'theory', 'of', 'traceclass', 'operators', 'in', 'quaternionic', 'hilbert', 'spaces', 'different', 'from', 'the', 'standard', 'theory', 'in', 'real', 'and', 'complex', 'hilbert', 'spaces', 'a', 'minor', 'issue', 'also', 'affects', 'varadarajans', 'statement', 'for', 'real', 'hilbert', 'space', 'formulation', 'this', 'paper', 'is', 'mainly', 'devoted', 'to', 'present', 'gleasonvaradarajans', 'theorem', 'into', 'a', 'technically', 'correct', 'form', 'valid', 'for', 'the', 'three', 'types', 'of', 'hilbert', 'spaces', 'after', 'having', 'develped', 'part', 'of', 'the', 'general', 'mathematical', 'technology', 'of', 'traceclass', 'operators', 'in', 'generally', 'nonseparable', 'quaternionic', 'hilbert', 'spaces', 'we', 'prove', 'that', 'only', 'the', 'em', 'real', 'part', 'of', 'the', 'trace', 'enters', 'the', 'formalism', 'of', 'quantum', 'theories', 'also', 'dealing', 'with', 'unbounded', 'observables', 'and', 'symmetries', 'and', 'it', 'can', 'be', 'safely', 'used', 'to', 'formulate', 'and', 'prove', 'a', 'common', 'statement', 'of', 'gleasons', 'theorem']]
|
[-0.11192796169249022, 0.13951519339083351, -0.10404249937220444, 0.11595415005357688, -0.0789026278257016, -0.13657113299227033, -0.014750381661649836, 0.3233956025290115, -0.3030079429962109, -0.17126745610814825, 0.12140783594926544, -0.24141092025170266, -0.1697735595581044, 0.1780448518773123, -0.12781103520331896, 0.03491306545729873, 0.06651042260056071, 0.0684414357460412, -0.12266895329551382, -0.2913109073008166, 0.42272682701584535, -0.026253233816449888, 0.21582744708780496, 0.04608361486402188, 0.08689643589234397, 0.06901189857742399, -0.046708376262825646, -0.015493938883947131, -0.06902945950976905, 0.14400612515576197, 0.311808741640852, 0.12459160872919223, 0.2785488706287492, -0.404393184622006, -0.17331062879824138, 0.18661948009624285, 0.09839495646557284, 0.012468573446969852, 0.0437041885664814, -0.33008381920360286, 0.024501180394903222, -0.13154262825386323, -0.1584273697910193, -0.12038052695743144, 0.053211630936428736, -0.07889326507962192, -0.2532649913368067, 0.048619123842140496, 0.10515205410376417, 0.08700351055690261, -0.09486808651281846, -0.08142192618515938, -0.030808392489867234, 0.0457483055669825, -0.0348154785688754, 0.049666258453802264, 0.0764478638032522, -0.022918917892054573, -0.12781564884344576, 0.3821635891173474, -0.02840530718891428, -0.2769873943675607, 0.14131121630266932, -0.18228702969006316, -0.14435279924960756, 0.07505432858588634, 0.09140859407411725, 0.12483214394113283, -0.06196348125490399, 0.23639837440396322, -0.12776458650135114, 0.11025821250029433, 0.07608611110824483, 0.09339308032160448, 0.10499765773519817, 0.05275121939584556, 0.08349813557559263, 0.1201331265843491, 0.053702881343719394, -0.1515971822728325, -0.36077131087734177, -0.2153444236194138, -0.20389508094130432, 0.11305189117374954, -0.09281537642749159, -0.20027815081363282, 0.3554110702918665, 0.07499348057412716, 0.1590960377830828, 0.06902078628724179, 0.24718023591210975, 0.11682423205555774, 0.06083416534249561, 0.02529181108700232, 0.1639909625108515, 0.2120214353250021, 0.05399269485507982, -0.10773274855079136, -0.005123079880123016, 0.18355319203592893]
|
1,803.06883
|
Tetraquarks in the 1/N Expansion: a New Appraisal
|
We discuss the necessary, albeit not sufficient, conditions for tetraquark
poles to occur in the 1/N expansion of QCD and find the minimum order at which
such poles may appear. Assuming tetraquark poles, we find a new non-planar
solution with the minimal number of topologies and tetraquark species. The
solution implies narrow states. Mixing with quarkonium states is allowed so
that P-wave tetraquarks with J^PC=1^-- would couple to e^+e^-.
|
hep-ph
|
we discuss the necessary albeit not sufficient conditions for tetraquark poles to occur in the 1n expansion of qcd and find the minimum order at which such poles may appear assuming tetraquark poles we find a new nonplanar solution with the minimal number of topologies and tetraquark species the solution implies narrow states mixing with quarkonium states is allowed so that pwave tetraquarks with jpc1 would couple to ee
|
[['we', 'discuss', 'the', 'necessary', 'albeit', 'not', 'sufficient', 'conditions', 'for', 'tetraquark', 'poles', 'to', 'occur', 'in', 'the', '1n', 'expansion', 'of', 'qcd', 'and', 'find', 'the', 'minimum', 'order', 'at', 'which', 'such', 'poles', 'may', 'appear', 'assuming', 'tetraquark', 'poles', 'we', 'find', 'a', 'new', 'nonplanar', 'solution', 'with', 'the', 'minimal', 'number', 'of', 'topologies', 'and', 'tetraquark', 'species', 'the', 'solution', 'implies', 'narrow', 'states', 'mixing', 'with', 'quarkonium', 'states', 'is', 'allowed', 'so', 'that', 'pwave', 'tetraquarks', 'with', 'jpc1', 'would', 'couple', 'to', 'ee']]
|
[-0.18039002997017856, 0.22998372951279517, -0.07886385985825589, 0.14734928164988811, -0.09345957760672098, -0.1658481823000382, 0.11488235269781148, 0.3316355255749617, -0.14633827227289262, -0.19979509371130363, -0.008951269710951896, -0.2730868260740586, -0.07170448495426039, 0.011529114070361939, 0.05897053065912231, 0.10670714545994997, 0.11278584541455991, 0.06530029863874981, -0.038715051757036774, -0.211392950808184, 0.33683337597851304, -0.09247088037512224, 0.13704528484115566, 0.20382188521055639, -0.0017684569811799388, -0.06758359818975779, 0.07841623162823742, -0.06492642523801845, -0.13170754469889367, 0.027660335042932326, 0.24981218805887562, 0.10988079948161823, 0.12847160664724483, -0.4227049605300029, -0.12920722845887792, 0.16715792636724486, 0.23669173445660566, 0.14954843261596357, 0.03268181834963785, -0.2645057205353742, 0.1568962889925941, -0.18629465817703286, -0.2464518362008359, -0.13864759478610064, -0.009645941825853526, -0.05301635426577127, -0.382628554188093, 0.06901463276396196, -0.06844039902468954, -0.0013397195093009782, -0.04482672344623269, -0.2241129650990816, -0.06166591819888656, 0.008829103165265658, 0.05880091410548682, 0.05563239830856522, 0.0863774764769967, -0.1786729987192487, -0.1533657852695256, 0.3726011513583902, -0.06279309579353455, -0.20092969066530897, 0.20167979011919512, -0.19391921104566343, -0.14393193840278665, 0.1376801015019579, 0.08823357388863097, 0.07758279738650806, -0.10310743338819864, 0.07496696856190059, -0.0379030359234067, 0.1398349923581101, 0.1417906471001713, 0.1450078651457485, 0.26170814716243657, 0.09621839141608149, 0.07375309017716326, 0.11004815760669232, -0.030859720839214497, -0.1014575562912269, -0.39941369682766387, -0.13070519545210013, -0.09546034492930208, 0.0820832694984004, -0.03201457990993125, -0.18414865291097027, 0.3726297668788744, 0.06474160026688047, 0.23364038809297094, 0.006005591181430804, 0.21036666757224695, 0.09599030576224533, 0.11329128911745721, 0.15114240386806752, 0.2624224237838264, 0.1635159131180009, 0.082568544395052, -0.26105399282001285, 0.010691550613441706, 0.04088827701744394]
|
1,803.06884
|
Trade-off Between Work and Correlations in Quantum Thermodynamics
|
Quantum thermodynamics and quantum information are two frameworks for
employing quantum mechanical systems for practical tasks, exploiting genuine
quantum features to obtain advantages with respect to classical
implementations. While appearing disconnected at first, the main resources of
these frameworks, work and correlations, have a complicated yet interesting
relationship that we examine here. We review the role of correlations in
quantum thermodynamics, with a particular focus on the conversion of work into
correlations. We provide new insights into the fundamental work cost of
correlations and the existence of optimally correlating unitaries, and discuss
relevant open problems.
|
quant-ph
|
quantum thermodynamics and quantum information are two frameworks for employing quantum mechanical systems for practical tasks exploiting genuine quantum features to obtain advantages with respect to classical implementations while appearing disconnected at first the main resources of these frameworks work and correlations have a complicated yet interesting relationship that we examine here we review the role of correlations in quantum thermodynamics with a particular focus on the conversion of work into correlations we provide new insights into the fundamental work cost of correlations and the existence of optimally correlating unitaries and discuss relevant open problems
|
[['quantum', 'thermodynamics', 'and', 'quantum', 'information', 'are', 'two', 'frameworks', 'for', 'employing', 'quantum', 'mechanical', 'systems', 'for', 'practical', 'tasks', 'exploiting', 'genuine', 'quantum', 'features', 'to', 'obtain', 'advantages', 'with', 'respect', 'to', 'classical', 'implementations', 'while', 'appearing', 'disconnected', 'at', 'first', 'the', 'main', 'resources', 'of', 'these', 'frameworks', 'work', 'and', 'correlations', 'have', 'a', 'complicated', 'yet', 'interesting', 'relationship', 'that', 'we', 'examine', 'here', 'we', 'review', 'the', 'role', 'of', 'correlations', 'in', 'quantum', 'thermodynamics', 'with', 'a', 'particular', 'focus', 'on', 'the', 'conversion', 'of', 'work', 'into', 'correlations', 'we', 'provide', 'new', 'insights', 'into', 'the', 'fundamental', 'work', 'cost', 'of', 'correlations', 'and', 'the', 'existence', 'of', 'optimally', 'correlating', 'unitaries', 'and', 'discuss', 'relevant', 'open', 'problems']]
|
[-0.10688370582402537, 0.11289371630716089, -0.1004869914809732, 0.08580236677080393, -0.04062013804520431, -0.176076067435114, 0.05116238443818139, 0.35475930712724985, -0.2667083950272124, -0.2850678693582794, 0.07728702120580956, -0.3105181527471072, -0.16876807569673186, 0.2197775083741075, -0.027538401496253515, 0.08960533139148825, 0.05185827625621306, -0.013160057328825229, -0.09891979056716847, -0.2380949573174707, 0.36448837895755115, 0.022456445465305525, 0.29349042361013983, 0.10729721828706955, 0.08819149791410094, -0.0048017754415540315, -0.02534364391314356, 0.03065484581319125, -0.15528441893685865, 0.18447902062417645, 0.2837451617870676, 0.11694760272573483, 0.28146787867758816, -0.4606083702933239, -0.22153818413223092, 0.07006437520643598, 0.1329364367270548, 0.1404541224412816, -0.07615022697167373, -0.27539170709879773, 0.024195606339918938, -0.13001218201396497, -0.0717757098082649, -0.16588770754292215, -0.00547029877963819, -0.010338364056875243, -0.17511132755561878, 0.07255149995908142, 0.09984274827262485, 0.05572130100703553, -0.011967616376319998, -0.09931449028908422, 0.09296696396103422, 0.1988072968921379, -0.017521359398961066, -0.04488745118907996, 0.10615649699711388, -0.15143267286353204, -0.19765407737148435, 0.40277174221057643, 0.026479659418232347, -0.17461939916798944, 0.19671684195728678, -0.09147818082649457, -0.22600739736992279, 0.0057308654104800604, 0.20298229650055108, 0.06049904515231518, -0.17396763158888606, 0.08116459361963758, 0.03221969354995771, 0.14085178704025517, 0.02661989944937982, 0.19951530532715353, 0.23887003627850822, 0.15619111462790322, 0.02256806256298564, 0.19595421819310438, -0.012834412597217843, -0.20913936322260845, -0.2958895961754024, -0.20052845520212462, -0.15568437007697006, 0.05133440027895727, -0.035651294808026014, -0.0993594537832235, 0.4129711269548065, 0.1821209162590094, 0.17251149995840695, 0.026512220901388085, 0.31374646819343693, 0.07867707374358648, 0.02101946582919673, 0.07133963024733882, 0.23648868376683246, 0.15361426039353798, 0.0649162264810385, -0.2234822567454294, 0.0426747961986908, 0.005678708769233995]
|
1,803.06885
|
Analysis of Angular Observables of $\Lambda_b \to \Lambda (\to
p\pi)\mu^{+}\mu^{-}$ Decay in Standard and $Z^{\prime}$ Models
|
In 2015, the LHCb collaboration has measured $\frac{d{\mathcal{B}}}{dq^2}$,
the lepton- and hadron-side forward-backward asymmetries, denoted by
$A^\ell_{FB}$ and $A^{\Lambda}_{FB}$, respectively in the range $15 < q^2(=s) <
20$ GeV$^2$ with 3 fb$^{-1}$ of data. Motivated by these measurements, we
perform an analysis of $q^2$ dependent $\Lambda_b \to \Lambda (\to p \pi )
\mu^+\mu^-$ angular observables at large- and low-recoil in the SM and in a
family non-universal $Z^{\prime}$ model. In the present study we use the
recently performed high-precision lattice QCD calculations of the form factors
that have well controlled uncertainties especially in $15 < s < 20$ GeV$^2$
bin. Using the full four-folded angular distribution of $\Lambda_b \to \Lambda
(\to p \pi ) \mu^+\mu^-$ decay, firstly we calculate the values of these
measured quantitites in the SM and compare their numerical values with the
measurements in appropriate bins of $s$. In case of the possible discrepancy
between the SM prediction and measurements, we try to see if these can be
accommodated though the extra neutral $Z^{\prime}$ boson. In addition, the
fraction of longitudinal polarization of the dimuon $F_{L}$ is measured to be
$0.61^{+0.11}_{-0.14}\pm 0.03$ in $15 < s < 20$ GeV$^2$ at the LHCb. We find
that in this bin the value found in the $Z^{\prime}$ model is close to the
observed values. After comparing the results of these observables, we have
proposed a number of other observables whose values are calculated in different
bins of $s$ in the SM and $Z^{\prime}$ model. We illustrate that the
experimental observations of these observables in several bins of $s$ can help
to test the predictions of the SM and unravel NP contributions arises due to
$Z^{\prime}$ model in these decays.
|
hep-ph
|
in 2015 the lhcb collaboration has measured fracdmathcalbdq2 the lepton and hadronside forwardbackward asymmetries denoted by aell_fb and alambda_fb respectively in the range 15 q2s 20 gev2 with 3 fb1 of data motivated by these measurements we perform an analysis of q2 dependent lambda_b to lambda to p pi mumu angular observables at large and lowrecoil in the sm and in a family nonuniversal zprime model in the present study we use the recently performed highprecision lattice qcd calculations of the form factors that have well controlled uncertainties especially in 15 s 20 gev2 bin using the full fourfolded angular distribution of lambda_b to lambda to p pi mumu decay firstly we calculate the values of these measured quantitites in the sm and compare their numerical values with the measurements in appropriate bins of s in case of the possible discrepancy between the sm prediction and measurements we try to see if these can be accommodated though the extra neutral zprime boson in addition the fraction of longitudinal polarization of the dimuon f_l is measured to be 061011_014pm 003 in 15 s 20 gev2 at the lhcb we find that in this bin the value found in the zprime model is close to the observed values after comparing the results of these observables we have proposed a number of other observables whose values are calculated in different bins of s in the sm and zprime model we illustrate that the experimental observations of these observables in several bins of s can help to test the predictions of the sm and unravel np contributions arises due to zprime model in these decays
|
[['in', '2015', 'the', 'lhcb', 'collaboration', 'has', 'measured', 'fracdmathcalbdq2', 'the', 'lepton', 'and', 'hadronside', 'forwardbackward', 'asymmetries', 'denoted', 'by', 'aell_fb', 'and', 'alambda_fb', 'respectively', 'in', 'the', 'range', '15', 'q2s', '20', 'gev2', 'with', '3', 'fb1', 'of', 'data', 'motivated', 'by', 'these', 'measurements', 'we', 'perform', 'an', 'analysis', 'of', 'q2', 'dependent', 'lambda_b', 'to', 'lambda', 'to', 'p', 'pi', 'mumu', 'angular', 'observables', 'at', 'large', 'and', 'lowrecoil', 'in', 'the', 'sm', 'and', 'in', 'a', 'family', 'nonuniversal', 'zprime', 'model', 'in', 'the', 'present', 'study', 'we', 'use', 'the', 'recently', 'performed', 'highprecision', 'lattice', 'qcd', 'calculations', 'of', 'the', 'form', 'factors', 'that', 'have', 'well', 'controlled', 'uncertainties', 'especially', 'in', '15', 's', '20', 'gev2', 'bin', 'using', 'the', 'full', 'fourfolded', 'angular', 'distribution', 'of', 'lambda_b', 'to', 'lambda', 'to', 'p', 'pi', 'mumu', 'decay', 'firstly', 'we', 'calculate', 'the', 'values', 'of', 'these', 'measured', 'quantitites', 'in', 'the', 'sm', 'and', 'compare', 'their', 'numerical', 'values', 'with', 'the', 'measurements', 'in', 'appropriate', 'bins', 'of', 's', 'in', 'case', 'of', 'the', 'possible', 'discrepancy', 'between', 'the', 'sm', 'prediction', 'and', 'measurements', 'we', 'try', 'to', 'see', 'if', 'these', 'can', 'be', 'accommodated', 'though', 'the', 'extra', 'neutral', 'zprime', 'boson', 'in', 'addition', 'the', 'fraction', 'of', 'longitudinal', 'polarization', 'of', 'the', 'dimuon', 'f_l', 'is', 'measured', 'to', 'be', '061011_014pm', '003', 'in', '15', 's', '20', 'gev2', 'at', 'the', 'lhcb', 'we', 'find', 'that', 'in', 'this', 'bin', 'the', 'value', 'found', 'in', 'the', 'zprime', 'model', 'is', 'close', 'to', 'the', 'observed', 'values', 'after', 'comparing', 'the', 'results', 'of', 'these', 'observables', 'we', 'have', 'proposed', 'a', 'number', 'of', 'other', 'observables', 'whose', 'values', 'are', 'calculated', 'in', 'different', 'bins', 'of', 's', 'in', 'the', 'sm', 'and', 'zprime', 'model', 'we', 'illustrate', 'that', 'the', 'experimental', 'observations', 'of', 'these', 'observables', 'in', 'several', 'bins', 'of', 's', 'can', 'help', 'to', 'test', 'the', 'predictions', 'of', 'the', 'sm', 'and', 'unravel', 'np', 'contributions', 'arises', 'due', 'to', 'zprime', 'model', 'in', 'these', 'decays']]
|
[-0.07608498642536202, 0.20327584839062074, -0.054014186900900325, 0.09671024628958658, -0.01904621998222783, -0.1277506771721506, 0.07109663203442679, 0.3400554654251476, -0.22293088163067132, -0.33073857139543933, -0.01731692074712268, -0.34425423099288255, 0.0029268699253496146, 0.14258657997785681, 0.034321743665837255, 0.09642993897716935, 0.05516636598491131, -0.008141434155369555, -0.09074633851707772, -0.24647067194976108, 0.24632935169331477, 0.025130827380764418, 0.18867277402843916, 0.07779721222219191, 0.0220621703704644, -0.00598378539526541, -0.07552905618458201, -0.010613038934613192, -0.19832488540793602, 0.06618869996978026, 0.2472683729041942, 0.08971993576519058, 0.13318314958237729, -0.31952508173434807, -0.09247943383634538, 0.1438075133172193, 0.1409240645624319, 0.062079766391482404, -0.005401387226004573, -0.28839717362744777, 0.15542307008176873, -0.18739268433782308, -0.08751106037440118, -0.07625159364162166, 0.029564207214932133, -0.059921585665000394, -0.33324295911575574, 0.09617700217347733, -0.058055908281331586, 0.058792345749433775, -0.016775209664129057, -0.22178714873997452, -0.03716980482283559, 0.043194120800161134, 0.1364505121351353, 0.07010477505290803, 0.1266245727857953, -0.12428527373008262, -0.15120440237950603, 0.37893364689539577, -0.0819808528898634, -0.18379385070196927, 0.10611089941003024, -0.2677774587926224, -0.1552498528124529, 0.1079792345016652, 0.2091853880740114, 0.06007338463492023, -0.15566059685473269, 0.13435385426544913, -0.053526372864100155, 0.17684213430498189, 0.04904779901770048, 0.04826101304830185, 0.17556447998613567, 0.15041224790397414, -0.03316798995080915, 0.0483228745054072, -0.12450205958343315, -0.04140786989788959, -0.37083568429588376, -0.10108720576845781, -0.09213699847004636, 0.06427669069682479, -0.0858515345393435, -0.025462983090332465, 0.3692013269869779, 0.15081525529784354, 0.33538021261740786, 0.01721120400431293, 0.26286977070516776, 0.1025494763179493, 0.08890200876700867, 0.039865009927828064, 0.3135179033856559, 0.1451691133399053, 0.12157683802332687, -0.24148363228607223, 0.027466440963719908, -0.014818412250895193]
|
1,803.06886
|
Exchanging role of the phase space and symmetry group of integrable
Hamiltonian systems related to Lie bialgebras of bi-symplectic types
|
We construct integrable Hamiltonian systems with Lie bialgebras $({\bf g} ,
{\bf \tilde{g}})$ of the bi-symplectic type for which the Poisson-Lie groups
${\bf G}$ play the role of the phase spaces, and their dual Lie groups ${\bf
{\tilde {G}}}$ play the role of the symmetry groups of the systems. We give the
new transformations to exchange the role of phase spaces and symmetry groups
and obtain the relations between integrals of motions of these integrable
systems. Finally, we give some examples of real four-dimensional Lie bialgebras
of bi-symplectic type.
|
math-ph math.MP
|
we construct integrable hamiltonian systems with lie bialgebras bf g bf tildeg of the bisymplectic type for which the poissonlie groups bf g play the role of the phase spaces and their dual lie groups bf tilde g play the role of the symmetry groups of the systems we give the new transformations to exchange the role of phase spaces and symmetry groups and obtain the relations between integrals of motions of these integrable systems finally we give some examples of real fourdimensional lie bialgebras of bisymplectic type
|
[['we', 'construct', 'integrable', 'hamiltonian', 'systems', 'with', 'lie', 'bialgebras', 'bf', 'g', 'bf', 'tildeg', 'of', 'the', 'bisymplectic', 'type', 'for', 'which', 'the', 'poissonlie', 'groups', 'bf', 'g', 'play', 'the', 'role', 'of', 'the', 'phase', 'spaces', 'and', 'their', 'dual', 'lie', 'groups', 'bf', 'tilde', 'g', 'play', 'the', 'role', 'of', 'the', 'symmetry', 'groups', 'of', 'the', 'systems', 'we', 'give', 'the', 'new', 'transformations', 'to', 'exchange', 'the', 'role', 'of', 'phase', 'spaces', 'and', 'symmetry', 'groups', 'and', 'obtain', 'the', 'relations', 'between', 'integrals', 'of', 'motions', 'of', 'these', 'integrable', 'systems', 'finally', 'we', 'give', 'some', 'examples', 'of', 'real', 'fourdimensional', 'lie', 'bialgebras', 'of', 'bisymplectic', 'type']]
|
[-0.2505427004705945, 0.11014782058456066, -0.06096585304476321, 0.07199827372096479, -0.14053375856019557, -0.08681931392162699, -2.1489194213328037e-05, 0.378521995999935, -0.2882326358759945, -0.2587917862057855, 0.0914428011561871, -0.21188929486511784, -0.20580620746212927, 0.17495082934725692, -0.05687125911142423, -0.09529644879512489, 0.020871647204992107, 0.08176856225525791, -0.13578634056135674, -0.29679210096682335, 0.422962469895455, -0.04353080171197441, 0.20760741889138112, -0.042518569574564354, 0.1338599202519452, 0.033662831908176566, -0.012184347629293123, -0.09488624848679385, -0.18134563268077644, 0.1102092088761062, 0.3015708615050905, -0.008223882410675287, 0.15233360494444656, -0.3594161741943522, -0.1167074457149614, 0.18734018598810176, 0.11161494781051508, 0.019923429368645884, -0.04138370665763928, -0.35693863487209787, 0.021143129328265786, -0.16565061110833829, -0.11571998045441102, -0.10294151137879287, 0.10913231289437549, 0.005290366243571043, -0.21810830062763256, 0.09936365726488558, 0.12437242936258289, 0.1075046504530209, -0.06613188534340059, -0.09465763457278213, -0.10635779409097847, 0.14623988808704202, -0.04717059820805761, 0.030452131452462214, 0.12214738116017543, -0.07990810383026573, -0.15943786945321003, 0.4573221781121736, 0.022694041918756822, -0.21261380693282594, 0.14914624333720317, -0.1274463206910613, -0.21073804788333786, 0.05184522080129351, 0.15052239496303213, 0.11959900063547221, -0.040345346174118196, 0.20661727482762549, -0.059618581890721216, -0.01608083965997635, 0.030459099798463285, 0.07005641680337828, 0.15562982999042355, 0.059519939804555506, 0.0509707522155209, 0.0909430111007003, 0.03459308943076229, -0.04986375314580404, -0.42251593454486946, -0.18175845343450253, -0.04839373201089488, 0.096389604473767, -0.13004435993554414, -0.16506320182022385, 0.3802643991498785, 0.10370048970534382, 0.14180115991356698, 0.06012921818315094, 0.0460080370222303, 0.08418361350512979, 0.08390202970423905, 0.06824409762736071, 0.1692208102709132, 0.3155971495117145, 0.00330890302376991, -0.19244447693398054, -0.14607121700696138, 0.21780055660267614]
|
1,803.06887
|
Lossless Analog Compression
|
We establish the fundamental limits of lossless analog compression by
considering the recovery of arbitrary m-dimensional real random vectors x from
the noiseless linear measurements y=Ax with n x m measurement matrix A. Our
theory is inspired by the groundbreaking work of Wu and Verdu (2010) on almost
lossless analog compression, but applies to the nonasymptotic, i.e., fixed-m
case, and considers zero error probability. Specifically, our achievability
result states that, for almost all A, the random vector x can be recovered with
zero error probability provided that n > K(x), where K(x) is given by the
infimum of the lower modified Minkowski dimension over all support sets U of x.
We then particularize this achievability result to the class of s-rectifiable
random vectors as introduced in Koliander et al. (2016); these are random
vectors of absolutely continuous distribution -- with respect to the
s-dimensional Hausdorff measure -- supported on countable unions of
s-dimensional differentiable submanifolds of the m-dimensional real coordinate
space. Countable unions of differentiable submanifolds include essentially all
signal models used in the compressed sensing literature. Specifically, we prove
that, for almost all A, s-rectifiable random vectors x can be recovered with
zero error probability from n>s linear measurements. This threshold is,
however, found not to be tight as exemplified by the construction of an
s-rectifiable random vector that can be recovered with zero error probability
from n<s linear measurements. This leads us to the introduction of the new
class of s-analytic random vectors, which admit a strong converse in the sense
of n greater than or equal to s being necessary for recovery with probability
of error smaller than one. The central conceptual tools in the development of
our theory are geometric measure theory and the theory of real analytic
functions.
|
math.FA cs.IT math.IT
|
we establish the fundamental limits of lossless analog compression by considering the recovery of arbitrary mdimensional real random vectors x from the noiseless linear measurements yax with n x m measurement matrix a our theory is inspired by the groundbreaking work of wu and verdu 2010 on almost lossless analog compression but applies to the nonasymptotic ie fixedm case and considers zero error probability specifically our achievability result states that for almost all a the random vector x can be recovered with zero error probability provided that n kx where kx is given by the infimum of the lower modified minkowski dimension over all support sets u of x we then particularize this achievability result to the class of srectifiable random vectors as introduced in koliander et al 2016 these are random vectors of absolutely continuous distribution with respect to the sdimensional hausdorff measure supported on countable unions of sdimensional differentiable submanifolds of the mdimensional real coordinate space countable unions of differentiable submanifolds include essentially all signal models used in the compressed sensing literature specifically we prove that for almost all a srectifiable random vectors x can be recovered with zero error probability from ns linear measurements this threshold is however found not to be tight as exemplified by the construction of an srectifiable random vector that can be recovered with zero error probability from ns linear measurements this leads us to the introduction of the new class of sanalytic random vectors which admit a strong converse in the sense of n greater than or equal to s being necessary for recovery with probability of error smaller than one the central conceptual tools in the development of our theory are geometric measure theory and the theory of real analytic functions
|
[['we', 'establish', 'the', 'fundamental', 'limits', 'of', 'lossless', 'analog', 'compression', 'by', 'considering', 'the', 'recovery', 'of', 'arbitrary', 'mdimensional', 'real', 'random', 'vectors', 'x', 'from', 'the', 'noiseless', 'linear', 'measurements', 'yax', 'with', 'n', 'x', 'm', 'measurement', 'matrix', 'a', 'our', 'theory', 'is', 'inspired', 'by', 'the', 'groundbreaking', 'work', 'of', 'wu', 'and', 'verdu', '2010', 'on', 'almost', 'lossless', 'analog', 'compression', 'but', 'applies', 'to', 'the', 'nonasymptotic', 'ie', 'fixedm', 'case', 'and', 'considers', 'zero', 'error', 'probability', 'specifically', 'our', 'achievability', 'result', 'states', 'that', 'for', 'almost', 'all', 'a', 'the', 'random', 'vector', 'x', 'can', 'be', 'recovered', 'with', 'zero', 'error', 'probability', 'provided', 'that', 'n', 'kx', 'where', 'kx', 'is', 'given', 'by', 'the', 'infimum', 'of', 'the', 'lower', 'modified', 'minkowski', 'dimension', 'over', 'all', 'support', 'sets', 'u', 'of', 'x', 'we', 'then', 'particularize', 'this', 'achievability', 'result', 'to', 'the', 'class', 'of', 'srectifiable', 'random', 'vectors', 'as', 'introduced', 'in', 'koliander', 'et', 'al', '2016', 'these', 'are', 'random', 'vectors', 'of', 'absolutely', 'continuous', 'distribution', 'with', 'respect', 'to', 'the', 'sdimensional', 'hausdorff', 'measure', 'supported', 'on', 'countable', 'unions', 'of', 'sdimensional', 'differentiable', 'submanifolds', 'of', 'the', 'mdimensional', 'real', 'coordinate', 'space', 'countable', 'unions', 'of', 'differentiable', 'submanifolds', 'include', 'essentially', 'all', 'signal', 'models', 'used', 'in', 'the', 'compressed', 'sensing', 'literature', 'specifically', 'we', 'prove', 'that', 'for', 'almost', 'all', 'a', 'srectifiable', 'random', 'vectors', 'x', 'can', 'be', 'recovered', 'with', 'zero', 'error', 'probability', 'from', 'ns', 'linear', 'measurements', 'this', 'threshold', 'is', 'however', 'found', 'not', 'to', 'be', 'tight', 'as', 'exemplified', 'by', 'the', 'construction', 'of', 'an', 'srectifiable', 'random', 'vector', 'that', 'can', 'be', 'recovered', 'with', 'zero', 'error', 'probability', 'from', 'ns', 'linear', 'measurements', 'this', 'leads', 'us', 'to', 'the', 'introduction', 'of', 'the', 'new', 'class', 'of', 'sanalytic', 'random', 'vectors', 'which', 'admit', 'a', 'strong', 'converse', 'in', 'the', 'sense', 'of', 'n', 'greater', 'than', 'or', 'equal', 'to', 's', 'being', 'necessary', 'for', 'recovery', 'with', 'probability', 'of', 'error', 'smaller', 'than', 'one', 'the', 'central', 'conceptual', 'tools', 'in', 'the', 'development', 'of', 'our', 'theory', 'are', 'geometric', 'measure', 'theory', 'and', 'the', 'theory', 'of', 'real', 'analytic', 'functions']]
|
[-0.1307668187809112, 0.12124017818016203, -0.045766969027479516, 0.03186956280923267, -0.032268126498416275, -0.15755541397185072, 0.06368968432515329, 0.32872173482287004, -0.2759434491535002, -0.20765922133614367, 0.10658139946139676, -0.265883373737678, -0.13965797966456092, 0.1954812509462095, -0.10949154774708506, 0.08572707899050631, 0.026506888585572597, 0.08713277414466979, -0.09340588943127336, -0.3140139975811407, 0.3109977226639684, 0.02214240811493558, 0.26830790685360423, -0.02402204707282686, 0.1140126615662464, 0.05248597240036664, -0.03648581622453801, 0.02012455936376985, -0.13102589353012364, 0.13148752672047218, 0.27999768115818013, 0.1428161716822716, 0.24493673831683635, -0.36300735413775936, -0.21272820033350903, 0.16067817885777913, 0.11048103806064723, 0.044064896203862086, 0.00033058417385392304, -0.30406704911971855, 0.14232456427675466, -0.12994853837881237, -0.11696012775872885, -0.05899621193061143, 0.03341408525496566, 0.0407796249310195, -0.32781205645652434, 0.06549226571062011, 0.12357372981892291, 0.04143064942359666, -0.050016643483609693, -0.14226212292042975, -0.011490495828436705, 0.09118230158007161, 0.012315524824872328, 0.10295981659146491, 0.08384696490803537, -0.01764800576509313, -0.1117722332706358, 0.33572916071958997, -0.09116170205834351, -0.2536643206905056, 0.1466533548486445, -0.17885366088012233, -0.1028791816675544, 0.13878271469406578, 0.16710042735859235, 0.10391288950146797, -0.08898629712024962, 0.1553263571786374, -0.09783032131478346, 0.1390098125367432, 0.10047426144592464, 0.0647926877863938, 0.11993402478886613, 0.07984851663144986, 0.11772085688264472, 0.1220973149983264, -0.04185668486469593, -0.06606048608975673, -0.34427393977724324, -0.13516255238462488, -0.238529297650934, 0.1164922598105578, -0.1316769109203051, -0.16406127688727187, 0.31869216883529183, 0.11005527206806517, 0.21723377488640633, 0.13254186533473936, 0.2683721192467298, 0.1129227455441853, -0.005908174458252486, 0.10178154151718546, 0.17271008894183776, 0.19294483247601116, 0.0017404014316626773, -0.09459707273021599, 0.057960094681119595, 0.10393778104884809]
|
1,803.06888
|
Gamma-Ray Observations of Nova Sgr 2015 No. 2 with INTEGRAL
|
INTEGRAL observed the nova V5668 Sgr around the time of its optical maximum
on March 21, 2015. Studies at UV wavelengths showed spectral lines of freshly
produced Be-7. This could be measurable also in gamma-rays at 478 keV from the
decay to Li-7. Novae are also expected to synthesise Na-22 which decays to
Ne-22, emitting a 1275 keV photon. About one week before the optical maximum, a
strong gamma-ray flash on time-scales of hours is expected from short-lived
radioactive nuclei, such as N-13 and F-18. These beta-plus-unstable nuclei
should yield emission up to 511 keV, but which has never been observed. The
spectrometer SPI aboard INTEGRAL pointed towards V5668 by chance. We use these
observations to search for possible gamma-ray emission of decaying Be-7, and to
directly measure the synthesised mass during explosive burning. We also aim to
constrain possible burst-like emission days to weeks before the optical maximum
using the SPI anticoincidence shield (ACS). We extract spectral and temporal
information to determine the fluxes of gamma-ray lines at 478 keV, 511 keV, and
1275 keV. A measured flux value directly converts into abundances produced by
the nova. The SPI-ACS rates are analysed for burst-like emission using a nova
model light-curve. For the obtained nova flash candidate events, we discuss
possible origins. No significant excess for the expected gamma-ray lines is
found. Our upper limits on the synthesised Be-7 and Na-22 mass depend on the
uncertainties of the distance to the nova: The Be-7 mass is constrained to less
than $4.8\times10^{-9}\,(d/kpc)^2$, and Na-22 to less than
$2.4\times10^{-8}\,(d/kpc)^2$ solar masses. For the Be-7 mass estimate from UV
studies, the distance to V5668 Sgr must be larger than 1.2 kpc. During three
weeks before the optical maximum, we find 23 burst-like events in the ACS rate,
of which six could possibly be associated with V5668 Sgr.
|
astro-ph.HE
|
integral observed the nova v5668 sgr around the time of its optical maximum on march 21 2015 studies at uv wavelengths showed spectral lines of freshly produced be7 this could be measurable also in gammarays at 478 kev from the decay to li7 novae are also expected to synthesise na22 which decays to ne22 emitting a 1275 kev photon about one week before the optical maximum a strong gammaray flash on timescales of hours is expected from shortlived radioactive nuclei such as n13 and f18 these betaplusunstable nuclei should yield emission up to 511 kev but which has never been observed the spectrometer spi aboard integral pointed towards v5668 by chance we use these observations to search for possible gammaray emission of decaying be7 and to directly measure the synthesised mass during explosive burning we also aim to constrain possible burstlike emission days to weeks before the optical maximum using the spi anticoincidence shield acs we extract spectral and temporal information to determine the fluxes of gammaray lines at 478 kev 511 kev and 1275 kev a measured flux value directly converts into abundances produced by the nova the spiacs rates are analysed for burstlike emission using a nova model lightcurve for the obtained nova flash candidate events we discuss possible origins no significant excess for the expected gammaray lines is found our upper limits on the synthesised be7 and na22 mass depend on the uncertainties of the distance to the nova the be7 mass is constrained to less than 48times109dkpc2 and na22 to less than 24times108dkpc2 solar masses for the be7 mass estimate from uv studies the distance to v5668 sgr must be larger than 12 kpc during three weeks before the optical maximum we find 23 burstlike events in the acs rate of which six could possibly be associated with v5668 sgr
|
[['integral', 'observed', 'the', 'nova', 'v5668', 'sgr', 'around', 'the', 'time', 'of', 'its', 'optical', 'maximum', 'on', 'march', '21', '2015', 'studies', 'at', 'uv', 'wavelengths', 'showed', 'spectral', 'lines', 'of', 'freshly', 'produced', 'be7', 'this', 'could', 'be', 'measurable', 'also', 'in', 'gammarays', 'at', '478', 'kev', 'from', 'the', 'decay', 'to', 'li7', 'novae', 'are', 'also', 'expected', 'to', 'synthesise', 'na22', 'which', 'decays', 'to', 'ne22', 'emitting', 'a', '1275', 'kev', 'photon', 'about', 'one', 'week', 'before', 'the', 'optical', 'maximum', 'a', 'strong', 'gammaray', 'flash', 'on', 'timescales', 'of', 'hours', 'is', 'expected', 'from', 'shortlived', 'radioactive', 'nuclei', 'such', 'as', 'n13', 'and', 'f18', 'these', 'betaplusunstable', 'nuclei', 'should', 'yield', 'emission', 'up', 'to', '511', 'kev', 'but', 'which', 'has', 'never', 'been', 'observed', 'the', 'spectrometer', 'spi', 'aboard', 'integral', 'pointed', 'towards', 'v5668', 'by', 'chance', 'we', 'use', 'these', 'observations', 'to', 'search', 'for', 'possible', 'gammaray', 'emission', 'of', 'decaying', 'be7', 'and', 'to', 'directly', 'measure', 'the', 'synthesised', 'mass', 'during', 'explosive', 'burning', 'we', 'also', 'aim', 'to', 'constrain', 'possible', 'burstlike', 'emission', 'days', 'to', 'weeks', 'before', 'the', 'optical', 'maximum', 'using', 'the', 'spi', 'anticoincidence', 'shield', 'acs', 'we', 'extract', 'spectral', 'and', 'temporal', 'information', 'to', 'determine', 'the', 'fluxes', 'of', 'gammaray', 'lines', 'at', '478', 'kev', '511', 'kev', 'and', '1275', 'kev', 'a', 'measured', 'flux', 'value', 'directly', 'converts', 'into', 'abundances', 'produced', 'by', 'the', 'nova', 'the', 'spiacs', 'rates', 'are', 'analysed', 'for', 'burstlike', 'emission', 'using', 'a', 'nova', 'model', 'lightcurve', 'for', 'the', 'obtained', 'nova', 'flash', 'candidate', 'events', 'we', 'discuss', 'possible', 'origins', 'no', 'significant', 'excess', 'for', 'the', 'expected', 'gammaray', 'lines', 'is', 'found', 'our', 'upper', 'limits', 'on', 'the', 'synthesised', 'be7', 'and', 'na22', 'mass', 'depend', 'on', 'the', 'uncertainties', 'of', 'the', 'distance', 'to', 'the', 'nova', 'the', 'be7', 'mass', 'is', 'constrained', 'to', 'less', 'than', '48times109dkpc2', 'and', 'na22', 'to', 'less', 'than', '24times108dkpc2', 'solar', 'masses', 'for', 'the', 'be7', 'mass', 'estimate', 'from', 'uv', 'studies', 'the', 'distance', 'to', 'v5668', 'sgr', 'must', 'be', 'larger', 'than', '12', 'kpc', 'during', 'three', 'weeks', 'before', 'the', 'optical', 'maximum', 'we', 'find', '23', 'burstlike', 'events', 'in', 'the', 'acs', 'rate', 'of', 'which', 'six', 'could', 'possibly', 'be', 'associated', 'with', 'v5668', 'sgr']]
|
[0.016709889128241083, 0.15271808671768122, -0.057380741510069944, 0.14922808867065465, -0.07701151274868667, -0.1211212757615948, 0.08749439671946584, 0.4431289732889381, -0.1827657023712411, -0.38186950132365266, 0.07926269412579083, -0.357508010704355, 0.053955843607953864, 0.24950848781562524, -0.027648436080180607, -0.006985287720598961, 0.10228219785746125, -0.036799376951128344, -0.059305346240034244, -0.22521829907705024, 0.18176967054187781, 0.15690272047410275, 0.15564189735178116, 0.026887543486319852, 0.059368556837993754, -0.08872449572779782, -0.050492078097586664, -0.11087683160971863, -0.11088591550578954, 0.0321674724341528, 0.19728553745016902, 0.14587850060949775, 0.1351701962564139, -0.3751633902764152, -0.23906948731785202, 0.14256123947660343, 0.16551667723829466, -0.04005488417077689, -0.0038281717365514795, -0.30544667895589384, 0.059317176443260886, -0.17392465584150257, -0.15035528032437115, 0.09827417213673954, 0.07234925108859656, 0.006083480124222579, -0.20750489368364897, 0.08391288255213333, -0.03608368097942174, 0.03680240052148462, -0.12138148374813748, -0.10438046482487573, -0.03323420214287293, 0.0387315549145134, 0.08539518363119422, 0.06444869856187684, 0.1695395887000146, -0.056252483282380576, -0.06655017758427231, 0.3575106581388369, -0.085052886678003, 0.0958845462206058, 0.1744545296950736, -0.2006691167056808, -0.173124093738728, 0.2757274870918538, 0.15620921050937864, 0.0934693919439828, -0.19509956198574302, -0.03687676049976229, 0.014928696419505335, 0.24988749500772486, 0.08321969635031214, 0.06044537793308113, 0.2842808569351403, 0.12797548277790896, -4.885070632363475e-05, 0.08607683633512159, -0.2987204578496667, -0.015304221332102606, -0.2649470534967723, -0.09641850430153286, -0.1007247018363664, 0.15021986095795556, -0.05811375155675602, -0.07337173345062473, 0.36346826098698415, 0.08982876130318627, 0.2213622861571975, -0.010482550224295487, 0.2752998550840192, 0.10700928157719898, 0.09453499488659402, 0.10326466315187686, 0.38641456817508835, 0.13493585767049615, 0.1338673966290488, -0.22107543915810304, 0.07951290715343483, 0.021165689431823963]
|
1,803.06889
|
Terahertz emission from laser-driven gas-plasmas: a plasmonic point of
view
|
We disclose an unanticipated link between plasmonics and nonlinear frequency
down-conversion in laser-induced gas-plasmas. For two-color femtosecond pump
pulses, a plasmonic resonance is shown to broaden the terahertz emission
spectra significantly. We identify the resonance as a leaky mode, which
contributes to the emission spectra whenever electrons are excited along a
direction where the plasma size is smaller than the plasma wavelength. As a
direct consequence, such resonances can be controlled by changing the
polarization properties of elliptically-shaped driving laser pulses. Both,
experimental results and 3D Maxwell consistent simulations confirm that a
significant terahertz pulse shortening and spectral broadening can be achieved
by exploiting the transverse driving laser beam shape as an additional degree
of freedom.
|
physics.optics physics.plasm-ph
|
we disclose an unanticipated link between plasmonics and nonlinear frequency downconversion in laserinduced gasplasmas for twocolor femtosecond pump pulses a plasmonic resonance is shown to broaden the terahertz emission spectra significantly we identify the resonance as a leaky mode which contributes to the emission spectra whenever electrons are excited along a direction where the plasma size is smaller than the plasma wavelength as a direct consequence such resonances can be controlled by changing the polarization properties of ellipticallyshaped driving laser pulses both experimental results and 3d maxwell consistent simulations confirm that a significant terahertz pulse shortening and spectral broadening can be achieved by exploiting the transverse driving laser beam shape as an additional degree of freedom
|
[['we', 'disclose', 'an', 'unanticipated', 'link', 'between', 'plasmonics', 'and', 'nonlinear', 'frequency', 'downconversion', 'in', 'laserinduced', 'gasplasmas', 'for', 'twocolor', 'femtosecond', 'pump', 'pulses', 'a', 'plasmonic', 'resonance', 'is', 'shown', 'to', 'broaden', 'the', 'terahertz', 'emission', 'spectra', 'significantly', 'we', 'identify', 'the', 'resonance', 'as', 'a', 'leaky', 'mode', 'which', 'contributes', 'to', 'the', 'emission', 'spectra', 'whenever', 'electrons', 'are', 'excited', 'along', 'a', 'direction', 'where', 'the', 'plasma', 'size', 'is', 'smaller', 'than', 'the', 'plasma', 'wavelength', 'as', 'a', 'direct', 'consequence', 'such', 'resonances', 'can', 'be', 'controlled', 'by', 'changing', 'the', 'polarization', 'properties', 'of', 'ellipticallyshaped', 'driving', 'laser', 'pulses', 'both', 'experimental', 'results', 'and', '3d', 'maxwell', 'consistent', 'simulations', 'confirm', 'that', 'a', 'significant', 'terahertz', 'pulse', 'shortening', 'and', 'spectral', 'broadening', 'can', 'be', 'achieved', 'by', 'exploiting', 'the', 'transverse', 'driving', 'laser', 'beam', 'shape', 'as', 'an', 'additional', 'degree', 'of', 'freedom']]
|
[-0.12620126215396854, 0.2264994591213864, -0.05208658309572417, 0.019635946271212203, -0.0795545969725303, -0.14090683413669466, -0.002995861700290571, 0.5157880233033844, -0.25409358749571054, -0.2817571007039236, -0.008852920751087368, -0.2589418282266706, -0.0704758348348348, 0.2636057706590256, 0.009800921700408926, 0.02165985599808071, 0.02744511850178242, -0.1011616113109757, 0.042876167012297586, -0.047807848917158405, 0.23315007926936707, 0.09027533500819751, 0.29165838232830815, 0.08564864188311216, 0.06746272041826792, -0.005158367862358041, 0.049036560053734676, -0.0534194578052215, -0.08991794730239275, 0.04620314516385248, 0.2375909619114321, -0.0022748450586653275, 0.24549998389557004, -0.4129464290064314, -0.275814951303334, 0.03825642001086279, 0.21565736012492814, 0.15514343622160834, -0.07817335676543577, -0.29136786034290235, 0.012151840433437863, -0.1064391573315294, -0.15090132538715134, -0.04599527332769788, -0.032358597617839345, 0.06970084422146497, -0.3023608699845879, 0.013507726658945498, 0.04558919450349134, 0.08522790687401657, -0.03753323853522053, -0.031315057259052995, -0.06815614030574975, 0.023000849124408612, 0.025571643571247873, 0.05552190046393029, 0.20251108527224024, -0.14532784913342608, -0.13818516519892474, 0.35787129484764907, -0.11345937179323064, -0.09892569118705781, 0.13888557394966483, -0.20488650891929866, 0.009839256715191447, 0.235752579541472, 0.15425040588471228, 0.12042081205417281, -0.10121347524691374, -0.03333489739528412, 0.007361727224096008, 0.2706122270582811, 0.16490511224078744, 0.1345896094996968, 0.23503388948738574, 0.15430947855803306, 0.0353746352798265, 0.1792849307231929, -0.12818169237478919, 0.0019799567678052445, -0.2555433781655586, -0.09151550077063882, -0.19444142586587038, 0.06414161136211909, -0.06106838591272801, -0.0929320046847747, 0.469982657354811, 0.12315032514439815, 0.1346427321838944, -0.051085773093180485, 0.3354847335621067, 0.17451132031906721, 0.08147306053534797, 0.012395251214342273, 0.3159919122233987, 0.1720653658044403, 0.09265990027267, -0.31305929317908443, -0.004338669748571904, -0.0653430965759427]
|
1,803.0689
|
Frequency and mode identification of {\gamma} Doradus from photometric
and spectroscopic observations
|
The prototype star for the {\gamma} Doradus class of pulsating variables was
studied em- ploying photometric and spectroscopic observations to determine the
frequencies and modes of pulsation. The four frequencies found were
self-consistent between the obser- vation types and almost identical to those
found in previous studies (1.3641 d-1 ,1.8783 d-1 , 1.4742 d-1 and 1.3209 d-1).
Three of the frequencies are classified as l, m = (1, 1) pulsations and the
other is ambiguous between l = 2 modes. Two frequencies are shown to be stable
over twenty years since their first identification. The agreement in
ground-based work makes this star an excellent calibrator for the upcoming TESS
observations and a standard for continued asteroseismic modelling.
|
astro-ph.SR
|
the prototype star for the gamma doradus class of pulsating variables was studied em ploying photometric and spectroscopic observations to determine the frequencies and modes of pulsation the four frequencies found were selfconsistent between the obser vation types and almost identical to those found in previous studies 13641 d1 18783 d1 14742 d1 and 13209 d1 three of the frequencies are classified as l m 1 1 pulsations and the other is ambiguous between l 2 modes two frequencies are shown to be stable over twenty years since their first identification the agreement in groundbased work makes this star an excellent calibrator for the upcoming tess observations and a standard for continued asteroseismic modelling
|
[['the', 'prototype', 'star', 'for', 'the', 'gamma', 'doradus', 'class', 'of', 'pulsating', 'variables', 'was', 'studied', 'em', 'ploying', 'photometric', 'and', 'spectroscopic', 'observations', 'to', 'determine', 'the', 'frequencies', 'and', 'modes', 'of', 'pulsation', 'the', 'four', 'frequencies', 'found', 'were', 'selfconsistent', 'between', 'the', 'obser', 'vation', 'types', 'and', 'almost', 'identical', 'to', 'those', 'found', 'in', 'previous', 'studies', '13641', 'd1', '18783', 'd1', '14742', 'd1', 'and', '13209', 'd1', 'three', 'of', 'the', 'frequencies', 'are', 'classified', 'as', 'l', 'm', '1', '1', 'pulsations', 'and', 'the', 'other', 'is', 'ambiguous', 'between', 'l', '2', 'modes', 'two', 'frequencies', 'are', 'shown', 'to', 'be', 'stable', 'over', 'twenty', 'years', 'since', 'their', 'first', 'identification', 'the', 'agreement', 'in', 'groundbased', 'work', 'makes', 'this', 'star', 'an', 'excellent', 'calibrator', 'for', 'the', 'upcoming', 'tess', 'observations', 'and', 'a', 'standard', 'for', 'continued', 'asteroseismic', 'modelling']]
|
[-0.12750615669017093, 0.1554183797504157, -0.031930442275735764, 0.052659925697115036, -0.09777166875967876, -0.1325056861291443, 0.046296361910709, 0.40485858910400935, -0.15310043496199363, -0.33081011462170595, 0.10280597474801978, -0.3147445274260613, -0.06610452266273285, 0.24751162232292834, -0.00898515462977897, 0.042276538976835545, 0.08528645951813514, 0.0074681095232110506, -0.020011492492203867, -0.24197759233210064, 0.20693336433619944, 0.025129676104412167, 0.1884899710159783, -0.12306300109816254, -0.01187445889355256, -0.07737160465944934, -0.14147526256466678, -0.031303344422592486, -0.17408545889011626, 0.04782804726289773, 0.302865399492033, 0.10046285715107935, 0.2021425539892543, -0.3239359645591622, -0.21901882904231412, 0.06842794358503894, 0.15887168753858005, 0.03328316056152481, 0.04882062787890708, -0.24504674720757325, 0.06421446813902723, -0.13159503704022377, -0.16328212386424387, -0.018401176054586032, 0.13895108914344545, 0.038081251862330724, -0.26940373065582385, 0.03966337546210633, 0.034533698363827726, 0.12014837003817115, -0.12261434653004923, -0.17835986282283423, -0.027197536021265963, 0.13346719373991595, 0.03736196511954821, 0.05313911693973826, 0.01223057638768346, -0.0712220978713808, -0.0969690027809061, 0.362653201650999, -0.08293914094934701, -0.06880194254843262, 0.24413165709841142, -0.19808049931472868, -0.18274815650998588, 0.11446467633871789, 0.07097466418587971, 0.1311210165560724, -0.17069263981843213, 0.02107590520348605, 0.028668641266541197, 0.18087581883893783, 0.13636766828664945, 0.058409480966449774, 0.25333709062136917, 0.1229027107960348, -0.0129002680096331, 0.07568272296285872, -0.19586379540691135, -0.0007128642497898225, -0.25196200682687653, -0.08842516900681027, -0.1320588595806322, 0.041117083847334764, -0.059388778406599056, -0.10729804186555215, 0.3759924768888896, 0.07076398418242232, 0.16620543607459362, 0.04186536874109452, 0.240259688415932, 0.055740942340130585, 0.05546855851324326, 0.0659777791123974, 0.34762922812834246, 0.17706691398746718, 0.0641729298353178, -0.21504791865740483, -0.03184680889762186, -0.005992587014964414]
|
1,803.06891
|
Correlations between X-ray properties and Black Hole Mass in AGN:
towards a new method to estimate black hole mass from short exposure X-ray
observations
|
Several investigations of the X-ray variability of active galactic nuclei
(AGN) using the normalised excess variance (${\sigma^2_{\rm NXS}}$) parameter
have shown that variability has a strong anti-correlation with black hole mass
($M_{\rm BH}$) and X-ray luminosity ($L_{\rm X}$). In this study we confirm
these previous correlations and find no evidence of a redshift evolution. Using
observations from XMM-Newton, we determine the ${\sigma^2_{\rm NXS}}$ and
$L_{\rm X}$ for a sample of 1091 AGN drawn from the XMM-Newton Cluster Survey
(XCS) - making this the largest study of X-ray spectral properties of AGNs. We
created light-curves in three time-scales; 10 ks, 20 ks and 40 ks and used
these to derive scaling relations between ${\sigma^2_{\rm NXS}}$, $L_{\rm X}$
(2.0-10 keV range) and literature estimates of $M_{\rm BH}$ from reverberation
mapping. We confirm the anti-correlation between $M_{\rm BH}$ and
${\sigma^2_{\rm NXS}}$ and find a positive correlation between $M_{\rm BH}$ and
$L_{\rm X}$. The use of ${\sigma^2_{\rm NXS}}$ is practical only for pointed
observations where the observation time is tens of kiloseconds. For much
shorter observations one cannot accurately quantify variability to estimate
$M_{\rm BH}$. Here we describe a method to derive $L_{\rm X}$ from short
duration observations and used these results as an estimate for $M_{\rm BH}$.
We find that it is possible to estimate $L_{\rm X}$ from observations of just a
few hundred seconds and that when correlated with $M_{\rm BH}$, the relation is
statistically similar to the relation of $M_{\rm BH}$-$L_{\rm X}$ derived from
a spectroscopic analysis of full XMM observations. This method may be
particularly useful to the eROSITA mission, an all-sky survey, which will
detect $>$10$^{6}$ AGN.
|
astro-ph.GA astro-ph.HE
|
several investigations of the xray variability of active galactic nuclei agn using the normalised excess variance sigma2_rm nxs parameter have shown that variability has a strong anticorrelation with black hole mass m_rm bh and xray luminosity l_rm x in this study we confirm these previous correlations and find no evidence of a redshift evolution using observations from xmmnewton we determine the sigma2_rm nxs and l_rm x for a sample of 1091 agn drawn from the xmmnewton cluster survey xcs making this the largest study of xray spectral properties of agns we created lightcurves in three timescales 10 ks 20 ks and 40 ks and used these to derive scaling relations between sigma2_rm nxs l_rm x 2010 kev range and literature estimates of m_rm bh from reverberation mapping we confirm the anticorrelation between m_rm bh and sigma2_rm nxs and find a positive correlation between m_rm bh and l_rm x the use of sigma2_rm nxs is practical only for pointed observations where the observation time is tens of kiloseconds for much shorter observations one cannot accurately quantify variability to estimate m_rm bh here we describe a method to derive l_rm x from short duration observations and used these results as an estimate for m_rm bh we find that it is possible to estimate l_rm x from observations of just a few hundred seconds and that when correlated with m_rm bh the relation is statistically similar to the relation of m_rm bhl_rm x derived from a spectroscopic analysis of full xmm observations this method may be particularly useful to the erosita mission an allsky survey which will detect 106 agn
|
[['several', 'investigations', 'of', 'the', 'xray', 'variability', 'of', 'active', 'galactic', 'nuclei', 'agn', 'using', 'the', 'normalised', 'excess', 'variance', 'sigma2_rm', 'nxs', 'parameter', 'have', 'shown', 'that', 'variability', 'has', 'a', 'strong', 'anticorrelation', 'with', 'black', 'hole', 'mass', 'm_rm', 'bh', 'and', 'xray', 'luminosity', 'l_rm', 'x', 'in', 'this', 'study', 'we', 'confirm', 'these', 'previous', 'correlations', 'and', 'find', 'no', 'evidence', 'of', 'a', 'redshift', 'evolution', 'using', 'observations', 'from', 'xmmnewton', 'we', 'determine', 'the', 'sigma2_rm', 'nxs', 'and', 'l_rm', 'x', 'for', 'a', 'sample', 'of', '1091', 'agn', 'drawn', 'from', 'the', 'xmmnewton', 'cluster', 'survey', 'xcs', 'making', 'this', 'the', 'largest', 'study', 'of', 'xray', 'spectral', 'properties', 'of', 'agns', 'we', 'created', 'lightcurves', 'in', 'three', 'timescales', '10', 'ks', '20', 'ks', 'and', '40', 'ks', 'and', 'used', 'these', 'to', 'derive', 'scaling', 'relations', 'between', 'sigma2_rm', 'nxs', 'l_rm', 'x', '2010', 'kev', 'range', 'and', 'literature', 'estimates', 'of', 'm_rm', 'bh', 'from', 'reverberation', 'mapping', 'we', 'confirm', 'the', 'anticorrelation', 'between', 'm_rm', 'bh', 'and', 'sigma2_rm', 'nxs', 'and', 'find', 'a', 'positive', 'correlation', 'between', 'm_rm', 'bh', 'and', 'l_rm', 'x', 'the', 'use', 'of', 'sigma2_rm', 'nxs', 'is', 'practical', 'only', 'for', 'pointed', 'observations', 'where', 'the', 'observation', 'time', 'is', 'tens', 'of', 'kiloseconds', 'for', 'much', 'shorter', 'observations', 'one', 'can', 'not', 'accurately', 'quantify', 'variability', 'to', 'estimate', 'm_rm', 'bh', 'here', 'we', 'describe', 'a', 'method', 'to', 'derive', 'l_rm', 'x', 'from', 'short', 'duration', 'observations', 'and', 'used', 'these', 'results', 'as', 'an', 'estimate', 'for', 'm_rm', 'bh', 'we', 'find', 'that', 'it', 'is', 'possible', 'to', 'estimate', 'l_rm', 'x', 'from', 'observations', 'of', 'just', 'a', 'few', 'hundred', 'seconds', 'and', 'that', 'when', 'correlated', 'with', 'm_rm', 'bh', 'the', 'relation', 'is', 'statistically', 'similar', 'to', 'the', 'relation', 'of', 'm_rm', 'bhl_rm', 'x', 'derived', 'from', 'a', 'spectroscopic', 'analysis', 'of', 'full', 'xmm', 'observations', 'this', 'method', 'may', 'be', 'particularly', 'useful', 'to', 'the', 'erosita', 'mission', 'an', 'allsky', 'survey', 'which', 'will', 'detect', '106', 'agn']]
|
[-0.03610953795882168, 0.0799565844016485, -0.05514109674354654, 0.16770204890792176, -0.09206944655143975, -0.09608361359777749, 0.10024439853506593, 0.4435293912929274, -0.14674387953188547, -0.35900938449733294, 0.08689488850467936, -0.3732807800476092, -0.001422107561774649, 0.25894209610666635, -0.016011780324225216, -0.014850036840729065, 0.02625463150507673, -0.0974407193308293, -0.10729656214520653, -0.23084173539093933, 0.2356684621707571, 0.05425770624554647, 0.15931545279628195, -0.020978571099069303, 0.09638337512655225, -0.04196975323060569, -0.070621917270117, 0.002825594679174472, -0.19591103425140752, 0.026844826933646895, 0.25581664032148155, 0.16416530242322688, 0.2267375848618329, -0.3071994316735018, -0.16329042600996013, 0.10965913240085426, 0.15478514984107591, -0.04075667229281224, -0.015864994767844788, -0.23232950207971925, 0.0477872297372808, -0.23563672146245615, -0.10535625696057148, 0.01708741966850444, 0.13459225225117857, 0.031717895639629394, -0.23955812226501363, 0.16702038628994417, 0.018888005993542706, 0.03417841503448756, -0.12288611296889261, -0.03346610730105608, -0.0496815066895823, 0.04824353986884095, 0.0757198198698461, 0.11265313324436838, 0.1329336801088596, -0.06898975499936921, -0.04884341475054267, 0.3364463975729504, -0.051496376187902, 0.037442133167702986, 0.17532486975264264, -0.22082278683934528, -0.1940498342268419, 0.1103427561908724, 0.13619231127042658, 0.12704349951662205, -0.16327971744216646, 0.028543452326766104, -0.03913926161259218, 0.317564079138353, -0.008979557310543788, 0.07036282453441005, 0.2902932471722545, 0.09847272849170867, 0.019460456637811582, 0.08303467772354602, -0.2532605776411822, 0.012803590512241987, -0.2593802871641272, -0.08193949855705063, -0.1435522864226933, 0.18705659340542555, -0.14803136231269343, -0.06453109493185054, 0.2934284092034839, 0.1652336986409674, 0.2714287197024478, 0.1034043876766123, 0.23848403523912404, 0.10552996999033337, 0.07051688981930544, 0.10547878421015981, 0.3254219529517829, 0.17306617266540206, 0.04509600319503459, -0.23363218889198153, 0.014806580250220957, 0.020729741496867987]
|
1,803.06892
|
Dynamics and Stability of Meshed Multiterminal HVDC Networks
|
This paper investigates the existence of an equilibrium point in
multiterminal HVDC (MT-HVDC) grids, assesses its uniqueness and defines
conditions to ensure its stability. An offshore MT-HVDC system including two
wind farms is selected as application test case. At first, a generalized
dynamic model of the network is proposed, using hypergraph theory. Such model
captures the frequency dependence of transmission lines and cables, it is
non-linear due to the constant power behavior of the converter terminals using
droop regulation, and presents a suitable degree of simplifications of the MMC
converters, under given conditions, to allow system level studies over
potentially large networks. Based on this model, the existence and uniqueness
of the equilibrium point is demonstrated by returning the analysis to a
load-flow problem and using the Banach fixed point theorem. Additionally, the
stability of the equilibrium is analyzed by obtaining a Lyapunov function by
the Krasovskii's theorem. Computational results obtained for the selected 4
terminals MT-HVDC grid corroborate the requirement for the existence and
stability of the equilibrium point.
|
eess.SP
|
this paper investigates the existence of an equilibrium point in multiterminal hvdc mthvdc grids assesses its uniqueness and defines conditions to ensure its stability an offshore mthvdc system including two wind farms is selected as application test case at first a generalized dynamic model of the network is proposed using hypergraph theory such model captures the frequency dependence of transmission lines and cables it is nonlinear due to the constant power behavior of the converter terminals using droop regulation and presents a suitable degree of simplifications of the mmc converters under given conditions to allow system level studies over potentially large networks based on this model the existence and uniqueness of the equilibrium point is demonstrated by returning the analysis to a loadflow problem and using the banach fixed point theorem additionally the stability of the equilibrium is analyzed by obtaining a lyapunov function by the krasovskiis theorem computational results obtained for the selected 4 terminals mthvdc grid corroborate the requirement for the existence and stability of the equilibrium point
|
[['this', 'paper', 'investigates', 'the', 'existence', 'of', 'an', 'equilibrium', 'point', 'in', 'multiterminal', 'hvdc', 'mthvdc', 'grids', 'assesses', 'its', 'uniqueness', 'and', 'defines', 'conditions', 'to', 'ensure', 'its', 'stability', 'an', 'offshore', 'mthvdc', 'system', 'including', 'two', 'wind', 'farms', 'is', 'selected', 'as', 'application', 'test', 'case', 'at', 'first', 'a', 'generalized', 'dynamic', 'model', 'of', 'the', 'network', 'is', 'proposed', 'using', 'hypergraph', 'theory', 'such', 'model', 'captures', 'the', 'frequency', 'dependence', 'of', 'transmission', 'lines', 'and', 'cables', 'it', 'is', 'nonlinear', 'due', 'to', 'the', 'constant', 'power', 'behavior', 'of', 'the', 'converter', 'terminals', 'using', 'droop', 'regulation', 'and', 'presents', 'a', 'suitable', 'degree', 'of', 'simplifications', 'of', 'the', 'mmc', 'converters', 'under', 'given', 'conditions', 'to', 'allow', 'system', 'level', 'studies', 'over', 'potentially', 'large', 'networks', 'based', 'on', 'this', 'model', 'the', 'existence', 'and', 'uniqueness', 'of', 'the', 'equilibrium', 'point', 'is', 'demonstrated', 'by', 'returning', 'the', 'analysis', 'to', 'a', 'loadflow', 'problem', 'and', 'using', 'the', 'banach', 'fixed', 'point', 'theorem', 'additionally', 'the', 'stability', 'of', 'the', 'equilibrium', 'is', 'analyzed', 'by', 'obtaining', 'a', 'lyapunov', 'function', 'by', 'the', 'krasovskiis', 'theorem', 'computational', 'results', 'obtained', 'for', 'the', 'selected', '4', 'terminals', 'mthvdc', 'grid', 'corroborate', 'the', 'requirement', 'for', 'the', 'existence', 'and', 'stability', 'of', 'the', 'equilibrium', 'point']]
|
[-0.18268369320396552, 0.007140122813015136, -0.07329016211990486, 0.011621294560266988, -0.013911758805625141, -0.14746744267861633, 0.08487129384268294, 0.3035179990562884, -0.2693847278845223, -0.2790846913833829, 0.14798302122816334, -0.25271622302448926, -0.13676424067850937, 0.1963051226828932, -0.06784841456340955, 0.08490058443276212, 0.04424219895975993, -0.003398366383386447, -0.016938913736821097, -0.18758401781772538, 0.3286934338099159, 0.08445490142535966, 0.3218890084193417, 0.07016975089243394, 0.130801616422832, -0.0004117516882936744, 0.007222621139440247, 0.027368625384234988, -0.1317877046092797, 0.07773497867986888, 0.23418594896382489, 0.12995848714456182, 0.288585433207781, -0.40477216997567345, -0.2052406332551447, 0.10091466938337201, 0.06642611199743388, 0.0489571941906915, -0.03080963689957143, -0.23648677820421973, 0.14418200769954745, -0.1546705436640289, -0.17907507448279134, -0.05871904498952277, -0.030154748195234466, 0.08108908424893503, -0.3149206008269068, 0.021302096108796402, 0.06679163352476762, 0.09622233772944823, -0.08918162765775753, -0.08634668018751065, -0.050294004879234466, 0.13284967925454325, 0.02512333255384446, -0.038229209082440804, 0.1304271710653077, -0.10828520453480237, -0.10237091056290357, 0.3625265326474191, -0.03158438085331856, -0.20133541691158077, 0.16060086408328703, -0.08384735950282501, -0.09789816096719518, 0.10445127549636013, 0.15707496853326172, 0.10762696315479629, -0.16812527926625026, 0.08868118459701209, -0.05000010871821466, 0.15054407901308664, 0.07295591083478511, -0.006282472184530514, 0.18134039933656287, 0.21550394112709909, 0.13763578487834072, 0.18427687589496866, -0.08246703142957652, -0.11348613953930052, -0.293774016185061, -0.10064236575134974, -0.17492711325449978, 0.04686914706013768, -0.10152316449829787, -0.1616983860155896, 0.41307055517373714, 0.15345953878508334, 0.13659460833570097, 0.06523287875358673, 0.3109850696342833, 0.16241641085225103, -0.011410120741792899, 0.09484337990391342, 0.2164939138422008, 0.1531043346190606, 0.12104299280395293, -0.22504053913769037, 0.06466905385091462, 0.07636631763923694]
|
1,803.06893
|
On reference solutions and the sensitivity of the 2D Kelvin-Helmholtz
instability problem
|
Two-dimensional Kelvin-Helmholtz instability problems are popular examples
for assessing discretizations for incompressible flows at high Reynolds number.
Unfortunately, the results in the literature differ considerably. This paper
presents computational studies of a Kelvin-Helmholtz instability problem with
high order divergence-free finite element methods. Reference results in several
quantities of interest are obtained for three different Reynolds numbers up to
the beginning of the final vortex pairing. A mesh-independent prediction of the
final pairing is not achieved due to the sensitivity of the considered problem
with respect to small perturbations. A theoretical explanation of this
sensitivity to small perturbations is provided based on the theory of
self-organization of 2D turbulence. Possible sources of perturbations that
arise in almost any numerical simulation are discussed.
|
math.NA physics.comp-ph physics.flu-dyn
|
twodimensional kelvinhelmholtz instability problems are popular examples for assessing discretizations for incompressible flows at high reynolds number unfortunately the results in the literature differ considerably this paper presents computational studies of a kelvinhelmholtz instability problem with high order divergencefree finite element methods reference results in several quantities of interest are obtained for three different reynolds numbers up to the beginning of the final vortex pairing a meshindependent prediction of the final pairing is not achieved due to the sensitivity of the considered problem with respect to small perturbations a theoretical explanation of this sensitivity to small perturbations is provided based on the theory of selforganization of 2d turbulence possible sources of perturbations that arise in almost any numerical simulation are discussed
|
[['twodimensional', 'kelvinhelmholtz', 'instability', 'problems', 'are', 'popular', 'examples', 'for', 'assessing', 'discretizations', 'for', 'incompressible', 'flows', 'at', 'high', 'reynolds', 'number', 'unfortunately', 'the', 'results', 'in', 'the', 'literature', 'differ', 'considerably', 'this', 'paper', 'presents', 'computational', 'studies', 'of', 'a', 'kelvinhelmholtz', 'instability', 'problem', 'with', 'high', 'order', 'divergencefree', 'finite', 'element', 'methods', 'reference', 'results', 'in', 'several', 'quantities', 'of', 'interest', 'are', 'obtained', 'for', 'three', 'different', 'reynolds', 'numbers', 'up', 'to', 'the', 'beginning', 'of', 'the', 'final', 'vortex', 'pairing', 'a', 'meshindependent', 'prediction', 'of', 'the', 'final', 'pairing', 'is', 'not', 'achieved', 'due', 'to', 'the', 'sensitivity', 'of', 'the', 'considered', 'problem', 'with', 'respect', 'to', 'small', 'perturbations', 'a', 'theoretical', 'explanation', 'of', 'this', 'sensitivity', 'to', 'small', 'perturbations', 'is', 'provided', 'based', 'on', 'the', 'theory', 'of', 'selforganization', 'of', '2d', 'turbulence', 'possible', 'sources', 'of', 'perturbations', 'that', 'arise', 'in', 'almost', 'any', 'numerical', 'simulation', 'are', 'discussed']]
|
[-0.1761818173079759, 0.13578499748933415, -0.048617419715555124, 0.06784600497431252, -0.05066580430042645, -0.0816632473094712, -0.03537311791326882, 0.2947787164579615, -0.25611326434026077, -0.2993628243508764, 0.1130106321522535, -0.24796818662434816, -0.0940913690565816, 0.23988232823581365, -0.05699454952023677, 0.11723346864681475, 0.09676798963765344, -0.013865464189944188, -0.06977852876346236, -0.2637571746383386, 0.31814680064158624, 0.06875734132029547, 0.29841044541325207, 0.03387953005038387, 0.0718530490571125, -0.12506890123756217, -0.03577125947229749, 0.07145508832860091, -0.16443049961400136, 0.08717693685754087, 0.27723829718491866, 0.05140983746656455, 0.308784810010313, -0.4351428785623044, -0.23693298985642836, 0.06102467885756604, 0.14927028195763176, 0.15399354742839932, -0.055911012134353115, -0.23703194683617798, 0.14343694694848222, -0.16600497452973212, -0.1387928353222318, -0.0790733458216433, 0.0027751207297806403, 0.04352834251947886, -0.28715563331507454, 0.10763205010597864, 0.04303008612737921, 0.0982064294497952, -0.08103258016111314, -0.1290070853419294, -0.021647019669690654, 0.09187690779366646, 0.13051516760894952, 0.008067995663886229, 0.08550792442988758, -0.16552607282565152, -0.11117741089287284, 0.42343037901831065, -0.021574432194901128, -0.23999641937577004, 0.23312085760903567, -0.1311330036760485, -0.12058059005105237, 0.17026308848145455, 0.1855762875138605, 0.1092532417671524, -0.05214443025833442, 0.03398894595967467, -0.037723235635871974, 0.12512879896031553, 0.061813116585450974, 0.001180298784208938, 0.17083616425429493, 0.20262353497842125, 0.05594114716788215, 0.10964947123049705, -0.05977386716861001, -0.10519238100781621, -0.32816000464122186, -0.0884576229963544, -0.18137059758671306, -0.011301170228205983, -0.0812019969890864, -0.1964074356576682, 0.37564211368006617, 0.18760125449866302, 0.15932352542044972, 0.027517039072892265, 0.30885006219518085, 0.10611636423667477, 0.021485819150347356, 0.05800288367616244, 0.27197884626624996, 0.17395370026419232, 0.11635815249448103, -0.20798195972230502, 0.046571467031363, 0.0730241470573824]
|
1,803.06894
|
Main features of detectors and isotopes to investigate double beta decay
with increased sensitivity
|
The current situation in double beta decay experiments , the characteristics
of modern detectors and the possibility of increasing the sensitivity to
neutrino mass in future experiments are discussed. The issue of the production
and use of enriched isotopes in double beta decay experiments is discussed in
addition.
|
nucl-ex physics.ins-det
|
the current situation in double beta decay experiments the characteristics of modern detectors and the possibility of increasing the sensitivity to neutrino mass in future experiments are discussed the issue of the production and use of enriched isotopes in double beta decay experiments is discussed in addition
|
[['the', 'current', 'situation', 'in', 'double', 'beta', 'decay', 'experiments', 'the', 'characteristics', 'of', 'modern', 'detectors', 'and', 'the', 'possibility', 'of', 'increasing', 'the', 'sensitivity', 'to', 'neutrino', 'mass', 'in', 'future', 'experiments', 'are', 'discussed', 'the', 'issue', 'of', 'the', 'production', 'and', 'use', 'of', 'enriched', 'isotopes', 'in', 'double', 'beta', 'decay', 'experiments', 'is', 'discussed', 'in', 'addition']]
|
[-0.05972308290508041, 0.22609396538439583, 0.025027783329975097, 0.12174003881630191, 0.02293726881133749, -0.09612661255325408, 0.04158354249406368, 0.344311940226149, -0.24295895344557913, -0.25727171895708495, 0.07859846184703898, -0.3541852175159023, -0.07691775274245029, 0.25861875832754566, 0.05143812445408486, 0.09209709664053739, 0.09200108247472251, 0.04434758778463336, -0.12048001315920277, -0.23607637929393255, 0.29277266387609724, 0.16625311735898574, 0.29317730126228736, 0.09807065898116599, -0.024025166534169754, -0.05183830708661612, -0.0912992652007775, -0.05241461827399883, -0.1283830120023885, 0.07156254913895688, 0.22724631167155632, 0.137171726277534, 0.17299071200033453, -0.42109812514737566, -0.1399553227337434, 0.1176576033591273, 0.15620240986228306, 0.0062724033648029285, -0.16373949248264444, -0.2714638225734234, 0.047884231833295224, -0.20363421238800314, -0.17841402742456883, -0.02177930789742064, 0.003711612677161998, 0.06461524206431622, -0.27229159479921167, 0.05159184392640724, -0.018673198802911854, -0.03301501121035123, -0.012499792070345992, -0.16735097296298185, 0.05937404419354936, 0.08172112400148143, 0.1433385008341692, -0.04581904738269588, 0.1694342226949223, -0.19805530801494706, -0.137555747035336, 0.33462282880506616, -0.11203044920941775, -0.16263159400129573, 0.12980621323940603, -0.2174957435853046, -0.16285532133336714, 0.12127170577011209, 0.14350610670257122, 0.10265701217576861, -0.13064926341572342, 0.12086202590379547, 0.03401168205953659, 0.13517463147303366, 0.05882632834935918, 0.05373870096407197, 0.2286746492411228, 0.31353848601909395, -0.022181125298300956, 0.05480087284702174, -0.19385756421933306, -0.09413865496939484, -0.33119820359539476, -0.1879619314097502, -0.05368757822570649, -0.007095139612384299, 0.0037569399691493983, -0.0869025866844087, 0.3908405940424889, 0.13386315335222382, 0.17978834138905747, -0.06914716715270534, 0.2699466442015577, 0.06615070691530375, 0.07206223603892833, -0.09955454289794285, 0.33473699571604426, 0.16467942844362968, 0.12599158186980702, -0.27395079848653775, 0.05539953494642643, -0.032684308011084795]
|
1,803.06895
|
Global multiplicity bounds and Spectral Statistics Random Operators
|
In this paper, we consider Anderson type operators on a separable Hilbert
space where the random perturbations are finite rank and the random variables
have full support on $\mathbb{R}$. We show that spectral multiplicity has a
uniform lower bound whenever the lower bound is given on a set of positive
Lebesgue measure on the point spectrum away from the continuous one. We also
show a deep connection between the multiplicity of pure point spectrum and
local spectral statistics, in particular, we show that spectral multiplicity
higher than one always gives non-Poisson local statistics in the framework of
Minami theory.
In particular, in higher rank Anderson models with pure-point spectrum, with
the randomness having support equal to $\mathbb{R}$, there is a uniform lower
bound on spectral multiplicity and in case this is larger than one the local
statistics is not Poisson.
|
math.SP
|
in this paper we consider anderson type operators on a separable hilbert space where the random perturbations are finite rank and the random variables have full support on mathbbr we show that spectral multiplicity has a uniform lower bound whenever the lower bound is given on a set of positive lebesgue measure on the point spectrum away from the continuous one we also show a deep connection between the multiplicity of pure point spectrum and local spectral statistics in particular we show that spectral multiplicity higher than one always gives nonpoisson local statistics in the framework of minami theory in particular in higher rank anderson models with purepoint spectrum with the randomness having support equal to mathbbr there is a uniform lower bound on spectral multiplicity and in case this is larger than one the local statistics is not poisson
|
[['in', 'this', 'paper', 'we', 'consider', 'anderson', 'type', 'operators', 'on', 'a', 'separable', 'hilbert', 'space', 'where', 'the', 'random', 'perturbations', 'are', 'finite', 'rank', 'and', 'the', 'random', 'variables', 'have', 'full', 'support', 'on', 'mathbbr', 'we', 'show', 'that', 'spectral', 'multiplicity', 'has', 'a', 'uniform', 'lower', 'bound', 'whenever', 'the', 'lower', 'bound', 'is', 'given', 'on', 'a', 'set', 'of', 'positive', 'lebesgue', 'measure', 'on', 'the', 'point', 'spectrum', 'away', 'from', 'the', 'continuous', 'one', 'we', 'also', 'show', 'a', 'deep', 'connection', 'between', 'the', 'multiplicity', 'of', 'pure', 'point', 'spectrum', 'and', 'local', 'spectral', 'statistics', 'in', 'particular', 'we', 'show', 'that', 'spectral', 'multiplicity', 'higher', 'than', 'one', 'always', 'gives', 'nonpoisson', 'local', 'statistics', 'in', 'the', 'framework', 'of', 'minami', 'theory', 'in', 'particular', 'in', 'higher', 'rank', 'anderson', 'models', 'with', 'purepoint', 'spectrum', 'with', 'the', 'randomness', 'having', 'support', 'equal', 'to', 'mathbbr', 'there', 'is', 'a', 'uniform', 'lower', 'bound', 'on', 'spectral', 'multiplicity', 'and', 'in', 'case', 'this', 'is', 'larger', 'than', 'one', 'the', 'local', 'statistics', 'is', 'not', 'poisson']]
|
[-0.09539441227181149, 0.1251948223715382, -0.11258067745781902, 0.10494127577736176, -0.021973954106215388, -0.13088236195367894, 0.03309194577658283, 0.35555978416066086, -0.21637159543378012, -0.21164423191720352, 0.0824139343025828, -0.28600853054252057, -0.12381606001539953, 0.17826326163485645, -0.07497765914137874, 0.015453209987442408, 0.02741861053842253, 0.1326052007331912, -0.09215611268300564, -0.25662930434336884, 0.3903366774420387, 0.014885963777071862, 0.28156589016185274, 0.04145162519998848, 0.040515973771523155, 0.03053577280536826, -0.018091829785511698, 0.012602548167134436, -0.14017665608106264, 0.12744217346854775, 0.18663811596158797, 0.09542571070404457, 0.29285099045373497, -0.35568733255245855, -0.22183096928388946, 0.21978364576851683, 0.11411019868350454, 0.059764112432354265, -0.00955124329276649, -0.23349316588303606, 0.14987541174549343, -0.16638110494241118, -0.12181336194210286, -0.038173782060455, 0.02004133316721501, 0.02896657320005553, -0.2821432224840724, 0.08378058574307942, 0.1128999284967514, 0.07428670724454735, -0.07082314180858833, -0.1229046680166253, -0.034133029787335546, 0.07235891698260925, 0.00040613473975099624, 0.03248492909977878, 0.04957507928567273, -0.08483432762191764, -0.10813707274750674, 0.3210971523342388, -0.09587178436236822, -0.23589659233943427, 0.20836595639786018, -0.2416671821980604, -0.16474328222684562, 0.1270975497784093, 0.1642352464999671, 0.11033882971761548, -0.06368240024894475, 0.15838087017390146, -0.10945526557043195, 0.1669106093488933, 0.04885773043746927, 0.07591632074410362, 0.1434841198913221, 0.10055181602614799, 0.19493724893213116, 0.12952452890042748, -0.05640979857749439, -0.08566653459732021, -0.30568110921553204, -0.12302324773502603, -0.2537145172694831, 0.09159636904795272, -0.11928778663579058, -0.19566941216705475, 0.3975498225506661, 0.11581974431340183, 0.2326205775842287, 0.1023727865157915, 0.25627704770969495, 0.19270677359568902, -0.005478654767752492, 0.1017528322758153, 0.16955117174158138, 0.14169867874256203, 0.0561337950207027, -0.12901807242472257, 0.0192928175009521, 0.12345451412256807]
|
1,803.06896
|
Prehistory of Transit Searches
|
Nowadays the more powerful method to detect extrasolar planets is the transit
method. We review the planet transits which were anticipated, searched, and the
first ones which were observed all through history. Indeed transits of planets
in front of their star were first investigated and studied in the solar system.
The first observations of sunspots were sometimes mistaken for transits of
unknown planets. The first scientific observation and study of a transit in the
solar system was the observation of Mercury transit by Pierre Gassendi in 1631.
Because observations of Venus transits could give a way to determine the
distance Sun-Earth, transits of Venus were overwhelmingly observed. Some
objects which actually do not exist were searched by their hypothetical
transits on the Sun, as some examples a Venus satellite and an infra-mercurial
planet. We evoke the possibly first use of the hypothesis of an exoplanet
transit to explain some periodic variations of the luminosity of a star, namely
the star Algol, during the eighteen century. Then we review the predictions of
detection of exoplanets by their transits, those predictions being sometimes
ancient, and made by astronomers as well as popular science writers. However,
these very interesting predictions were never published in peer-reviewed
journals specialized in astronomical discoveries and results. A possible
transit of the planet beta Pic b was observed in 1981. Shall we see another
transit expected for the same planet during 2018? Today, some studies of
transits which are connected to hypothetical extraterrestrial civilisations are
published in astronomical refereed journals. Some studies which would be
classified not long ago as science fiction are now considered as scientific
ones.
|
astro-ph.EP astro-ph.IM
|
nowadays the more powerful method to detect extrasolar planets is the transit method we review the planet transits which were anticipated searched and the first ones which were observed all through history indeed transits of planets in front of their star were first investigated and studied in the solar system the first observations of sunspots were sometimes mistaken for transits of unknown planets the first scientific observation and study of a transit in the solar system was the observation of mercury transit by pierre gassendi in 1631 because observations of venus transits could give a way to determine the distance sunearth transits of venus were overwhelmingly observed some objects which actually do not exist were searched by their hypothetical transits on the sun as some examples a venus satellite and an inframercurial planet we evoke the possibly first use of the hypothesis of an exoplanet transit to explain some periodic variations of the luminosity of a star namely the star algol during the eighteen century then we review the predictions of detection of exoplanets by their transits those predictions being sometimes ancient and made by astronomers as well as popular science writers however these very interesting predictions were never published in peerreviewed journals specialized in astronomical discoveries and results a possible transit of the planet beta pic b was observed in 1981 shall we see another transit expected for the same planet during 2018 today some studies of transits which are connected to hypothetical extraterrestrial civilisations are published in astronomical refereed journals some studies which would be classified not long ago as science fiction are now considered as scientific ones
|
[['nowadays', 'the', 'more', 'powerful', 'method', 'to', 'detect', 'extrasolar', 'planets', 'is', 'the', 'transit', 'method', 'we', 'review', 'the', 'planet', 'transits', 'which', 'were', 'anticipated', 'searched', 'and', 'the', 'first', 'ones', 'which', 'were', 'observed', 'all', 'through', 'history', 'indeed', 'transits', 'of', 'planets', 'in', 'front', 'of', 'their', 'star', 'were', 'first', 'investigated', 'and', 'studied', 'in', 'the', 'solar', 'system', 'the', 'first', 'observations', 'of', 'sunspots', 'were', 'sometimes', 'mistaken', 'for', 'transits', 'of', 'unknown', 'planets', 'the', 'first', 'scientific', 'observation', 'and', 'study', 'of', 'a', 'transit', 'in', 'the', 'solar', 'system', 'was', 'the', 'observation', 'of', 'mercury', 'transit', 'by', 'pierre', 'gassendi', 'in', '1631', 'because', 'observations', 'of', 'venus', 'transits', 'could', 'give', 'a', 'way', 'to', 'determine', 'the', 'distance', 'sunearth', 'transits', 'of', 'venus', 'were', 'overwhelmingly', 'observed', 'some', 'objects', 'which', 'actually', 'do', 'not', 'exist', 'were', 'searched', 'by', 'their', 'hypothetical', 'transits', 'on', 'the', 'sun', 'as', 'some', 'examples', 'a', 'venus', 'satellite', 'and', 'an', 'inframercurial', 'planet', 'we', 'evoke', 'the', 'possibly', 'first', 'use', 'of', 'the', 'hypothesis', 'of', 'an', 'exoplanet', 'transit', 'to', 'explain', 'some', 'periodic', 'variations', 'of', 'the', 'luminosity', 'of', 'a', 'star', 'namely', 'the', 'star', 'algol', 'during', 'the', 'eighteen', 'century', 'then', 'we', 'review', 'the', 'predictions', 'of', 'detection', 'of', 'exoplanets', 'by', 'their', 'transits', 'those', 'predictions', 'being', 'sometimes', 'ancient', 'and', 'made', 'by', 'astronomers', 'as', 'well', 'as', 'popular', 'science', 'writers', 'however', 'these', 'very', 'interesting', 'predictions', 'were', 'never', 'published', 'in', 'peerreviewed', 'journals', 'specialized', 'in', 'astronomical', 'discoveries', 'and', 'results', 'a', 'possible', 'transit', 'of', 'the', 'planet', 'beta', 'pic', 'b', 'was', 'observed', 'in', '1981', 'shall', 'we', 'see', 'another', 'transit', 'expected', 'for', 'the', 'same', 'planet', 'during', '2018', 'today', 'some', 'studies', 'of', 'transits', 'which', 'are', 'connected', 'to', 'hypothetical', 'extraterrestrial', 'civilisations', 'are', 'published', 'in', 'astronomical', 'refereed', 'journals', 'some', 'studies', 'which', 'would', 'be', 'classified', 'not', 'long', 'ago', 'as', 'science', 'fiction', 'are', 'now', 'considered', 'as', 'scientific', 'ones']]
|
[-0.08687544842417262, 0.14892319817274297, -0.08490823164780678, 0.10656315646070266, -0.14622257538070577, -0.09753099027986475, 0.052227785020588884, 0.3596515941561709, -0.16392912911632027, -0.39135171814049596, 0.14550264200955615, -0.3201245219123439, -0.16333210800140818, 0.2339439051520931, -0.10941971990636457, 0.05614813075999844, 0.14545651579398633, -0.0029010520815212267, 0.006206626925300668, -0.35074045151458244, 0.20249572676973465, 0.07242319142605182, 0.051281520809465846, -0.02902187595704785, -0.0006094854463542704, -0.06706066996717763, -0.12156449749630437, -0.05539041237393221, -0.18234980078245303, 0.05226931367658051, 0.27551704506324015, 0.1963334422477185, 0.21906032627725414, -0.4067850004393455, -0.2185420591962354, 0.050419891789749434, 0.12596677145384058, 0.04688779995551672, -0.029804782716734386, -0.3300749950464053, 0.05098458647132474, -0.16951732115203785, -0.15187783073287692, 0.004988544111635162, 0.10837615225256375, 0.018529995074963064, -0.1876324972286682, 0.015384149323494543, 0.03309327844905989, 0.1653178396596241, -0.11806359098961085, -0.14732230501335986, -0.024486704943286166, 0.14337517833683405, 0.08476094874513568, -0.0008241280620799965, 0.11460350818073439, -0.07644735308637544, -0.11547134272047911, 0.4213854514744451, -0.08890812752697694, 0.0013061980353356738, 0.21921749725116876, -0.2185916795255097, -0.15511693730327167, 0.11985832861223047, 0.15827905961622218, 0.12073736762641808, -0.21285326652930786, -0.0264973018753782, -0.046111739676819634, 0.1366371093382782, 0.1294451933302207, 0.005741394811948643, 0.3580785645552838, 0.10664112932138754, 0.028315827114590648, 0.04449813710967058, -0.19811940666540875, -0.05544867798608994, -0.19494927842100757, -0.16375759032989426, -0.166281602570015, 0.028374507487600075, 0.017028708919622246, -0.12444889926365456, 0.36916577157505603, 0.14554889045299124, 0.1476281771711576, -0.019582842157281188, 0.29103185684804467, 0.0283300102758481, 0.09671467010048218, 0.05458512947787306, 0.3506486460924206, 0.08572155179379709, 0.1549603709653297, -0.1351061835943472, 0.14783782406007268, -0.006254646051190378]
|
1,803.06897
|
Generic features of the neutron-proton interaction
|
We show that fully aligned neutron-proton pairs play a crucial role in the
low-energy spectroscopy of nuclei. with valence nucleons in a high-j orbital.
Their dominance is valid in nuclei with valence neutrons and protons in
different high-j orbitals as well as in N = Z nuclei, where all nucleons occupy
the same orbital. We demonstrate analytically this generic feature of the
neutron-proton interaction for a variety of systems with four valence nucleons
interacting through realistic, effective forces. The dominance of fully aligned
neutron-proton pairs results from the combined effect of (i) angular momentum
coupling and (ii) basic properties of the neutron-proton interaction.
|
nucl-th
|
we show that fully aligned neutronproton pairs play a crucial role in the lowenergy spectroscopy of nuclei with valence nucleons in a highj orbital their dominance is valid in nuclei with valence neutrons and protons in different highj orbitals as well as in n z nuclei where all nucleons occupy the same orbital we demonstrate analytically this generic feature of the neutronproton interaction for a variety of systems with four valence nucleons interacting through realistic effective forces the dominance of fully aligned neutronproton pairs results from the combined effect of i angular momentum coupling and ii basic properties of the neutronproton interaction
|
[['we', 'show', 'that', 'fully', 'aligned', 'neutronproton', 'pairs', 'play', 'a', 'crucial', 'role', 'in', 'the', 'lowenergy', 'spectroscopy', 'of', 'nuclei', 'with', 'valence', 'nucleons', 'in', 'a', 'highj', 'orbital', 'their', 'dominance', 'is', 'valid', 'in', 'nuclei', 'with', 'valence', 'neutrons', 'and', 'protons', 'in', 'different', 'highj', 'orbitals', 'as', 'well', 'as', 'in', 'n', 'z', 'nuclei', 'where', 'all', 'nucleons', 'occupy', 'the', 'same', 'orbital', 'we', 'demonstrate', 'analytically', 'this', 'generic', 'feature', 'of', 'the', 'neutronproton', 'interaction', 'for', 'a', 'variety', 'of', 'systems', 'with', 'four', 'valence', 'nucleons', 'interacting', 'through', 'realistic', 'effective', 'forces', 'the', 'dominance', 'of', 'fully', 'aligned', 'neutronproton', 'pairs', 'results', 'from', 'the', 'combined', 'effect', 'of', 'i', 'angular', 'momentum', 'coupling', 'and', 'ii', 'basic', 'properties', 'of', 'the', 'neutronproton', 'interaction']]
|
[-0.11643525910582028, 0.2554964226095335, -0.04166602948452255, 0.13441350354867823, 0.01362254245060624, -0.09427652687436956, 0.030738028843759323, 0.38628311949215977, -0.2043284098343814, -0.27748375757615645, -0.15914595079284125, -0.3330372317052702, -0.013684597361705029, 0.08746628485181752, 0.12158002922603604, -0.040996198852856956, 0.059308663339299315, -0.02026719879359007, -0.07310664014406867, -0.17347659132279017, 0.38526924873026563, 0.039649941657176786, 0.23880585595307982, 0.11518519130243245, 0.059061019489651215, 0.09848014559304598, 0.034572022921387474, -0.03274261529612191, -0.016599354994219075, 0.08760454093434793, 0.28561294394860265, -0.003013586333277179, 0.1634713665070925, -0.42735376722161095, -0.1253439792358846, 0.06354674399720833, 0.21218089758436762, 0.13387233983153504, -0.06916210190256071, -0.2615242730552221, -0.02795586031039848, -0.24269232591248902, -0.17362198349106692, -0.11174997752167139, 0.042086787220528894, 0.11822236509418443, -0.2632231756402225, 0.08511761630806551, 0.038290438252528584, 0.0678500407831926, -0.12050028809108863, -0.20423973562634168, -0.08760082116578798, 0.09544898028138514, 0.11124268938756894, 0.04803541376638938, 0.12221917243532873, -0.13505518460856275, -0.08237968185259138, 0.4458378686149623, -0.0069364519954166, -0.17298904042143157, 0.16858365403616107, -0.15772117647529563, -0.13596350538964366, 0.17100851171348683, 0.19000425926574013, 0.14671231233332233, -0.12059960891857889, 0.05368303125564411, -0.06169805494958863, 0.18633282518553018, 0.012776733284779624, 0.09612473778371863, 0.255035329039446, 0.17662146305847987, -0.024499098578577534, 0.044582703290050665, -0.15259060523856213, -0.12261310433877595, -0.2893804956008406, -0.09753323471465823, -0.15173730421377638, 0.03414551785481665, -0.05950110139497602, -0.07454533750355682, 0.3356975766957975, 0.04738372586685799, 0.24834799596026322, -0.046598367927157706, 0.2767679899310072, 0.014584833452496313, 0.06496043538665582, 0.07402842304231051, 0.3358904572897682, 0.17955863341579542, 0.042573763929563115, -0.31246164066068755, 0.021364815907516314, 0.05566562755334684]
|
1,803.06898
|
A Mixture of Views Network with Applications to the Classification of
Breast Microcalcifications
|
In this paper we examine data fusion methods for multi-view data
classification. We present a decision concept which explicitly takes into
account the input multi-view structure, where for each case there is a
different subset of relevant views. This data fusion concept, which we dub
Mixture of Views, is implemented by a special purpose neural network
architecture. It is demonstrated on the task of classifying breast
microcalcifications as benign or malignant based on CC and MLO mammography
views. The single view decisions are combined by a data-driven decision,
according to the relevance of each view in a given case, into a global
decision. The method is evaluated on a large multi-view dataset extracted from
the standardized digital database for screening mammography (DDSM). The
experimental results show that our method outperforms previously suggested
fusion methods.
|
cs.CV cs.LG stat.ML
|
in this paper we examine data fusion methods for multiview data classification we present a decision concept which explicitly takes into account the input multiview structure where for each case there is a different subset of relevant views this data fusion concept which we dub mixture of views is implemented by a special purpose neural network architecture it is demonstrated on the task of classifying breast microcalcifications as benign or malignant based on cc and mlo mammography views the single view decisions are combined by a datadriven decision according to the relevance of each view in a given case into a global decision the method is evaluated on a large multiview dataset extracted from the standardized digital database for screening mammography ddsm the experimental results show that our method outperforms previously suggested fusion methods
|
[['in', 'this', 'paper', 'we', 'examine', 'data', 'fusion', 'methods', 'for', 'multiview', 'data', 'classification', 'we', 'present', 'a', 'decision', 'concept', 'which', 'explicitly', 'takes', 'into', 'account', 'the', 'input', 'multiview', 'structure', 'where', 'for', 'each', 'case', 'there', 'is', 'a', 'different', 'subset', 'of', 'relevant', 'views', 'this', 'data', 'fusion', 'concept', 'which', 'we', 'dub', 'mixture', 'of', 'views', 'is', 'implemented', 'by', 'a', 'special', 'purpose', 'neural', 'network', 'architecture', 'it', 'is', 'demonstrated', 'on', 'the', 'task', 'of', 'classifying', 'breast', 'microcalcifications', 'as', 'benign', 'or', 'malignant', 'based', 'on', 'cc', 'and', 'mlo', 'mammography', 'views', 'the', 'single', 'view', 'decisions', 'are', 'combined', 'by', 'a', 'datadriven', 'decision', 'according', 'to', 'the', 'relevance', 'of', 'each', 'view', 'in', 'a', 'given', 'case', 'into', 'a', 'global', 'decision', 'the', 'method', 'is', 'evaluated', 'on', 'a', 'large', 'multiview', 'dataset', 'extracted', 'from', 'the', 'standardized', 'digital', 'database', 'for', 'screening', 'mammography', 'ddsm', 'the', 'experimental', 'results', 'show', 'that', 'our', 'method', 'outperforms', 'previously', 'suggested', 'fusion', 'methods']]
|
[-0.032276435748243064, -0.023380245829223475, -0.07829975540256266, 0.06238249522015286, -0.08340839795253949, -0.15452200365113788, 0.06008352538650689, 0.39435109977068294, -0.2257178417726684, -0.25990688471547535, 0.08817530863174695, -0.2578370011595787, -0.18901922536576027, 0.20885050699371957, -0.13411198226290186, 0.0391627723992274, 0.13050285114475818, 0.0757008108498056, -0.03162857016254001, -0.27997751271095017, 0.34403462125224743, 0.008600276637711186, 0.3983248015935185, 0.0034333005297317435, 0.14849161227327534, 0.06424765182926612, -0.07978118751319681, 0.04344503459238939, -0.06359308919159795, 0.13405443240502682, 0.3147590409672416, 0.23925530158831224, 0.31482762276757953, -0.36545286462433746, -0.20619233902682788, 0.07568101772565895, 0.12041754036127075, 0.10675674922062334, -0.05253125018867622, -0.34842015351794325, 0.10563886557608398, -0.17282109593611156, 0.01962027899615133, -0.10576558092073884, -0.028022739028474734, -0.05849791241031307, -0.3218261447249488, 0.016417485479362753, 0.03065975595599235, 0.07075771196300525, -0.10856906412544647, -0.1381367861654665, 0.014748137334792582, 0.15249843299284632, 0.014152569136818621, 0.045015769828208235, 0.1534822508857808, -0.14828023030561632, -0.14799419896930818, 0.3895082333535234, 0.0030480390136588867, -0.1970775383038085, 0.16660298020822176, -0.018886419068743932, -0.1687900422057554, 0.11465147684359533, 0.21002433134046117, 0.12162101679175759, -0.20313372135678404, 0.016793156735539966, -0.09102521979583622, 0.16047299334973986, 0.022692030640197362, -0.0623527756204078, 0.1922736743381664, 0.2866277080585263, -0.02908352107754839, 0.1600078304051491, -0.16239365193612332, -0.046215819577172176, -0.26144886865461275, -0.10684786792045264, -0.18556030744464316, -0.035425781425255445, -0.07875698295744647, -0.14764109662553268, 0.38330958600142107, 0.2100167915801893, 0.2103248551764192, 0.05139877292181629, 0.3726666922639333, 0.017214408540514422, 0.13063365117639802, 0.03090052720838671, 0.14777996102625976, 0.006367447633129447, 0.09449204948466661, -0.14187536257798714, 0.09207524577461516, 0.09230580718826446]
|
1,803.06899
|
Limit Theorems for Cylindrical Martingale Problems associated with
L\'evy Generators
|
We prove limit theorems for cylindrical martingale problems associated to
L\'evy generators. Furthermore, we give sufficient and necessary conditions for
the Feller property of well-posed problems with continuous coefficients. We
discuss two applications. First, we derive continuity and linear growth
conditions for the existence of weak solutions to infinite-dimensional
stochastic differential equations driven by L\'evy noise. Second, we derive
continuity, local boundedness and linear growth conditions for limit theorems
and the Feller property of weak solutions to stochastic partial differential
equations driven by Wiener noise.
|
math.PR
|
we prove limit theorems for cylindrical martingale problems associated to levy generators furthermore we give sufficient and necessary conditions for the feller property of wellposed problems with continuous coefficients we discuss two applications first we derive continuity and linear growth conditions for the existence of weak solutions to infinitedimensional stochastic differential equations driven by levy noise second we derive continuity local boundedness and linear growth conditions for limit theorems and the feller property of weak solutions to stochastic partial differential equations driven by wiener noise
|
[['we', 'prove', 'limit', 'theorems', 'for', 'cylindrical', 'martingale', 'problems', 'associated', 'to', 'levy', 'generators', 'furthermore', 'we', 'give', 'sufficient', 'and', 'necessary', 'conditions', 'for', 'the', 'feller', 'property', 'of', 'wellposed', 'problems', 'with', 'continuous', 'coefficients', 'we', 'discuss', 'two', 'applications', 'first', 'we', 'derive', 'continuity', 'and', 'linear', 'growth', 'conditions', 'for', 'the', 'existence', 'of', 'weak', 'solutions', 'to', 'infinitedimensional', 'stochastic', 'differential', 'equations', 'driven', 'by', 'levy', 'noise', 'second', 'we', 'derive', 'continuity', 'local', 'boundedness', 'and', 'linear', 'growth', 'conditions', 'for', 'limit', 'theorems', 'and', 'the', 'feller', 'property', 'of', 'weak', 'solutions', 'to', 'stochastic', 'partial', 'differential', 'equations', 'driven', 'by', 'wiener', 'noise']]
|
[-0.12522090546348516, 0.06342276070157395, -0.05138979759889052, 0.1353974191362367, -0.1259975554229801, -0.13284427600310128, -0.02053463634048753, 0.32402407316600573, -0.3615553608218975, -0.1413353124523864, 0.20481817769982358, -0.22464877181850812, -0.13528018350548604, 0.21354146839722116, -0.12240800058797878, 0.1614777440643486, 0.037359243883367844, -0.06535323352059898, -0.09016884007655522, -0.24878767654299735, 0.3872778084293446, -0.061975713337168975, 0.2313572306514663, 0.015785446850692525, 0.24567183431251632, -0.014027558814953356, -0.05475404176806264, -0.008691233549924458, -0.2755824800799875, 0.04789257003542255, 0.2406187000191387, 0.032368876848041135, 0.3184862839660662, -0.4690173089504242, -0.13741783311809688, 0.17672385558047715, 0.04463852674029219, 0.054642333824406655, -0.0701939644456348, -0.33209551419405375, 0.1264698316836182, -0.06407391623977353, -0.23764675722512252, -0.12380625691593569, 0.03191640159279546, 0.13576435428797543, -0.40024819664437983, 0.14524866778622655, 0.19859798399402814, 0.03679205148946494, -0.13185966268510502, -0.02961223657407305, -0.03487290800275172, 0.036885425492244606, 0.044628393929451705, -0.14928209013031685, 0.08588302152450471, -0.09252813647994224, -0.13134971580139415, 0.2704059221836574, -0.16152865220518672, -0.2965983790318098, 0.18110748221823836, -0.1602853513267987, -0.20435758284019195, 0.12193883080035448, 0.15880487704759136, 0.10465387502575622, -0.24796124887378776, 0.1742099554853185, 0.01798448827227249, 0.08097273172701107, 0.12405279079342589, 0.08494526685818153, 0.02659942920812789, 0.0884380051647039, 0.24136095534023994, 0.16991374211057145, 0.03678187545977862, -0.13943411481073675, -0.3837064864661764, -0.13705594319411937, -0.07920916468891151, 0.13718515277347143, -0.15981047853437141, -0.2093225152067402, 0.2759440127075376, 0.15573284592041198, 0.09948425312690876, 0.1300383007263436, 0.1687270586762358, 0.29307257196359227, -0.11562117569367675, 0.059754477989147695, 0.16280800474478918, 0.29178492160075725, 0.17332937493920325, -0.1696514980569619, 0.0716280793880715, 0.2139731007409008]
|
1,803.069
|
Analytical Impedance Models for Very Short Bunches
|
We discuss several analytical models for impedances of very short bunches.
The approximate analytical models are compared with direct solution of Maxwells
equations.
|
physics.acc-ph
|
we discuss several analytical models for impedances of very short bunches the approximate analytical models are compared with direct solution of maxwells equations
|
[['we', 'discuss', 'several', 'analytical', 'models', 'for', 'impedances', 'of', 'very', 'short', 'bunches', 'the', 'approximate', 'analytical', 'models', 'are', 'compared', 'with', 'direct', 'solution', 'of', 'maxwells', 'equations']]
|
[-0.17422527495933615, -0.0012189537570204425, -0.07585389090135046, 0.13742607042355381, -0.08929388751478298, -0.1970934302586576, -0.04350224817576616, 0.43941482059333636, -0.17740868679855182, -0.29753853089135623, 0.09785006630598851, -0.29240097101453855, -0.08157574340863072, 0.3053301527448323, 0.04211424679859825, 0.13385174508489991, 0.12190991449777198, -0.03460505216018013, -0.13150849148793065, -0.1303051524269192, 0.2249561924001445, 0.04797005556199862, 0.2366046528129474, 0.022709676267012306, 0.16066699037733284, -0.11968056094306319, -0.045209776043244033, 0.004146910839430664, -0.15472712537840658, 0.11230184362553385, 0.2677352334636532, 0.052474302523162056, 0.1902632828315963, -0.5932852263035981, -0.22970214672386646, -0.0009039636782330016, 0.15459821245673558, 0.24104066808586536, -0.10059155475186266, -0.25012331666505855, 0.08265399179704812, -0.21322515335581874, -0.16329392823188202, -0.10191409986304201, 0.00025068668891554296, 0.1965759670280892, -0.26736124151426816, 0.09543734894174596, -0.005877174720492052, -0.010102563497164974, -0.16753936613626455, -0.1428049328210561, 0.08848622068762779, 0.054469629555292755, 0.11118880075240589, -0.08340920437046367, 0.004835892569921587, -0.17446478885477004, -0.12370871242297732, 0.3610742957047794, -0.06167261051418989, -0.2943851569991397, 0.19053642840489096, -0.08407468105787816, -0.005246696609031895, 0.15694349437304164, 0.14927207832427128, 0.15808901067256279, -0.18150793048350708, 0.07073382806518803, -0.04399674685428972, 0.1336719384012015, 0.09366305923575292, -0.02201157711122347, 0.19849200481953827, 0.18596233346539995, -0.01977786338766632, 0.11464772405831711, 0.005391344185108724, -0.13042660231661538, -0.3572558848106343, -0.08909280958544949, -0.1182027397191395, 0.051002243938653366, -0.1501727839261192, -0.15823675659687622, 0.3988803928798955, 0.2355952286566405, 0.12975616971759693, 0.1779019798192641, 0.36274527175270993, 0.20251666268576746, -0.03488553631240907, 0.0509538316451337, 0.24568624154705068, 0.18190591651743845, 0.11255695359052523, -0.17746993672588599, -0.003691714945370736, 0.08063838776686917]
|
1,803.06901
|
Cyclic Sieving and Cluster Duality of Grassmannian
|
We introduce a decorated configuration space $\mathscr{C}\!{\rm
onf}_n^\times(a)$ with a potential function $\mathcal{W}$. We prove the cluster
duality conjecture of Fock-Goncharov for Grassmannians, that is, the
tropicalization of $\big(\mathscr{C}\!{\rm onf}_n^\times(a), \mathcal{W}\big)$
canonically parametrizes a linear basis of the homogeneous coordinate ring of
the Grassmannian $\operatorname{Gr}_a(n)$ with respect to the Pl\"ucker
embedding. We prove that $\big(\mathscr{C}\!{\rm onf}_n^\times(a),
\mathcal{W}\big)$ is equivalent to the mirror Landau-Ginzburg model of the
Grassmannian considered by Eguchi-Hori-Xiong, Marsh-Rietsch and
Rietsch-Williams. As an application, we show a cyclic sieving phenomenon
involving plane partitions under a sequence of piecewise-linear toggles.
|
math.RT math-ph math.AG math.CO math.MP
|
we introduce a decorated configuration space mathscrcrm onf_ntimesa with a potential function mathcalw we prove the cluster duality conjecture of fockgoncharov for grassmannians that is the tropicalization of bigmathscrcrm onf_ntimesa mathcalwbig canonically parametrizes a linear basis of the homogeneous coordinate ring of the grassmannian operatornamegr_an with respect to the plucker embedding we prove that bigmathscrcrm onf_ntimesa mathcalwbig is equivalent to the mirror landauginzburg model of the grassmannian considered by eguchihorixiong marshrietsch and rietschwilliams as an application we show a cyclic sieving phenomenon involving plane partitions under a sequence of piecewiselinear toggles
|
[['we', 'introduce', 'a', 'decorated', 'configuration', 'space', 'mathscrcrm', 'onf_ntimesa', 'with', 'a', 'potential', 'function', 'mathcalw', 'we', 'prove', 'the', 'cluster', 'duality', 'conjecture', 'of', 'fockgoncharov', 'for', 'grassmannians', 'that', 'is', 'the', 'tropicalization', 'of', 'bigmathscrcrm', 'onf_ntimesa', 'mathcalwbig', 'canonically', 'parametrizes', 'a', 'linear', 'basis', 'of', 'the', 'homogeneous', 'coordinate', 'ring', 'of', 'the', 'grassmannian', 'operatornamegr_an', 'with', 'respect', 'to', 'the', 'plucker', 'embedding', 'we', 'prove', 'that', 'bigmathscrcrm', 'onf_ntimesa', 'mathcalwbig', 'is', 'equivalent', 'to', 'the', 'mirror', 'landauginzburg', 'model', 'of', 'the', 'grassmannian', 'considered', 'by', 'eguchihorixiong', 'marshrietsch', 'and', 'rietschwilliams', 'as', 'an', 'application', 'we', 'show', 'a', 'cyclic', 'sieving', 'phenomenon', 'involving', 'plane', 'partitions', 'under', 'a', 'sequence', 'of', 'piecewiselinear', 'toggles']]
|
[-0.18122069134253516, 0.05371142336583264, -0.10731306642361255, 0.04128198652999498, -0.08048777391079319, -0.12691275079184808, -0.02544766748239881, 0.34239434486771203, -0.3568048115247434, -0.14029143065430158, 0.032819083356017985, -0.18979454253651537, -0.22275607245244894, 0.14538094679353736, -0.149279065946319, -0.013133580733303833, 0.027004381108759756, 0.04170683183965374, -0.11240552573924861, -0.28374836000148207, 0.39657906464200066, -0.014805640426046407, 0.22938561415950576, -0.010125716515264126, 0.1710902279108224, 0.05930746162691748, 0.039127839628203084, 0.02033096987786366, -0.13410104563861597, 0.1470938944201692, 0.23861361952520996, 0.12665973999818048, 0.14970128973160524, -0.36325942253671495, -0.13111756008443792, 0.18162424928587245, 0.1369727807644059, 0.06862564887346542, -0.019515589204987128, -0.23859612041725273, 0.06392118557502167, -0.14914661024680295, -0.21588474158365953, -0.04977224541670946, 0.029865030872534556, 0.06180805738973964, -0.28273476548464854, -0.03666825732777277, 0.09851578436791897, 0.09953706814761622, -0.06320766162082374, -0.07433844537261021, -0.07509303866066487, 0.01185519341379404, -0.043305083319645776, 0.0995841381611325, 0.0766593210892864, -0.06642336319186669, -0.12094190909179399, 0.39049497839198055, -0.0665560379464471, -0.25638365296766874, 0.06350368158106344, -0.10238357324781547, -0.1449032508661544, 0.09858407118324056, 0.06887356682781534, 0.13661206106329898, -0.031182770796838295, 0.1679100582750615, -0.16487211836165333, 0.08450707402753543, 0.12446869828973908, -0.01811984906825854, 0.16671743096099292, 0.10528525542355625, 0.09805509112024938, 0.23554752461881523, -0.04185384036187666, -0.11213328405451703, -0.3566537429410291, -0.211127334756844, -0.10770879950267767, 0.11604981659631054, -0.13171902640020694, -0.20365022337737393, 0.35811995561739585, 0.03055808998094535, 0.24056449669402047, 0.113710737860122, 0.20720675843487302, 0.07220118770976158, 0.05459743657104491, -0.00531094326604023, 0.13733420504189758, 0.22422291185280466, -0.046532550338565945, -0.1835259499830609, -0.031242239420829588, 0.23053692294430572]
|
1,803.06902
|
Filters for anisotropic wavelet decompositions
|
Like the continous shearlet transform and their relatives, discrete
transformations based on the interplay between several filterbanks with
anisotropic dilations provide a high potential to recover directed features in
two and more dimensions. Due to simplicity, most of the directional systems
constructed so far were using prediction--correction methods based on
interpolatory subdivision schemes. In this paper, we give a simple but
effective construction for QMF (quadrature mirror filter) filterbanks which are
the discrete object between orthogonal wavelet analysis. We also characterize
when the filterbank gives rise to the existence of refinable functions and
hence wavelets and give a generalized shearlet construction for arbitrary
dimensions and arbitrary scalings for which the filterbank construction ensures
the existence of an orthogonal wavelet analysis.
|
math.NA
|
like the continous shearlet transform and their relatives discrete transformations based on the interplay between several filterbanks with anisotropic dilations provide a high potential to recover directed features in two and more dimensions due to simplicity most of the directional systems constructed so far were using predictioncorrection methods based on interpolatory subdivision schemes in this paper we give a simple but effective construction for qmf quadrature mirror filter filterbanks which are the discrete object between orthogonal wavelet analysis we also characterize when the filterbank gives rise to the existence of refinable functions and hence wavelets and give a generalized shearlet construction for arbitrary dimensions and arbitrary scalings for which the filterbank construction ensures the existence of an orthogonal wavelet analysis
|
[['like', 'the', 'continous', 'shearlet', 'transform', 'and', 'their', 'relatives', 'discrete', 'transformations', 'based', 'on', 'the', 'interplay', 'between', 'several', 'filterbanks', 'with', 'anisotropic', 'dilations', 'provide', 'a', 'high', 'potential', 'to', 'recover', 'directed', 'features', 'in', 'two', 'and', 'more', 'dimensions', 'due', 'to', 'simplicity', 'most', 'of', 'the', 'directional', 'systems', 'constructed', 'so', 'far', 'were', 'using', 'predictioncorrection', 'methods', 'based', 'on', 'interpolatory', 'subdivision', 'schemes', 'in', 'this', 'paper', 'we', 'give', 'a', 'simple', 'but', 'effective', 'construction', 'for', 'qmf', 'quadrature', 'mirror', 'filter', 'filterbanks', 'which', 'are', 'the', 'discrete', 'object', 'between', 'orthogonal', 'wavelet', 'analysis', 'we', 'also', 'characterize', 'when', 'the', 'filterbank', 'gives', 'rise', 'to', 'the', 'existence', 'of', 'refinable', 'functions', 'and', 'hence', 'wavelets', 'and', 'give', 'a', 'generalized', 'shearlet', 'construction', 'for', 'arbitrary', 'dimensions', 'and', 'arbitrary', 'scalings', 'for', 'which', 'the', 'filterbank', 'construction', 'ensures', 'the', 'existence', 'of', 'an', 'orthogonal', 'wavelet', 'analysis']]
|
[-0.08247335267660674, 0.07201960476922978, -0.14845920856265973, 0.07238610734348186, -0.12584732283527653, -0.16853912719913447, -0.003844219010594922, 0.41759869108597436, -0.25478349534193206, -0.22084021978080273, 0.15200803409679792, -0.2048958083735973, -0.23435667802890142, 0.20819095080951228, -0.07634128186230858, 0.06822617880243342, 0.01605601074018826, -0.0010493979418242816, -0.13688203275669367, -0.2175475450969922, 0.2932722796996435, 0.04865210143907461, 0.3169427739844347, -0.0225504563190043, 0.13974458735901862, 0.05032849539226542, -0.1026608018631426, -0.05720275186661941, -0.10536621457819516, 0.16662199318719406, 0.2505397490671991, 0.08757260412288209, 0.2158342141813288, -0.39562896080315113, -0.18439969321213237, 0.1137049665596957, 0.12900478507314497, 0.08248624231782742, -0.05783804088193089, -0.30784016554243865, 0.07975903928745538, -0.13068793062120676, -0.10993904392234981, -0.14961717682114492, -0.00703260621909673, 0.08062716542820757, -0.3090248789715891, 0.036846521058760115, 0.11795739989417295, 0.07062876345977807, -0.06322308616557469, -0.09548742302382986, 0.015195055193422983, 0.06849632372929287, -0.022048366135762384, -0.01852674757828936, 0.02888117474115764, -0.03230839536602919, -0.12158565789674564, 0.37376436464643725, -0.014006302137083064, -0.31450940076028927, 0.2146346984062499, -0.09688403817126527, -0.13838990691583603, 0.12330377635468419, 0.19121442803492147, 0.0869028518112221, -0.11960281332976593, 0.06917781737235297, -0.027678040616835157, 0.1256204432575032, 0.12600536656100303, 0.11100264593648414, 0.11040332207145791, 0.07206438333378173, 0.12406049057996521, 0.17695676886554187, -0.07875766660436057, -0.07966206234317118, -0.2969013197037081, -0.09895151969467406, -0.20195080150927727, -0.02677047808926242, -0.1243264623523525, -0.22373269229428844, 0.43248221799731257, 0.11338706987444311, 0.18851837158047904, 0.11618461646915725, 0.27941942429170014, 0.12012566813888649, 0.06124095759587363, 0.05861259331771483, 0.16147576784715056, 0.16078110833768733, 0.04546644953079522, -0.15733743613479115, -0.033309970245075725, 0.17423136858269572]
|
1,803.06903
|
On class groups of random number fields
|
The main aim of the present paper is to disprove the Cohen--Lenstra--Martinet
heuristics in two different ways and to offer possible corrections. We also
recast the heuristics in terms of Arakelov class groups, giving an explanation
for the probability weights appearing in the general form of the heuristics. We
conclude by proposing a rigorously formulated Cohen--Lenstra--Martinet
conjecture.
|
math.NT
|
the main aim of the present paper is to disprove the cohenlenstramartinet heuristics in two different ways and to offer possible corrections we also recast the heuristics in terms of arakelov class groups giving an explanation for the probability weights appearing in the general form of the heuristics we conclude by proposing a rigorously formulated cohenlenstramartinet conjecture
|
[['the', 'main', 'aim', 'of', 'the', 'present', 'paper', 'is', 'to', 'disprove', 'the', 'cohenlenstramartinet', 'heuristics', 'in', 'two', 'different', 'ways', 'and', 'to', 'offer', 'possible', 'corrections', 'we', 'also', 'recast', 'the', 'heuristics', 'in', 'terms', 'of', 'arakelov', 'class', 'groups', 'giving', 'an', 'explanation', 'for', 'the', 'probability', 'weights', 'appearing', 'in', 'the', 'general', 'form', 'of', 'the', 'heuristics', 'we', 'conclude', 'by', 'proposing', 'a', 'rigorously', 'formulated', 'cohenlenstramartinet', 'conjecture']]
|
[-0.12715969085407428, 0.023304831263407034, -0.10435673953932628, 0.13052494645224916, -0.0799719821008151, -0.0975639362198611, 0.07710149180626072, 0.32155637831933664, -0.2554551693855932, -0.3234391439738765, 0.025246895292136622, -0.1822352874247978, -0.2135499647671455, 0.15096930525543398, -0.1395949105519736, 0.0269351610576881, -0.006777460870676134, -0.007187223061919212, -0.0484810832473286, -0.3182841141691856, 0.3703435064669241, 0.032709116532810424, 0.2117624516974677, 0.10864263661859329, 0.04553240022097159, -0.007988377980757178, -0.05542144437500259, 0.019759465335753925, -0.18891050344692512, 0.1818715843306691, 0.28504885046889905, 0.15346645367772957, 0.28494311903660563, -0.4267909929744507, -0.14062695097782762, 0.12424561216316202, 0.1404492882684919, 0.11582591763713904, -0.026752545996650792, -0.25075791544166576, 0.07718780026526044, -0.15870280687088603, -0.18948991548498734, -0.07910599121660516, -0.007061345486395192, -0.011717771098279116, -0.23912012576239935, 0.033816850004337824, 0.08824582052776557, 0.009613812819384691, -0.06745498528369098, -0.15034695855023242, 0.10399676723765176, 0.09629394846004352, 0.08971881853230707, 0.006109250484753335, 0.007523764662134151, -0.11421246434257594, -0.21380998187682085, 0.39393012826902823, -0.03176940436752742, -0.19166807467608074, 0.1679287745306889, -0.06752339305290789, -0.1748596429824829, 0.0560515271499753, 0.13156182055051127, 0.15712661390895383, -0.15403083862181297, 0.07925838936965815, -0.06739164426465306, 0.04794099959626533, 0.09308443316503574, 0.01050151964310524, 0.18208277972186343, 0.11134937919447557, 0.04982972563358776, 0.1857079652775275, -0.008031211826100684, -0.05308884826770641, -0.34580998914316297, -0.18794375733194643, -0.12163374985551886, 0.04304274382363809, -0.07606455677147064, -0.1269672466973006, 0.41759580981166083, 0.17929889595038012, 0.18350842372890105, 0.13771069085780988, 0.23892464706053337, 0.12733284901958286, 0.0248427889115798, 0.07648356387130263, 0.20924335294975, 0.1117702678883481, 0.03635807731801546, -0.163963397188733, 0.07864394644275308, 0.13758990091778206]
|
1,803.06904
|
Aerial LaneNet: Lane Marking Semantic Segmentation in Aerial Imagery
using Wavelet-Enhanced Cost-sensitive Symmetric Fully Convolutional Neural
Networks
|
The knowledge about the placement and appearance of lane markings is a
prerequisite for the creation of maps with high precision, necessary for
autonomous driving, infrastructure monitoring, lane-wise traffic management,
and urban planning. Lane markings are one of the important components of such
maps. Lane markings convey the rules of roads to drivers. While these rules are
learned by humans, an autonomous driving vehicle should be taught to learn them
to localize itself. Therefore, accurate and reliable lane marking semantic
segmentation in the imagery of roads and highways is needed to achieve such
goals. We use airborne imagery which can capture a large area in a short period
of time by introducing an aerial lane marking dataset. In this work, we propose
a Symmetric Fully Convolutional Neural Network enhanced by Wavelet Transform in
order to automatically carry out lane marking segmentation in aerial imagery.
Due to a heavily unbalanced problem in terms of number of lane marking pixels
compared with background pixels, we use a customized loss function as well as a
new type of data augmentation step. We achieve a very high accuracy in
pixel-wise localization of lane markings without using 3rd-party information.
In this work, we introduce the first high-quality dataset used within our
experiments which contains a broad range of situations and classes of lane
markings representative of current transportation systems. This dataset will be
publicly available and hence, it can be used as the benchmark dataset for
future algorithms within this domain.
|
cs.CV
|
the knowledge about the placement and appearance of lane markings is a prerequisite for the creation of maps with high precision necessary for autonomous driving infrastructure monitoring lanewise traffic management and urban planning lane markings are one of the important components of such maps lane markings convey the rules of roads to drivers while these rules are learned by humans an autonomous driving vehicle should be taught to learn them to localize itself therefore accurate and reliable lane marking semantic segmentation in the imagery of roads and highways is needed to achieve such goals we use airborne imagery which can capture a large area in a short period of time by introducing an aerial lane marking dataset in this work we propose a symmetric fully convolutional neural network enhanced by wavelet transform in order to automatically carry out lane marking segmentation in aerial imagery due to a heavily unbalanced problem in terms of number of lane marking pixels compared with background pixels we use a customized loss function as well as a new type of data augmentation step we achieve a very high accuracy in pixelwise localization of lane markings without using 3rdparty information in this work we introduce the first highquality dataset used within our experiments which contains a broad range of situations and classes of lane markings representative of current transportation systems this dataset will be publicly available and hence it can be used as the benchmark dataset for future algorithms within this domain
|
[['the', 'knowledge', 'about', 'the', 'placement', 'and', 'appearance', 'of', 'lane', 'markings', 'is', 'a', 'prerequisite', 'for', 'the', 'creation', 'of', 'maps', 'with', 'high', 'precision', 'necessary', 'for', 'autonomous', 'driving', 'infrastructure', 'monitoring', 'lanewise', 'traffic', 'management', 'and', 'urban', 'planning', 'lane', 'markings', 'are', 'one', 'of', 'the', 'important', 'components', 'of', 'such', 'maps', 'lane', 'markings', 'convey', 'the', 'rules', 'of', 'roads', 'to', 'drivers', 'while', 'these', 'rules', 'are', 'learned', 'by', 'humans', 'an', 'autonomous', 'driving', 'vehicle', 'should', 'be', 'taught', 'to', 'learn', 'them', 'to', 'localize', 'itself', 'therefore', 'accurate', 'and', 'reliable', 'lane', 'marking', 'semantic', 'segmentation', 'in', 'the', 'imagery', 'of', 'roads', 'and', 'highways', 'is', 'needed', 'to', 'achieve', 'such', 'goals', 'we', 'use', 'airborne', 'imagery', 'which', 'can', 'capture', 'a', 'large', 'area', 'in', 'a', 'short', 'period', 'of', 'time', 'by', 'introducing', 'an', 'aerial', 'lane', 'marking', 'dataset', 'in', 'this', 'work', 'we', 'propose', 'a', 'symmetric', 'fully', 'convolutional', 'neural', 'network', 'enhanced', 'by', 'wavelet', 'transform', 'in', 'order', 'to', 'automatically', 'carry', 'out', 'lane', 'marking', 'segmentation', 'in', 'aerial', 'imagery', 'due', 'to', 'a', 'heavily', 'unbalanced', 'problem', 'in', 'terms', 'of', 'number', 'of', 'lane', 'marking', 'pixels', 'compared', 'with', 'background', 'pixels', 'we', 'use', 'a', 'customized', 'loss', 'function', 'as', 'well', 'as', 'a', 'new', 'type', 'of', 'data', 'augmentation', 'step', 'we', 'achieve', 'a', 'very', 'high', 'accuracy', 'in', 'pixelwise', 'localization', 'of', 'lane', 'markings', 'without', 'using', '3rdparty', 'information', 'in', 'this', 'work', 'we', 'introduce', 'the', 'first', 'highquality', 'dataset', 'used', 'within', 'our', 'experiments', 'which', 'contains', 'a', 'broad', 'range', 'of', 'situations', 'and', 'classes', 'of', 'lane', 'markings', 'representative', 'of', 'current', 'transportation', 'systems', 'this', 'dataset', 'will', 'be', 'publicly', 'available', 'and', 'hence', 'it', 'can', 'be', 'used', 'as', 'the', 'benchmark', 'dataset', 'for', 'future', 'algorithms', 'within', 'this', 'domain']]
|
[-0.1029417571564186, 0.03200339734618438, -0.0766114377059276, 0.0427059407849625, -0.09996355068109626, -0.12505851372392202, 0.05151309210246391, 0.4515182100397972, -0.24470948249633823, -0.3584562780544618, 0.14099812857350524, -0.24046074475104712, -0.1386444106004296, 0.18504212627339425, -0.18213987246877988, 0.06964642566115577, 0.1009192817274253, 0.029344381775935086, 3.104580742097935e-05, -0.22674182391801506, 0.28028056184590167, 0.03156719803429988, 0.2883203008725327, 0.04598248072291668, 0.1250943565194742, -0.015860989997733613, -0.07094897695838435, -0.020093924119327294, -0.054779642547108945, 0.15949515695089703, 0.3614776828886979, 0.14580141347696368, 0.25351610654698953, -0.4377546115113156, -0.23030612178108825, 0.13383357330719578, 0.14503109070581707, 0.08865113273662116, -0.007724686779024802, -0.38515204439813994, 0.08080305446637795, -0.19432415164180328, -0.08460711876728705, -0.09064488828619371, 0.020736825387278685, 0.042809411185575005, -0.26035559791121254, 0.016461480278711842, 0.025650706890096166, 0.105186862683836, -0.049053802278501035, -0.02488766851815946, -0.014897320413847967, 0.24773235260223855, -0.01834323277212299, 0.059428044954048735, 0.1683109853473701, -0.23307530597049494, -0.11631945057258922, 0.4109110357192326, -0.04229541317992178, -0.17365404406315363, 0.185500855986219, -0.031490292924703386, -0.128355047072531, 0.14057651296524065, 0.21459697695943167, 0.13127743403180217, -0.163126653106408, -0.05853558313624211, -0.033543832873573945, 0.15918568393015967, 0.06979348049879226, -0.017325010935642888, 0.22706023557016589, 0.2504102528931535, 0.1423869297385622, 0.11631072851097478, -0.1771001630354606, -0.04832486557793252, -0.2663480385339686, -0.13854406917775383, -0.15975233340749936, -0.021612412824618572, -0.05904937723867728, -0.11245451870698682, 0.3867222326104434, 0.22600236085186504, 0.22246086959019112, 0.05746438983894352, 0.3658682881759442, 0.03146729783050488, 0.12291497717194534, 0.06651678345907404, 0.13471125377655713, -0.03784768867629523, 0.16005685735512906, -0.13713059962099913, 0.08943267676751224, 0.07326586038178327]
|
1,803.06905
|
TBD: Benchmarking and Analyzing Deep Neural Network Training
|
The recent popularity of deep neural networks (DNNs) has generated a lot of
research interest in performing DNN-related computation efficiently. However,
the primary focus is usually very narrow and limited to (i) inference -- i.e.
how to efficiently execute already trained models and (ii) image classification
networks as the primary benchmark for evaluation.
Our primary goal in this work is to break this myopic view by (i) proposing a
new benchmark for DNN training, called TBD (TBD is short for Training Benchmark
for DNNs), that uses a representative set of DNN models that cover a wide range
of machine learning applications: image classification, machine translation,
speech recognition, object detection, adversarial networks, reinforcement
learning, and (ii) by performing an extensive performance analysis of training
these different applications on three major deep learning frameworks
(TensorFlow, MXNet, CNTK) across different hardware configurations (single-GPU,
multi-GPU, and multi-machine). TBD currently covers six major application
domains and eight different state-of-the-art models.
We present a new toolchain for performance analysis for these models that
combines the targeted usage of existing performance analysis tools, careful
selection of new and existing metrics and methodologies to analyze the results,
and utilization of domain specific characteristics of DNN training. We also
build a new set of tools for memory profiling in all three major frameworks;
much needed tools that can finally shed some light on precisely how much memory
is consumed by different data structures (weights, activations, gradients,
workspace) in DNN training. By using our tools and methodologies, we make
several important observations and recommendations on where the future research
and optimization of DNN training should be focused.
|
cs.LG stat.ML
|
the recent popularity of deep neural networks dnns has generated a lot of research interest in performing dnnrelated computation efficiently however the primary focus is usually very narrow and limited to i inference ie how to efficiently execute already trained models and ii image classification networks as the primary benchmark for evaluation our primary goal in this work is to break this myopic view by i proposing a new benchmark for dnn training called tbd tbd is short for training benchmark for dnns that uses a representative set of dnn models that cover a wide range of machine learning applications image classification machine translation speech recognition object detection adversarial networks reinforcement learning and ii by performing an extensive performance analysis of training these different applications on three major deep learning frameworks tensorflow mxnet cntk across different hardware configurations singlegpu multigpu and multimachine tbd currently covers six major application domains and eight different stateoftheart models we present a new toolchain for performance analysis for these models that combines the targeted usage of existing performance analysis tools careful selection of new and existing metrics and methodologies to analyze the results and utilization of domain specific characteristics of dnn training we also build a new set of tools for memory profiling in all three major frameworks much needed tools that can finally shed some light on precisely how much memory is consumed by different data structures weights activations gradients workspace in dnn training by using our tools and methodologies we make several important observations and recommendations on where the future research and optimization of dnn training should be focused
|
[['the', 'recent', 'popularity', 'of', 'deep', 'neural', 'networks', 'dnns', 'has', 'generated', 'a', 'lot', 'of', 'research', 'interest', 'in', 'performing', 'dnnrelated', 'computation', 'efficiently', 'however', 'the', 'primary', 'focus', 'is', 'usually', 'very', 'narrow', 'and', 'limited', 'to', 'i', 'inference', 'ie', 'how', 'to', 'efficiently', 'execute', 'already', 'trained', 'models', 'and', 'ii', 'image', 'classification', 'networks', 'as', 'the', 'primary', 'benchmark', 'for', 'evaluation', 'our', 'primary', 'goal', 'in', 'this', 'work', 'is', 'to', 'break', 'this', 'myopic', 'view', 'by', 'i', 'proposing', 'a', 'new', 'benchmark', 'for', 'dnn', 'training', 'called', 'tbd', 'tbd', 'is', 'short', 'for', 'training', 'benchmark', 'for', 'dnns', 'that', 'uses', 'a', 'representative', 'set', 'of', 'dnn', 'models', 'that', 'cover', 'a', 'wide', 'range', 'of', 'machine', 'learning', 'applications', 'image', 'classification', 'machine', 'translation', 'speech', 'recognition', 'object', 'detection', 'adversarial', 'networks', 'reinforcement', 'learning', 'and', 'ii', 'by', 'performing', 'an', 'extensive', 'performance', 'analysis', 'of', 'training', 'these', 'different', 'applications', 'on', 'three', 'major', 'deep', 'learning', 'frameworks', 'tensorflow', 'mxnet', 'cntk', 'across', 'different', 'hardware', 'configurations', 'singlegpu', 'multigpu', 'and', 'multimachine', 'tbd', 'currently', 'covers', 'six', 'major', 'application', 'domains', 'and', 'eight', 'different', 'stateoftheart', 'models', 'we', 'present', 'a', 'new', 'toolchain', 'for', 'performance', 'analysis', 'for', 'these', 'models', 'that', 'combines', 'the', 'targeted', 'usage', 'of', 'existing', 'performance', 'analysis', 'tools', 'careful', 'selection', 'of', 'new', 'and', 'existing', 'metrics', 'and', 'methodologies', 'to', 'analyze', 'the', 'results', 'and', 'utilization', 'of', 'domain', 'specific', 'characteristics', 'of', 'dnn', 'training', 'we', 'also', 'build', 'a', 'new', 'set', 'of', 'tools', 'for', 'memory', 'profiling', 'in', 'all', 'three', 'major', 'frameworks', 'much', 'needed', 'tools', 'that', 'can', 'finally', 'shed', 'some', 'light', 'on', 'precisely', 'how', 'much', 'memory', 'is', 'consumed', 'by', 'different', 'data', 'structures', 'weights', 'activations', 'gradients', 'workspace', 'in', 'dnn', 'training', 'by', 'using', 'our', 'tools', 'and', 'methodologies', 'we', 'make', 'several', 'important', 'observations', 'and', 'recommendations', 'on', 'where', 'the', 'future', 'research', 'and', 'optimization', 'of', 'dnn', 'training', 'should', 'be', 'focused']]
|
[-0.044185773355288886, -0.011428833239270322, -0.03163862247810752, 0.06091319316743328, -0.1260755003939541, -0.21246217432660314, 0.026546785315358132, 0.4639656253721354, -0.2434321445008775, -0.3544713743325358, 0.11315595887882529, -0.23979913771222786, -0.18352678899811406, 0.25919980571939133, -0.11954463030824455, 0.12944180132153463, 0.17042010796634163, -0.015296621296010069, -0.067215226363953, -0.3205177907656246, 0.30143001185343515, 0.0501188410408707, 0.3580528564856581, 0.016186198630844646, 0.07247929409188043, -0.04036496050198966, -0.0388350811558512, -0.02403958223338397, -0.07049921679987027, 0.20312284679099354, 0.3292217081744896, 0.2622163688195902, 0.3603248349373352, -0.4199516768303682, -0.2378571985560724, 0.08932106913032256, 0.16672658381482833, 0.0894118964013134, -0.05239590862590187, -0.3020099444631136, 0.09863284187597873, -0.18211085648937064, 0.033175846031111365, -0.16744532744874652, 0.000888176467972544, 0.02796197720882395, -0.2504516527908942, -0.052054751958843, 0.0666593019130644, 0.10257589412624685, -0.0346137490070794, -0.16198913811987162, 0.05231627521658633, 0.16054953649323786, 0.03881037715901533, 0.04236270944051936, 0.15358677204118443, -0.19418376390997266, -0.1617114562330381, 0.33874263089009615, -0.03170477344307451, -0.17575834768144458, 0.22880034569545454, 0.028878079228243737, -0.21519045988273508, 0.06964946471084402, 0.286015887750216, 0.11969220500685415, -0.19309093366016827, 0.02225517661789573, 0.015768712657099625, 0.1684693138536839, 0.02140670220174317, -0.023775760416503786, 0.1821414362687512, 0.30965475983355406, 0.010377867080552399, 0.13309881260908507, -0.1264331511630378, -0.0820305184830191, -0.22850311962044184, -0.09159915962274064, -0.17591494344359368, -0.016161697952270085, -0.09619140336844623, -0.12946404298187567, 0.42450139537313075, 0.22197615990754577, 0.16567083462405036, 0.1054516262364934, 0.3743699090133579, -0.01748096544442716, 0.1517607845629583, 0.11603118378915034, 0.18044151927197336, -0.0013449842650619037, 0.14500354679064156, -0.13030455798824442, 0.05452062544404125, -0.007966611419259658]
|
1,803.06906
|
Understanding dynamics of looping of a long chain polymer in solution:
Wilemski-Fixman Approach
|
We investigate theoretically the end-to-end looping time of a long chain
polymer molecule immersed in a solvent. The dynamics of the end-to-end distance
is governed by a Smoluchowski-like equation of a particle moving under the
influence of a parabolic potential in presence of a Dirac delta sink of
arbitrary strength and location. Using Wilemski-Fixman [ G. Wilemski and M.
Fixman, J. Chem. Phys. {\bf 60}, {\it 866} (1974)] approach we calculate the
looping time for a long chain molecule immersed in a solvent. We find that
looping time varies with several parameters such as length of the polymer (N),
bond length (b) and the relaxation time ${\tau_R}$.
|
cond-mat.soft cond-mat.other
|
we investigate theoretically the endtoend looping time of a long chain polymer molecule immersed in a solvent the dynamics of the endtoend distance is governed by a smoluchowskilike equation of a particle moving under the influence of a parabolic potential in presence of a dirac delta sink of arbitrary strength and location using wilemskifixman g wilemski and m fixman j chem phys bf 60 it 866 1974 approach we calculate the looping time for a long chain molecule immersed in a solvent we find that looping time varies with several parameters such as length of the polymer n bond length b and the relaxation time tau_r
|
[['we', 'investigate', 'theoretically', 'the', 'endtoend', 'looping', 'time', 'of', 'a', 'long', 'chain', 'polymer', 'molecule', 'immersed', 'in', 'a', 'solvent', 'the', 'dynamics', 'of', 'the', 'endtoend', 'distance', 'is', 'governed', 'by', 'a', 'smoluchowskilike', 'equation', 'of', 'a', 'particle', 'moving', 'under', 'the', 'influence', 'of', 'a', 'parabolic', 'potential', 'in', 'presence', 'of', 'a', 'dirac', 'delta', 'sink', 'of', 'arbitrary', 'strength', 'and', 'location', 'using', 'wilemskifixman', 'g', 'wilemski', 'and', 'm', 'fixman', 'j', 'chem', 'phys', 'bf', '60', 'it', '866', '1974', 'approach', 'we', 'calculate', 'the', 'looping', 'time', 'for', 'a', 'long', 'chain', 'molecule', 'immersed', 'in', 'a', 'solvent', 'we', 'find', 'that', 'looping', 'time', 'varies', 'with', 'several', 'parameters', 'such', 'as', 'length', 'of', 'the', 'polymer', 'n', 'bond', 'length', 'b', 'and', 'the', 'relaxation', 'time', 'tau_r']]
|
[-0.21003714583392413, 0.16409174555403022, -0.042693380547581976, -0.022599084007351677, 0.010979401237630058, -0.18157207376306067, 0.0704207682555414, 0.39156267446694226, -0.25720649064992956, -0.2882861716075326, 0.0015454096225406622, -0.24510361798951086, -0.10963972460891488, 0.11035390835549717, 0.02023371053806875, 0.03204067753636682, 0.04871252791534336, 0.049785312089436456, -0.03861973822371648, -0.17484367522850353, 0.1519381684286274, 0.05894580794682832, 0.1942750288095031, 0.08695493493710188, 0.14158993340668463, 0.0747116483870964, 0.039011411548961164, 0.023299242921156, -0.2395819332959259, 0.053409375716000795, 0.17434771139095626, -0.008889468006772112, 0.2539330470323, -0.42936679275425255, -0.2363272684028829, 0.08794347578571793, 0.12159251265407908, 0.11469835331136326, 0.027849959056079825, -0.2672639091099384, 0.02998494784751872, -0.1759296702484618, -0.14370153426579288, 0.01847726105435593, 0.17057283884265795, 0.0817739638271478, -0.26011326979353744, 0.12275019844001124, 0.04705574841431852, 0.05924485786378665, -0.03967417328934765, -0.07241605734891908, -0.008564787747707428, 0.09196336243196197, 0.0536577023965535, 0.08740564911925006, 0.18923458184844832, -0.08067553241754759, -0.043808390724665996, 0.3829471722666947, -0.15674259465293222, -0.21168673534895172, 0.16420997297039852, -0.06981124360562425, -0.08702504356339011, 0.14659552982533877, 0.13088361251185526, 0.19051019379974538, -0.15339669708232834, 0.12365739512145256, -0.05858452494568104, 0.18396707045305344, 0.11315895345518892, -0.0370695673781535, 0.15066180253436542, 0.20604523595308288, 0.021568174517871637, 0.1451973612859564, -0.14501475393420682, -0.12588293819451038, -0.26020438031113335, -0.2248463662745396, -0.22125283160405057, 0.11717189001446625, -0.09584155359773848, -0.15438980906586744, 0.3763816001350587, 0.09394260506171534, 0.20373627810545689, 0.09781658401677631, 0.16933903554103003, 0.06590152661786151, 0.009338847419163564, 0.1088069541067355, 0.14412416617895635, 0.13508467503630048, 0.08120568569108211, -0.3142138916058993, 0.04378552160682684, 0.08511672154033803]
|
1,803.06907
|
Auxiliary information : the raking-ratio empirical process
|
We study the empirical measure associated to a sample of size $n$ and
modified by $N$ iterations of the raking-ratio method. This empirical measure
is adjusted to match the true probability of sets in a finite partition which
changes each step. We establish asymptotic properties of the raking-ratio
empirical process indexed by functions as $n\rightarrow +\infty$, for $N$
fixed. We study nonasymptotic properties by using a Gaussian approximation
which yields uniform Berry-Esseen type bounds depending on $n, N$ and provides
estimates of the uniform quadratic risk reduction. A closed-form expression of
the limiting covariance matrices is derived as $N\rightarrow +\infty$. In the
two-way contingency table case the limiting process has a simple explicit
formula.
|
math.ST stat.TH
|
we study the empirical measure associated to a sample of size n and modified by n iterations of the rakingratio method this empirical measure is adjusted to match the true probability of sets in a finite partition which changes each step we establish asymptotic properties of the rakingratio empirical process indexed by functions as nrightarrow infty for n fixed we study nonasymptotic properties by using a gaussian approximation which yields uniform berryesseen type bounds depending on n n and provides estimates of the uniform quadratic risk reduction a closedform expression of the limiting covariance matrices is derived as nrightarrow infty in the twoway contingency table case the limiting process has a simple explicit formula
|
[['we', 'study', 'the', 'empirical', 'measure', 'associated', 'to', 'a', 'sample', 'of', 'size', 'n', 'and', 'modified', 'by', 'n', 'iterations', 'of', 'the', 'rakingratio', 'method', 'this', 'empirical', 'measure', 'is', 'adjusted', 'to', 'match', 'the', 'true', 'probability', 'of', 'sets', 'in', 'a', 'finite', 'partition', 'which', 'changes', 'each', 'step', 'we', 'establish', 'asymptotic', 'properties', 'of', 'the', 'rakingratio', 'empirical', 'process', 'indexed', 'by', 'functions', 'as', 'nrightarrow', 'infty', 'for', 'n', 'fixed', 'we', 'study', 'nonasymptotic', 'properties', 'by', 'using', 'a', 'gaussian', 'approximation', 'which', 'yields', 'uniform', 'berryesseen', 'type', 'bounds', 'depending', 'on', 'n', 'n', 'and', 'provides', 'estimates', 'of', 'the', 'uniform', 'quadratic', 'risk', 'reduction', 'a', 'closedform', 'expression', 'of', 'the', 'limiting', 'covariance', 'matrices', 'is', 'derived', 'as', 'nrightarrow', 'infty', 'in', 'the', 'twoway', 'contingency', 'table', 'case', 'the', 'limiting', 'process', 'has', 'a', 'simple', 'explicit', 'formula']]
|
[-0.09331561109450247, 0.06648319760279264, -0.10142940070779462, 0.11281615327103671, -0.013283148031665146, -0.14188201054847532, 0.1568652884473392, 0.3356050109390968, -0.23004512645171157, -0.25013976666793625, 0.07729783630306233, -0.2700140385797048, -0.12824148605328187, 0.1658737867525945, -0.061834680556785315, 0.08806439186446369, 0.025513454413157888, 0.05750387697480619, -0.0885785757875835, -0.2440794332485114, 0.2641123918838275, 0.04976529091696388, 0.29217701960754183, -0.011029743190322603, 0.0968355588369637, 0.03124879756277161, -0.04049252801840859, -0.018581180209626576, -0.20471289618373184, 0.10191673043047038, 0.22500987866286387, 0.13754972183128952, 0.2896609646185035, -0.36157119211741573, -0.14946130331164958, 0.1691372963915845, 0.17919314442718, 0.04874302139796782, 0.005140201913101399, -0.23874148287411248, 0.09400847083244505, -0.15809894176033726, -0.1937438280396496, -0.0664752648611154, 0.03637759711169305, 0.09036527595682335, -0.3889337118349171, 0.05704781456941938, 0.11809531382251796, 0.06322437673225068, -0.02525538652636377, -0.17322890831591004, 0.05243945559154132, 0.13526025746666295, 0.05032436179992926, -0.009535481720896704, 0.09562959751695287, -0.06845466514641885, -0.061270246165804565, 0.3053791773272678, -0.11724396793787102, -0.25429844334056334, 0.09126238808260366, -0.14706103835903508, -0.13149878035411738, 0.1020049867823088, 0.17271993841859512, 0.12120363373209589, -0.13707336066623352, 0.17739577860317826, -0.10037759130188663, 0.12746496149338782, 0.08929940051270283, 0.020029758161399513, 0.06743092805014125, 0.12437105729720445, 0.10564465100677418, 0.2080401885156919, -0.05721864859567306, -0.09282809006981552, -0.3607267993502319, -0.14283685549162328, -0.2540240536410628, 0.10416610552160169, -0.21989862281121272, -0.2086375497570511, 0.31029224912968595, 0.07325500698893198, 0.23942372226156294, 0.17410571751159815, 0.25482128872369814, 0.195835573779602, -0.03505363948767938, 0.05428624016349204, 0.09826167097448238, 0.1706519779794949, -0.00038703064949783893, -0.18064563020847604, 0.12288263223932258, 0.14332361906833416]
|
1,803.06908
|
Table Based Detection of Degenerate Predicates in Free Space
Construction
|
The key to a robust and efficient implementation of a computational geometry
algorithm is an efficient algorithm for detecting degenerate predicates. We
study degeneracy detection in constructing the free space of a polyhedron that
rotates around a fixed axis and translates freely relative to another
polyhedron. The structure of the free space is determined by the signs of
univariate polynomials, called angle polynomials, whose coefficients are
polynomials in the coordinates of the vertices of the polyhedra. Every
predicate is expressible as the sign of an angle polynomial $f$ evaluated at a
zero $t$ of an angle polynomial $g$. A predicate is degenerate (the sign is
zero) when $t$ is a zero of a common factor of $f$ and $g$. We present an
efficient degeneracy detection algorithm based on a one-time factoring of every
possible angle polynomial. Our algorithm is 3500 times faster than the standard
algorithm based on greatest common divisor computation. It reduces the share of
degeneracy detection in our free space computations from 90% to 0.5% of the
running time.
|
cs.CG
|
the key to a robust and efficient implementation of a computational geometry algorithm is an efficient algorithm for detecting degenerate predicates we study degeneracy detection in constructing the free space of a polyhedron that rotates around a fixed axis and translates freely relative to another polyhedron the structure of the free space is determined by the signs of univariate polynomials called angle polynomials whose coefficients are polynomials in the coordinates of the vertices of the polyhedra every predicate is expressible as the sign of an angle polynomial f evaluated at a zero t of an angle polynomial g a predicate is degenerate the sign is zero when t is a zero of a common factor of f and g we present an efficient degeneracy detection algorithm based on a onetime factoring of every possible angle polynomial our algorithm is 3500 times faster than the standard algorithm based on greatest common divisor computation it reduces the share of degeneracy detection in our free space computations from 90 to 05 of the running time
|
[['the', 'key', 'to', 'a', 'robust', 'and', 'efficient', 'implementation', 'of', 'a', 'computational', 'geometry', 'algorithm', 'is', 'an', 'efficient', 'algorithm', 'for', 'detecting', 'degenerate', 'predicates', 'we', 'study', 'degeneracy', 'detection', 'in', 'constructing', 'the', 'free', 'space', 'of', 'a', 'polyhedron', 'that', 'rotates', 'around', 'a', 'fixed', 'axis', 'and', 'translates', 'freely', 'relative', 'to', 'another', 'polyhedron', 'the', 'structure', 'of', 'the', 'free', 'space', 'is', 'determined', 'by', 'the', 'signs', 'of', 'univariate', 'polynomials', 'called', 'angle', 'polynomials', 'whose', 'coefficients', 'are', 'polynomials', 'in', 'the', 'coordinates', 'of', 'the', 'vertices', 'of', 'the', 'polyhedra', 'every', 'predicate', 'is', 'expressible', 'as', 'the', 'sign', 'of', 'an', 'angle', 'polynomial', 'f', 'evaluated', 'at', 'a', 'zero', 't', 'of', 'an', 'angle', 'polynomial', 'g', 'a', 'predicate', 'is', 'degenerate', 'the', 'sign', 'is', 'zero', 'when', 't', 'is', 'a', 'zero', 'of', 'a', 'common', 'factor', 'of', 'f', 'and', 'g', 'we', 'present', 'an', 'efficient', 'degeneracy', 'detection', 'algorithm', 'based', 'on', 'a', 'onetime', 'factoring', 'of', 'every', 'possible', 'angle', 'polynomial', 'our', 'algorithm', 'is', '3500', 'times', 'faster', 'than', 'the', 'standard', 'algorithm', 'based', 'on', 'greatest', 'common', 'divisor', 'computation', 'it', 'reduces', 'the', 'share', 'of', 'degeneracy', 'detection', 'in', 'our', 'free', 'space', 'computations', 'from', '90', 'to', '05', 'of', 'the', 'running', 'time']]
|
[-0.21564291156611817, 0.08562589828351372, -0.08828268154946611, 0.009659305549914364, -0.09658441159922933, -0.1548454420123964, 0.054797667147034, 0.3448072802952252, -0.31548965346815366, -0.2780340327840667, 0.09182452446263999, -0.25232342676649433, -0.10492110539628409, 0.19725973334509966, -0.05398693600609265, 0.029535240190493507, 0.044683253406113836, 0.07278611043706364, -0.12481774815776504, -0.2539092230726965, 0.2822561983430628, 0.04416741503315956, 0.2103685278142261, 0.01866236346405606, 0.14454244786662288, 0.012345311244094182, -0.00699547229931679, -0.014816038324572092, -0.10468666378272797, 0.0922784177250727, 0.2266811166056107, 0.14894912142826375, 0.2709322892993061, -0.3320008085070714, -0.09078257323545945, 0.1590240486873162, 0.13187746759395785, 0.05584970275265013, -0.006514653208838819, -0.22213487351735578, 0.07532576118666288, -0.12253844598308206, -0.1682616951415142, -0.037341108177463674, 0.06891647210279696, -0.030790204551818152, -0.27835579602444427, 0.026995426466212023, 0.06214100455204167, 0.0946111453718744, 0.019368639058801672, -0.13454393974808587, -0.017802412748921578, 0.06680755433575711, 0.0024281190166389978, 0.1168067067317383, 0.10761012268715625, -0.10933455197765968, -0.13566693889388684, 0.40679562688794335, -0.06311550828112833, -0.21549446419673987, 0.12325467626282642, -0.12735136513270676, -0.11957543546355567, 0.19526685800858187, 0.12875871962142113, 0.19773306581462452, -0.05550607993901331, 0.12287135509033634, -0.08998912097182298, 0.17416190925639036, 0.1033080558774473, -0.031964544530383984, 0.187057333077212, 0.11679391282052885, 0.12501855253182395, 0.14382770604204906, -0.06383103784173727, -0.05291642005681223, -0.30919874127044583, -0.1844387039607174, -0.22528843233784185, 0.011312381396893152, -0.1510824770366314, -0.1886140809361931, 0.4116776552035062, 0.11572185637927505, 0.19849022282801873, 0.09110264725939826, 0.32036772842497324, 0.12466552383117487, 0.07003575870442356, 0.10682727153234314, 0.15024889105671022, 0.10976652055301941, -0.003349172373757113, -0.20609196832235685, 0.091868071380981, 0.10835119971983828]
|
1,803.06909
|
Row-finite systems of ordinary differential equations in a scale of
Banach spaces
|
Motivated by the study of dynamics of interacting spins for infinite particle
systems, we consider an infinite family of first order differential equations
in a Euclidean space, parameterized by elements $x$ of a fixed countable set.
We suppose that the system is row-finite, that is, the right-hand side of the
$x$-equation depends on a finite but in general unbounded number $n_x$ of
variables. Under certain dissipativity-type conditions on the right-hand side
and a bound on the growth of $n_x$, we show the existence of the solutions with
infinite life-time, and prove that they live in an increasing scale of Banach
spaces. For this, we obtain uniform estimates for solutions to approximating
finite systems using a version of Ovsyannikov's method for linear systems in a
scale of Banach spaces. As a by-product, we develop an infinite-time
generalization of the Ovsyannikov method.
|
math.FA
|
motivated by the study of dynamics of interacting spins for infinite particle systems we consider an infinite family of first order differential equations in a euclidean space parameterized by elements x of a fixed countable set we suppose that the system is rowfinite that is the righthand side of the xequation depends on a finite but in general unbounded number n_x of variables under certain dissipativitytype conditions on the righthand side and a bound on the growth of n_x we show the existence of the solutions with infinite lifetime and prove that they live in an increasing scale of banach spaces for this we obtain uniform estimates for solutions to approximating finite systems using a version of ovsyannikovs method for linear systems in a scale of banach spaces as a byproduct we develop an infinitetime generalization of the ovsyannikov method
|
[['motivated', 'by', 'the', 'study', 'of', 'dynamics', 'of', 'interacting', 'spins', 'for', 'infinite', 'particle', 'systems', 'we', 'consider', 'an', 'infinite', 'family', 'of', 'first', 'order', 'differential', 'equations', 'in', 'a', 'euclidean', 'space', 'parameterized', 'by', 'elements', 'x', 'of', 'a', 'fixed', 'countable', 'set', 'we', 'suppose', 'that', 'the', 'system', 'is', 'rowfinite', 'that', 'is', 'the', 'righthand', 'side', 'of', 'the', 'xequation', 'depends', 'on', 'a', 'finite', 'but', 'in', 'general', 'unbounded', 'number', 'n_x', 'of', 'variables', 'under', 'certain', 'dissipativitytype', 'conditions', 'on', 'the', 'righthand', 'side', 'and', 'a', 'bound', 'on', 'the', 'growth', 'of', 'n_x', 'we', 'show', 'the', 'existence', 'of', 'the', 'solutions', 'with', 'infinite', 'lifetime', 'and', 'prove', 'that', 'they', 'live', 'in', 'an', 'increasing', 'scale', 'of', 'banach', 'spaces', 'for', 'this', 'we', 'obtain', 'uniform', 'estimates', 'for', 'solutions', 'to', 'approximating', 'finite', 'systems', 'using', 'a', 'version', 'of', 'ovsyannikovs', 'method', 'for', 'linear', 'systems', 'in', 'a', 'scale', 'of', 'banach', 'spaces', 'as', 'a', 'byproduct', 'we', 'develop', 'an', 'infinitetime', 'generalization', 'of', 'the', 'ovsyannikov', 'method']]
|
[-0.17092172363165603, 0.13657170145017808, -0.0808417524440565, 0.05219468960042476, -0.040041347115260105, -0.09210959736230796, 0.029933091884047008, 0.3157804789851703, -0.29021825465927087, -0.21416726826683388, 0.1601269233033763, -0.2801999313608352, -0.11445828062563163, 0.20891922433815047, -0.07762568089706094, 0.04522784328277128, 0.04510180956846022, 0.094493080300036, -0.1000114893937227, -0.26039321009876154, 0.3983448477211177, -0.04339329002465567, 0.2056710893234265, 0.035725600873643154, 0.17837965961181276, 0.03936319760269607, 0.012798154254214487, 0.053373744660453616, -0.15893770845355323, 0.11681646571589122, 0.21686009802700332, 0.09014931251463629, 0.3100513231407419, -0.4035055199638009, -0.18837591891001532, 0.14965019510903707, 0.1486211992341323, 0.07917748081356125, -0.06212487455838751, -0.2544252386829559, 0.09255750516793974, -0.1643715202437201, -0.1657725881980867, -0.04721402667759769, 0.036962102484497904, 0.05564887026717981, -0.31110847015878645, 0.023659872042987008, 0.09317418047145981, 0.061893167825052144, -0.1191714778188211, -0.06996802108841475, 0.004644623453107973, 0.06474459912303997, 0.002458781271369831, -0.006025928647959254, 0.04640384968218353, -0.08987194329223501, -0.11479371516168982, 0.3453420364796488, -0.10815179892866265, -0.27370104616156954, 0.16120177372426225, -0.1550369565240175, -0.15864817627226474, 0.08733909317980641, 0.20637767672187823, 0.18987942197481575, -0.08343442202802154, 0.17042494762226587, -0.12578557630784917, 0.17939143292470902, 0.04607667156454662, 0.05128735153424634, 0.12989937093621795, 0.17271355628643348, 0.17331050225682015, 0.17623071947668179, 0.014542483817448543, -0.10353417566089985, -0.34250177389037784, -0.1555130613071041, -0.17829049157106952, 0.07619151384637192, -0.12398304641596886, -0.2261679867093546, 0.3374340208618483, 0.1113877895615482, 0.20323735609164703, 0.11111863653944887, 0.21364940126574988, 0.14846651801897257, 0.011285547980282834, 0.0675738650218894, 0.13805410326829692, 0.14581104281925314, 0.035333017106640385, -0.19612032306073504, 0.03042509990568826, 0.14629206559587055]
|
1,803.0691
|
Exploring neutrino mass and mass hierarchy in the scenario of vacuum
energy interacting with cold dark matter
|
We investigate the constraints on total neutrino mass in the scenario of
vacuum energy interacting with cold dark matter. We focus on two typical
interaction forms, i.e., $Q=\beta H\rho_{\rm c}$ and $Q=\beta H\rho_{\Lambda}$.
To avoid the occurrence of large-scale instability in interacting dark energy
cosmology, we adopt the parameterized post-Friedmann approach to calculate the
perturbation evolution of dark energy. We employ observational data, including
the Planck cosmic microwave background temperature and polarization data,
baryon acoustic oscillation data, a JLA sample of type Ia supernovae
observation, direct measurement of the Hubble constant, and redshift space
distortion data. We find that, compared with those in the $\Lambda$CDM model,
much looser constraints on $\sum m_{\nu}$ are obtained in the $Q=\beta
H\rho_{\rm c}$ model, whereas slightly tighter constraints are obtained in the
$Q=\beta H\rho_{\Lambda}$ model. Consideration of the possible mass hierarchies
of neutrinos reveals that the smallest upper limit of $\sum m_{\nu}$ appears in
the degenerate hierarchy case. By comparing the values of $\chi^2_{\rm min}$,
we find that the normal hierarchy case is favored over the inverted one. In
particular, we find that the difference $\Delta \chi^2_{\rm min} \equiv
\chi^2_{\rm IH; min}-\chi^2_{\rm NH; min}> 2$ in the $Q=\beta H\rho_{\rm c}$
model. In addition, we find that $\beta=0$ is consistent with the current
observations in the $Q=\beta H\rho_{\rm c}$ model, and $\beta < 0$ is favored
at more than the $1\sigma$ level in the $Q=\beta H\rho_{\Lambda}$ model.
|
astro-ph.CO gr-qc hep-ph
|
we investigate the constraints on total neutrino mass in the scenario of vacuum energy interacting with cold dark matter we focus on two typical interaction forms ie qbeta hrho_rm c and qbeta hrho_lambda to avoid the occurrence of largescale instability in interacting dark energy cosmology we adopt the parameterized postfriedmann approach to calculate the perturbation evolution of dark energy we employ observational data including the planck cosmic microwave background temperature and polarization data baryon acoustic oscillation data a jla sample of type ia supernovae observation direct measurement of the hubble constant and redshift space distortion data we find that compared with those in the lambdacdm model much looser constraints on sum m_nu are obtained in the qbeta hrho_rm c model whereas slightly tighter constraints are obtained in the qbeta hrho_lambda model consideration of the possible mass hierarchies of neutrinos reveals that the smallest upper limit of sum m_nu appears in the degenerate hierarchy case by comparing the values of chi2_rm min we find that the normal hierarchy case is favored over the inverted one in particular we find that the difference delta chi2_rm min equiv chi2_rm ih minchi2_rm nh min 2 in the qbeta hrho_rm c model in addition we find that beta0 is consistent with the current observations in the qbeta hrho_rm c model and beta 0 is favored at more than the 1sigma level in the qbeta hrho_lambda model
|
[['we', 'investigate', 'the', 'constraints', 'on', 'total', 'neutrino', 'mass', 'in', 'the', 'scenario', 'of', 'vacuum', 'energy', 'interacting', 'with', 'cold', 'dark', 'matter', 'we', 'focus', 'on', 'two', 'typical', 'interaction', 'forms', 'ie', 'qbeta', 'hrho_rm', 'c', 'and', 'qbeta', 'hrho_lambda', 'to', 'avoid', 'the', 'occurrence', 'of', 'largescale', 'instability', 'in', 'interacting', 'dark', 'energy', 'cosmology', 'we', 'adopt', 'the', 'parameterized', 'postfriedmann', 'approach', 'to', 'calculate', 'the', 'perturbation', 'evolution', 'of', 'dark', 'energy', 'we', 'employ', 'observational', 'data', 'including', 'the', 'planck', 'cosmic', 'microwave', 'background', 'temperature', 'and', 'polarization', 'data', 'baryon', 'acoustic', 'oscillation', 'data', 'a', 'jla', 'sample', 'of', 'type', 'ia', 'supernovae', 'observation', 'direct', 'measurement', 'of', 'the', 'hubble', 'constant', 'and', 'redshift', 'space', 'distortion', 'data', 'we', 'find', 'that', 'compared', 'with', 'those', 'in', 'the', 'lambdacdm', 'model', 'much', 'looser', 'constraints', 'on', 'sum', 'm_nu', 'are', 'obtained', 'in', 'the', 'qbeta', 'hrho_rm', 'c', 'model', 'whereas', 'slightly', 'tighter', 'constraints', 'are', 'obtained', 'in', 'the', 'qbeta', 'hrho_lambda', 'model', 'consideration', 'of', 'the', 'possible', 'mass', 'hierarchies', 'of', 'neutrinos', 'reveals', 'that', 'the', 'smallest', 'upper', 'limit', 'of', 'sum', 'm_nu', 'appears', 'in', 'the', 'degenerate', 'hierarchy', 'case', 'by', 'comparing', 'the', 'values', 'of', 'chi2_rm', 'min', 'we', 'find', 'that', 'the', 'normal', 'hierarchy', 'case', 'is', 'favored', 'over', 'the', 'inverted', 'one', 'in', 'particular', 'we', 'find', 'that', 'the', 'difference', 'delta', 'chi2_rm', 'min', 'equiv', 'chi2_rm', 'ih', 'minchi2_rm', 'nh', 'min', '2', 'in', 'the', 'qbeta', 'hrho_rm', 'c', 'model', 'in', 'addition', 'we', 'find', 'that', 'beta0', 'is', 'consistent', 'with', 'the', 'current', 'observations', 'in', 'the', 'qbeta', 'hrho_rm', 'c', 'model', 'and', 'beta', '0', 'is', 'favored', 'at', 'more', 'than', 'the', '1sigma', 'level', 'in', 'the', 'qbeta', 'hrho_lambda', 'model']]
|
[-0.1366991012797529, 0.13736950001355422, 0.009570890213565334, 0.1480040971685768, -0.06930229251232484, -0.1490000547658976, 0.06437887535936644, 0.32128957687755644, -0.2083862939991219, -0.31391832538596964, 0.04508153920557917, -0.3231180780320479, -0.009387599801361238, 0.18197021654847523, 0.043212295233989485, -0.031139613754234945, 0.03462935838261214, 0.010053889700414046, -0.08816361772371001, -0.23334124992024557, 0.30116595979425653, 0.06368045715169739, 0.22855353997640676, -0.030612837053511453, 0.04568492601139714, -0.06441450964801175, -0.04062485877910386, -0.025205497797603883, -0.22433528293549898, 0.04745215998719568, 0.1649004130687504, 0.15631466869254718, 0.15235424076672643, -0.35991671199631325, -0.19653752472190916, 0.161185925129963, 0.13387207871697762, 0.05640665735927937, 0.001471986949858863, -0.24517475290922447, 0.01871028481071572, -0.18494010056045068, -0.09879249835832288, 0.012757275233477982, -0.0013905025613696678, -0.039550216269233954, -0.3076464314317412, 0.21215674128666845, -0.029144891317042967, -0.018676695283426418, -0.1077213527088094, -0.20567064035238455, -0.07545738626048779, -0.043001525249818096, 0.050397305893104365, 0.03525691006962797, 0.06483950379605749, -0.14666841179841075, -0.017573262334031902, 0.4297126571971761, -0.14912661456878792, -0.11294161485148715, 0.09090496295577158, -0.18745379513332053, -0.17316968688012466, 0.06454498427312659, 0.09237395397427937, 0.034123738441089894, -0.1175906410643264, 0.15901830300243328, -0.04527644280814971, 0.19051383842369946, 0.058316805689474165, -0.016128433890559752, 0.24389155862331593, 0.18394489736579683, 0.06425010601625494, 0.01525888148361169, -0.13092236028801973, -0.04490847250512477, -0.3344415996466642, -0.07664838568940151, -0.11078994982349484, 0.05245356941393212, -0.15202407458627537, -0.10709042682555382, 0.34139794180696104, 0.12880178125544817, 0.22958528859459837, 0.10437097366919498, 0.2733156998196374, 0.11249945382182688, 0.03583561306940797, 0.062421012760403204, 0.28672900964789416, 0.10275352838823734, 0.06291647953052154, -0.24815188243215822, -0.010611798778257292, -0.0018448446725454668]
|
1,803.06911
|
Unsupervised Semantic Deep Hashing
|
In recent years, deep hashing methods have been proved to be efficient since
it employs convolutional neural network to learn features and hashing codes
simultaneously. However, these methods are mostly supervised. In real-world
application, it is a time-consuming and overloaded task for annotating a large
number of images. In this paper, we propose a novel unsupervised deep hashing
method for large-scale image retrieval. Our method, namely unsupervised
semantic deep hashing (\textbf{USDH}), uses semantic information preserved in
the CNN feature layer to guide the training of network. We enforce four
criteria on hashing codes learning based on VGG-19 model: 1) preserving
relevant information of feature space in hashing space; 2) minimizing
quantization loss between binary-like codes and hashing codes; 3) improving the
usage of each bit in hashing codes by using maximum information entropy, and 4)
invariant to image rotation. Extensive experiments on CIFAR-10, NUSWIDE have
demonstrated that \textbf{USDH} outperforms several state-of-the-art
unsupervised hashing methods for image retrieval. We also conduct experiments
on Oxford 17 datasets for fine-grained classification to verify its efficiency
for other computer vision tasks.
|
cs.CV
|
in recent years deep hashing methods have been proved to be efficient since it employs convolutional neural network to learn features and hashing codes simultaneously however these methods are mostly supervised in realworld application it is a timeconsuming and overloaded task for annotating a large number of images in this paper we propose a novel unsupervised deep hashing method for largescale image retrieval our method namely unsupervised semantic deep hashing textbfusdh uses semantic information preserved in the cnn feature layer to guide the training of network we enforce four criteria on hashing codes learning based on vgg19 model 1 preserving relevant information of feature space in hashing space 2 minimizing quantization loss between binarylike codes and hashing codes 3 improving the usage of each bit in hashing codes by using maximum information entropy and 4 invariant to image rotation extensive experiments on cifar10 nuswide have demonstrated that textbfusdh outperforms several stateoftheart unsupervised hashing methods for image retrieval we also conduct experiments on oxford 17 datasets for finegrained classification to verify its efficiency for other computer vision tasks
|
[['in', 'recent', 'years', 'deep', 'hashing', 'methods', 'have', 'been', 'proved', 'to', 'be', 'efficient', 'since', 'it', 'employs', 'convolutional', 'neural', 'network', 'to', 'learn', 'features', 'and', 'hashing', 'codes', 'simultaneously', 'however', 'these', 'methods', 'are', 'mostly', 'supervised', 'in', 'realworld', 'application', 'it', 'is', 'a', 'timeconsuming', 'and', 'overloaded', 'task', 'for', 'annotating', 'a', 'large', 'number', 'of', 'images', 'in', 'this', 'paper', 'we', 'propose', 'a', 'novel', 'unsupervised', 'deep', 'hashing', 'method', 'for', 'largescale', 'image', 'retrieval', 'our', 'method', 'namely', 'unsupervised', 'semantic', 'deep', 'hashing', 'textbfusdh', 'uses', 'semantic', 'information', 'preserved', 'in', 'the', 'cnn', 'feature', 'layer', 'to', 'guide', 'the', 'training', 'of', 'network', 'we', 'enforce', 'four', 'criteria', 'on', 'hashing', 'codes', 'learning', 'based', 'on', 'vgg19', 'model', '1', 'preserving', 'relevant', 'information', 'of', 'feature', 'space', 'in', 'hashing', 'space', '2', 'minimizing', 'quantization', 'loss', 'between', 'binarylike', 'codes', 'and', 'hashing', 'codes', '3', 'improving', 'the', 'usage', 'of', 'each', 'bit', 'in', 'hashing', 'codes', 'by', 'using', 'maximum', 'information', 'entropy', 'and', '4', 'invariant', 'to', 'image', 'rotation', 'extensive', 'experiments', 'on', 'cifar10', 'nuswide', 'have', 'demonstrated', 'that', 'textbfusdh', 'outperforms', 'several', 'stateoftheart', 'unsupervised', 'hashing', 'methods', 'for', 'image', 'retrieval', 'we', 'also', 'conduct', 'experiments', 'on', 'oxford', '17', 'datasets', 'for', 'finegrained', 'classification', 'to', 'verify', 'its', 'efficiency', 'for', 'other', 'computer', 'vision', 'tasks']]
|
[-0.048761414087244444, -0.05995168370327779, -0.08306940115988254, 0.09393866321071982, -0.08968024665622838, -0.2632741730713419, 0.007896589657424817, 0.5237374357559851, -0.28010463446112616, -0.3449640819004604, 0.09243598570914141, -0.29292790372024424, -0.1817947934780802, 0.20570127570203373, -0.1717791671305895, 0.1616612556054523, 0.17095556309978877, 0.033510894259837054, -0.13917760632533047, -0.39718650534749034, 0.31409511398923184, 0.06537593488797679, 0.397082438549426, 0.025146262669669732, 0.13983111028160367, -0.021197875774066365, -0.09020513623753297, -0.05625994055964319, -0.04277141855917372, 0.20301822757082327, 0.37120079045183957, 0.2593868930252003, 0.2990907030898545, -0.3568127233694707, -0.26180154285593227, 0.07559097369334528, 0.15516956246790609, 0.12014312229593217, -0.0769491536143635, -0.3343489197827876, 0.09987010903656483, -0.17431642636124578, 0.182197125546102, -0.2108631340793467, -0.016569889872334896, -0.047218243427175496, -0.30855475032835133, 0.01958258852212956, 0.07847987396509519, 0.1046095403709582, -0.027499558737368455, -0.12880729973316193, 0.06578608779901905, 0.13395479812419842, -0.004184399150711085, 0.10805922265763261, 0.1252799727421786, -0.20418335435512874, -0.16607243579413208, 0.32386268354952336, -0.05701891780997227, -0.20010236672258802, 0.17807836753715361, 0.05017369483131915, -0.21055774695373008, 0.08908065190804856, 0.26506916141935755, 0.16654094142041037, -0.12509569276656424, 0.004440979820543102, -0.06648094885849527, 0.201697176507275, 0.08514151005340474, 0.04828755517357162, 0.13320446592057122, 0.3007274398500366, 0.039178851512925966, 0.1473131953961482, -0.18667934953368137, -0.05418397583599602, -0.12167518507423146, -0.09107930353443537, -0.25208088178320653, -0.07248854853212833, -0.1280327622961652, -0.1258527979425188, 0.373495248082493, 0.25908409791067244, 0.196644344736955, 0.0957239018753171, 0.3621142331617219, -0.09033646039066039, 0.20326114358561295, 0.1598991177201138, 0.16600659521562713, 0.019536939919260997, 0.13575342033058405, -0.13888275498524308, 0.052093332799018496, 0.13787589084090932]
|
1,803.06912
|
Non-linear double-peeling: experimental vs. theoretical predictions
|
The double peeling of detachment of non-linear adhesive tapes from a flat
Poly(methylmethacrylate) (PMMA) surface has been investigated from both
experimental and theoretical point of view. Double peeling tests show that, as
the detachment process advances, the peeling angle stabilizes on a limiting
value {\theta}lim corresponding to a critical pull-off force Fc above which the
tape is completely detached from the substrate. This observed behavior is in
good agreement with results obtained following the new theory of multiple
peeling and taking into account the hardening-softening non-linear behavior of
the experimentally tested adhesive tapes and clarifies some aspects of the
experimental data. In particular, the theoretical model shows that the value of
the limiting peeling angle depends on the geometry of the adhesive tape as well
as on the stiffness properties and on the interfacial energy {\Delta}{\gamma}.
Finally, theoretical predictions confirm that solutions with a peeling angle
lower than {\theta}lim are unstable.
|
cond-mat.soft
|
the double peeling of detachment of nonlinear adhesive tapes from a flat polymethylmethacrylate pmma surface has been investigated from both experimental and theoretical point of view double peeling tests show that as the detachment process advances the peeling angle stabilizes on a limiting value thetalim corresponding to a critical pulloff force fc above which the tape is completely detached from the substrate this observed behavior is in good agreement with results obtained following the new theory of multiple peeling and taking into account the hardeningsoftening nonlinear behavior of the experimentally tested adhesive tapes and clarifies some aspects of the experimental data in particular the theoretical model shows that the value of the limiting peeling angle depends on the geometry of the adhesive tape as well as on the stiffness properties and on the interfacial energy deltagamma finally theoretical predictions confirm that solutions with a peeling angle lower than thetalim are unstable
|
[['the', 'double', 'peeling', 'of', 'detachment', 'of', 'nonlinear', 'adhesive', 'tapes', 'from', 'a', 'flat', 'polymethylmethacrylate', 'pmma', 'surface', 'has', 'been', 'investigated', 'from', 'both', 'experimental', 'and', 'theoretical', 'point', 'of', 'view', 'double', 'peeling', 'tests', 'show', 'that', 'as', 'the', 'detachment', 'process', 'advances', 'the', 'peeling', 'angle', 'stabilizes', 'on', 'a', 'limiting', 'value', 'thetalim', 'corresponding', 'to', 'a', 'critical', 'pulloff', 'force', 'fc', 'above', 'which', 'the', 'tape', 'is', 'completely', 'detached', 'from', 'the', 'substrate', 'this', 'observed', 'behavior', 'is', 'in', 'good', 'agreement', 'with', 'results', 'obtained', 'following', 'the', 'new', 'theory', 'of', 'multiple', 'peeling', 'and', 'taking', 'into', 'account', 'the', 'hardeningsoftening', 'nonlinear', 'behavior', 'of', 'the', 'experimentally', 'tested', 'adhesive', 'tapes', 'and', 'clarifies', 'some', 'aspects', 'of', 'the', 'experimental', 'data', 'in', 'particular', 'the', 'theoretical', 'model', 'shows', 'that', 'the', 'value', 'of', 'the', 'limiting', 'peeling', 'angle', 'depends', 'on', 'the', 'geometry', 'of', 'the', 'adhesive', 'tape', 'as', 'well', 'as', 'on', 'the', 'stiffness', 'properties', 'and', 'on', 'the', 'interfacial', 'energy', 'deltagamma', 'finally', 'theoretical', 'predictions', 'confirm', 'that', 'solutions', 'with', 'a', 'peeling', 'angle', 'lower', 'than', 'thetalim', 'are', 'unstable']]
|
[-0.09394395599241724, 0.14690074965204644, -0.10613020509793955, 0.0019237326061019664, -0.05750616181691821, -0.17317245853752297, 0.07755283286229352, 0.36129342903376827, -0.2678614426529248, -0.267653463431009, 0.0748226376111313, -0.2773407393966445, -0.14978270194236964, 0.24402727254653886, -0.04703268694891376, 0.09743313568850491, 0.07240675485399145, 0.002519079296530893, -0.04087784136145457, -0.18896327993790338, 0.27272118079544816, 0.10146116785355062, 0.3499420266598463, 0.07697460285896567, 0.08172082706376435, 0.025172079211700983, 0.03896568320541574, 0.0791052345244289, -0.21503738022557634, 0.05668066214182533, 0.1693604387742961, -0.013516376265355904, 0.19164283889902117, -0.46080269490762443, -0.21632857911363745, -0.013034106100965667, 0.09317278122879415, 0.08284397565387815, -0.04218730917329362, -0.22912404339935555, 0.0853680530859895, -0.09754592506058714, -0.13208491269883565, -0.011964412815493826, -0.0008101210454416355, 0.07154453086710516, -0.1915492494051476, 0.0608174549946999, 0.08772220119487044, 0.05365113385846751, -0.10040640511906287, -0.14301578480994093, -0.059787318737077336, 0.11629641268889876, 0.09858649167065796, -0.011548450176022797, 0.19875136138277516, -0.16067359152315622, -0.07825643038564681, 0.33170432276123724, -0.018136750475129255, -0.15076352225854092, 0.16823284448618256, -0.13732553947241916, -0.0714001352148718, 0.1570255407819762, 0.1333570015654218, 0.06850154216607544, -0.10881567967668075, 0.0739744191429884, -0.045066109627185255, 0.16291612421178833, 0.11409420510691484, -0.06581958738393377, 0.1828354607654998, 0.22696643993852272, 0.0013794330442511795, 0.1770368524773934, -0.12671075374413057, -0.1089054746998649, -0.3290173236570546, -0.14372382186753238, -0.15968103975451384, 0.06091148277663395, -0.12444052805822506, -0.19465588167897308, 0.3614900562687208, 0.10943773752640958, 0.24602065732290082, 0.07095690294022003, 0.28378995752662123, 0.06556326500687049, 0.040222810803218774, 0.01105821432058243, 0.3257909457196541, 0.1596878342792992, 0.10025288838730663, -0.23295367711642445, 0.12775481943253603, 0.034710498793900715]
|
1,803.06913
|
Newton: Gravitating Towards the Physical Limits of Crossbar Acceleration
|
Many recent works have designed accelerators for Convolutional Neural
Networks (CNNs). While digital accelerators have relied on near data
processing, analog accelerators have further reduced data movement by
performing in-situ computation. Recent works take advantage of highly parallel
analog in-situ computation in memristor crossbars to accelerate the many
vector-matrix multiplication operations in CNNs. However, these in-situ
accelerators have two significant short-comings that we address in this work.
First, the ADCs account for a large fraction of chip power and area. Second,
these accelerators adopt a homogeneous design where every resource is
provisioned for the worst case. By addressing both problems, the new
architecture, Newton, moves closer to achieving optimal energy-per-neuron for
crossbar accelerators.
We introduce multiple new techniques that apply at different levels of the
tile hierarchy. Two of the techniques leverage heterogeneity: one adapts ADC
precision based on the requirements of every sub-computation (with zero impact
on accuracy), and the other designs tiles customized for convolutions or
classifiers. Two other techniques rely on divide-and-conquer numeric algorithms
to reduce computations and ADC pressure. Finally, we place constraints on how a
workload is mapped to tiles, thus helping reduce resource provisioning in
tiles. For a wide range of CNN dataflows and structures, Newton achieves a 77%
decrease in power, 51% improvement in energy efficiency, and 2.2x higher
throughput/area, relative to the state-of-the-art ISAAC accelerator.
|
cs.LG cs.AR
|
many recent works have designed accelerators for convolutional neural networks cnns while digital accelerators have relied on near data processing analog accelerators have further reduced data movement by performing insitu computation recent works take advantage of highly parallel analog insitu computation in memristor crossbars to accelerate the many vectormatrix multiplication operations in cnns however these insitu accelerators have two significant shortcomings that we address in this work first the adcs account for a large fraction of chip power and area second these accelerators adopt a homogeneous design where every resource is provisioned for the worst case by addressing both problems the new architecture newton moves closer to achieving optimal energyperneuron for crossbar accelerators we introduce multiple new techniques that apply at different levels of the tile hierarchy two of the techniques leverage heterogeneity one adapts adc precision based on the requirements of every subcomputation with zero impact on accuracy and the other designs tiles customized for convolutions or classifiers two other techniques rely on divideandconquer numeric algorithms to reduce computations and adc pressure finally we place constraints on how a workload is mapped to tiles thus helping reduce resource provisioning in tiles for a wide range of cnn dataflows and structures newton achieves a 77 decrease in power 51 improvement in energy efficiency and 22x higher throughputarea relative to the stateoftheart isaac accelerator
|
[['many', 'recent', 'works', 'have', 'designed', 'accelerators', 'for', 'convolutional', 'neural', 'networks', 'cnns', 'while', 'digital', 'accelerators', 'have', 'relied', 'on', 'near', 'data', 'processing', 'analog', 'accelerators', 'have', 'further', 'reduced', 'data', 'movement', 'by', 'performing', 'insitu', 'computation', 'recent', 'works', 'take', 'advantage', 'of', 'highly', 'parallel', 'analog', 'insitu', 'computation', 'in', 'memristor', 'crossbars', 'to', 'accelerate', 'the', 'many', 'vectormatrix', 'multiplication', 'operations', 'in', 'cnns', 'however', 'these', 'insitu', 'accelerators', 'have', 'two', 'significant', 'shortcomings', 'that', 'we', 'address', 'in', 'this', 'work', 'first', 'the', 'adcs', 'account', 'for', 'a', 'large', 'fraction', 'of', 'chip', 'power', 'and', 'area', 'second', 'these', 'accelerators', 'adopt', 'a', 'homogeneous', 'design', 'where', 'every', 'resource', 'is', 'provisioned', 'for', 'the', 'worst', 'case', 'by', 'addressing', 'both', 'problems', 'the', 'new', 'architecture', 'newton', 'moves', 'closer', 'to', 'achieving', 'optimal', 'energyperneuron', 'for', 'crossbar', 'accelerators', 'we', 'introduce', 'multiple', 'new', 'techniques', 'that', 'apply', 'at', 'different', 'levels', 'of', 'the', 'tile', 'hierarchy', 'two', 'of', 'the', 'techniques', 'leverage', 'heterogeneity', 'one', 'adapts', 'adc', 'precision', 'based', 'on', 'the', 'requirements', 'of', 'every', 'subcomputation', 'with', 'zero', 'impact', 'on', 'accuracy', 'and', 'the', 'other', 'designs', 'tiles', 'customized', 'for', 'convolutions', 'or', 'classifiers', 'two', 'other', 'techniques', 'rely', 'on', 'divideandconquer', 'numeric', 'algorithms', 'to', 'reduce', 'computations', 'and', 'adc', 'pressure', 'finally', 'we', 'place', 'constraints', 'on', 'how', 'a', 'workload', 'is', 'mapped', 'to', 'tiles', 'thus', 'helping', 'reduce', 'resource', 'provisioning', 'in', 'tiles', 'for', 'a', 'wide', 'range', 'of', 'cnn', 'dataflows', 'and', 'structures', 'newton', 'achieves', 'a', '77', 'decrease', 'in', 'power', '51', 'improvement', 'in', 'energy', 'efficiency', 'and', '22x', 'higher', 'throughputarea', 'relative', 'to', 'the', 'stateoftheart', 'isaac', 'accelerator']]
|
[-0.11392617859135959, 0.03667724274659352, -0.033432214019390255, 0.025880916995982474, -0.0829266338478521, -0.21055783409144882, 0.06642021394134036, 0.4140125472726494, -0.25589029865373114, -0.3543653746674941, 0.11159491073129471, -0.23193603038688546, -0.11306707977266704, 0.264900550907857, -0.10465931186607377, 0.10899989175867306, 0.11241053976118565, -0.04329987607340063, -0.07125838936018922, -0.3133841280043715, 0.24290273349829086, 0.12339167242102764, 0.35445159436646023, 0.003889525493573212, 0.1214201555558906, -0.035593175435082135, -0.029477611947931113, -0.019371713191371966, -0.05477424938611242, 0.14960628197574777, 0.288658165238056, 0.16068595928051488, 0.3358848824321684, -0.5063189136873661, -0.19744291467533123, 0.09825641043248219, 0.15340440308599315, 0.05169335349644134, -0.06520191154160118, -0.19905392318116966, 0.10673754663802937, -0.195461934875266, -0.040589733037684636, -0.11032457249036282, -0.02671824795998869, 0.06223534621120266, -0.22680863704663023, -0.02820615827451498, 0.040149353688633614, 0.04509965740186394, -0.028723103166515707, -0.15989323640221148, 0.07272600568198848, 0.11645652803095116, -0.05318543131833151, 0.02837983482966107, 0.1652322311085497, -0.13975613431615191, -0.17817582309296634, 0.3478779737032714, 0.0011500578647062217, -0.20334563198672162, 0.17980297794460204, -0.08264113128041992, -0.20650816647698303, 0.1320127131295184, 0.24888384201652392, 0.04794454630211468, -0.1405891144344777, 0.07772966939086785, 0.039709746808117063, 0.18720525961023718, 0.11808642376703105, 0.033143757492708405, 0.17370731375555243, 0.23506177084866017, 0.08922482408952954, 0.12124416021033868, -0.11099306426308123, -0.05953246621705794, -0.1792908853440908, -0.13284729394695102, -0.17258060870194866, -0.02368935182875252, -0.08444830142476488, -0.11014474641818267, 0.36122380803461396, 0.18440191022739894, 0.17609920028420123, 0.09281798028618907, 0.3846493928326606, 0.06045292880097973, 0.18468908174490195, 0.1039326657241893, 0.18806783452564724, 0.050251830925499154, 0.17509088833469738, -0.1701761060453608, 0.01737675772889252, 0.037827295702629264]
|
1,803.06914
|
Mixing Time of Markov chain of the Knapsack Problem
|
To find the number of assignments of zeros and ones satisfying a specific
Knapsack Problem is $\#P$ hard, so only approximations are envisageable. A
Markov chain allowing uniform sampling of all possible solutions is given by
Luby, Randall and Sinclair. In 2005, Morris and Sinclair, by using a flow
argument, have shown that the mixing time of this Markov chain is
$\mathcal{O}(n^{9/2+\epsilon})$, for any $\epsilon > 0$. By using a canonical
path argument on the distributive lattice structure of the set of solutions, we
obtain an improved bound, the mixing time is given as $\tau_{_{x}}(\epsilon)
\leq n^{3} \ln (16 \epsilon^{-1})$.
|
math.CO cs.DS math.PR
|
to find the number of assignments of zeros and ones satisfying a specific knapsack problem is p hard so only approximations are envisageable a markov chain allowing uniform sampling of all possible solutions is given by luby randall and sinclair in 2005 morris and sinclair by using a flow argument have shown that the mixing time of this markov chain is mathcalon92epsilon for any epsilon 0 by using a canonical path argument on the distributive lattice structure of the set of solutions we obtain an improved bound the mixing time is given as tau__xepsilon leq n3 ln 16 epsilon1
|
[['to', 'find', 'the', 'number', 'of', 'assignments', 'of', 'zeros', 'and', 'ones', 'satisfying', 'a', 'specific', 'knapsack', 'problem', 'is', 'p', 'hard', 'so', 'only', 'approximations', 'are', 'envisageable', 'a', 'markov', 'chain', 'allowing', 'uniform', 'sampling', 'of', 'all', 'possible', 'solutions', 'is', 'given', 'by', 'luby', 'randall', 'and', 'sinclair', 'in', '2005', 'morris', 'and', 'sinclair', 'by', 'using', 'a', 'flow', 'argument', 'have', 'shown', 'that', 'the', 'mixing', 'time', 'of', 'this', 'markov', 'chain', 'is', 'mathcalon92epsilon', 'for', 'any', 'epsilon', '0', 'by', 'using', 'a', 'canonical', 'path', 'argument', 'on', 'the', 'distributive', 'lattice', 'structure', 'of', 'the', 'set', 'of', 'solutions', 'we', 'obtain', 'an', 'improved', 'bound', 'the', 'mixing', 'time', 'is', 'given', 'as', 'tau__xepsilon', 'leq', 'n3', 'ln', '16', 'epsilon1']]
|
[-0.15432967992455815, 0.14509533042913367, -0.06029184041835833, 0.06097432617995461, -0.0678325128731861, -0.17902769403493343, 0.1146226915201017, 0.3658833463850897, -0.2685821871467245, -0.303746477450962, 0.1213511380131725, -0.2606082785253723, -0.0862919603047582, 0.1540497983902848, -0.03612744885807236, 0.09898100674035959, 0.0444406952689557, 0.033471934104454704, -0.03746776449467385, -0.2665219852375837, 0.26835530559765175, 0.030260853590637755, 0.20942545722937211, 0.013230115194649747, 0.10483743605436757, 0.020375547033230152, 0.0021692319908955446, -0.005114712509869908, -0.1845798216337092, 0.06053004134325116, 0.18494577632130435, 0.14203965099538132, 0.2588791511201028, -0.3425594760628883, -0.18012189467359954, 0.13095592660404995, 0.13172481112511983, 0.07927927526664764, -0.0036184845193929505, -0.23275302924836674, 0.11025492898124867, -0.15169103170046583, -0.11246971712292482, -0.07099860861975078, 0.05875157259288244, 0.043609436543192714, -0.33352482498169894, 0.04303546695882687, 0.11267335671194208, 0.02385988339665346, -0.01467761993262684, -0.14479286158651425, -0.005970940001134295, 0.06132809757158005, 0.0353367769663843, 0.068287905708227, 0.0061427852100071805, -0.07227850857452722, -0.160665467614308, 0.3388353375485167, -0.04323581346155455, -0.22303935643382525, 0.1261604390820139, -0.09672439348166033, -0.15457534207477389, 0.13948461087420583, 0.05645290396447914, 0.19209945404448567, -0.11728507908507406, 0.20940868200280724, -0.11995922051816403, 0.15663902562422058, 0.13204445739878187, -0.05113113640982192, 0.09204724739273236, 0.11987636941679132, 0.09854296697449172, 0.14870451586223984, -0.012291598179823874, -0.10076810378389685, -0.28319528757128865, -0.1460982062447632, -0.2317830809734005, 0.09993345899662624, -0.13243673137867518, -0.15454164850204202, 0.32271759912449244, 0.08351840433368807, 0.19763714005239308, 0.13561527161800768, 0.19952249551351997, 0.14430324761648686, -0.00015682294421518841, 0.13180595972031975, 0.16147863544514016, 0.14799867089944505, 0.051347045698397174, -0.1774332834999465, 0.08254865515239847, 0.15407283044381379]
|
1,803.06915
|
Exploiting symmetry in network analysis
|
Virtually all network analyses involve structural measures between pairs of
vertices, or of the vertices themselves, and the large amount of symmetry
present in real-world complex networks is inherited by such measures. This has
practical consequences which have not yet been explored in full generality, nor
systematically exploited by network practitioners. Here we study the effect of
network symmetry on arbitrary network measures, and show how this can be
exploited in practice in a number of ways, from redundancy compression, to
computational reduction. We also uncover the spectral signatures of symmetry
for an arbitrary network measure such as the graph Laplacian. Computing network
symmetries is very efficient in practice, and we test real-world examples up to
several million nodes. Since network models are ubiquitous in the Applied
Sciences, and typically contain a large degree of structural redundancy, our
results are not only significant, but widely applicable.
|
math.CO cs.SI physics.data-an physics.soc-ph
|
virtually all network analyses involve structural measures between pairs of vertices or of the vertices themselves and the large amount of symmetry present in realworld complex networks is inherited by such measures this has practical consequences which have not yet been explored in full generality nor systematically exploited by network practitioners here we study the effect of network symmetry on arbitrary network measures and show how this can be exploited in practice in a number of ways from redundancy compression to computational reduction we also uncover the spectral signatures of symmetry for an arbitrary network measure such as the graph laplacian computing network symmetries is very efficient in practice and we test realworld examples up to several million nodes since network models are ubiquitous in the applied sciences and typically contain a large degree of structural redundancy our results are not only significant but widely applicable
|
[['virtually', 'all', 'network', 'analyses', 'involve', 'structural', 'measures', 'between', 'pairs', 'of', 'vertices', 'or', 'of', 'the', 'vertices', 'themselves', 'and', 'the', 'large', 'amount', 'of', 'symmetry', 'present', 'in', 'realworld', 'complex', 'networks', 'is', 'inherited', 'by', 'such', 'measures', 'this', 'has', 'practical', 'consequences', 'which', 'have', 'not', 'yet', 'been', 'explored', 'in', 'full', 'generality', 'nor', 'systematically', 'exploited', 'by', 'network', 'practitioners', 'here', 'we', 'study', 'the', 'effect', 'of', 'network', 'symmetry', 'on', 'arbitrary', 'network', 'measures', 'and', 'show', 'how', 'this', 'can', 'be', 'exploited', 'in', 'practice', 'in', 'a', 'number', 'of', 'ways', 'from', 'redundancy', 'compression', 'to', 'computational', 'reduction', 'we', 'also', 'uncover', 'the', 'spectral', 'signatures', 'of', 'symmetry', 'for', 'an', 'arbitrary', 'network', 'measure', 'such', 'as', 'the', 'graph', 'laplacian', 'computing', 'network', 'symmetries', 'is', 'very', 'efficient', 'in', 'practice', 'and', 'we', 'test', 'realworld', 'examples', 'up', 'to', 'several', 'million', 'nodes', 'since', 'network', 'models', 'are', 'ubiquitous', 'in', 'the', 'applied', 'sciences', 'and', 'typically', 'contain', 'a', 'large', 'degree', 'of', 'structural', 'redundancy', 'our', 'results', 'are', 'not', 'only', 'significant', 'but', 'widely', 'applicable']]
|
[-0.10919174653548135, 0.07115406150164558, -0.050413211074032606, 0.08144043394275112, -0.08218680055212382, -0.12193703558933858, 0.03887238013972719, 0.433170002055903, -0.2788741487040095, -0.3488884391645863, 0.11253820314894954, -0.249820714739904, -0.22840113518281188, 0.16404980736663438, -0.08997899694176875, 0.06017631618943933, 0.07878712331238266, 0.03732692435932384, -0.030183513144873185, -0.2637136230886713, 0.3149526470519398, 0.023558267883395087, 0.3144305360165412, 0.08292897594518552, 0.06272510647509018, -0.04165932352731183, -0.040768103195635015, 0.06658398192965949, -0.08294477696173301, 0.12948224410312634, 0.2953036420205211, 0.1759194027750485, 0.2701570006878409, -0.4604446868578049, -0.25426078745967723, 0.1767293948676973, 0.1480490286604897, 0.13286139635123592, -0.024332933031398905, -0.26926695638374515, 0.10817714236128105, -0.17254483888225952, -0.06529048725975396, -0.1538991767395613, 0.011691554655218879, 0.004118771887103682, -0.22320212111872148, 0.03772115201050613, 0.048458814378572655, 0.10640246413444003, 0.04632838536532315, -0.10329322270691803, -0.026833709971245685, 0.15747975629008032, 0.043987273260925525, -0.01866838498015518, 0.09603864027184039, -0.12323122377162926, -0.14652931078397732, 0.3895866218571589, 0.017147883485798557, -0.21175870014201492, 0.2290626790897589, -0.10019951600466587, -0.1990211727065736, 0.10231456108876083, 0.2316239065911672, 0.09955334039851513, -0.1718818549208713, 0.07064533513198823, -0.033012672869667206, 0.16598842877333295, 0.06119693782856713, 0.07831336154478079, 0.15401375441722673, 0.1606450335262981, 0.06695473089348525, 0.13224186399418938, -0.045829047236833974, -0.0671012800231525, -0.2461345270339859, -0.11726344629088799, -0.23057571040188946, 0.03459298977973609, -0.12555383659591451, -0.14210480410758763, 0.4081226905476149, 0.1625790394402479, 0.1979225801929117, 0.027158347048560693, 0.26545032065151236, 0.05666731663163088, 0.14768543474660065, 0.09771891377789721, 0.194296901356684, 0.0935770266128015, 0.07766283368245278, -0.14573533129112873, 0.10299033390785478, -0.010282449891522834]
|
1,803.06916
|
Simulating the future urban growth in Xiongan New Area: a upcoming big
city in China
|
China made the announement to create the Xiongan New Area in Hebei in April
1,2017. Thus a new magacity about 110km south west of Beijing will emerge.
Xiongan New Area is of great practial significant and historical significant
for transferring Beijing's non-capital function. Simulating the urban dynamics
in Xiongan New Area can help planners to decide where to build the new urban
and further manage the future urban growth. However, only a little research
focus on the future urban development in Xiongan New Area. In addition,
previous models are unable to simulate the urban dynamics in Xiongan New Area.
Because there are no original high density urbna for these models to learn the
transition rules.In this study, we proposed a C-FLUS model to solve such
problems. This framework was implemented by coupling a modified Cellular
automata(CA). An elaborately designed random planted seeds machanism based on
local maximums is addressed in the CA model to better simulate the occurrence
of the new urban. Through an analysis of the current driving forces, the C-FLUS
can detect the potential start zone and simulate the urban development under
different scenarios in Xiongan New Area. Our study shows that the new urban is
most likely to occur in northwest of Xiongxian, and it will rapidly extend to
Rongcheng and Anxin until almost cover the northern part of Xiongan New Area.
Moreover, the method can help planners to evaluate the impact of urban
expansion in Xiongan New Area.
|
physics.soc-ph cs.AI cs.CY
|
china made the announement to create the xiongan new area in hebei in april 12017 thus a new magacity about 110km south west of beijing will emerge xiongan new area is of great practial significant and historical significant for transferring beijings noncapital function simulating the urban dynamics in xiongan new area can help planners to decide where to build the new urban and further manage the future urban growth however only a little research focus on the future urban development in xiongan new area in addition previous models are unable to simulate the urban dynamics in xiongan new area because there are no original high density urbna for these models to learn the transition rulesin this study we proposed a cflus model to solve such problems this framework was implemented by coupling a modified cellular automataca an elaborately designed random planted seeds machanism based on local maximums is addressed in the ca model to better simulate the occurrence of the new urban through an analysis of the current driving forces the cflus can detect the potential start zone and simulate the urban development under different scenarios in xiongan new area our study shows that the new urban is most likely to occur in northwest of xiongxian and it will rapidly extend to rongcheng and anxin until almost cover the northern part of xiongan new area moreover the method can help planners to evaluate the impact of urban expansion in xiongan new area
|
[['china', 'made', 'the', 'announement', 'to', 'create', 'the', 'xiongan', 'new', 'area', 'in', 'hebei', 'in', 'april', '12017', 'thus', 'a', 'new', 'magacity', 'about', '110km', 'south', 'west', 'of', 'beijing', 'will', 'emerge', 'xiongan', 'new', 'area', 'is', 'of', 'great', 'practial', 'significant', 'and', 'historical', 'significant', 'for', 'transferring', 'beijings', 'noncapital', 'function', 'simulating', 'the', 'urban', 'dynamics', 'in', 'xiongan', 'new', 'area', 'can', 'help', 'planners', 'to', 'decide', 'where', 'to', 'build', 'the', 'new', 'urban', 'and', 'further', 'manage', 'the', 'future', 'urban', 'growth', 'however', 'only', 'a', 'little', 'research', 'focus', 'on', 'the', 'future', 'urban', 'development', 'in', 'xiongan', 'new', 'area', 'in', 'addition', 'previous', 'models', 'are', 'unable', 'to', 'simulate', 'the', 'urban', 'dynamics', 'in', 'xiongan', 'new', 'area', 'because', 'there', 'are', 'no', 'original', 'high', 'density', 'urbna', 'for', 'these', 'models', 'to', 'learn', 'the', 'transition', 'rulesin', 'this', 'study', 'we', 'proposed', 'a', 'cflus', 'model', 'to', 'solve', 'such', 'problems', 'this', 'framework', 'was', 'implemented', 'by', 'coupling', 'a', 'modified', 'cellular', 'automataca', 'an', 'elaborately', 'designed', 'random', 'planted', 'seeds', 'machanism', 'based', 'on', 'local', 'maximums', 'is', 'addressed', 'in', 'the', 'ca', 'model', 'to', 'better', 'simulate', 'the', 'occurrence', 'of', 'the', 'new', 'urban', 'through', 'an', 'analysis', 'of', 'the', 'current', 'driving', 'forces', 'the', 'cflus', 'can', 'detect', 'the', 'potential', 'start', 'zone', 'and', 'simulate', 'the', 'urban', 'development', 'under', 'different', 'scenarios', 'in', 'xiongan', 'new', 'area', 'our', 'study', 'shows', 'that', 'the', 'new', 'urban', 'is', 'most', 'likely', 'to', 'occur', 'in', 'northwest', 'of', 'xiongxian', 'and', 'it', 'will', 'rapidly', 'extend', 'to', 'rongcheng', 'and', 'anxin', 'until', 'almost', 'cover', 'the', 'northern', 'part', 'of', 'xiongan', 'new', 'area', 'moreover', 'the', 'method', 'can', 'help', 'planners', 'to', 'evaluate', 'the', 'impact', 'of', 'urban', 'expansion', 'in', 'xiongan', 'new', 'area']]
|
[-0.07440029924353281, 0.08948793112333236, -0.08084031459672944, 0.08618399136871828, -0.08648708437812393, -0.10067377766675276, 0.03973309103723453, 0.3444330441299826, -0.2281839546124937, -0.3146768167015145, 0.11939709508720704, -0.2640824197265117, -0.1771449551365905, 0.23814394216498602, -0.137272968608886, 0.024467098369242865, 0.041009361540352035, -0.0024859983433523905, -3.721207372702496e-05, -0.2470187589890607, 0.26027419759446513, 0.09713062235336427, 0.32698917268451466, 0.09377848570432473, 0.05740853230286713, -0.05037405029465647, -0.056312088118663624, 0.017582561051392036, -0.12341692665501361, 0.14571312536161554, 0.2862166734649256, 0.15314390754489146, 0.3023559259169776, -0.45962884391091113, -0.25245669787210595, 0.09509368396019968, 0.14191832107937205, 0.05511638027838553, -0.04248274331709937, -0.30410005065976925, 0.0647730770596789, -0.18901853415224215, -0.1730863092892358, -0.04280195653681522, 0.019877693606743022, -0.0006020702338149852, -0.2047352930277829, 0.006747616351703587, -0.013310960301643481, 0.0500267729892031, -0.030488262838765007, -0.0915939807497046, 0.009187019828949934, 0.19166012456762077, 0.02282418347692684, 0.055924114906836464, 0.12314129943311539, -0.14321488996068618, -0.10497158073071067, 0.35174778016365094, -0.030981482055200182, -0.12455165513042037, 0.20256301829333256, -0.1510400594677776, -0.16531953912825606, 0.107045687350404, 0.27891061777987963, 0.0694082161553366, -0.2030801390743126, 0.028416502173311764, -0.038152057100998484, 0.13988673068562765, 0.04615952276584247, -0.05254965180014867, 0.2388392300264019, 0.229911581071286, 0.11678127240738831, 0.13077519520631303, -0.1439896026160568, -0.1470818561491678, -0.223246552011646, -0.14288271808510888, -0.1227910090126502, 0.0001231453730724752, -0.05841733053416449, -0.13673539492586353, 0.40062929961135046, 0.20988488505675418, 0.14990923683482993, 0.004838913749984425, 0.2654470090410146, 0.03065410794477667, 0.1074961568593331, 0.09640237013151383, 0.22744998353654924, 0.017392238964448158, 0.1729810820305315, -0.18117379072177953, 0.06848563815912474, 0.00037832371080699173]
|
1,803.06917
|
Universal features of price formation in financial markets: perspectives
from Deep Learning
|
Using a large-scale Deep Learning approach applied to a high-frequency
database containing billions of electronic market quotes and transactions for
US equities, we uncover nonparametric evidence for the existence of a universal
and stationary price formation mechanism relating the dynamics of supply and
demand for a stock, as revealed through the order book, to subsequent
variations in its market price. We assess the model by testing its
out-of-sample predictions for the direction of price moves given the history of
price and order flow, across a wide range of stocks and time periods. The
universal price formation model is shown to exhibit a remarkably stable
out-of-sample prediction accuracy across time, for a wide range of stocks from
different sectors. Interestingly, these results also hold for stocks which are
not part of the training sample, showing that the relations captured by the
model are universal and not asset-specific.
The universal model --- trained on data from all stocks --- outperforms, in
terms of out-of-sample prediction accuracy, asset-specific linear and nonlinear
models trained on time series of any given stock, showing that the universal
nature of price formation weighs in favour of pooling together financial data
from various stocks, rather than designing asset- or sector-specific models as
commonly done. Standard data normalizations based on volatility, price level or
average spread, or partitioning the training data into sectors or categories
such as large/small tick stocks, do not improve training results. On the other
hand, inclusion of price and order flow history over many past observations is
shown to improve forecasting performance, showing evidence of path-dependence
in price dynamics.
|
q-fin.ST q-fin.TR stat.ML
|
using a largescale deep learning approach applied to a highfrequency database containing billions of electronic market quotes and transactions for us equities we uncover nonparametric evidence for the existence of a universal and stationary price formation mechanism relating the dynamics of supply and demand for a stock as revealed through the order book to subsequent variations in its market price we assess the model by testing its outofsample predictions for the direction of price moves given the history of price and order flow across a wide range of stocks and time periods the universal price formation model is shown to exhibit a remarkably stable outofsample prediction accuracy across time for a wide range of stocks from different sectors interestingly these results also hold for stocks which are not part of the training sample showing that the relations captured by the model are universal and not assetspecific the universal model trained on data from all stocks outperforms in terms of outofsample prediction accuracy assetspecific linear and nonlinear models trained on time series of any given stock showing that the universal nature of price formation weighs in favour of pooling together financial data from various stocks rather than designing asset or sectorspecific models as commonly done standard data normalizations based on volatility price level or average spread or partitioning the training data into sectors or categories such as largesmall tick stocks do not improve training results on the other hand inclusion of price and order flow history over many past observations is shown to improve forecasting performance showing evidence of pathdependence in price dynamics
|
[['using', 'a', 'largescale', 'deep', 'learning', 'approach', 'applied', 'to', 'a', 'highfrequency', 'database', 'containing', 'billions', 'of', 'electronic', 'market', 'quotes', 'and', 'transactions', 'for', 'us', 'equities', 'we', 'uncover', 'nonparametric', 'evidence', 'for', 'the', 'existence', 'of', 'a', 'universal', 'and', 'stationary', 'price', 'formation', 'mechanism', 'relating', 'the', 'dynamics', 'of', 'supply', 'and', 'demand', 'for', 'a', 'stock', 'as', 'revealed', 'through', 'the', 'order', 'book', 'to', 'subsequent', 'variations', 'in', 'its', 'market', 'price', 'we', 'assess', 'the', 'model', 'by', 'testing', 'its', 'outofsample', 'predictions', 'for', 'the', 'direction', 'of', 'price', 'moves', 'given', 'the', 'history', 'of', 'price', 'and', 'order', 'flow', 'across', 'a', 'wide', 'range', 'of', 'stocks', 'and', 'time', 'periods', 'the', 'universal', 'price', 'formation', 'model', 'is', 'shown', 'to', 'exhibit', 'a', 'remarkably', 'stable', 'outofsample', 'prediction', 'accuracy', 'across', 'time', 'for', 'a', 'wide', 'range', 'of', 'stocks', 'from', 'different', 'sectors', 'interestingly', 'these', 'results', 'also', 'hold', 'for', 'stocks', 'which', 'are', 'not', 'part', 'of', 'the', 'training', 'sample', 'showing', 'that', 'the', 'relations', 'captured', 'by', 'the', 'model', 'are', 'universal', 'and', 'not', 'assetspecific', 'the', 'universal', 'model', 'trained', 'on', 'data', 'from', 'all', 'stocks', 'outperforms', 'in', 'terms', 'of', 'outofsample', 'prediction', 'accuracy', 'assetspecific', 'linear', 'and', 'nonlinear', 'models', 'trained', 'on', 'time', 'series', 'of', 'any', 'given', 'stock', 'showing', 'that', 'the', 'universal', 'nature', 'of', 'price', 'formation', 'weighs', 'in', 'favour', 'of', 'pooling', 'together', 'financial', 'data', 'from', 'various', 'stocks', 'rather', 'than', 'designing', 'asset', 'or', 'sectorspecific', 'models', 'as', 'commonly', 'done', 'standard', 'data', 'normalizations', 'based', 'on', 'volatility', 'price', 'level', 'or', 'average', 'spread', 'or', 'partitioning', 'the', 'training', 'data', 'into', 'sectors', 'or', 'categories', 'such', 'as', 'largesmall', 'tick', 'stocks', 'do', 'not', 'improve', 'training', 'results', 'on', 'the', 'other', 'hand', 'inclusion', 'of', 'price', 'and', 'order', 'flow', 'history', 'over', 'many', 'past', 'observations', 'is', 'shown', 'to', 'improve', 'forecasting', 'performance', 'showing', 'evidence', 'of', 'pathdependence', 'in', 'price', 'dynamics']]
|
[-0.052341221264885884, 0.04362652527902705, -0.10730656311542798, 0.11909400218864903, -0.08236263030602668, -0.13163908150656006, 0.11108600488089276, 0.41625658421992107, -0.2643737027636514, -0.31383817218817195, 0.14021898663172927, -0.2849119980921387, -0.107457466604403, 0.2342296359653119, -0.08636113253216116, 0.03059766736562149, 0.07530120580878037, 0.025701155073385544, 0.013579210376617714, -0.3222095228480892, 0.24450723314657807, 0.04543865813343123, 0.32094341033639817, 0.029494110346646406, 0.11856814316466066, -0.02243925072521401, -0.06664886849735362, 0.02018880701910418, -0.10908310281928817, 0.14219205806998966, 0.2753207740520828, 0.09664682226362996, 0.3060620847238729, -0.4360617205275328, -0.2048955726267125, 0.13036819473356726, 0.06336493617452037, 0.031627063252157174, 0.027087169039385538, -0.2627764799345571, 0.03225885565356853, -0.23343426536034362, -0.05824754045237429, -0.1351301341317594, 0.02554240487784577, 0.025208507848975176, -0.29905279371171045, 0.10323516120137916, 0.04697815517518813, 0.06995206565535717, -0.06932876712123219, -0.09581317185030247, -0.0822662483206771, 0.15603843594256503, 0.13515643270657166, -0.053125705346442724, 0.14518252719874278, -0.1659751802109755, -0.17057802082205084, 0.37861679558140726, -0.09274243828152136, -0.1154158257950957, 0.15109277468223947, -0.14094797392519048, -0.11412350235824796, 0.09260639895700688, 0.22191532280278178, 0.034714773717300536, -0.15426713028707756, 0.02734224102101647, -0.03925402461945151, 0.2182491015436916, 0.07911826078891933, -0.01002560355879653, 0.20532218644870087, 0.21565323017465954, 0.06202580286615277, 0.07962686282631834, -0.08387871933205483, -0.182404202915943, -0.24751110478805807, -0.10256429811079915, -0.15012172000267757, 0.02726636412928481, -0.17369605794934054, -0.17082370459706558, 0.42477120345171826, 0.17104375487050186, 0.18134528741938993, 0.11642828648753213, 0.25082533872404245, 0.06887355939386627, 0.050309595069848, 0.10174725829229618, 0.15394226073000866, -0.017609990445914894, 0.12740949190785894, -0.14560280411298243, 0.1868606493754599, 0.020266314435642786]
|
1,803.06918
|
Correcting Observation Model Error in Data Assimilation
|
Standard methods of data assimilation assume prior knowledge of a model that
describes the system dynamics and an observation function that maps the model
state to a predicted output. An accurate mapping from model state to
observation space is crucial in filtering schemes when adjusting the estimate
of the system state during the filter's analysis step. However, in many
applications the true observation function may be unknown and the available
observation model may have significant errors, resulting in a suboptimal state
estimate. We propose a method for observation model error correction within the
filtering framework. The procedure involves an alternating minimization
algorithm used to iteratively update a given observation function to increase
consistency with the model and prior observations, using ideas from attractor
reconstruction. The method is demonstrated on the Lorenz 1963 and Lorenz 1996
models, and on a single-column radiative transfer model with multicloud
parameterization.
|
math.DS physics.data-an
|
standard methods of data assimilation assume prior knowledge of a model that describes the system dynamics and an observation function that maps the model state to a predicted output an accurate mapping from model state to observation space is crucial in filtering schemes when adjusting the estimate of the system state during the filters analysis step however in many applications the true observation function may be unknown and the available observation model may have significant errors resulting in a suboptimal state estimate we propose a method for observation model error correction within the filtering framework the procedure involves an alternating minimization algorithm used to iteratively update a given observation function to increase consistency with the model and prior observations using ideas from attractor reconstruction the method is demonstrated on the lorenz 1963 and lorenz 1996 models and on a singlecolumn radiative transfer model with multicloud parameterization
|
[['standard', 'methods', 'of', 'data', 'assimilation', 'assume', 'prior', 'knowledge', 'of', 'a', 'model', 'that', 'describes', 'the', 'system', 'dynamics', 'and', 'an', 'observation', 'function', 'that', 'maps', 'the', 'model', 'state', 'to', 'a', 'predicted', 'output', 'an', 'accurate', 'mapping', 'from', 'model', 'state', 'to', 'observation', 'space', 'is', 'crucial', 'in', 'filtering', 'schemes', 'when', 'adjusting', 'the', 'estimate', 'of', 'the', 'system', 'state', 'during', 'the', 'filters', 'analysis', 'step', 'however', 'in', 'many', 'applications', 'the', 'true', 'observation', 'function', 'may', 'be', 'unknown', 'and', 'the', 'available', 'observation', 'model', 'may', 'have', 'significant', 'errors', 'resulting', 'in', 'a', 'suboptimal', 'state', 'estimate', 'we', 'propose', 'a', 'method', 'for', 'observation', 'model', 'error', 'correction', 'within', 'the', 'filtering', 'framework', 'the', 'procedure', 'involves', 'an', 'alternating', 'minimization', 'algorithm', 'used', 'to', 'iteratively', 'update', 'a', 'given', 'observation', 'function', 'to', 'increase', 'consistency', 'with', 'the', 'model', 'and', 'prior', 'observations', 'using', 'ideas', 'from', 'attractor', 'reconstruction', 'the', 'method', 'is', 'demonstrated', 'on', 'the', 'lorenz', '1963', 'and', 'lorenz', '1996', 'models', 'and', 'on', 'a', 'singlecolumn', 'radiative', 'transfer', 'model', 'with', 'multicloud', 'parameterization']]
|
[-0.05442726485309995, 0.01409598248514382, -0.12055694952300966, 0.052242643769179815, -0.042478990109560834, -0.15204362511915498, 0.0778494070902824, 0.38134845256907485, -0.28118374623511344, -0.3759116978856595, 0.12607780195954446, -0.25036518795619883, -0.17180224001162034, 0.17977992485577163, -0.06677391753398035, 0.09180748888470028, 0.13380292986443088, 0.0036558092935393524, -0.06835006971282195, -0.2031594003871249, 0.2549657721968674, 0.08664101953554439, 0.31160038812341145, -0.046511613444922724, 0.15680206613375947, 0.02764733072150218, -0.056004877549864045, -0.04090005453785225, -0.10219340810397949, 0.08683266423719183, 0.1916764860239236, 0.16086811786804553, 0.289163089602905, -0.39003233897997297, -0.2685828917493967, 0.10567324836929776, 0.11994118395912116, 0.1575188928360298, -0.019936215291150576, -0.292618623213868, 0.01638897514761719, -0.17892202731996953, -0.08076065625000285, -0.0939144105522906, -0.02237824151892062, -0.0304242995980655, -0.3440927654629962, 0.07007067736911217, 0.04275029940428595, 0.011190492206903761, -0.11829837901543265, -0.0986624815268442, -0.002098132479833822, 0.11489365702875322, 0.030188572545988765, 0.0704872054015988, 0.11580505630971022, -0.12805961272105165, -0.11701484531648967, 0.32416805807399013, -0.10235988986614632, -0.21078851382720143, 0.14791127766342196, -0.07086683469122812, -0.12169060128986554, 0.13764640116387952, 0.20012864157276816, 0.10295356723658536, -0.15294095790478135, 0.05199380169665658, -0.026650779465953373, 0.20848538934840016, -0.04765493223485091, -0.04452803192583665, 0.16081897511580728, 0.18975605240908183, 0.06254016214220989, 0.11370360730566748, -0.10241729788915159, -0.10769285595806775, -0.2882720066923393, -0.10462209753752351, -0.21312703322045096, -0.015426596705578523, -0.06364191144540163, -0.14612682686149053, 0.3976726471478349, 0.20702839421414554, 0.21483214120125424, 0.028769693445822555, 0.33689325580003426, 0.13958802446722984, 0.05210147241420712, 0.07707972077601781, 0.22121872076579713, 0.10548457864206284, 0.08039942052062243, -0.18784678587450787, 0.11468439635961022, 0.08763313166357016]
|
1,803.06919
|
Definition and Identification of Information Storage and Processing
Capabilities as Possible Markers for Turing-universality in Cellular Automata
|
To identify potential universal cellular automata, a method is developed to
measure information processing capacity of elementary cellular automata. We
consider two features of cellular automata: Ability to store information, and
ability to process information. We define local collections of cells as
particles of cellular automata and consider information contained by particles.
By using this method, information channels and channels' intersections can be
shown. By observing these two features, potential universal cellular automata
are classified into a certain class, and all elementary cellular automata can
be classified into four groups, which correspond to S. Wolfram's four classes:
1) Homogeneous; 2) Regular; 3) Chaotic and 4) Complex. This result shows that
using abilities of store and processing information to characterize complex
systems is effective and succinct. And it is found that these abilities are
capable of quantifying the complexity of systems.
|
nlin.CG
|
to identify potential universal cellular automata a method is developed to measure information processing capacity of elementary cellular automata we consider two features of cellular automata ability to store information and ability to process information we define local collections of cells as particles of cellular automata and consider information contained by particles by using this method information channels and channels intersections can be shown by observing these two features potential universal cellular automata are classified into a certain class and all elementary cellular automata can be classified into four groups which correspond to s wolframs four classes 1 homogeneous 2 regular 3 chaotic and 4 complex this result shows that using abilities of store and processing information to characterize complex systems is effective and succinct and it is found that these abilities are capable of quantifying the complexity of systems
|
[['to', 'identify', 'potential', 'universal', 'cellular', 'automata', 'a', 'method', 'is', 'developed', 'to', 'measure', 'information', 'processing', 'capacity', 'of', 'elementary', 'cellular', 'automata', 'we', 'consider', 'two', 'features', 'of', 'cellular', 'automata', 'ability', 'to', 'store', 'information', 'and', 'ability', 'to', 'process', 'information', 'we', 'define', 'local', 'collections', 'of', 'cells', 'as', 'particles', 'of', 'cellular', 'automata', 'and', 'consider', 'information', 'contained', 'by', 'particles', 'by', 'using', 'this', 'method', 'information', 'channels', 'and', 'channels', 'intersections', 'can', 'be', 'shown', 'by', 'observing', 'these', 'two', 'features', 'potential', 'universal', 'cellular', 'automata', 'are', 'classified', 'into', 'a', 'certain', 'class', 'and', 'all', 'elementary', 'cellular', 'automata', 'can', 'be', 'classified', 'into', 'four', 'groups', 'which', 'correspond', 'to', 's', 'wolframs', 'four', 'classes', '1', 'homogeneous', '2', 'regular', '3', 'chaotic', 'and', '4', 'complex', 'this', 'result', 'shows', 'that', 'using', 'abilities', 'of', 'store', 'and', 'processing', 'information', 'to', 'characterize', 'complex', 'systems', 'is', 'effective', 'and', 'succinct', 'and', 'it', 'is', 'found', 'that', 'these', 'abilities', 'are', 'capable', 'of', 'quantifying', 'the', 'complexity', 'of', 'systems']]
|
[-0.1323402076716645, 0.1421030805629146, -0.024514830731121557, 0.12441610795676752, -0.04313610813780022, -0.22342613796437424, 0.06570401092592094, 0.36374419847769396, -0.32228910583071413, -0.2810824068263173, 0.10084056408044749, -0.2582881480854537, -0.18596743029525636, 0.17395410295742164, -0.08021202050814671, 0.04075164558099849, 0.03393614523644958, 0.07290571109790887, 0.03416472777524697, -0.25791539639301064, 0.31439654775895176, -0.002725147582324488, 0.29182821461581626, -0.007987610580000495, 0.07405445088765451, -0.022189627730819797, -0.09152968167327344, 0.0670539934221389, -0.08870982300608635, 0.16835153173056563, 0.33291475849691776, 0.2165396153328142, 0.22107204676971637, -0.43598568201331156, -0.26063672730566134, 0.16056051570589522, 0.16514915897444424, 0.08438778643280134, 0.022492673386087906, -0.280711068934761, 0.13088128425380482, -0.17120933723303355, -0.05983367256620633, -0.12677468340843917, 0.046375474357046184, 0.06257164875444557, -0.22796457447776838, -0.03082183499126196, 0.11026451258886871, 0.0717952385677823, -0.0376137401709067, -0.06663824830071202, -0.015449512543688928, 0.17848065930551715, -0.09761626254122738, -0.056201499915083074, 0.1628230470066358, -0.07909988607446264, -0.19335335738890405, 0.38534442457769597, 0.0045914806525356, -0.22456950047552318, 0.2560637860159789, -0.09496463739446231, -0.12239482964921211, 0.17942340946091073, 0.17767380194938076, 0.03297604000461953, -0.20211353914679162, 0.04806559123764081, -0.03139832452205675, 0.18088308568445166, 0.06887862532000456, 0.10025428418469216, 0.20419586101280793, 0.19271942134281353, 0.031445567130244205, 0.1335145316602263, -0.02735618662887386, -0.09926236073619553, -0.19611919922088938, -0.18676449998414943, -0.13404823820954853, 0.04147223229353715, -0.023050871463991436, -0.1194229921315647, 0.380117581758116, 0.118827385521893, 0.14844954629827822, 0.1273409692678667, 0.2581168292539327, 0.043587569572264326, 0.09626185067214205, 0.06798676436135014, 0.08275176779300507, 0.14382874676791418, 0.09327866115075137, -0.14979700735171458, 0.011939539397800607, 0.10259508583029466]
|
1,803.0692
|
On the Keldysh Problem of Flutter Suppression
|
This work is devoted to the Keldysh model of flutter suppression and rigorous
approaches to its analysis. To solve the stabilization problem in the Keldysh
model we use an analog of direct Lyapunov method for differential inclusions.
The results obtained here are compared with the results of Keldysh obtained by
the method of harmonic balance (describing function method), which is an
approximate method for analyzing the existence of periodic solutions. The
limitations of the use of describing function method for the study of systems
with dry friction and stationary segment are demonstrated.
|
nlin.CD math.DS
|
this work is devoted to the keldysh model of flutter suppression and rigorous approaches to its analysis to solve the stabilization problem in the keldysh model we use an analog of direct lyapunov method for differential inclusions the results obtained here are compared with the results of keldysh obtained by the method of harmonic balance describing function method which is an approximate method for analyzing the existence of periodic solutions the limitations of the use of describing function method for the study of systems with dry friction and stationary segment are demonstrated
|
[['this', 'work', 'is', 'devoted', 'to', 'the', 'keldysh', 'model', 'of', 'flutter', 'suppression', 'and', 'rigorous', 'approaches', 'to', 'its', 'analysis', 'to', 'solve', 'the', 'stabilization', 'problem', 'in', 'the', 'keldysh', 'model', 'we', 'use', 'an', 'analog', 'of', 'direct', 'lyapunov', 'method', 'for', 'differential', 'inclusions', 'the', 'results', 'obtained', 'here', 'are', 'compared', 'with', 'the', 'results', 'of', 'keldysh', 'obtained', 'by', 'the', 'method', 'of', 'harmonic', 'balance', 'describing', 'function', 'method', 'which', 'is', 'an', 'approximate', 'method', 'for', 'analyzing', 'the', 'existence', 'of', 'periodic', 'solutions', 'the', 'limitations', 'of', 'the', 'use', 'of', 'describing', 'function', 'method', 'for', 'the', 'study', 'of', 'systems', 'with', 'dry', 'friction', 'and', 'stationary', 'segment', 'are', 'demonstrated']]
|
[-0.09819944117866132, 0.0006044478558697333, -0.11111784250596943, 0.03313403853605015, -0.030206108587267605, -0.09675704937367498, 0.023923793114195374, 0.3360737028162238, -0.2527548268629724, -0.27208044023617456, 0.08643021047717649, -0.2687566808435013, -0.1999583984522716, 0.26875128722041036, -0.026582037478320948, 0.11666473415212038, 0.059930678760713854, -0.021203370501651712, -0.0689330932876581, -0.196987588059805, 0.34142517231647734, 0.015104206745214153, 0.28131866722074134, 0.05676051732355162, 0.1159208343445283, 0.01773733586963752, -0.0556852244455671, 0.027986244794548205, -0.16296497319126502, 0.1534611350393591, 0.1902795353823382, 0.05423669751895511, 0.295638589816087, -0.42156695076466905, -0.20973677821862308, 0.05677642204555804, 0.12991255609845015, 0.14266346263289248, -0.03160552341875661, -0.2863716003485024, 0.0979221421951914, -0.15763097720058716, -0.18563152236722247, -0.10090846312485392, -0.006986613719440673, 0.04383155799460719, -0.28506441240239405, 0.10117744179644986, 0.05138848428411976, 0.04044533660319006, -0.12762049951150245, -0.061102879476612026, 0.027057751142622335, 0.11316595673966019, 0.05841713819055534, 0.0024818735926047616, 0.10243705209628072, -0.12555093658612232, -0.10191133487767176, 0.3537200025242308, -0.06080270655777143, -0.24805363031792577, 0.15668666256976355, -0.08826868797389223, -0.08252706406030642, 0.13738040975927698, 0.16223819194989197, 0.18353995360919964, -0.2024368006715794, 0.06204451435706173, -0.018931399970112936, 0.11914567135618595, 0.03899635219663058, -0.04215667945960456, 0.1307722444990245, 0.22515855911795213, 0.07787083329268447, 0.17402118518594248, -0.054828100503073074, -0.13348923237872837, -0.28932210879967263, -0.15299206070029986, -0.19517599930986762, -0.015953825410890757, -0.038362957798476004, -0.19485166820737979, 0.391341886645102, 0.1750123144188167, 0.15557379491181803, 0.09297753451265516, 0.33296433586687985, 0.2220487154453345, 0.0050776281764821915, -0.012975056761997226, 0.24160299349181436, 0.19267766554232524, 0.10017512674929331, -0.29071822227991145, 0.0169332927047356, 0.1278323680061199]
|
1,803.06921
|
Approximating Flexibility in Distributed Energy Resources: A Geometric
Approach
|
With increasing availability of communication and control infrastructure at
the distribution systems, it is expected that the distributed energy resources
(DERs) will take an active part in future power systems operations. One of the
main challenges associated with integration of DERs in grid planning and
control is in estimating the available flexibility in a collection of
(heterogeneous) DERs, each of which may have local constraints that vary over
time. In this work, we present a geometric approach for approximating the
flexibility of a DER in modulating its active and reactive power consumption.
The proposed method is agnostic about the type and model of the DERs, thereby
facilitating a plug-and-play approach, and allows scalable aggregation of the
flexibility of a collection of (heterogeneous) DERs at the distributed system
level. Simulation results are presented to demonstrate the performance of the
proposed method.
|
cs.SY math.OC
|
with increasing availability of communication and control infrastructure at the distribution systems it is expected that the distributed energy resources ders will take an active part in future power systems operations one of the main challenges associated with integration of ders in grid planning and control is in estimating the available flexibility in a collection of heterogeneous ders each of which may have local constraints that vary over time in this work we present a geometric approach for approximating the flexibility of a der in modulating its active and reactive power consumption the proposed method is agnostic about the type and model of the ders thereby facilitating a plugandplay approach and allows scalable aggregation of the flexibility of a collection of heterogeneous ders at the distributed system level simulation results are presented to demonstrate the performance of the proposed method
|
[['with', 'increasing', 'availability', 'of', 'communication', 'and', 'control', 'infrastructure', 'at', 'the', 'distribution', 'systems', 'it', 'is', 'expected', 'that', 'the', 'distributed', 'energy', 'resources', 'ders', 'will', 'take', 'an', 'active', 'part', 'in', 'future', 'power', 'systems', 'operations', 'one', 'of', 'the', 'main', 'challenges', 'associated', 'with', 'integration', 'of', 'ders', 'in', 'grid', 'planning', 'and', 'control', 'is', 'in', 'estimating', 'the', 'available', 'flexibility', 'in', 'a', 'collection', 'of', 'heterogeneous', 'ders', 'each', 'of', 'which', 'may', 'have', 'local', 'constraints', 'that', 'vary', 'over', 'time', 'in', 'this', 'work', 'we', 'present', 'a', 'geometric', 'approach', 'for', 'approximating', 'the', 'flexibility', 'of', 'a', 'der', 'in', 'modulating', 'its', 'active', 'and', 'reactive', 'power', 'consumption', 'the', 'proposed', 'method', 'is', 'agnostic', 'about', 'the', 'type', 'and', 'model', 'of', 'the', 'ders', 'thereby', 'facilitating', 'a', 'plugandplay', 'approach', 'and', 'allows', 'scalable', 'aggregation', 'of', 'the', 'flexibility', 'of', 'a', 'collection', 'of', 'heterogeneous', 'ders', 'at', 'the', 'distributed', 'system', 'level', 'simulation', 'results', 'are', 'presented', 'to', 'demonstrate', 'the', 'performance', 'of', 'the', 'proposed', 'method']]
|
[-0.17408976441116206, 0.04324216697724686, -0.038629033399878866, -0.038745749660301955, -0.0459968610267554, -0.13135292868662093, 0.06713655982665452, 0.3707213799602219, -0.2968090559322653, -0.3361421420471743, 0.08542778939507635, -0.24105847324255072, -0.0966600664388222, 0.22542660650173535, -0.10814100427420012, 0.06430853677073693, 0.04833838941662439, -0.012047924562024751, -0.0012903578645948853, -0.24875919685832093, 0.26540670880889855, 0.11645517951941915, 0.33865385111255036, 0.03791262044687756, 0.11972566727282745, -0.0048136003049356595, -0.0477378984979753, 0.015105490135361574, -0.04167226361907004, 0.2412582188196081, 0.28709958629083954, 0.15138044730660372, 0.36327985444638344, -0.4280111079686321, -0.2317551965742106, 0.0875653959444857, 0.14143508322470422, 0.05115090471808799, -0.04929567083350516, -0.2223892133283828, 0.10039560746393233, -0.24014951126383885, -0.11866267669580079, -0.07532136606917317, -0.009253727598115801, 0.10998401025177112, -0.29594260353062835, 0.019422397638637838, 0.04346274641408984, 0.043960471690765446, -0.09626178828059762, -0.07193922162904139, -0.020826365020392198, 0.15265127179279392, -0.02183666725094164, -0.04954120655706252, 0.15263812517348144, -0.12245373401757596, -0.117116747129642, 0.3880780319151069, 0.02636441283559959, -0.19696139136628646, 0.16512773729461644, -0.05946734324762864, -0.13772067324524478, 0.12314920845175428, 0.24543651271212313, 0.08499478666344658, -0.17015309919869262, 0.08368160071840976, 0.040070424408518844, 0.16380089457878577, -0.012505644558197153, 0.03867012105183676, 0.18437832904746757, 0.24730740738367396, 0.14735622864016998, 0.13122862498442242, -0.059845961562574046, -0.13333281785848417, -0.2854986350351412, -0.17020372007308263, -0.19676125036286457, -0.018878993152507715, -0.09166809514645138, -0.12269049742421236, 0.418771433650649, 0.17144289619838154, 0.1437690633881305, 0.0830873797822278, 0.37165317830762695, 0.10465348340304835, 0.07798780917323062, 0.10470073151601744, 0.16862381655955688, 0.021235796050833804, 0.16429671571573376, -0.24193177437409757, 0.0869771176067713, -0.033979396455522094]
|
1,803.06922
|
Approximation of Some Multivariate Risk Measures for Gaussian Risks
|
Gaussian random vectors exhibit the loss of dimension phenomena, which relate
to their joint survival tail behaviour. Besides, the fact that the components
of such vectors are light-tailed complicates the approximations of various
multivariate risk measures significantly. In this contribution we derive
precise approximations of marginal mean excess, marginal expected shortfall and
multivariate conditional tail expectation of Gaussian random vectors and
highlight links with conditional limit theorems. Our study indicates that
similar results hold for elliptical and Gaussian like multivariate risks.
|
q-fin.RM math.PR
|
gaussian random vectors exhibit the loss of dimension phenomena which relate to their joint survival tail behaviour besides the fact that the components of such vectors are lighttailed complicates the approximations of various multivariate risk measures significantly in this contribution we derive precise approximations of marginal mean excess marginal expected shortfall and multivariate conditional tail expectation of gaussian random vectors and highlight links with conditional limit theorems our study indicates that similar results hold for elliptical and gaussian like multivariate risks
|
[['gaussian', 'random', 'vectors', 'exhibit', 'the', 'loss', 'of', 'dimension', 'phenomena', 'which', 'relate', 'to', 'their', 'joint', 'survival', 'tail', 'behaviour', 'besides', 'the', 'fact', 'that', 'the', 'components', 'of', 'such', 'vectors', 'are', 'lighttailed', 'complicates', 'the', 'approximations', 'of', 'various', 'multivariate', 'risk', 'measures', 'significantly', 'in', 'this', 'contribution', 'we', 'derive', 'precise', 'approximations', 'of', 'marginal', 'mean', 'excess', 'marginal', 'expected', 'shortfall', 'and', 'multivariate', 'conditional', 'tail', 'expectation', 'of', 'gaussian', 'random', 'vectors', 'and', 'highlight', 'links', 'with', 'conditional', 'limit', 'theorems', 'our', 'study', 'indicates', 'that', 'similar', 'results', 'hold', 'for', 'elliptical', 'and', 'gaussian', 'like', 'multivariate', 'risks']]
|
[-0.05798341340764805, 0.08053615092541333, -0.13961177623405316, 0.20074736246017072, -0.027825971335218646, -0.11421659275139165, 0.06992031774127189, 0.38779790290159943, -0.2370820872005604, -0.19970796035924626, 0.0748993674405264, -0.29403161049969956, -0.17057507770296967, 0.14971135651842218, -0.1274277525436547, 0.11293204836576119, 0.02595966669190445, 0.008359928534906587, -0.07200037987534831, -0.27113488047487205, 0.31063024994319327, 0.049923201758460496, 0.35021996608486883, -0.04846273726111071, 0.0913600268267831, 0.07936280639842153, -0.10597171289501367, -0.03293593166493753, -0.10887818619192802, 0.15491365483691802, 0.22446435468844828, 0.13803016945409277, 0.28960913945173405, -0.3710531985939101, -0.22690060117316466, 0.19928309969448796, 0.11680456033884835, 0.018008748372660283, 0.0429428984399563, -0.27232981675568924, 0.025948865845063587, -0.18530187071703466, -0.1951831085262475, -0.09759065207024967, -0.014182015471620324, 0.09907060752070888, -0.3417704382819342, 0.17625934417348033, 0.14835420416461098, 0.05741146784045814, -0.027528169300453164, -0.22487291870753706, 0.024797102846032766, 0.07222216564696282, 0.15422184108526527, -0.042465934841060024, 0.15349251936753222, -0.14052668456160636, -0.1320821932045582, 0.2641147328943106, -0.07466929459967363, -0.2269313468793292, 0.17918581783808882, -0.2094813600803415, -0.16900161749763806, 0.12419594905948565, 0.22459033806520848, 0.020301609463920747, -0.1674097718155, 0.05223564559056274, -0.04115889836562636, 0.06266788317373505, 0.0695886987025769, 0.11505759050379749, 0.1821389920135707, 0.032280959338409666, 0.08615707030818427, 0.16276254178668706, -0.1228530963215931, -0.1569616710537194, -0.2936417684533898, -0.1352337093759374, -0.19383533243204892, 0.026137032109186237, -0.22783951672820954, -0.23977349023622127, 0.3404556302882639, 0.17525505802283683, 0.23413111453438984, 0.20523763112407636, 0.24529718605364548, 0.18650527854585147, -0.024100377221511288, 0.08837813800085842, 0.1611450376265027, 0.1681040205107427, 0.025067724666937633, -0.1239874297178086, 0.2143824196731051, -0.016684230210052595]
|
1,803.06923
|
Spontaneous symmetry breaking and Higgs mode: comparing Gross-Pitaevskii
and nonlinear Klein-Gordon equations
|
We discuss the mechanism of spontaneous symmetry breaking and the elementary
excitations for a weakly-interacting Bose gas at finite temperature. We
consider both the non-relativistic case, described by the Gross-Pitaevskii
equation, and the relativistic one, described by the cubic nonlinear
Klein-Gordon equation. We analyze similarities and differences in the two
equations and, in particular, in the phase and amplitude modes (i.e. Goldstone
and Higgs modes) of the bosonic matter field. We show that the coupling between
phase and amplitude modes gives rise to a single gapless Bogoliubov spectrum in
the non-relativistic case. Instead, in the relativistic case the spectrum has
two branches: one is gapless and the other is gapped. In the non-relativistic
limit we find that the relativistic spectrum reduces to the Bogoliubov one.
Finally, as an application of the above analysis, we consider the Bose-Hubbard
model close to the superfluid-Mott quantum phase transition and we investigate
the elementary excitations of its effective action, which contains both
non-relativistic and relativistic terms.
|
cond-mat.quant-gas
|
we discuss the mechanism of spontaneous symmetry breaking and the elementary excitations for a weaklyinteracting bose gas at finite temperature we consider both the nonrelativistic case described by the grosspitaevskii equation and the relativistic one described by the cubic nonlinear kleingordon equation we analyze similarities and differences in the two equations and in particular in the phase and amplitude modes ie goldstone and higgs modes of the bosonic matter field we show that the coupling between phase and amplitude modes gives rise to a single gapless bogoliubov spectrum in the nonrelativistic case instead in the relativistic case the spectrum has two branches one is gapless and the other is gapped in the nonrelativistic limit we find that the relativistic spectrum reduces to the bogoliubov one finally as an application of the above analysis we consider the bosehubbard model close to the superfluidmott quantum phase transition and we investigate the elementary excitations of its effective action which contains both nonrelativistic and relativistic terms
|
[['we', 'discuss', 'the', 'mechanism', 'of', 'spontaneous', 'symmetry', 'breaking', 'and', 'the', 'elementary', 'excitations', 'for', 'a', 'weaklyinteracting', 'bose', 'gas', 'at', 'finite', 'temperature', 'we', 'consider', 'both', 'the', 'nonrelativistic', 'case', 'described', 'by', 'the', 'grosspitaevskii', 'equation', 'and', 'the', 'relativistic', 'one', 'described', 'by', 'the', 'cubic', 'nonlinear', 'kleingordon', 'equation', 'we', 'analyze', 'similarities', 'and', 'differences', 'in', 'the', 'two', 'equations', 'and', 'in', 'particular', 'in', 'the', 'phase', 'and', 'amplitude', 'modes', 'ie', 'goldstone', 'and', 'higgs', 'modes', 'of', 'the', 'bosonic', 'matter', 'field', 'we', 'show', 'that', 'the', 'coupling', 'between', 'phase', 'and', 'amplitude', 'modes', 'gives', 'rise', 'to', 'a', 'single', 'gapless', 'bogoliubov', 'spectrum', 'in', 'the', 'nonrelativistic', 'case', 'instead', 'in', 'the', 'relativistic', 'case', 'the', 'spectrum', 'has', 'two', 'branches', 'one', 'is', 'gapless', 'and', 'the', 'other', 'is', 'gapped', 'in', 'the', 'nonrelativistic', 'limit', 'we', 'find', 'that', 'the', 'relativistic', 'spectrum', 'reduces', 'to', 'the', 'bogoliubov', 'one', 'finally', 'as', 'an', 'application', 'of', 'the', 'above', 'analysis', 'we', 'consider', 'the', 'bosehubbard', 'model', 'close', 'to', 'the', 'superfluidmott', 'quantum', 'phase', 'transition', 'and', 'we', 'investigate', 'the', 'elementary', 'excitations', 'of', 'its', 'effective', 'action', 'which', 'contains', 'both', 'nonrelativistic', 'and', 'relativistic', 'terms']]
|
[-0.17229175193696628, 0.22256013240428416, -0.08446689447054616, 0.0958646446161754, -0.03630587516674473, -0.14113225697907678, 0.009109369759378885, 0.30397933523780035, -0.2245091089812096, -0.2291207311467992, 0.01414215077076935, -0.329147550455628, -0.11793294757170557, 0.12945749723772162, 0.058334557882101956, 0.01812821769200116, -0.0232456854061672, 0.06484598847232576, -0.09786677366283572, -0.17832199751146505, 0.33947668668388586, -0.010395505743670382, 0.2831326299476334, 0.05298780081046308, 0.07004119233259885, 0.03549369113278334, 0.05967533028466098, -0.038136758318423856, -0.13185916948004664, 0.024054832917488653, 0.20344202090227217, -0.009949726248045026, 0.18596879676858216, -0.4267533510854399, -0.22064238653322796, 0.0768724144652003, 0.18007646386086204, 0.1902415230546871, -0.03176812291789202, -0.29744835433199496, -0.008399161827077882, -0.19702351946501567, -0.18304191939072845, -0.08435838092635903, -0.015887427140159508, -0.047279612339435166, -0.20234495721165274, 0.1371005850398186, 0.0805687883719342, 0.01490548537630174, -0.08257530380491696, -0.04510739930462736, -0.04597554231108523, 0.04289176056943374, 0.06850960544802041, -0.0228535200686217, 0.07990499096706992, -0.19655637360694617, -0.09606090173941612, 0.45605285463417755, -0.1273864970645252, -0.17188638001306694, 0.19098598897503113, -0.16597977424626825, -0.09435171517974662, 0.12603045179635103, 0.13688477113006497, 0.0833253358134333, -0.103582321189022, 0.14333772020823002, -0.025817331558317638, 0.1323004190315619, 0.0275023271628644, 0.06131807533035308, 0.2332311212070815, 0.12295632787410998, -0.0013226954134204138, 0.17268827391456365, -0.07850881260934711, -0.15330321209240752, -0.3533394200336418, -0.1540582983561987, -0.1750924838821829, 0.00614576583892038, -0.05302644270543371, -0.15191541654977625, 0.4426369862789058, 0.1398079732524944, 0.16676476498617343, 0.007025395451763208, 0.2639648531747545, 0.21047332302744812, -0.00952859515795645, 0.07935167585764034, 0.2995901040698367, 0.1685267401267027, 0.07692019206207291, -0.31153923496718944, -0.12232232524691448, 0.10290497997028317]
|
1,803.06924
|
Cloud Workload Prediction based on Workflow Execution Time Discrepancies
|
Infrastructure as a service clouds hide the complexity of maintaining the
physical infrastructure with a slight disadvantage: they also hide their
internal working details. Should users need knowledge about these details e.g.,
to increase the reliability or performance of their applications, they would
need solutions to detect behavioural changes in the underlying system. Existing
runtime solutions for such purposes offer limited capabilities as they are
mostly restricted to revealing weekly or yearly behavioural periodicity in the
infrastructure. This article proposes a technique for predicting generic
background workload by means of simulations that are capable of providing
additional knowledge of the underlying private cloud systems in order to
support activities like cloud orchestration or workflow enactment. Our
technique uses long-running scientific workflows and their behaviour
discrepancies and tries to replicate these in a simulated cloud with known
(trace-based) workloads. We argue that the better we can mimic the current
discrepancies the better we can tell expected workloads in the near future on
the real life cloud. We evaluated the proposed prediction approach with a
biochemical application on both real and simulated cloud infrastructures. The
proposed algorithm has shown to produce significantly (~20%) better workload
predictions for the future of simulated clouds than random workload selection.
|
cs.DC
|
infrastructure as a service clouds hide the complexity of maintaining the physical infrastructure with a slight disadvantage they also hide their internal working details should users need knowledge about these details eg to increase the reliability or performance of their applications they would need solutions to detect behavioural changes in the underlying system existing runtime solutions for such purposes offer limited capabilities as they are mostly restricted to revealing weekly or yearly behavioural periodicity in the infrastructure this article proposes a technique for predicting generic background workload by means of simulations that are capable of providing additional knowledge of the underlying private cloud systems in order to support activities like cloud orchestration or workflow enactment our technique uses longrunning scientific workflows and their behaviour discrepancies and tries to replicate these in a simulated cloud with known tracebased workloads we argue that the better we can mimic the current discrepancies the better we can tell expected workloads in the near future on the real life cloud we evaluated the proposed prediction approach with a biochemical application on both real and simulated cloud infrastructures the proposed algorithm has shown to produce significantly 20 better workload predictions for the future of simulated clouds than random workload selection
|
[['infrastructure', 'as', 'a', 'service', 'clouds', 'hide', 'the', 'complexity', 'of', 'maintaining', 'the', 'physical', 'infrastructure', 'with', 'a', 'slight', 'disadvantage', 'they', 'also', 'hide', 'their', 'internal', 'working', 'details', 'should', 'users', 'need', 'knowledge', 'about', 'these', 'details', 'eg', 'to', 'increase', 'the', 'reliability', 'or', 'performance', 'of', 'their', 'applications', 'they', 'would', 'need', 'solutions', 'to', 'detect', 'behavioural', 'changes', 'in', 'the', 'underlying', 'system', 'existing', 'runtime', 'solutions', 'for', 'such', 'purposes', 'offer', 'limited', 'capabilities', 'as', 'they', 'are', 'mostly', 'restricted', 'to', 'revealing', 'weekly', 'or', 'yearly', 'behavioural', 'periodicity', 'in', 'the', 'infrastructure', 'this', 'article', 'proposes', 'a', 'technique', 'for', 'predicting', 'generic', 'background', 'workload', 'by', 'means', 'of', 'simulations', 'that', 'are', 'capable', 'of', 'providing', 'additional', 'knowledge', 'of', 'the', 'underlying', 'private', 'cloud', 'systems', 'in', 'order', 'to', 'support', 'activities', 'like', 'cloud', 'orchestration', 'or', 'workflow', 'enactment', 'our', 'technique', 'uses', 'longrunning', 'scientific', 'workflows', 'and', 'their', 'behaviour', 'discrepancies', 'and', 'tries', 'to', 'replicate', 'these', 'in', 'a', 'simulated', 'cloud', 'with', 'known', 'tracebased', 'workloads', 'we', 'argue', 'that', 'the', 'better', 'we', 'can', 'mimic', 'the', 'current', 'discrepancies', 'the', 'better', 'we', 'can', 'tell', 'expected', 'workloads', 'in', 'the', 'near', 'future', 'on', 'the', 'real', 'life', 'cloud', 'we', 'evaluated', 'the', 'proposed', 'prediction', 'approach', 'with', 'a', 'biochemical', 'application', 'on', 'both', 'real', 'and', 'simulated', 'cloud', 'infrastructures', 'the', 'proposed', 'algorithm', 'has', 'shown', 'to', 'produce', 'significantly', '20', 'better', 'workload', 'predictions', 'for', 'the', 'future', 'of', 'simulated', 'clouds', 'than', 'random', 'workload', 'selection']]
|
[-0.12750563187343206, 0.019620321797179607, -0.07873917336110026, 0.10836222293209193, -0.12055308528372324, -0.12552543448263725, 0.10599554852495774, 0.4154091840044951, -0.23932978014607786, -0.39623937098875495, 0.10881054188254946, -0.26138023048634734, -0.13474447231433884, 0.2103304746115635, -0.11160630883201592, 0.10051664658000364, 0.08138241895871676, 0.024482472934394928, 0.0010449716475490918, -0.29276029071679305, 0.27385013440381917, 0.1012424097063166, 0.30522040178652343, 0.05298995597495734, 0.011584497026085635, -0.046902560922842215, -0.07151375768487067, -0.011461393406623792, -0.042826998840824027, 0.13138609203055882, 0.2968916575374155, 0.23505250517479784, 0.2842544310694268, -0.4881246329339988, -0.2047458178952665, 0.10998709614025703, 0.160962937284685, 0.05229915146871159, -0.03119311265489908, -0.30122703690921854, 0.11222584292380477, -0.18775080054711354, -0.15093384422224893, -0.13172772360257132, -0.032533609932322766, 0.048255553634794966, -0.236297207163172, -0.023071584940743038, 0.0211637851569357, 0.07651538989397094, -0.04855334075446259, -0.10905770897493224, 0.0008790250970324611, 0.18332820263972013, 0.02318428757694075, -0.002482662821992063, 0.2141082808649277, -0.13801149629152326, -0.1385443106107642, 0.42517496863672255, -0.008294179196502013, -0.16402699232019266, 0.2566487274535557, -0.08193126093943183, -0.14026572395289572, 0.10156542273448306, 0.21757913402517956, 0.025513362125767505, -0.15881390063156026, 0.01415582052255095, 0.030650824742099524, 0.19733832750067698, 0.028039325788496154, 0.034949944240461085, 0.2245115026019573, 0.20290218742436492, 0.04876580760202499, 0.09929019915494684, -0.05983910669216558, -0.1310703292632859, -0.22059493526695387, -0.13465807481449754, -0.1313805858440259, 0.024793130567059944, -0.09539174262182297, -0.14007897137344116, 0.3598036095363033, 0.23801890324559247, 0.14988673208617734, 0.07164322082640937, 0.37035832723474826, 0.02474107950247879, 0.11618310318661708, 0.11589271005918729, 0.15102249295815973, -0.03663498682641041, 0.21147613832270543, -0.18109045352321118, 0.16046385198840687, -0.053363033670785966]
|
1,803.06925
|
(Parametrized) First Order Transport Equations: Realization of Optimally
Stable Petrov-Galerkin Methods
|
We consider ultraweak variational formulations for (parametrized) linear
first order transport equations in time and/or space. Computationally feasible
pairs of optimally stable trial and test spaces are presented, starting with a
suitable test space and defining an optimal trial space by the application of
the adjoint operator. As a result, the inf-sup constant is one in the
continuous as well as in the discrete case and the computational realization is
therefore easy. In particular, regarding the latter, we avoid a stabilization
loop within the greedy algorithm when constructing reduced models within the
framework of reduced basis methods. Several numerical experiments demonstrate
the good performance of the new method.
|
math.NA
|
we consider ultraweak variational formulations for parametrized linear first order transport equations in time andor space computationally feasible pairs of optimally stable trial and test spaces are presented starting with a suitable test space and defining an optimal trial space by the application of the adjoint operator as a result the infsup constant is one in the continuous as well as in the discrete case and the computational realization is therefore easy in particular regarding the latter we avoid a stabilization loop within the greedy algorithm when constructing reduced models within the framework of reduced basis methods several numerical experiments demonstrate the good performance of the new method
|
[['we', 'consider', 'ultraweak', 'variational', 'formulations', 'for', 'parametrized', 'linear', 'first', 'order', 'transport', 'equations', 'in', 'time', 'andor', 'space', 'computationally', 'feasible', 'pairs', 'of', 'optimally', 'stable', 'trial', 'and', 'test', 'spaces', 'are', 'presented', 'starting', 'with', 'a', 'suitable', 'test', 'space', 'and', 'defining', 'an', 'optimal', 'trial', 'space', 'by', 'the', 'application', 'of', 'the', 'adjoint', 'operator', 'as', 'a', 'result', 'the', 'infsup', 'constant', 'is', 'one', 'in', 'the', 'continuous', 'as', 'well', 'as', 'in', 'the', 'discrete', 'case', 'and', 'the', 'computational', 'realization', 'is', 'therefore', 'easy', 'in', 'particular', 'regarding', 'the', 'latter', 'we', 'avoid', 'a', 'stabilization', 'loop', 'within', 'the', 'greedy', 'algorithm', 'when', 'constructing', 'reduced', 'models', 'within', 'the', 'framework', 'of', 'reduced', 'basis', 'methods', 'several', 'numerical', 'experiments', 'demonstrate', 'the', 'good', 'performance', 'of', 'the', 'new', 'method']]
|
[-0.08242928876144881, 0.08049691173464116, -0.048163901673871336, 0.09272345623079066, -0.06754953039948035, -0.12523063853883218, 0.05919873322731022, 0.3850797325786617, -0.28518560718469044, -0.27709692000859865, 0.14986497240089294, -0.17440670827852078, -0.1574728252555899, 0.22299080060070586, -0.053520628811653564, 0.12445531141323347, 0.07328078060635124, 0.007894964815393367, -0.12740442960488577, -0.2510008869834969, 0.31006477895641216, 0.04530516046981103, 0.27226065788245585, -0.016335872010569328, 0.13677695676408433, 0.009292050221658967, -0.012675169730317537, 0.03574555510729422, -0.10573780416355778, 0.13263706875753728, 0.2677960447094005, 0.10773423728878023, 0.32452921305472654, -0.41112444211763366, -0.19033799573986065, 0.09382265032467398, 0.12210014131334093, 0.11792281273045335, -0.04704337765859371, -0.26680424427656735, 0.05876768260754438, -0.15675718693226506, -0.14400437363440655, -0.13862187457615854, -0.03962916040931035, 0.0057428612253042285, -0.32058466431098404, 0.04765108048579552, 0.010141450770552856, 0.018672771700140502, -0.10101408138008858, -0.09429704400934968, 0.009670280145386371, 0.0857020702239458, 0.03076414421256804, 0.03659386655393367, 0.05174215086380071, -0.0899987685088827, -0.13276036242799213, 0.41227712509808717, -0.07077497449224918, -0.271339613073333, 0.15580854611471295, -0.07311599614547083, -0.12289735909197824, 0.10187170928758052, 0.16307944997593207, 0.18949225203013392, -0.11365818908652053, 0.11453838481975254, -0.04853448005936419, 0.11676414041883415, 0.044942862990191554, -0.00012434580518553653, 0.09673964743140256, 0.20975447294013402, 0.12865327495253748, 0.14157024258747697, -0.02149303933644357, -0.14466795683310246, -0.3691656372889324, -0.189238233603882, -0.18730052195799848, -0.03499924727819032, -0.10249928299607644, -0.16530078420139574, 0.3743440069611771, 0.13058527192549296, 0.1754450302105397, 0.05320768950817486, 0.3050099490555348, 0.14733471539996876, 0.00738091898124872, 0.062042053081785085, 0.20030080756448485, 0.09461806834615008, 0.048976868451400486, -0.22347126536597325, 0.031079540519621567, 0.12090491084813106]
|
1,803.06926
|
Supersymmetric Solutions of N = (1,1) General Massive Supergravity
|
We construct supersymmetric solutions of three dimensional N = (1,1) General
Massive Supergravity (GMG). Solutions with a null Killing vector are in general
pp-waves. We identify those that appear at critical points of the model some of
which do not exist in N = (1,1) New Massive Supergravity (NMG). In the timelike
case, we find that many solutions are common with NMG but there is a new class
that is genuine to GMG, two members of which are stationary Lifshitz and
timelike squashed AdS spacetimes. We also show that in addition to the fully
supersymmetric AdS vacuum, there is a second AdS background with a non-zero
vector field that preserves 1/4 supersymmetry.
|
hep-th
|
we construct supersymmetric solutions of three dimensional n 11 general massive supergravity gmg solutions with a null killing vector are in general ppwaves we identify those that appear at critical points of the model some of which do not exist in n 11 new massive supergravity nmg in the timelike case we find that many solutions are common with nmg but there is a new class that is genuine to gmg two members of which are stationary lifshitz and timelike squashed ads spacetimes we also show that in addition to the fully supersymmetric ads vacuum there is a second ads background with a nonzero vector field that preserves 14 supersymmetry
|
[['we', 'construct', 'supersymmetric', 'solutions', 'of', 'three', 'dimensional', 'n', '11', 'general', 'massive', 'supergravity', 'gmg', 'solutions', 'with', 'a', 'null', 'killing', 'vector', 'are', 'in', 'general', 'ppwaves', 'we', 'identify', 'those', 'that', 'appear', 'at', 'critical', 'points', 'of', 'the', 'model', 'some', 'of', 'which', 'do', 'not', 'exist', 'in', 'n', '11', 'new', 'massive', 'supergravity', 'nmg', 'in', 'the', 'timelike', 'case', 'we', 'find', 'that', 'many', 'solutions', 'are', 'common', 'with', 'nmg', 'but', 'there', 'is', 'a', 'new', 'class', 'that', 'is', 'genuine', 'to', 'gmg', 'two', 'members', 'of', 'which', 'are', 'stationary', 'lifshitz', 'and', 'timelike', 'squashed', 'ads', 'spacetimes', 'we', 'also', 'show', 'that', 'in', 'addition', 'to', 'the', 'fully', 'supersymmetric', 'ads', 'vacuum', 'there', 'is', 'a', 'second', 'ads', 'background', 'with', 'a', 'nonzero', 'vector', 'field', 'that', 'preserves', '14', 'supersymmetry']]
|
[-0.17888999678490852, 0.15793055814944884, -0.020911486036228864, 0.09996056720847264, -0.10189191339198839, -0.2149047179486264, -0.04433246547864242, 0.33677263649349864, -0.09412872934798626, -0.2403578890402886, 0.10841721112559423, -0.3435629737902094, -0.1881342992228879, 0.12225400780814445, -0.05445694785395806, 0.04632039775394581, 0.0008941899223083799, 0.1054812356067652, -0.10572405800181017, -0.29884060060774736, 0.40329827715388755, -0.0753269492796707, 0.24483666938136925, -0.03917001420632005, 0.10122144853018901, -0.07388334460874003, 0.030320240498986094, 0.05608338859694248, -0.12395014996932745, 0.08589837595989758, 0.23845979109491136, 0.14404772084883669, 0.1717428470877084, -0.3761225040705705, -0.21910697807748378, 0.14579349112040788, 0.19475724879567596, 0.17518574683927, -0.07413011883300814, -0.2334177044029771, 0.1311195955188437, -0.13812246583402157, -0.178290220646357, -0.10287294258913872, 0.014463402533014728, -0.10527368072759022, -0.23967340176247737, 0.097126728641028, 0.027627078007737345, -0.0017143524886870927, -0.10453833266881041, -0.05737336358129555, -0.07960068534805693, 0.030414329122074625, 0.13133453542303125, 0.06638972536152736, 0.052635805164887146, -0.1548203707003929, -0.14681894139132717, 0.34150347172875295, -0.07058623723622243, -0.28225316353650254, 0.22125896362757141, -0.21335068982814184, -0.20028940708037804, 0.13538801764053376, 0.13090804245915602, 0.20019982088018548, -0.15933960815891623, 0.18034264248827556, -0.07225963706997308, 0.11543049082498659, 0.12521176282739774, 0.05073776311262257, 0.25279795368286695, 0.05083690510470081, 0.06002244488600726, 0.12003460070964965, -0.02057791687759825, -0.13381279252035627, -0.43250773328949105, -0.19825112742625856, -0.06776082384061408, 0.09349236654511928, -0.17353216379613678, -0.2286726240915331, 0.3211000125939873, 0.1090601837707006, 0.15206848309714008, 0.0708157372766767, 0.15871231038631364, 0.06608259956437078, 0.09319700485688041, 0.1786273532758721, 0.2949915961904811, 0.05578971259634603, 0.10055758247829297, -0.13607547331617256, -0.16283566045881756, 0.11164964012462984]
|
1,803.06927
|
Ultra Diffuse Galaxies are a Subset of Cluster Dwarf
Elliptical/Spheroidal Galaxies
|
Since 2015 there has been a great deal of interest in a supposed new class of
galaxy called Ultra Diffuse Galaxies (UDGs). These are large systems with sizes
$> 1.5$ kpc and have surface brightness values which are $\mu > 25$ mag
arcsec$^{-2}$. Because of their low-surface brightness they are proposed to be
`failed' Milky Way type galaxies given their similar size, but much lower
stellar masses. As such, these systems are considered by some as a new type of
galaxy, yet we show that they are a subset of a well-established and well
studied population of low-surface brightness galaxies found mostly in dense
areas of the universe - clusters of galaxies. We argue based on previous
literature that the most likely method for forming these galaxies is through
cluster processes such as `Galaxy Harassment', where through multiple high
speed encounters an infalling galaxy is gradually removed of its mass, until it
resembles a dwarf elliptical. Future studies of UDGs should consider the above
and their more general connection to previously studied populations.
|
astro-ph.GA
|
since 2015 there has been a great deal of interest in a supposed new class of galaxy called ultra diffuse galaxies udgs these are large systems with sizes 15 kpc and have surface brightness values which are mu 25 mag arcsec2 because of their lowsurface brightness they are proposed to be failed milky way type galaxies given their similar size but much lower stellar masses as such these systems are considered by some as a new type of galaxy yet we show that they are a subset of a wellestablished and well studied population of lowsurface brightness galaxies found mostly in dense areas of the universe clusters of galaxies we argue based on previous literature that the most likely method for forming these galaxies is through cluster processes such as galaxy harassment where through multiple high speed encounters an infalling galaxy is gradually removed of its mass until it resembles a dwarf elliptical future studies of udgs should consider the above and their more general connection to previously studied populations
|
[['since', '2015', 'there', 'has', 'been', 'a', 'great', 'deal', 'of', 'interest', 'in', 'a', 'supposed', 'new', 'class', 'of', 'galaxy', 'called', 'ultra', 'diffuse', 'galaxies', 'udgs', 'these', 'are', 'large', 'systems', 'with', 'sizes', '15', 'kpc', 'and', 'have', 'surface', 'brightness', 'values', 'which', 'are', 'mu', '25', 'mag', 'arcsec2', 'because', 'of', 'their', 'lowsurface', 'brightness', 'they', 'are', 'proposed', 'to', 'be', 'failed', 'milky', 'way', 'type', 'galaxies', 'given', 'their', 'similar', 'size', 'but', 'much', 'lower', 'stellar', 'masses', 'as', 'such', 'these', 'systems', 'are', 'considered', 'by', 'some', 'as', 'a', 'new', 'type', 'of', 'galaxy', 'yet', 'we', 'show', 'that', 'they', 'are', 'a', 'subset', 'of', 'a', 'wellestablished', 'and', 'well', 'studied', 'population', 'of', 'lowsurface', 'brightness', 'galaxies', 'found', 'mostly', 'in', 'dense', 'areas', 'of', 'the', 'universe', 'clusters', 'of', 'galaxies', 'we', 'argue', 'based', 'on', 'previous', 'literature', 'that', 'the', 'most', 'likely', 'method', 'for', 'forming', 'these', 'galaxies', 'is', 'through', 'cluster', 'processes', 'such', 'as', 'galaxy', 'harassment', 'where', 'through', 'multiple', 'high', 'speed', 'encounters', 'an', 'infalling', 'galaxy', 'is', 'gradually', 'removed', 'of', 'its', 'mass', 'until', 'it', 'resembles', 'a', 'dwarf', 'elliptical', 'future', 'studies', 'of', 'udgs', 'should', 'consider', 'the', 'above', 'and', 'their', 'more', 'general', 'connection', 'to', 'previously', 'studied', 'populations']]
|
[-0.06083092153113445, 0.1077308758662719, -0.07722097547615275, 0.12715420999755972, -0.11051667441323147, -0.0634638567427721, 0.015954006097265792, 0.4599014056079528, -0.14183068255857934, -0.3460290359196198, 0.07618694297681727, -0.2745462204055751, -0.08990181816111811, 0.22342658214654554, -0.08969513946486747, 0.002045597075501813, 0.0335330732700908, -0.04175372478716514, -0.018273041684262675, -0.3357498068978791, 0.29109349679612717, 0.045607896879151025, 0.17003095762612408, -0.04526616804137388, 0.056759582149029215, -0.11272926791844999, -0.07103973950314171, 0.02419977578717996, -0.12564440679159494, 0.021483017319662717, 0.26751056647421245, 0.13273828646633773, 0.286886296295287, -0.3904660569394336, -0.2443883532192558, 0.10106355417519808, 0.23375255836393027, 0.062427335590644575, -0.1298019441526883, -0.295658670843798, 0.10681872816776912, -0.1859412229839055, -0.1719497045584242, 0.04586114880683668, 0.07866733862799319, 0.043233373761177064, -0.1436321904280168, 0.15247924197259743, 0.041970442332026056, 0.07295627134906894, -0.04808341649648569, -0.12941110674771206, -0.05965692794690018, 0.07619010014733409, 0.022557914650807268, 0.07004556421820513, 0.19683277313323583, -0.1517936847597251, 0.0029218554818619263, 0.4359087467851008, 0.017247402755653157, -0.02963161633678657, 0.30046976238133055, -0.17940916645217359, -0.19295363081345224, 0.0733778279452749, 0.18040206002633033, 0.10714329245418092, -0.1988330665345797, 0.03625956160351908, -0.05857047135941684, 0.15646391391261097, 0.04778753116124255, 0.08658293352174737, 0.3275526007116937, 0.10457077719106832, 0.0776310065007933, 0.05427139668985653, -0.16823963872293995, -0.03539664476890774, -0.193688005677712, -0.08702902662403443, -0.16422416881439003, 0.06182012048495166, -0.10880345964559478, -0.14601571154369808, 0.320205380636103, 0.09072356729439515, 0.27006614864110495, 0.06953816261375323, 0.2578630003311178, 0.08018872210112236, 0.16835743633564562, 0.12100632069632411, 0.2805182433079394, 0.15832827170927297, 0.022049392872106503, -0.14473304913297078, 0.07586147483876522, -0.04007718480493435]
|
1,803.06928
|
Optimization Based Solutions for Control and State Estimation in
Non-holonomic Mobile Robots: Stability, Distributed Control, and Relative
Localization
|
Interest in designing, manufacturing, and using autonomous robots has been
rapidly growing during the most recent decade. The main motivation for this
interest is the wide range of potential applications these autonomous systems
can serve in. The applications include, but are not limited to, area coverage,
patrolling missions, perimeter surveillance, search and rescue missions, and
situational awareness. In this thesis, the area of control and state estimation
in non-holonomic mobile robots is tackled. Herein, optimization based solutions
for control and state estimation are designed, analyzed, and implemented to
such systems. One of the main motivations for considering such solutions is
their ability of handling constrained and nonlinear systems such as
non-holonomic mobile robots. Moreover, the recent developments in dynamic
optimization algorithms as well as in computer processing facilitated the
real-time implementation of such optimization based methods in embedded
computer systems.
|
math.OC cs.RO
|
interest in designing manufacturing and using autonomous robots has been rapidly growing during the most recent decade the main motivation for this interest is the wide range of potential applications these autonomous systems can serve in the applications include but are not limited to area coverage patrolling missions perimeter surveillance search and rescue missions and situational awareness in this thesis the area of control and state estimation in nonholonomic mobile robots is tackled herein optimization based solutions for control and state estimation are designed analyzed and implemented to such systems one of the main motivations for considering such solutions is their ability of handling constrained and nonlinear systems such as nonholonomic mobile robots moreover the recent developments in dynamic optimization algorithms as well as in computer processing facilitated the realtime implementation of such optimization based methods in embedded computer systems
|
[['interest', 'in', 'designing', 'manufacturing', 'and', 'using', 'autonomous', 'robots', 'has', 'been', 'rapidly', 'growing', 'during', 'the', 'most', 'recent', 'decade', 'the', 'main', 'motivation', 'for', 'this', 'interest', 'is', 'the', 'wide', 'range', 'of', 'potential', 'applications', 'these', 'autonomous', 'systems', 'can', 'serve', 'in', 'the', 'applications', 'include', 'but', 'are', 'not', 'limited', 'to', 'area', 'coverage', 'patrolling', 'missions', 'perimeter', 'surveillance', 'search', 'and', 'rescue', 'missions', 'and', 'situational', 'awareness', 'in', 'this', 'thesis', 'the', 'area', 'of', 'control', 'and', 'state', 'estimation', 'in', 'nonholonomic', 'mobile', 'robots', 'is', 'tackled', 'herein', 'optimization', 'based', 'solutions', 'for', 'control', 'and', 'state', 'estimation', 'are', 'designed', 'analyzed', 'and', 'implemented', 'to', 'such', 'systems', 'one', 'of', 'the', 'main', 'motivations', 'for', 'considering', 'such', 'solutions', 'is', 'their', 'ability', 'of', 'handling', 'constrained', 'and', 'nonlinear', 'systems', 'such', 'as', 'nonholonomic', 'mobile', 'robots', 'moreover', 'the', 'recent', 'developments', 'in', 'dynamic', 'optimization', 'algorithms', 'as', 'well', 'as', 'in', 'computer', 'processing', 'facilitated', 'the', 'realtime', 'implementation', 'of', 'such', 'optimization', 'based', 'methods', 'in', 'embedded', 'computer', 'systems']]
|
[-0.14228632350319198, 0.036166682081030944, -0.007177069377420204, 0.011430479091359302, -0.0998750331312684, -0.16672917900473944, -0.023755803416549627, 0.3941434805994504, -0.2551538818224799, -0.36759814329977547, 0.2129099629727924, -0.24046642829531006, -0.20789295359115514, 0.2672131353673259, -0.1764394538077925, 0.18155888636746179, 0.07150588431395591, -0.0025395923294126987, 0.0027309832901145064, -0.23464244278147817, 0.2406227818706871, 0.030779974495193787, 0.27381250918842853, 0.04837242890415447, 0.08279778656017567, 0.07363960440270603, -0.02405983079224825, 0.03952380342941199, -0.08444467060866633, 0.1583997127200876, 0.38642558185882603, 0.20405586643111226, 0.3532511337676884, -0.4385610466423844, -0.26870147524667637, 0.11511616022991282, 0.18175351611737695, 0.07144528413524052, -0.10300481490391705, -0.33561206853150255, 0.043168426135421864, -0.20487058122110155, -0.1118916847676571, -0.09870038856086986, 0.04282875727596028, 0.08891333041912211, -0.21664168463820324, -0.04388437511931573, 0.007912816004993927, 0.09106550746198211, -0.1071016928546929, -0.10305795099785818, 0.03298578558522942, 0.19263527723170618, 0.03841055108267548, -0.0006340486039074936, 0.18582228288952526, -0.1771199779784573, -0.17159584669945097, 0.41968779739524636, 0.053787573732967886, -0.19033467889696892, 0.23157133236194827, -0.035583157915555476, -0.18936213251602438, 0.07658325584738382, 0.26611360108238713, 0.14007337295749625, -0.1859031157102436, 0.09900138670553653, 0.0886987809125068, 0.11521928293098296, -0.0037966355249019605, 0.04324365006427148, 0.22944339519599452, 0.2831956596379834, 0.14862674462783615, 0.08590353004900472, -0.05454256419491555, -0.168639019537451, -0.2130208415045802, -0.14807228718418627, -0.18643588659885738, -0.009175505718511496, -0.004853991032515686, -0.10000088335946203, 0.3417720159715308, 0.19047439346156483, 0.11437265609524079, 0.009580593137070537, 0.3655618889523404, 0.08060401121038012, 0.09441684370893719, 0.06704577243155134, 0.2287455328424195, 0.04779992519678282, 0.20467610715755394, -0.15340571041285458, 0.06330198338088978, -0.008211560776856329]
|
1,803.06929
|
Stochastic filtering and optimal control of pure jump Markov processes
with noise-free partial observation
|
We consider an infinite horizon optimal control problem for a pure jump
Markov process $X$, taking values in a complete and separable metric space $I$,
with noise-free partial observation. The observation process is defined as $Y_t
= h(X_t)$, $t \geq 0$, where $h$ is a given map defined on $I$. The observation
is noise-free in the sense that the only source of randomness is the process
$X$ itself. The aim is to minimize a discounted cost functional. In the first
part of the paper we write down an explicit filtering equation and characterize
the filtering process as a Piecewise Deterministic Process. In the second part,
after transforming the original control problem with partial observation into
one with complete observation (the separated problem) using filtering
equations, we prove the equivalence of the original and separated problems
through an explicit formula linking their respective value functions. The value
function of the separated problem is also characterized as the unique fixed
point of a suitably defined contraction mapping.
|
math.OC
|
we consider an infinite horizon optimal control problem for a pure jump markov process x taking values in a complete and separable metric space i with noisefree partial observation the observation process is defined as y_t hx_t t geq 0 where h is a given map defined on i the observation is noisefree in the sense that the only source of randomness is the process x itself the aim is to minimize a discounted cost functional in the first part of the paper we write down an explicit filtering equation and characterize the filtering process as a piecewise deterministic process in the second part after transforming the original control problem with partial observation into one with complete observation the separated problem using filtering equations we prove the equivalence of the original and separated problems through an explicit formula linking their respective value functions the value function of the separated problem is also characterized as the unique fixed point of a suitably defined contraction mapping
|
[['we', 'consider', 'an', 'infinite', 'horizon', 'optimal', 'control', 'problem', 'for', 'a', 'pure', 'jump', 'markov', 'process', 'x', 'taking', 'values', 'in', 'a', 'complete', 'and', 'separable', 'metric', 'space', 'i', 'with', 'noisefree', 'partial', 'observation', 'the', 'observation', 'process', 'is', 'defined', 'as', 'y_t', 'hx_t', 't', 'geq', '0', 'where', 'h', 'is', 'a', 'given', 'map', 'defined', 'on', 'i', 'the', 'observation', 'is', 'noisefree', 'in', 'the', 'sense', 'that', 'the', 'only', 'source', 'of', 'randomness', 'is', 'the', 'process', 'x', 'itself', 'the', 'aim', 'is', 'to', 'minimize', 'a', 'discounted', 'cost', 'functional', 'in', 'the', 'first', 'part', 'of', 'the', 'paper', 'we', 'write', 'down', 'an', 'explicit', 'filtering', 'equation', 'and', 'characterize', 'the', 'filtering', 'process', 'as', 'a', 'piecewise', 'deterministic', 'process', 'in', 'the', 'second', 'part', 'after', 'transforming', 'the', 'original', 'control', 'problem', 'with', 'partial', 'observation', 'into', 'one', 'with', 'complete', 'observation', 'the', 'separated', 'problem', 'using', 'filtering', 'equations', 'we', 'prove', 'the', 'equivalence', 'of', 'the', 'original', 'and', 'separated', 'problems', 'through', 'an', 'explicit', 'formula', 'linking', 'their', 'respective', 'value', 'functions', 'the', 'value', 'function', 'of', 'the', 'separated', 'problem', 'is', 'also', 'characterized', 'as', 'the', 'unique', 'fixed', 'point', 'of', 'a', 'suitably', 'defined', 'contraction', 'mapping']]
|
[-0.1279588906980324, 0.07369901214131061, -0.06690449052399433, 0.03149103780663986, -0.08266458212165162, -0.12390604175672662, 0.06476860357059461, 0.3593759162247851, -0.36774999602902225, -0.24017508393835005, 0.14820501955883383, -0.26922607948299404, -0.11098519381044841, 0.14450407494427409, -0.049236462088074626, 0.04161298077025737, 0.021860323660359605, 0.05171216575985366, -0.08376555615736501, -0.22324369507188704, 0.3358272805486283, 0.00610687683773704, 0.2289330395103273, -0.010333553868027904, 0.2020285514171985, 0.058824529577466866, -0.044593901603437236, 0.003917916479666729, -0.13518515040001458, 0.05221830609697485, 0.24935735192252095, 0.1316054665984688, 0.3137465443365594, -0.35740186681221353, -0.16784045683992346, 0.1386996351818486, 0.10563801489088957, 0.06138051758384014, -0.0004895434412457867, -0.28036384766058225, 0.06718029824749953, -0.11445587520521679, -0.11818684060225922, 0.010599161976687156, 0.03601706806263637, -0.012331407673361643, -0.31415588754050366, 0.051657070053518446, 0.09506029558223218, 0.022586957073100364, -0.0747964844965126, -0.06885381711351617, -0.02214850541261002, 0.14169665807630957, 0.008468406939156433, 0.06126975977407178, 0.0997776630925151, -0.0961401342888499, -0.11796933323891674, 0.3372498077181418, -0.0931890904001903, -0.22696812058197016, 0.09607607237256427, -0.10895839637917716, -0.11930255052383716, 0.14346844817670742, 0.13136595775154647, 0.1714102351844947, -0.15532713934279432, 0.1378275125515335, -0.04173046272679618, 0.1486047432701481, 0.049301663561292536, 0.003597203826690774, 0.13110281375205576, 0.1642448021370134, 0.13485868327694422, 0.17589699887818225, -0.013324591721601149, -0.1066307758162843, -0.3752987486616958, -0.17142831623339855, -0.21399767163192582, 0.0925713846298139, -0.0858470559118936, -0.17002490521749344, 0.3385326387289707, 0.09589294415455675, 0.2451553376754973, 0.07215677636175803, 0.2653640130784635, 0.2100355077908295, -0.021862076594715757, 0.06165271124478838, 0.15134869606756582, 0.11927231454017867, 0.07012970871348842, -0.17776186630380392, 0.07475191309321218, 0.09378547492300773]
|
1,803.0693
|
Explicit formula for the density of local times of Markov Jump Processes
|
In this note we show a simple formula for the joint density of local times,
last exit tree and cycling numbers of continuous-time Markov Chains on finite
graphs, which involves the modified Bessel function of the first type.
|
math.PR
|
in this note we show a simple formula for the joint density of local times last exit tree and cycling numbers of continuoustime markov chains on finite graphs which involves the modified bessel function of the first type
|
[['in', 'this', 'note', 'we', 'show', 'a', 'simple', 'formula', 'for', 'the', 'joint', 'density', 'of', 'local', 'times', 'last', 'exit', 'tree', 'and', 'cycling', 'numbers', 'of', 'continuoustime', 'markov', 'chains', 'on', 'finite', 'graphs', 'which', 'involves', 'the', 'modified', 'bessel', 'function', 'of', 'the', 'first', 'type']]
|
[-0.1398550311446582, 0.1538629730134026, -0.09765590742034347, 0.07966477366005022, -0.03916884747971045, -0.07625904629055999, 0.07123097005349241, 0.361169374057729, -0.30852012774956067, -0.20833871366554185, 0.10227244146057944, -0.1712454643198534, -0.15613078946051628, 0.1653978711631345, -0.050776293672817316, 0.030240791445401937, 0.05238041684864775, 0.09163718881379616, -0.07815881151902049, -0.24100583652034402, 0.2957727713510394, 0.011893475991918853, 0.2470905095779974, 0.02809281416825558, 0.16045633321137806, 0.0971797730553111, -0.036492546101247796, -0.028038027304175654, -0.1989826419096636, 0.08311040575101383, 0.19668133181862926, 0.09886854976464651, 0.2696181707280247, -0.4588529865600561, -0.17899293352016493, 0.19405122182184928, 0.11367218413292185, 0.11511303330955439, -0.007752377757385962, -0.24598716380760857, 0.06383364538257745, -0.18726915356359983, -0.11444694715503015, 0.03493229422326151, 0.03577864611227261, 0.10792611799153842, -0.28564110667885917, 0.08008644433299962, 0.07754739011196714, 0.03473407409987167, 0.014024010614344948, -0.14474022580849888, 0.02588777708526897, 0.08015953498206248, 0.018908737080269737, -0.04828243667112762, 0.07062912597566058, -0.05561640456098279, -0.14145358796476534, 0.25938379502928766, -0.11161355363009007, -0.15213524322883276, 0.11675691534765065, -0.15568331741776906, -0.23837547165978895, 0.12737387080529802, 0.14238849320252867, 0.19338646964905293, -0.1553258835828226, 0.11424340996247913, -0.038082071864903956, 0.09293024886497542, 0.10566319444363839, -0.05117122907387583, 0.15945253307980142, 0.1551485074389922, 0.1165631585999539, 0.20322831723790027, -0.042360743035954475, -0.14695817341194733, -0.33259175379613515, -0.1952958703960145, -0.22616060647966438, 0.07564616865037303, -0.15579107903690065, -0.23351320913551668, 0.4174497440506361, 0.0720782281438771, 0.180840083201857, 0.1996313301190783, 0.2506778434311089, 0.1907696293078755, -0.0059472347952817615, 0.03532237353685655, 0.08161884350211997, 0.16335373041587636, 0.07846229730517064, -0.1734995338361171, 0.07071388565543059, 0.16691318221120655]
|
1,803.06931
|
Note on Calder\'on's inverse problem for measurable conductivities
|
The unique determination of a measurable conductivity from the
Dirichlet-to-Neumann map of the equation $\mathrm{div} (\sigma \nabla u) = 0$
is the subject of this note. A new strategy, based on Clifford algebras and a
higher dimensional analogue of the Beltrami equation, is here proposed. This
represents a possible first step for a proof of uniqueness for the Calder\'on
problem in three and higher dimensions in the $L^\infty$ case.
|
math.AP
|
the unique determination of a measurable conductivity from the dirichlettoneumann map of the equation mathrmdiv sigma nabla u 0 is the subject of this note a new strategy based on clifford algebras and a higher dimensional analogue of the beltrami equation is here proposed this represents a possible first step for a proof of uniqueness for the calderon problem in three and higher dimensions in the linfty case
|
[['the', 'unique', 'determination', 'of', 'a', 'measurable', 'conductivity', 'from', 'the', 'dirichlettoneumann', 'map', 'of', 'the', 'equation', 'mathrmdiv', 'sigma', 'nabla', 'u', '0', 'is', 'the', 'subject', 'of', 'this', 'note', 'a', 'new', 'strategy', 'based', 'on', 'clifford', 'algebras', 'and', 'a', 'higher', 'dimensional', 'analogue', 'of', 'the', 'beltrami', 'equation', 'is', 'here', 'proposed', 'this', 'represents', 'a', 'possible', 'first', 'step', 'for', 'a', 'proof', 'of', 'uniqueness', 'for', 'the', 'calderon', 'problem', 'in', 'three', 'and', 'higher', 'dimensions', 'in', 'the', 'linfty', 'case']]
|
[-0.1295592634637347, 0.021837553940713406, -0.062185539918787336, 0.010057554621359004, -0.10112552917288507, -0.11694775197846706, -0.0008265831891228171, 0.27147282073822093, -0.3202282221960452, -0.18020107079406872, 0.11473978296699523, -0.28937513049801483, -0.14583288780619008, 0.1938028571962872, -0.07493511247037746, 0.06435939193675842, 0.02580748761401457, 0.06887076348956565, -0.11774497461481266, -0.19868093429078512, 0.39483616950319095, -0.06052659187287859, 0.22523488554254392, 0.0723795030704316, 0.16430649802307873, -0.029742549591259482, 0.0012012897744117415, -0.02372271431993474, -0.1778894000214196, 0.1437483042023172, 0.20469375296071282, 0.02460794132339823, 0.29097496404831286, -0.34745330349816117, -0.18265252510387012, 0.13004398396622172, 0.1176941318108755, 0.07550157730892192, -0.04468048227029024, -0.2742956223699045, 0.058821332846384716, -0.10665042021804873, -0.1763288223540739, -0.02532062361783841, 0.07404619375901188, -0.04620368620517718, -0.3221949716920362, 0.14556096619515516, 0.12354029317365904, 0.052239857463385254, -0.15685106597512083, -0.1399999320582377, -0.029907305944053567, 0.07515110306934837, -0.012034639024504405, 0.10110829322023646, -0.00020954793538240825, -0.10987581273762129, -0.10172791202443049, 0.3924137400600183, -0.08854708717862035, -0.2848022090928519, 0.10584289874018663, -0.1707204353365609, -0.16458906361367553, 0.07427108711015214, 0.12471664527102429, 0.17568449210375547, -0.14468191679128828, 0.17942314046976046, -0.09649795963538482, 0.13073181734173833, 0.09006633579402286, -0.011791291591875693, 0.0948409995831111, 0.19762707650935388, 0.16961849853396416, 0.13268031968789942, -0.03676236078129424, 0.011546974288648926, -0.38836703780928955, -0.24285851796637015, -0.17704033978995593, 0.16433873561703982, -0.10143062911939683, -0.16377265018630116, 0.401026965228512, 0.14035362392400308, 0.16058866489295134, 0.0586654464042273, 0.2516457035261042, 0.1738100427969852, 0.005477146485217792, 0.037889020640731734, 0.17672119858702096, 0.20595648247912965, 0.15445502747110473, -0.2006517490337822, -0.022161652518929365, 0.17384667895213865]
|
1,803.06932
|
Orders of Tate-Shafarevich groups for the cubic twists of $X_0(27)$
|
This paper continues the authors previous investigations concerning orders of
Tate-Shafarevich groups in quadratic twists of a given elliptic curve, and for
the family of the Neumann-Setzer type elliptic curves. Here we present the
results of our search for the (analytic) orders of Tate-Shafarevich groups for
the cubic twists of $X_0(27)$. Our calculations extend those given by Zagier
and Kramarz \cite{ZK} and by Watkins \cite{Wat}. Our main observations concern
the asymptotic formula for the frequency of orders of Tate-Shafarevich groups.
In the last section we propose a similar asymptotic formula for the class
numbers of real quadratic fields.
|
math.NT
|
this paper continues the authors previous investigations concerning orders of tateshafarevich groups in quadratic twists of a given elliptic curve and for the family of the neumannsetzer type elliptic curves here we present the results of our search for the analytic orders of tateshafarevich groups for the cubic twists of x_027 our calculations extend those given by zagier and kramarz citezk and by watkins citewat our main observations concern the asymptotic formula for the frequency of orders of tateshafarevich groups in the last section we propose a similar asymptotic formula for the class numbers of real quadratic fields
|
[['this', 'paper', 'continues', 'the', 'authors', 'previous', 'investigations', 'concerning', 'orders', 'of', 'tateshafarevich', 'groups', 'in', 'quadratic', 'twists', 'of', 'a', 'given', 'elliptic', 'curve', 'and', 'for', 'the', 'family', 'of', 'the', 'neumannsetzer', 'type', 'elliptic', 'curves', 'here', 'we', 'present', 'the', 'results', 'of', 'our', 'search', 'for', 'the', 'analytic', 'orders', 'of', 'tateshafarevich', 'groups', 'for', 'the', 'cubic', 'twists', 'of', 'x_027', 'our', 'calculations', 'extend', 'those', 'given', 'by', 'zagier', 'and', 'kramarz', 'citezk', 'and', 'by', 'watkins', 'citewat', 'our', 'main', 'observations', 'concern', 'the', 'asymptotic', 'formula', 'for', 'the', 'frequency', 'of', 'orders', 'of', 'tateshafarevich', 'groups', 'in', 'the', 'last', 'section', 'we', 'propose', 'a', 'similar', 'asymptotic', 'formula', 'for', 'the', 'class', 'numbers', 'of', 'real', 'quadratic', 'fields']]
|
[-0.20027347427782832, 0.043996304458868436, -0.12163610512050249, 0.05622990205458375, -0.07555597041162752, -0.01750979287129256, 0.03721108465700821, 0.2744642974388215, -0.21925315737564077, -0.2981126633703068, 0.11039271051945385, -0.2652527419149235, -0.15233291722633827, 0.29861598346202123, -0.08965523720728935, 0.04424706898549552, 0.010446582460195147, 0.03756630850294905, -0.08978448961911503, -0.3761416426709583, 0.40038371097887315, -0.036637652735476214, 0.20088985302455484, 0.030198652267215714, 0.045602409013857446, 0.049464538568250276, -0.06034285116500111, -0.047532001009551426, -0.19814242992389908, 0.19831165691662575, 0.29950032485348566, 0.008065044103811184, 0.20982117744623333, -0.37626268614524155, -0.1873354472151722, 0.14796339301392436, 0.10446514093857859, 0.06381310992223281, -0.07397706373043919, -0.23330356390966522, 0.09227582571342066, -0.18946650769481416, -0.2131873397557165, -0.07693339683496023, 0.04306118094652731, 0.08394965318141766, -0.23267709550958487, 0.06846593766002565, 0.11489805810138463, 0.1402777748410709, -0.09335269196639939, -0.1629488995519056, 0.02452944122725517, 0.07502781254269424, 0.10020093180199144, -0.01826199309359635, 0.01626419565410063, -0.11105378929235202, -0.16233860885584225, 0.3371463518468313, -0.06527995773821428, -0.09338371955879754, 0.1002718671074798, -0.18933005391630114, -0.17568712238903328, 0.11446370051232396, 0.1464805602126064, 0.19221556445794, -0.0395205614084418, 0.13332602719999148, -0.10427579954667117, 0.0859186513129101, 0.100071355299924, -0.06341986506376215, 0.11489542609741611, 0.06167259507422005, 0.026230090287744357, 0.1501067186272653, 0.0018863050287128776, -0.044173212491616765, -0.3704873293798457, -0.20510557791598702, -0.09903497121206695, 0.06995413731533273, -0.1296112726773298, -0.13196184018236254, 0.47309525957911885, 0.09018164582710753, 0.15124512307586208, 0.14900743972349872, 0.24314899366068585, 0.09696081950534535, 0.07246352112801965, 0.045720054537698784, 0.1752237364529602, 0.18224340538564388, 0.023996136191311062, -0.16859048929425977, 0.01957070916109989, 0.1656426998275903]
|
1,803.06933
|
The canonical projection associated to certain possibly infinite
generalized iterated function system as a fixed point
|
In this paper, influenced by the ideas from A. Mihail, The canonical
projection between the shift space of an IIFS and its attractor as a fixed
point, Fixed Point Theory Appl., 2015, Paper No. 75, 15 p., we associate to
every generalized iterated function system F (of order m) an operator H defined
on C^m and taking values on C, where C stands for the space of continuous
functions from the shift space on the metric space corresponding to the system.
We provide sufficient conditions (on the constitutive functions of F) for the
operator H to be continuous, contraction, phi-contraction, Meir-Keeler or
contractive. We also give sufficient condition under which H has a unique fixed
point. Moreover, we prove that, under these circumstances, the closer of the
imagine of the fixed point is the attractor of F and that the fixed point is
the canonical projection associated to F. In this way we give a partial answer
to the open problem raised on the last paragraph of the above mentioned
Mihail's paper.
|
math.CA
|
in this paper influenced by the ideas from a mihail the canonical projection between the shift space of an iifs and its attractor as a fixed point fixed point theory appl 2015 paper no 75 15 p we associate to every generalized iterated function system f of order m an operator h defined on cm and taking values on c where c stands for the space of continuous functions from the shift space on the metric space corresponding to the system we provide sufficient conditions on the constitutive functions of f for the operator h to be continuous contraction phicontraction meirkeeler or contractive we also give sufficient condition under which h has a unique fixed point moreover we prove that under these circumstances the closer of the imagine of the fixed point is the attractor of f and that the fixed point is the canonical projection associated to f in this way we give a partial answer to the open problem raised on the last paragraph of the above mentioned mihails paper
|
[['in', 'this', 'paper', 'influenced', 'by', 'the', 'ideas', 'from', 'a', 'mihail', 'the', 'canonical', 'projection', 'between', 'the', 'shift', 'space', 'of', 'an', 'iifs', 'and', 'its', 'attractor', 'as', 'a', 'fixed', 'point', 'fixed', 'point', 'theory', 'appl', '2015', 'paper', 'no', '75', '15', 'p', 'we', 'associate', 'to', 'every', 'generalized', 'iterated', 'function', 'system', 'f', 'of', 'order', 'm', 'an', 'operator', 'h', 'defined', 'on', 'cm', 'and', 'taking', 'values', 'on', 'c', 'where', 'c', 'stands', 'for', 'the', 'space', 'of', 'continuous', 'functions', 'from', 'the', 'shift', 'space', 'on', 'the', 'metric', 'space', 'corresponding', 'to', 'the', 'system', 'we', 'provide', 'sufficient', 'conditions', 'on', 'the', 'constitutive', 'functions', 'of', 'f', 'for', 'the', 'operator', 'h', 'to', 'be', 'continuous', 'contraction', 'phicontraction', 'meirkeeler', 'or', 'contractive', 'we', 'also', 'give', 'sufficient', 'condition', 'under', 'which', 'h', 'has', 'a', 'unique', 'fixed', 'point', 'moreover', 'we', 'prove', 'that', 'under', 'these', 'circumstances', 'the', 'closer', 'of', 'the', 'imagine', 'of', 'the', 'fixed', 'point', 'is', 'the', 'attractor', 'of', 'f', 'and', 'that', 'the', 'fixed', 'point', 'is', 'the', 'canonical', 'projection', 'associated', 'to', 'f', 'in', 'this', 'way', 'we', 'give', 'a', 'partial', 'answer', 'to', 'the', 'open', 'problem', 'raised', 'on', 'the', 'last', 'paragraph', 'of', 'the', 'above', 'mentioned', 'mihails', 'paper']]
|
[-0.12002928070997929, 0.08346223717997098, -0.0835703790133052, 0.01792037444709636, -0.04069177931558122, -0.10426445541602067, 0.08883883613298701, 0.34002431849127307, -0.3064176904694999, -0.21917891879086657, 0.10379900422104744, -0.25815604764639455, -0.15173214405966812, 0.17256183049586765, -0.08227804374935872, 0.03568766616355039, 0.023272489687866146, 0.09027486047587659, -0.12149305248852162, -0.2473602206336663, 0.39966352125629784, 0.025674481824834776, 0.19348134749760743, 0.03682968913892503, 0.14068065648350644, 0.013269851903211984, -0.008945212016388884, 0.005136764739119612, -0.1723133243200102, 0.07769912453847663, 0.20061581900124165, 0.13973214909680845, 0.28869089150034327, -0.35707528081856094, -0.1606752474189681, 0.18018733384635519, 0.07061069236506763, 0.005688302527757033, -0.006831508748205926, -0.27529787527506844, 0.11507138206044842, -0.10957853042876677, -0.14173134613836952, -0.0366863052963334, 0.07977608220432611, -0.009267039476510357, -0.29675153527025355, 0.0008458124252844273, 0.12909821040161393, 0.08218636481940528, -0.07962493094930645, -0.09860546419205253, -0.04222170550595312, 0.10022132167291334, -0.0021255657800632916, 0.12475230048739297, 0.09705859563717455, -0.06376994405736161, -0.07006030232809922, 0.37052075708394544, -0.08443060986327884, -0.21321205759749692, 0.16719426169498441, -0.15564766768229138, -0.1427883894621011, 0.0994419899830759, 0.1374149922199328, 0.12459323991309194, -0.1072538304635707, 0.17537304851507274, -0.09787130941472509, 0.11353540860736222, 0.09932668490664047, -0.01729832990985254, 0.1505158122307073, 0.08397850226336981, 0.16323296157232323, 0.1400470344551757, -0.029134929480428316, -0.059189198790665934, -0.3800282898085082, -0.16303064986679922, -0.1592738261391573, 0.09405191605088904, -0.07608153047236983, -0.16597522436915074, 0.3755182989818208, 0.13135140213896246, 0.25182720967842376, 0.03319453709991649, 0.19275815786026856, 0.1668822655988419, 0.012461425159948275, 0.07890328328837366, 0.16913355758879334, 0.11856292858171989, 0.0842419162776102, -0.17048764439737973, 0.011040571685332587, 0.12020510197480154]
|
1,803.06934
|
PyGOM - A Python Package for Simplifying Modelling with Systems of
Ordinary Differential Equations
|
Ordinary Differential Equations (ODE) are used throughout science where the
capture of rates of change in states is sought. While both pieces of commercial
and open software exist to study such systems, their efficient and accurate
usage frequently requires deep understanding of mathematics and programming.
The package we present here, PyGOM, seeks to remove these obstacles for models
based on ODE systems. We provide a simple interface for the construction of
such systems backed by a comprehensive and easy to use tool--box. This
tool--box implements functions to easily perform common operations for ODE
systems such as solving, parameter estimation, and stochastic simulation. The
package source is freely available and organized in a way that permits easy
extension. With both the algebraic and numeric calculations performed
automatically (but still accessible), the end user is freed to focus on model
development.
|
cs.MS math.CA
|
ordinary differential equations ode are used throughout science where the capture of rates of change in states is sought while both pieces of commercial and open software exist to study such systems their efficient and accurate usage frequently requires deep understanding of mathematics and programming the package we present here pygom seeks to remove these obstacles for models based on ode systems we provide a simple interface for the construction of such systems backed by a comprehensive and easy to use toolbox this toolbox implements functions to easily perform common operations for ode systems such as solving parameter estimation and stochastic simulation the package source is freely available and organized in a way that permits easy extension with both the algebraic and numeric calculations performed automatically but still accessible the end user is freed to focus on model development
|
[['ordinary', 'differential', 'equations', 'ode', 'are', 'used', 'throughout', 'science', 'where', 'the', 'capture', 'of', 'rates', 'of', 'change', 'in', 'states', 'is', 'sought', 'while', 'both', 'pieces', 'of', 'commercial', 'and', 'open', 'software', 'exist', 'to', 'study', 'such', 'systems', 'their', 'efficient', 'and', 'accurate', 'usage', 'frequently', 'requires', 'deep', 'understanding', 'of', 'mathematics', 'and', 'programming', 'the', 'package', 'we', 'present', 'here', 'pygom', 'seeks', 'to', 'remove', 'these', 'obstacles', 'for', 'models', 'based', 'on', 'ode', 'systems', 'we', 'provide', 'a', 'simple', 'interface', 'for', 'the', 'construction', 'of', 'such', 'systems', 'backed', 'by', 'a', 'comprehensive', 'and', 'easy', 'to', 'use', 'toolbox', 'this', 'toolbox', 'implements', 'functions', 'to', 'easily', 'perform', 'common', 'operations', 'for', 'ode', 'systems', 'such', 'as', 'solving', 'parameter', 'estimation', 'and', 'stochastic', 'simulation', 'the', 'package', 'source', 'is', 'freely', 'available', 'and', 'organized', 'in', 'a', 'way', 'that', 'permits', 'easy', 'extension', 'with', 'both', 'the', 'algebraic', 'and', 'numeric', 'calculations', 'performed', 'automatically', 'but', 'still', 'accessible', 'the', 'end', 'user', 'is', 'freed', 'to', 'focus', 'on', 'model', 'development']]
|
[-0.09521427957604275, 0.0004047703156517684, -0.08758417514922179, 0.0799642271417922, -0.13279181230556814, -0.18310084224651582, 0.02411833506219251, 0.38208336345986393, -0.2811751004807867, -0.3368003257226361, 0.1551134911234207, -0.25364328253055934, -0.15494680039220207, 0.2531466493619255, -0.03183528153812918, 0.10751420367455138, 0.08864830476839257, -0.007751406347370653, -0.028457411414727678, -0.21263761031508877, 0.26966680757249234, 0.05238479206931568, 0.24563190733602244, 0.02140660478355552, 0.10847962310156394, 0.03130646695828308, -0.06398409020587587, -0.010079558159265182, -0.13095586940139387, 0.1646584369768591, 0.35098024322162574, 0.18138197091394576, 0.27348022748027806, -0.48149068991694116, -0.17139551876111975, 0.0180651053627683, 0.1563724233746525, 0.1318826863889758, -0.057508547171153994, -0.24888506364515997, 0.0515282930927756, -0.18309629204568278, -0.12007350539721116, -0.1565991021166353, 0.0010739582206082084, 0.013381842805150276, -0.2582470561323714, 0.01280839240812845, 0.021299729754716373, 0.09819774660976743, -0.014643504694306655, -0.09582577163836095, 0.00986327232448789, 0.14724632565512497, -0.0075383411283415835, 0.007942577432571114, 0.12603979332008117, -0.08784961589423103, -0.0907689347944182, 0.38695928706126154, -0.02312173524979448, -0.22564406774641163, 0.247080547470208, -0.05003841731029198, -0.145865093504983, 0.0952618893681337, 0.22189384760955969, 0.12104857393095027, -0.18879779906390046, 0.10883518103113654, 0.033262074202893004, 0.1983552371224294, -0.021913020355303004, -0.024259680817983506, 0.18559369096613448, 0.1942043764570701, 0.037928281871574945, 0.13628388316019613, 0.017396726262539734, -0.130676103749083, -0.2734982765725125, -0.16672113627809912, -0.12168179224650173, -0.008956372017459269, -0.0018360078955057374, -0.19993600667710754, 0.38548594159141614, 0.21369615567686118, 0.1266236881138352, 0.038581550168548376, 0.33629434254101437, 0.07946399674140106, 0.06728371309683374, 0.10356887412068529, 0.16232080287232564, 0.08677839323459868, 0.11406127785406736, -0.1516567439147089, 0.07980252178622059, 0.03009100838571085]
|
1,803.06935
|
Mathematical Analysis of Anthropogenic Signatures: The Great
Deceleration
|
Distributions of anthropogenic signatures (impacts and activities) are
mathematically analysed. The aim is to understand the Anthropocene and to see
whether anthropogenic signatures could be used to determine its beginning. A
total of 23 signatures were analysed and results are presented in 31 diagrams.
Some of these signatures contain undistinguishable natural components but most
of them are of purely anthropogenic origin. Great care was taken to identify
abrupt accelerations, which could be used to determine the beginning of the
Anthropocene. Results of the analysis can be summarised in three conclusions.
1. Anthropogenic signatures cannot be used to determine the beginning of the
Anthropocene. 2. There was no abrupt Great Acceleration around 1950 or around
any other time. 3. Anthropogenic signatures are characterised by the Great
Deceleration in the second half of the 20th century. The second half of the
20th century does not mark the beginning of the Anthropocene but most likely
the beginning of the end of the strong anthropogenic impacts, maybe even the
beginning of a transition to a sustainable future. The Anthropocene is a unique
stage in human experience but it has no clearly marked beginning and it is
probably not a new geological epoch.
|
physics.soc-ph q-bio.PE
|
distributions of anthropogenic signatures impacts and activities are mathematically analysed the aim is to understand the anthropocene and to see whether anthropogenic signatures could be used to determine its beginning a total of 23 signatures were analysed and results are presented in 31 diagrams some of these signatures contain undistinguishable natural components but most of them are of purely anthropogenic origin great care was taken to identify abrupt accelerations which could be used to determine the beginning of the anthropocene results of the analysis can be summarised in three conclusions 1 anthropogenic signatures cannot be used to determine the beginning of the anthropocene 2 there was no abrupt great acceleration around 1950 or around any other time 3 anthropogenic signatures are characterised by the great deceleration in the second half of the 20th century the second half of the 20th century does not mark the beginning of the anthropocene but most likely the beginning of the end of the strong anthropogenic impacts maybe even the beginning of a transition to a sustainable future the anthropocene is a unique stage in human experience but it has no clearly marked beginning and it is probably not a new geological epoch
|
[['distributions', 'of', 'anthropogenic', 'signatures', 'impacts', 'and', 'activities', 'are', 'mathematically', 'analysed', 'the', 'aim', 'is', 'to', 'understand', 'the', 'anthropocene', 'and', 'to', 'see', 'whether', 'anthropogenic', 'signatures', 'could', 'be', 'used', 'to', 'determine', 'its', 'beginning', 'a', 'total', 'of', '23', 'signatures', 'were', 'analysed', 'and', 'results', 'are', 'presented', 'in', '31', 'diagrams', 'some', 'of', 'these', 'signatures', 'contain', 'undistinguishable', 'natural', 'components', 'but', 'most', 'of', 'them', 'are', 'of', 'purely', 'anthropogenic', 'origin', 'great', 'care', 'was', 'taken', 'to', 'identify', 'abrupt', 'accelerations', 'which', 'could', 'be', 'used', 'to', 'determine', 'the', 'beginning', 'of', 'the', 'anthropocene', 'results', 'of', 'the', 'analysis', 'can', 'be', 'summarised', 'in', 'three', 'conclusions', '1', 'anthropogenic', 'signatures', 'can', 'not', 'be', 'used', 'to', 'determine', 'the', 'beginning', 'of', 'the', 'anthropocene', '2', 'there', 'was', 'no', 'abrupt', 'great', 'acceleration', 'around', '1950', 'or', 'around', 'any', 'other', 'time', '3', 'anthropogenic', 'signatures', 'are', 'characterised', 'by', 'the', 'great', 'deceleration', 'in', 'the', 'second', 'half', 'of', 'the', '20th', 'century', 'the', 'second', 'half', 'of', 'the', '20th', 'century', 'does', 'not', 'mark', 'the', 'beginning', 'of', 'the', 'anthropocene', 'but', 'most', 'likely', 'the', 'beginning', 'of', 'the', 'end', 'of', 'the', 'strong', 'anthropogenic', 'impacts', 'maybe', 'even', 'the', 'beginning', 'of', 'a', 'transition', 'to', 'a', 'sustainable', 'future', 'the', 'anthropocene', 'is', 'a', 'unique', 'stage', 'in', 'human', 'experience', 'but', 'it', 'has', 'no', 'clearly', 'marked', 'beginning', 'and', 'it', 'is', 'probably', 'not', 'a', 'new', 'geological', 'epoch']]
|
[-0.08908982934949723, 0.1611566663820334, -0.11480716828153885, 0.11429867772303577, -0.09723962905194292, -0.0910738974964087, 0.006984602706740849, 0.3508923373199138, -0.230432729749243, -0.3219428452120242, 0.1764028490589459, -0.2838947589523229, -0.13385324618994404, 0.1905641091049148, -0.0897965831136572, -0.039811537665696395, 0.05431402421172652, 0.05773392043558497, -0.032980385583713676, -0.27069034792796415, 0.23327485418143734, 0.10448768581895523, 0.19845502841960283, 0.05374670872083355, 0.022242044064160155, -0.10387514970246609, -0.08807633219090238, -0.011936591535656895, -0.09962862378074647, 0.03644292462551639, 0.2839699962946245, 0.17315959880811785, 0.3036518923390713, -0.4324614906206203, -0.19789941950312737, 0.15633864492416644, 0.09054684818689547, 0.09163243924946192, -0.01257944920207912, -0.24934106287616656, 0.06783713427595747, -0.13764511758751755, -0.16492031273389957, 0.005060032488024752, 0.05486904547535744, -0.03519395993842308, -0.16093050558400812, 0.04143125303885221, 0.07014112057656882, 0.09762031072048685, -0.05240025154569996, -0.11298676797343259, -0.0649291469287607, 0.19799676683881137, 0.07312955076328886, 0.02956115159360533, 0.11828613022679285, -0.12072694625908184, -0.1039165002036484, 0.4283757979218759, -0.06637514022122788, -0.0573573514383904, 0.2361804615254584, -0.22045049998188512, -0.14442551497079845, 0.1884102421840793, 0.13402314028286155, 0.0461124122592073, -0.16727585059557878, -0.004229865719016698, 0.047503965941898936, 0.14780793561314667, 0.0920608345984865, -0.01855038655319265, 0.29101794806482206, 0.12769989755201205, 0.007612309276719224, 0.06014220730135985, -0.08987141774874298, -0.0884889768408471, -0.2783236571929263, -0.1567312611744332, -0.13347367490711973, 0.053335853771235786, -0.0184466038352632, -0.12504957406664613, 0.4225656986915174, 0.15997905905876805, 0.1865324133721323, -0.06868528239557697, 0.22601294587015283, 0.11728888499929603, 0.08810633966399722, 0.06158221637755258, 0.3046107938071191, 0.07780743746002715, 0.15705165347486885, -0.15196593173214434, 0.16143743799245874, 0.0024432067983975662]
|
1,803.06936
|
Inverse Visual Question Answering: A New Benchmark and VQA Diagnosis
Tool
|
In recent years, visual question answering (VQA) has become topical. The
premise of VQA's significance as a benchmark in AI, is that both the image and
textual question need to be well understood and mutually grounded in order to
infer the correct answer. However, current VQA models perhaps `understand' less
than initially hoped, and instead master the easier task of exploiting cues
given away in the question and biases in the answer distribution. In this paper
we propose the inverse problem of VQA (iVQA). The iVQA task is to generate a
question that corresponds to a given image and answer pair. We propose a
variational iVQA model that can generate diverse, grammatically correct and
content correlated questions that match the given answer. Based on this model,
we show that iVQA is an interesting benchmark for visuo-linguistic
understanding, and a more challenging alternative to VQA because an iVQA model
needs to understand the image better to be successful. As a second
contribution, we show how to use iVQA in a novel reinforcement learning
framework to diagnose any existing VQA model by way of exposing its belief set:
the set of question-answer pairs that the VQA model would predict true for a
given image. This provides a completely new window into what VQA models
`believe' about images. We show that existing VQA models have more erroneous
beliefs than previously thought, revealing their intrinsic weaknesses.
Suggestions are then made on how to address these weaknesses going forward.
|
cs.CV
|
in recent years visual question answering vqa has become topical the premise of vqas significance as a benchmark in ai is that both the image and textual question need to be well understood and mutually grounded in order to infer the correct answer however current vqa models perhaps understand less than initially hoped and instead master the easier task of exploiting cues given away in the question and biases in the answer distribution in this paper we propose the inverse problem of vqa ivqa the ivqa task is to generate a question that corresponds to a given image and answer pair we propose a variational ivqa model that can generate diverse grammatically correct and content correlated questions that match the given answer based on this model we show that ivqa is an interesting benchmark for visuolinguistic understanding and a more challenging alternative to vqa because an ivqa model needs to understand the image better to be successful as a second contribution we show how to use ivqa in a novel reinforcement learning framework to diagnose any existing vqa model by way of exposing its belief set the set of questionanswer pairs that the vqa model would predict true for a given image this provides a completely new window into what vqa models believe about images we show that existing vqa models have more erroneous beliefs than previously thought revealing their intrinsic weaknesses suggestions are then made on how to address these weaknesses going forward
|
[['in', 'recent', 'years', 'visual', 'question', 'answering', 'vqa', 'has', 'become', 'topical', 'the', 'premise', 'of', 'vqas', 'significance', 'as', 'a', 'benchmark', 'in', 'ai', 'is', 'that', 'both', 'the', 'image', 'and', 'textual', 'question', 'need', 'to', 'be', 'well', 'understood', 'and', 'mutually', 'grounded', 'in', 'order', 'to', 'infer', 'the', 'correct', 'answer', 'however', 'current', 'vqa', 'models', 'perhaps', 'understand', 'less', 'than', 'initially', 'hoped', 'and', 'instead', 'master', 'the', 'easier', 'task', 'of', 'exploiting', 'cues', 'given', 'away', 'in', 'the', 'question', 'and', 'biases', 'in', 'the', 'answer', 'distribution', 'in', 'this', 'paper', 'we', 'propose', 'the', 'inverse', 'problem', 'of', 'vqa', 'ivqa', 'the', 'ivqa', 'task', 'is', 'to', 'generate', 'a', 'question', 'that', 'corresponds', 'to', 'a', 'given', 'image', 'and', 'answer', 'pair', 'we', 'propose', 'a', 'variational', 'ivqa', 'model', 'that', 'can', 'generate', 'diverse', 'grammatically', 'correct', 'and', 'content', 'correlated', 'questions', 'that', 'match', 'the', 'given', 'answer', 'based', 'on', 'this', 'model', 'we', 'show', 'that', 'ivqa', 'is', 'an', 'interesting', 'benchmark', 'for', 'visuolinguistic', 'understanding', 'and', 'a', 'more', 'challenging', 'alternative', 'to', 'vqa', 'because', 'an', 'ivqa', 'model', 'needs', 'to', 'understand', 'the', 'image', 'better', 'to', 'be', 'successful', 'as', 'a', 'second', 'contribution', 'we', 'show', 'how', 'to', 'use', 'ivqa', 'in', 'a', 'novel', 'reinforcement', 'learning', 'framework', 'to', 'diagnose', 'any', 'existing', 'vqa', 'model', 'by', 'way', 'of', 'exposing', 'its', 'belief', 'set', 'the', 'set', 'of', 'questionanswer', 'pairs', 'that', 'the', 'vqa', 'model', 'would', 'predict', 'true', 'for', 'a', 'given', 'image', 'this', 'provides', 'a', 'completely', 'new', 'window', 'into', 'what', 'vqa', 'models', 'believe', 'about', 'images', 'we', 'show', 'that', 'existing', 'vqa', 'models', 'have', 'more', 'erroneous', 'beliefs', 'than', 'previously', 'thought', 'revealing', 'their', 'intrinsic', 'weaknesses', 'suggestions', 'are', 'then', 'made', 'on', 'how', 'to', 'address', 'these', 'weaknesses', 'going', 'forward']]
|
[-0.004844855294901539, -0.0013462995742553505, -0.07773045398998649, 0.15115388980027566, -0.15539457223812034, -0.19501374007302744, 0.04611115409532747, 0.4212015393374811, -0.2718435883856848, -0.3619732690343926, 0.03654914471938483, -0.27741291897163595, -0.17086047547184363, 0.17758267357837687, -0.15327219910003737, 0.03744915768687906, 0.0903130457091938, 0.041797513682934, -0.014825735626499793, -0.3066821195462272, 0.3224122960626509, 0.04857046262376503, 0.27103937079856744, 0.07768774162092792, 0.09064929308343297, -0.07240122312599069, -0.036581057033401504, -0.023564372933036763, -0.08971254465329313, 0.17079045368437387, 0.31326075479945237, 0.22966185845973447, 0.3375049662037391, -0.40617903065290456, -0.2003687786348241, 0.08962368366860761, 0.17170417890114295, 0.12651567746431006, -0.04253905699436826, -0.31782647225647886, 0.09617709353939469, -0.14249274422114422, -0.02469710807060084, -0.1284679649296709, 0.03741932288630027, -0.10287524155191481, -0.2672370419239102, 0.012316717171641298, 0.1328056313656463, 0.035081020252363496, -0.04030038474833839, -0.09078452177309673, 0.04717573250811316, 0.1585955417191625, 0.052507206233908504, 0.10909489347731256, 0.0902136687017604, -0.20850454943114122, -0.13996152134134995, 0.4079388841690326, -0.035104352776523996, -0.23088949281511364, 0.19133315981829477, -0.06700433829649205, -0.13664726144970926, 0.04423598424134168, 0.1888340547462456, 0.10440398450105735, -0.17598652615681415, -0.0007913152180700602, -0.11064674350825593, 0.2225404505787248, 0.04345015032324663, -0.022359894979206367, 0.2520782804801629, 0.21250465300900107, 0.030123244129190575, 0.10944784906103991, -0.02737271413014632, -0.07020731305718915, -0.18892698681794015, -0.11526536878798742, -0.1277744056616548, 0.05097627738001949, -0.0023772895797603178, -0.13547398365855678, 0.4024034856860949, 0.3371885322719381, 0.25642693467238103, 0.04656265199103601, 0.30926317294043576, 0.04623946376048194, 0.03827514390226392, 0.05080535682856321, 0.18157623219111366, 0.022177061359475034, 0.08454550121918566, -0.14192037244121955, 0.10507744215517824, 0.03106106472565323]
|
1,803.06937
|
Pearson's correlation coefficient in the theory of networks: A comment
|
In statistics, the Pearson correlation coefficient $r_{x,y}$ determines the
degree of linear correlation between two variables and it is known that $-1 \le
r_{x,y} \le 1$. In the theory of networks, a curious expression proposed in
[PRL {\bf 89} 208701 (2002)] for degree-degree correlation coefficient
$r_{j_i,k_i}, i\in [1,M]$ has been in use. We realize that the suggested form
is the conventional Pearson's coefficient for $\{(j_i,k_i), (k_i,j_i)\}$ for
$2M$ data points and hence it is rightly dedicated to undirected networks.
|
cond-mat.dis-nn cs.SI
|
in statistics the pearson correlation coefficient r_xy determines the degree of linear correlation between two variables and it is known that 1 le r_xy le 1 in the theory of networks a curious expression proposed in prl bf 89 208701 2002 for degreedegree correlation coefficient r_j_ik_i iin 1m has been in use we realize that the suggested form is the conventional pearsons coefficient for j_ik_i k_ij_i for 2m data points and hence it is rightly dedicated to undirected networks
|
[['in', 'statistics', 'the', 'pearson', 'correlation', 'coefficient', 'r_xy', 'determines', 'the', 'degree', 'of', 'linear', 'correlation', 'between', 'two', 'variables', 'and', 'it', 'is', 'known', 'that', '1', 'le', 'r_xy', 'le', '1', 'in', 'the', 'theory', 'of', 'networks', 'a', 'curious', 'expression', 'proposed', 'in', 'prl', 'bf', '89', '208701', '2002', 'for', 'degreedegree', 'correlation', 'coefficient', 'r_j_ik_i', 'iin', '1m', 'has', 'been', 'in', 'use', 'we', 'realize', 'that', 'the', 'suggested', 'form', 'is', 'the', 'conventional', 'pearsons', 'coefficient', 'for', 'j_ik_i', 'k_ij_i', 'for', '2m', 'data', 'points', 'and', 'hence', 'it', 'is', 'rightly', 'dedicated', 'to', 'undirected', 'networks']]
|
[-0.15474999754223973, 0.0579371622359184, -0.056821185660450475, 0.0774445420140278, -0.03501304969387619, -0.18742809789622888, -0.008768467387294789, 0.36952953932708815, -0.2169264755732576, -0.2768058778325978, 0.01857992617633978, -0.36486582639382076, -0.2358932474284972, 0.15988759493063154, -0.019111948283879382, 0.037533661424133336, -0.03374872288335801, 0.037733244991518165, -0.036168348718140474, -0.27317516451799556, 0.25222746772372995, 0.06176286389266974, 0.2896081801307829, 0.03797546062636875, 0.1278815650960161, 0.03276600690534044, -0.028268042555474063, 0.02320993984712435, -0.13353266834842784, 0.03246592895716036, 0.24989858549394595, 0.1256461841219693, 0.25150313365616295, -0.2993947075875966, -0.19172560318226092, 0.1287828331926568, 0.09506162001114142, -0.0006559918953203841, 0.0537251757188259, -0.2126248568222907, 0.08612273776854731, -0.16506507424626188, -0.06818082810097717, -0.044957433827221394, 0.15938813069002017, -0.0016911184341695748, -0.3601849104008196, 0.1786891816453518, 0.04350146491350116, 0.08808612102936757, 0.04758935370543776, -0.1685864651440888, 0.01582016359622541, 0.11699816314840543, 0.0014716317834283568, 0.06446190803973495, -0.006539283170193238, -0.10734742783671736, -0.0932346324621712, 0.29759013905238946, -0.0495752399346154, -0.18310638203432686, 0.14291947467350646, -0.16436058534064182, -0.162846850111811, 0.07509833785068047, 0.12634508838681013, 0.08449258165139902, -0.1360694061793191, 0.09655090027923793, -0.0777038155907863, 0.18155975627565854, 0.10058449288389008, 0.0026096809275546356, 0.10782161935869801, 0.08211298946193174, 0.01974964082412618, 0.058780690293612055, -0.13639681660080036, -0.05389227162384869, -0.22262400090939513, -0.17469903288752234, -0.28914202171941533, 0.07673619362207032, -0.12252721535983974, -0.1020493591097061, 0.3574043337200572, 0.1332240770080764, 0.1840986363148611, 0.0669698316701933, 0.17261618618412236, 0.09686546886682902, 0.07026174844022055, 0.11225576982465818, 0.25522286926494225, 0.17363386858730673, 0.12942258418096522, -0.1745828892484209, 0.09466453144130738, 0.07950187318860308]
|
1,803.06938
|
Conformal amplitude hierarchy and the Poincare disk
|
The amplitude for the singlet channels in the 4-point function of the
fundamental field in the conformal field theory of the 2d $O(n)$ model is
studied as a function of $n$. For a generic value of $n$, the 4-point function
has infinitely many amplitudes, whose landscape can be very spiky as the higher
amplitude changes its sign many times at the simple poles, which generalize the
unique pole of the energy operator amplitude at $n=0$. In the stadard
parameterization of $n$ by angle in unit of $\pi$, we find that the zeros and
poles happen at the rational angles, forming a hierarchical tree structure
inherent in the Poincar\'{e} disk. Some relation between the amplitude and the
Farey path, a piecewise geodesic that visits these zeros and poles, is
suggested. In this hierarchy, the symmetry of the congruence subgroup
$\Gamma(2)$ of $SL(2,\mathbb{Z})$ naturally arises from the two clearly
distinct even/odd classes of the rational angles, in which one respectively
gets the truncated operator algebras and the logarithmic 4-point functions.
|
hep-th cond-mat.stat-mech math-ph math.MP
|
the amplitude for the singlet channels in the 4point function of the fundamental field in the conformal field theory of the 2d on model is studied as a function of n for a generic value of n the 4point function has infinitely many amplitudes whose landscape can be very spiky as the higher amplitude changes its sign many times at the simple poles which generalize the unique pole of the energy operator amplitude at n0 in the stadard parameterization of n by angle in unit of pi we find that the zeros and poles happen at the rational angles forming a hierarchical tree structure inherent in the poincare disk some relation between the amplitude and the farey path a piecewise geodesic that visits these zeros and poles is suggested in this hierarchy the symmetry of the congruence subgroup gamma2 of sl2mathbbz naturally arises from the two clearly distinct evenodd classes of the rational angles in which one respectively gets the truncated operator algebras and the logarithmic 4point functions
|
[['the', 'amplitude', 'for', 'the', 'singlet', 'channels', 'in', 'the', '4point', 'function', 'of', 'the', 'fundamental', 'field', 'in', 'the', 'conformal', 'field', 'theory', 'of', 'the', '2d', 'on', 'model', 'is', 'studied', 'as', 'a', 'function', 'of', 'n', 'for', 'a', 'generic', 'value', 'of', 'n', 'the', '4point', 'function', 'has', 'infinitely', 'many', 'amplitudes', 'whose', 'landscape', 'can', 'be', 'very', 'spiky', 'as', 'the', 'higher', 'amplitude', 'changes', 'its', 'sign', 'many', 'times', 'at', 'the', 'simple', 'poles', 'which', 'generalize', 'the', 'unique', 'pole', 'of', 'the', 'energy', 'operator', 'amplitude', 'at', 'n0', 'in', 'the', 'stadard', 'parameterization', 'of', 'n', 'by', 'angle', 'in', 'unit', 'of', 'pi', 'we', 'find', 'that', 'the', 'zeros', 'and', 'poles', 'happen', 'at', 'the', 'rational', 'angles', 'forming', 'a', 'hierarchical', 'tree', 'structure', 'inherent', 'in', 'the', 'poincare', 'disk', 'some', 'relation', 'between', 'the', 'amplitude', 'and', 'the', 'farey', 'path', 'a', 'piecewise', 'geodesic', 'that', 'visits', 'these', 'zeros', 'and', 'poles', 'is', 'suggested', 'in', 'this', 'hierarchy', 'the', 'symmetry', 'of', 'the', 'congruence', 'subgroup', 'gamma2', 'of', 'sl2mathbbz', 'naturally', 'arises', 'from', 'the', 'two', 'clearly', 'distinct', 'evenodd', 'classes', 'of', 'the', 'rational', 'angles', 'in', 'which', 'one', 'respectively', 'gets', 'the', 'truncated', 'operator', 'algebras', 'and', 'the', 'logarithmic', '4point', 'functions']]
|
[-0.19368591960686857, 0.14902279926268774, -0.08431268088006509, 0.099995318201404, -0.04613670855649039, -0.09627620580544818, 0.029152606493510407, 0.31568763755445933, -0.28885213921716557, -0.2487427772630653, 0.06848198115867653, -0.27546988888281193, -0.19311285014320054, 0.14666488587516108, 0.02368427206299262, 0.034754665099672725, -0.006535404027177545, 0.09708953412071228, -0.10635907343075705, -0.20222944811873228, 0.34038317318961114, -0.010683324080640952, 0.21872601089692356, 0.038974786998458695, 0.09037087214162606, 0.03524023552514434, 0.014802093929917869, -0.054020896768699325, -0.0910364600128674, 0.06393409095127534, 0.22957168750236268, 0.0577684701950161, 0.18727431581969078, -0.39139926890859345, -0.142311558082789, 0.1404573136109658, 0.17584744921444864, 0.034930889998021686, 0.013109547910726669, -0.21478755057170362, 0.04954922688365715, -0.1189904372419738, -0.22150719848678943, -0.0008749670326754362, 0.060198560697277505, -0.0166257739939844, -0.26051016330257515, 0.09213328814903597, 0.044389407607743486, 0.05010023548039134, -0.010257893341626904, -0.1467367712307922, -0.07763502905201056, 0.11470409974589676, 0.08040807237583743, 0.08743062124916626, 0.08498957579116152, -0.16830276031588054, -0.09796465601364965, 0.33841391767007106, -0.03749831315355855, -0.22215232206787355, 0.11836574559272853, -0.22492057355232314, -0.1510586540248178, 0.15801325797878518, 0.11035252479218716, 0.11592702113627316, -0.08517767593834806, 0.17235599345984887, -0.07295230382350748, 0.12571378983278386, 0.1483639356105806, 0.004768673432321695, 0.21909431965512252, 0.06155831346282747, 0.04642200767701146, 0.13994856752262835, -0.0550152811397447, -0.09714969024508299, -0.3431654163262623, -0.12374539889149859, -0.15495258921054667, 0.04505565525227767, -0.16741470512648218, -0.20805129467392575, 0.44692795473836855, 0.05794322235510799, 0.242793440978422, 0.08539104111866279, 0.2444195067496067, 0.15830886357221305, 0.1294586275324984, 0.04254981459949366, 0.18731217443595172, 0.14261718851675886, 0.041348186655466385, -0.22689822665136866, 0.00754909642308415, 0.11009967405750544]
|
1,803.06939
|
Motion of vortices in ferromagnetic spin-1 BEC
|
The paper investigates dynamics of nonsingular vortices in a ferromagnetic
spin-1 BEC, where spin and mass superfluidity coexist in the presence of
uniaxial anisotropy (linear and quadratic Zeeman effect). The analysis is based
on hydrodynamics following from the Gross-Pitaevskii theory. Cores of
nonsingular vortices are skyrmions with charge, which is tuned by uniaxial
anisotropy and can have any fractal value between 0 and 1. There are
circulations of mass and spin currents around these vortices. The results are
compared with the equation of vortex motion derived earlier in the
Landau-Lifshitz-Gilbert theory for magnetic vortices in easy-plane
ferromagnetic insulators. In the both cases the transverse gyrotropic force
(analog of the Magnus force in superfluid and classical hydrodynamics) is
proportional to the charge of skyrmions in vortex cores.
|
cond-mat.other
|
the paper investigates dynamics of nonsingular vortices in a ferromagnetic spin1 bec where spin and mass superfluidity coexist in the presence of uniaxial anisotropy linear and quadratic zeeman effect the analysis is based on hydrodynamics following from the grosspitaevskii theory cores of nonsingular vortices are skyrmions with charge which is tuned by uniaxial anisotropy and can have any fractal value between 0 and 1 there are circulations of mass and spin currents around these vortices the results are compared with the equation of vortex motion derived earlier in the landaulifshitzgilbert theory for magnetic vortices in easyplane ferromagnetic insulators in the both cases the transverse gyrotropic force analog of the magnus force in superfluid and classical hydrodynamics is proportional to the charge of skyrmions in vortex cores
|
[['the', 'paper', 'investigates', 'dynamics', 'of', 'nonsingular', 'vortices', 'in', 'a', 'ferromagnetic', 'spin1', 'bec', 'where', 'spin', 'and', 'mass', 'superfluidity', 'coexist', 'in', 'the', 'presence', 'of', 'uniaxial', 'anisotropy', 'linear', 'and', 'quadratic', 'zeeman', 'effect', 'the', 'analysis', 'is', 'based', 'on', 'hydrodynamics', 'following', 'from', 'the', 'grosspitaevskii', 'theory', 'cores', 'of', 'nonsingular', 'vortices', 'are', 'skyrmions', 'with', 'charge', 'which', 'is', 'tuned', 'by', 'uniaxial', 'anisotropy', 'and', 'can', 'have', 'any', 'fractal', 'value', 'between', '0', 'and', '1', 'there', 'are', 'circulations', 'of', 'mass', 'and', 'spin', 'currents', 'around', 'these', 'vortices', 'the', 'results', 'are', 'compared', 'with', 'the', 'equation', 'of', 'vortex', 'motion', 'derived', 'earlier', 'in', 'the', 'landaulifshitzgilbert', 'theory', 'for', 'magnetic', 'vortices', 'in', 'easyplane', 'ferromagnetic', 'insulators', 'in', 'the', 'both', 'cases', 'the', 'transverse', 'gyrotropic', 'force', 'analog', 'of', 'the', 'magnus', 'force', 'in', 'superfluid', 'and', 'classical', 'hydrodynamics', 'is', 'proportional', 'to', 'the', 'charge', 'of', 'skyrmions', 'in', 'vortex', 'cores']]
|
[-0.23023175979624427, 0.23759757384790905, -0.049740146069477, 0.013372845902469836, -0.06410020560632268, -0.10881956340745091, -0.059514035425511085, 0.33057423883361653, -0.23856470549464345, -0.25763170502429444, 0.015073455620690115, -0.2916001970805819, -0.0826748161916695, 0.17480423480700996, 0.0633335626270208, 0.019549153427342102, -0.05412015547081533, -0.004963852021665801, -0.0665481906635539, -0.22003956175906333, 0.34239653689742444, -0.07149802575660279, 0.2951564807370896, 0.06552545878563136, 0.05089733592190203, -0.0464659854511006, 0.0958511299261498, 0.04621380920779634, -0.19325875030786155, -0.005660466990241456, 0.20048707844098174, -0.1269420897292476, 0.1627960185786443, -0.5039893176022266, -0.17860552408392466, 0.06427211342896852, 0.17974877949907547, 0.20044319166354688, -0.048676306246003755, -0.3053649229640585, 0.05292553241117044, -0.1600948200535236, -0.1547546652921786, -0.10564095500324454, 0.03770417378594478, 0.08446845832827782, -0.2531011988896699, 0.18122685911126493, 0.11758603599099886, 0.10236260511483701, -0.13484816700367938, -0.09606511183526545, -0.09310883681644641, -0.004017920846799536, 0.1016160556732396, 0.07572508533300447, 0.15299689428999075, -0.2005068348704039, -0.14350636086855378, 0.3767697798265588, -0.06399595485039292, -0.1943724580286514, 0.12279178690357459, -0.179286527118483, -0.028876952570123925, 0.1530078946804953, 0.13476180095439924, 0.08371209010984453, -0.08145992312255124, 0.07902775990632585, -0.0441792051710691, 0.13374668310972906, 0.06906374451142573, -0.0013521834173136288, 0.32389063262085, 0.1792096045267369, 0.03517246495152543, 0.12857034968929218, -0.13975225571849723, -0.164481992341092, -0.24257419701843036, -0.14293820190794085, -0.24828748762725839, 0.045202293466510515, -0.09005517136635414, -0.1407553171997683, 0.34012104678596, 0.1550012049907338, 0.12101927116866194, -0.040302651186865414, 0.2705103484174562, 0.10272253806599313, 0.07033816522489937, 0.07449553994506243, 0.26822507917688837, 0.23626639089539705, 0.1512540562544018, -0.3234321106657652, -0.044306502234013306, 0.07509331280247324]
|
1,803.0694
|
The ECMWF Ensemble Prediction System: Looking Back (more than) 25 Years
and Projecting Forward 25 Years
|
This paper has been written to mark 25 years of operational medium-range
ensemble forecasting. The origins of the ECMWF Ensemble Prediction System are
outlined, including the development of the precursor real-time Met Office
monthly ensemble forecast system. In particular, the reasons for the
development of singular vectors and stochastic physics - particular features of
the ECMWF Ensemble Prediction System - are discussed. The author speculates
about the development and use of ensemble prediction in the next 25 years.
|
physics.ao-ph
|
this paper has been written to mark 25 years of operational mediumrange ensemble forecasting the origins of the ecmwf ensemble prediction system are outlined including the development of the precursor realtime met office monthly ensemble forecast system in particular the reasons for the development of singular vectors and stochastic physics particular features of the ecmwf ensemble prediction system are discussed the author speculates about the development and use of ensemble prediction in the next 25 years
|
[['this', 'paper', 'has', 'been', 'written', 'to', 'mark', '25', 'years', 'of', 'operational', 'mediumrange', 'ensemble', 'forecasting', 'the', 'origins', 'of', 'the', 'ecmwf', 'ensemble', 'prediction', 'system', 'are', 'outlined', 'including', 'the', 'development', 'of', 'the', 'precursor', 'realtime', 'met', 'office', 'monthly', 'ensemble', 'forecast', 'system', 'in', 'particular', 'the', 'reasons', 'for', 'the', 'development', 'of', 'singular', 'vectors', 'and', 'stochastic', 'physics', 'particular', 'features', 'of', 'the', 'ecmwf', 'ensemble', 'prediction', 'system', 'are', 'discussed', 'the', 'author', 'speculates', 'about', 'the', 'development', 'and', 'use', 'of', 'ensemble', 'prediction', 'in', 'the', 'next', '25', 'years']]
|
[-0.08373777931065936, 0.1064672075873731, -0.05624745455019078, 0.09206069716846717, 0.021352632338867375, -0.06235103257150561, -0.008872056770518324, 0.3233872554755132, -0.20032679033465683, -0.3402720232200074, 0.19998219139616644, -0.2959914950923504, -0.14614593722906552, 0.18535034134938064, -0.0691295415450249, 0.10257029457409915, 0.13603491140958412, 0.03799428177176436, -0.06181337015311185, -0.2852841557423266, 0.2491094518060747, 0.17719656111378418, 0.3388119231615412, -0.008330899829927244, 0.13347702273657838, 0.007656978250260612, -0.08547328370255663, -0.048233281396709286, -0.06768570984958817, 0.16084607088889338, 0.3019243346429185, 0.19092684350356362, 0.3441532609101973, -0.40469300830246585, -0.25267618242651224, 0.08798632977873479, 0.09158658630813558, 0.05367017772483738, 0.023393778424513966, -0.28771853084847526, -0.005407851385442834, -0.24517527408897877, -0.1515668260644337, -0.06541146106074418, 0.028390044138129605, 0.021552203560100968, -0.22310082714906648, 0.049732506262922756, 0.030531027550367934, 0.14664228635496998, -0.09064657358746779, -0.16846699659914807, 0.03980643524425288, 0.17446839135434283, 0.06581067889438648, 0.017382773840309756, 0.16223162059721194, -0.10439465453198768, -0.1249139322899282, 0.37389955119732277, -0.06769172758121338, -0.05037984636146575, 0.15702692672953403, -0.12612001143861562, -0.17822693012605764, 0.06252899879932795, 0.2160298136969734, 0.014706948824727749, -0.19548597123081746, 0.016945296492562385, -0.009922471742979005, 0.10493989710352923, 0.07064671473773687, -0.009663935082866565, 0.23101239653892422, 0.24578068409678772, 0.013697863188817314, 0.07988371051186205, -0.13329389259084373, -0.16879700331360495, -0.2548289422534014, -0.14744725594860747, -0.11987864147675664, 0.02618987892454147, -0.05446162671241358, -0.15357414299720212, 0.4465621222104681, 0.2544717589932445, 0.11726633586773746, 0.009776875125489345, 0.2274396717670913, 0.07484774615027402, 0.008725351087234327, 0.04116133120107023, 0.2499825945920556, 0.0691791127533897, 0.20135947954105704, -0.14192614546290747, 0.07778741697486687, 0.06967578335407827]
|
1,803.06941
|
Oscillations of magnetization in topological line-node semimetals
|
We theoretically investigate the phase of the de Haas - van Alphen
oscillations in topological line-node semimetals. In these semimetals the
chemical potential of charge carriers can essentially depend on the magnetic
field, and this dependence changes the phase of the oscillations as compared to
the phase in a three-dimensional metal with a band-contact line. Our results
elucidate recent experimental data on the Berry phase for certain electron
orbits in ZrSiS, ZrSiTe, and ZrSiSe.
|
cond-mat.mes-hall cond-mat.mtrl-sci
|
we theoretically investigate the phase of the de haas van alphen oscillations in topological linenode semimetals in these semimetals the chemical potential of charge carriers can essentially depend on the magnetic field and this dependence changes the phase of the oscillations as compared to the phase in a threedimensional metal with a bandcontact line our results elucidate recent experimental data on the berry phase for certain electron orbits in zrsis zrsite and zrsise
|
[['we', 'theoretically', 'investigate', 'the', 'phase', 'of', 'the', 'de', 'haas', 'van', 'alphen', 'oscillations', 'in', 'topological', 'linenode', 'semimetals', 'in', 'these', 'semimetals', 'the', 'chemical', 'potential', 'of', 'charge', 'carriers', 'can', 'essentially', 'depend', 'on', 'the', 'magnetic', 'field', 'and', 'this', 'dependence', 'changes', 'the', 'phase', 'of', 'the', 'oscillations', 'as', 'compared', 'to', 'the', 'phase', 'in', 'a', 'threedimensional', 'metal', 'with', 'a', 'bandcontact', 'line', 'our', 'results', 'elucidate', 'recent', 'experimental', 'data', 'on', 'the', 'berry', 'phase', 'for', 'certain', 'electron', 'orbits', 'in', 'zrsis', 'zrsite', 'and', 'zrsise']]
|
[-0.23610929519333557, 0.2107109109909363, -0.08748749467505984, 0.027697795869667745, -0.045304190877773994, -0.08982843881447429, 0.10804066663824838, 0.3119745389239429, -0.19942984908615072, -0.2848675406142457, -0.01270358730426492, -0.34122381346580916, -0.21095724204835825, 0.21972781244971573, -0.01771923444195561, 0.0444102919427678, -0.04826921282004412, -0.06230965670523527, -0.12502140301751763, -0.19800355395123567, 0.33168082260718085, 0.03669593711575008, 0.3262274203796501, 0.08786230593001189, -0.0091940393744751, -0.018401641054206514, 0.08008271224847803, 0.032368441558864015, -0.1784229655658399, -0.026276050538063044, 0.22679397297946557, -0.13258903722393595, 0.12963477351179678, -0.44855284650031835, -0.2411494899018068, 0.038473057056687875, 0.13717095654661934, 0.1763640768723945, -0.13766666552472911, -0.3645871750602167, 0.003147584692358154, -0.0936384237425606, -0.09688453815003525, -0.1132868855477196, -0.019495681966399798, 0.01992187239484836, -0.16440773627733532, 0.1102546228427593, 0.00852130389172737, 0.10344052438509382, -0.11866935761645436, -0.09074861378319664, -0.09608342135261284, 0.05105669645924274, 0.05028091470570597, 0.02926573395882159, 0.12401858406549651, -0.07454723467705898, -0.13117970456688166, 0.38061819723743484, -0.08608944805287948, -0.09314892725534227, 0.1417852838345076, -0.24020330269170337, -0.09386911924469145, 0.13107514506435558, 0.1164198931344874, 0.0860410237761393, -0.04055293160809638, 0.11992490252843509, -0.004055032289701782, 0.09846402510637035, 0.034024363702596865, 0.0752150527112288, 0.2866000381540762, 0.13874136627817604, -0.003998880662113326, 0.05311076117564656, -0.14009965858613588, -0.0397698431760583, -0.22515682660502523, -0.21185858938077543, -0.22844401306842696, 0.02242865084274991, -0.05253866220121144, -0.2636342641629585, 0.492959316105467, 0.1557342055610904, 0.23177543219995417, -0.09675415686956823, 0.24612498057253454, 0.07628228042389534, 0.0396380315164793, -0.003144023155359781, 0.2893103914341749, 0.1702644806100081, 0.18894981877712455, -0.3446218438242396, 0.030486265894293478, 0.03713935208570671]
|
1,803.06942
|
A Maxwell-vector p-wave holographic superconductor in a particular
background AdS black hole metric
|
We study the p-wave holographic superconductor for AdS black holes with
planar event horizon topology for a particular Lovelock gravity, in which the
action is characterized by a self-interacting scalar field nonminimally coupled
to the gravity theory which is labeled by an integer $k$. As the Lovelock
theory of gravity is the most general metric theory of gravity based on the
fundamental assumptions of general relativity, it is a desirable theory to
describe the higher dimensional spacetime geometry. The present work is devoted
to studying the properties of the p-wave holographic superconductor by
including a Maxwell field which nonminimally couples to a complex vector field
in a higher dimensional background metric. In the probe limit, we find that the
critical temperature decreases with the increase of the index $k$ of the
background black hole metric, which shows that a larger $k$ makes it harder for
the condensation to form. We also observe that the index $k$ affects the
conductivity and the gap frequency of the holographic superconductors.
|
hep-th
|
we study the pwave holographic superconductor for ads black holes with planar event horizon topology for a particular lovelock gravity in which the action is characterized by a selfinteracting scalar field nonminimally coupled to the gravity theory which is labeled by an integer k as the lovelock theory of gravity is the most general metric theory of gravity based on the fundamental assumptions of general relativity it is a desirable theory to describe the higher dimensional spacetime geometry the present work is devoted to studying the properties of the pwave holographic superconductor by including a maxwell field which nonminimally couples to a complex vector field in a higher dimensional background metric in the probe limit we find that the critical temperature decreases with the increase of the index k of the background black hole metric which shows that a larger k makes it harder for the condensation to form we also observe that the index k affects the conductivity and the gap frequency of the holographic superconductors
|
[['we', 'study', 'the', 'pwave', 'holographic', 'superconductor', 'for', 'ads', 'black', 'holes', 'with', 'planar', 'event', 'horizon', 'topology', 'for', 'a', 'particular', 'lovelock', 'gravity', 'in', 'which', 'the', 'action', 'is', 'characterized', 'by', 'a', 'selfinteracting', 'scalar', 'field', 'nonminimally', 'coupled', 'to', 'the', 'gravity', 'theory', 'which', 'is', 'labeled', 'by', 'an', 'integer', 'k', 'as', 'the', 'lovelock', 'theory', 'of', 'gravity', 'is', 'the', 'most', 'general', 'metric', 'theory', 'of', 'gravity', 'based', 'on', 'the', 'fundamental', 'assumptions', 'of', 'general', 'relativity', 'it', 'is', 'a', 'desirable', 'theory', 'to', 'describe', 'the', 'higher', 'dimensional', 'spacetime', 'geometry', 'the', 'present', 'work', 'is', 'devoted', 'to', 'studying', 'the', 'properties', 'of', 'the', 'pwave', 'holographic', 'superconductor', 'by', 'including', 'a', 'maxwell', 'field', 'which', 'nonminimally', 'couples', 'to', 'a', 'complex', 'vector', 'field', 'in', 'a', 'higher', 'dimensional', 'background', 'metric', 'in', 'the', 'probe', 'limit', 'we', 'find', 'that', 'the', 'critical', 'temperature', 'decreases', 'with', 'the', 'increase', 'of', 'the', 'index', 'k', 'of', 'the', 'background', 'black', 'hole', 'metric', 'which', 'shows', 'that', 'a', 'larger', 'k', 'makes', 'it', 'harder', 'for', 'the', 'condensation', 'to', 'form', 'we', 'also', 'observe', 'that', 'the', 'index', 'k', 'affects', 'the', 'conductivity', 'and', 'the', 'gap', 'frequency', 'of', 'the', 'holographic', 'superconductors']]
|
[-0.17807778382038106, 0.1594944419507474, -0.08915403939248202, 0.07199942049065683, -0.12443502366676659, -0.17827472243803794, -0.0159179388648624, 0.2788863571243595, -0.17128688488002242, -0.27828809362975604, 0.021784668169988173, -0.2995901794847614, -0.16112661284734747, 0.14162064380497633, -0.026239577003247187, 0.008473591849034998, -0.06567861894452331, 0.12245756969368922, -0.08702050983030238, -0.25027033995103626, 0.40551277744154374, 0.07185536189406307, 0.285193061283204, 0.03726024873287021, 0.07753293797886836, -0.010002774808243542, 0.047612164774630775, 0.1048183076189619, -0.1712062101089936, 0.10302283646800962, 0.23710843572019416, 0.05713230294236791, 0.19072534408264175, -0.38274793124975204, -0.3039095061970596, 0.06204483789408546, 0.07781071794040859, 0.14041881621198332, -0.0439142422028399, -0.2677072617810911, 0.08976790510274157, -0.1591508196120312, -0.1476107681348563, -0.05704191264077396, 0.0410871322170558, -0.11469135518341944, -0.23934732784494803, 0.07261844711433288, 0.0467176466851222, 0.0035715535043287063, -0.06793666905500441, -0.03166336841493689, -0.0272356144425844, 0.031097145875202056, 0.12425688612776736, 0.09100319150957965, 0.12112429047360303, -0.18204193752341621, -0.08189747558731006, 0.38938622084072605, -0.14311442316738432, -0.1793935850449464, 0.15589508873377061, -0.19103469049368432, -0.1014706070150087, 0.11326487624214705, 0.14543167877528249, 0.20033058757241257, -0.12738662820607757, 0.17705431103972652, -0.01772158634765241, 0.17450171395924366, 0.06920640155656296, 0.05808609706268807, 0.305703553995731, 0.1440646842151356, 0.04870233867836079, 0.1835490530914443, -0.028883881530233708, -0.08044308046447839, -0.32774124528465426, -0.20247836067957503, -0.16590908316415762, 0.08344057889956379, -0.1671645912148503, -0.19419904160564264, 0.34273872330846145, 0.14494313250789362, 0.1392090531194326, 0.02097339321117469, 0.23397487944140935, 0.12963769554709847, 0.05964751230708942, 0.08258400021488974, 0.2885805795437651, 0.18874399173408077, 0.11452894038269798, -0.27021478504656316, -0.08566983862400813, 0.09747125328836327]
|
1,803.06943
|
Cellular and WiFi Co-design for 5G User Equipment
|
Motivated by providing solutions to design challenges of coexisting cellular
and WiFi for future 5G application scenarios, this paper, first, conducts an
in-depth investigation of current technological trends of 5G from user
equipment (UE) design perspective, and then presents a cost-effective
cellular-WiFi design methodology based on the new distributed phased array MIMO
(DPA-MIMO) architecture for practical 5G UE devices as an example. Furthermore,
additional 5G cellular-WiFi application scenarios and co-operation details
within 5G heterogeneous networks are unveiled on top of the said cellular-WiFi
co-enabled 5G UE design.
|
eess.SP
|
motivated by providing solutions to design challenges of coexisting cellular and wifi for future 5g application scenarios this paper first conducts an indepth investigation of current technological trends of 5g from user equipment ue design perspective and then presents a costeffective cellularwifi design methodology based on the new distributed phased array mimo dpamimo architecture for practical 5g ue devices as an example furthermore additional 5g cellularwifi application scenarios and cooperation details within 5g heterogeneous networks are unveiled on top of the said cellularwifi coenabled 5g ue design
|
[['motivated', 'by', 'providing', 'solutions', 'to', 'design', 'challenges', 'of', 'coexisting', 'cellular', 'and', 'wifi', 'for', 'future', '5g', 'application', 'scenarios', 'this', 'paper', 'first', 'conducts', 'an', 'indepth', 'investigation', 'of', 'current', 'technological', 'trends', 'of', '5g', 'from', 'user', 'equipment', 'ue', 'design', 'perspective', 'and', 'then', 'presents', 'a', 'costeffective', 'cellularwifi', 'design', 'methodology', 'based', 'on', 'the', 'new', 'distributed', 'phased', 'array', 'mimo', 'dpamimo', 'architecture', 'for', 'practical', '5g', 'ue', 'devices', 'as', 'an', 'example', 'furthermore', 'additional', '5g', 'cellularwifi', 'application', 'scenarios', 'and', 'cooperation', 'details', 'within', '5g', 'heterogeneous', 'networks', 'are', 'unveiled', 'on', 'top', 'of', 'the', 'said', 'cellularwifi', 'coenabled', '5g', 'ue', 'design']]
|
[-0.28810692990253517, -0.03505372988738065, 0.07416540835710132, -0.021630676809753127, -0.1346550047507181, -0.2633276658317567, 0.10020900267203722, 0.3846680003492271, -0.23431381371748797, -0.23600311627173248, 0.09389936588978505, -0.2140631036285092, -0.29845314139555046, 0.21300777442315044, -0.10467221891671857, 0.06944606503307381, 0.08770459326093688, -0.08733116429408684, -0.01649887177764493, -0.19626902494141285, 0.26401686575400696, 0.16134710045093123, 0.4329933390459594, 0.07747686521204955, -0.003920311924508389, -0.032068304202574144, -0.05282555721042787, -0.11919041854493759, -0.10529014541568947, 0.15185085806776497, 0.41148852074847503, 0.24166142315439443, 0.31448080799378014, -0.48381804157705866, -0.22260189692982857, 0.016328474298557813, 0.19426805346875506, -0.02127012424170971, -0.10606449515668347, -0.33365874036270027, 0.16320585178088068, -0.3391582679332179, -0.1523816601070233, 0.01419833299210843, -0.07292788592988954, 0.08869980130688525, -0.32240665863706347, -0.09701386674252503, -0.06320556893068201, 0.0918967241585693, -0.04202818199119065, -0.11843827533919145, 0.054469478984966, 0.14217766328331302, 0.010427709751050262, -0.0297842287184561, 0.11542693665798973, -0.12354684425791836, -0.15886427972137052, 0.41508847402189586, 0.10847144089639187, -0.18507898257470087, 0.14553734682062092, 0.0017072661341551473, -0.16774697474697056, 0.05822825837222969, 0.31154234515064777, -0.012366328152882702, -0.2567910627804368, 0.02728092556559097, 0.05806701941525235, 0.11423138286918402, 0.04026655008852044, 0.14863580617067568, 0.26541326465085147, 0.4016491533640553, 0.18424718807834914, 0.08014167657888988, -0.09734431376461597, -0.08881174216375631, -0.2581903457203332, -0.1349835777983946, -0.17523765024893423, 0.04043102161410977, -0.07675540455949137, -0.07901822361506193, 0.4114154876812416, 0.19909762404585146, 0.028221569654038724, 0.07526359562488164, 0.4143540878944537, 0.012589667221147786, 0.06947819926940343, 0.055510511578005906, 0.14634553030174335, 0.01973947674200377, 0.26151506603859803, -0.0897827192730106, 0.04641133753637619, -0.03316161477500025]
|
1,803.06944
|
Interacting Dark Energy: Possible Explanation for 21-cm Absorption at
Cosmic Dawn
|
A recent observation points to an excess in the expected 21-cm brightness
temperature from cosmic dawn. In this paper, we present an alternative
explanation of this phenomenon, an interaction in the dark sector. Interacting
dark energy models have been extensively studied recently and there is a whole
variety of such in the literature. Here we particularize to a specific model in
order to make explicit the effect of an interaction.
|
astro-ph.CO gr-qc
|
a recent observation points to an excess in the expected 21cm brightness temperature from cosmic dawn in this paper we present an alternative explanation of this phenomenon an interaction in the dark sector interacting dark energy models have been extensively studied recently and there is a whole variety of such in the literature here we particularize to a specific model in order to make explicit the effect of an interaction
|
[['a', 'recent', 'observation', 'points', 'to', 'an', 'excess', 'in', 'the', 'expected', '21cm', 'brightness', 'temperature', 'from', 'cosmic', 'dawn', 'in', 'this', 'paper', 'we', 'present', 'an', 'alternative', 'explanation', 'of', 'this', 'phenomenon', 'an', 'interaction', 'in', 'the', 'dark', 'sector', 'interacting', 'dark', 'energy', 'models', 'have', 'been', 'extensively', 'studied', 'recently', 'and', 'there', 'is', 'a', 'whole', 'variety', 'of', 'such', 'in', 'the', 'literature', 'here', 'we', 'particularize', 'to', 'a', 'specific', 'model', 'in', 'order', 'to', 'make', 'explicit', 'the', 'effect', 'of', 'an', 'interaction']]
|
[-0.10767855108715593, 0.08259531204405773, -0.1260471922861013, 0.08737590759161061, -0.08051470560686928, -0.0334364377161754, -0.012410566119277584, 0.3839382758630174, -0.24155970362148116, -0.3301071520894766, 0.05765031955171643, -0.2878009436452495, -0.14948155501458263, 0.15251270282148782, -0.03569915339882885, 0.012720497817333256, -0.04957254632775273, 0.04327072152601821, -0.014437520251210248, -0.25034081166876215, 0.28749533891844165, 0.11855034699006604, 0.2523286291597677, 0.08217098160779902, 0.08381772411188909, -0.0610538362492142, -0.026488981123215388, 0.005496276555848973, -0.184371879849849, 0.07405070945554014, 0.23048530487477756, 0.08754620647357245, 0.22034457017933684, -0.43822868318696107, -0.26731516126809374, 0.1961692768215601, 0.16520054395244058, 0.16346057280898094, -0.14506838452070953, -0.2659712686336466, -0.002096637577882835, -0.24215324334800242, -0.14384399318535412, -0.011356135244880404, 0.060701273727629866, -0.04828187713532576, -0.23349171738539423, 0.05303499654068478, 0.0162297295805599, 0.07948147759639791, -0.08430124654301575, -0.07223075108569381, 0.052051875518061154, 0.058198374017540896, 0.08485146757780708, 0.033317989340451146, 0.057775663677603006, -0.17740761530585586, -0.12015063744038343, 0.36403329695707987, -0.11294738987760086, -0.11036867209373408, 0.222533938514867, -0.12515000317777905, -0.19127969472402973, 0.11672746701432125, 0.17141150663872914, 0.09433324156728173, -0.2030974944787366, 0.11297057209054141, -0.062107803406459945, 0.16639249835695538, 0.0006553471221455506, 0.03278440089364137, 0.2850301238575152, 0.20336717975192836, 0.03402466770328049, 0.12652009504048953, -0.11071338595024177, -0.0649356652849487, -0.2931598172123943, -0.16403896268872944, -0.16268953376316597, 0.05248664002865553, -0.0217305341134696, -0.12804583490693144, 0.39829564465742023, 0.20627822810472154, 0.24133320352328674, -0.03375262126126992, 0.3197669308100428, 0.10890588608703443, 0.03804806871339679, 0.0176386410237423, 0.3196466550097934, 0.10056576998904347, 0.09735653134328978, -0.17113278957549483, 0.03765269728942907, -0.013505242405725378]
|
1,803.06945
|
Spin-orbital-lattice entangled states in cubic $d^1$ double perovskites
|
Interplay of spin-orbit coupling and vibronic coupling on heavy $d^1$ site of
cubic double perovskites is investigated by ab initio calculations. The
stabilization energy of spin-orbital-lattice entangled states is found
comparable to or larger than the exchange interactions, suggesting the presence
of Jahn-Teller dynamics in the systems. In Ba$_2$YMoO$_6$, the pseudo JT
coupling enhances the mixing of the ground and excited spin-orbit multiplet
states, which results in strong temperature dependence of effective magnetic
moments. The entanglement of the spin and lattice degrees of freedom induces a
strong magneto-elastic response. This multiferroic effect is at the origin of
the recently reported breaking of local point symmetry accompanying the
development of magnetic ordering in Ba$_2$NaOsO$_6$.
|
cond-mat.str-el
|
interplay of spinorbit coupling and vibronic coupling on heavy d1 site of cubic double perovskites is investigated by ab initio calculations the stabilization energy of spinorbitallattice entangled states is found comparable to or larger than the exchange interactions suggesting the presence of jahnteller dynamics in the systems in ba_2ymoo_6 the pseudo jt coupling enhances the mixing of the ground and excited spinorbit multiplet states which results in strong temperature dependence of effective magnetic moments the entanglement of the spin and lattice degrees of freedom induces a strong magnetoelastic response this multiferroic effect is at the origin of the recently reported breaking of local point symmetry accompanying the development of magnetic ordering in ba_2naoso_6
|
[['interplay', 'of', 'spinorbit', 'coupling', 'and', 'vibronic', 'coupling', 'on', 'heavy', 'd1', 'site', 'of', 'cubic', 'double', 'perovskites', 'is', 'investigated', 'by', 'ab', 'initio', 'calculations', 'the', 'stabilization', 'energy', 'of', 'spinorbitallattice', 'entangled', 'states', 'is', 'found', 'comparable', 'to', 'or', 'larger', 'than', 'the', 'exchange', 'interactions', 'suggesting', 'the', 'presence', 'of', 'jahnteller', 'dynamics', 'in', 'the', 'systems', 'in', 'ba_2ymoo_6', 'the', 'pseudo', 'jt', 'coupling', 'enhances', 'the', 'mixing', 'of', 'the', 'ground', 'and', 'excited', 'spinorbit', 'multiplet', 'states', 'which', 'results', 'in', 'strong', 'temperature', 'dependence', 'of', 'effective', 'magnetic', 'moments', 'the', 'entanglement', 'of', 'the', 'spin', 'and', 'lattice', 'degrees', 'of', 'freedom', 'induces', 'a', 'strong', 'magnetoelastic', 'response', 'this', 'multiferroic', 'effect', 'is', 'at', 'the', 'origin', 'of', 'the', 'recently', 'reported', 'breaking', 'of', 'local', 'point', 'symmetry', 'accompanying', 'the', 'development', 'of', 'magnetic', 'ordering', 'in', 'ba_2naoso_6']]
|
[-0.25944740351586215, 0.25771309239831053, 0.012936594365968212, 0.04346639021151427, -0.04129057136092302, -0.11405513799477336, 0.05223787640864277, 0.34412000901931156, -0.2527661769840438, -0.28500820897453655, -0.026093183127819122, -0.31224828472245586, -0.11299070504296209, 0.07279305985461162, 0.1332890736103981, -0.04062948237066116, -0.017299900412460607, -0.006043747318826154, -0.08967602910655262, -0.1760226072067708, 0.2779132104025478, 0.05849368564951423, 0.2988288824866831, 0.13207375228742912, 0.05647784007086822, 0.03247659162420417, 0.1445680513434046, -0.014598278510095798, -0.1175941348619825, 0.09298499081226115, 0.17180968849688966, -0.0897977383152079, 0.19510713402095325, -0.4096477251021867, -0.1981411905468862, 0.009446248041251592, 0.11018949380583352, 0.18387489749707975, -0.06973677167598884, -0.2967629756498258, -0.0005364743663014564, -0.14740717571756218, -0.13923752100919826, -0.12668491974555418, 0.001252933961660725, -0.013881500629065312, -0.30375857692442637, 0.12340409704149223, 0.07848982980260544, 0.14398129969422935, -0.09712362119647781, -0.13139529271562278, -0.13872792392524075, 0.027413388905815978, 0.09349214322494129, 0.05727711104812611, 0.1149158639579896, -0.1278055203935354, -0.13758951655086293, 0.39865336291887593, -0.07705076073311307, -0.09556954142439748, 0.170764371831036, -0.18549075333269693, -0.11675303242688553, 0.16771863008626794, 0.12306713116297548, 0.10746953093685803, -0.09798350471146075, 0.12589272760128833, 0.04384157233418221, 0.18663348213988934, -0.0009472545594867088, 0.13904193819261493, 0.23258424761284768, 0.1549431066383171, 0.03579207627613724, 0.14734349416288656, -0.07993391010522909, -0.13975667568599492, -0.23281584024033716, -0.11171062043414706, -0.2259856798290481, 0.07492862219844462, -0.0748517260660337, -0.14699557126062898, 0.4083728992619214, 0.1097708997075586, 0.11154419921371525, -0.1010640215435667, 0.20275275726118577, 0.0793659964955486, 0.10662015124463138, -0.011384854201367537, 0.3447366553086755, 0.21497787004213087, 0.05366835150397918, -0.395506737133554, 0.0795502866107344, 0.029318549521926758]
|
1,803.06946
|
Dark energy and its manifestations
|
In a four dimensional manifold formalism we study the evolutionary behavior
as well as the ultimate fate of the universe, in the course of which the
contribution of dark energy in these phases are investigated. At one stage we
get a situation (a condition) where the dark energy contained dominates other
types of energies available in this universe. In the model universes we obtain
here the dark energy is found to be of $\Lambda$CDM and quintessence
types-which bear testimony to being real universes. In one of the cases where
the equation of state between the fluid pressure and density is of the type of
the van der Waals equation, it is found that our universe may end in dust. And,
also, it is seen that the behavior of the deceleration parameter is almost
compatible with the recent observation.
|
gr-qc
|
in a four dimensional manifold formalism we study the evolutionary behavior as well as the ultimate fate of the universe in the course of which the contribution of dark energy in these phases are investigated at one stage we get a situation a condition where the dark energy contained dominates other types of energies available in this universe in the model universes we obtain here the dark energy is found to be of lambdacdm and quintessence typeswhich bear testimony to being real universes in one of the cases where the equation of state between the fluid pressure and density is of the type of the van der waals equation it is found that our universe may end in dust and also it is seen that the behavior of the deceleration parameter is almost compatible with the recent observation
|
[['in', 'a', 'four', 'dimensional', 'manifold', 'formalism', 'we', 'study', 'the', 'evolutionary', 'behavior', 'as', 'well', 'as', 'the', 'ultimate', 'fate', 'of', 'the', 'universe', 'in', 'the', 'course', 'of', 'which', 'the', 'contribution', 'of', 'dark', 'energy', 'in', 'these', 'phases', 'are', 'investigated', 'at', 'one', 'stage', 'we', 'get', 'a', 'situation', 'a', 'condition', 'where', 'the', 'dark', 'energy', 'contained', 'dominates', 'other', 'types', 'of', 'energies', 'available', 'in', 'this', 'universe', 'in', 'the', 'model', 'universes', 'we', 'obtain', 'here', 'the', 'dark', 'energy', 'is', 'found', 'to', 'be', 'of', 'lambdacdm', 'and', 'quintessence', 'typeswhich', 'bear', 'testimony', 'to', 'being', 'real', 'universes', 'in', 'one', 'of', 'the', 'cases', 'where', 'the', 'equation', 'of', 'state', 'between', 'the', 'fluid', 'pressure', 'and', 'density', 'is', 'of', 'the', 'type', 'of', 'the', 'van', 'der', 'waals', 'equation', 'it', 'is', 'found', 'that', 'our', 'universe', 'may', 'end', 'in', 'dust', 'and', 'also', 'it', 'is', 'seen', 'that', 'the', 'behavior', 'of', 'the', 'deceleration', 'parameter', 'is', 'almost', 'compatible', 'with', 'the', 'recent', 'observation']]
|
[-0.12815949297680038, 0.1256116460515934, -0.14142991211877143, 0.0742134871080273, -0.04308018007444857, -0.09725649369010417, -0.025236753723074268, 0.3085093095789861, -0.2375165210275428, -0.31351226067891086, 0.058247161091876345, -0.2727132474826853, -0.09476984323539438, 0.1726234274912952, 0.012229606879698316, -0.04087637546710181, 0.013902715516079515, 0.06703714182070136, -0.006129637792244227, -0.282144955169056, 0.3752570543633638, 0.06075731460956761, 0.22627182874189566, 0.028896715899888615, 0.08110970625463519, -0.08524509856688117, 0.01306773662307116, 0.023019143090553962, -0.18687371694515578, 0.054938550176860314, 0.24134129238226554, 0.08176048012215807, 0.24979247294033258, -0.40240706149556665, -0.2271580492982464, 0.13404184956457058, 0.12395474080499398, 0.13679974164089773, -0.03691809391262975, -0.24591707006729052, 0.03795891225569113, -0.17671844972311146, -0.15430404857671173, -0.0063704358359431695, 0.004517003141507595, 0.00958018352780627, -0.20086856664627464, 0.15188112122964378, 0.02128710085781033, -0.050996650939970446, -0.12664907270308284, -0.09030918224993413, -0.04034837970958791, 0.07161994453478795, 0.08212312086855816, 0.011921336692519975, 0.12225930782945922, -0.1715653772748107, -0.048980208715410346, 0.4216602524524949, -0.08458868419262071, -0.12150730451834083, 0.18940750046558405, -0.16552975125465097, -0.12193930413859495, 0.08428131233744432, 0.09191875236557566, 0.07926366875886265, -0.1295869943828587, 0.11958982350761886, 0.004494616900312368, 0.1511313244471, 0.06434916903054083, 0.020990799446284337, 0.24077389626525833, 0.1874716989628046, 0.030306575414520708, 0.09988714127765669, -0.05468022997022001, -0.11958899211995032, -0.33866810006510983, -0.2107616055021617, -0.1892972786632115, 0.05362645551616693, -0.07857087876507078, -0.18109011327181637, 0.3741682238611699, 0.12131334622144142, 0.19761198653370468, -0.012874580109933812, 0.2816168494424001, 0.08487138040168347, 0.005891901114615646, 0.06726301930178583, 0.30817811122422456, 0.09821874648332596, 0.13630259215124768, -0.2016407831811625, 0.03966495368959396, 0.02504109677240035]
|
1,803.06947
|
Differentiability of SDEs with drifts of super-linear growth
|
We close an unexpected gap in the literature of stochastic differential
equations (SDEs) with drifts of super linear growth (and random coefficients),
namely, we prove Malliavin and Parametric Differentiability of such SDEs. The
former is shown by proving Ray Absolute Continuity and Stochastic G\^ateaux
Differentiability. This method enables one to take limits in probability rather
than mean square which bypasses the potentially non-integrable error terms from
the unbounded drift. This issue is strongly linked with the difficulties of the
standard methodology from Nualart's 2006 work, Lemma 1.2.3 for this setting.
Several examples illustrating the range and scope of our results are presented.
We close with parametric differentiability and recover representations
linking both derivatives as well as a Bismut-Elworthy-Li formula.
|
math.PR
|
we close an unexpected gap in the literature of stochastic differential equations sdes with drifts of super linear growth and random coefficients namely we prove malliavin and parametric differentiability of such sdes the former is shown by proving ray absolute continuity and stochastic gateaux differentiability this method enables one to take limits in probability rather than mean square which bypasses the potentially nonintegrable error terms from the unbounded drift this issue is strongly linked with the difficulties of the standard methodology from nualarts 2006 work lemma 123 for this setting several examples illustrating the range and scope of our results are presented we close with parametric differentiability and recover representations linking both derivatives as well as a bismutelworthyli formula
|
[['we', 'close', 'an', 'unexpected', 'gap', 'in', 'the', 'literature', 'of', 'stochastic', 'differential', 'equations', 'sdes', 'with', 'drifts', 'of', 'super', 'linear', 'growth', 'and', 'random', 'coefficients', 'namely', 'we', 'prove', 'malliavin', 'and', 'parametric', 'differentiability', 'of', 'such', 'sdes', 'the', 'former', 'is', 'shown', 'by', 'proving', 'ray', 'absolute', 'continuity', 'and', 'stochastic', 'gateaux', 'differentiability', 'this', 'method', 'enables', 'one', 'to', 'take', 'limits', 'in', 'probability', 'rather', 'than', 'mean', 'square', 'which', 'bypasses', 'the', 'potentially', 'nonintegrable', 'error', 'terms', 'from', 'the', 'unbounded', 'drift', 'this', 'issue', 'is', 'strongly', 'linked', 'with', 'the', 'difficulties', 'of', 'the', 'standard', 'methodology', 'from', 'nualarts', '2006', 'work', 'lemma', '123', 'for', 'this', 'setting', 'several', 'examples', 'illustrating', 'the', 'range', 'and', 'scope', 'of', 'our', 'results', 'are', 'presented', 'we', 'close', 'with', 'parametric', 'differentiability', 'and', 'recover', 'representations', 'linking', 'both', 'derivatives', 'as', 'well', 'as', 'a', 'bismutelworthyli', 'formula']]
|
[-0.06486312447459106, 0.03454325765075845, -0.05262198488591081, 0.11030101211311422, -0.10853007941909323, -0.09489582326278974, 0.029530572436623655, 0.33581306290086677, -0.3225339873687964, -0.269110083382703, 0.14383108255263985, -0.276841139673429, -0.16689385137899573, 0.23256172744904535, -0.14880448764276896, 0.11493696985466374, 0.03731765920667262, 0.002172775385048935, -0.0916892888174408, -0.25586319677689573, 0.3163762449649936, 0.004486763843935046, 0.21759806362659498, 0.025919533734233512, 0.16823094913151937, 0.0028949027517968314, -0.06398287133345286, -0.026001450495194582, -0.1477907465186791, 0.14283462518321002, 0.24080850408112597, 0.04468771314319476, 0.32800100904581597, -0.37442960434640615, -0.18489564049168158, 0.11564907722246154, 0.10833629326829766, 0.09878348253205639, -0.02112886697345934, -0.3079704865063462, 0.05618942601574679, -0.15452769366329758, -0.17782804854135265, -0.0869568606475526, -0.033189354069783523, 0.10225244992169931, -0.27706919846093375, 0.1131916885714094, 0.13306817197797316, 0.07074747721554112, -0.05037372631624625, -0.12365347615016972, 0.007500545551874123, 0.04672744071852984, 0.08820385641962984, 0.008050380602194849, 0.0874153494053536, -0.08614547971943867, -0.12593081554839924, 0.3178159381111026, -0.09512218582639727, -0.24950021403541756, 0.19791952390381592, -0.18323345334758445, -0.12823536143030467, 0.13409571712678772, 0.13110585391947652, 0.1315334304827818, -0.1802049811171778, 0.12725902388170282, -0.001441368945653282, 0.10992604794702887, 0.0980929548564067, 0.02535994311841994, 0.09506099718480797, 0.1206653846814534, 0.1350387427013691, 0.12243873367709565, -0.03409697937333199, -0.14380610823410295, -0.35608769697531806, -0.15571811691052834, -0.15473391657588625, 0.054458184964891715, -0.13053672832091068, -0.17690803288256204, 0.3366358598242356, 0.16087952967520044, 0.18481214233019025, 0.1370859389613635, 0.2511050837524867, 0.20338569688403552, 0.007622791683080338, 0.07244668534554352, 0.21118757316558542, 0.18735601807652452, 0.11615749005764975, -0.153547938508613, 0.09717694881236007, 0.11132405475729097]
|
1,803.06948
|
Gravitational form factors and decoupling in 2D
|
We calculate and analyse non-local gravitational form factors induced by
quantum matter fields in curved two-dimensional space. The calculations are
performed for scalars, spinors and massive vectors by means of the covariant
heat kernel method up to the second order in the curvature and confirmed using
Feynman diagrams. The analysis of the ultraviolet (UV) limit reveals a
generalized "running" form of the Polyakov action for a nonminimal scalar field
and the usual Polyakov action in the conformally invariant cases. In the
infrared (IR) we establish the gravitational decoupling theorem, which can be
seen directly from the form factors or from the physical beta function for
fields of any spin.
|
hep-th gr-qc
|
we calculate and analyse nonlocal gravitational form factors induced by quantum matter fields in curved twodimensional space the calculations are performed for scalars spinors and massive vectors by means of the covariant heat kernel method up to the second order in the curvature and confirmed using feynman diagrams the analysis of the ultraviolet uv limit reveals a generalized running form of the polyakov action for a nonminimal scalar field and the usual polyakov action in the conformally invariant cases in the infrared ir we establish the gravitational decoupling theorem which can be seen directly from the form factors or from the physical beta function for fields of any spin
|
[['we', 'calculate', 'and', 'analyse', 'nonlocal', 'gravitational', 'form', 'factors', 'induced', 'by', 'quantum', 'matter', 'fields', 'in', 'curved', 'twodimensional', 'space', 'the', 'calculations', 'are', 'performed', 'for', 'scalars', 'spinors', 'and', 'massive', 'vectors', 'by', 'means', 'of', 'the', 'covariant', 'heat', 'kernel', 'method', 'up', 'to', 'the', 'second', 'order', 'in', 'the', 'curvature', 'and', 'confirmed', 'using', 'feynman', 'diagrams', 'the', 'analysis', 'of', 'the', 'ultraviolet', 'uv', 'limit', 'reveals', 'a', 'generalized', 'running', 'form', 'of', 'the', 'polyakov', 'action', 'for', 'a', 'nonminimal', 'scalar', 'field', 'and', 'the', 'usual', 'polyakov', 'action', 'in', 'the', 'conformally', 'invariant', 'cases', 'in', 'the', 'infrared', 'ir', 'we', 'establish', 'the', 'gravitational', 'decoupling', 'theorem', 'which', 'can', 'be', 'seen', 'directly', 'from', 'the', 'form', 'factors', 'or', 'from', 'the', 'physical', 'beta', 'function', 'for', 'fields', 'of', 'any', 'spin']]
|
[-0.12400871024754351, 0.16918001505076338, -0.08841190618727732, 0.10843497353879342, -0.07320257068671492, -0.06656857043848621, 0.0074132701783620435, 0.343694897462537, -0.20022515505295965, -0.2608315648784468, 0.041537523502483964, -0.2575253031874469, -0.17145755796676176, 0.16456166748171075, 0.03704894226847576, 0.04191164741155888, -0.019510030748596023, 0.07930647142641588, -0.09789506463897885, -0.21554267192003104, 0.3873050525387185, -0.007192284597186457, 0.21205061660447252, 0.04808430014596825, 0.09454400430715412, 0.007604084050265748, -0.0758598890164098, 0.019024210023851143, -0.10814879530476867, 0.0834568596165734, 0.16510956257009246, 0.03892023768275976, 0.1740033391664454, -0.40003979247097576, -0.24365273617857366, 0.1047782455998208, 0.10993872639304454, 0.09641676502614153, 7.650122225899762e-05, -0.32436357520589043, 0.025952157641359424, -0.13203309801484056, -0.1725196518439697, -0.11795996878842968, -0.048181219080915896, -0.06176777972322846, -0.2962868965034365, 0.09085056660782306, 0.004866155823521795, 0.03444274477472416, -0.062356023205478395, -0.07968922123449658, -0.03272742076847412, 0.09799597204936275, 0.08475079332743216, 0.06952707991943857, 0.15927712642801328, -0.19133930589999457, -0.11371610925955818, 0.39165773810904236, -0.1607923745935988, -0.20179200037425266, 0.11275991529157949, -0.16694199784291447, -0.12079740667271369, 0.1191369110350967, 0.12316894278767596, 0.1419033655520836, -0.18796787672428364, 0.18912875709773272, 0.019034479178676227, 0.1095840388550124, 0.12246876321476671, 0.05626130116454095, 0.24460395305938676, 0.039838548835127725, 0.002928289357325011, 0.1426035977094733, -0.03922514647347938, -0.1064117869464766, -0.3626982819079635, -0.18787917898062173, -0.15095562535902024, 0.09416467971659752, -0.15666899532603032, -0.16948844241448294, 0.37383273857167215, 0.09638991775076597, 0.14973141832587974, 0.027944576944685925, 0.25844024709605296, 0.16885697206166153, 0.13085627861944701, 0.1036135406113751, 0.2744389273602208, 0.18467479961104008, 0.0823907772145328, -0.2511705098176533, -0.08912381199893431, 0.14137237733486321]
|
1,803.06949
|
Graded Identities and Isomorphisms on Algebras of Upper Block-Triangular
Matrices
|
Let $G$ be an abelian group and $\mathbb{K}$ an algebraically closed field of
characteristic zero. A. Valenti and M. Zaicev described the $G$-gradings on
upper block-triangular matrix algebras provided that $G$ is finite. We prove
that their result holds for any abelian group $G$: any grading is isomorphic to
the tensor product $A\otimes B$ of an elementary grading $A$ on an upper
block-triangular matrix algebra and a division grading $B$ on a matrix algebra.
We then consider the question of whether graded identities $A\otimes B$, where
$B$ is an algebra with a division grading, determine $A\otimes B$ up to graded
isomorphism. In our main result, Theorem 3, we reduce this question to the case
of elementary gradings on upper block-triangular matrix algebras which was
previously studied by O. M. Di Vincenzo and E. Spinelli.
|
math.RA
|
let g be an abelian group and mathbbk an algebraically closed field of characteristic zero a valenti and m zaicev described the ggradings on upper blocktriangular matrix algebras provided that g is finite we prove that their result holds for any abelian group g any grading is isomorphic to the tensor product aotimes b of an elementary grading a on an upper blocktriangular matrix algebra and a division grading b on a matrix algebra we then consider the question of whether graded identities aotimes b where b is an algebra with a division grading determine aotimes b up to graded isomorphism in our main result theorem 3 we reduce this question to the case of elementary gradings on upper blocktriangular matrix algebras which was previously studied by o m di vincenzo and e spinelli
|
[['let', 'g', 'be', 'an', 'abelian', 'group', 'and', 'mathbbk', 'an', 'algebraically', 'closed', 'field', 'of', 'characteristic', 'zero', 'a', 'valenti', 'and', 'm', 'zaicev', 'described', 'the', 'ggradings', 'on', 'upper', 'blocktriangular', 'matrix', 'algebras', 'provided', 'that', 'g', 'is', 'finite', 'we', 'prove', 'that', 'their', 'result', 'holds', 'for', 'any', 'abelian', 'group', 'g', 'any', 'grading', 'is', 'isomorphic', 'to', 'the', 'tensor', 'product', 'aotimes', 'b', 'of', 'an', 'elementary', 'grading', 'a', 'on', 'an', 'upper', 'blocktriangular', 'matrix', 'algebra', 'and', 'a', 'division', 'grading', 'b', 'on', 'a', 'matrix', 'algebra', 'we', 'then', 'consider', 'the', 'question', 'of', 'whether', 'graded', 'identities', 'aotimes', 'b', 'where', 'b', 'is', 'an', 'algebra', 'with', 'a', 'division', 'grading', 'determine', 'aotimes', 'b', 'up', 'to', 'graded', 'isomorphism', 'in', 'our', 'main', 'result', 'theorem', '3', 'we', 'reduce', 'this', 'question', 'to', 'the', 'case', 'of', 'elementary', 'gradings', 'on', 'upper', 'blocktriangular', 'matrix', 'algebras', 'which', 'was', 'previously', 'studied', 'by', 'o', 'm', 'di', 'vincenzo', 'and', 'e', 'spinelli']]
|
[-0.18255310820737727, 0.1189249061006235, -0.05830237227036877, 0.005245659430773887, -0.13515214861853792, -0.19355097182333134, -0.005278389312719044, 0.3343757326973784, -0.3507850738347305, -0.21478953559119673, 0.0953532853505147, -0.21162147040275814, -0.12261126827382084, 0.15851714521212348, -0.1349906011841687, -0.12418976576326597, 0.04424473606540184, 0.17295232010459094, -0.07095824400509211, -0.30906608238767247, 0.3727695027688392, -0.022984563964734177, 0.19771184973922887, 0.044898754045283214, 0.1022007690630573, 0.04510697008187609, -0.031102159697758525, -0.0395460237619376, -0.17579812213791188, 0.06129374145573929, 0.28039503200469834, 0.10177494658864475, 0.20160356359433776, -0.32036807886639934, -0.02280512254657154, 0.20887426278883017, 0.15918735272287832, -0.07243278850468673, -0.021225629141554236, -0.26014773494956134, 0.1489857385666775, -0.24677080714276858, -0.09478538310771487, -0.027515887856987633, 0.1575152413907314, -0.09691195786909614, -0.33301146853631153, -0.04036596145732958, 0.1190215008459369, 0.161194539777068, -0.07844153158165361, -0.15493593646101372, -0.03128131826520246, 0.06659185493897114, -0.10071541543584317, 0.0701566519989471, 0.11037259735867269, -0.05144312288577115, -0.15860686918608563, 0.33282831223695575, -0.08622921683258356, -0.21943737352196885, 0.10649938852337182, -0.19610000845338954, -0.13479112628567264, 0.07981322447356201, 0.05249673418728705, 0.12795183365058183, -0.04242980917145435, 0.2606828245772526, -0.1994674868084739, 0.08525460233029566, 0.06041623267548201, -0.0768003301708994, 0.08646030542685797, 0.057900919244603666, 0.07925629777364657, 0.0763632262508994, 0.1102048627843142, 0.10206727073632908, -0.3387399525906807, -0.2075802552954931, -0.13552960774448133, 0.21713204754873605, -0.10495400478095307, -0.16927194911146298, 0.36300666285748767, 0.062373491035620295, 0.1644197540025969, 0.09248118984943635, 0.18764010959661992, 0.10019986587489038, 0.09962917552933559, 0.0759574712912335, 0.0745695055133306, 0.3347485183398554, -0.04922132659353372, -0.1588435346659805, -0.03690887724672605, 0.2233009279033351]
|
1,803.0695
|
Study of point- and cluster-defects in radiation-damaged silicon
|
Non-ionising energy loss of radiation produces point defects and defect
clusters in silicon, which result in a signifcant degradation of sensor
performance. In this contribution results from TSC (Thermally Stimulated
Current) defect spectroscopy for silicon pad diodes irradiated by electrons to
fluences of a few $10^{14}$ cm$^{-2}$ and energies between 3.5 and 27 MeV for
isochronal annealing between 80 and 280{\deg}C, are presented. A method based
on SRH (Shockley-Read-Hall) statistics is introduced, which assumes that the
ionisation energy of the defects in a cluster depends on the fraction of
occupied traps. The dfference of ionisation energy of an isolated point defect
and a fully occupied cluster, $\Delta E_a$, is extracted from the TSC data.
For the VOi (vacancy-oxygen interstitial) defect $\Delta E_a = 0$ is found,
which cofirms that it is a point defect, and validates the method for point
defects. For clusters made of deep acceptors the $\Delta E_a$ values for
different defects are determined after annealing at 80{\deg}C as a function of
electron energy, and for the irradiation with 15 MeV electrons as a function of
annealing temperature. For the irradiation with 3.5 MeV electrons the value
$\Delta E_a = 0$ is found, whereas for the electron energies of 6 to 27 MeV
$\Delta E_a > 0$. This agrees with the expected threshold of about 5 MeV for
cluster formation by electrons. The $\Delta E_a$ values determined as a
function of annealing temperature show that the annealing rate is different for
different defects. A naive diffusion model is used to estimate the temperature
dependencies of the diffusion of the defects in the clusters.
|
physics.ins-det cond-mat.mtrl-sci
|
nonionising energy loss of radiation produces point defects and defect clusters in silicon which result in a signifcant degradation of sensor performance in this contribution results from tsc thermally stimulated current defect spectroscopy for silicon pad diodes irradiated by electrons to fluences of a few 1014 cm2 and energies between 35 and 27 mev for isochronal annealing between 80 and 280degc are presented a method based on srh shockleyreadhall statistics is introduced which assumes that the ionisation energy of the defects in a cluster depends on the fraction of occupied traps the dfference of ionisation energy of an isolated point defect and a fully occupied cluster delta e_a is extracted from the tsc data for the voi vacancyoxygen interstitial defect delta e_a 0 is found which cofirms that it is a point defect and validates the method for point defects for clusters made of deep acceptors the delta e_a values for different defects are determined after annealing at 80degc as a function of electron energy and for the irradiation with 15 mev electrons as a function of annealing temperature for the irradiation with 35 mev electrons the value delta e_a 0 is found whereas for the electron energies of 6 to 27 mev delta e_a 0 this agrees with the expected threshold of about 5 mev for cluster formation by electrons the delta e_a values determined as a function of annealing temperature show that the annealing rate is different for different defects a naive diffusion model is used to estimate the temperature dependencies of the diffusion of the defects in the clusters
|
[['nonionising', 'energy', 'loss', 'of', 'radiation', 'produces', 'point', 'defects', 'and', 'defect', 'clusters', 'in', 'silicon', 'which', 'result', 'in', 'a', 'signifcant', 'degradation', 'of', 'sensor', 'performance', 'in', 'this', 'contribution', 'results', 'from', 'tsc', 'thermally', 'stimulated', 'current', 'defect', 'spectroscopy', 'for', 'silicon', 'pad', 'diodes', 'irradiated', 'by', 'electrons', 'to', 'fluences', 'of', 'a', 'few', '1014', 'cm2', 'and', 'energies', 'between', '35', 'and', '27', 'mev', 'for', 'isochronal', 'annealing', 'between', '80', 'and', '280degc', 'are', 'presented', 'a', 'method', 'based', 'on', 'srh', 'shockleyreadhall', 'statistics', 'is', 'introduced', 'which', 'assumes', 'that', 'the', 'ionisation', 'energy', 'of', 'the', 'defects', 'in', 'a', 'cluster', 'depends', 'on', 'the', 'fraction', 'of', 'occupied', 'traps', 'the', 'dfference', 'of', 'ionisation', 'energy', 'of', 'an', 'isolated', 'point', 'defect', 'and', 'a', 'fully', 'occupied', 'cluster', 'delta', 'e_a', 'is', 'extracted', 'from', 'the', 'tsc', 'data', 'for', 'the', 'voi', 'vacancyoxygen', 'interstitial', 'defect', 'delta', 'e_a', '0', 'is', 'found', 'which', 'cofirms', 'that', 'it', 'is', 'a', 'point', 'defect', 'and', 'validates', 'the', 'method', 'for', 'point', 'defects', 'for', 'clusters', 'made', 'of', 'deep', 'acceptors', 'the', 'delta', 'e_a', 'values', 'for', 'different', 'defects', 'are', 'determined', 'after', 'annealing', 'at', '80degc', 'as', 'a', 'function', 'of', 'electron', 'energy', 'and', 'for', 'the', 'irradiation', 'with', '15', 'mev', 'electrons', 'as', 'a', 'function', 'of', 'annealing', 'temperature', 'for', 'the', 'irradiation', 'with', '35', 'mev', 'electrons', 'the', 'value', 'delta', 'e_a', '0', 'is', 'found', 'whereas', 'for', 'the', 'electron', 'energies', 'of', '6', 'to', '27', 'mev', 'delta', 'e_a', '0', 'this', 'agrees', 'with', 'the', 'expected', 'threshold', 'of', 'about', '5', 'mev', 'for', 'cluster', 'formation', 'by', 'electrons', 'the', 'delta', 'e_a', 'values', 'determined', 'as', 'a', 'function', 'of', 'annealing', 'temperature', 'show', 'that', 'the', 'annealing', 'rate', 'is', 'different', 'for', 'different', 'defects', 'a', 'naive', 'diffusion', 'model', 'is', 'used', 'to', 'estimate', 'the', 'temperature', 'dependencies', 'of', 'the', 'diffusion', 'of', 'the', 'defects', 'in', 'the', 'clusters']]
|
[-0.05494516270601957, 0.19668797321998988, -0.028560733190705304, 0.05030255936289343, 0.07476186986127599, -0.12597212538439564, 0.10945504534051081, 0.39442936671919343, -0.22635111652501647, -0.3714226251216354, -0.009074203715422353, -0.34691942337195614, -0.0002823219768088095, 0.1925031145033157, 0.02529188555855894, -0.010440802882478525, 0.03273507334475323, 0.01623890657269155, -0.06646129288027444, -0.20888711783934283, 0.26643646605902543, 0.10273520555425864, 0.26267682717983615, 0.1243595252888687, 0.0779561081792868, -0.0074145530159926785, 0.07771502931073711, -0.012241938453020247, -0.14747192372266688, 0.060304811390424255, 0.23457473253248742, -0.0015509971291632265, 0.22447471337169983, -0.3848641545347273, -0.19968332430621083, 0.048805516333639276, 0.12313923769375187, 0.0884516340375673, -0.0826049619929642, -0.2196155769721709, 0.09632769981255344, -0.11078561088663587, -0.13665396855014977, 0.044553321500355555, 0.03331209807009454, 0.02918251380899698, -0.27183979044220696, 0.14048011147176206, 0.003617641285896071, 0.0427538743746039, -0.11060379440878233, -0.1821887361184194, -0.0763625793903347, 0.04322204496136158, 0.007798161818358227, 0.07395794065525345, 0.22268738022117254, -0.10919533161946274, -0.09256044539000882, 0.3442608247867077, -0.02943473035275476, -0.0733457793628628, 0.1414539779088744, -0.12398220280465817, -0.08103635811703604, 0.22690927463091018, 0.06262232839807681, 0.12372227079454363, -0.15719024341330506, 0.05944486380373595, 0.049598591801311286, 0.19554130397026848, 0.09814488021189412, -0.0009414947153029525, 0.2016331211252059, 0.18867954461022665, 0.054823995814173264, 0.09310738432839599, -0.17175649543936475, -0.019734324813680183, -0.26862546048957753, -0.1696462680877395, -0.20806361492507477, 0.10793424195957885, -0.10456548474373298, -0.16732891009487644, 0.3773889066745854, 0.11325702720418802, 0.21840813377347118, -0.005755101725221774, 0.2100425882410603, 0.13500581463258607, 0.07064732217722533, 0.0603522330506356, 0.2201697664968238, 0.1445165948122452, 0.0866022556152691, -0.24190074886270874, 0.02611716600983587, 0.006638680511912957]
|
1,803.06951
|
Deja Vu: Motion Prediction in Static Images
|
This paper proposes motion prediction in single still images by learning it
from a set of videos. The building assumption is that similar motion is
characterized by similar appearance. The proposed method learns local motion
patterns given a specific appearance and adds the predicted motion in a number
of applications. This work (i) introduces a novel method to predict motion from
appearance in a single static image, (ii) to that end, extends of the
Structured Random Forest with regression derived from first principles, and
(iii) shows the value of adding motion predictions in different tasks such as:
weak frame-proposals containing unexpected events, action recognition, motion
saliency. Illustrative results indicate that motion prediction is not only
feasible, but also provides valuable information for a number of applications.
|
cs.CV
|
this paper proposes motion prediction in single still images by learning it from a set of videos the building assumption is that similar motion is characterized by similar appearance the proposed method learns local motion patterns given a specific appearance and adds the predicted motion in a number of applications this work i introduces a novel method to predict motion from appearance in a single static image ii to that end extends of the structured random forest with regression derived from first principles and iii shows the value of adding motion predictions in different tasks such as weak frameproposals containing unexpected events action recognition motion saliency illustrative results indicate that motion prediction is not only feasible but also provides valuable information for a number of applications
|
[['this', 'paper', 'proposes', 'motion', 'prediction', 'in', 'single', 'still', 'images', 'by', 'learning', 'it', 'from', 'a', 'set', 'of', 'videos', 'the', 'building', 'assumption', 'is', 'that', 'similar', 'motion', 'is', 'characterized', 'by', 'similar', 'appearance', 'the', 'proposed', 'method', 'learns', 'local', 'motion', 'patterns', 'given', 'a', 'specific', 'appearance', 'and', 'adds', 'the', 'predicted', 'motion', 'in', 'a', 'number', 'of', 'applications', 'this', 'work', 'i', 'introduces', 'a', 'novel', 'method', 'to', 'predict', 'motion', 'from', 'appearance', 'in', 'a', 'single', 'static', 'image', 'ii', 'to', 'that', 'end', 'extends', 'of', 'the', 'structured', 'random', 'forest', 'with', 'regression', 'derived', 'from', 'first', 'principles', 'and', 'iii', 'shows', 'the', 'value', 'of', 'adding', 'motion', 'predictions', 'in', 'different', 'tasks', 'such', 'as', 'weak', 'frameproposals', 'containing', 'unexpected', 'events', 'action', 'recognition', 'motion', 'saliency', 'illustrative', 'results', 'indicate', 'that', 'motion', 'prediction', 'is', 'not', 'only', 'feasible', 'but', 'also', 'provides', 'valuable', 'information', 'for', 'a', 'number', 'of', 'applications']]
|
[-0.06698540815524757, 0.04639917698875069, -0.08513426335561598, 0.019328902659006417, -0.11793573530949653, -0.14988044594973327, 0.02592654954548925, 0.3935145979523659, -0.28166992917284367, -0.34628488890826703, 0.06218536572158337, -0.25517463429272175, -0.21536933012679219, 0.17629752000421287, -0.1443976641483605, 0.04656935312412679, 0.11850101342611015, 0.08490996259450913, -0.030745375443249942, -0.18207888382673262, 0.27884600322693587, 0.002554943222552538, 0.31105527441948655, -0.01492074666544795, 0.13821454791724683, 0.019701181441545486, -0.056186246808618306, 0.07382663292437792, -0.0556749278474017, 0.16301959786796943, 0.2270703320801258, 0.1540103975062957, 0.28918669498711824, -0.3669096590429545, -0.23492906990647316, 0.04748920445516706, 0.12526895808288827, 0.15899986490234733, -0.10422812573798, -0.33458471612632273, 0.07855172348953783, -0.1370318729132414, -0.0699225612618029, -0.10863887052983046, 0.03427340908069164, -0.01554248247668147, -0.3019517426677048, 0.10660100655979476, 0.09326206716895104, 0.05082269622385502, -0.08237617035023868, -0.07887607966084033, 0.02534908858500421, 0.15607803010195492, 0.04771068274416029, 0.04391240022983402, 0.14190719728171824, -0.18321886890754105, -0.13099331559985877, 0.42553655615448954, -0.08756485137902201, -0.2026134100127965, 0.20811256872676312, -0.10763633079081773, -0.1554054589383304, 0.17224079821817576, 0.1814843631386757, 0.12417717916890979, -0.1891911431439221, -0.008667169463820755, -0.04750631856173277, 0.16225490348413588, 0.050623883865773676, -0.012725367102771997, 0.23121908485889434, 0.2325315181054175, 0.03993445217236877, 0.139059216985479, -0.1370196058601141, -0.06621843988448381, -0.29320304265990854, -0.09464072982780636, -0.18127429273165763, 0.015567485976149329, -0.06707378932437859, -0.15085445354506374, 0.4014948274195194, 0.22944370554212948, 0.25607879854738713, 0.05201771028712392, 0.30972971859201787, 0.0589489028659882, 0.06954099301621318, 0.08203318561241031, 0.18064156320970506, 0.020920813761651516, 0.10692529331147671, -0.1665097130779177, 0.10144558607414365, 0.07825574853643776]
|
1,803.06952
|
Asymmetric kernel in Gaussian Processes for learning target variance
|
This work incorporates the multi-modality of the data distribution into a
Gaussian Process regression model. We approach the problem from a
discriminative perspective by learning, jointly over the training data, the
target space variance in the neighborhood of a certain sample through metric
learning. We start by using data centers rather than all training samples.
Subsequently, each center selects an individualized kernel metric. This enables
each center to adjust the kernel space in its vicinity in correspondence with
the topology of the targets --- a multi-modal approach. We additionally add
descriptiveness by allowing each center to learn a precision matrix. We
demonstrate empirically the reliability of the model.
|
cs.LG cs.CV stat.ML
|
this work incorporates the multimodality of the data distribution into a gaussian process regression model we approach the problem from a discriminative perspective by learning jointly over the training data the target space variance in the neighborhood of a certain sample through metric learning we start by using data centers rather than all training samples subsequently each center selects an individualized kernel metric this enables each center to adjust the kernel space in its vicinity in correspondence with the topology of the targets a multimodal approach we additionally add descriptiveness by allowing each center to learn a precision matrix we demonstrate empirically the reliability of the model
|
[['this', 'work', 'incorporates', 'the', 'multimodality', 'of', 'the', 'data', 'distribution', 'into', 'a', 'gaussian', 'process', 'regression', 'model', 'we', 'approach', 'the', 'problem', 'from', 'a', 'discriminative', 'perspective', 'by', 'learning', 'jointly', 'over', 'the', 'training', 'data', 'the', 'target', 'space', 'variance', 'in', 'the', 'neighborhood', 'of', 'a', 'certain', 'sample', 'through', 'metric', 'learning', 'we', 'start', 'by', 'using', 'data', 'centers', 'rather', 'than', 'all', 'training', 'samples', 'subsequently', 'each', 'center', 'selects', 'an', 'individualized', 'kernel', 'metric', 'this', 'enables', 'each', 'center', 'to', 'adjust', 'the', 'kernel', 'space', 'in', 'its', 'vicinity', 'in', 'correspondence', 'with', 'the', 'topology', 'of', 'the', 'targets', 'a', 'multimodal', 'approach', 'we', 'additionally', 'add', 'descriptiveness', 'by', 'allowing', 'each', 'center', 'to', 'learn', 'a', 'precision', 'matrix', 'we', 'demonstrate', 'empirically', 'the', 'reliability', 'of', 'the', 'model']]
|
[-0.002471777936878884, 0.020068252179690063, -0.11389411941919232, 0.057647884589004265, -0.10910769608132889, -0.12845054880507012, 0.1205050598592802, 0.4321452647308323, -0.30529698756932516, -0.2887218238211402, 0.05065148405047464, -0.2887134883970579, -0.14553932288539745, 0.14329955836096517, -0.10473562285269254, 0.0631833185096898, 0.09970545243019256, 0.0760937801161868, -0.08258017892818724, -0.2633981620283606, 0.363393105159592, 0.07920384438377674, 0.335987100005585, -0.06366199183182042, 0.158211628702974, 0.06167545763636443, -0.031281745374620515, -0.014416046456377257, -0.06676638990240259, 0.1894168790862852, 0.25799258656268853, 0.21563520577788423, 0.3748456120282133, -0.36278166110967625, -0.22753162519727774, 0.1356073439874138, 0.11713057546604372, 0.10783845466500688, -0.02472750140597748, -0.3208137814512598, 0.07101304586715648, -0.15719010400646757, -0.06401658540800492, -0.08364263034554059, -0.05073656325411295, -0.027748045024122592, -0.3076862024021483, 0.009825253302109576, 0.04490057184038875, 0.02576995856851061, -0.11398052697170039, -0.07327348647082102, -0.002965940027628268, 0.14259405077704898, 0.016969266231987783, 0.05675666007674604, 0.14527799620806614, -0.12885808580877067, -0.08299814000351477, 0.32942825940298354, -0.052790981972678216, -0.22593657867373707, 0.13635786349023474, -0.11932050317273449, -0.11394561944468487, 0.1100955796384505, 0.23702032982902688, 0.10524468022076605, -0.19328820754155934, 0.08324071385453795, -0.0323103773761236, 0.13041652443331328, 0.008759560981747981, -0.045629459633448416, 0.1770541944897899, 0.22187665722846428, 0.07183258366884193, 0.1793734860197406, -0.1650193191925499, -0.06380727171253796, -0.272477830916852, -0.11672195830060361, -0.21390181293419483, -0.040477292083430094, -0.16776848891662938, -0.10152687205213326, 0.4125988405180451, 0.19417783763982077, 0.3126211233663364, 0.09473487947170979, 0.3197135366325345, 0.055588033988149224, 0.09732110069403163, 0.10512679880571978, 0.1516720822046154, 0.06233166115549959, 0.07934785241622339, -0.18144100718417805, 0.08459408468105525, 0.03744017071673803]
|
1,803.06953
|
Entropy solutions for stochastic porous media equations
|
We provide an entropy formulation for porous medium-type equations with a
stochastic, non-linear, spatially inhomogeneous forcing. Well - posedness and
$L_1$-contraction is obtained in the class of entropy solutions. Our scope
allows for porous medium operators $\Delta (|u|^{m-1}u)$ for all
$m\in(1,\infty)$, and H\"older continuous diffusion nonlinearity with exponent
$1/2$.
|
math.PR math.AP
|
we provide an entropy formulation for porous mediumtype equations with a stochastic nonlinear spatially inhomogeneous forcing well posedness and l_1contraction is obtained in the class of entropy solutions our scope allows for porous medium operators delta um1u for all min1infty and holder continuous diffusion nonlinearity with exponent 12
|
[['we', 'provide', 'an', 'entropy', 'formulation', 'for', 'porous', 'mediumtype', 'equations', 'with', 'a', 'stochastic', 'nonlinear', 'spatially', 'inhomogeneous', 'forcing', 'well', 'posedness', 'and', 'l_1contraction', 'is', 'obtained', 'in', 'the', 'class', 'of', 'entropy', 'solutions', 'our', 'scope', 'allows', 'for', 'porous', 'medium', 'operators', 'delta', 'um1u', 'for', 'all', 'min1infty', 'and', 'holder', 'continuous', 'diffusion', 'nonlinearity', 'with', 'exponent', '12']]
|
[-0.09338556493942936, 0.09936935070986187, -0.010303268405712314, 0.01760244418401271, -0.07941823645313788, -0.16382119133033687, -0.05389914208402236, 0.317547257989645, -0.325947934616771, -0.19910354895724192, 0.13176137963568585, -0.317589560694695, -0.1118570703185267, 0.1990974426890413, -0.03151526256567902, 0.16150347014061278, -0.011423196974727842, -0.052953568519377665, -0.015262133183164729, -0.1853000136816667, 0.3714135742849774, -0.05280501176085737, 0.20383836163414848, 0.03812048159953621, 0.11545247014405, -0.015793585011528596, -0.03540664800546235, 0.09155180955098735, -0.2196969038289454, 0.0617217965837982, 0.22686525873012012, 0.026390561223444013, 0.2817575388484531, -0.40402140720850893, -0.33859328490992385, 0.08570576792375909, 0.08284101370243459, 0.10819241367280483, -0.057526000816788936, -0.2930483709192938, 0.009480972319013542, -0.12888271837598747, -0.24406335378686586, -0.10594082015256087, 0.047948963070909185, 0.10636730636987421, -0.3869196074290408, 0.2087621282786131, 0.08877485349205219, 0.00761142751822869, -0.18965512976800608, -0.06816158667206765, -0.009129305680592855, 0.03668378764349553, -0.01957584796473384, -0.02393833627510402, 0.0641750652756956, -0.12225970935283435, -0.04171167113300827, 0.3450840389356017, -0.15168541001362934, -0.2983885678152243, 0.17597924098372458, -0.13463882193383242, -0.07072499129507277, 0.14622099451306794, 0.1657600722482635, 0.15027604560471244, -0.20657703429460525, 0.10298281949168692, -0.027301726655827627, 0.1864772792491648, 0.0411962183813254, 0.05376477458824714, 0.03899863954219553, 0.1932746162146537, 0.17413755091321137, 0.1600574220220248, -0.008223786895784239, -0.1390288288705051, -0.33978575418392815, -0.18089349816242853, -0.10904976609939089, 0.13099639769126142, -0.20525828708519434, -0.2016668487754133, 0.34157554079881974, 0.08866352051910427, 0.12135377304835451, 0.131488886454867, 0.17302222480583523, 0.1913929883106094, -0.024734597984287475, 0.15308655789121986, 0.18302504221598306, 0.2098611372212569, 0.24864554341054626, -0.18743581576272844, 0.04817980336439279, 0.15454406988703542]
|
1,803.06954
|
Spectral analyses of trans- and cis-DOCO transients via comb
spectroscopy
|
We use time-resolved direct frequency comb spectroscopy in the mid-infrared
to obtain high-resolution rovibrational spectra of products produced from the
OD+CO reaction. In this work, we present spectral analyses for isotopologues of
the transient DOCO radicals from this reaction in the OD stretch region. The
analyses were performed with aid of two different theoretical approaches based
on both perturbation theory and variational calculations used for prediction of
rovibrational spectra of polyatomic molecules. We discuss the advantages and
challenges of our current approach for studying spectroscopy and dynamics of
transient molecules.
|
physics.chem-ph physics.optics
|
we use timeresolved direct frequency comb spectroscopy in the midinfrared to obtain highresolution rovibrational spectra of products produced from the odco reaction in this work we present spectral analyses for isotopologues of the transient doco radicals from this reaction in the od stretch region the analyses were performed with aid of two different theoretical approaches based on both perturbation theory and variational calculations used for prediction of rovibrational spectra of polyatomic molecules we discuss the advantages and challenges of our current approach for studying spectroscopy and dynamics of transient molecules
|
[['we', 'use', 'timeresolved', 'direct', 'frequency', 'comb', 'spectroscopy', 'in', 'the', 'midinfrared', 'to', 'obtain', 'highresolution', 'rovibrational', 'spectra', 'of', 'products', 'produced', 'from', 'the', 'odco', 'reaction', 'in', 'this', 'work', 'we', 'present', 'spectral', 'analyses', 'for', 'isotopologues', 'of', 'the', 'transient', 'doco', 'radicals', 'from', 'this', 'reaction', 'in', 'the', 'od', 'stretch', 'region', 'the', 'analyses', 'were', 'performed', 'with', 'aid', 'of', 'two', 'different', 'theoretical', 'approaches', 'based', 'on', 'both', 'perturbation', 'theory', 'and', 'variational', 'calculations', 'used', 'for', 'prediction', 'of', 'rovibrational', 'spectra', 'of', 'polyatomic', 'molecules', 'we', 'discuss', 'the', 'advantages', 'and', 'challenges', 'of', 'our', 'current', 'approach', 'for', 'studying', 'spectroscopy', 'and', 'dynamics', 'of', 'transient', 'molecules']]
|
[-0.031082476815208794, 0.03635056178188986, -0.0739535714894171, -0.001979774058175584, 0.008853693839369549, -0.0637543439399451, 0.08846207342964287, 0.4271287475609117, -0.22763180939170222, -0.26119244343394205, 0.049085385058747814, -0.28949838714260195, -0.08731907473670111, 0.21695555538301253, 0.04943717170422638, 0.06448813828950127, 0.11539320090992583, -0.08034809050667617, -0.015076309240733584, -0.12948147422478845, 0.2810621988442209, 0.07326260088529024, 0.226731291340871, 0.07655591354187992, 0.04623684566985402, -0.03035330239476429, -0.08724409984424711, -0.0770048381967677, -0.1984557859910031, 0.19353553724164765, 0.28758504767384796, 0.09199245190247893, 0.1927930719529589, -0.45913516062622267, -0.24895575249360669, 0.04468548198541005, 0.1557463083597314, 0.17097174849671623, -0.05091961284504375, -0.28006806497772535, -0.0031647495408025053, -0.13742284576098124, -0.12756687433510605, -0.1478625594948729, -0.024354188966875277, 0.06261276731060611, -0.2451678777087687, 0.0811132811009884, -0.049418909642716044, 0.1482305929497266, -0.14643447022988565, -0.1566328465162466, -0.014301521848473284, 0.12636506540390352, 0.001772527130217188, -0.04723075708154485, 0.14133966292461586, -0.10252813326919244, -0.14762034964126844, 0.3895411691731877, -0.1656410153851741, -0.07203105753805074, 0.20494894292464272, -0.1561091480569707, -0.22565132247594497, 0.17046140724172196, 0.14066454163855976, 0.21283212266862392, -0.13838161344821048, 0.02079779434263603, 0.04404077573368947, 0.16583392584903373, 0.08755720006302, 0.08823268982167873, 0.1438389602738122, 0.16976449601093513, -0.03305505935827063, 0.12795694100980956, -0.19512192755161475, -0.07473267372697592, -0.2232354330856146, -0.15897894347500469, -0.16948205499599378, 0.05951076376432967, -0.015280643610458356, -0.09244710282526082, 0.41187753615279993, 0.12008472633962002, 0.1758422957112392, -0.013705343701359299, 0.32958799600601196, 0.08227988839175346, 0.015192036255676713, 0.0032301135671635468, 0.27462811076806654, 0.169052634608104, 0.10208715161619088, -0.27810699314448156, 0.014988659236890575, 0.016086018013043536]
|
1,803.06955
|
AISC: Approximate Instruction Set Computer
|
This paper makes the case for a single-ISA heterogeneous computing platform,
AISC, where each compute engine (be it a core or an accelerator) supports a
different subset of the very same ISA. An ISA subset may not be functionally
complete, but the union of the (per compute engine) subsets renders a
functionally complete, platform-wide single ISA. Tailoring the
microarchitecture of each compute engine to the subset of the ISA that it
supports can easily reduce hardware complexity. At the same time, the energy
efficiency of computing can improve by exploiting algorithmic noise tolerance:
by mapping code sequences that can tolerate (any potential inaccuracy induced
by) the incomplete ISA-subsets to the corresponding compute engines.
|
cs.AR
|
this paper makes the case for a singleisa heterogeneous computing platform aisc where each compute engine be it a core or an accelerator supports a different subset of the very same isa an isa subset may not be functionally complete but the union of the per compute engine subsets renders a functionally complete platformwide single isa tailoring the microarchitecture of each compute engine to the subset of the isa that it supports can easily reduce hardware complexity at the same time the energy efficiency of computing can improve by exploiting algorithmic noise tolerance by mapping code sequences that can tolerate any potential inaccuracy induced by the incomplete isasubsets to the corresponding compute engines
|
[['this', 'paper', 'makes', 'the', 'case', 'for', 'a', 'singleisa', 'heterogeneous', 'computing', 'platform', 'aisc', 'where', 'each', 'compute', 'engine', 'be', 'it', 'a', 'core', 'or', 'an', 'accelerator', 'supports', 'a', 'different', 'subset', 'of', 'the', 'very', 'same', 'isa', 'an', 'isa', 'subset', 'may', 'not', 'be', 'functionally', 'complete', 'but', 'the', 'union', 'of', 'the', 'per', 'compute', 'engine', 'subsets', 'renders', 'a', 'functionally', 'complete', 'platformwide', 'single', 'isa', 'tailoring', 'the', 'microarchitecture', 'of', 'each', 'compute', 'engine', 'to', 'the', 'subset', 'of', 'the', 'isa', 'that', 'it', 'supports', 'can', 'easily', 'reduce', 'hardware', 'complexity', 'at', 'the', 'same', 'time', 'the', 'energy', 'efficiency', 'of', 'computing', 'can', 'improve', 'by', 'exploiting', 'algorithmic', 'noise', 'tolerance', 'by', 'mapping', 'code', 'sequences', 'that', 'can', 'tolerate', 'any', 'potential', 'inaccuracy', 'induced', 'by', 'the', 'incomplete', 'isasubsets', 'to', 'the', 'corresponding', 'compute', 'engines']]
|
[-0.12737894788680768, 0.06098961205861997, -0.03705114533235742, 0.046125953340775926, -0.09427303613840857, -0.1330633516762067, 0.08760518143271011, 0.3405537788502195, -0.32023841589689256, -0.31529617218131367, 0.08038862321779809, -0.24280718275430527, -0.06987297319256786, 0.24947352418464355, -0.08115279988639734, -0.010541330565783111, 0.09406431740022857, 0.047620270498604934, -0.04199530652681874, -0.2236973090689968, 0.26739441075531595, 0.09961490535431287, 0.28285427491434595, 0.034178851235827264, 0.08061346179297701, -0.017784837559288877, -0.016327660767869515, 0.030469591411846606, -0.01908192167717392, 0.13897286615207452, 0.2736318526281552, 0.2147971949667077, 0.2982222812080925, -0.4211735974658619, -0.17102218733423136, 0.1559630757367069, 0.12862260925837538, 0.09597824735736304, 0.004052480627697977, -0.2343060889598829, 0.14630712177604438, -0.20156143785200337, -0.08778647409159351, -0.09735584254799919, 0.04138818202032284, 0.03871782977472652, -0.2617970813785426, -0.03825967371125113, 0.04941944392313334, -0.018563536982136693, -0.02187586233591322, -0.06315704663284123, 0.013015124011276798, 0.1458447220544754, -0.07538242360407656, 0.06550051279958677, 0.18334849365690553, -0.09051333506464619, -0.14911229252730582, 0.4135995029895143, -0.0005101134746589444, -0.23857062855015762, 0.17187646858986805, -0.0668808487799569, -0.12671726017513057, 0.13673154073767363, 0.15582726332782346, 0.0672364607792009, -0.19278794524513862, 0.09864502001384443, -0.017017135599797423, 0.24377131567929278, 0.05476345448670062, 0.0537172366949645, 0.2212538950568573, 0.17966833487153053, 0.06747209927575155, 0.20491746257440271, -0.022007897102528, -0.02551796491342512, -0.28950492199510336, -0.18220412894787097, -0.21415088949830863, 0.025286632600711362, -0.1197702749335969, -0.1874545866835185, 0.39593232285908675, 0.13746361874827098, 0.16832580132071268, 0.0548347033306279, 0.3115538318556818, 0.11025655151937495, 0.12179526511939581, 0.16034443922848865, 0.13540092930197717, -0.0020918563918464563, 0.032113973326473075, -0.22263556565158069, 0.11142491187307645, 0.0405638004113412]
|
1,803.06956
|
On a question of Swan. With an Appendix by K\k{e}stutis
\v{C}esnavi\v{c}ius
|
We show that a regular local ring is a filtered inductive limit of regular
local rings, essentially of finite type over $\bf Z$. As an application the
cohomological purity conjecture is reduced to the complete case.
|
math.AC math.AG math.KT
|
we show that a regular local ring is a filtered inductive limit of regular local rings essentially of finite type over bf z as an application the cohomological purity conjecture is reduced to the complete case
|
[['we', 'show', 'that', 'a', 'regular', 'local', 'ring', 'is', 'a', 'filtered', 'inductive', 'limit', 'of', 'regular', 'local', 'rings', 'essentially', 'of', 'finite', 'type', 'over', 'bf', 'z', 'as', 'an', 'application', 'the', 'cohomological', 'purity', 'conjecture', 'is', 'reduced', 'to', 'the', 'complete', 'case']]
|
[-0.1893423594430917, 0.03695659295812624, -0.09551370718205969, 0.04894251617628874, -0.05670761733522846, -0.09747991822142568, -0.010562476443333758, 0.3084782203659415, -0.3278843609926601, -0.15326038991204566, 0.09919511820448355, -0.1768226619848671, -0.08753509727668846, 0.2189453390892595, -0.10298976668208423, -0.06316150409272975, 0.010434415553592973, 0.11079012929824078, -0.10455952242611805, -0.3597025402252459, 0.327156497993403, 0.011327344820731215, 0.28183188532582587, 0.008986526168882847, 0.09625931086743043, 0.07648881899917291, -0.019494376248783536, 0.1004668300350507, -0.13833793672549494, 0.08958179724221635, 0.26136752249052125, 0.06661692096127404, 0.19866513344459236, -0.349755951617327, -0.1126621271444795, 0.16103482505099642, 0.12263403289640944, 0.09636206122943097, 0.00243797829736852, -0.23326056791443583, 0.24074554306247997, -0.2298572932680448, -0.1882601184511764, -0.04432364573909177, 0.11264713579374883, 0.023437297178639308, -0.3053486986318603, 0.06638489632556836, 0.19246571922364333, 0.12387142929947004, -0.0327364030915002, -0.006521750804192076, -0.06697249371144506, 0.052295520461888775, -0.10234857869282779, -0.00337780704204407, 0.13302524608378816, -0.1070450954656634, -0.10319309366039103, 0.3025799921403329, -0.11270514997239742, -0.16363697360631907, 0.2048854566593137, -0.143185473461118, -0.094059601581345, 0.1450139018189576, 0.04744188994583157, 0.17998279030952188, -0.03820539783272478, 0.23545481305983332, -0.15660786243259078, 0.1459414593151046, 0.10211652657017112, 0.03342938419276228, 0.15869261094808784, 0.0944688788925608, 0.16239564887897964, 0.15323714239315855, -0.038152368325326175, -0.0005348504249316951, -0.38576219355066615, -0.18793773030241331, -0.1743286408794423, 0.18933764808914727, -0.08861821791571048, -0.21343403451869059, 0.3875882134048475, 0.050553150552635394, 0.18452999140653345, 0.07825812839695977, 0.21849821218185955, 0.11064600975239752, 0.036100917883838214, 0.009508229973208573, 0.13502479199734, 0.2169977021921012, -0.003000019257241446, -0.143503715387649, -0.054553721048351794, 0.1697250065497226]
|
1,803.06957
|
Quenched dynamics and spin-charge separation in an interacting
topological lattice
|
We analyze the static and dynamical properties of a one-dimensional
topological lattice, the fermionic Su-Schrieffer-Heeger model, in the presence
of on-site interactions. Based on a study of charge and spin correlation
functions, we elucidate the nature of the topological edge modes, which
depending on the sign of the interactions, either display particles of opposite
spin on opposite edges, or a pair and a holon. This study of correlation
functions also highlights the strong entanglement that exists between the
opposite edges of the system. This last feature has remarkable consequences
upon subjecting the system to a quench, where an instantaneous edge-to-edge
signal appears in the correlation functions characterizing the edge modes.
Besides, other correlation functions are shown to propagate in the bulk
according to the light-cone imposed by the Lieb-Robinson bound. Our study
reveals how one-dimensional lattices exhibiting entangled topological edge
modes allow for a non-trivial correlation spreading, while providing an
accessible platform to detect spin-charge separation using state-of-the-art
experimental techniques.
|
cond-mat.quant-gas cond-mat.str-el quant-ph
|
we analyze the static and dynamical properties of a onedimensional topological lattice the fermionic suschriefferheeger model in the presence of onsite interactions based on a study of charge and spin correlation functions we elucidate the nature of the topological edge modes which depending on the sign of the interactions either display particles of opposite spin on opposite edges or a pair and a holon this study of correlation functions also highlights the strong entanglement that exists between the opposite edges of the system this last feature has remarkable consequences upon subjecting the system to a quench where an instantaneous edgetoedge signal appears in the correlation functions characterizing the edge modes besides other correlation functions are shown to propagate in the bulk according to the lightcone imposed by the liebrobinson bound our study reveals how onedimensional lattices exhibiting entangled topological edge modes allow for a nontrivial correlation spreading while providing an accessible platform to detect spincharge separation using stateoftheart experimental techniques
|
[['we', 'analyze', 'the', 'static', 'and', 'dynamical', 'properties', 'of', 'a', 'onedimensional', 'topological', 'lattice', 'the', 'fermionic', 'suschriefferheeger', 'model', 'in', 'the', 'presence', 'of', 'onsite', 'interactions', 'based', 'on', 'a', 'study', 'of', 'charge', 'and', 'spin', 'correlation', 'functions', 'we', 'elucidate', 'the', 'nature', 'of', 'the', 'topological', 'edge', 'modes', 'which', 'depending', 'on', 'the', 'sign', 'of', 'the', 'interactions', 'either', 'display', 'particles', 'of', 'opposite', 'spin', 'on', 'opposite', 'edges', 'or', 'a', 'pair', 'and', 'a', 'holon', 'this', 'study', 'of', 'correlation', 'functions', 'also', 'highlights', 'the', 'strong', 'entanglement', 'that', 'exists', 'between', 'the', 'opposite', 'edges', 'of', 'the', 'system', 'this', 'last', 'feature', 'has', 'remarkable', 'consequences', 'upon', 'subjecting', 'the', 'system', 'to', 'a', 'quench', 'where', 'an', 'instantaneous', 'edgetoedge', 'signal', 'appears', 'in', 'the', 'correlation', 'functions', 'characterizing', 'the', 'edge', 'modes', 'besides', 'other', 'correlation', 'functions', 'are', 'shown', 'to', 'propagate', 'in', 'the', 'bulk', 'according', 'to', 'the', 'lightcone', 'imposed', 'by', 'the', 'liebrobinson', 'bound', 'our', 'study', 'reveals', 'how', 'onedimensional', 'lattices', 'exhibiting', 'entangled', 'topological', 'edge', 'modes', 'allow', 'for', 'a', 'nontrivial', 'correlation', 'spreading', 'while', 'providing', 'an', 'accessible', 'platform', 'to', 'detect', 'spincharge', 'separation', 'using', 'stateoftheart', 'experimental', 'techniques']]
|
[-0.2101128617383438, 0.18184952759056613, -0.10791093247607933, 0.05556694365077419, -0.03356219452543883, -0.15384210645352142, 0.045959172437142114, 0.36490003840153806, -0.25147310372012727, -0.2395551665336825, 0.024488468934578123, -0.32694065478863193, -0.16283664852235233, 0.11781515397888143, 0.07058535687165204, 0.03091848513504374, 0.007561525894561783, 0.02132175429869676, -0.11248100087832427, -0.18733448948914883, 0.32608772735256936, 0.004400685754080769, 0.3176569875853602, 0.11879495503235375, 0.044690939926658756, 0.06702545114676468, 0.002382380219933111, 0.018658452292902437, -0.12766851583896824, 0.07514637055210187, 0.17564049395441544, -0.004608360459678806, 0.20985171998036095, -0.45945301165338603, -0.20496696367881667, 0.0879453664761968, 0.15895592618398952, 0.12853886397133465, -0.039668263834755635, -0.3122019783717406, 0.012035761502193053, -0.15660278130089864, -0.11960763146635145, -0.06829600219471103, 0.03246610950845934, 0.012282495067847777, -0.23614046984585002, 0.09308139265176578, 0.08430079507143091, 0.0526261770282872, -0.03407429251928988, -0.057528951873246116, -0.07818291283037979, 0.1281198217810015, 0.04430203501979122, 0.028692967648385092, 0.1073815513140289, -0.16654473936359865, -0.1718878118419525, 0.3426948325941339, -0.065354105206643, -0.2029526011683629, 0.25208313281618755, -0.15572311329015065, -0.08812885070510675, 0.09262434945467249, 0.1634007985732751, 0.07430182065145345, -0.12453736493189353, 0.057718137962001495, -0.04971115805674344, 0.17623683828496722, 0.03574127003084868, 0.12794682573585306, 0.2719653306645341, 0.13458131538063753, 0.09553696115035563, 0.20579492829892843, -0.06862951725634048, -0.10874078918714077, -0.2599935548263602, -0.1442741793627647, -0.23144234201172367, 0.02484905476158019, -0.07212541114977285, -0.185404949696931, 0.4801059412042378, 0.15229789177828934, 0.21202682943840045, 0.007861428734759101, 0.23204948845886975, 0.12202422966729501, 0.0729425023368094, 0.04484688427328365, 0.26040875810940634, 0.12607176845194773, 0.048838719876266624, -0.2830317609324993, 0.04084516234142939, 0.054148442692348905]
|
1,803.06958
|
Techniques for Shared Resource Management in Systems with Throughput
Processors
|
The continued growth of the computational capability of throughput processors
has made throughput processors the platform of choice for a wide variety of
high performance computing applications. Graphics Processing Units (GPUs) are a
prime example of throughput processors that can deliver high performance for
applications ranging from typical graphics applications to general-purpose data
parallel (GPGPU) applications. However, this success has been accompanied by
new performance bottlenecks throughout the memory hierarchy of GPU-based
systems. We identify and eliminate performance bottlenecks caused by major
sources of interference throughout the memory hierarchy.
We introduce changes to the memory hierarchy for systems with GPUs that allow
the memory hierarchy to be aware of both CPU and GPU applications'
characteristics. We introduce mechanisms to dynamically analyze different
applications' characteristics and propose four major changes throughout the
memory hierarchy. We propose changes to the cache management and memory
scheduling mechanisms to mitigate intra-application interference in GPGPU
applications. We propose changes to the memory controller design and its
scheduling policy to mitigate inter-application interference in heterogeneous
CPU-GPU systems. We redesign the MMU and the memory hierarchy in GPUs to be
aware of ddress-translation data in order to mitigate the inter-address-space
interference. We introduce a hardware-software cooperative technique that
modifies the memory allocation policy to enable large page support in order to
further reduce the inter-address-space interference at the shared Translation
Lookaside Buffer (TLB). Our evaluations show that the GPU-aware cache and
memory management techniques proposed in this dissertation are effective at
mitigating the interference caused by GPUs on current and future GPU-based
systems.
|
cs.AR
|
the continued growth of the computational capability of throughput processors has made throughput processors the platform of choice for a wide variety of high performance computing applications graphics processing units gpus are a prime example of throughput processors that can deliver high performance for applications ranging from typical graphics applications to generalpurpose data parallel gpgpu applications however this success has been accompanied by new performance bottlenecks throughout the memory hierarchy of gpubased systems we identify and eliminate performance bottlenecks caused by major sources of interference throughout the memory hierarchy we introduce changes to the memory hierarchy for systems with gpus that allow the memory hierarchy to be aware of both cpu and gpu applications characteristics we introduce mechanisms to dynamically analyze different applications characteristics and propose four major changes throughout the memory hierarchy we propose changes to the cache management and memory scheduling mechanisms to mitigate intraapplication interference in gpgpu applications we propose changes to the memory controller design and its scheduling policy to mitigate interapplication interference in heterogeneous cpugpu systems we redesign the mmu and the memory hierarchy in gpus to be aware of ddresstranslation data in order to mitigate the interaddressspace interference we introduce a hardwaresoftware cooperative technique that modifies the memory allocation policy to enable large page support in order to further reduce the interaddressspace interference at the shared translation lookaside buffer tlb our evaluations show that the gpuaware cache and memory management techniques proposed in this dissertation are effective at mitigating the interference caused by gpus on current and future gpubased systems
|
[['the', 'continued', 'growth', 'of', 'the', 'computational', 'capability', 'of', 'throughput', 'processors', 'has', 'made', 'throughput', 'processors', 'the', 'platform', 'of', 'choice', 'for', 'a', 'wide', 'variety', 'of', 'high', 'performance', 'computing', 'applications', 'graphics', 'processing', 'units', 'gpus', 'are', 'a', 'prime', 'example', 'of', 'throughput', 'processors', 'that', 'can', 'deliver', 'high', 'performance', 'for', 'applications', 'ranging', 'from', 'typical', 'graphics', 'applications', 'to', 'generalpurpose', 'data', 'parallel', 'gpgpu', 'applications', 'however', 'this', 'success', 'has', 'been', 'accompanied', 'by', 'new', 'performance', 'bottlenecks', 'throughout', 'the', 'memory', 'hierarchy', 'of', 'gpubased', 'systems', 'we', 'identify', 'and', 'eliminate', 'performance', 'bottlenecks', 'caused', 'by', 'major', 'sources', 'of', 'interference', 'throughout', 'the', 'memory', 'hierarchy', 'we', 'introduce', 'changes', 'to', 'the', 'memory', 'hierarchy', 'for', 'systems', 'with', 'gpus', 'that', 'allow', 'the', 'memory', 'hierarchy', 'to', 'be', 'aware', 'of', 'both', 'cpu', 'and', 'gpu', 'applications', 'characteristics', 'we', 'introduce', 'mechanisms', 'to', 'dynamically', 'analyze', 'different', 'applications', 'characteristics', 'and', 'propose', 'four', 'major', 'changes', 'throughout', 'the', 'memory', 'hierarchy', 'we', 'propose', 'changes', 'to', 'the', 'cache', 'management', 'and', 'memory', 'scheduling', 'mechanisms', 'to', 'mitigate', 'intraapplication', 'interference', 'in', 'gpgpu', 'applications', 'we', 'propose', 'changes', 'to', 'the', 'memory', 'controller', 'design', 'and', 'its', 'scheduling', 'policy', 'to', 'mitigate', 'interapplication', 'interference', 'in', 'heterogeneous', 'cpugpu', 'systems', 'we', 'redesign', 'the', 'mmu', 'and', 'the', 'memory', 'hierarchy', 'in', 'gpus', 'to', 'be', 'aware', 'of', 'ddresstranslation', 'data', 'in', 'order', 'to', 'mitigate', 'the', 'interaddressspace', 'interference', 'we', 'introduce', 'a', 'hardwaresoftware', 'cooperative', 'technique', 'that', 'modifies', 'the', 'memory', 'allocation', 'policy', 'to', 'enable', 'large', 'page', 'support', 'in', 'order', 'to', 'further', 'reduce', 'the', 'interaddressspace', 'interference', 'at', 'the', 'shared', 'translation', 'lookaside', 'buffer', 'tlb', 'our', 'evaluations', 'show', 'that', 'the', 'gpuaware', 'cache', 'and', 'memory', 'management', 'techniques', 'proposed', 'in', 'this', 'dissertation', 'are', 'effective', 'at', 'mitigating', 'the', 'interference', 'caused', 'by', 'gpus', 'on', 'current', 'and', 'future', 'gpubased', 'systems']]
|
[-0.2212174776978349, 0.0324569381810283, -0.021236552547648727, 0.041559061785541446, -0.10439979379238347, -0.17801548464024963, 0.09608254234100372, 0.41991463372034754, -0.32137885990850773, -0.3816784904117552, 0.10349895406915648, -0.2279418702991937, -0.1476348280177816, 0.18316592664822287, -0.15120443589470015, 0.09626606582611498, 0.10730543174841758, -0.0241706931288078, -0.05444729043973293, -0.30081195743633027, 0.24665719953104007, 0.12112796984119673, 0.35045299862268503, 0.06881753260291848, 0.073690258337621, -0.04396076532257463, -0.015262477806669922, -0.05589374202068227, -0.04738714344193975, 0.12125925577014203, 0.30699218921510596, 0.18578857611294233, 0.32608165602998535, -0.4925692831589417, -0.18292069637212946, 0.0647761557709514, 0.15856102155193663, 0.038873088942737624, -0.06671877834152637, -0.22740194953521603, 0.13456079627828038, -0.22977844684977422, -0.02977576509961056, -0.13540096747874847, -0.017720479067238306, 0.03380722011804853, -0.23974921939187782, -0.018222851689887444, 0.006792085935461074, 0.01969612227097566, 0.0032722720349016104, -0.1118986641384455, 0.09509460331794801, 0.1538644346128781, -0.0005872830373084121, -0.0027463658562798805, 0.15954110524414675, -0.12865456582043364, -0.20482541088073739, 0.40091976647821104, -0.00608211349541314, -0.18871573654551926, 0.17374309732531762, -0.0343520191568042, -0.17687050502617538, 0.10535876998464345, 0.29925507209871127, -0.0011616200705614722, -0.16748244122311237, 0.05116604441747423, 0.09719419140362258, 0.19976300007034195, 0.08235305686768424, 0.11020549327841861, 0.16793396302430777, 0.26967725306086743, 0.0584346951857916, 0.1630010793175136, -0.10725755072493298, -0.13351058169993252, -0.17102637437076526, -0.17828221971780178, -0.16571312813776667, -0.029292733375380634, -0.0769494285327548, -0.11055806571532137, 0.37314377241149516, 0.2423999548996449, 0.09589920050129588, 0.09408559517185121, 0.4034924793384763, 0.06241379621422117, 0.2188502581451427, 0.15942116570658982, 0.0950820561928174, 0.00866928116028223, 0.22337788868909003, -0.2799621283894832, 0.05849271594179084, -0.0633990174737343]
|
1,803.06959
|
On the importance of single directions for generalization
|
Despite their ability to memorize large datasets, deep neural networks often
achieve good generalization performance. However, the differences between the
learned solutions of networks which generalize and those which do not remain
unclear. Additionally, the tuning properties of single directions (defined as
the activation of a single unit or some linear combination of units in response
to some input) have been highlighted, but their importance has not been
evaluated. Here, we connect these lines of inquiry to demonstrate that a
network's reliance on single directions is a good predictor of its
generalization performance, across networks trained on datasets with different
fractions of corrupted labels, across ensembles of networks trained on datasets
with unmodified labels, across different hyperparameters, and over the course
of training. While dropout only regularizes this quantity up to a point, batch
normalization implicitly discourages single direction reliance, in part by
decreasing the class selectivity of individual units. Finally, we find that
class selectivity is a poor predictor of task importance, suggesting not only
that networks which generalize well minimize their dependence on individual
units by reducing their selectivity, but also that individually selective units
may not be necessary for strong network performance.
|
stat.ML cs.AI cs.LG cs.NE
|
despite their ability to memorize large datasets deep neural networks often achieve good generalization performance however the differences between the learned solutions of networks which generalize and those which do not remain unclear additionally the tuning properties of single directions defined as the activation of a single unit or some linear combination of units in response to some input have been highlighted but their importance has not been evaluated here we connect these lines of inquiry to demonstrate that a networks reliance on single directions is a good predictor of its generalization performance across networks trained on datasets with different fractions of corrupted labels across ensembles of networks trained on datasets with unmodified labels across different hyperparameters and over the course of training while dropout only regularizes this quantity up to a point batch normalization implicitly discourages single direction reliance in part by decreasing the class selectivity of individual units finally we find that class selectivity is a poor predictor of task importance suggesting not only that networks which generalize well minimize their dependence on individual units by reducing their selectivity but also that individually selective units may not be necessary for strong network performance
|
[['despite', 'their', 'ability', 'to', 'memorize', 'large', 'datasets', 'deep', 'neural', 'networks', 'often', 'achieve', 'good', 'generalization', 'performance', 'however', 'the', 'differences', 'between', 'the', 'learned', 'solutions', 'of', 'networks', 'which', 'generalize', 'and', 'those', 'which', 'do', 'not', 'remain', 'unclear', 'additionally', 'the', 'tuning', 'properties', 'of', 'single', 'directions', 'defined', 'as', 'the', 'activation', 'of', 'a', 'single', 'unit', 'or', 'some', 'linear', 'combination', 'of', 'units', 'in', 'response', 'to', 'some', 'input', 'have', 'been', 'highlighted', 'but', 'their', 'importance', 'has', 'not', 'been', 'evaluated', 'here', 'we', 'connect', 'these', 'lines', 'of', 'inquiry', 'to', 'demonstrate', 'that', 'a', 'networks', 'reliance', 'on', 'single', 'directions', 'is', 'a', 'good', 'predictor', 'of', 'its', 'generalization', 'performance', 'across', 'networks', 'trained', 'on', 'datasets', 'with', 'different', 'fractions', 'of', 'corrupted', 'labels', 'across', 'ensembles', 'of', 'networks', 'trained', 'on', 'datasets', 'with', 'unmodified', 'labels', 'across', 'different', 'hyperparameters', 'and', 'over', 'the', 'course', 'of', 'training', 'while', 'dropout', 'only', 'regularizes', 'this', 'quantity', 'up', 'to', 'a', 'point', 'batch', 'normalization', 'implicitly', 'discourages', 'single', 'direction', 'reliance', 'in', 'part', 'by', 'decreasing', 'the', 'class', 'selectivity', 'of', 'individual', 'units', 'finally', 'we', 'find', 'that', 'class', 'selectivity', 'is', 'a', 'poor', 'predictor', 'of', 'task', 'importance', 'suggesting', 'not', 'only', 'that', 'networks', 'which', 'generalize', 'well', 'minimize', 'their', 'dependence', 'on', 'individual', 'units', 'by', 'reducing', 'their', 'selectivity', 'but', 'also', 'that', 'individually', 'selective', 'units', 'may', 'not', 'be', 'necessary', 'for', 'strong', 'network', 'performance']]
|
[-0.06312911519094203, 0.04807242478948469, -0.007319000381259964, 0.03903039191216708, -0.09993821491654485, -0.17393256198996918, 0.08931705370091667, 0.49269531212556056, -0.29018250858554473, -0.3406270034456005, 0.0654524232344463, -0.2584725188712279, -0.17183942869902613, 0.19310017288483391, -0.10821282447029192, 0.053268293479684356, 0.1250994769214557, 0.047025123751984955, -0.0740213730563529, -0.32330791409939336, 0.28596176460194284, 0.07905944834257332, 0.3543814217349371, 0.024057284967066387, 0.12720916882479708, -0.043700639566892414, -0.01136985496761134, 0.03242911791416984, -0.015999051936430475, 0.13804790841845366, 0.26346651322853104, 0.12563670088226597, 0.34468717286840844, -0.4188336997651137, -0.25359053009022503, 0.1432140019793923, 0.16016274758342963, 0.071339537997548, -0.0026721438106435996, -0.25723241120576856, 0.09878747806382868, -0.13473933055961074, -0.006564766454558151, -0.14287673756599617, -0.0143031154675648, 0.06553294700003252, -0.23523905765599548, 0.048066244745859875, 0.06647304512369327, 0.07431757645756126, -0.031254811990313616, -0.13865313085202033, -0.029354747161209487, 0.19665033181842703, 0.05812127183263118, 0.02271947330341507, 0.16262193273943967, -0.18522198253120176, -0.1145107005794461, 0.3259083888326318, -0.04522776380032062, -0.2536838756778683, 0.2123104317089877, -0.08414289840520957, -0.15982805164650274, 0.10476019547488062, 0.20092686750352956, 0.09619638164265033, -0.1592901587151946, 0.0004043497998888294, -0.03612969974294687, 0.20248795199545266, 0.06887238387209482, 0.0687984510181615, 0.20851820116050732, 0.17618981483511817, 0.018175032149809294, 0.11112840351475499, -0.08715615814599471, -0.08365526590496301, -0.22448459702412574, -0.0846160856478561, -0.21042938394806324, 0.014895066118034988, -0.09072059905141568, -0.16704530154999633, 0.3894922770870229, 0.18529195714419563, 0.26268942214739627, 0.11960749517281492, 0.26704360767004964, 0.023986562080561925, 0.17176020432215852, 0.06133193302487668, 0.22239656631434815, 0.04992305314263854, 0.10563723505653727, -0.18378944137157538, 0.14357437080023094, -0.021366493489879828]
|
1,803.0696
|
Ready, Set, Verify! Applying hs-to-coq to real-world Haskell code
|
Good tools can bring mechanical verification to programs written in
mainstream functional languages. We use hs-to-coq to translate significant
portions of Haskell's containers library into Coq, and verify it against
specifications that we derive from a variety of sources including type class
laws, the library's test suite, and interfaces from Coq's standard library. Our
work shows that it is feasible to verify mature, widely-used, highly optimized,
and unmodified Haskell code. We also learn more about the theory of
weight-balanced trees, extend hs-to-coq to handle partiality, and -- since we
found no bugs -- attest to the superb quality of well-tested functional code.
|
cs.PL
|
good tools can bring mechanical verification to programs written in mainstream functional languages we use hstocoq to translate significant portions of haskells containers library into coq and verify it against specifications that we derive from a variety of sources including type class laws the librarys test suite and interfaces from coqs standard library our work shows that it is feasible to verify mature widelyused highly optimized and unmodified haskell code we also learn more about the theory of weightbalanced trees extend hstocoq to handle partiality and since we found no bugs attest to the superb quality of welltested functional code
|
[['good', 'tools', 'can', 'bring', 'mechanical', 'verification', 'to', 'programs', 'written', 'in', 'mainstream', 'functional', 'languages', 'we', 'use', 'hstocoq', 'to', 'translate', 'significant', 'portions', 'of', 'haskells', 'containers', 'library', 'into', 'coq', 'and', 'verify', 'it', 'against', 'specifications', 'that', 'we', 'derive', 'from', 'a', 'variety', 'of', 'sources', 'including', 'type', 'class', 'laws', 'the', 'librarys', 'test', 'suite', 'and', 'interfaces', 'from', 'coqs', 'standard', 'library', 'our', 'work', 'shows', 'that', 'it', 'is', 'feasible', 'to', 'verify', 'mature', 'widelyused', 'highly', 'optimized', 'and', 'unmodified', 'haskell', 'code', 'we', 'also', 'learn', 'more', 'about', 'the', 'theory', 'of', 'weightbalanced', 'trees', 'extend', 'hstocoq', 'to', 'handle', 'partiality', 'and', 'since', 'we', 'found', 'no', 'bugs', 'attest', 'to', 'the', 'superb', 'quality', 'of', 'welltested', 'functional', 'code']]
|
[-0.030042703048093245, -0.06471465464215725, -0.11767993009125348, 0.13048985332832672, -0.13795154266990722, -0.1926050349092111, 0.05409046416694764, 0.3822479382716119, -0.2702389717823826, -0.3636153743974864, 0.07815001763519831, -0.2621497694775462, -0.10624885435216129, 0.26941613292554395, -0.10463051629252731, 0.08446037666872144, 0.13306330351158976, -0.07325087750563399, -0.0262500918796286, -0.25402707570348865, 0.2570556640625, 0.04771202069474384, 0.2777558573335409, 0.04824101602192968, 0.056836891048587856, -0.004193707499653101, -0.06358088346663862, 0.03823233452596469, -0.09494403541160863, 0.13541608032071964, 0.3263610034249723, 0.25429040633141997, 0.2350369101949036, -0.4467219793982804, -0.13851028838194906, 0.009784693095134571, 0.0720966662641149, 0.1257286071591079, -0.03708489248834667, -0.26451795831788333, 0.16209987575886772, -0.23552340038120748, -0.0868452581577003, -0.15847523035481573, -0.012749034082517027, 0.014617647361010313, -0.20096524886321276, -0.06467209265596466, 0.0547013733908534, 0.06633555058157072, 0.003785765911452472, -0.13102871663169935, -0.03537152440985665, 0.13381962462270167, 0.006813679996412247, 0.035403504630085084, 0.14742630038410426, -0.07636271243914962, -0.12385449468158186, 0.38881557986605914, -0.06386080633848906, -0.1573642226192169, 0.27749925224110483, -0.046147910091094674, -0.19159094048198314, 0.08226215805858374, 0.19720719827339053, 0.07970782521762886, -0.17998619763180612, 0.08687438148306682, -0.0020754558127373457, 0.2860536006486655, 0.06469615209847689, -0.004710114769550273, 0.17503583897370845, 0.14199794739019125, -0.03446577887050808, 0.18241624860092998, 0.027706723529845476, -0.092907326919958, -0.2730677689984441, -0.19077100816182793, -0.09985385474516079, -0.029883443553990217, -0.045805784435360694, -0.21518250935376274, 0.35269311655312774, 0.23652047528419642, 0.029133632481098175, 0.1270799396559596, 0.2969053571484983, 0.013572388720931486, 0.1539007089380175, 0.13879006824921816, 0.15312228091061114, 0.08283955543534831, 0.11041637702845036, -0.1366033405251801, 0.07817009433405474, 0.00461988509632647]
|
1,803.06961
|
Enhanced spin-orbit torque via interface engineering in Pt/CoFeB/MgO
heterostructures
|
Spin-orbit torque facilitates efficient magnetization switching via an
in-plane current in perpendicularly magnetized heavy metal/ferromagnet
heterostructures. The efficiency of spin-orbit-torque-induced switching is
determined by the charge-to-spin conversion arising from either bulk or
interfacial spin-orbit interactions, or both. Here, we demonstrate that the
spin-orbit torque and the resultant switching efficiency in Pt/CoFeB systems
are significantly enhanced by an interfacial modification involving Ti
insertion between the Pt and CoFeB layers. Spin pumping and X-ray magnetic
circular dichroism experiments reveal that this enhancement is due to an
additional interface-generated spin current of the nonmagnetic interface and/or
improved spin transparency achieved by suppressing the proximity-induced moment
in the Pt layer. Our results demonstrate that interface engineering affords an
effective approach to improve spin-orbit torque and thereby magnetization
switching efficiency.
|
cond-mat.mtrl-sci
|
spinorbit torque facilitates efficient magnetization switching via an inplane current in perpendicularly magnetized heavy metalferromagnet heterostructures the efficiency of spinorbittorqueinduced switching is determined by the chargetospin conversion arising from either bulk or interfacial spinorbit interactions or both here we demonstrate that the spinorbit torque and the resultant switching efficiency in ptcofeb systems are significantly enhanced by an interfacial modification involving ti insertion between the pt and cofeb layers spin pumping and xray magnetic circular dichroism experiments reveal that this enhancement is due to an additional interfacegenerated spin current of the nonmagnetic interface andor improved spin transparency achieved by suppressing the proximityinduced moment in the pt layer our results demonstrate that interface engineering affords an effective approach to improve spinorbit torque and thereby magnetization switching efficiency
|
[['spinorbit', 'torque', 'facilitates', 'efficient', 'magnetization', 'switching', 'via', 'an', 'inplane', 'current', 'in', 'perpendicularly', 'magnetized', 'heavy', 'metalferromagnet', 'heterostructures', 'the', 'efficiency', 'of', 'spinorbittorqueinduced', 'switching', 'is', 'determined', 'by', 'the', 'chargetospin', 'conversion', 'arising', 'from', 'either', 'bulk', 'or', 'interfacial', 'spinorbit', 'interactions', 'or', 'both', 'here', 'we', 'demonstrate', 'that', 'the', 'spinorbit', 'torque', 'and', 'the', 'resultant', 'switching', 'efficiency', 'in', 'ptcofeb', 'systems', 'are', 'significantly', 'enhanced', 'by', 'an', 'interfacial', 'modification', 'involving', 'ti', 'insertion', 'between', 'the', 'pt', 'and', 'cofeb', 'layers', 'spin', 'pumping', 'and', 'xray', 'magnetic', 'circular', 'dichroism', 'experiments', 'reveal', 'that', 'this', 'enhancement', 'is', 'due', 'to', 'an', 'additional', 'interfacegenerated', 'spin', 'current', 'of', 'the', 'nonmagnetic', 'interface', 'andor', 'improved', 'spin', 'transparency', 'achieved', 'by', 'suppressing', 'the', 'proximityinduced', 'moment', 'in', 'the', 'pt', 'layer', 'our', 'results', 'demonstrate', 'that', 'interface', 'engineering', 'affords', 'an', 'effective', 'approach', 'to', 'improve', 'spinorbit', 'torque', 'and', 'thereby', 'magnetization', 'switching', 'efficiency']]
|
[-0.2130107814483645, 0.18737157647199404, 0.03181146877027312, -0.036653613967392897, -0.08716003418028835, -0.13902916687150155, 0.05635579311403431, 0.4453740684435733, -0.3126987514401516, -0.35946341994548997, -0.033754034173926487, -0.2624311258475627, -0.10966282428219734, 0.23192406180239614, 0.04839102747744971, -0.01985105840468614, 0.0013885235661760934, -0.1453978526312107, -0.08957189929318585, -0.15675085655434925, 0.2619559336453676, 0.033099523700413205, 0.3592703523106813, 0.15724953646197043, 0.04530337491192885, 0.04814550928741453, 0.14038980465134485, -0.005751028951753171, -0.07387887880166442, 0.0899500483091317, 0.19687640337994503, -0.15907775294861845, 0.12924218212186045, -0.5323852414392957, -0.17735053724825248, -0.06217925969300972, 0.13064175895640567, 0.1551287754217253, -0.14481666127610351, -0.26706494012426946, 0.05288670713742895, -0.187702130985159, -0.06735973590759621, -0.13065605441055772, -0.013580830902942726, -0.017935516887284335, -0.33352399718827536, 0.06026720180201547, 0.17393982307159253, 0.09469252753995298, -0.06075319611362272, -0.11753697067333926, -0.150524060608023, 0.021511898218323628, 0.07959683557677519, 0.07036652618591042, 0.22643795036785905, -0.15199602733088297, -0.1854075618997036, 0.2807897358772255, -0.07731353417940197, -0.1564041918428566, 0.1571359829451408, -0.1483359913859937, 0.020170675571857682, 0.1457889855749184, 0.1470996648441219, 0.11755732362226193, -0.1420272550735277, 0.06397264268279317, 0.08034745661631948, 0.18393828555746305, 0.05045180812650811, 0.03750664245096907, 0.2781636513198816, 0.21195406533567415, 0.07894017535868296, 0.14812351374383714, -0.15181441208527935, -0.028121891057854818, -0.14227135107672262, -0.16786384997859358, -0.2116185516915134, 0.0775935648144373, -0.10567404096899179, -0.10004930417879575, 0.3509044025070785, 0.1876882236420868, 0.13134788787142643, -0.08089452345983215, 0.339859532965948, 0.14059828980093553, 0.09106973440746867, 0.02985614332776036, 0.33662033944781267, 0.20281696651551512, 0.13554941578918406, -0.42470680157496266, 0.12757257779782277, -0.04614167886921355]
|
1,803.06962
|
Featureless: Bypassing feature extraction in action categorization
|
This method introduces an efficient manner of learning action categories
without the need of feature estimation. The approach starts from low-level
values, in a similar style to the successful CNN methods. However, rather than
extracting general image features, we learn to predict specific video
representations from raw video data. The benefit of such an approach is that at
the same computational expense it can predict 2 D video representations as well
as 3 D ones, based on motion. The proposed model relies on discriminative
Waldboost, which we enhance to a multiclass formulation for the purpose of
learning video representations. The suitability of the proposed approach as
well as its time efficiency are tested on the UCF11 action recognition dataset.
|
cs.CV
|
this method introduces an efficient manner of learning action categories without the need of feature estimation the approach starts from lowlevel values in a similar style to the successful cnn methods however rather than extracting general image features we learn to predict specific video representations from raw video data the benefit of such an approach is that at the same computational expense it can predict 2 d video representations as well as 3 d ones based on motion the proposed model relies on discriminative waldboost which we enhance to a multiclass formulation for the purpose of learning video representations the suitability of the proposed approach as well as its time efficiency are tested on the ucf11 action recognition dataset
|
[['this', 'method', 'introduces', 'an', 'efficient', 'manner', 'of', 'learning', 'action', 'categories', 'without', 'the', 'need', 'of', 'feature', 'estimation', 'the', 'approach', 'starts', 'from', 'lowlevel', 'values', 'in', 'a', 'similar', 'style', 'to', 'the', 'successful', 'cnn', 'methods', 'however', 'rather', 'than', 'extracting', 'general', 'image', 'features', 'we', 'learn', 'to', 'predict', 'specific', 'video', 'representations', 'from', 'raw', 'video', 'data', 'the', 'benefit', 'of', 'such', 'an', 'approach', 'is', 'that', 'at', 'the', 'same', 'computational', 'expense', 'it', 'can', 'predict', '2', 'd', 'video', 'representations', 'as', 'well', 'as', '3', 'd', 'ones', 'based', 'on', 'motion', 'the', 'proposed', 'model', 'relies', 'on', 'discriminative', 'waldboost', 'which', 'we', 'enhance', 'to', 'a', 'multiclass', 'formulation', 'for', 'the', 'purpose', 'of', 'learning', 'video', 'representations', 'the', 'suitability', 'of', 'the', 'proposed', 'approach', 'as', 'well', 'as', 'its', 'time', 'efficiency', 'are', 'tested', 'on', 'the', 'ucf11', 'action', 'recognition', 'dataset']]
|
[-0.003488011579266039, -0.017423517835056173, -0.11686017488571421, 0.048999257992471616, -0.10969057953048308, -0.16261463334894408, -0.001522584076402551, 0.4198559004876573, -0.27325955840711624, -0.3586410090200982, 0.08364033497281972, -0.2605645111761987, -0.17790056870839857, 0.19936674545811078, -0.15205931378986245, 0.06694268311585509, 0.12047014370860563, 0.13180448170514555, -0.0745273354025242, -0.2630361088658131, 0.3018292679088348, 0.05209135318616942, 0.3676285445157407, 0.011509058831291179, 0.14674096328889066, -0.0052368321448122545, -0.05348220230124583, -0.0462209780353232, -0.01631678947894015, 0.19459091363498404, 0.309694681663887, 0.20874287740927253, 0.30145231360309144, -0.3945642914701948, -0.22657340191999228, 0.05595710195237929, 0.14246355295102348, 0.1419239378656592, -0.03846074110469228, -0.33583474755918574, 0.10874920317082334, -0.1727480790972457, 0.012609757013397954, -0.158650344901678, -0.006358562873960551, -0.053476038251774605, -0.2947166672576282, 0.03710641925838792, 0.08555850510335511, 0.07255564480072867, -0.10012339524849775, -0.11949457341146072, 0.020593982537166548, 0.18954692143646967, 0.048310438870507594, 0.07510332567459446, 0.15569592294504203, -0.2101875022112913, -0.12710277306831488, 0.429796378917487, -0.09704129713436024, -0.22152406642592307, 0.21285346080647718, -0.014778827678143851, -0.12155020366801675, 0.1272286594809838, 0.23088169345726905, 0.17405127198040737, -0.13233552775266816, -0.0005299887990863142, -0.03754261778509718, 0.17198131238287948, 0.036085298225694035, 0.00748111515442083, 0.17380541111579387, 0.25994178296808723, 0.01484217905139519, 0.12267583524176882, -0.13681123905491588, -0.04341193659613856, -0.23393751707784358, -0.09196714778288693, -0.21721681170520704, -0.02730193445301157, -0.12113671317317729, -0.100464117445542, 0.4102205561268759, 0.2343769759844675, 0.22987372674821419, 0.12874204018330834, 0.35904290156154817, 0.05248279083851662, 0.13671692533781593, 0.07135709961165942, 0.139618272343611, -0.01996018691777678, 0.1312403976877804, -0.16829699781028776, 0.07836568880021193, 0.11969874096221401]
|
1,803.06963
|
Interpreting Theories without a Spacetime
|
In this paper we have two aims: first, to draw attention to the close
connexion between interpretation and scientific understanding; second, to give
a detailed account of how theories without a spacetime can be interpreted, and
so of how they can be understood. In order to do so, we of course need an
account of what is meant by a theory `without a spacetime': which we also
provide in this paper. We describe three tools, used by physicists, aimed at
constructing interpretations which are adequate for the goal of understanding.
We analyse examples from high-energy physics illustrating how physicists use
these tools to construct interpretations and thereby attain understanding. The
examples are: the 't Hooft approximation of gauge theories, random matrix
models, causal sets, loop quantum gravity, and group field theory.
|
physics.hist-ph hep-th
|
in this paper we have two aims first to draw attention to the close connexion between interpretation and scientific understanding second to give a detailed account of how theories without a spacetime can be interpreted and so of how they can be understood in order to do so we of course need an account of what is meant by a theory without a spacetime which we also provide in this paper we describe three tools used by physicists aimed at constructing interpretations which are adequate for the goal of understanding we analyse examples from highenergy physics illustrating how physicists use these tools to construct interpretations and thereby attain understanding the examples are the t hooft approximation of gauge theories random matrix models causal sets loop quantum gravity and group field theory
|
[['in', 'this', 'paper', 'we', 'have', 'two', 'aims', 'first', 'to', 'draw', 'attention', 'to', 'the', 'close', 'connexion', 'between', 'interpretation', 'and', 'scientific', 'understanding', 'second', 'to', 'give', 'a', 'detailed', 'account', 'of', 'how', 'theories', 'without', 'a', 'spacetime', 'can', 'be', 'interpreted', 'and', 'so', 'of', 'how', 'they', 'can', 'be', 'understood', 'in', 'order', 'to', 'do', 'so', 'we', 'of', 'course', 'need', 'an', 'account', 'of', 'what', 'is', 'meant', 'by', 'a', 'theory', 'without', 'a', 'spacetime', 'which', 'we', 'also', 'provide', 'in', 'this', 'paper', 'we', 'describe', 'three', 'tools', 'used', 'by', 'physicists', 'aimed', 'at', 'constructing', 'interpretations', 'which', 'are', 'adequate', 'for', 'the', 'goal', 'of', 'understanding', 'we', 'analyse', 'examples', 'from', 'highenergy', 'physics', 'illustrating', 'how', 'physicists', 'use', 'these', 'tools', 'to', 'construct', 'interpretations', 'and', 'thereby', 'attain', 'understanding', 'the', 'examples', 'are', 'the', 't', 'hooft', 'approximation', 'of', 'gauge', 'theories', 'random', 'matrix', 'models', 'causal', 'sets', 'loop', 'quantum', 'gravity', 'and', 'group', 'field', 'theory']]
|
[-0.058105227178431876, 0.1266822469757758, -0.13661277454629903, 0.1512824536420277, -0.14039018951562582, -0.13423191912415375, 0.04032564765901681, 0.3796877618381427, -0.22799654821829715, -0.34427129829174463, 0.07700210307522158, -0.220606641833251, -0.20595110850479767, 0.16881045828909322, -0.08959240996712492, 0.004282918211271745, 0.016265602967211308, 0.03853006024142009, -0.06818643799282696, -0.2483975628554423, 0.3246850481004461, 0.07427681074211132, 0.21309509532142232, 0.06839344678944304, 0.05678040680176941, -0.031479045940662614, -0.07190910986631767, 0.0557685557802613, -0.16667635090478505, 0.14779407393190838, 0.31108854739973524, 0.1595796865716804, 0.2865000989124577, -0.48501997803629354, -0.21719739681024475, 0.10449903381576064, 0.1434560687066134, 0.15278345014622705, -0.025823331505987965, -0.26131545635693854, 0.07327489411717863, -0.1659331055436255, -0.15059233938240738, -0.16247967734954227, -0.03668765841453613, -0.041472334791515165, -0.19827286423830928, -0.023291909930568174, 0.08612055224828592, 0.06917279065792797, -0.013983467289865131, -0.07166935393288162, 0.054150500034429984, 0.18695880437113402, 0.06268435741778293, 0.010171674270154411, 0.052986046274455675, -0.12907362749572587, -0.16584127040878507, 0.4109246047881951, -0.02582684462580773, -0.21475505818904356, 0.2014195551333295, -0.14814058245152575, -0.1599961592360819, 0.05743520603095757, 0.19028138332353292, 0.09686973950121808, -0.1773483787897889, 0.12103585273077186, -0.0006864894561839241, 0.12760265951066185, 0.04074334634560381, 0.038079995242523326, 0.2841304471531442, 0.12041866676242069, -0.01115221807107557, 0.11291357303368824, 0.008334777344601186, -0.111197154617065, -0.3722326053761458, -0.15317465109352507, -0.11245516339274308, 0.0852925194629987, -0.0305457730712689, -0.1218006638028012, 0.3760592199947315, 0.22834268575605318, 0.17879570057999541, 0.027699899328303815, 0.2484094567867067, 0.08563392988996196, 0.026325526327349757, 0.04795247006749038, 0.21911256708460683, 0.1617534525998164, 0.09183743672680024, -0.14827061519546625, 0.025321152757938583, 0.11693573574613751]
|
1,803.06964
|
A modern maximum-likelihood theory for high-dimensional logistic
regression
|
Every student in statistics or data science learns early on that when the
sample size largely exceeds the number of variables, fitting a logistic model
produces estimates that are approximately unbiased. Every student also learns
that there are formulas to predict the variability of these estimates which are
used for the purpose of statistical inference; for instance, to produce
p-values for testing the significance of regression coefficients. Although
these formulas come from large sample asymptotics, we are often told that we
are on reasonably safe grounds when $n$ is large in such a way that $n \ge 5p$
or $n \ge 10p$. This paper shows that this is far from the case, and
consequently, inferences routinely produced by common software packages are
often unreliable.
Consider a logistic model with independent features in which $n$ and $p$
become increasingly large in a fixed ratio. Then we show that (1) the MLE is
biased, (2) the variability of the MLE is far greater than classically
predicted, and (3) the commonly used likelihood-ratio test (LRT) is not
distributed as a chi-square. The bias of the MLE is extremely problematic as it
yields completely wrong predictions for the probability of a case based on
observed values of the covariates. We develop a new theory, which
asymptotically predicts (1) the bias of the MLE, (2) the variability of the
MLE, and (3) the distribution of the LRT. We empirically also demonstrate that
these predictions are extremely accurate in finite samples. Further, an
appealing feature is that these novel predictions depend on the unknown
sequence of regression coefficients only through a single scalar, the overall
strength of the signal. This suggests very concrete procedures to adjust
inference; we describe one such procedure learning a single parameter from data
and producing accurate inference
|
math.ST stat.ME stat.TH
|
every student in statistics or data science learns early on that when the sample size largely exceeds the number of variables fitting a logistic model produces estimates that are approximately unbiased every student also learns that there are formulas to predict the variability of these estimates which are used for the purpose of statistical inference for instance to produce pvalues for testing the significance of regression coefficients although these formulas come from large sample asymptotics we are often told that we are on reasonably safe grounds when n is large in such a way that n ge 5p or n ge 10p this paper shows that this is far from the case and consequently inferences routinely produced by common software packages are often unreliable consider a logistic model with independent features in which n and p become increasingly large in a fixed ratio then we show that 1 the mle is biased 2 the variability of the mle is far greater than classically predicted and 3 the commonly used likelihoodratio test lrt is not distributed as a chisquare the bias of the mle is extremely problematic as it yields completely wrong predictions for the probability of a case based on observed values of the covariates we develop a new theory which asymptotically predicts 1 the bias of the mle 2 the variability of the mle and 3 the distribution of the lrt we empirically also demonstrate that these predictions are extremely accurate in finite samples further an appealing feature is that these novel predictions depend on the unknown sequence of regression coefficients only through a single scalar the overall strength of the signal this suggests very concrete procedures to adjust inference we describe one such procedure learning a single parameter from data and producing accurate inference
|
[['every', 'student', 'in', 'statistics', 'or', 'data', 'science', 'learns', 'early', 'on', 'that', 'when', 'the', 'sample', 'size', 'largely', 'exceeds', 'the', 'number', 'of', 'variables', 'fitting', 'a', 'logistic', 'model', 'produces', 'estimates', 'that', 'are', 'approximately', 'unbiased', 'every', 'student', 'also', 'learns', 'that', 'there', 'are', 'formulas', 'to', 'predict', 'the', 'variability', 'of', 'these', 'estimates', 'which', 'are', 'used', 'for', 'the', 'purpose', 'of', 'statistical', 'inference', 'for', 'instance', 'to', 'produce', 'pvalues', 'for', 'testing', 'the', 'significance', 'of', 'regression', 'coefficients', 'although', 'these', 'formulas', 'come', 'from', 'large', 'sample', 'asymptotics', 'we', 'are', 'often', 'told', 'that', 'we', 'are', 'on', 'reasonably', 'safe', 'grounds', 'when', 'n', 'is', 'large', 'in', 'such', 'a', 'way', 'that', 'n', 'ge', '5p', 'or', 'n', 'ge', '10p', 'this', 'paper', 'shows', 'that', 'this', 'is', 'far', 'from', 'the', 'case', 'and', 'consequently', 'inferences', 'routinely', 'produced', 'by', 'common', 'software', 'packages', 'are', 'often', 'unreliable', 'consider', 'a', 'logistic', 'model', 'with', 'independent', 'features', 'in', 'which', 'n', 'and', 'p', 'become', 'increasingly', 'large', 'in', 'a', 'fixed', 'ratio', 'then', 'we', 'show', 'that', '1', 'the', 'mle', 'is', 'biased', '2', 'the', 'variability', 'of', 'the', 'mle', 'is', 'far', 'greater', 'than', 'classically', 'predicted', 'and', '3', 'the', 'commonly', 'used', 'likelihoodratio', 'test', 'lrt', 'is', 'not', 'distributed', 'as', 'a', 'chisquare', 'the', 'bias', 'of', 'the', 'mle', 'is', 'extremely', 'problematic', 'as', 'it', 'yields', 'completely', 'wrong', 'predictions', 'for', 'the', 'probability', 'of', 'a', 'case', 'based', 'on', 'observed', 'values', 'of', 'the', 'covariates', 'we', 'develop', 'a', 'new', 'theory', 'which', 'asymptotically', 'predicts', '1', 'the', 'bias', 'of', 'the', 'mle', '2', 'the', 'variability', 'of', 'the', 'mle', 'and', '3', 'the', 'distribution', 'of', 'the', 'lrt', 'we', 'empirically', 'also', 'demonstrate', 'that', 'these', 'predictions', 'are', 'extremely', 'accurate', 'in', 'finite', 'samples', 'further', 'an', 'appealing', 'feature', 'is', 'that', 'these', 'novel', 'predictions', 'depend', 'on', 'the', 'unknown', 'sequence', 'of', 'regression', 'coefficients', 'only', 'through', 'a', 'single', 'scalar', 'the', 'overall', 'strength', 'of', 'the', 'signal', 'this', 'suggests', 'very', 'concrete', 'procedures', 'to', 'adjust', 'inference', 'we', 'describe', 'one', 'such', 'procedure', 'learning', 'a', 'single', 'parameter', 'from', 'data', 'and', 'producing', 'accurate', 'inference']]
|
[-0.036264421033076755, 0.09735215008004161, -0.09116033329534017, 0.126974811816802, -0.06306916140916606, -0.1843870024305353, 0.05034875892601416, 0.38819845687170085, -0.2220435175978629, -0.32307780695697835, 0.1133397297844813, -0.290547288587707, -0.14591786518222588, 0.20701036808345266, -0.06472859391736141, 0.05683420021941365, 0.07376579038178976, 0.04689564429557051, -0.03773075553220445, -0.27146500406859164, 0.27559537917723237, 0.05521934292817211, 0.2801877120069253, -0.035205317986814456, 0.08938051573101335, 0.00021046631170336055, -0.027886952714038057, 0.03333488594767373, -0.09997364862404022, 0.11021845197191814, 0.274781132853162, 0.1748007516389407, 0.3037459022315169, -0.36258263349004294, -0.17274871814328976, 0.1349626258314537, 0.1515834510933633, 0.11090984385117662, -0.02018700311797344, -0.21722890917334478, 0.10299955826878825, -0.1405314533468619, -0.08217871692535039, -0.08659226007325374, 0.02388313236470158, 0.007691000172918713, -0.34168899501831196, 0.09162702240546178, 0.06181202674447008, 0.06092425177465319, -0.012472675892216078, -0.16250036915212027, 0.004127291799680254, 0.11081081971221736, 0.07602803956684216, 0.015460642823962041, 0.1142621363196176, -0.13055248254504231, -0.06294174314157194, 0.3346802057113146, -0.04204938374248347, -0.20202098443248384, 0.17168641288063136, -0.14743070944914016, -0.16701771683575636, 0.11345934691033452, 0.16379268317226936, 0.12871665422760606, -0.1402387497353728, 0.0598066229807021, -0.04085212886353917, 0.2019868397949943, 0.01643201762596397, -0.026612788188661373, 0.17965469271419696, 0.14880107267133616, 0.03391534690406941, 0.08943955853386354, -0.12133908686007851, -0.04371228880906553, -0.30009784808734785, -0.12064456631580125, -0.20918396488736649, 0.045397794678482005, -0.14506869286044485, -0.19644865331812636, 0.3544861186245406, 0.21431307220435072, 0.2261895476226896, 0.11490953209018649, 0.2832359364366385, 0.11410915333682489, 0.051946590527910994, 0.09248539843365261, 0.23053095941872312, 0.07417547438273835, 0.012279990489037733, -0.1431062620391163, 0.1444562050416386, -0.009268035197385109]
|
1,803.06965
|
The normal hull and commutator group for nonconnected group schemes
|
In this short note, we prove that there is a well behaved notion of normal
hull for smooth algebraic group schemes over a field and that the commutator
group $(G,H)$ is well defined for $H\subset G$ smooth, even when both of them
are not connected.
|
math.AG math.GR
|
in this short note we prove that there is a well behaved notion of normal hull for smooth algebraic group schemes over a field and that the commutator group gh is well defined for hsubset g smooth even when both of them are not connected
|
[['in', 'this', 'short', 'note', 'we', 'prove', 'that', 'there', 'is', 'a', 'well', 'behaved', 'notion', 'of', 'normal', 'hull', 'for', 'smooth', 'algebraic', 'group', 'schemes', 'over', 'a', 'field', 'and', 'that', 'the', 'commutator', 'group', 'gh', 'is', 'well', 'defined', 'for', 'hsubset', 'g', 'smooth', 'even', 'when', 'both', 'of', 'them', 'are', 'not', 'connected']]
|
[-0.2071034415314595, 0.10814848970621824, -0.10274659976777104, 0.09302741509810504, -0.11256775404844019, -0.14171002637594937, -0.008376752709348996, 0.46475900775856444, -0.32488113774193655, -0.16653603741692172, 0.10504057382285181, -0.20937696744998296, -0.17366016409877275, 0.2564434801124864, -0.16723846846984491, -0.04884779397398233, 0.03550745631671614, 0.13667833185237316, -0.10296386716783874, -0.27080987633930315, 0.37921517288519274, -0.11944478797829813, 0.21917337640706036, 0.04661588008619017, 0.11892324957168765, 0.014959050404528777, -0.011073742682735125, 0.10912382130821546, -0.09340697650234991, 0.05034419140881962, 0.324616801738739, 0.07021124724609157, 0.23995717523826493, -0.3545010495103068, -0.17599661248839563, 0.21046525347563955, 0.12785416674903696, 0.005663610767159197, -0.03415085905645457, -0.2411762139035596, 0.169834510402547, -0.18086812930802504, -0.133568126666877, -0.05347940582368109, 0.09427003267790295, 0.03877806787689527, -0.2529957260626058, 0.01981543991714716, 0.11610702106263489, 0.10178152941581275, -0.025947160284138387, -0.06623308310647391, -0.03223032164387405, 0.07597523502190598, 0.0009679846776028474, 0.10473842650212141, 0.06227256811107509, -0.08028661303946541, -0.04354597507044673, 0.4100440564565361, -0.09084014881195293, -0.21347586144175795, 0.1506452645873651, -0.17874433087805908, -0.11495893250943887, 0.07984728086739779, 0.07550448913955027, 0.1997033756122821, -0.0403936279695093, 0.17841186525377756, -0.12901558917429712, 0.06551591273811129, 0.031699877232313156, 0.011092505893773502, 0.09718126186894047, 0.11528186550777819, 0.16006587952789333, 0.058677111542783676, 0.04673573840862243, -0.006359063150982062, -0.3969895089045167, -0.17350243533857995, -0.16543107343216737, 0.09516046536187382, -0.05868161627990452, -0.22547280277229018, 0.36850579472051725, 0.018414353041185272, 0.18269870285358694, 0.1571224769163463, 0.25595261963705224, 0.07312730318970151, 0.05192334179042114, 0.14826317944874365, 0.12991425185981725, 0.19392271180533702, -0.08478726054696988, -0.12817325504082772, 0.021038271062490014, 0.10825500025724372]
|
1,803.06966
|
Polyglot Semantic Parsing in APIs
|
Traditional approaches to semantic parsing (SP) work by training individual
models for each available parallel dataset of text-meaning pairs. In this
paper, we explore the idea of polyglot semantic translation, or learning
semantic parsing models that are trained on multiple datasets and natural
languages. In particular, we focus on translating text to code signature
representations using the software component datasets of Richardson and Kuhn
(2017a,b). The advantage of such models is that they can be used for parsing a
wide variety of input natural languages and output programming languages, or
mixed input languages, using a single unified model. To facilitate modeling of
this type, we develop a novel graph-based decoding framework that achieves
state-of-the-art performance on the above datasets, and apply this method to
two other benchmark SP tasks.
|
cs.CL
|
traditional approaches to semantic parsing sp work by training individual models for each available parallel dataset of textmeaning pairs in this paper we explore the idea of polyglot semantic translation or learning semantic parsing models that are trained on multiple datasets and natural languages in particular we focus on translating text to code signature representations using the software component datasets of richardson and kuhn 2017ab the advantage of such models is that they can be used for parsing a wide variety of input natural languages and output programming languages or mixed input languages using a single unified model to facilitate modeling of this type we develop a novel graphbased decoding framework that achieves stateoftheart performance on the above datasets and apply this method to two other benchmark sp tasks
|
[['traditional', 'approaches', 'to', 'semantic', 'parsing', 'sp', 'work', 'by', 'training', 'individual', 'models', 'for', 'each', 'available', 'parallel', 'dataset', 'of', 'textmeaning', 'pairs', 'in', 'this', 'paper', 'we', 'explore', 'the', 'idea', 'of', 'polyglot', 'semantic', 'translation', 'or', 'learning', 'semantic', 'parsing', 'models', 'that', 'are', 'trained', 'on', 'multiple', 'datasets', 'and', 'natural', 'languages', 'in', 'particular', 'we', 'focus', 'on', 'translating', 'text', 'to', 'code', 'signature', 'representations', 'using', 'the', 'software', 'component', 'datasets', 'of', 'richardson', 'and', 'kuhn', '2017ab', 'the', 'advantage', 'of', 'such', 'models', 'is', 'that', 'they', 'can', 'be', 'used', 'for', 'parsing', 'a', 'wide', 'variety', 'of', 'input', 'natural', 'languages', 'and', 'output', 'programming', 'languages', 'or', 'mixed', 'input', 'languages', 'using', 'a', 'single', 'unified', 'model', 'to', 'facilitate', 'modeling', 'of', 'this', 'type', 'we', 'develop', 'a', 'novel', 'graphbased', 'decoding', 'framework', 'that', 'achieves', 'stateoftheart', 'performance', 'on', 'the', 'above', 'datasets', 'and', 'apply', 'this', 'method', 'to', 'two', 'other', 'benchmark', 'sp', 'tasks']]
|
[-0.047001268205349334, -0.03011556141609617, -0.06530891377951775, 0.10203877809362893, -0.13960989569386584, -0.18055562003792147, 0.03287964315040881, 0.44893660652451217, -0.3035286684935272, -0.348351698161423, 0.025937232438081992, -0.23712792292280938, -0.1288831333258713, 0.23892940028054, -0.12703054739540676, 0.06172127640093095, 0.17317019276379142, 0.031234571230015717, -0.06544303896498604, -0.2773930071925861, 0.32367378246090084, -0.009679085491370643, 0.3562304138613399, 0.006982411810895428, 0.1234431492857766, -0.04643215223768493, -0.01493374950064208, -0.004671608712669695, -0.05863267027319807, 0.21418396636727266, 0.35761404855313117, 0.2645312178210588, 0.2798816484046256, -0.3969797859172104, -0.21311660197534366, 0.05446208310968359, 0.13673902531081694, 0.12501038170319134, 0.0005607511748166871, -0.33307666941254865, 0.08568248797746492, -0.18776428684577695, 0.11010221779724816, -0.13667012489167973, -0.012629269909666618, -0.01473376957437722, -0.2716946966102114, 0.0009450139914406464, 0.13527318148589984, 0.10764839719922747, -0.03557602962246165, -0.14141263294732198, 0.025216681056917878, 0.15418395101005444, 0.0207666479072941, 0.06398836155403842, 0.09815802152843389, -0.15028776077269868, -0.21497778213233687, 0.3862069964816328, -0.10494430449034553, -0.23827167466515675, 0.26743211230495945, 0.027066793678386603, -0.19659607844005222, 0.037366264645243064, 0.2792948713467922, 0.11887177857897768, -0.14713773100811522, 0.05597422517348605, -0.07274913622677559, 0.22048626479863742, 0.08361249217341538, -0.04279753336504655, 0.18290748297204118, 0.2841599275543558, -0.0414512151692179, 0.14360192436970465, -0.10412310897640964, -0.05876686526471531, -0.21131837866823844, -0.13269667043459776, -0.1460362286397867, -0.07978307894882164, -0.09382148430404413, -0.17298028137702204, 0.40302552506909706, 0.2524712554186408, 0.14539607030746993, 0.15587364073144272, 0.3414977702050237, 0.00362753497029189, 0.1211909243138507, 0.10730090292054228, 0.08972467288003827, -0.016545766759008984, 0.11090420450682359, -0.13932822547576507, 0.06176316351229616, 0.08094891594009823]
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.