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.01467 | The Sequent Calculus Trainer with Automated Reasoning - Helping Students
to Find Proofs | The sequent calculus is a formalism for proving validity of statements
formulated in First-Order Logic. It is routinely used in computer science
modules on mathematical logic. Formal proofs in the sequent calculus are finite
trees obtained by successively applying proof rules to formulas, thus
simplifying them step-by-step.
Students often struggle with the mathematical formalities and the level of
abstraction that topics like formal logic and formal proofs involve. The
difficulties can be categorised as syntactic or semantic. On the syntactic
level, students need to understand what a correctly formed proof is, how rules
can be applied (on paper for instance) without leaving the mathematical
framework of the sequent calculus, and so on. Beyond this, on the semantic
level, students need to acquire strategies that let them find the right proof.
The Sequent Calculus Trainer is a tool that is designed to aid students in
learning the techniques of proving given statements formally. In this paper we
describe the didactical motivation behind the tool and the techniques used to
address issues on the syntactic as well as on the semantic level.
| cs.LO cs.CY | the sequent calculus is a formalism for proving validity of statements formulated in firstorder logic it is routinely used in computer science modules on mathematical logic formal proofs in the sequent calculus are finite trees obtained by successively applying proof rules to formulas thus simplifying them stepbystep students often struggle with the mathematical formalities and the level of abstraction that topics like formal logic and formal proofs involve the difficulties can be categorised as syntactic or semantic on the syntactic level students need to understand what a correctly formed proof is how rules can be applied on paper for instance without leaving the mathematical framework of the sequent calculus and so on beyond this on the semantic level students need to acquire strategies that let them find the right proof the sequent calculus trainer is a tool that is designed to aid students in learning the techniques of proving given statements formally in this paper we describe the didactical motivation behind the tool and the techniques used to address issues on the syntactic as well as on the semantic level | [['the', 'sequent', 'calculus', 'is', 'a', 'formalism', 'for', 'proving', 'validity', 'of', 'statements', 'formulated', 'in', 'firstorder', 'logic', 'it', 'is', 'routinely', 'used', 'in', 'computer', 'science', 'modules', 'on', 'mathematical', 'logic', 'formal', 'proofs', 'in', 'the', 'sequent', 'calculus', 'are', 'finite', 'trees', 'obtained', 'by', 'successively', 'applying', 'proof', 'rules', 'to', 'formulas', 'thus', 'simplifying', 'them', 'stepbystep', 'students', 'often', 'struggle', 'with', 'the', 'mathematical', 'formalities', 'and', 'the', 'level', 'of', 'abstraction', 'that', 'topics', 'like', 'formal', 'logic', 'and', 'formal', 'proofs', 'involve', 'the', 'difficulties', 'can', 'be', 'categorised', 'as', 'syntactic', 'or', 'semantic', 'on', 'the', 'syntactic', 'level', 'students', 'need', 'to', 'understand', 'what', 'a', 'correctly', 'formed', 'proof', 'is', 'how', 'rules', 'can', 'be', 'applied', 'on', 'paper', 'for', 'instance', 'without', 'leaving', 'the', 'mathematical', 'framework', 'of', 'the', 'sequent', 'calculus', 'and', 'so', 'on', 'beyond', 'this', 'on', 'the', 'semantic', 'level', 'students', 'need', 'to', 'acquire', 'strategies', 'that', 'let', 'them', 'find', 'the', 'right', 'proof', 'the', 'sequent', 'calculus', 'trainer', 'is', 'a', 'tool', 'that', 'is', 'designed', 'to', 'aid', 'students', 'in', 'learning', 'the', 'techniques', 'of', 'proving', 'given', 'statements', 'formally', 'in', 'this', 'paper', 'we', 'describe', 'the', 'didactical', 'motivation', 'behind', 'the', 'tool', 'and', 'the', 'techniques', 'used', 'to', 'address', 'issues', 'on', 'the', 'syntactic', 'as', 'well', 'as', 'on', 'the', 'semantic', 'level']] | [0.0039130042244643806, 0.02835007415116666, -0.13402533448299955, 0.15868037023032655, -0.21298910824155343, -0.16074001578634928, 0.10629571661191821, 0.35019036160792383, -0.3083184062081842, -0.3241528360870297, 0.08865390948147393, -0.22331493612711822, -0.14004119042458024, 0.1886163196804824, -0.16394604986763425, 0.04635940939604237, 0.0538254423436381, 0.06245195679626735, -0.02078962138094341, -0.23691177674616015, 0.3312694373730487, 0.013745335744974833, 0.2425265056679452, 0.073568542508731, 0.09452203711671703, 0.03082454525579454, -0.04327413830229773, -0.0046287774610432, -0.10702208695895339, 0.16065496090778758, 0.41379798536693585, 0.22588805454736316, 0.3532180486288567, -0.4912214448894036, -0.10101263027887937, 0.02747053354614357, 0.1301430151797831, 0.10739480366139521, 0.03857283473766653, -0.33949439211451976, 0.08833111741374554, -0.15230041707855488, -0.08323452899274131, -0.14439856404615514, -0.020209920759099487, -0.01734391184180309, -0.17863098107923508, -0.05944216657201005, 0.20128241321657311, 0.15733706745626042, 0.006310338794394245, -0.11042027063563715, 0.01392018204677184, 0.11414313730107381, 0.0010123445646572004, -8.67592606579042e-05, 0.12988410294173006, -0.1093544615692766, -0.19335568774304243, 0.3648654445602595, 0.013946542326444187, -0.24932745246830598, 0.17828539960533796, -0.04732653638933312, -0.1959837574548187, 0.02463061365626711, 0.11470702759122903, 0.11191176035046037, -0.16472564343696033, 0.11830957355654106, 0.003464101971772255, 0.20479096707955585, 0.12399949771404141, -0.0015118420228112342, 0.21110073130515367, 0.17969123793859554, -0.0010796020470179783, 0.09915289191097312, 0.03664393373992679, -0.11524257387617322, -0.3272572833337098, -0.17262071402541926, -0.09297672114413044, -0.01730355450240622, -0.048633726347204004, -0.157142853809198, 0.35765380489863663, 0.20471647039950727, 0.07938322147605524, 0.13097115096703754, 0.3164927229212399, 0.14519938959853265, 0.11439716717873455, 0.012352499498220879, 0.1406765794238419, 0.15310884341883718, 0.16336462981010366, -0.09413388343501898, 0.14089517989787714, 0.1438494759218965] |
1,803.01468 | Improving QED-Tutrix by Automating the Generation of Proofs | The idea of assisting teachers with technological tools is not new.
Mathematics in general, and geometry in particular, provide interesting
challenges when developing educative softwares, both in the education and
computer science aspects. QED-Tutrix is an intelligent tutor for geometry
offering an interface to help high school students in the resolution of
demonstration problems. It focuses on specific goals: 1) to allow the student
to freely explore the problem and its figure, 2) to accept proofs elements in
any order, 3) to handle a variety of proofs, which can be customized by the
teacher, and 4) to be able to help the student at any step of the resolution of
the problem, if the need arises. The software is also independent from the
intervention of the teacher. QED-Tutrix offers an interesting approach to
geometry education, but is currently crippled by the lengthiness of the process
of implementing new problems, a task that must still be done manually.
Therefore, one of the main focuses of the QED-Tutrix' research team is to ease
the implementation of new problems, by automating the tedious step of finding
all possible proofs for a given problem. This automation must follow
fundamental constraints in order to create problems compatible with QED-Tutrix:
1) readability of the proofs, 2) accessibility at a high school level, and 3)
possibility for the teacher to modify the parameters defining the
"acceptability" of a proof. We present in this paper the result of our
preliminary exploration of possible avenues for this task. Automated theorem
proving in geometry is a widely studied subject, and various provers exist.
However, our constraints are quite specific and some adaptation would be
required to use an existing prover. We have therefore implemented a prototype
of automated prover to suit our needs. The future goal is to compare
performances and usability in our specific use-case between the existing
provers and our implementation.
| cs.AI cs.CY cs.HC | the idea of assisting teachers with technological tools is not new mathematics in general and geometry in particular provide interesting challenges when developing educative softwares both in the education and computer science aspects qedtutrix is an intelligent tutor for geometry offering an interface to help high school students in the resolution of demonstration problems it focuses on specific goals 1 to allow the student to freely explore the problem and its figure 2 to accept proofs elements in any order 3 to handle a variety of proofs which can be customized by the teacher and 4 to be able to help the student at any step of the resolution of the problem if the need arises the software is also independent from the intervention of the teacher qedtutrix offers an interesting approach to geometry education but is currently crippled by the lengthiness of the process of implementing new problems a task that must still be done manually therefore one of the main focuses of the qedtutrix research team is to ease the implementation of new problems by automating the tedious step of finding all possible proofs for a given problem this automation must follow fundamental constraints in order to create problems compatible with qedtutrix 1 readability of the proofs 2 accessibility at a high school level and 3 possibility for the teacher to modify the parameters defining the acceptability of a proof we present in this paper the result of our preliminary exploration of possible avenues for this task automated theorem proving in geometry is a widely studied subject and various provers exist however our constraints are quite specific and some adaptation would be required to use an existing prover we have therefore implemented a prototype of automated prover to suit our needs the future goal is to compare performances and usability in our specific usecase between the existing provers and our implementation | [['the', 'idea', 'of', 'assisting', 'teachers', 'with', 'technological', 'tools', 'is', 'not', 'new', 'mathematics', 'in', 'general', 'and', 'geometry', 'in', 'particular', 'provide', 'interesting', 'challenges', 'when', 'developing', 'educative', 'softwares', 'both', 'in', 'the', 'education', 'and', 'computer', 'science', 'aspects', 'qedtutrix', 'is', 'an', 'intelligent', 'tutor', 'for', 'geometry', 'offering', 'an', 'interface', 'to', 'help', 'high', 'school', 'students', 'in', 'the', 'resolution', 'of', 'demonstration', 'problems', 'it', 'focuses', 'on', 'specific', 'goals', '1', 'to', 'allow', 'the', 'student', 'to', 'freely', 'explore', 'the', 'problem', 'and', 'its', 'figure', '2', 'to', 'accept', 'proofs', 'elements', 'in', 'any', 'order', '3', 'to', 'handle', 'a', 'variety', 'of', 'proofs', 'which', 'can', 'be', 'customized', 'by', 'the', 'teacher', 'and', '4', 'to', 'be', 'able', 'to', 'help', 'the', 'student', 'at', 'any', 'step', 'of', 'the', 'resolution', 'of', 'the', 'problem', 'if', 'the', 'need', 'arises', 'the', 'software', 'is', 'also', 'independent', 'from', 'the', 'intervention', 'of', 'the', 'teacher', 'qedtutrix', 'offers', 'an', 'interesting', 'approach', 'to', 'geometry', 'education', 'but', 'is', 'currently', 'crippled', 'by', 'the', 'lengthiness', 'of', 'the', 'process', 'of', 'implementing', 'new', 'problems', 'a', 'task', 'that', 'must', 'still', 'be', 'done', 'manually', 'therefore', 'one', 'of', 'the', 'main', 'focuses', 'of', 'the', 'qedtutrix', 'research', 'team', 'is', 'to', 'ease', 'the', 'implementation', 'of', 'new', 'problems', 'by', 'automating', 'the', 'tedious', 'step', 'of', 'finding', 'all', 'possible', 'proofs', 'for', 'a', 'given', 'problem', 'this', 'automation', 'must', 'follow', 'fundamental', 'constraints', 'in', 'order', 'to', 'create', 'problems', 'compatible', 'with', 'qedtutrix', '1', 'readability', 'of', 'the', 'proofs', '2', 'accessibility', 'at', 'a', 'high', 'school', 'level', 'and', '3', 'possibility', 'for', 'the', 'teacher', 'to', 'modify', 'the', 'parameters', 'defining', 'the', 'acceptability', 'of', 'a', 'proof', 'we', 'present', 'in', 'this', 'paper', 'the', 'result', 'of', 'our', 'preliminary', 'exploration', 'of', 'possible', 'avenues', 'for', 'this', 'task', 'automated', 'theorem', 'proving', 'in', 'geometry', 'is', 'a', 'widely', 'studied', 'subject', 'and', 'various', 'provers', 'exist', 'however', 'our', 'constraints', 'are', 'quite', 'specific', 'and', 'some', 'adaptation', 'would', 'be', 'required', 'to', 'use', 'an', 'existing', 'prover', 'we', 'have', 'therefore', 'implemented', 'a', 'prototype', 'of', 'automated', 'prover', 'to', 'suit', 'our', 'needs', 'the', 'future', 'goal', 'is', 'to', 'compare', 'performances', 'and', 'usability', 'in', 'our', 'specific', 'usecase', 'between', 'the', 'existing', 'provers', 'and', 'our', 'implementation']] | [-0.047727316714978464, 0.03961890341601341, -0.09242171975664604, 0.054300396110128976, -0.1615907986042424, -0.17715003933662024, 0.05143641643875386, 0.3646319664250582, -0.25466269687809145, -0.3762654057653167, 0.1270272855696161, -0.22624593449141592, -0.11928781556586425, 0.23860414811180164, -0.14118289988702878, 0.0489205324226462, 0.07363958898237727, 0.01047584030768634, -0.023830745242426368, -0.2926578354239703, 0.31206472253409, 0.07294844575629283, 0.26538394753954025, 0.10599311026714694, 0.07637161504289207, 0.006380320662477364, -0.036573784510927417, -0.021557346428147495, -0.09856773271579956, 0.17340545136483762, 0.3580699582973746, 0.20433249515990143, 0.3553123586357404, -0.421515205489973, -0.14280228518197338, 0.05778216220735489, 0.11490202963968607, 0.10785353238558552, -0.04714066831384583, -0.2742290342493783, 0.09892063864073208, -0.1583087118402219, -0.1403815655358136, -0.07729431286525841, -0.019569013040521756, -0.01321605906130758, -0.24520645601352534, -0.04848312079178495, 0.0891119641257832, 0.09512229695116194, -0.005075734948593144, -0.10533484117126463, 0.04576774748625795, 0.2066094943749284, 0.036397285681372384, 0.04502405500898021, 0.10135173472540024, -0.16112637834083168, -0.16380229350089884, 0.39575270818880737, 0.033021248038261175, -0.205985113469442, 0.22274960028358365, -0.0782768513681964, -0.17770720121468633, 0.05499509255418954, 0.17952270624347222, 0.10099432334447137, -0.15521225788040446, 0.07056145815201886, 0.036152031256978474, 0.20041621185821265, 0.03414960288239691, -0.023195228889632675, 0.20687882681914532, 0.20273975820208973, 0.06323094803538436, 0.12731446662935644, 0.002278050103296454, -0.0541431992602063, -0.2954947052266783, -0.18449104716105816, -0.15239649609019323, 0.007225481126181712, -0.05675639395406343, -0.1158324638247275, 0.3881844963299302, 0.20751047399855266, 0.10907142859370932, 0.04248163809302824, 0.31711398543587005, 0.06273755592552241, 0.06966847829663983, 0.05980762625553419, 0.2143087260883476, 0.05077669806614255, 0.15538888102701792, -0.14641846518852383, 0.0880704591026864, 0.023076752202098597] |
1,803.01469 | A Theorem Prover for Scientific and Educational Purposes | We present a prototype of an integrated reasoning environment for educational
purposes. The presented tool is a fragment of a proof assistant and automated
theorem prover. We describe the existing and planned functionality of the
theorem prover and especially the functionality of the educational fragment.
This currently supports working with terms of the untyped lambda calculus and
addresses both undergraduate students and researchers. We show how the tool can
be used to support the students' understanding of functional programming and
discuss general problems related to the process of building theorem proving
software that aims at supporting both research and education.
| cs.HC cs.LO cs.SE | we present a prototype of an integrated reasoning environment for educational purposes the presented tool is a fragment of a proof assistant and automated theorem prover we describe the existing and planned functionality of the theorem prover and especially the functionality of the educational fragment this currently supports working with terms of the untyped lambda calculus and addresses both undergraduate students and researchers we show how the tool can be used to support the students understanding of functional programming and discuss general problems related to the process of building theorem proving software that aims at supporting both research and education | [['we', 'present', 'a', 'prototype', 'of', 'an', 'integrated', 'reasoning', 'environment', 'for', 'educational', 'purposes', 'the', 'presented', 'tool', 'is', 'a', 'fragment', 'of', 'a', 'proof', 'assistant', 'and', 'automated', 'theorem', 'prover', 'we', 'describe', 'the', 'existing', 'and', 'planned', 'functionality', 'of', 'the', 'theorem', 'prover', 'and', 'especially', 'the', 'functionality', 'of', 'the', 'educational', 'fragment', 'this', 'currently', 'supports', 'working', 'with', 'terms', 'of', 'the', 'untyped', 'lambda', 'calculus', 'and', 'addresses', 'both', 'undergraduate', 'students', 'and', 'researchers', 'we', 'show', 'how', 'the', 'tool', 'can', 'be', 'used', 'to', 'support', 'the', 'students', 'understanding', 'of', 'functional', 'programming', 'and', 'discuss', 'general', 'problems', 'related', 'to', 'the', 'process', 'of', 'building', 'theorem', 'proving', 'software', 'that', 'aims', 'at', 'supporting', 'both', 'research', 'and', 'education']] | [-0.061575867561623455, 0.018852520418731727, -0.1462811151146889, 0.12396859074195163, -0.14966379388934, -0.16301076125819236, 0.047862150842265694, 0.3389586321637034, -0.23780454367399215, -0.34788685718551277, 0.10329732452286407, -0.229196777602192, -0.11829087189864368, 0.23731077402830125, -0.10195644731633365, 0.05113675586879254, 0.07457265741191804, 0.006478173229843378, 0.019601394550409167, -0.2356627737917006, 0.2904124891432002, 0.052860872037708756, 0.2674948751274496, 0.15690890193451196, 0.08258168595843017, 0.06489413360366597, -0.07311310576740652, -0.02111339849419892, -0.08726606537740736, 0.2113629059313098, 0.4389097287133336, 0.2651853158976883, 0.37290151880588385, -0.426894959975034, -0.06890870448201895, 0.004291165545582771, 0.09688088933005928, 0.08431972022633999, -0.05125892414245754, -0.32903529510833324, 0.09081831018440426, -0.20153369174338878, -0.18556349718972343, -0.09432415477655014, -0.029314868661458604, 0.01060195448808372, -0.21801181953400373, -0.07601840085349977, 0.15298350830249546, 0.15276718131266534, -0.048099072324112056, -0.11768128198455088, 0.03774857817683369, 0.15563791363034396, 0.009495082783687395, 0.03289616604684852, 0.17442160586360841, -0.11792932719690725, -0.18304517863318323, 0.35968919096514584, -0.015106142647564411, -0.1517654587700963, 0.2206155494879931, -0.0578042624425143, -0.1738595359865576, -0.01253720792941749, 0.1899517773836851, 0.10858954829629511, -0.17669537609443067, 0.1216709303954849, 0.041004477803362534, 0.22594850750640036, 0.04113053083186969, -0.0060597133327974, 0.21407052781898528, 0.24175964991562068, 0.013183015356771648, 0.14853968611801974, 0.027589447014033795, -0.0730419417284429, -0.32521928364410996, -0.25227757638320325, -0.09255616898881272, -0.04347213035682216, -0.03603574359687627, -0.14156137929763646, 0.3686585566587746, 0.19789934592321515, 0.011120971366763115, 0.09863225132372463, 0.31724147526547314, 0.09807336969301104, 0.07949471083004028, 0.08233645424246788, 0.15077581854828168, 0.11717383412644267, 0.19650131296366452, -0.13713418624829501, 0.08204657879192383, 0.04141688927949872] |
1,803.0147 | Prototyping "Systems that Explain Themselves" for Education | "Systems that Explain Themselves" appears a provocative wording, in
particular in the context of mathematics education -- it is as provocative as
the idea of building educational software upon technology from computer theorem
proving. In spite of recent success stories like the proofs of the Four Colour
Theorem or the Kepler Conjecture, mechanised proof is still considered somewhat
esoteric by mainstream mathematics. This paper describes the process of
prototyping in the ISAC project from a technical perspective. This perspective
depends on two moving targets: On the one side the rapidly increasing power and
coverage of computer theorem provers and their user interfaces, and on the
other side potential users: What can students and teachers request from
educational systems based on technology and concepts from computer theorem
proving, now and then? By the way of describing the process of prototyping the
first comprehensive survey on the state of the ISAC prototype is given as a
side effect, made precise by pointers to the code and by citation of all
contributing theses.
| cs.SE cs.CY cs.HC | systems that explain themselves appears a provocative wording in particular in the context of mathematics education it is as provocative as the idea of building educational software upon technology from computer theorem proving in spite of recent success stories like the proofs of the four colour theorem or the kepler conjecture mechanised proof is still considered somewhat esoteric by mainstream mathematics this paper describes the process of prototyping in the isac project from a technical perspective this perspective depends on two moving targets on the one side the rapidly increasing power and coverage of computer theorem provers and their user interfaces and on the other side potential users what can students and teachers request from educational systems based on technology and concepts from computer theorem proving now and then by the way of describing the process of prototyping the first comprehensive survey on the state of the isac prototype is given as a side effect made precise by pointers to the code and by citation of all contributing theses | [['systems', 'that', 'explain', 'themselves', 'appears', 'a', 'provocative', 'wording', 'in', 'particular', 'in', 'the', 'context', 'of', 'mathematics', 'education', 'it', 'is', 'as', 'provocative', 'as', 'the', 'idea', 'of', 'building', 'educational', 'software', 'upon', 'technology', 'from', 'computer', 'theorem', 'proving', 'in', 'spite', 'of', 'recent', 'success', 'stories', 'like', 'the', 'proofs', 'of', 'the', 'four', 'colour', 'theorem', 'or', 'the', 'kepler', 'conjecture', 'mechanised', 'proof', 'is', 'still', 'considered', 'somewhat', 'esoteric', 'by', 'mainstream', 'mathematics', 'this', 'paper', 'describes', 'the', 'process', 'of', 'prototyping', 'in', 'the', 'isac', 'project', 'from', 'a', 'technical', 'perspective', 'this', 'perspective', 'depends', 'on', 'two', 'moving', 'targets', 'on', 'the', 'one', 'side', 'the', 'rapidly', 'increasing', 'power', 'and', 'coverage', 'of', 'computer', 'theorem', 'provers', 'and', 'their', 'user', 'interfaces', 'and', 'on', 'the', 'other', 'side', 'potential', 'users', 'what', 'can', 'students', 'and', 'teachers', 'request', 'from', 'educational', 'systems', 'based', 'on', 'technology', 'and', 'concepts', 'from', 'computer', 'theorem', 'proving', 'now', 'and', 'then', 'by', 'the', 'way', 'of', 'describing', 'the', 'process', 'of', 'prototyping', 'the', 'first', 'comprehensive', 'survey', 'on', 'the', 'state', 'of', 'the', 'isac', 'prototype', 'is', 'given', 'as', 'a', 'side', 'effect', 'made', 'precise', 'by', 'pointers', 'to', 'the', 'code', 'and', 'by', 'citation', 'of', 'all', 'contributing', 'theses']] | [-0.05624748065553815, 0.07079749026462524, -0.11702236912306949, 0.05152468381807523, -0.12460570831469, -0.15559131603621873, 0.08114113456816908, 0.32616954360752415, -0.23244001701771771, -0.339464094947208, 0.12569224205041668, -0.28559510612766636, -0.15294038189317447, 0.24465607157522626, -0.1339403062166106, 0.009048041118138067, 0.06213991655609929, 0.032926219617451964, -0.007400833405058324, -0.28153066902859525, 0.3252050070885635, 0.0541423721922308, 0.30561658840891, 0.0979109120006899, 0.04681439795834426, 0.042023956582787826, -0.09441427955646399, -0.03956645265629394, -0.09302921088491793, 0.1568049658906161, 0.31993300901824395, 0.2276908563802669, 0.33354674093425274, -0.4263982312704199, -0.13302677091329562, -0.0032295733497384386, 0.12309867558041973, 0.10805862424509412, -0.06439305834276547, -0.31906698448046183, 0.05394485976737125, -0.197668009095952, -0.12953846727238869, 0.0014083716089626466, 0.014875932613156251, 0.022590786926778992, -0.1555710684717495, -0.0394976806149063, 0.11426326714748153, 0.1391688116470327, -0.00939967819302172, -0.13311082355336412, 0.006149536045543717, 0.15636780535796735, 0.06603735609954091, 0.05449991315305674, 0.14313713791807728, -0.16658721618580263, -0.14408966749851432, 0.37653704194803916, 0.013665137881380037, -0.12013487858193535, 0.19982550223357975, -0.10300261204505681, -0.15614501434824699, 0.03281616601478529, 0.18083705963695756, 0.08982023037418987, -0.16449987526002102, 0.08975372372846775, -0.004473915619819739, 0.17054953617346885, 0.08759024759655344, 0.011081589205388927, 0.24690688370049177, 0.17719960614857017, 0.03944409488061079, 0.11375462453703523, 0.02261026671084647, -0.11066883546162463, -0.27219107860737873, -0.17798840871201993, -0.19052550282546996, 0.04176388826695155, -0.030063476528612118, -0.13809001364761733, 0.3702442866788637, 0.16250491925079882, 0.07170353513679428, 0.04523886252778786, 0.3243513618838373, 0.05239036610038653, 0.07360460197679787, 0.036788323464301914, 0.18040221050752261, 0.09140801110949653, 0.20004028105314756, -0.10780477484539372, 0.10992385185331922, 0.060529133562238324] |
1,803.01471 | Exchange of Geometric Information Between Applications | The Web Geometry Laboratory (WGL) is a collaborative and adaptive e-learning
Web platform integrating a well known dynamic geometry system. Thousands of
Geometric problems for Geometric Theorem Provers (TGTP) is a Web-based
repository of geometric problems to support the testing and evaluation of
geometric automated theorem proving systems.
The users of these systems should be able to profit from each other. The TGTP
corpus must be made available to the WGL user, allowing, in this way, the
exploration of TGTP problems and their proofs. On the other direction TGTP
could gain by the possibility of a wider users base submitting new problems.
Such information exchange between clients (e.g. WGL) and servers (e.g. TGTP)
raises many issues: geometric search - someone, working in a geometric problem,
must be able to ask for more information regarding that construction; levels of
geometric knowledge and interest - the problems in the servers must be
classified in such a way that, in response to a client query, only the problems
in the user's level and/or interest are returned; different aims of each tool -
e.g. WGL is about secondary school geometry, TGTP is about formal proofs in
semi-analytic and algebraic proof methods, not a perfect match indeed;
localisation issues, e.g. a Portuguese user obliged to make the query and
process the answer in English; technical issues-many technical issues need to
be addressed to make this exchange of geometric information possible and
useful.
Instead of a giant (difficult to maintain) tool, trying to cover all, the
interconnection of specialised tools seems much more promising. The challenges
to make that connection work are many and difficult, but, it is the authors
impression, not insurmountable.
| cs.CY cs.SE | the web geometry laboratory wgl is a collaborative and adaptive elearning web platform integrating a well known dynamic geometry system thousands of geometric problems for geometric theorem provers tgtp is a webbased repository of geometric problems to support the testing and evaluation of geometric automated theorem proving systems the users of these systems should be able to profit from each other the tgtp corpus must be made available to the wgl user allowing in this way the exploration of tgtp problems and their proofs on the other direction tgtp could gain by the possibility of a wider users base submitting new problems such information exchange between clients eg wgl and servers eg tgtp raises many issues geometric search someone working in a geometric problem must be able to ask for more information regarding that construction levels of geometric knowledge and interest the problems in the servers must be classified in such a way that in response to a client query only the problems in the users level andor interest are returned different aims of each tool eg wgl is about secondary school geometry tgtp is about formal proofs in semianalytic and algebraic proof methods not a perfect match indeed localisation issues eg a portuguese user obliged to make the query and process the answer in english technical issuesmany technical issues need to be addressed to make this exchange of geometric information possible and useful instead of a giant difficult to maintain tool trying to cover all the interconnection of specialised tools seems much more promising the challenges to make that connection work are many and difficult but it is the authors impression not insurmountable | [['the', 'web', 'geometry', 'laboratory', 'wgl', 'is', 'a', 'collaborative', 'and', 'adaptive', 'elearning', 'web', 'platform', 'integrating', 'a', 'well', 'known', 'dynamic', 'geometry', 'system', 'thousands', 'of', 'geometric', 'problems', 'for', 'geometric', 'theorem', 'provers', 'tgtp', 'is', 'a', 'webbased', 'repository', 'of', 'geometric', 'problems', 'to', 'support', 'the', 'testing', 'and', 'evaluation', 'of', 'geometric', 'automated', 'theorem', 'proving', 'systems', 'the', 'users', 'of', 'these', 'systems', 'should', 'be', 'able', 'to', 'profit', 'from', 'each', 'other', 'the', 'tgtp', 'corpus', 'must', 'be', 'made', 'available', 'to', 'the', 'wgl', 'user', 'allowing', 'in', 'this', 'way', 'the', 'exploration', 'of', 'tgtp', 'problems', 'and', 'their', 'proofs', 'on', 'the', 'other', 'direction', 'tgtp', 'could', 'gain', 'by', 'the', 'possibility', 'of', 'a', 'wider', 'users', 'base', 'submitting', 'new', 'problems', 'such', 'information', 'exchange', 'between', 'clients', 'eg', 'wgl', 'and', 'servers', 'eg', 'tgtp', 'raises', 'many', 'issues', 'geometric', 'search', 'someone', 'working', 'in', 'a', 'geometric', 'problem', 'must', 'be', 'able', 'to', 'ask', 'for', 'more', 'information', 'regarding', 'that', 'construction', 'levels', 'of', 'geometric', 'knowledge', 'and', 'interest', 'the', 'problems', 'in', 'the', 'servers', 'must', 'be', 'classified', 'in', 'such', 'a', 'way', 'that', 'in', 'response', 'to', 'a', 'client', 'query', 'only', 'the', 'problems', 'in', 'the', 'users', 'level', 'andor', 'interest', 'are', 'returned', 'different', 'aims', 'of', 'each', 'tool', 'eg', 'wgl', 'is', 'about', 'secondary', 'school', 'geometry', 'tgtp', 'is', 'about', 'formal', 'proofs', 'in', 'semianalytic', 'and', 'algebraic', 'proof', 'methods', 'not', 'a', 'perfect', 'match', 'indeed', 'localisation', 'issues', 'eg', 'a', 'portuguese', 'user', 'obliged', 'to', 'make', 'the', 'query', 'and', 'process', 'the', 'answer', 'in', 'english', 'technical', 'issuesmany', 'technical', 'issues', 'need', 'to', 'be', 'addressed', 'to', 'make', 'this', 'exchange', 'of', 'geometric', 'information', 'possible', 'and', 'useful', 'instead', 'of', 'a', 'giant', 'difficult', 'to', 'maintain', 'tool', 'trying', 'to', 'cover', 'all', 'the', 'interconnection', 'of', 'specialised', 'tools', 'seems', 'much', 'more', 'promising', 'the', 'challenges', 'to', 'make', 'that', 'connection', 'work', 'are', 'many', 'and', 'difficult', 'but', 'it', 'is', 'the', 'authors', 'impression', 'not', 'insurmountable']] | [-0.10823503091902346, 0.026338696305814025, -0.10629623088876515, 0.11378282638254662, -0.2034071434507549, -0.20481196803897073, 0.08920446944490662, 0.3679975137496606, -0.30503512090140267, -0.368832231072825, 0.13177051785403707, -0.26956164128924875, -0.1169671261096339, 0.2143016513582019, -0.15431049687706017, 0.04316710434076223, 0.07323290130691501, 0.04194675688503904, -0.01638385649060919, -0.2894232022105256, 0.29327380091579625, 0.06421228591352701, 0.2719992518411342, 0.08133123544362056, 0.054052929943188645, 0.00521594992729634, -0.07129141353855367, 0.0024564088332456545, -0.09777361733090852, 0.16879274221623297, 0.3831361542530904, 0.20177447775740437, 0.33082186284683124, -0.4272446914101804, -0.1578676028930004, 0.06915177253242104, 0.13221144258030162, 0.09817237947681993, -0.03009468788247395, -0.30121511278926455, 0.08932164937066726, -0.1659553989003866, -0.10708098309523947, -0.0710830368025799, -0.013034133414563897, -1.6012276785495953e-05, -0.23528292351453514, -0.05058341095033835, 0.07512027376848755, 0.07416160221146795, -0.010026638857481299, -0.07655475737585433, 0.021741562680300367, 0.20971824439078735, 0.047512847296541656, 0.013523319201486786, 0.14432724333630922, -0.14027886351249813, -0.14220912320941906, 0.4091262166514556, 0.04993835697206413, -0.19109555757553368, 0.22128140547819394, -0.05132961252554159, -0.17175803707414494, 0.08146564345533922, 0.18066245424237115, 0.08954235856445172, -0.19772197181809242, 0.046330002042074304, -0.008559235470580967, 0.19521605868605493, 0.07821597727936702, 0.03571408936385434, 0.23761741606511802, 0.1511102135970356, 0.08668726197172694, 0.0983212363697041, 0.03799601152604071, -0.09722698087852633, -0.23232018174569466, -0.16551923889578524, -0.14819033167814502, 0.03923694020055743, -0.07646932168227268, -0.13931389606213232, 0.3504363308496937, 0.19308926049115022, 0.126567251869433, 0.0060883273730683906, 0.33042016383874545, 0.02111753240533023, 0.0754116841695517, 0.08756163406728225, 0.1545934400076879, 0.06700983100516156, 0.1744416381757802, -0.09222344641792059, 0.10798174092518814, 0.01338789782712011] |
1,803.01472 | Teaching the Formalization of Mathematical Theories and Algorithms via
the Automatic Checking of Finite Models | Education in the practical applications of logic and proving such as the
formal specification and verification of computer programs is substantially
hampered by the fact that most time and effort that is invested in proving is
actually wasted in vain: because of errors in the specifications respectively
algorithms that students have developed, their proof attempts are often
pointless (because the proposition proved is actually not of interest) or a
priori doomed to fail (because the proposition to be proved does actually not
hold), this is a frequent source of frustration and gives formal methods a bad
reputation. RISCAL (RISC Algorithm Language) is a formal specification language
and associated software system that attempts to overcome this problem by making
logic formalization fun rather than a burden. To this end, RISCAL allows
students to easily validate the correctness of instances of propositions
respectively algorithms by automatically evaluating/executing and checking them
on (small) finite models. Thus many/most errors can be quickly detected and
subsequent proof attempts can be focused on propositions that are more/most
likely to be both meaningful and true.
| cs.LO | education in the practical applications of logic and proving such as the formal specification and verification of computer programs is substantially hampered by the fact that most time and effort that is invested in proving is actually wasted in vain because of errors in the specifications respectively algorithms that students have developed their proof attempts are often pointless because the proposition proved is actually not of interest or a priori doomed to fail because the proposition to be proved does actually not hold this is a frequent source of frustration and gives formal methods a bad reputation riscal risc algorithm language is a formal specification language and associated software system that attempts to overcome this problem by making logic formalization fun rather than a burden to this end riscal allows students to easily validate the correctness of instances of propositions respectively algorithms by automatically evaluatingexecuting and checking them on small finite models thus manymost errors can be quickly detected and subsequent proof attempts can be focused on propositions that are moremost likely to be both meaningful and true | [['education', 'in', 'the', 'practical', 'applications', 'of', 'logic', 'and', 'proving', 'such', 'as', 'the', 'formal', 'specification', 'and', 'verification', 'of', 'computer', 'programs', 'is', 'substantially', 'hampered', 'by', 'the', 'fact', 'that', 'most', 'time', 'and', 'effort', 'that', 'is', 'invested', 'in', 'proving', 'is', 'actually', 'wasted', 'in', 'vain', 'because', 'of', 'errors', 'in', 'the', 'specifications', 'respectively', 'algorithms', 'that', 'students', 'have', 'developed', 'their', 'proof', 'attempts', 'are', 'often', 'pointless', 'because', 'the', 'proposition', 'proved', 'is', 'actually', 'not', 'of', 'interest', 'or', 'a', 'priori', 'doomed', 'to', 'fail', 'because', 'the', 'proposition', 'to', 'be', 'proved', 'does', 'actually', 'not', 'hold', 'this', 'is', 'a', 'frequent', 'source', 'of', 'frustration', 'and', 'gives', 'formal', 'methods', 'a', 'bad', 'reputation', 'riscal', 'risc', 'algorithm', 'language', 'is', 'a', 'formal', 'specification', 'language', 'and', 'associated', 'software', 'system', 'that', 'attempts', 'to', 'overcome', 'this', 'problem', 'by', 'making', 'logic', 'formalization', 'fun', 'rather', 'than', 'a', 'burden', 'to', 'this', 'end', 'riscal', 'allows', 'students', 'to', 'easily', 'validate', 'the', 'correctness', 'of', 'instances', 'of', 'propositions', 'respectively', 'algorithms', 'by', 'automatically', 'evaluatingexecuting', 'and', 'checking', 'them', 'on', 'small', 'finite', 'models', 'thus', 'manymost', 'errors', 'can', 'be', 'quickly', 'detected', 'and', 'subsequent', 'proof', 'attempts', 'can', 'be', 'focused', 'on', 'propositions', 'that', 'are', 'moremost', 'likely', 'to', 'be', 'both', 'meaningful', 'and', 'true']] | [-0.0816128574570135, 0.040120158573300334, -0.10494718684631836, 0.11746439644245894, -0.17277751993145685, -0.19222910774096502, 0.09366875395684832, 0.38070663659580356, -0.25463217463024024, -0.35327791679392145, 0.1449856624919706, -0.21177601175945632, -0.1151578443978154, 0.21315398744665454, -0.1983493759802871, 0.06978554842789049, 0.08706082504328792, 0.028365385781898234, -0.0295765936930497, -0.3087978010937959, 0.26164053825828426, 0.050151628315599495, 0.2508629042536796, 0.08321507463253217, 0.044453956622824156, -0.044502812966629, -0.0175956120308101, 0.035696018761093865, -0.04842065535375554, 0.1372446675503605, 0.38434476373714915, 0.2348375259548684, 0.3778037298416902, -0.4386525646584227, -0.1325319477631522, 0.11006044744139785, 0.1433052582843929, 0.13003240338381314, 0.014562116837602734, -0.30847633281733433, 0.12851871486828592, -0.1768583278938848, -0.07459955935964005, -0.11075942377113021, 0.038359040728194176, -0.006806572113250722, -0.21375036984816667, -0.012995875933116054, 0.16466766459506674, 0.08145697648916932, 0.0187663223195385, -0.08333049082221475, 0.0033488607315368133, 0.11712126268108908, 0.07642639557847139, 0.028935359220284257, 0.11619719686800872, -0.10364794991829707, -0.14667470873780333, 0.3986305235481331, 0.05748456364692353, -0.19979505801864098, 0.21448635338365526, -0.06505793793331509, -0.17764359729221854, 0.12891348046008388, 0.12470845916278854, 0.08087430553876854, -0.1697003522846105, 0.07941386628777564, 0.015140255937363543, 0.24964257145389332, 0.06228915048087543, 0.003442959437372884, 0.20595760822748346, 0.13014685899837514, 0.043244774766923115, 0.08743828976650674, 0.059516597094553966, -0.08107962678563431, -0.2431945147159687, -0.18036593970804976, -0.18168279847313215, 0.01687158651752909, -0.013838255804198972, -0.14717143875239902, 0.3290369036322126, 0.2202423102561535, 0.10655929321541607, 0.09681888064100391, 0.32811597375080764, 0.10256038835565587, 0.1088702072149864, 0.07763344077447246, 0.1992059538054759, 0.06880963584031329, 0.10799100875317501, -0.11129515474349949, 0.19191982739233557, 0.045372740882031644] |
1,803.01473 | Natural Deduction and the Isabelle Proof Assistant | We describe our Natural Deduction Assistant (NaDeA) and the interfaces
between the Isabelle proof assistant and NaDeA. In particular, we explain how
NaDeA, using a generated prover that has been verified in Isabelle, provides
feedback to the student, and also how NaDeA, for each formula proved by the
student, provides a generated theorem that can be verified in Isabelle.
| cs.LO | we describe our natural deduction assistant nadea and the interfaces between the isabelle proof assistant and nadea in particular we explain how nadea using a generated prover that has been verified in isabelle provides feedback to the student and also how nadea for each formula proved by the student provides a generated theorem that can be verified in isabelle | [['we', 'describe', 'our', 'natural', 'deduction', 'assistant', 'nadea', 'and', 'the', 'interfaces', 'between', 'the', 'isabelle', 'proof', 'assistant', 'and', 'nadea', 'in', 'particular', 'we', 'explain', 'how', 'nadea', 'using', 'a', 'generated', 'prover', 'that', 'has', 'been', 'verified', 'in', 'isabelle', 'provides', 'feedback', 'to', 'the', 'student', 'and', 'also', 'how', 'nadea', 'for', 'each', 'formula', 'proved', 'by', 'the', 'student', 'provides', 'a', 'generated', 'theorem', 'that', 'can', 'be', 'verified', 'in', 'isabelle']] | [-0.04622391816544331, 0.0466966690590321, -0.23693895343122845, 0.1266624966036465, -0.12914822998819714, -0.2097875260732184, 0.07741635131760169, 0.353220485024533, -0.23548589242716966, -0.3044033978702658, 0.05407952341464174, -0.21985233082609662, -0.14430211086646985, 0.27094905867667524, -0.1280352612799507, -0.003920667978414035, 0.060150282153607175, -0.008053437952678336, 0.02162583060246908, -0.2704500890952551, 0.27343186470916714, -0.008545754919365302, 0.21645731993524706, 0.16258369759514424, 0.12905058666463878, 0.0779964221736132, 0.013162774870456275, 0.001935093097341389, -0.06820276614315059, 0.1365321941863177, 0.32971928273011947, 0.21375081114770877, 0.2944026178980278, -0.43457897613614294, -0.08285295813328634, 0.0018917053969482243, 0.1246553350208422, 0.10607415414809929, -0.11447809715518507, -0.3568604512897841, 0.18232785859855555, -0.23010101914405823, -0.12574953405123393, -0.13625836785945852, -0.004319506728926958, 0.01224338761235462, -0.20798522814855738, -0.06894102052171809, 0.19264203982459285, 0.1450026703335471, -0.0008344066771283998, -0.041523184848286335, -0.03359904502897318, 0.18731476009776027, -0.010432018345947994, 0.032204277182029464, 0.10248703258585627, -0.03761212553008128, -0.19345346222615847, 0.3222592067036588, -0.060504858934525715, -0.18422200628635238, 0.2171965651845528, -0.05964163566102921, -0.11522224586520155, -0.03357004099604437, 0.10967481178941868, 0.06621601714326417, -0.16862688006801627, 0.10704531738143888, -0.0729153457934321, 0.22917858331259025, 0.11975121701341439, -0.07785803532638287, 0.13953543624888032, 0.17438931933256907, -0.04102386507379301, 0.17395530475137788, 0.057131875306367874, -0.054351969764141715, -0.3095939453628104, -0.22915568442667944, -0.15085190710990484, -0.00799259499615153, -0.006046965985876603, -0.07014927058086051, 0.3500770750313492, 0.2085298695364746, 0.06840730221721075, 0.10176963340175355, 0.297759654371352, 0.13080821198734882, 0.07527736543630392, 0.07100743344211477, 0.23230230985051495, 0.13638943819313357, 0.18064359280328124, -0.10837570657574777, 0.10723322977201413, 0.15444933896158206] |
1,803.01474 | Optimizing Learned Bloom Filters by Sandwiching | We provide a simple method for improving the performance of the recently
introduced learned Bloom filters, by showing that they perform better when the
learned function is sandwiched between two Bloom filters.
| cs.DS | we provide a simple method for improving the performance of the recently introduced learned bloom filters by showing that they perform better when the learned function is sandwiched between two bloom filters | [['we', 'provide', 'a', 'simple', 'method', 'for', 'improving', 'the', 'performance', 'of', 'the', 'recently', 'introduced', 'learned', 'bloom', 'filters', 'by', 'showing', 'that', 'they', 'perform', 'better', 'when', 'the', 'learned', 'function', 'is', 'sandwiched', 'between', 'two', 'bloom', 'filters']] | [0.006416778807761148, 0.03992590567213483, -0.10915759010822512, 0.07981238306456362, -0.0895062789786607, -0.22349257253517862, 0.04941100481664762, 0.5024620411568321, -0.2792276846594177, -0.32346268801484257, 0.05251261625380721, -0.2332489154068753, -0.25955622049514204, 0.21306608279701322, -0.10541409303550608, 0.0925213453010656, 0.05550992803182453, -0.045204395260043384, -0.10706555861906963, -0.3452215024153702, 0.27566194982500747, 0.09663691141759045, 0.29253645113203675, -0.030432269850280136, 0.13929573498899117, 0.014510760272969492, -0.09603801943012513, 0.025429714180063456, -0.13273226444403008, 0.15866960218409076, 0.24339142828830518, 0.1711082275141962, 0.34658082528039813, -0.38352769281482324, -0.19115499022882432, 0.06986777184647508, 0.1057088274974376, 0.026809535454958677, -0.07324486650759354, -0.350870095891878, 0.13934452095418237, -0.15198455781501252, 0.01050966688490007, -0.14242161333095282, -0.057934436335926875, 0.027570434231165564, -0.3262122052256018, -0.005703477829229087, 0.13674903515493497, 0.03641399639309384, 0.06109745771391317, -0.142822452733526, -0.023379418475087732, 0.1544042671130228, -0.05442548034625361, -0.00306426924362313, 0.08819773963477928, -0.10709199617849663, -0.1467714577447623, 0.2585277487523854, -0.11136006015294697, -0.23925648862496018, 0.18868914345512167, -0.012819990908610635, -0.05562543973792344, 0.07764467227389105, 0.11509526462759823, 0.0958886874577729, -0.15017141887301477, 0.0051029794121859595, -0.07669705493026413, 0.17103153665084392, 0.07795468965196051, 0.0978251439955784, 0.12987773685745196, 0.2064241465050145, 0.08735716072260402, 0.18428194208536297, -0.09972170411492698, -0.02476457583543379, -0.1821891829604283, -0.15250381523219403, -0.24202223995234817, -0.09476652010926045, -0.10673020283866208, -0.14639807428466156, 0.43040680862031877, 0.17668237152975053, 0.2654299539863132, 0.08002394312643446, 0.330088941998838, 0.09879354236181825, 0.10355318849906325, 0.12240276556985918, 0.26324275706429034, 0.04109477317251731, 0.08687644221936353, -0.1315444512438262, 0.059342258362448774, 0.13830612121819286] |
1,803.01475 | The Fu-Yau equation on compact astheno-K\"ahler manifolds | In this paper, we study the Fu-Yau equation on compact Hermitian manifolds
and prove the existence of solutions of equation on astheno-K\"ahler manifolds.
We also prove the uniqueness of solutions of Fu-Yau equation when the slope
parameter $\alpha$ is negative.
| math.DG math.AP | in this paper we study the fuyau equation on compact hermitian manifolds and prove the existence of solutions of equation on asthenokahler manifolds we also prove the uniqueness of solutions of fuyau equation when the slope parameter alpha is negative | [['in', 'this', 'paper', 'we', 'study', 'the', 'fuyau', 'equation', 'on', 'compact', 'hermitian', 'manifolds', 'and', 'prove', 'the', 'existence', 'of', 'solutions', 'of', 'equation', 'on', 'asthenokahler', 'manifolds', 'we', 'also', 'prove', 'the', 'uniqueness', 'of', 'solutions', 'of', 'fuyau', 'equation', 'when', 'the', 'slope', 'parameter', 'alpha', 'is', 'negative']] | [-0.21032942193560303, 0.014217296650167554, -0.09321418288163841, 0.08677991749718786, -0.10355710396543145, -0.14154053712263703, -0.03910541543446015, 0.29103126120753586, -0.2314726315671578, -0.2100479188375175, 0.14114649846160318, -0.3222237746231258, -0.18759676502086223, 0.17059313682839275, -0.08750128438696265, 0.04342765491455793, 0.08830199653748423, 0.05129909054376185, -0.1137664640089497, -0.2257014610338956, 0.5368484042584896, -0.08376920626033098, 0.20831465143710376, 0.1113275745883584, 0.16332436392549426, -0.07089871736243367, 0.031401106528937815, -0.022127983369864525, -0.2717449302006571, 0.06323509949725122, 0.19773020977154374, 0.04033477859338745, 0.23824226427823306, -0.3478141666855663, -0.18877969027962535, 0.2033782016253099, 0.13475883587962018, 0.0511060165707022, -0.042417504749028015, -0.3058196300640702, 0.12338400860317052, -0.06709709541173652, -0.2734778926242143, -0.08105176286771894, 0.04490342284552753, 0.07699246920528821, -0.20716880122199655, 0.10020740904656122, 0.11455305726267398, -0.007518171891570091, -0.2245448247762397, -0.09080839580856263, -0.020125705865211785, 0.0039978661843633745, 0.07130058823968284, -0.02838571565807797, -0.012064142595045268, -0.107919060572749, -0.05472713434137404, 0.2924415855668485, -0.10495679454179481, -0.32960148761048913, 0.07831672376487404, -0.14671811836306006, -0.17972652746830137, 0.07622442317660898, 0.1720499747665599, 0.24602994708111509, -0.06097459583143063, 0.21192304172873264, -0.09186905678361654, 0.14258046909235417, 0.10360504318960011, -0.03424853985197842, 0.03720032190904021, 0.1211210617038887, 0.17987984481733293, 0.12973978669615463, 0.04305859339656308, -0.09729739930480719, -0.3490314867347479, -0.22500164794619196, -0.10014728216920048, 0.21370688474271446, -0.15556980402870976, -0.215804679505527, 0.3700006357394159, 0.06542524215765297, 0.14860890535637736, 0.1293378342408687, 0.1978091637371108, 0.1688024065864738, -0.08898053681477905, 0.11006700907601044, 0.21916007362306117, 0.2170418943744153, 0.09921779262367636, -0.2119989716564305, -0.019087902363389732, 0.16504596255254] |
1,803.01476 | Weak Decays of Triply Heavy Baryons | After the experimental establishment of doubly heavy baryons, baryons with
three quarks are the last missing pieces of the lowest-lying baryon multiplets
in quark model. In this work we study semileptonic and nonleptonic weak decays
of triply heavy baryons, $\Omega_{ccc}^{++}, \Omega_{ccb}^{+},
\Omega_{cbb}^{0}, \Omega_{bbb}^{-}$. Decay amplitudes for various channels are
parametrized in terms of a few SU(3) irreducible amplitudes. We point out that
branching fractions for Cabibbo allowed processes, $\Omega_{ccc}\to
(\Xi_{cc}^{++} \overline K^0, \Xi_{cc}^{++}K^-\pi^+, \Omega_{cc}^{+}\pi^+,
\Xi_{c}^+ D^+, \Xi_{c}^{\prime} D^+, \Lambda_c D^+\overline K^0, \Xi_{c}^+ D^0
\pi^+, \Xi_{c}^0 D^+\pi^+)$ may reach a few percents. We suggest our
experimental colleagues to perform a search at hadron colliders and the
electron and positron collisions in future, which will presumably lead to
discoveries of triply heavy baryons and complete the baryon multiplets. Using
the expanded amplitudes, we derive a number of relations for the partial widths
which can be examined in future.
| hep-ph | after the experimental establishment of doubly heavy baryons baryons with three quarks are the last missing pieces of the lowestlying baryon multiplets in quark model in this work we study semileptonic and nonleptonic weak decays of triply heavy baryons omega_ccc omega_ccb omega_cbb0 omega_bbb decay amplitudes for various channels are parametrized in terms of a few su3 irreducible amplitudes we point out that branching fractions for cabibbo allowed processes omega_cccto xi_cc overline k0 xi_cckpi omega_ccpi xi_c d xi_cprime d lambda_c doverline k0 xi_c d0 pi xi_c0 dpi may reach a few percents we suggest our experimental colleagues to perform a search at hadron colliders and the electron and positron collisions in future which will presumably lead to discoveries of triply heavy baryons and complete the baryon multiplets using the expanded amplitudes we derive a number of relations for the partial widths which can be examined in future | [['after', 'the', 'experimental', 'establishment', 'of', 'doubly', 'heavy', 'baryons', 'baryons', 'with', 'three', 'quarks', 'are', 'the', 'last', 'missing', 'pieces', 'of', 'the', 'lowestlying', 'baryon', 'multiplets', 'in', 'quark', 'model', 'in', 'this', 'work', 'we', 'study', 'semileptonic', 'and', 'nonleptonic', 'weak', 'decays', 'of', 'triply', 'heavy', 'baryons', 'omega_ccc', 'omega_ccb', 'omega_cbb0', 'omega_bbb', 'decay', 'amplitudes', 'for', 'various', 'channels', 'are', 'parametrized', 'in', 'terms', 'of', 'a', 'few', 'su3', 'irreducible', 'amplitudes', 'we', 'point', 'out', 'that', 'branching', 'fractions', 'for', 'cabibbo', 'allowed', 'processes', 'omega_cccto', 'xi_cc', 'overline', 'k0', 'xi_cckpi', 'omega_ccpi', 'xi_c', 'd', 'xi_cprime', 'd', 'lambda_c', 'doverline', 'k0', 'xi_c', 'd0', 'pi', 'xi_c0', 'dpi', 'may', 'reach', 'a', 'few', 'percents', 'we', 'suggest', 'our', 'experimental', 'colleagues', 'to', 'perform', 'a', 'search', 'at', 'hadron', 'colliders', 'and', 'the', 'electron', 'and', 'positron', 'collisions', 'in', 'future', 'which', 'will', 'presumably', 'lead', 'to', 'discoveries', 'of', 'triply', 'heavy', 'baryons', 'and', 'complete', 'the', 'baryon', 'multiplets', 'using', 'the', 'expanded', 'amplitudes', 'we', 'derive', 'a', 'number', 'of', 'relations', 'for', 'the', 'partial', 'widths', 'which', 'can', 'be', 'examined', 'in', 'future']] | [-0.13178564332676462, 0.295946704190959, -0.06292109192729416, 0.14513460096401412, -0.04746502765100187, -0.14041508113043907, 0.11634911177106018, 0.2726242191577986, -0.17818722969189968, -0.19511659013133653, -0.05221442197052709, -0.37911885254032596, 0.05566199177640005, 0.07125593059283064, 0.12991648466444353, 0.09653860643755277, 0.10756743456643651, 0.012359482449361347, -0.04241726197085907, -0.2530071872096299, 0.25214237404305123, -0.03560397245357154, 0.13034559069135765, 0.14143244252813994, -0.05470781936310232, -0.01488824157555863, -0.0639922233547648, -0.07893043240978265, -0.14834988789952033, 0.07923443664318691, 0.23604495564605188, 0.0914895523070607, 0.12323426314577146, -0.3703791138414346, -0.0679782248892441, 0.16817188088480436, 0.24514571661752663, 0.17747716615009318, -0.025205848436855093, -0.34945554396426176, 0.14851099288076305, -0.19446661202958457, -0.14433758109676795, -0.1337870649901599, 0.06566659804486052, -0.06350118930543393, -0.3198057430358538, 0.12309660857074409, -0.09763646287463186, 0.024286888762373924, 0.006805197422681245, -0.3014455405916546, -0.05849753338171326, -0.0061711372551836174, 0.11185382462752669, 0.061578804563114445, 0.11979260387122107, -0.13476029727985087, -0.17273520080792443, 0.41155299114909444, -0.0616542552073132, -0.15490849258404382, 0.07808858793209189, -0.21633351490993552, -0.19967337857118586, 0.15893431160349766, 0.2456908388929048, 0.08514431020575756, -0.16794445893963353, 0.08740892624941615, -0.05895552381669814, 0.14020781818237057, 0.123487002006404, 0.12090209582295845, 0.24813246808316505, 0.17219608134596648, -0.10711158087975542, 0.031380983232684484, -0.06158813984218565, -0.02778408644248692, -0.3922724557776516, -0.1172237973545455, -0.024309815238820205, 0.07660001902070394, -0.02017357688242222, -0.053621354390101336, 0.36024612189650956, 0.0035949503735665388, 0.31003462521910247, 0.010184418565829769, 0.2633066175523555, 0.03508181380465443, 0.03455707080527799, 0.07431901034958084, 0.28315732116535514, 0.25224071476792154, 0.13296947527666983, -0.2798703475658533, -0.013685791447437303, 0.054370074324690223] |
1,803.01477 | In-home and remote use of robotic body surrogates by people with
profound motor deficits | By controlling robots comparable to the human body, people with profound
motor deficits could potentially perform a variety of physical tasks for
themselves, improving their quality of life. The extent to which this is
achievable has been unclear due to the lack of suitable interfaces by which to
control robotic body surrogates and a dearth of studies involving substantial
numbers of people with profound motor deficits. We developed a novel, web-based
augmented reality interface that enables people with profound motor deficits to
remotely control a PR2 mobile manipulator from Willow Garage, which is a
human-scale, wheeled robot with two arms. We then conducted two studies to
investigate the use of robotic body surrogates. In the first study, 15 novice
users with profound motor deficits from across the United States controlled a
PR2 in Atlanta, GA to perform a modified Action Research Arm Test (ARAT) and a
simulated self-care task. Participants achieved clinically meaningful
improvements on the ARAT and 12 of 15 participants (80%) successfully completed
the simulated self-care task. Participants agreed that the robotic system was
easy to use, was useful, and would provide a meaningful improvement in their
lives. In the second study, one expert user with profound motor deficits had
free use of a PR2 in his home for seven days. He performed a variety of
self-care and household tasks, and also used the robot in novel ways. Taking
both studies together, our results suggest that people with profound motor
deficits can improve their quality of life using robotic body surrogates, and
that they can gain benefit with only low-level robot autonomy and without
invasive interfaces. However, methods to reduce the rate of errors and increase
operational speed merit further investigation.
| cs.RO cs.HC | by controlling robots comparable to the human body people with profound motor deficits could potentially perform a variety of physical tasks for themselves improving their quality of life the extent to which this is achievable has been unclear due to the lack of suitable interfaces by which to control robotic body surrogates and a dearth of studies involving substantial numbers of people with profound motor deficits we developed a novel webbased augmented reality interface that enables people with profound motor deficits to remotely control a pr2 mobile manipulator from willow garage which is a humanscale wheeled robot with two arms we then conducted two studies to investigate the use of robotic body surrogates in the first study 15 novice users with profound motor deficits from across the united states controlled a pr2 in atlanta ga to perform a modified action research arm test arat and a simulated selfcare task participants achieved clinically meaningful improvements on the arat and 12 of 15 participants 80 successfully completed the simulated selfcare task participants agreed that the robotic system was easy to use was useful and would provide a meaningful improvement in their lives in the second study one expert user with profound motor deficits had free use of a pr2 in his home for seven days he performed a variety of selfcare and household tasks and also used the robot in novel ways taking both studies together our results suggest that people with profound motor deficits can improve their quality of life using robotic body surrogates and that they can gain benefit with only lowlevel robot autonomy and without invasive interfaces however methods to reduce the rate of errors and increase operational speed merit further investigation | [['by', 'controlling', 'robots', 'comparable', 'to', 'the', 'human', 'body', 'people', 'with', 'profound', 'motor', 'deficits', 'could', 'potentially', 'perform', 'a', 'variety', 'of', 'physical', 'tasks', 'for', 'themselves', 'improving', 'their', 'quality', 'of', 'life', 'the', 'extent', 'to', 'which', 'this', 'is', 'achievable', 'has', 'been', 'unclear', 'due', 'to', 'the', 'lack', 'of', 'suitable', 'interfaces', 'by', 'which', 'to', 'control', 'robotic', 'body', 'surrogates', 'and', 'a', 'dearth', 'of', 'studies', 'involving', 'substantial', 'numbers', 'of', 'people', 'with', 'profound', 'motor', 'deficits', 'we', 'developed', 'a', 'novel', 'webbased', 'augmented', 'reality', 'interface', 'that', 'enables', 'people', 'with', 'profound', 'motor', 'deficits', 'to', 'remotely', 'control', 'a', 'pr2', 'mobile', 'manipulator', 'from', 'willow', 'garage', 'which', 'is', 'a', 'humanscale', 'wheeled', 'robot', 'with', 'two', 'arms', 'we', 'then', 'conducted', 'two', 'studies', 'to', 'investigate', 'the', 'use', 'of', 'robotic', 'body', 'surrogates', 'in', 'the', 'first', 'study', '15', 'novice', 'users', 'with', 'profound', 'motor', 'deficits', 'from', 'across', 'the', 'united', 'states', 'controlled', 'a', 'pr2', 'in', 'atlanta', 'ga', 'to', 'perform', 'a', 'modified', 'action', 'research', 'arm', 'test', 'arat', 'and', 'a', 'simulated', 'selfcare', 'task', 'participants', 'achieved', 'clinically', 'meaningful', 'improvements', 'on', 'the', 'arat', 'and', '12', 'of', '15', 'participants', '80', 'successfully', 'completed', 'the', 'simulated', 'selfcare', 'task', 'participants', 'agreed', 'that', 'the', 'robotic', 'system', 'was', 'easy', 'to', 'use', 'was', 'useful', 'and', 'would', 'provide', 'a', 'meaningful', 'improvement', 'in', 'their', 'lives', 'in', 'the', 'second', 'study', 'one', 'expert', 'user', 'with', 'profound', 'motor', 'deficits', 'had', 'free', 'use', 'of', 'a', 'pr2', 'in', 'his', 'home', 'for', 'seven', 'days', 'he', 'performed', 'a', 'variety', 'of', 'selfcare', 'and', 'household', 'tasks', 'and', 'also', 'used', 'the', 'robot', 'in', 'novel', 'ways', 'taking', 'both', 'studies', 'together', 'our', 'results', 'suggest', 'that', 'people', 'with', 'profound', 'motor', 'deficits', 'can', 'improve', 'their', 'quality', 'of', 'life', 'using', 'robotic', 'body', 'surrogates', 'and', 'that', 'they', 'can', 'gain', 'benefit', 'with', 'only', 'lowlevel', 'robot', 'autonomy', 'and', 'without', 'invasive', 'interfaces', 'however', 'methods', 'to', 'reduce', 'the', 'rate', 'of', 'errors', 'and', 'increase', 'operational', 'speed', 'merit', 'further', 'investigation']] | [-0.08573487431583164, 0.06083897876162148, -0.08446527746575636, 0.022068215859722465, -0.14182788493555848, -0.18582262132098082, 0.09965658155634495, 0.4300855752610969, -0.17401767112778704, -0.40800850826739815, 0.07651549174899427, -0.25631158012611743, -0.18969403427869772, 0.2392851658417343, -0.17391533695585576, 0.06185857769519462, 0.11540794021614041, 0.0301565048145006, 0.0063569042794373275, -0.25413294520239044, 0.22400061432951632, 0.04208891321745456, 0.2655004304419421, 0.0586718967314097, 0.12511038067468916, -0.004411262386309453, -0.0027055532797455152, 0.007502422912988407, -0.07590953449213636, 0.17302669405591678, 0.32481882347910934, 0.17467098943706855, 0.3513422921710909, -0.471216840795871, -0.21259774485134, 0.07777967645365784, 0.11836842141028003, 0.04702045746956326, -0.06048713700002344, -0.35258477985456227, 0.07106479632214964, -0.21022762953561985, -0.10833329233437033, -0.06020672935859907, 0.013223778745727083, 0.0014461435678371915, -0.22427388995030756, 0.012493151429691766, -0.020972903920014413, 0.16074574621082732, -0.07272357957560265, -0.10004603800080465, -0.008046865147361167, 0.27523841581794556, 0.06017221005888675, 0.03597008692099816, 0.2470833674384765, -0.1691952293342662, -0.15570005310410998, 0.3897307947447053, 0.015451224460316245, -0.1651387803912746, 0.2535336312168407, -0.1277155110552854, -0.12465575436549427, 0.09818708407402608, 0.23016666930029667, 0.06635448918263577, -0.18073745340347502, -0.056237586547522825, -0.001605614775367532, 0.1955681770370471, 0.04889946903149329, -0.04695595706915781, 0.18926769105464408, 0.1847916111230744, 0.036291471415686546, 0.09949681419693597, -0.04614982382788777, -0.08409820251445223, -0.1867321178621987, -0.17591575326172643, -0.10288192405679439, 0.0015978410896377844, -0.05336097873836628, -0.05823847165685876, 0.361006747752269, 0.18134242971510597, 0.14532763261374523, 0.04683889360554447, 0.3125458895245375, 0.01149261540367046, 0.1170738077377801, 0.019552196245524515, 0.20971676234812128, 0.004644289579626928, 0.15655441940148954, -0.2263626682231728, 0.12253286008179533, -0.047814179371459924] |
1,803.01478 | Two-sided popular matchings in bipartite graphs with forbidden/forced
elements and weights | Two-sided popular matchings in bipartite graphs are a well-known
generalization of stable matchings in the marriage setting, and they are
especially relevant when preference lists are incomplete. In this case, the
cardinality of a stable matching can be as small as half the size of a maximum
matching. Popular matchings allow for assignments of larger size while still
guaranteeing a certain fairness condition. In fact, stable matchings are
popular matchings of minimum size, and a maximum size popular matching can be
as large as twice the size of a(ny) stable matching in a given instance. The
structure of popular matchings seems to be more complex, and currently less
understood, than that of stable matchings. In this paper, we focus on three
optimization problems related to popular matchings. First, we give a granular
analysis of the complexity of popular matching with forbidden and forced
elements problems, thus complementing results from [Cseh and Kavitha, 2016]. In
particular, we show that deciding whether there exists a popular matching with
(or without) two given edges is NP-Hard. This implies that finding a popular
matching of maximum (resp. minimum) weight is NP-Hard and, even if all weights
are nonnegative, inapproximable up to a factor 1/2 (resp. up to any factor). A
decomposition theorem from [Cseh and Kavitha, 2016] can be employed to give a
1/2 approximation to the maximum weighted popular matching problem with
nonnegative weights, thus completely settling the complexity of those problems.
| cs.DM | twosided popular matchings in bipartite graphs are a wellknown generalization of stable matchings in the marriage setting and they are especially relevant when preference lists are incomplete in this case the cardinality of a stable matching can be as small as half the size of a maximum matching popular matchings allow for assignments of larger size while still guaranteeing a certain fairness condition in fact stable matchings are popular matchings of minimum size and a maximum size popular matching can be as large as twice the size of any stable matching in a given instance the structure of popular matchings seems to be more complex and currently less understood than that of stable matchings in this paper we focus on three optimization problems related to popular matchings first we give a granular analysis of the complexity of popular matching with forbidden and forced elements problems thus complementing results from cseh and kavitha 2016 in particular we show that deciding whether there exists a popular matching with or without two given edges is nphard this implies that finding a popular matching of maximum resp minimum weight is nphard and even if all weights are nonnegative inapproximable up to a factor 12 resp up to any factor a decomposition theorem from cseh and kavitha 2016 can be employed to give a 12 approximation to the maximum weighted popular matching problem with nonnegative weights thus completely settling the complexity of those problems | [['twosided', 'popular', 'matchings', 'in', 'bipartite', 'graphs', 'are', 'a', 'wellknown', 'generalization', 'of', 'stable', 'matchings', 'in', 'the', 'marriage', 'setting', 'and', 'they', 'are', 'especially', 'relevant', 'when', 'preference', 'lists', 'are', 'incomplete', 'in', 'this', 'case', 'the', 'cardinality', 'of', 'a', 'stable', 'matching', 'can', 'be', 'as', 'small', 'as', 'half', 'the', 'size', 'of', 'a', 'maximum', 'matching', 'popular', 'matchings', 'allow', 'for', 'assignments', 'of', 'larger', 'size', 'while', 'still', 'guaranteeing', 'a', 'certain', 'fairness', 'condition', 'in', 'fact', 'stable', 'matchings', 'are', 'popular', 'matchings', 'of', 'minimum', 'size', 'and', 'a', 'maximum', 'size', 'popular', 'matching', 'can', 'be', 'as', 'large', 'as', 'twice', 'the', 'size', 'of', 'any', 'stable', 'matching', 'in', 'a', 'given', 'instance', 'the', 'structure', 'of', 'popular', 'matchings', 'seems', 'to', 'be', 'more', 'complex', 'and', 'currently', 'less', 'understood', 'than', 'that', 'of', 'stable', 'matchings', 'in', 'this', 'paper', 'we', 'focus', 'on', 'three', 'optimization', 'problems', 'related', 'to', 'popular', 'matchings', 'first', 'we', 'give', 'a', 'granular', 'analysis', 'of', 'the', 'complexity', 'of', 'popular', 'matching', 'with', 'forbidden', 'and', 'forced', 'elements', 'problems', 'thus', 'complementing', 'results', 'from', 'cseh', 'and', 'kavitha', '2016', 'in', 'particular', 'we', 'show', 'that', 'deciding', 'whether', 'there', 'exists', 'a', 'popular', 'matching', 'with', 'or', 'without', 'two', 'given', 'edges', 'is', 'nphard', 'this', 'implies', 'that', 'finding', 'a', 'popular', 'matching', 'of', 'maximum', 'resp', 'minimum', 'weight', 'is', 'nphard', 'and', 'even', 'if', 'all', 'weights', 'are', 'nonnegative', 'inapproximable', 'up', 'to', 'a', 'factor', '12', 'resp', 'up', 'to', 'any', 'factor', 'a', 'decomposition', 'theorem', 'from', 'cseh', 'and', 'kavitha', '2016', 'can', 'be', 'employed', 'to', 'give', 'a', '12', 'approximation', 'to', 'the', 'maximum', 'weighted', 'popular', 'matching', 'problem', 'with', 'nonnegative', 'weights', 'thus', 'completely', 'settling', 'the', 'complexity', 'of', 'those', 'problems']] | [-0.11433285043352845, 0.10164724979431758, -0.040131322567975976, 0.09351321935156588, -0.10238376280041372, -0.16695751121094773, 0.06434963747931699, 0.373501923687649, -0.27836686146213724, -0.34348966434346473, 0.15404671953277826, -0.2844522599629932, -0.11822237634642309, 0.1347840322181091, -0.10998742779292449, 0.06841042334752212, 0.10650981642022918, 0.07279164527586116, -0.03075236718775508, -0.3104301728858349, 0.28188420832451855, 0.019201999221720147, 0.24807196701601744, 0.07009614825853881, 0.05464678441192994, 0.02254088198813268, 0.011294010987324554, 0.10342261697659819, -0.14083950465172604, 0.13082060859836284, 0.29135184009551596, 0.17302537720477532, 0.2826700770533899, -0.36165653801039804, -0.13209841554819407, 0.21321314570733704, 0.1271185718117211, 0.09197612791341819, -0.022996680742094808, -0.16728845656798358, 0.15962594984893055, -0.0971678387862925, -0.07430568383724177, -0.032521281211601596, 0.07044804871341662, -0.0029430724918657622, -0.31925123662295857, 0.03497881239146497, 0.07568742619740938, 0.004143314532661036, 0.00544067948048675, -0.17867632918177714, 0.0012321432557287095, 0.09001507970098237, -0.00988890678707298, 0.016604875000233013, 0.021989484853012966, -0.14847001422860734, -0.16849405801352035, 0.43952168897580246, -0.03159127014873103, -0.1696062885334849, 0.1600291007389963, -0.06612102882661523, -0.14554726143017852, 0.12475000527188308, 0.1381427730858043, 0.1947539003171962, -0.09221764759585224, 0.05903482723824939, -0.14435399580503253, 0.16076082010843834, 0.16775196690686078, 0.012485766325554641, 0.1711848291464323, 0.16781200637317847, 0.1912953811442236, 0.15948329235914355, 0.009469609590687392, -0.08747113601575736, -0.22140893370516299, -0.08943909688809501, -0.18276598452902812, 0.024823827677374934, -0.1572294345078032, -0.21600694472229556, 0.37685471238324786, 0.11398040296073673, 0.1963948363434319, 0.10670260529973022, 0.27037355107037186, 0.09270285682375484, 0.05312979459970844, 0.17189624163131564, 0.17549321261914408, 0.12708895492174893, -0.004544040820863931, -0.12554355583670412, 0.09849751209764042, 0.07113661400124996] |
1,803.01479 | Coulomb force mediated heat transfer in the near field - geometric
effect | It has been shown recently that the Coulomb part of electromagnetic
interactions is more important than transverse propagation waves for the
near-field enhancement of heat transfer between metal objects at a distance of
order nanometers. Here we present a theory focusing solely on the Coulomb
potential between electrons hopping among tight-binding sites. When the
relevant systems are reduced to very small geometry, for example, a single
site, the enhancement is much higher compared to a collection of them packed
within a distance of a few angstroms. We credit this to the screening effect.
This result may be useful in designing metal-based meta-materials to enhance
heat transfer much higher.
| cond-mat.mes-hall | it has been shown recently that the coulomb part of electromagnetic interactions is more important than transverse propagation waves for the nearfield enhancement of heat transfer between metal objects at a distance of order nanometers here we present a theory focusing solely on the coulomb potential between electrons hopping among tightbinding sites when the relevant systems are reduced to very small geometry for example a single site the enhancement is much higher compared to a collection of them packed within a distance of a few angstroms we credit this to the screening effect this result may be useful in designing metalbased metamaterials to enhance heat transfer much higher | [['it', 'has', 'been', 'shown', 'recently', 'that', 'the', 'coulomb', 'part', 'of', 'electromagnetic', 'interactions', 'is', 'more', 'important', 'than', 'transverse', 'propagation', 'waves', 'for', 'the', 'nearfield', 'enhancement', 'of', 'heat', 'transfer', 'between', 'metal', 'objects', 'at', 'a', 'distance', 'of', 'order', 'nanometers', 'here', 'we', 'present', 'a', 'theory', 'focusing', 'solely', 'on', 'the', 'coulomb', 'potential', 'between', 'electrons', 'hopping', 'among', 'tightbinding', 'sites', 'when', 'the', 'relevant', 'systems', 'are', 'reduced', 'to', 'very', 'small', 'geometry', 'for', 'example', 'a', 'single', 'site', 'the', 'enhancement', 'is', 'much', 'higher', 'compared', 'to', 'a', 'collection', 'of', 'them', 'packed', 'within', 'a', 'distance', 'of', 'a', 'few', 'angstroms', 'we', 'credit', 'this', 'to', 'the', 'screening', 'effect', 'this', 'result', 'may', 'be', 'useful', 'in', 'designing', 'metalbased', 'metamaterials', 'to', 'enhance', 'heat', 'transfer', 'much', 'higher']] | [-0.12674124980414356, 0.1411127382285755, -0.012030537238590315, 0.1120393120476769, -0.07934960836751594, -0.15143095654504443, 0.04622852807989585, 0.4233968908967519, -0.2491502773568586, -0.3086078778012759, 0.02291639406057247, -0.3362969193366115, -0.14535946075597572, 0.22534259658789746, 0.01594764830035813, -0.011437861153993893, 0.04217377214485572, 0.008759941698776351, -0.06433096107880205, -0.19963919885318587, 0.2738004340057227, 0.10670636439075072, 0.2797083775329628, 0.12407702065711082, 0.04149869734990514, 0.006479687924082909, 0.05884868337307125, 0.042214074896441564, -0.0896736993996725, 0.17045402486851177, 0.24567060448936429, -0.04189915313920075, 0.2944729651660762, -0.4292960669759109, -0.27390165679820777, 0.0740314106396572, 0.15518022618144406, 0.18118657541668248, -0.0704290414951511, -0.23465482117090788, 0.060836615591715264, -0.178037881264808, -0.08063984816652481, -0.03397581195113836, 0.0557064912971799, 0.004627368067977605, -0.2524288431741297, 0.05322751348527769, 0.02990614734881092, 0.04982754315197882, -0.017519232804059155, -0.09888778742902947, -0.012870133893253902, 0.12220060670477795, 0.02859152899623883, 0.0322425371807724, 0.14351724349479708, -0.1275221818488919, -0.0478325308498892, 0.40845829331212574, -0.03926721169072725, -0.17954705281321098, 0.21957794745901116, -0.1651327851521071, -0.028500501338082056, 0.17428354325669784, 0.1864550148430108, 0.14682737472725826, -0.1778523852533706, 0.008396982245526655, 0.008021800968520067, 0.17014118467664552, 0.06892321169747177, 0.07962847100053397, 0.23131478407109776, 0.22392068941499693, 0.052519287431129706, 0.14755115341459815, -0.09236005965336787, -0.06555922607313497, -0.23448444361350052, -0.14535302564682853, -0.2008138729983734, 0.08052945648389007, -0.08418037382876652, -0.16140227994307038, 0.37046489842005365, 0.16700931735599792, 0.17333494599787863, -0.04101371122049858, 0.2760242426905919, 0.12497630991317608, 0.147506896958307, 0.020702420951608843, 0.2876007316754786, 0.14266462693059886, 0.12689300624360503, -0.20819870930346143, 0.04283028108464485, 0.04878868149696953] |
1,803.0148 | A doubling construction for Williamson matrices | A construction that generates Williamson matrices of order $2n$ from
Williamson matrices of odd order $n$ is presented. The construction is
completely constructive and only uses three simple sequence operations.
| math.CO | a construction that generates williamson matrices of order 2n from williamson matrices of odd order n is presented the construction is completely constructive and only uses three simple sequence operations | [['a', 'construction', 'that', 'generates', 'williamson', 'matrices', 'of', 'order', '2n', 'from', 'williamson', 'matrices', 'of', 'odd', 'order', 'n', 'is', 'presented', 'the', 'construction', 'is', 'completely', 'constructive', 'and', 'only', 'uses', 'three', 'simple', 'sequence', 'operations']] | [-0.22889552743484576, 0.1763626811405023, -0.05969683853909373, 0.048165858203234775, -0.06549452748149634, -0.18586033034759264, -0.005760434576465438, 0.28380173558640914, -0.22603756735722225, -0.2836088380776346, 0.09435501756767432, -0.25499743797505897, -0.2456716319002832, 0.14783705944816272, -0.06378559637038658, 0.006320790376048535, 0.04359934292733669, 0.03381510445227225, -0.11149119024630635, -0.34931220977256694, 0.3157169772932927, -0.0009964406490325928, 0.19269953134159248, -0.04093396815781792, 0.13420157682461042, 0.06046589175239205, -0.0833442060276866, -0.08410506894191107, -0.015722913335048362, 0.09463000118266791, 0.2792915526467065, 0.17285018960634868, 0.17733521445964773, -0.3714012360821168, -0.0325324192973009, 0.1237581075479587, 0.1249956400754551, 0.1225917709680895, -0.025503947492688896, -0.17615539664402605, 0.13739558564605733, -0.17447836127054567, -0.10019807557885846, -0.1023384793351094, 0.0492242518812418, -0.041309099085628985, -0.3928093937846521, -0.06000223883117239, 0.19832337896029154, 0.016734199970960616, 0.07107058206262688, -0.22850933941081167, 0.04509004717692733, 0.10026859006223579, -0.10144904120825231, 0.0037817873681584993, 0.00026107486337423325, 0.057826806666950385, -0.16052436735481024, 0.32232041166474423, 0.023368169204331934, -0.1920185266683499, 0.13457436721461516, -0.10572229468574126, -0.13490866272089383, 0.19310492674509686, 0.06866258593897025, 0.15687019638717176, -0.07980918725952506, 0.17658018587583987, -0.1182891854395469, 0.2154976435005665, 0.1490327169497808, -0.024196084573244056, 0.048729873883227505, 0.09359731214741866, 0.1325459275705119, 0.13559045754373072, 0.04629921490947406, -0.08108065125222007, -0.3227749839425087, -0.10534117086984528, -0.27025171825662253, 0.08640927082548538, -0.11679452007277481, -0.1529949224864443, 0.431827238202095, 0.06339901412526766, 0.16990433701624472, 0.1097065736229221, 0.2706611704081297, 0.05609373568246762, 0.04267758820205927, 0.08974992654790791, 0.0365807351966699, 0.23987114736810328, -0.007278120688473185, -0.12739868486920994, 0.008249516257395346, 0.2662195221831401] |
1,803.01481 | Controlled quantum search on structured databases | We present quantum algorithms to search for marked vertices in structured
databases with low connectivity. Adopting a multi-stage search process, we
achieve a success probability close to $100\%$ on Cayley trees with large
branching factors. We find that the number of stages required is given by the
height of the Cayley tree. At each stage, the jumping rate should be chosen as
different values. The dominant term of the runtime in the search process is
proportional to $N^{(2r-1)/2r}$ for the Cayley tree of height $r$ with $N$
vertices. We further find that one can control the number of stages by
adjusting the weight of the edges in the graphs. The multi-stage search process
can be merged into a single stage, and then an optimal runtime proportional to
$\sqrt{N}$ is achieved, yielding a substantial speedup. The search process is
quite robust under various kinds of small perturbations.
| quant-ph cs.DS | we present quantum algorithms to search for marked vertices in structured databases with low connectivity adopting a multistage search process we achieve a success probability close to 100 on cayley trees with large branching factors we find that the number of stages required is given by the height of the cayley tree at each stage the jumping rate should be chosen as different values the dominant term of the runtime in the search process is proportional to n2r12r for the cayley tree of height r with n vertices we further find that one can control the number of stages by adjusting the weight of the edges in the graphs the multistage search process can be merged into a single stage and then an optimal runtime proportional to sqrtn is achieved yielding a substantial speedup the search process is quite robust under various kinds of small perturbations | [['we', 'present', 'quantum', 'algorithms', 'to', 'search', 'for', 'marked', 'vertices', 'in', 'structured', 'databases', 'with', 'low', 'connectivity', 'adopting', 'a', 'multistage', 'search', 'process', 'we', 'achieve', 'a', 'success', 'probability', 'close', 'to', '100', 'on', 'cayley', 'trees', 'with', 'large', 'branching', 'factors', 'we', 'find', 'that', 'the', 'number', 'of', 'stages', 'required', 'is', 'given', 'by', 'the', 'height', 'of', 'the', 'cayley', 'tree', 'at', 'each', 'stage', 'the', 'jumping', 'rate', 'should', 'be', 'chosen', 'as', 'different', 'values', 'the', 'dominant', 'term', 'of', 'the', 'runtime', 'in', 'the', 'search', 'process', 'is', 'proportional', 'to', 'n2r12r', 'for', 'the', 'cayley', 'tree', 'of', 'height', 'r', 'with', 'n', 'vertices', 'we', 'further', 'find', 'that', 'one', 'can', 'control', 'the', 'number', 'of', 'stages', 'by', 'adjusting', 'the', 'weight', 'of', 'the', 'edges', 'in', 'the', 'graphs', 'the', 'multistage', 'search', 'process', 'can', 'be', 'merged', 'into', 'a', 'single', 'stage', 'and', 'then', 'an', 'optimal', 'runtime', 'proportional', 'to', 'sqrtn', 'is', 'achieved', 'yielding', 'a', 'substantial', 'speedup', 'the', 'search', 'process', 'is', 'quite', 'robust', 'under', 'various', 'kinds', 'of', 'small', 'perturbations']] | [-0.13447690424228345, 0.16760290691655144, -0.04632105539906128, 0.02565756018362851, -0.06138700328863644, -0.13203730765601684, 0.09626838734437679, 0.381664516340042, -0.2956191059330414, -0.33641342597788776, 0.09202287121643794, -0.2435618106564828, -0.10777727683588606, 0.1443105243901112, -0.04684047873677879, 0.045036811759827884, 0.09730228617193241, 0.08020110908104909, -0.004156674982594519, -0.2990014842486587, 0.28602777850203986, 0.10602268826714235, 0.24801041282520725, 0.01200561966578444, 0.08175213014514282, 0.0002302960701415251, -0.005472727787905726, 0.018696652217928704, -0.11743028303016186, 0.06647922289076036, 0.25846424392807893, 0.1488892800046195, 0.2692294600965648, -0.4029516825067072, -0.12596322822802025, 0.17704418366212912, 0.1392453188722921, 0.09283289946615696, -0.02424750465915763, -0.22775499334494614, 0.13742482217414112, -0.11973426026003114, -0.08308347103282296, -0.027885216635105937, 0.0368364737754495, 0.012403384107967904, -0.30839515417043506, -0.01009790257325974, 0.043465241921487555, -0.007782917463317, 0.030446980081113247, -0.15498883990121298, -0.01035673113877018, 0.13031505173521823, 0.004122813864097256, 0.048102301510115124, 0.12166278504862868, -0.13682537835476727, -0.17461879291924937, 0.3535154093442292, -0.09174744930632156, -0.1643243077949717, 0.16817083984998793, -0.11217460201647743, -0.1355924757968249, 0.1793206348918892, 0.2065248704868658, 0.14298246932248104, -0.13218484597023705, 0.05162835867316783, 0.007990160494528968, 0.1716455755177243, 0.07838141118529542, -0.020326311327517034, 0.16796591750763615, 0.22175346858285624, 0.08911883753949199, 0.1879760702060343, -0.07971164091040606, -0.09220607894119517, -0.2841657147068402, -0.12954597138350124, -0.1801894969114199, 0.015470855756951818, -0.19445364040730057, -0.1570728896249985, 0.39281572345644233, 0.1388452668770634, 0.2603736691819183, 0.10118333272443249, 0.2586307773462914, 0.14055422969917156, 0.11085246393521284, 0.10684017954426336, 0.16460051345960078, 0.05606559533946987, 0.019222296595348624, -0.19167930988337972, 0.12668603531121084, 0.0806791185112349] |
1,803.01482 | Three-dimensional convolutional neural networks for neutrinoless
double-beta decay signal/background discrimination in high-pressure gaseous
Time Projection Chamber | In the search for neutrinoless double-beta decay, the high-pressure gaseous
Time Projection Chamber has a distinct advantage, because the ionization charge
tracks produced by particle interactions are extended and the detector captures
the full three-dimensional charge distribution with appropriate charge readout
systems. Such information of tracks provides a crucial extra-handle for
discriminating signal events against backgrounds. In this paper, we constructed
a toy model to demonstrate where the discrimination power comes from and how
much of it the neural network models have already harnessed. Then we adapted
3-dimensional convolutional and residual neural networks on the simulated
double-beta and background charge tracks and tested their capabilities in
classifying these two types of events. We show that both the 3D structure and
the overall depth of the neural networks significantly improve the accuracy of
the classifier and lead to results better than previous works. We also studied
their performance under various spatial granularities as well as different
diffusion and noise conditions. The results indicate that the methods are
stable and generalize well despite varying experimental conditions.
| physics.data-an hep-ex | in the search for neutrinoless doublebeta decay the highpressure gaseous time projection chamber has a distinct advantage because the ionization charge tracks produced by particle interactions are extended and the detector captures the full threedimensional charge distribution with appropriate charge readout systems such information of tracks provides a crucial extrahandle for discriminating signal events against backgrounds in this paper we constructed a toy model to demonstrate where the discrimination power comes from and how much of it the neural network models have already harnessed then we adapted 3dimensional convolutional and residual neural networks on the simulated doublebeta and background charge tracks and tested their capabilities in classifying these two types of events we show that both the 3d structure and the overall depth of the neural networks significantly improve the accuracy of the classifier and lead to results better than previous works we also studied their performance under various spatial granularities as well as different diffusion and noise conditions the results indicate that the methods are stable and generalize well despite varying experimental conditions | [['in', 'the', 'search', 'for', 'neutrinoless', 'doublebeta', 'decay', 'the', 'highpressure', 'gaseous', 'time', 'projection', 'chamber', 'has', 'a', 'distinct', 'advantage', 'because', 'the', 'ionization', 'charge', 'tracks', 'produced', 'by', 'particle', 'interactions', 'are', 'extended', 'and', 'the', 'detector', 'captures', 'the', 'full', 'threedimensional', 'charge', 'distribution', 'with', 'appropriate', 'charge', 'readout', 'systems', 'such', 'information', 'of', 'tracks', 'provides', 'a', 'crucial', 'extrahandle', 'for', 'discriminating', 'signal', 'events', 'against', 'backgrounds', 'in', 'this', 'paper', 'we', 'constructed', 'a', 'toy', 'model', 'to', 'demonstrate', 'where', 'the', 'discrimination', 'power', 'comes', 'from', 'and', 'how', 'much', 'of', 'it', 'the', 'neural', 'network', 'models', 'have', 'already', 'harnessed', 'then', 'we', 'adapted', '3dimensional', 'convolutional', 'and', 'residual', 'neural', 'networks', 'on', 'the', 'simulated', 'doublebeta', 'and', 'background', 'charge', 'tracks', 'and', 'tested', 'their', 'capabilities', 'in', 'classifying', 'these', 'two', 'types', 'of', 'events', 'we', 'show', 'that', 'both', 'the', '3d', 'structure', 'and', 'the', 'overall', 'depth', 'of', 'the', 'neural', 'networks', 'significantly', 'improve', 'the', 'accuracy', 'of', 'the', 'classifier', 'and', 'lead', 'to', 'results', 'better', 'than', 'previous', 'works', 'we', 'also', 'studied', 'their', 'performance', 'under', 'various', 'spatial', 'granularities', 'as', 'well', 'as', 'different', 'diffusion', 'and', 'noise', 'conditions', 'the', 'results', 'indicate', 'that', 'the', 'methods', 'are', 'stable', 'and', 'generalize', 'well', 'despite', 'varying', 'experimental', 'conditions']] | [-0.032236018971771516, 0.10722629754464923, -0.059523652597381654, 0.0960937391305773, -0.0013055024679341069, -0.14686536754486879, -0.0026925069736209134, 0.4033758529176602, -0.2304181835554928, -0.33131595618613713, 0.06841451191475259, -0.2790758021154328, -0.15824457425274213, 0.19778924387221217, -0.03999783782116165, 0.08786387173519497, 0.09058825946359148, 0.020904099817705378, -0.09473048707112304, -0.24459390137533016, 0.29341902809400605, 0.11154039433452091, 0.32022037616570215, 0.04318261308551125, 0.11374489860501506, -0.03621499346450746, -0.0726980292076794, 0.014435878834374938, -0.10255474104410417, 0.07574284924571052, 0.2458870556844828, 0.1449728411838269, 0.1891563300250604, -0.47070625114303105, -0.23961636198501537, 0.12608257534165432, 0.13945683459697475, 0.1062648252508673, -0.0915466512969259, -0.3348997624461792, 0.10038672925667524, -0.17756412362927473, -0.05880663428466358, -0.10865948745857042, -0.03574368475554134, 0.04095571096434737, -0.26536959595103465, 0.04388627034562877, 0.07023954555302094, 0.004393728518578617, -0.07617819341534825, -0.14181417232713087, -0.005338605036393798, 0.1612904697166745, 0.04324493068472261, 0.012489550948180689, 0.17249626759439707, -0.16358181808515307, -0.13518417656093276, 0.3408765773251222, -0.05233141692192765, -0.21018189950065547, 0.22117445035703007, -0.12322094643251658, -0.10220874201323342, 0.13681837138208436, 0.1851232098610641, 0.09593461181516248, -0.14759394548385205, 0.031851607619453694, 0.007223654842553284, 0.17486529852225946, 0.04488695315973607, 0.06361702755847246, 0.19652386242927541, 0.25400905587274386, 0.02737401319853423, 0.10364715305205456, -0.15683902637640046, -0.07076739396353526, -0.24005804518224252, -0.13145314111149564, -0.13180629543238723, -0.0010076231609846902, -0.08119893090379211, -0.11918792643347442, 0.45603244512670305, 0.18385868531926347, 0.19928802721568442, 0.05253092415840769, 0.3212257155750184, 0.038641195226126926, 0.08590175092591759, 0.03711398174135671, 0.2363462588800968, 0.09743854963231423, 0.11623547709347799, -0.22239619497353794, 0.07865228051739621, 0.023249016424662546] |
1,803.01483 | Quantum gravity, information theory and the CMB | We review connections between the metric of spacetime and the quantum
fluctuations of fields. In particular, we discuss the finding that the
spacetime metric can be expressed entirely in terms of the 2-point correlators
of the fluctuations of quantum fields. We also discuss the open question
whether the knowledge of only the spectra of the quantum fluctuations of fields
suffices to determine the spacetime metric. This question is of interest
because spectra are geometric invariants and their quantization would,
therefore, have the benefit of not requiring the modding out of the
diffeomorphism group. Further, we discuss the fact that spacetime at the Planck
scale need not necessarily be either discrete or continuous. Instead, results
from information theory show that spacetime may be simultaneously discrete and
continuous in the same way that information can. Finally, we review the finding
that a covariant natural ultraviolet cutoff at the Planck scale implies a
signature in the cosmic microwave background (CMB) that may become observable.
| gr-qc | we review connections between the metric of spacetime and the quantum fluctuations of fields in particular we discuss the finding that the spacetime metric can be expressed entirely in terms of the 2point correlators of the fluctuations of quantum fields we also discuss the open question whether the knowledge of only the spectra of the quantum fluctuations of fields suffices to determine the spacetime metric this question is of interest because spectra are geometric invariants and their quantization would therefore have the benefit of not requiring the modding out of the diffeomorphism group further we discuss the fact that spacetime at the planck scale need not necessarily be either discrete or continuous instead results from information theory show that spacetime may be simultaneously discrete and continuous in the same way that information can finally we review the finding that a covariant natural ultraviolet cutoff at the planck scale implies a signature in the cosmic microwave background cmb that may become observable | [['we', 'review', 'connections', 'between', 'the', 'metric', 'of', 'spacetime', 'and', 'the', 'quantum', 'fluctuations', 'of', 'fields', 'in', 'particular', 'we', 'discuss', 'the', 'finding', 'that', 'the', 'spacetime', 'metric', 'can', 'be', 'expressed', 'entirely', 'in', 'terms', 'of', 'the', '2point', 'correlators', 'of', 'the', 'fluctuations', 'of', 'quantum', 'fields', 'we', 'also', 'discuss', 'the', 'open', 'question', 'whether', 'the', 'knowledge', 'of', 'only', 'the', 'spectra', 'of', 'the', 'quantum', 'fluctuations', 'of', 'fields', 'suffices', 'to', 'determine', 'the', 'spacetime', 'metric', 'this', 'question', 'is', 'of', 'interest', 'because', 'spectra', 'are', 'geometric', 'invariants', 'and', 'their', 'quantization', 'would', 'therefore', 'have', 'the', 'benefit', 'of', 'not', 'requiring', 'the', 'modding', 'out', 'of', 'the', 'diffeomorphism', 'group', 'further', 'we', 'discuss', 'the', 'fact', 'that', 'spacetime', 'at', 'the', 'planck', 'scale', 'need', 'not', 'necessarily', 'be', 'either', 'discrete', 'or', 'continuous', 'instead', 'results', 'from', 'information', 'theory', 'show', 'that', 'spacetime', 'may', 'be', 'simultaneously', 'discrete', 'and', 'continuous', 'in', 'the', 'same', 'way', 'that', 'information', 'can', 'finally', 'we', 'review', 'the', 'finding', 'that', 'a', 'covariant', 'natural', 'ultraviolet', 'cutoff', 'at', 'the', 'planck', 'scale', 'implies', 'a', 'signature', 'in', 'the', 'cosmic', 'microwave', 'background', 'cmb', 'that', 'may', 'become', 'observable']] | [-0.13955354048170565, 0.17757096936237876, -0.1384935163377975, 0.10303837648934182, -0.08999691808723514, -0.07586169756821687, -0.0004995899030545391, 0.35120739358598774, -0.28147374345741655, -0.27849354616927435, 0.1127336806247462, -0.2642349248335506, -0.15374346140060596, 0.16889709570757488, -0.06721414710244639, -0.003959035610791689, 0.009020336125601337, 0.06662542285594325, -0.09125245290067949, -0.25529057092773755, 0.3792896215132906, 0.09567602861582979, 0.26848846350605626, 0.07474320581805949, 0.09629728172483466, -0.03954943999364648, -0.0835165341054986, 0.054390158885309, -0.10297525369680431, 0.09369996110767687, 0.2408020144895367, 0.14631453671301745, 0.20757732257212264, -0.4104235144071744, -0.24279036285552363, 0.14780196166880752, 0.15701773575570735, 0.14768431285216896, -0.02431269645074857, -0.27231310482674875, 0.07354828301724625, -0.10570571388650153, -0.12119530945089328, -0.09284690976784975, -0.031129908247602096, -0.04600774133520097, -0.20506083633264768, 0.07071253120366293, 0.08540541578231738, 0.022820262527613905, -0.05337138349907646, -0.03447050746726971, -0.024051076978421914, 0.1332323497800469, 0.0642838368455515, 0.04318612844752645, 0.13836750254810135, -0.1375755491111173, -0.12337964509399782, 0.39346061070790944, -0.08247571047908853, -0.2111755415149357, 0.13833309543790492, -0.20134972795115216, -0.16433779231521375, 0.0638011749992899, 0.1295623821445006, 0.08731773746726305, -0.14744115874795996, 0.15873586015540075, -0.018562300177001806, 0.1686596190057961, 0.08443266472935398, 0.11455708239458917, 0.2734812635535039, 0.02980262550571644, 0.06299667657781045, 0.09489974731750069, -0.05131509817517738, -0.07958276761024728, -0.37017246259387976, -0.14472720797480262, -0.19163814626391168, 0.10337816268622858, -0.11951674872646702, -0.16526045406133122, 0.37939689994459935, 0.18274525148209808, 0.18475196331374996, 0.032748998202071146, 0.2469824460734214, 0.09251471470624949, 0.05290895323153377, 0.07746393238165364, 0.26763021768365775, 0.1054599036850174, 0.07632954624229868, -0.20389671167445525, -0.009649190186922039, 0.03603465039491283] |
1,803.01484 | On Blocking Collisions between People, Objects and other Robots | Intentional or unintentional contacts are bound to occur increasingly more
often due to the deployment of autonomous systems in human environments. In
this paper, we devise methods to computationally predict imminent collisions
between objects, robots and people, and use an upper-body humanoid robot to
block them if they are likely to happen. We employ statistical methods for
effective collision prediction followed by sensor-based trajectory generation
and real-time control to attempt to stop the likely collisions using the most
favorable part of the blocking robot. We thoroughly investigate collisions in
various types of experimental setups involving objects, robots, and people.
Overall, the main contribution of this paper is to devise sensor-based
prediction, trajectory generation and control processes for highly articulated
robots to prevent collisions against people, and conduct numerous experiments
to validate this approach.
| cs.RO | intentional or unintentional contacts are bound to occur increasingly more often due to the deployment of autonomous systems in human environments in this paper we devise methods to computationally predict imminent collisions between objects robots and people and use an upperbody humanoid robot to block them if they are likely to happen we employ statistical methods for effective collision prediction followed by sensorbased trajectory generation and realtime control to attempt to stop the likely collisions using the most favorable part of the blocking robot we thoroughly investigate collisions in various types of experimental setups involving objects robots and people overall the main contribution of this paper is to devise sensorbased prediction trajectory generation and control processes for highly articulated robots to prevent collisions against people and conduct numerous experiments to validate this approach | [['intentional', 'or', 'unintentional', 'contacts', 'are', 'bound', 'to', 'occur', 'increasingly', 'more', 'often', 'due', 'to', 'the', 'deployment', 'of', 'autonomous', 'systems', 'in', 'human', 'environments', 'in', 'this', 'paper', 'we', 'devise', 'methods', 'to', 'computationally', 'predict', 'imminent', 'collisions', 'between', 'objects', 'robots', 'and', 'people', 'and', 'use', 'an', 'upperbody', 'humanoid', 'robot', 'to', 'block', 'them', 'if', 'they', 'are', 'likely', 'to', 'happen', 'we', 'employ', 'statistical', 'methods', 'for', 'effective', 'collision', 'prediction', 'followed', 'by', 'sensorbased', 'trajectory', 'generation', 'and', 'realtime', 'control', 'to', 'attempt', 'to', 'stop', 'the', 'likely', 'collisions', 'using', 'the', 'most', 'favorable', 'part', 'of', 'the', 'blocking', 'robot', 'we', 'thoroughly', 'investigate', 'collisions', 'in', 'various', 'types', 'of', 'experimental', 'setups', 'involving', 'objects', 'robots', 'and', 'people', 'overall', 'the', 'main', 'contribution', 'of', 'this', 'paper', 'is', 'to', 'devise', 'sensorbased', 'prediction', 'trajectory', 'generation', 'and', 'control', 'processes', 'for', 'highly', 'articulated', 'robots', 'to', 'prevent', 'collisions', 'against', 'people', 'and', 'conduct', 'numerous', 'experiments', 'to', 'validate', 'this', 'approach']] | [-0.11463114111491696, 0.08504917474450015, -0.07649845518241812, 0.08405276821204986, -0.10387674710167137, -0.17342354485386968, 0.05370593549599661, 0.43869211628360855, -0.223623527767998, -0.36947238459286835, 0.08938803962918516, -0.287715124834637, -0.1800243448539588, 0.16811642236132315, -0.1572967307656107, 0.08745967793975137, 0.1265851901826638, -0.008539323246848762, 0.054167251080743745, -0.24104016802546785, 0.28638775073888156, 0.06929331266188196, 0.2494275001493892, 0.054457655988801694, 0.07769317062627665, 0.02658858133087817, -0.01893239330563386, -0.028318402735530435, -0.08712418331380381, 0.15012861679122552, 0.36286279048483566, 0.12579623422116265, 0.2960642990621185, -0.49528340318877445, -0.16734402042750576, 0.13142651195910976, 0.16187824080768215, 0.13171795041552445, -0.044209402946153956, -0.34658647316711066, 0.12357133907735124, -0.21077010392988646, -0.11908749053324748, -0.10058219963334557, 0.03466169253215754, -0.021003507658895245, -0.2805687203737242, 0.0076025734168452845, -0.0017512523695210316, 0.08415938999251764, -0.043593166079162096, -0.0369744664557012, 0.04359051174680261, 0.1962862240056038, 0.079590024788955, -0.01682331445241781, 0.22090547347941988, -0.17307658688011193, -0.16016308666220902, 0.43783098277880955, 0.07499444340810851, -0.1735602507465764, 0.30480784419363827, -0.07007085769682338, -0.12077868074752894, 0.08779478855291031, 0.30661044269800186, 0.14073662233321851, -0.21622412040815653, -0.08756278590666816, 0.06837533141269271, 0.13454856131141796, 0.04845855452813544, -0.024337189699194038, 0.19586857132739702, 0.21159756428008913, 0.08240134364932328, 0.09126079294662502, -0.0701570108454566, -0.11154086281076298, -0.22344127491368612, -0.10760842415870034, -0.10919145263619441, -0.029535123661748673, 0.0005466358329579094, -0.09341807385094296, 0.3082507762531015, 0.2794261530209753, 0.1901907127812729, 0.040544724006107764, 0.3703029084306462, 0.03592374818697151, 0.06549208314347088, 0.07616565771281887, 0.21565978452773357, 0.00794499373952753, 0.14085857045339575, -0.20105930760894952, 0.11090644892949358, -0.003844753627252198] |
1,803.01485 | Totally Looks Like - How Humans Compare, Compared to Machines | Perceptual judgment of image similarity by humans relies on rich internal
representations ranging from low-level features to high-level concepts, scene
properties and even cultural associations. However, existing methods and
datasets attempting to explain perceived similarity use stimuli which arguably
do not cover the full breadth of factors that affect human similarity
judgments, even those geared toward this goal. We introduce a new dataset
dubbed Totally-Looks-Like (TLL) after a popular entertainment website, which
contains images paired by humans as being visually similar. The dataset
contains 6016 image-pairs from the wild, shedding light upon a rich and diverse
set of criteria employed by human beings. We conduct experiments to try to
reproduce the pairings via features extracted from state-of-the-art deep
convolutional neural networks, as well as additional human experiments to
verify the consistency of the collected data. Though we create conditions to
artificially make the matching task increasingly easier, we show that
machine-extracted representations perform very poorly in terms of reproducing
the matching selected by humans. We discuss and analyze these results,
suggesting future directions for improvement of learned image representations.
| cs.CV cs.LG | perceptual judgment of image similarity by humans relies on rich internal representations ranging from lowlevel features to highlevel concepts scene properties and even cultural associations however existing methods and datasets attempting to explain perceived similarity use stimuli which arguably do not cover the full breadth of factors that affect human similarity judgments even those geared toward this goal we introduce a new dataset dubbed totallylookslike tll after a popular entertainment website which contains images paired by humans as being visually similar the dataset contains 6016 imagepairs from the wild shedding light upon a rich and diverse set of criteria employed by human beings we conduct experiments to try to reproduce the pairings via features extracted from stateoftheart deep convolutional neural networks as well as additional human experiments to verify the consistency of the collected data though we create conditions to artificially make the matching task increasingly easier we show that machineextracted representations perform very poorly in terms of reproducing the matching selected by humans we discuss and analyze these results suggesting future directions for improvement of learned image representations | [['perceptual', 'judgment', 'of', 'image', 'similarity', 'by', 'humans', 'relies', 'on', 'rich', 'internal', 'representations', 'ranging', 'from', 'lowlevel', 'features', 'to', 'highlevel', 'concepts', 'scene', 'properties', 'and', 'even', 'cultural', 'associations', 'however', 'existing', 'methods', 'and', 'datasets', 'attempting', 'to', 'explain', 'perceived', 'similarity', 'use', 'stimuli', 'which', 'arguably', 'do', 'not', 'cover', 'the', 'full', 'breadth', 'of', 'factors', 'that', 'affect', 'human', 'similarity', 'judgments', 'even', 'those', 'geared', 'toward', 'this', 'goal', 'we', 'introduce', 'a', 'new', 'dataset', 'dubbed', 'totallylookslike', 'tll', 'after', 'a', 'popular', 'entertainment', 'website', 'which', 'contains', 'images', 'paired', 'by', 'humans', 'as', 'being', 'visually', 'similar', 'the', 'dataset', 'contains', '6016', 'imagepairs', 'from', 'the', 'wild', 'shedding', 'light', 'upon', 'a', 'rich', 'and', 'diverse', 'set', 'of', 'criteria', 'employed', 'by', 'human', 'beings', 'we', 'conduct', 'experiments', 'to', 'try', 'to', 'reproduce', 'the', 'pairings', 'via', 'features', 'extracted', 'from', 'stateoftheart', 'deep', 'convolutional', 'neural', 'networks', 'as', 'well', 'as', 'additional', 'human', 'experiments', 'to', 'verify', 'the', 'consistency', 'of', 'the', 'collected', 'data', 'though', 'we', 'create', 'conditions', 'to', 'artificially', 'make', 'the', 'matching', 'task', 'increasingly', 'easier', 'we', 'show', 'that', 'machineextracted', 'representations', 'perform', 'very', 'poorly', 'in', 'terms', 'of', 'reproducing', 'the', 'matching', 'selected', 'by', 'humans', 'we', 'discuss', 'and', 'analyze', 'these', 'results', 'suggesting', 'future', 'directions', 'for', 'improvement', 'of', 'learned', 'image', 'representations']] | [-0.012608790817528458, 0.030652820110968235, -0.10528842380828103, 0.13635234939300134, -0.15841254573131222, -0.1551323439873292, 0.04391055603085433, 0.469696617366925, -0.2447258763904499, -0.3700538443054183, 0.055013941421362934, -0.31205211441942865, -0.2091201649106711, 0.18895618609181675, -0.14085512763510147, 0.05041281424040543, 0.1340673747130454, 0.0582530533850172, -0.039458080806564225, -0.27460166080433895, 0.3064886522597744, 0.03402706138157591, 0.3257824473167207, 0.0024918513477774663, 0.11506894979518076, -0.04226829011167865, -0.08407437212214053, -0.015076750076486397, -0.07145452652003888, 0.17929279532988612, 0.34967901873386514, 0.23287825556708722, 0.27405883208256593, -0.4397439296425736, -0.1956395691939456, 0.0728465803335868, 0.14193815047166042, 0.09704078416648192, -0.026957986561323668, -0.390145210591329, 0.0710875672655901, -0.13319135223657397, -0.03489648441042183, -0.174224788988651, -0.007576295965887859, -0.01437859024193485, -0.22081474673679088, 0.03316524357398141, 0.04457044153997811, 0.13513599786812724, -0.038995956864581564, -0.11353693319363573, 0.0032604128453817406, 0.22444781103555514, 0.04516064672399375, 0.033243286844650756, 0.17438054210845103, -0.2512061308032181, -0.13817496708131233, 0.40887463307481703, -0.042371593378905184, -0.14851390669544262, 0.26024330823582276, -0.05907597586428378, -0.13323019570434244, 0.09145985668035761, 0.19331609748177608, 0.08302974585696297, -0.16514830482797435, -0.03804658091427116, -0.06804392911956808, 0.18704391372295381, 0.05847029843878022, 0.025091993577757293, 0.2129889548266843, 0.20003837543292402, -0.01959696256734515, 0.12443254579326907, -0.07585932376352533, -0.033210506241789645, -0.20036574807491594, -0.06486440502833259, -0.15186215943583198, -0.023239925120859196, -0.07073408722749906, -0.1301122179496928, 0.387005670610447, 0.25409123898183894, 0.24102492567341208, 0.08382524089693055, 0.2998361175664106, -0.0407080912102102, 0.1528396773068647, 0.04839224437212882, 0.17004672569054374, -0.020091166944732352, 0.12730289176685242, -0.1642383749136046, 0.10357554072493129, 0.029146004556336223] |
1,803.01486 | Reconsider HHL algorithm and its related quantum machine learning
algorithms | HHL quantum algorithm to solve linear systems is one of the most important
subroutines in many quantum machine learning algorithms. In this work, we
present and analyze several other caveats in HHL algorithm, which have been
ignored in the past. Their influences on the efficiency, accuracy and
practicability of HHL algorithm and several related quantum machine learning
algorithms will be discussed. We also found that these caveats affect HHL
algorithm much deeper than the already noticed caveats. In order to obtain more
practical quantum machine learning algorithms with less assumptions based on
HHL algorithm, we should pay more attention to these caveats.
| quant-ph | hhl quantum algorithm to solve linear systems is one of the most important subroutines in many quantum machine learning algorithms in this work we present and analyze several other caveats in hhl algorithm which have been ignored in the past their influences on the efficiency accuracy and practicability of hhl algorithm and several related quantum machine learning algorithms will be discussed we also found that these caveats affect hhl algorithm much deeper than the already noticed caveats in order to obtain more practical quantum machine learning algorithms with less assumptions based on hhl algorithm we should pay more attention to these caveats | [['hhl', 'quantum', 'algorithm', 'to', 'solve', 'linear', 'systems', 'is', 'one', 'of', 'the', 'most', 'important', 'subroutines', 'in', 'many', 'quantum', 'machine', 'learning', 'algorithms', 'in', 'this', 'work', 'we', 'present', 'and', 'analyze', 'several', 'other', 'caveats', 'in', 'hhl', 'algorithm', 'which', 'have', 'been', 'ignored', 'in', 'the', 'past', 'their', 'influences', 'on', 'the', 'efficiency', 'accuracy', 'and', 'practicability', 'of', 'hhl', 'algorithm', 'and', 'several', 'related', 'quantum', 'machine', 'learning', 'algorithms', 'will', 'be', 'discussed', 'we', 'also', 'found', 'that', 'these', 'caveats', 'affect', 'hhl', 'algorithm', 'much', 'deeper', 'than', 'the', 'already', 'noticed', 'caveats', 'in', 'order', 'to', 'obtain', 'more', 'practical', 'quantum', 'machine', 'learning', 'algorithms', 'with', 'less', 'assumptions', 'based', 'on', 'hhl', 'algorithm', 'we', 'should', 'pay', 'more', 'attention', 'to', 'these', 'caveats']] | [-0.04254671135762086, 0.0031336297865445705, -0.10835789133082419, 0.13295966421491376, -0.1354714000743686, -0.21643659784732497, 0.03978904471595717, 0.4694035647473499, -0.23279318658237838, -0.3162139449633804, 0.11061547850327128, -0.2202618386979927, -0.19210420133701214, 0.2971641317411673, -0.11224042001527314, 0.13676597496298343, 0.07007588830539117, 0.047458673443864376, -0.10517099703543399, -0.389359502669643, 0.24595611510506155, 0.06981178991697437, 0.24933409976645135, 0.04710646830133948, 0.02297074735785524, -0.04473546949242625, -0.04110704917533725, 0.0005441788748344954, -0.10552000632663953, 0.1342756263911724, 0.3089551387272556, 0.20699061217851075, 0.3694886669388735, -0.4374962337497695, -0.19824142780556692, 0.12463895588492353, 0.18642041493462874, 0.14860155720460028, -0.03059269875823292, -0.2588976055484119, 0.09296072669117254, -0.13734528029739274, -0.02958344457232777, -0.14417809678935536, -0.016853807411868784, -0.029520076201936484, -0.15150379879838405, -0.0018841055813633527, 0.07838756908826969, 0.03648705620720398, -0.0041519971107881444, -0.2059253887090759, 0.10930748198948362, 0.06983438528179392, 0.06679873659467216, 0.033563958937484845, 0.14649333286683494, -0.15150129163007744, -0.2104088883828737, 0.42157894029628995, 0.03601768215266216, -0.18554958902920285, 0.1974283442216213, -0.05808080156224177, -0.25269950748941694, 0.060094335481670556, 0.2425137466349292, 0.1309398031501355, -0.1256391297279419, 0.06314685810460052, 0.010869328790873873, 0.16303389295753018, 0.02534482350536421, 0.06742457542385832, 0.12493041443967205, 0.15989092857960394, 0.057189125249815155, 0.1252948938607576, -0.05975963082164526, -0.17385284601728998, -0.19831965047427835, -0.13590186848944308, -0.14615655678561798, 0.0009650332218620414, -0.08251589603734079, -0.09337853029479876, 0.3525351182301985, 0.3015556314174889, 0.14546521177102228, 0.025749788739417186, 0.339651129637644, 0.10098865239734889, 0.08244923593113473, 0.13744065060289393, 0.281635588110315, 0.10143645613582111, 0.12056692297040832, -0.20477189571487114, 0.06757710124000761, 0.018269024275736335] |
1,803.01487 | Electronic band structure of optimal superconductors: from cuprates to
ferropnictides and back again | While the beginning decade of the high-Tc cuprates era passed under
domination of local theories, Abrikosov was one of the few who took seriously
the electronic band structure of cuprates, stressing the importance of an
extended Van Hove singularity near the Fermi level. These ideas have not been
widely accepted that time mainly because of a lack of experimental evidence for
correlation between saddle point position and superconductivity. In this short
contribution, based on the detailed comparison of the electronic band
structures of different families of cuprates and iron based superconductors I
argue that a general mechanism of the Tc enhancement in all known high-Tc
superconductors is likely related with the proximity of certain Van Hove
singularities to the Fermi level. While this mechanism remains to be fully
understood, one may conclude that it is not related with the electron density
of states but likely with some kind of resonances caused by a proximity of the
Fermi surface to topological Lifshitz transition. One may also notice that the
electronic correlations often shifts the electronic bands to optimal for
superconductivity positions.
| cond-mat.supr-con cond-mat.str-el | while the beginning decade of the hightc cuprates era passed under domination of local theories abrikosov was one of the few who took seriously the electronic band structure of cuprates stressing the importance of an extended van hove singularity near the fermi level these ideas have not been widely accepted that time mainly because of a lack of experimental evidence for correlation between saddle point position and superconductivity in this short contribution based on the detailed comparison of the electronic band structures of different families of cuprates and iron based superconductors i argue that a general mechanism of the tc enhancement in all known hightc superconductors is likely related with the proximity of certain van hove singularities to the fermi level while this mechanism remains to be fully understood one may conclude that it is not related with the electron density of states but likely with some kind of resonances caused by a proximity of the fermi surface to topological lifshitz transition one may also notice that the electronic correlations often shifts the electronic bands to optimal for superconductivity positions | [['while', 'the', 'beginning', 'decade', 'of', 'the', 'hightc', 'cuprates', 'era', 'passed', 'under', 'domination', 'of', 'local', 'theories', 'abrikosov', 'was', 'one', 'of', 'the', 'few', 'who', 'took', 'seriously', 'the', 'electronic', 'band', 'structure', 'of', 'cuprates', 'stressing', 'the', 'importance', 'of', 'an', 'extended', 'van', 'hove', 'singularity', 'near', 'the', 'fermi', 'level', 'these', 'ideas', 'have', 'not', 'been', 'widely', 'accepted', 'that', 'time', 'mainly', 'because', 'of', 'a', 'lack', 'of', 'experimental', 'evidence', 'for', 'correlation', 'between', 'saddle', 'point', 'position', 'and', 'superconductivity', 'in', 'this', 'short', 'contribution', 'based', 'on', 'the', 'detailed', 'comparison', 'of', 'the', 'electronic', 'band', 'structures', 'of', 'different', 'families', 'of', 'cuprates', 'and', 'iron', 'based', 'superconductors', 'i', 'argue', 'that', 'a', 'general', 'mechanism', 'of', 'the', 'tc', 'enhancement', 'in', 'all', 'known', 'hightc', 'superconductors', 'is', 'likely', 'related', 'with', 'the', 'proximity', 'of', 'certain', 'van', 'hove', 'singularities', 'to', 'the', 'fermi', 'level', 'while', 'this', 'mechanism', 'remains', 'to', 'be', 'fully', 'understood', 'one', 'may', 'conclude', 'that', 'it', 'is', 'not', 'related', 'with', 'the', 'electron', 'density', 'of', 'states', 'but', 'likely', 'with', 'some', 'kind', 'of', 'resonances', 'caused', 'by', 'a', 'proximity', 'of', 'the', 'fermi', 'surface', 'to', 'topological', 'lifshitz', 'transition', 'one', 'may', 'also', 'notice', 'that', 'the', 'electronic', 'correlations', 'often', 'shifts', 'the', 'electronic', 'bands', 'to', 'optimal', 'for', 'superconductivity', 'positions']] | [-0.1719111866925636, 0.1450967080542695, -0.09005316083785146, 0.12194667838306891, -0.08048908656411287, -0.14959417012675355, 0.108196338897364, 0.3367664231763532, -0.25158314528461134, -0.27862816518172623, 0.01972903912861107, -0.33834256863014567, -0.16537088117458754, 0.16640343446924816, -0.013120493546335234, 0.016509110149410037, -0.008818794383356969, -0.00745949357903252, -0.12110243665326076, -0.27148653172836124, 0.38370828277224467, 0.08067569865508833, 0.31701183849945663, 0.12070515598784873, -0.00045127818205704294, -0.01184194857713818, 0.07797577088026122, 0.021932036051940586, -0.10969171198941896, 0.09702384056775676, 0.31290379716083405, -0.04392697609728202, 0.26058555794491745, -0.4307860078626416, -0.2371549032188745, 0.021195488168935604, 0.12775439667101535, 0.12632996346025419, -0.04682831184149513, -0.2847448686965638, 0.04021642348832554, -0.1422768803520335, -0.14138964536444595, -0.045484285476332945, 0.012871408746933512, -0.010193824318573914, -0.12727882566557835, 0.09388978144803937, 0.0655110267857607, 0.07510344158444139, -0.07007494165122302, -0.1200607551927937, -0.0475087530626398, 0.05038554965156234, 0.07832890602035655, 0.039193002573382624, 0.11329666556169589, -0.13272256311029196, -0.10710281381454681, 0.3940844036017855, 0.01083925042508377, -0.03697493076712514, 0.19579083066847588, -0.18907546835899766, -0.12943907974339608, 0.16776179496923255, 0.052730458390174643, 0.04726011982533641, -0.14918685779525226, 0.06598600632860326, -0.0068844079641470065, 0.1577170294717588, 0.054580902096091045, 0.10610865663329605, 0.2911301563907829, 0.1487904214222605, 0.04718392002137585, 0.05843423870327469, -0.11369174821431645, -0.06032086028717458, -0.26904180387371324, -0.13706080303980142, -0.2124730863847718, 0.04120346431688328, -0.005560748991006726, -0.23569600009294744, 0.41228547385997244, 0.14933893948974503, 0.20654481052834955, -0.09398204136070692, 0.19916710395417694, 0.10339119057914811, 0.0854206130374223, 0.06548044440957407, 0.2934775358397423, 0.10021270369696948, 0.0890709692819251, -0.23756917799926466, 0.11929906978006734, 0.054949799626289555] |
1,803.01488 | Data fusion of multivariate time series: Application to noisy 12-lead
ECG signals | 12-lead ECG signals fusion is crucial for further ECG signal processing. In
this paper, a novel fusion data algorithm is proposed. In the method, 12-lead
ECG signals are appropriately converted to a single-lead physiological signal
via the idea of the local weighted linear prediction algorithm. For effectively
inheriting the quality characteristics of the 12-lead ECG signals, the fuzzy
inference system is rationally designed to estimate the weighted coefficient in
our algorithm. Experimental results indicate that the algorithm can obtain
desirable results on synthetic ECG signals, noisy ECG signals and realistic ECG
signals.
| eess.SP cs.SY | 12lead ecg signals fusion is crucial for further ecg signal processing in this paper a novel fusion data algorithm is proposed in the method 12lead ecg signals are appropriately converted to a singlelead physiological signal via the idea of the local weighted linear prediction algorithm for effectively inheriting the quality characteristics of the 12lead ecg signals the fuzzy inference system is rationally designed to estimate the weighted coefficient in our algorithm experimental results indicate that the algorithm can obtain desirable results on synthetic ecg signals noisy ecg signals and realistic ecg signals | [['12lead', 'ecg', 'signals', 'fusion', 'is', 'crucial', 'for', 'further', 'ecg', 'signal', 'processing', 'in', 'this', 'paper', 'a', 'novel', 'fusion', 'data', 'algorithm', 'is', 'proposed', 'in', 'the', 'method', '12lead', 'ecg', 'signals', 'are', 'appropriately', 'converted', 'to', 'a', 'singlelead', 'physiological', 'signal', 'via', 'the', 'idea', 'of', 'the', 'local', 'weighted', 'linear', 'prediction', 'algorithm', 'for', 'effectively', 'inheriting', 'the', 'quality', 'characteristics', 'of', 'the', '12lead', 'ecg', 'signals', 'the', 'fuzzy', 'inference', 'system', 'is', 'rationally', 'designed', 'to', 'estimate', 'the', 'weighted', 'coefficient', 'in', 'our', 'algorithm', 'experimental', 'results', 'indicate', 'that', 'the', 'algorithm', 'can', 'obtain', 'desirable', 'results', 'on', 'synthetic', 'ecg', 'signals', 'noisy', 'ecg', 'signals', 'and', 'realistic', 'ecg', 'signals']] | [-0.09631950892862337, -0.01330604698792424, -0.12119094821189166, 0.051513012065855866, -0.09794453865565035, -0.18873407858747826, 0.016082235410779147, 0.37945281649413315, -0.2781522531953195, -0.2573957135597163, 0.14666636772681554, -0.2716992359162997, -0.26692383128892805, 0.3008694935225598, -0.12375224508729804, 0.13739606753275121, 0.14402566026167377, 0.11330578031534654, 0.00826455462653109, -0.22833755330951966, 0.18897215522947194, 0.061878405541748456, 0.37672037380221096, -0.019361264750604398, 0.11339867655213152, 0.0336848075182744, -0.06681545695249477, -0.07827463260163432, -0.008676372177828654, 0.11558031334298784, 0.35199873353881034, 0.22426063085035625, 0.24009541342662566, -0.3967415052871017, -0.22145470413986756, 0.1495463416263785, 0.0907019600322794, 0.10913886705352722, -0.07545450377232477, -0.40111034693520353, 0.17429476630691762, -0.061271455456533105, 0.06499561104599548, -0.09206158266802643, -0.04001012264811636, -0.003066622414221258, -0.4147225646359046, 0.11393764099288407, 0.03526317033633266, 0.025591633889986122, -0.1236392093604714, -0.08103061871952377, 0.0522887871737349, 0.09932711166228451, -0.002213209075347075, 0.023241934806877827, 0.19667061231018085, -0.05133891709239991, -0.12138398585881552, 0.31466377104389603, -0.06439960773011831, -0.21235583107361733, 0.12591765144758899, -0.03551131636461081, -0.11298287673296568, 0.16277885595943942, 0.251167120401869, 0.04221259355140121, -0.210443450441665, -0.019357128114991254, 0.03055277588756998, 0.19577527293206556, 0.029100368523200894, -0.005772083542188225, 0.13247999762508855, 0.19367822167038432, 0.0091390422217639, 0.1586011733920516, -0.15539329387905562, 0.0545754623396889, -0.21956934636261355, -0.10459709278328101, -0.21046988222160903, -0.060856591328047216, -0.14928562376308432, -0.13234802055471254, 0.47864029758974264, 0.22575813446335657, 0.15700796317390125, 0.08727648852737216, 0.4120848586215921, 0.08179492634118778, 0.04935677539375003, -1.1813047382494677e-05, 0.1687310709486432, 0.09808507367320683, 0.12594931981647792, -0.1949588823709232, 0.09175288408954183, 0.051979070951979935] |
1,803.01489 | Recurrent Predictive State Policy Networks | We introduce Recurrent Predictive State Policy (RPSP) networks, a recurrent
architecture that brings insights from predictive state representations to
reinforcement learning in partially observable environments. Predictive state
policy networks consist of a recursive filter, which keeps track of a belief
about the state of the environment, and a reactive policy that directly maps
beliefs to actions, to maximize the cumulative reward. The recursive filter
leverages predictive state representations (PSRs) (Rosencrantz and Gordon,
2004; Sun et al., 2016) by modeling predictive state-- a prediction of the
distribution of future observations conditioned on history and future actions.
This representation gives rise to a rich class of statistically consistent
algorithms (Hefny et al., 2018) to initialize the recursive filter. Predictive
state serves as an equivalent representation of a belief state. Therefore, the
policy component of the RPSP-network can be purely reactive, simplifying
training while still allowing optimal behaviour. Moreover, we use the PSR
interpretation during training as well, by incorporating prediction error in
the loss function. The entire network (recursive filter and reactive policy) is
still differentiable and can be trained using gradient based methods. We
optimize our policy using a combination of policy gradient based on rewards
(Williams, 1992) and gradient descent based on prediction error. We show the
efficacy of RPSP-networks under partial observability on a set of robotic
control tasks from OpenAI Gym. We empirically show that RPSP-networks perform
well compared with memory-preserving networks such as GRUs, as well as finite
memory models, being the overall best performing method.
| stat.ML cs.AI cs.LG | we introduce recurrent predictive state policy rpsp networks a recurrent architecture that brings insights from predictive state representations to reinforcement learning in partially observable environments predictive state policy networks consist of a recursive filter which keeps track of a belief about the state of the environment and a reactive policy that directly maps beliefs to actions to maximize the cumulative reward the recursive filter leverages predictive state representations psrs rosencrantz and gordon 2004 sun et al 2016 by modeling predictive state a prediction of the distribution of future observations conditioned on history and future actions this representation gives rise to a rich class of statistically consistent algorithms hefny et al 2018 to initialize the recursive filter predictive state serves as an equivalent representation of a belief state therefore the policy component of the rpspnetwork can be purely reactive simplifying training while still allowing optimal behaviour moreover we use the psr interpretation during training as well by incorporating prediction error in the loss function the entire network recursive filter and reactive policy is still differentiable and can be trained using gradient based methods we optimize our policy using a combination of policy gradient based on rewards williams 1992 and gradient descent based on prediction error we show the efficacy of rpspnetworks under partial observability on a set of robotic control tasks from openai gym we empirically show that rpspnetworks perform well compared with memorypreserving networks such as grus as well as finite memory models being the overall best performing method | [['we', 'introduce', 'recurrent', 'predictive', 'state', 'policy', 'rpsp', 'networks', 'a', 'recurrent', 'architecture', 'that', 'brings', 'insights', 'from', 'predictive', 'state', 'representations', 'to', 'reinforcement', 'learning', 'in', 'partially', 'observable', 'environments', 'predictive', 'state', 'policy', 'networks', 'consist', 'of', 'a', 'recursive', 'filter', 'which', 'keeps', 'track', 'of', 'a', 'belief', 'about', 'the', 'state', 'of', 'the', 'environment', 'and', 'a', 'reactive', 'policy', 'that', 'directly', 'maps', 'beliefs', 'to', 'actions', 'to', 'maximize', 'the', 'cumulative', 'reward', 'the', 'recursive', 'filter', 'leverages', 'predictive', 'state', 'representations', 'psrs', 'rosencrantz', 'and', 'gordon', '2004', 'sun', 'et', 'al', '2016', 'by', 'modeling', 'predictive', 'state', 'a', 'prediction', 'of', 'the', 'distribution', 'of', 'future', 'observations', 'conditioned', 'on', 'history', 'and', 'future', 'actions', 'this', 'representation', 'gives', 'rise', 'to', 'a', 'rich', 'class', 'of', 'statistically', 'consistent', 'algorithms', 'hefny', 'et', 'al', '2018', 'to', 'initialize', 'the', 'recursive', 'filter', 'predictive', 'state', 'serves', 'as', 'an', 'equivalent', 'representation', 'of', 'a', 'belief', 'state', 'therefore', 'the', 'policy', 'component', 'of', 'the', 'rpspnetwork', 'can', 'be', 'purely', 'reactive', 'simplifying', 'training', 'while', 'still', 'allowing', 'optimal', 'behaviour', 'moreover', 'we', 'use', 'the', 'psr', 'interpretation', 'during', 'training', 'as', 'well', 'by', 'incorporating', 'prediction', 'error', 'in', 'the', 'loss', 'function', 'the', 'entire', 'network', 'recursive', 'filter', 'and', 'reactive', 'policy', 'is', 'still', 'differentiable', 'and', 'can', 'be', 'trained', 'using', 'gradient', 'based', 'methods', 'we', 'optimize', 'our', 'policy', 'using', 'a', 'combination', 'of', 'policy', 'gradient', 'based', 'on', 'rewards', 'williams', '1992', 'and', 'gradient', 'descent', 'based', 'on', 'prediction', 'error', 'we', 'show', 'the', 'efficacy', 'of', 'rpspnetworks', 'under', 'partial', 'observability', 'on', 'a', 'set', 'of', 'robotic', 'control', 'tasks', 'from', 'openai', 'gym', 'we', 'empirically', 'show', 'that', 'rpspnetworks', 'perform', 'well', 'compared', 'with', 'memorypreserving', 'networks', 'such', 'as', 'grus', 'as', 'well', 'as', 'finite', 'memory', 'models', 'being', 'the', 'overall', 'best', 'performing', 'method']] | [-0.033333621153151846, 0.009398950830249395, -0.11505389085105576, 0.05956975261052903, -0.14221572438941993, -0.13639917168823515, 0.1083913596025401, 0.46500825078883135, -0.27849946098905976, -0.3171707060031562, 0.10449749721225149, -0.2300593959454821, -0.19423255580477417, 0.1795418506304993, -0.13281805228182406, 0.10684359451988712, 0.10638240475224743, 0.0298769486539417, -0.04369313029102889, -0.26429405866704164, 0.2665478551653443, 0.10227534990780605, 0.308833388550604, -0.0557304059776008, 0.19406360658801725, 0.012342037648328991, -0.0020822134962950483, -0.002328428554779957, -0.034230243139078444, 0.11270082870032638, 0.2708614123323924, 0.2118490851211331, 0.33843121069033066, -0.40779819921972077, -0.23096743200764397, 0.07695324615895992, 0.10940932668745518, 0.09262202452814787, -0.004094028692753588, -0.3497931883044419, 0.047661868076233314, -0.2211392332147759, -0.020036923146585277, -0.1302129756487509, -0.04776985672126967, 0.031044737531896106, -0.3296652242548947, 0.0432618483748348, 0.06053399924545732, 0.02836622301485298, -0.0821775611910824, -0.14584327860521612, -0.02455559810795287, 0.14129737395503114, -0.006292589020735935, 0.0643402492535896, 0.17019167432530982, -0.15866936327504055, -0.18759659552358884, 0.2939175770190529, -0.08968353290378009, -0.18242875299489003, 0.16628933741546953, -0.009933725720821102, -0.12669843391774863, 0.08812230643358265, 0.24054052487214203, 0.12312609829451339, -0.16116697851331813, 0.026018525211839005, -0.060823509990634614, 0.18166114275341808, 0.001670993322537082, -0.005839339755170169, 0.16960875280669005, 0.23621071494932547, 0.09411159231228235, 0.1178657208105595, -0.060801477815581824, -0.13981226028647412, -0.23230417272587475, -0.11188167723594233, -0.1491605379049987, 0.02051803669472393, -0.07303666409041129, -0.14417860070701505, 0.39459854567454, 0.19600368469006946, 0.2175518804550415, 0.15854672127122776, 0.30259334247036396, 0.08504687184731516, 0.037241240885093445, 0.15444046545002732, 0.1931147025621374, 0.07845785868517315, 0.10797690223810859, -0.2053110316065598, 0.17394988383042442, 0.06915729179058498] |
1,803.0149 | A cascading nonlinear magneto-optical effect in topological insulators | Topological insulators (TIs) are characterized by possessing metallic
(gapless) surface states and a finite band-gap state in the bulk. As the
thickness of a TI layer decreases down to a few nanometer, hybridization
between the top and bottom surfaces takes place due to quantum tunneling,
consequently at a critical thickness a crossover from a 3D-TI to a 2D insulator
occurs. Although such a crossover is generally accessible by scanning tunneling
microscopy, or by angle-resolved photoemission spectroscopy, such measurements
require clean surfaces. Here, we demonstrate that a cascading nonlinear
magneto-optical effect induced via strong spin-orbit coupling can examine such
crossovers. The helicity dependence of the time-resolved Kerr rotation exhibits
a robust change in periodicity at a critical thickness, from which it is
possible to predict the formation of a Dirac cone in a film several quintuple
layers thick. This method enables prediction of a Dirac cone using a
fundamental nonlinear optical effect that can be applied to a wide range of TIs
and related 2D materials.
| cond-mat.mtrl-sci | topological insulators tis are characterized by possessing metallic gapless surface states and a finite bandgap state in the bulk as the thickness of a ti layer decreases down to a few nanometer hybridization between the top and bottom surfaces takes place due to quantum tunneling consequently at a critical thickness a crossover from a 3dti to a 2d insulator occurs although such a crossover is generally accessible by scanning tunneling microscopy or by angleresolved photoemission spectroscopy such measurements require clean surfaces here we demonstrate that a cascading nonlinear magnetooptical effect induced via strong spinorbit coupling can examine such crossovers the helicity dependence of the timeresolved kerr rotation exhibits a robust change in periodicity at a critical thickness from which it is possible to predict the formation of a dirac cone in a film several quintuple layers thick this method enables prediction of a dirac cone using a fundamental nonlinear optical effect that can be applied to a wide range of tis and related 2d materials | [['topological', 'insulators', 'tis', 'are', 'characterized', 'by', 'possessing', 'metallic', 'gapless', 'surface', 'states', 'and', 'a', 'finite', 'bandgap', 'state', 'in', 'the', 'bulk', 'as', 'the', 'thickness', 'of', 'a', 'ti', 'layer', 'decreases', 'down', 'to', 'a', 'few', 'nanometer', 'hybridization', 'between', 'the', 'top', 'and', 'bottom', 'surfaces', 'takes', 'place', 'due', 'to', 'quantum', 'tunneling', 'consequently', 'at', 'a', 'critical', 'thickness', 'a', 'crossover', 'from', 'a', '3dti', 'to', 'a', '2d', 'insulator', 'occurs', 'although', 'such', 'a', 'crossover', 'is', 'generally', 'accessible', 'by', 'scanning', 'tunneling', 'microscopy', 'or', 'by', 'angleresolved', 'photoemission', 'spectroscopy', 'such', 'measurements', 'require', 'clean', 'surfaces', 'here', 'we', 'demonstrate', 'that', 'a', 'cascading', 'nonlinear', 'magnetooptical', 'effect', 'induced', 'via', 'strong', 'spinorbit', 'coupling', 'can', 'examine', 'such', 'crossovers', 'the', 'helicity', 'dependence', 'of', 'the', 'timeresolved', 'kerr', 'rotation', 'exhibits', 'a', 'robust', 'change', 'in', 'periodicity', 'at', 'a', 'critical', 'thickness', 'from', 'which', 'it', 'is', 'possible', 'to', 'predict', 'the', 'formation', 'of', 'a', 'dirac', 'cone', 'in', 'a', 'film', 'several', 'quintuple', 'layers', 'thick', 'this', 'method', 'enables', 'prediction', 'of', 'a', 'dirac', 'cone', 'using', 'a', 'fundamental', 'nonlinear', 'optical', 'effect', 'that', 'can', 'be', 'applied', 'to', 'a', 'wide', 'range', 'of', 'tis', 'and', 'related', '2d', 'materials']] | [-0.15000890828386854, 0.20834025625478136, -0.06938421493255054, 0.025873897310035924, -0.06789099647324871, -0.20139947775186914, 0.10824511916708257, 0.3806863850490613, -0.31077809349887753, -0.2957747723117019, 0.01222068353937092, -0.3226997495233787, -0.16343562506195722, 0.21436326445475445, 0.014860640988318305, 0.07459280411135158, -0.030541818882479813, -0.10056364903170051, -0.15009196569162392, -0.15023921609743301, 0.3121862714715076, -0.03729609655371557, 0.3182997125003374, 0.12782935728530653, 0.05770840422650728, -0.02370571663292746, 0.13544573134329932, 0.06837806261963013, -0.1359880170365972, 0.050798241758479204, 0.24285983937566705, -0.14035863665807427, 0.23083683523264797, -0.444681946255944, -0.25569769403135234, -0.03677942021608804, 0.14210063686707256, 0.16663492492357776, -0.10641947881685514, -0.2813919091710087, 0.062371503719777774, -0.1290659567482318, -0.08939459448553283, -0.08615345672393838, -0.0018179355245648008, -0.07651904712459355, -0.2402516546264065, 0.07110956775193865, 0.03155507416125725, 0.10478335027300724, -0.046218481998551976, -0.020527360670861194, -0.12672353813594037, 0.06787446493593355, 0.0221346665992204, 0.035080160583178935, 0.16823306011431144, -0.12594683341202184, -0.10381128356763811, 0.38825721854739115, -0.08372738456254769, -0.12001852219867887, 0.20126626128048608, -0.18425790162079714, -0.01019000094666174, 0.17841112566265194, 0.1396772185030083, 0.15390248596950462, -0.07789928462412772, 0.09073061853061627, -0.026571388954691813, 0.20372631372319477, 0.07019862470950819, 0.07449637602337382, 0.30047447258662996, 0.23491370697844435, 0.067316881853692, 0.1266194532815875, -0.1667534432627938, 0.004297596540400815, -0.2313061993794911, -0.1996819042911132, -0.2333545234576432, 0.12618471416785862, -0.033816116655714615, -0.22225588308365057, 0.42511796675001584, 0.11334935773841359, 0.22386013741294544, -0.05565484388463312, 0.25809531441014827, 0.10519267427735031, 0.11154200571843169, -0.02300938673768983, 0.2730789729140022, 0.15802034246170837, 0.10688995714652154, -0.24475056808724097, 0.06661368300009406, 0.013087338748190439] |
1,803.01491 | Programmable Switch as a Parallel Computing Device | Modern switches have packet processing capacity of up to multi-tera bits per
second, and they are also becoming more and more programmable. We seek to
understand whether the programmability can translate packet processing capacity
to computational power for parallel computing applications. In this paper, we
first develop a simple mathematical model to understand the costs and overheads
of data plane computation. Then we validate the the performance benefits of
offloading computation to network. Using experiments on real data center
network, we finnd that offloading computation to the data plane results in up
to 20x speed-up for a simple Map-Reduce application. Motivated by this, we
propose a parallel programming framework, p4mr, to help users efficiently
program multiple switches. We successfully build and test a prototype of p4mr
on a simulated testbed.
| cs.NI cs.DC | modern switches have packet processing capacity of up to multitera bits per second and they are also becoming more and more programmable we seek to understand whether the programmability can translate packet processing capacity to computational power for parallel computing applications in this paper we first develop a simple mathematical model to understand the costs and overheads of data plane computation then we validate the the performance benefits of offloading computation to network using experiments on real data center network we finnd that offloading computation to the data plane results in up to 20x speedup for a simple mapreduce application motivated by this we propose a parallel programming framework p4mr to help users efficiently program multiple switches we successfully build and test a prototype of p4mr on a simulated testbed | [['modern', 'switches', 'have', 'packet', 'processing', 'capacity', 'of', 'up', 'to', 'multitera', 'bits', 'per', 'second', 'and', 'they', 'are', 'also', 'becoming', 'more', 'and', 'more', 'programmable', 'we', 'seek', 'to', 'understand', 'whether', 'the', 'programmability', 'can', 'translate', 'packet', 'processing', 'capacity', 'to', 'computational', 'power', 'for', 'parallel', 'computing', 'applications', 'in', 'this', 'paper', 'we', 'first', 'develop', 'a', 'simple', 'mathematical', 'model', 'to', 'understand', 'the', 'costs', 'and', 'overheads', 'of', 'data', 'plane', 'computation', 'then', 'we', 'validate', 'the', 'the', 'performance', 'benefits', 'of', 'offloading', 'computation', 'to', 'network', 'using', 'experiments', 'on', 'real', 'data', 'center', 'network', 'we', 'finnd', 'that', 'offloading', 'computation', 'to', 'the', 'data', 'plane', 'results', 'in', 'up', 'to', '20x', 'speedup', 'for', 'a', 'simple', 'mapreduce', 'application', 'motivated', 'by', 'this', 'we', 'propose', 'a', 'parallel', 'programming', 'framework', 'p4mr', 'to', 'help', 'users', 'efficiently', 'program', 'multiple', 'switches', 'we', 'successfully', 'build', 'and', 'test', 'a', 'prototype', 'of', 'p4mr', 'on', 'a', 'simulated', 'testbed']] | [-0.1520681250526289, -0.030731785802229766, -0.06450929930655375, 0.0389335325605879, -0.13948794081807137, -0.15836047343096682, 0.14437606187014368, 0.4199886195701621, -0.3077302486414001, -0.3603020192360476, 0.10820405794093238, -0.2479395825186715, -0.1694342817941178, 0.2427877957733082, -0.1061317591425789, 0.10012327935472722, 0.07427617523907906, 0.0035087712763232134, -0.05333169782811421, -0.3137149107051156, 0.2216714084950379, 0.10580213119586308, 0.3127745008835244, 0.0575138815800615, 0.06622230889999108, -0.03135449515419111, 0.002868185407437739, -0.018608815068127737, -0.08031684260230765, 0.1861138458267623, 0.312165548254381, 0.2312308322224352, 0.30059389397871517, -0.5188933344528316, -0.16941613471874642, 0.0802696624402112, 0.14436109438316808, 0.08988562479822172, -0.06337612678804103, -0.22763853783290539, 0.1400734007225505, -0.1991447205100918, -0.04708134537074892, -0.1367196438257538, -0.010645498772935262, -0.015761067192735418, -0.26375516284523265, -0.04984956771520609, -0.03878657107004926, 0.02050120022428769, 0.007719926377167068, -0.042130061033521855, 0.05557612659010504, 0.1526988559247305, -0.03073399340353226, 0.038062658818763875, 0.14127726146271305, -0.09401239098847977, -0.19884476765975476, 0.3968913489583111, -0.010680676604221975, -0.20708496775478125, 0.18238772888342658, -0.047842508869334346, -0.16601491043536318, 0.08261967275202983, 0.31989091101826894, 0.04929893606643577, -0.17284661584666797, 0.02624056300347937, 0.024585309275795542, 0.1899160334382147, 0.06067381936147632, -0.006177641573317703, 0.16245316575458718, 0.23946140189137724, 0.06320626048984686, 0.19223720795984955, -0.07959988881604717, -0.13380354324666163, -0.22263223550417313, -0.19952868321718323, -0.1909619273251987, 0.006363548695743602, -0.08128819777953646, -0.09066323508020668, 0.37829190123057554, 0.2225562027722065, 0.17594474882657996, 0.1458190485746378, 0.4223396113763253, 0.07879163845190926, 0.11521254283272558, 0.16904985618644527, 0.11911964734336214, 0.0654734607346149, 0.17413272502432978, -0.18532732460072213, 0.0022748649870562884, -0.04831060696215857] |
1,803.01492 | Nested Quantum Annealing Correction at Finite Temperature: $p$-spin
models | Quantum annealing in a real device is necessarily susceptible to errors due
to diabatic transitions and thermal noise. Nested quantum annealing correction
is a method to suppress errors by using an all-to-all penalty coupling among a
set of physical qubits representing a logical qubit. We show analytically that
nested quantum annealing correction can suppress errors effectively in
ferromagnetic and antiferromagnetic Ising models with infinite-range
interactions. Our analysis reveals that the nesting structure can significantly
weaken or even remove first-order phase transitions, in which the energy gap
closes exponentially. The nesting structure also suppresses thermal
fluctuations by reducing the effective temperature.
| quant-ph cond-mat.stat-mech | quantum annealing in a real device is necessarily susceptible to errors due to diabatic transitions and thermal noise nested quantum annealing correction is a method to suppress errors by using an alltoall penalty coupling among a set of physical qubits representing a logical qubit we show analytically that nested quantum annealing correction can suppress errors effectively in ferromagnetic and antiferromagnetic ising models with infiniterange interactions our analysis reveals that the nesting structure can significantly weaken or even remove firstorder phase transitions in which the energy gap closes exponentially the nesting structure also suppresses thermal fluctuations by reducing the effective temperature | [['quantum', 'annealing', 'in', 'a', 'real', 'device', 'is', 'necessarily', 'susceptible', 'to', 'errors', 'due', 'to', 'diabatic', 'transitions', 'and', 'thermal', 'noise', 'nested', 'quantum', 'annealing', 'correction', 'is', 'a', 'method', 'to', 'suppress', 'errors', 'by', 'using', 'an', 'alltoall', 'penalty', 'coupling', 'among', 'a', 'set', 'of', 'physical', 'qubits', 'representing', 'a', 'logical', 'qubit', 'we', 'show', 'analytically', 'that', 'nested', 'quantum', 'annealing', 'correction', 'can', 'suppress', 'errors', 'effectively', 'in', 'ferromagnetic', 'and', 'antiferromagnetic', 'ising', 'models', 'with', 'infiniterange', 'interactions', 'our', 'analysis', 'reveals', 'that', 'the', 'nesting', 'structure', 'can', 'significantly', 'weaken', 'or', 'even', 'remove', 'firstorder', 'phase', 'transitions', 'in', 'which', 'the', 'energy', 'gap', 'closes', 'exponentially', 'the', 'nesting', 'structure', 'also', 'suppresses', 'thermal', 'fluctuations', 'by', 'reducing', 'the', 'effective', 'temperature']] | [-0.17427071695216, 0.2517620643578994, -0.05418948191043455, 0.10471614488633349, -0.015262767123058438, -0.22040849355980754, 0.12860129354754463, 0.36408720357343555, -0.29500250056385996, -0.31414301534183325, 0.021870682082371785, -0.2965951577795204, -0.13585467512952165, 0.12381804909324273, -0.017069763988256454, 0.028907332280650736, 0.05480773414950818, -0.06349581877700984, -0.1409952593885828, -0.24149629891850055, 0.28543581162579357, 0.08821712720324286, 0.2760763993207365, 0.05793812161777168, 0.020869417124195024, 0.008643877210561186, 0.09411701141856611, 0.029805744644254447, -0.06673126345107448, -0.0002101511135697365, 0.2611248358611556, -0.039224392203614115, 0.2390846572397277, -0.4467422259226441, -0.2486794806085527, 0.08159149524755777, 0.15586237136274575, 0.22548944861046039, 0.0044806513807270675, -0.2914388103596866, 0.028737656497396527, -0.14525207853876054, -0.055990846669883465, -0.16255225629545747, -0.06373863849788904, -0.06021273005055264, -0.2900526849285234, 0.11102949001418892, 0.12454342293553054, 0.03751042322255671, 0.009195939092896878, -0.06490289438515902, -0.027273734263144434, 0.06777707918779924, -0.032431494222146286, 0.05513083177531371, 0.1867068204563111, -0.09242997999768704, -0.14670728689525275, 0.30557805370539426, -0.04709810064872727, -0.17467964195646346, 0.1549785361625254, -0.06470687457360327, -0.05363199954852462, 0.1897676069336012, 0.11549943652935327, 0.011835342328995467, -0.13697300937143153, 0.10205268776393496, 0.13461502896621824, 0.2519509618775919, 0.04276942169293761, 0.04863039150834084, 0.19418623862788081, 0.1320604285830632, 0.07653528752736748, 0.2082906369259581, -0.08597382544889115, -0.17432271752506495, -0.2520286107249558, -0.12093684177380055, -0.20980495274532587, 0.06802487703156658, -0.1088246165725286, -0.225156645081006, 0.3705320771597326, 0.22882262987201102, 0.1610866988543421, -0.003044093776261434, 0.3097205594182014, 0.12162061227965751, 0.10872309595346451, 0.09227827312424779, 0.21633144054561854, 0.1561412286630366, 0.026134156743064522, -0.35085891424678267, 0.09514376742299646, 0.001515323636122048] |
1,803.01493 | GeVn complexes for silicon-based room-temperature single-atom
nanoelectronics | We characterize germanium-vacancy GeVn complexes in silicon using
first-principles Density Functional Theory calculations with
screening-dependent hybrid functionals. We report on the local geometry and
electronic excited states of these defects, including charge transition levels
corresponding to the addition of one or more electrons to the defect. Our main
theoretical result concerns the GeV complex, which we show to give rise to two
excited states deep in the gap, at -0.51 and -0.35 eV from the conduction band,
consistently with the available spectroscopic data. The adopted theoretical
scheme, suitable to compute a reliable estimate of the wavefunction decay,
leads us to predict that such states are associated to an electron localization
over a length of about 0.45 nm. By combining the electronic properties of the
bare silicon vacancy, carrying deep states in the band gap, with the spatial
controllability arising from single Ge ion implantation techniques, the GeVn
complex emerges as a suitable ingredient for silicon-based room-temperature
single-atom devices.
| physics.comp-ph cond-mat.mes-hall | we characterize germaniumvacancy gevn complexes in silicon using firstprinciples density functional theory calculations with screeningdependent hybrid functionals we report on the local geometry and electronic excited states of these defects including charge transition levels corresponding to the addition of one or more electrons to the defect our main theoretical result concerns the gev complex which we show to give rise to two excited states deep in the gap at 051 and 035 ev from the conduction band consistently with the available spectroscopic data the adopted theoretical scheme suitable to compute a reliable estimate of the wavefunction decay leads us to predict that such states are associated to an electron localization over a length of about 045 nm by combining the electronic properties of the bare silicon vacancy carrying deep states in the band gap with the spatial controllability arising from single ge ion implantation techniques the gevn complex emerges as a suitable ingredient for siliconbased roomtemperature singleatom devices | [['we', 'characterize', 'germaniumvacancy', 'gevn', 'complexes', 'in', 'silicon', 'using', 'firstprinciples', 'density', 'functional', 'theory', 'calculations', 'with', 'screeningdependent', 'hybrid', 'functionals', 'we', 'report', 'on', 'the', 'local', 'geometry', 'and', 'electronic', 'excited', 'states', 'of', 'these', 'defects', 'including', 'charge', 'transition', 'levels', 'corresponding', 'to', 'the', 'addition', 'of', 'one', 'or', 'more', 'electrons', 'to', 'the', 'defect', 'our', 'main', 'theoretical', 'result', 'concerns', 'the', 'gev', 'complex', 'which', 'we', 'show', 'to', 'give', 'rise', 'to', 'two', 'excited', 'states', 'deep', 'in', 'the', 'gap', 'at', '051', 'and', '035', 'ev', 'from', 'the', 'conduction', 'band', 'consistently', 'with', 'the', 'available', 'spectroscopic', 'data', 'the', 'adopted', 'theoretical', 'scheme', 'suitable', 'to', 'compute', 'a', 'reliable', 'estimate', 'of', 'the', 'wavefunction', 'decay', 'leads', 'us', 'to', 'predict', 'that', 'such', 'states', 'are', 'associated', 'to', 'an', 'electron', 'localization', 'over', 'a', 'length', 'of', 'about', '045', 'nm', 'by', 'combining', 'the', 'electronic', 'properties', 'of', 'the', 'bare', 'silicon', 'vacancy', 'carrying', 'deep', 'states', 'in', 'the', 'band', 'gap', 'with', 'the', 'spatial', 'controllability', 'arising', 'from', 'single', 'ge', 'ion', 'implantation', 'techniques', 'the', 'gevn', 'complex', 'emerges', 'as', 'a', 'suitable', 'ingredient', 'for', 'siliconbased', 'roomtemperature', 'singleatom', 'devices']] | [-0.06885586977138475, 0.1374981774353299, -0.03929936641732314, 0.04755676419056721, 0.02576745269155711, -0.12828555664901806, 0.08089474321099793, 0.41044837795197964, -0.2668606610082618, -0.3272297221835062, 0.000660642497330477, -0.3344590538744904, -0.060827353024176044, 0.16243272910938616, 0.016367120975272577, 0.038667579889253, 0.051855484732563135, -0.03416816288735836, -0.0875000155495278, -0.15069004086033103, 0.30565374879356305, 0.0697435787993863, 0.28892582680460566, 0.12639573103137267, 0.05360686767528984, 0.0009478841949800017, 0.06754856943419785, -0.03767654139868867, -0.1705147483886889, 0.18630534957999448, 0.2765942944649749, -0.019368649908982124, 0.23279359993832757, -0.47691794779080493, -0.20218487696000673, 0.01113872718107501, 0.10852097789312054, 0.14642689142385082, -0.056630541316613964, -0.282397906408663, 0.09949483123910464, -0.14081074779995592, -0.14752153468243762, -0.07438194232393697, -0.03691035253440688, -0.017504533376117612, -0.23792298555160593, 0.08804752988218786, -0.012321294952705977, 0.0326253791012231, -0.09942241476533213, -0.15003409428346998, -0.06413298964361952, 0.08212941907684372, -0.003638008729536917, 0.021222400701468348, 0.17885968312072406, -0.08635207081575445, -0.12651644563332057, 0.3507902577762628, -0.05322043304064661, -0.09539895050174255, 0.18962953424015955, -0.135199769509802, -0.09238418931390639, 0.18414981863431776, 0.11482209841287724, 0.11585288918666115, -0.11114362794549981, 0.05500642053566422, 0.030261350128092286, 0.19627345932894968, 0.03998587244030112, 0.13221966062381768, 0.1989484682863068, 0.18889332513301188, 0.06938534638467007, 0.08526568784043682, -0.15057726304386415, -0.05084714585333873, -0.25180497346149316, -0.15785771753834738, -0.18667252984633492, 0.11055798715004211, -0.0606951009848075, -0.1750440094857269, 0.43164743239787734, 0.1324420496584124, 0.19479476216258065, -0.01774057340111204, 0.22451228632111173, 0.11977756935450587, 0.08387833984218727, 0.03135040550712188, 0.2484119333657525, 0.17914598066119514, 0.08503455560651436, -0.23190354104346603, 0.005381383494159599, 0.0002042144925517451] |
1,803.01494 | Hund-enhanced electronic compressibility in FeSe and its correlation
with T$_c$ | We compute the compressibility of the conduction electrons in both bulk
orthorhombic FeSe and monolayer FeSe on SrTiO$_3$ substrate, including
dynamical electronic correlations within slave-spin mean-field +
density-functional theory. Results show a zone of enhancement of the electronic
compressibility crossing the interaction-doping phase diagram of these
compounds in accord with previous simulations on iron pnictides and in general
with the phenomenology of Hund's metals. Interestingly at ambient pressure FeSe
is found slightly away from the zone with enhanced compressibility but moved
right into it with hydrostatic pressure, while in monolayer FeSe the stronger
enhancement region is realized on the electron-doped side. These findings
correlate positively with the enhancement of superconductivity seen in
experiments, and support the possibility that Hund's induced many-body
correlations boost superconductive pairing when the system is at the frontier
of the normal- to Hund's-metal crossover.
| cond-mat.str-el cond-mat.supr-con | we compute the compressibility of the conduction electrons in both bulk orthorhombic fese and monolayer fese on srtio_3 substrate including dynamical electronic correlations within slavespin meanfield densityfunctional theory results show a zone of enhancement of the electronic compressibility crossing the interactiondoping phase diagram of these compounds in accord with previous simulations on iron pnictides and in general with the phenomenology of hunds metals interestingly at ambient pressure fese is found slightly away from the zone with enhanced compressibility but moved right into it with hydrostatic pressure while in monolayer fese the stronger enhancement region is realized on the electrondoped side these findings correlate positively with the enhancement of superconductivity seen in experiments and support the possibility that hunds induced manybody correlations boost superconductive pairing when the system is at the frontier of the normal to hundsmetal crossover | [['we', 'compute', 'the', 'compressibility', 'of', 'the', 'conduction', 'electrons', 'in', 'both', 'bulk', 'orthorhombic', 'fese', 'and', 'monolayer', 'fese', 'on', 'srtio_3', 'substrate', 'including', 'dynamical', 'electronic', 'correlations', 'within', 'slavespin', 'meanfield', 'densityfunctional', 'theory', 'results', 'show', 'a', 'zone', 'of', 'enhancement', 'of', 'the', 'electronic', 'compressibility', 'crossing', 'the', 'interactiondoping', 'phase', 'diagram', 'of', 'these', 'compounds', 'in', 'accord', 'with', 'previous', 'simulations', 'on', 'iron', 'pnictides', 'and', 'in', 'general', 'with', 'the', 'phenomenology', 'of', 'hunds', 'metals', 'interestingly', 'at', 'ambient', 'pressure', 'fese', 'is', 'found', 'slightly', 'away', 'from', 'the', 'zone', 'with', 'enhanced', 'compressibility', 'but', 'moved', 'right', 'into', 'it', 'with', 'hydrostatic', 'pressure', 'while', 'in', 'monolayer', 'fese', 'the', 'stronger', 'enhancement', 'region', 'is', 'realized', 'on', 'the', 'electrondoped', 'side', 'these', 'findings', 'correlate', 'positively', 'with', 'the', 'enhancement', 'of', 'superconductivity', 'seen', 'in', 'experiments', 'and', 'support', 'the', 'possibility', 'that', 'hunds', 'induced', 'manybody', 'correlations', 'boost', 'superconductive', 'pairing', 'when', 'the', 'system', 'is', 'at', 'the', 'frontier', 'of', 'the', 'normal', 'to', 'hundsmetal', 'crossover']] | [-0.1434798183005855, 0.22050429131766713, -0.03311347054593541, 0.02478220988392692, -0.010848821506456092, -0.14778037441773684, 0.15493345875034314, 0.3837613637248675, -0.26360499467355786, -0.24830937565442313, -0.06769135614632871, -0.3815814519887445, -0.11558648466856944, 0.14791183036372618, 0.08414011962207345, -0.019147755122847027, -0.027777394757571596, -0.031089680374565498, -0.17811040059249433, -0.25165375084874947, 0.31134581075705314, 0.04580627923003501, 0.3583813696685765, 0.1338263189420104, -0.03370629933800686, -0.03787207132446821, 0.15026113840716857, 0.04895714170954846, -0.15607367231186126, 0.039083005260262225, 0.2911233981450399, -0.14040450478938443, 0.19810062263126452, -0.4462296445026166, -0.247239808138046, -0.05768383313832735, 0.11580719988517187, 0.12460262070634161, -0.08176600097644109, -0.29261491049288046, 0.038426255641712086, -0.14017223250810748, -0.10026657348498702, -0.08931766876054031, -0.07502647095394355, -0.042575052763438884, -0.2078991043795314, 0.15312995644872662, 0.04678362897937876, 0.11551418031945272, -0.14942581454740353, -0.15485743379599795, -0.12338393308498241, -0.012680425008336358, 0.09350632167490268, 0.09132862534822413, 0.19995320569443586, -0.1318021934479475, -0.048721810247473143, 0.4187046539452341, -0.033164072275610156, -0.026508041443648163, 0.17747485358268023, -0.239107205339328, -0.08150026886206534, 0.16417930413520446, 0.08069267841400923, 0.031003173473463565, -0.06356744704890945, 0.08041662514701278, -0.049894785378300756, 0.1885210664252992, 0.02417136975046661, 0.072882685798686, 0.23414169512904698, 0.20231436647440273, 0.030019068041885342, 0.11520813516065202, -0.09931762777441354, -0.07412014733655033, -0.2009374138157539, -0.16811753137520066, -0.1895442984653292, 0.01377649198090054, -0.08804135405667626, -0.20362756548226268, 0.36465506495011074, 0.16059150386049792, 0.1682016432955775, -0.0902624478287719, 0.21767882864439378, 0.0843337641718487, 0.07953972351495867, 0.05336048331249643, 0.30398869577760773, 0.15953621082697753, 0.10453425985760986, -0.3350902332130958, 0.12234140535368136, 0.032612812491478745] |
1,803.01495 | On nonlinear boundary value problem corresponding to $N$-dimensional
inverse spectral problem | We establish a relationship between an inverse optimization spectral problem
for N-dimensional Schr\"odinger equation $ -\Delta \psi+q\psi=\lambda \psi $
and a solution of the nonlinear boundary value problem $-\Delta u+q_0 u=\lambda
u- u^{\gamma-1},~~u>0,~~
u|_{\partial \Omega}=0$. Using this relationship, we find an exact solution
for the inverse optimization spectral problem, investigate its stability and
obtain new results on the existence and uniqueness of the solution for the
nonlinear boundary value problem.
| math.AP math-ph math.MP math.SP | we establish a relationship between an inverse optimization spectral problem for ndimensional schrodinger equation delta psiqpsilambda psi and a solution of the nonlinear boundary value problem delta uq_0 ulambda u ugamma1u0 u_partial omega0 using this relationship we find an exact solution for the inverse optimization spectral problem investigate its stability and obtain new results on the existence and uniqueness of the solution for the nonlinear boundary value problem | [['we', 'establish', 'a', 'relationship', 'between', 'an', 'inverse', 'optimization', 'spectral', 'problem', 'for', 'ndimensional', 'schrodinger', 'equation', 'delta', 'psiqpsilambda', 'psi', 'and', 'a', 'solution', 'of', 'the', 'nonlinear', 'boundary', 'value', 'problem', 'delta', 'uq_0', 'ulambda', 'u', 'ugamma1u0', 'u_partial', 'omega0', 'using', 'this', 'relationship', 'we', 'find', 'an', 'exact', 'solution', 'for', 'the', 'inverse', 'optimization', 'spectral', 'problem', 'investigate', 'its', 'stability', 'and', 'obtain', 'new', 'results', 'on', 'the', 'existence', 'and', 'uniqueness', 'of', 'the', 'solution', 'for', 'the', 'nonlinear', 'boundary', 'value', 'problem']] | [-0.14539092869426196, -0.06962121850049768, -0.055763363981476195, 0.08174086907126296, -0.1201987458822819, -0.14938154447680482, 0.01584382441181403, 0.3296468881173776, -0.3741657275419969, -0.24374907836318016, 0.1768998062238097, -0.3223452156266341, -0.16047481298446656, 0.15260406580681984, -0.0047311845020605965, 0.1288008110732055, 0.07524615801297702, 0.0160825663461135, -0.1283361545548989, -0.0994994882422571, 0.36873055770993235, -0.08584629870378054, 0.2157538238232239, 0.10033936974091026, 0.13743235031859233, 0.0022229210616877444, 0.08021407587310443, -0.01201695564847726, -0.26724086181045725, 0.09068149105430795, 0.2086230871303437, 0.11998273357032584, 0.342250691798444, -0.3540057471738412, -0.1714142865429704, 0.17483247248455883, 0.11936306543648242, 0.014495929531179941, -0.06548743833465358, -0.27609286076174333, 0.07039171329771098, -0.052100055356724906, -0.19875264964424647, -9.462953760073735e-07, 0.06019732805971916, -0.010051400644274858, -0.36501175271203884, 0.15649346655163054, 0.026557220083374817, -0.015594448120548174, -0.21733358389375587, -0.12196586306851644, 0.04876115562824102, 0.06305138099078948, 0.038100733163838205, 0.030383735350691356, -0.04273266647584163, -0.15682859133857374, -0.05875315686257986, 0.3353703131326116, -0.0571995044986789, -0.292666204388325, 0.07875056229531766, -0.06637910978438763, -0.07742421813309193, 0.0651882958240234, 0.15766438843252567, 0.19665992678358005, -0.14274719181524304, 0.20373926456175886, -0.08650001752763413, 0.18992100117298272, 0.08086085600348619, -0.04402919072084702, 0.09800262759941128, 0.16470689737739472, 0.21595311073156503, 0.16870868439929418, -0.018456936022266744, -0.06246925345263802, -0.3233141799385731, -0.14111257667044322, -0.1472248882914965, 0.11562047441704915, -0.1623916417926711, -0.21018636481693156, 0.38081490241277677, 0.11169612725766806, 0.18694279464678124, 0.09015999533092746, 0.1895094936570296, 0.27224300754471464, -0.13450305302125903, 0.08893210036106981, 0.21308495253324508, 0.1855353579390794, 0.1598011503354288, -0.35268265788371744, -0.03147991725171988, 0.1682610141614882] |
1,803.01496 | Stochastic Model of SIR Epidemic Modelling | Threshold theorem is probably the most important development of mathematical
epidemic modelling. Unfortunately, some models may not behave according to the
threshold. In this paper, we will focus on the final outcome of SIR model with
demography. The behaviour of the model approached by deteministic and
stochastic models will be introduced, mainly using simulations. Furthermore, we
will also investigate the dynamic of susceptibles in population in absence of
infective. We have successfully showed that both deterministic and stochastic
models performed similar results when $R_0 \leq 1$. That is, the disease-free
stage in the epidemic. But when $R_0 > 1$, the deterministic and stochastic
approaches had different interpretations.
| q-bio.PE stat.AP | threshold theorem is probably the most important development of mathematical epidemic modelling unfortunately some models may not behave according to the threshold in this paper we will focus on the final outcome of sir model with demography the behaviour of the model approached by deteministic and stochastic models will be introduced mainly using simulations furthermore we will also investigate the dynamic of susceptibles in population in absence of infective we have successfully showed that both deterministic and stochastic models performed similar results when r_0 leq 1 that is the diseasefree stage in the epidemic but when r_0 1 the deterministic and stochastic approaches had different interpretations | [['threshold', 'theorem', 'is', 'probably', 'the', 'most', 'important', 'development', 'of', 'mathematical', 'epidemic', 'modelling', 'unfortunately', 'some', 'models', 'may', 'not', 'behave', 'according', 'to', 'the', 'threshold', 'in', 'this', 'paper', 'we', 'will', 'focus', 'on', 'the', 'final', 'outcome', 'of', 'sir', 'model', 'with', 'demography', 'the', 'behaviour', 'of', 'the', 'model', 'approached', 'by', 'deteministic', 'and', 'stochastic', 'models', 'will', 'be', 'introduced', 'mainly', 'using', 'simulations', 'furthermore', 'we', 'will', 'also', 'investigate', 'the', 'dynamic', 'of', 'susceptibles', 'in', 'population', 'in', 'absence', 'of', 'infective', 'we', 'have', 'successfully', 'showed', 'that', 'both', 'deterministic', 'and', 'stochastic', 'models', 'performed', 'similar', 'results', 'when', 'r_0', 'leq', '1', 'that', 'is', 'the', 'diseasefree', 'stage', 'in', 'the', 'epidemic', 'but', 'when', 'r_0', '1', 'the', 'deterministic', 'and', 'stochastic', 'approaches', 'had', 'different', 'interpretations']] | [-0.06613554630561598, 0.10474812862507644, -0.09377498577925421, 0.10466951377179828, -0.013828940751651923, -0.18291716106413375, 0.05306285385241998, 0.35414223392449673, -0.2207279597242762, -0.27938448230602914, 0.1437528121063397, -0.2541801304999916, -0.20690441213193395, 0.16473649460378856, -0.0918089369711067, 0.025332203983063146, 0.06563124066396128, 0.041708851454868204, 0.017967266567228805, -0.2629856937431863, 0.3212731873605489, 0.08449652010486239, 0.24639845056725398, 0.0227574320332635, 0.06375666034984447, -0.009424292420347532, -0.04291777769547133, 0.03991882116693194, -0.17690493671647606, 0.01886653717429865, 0.2607377382552104, 0.17875474644824862, 0.32823929969398746, -0.4446191966533661, -0.2337625212523909, 0.14813758816037859, 0.1830026020523205, 0.1536344841300022, 0.017144286163550404, -0.23486045779039463, 0.10532849273156553, -0.16893905840725415, -0.13330603443928773, 0.0051771523697035655, 0.01806087527601492, 0.05836760097493728, -0.23692092394811057, 0.07544769095894437, 0.08290329281506793, 0.047460198127442885, -0.047697269326696795, -0.1555611562516008, -0.046215822294886626, 0.10646918155197498, 0.0744330239992234, -0.025990884338638612, 0.12230433469993018, -0.1515796356634902, -0.12599205246993472, 0.326280385752519, -0.04860103660750957, -0.18282452417271478, 0.20590971979711736, -0.14578859754172818, -0.16475928034882859, 0.08282779977612552, 0.20547275914854946, 0.10555940842522042, -0.15964309699705892, 0.04035860892396331, -0.022269840928770247, 0.17162008258913244, 0.022165794519796257, -0.04510279838217511, 0.1458004055988221, 0.2052249108707266, 0.011189734858150283, 0.0818358079230945, -0.0798999833275697, -0.14936444742959878, -0.25752114338379, -0.06554293017834426, -0.11632367903810172, 0.06358104910981464, -0.09134483282811873, -0.12293955563966717, 0.3798113863383021, 0.22168272152387847, 0.18022307883061114, 0.0850872480842684, 0.2521159013932837, 0.1215596897305832, -0.01905459890009037, 0.0724703082770464, 0.25371792697087153, 0.08526968134877583, 0.10053045125678181, -0.177468073962345, 0.17592411914707295, 0.029811276658438145] |
1,803.01497 | Comparing the Behaviour of Deterministic and Stochastic Model of SIS
Epidemic | Studies about epidemic modelling have been conducted since before 19th
century. Both deterministic and stochastiic model were used to capture the
dynamic of infection in the population. The purpose of this project is to
investigate the behaviour of the models when we set the basic reproduction
number, $R_0$. This quantity is defined as the expected number of contacts made
by a typical infective to susceptibles in the population. According to the
epidemic threshold theory, when $R_0 \leq 1$, minor epidemic occurs with
probability one in both approaches, but when $R_0 > 1$, the deterministic and
stochastic models have different interpretation. In the deterministic approach,
major epidemic occurs with probability one when $R_0 > 1$ and predicts that the
disease will settle down to an endemic equilibrium. Stochastic models, on the
other hand, identify that the minor epidemic can possibly occur. If it does,
then the epidemic will die out quickly. Moreover, if we let the population size
be large and the major epidemic occurs, then it will take off and then reach
the endemic level and move randomly around the deterministic's equilibrium.
| q-bio.PE math.ST stat.TH | studies about epidemic modelling have been conducted since before 19th century both deterministic and stochastiic model were used to capture the dynamic of infection in the population the purpose of this project is to investigate the behaviour of the models when we set the basic reproduction number r_0 this quantity is defined as the expected number of contacts made by a typical infective to susceptibles in the population according to the epidemic threshold theory when r_0 leq 1 minor epidemic occurs with probability one in both approaches but when r_0 1 the deterministic and stochastic models have different interpretation in the deterministic approach major epidemic occurs with probability one when r_0 1 and predicts that the disease will settle down to an endemic equilibrium stochastic models on the other hand identify that the minor epidemic can possibly occur if it does then the epidemic will die out quickly moreover if we let the population size be large and the major epidemic occurs then it will take off and then reach the endemic level and move randomly around the deterministics equilibrium | [['studies', 'about', 'epidemic', 'modelling', 'have', 'been', 'conducted', 'since', 'before', '19th', 'century', 'both', 'deterministic', 'and', 'stochastiic', 'model', 'were', 'used', 'to', 'capture', 'the', 'dynamic', 'of', 'infection', 'in', 'the', 'population', 'the', 'purpose', 'of', 'this', 'project', 'is', 'to', 'investigate', 'the', 'behaviour', 'of', 'the', 'models', 'when', 'we', 'set', 'the', 'basic', 'reproduction', 'number', 'r_0', 'this', 'quantity', 'is', 'defined', 'as', 'the', 'expected', 'number', 'of', 'contacts', 'made', 'by', 'a', 'typical', 'infective', 'to', 'susceptibles', 'in', 'the', 'population', 'according', 'to', 'the', 'epidemic', 'threshold', 'theory', 'when', 'r_0', 'leq', '1', 'minor', 'epidemic', 'occurs', 'with', 'probability', 'one', 'in', 'both', 'approaches', 'but', 'when', 'r_0', '1', 'the', 'deterministic', 'and', 'stochastic', 'models', 'have', 'different', 'interpretation', 'in', 'the', 'deterministic', 'approach', 'major', 'epidemic', 'occurs', 'with', 'probability', 'one', 'when', 'r_0', '1', 'and', 'predicts', 'that', 'the', 'disease', 'will', 'settle', 'down', 'to', 'an', 'endemic', 'equilibrium', 'stochastic', 'models', 'on', 'the', 'other', 'hand', 'identify', 'that', 'the', 'minor', 'epidemic', 'can', 'possibly', 'occur', 'if', 'it', 'does', 'then', 'the', 'epidemic', 'will', 'die', 'out', 'quickly', 'moreover', 'if', 'we', 'let', 'the', 'population', 'size', 'be', 'large', 'and', 'the', 'major', 'epidemic', 'occurs', 'then', 'it', 'will', 'take', 'off', 'and', 'then', 'reach', 'the', 'endemic', 'level', 'and', 'move', 'randomly', 'around', 'the', 'deterministics', 'equilibrium']] | [-0.07730264007767892, 0.13340600001113292, -0.08142370656341984, 0.10460108487992391, -0.009656864406771205, -0.20381976585845682, 0.09403618930229457, 0.3359621930501183, -0.25246720904421605, -0.2721057088804965, 0.1473505981528106, -0.3047040498048967, -0.15609565744041778, 0.130998364402494, -0.07296291314421242, 0.00033275771289645285, 0.0546026089205145, 0.08323870321442739, 0.054873620752464936, -0.2934314691817409, 0.30161212217926014, 0.05211948459899953, 0.2308956574618534, 0.029011140007190826, 0.06392763545305018, -0.0033577577122016235, -0.004488767703518983, 0.027244672634051212, -0.17615839842161793, -0.010945225948091136, 0.27005080052330915, 0.18649811359263663, 0.3536994315976842, -0.4522273049721222, -0.21263341417698337, 0.1845518116004702, 0.18563940064697737, 0.16003612037587864, 0.05784303092416062, -0.23516225918808303, 0.09315100778679081, -0.17737547615856936, -0.17329124964085627, 0.04007880760649784, 0.061598322903632784, 0.03686849755140838, -0.22557446337043402, 0.05639292100075569, 0.02471140596827262, 0.04841146605570665, 0.0046607773617600625, -0.13743757199904139, -0.08467932164621947, 0.16856707700101783, 0.08005242499135685, 0.006920335220017345, 0.16413918457234675, -0.12222185442642716, -0.06205722180278867, 0.33072156121619467, -0.006330158985926236, -0.14234934052651266, 0.1668143407454756, -0.18210829845027934, -0.10864754019483656, 0.12828278238623497, 0.19913034552310624, 0.07315114186030258, -0.1379642284653814, 0.007955215319996344, -0.00863911976038447, 0.1724263548882406, 0.04826168731781078, -0.06893905216116417, 0.1801450997067804, 0.22707132134963287, 0.07547718582523129, 0.050132827424860214, -0.10169070219657687, -0.16234968472115194, -0.24316366903190867, -0.08167094016301163, -0.11330458505623293, 0.09931542035754708, -0.09927338675096804, -0.15039493252387207, 0.37332191811142007, 0.19964184285288028, 0.1860178354290429, 0.09541510170511378, 0.2467038268164543, 0.10245315777538462, 0.016874118629591855, 0.09942881959579425, 0.21160067110636344, 0.0861986830794276, 0.06786032614829228, -0.19045839567140288, 0.17076226591925253, 0.007467474356775036] |
1,803.01498 | Byzantine-Robust Distributed Learning: Towards Optimal Statistical Rates | In large-scale distributed learning, security issues have become increasingly
important. Particularly in a decentralized environment, some computing units
may behave abnormally, or even exhibit Byzantine failures -- arbitrary and
potentially adversarial behavior. In this paper, we develop distributed
learning algorithms that are provably robust against such failures, with a
focus on achieving optimal statistical performance. A main result of this work
is a sharp analysis of two robust distributed gradient descent algorithms based
on median and trimmed mean operations, respectively. We prove statistical error
rates for three kinds of population loss functions: strongly convex,
non-strongly convex, and smooth non-convex. In particular, these algorithms are
shown to achieve order-optimal statistical error rates for strongly convex
losses. To achieve better communication efficiency, we further propose a
median-based distributed algorithm that is provably robust, and uses only one
communication round. For strongly convex quadratic loss, we show that this
algorithm achieves the same optimal error rate as the robust distributed
gradient descent algorithms.
| cs.LG cs.CR cs.DC stat.ML | in largescale distributed learning security issues have become increasingly important particularly in a decentralized environment some computing units may behave abnormally or even exhibit byzantine failures arbitrary and potentially adversarial behavior in this paper we develop distributed learning algorithms that are provably robust against such failures with a focus on achieving optimal statistical performance a main result of this work is a sharp analysis of two robust distributed gradient descent algorithms based on median and trimmed mean operations respectively we prove statistical error rates for three kinds of population loss functions strongly convex nonstrongly convex and smooth nonconvex in particular these algorithms are shown to achieve orderoptimal statistical error rates for strongly convex losses to achieve better communication efficiency we further propose a medianbased distributed algorithm that is provably robust and uses only one communication round for strongly convex quadratic loss we show that this algorithm achieves the same optimal error rate as the robust distributed gradient descent algorithms | [['in', 'largescale', 'distributed', 'learning', 'security', 'issues', 'have', 'become', 'increasingly', 'important', 'particularly', 'in', 'a', 'decentralized', 'environment', 'some', 'computing', 'units', 'may', 'behave', 'abnormally', 'or', 'even', 'exhibit', 'byzantine', 'failures', 'arbitrary', 'and', 'potentially', 'adversarial', 'behavior', 'in', 'this', 'paper', 'we', 'develop', 'distributed', 'learning', 'algorithms', 'that', 'are', 'provably', 'robust', 'against', 'such', 'failures', 'with', 'a', 'focus', 'on', 'achieving', 'optimal', 'statistical', 'performance', 'a', 'main', 'result', 'of', 'this', 'work', 'is', 'a', 'sharp', 'analysis', 'of', 'two', 'robust', 'distributed', 'gradient', 'descent', 'algorithms', 'based', 'on', 'median', 'and', 'trimmed', 'mean', 'operations', 'respectively', 'we', 'prove', 'statistical', 'error', 'rates', 'for', 'three', 'kinds', 'of', 'population', 'loss', 'functions', 'strongly', 'convex', 'nonstrongly', 'convex', 'and', 'smooth', 'nonconvex', 'in', 'particular', 'these', 'algorithms', 'are', 'shown', 'to', 'achieve', 'orderoptimal', 'statistical', 'error', 'rates', 'for', 'strongly', 'convex', 'losses', 'to', 'achieve', 'better', 'communication', 'efficiency', 'we', 'further', 'propose', 'a', 'medianbased', 'distributed', 'algorithm', 'that', 'is', 'provably', 'robust', 'and', 'uses', 'only', 'one', 'communication', 'round', 'for', 'strongly', 'convex', 'quadratic', 'loss', 'we', 'show', 'that', 'this', 'algorithm', 'achieves', 'the', 'same', 'optimal', 'error', 'rate', 'as', 'the', 'robust', 'distributed', 'gradient', 'descent', 'algorithms']] | [-0.16567737983507486, 0.018431280212441704, -0.07661820448197003, 0.1010015470476575, -0.029402886716496643, -0.254039207054595, 0.053896851401992796, 0.4693560783909458, -0.29779311271571796, -0.28047925772133675, 0.1274008399795202, -0.214755079800881, -0.20439339078283347, 0.22156900015027034, -0.216609321681068, 0.1541772273328132, 0.08945118774053694, -0.002637017396741412, -0.06748827627373848, -0.34763907381104975, 0.24086565204307367, 0.041461747139692307, 0.3218396034431439, 0.0005394721531115894, 0.08895398295666061, -0.02417189113608321, 0.017524744293201458, 0.052492811584716324, -0.06140934198624535, 0.17719811728259302, 0.3249833044016136, 0.1773302967428763, 0.3936881033363957, -0.39888599349819887, -0.15975380658447366, 0.162049127818794, 0.16195760547339408, 0.09426917885752313, -0.10123897988185193, -0.21488146194836721, 0.13441187980124997, -0.14065718949836847, -0.03164159542875095, -0.12371655123062292, -0.05887505665213549, 0.06930103766623556, -0.34443748910448646, 0.09597815101696823, 0.09521519411472404, 0.044179405074027726, -0.02422321797494993, -0.13603756915479195, 0.08194265344455463, 0.07115913906907838, 0.0388164349726208, 0.04602052946501769, 0.17993234571050443, -0.08209255582406977, -0.15792074410607979, 0.32083015697393213, -0.030025526875360583, -0.20721694771434712, 0.19034965006113286, -0.022789809911412263, -0.18863287945307275, 0.12837451485383952, 0.30498736756473027, 0.1561167563177036, -0.14708998805767148, 0.02762838993104374, 0.006143647175774259, 0.16102381836353513, 0.002424286666718669, 0.07554610271252832, 0.09768060406336104, 0.17345476855008435, 0.21733815262955175, 0.14190952580366517, -0.049489029094506545, -0.1457504766360628, -0.23087712756428375, -0.10642513370510402, -0.16312282345896154, -0.008601738289350047, -0.1319366424024521, -0.18897009812022336, 0.3294491985601918, 0.16748503349361205, 0.18100542013691562, 0.19516895867228132, 0.37367425287294687, 0.06346266507939875, 0.014094470150815617, 0.2277611570781296, 0.24528020709762555, 0.05873943696789877, 0.04629801022241759, -0.20135067636000706, 0.12992974693752216, 0.027200010206854943] |
1,803.01499 | Tracking Top-K Influential Vertices in Dynamic Networks | Influence propagation in networks has enjoyed fruitful applications and has
been extensively studied in literature. However, only very limited preliminary
studies tackled the challenges in handling highly dynamic changes in real
networks. In this paper, we tackle the problem of tracking top-$k$ influential
vertices in dynamic networks, where the dynamic changes are modeled as a stream
of edge weight updates. Under the popularly adopted linear threshold (LT) model
and the independent cascade (IC) model, we address two essential versions of
the problem: tracking the top-$k$ influential individuals and finding the best
$k$-seed set to maximize the influence spread (Influence Maximization). We
adopt the polling-based method and maintain a sample of random RR sets so that
we can approximate the influence of vertices with provable quality guarantees.
It is known that updating RR sets over dynamic changes of a network can be
easily done by a reservoir sampling method, so the key challenge is to
efficiently decide how many RR sets are needed to achieve good quality
guarantees. We use two simple signals, which both can be accessed in $O(1)$
time, to decide a proper number of RR sets. We prove the effectiveness of our
methods. For both tasks the error incurred in our method is only a
multiplicative factor to the ground truth. For influence maximization, we also
propose an efficient query algorithm for finding the $k$ seeds, which is one
order of magnitude faster than the state-of-the-art query algorithm in
practice. In addition to the thorough theoretical results, our experimental
results on large real networks clearly demonstrate the effectiveness and
efficiency of our algorithms.
| cs.SI | influence propagation in networks has enjoyed fruitful applications and has been extensively studied in literature however only very limited preliminary studies tackled the challenges in handling highly dynamic changes in real networks in this paper we tackle the problem of tracking topk influential vertices in dynamic networks where the dynamic changes are modeled as a stream of edge weight updates under the popularly adopted linear threshold lt model and the independent cascade ic model we address two essential versions of the problem tracking the topk influential individuals and finding the best kseed set to maximize the influence spread influence maximization we adopt the pollingbased method and maintain a sample of random rr sets so that we can approximate the influence of vertices with provable quality guarantees it is known that updating rr sets over dynamic changes of a network can be easily done by a reservoir sampling method so the key challenge is to efficiently decide how many rr sets are needed to achieve good quality guarantees we use two simple signals which both can be accessed in o1 time to decide a proper number of rr sets we prove the effectiveness of our methods for both tasks the error incurred in our method is only a multiplicative factor to the ground truth for influence maximization we also propose an efficient query algorithm for finding the k seeds which is one order of magnitude faster than the stateoftheart query algorithm in practice in addition to the thorough theoretical results our experimental results on large real networks clearly demonstrate the effectiveness and efficiency of our algorithms | [['influence', 'propagation', 'in', 'networks', 'has', 'enjoyed', 'fruitful', 'applications', 'and', 'has', 'been', 'extensively', 'studied', 'in', 'literature', 'however', 'only', 'very', 'limited', 'preliminary', 'studies', 'tackled', 'the', 'challenges', 'in', 'handling', 'highly', 'dynamic', 'changes', 'in', 'real', 'networks', 'in', 'this', 'paper', 'we', 'tackle', 'the', 'problem', 'of', 'tracking', 'topk', 'influential', 'vertices', 'in', 'dynamic', 'networks', 'where', 'the', 'dynamic', 'changes', 'are', 'modeled', 'as', 'a', 'stream', 'of', 'edge', 'weight', 'updates', 'under', 'the', 'popularly', 'adopted', 'linear', 'threshold', 'lt', 'model', 'and', 'the', 'independent', 'cascade', 'ic', 'model', 'we', 'address', 'two', 'essential', 'versions', 'of', 'the', 'problem', 'tracking', 'the', 'topk', 'influential', 'individuals', 'and', 'finding', 'the', 'best', 'kseed', 'set', 'to', 'maximize', 'the', 'influence', 'spread', 'influence', 'maximization', 'we', 'adopt', 'the', 'pollingbased', 'method', 'and', 'maintain', 'a', 'sample', 'of', 'random', 'rr', 'sets', 'so', 'that', 'we', 'can', 'approximate', 'the', 'influence', 'of', 'vertices', 'with', 'provable', 'quality', 'guarantees', 'it', 'is', 'known', 'that', 'updating', 'rr', 'sets', 'over', 'dynamic', 'changes', 'of', 'a', 'network', 'can', 'be', 'easily', 'done', 'by', 'a', 'reservoir', 'sampling', 'method', 'so', 'the', 'key', 'challenge', 'is', 'to', 'efficiently', 'decide', 'how', 'many', 'rr', 'sets', 'are', 'needed', 'to', 'achieve', 'good', 'quality', 'guarantees', 'we', 'use', 'two', 'simple', 'signals', 'which', 'both', 'can', 'be', 'accessed', 'in', 'o1', 'time', 'to', 'decide', 'a', 'proper', 'number', 'of', 'rr', 'sets', 'we', 'prove', 'the', 'effectiveness', 'of', 'our', 'methods', 'for', 'both', 'tasks', 'the', 'error', 'incurred', 'in', 'our', 'method', 'is', 'only', 'a', 'multiplicative', 'factor', 'to', 'the', 'ground', 'truth', 'for', 'influence', 'maximization', 'we', 'also', 'propose', 'an', 'efficient', 'query', 'algorithm', 'for', 'finding', 'the', 'k', 'seeds', 'which', 'is', 'one', 'order', 'of', 'magnitude', 'faster', 'than', 'the', 'stateoftheart', 'query', 'algorithm', 'in', 'practice', 'in', 'addition', 'to', 'the', 'thorough', 'theoretical', 'results', 'our', 'experimental', 'results', 'on', 'large', 'real', 'networks', 'clearly', 'demonstrate', 'the', 'effectiveness', 'and', 'efficiency', 'of', 'our', 'algorithms']] | [-0.11221630209933431, 0.014601603770863607, -0.05372522755483673, 0.08130299480178634, -0.09794257814593782, -0.12259488396706399, 0.10181970287169062, 0.43029174558592564, -0.27486787934674684, -0.3286432120737366, 0.09030782663930123, -0.2603266764375748, -0.1815156335514709, 0.19361675429073247, -0.10114383808016128, 0.09856477943178492, 0.10262636104810306, 0.05267491190920048, -0.019348159926294378, -0.33049969249546074, 0.2561650147015991, 0.04677917707930178, 0.30203730441545223, 0.03834787777613559, 0.08281504940135744, -0.003970736508949123, -0.039225653709515675, 0.06834692893167041, -0.07972979735236688, 0.12123628791185624, 0.27916493229074124, 0.1859064079447335, 0.33710595285943284, -0.41171244027389714, -0.2035590369597423, 0.14610625938274263, 0.1700745912709284, 0.10375023086530608, -0.019254850068825886, -0.258373490183713, 0.1225807034281774, -0.14324603349704182, -0.054168145969566525, -0.09500865433404794, -0.0032050402409037238, 0.01730191449513024, -0.30623218654606416, 0.022305532928206077, 0.02190104240523369, 0.02112183395520057, -0.03533636575792281, -0.13367070952275148, 0.05508427567529549, 0.159059119791147, 0.045367537998544955, 0.04947284428635612, 0.12298403655101235, -0.11804517587756203, -0.16482124584162552, 0.381832800854957, -0.034337495799208584, -0.20379009380298102, 0.17639496465651036, -0.07392482102615318, -0.16182040343692555, 0.11638684546977113, 0.21211595151279736, 0.15120532067058692, -0.16670106190025707, 0.04893947184367183, -0.04991019844910073, 0.1694278977617311, 0.050694115699805094, 0.03447809823057579, 0.13215515314544918, 0.21049556355556528, 0.0857892181602162, 0.13990997797262741, -0.06659074868234298, -0.0951113759921017, -0.21738072498291414, -0.09929275768456247, -0.20087354069674443, -0.028380849137179073, -0.11862155479601907, -0.149616573672657, 0.40612173576796934, 0.21725979369049045, 0.19186504164430185, 0.05656752958064758, 0.3313109700455133, 0.07908047682163173, 0.04766508971894809, 0.13436672233078614, 0.2193671387089346, 0.06288333641427787, 0.08711789059055842, -0.2083137534721049, 0.14323500189085747, 0.030820720073251956] |
1,803.015 | Memorization Precedes Generation: Learning Unsupervised GANs with Memory
Networks | We propose an approach to address two issues that commonly occur during
training of unsupervised GANs. First, since GANs use only a continuous latent
distribution to embed multiple classes or clusters of data, they often do not
correctly handle the structural discontinuity between disparate classes in a
latent space. Second, discriminators of GANs easily forget about past generated
samples by generators, incurring instability during adversarial training. We
argue that these two infamous problems of unsupervised GAN training can be
largely alleviated by a learnable memory network to which both generators and
discriminators can access. Generators can effectively learn representation of
training samples to understand underlying cluster distributions of data, which
ease the structure discontinuity problem. At the same time, discriminators can
better memorize clusters of previously generated samples, which mitigate the
forgetting problem. We propose a novel end-to-end GAN model named memoryGAN,
which involves a memory network that is unsupervisedly trainable and integrable
to many existing GAN models. With evaluations on multiple datasets such as
Fashion-MNIST, CelebA, CIFAR10, and Chairs, we show that our model is
probabilistically interpretable, and generates realistic image samples of high
visual fidelity. The memoryGAN also achieves the state-of-the-art inception
scores over unsupervised GAN models on the CIFAR10 dataset, without any
optimization tricks and weaker divergences.
| cs.LG stat.ML | we propose an approach to address two issues that commonly occur during training of unsupervised gans first since gans use only a continuous latent distribution to embed multiple classes or clusters of data they often do not correctly handle the structural discontinuity between disparate classes in a latent space second discriminators of gans easily forget about past generated samples by generators incurring instability during adversarial training we argue that these two infamous problems of unsupervised gan training can be largely alleviated by a learnable memory network to which both generators and discriminators can access generators can effectively learn representation of training samples to understand underlying cluster distributions of data which ease the structure discontinuity problem at the same time discriminators can better memorize clusters of previously generated samples which mitigate the forgetting problem we propose a novel endtoend gan model named memorygan which involves a memory network that is unsupervisedly trainable and integrable to many existing gan models with evaluations on multiple datasets such as fashionmnist celeba cifar10 and chairs we show that our model is probabilistically interpretable and generates realistic image samples of high visual fidelity the memorygan also achieves the stateoftheart inception scores over unsupervised gan models on the cifar10 dataset without any optimization tricks and weaker divergences | [['we', 'propose', 'an', 'approach', 'to', 'address', 'two', 'issues', 'that', 'commonly', 'occur', 'during', 'training', 'of', 'unsupervised', 'gans', 'first', 'since', 'gans', 'use', 'only', 'a', 'continuous', 'latent', 'distribution', 'to', 'embed', 'multiple', 'classes', 'or', 'clusters', 'of', 'data', 'they', 'often', 'do', 'not', 'correctly', 'handle', 'the', 'structural', 'discontinuity', 'between', 'disparate', 'classes', 'in', 'a', 'latent', 'space', 'second', 'discriminators', 'of', 'gans', 'easily', 'forget', 'about', 'past', 'generated', 'samples', 'by', 'generators', 'incurring', 'instability', 'during', 'adversarial', 'training', 'we', 'argue', 'that', 'these', 'two', 'infamous', 'problems', 'of', 'unsupervised', 'gan', 'training', 'can', 'be', 'largely', 'alleviated', 'by', 'a', 'learnable', 'memory', 'network', 'to', 'which', 'both', 'generators', 'and', 'discriminators', 'can', 'access', 'generators', 'can', 'effectively', 'learn', 'representation', 'of', 'training', 'samples', 'to', 'understand', 'underlying', 'cluster', 'distributions', 'of', 'data', 'which', 'ease', 'the', 'structure', 'discontinuity', 'problem', 'at', 'the', 'same', 'time', 'discriminators', 'can', 'better', 'memorize', 'clusters', 'of', 'previously', 'generated', 'samples', 'which', 'mitigate', 'the', 'forgetting', 'problem', 'we', 'propose', 'a', 'novel', 'endtoend', 'gan', 'model', 'named', 'memorygan', 'which', 'involves', 'a', 'memory', 'network', 'that', 'is', 'unsupervisedly', 'trainable', 'and', 'integrable', 'to', 'many', 'existing', 'gan', 'models', 'with', 'evaluations', 'on', 'multiple', 'datasets', 'such', 'as', 'fashionmnist', 'celeba', 'cifar10', 'and', 'chairs', 'we', 'show', 'that', 'our', 'model', 'is', 'probabilistically', 'interpretable', 'and', 'generates', 'realistic', 'image', 'samples', 'of', 'high', 'visual', 'fidelity', 'the', 'memorygan', 'also', 'achieves', 'the', 'stateoftheart', 'inception', 'scores', 'over', 'unsupervised', 'gan', 'models', 'on', 'the', 'cifar10', 'dataset', 'without', 'any', 'optimization', 'tricks', 'and', 'weaker', 'divergences']] | [-0.02265995240976246, 0.05778815381766505, -0.06515769845394132, 0.13460088535905995, -0.1498349828314251, -0.19491953121345992, 0.02352610589318479, 0.4934772431375817, -0.305288334202487, -0.3741994510100295, 0.04611239996414112, -0.26791368398810916, -0.17943736786792913, 0.159258496367189, -0.17464175490469921, 0.07703487015700936, 0.1475974803475905, 0.010064401702178517, -0.0933944650488019, -0.34876694546367687, 0.3112614079765483, 0.02484835647415961, 0.344012264911166, -0.04529159128147652, 0.1761633838099302, -0.07645797604345717, 0.025376999688048203, -0.031037247578751703, -0.01888567537403455, 0.1436094668399444, 0.3028291284655237, 0.1934200406808836, 0.3478024467129636, -0.43740267458801657, -0.2669218431580633, 0.13142725901483432, 0.13862078452760984, 0.11730458612992851, -0.016203031730793346, -0.3346923307690304, 0.09438172542901996, -0.14823978458522247, 0.06414130536499076, -0.17651138650790715, -0.07799382723169401, -0.025242747973816922, -0.31796115737485636, 0.056785540130686755, 0.11104888666103271, 0.024606648720621776, -0.03833078925051198, -0.08924993960625635, -0.037378393246819124, 0.14584926979128235, 0.03851388994483456, 0.055660687426167824, 0.12355656583811371, -0.17506468745145518, -0.16376101934852508, 0.2994104135812869, -0.025507286925298665, -0.1887832261479791, 0.19624022232444707, -0.022968943221852757, -0.14232414761891748, 0.09366432842328393, 0.24636072972498368, 0.1121407282547667, -0.17697878801202302, 0.009670392690448072, -0.036269904436127175, 0.19491789642779622, 0.06069805740396707, -0.003624988454598329, 0.1467340190168985, 0.1998724274252219, 0.0032664288891492807, 0.16534626335655608, -0.10426220318857723, -0.05586880163844818, -0.23034236908391065, -0.076091460556759, -0.22390001969268689, 0.004952994314128143, -0.1273615358666995, -0.17550771988911806, 0.40015698184232373, 0.24431079960217736, 0.2573838769637335, 0.12234844451617952, 0.33255089305356916, -0.01624476856131178, 0.1734473303076811, 0.11118597029529226, 0.13615622579863368, -0.02405051840693117, 0.0711004609668005, -0.14013945033436287, 0.14554144414208936, 0.01976482924006772] |
1,803.01501 | Connections between star cluster populations and their host galaxy
nuclear rings | Nuclear rings are excellent laboratories for probing diverse phenomena such
as the formation and evolution of young massive star clusters (YMCs), nuclear
starbursts, as well as the secular evolution and dynamics of their host
galaxies. We have compiled a sample of 17 galaxies with nuclear rings, which
are well resolved by high-resolution {\sl Hubble} and {\sl Spitzer Space
Telescope} imaging. For each nuclear ring, we identified the ring star cluster
population, along with their physical properties (ages, masses, extinction
values). We also determined the integrated ring properties, including the
average age, total stellar mass, and current star-formation rate (SFR). We find
that Sb-type galaxies tend to have the highest ring stellar mass fraction with
respect to the host galaxy, and this parameter is correlated with the ring's
SFR surface density. The ring SFRs are correlated with their stellar masses,
which is reminiscent of the main sequence of star-forming galaxies. There are
striking correlations between star-forming properties (i.e., SFR and SFR
surface density) and non-axisymmetric bar parameters, appearing to confirm
previous inferences that strongly barred galaxies tend to have lower ring SFRs,
although the ring star-formation histories turn out to be significantly more
complicated. Nuclear rings with higher stellar masses tend to be associated
with lower cluster mass fractions, but there is no such relation with the ages
of the rings. The two youngest nuclear rings in our sample, NGC 1512 and NGC
4314, which have the most extreme physical properties, represent the young
extremity of the nuclear ring age distribution.
| astro-ph.GA | nuclear rings are excellent laboratories for probing diverse phenomena such as the formation and evolution of young massive star clusters ymcs nuclear starbursts as well as the secular evolution and dynamics of their host galaxies we have compiled a sample of 17 galaxies with nuclear rings which are well resolved by highresolution sl hubble and sl spitzer space telescope imaging for each nuclear ring we identified the ring star cluster population along with their physical properties ages masses extinction values we also determined the integrated ring properties including the average age total stellar mass and current starformation rate sfr we find that sbtype galaxies tend to have the highest ring stellar mass fraction with respect to the host galaxy and this parameter is correlated with the rings sfr surface density the ring sfrs are correlated with their stellar masses which is reminiscent of the main sequence of starforming galaxies there are striking correlations between starforming properties ie sfr and sfr surface density and nonaxisymmetric bar parameters appearing to confirm previous inferences that strongly barred galaxies tend to have lower ring sfrs although the ring starformation histories turn out to be significantly more complicated nuclear rings with higher stellar masses tend to be associated with lower cluster mass fractions but there is no such relation with the ages of the rings the two youngest nuclear rings in our sample ngc 1512 and ngc 4314 which have the most extreme physical properties represent the young extremity of the nuclear ring age distribution | [['nuclear', 'rings', 'are', 'excellent', 'laboratories', 'for', 'probing', 'diverse', 'phenomena', 'such', 'as', 'the', 'formation', 'and', 'evolution', 'of', 'young', 'massive', 'star', 'clusters', 'ymcs', 'nuclear', 'starbursts', 'as', 'well', 'as', 'the', 'secular', 'evolution', 'and', 'dynamics', 'of', 'their', 'host', 'galaxies', 'we', 'have', 'compiled', 'a', 'sample', 'of', '17', 'galaxies', 'with', 'nuclear', 'rings', 'which', 'are', 'well', 'resolved', 'by', 'highresolution', 'sl', 'hubble', 'and', 'sl', 'spitzer', 'space', 'telescope', 'imaging', 'for', 'each', 'nuclear', 'ring', 'we', 'identified', 'the', 'ring', 'star', 'cluster', 'population', 'along', 'with', 'their', 'physical', 'properties', 'ages', 'masses', 'extinction', 'values', 'we', 'also', 'determined', 'the', 'integrated', 'ring', 'properties', 'including', 'the', 'average', 'age', 'total', 'stellar', 'mass', 'and', 'current', 'starformation', 'rate', 'sfr', 'we', 'find', 'that', 'sbtype', 'galaxies', 'tend', 'to', 'have', 'the', 'highest', 'ring', 'stellar', 'mass', 'fraction', 'with', 'respect', 'to', 'the', 'host', 'galaxy', 'and', 'this', 'parameter', 'is', 'correlated', 'with', 'the', 'rings', 'sfr', 'surface', 'density', 'the', 'ring', 'sfrs', 'are', 'correlated', 'with', 'their', 'stellar', 'masses', 'which', 'is', 'reminiscent', 'of', 'the', 'main', 'sequence', 'of', 'starforming', 'galaxies', 'there', 'are', 'striking', 'correlations', 'between', 'starforming', 'properties', 'ie', 'sfr', 'and', 'sfr', 'surface', 'density', 'and', 'nonaxisymmetric', 'bar', 'parameters', 'appearing', 'to', 'confirm', 'previous', 'inferences', 'that', 'strongly', 'barred', 'galaxies', 'tend', 'to', 'have', 'lower', 'ring', 'sfrs', 'although', 'the', 'ring', 'starformation', 'histories', 'turn', 'out', 'to', 'be', 'significantly', 'more', 'complicated', 'nuclear', 'rings', 'with', 'higher', 'stellar', 'masses', 'tend', 'to', 'be', 'associated', 'with', 'lower', 'cluster', 'mass', 'fractions', 'but', 'there', 'is', 'no', 'such', 'relation', 'with', 'the', 'ages', 'of', 'the', 'rings', 'the', 'two', 'youngest', 'nuclear', 'rings', 'in', 'our', 'sample', 'ngc', '1512', 'and', 'ngc', '4314', 'which', 'have', 'the', 'most', 'extreme', 'physical', 'properties', 'represent', 'the', 'young', 'extremity', 'of', 'the', 'nuclear', 'ring', 'age', 'distribution']] | [-0.059935136564004884, 0.10773899710090105, -0.08217653024279659, 0.12530108876844276, -0.07420057024578583, -0.04068641398096435, -0.02644990864032169, 0.47405038353609275, -0.15589503205828295, -0.3399203436995714, 0.051354649458473255, -0.25314247649421084, -0.003115731936432496, 0.1965459673677152, -0.025417481256877053, -0.04570513326868959, 0.017712826719021343, -0.055678232241960536, -0.06120988963654332, -0.3246881620978084, 0.33830767095530306, 0.0795077496319523, 0.13601201651505676, -0.07065245567822837, 0.00882706247189692, -0.12335641804454198, -0.08045925690706475, -0.02052786926017517, -0.21541611105045835, 0.044891656285486595, 0.2707817454010727, 0.1135393194237118, 0.19460313338047663, -0.3675771834378212, -0.16020295026910353, 0.10814256694197774, 0.2109988614183712, 0.02195803341446407, -0.12347565933691018, -0.24446192448846546, 0.05542109591604012, -0.22365607670368065, -0.17642056182715068, 0.053714938489832435, 0.08737665466986687, 0.10091347958009884, -0.20081780938783203, 0.20711949409579908, -0.02608995072367829, 0.10773427318781614, -0.12365080037689113, -0.12032221699410293, -0.10814382309275473, 0.11282812446602676, -0.010024909468659436, 0.07527020457153953, 0.27649535465215047, -0.16698724131032555, -0.004474485867159314, 0.3832697168770564, -0.024931400539316088, 0.0010336157528615284, 0.28951931693665983, -0.27318883348016976, -0.1510552397768301, 0.10552107263929174, 0.12603275601314493, 0.11317029381432686, -0.1628279759376553, 0.004198631846783571, -0.056271264390331734, 0.19889059202019949, 0.03105266897632445, 0.1449334629588451, 0.3450589948068476, 0.08282581814302947, 0.05305833412599881, 0.040280541377964926, -0.17391043753913943, -0.06991986386163766, -0.18048062836929005, -0.08766205406123137, -0.09300699162607391, 0.1086076724092405, -0.14847985727583474, -0.09264268288875081, 0.33857640695672137, 0.05903190260483737, 0.25420653222626205, 0.07939289151326226, 0.24927243464682475, 0.06554402579903139, 0.1968342333276528, 0.11403077551496615, 0.2540806136262345, 0.24757922529130724, 0.0006507129168107986, -0.29718823700369035, 0.06813880872639666, -0.009596776183559952] |
1,803.01502 | Strain Modulation of Graphene by Nanoscale Substrate Curvatures: A
Molecular View | Spatially nonuniform strain is important for engineering the pseudomagnetic
field and band structure of graphene. Despite the wide interest in strain
engineering, there is still a lack of control on device-compatible strain
patterns due to the limited understanding of the structure-strain relationship.
Here, we study the effect of substrate corrugation and curvature on the strain
profiles of graphene via combined experimental and theoretical studies of a
model system: graphene on closely packed SiO2 nanospheres with different
diameters (20-200 nm). Experimentally, via quantitative Raman analysis, we
observe partial adhesion and wrinkle features and find that smaller nanospheres
induce larger tensile strain in graphene, theoretically, molecular dynamics
simulations confirm the same microscopic structure and size dependence of
strain and reveal that a larger strain is caused by a stronger, inhomogeneous
interaction force between smaller nanospheres and graphene. This
molecular-level understanding of the strain mechanism is important for strain
engineering of graphene and other two-dimensional materials.
| cond-mat.mes-hall | spatially nonuniform strain is important for engineering the pseudomagnetic field and band structure of graphene despite the wide interest in strain engineering there is still a lack of control on devicecompatible strain patterns due to the limited understanding of the structurestrain relationship here we study the effect of substrate corrugation and curvature on the strain profiles of graphene via combined experimental and theoretical studies of a model system graphene on closely packed sio2 nanospheres with different diameters 20200 nm experimentally via quantitative raman analysis we observe partial adhesion and wrinkle features and find that smaller nanospheres induce larger tensile strain in graphene theoretically molecular dynamics simulations confirm the same microscopic structure and size dependence of strain and reveal that a larger strain is caused by a stronger inhomogeneous interaction force between smaller nanospheres and graphene this molecularlevel understanding of the strain mechanism is important for strain engineering of graphene and other twodimensional materials | [['spatially', 'nonuniform', 'strain', 'is', 'important', 'for', 'engineering', 'the', 'pseudomagnetic', 'field', 'and', 'band', 'structure', 'of', 'graphene', 'despite', 'the', 'wide', 'interest', 'in', 'strain', 'engineering', 'there', 'is', 'still', 'a', 'lack', 'of', 'control', 'on', 'devicecompatible', 'strain', 'patterns', 'due', 'to', 'the', 'limited', 'understanding', 'of', 'the', 'structurestrain', 'relationship', 'here', 'we', 'study', 'the', 'effect', 'of', 'substrate', 'corrugation', 'and', 'curvature', 'on', 'the', 'strain', 'profiles', 'of', 'graphene', 'via', 'combined', 'experimental', 'and', 'theoretical', 'studies', 'of', 'a', 'model', 'system', 'graphene', 'on', 'closely', 'packed', 'sio2', 'nanospheres', 'with', 'different', 'diameters', '20200', 'nm', 'experimentally', 'via', 'quantitative', 'raman', 'analysis', 'we', 'observe', 'partial', 'adhesion', 'and', 'wrinkle', 'features', 'and', 'find', 'that', 'smaller', 'nanospheres', 'induce', 'larger', 'tensile', 'strain', 'in', 'graphene', 'theoretically', 'molecular', 'dynamics', 'simulations', 'confirm', 'the', 'same', 'microscopic', 'structure', 'and', 'size', 'dependence', 'of', 'strain', 'and', 'reveal', 'that', 'a', 'larger', 'strain', 'is', 'caused', 'by', 'a', 'stronger', 'inhomogeneous', 'interaction', 'force', 'between', 'smaller', 'nanospheres', 'and', 'graphene', 'this', 'molecularlevel', 'understanding', 'of', 'the', 'strain', 'mechanism', 'is', 'important', 'for', 'strain', 'engineering', 'of', 'graphene', 'and', 'other', 'twodimensional', 'materials']] | [-0.1424661300414683, 0.1757928293219792, -0.04131335797970487, -0.005337976136759512, -0.022996402406868965, -0.13553915134214453, 0.037479290825247424, 0.4659773100069479, -0.29280952185294346, -0.3109119502386372, -0.0035653157836733093, -0.24230592393340836, -0.22623855537906484, 0.21421885376347696, 0.032154430785387954, 0.02317771107252491, 0.03529712855264446, -0.134214098317132, -0.03457521728092903, -0.15889984487469183, 0.25082974699877303, 0.07512384721495007, 0.4023311767500433, 0.15191574135066108, 0.013634931461542453, -0.002193269414802719, 0.05648935299617924, 0.05223469830142628, -0.21760673435317968, 0.1345179328763104, 0.19669628836020006, -0.1070124372306868, 0.26383216251729447, -0.5067303524058508, -0.2373158030110828, -0.011262409061217974, 0.09783518923512402, 0.16997627666416137, -0.06979309958957233, -0.25840816246866444, 0.08310670128680374, -0.07182780334627942, -0.09019720336456023, -0.04457545978795296, 0.05085361303874953, 0.005427000708694227, -0.2177470411077497, 0.11822195885715221, 0.030406864375292667, 0.1377446230602034, -0.1369458078805014, -0.10215211433196121, -0.10293217637196281, 0.05301840743432924, 0.07381013960280382, 0.02058906087691675, 0.25995718713583255, -0.12225051622111718, -0.06607515631415146, 0.409308954191051, -0.021693841036482666, -0.13117911243860267, 0.18972580884215667, -0.16509043511254468, -0.038196471826124345, 0.16608426062923268, 0.17949990925990278, 0.06565540404622688, -0.12224578914021167, 0.02681763685502933, 0.009696909447053545, 0.21874141773380534, 0.09888672585733921, 0.05243560809360229, 0.2345486229751259, 0.24766876078042274, 0.0575115207925831, 0.15043890629749512, -0.08522757456644046, -0.017983443048586577, -0.19856730469281933, -0.1362397578130568, -0.2140343586951004, 0.0867697289044085, -0.14008113059169677, -0.21046036315199576, 0.3928354418327983, 0.14768494906418614, 0.13697339114438173, -0.027313076400835263, 0.23265239433385432, 0.050546579311087136, 0.10716649811518819, -0.045058900260636095, 0.3041720065551712, 0.1965311222823067, 0.06881690056577913, -0.2567831514865439, 0.09163062678692911, -0.07341365296222073] |
1,803.01503 | A discrete-time dynamical system and an evolution algebra of mosquito
population | Recently, continuous-time dynamical systems, based on systems of ordinary
differential equations, for mosquito populations are studied. In this paper we
consider discrete-time dynamical system generated by an evolution quadratic
operator of mosquito population and show that this system has two fixed points,
which are saddle points (under some conditions on the parameters of the
system). We construct an evolution algebra taking its matrix of structural
constants equal to the Jacobian of the quadratic operator at a fixed point.
Idempotent and absolute nilpotent elements, simplicity properties and some
limit points of the evolution operator corresponding to the evolution algebra
are studied. We give some biological interpretations of our results.
| math.DS | recently continuoustime dynamical systems based on systems of ordinary differential equations for mosquito populations are studied in this paper we consider discretetime dynamical system generated by an evolution quadratic operator of mosquito population and show that this system has two fixed points which are saddle points under some conditions on the parameters of the system we construct an evolution algebra taking its matrix of structural constants equal to the jacobian of the quadratic operator at a fixed point idempotent and absolute nilpotent elements simplicity properties and some limit points of the evolution operator corresponding to the evolution algebra are studied we give some biological interpretations of our results | [['recently', 'continuoustime', 'dynamical', 'systems', 'based', 'on', 'systems', 'of', 'ordinary', 'differential', 'equations', 'for', 'mosquito', 'populations', 'are', 'studied', 'in', 'this', 'paper', 'we', 'consider', 'discretetime', 'dynamical', 'system', 'generated', 'by', 'an', 'evolution', 'quadratic', 'operator', 'of', 'mosquito', 'population', 'and', 'show', 'that', 'this', 'system', 'has', 'two', 'fixed', 'points', 'which', 'are', 'saddle', 'points', 'under', 'some', 'conditions', 'on', 'the', 'parameters', 'of', 'the', 'system', 'we', 'construct', 'an', 'evolution', 'algebra', 'taking', 'its', 'matrix', 'of', 'structural', 'constants', 'equal', 'to', 'the', 'jacobian', 'of', 'the', 'quadratic', 'operator', 'at', 'a', 'fixed', 'point', 'idempotent', 'and', 'absolute', 'nilpotent', 'elements', 'simplicity', 'properties', 'and', 'some', 'limit', 'points', 'of', 'the', 'evolution', 'operator', 'corresponding', 'to', 'the', 'evolution', 'algebra', 'are', 'studied', 'we', 'give', 'some', 'biological', 'interpretations', 'of', 'our', 'results']] | [-0.1728503844631767, 0.08243106787779618, -0.09218663955538499, 0.044524030283725924, -0.02764811178807307, -0.10010696995218664, 0.00696005740448729, 0.32999600369172793, -0.32613264331249175, -0.21355090856862566, 0.1546670683019329, -0.2892789580143505, -0.19557074399630506, 0.17300592603472373, -0.07716256020918351, 0.06320615003210993, 0.062457445607934564, 0.05863848817319161, -0.10398126955152731, -0.27982708968920633, 0.4128609807047286, -0.00315608196305456, 0.18449770190313253, -0.028223158578772133, 0.1728673108327375, 0.014849247020686528, 0.012374881146199725, -0.019276219381329913, -0.13325054353110857, 0.07249465160593563, 0.21554245637660777, 0.09486223642576348, 0.2624517561246951, -0.4168851478370251, -0.18064782521428746, 0.16314635163655988, 0.12353651789534423, 0.07716668645001913, -0.049161886833004514, -0.24682522524165473, 0.08936138835269958, -0.14805928845372465, -0.18224328573948392, -0.052548981041009364, 0.05576616203567634, 0.039692965146430115, -0.26022744932022224, 0.030047620668213953, 0.062187166226471566, 0.15370659592250982, -0.12543363016447984, -0.14474772208618727, -0.06304982317723679, 0.10852564527670404, 0.0007591534252882142, -0.07600220054801968, 0.14092520792123484, -0.07461212745315775, -0.12694129557348788, 0.3645012098261052, -0.035134490096458686, -0.22074679400840844, 0.1810389529176367, -0.15130815548494597, -0.14906417039067796, 0.08825100256837215, 0.1665391307108587, 0.1222110344355719, -0.19229343290337259, 0.15336298786321464, -0.053365312387338944, 0.10826943569985882, 0.00936227308557136, 0.04285660013987648, 0.16445441533276742, 0.1313451657899552, 0.06953683237683166, 0.10009987845680574, 0.03700249024270171, -0.15357202686438406, -0.29611374872426194, -0.12388724849680094, -0.12093767187454635, 0.06796560341414686, -0.11893675745320959, -0.1810807712307131, 0.4185215466034909, 0.1587665380599598, 0.20712092499835072, 0.07124499432177765, 0.2179974257521314, 0.21844930687802844, 0.0070516479813873215, 0.049597269450141875, 0.17965248930758443, 0.17989897643672992, 0.058711676496184535, -0.2555463480314723, 0.03479021754443507, 0.14519518169712414] |
1,803.01504 | Cross-Paced Representation Learning with Partial Curricula for
Sketch-based Image Retrieval | In this paper we address the problem of learning robust cross-domain
representations for sketch-based image retrieval (SBIR). While most SBIR
approaches focus on extracting low- and mid-level descriptors for direct
feature matching, recent works have shown the benefit of learning coupled
feature representations to describe data from two related sources. However,
cross-domain representation learning methods are typically cast into non-convex
minimization problems that are difficult to optimize, leading to unsatisfactory
performance. Inspired by self-paced learning, a learning methodology designed
to overcome convergence issues related to local optima by exploiting the
samples in a meaningful order (i.e. easy to hard), we introduce the cross-paced
partial curriculum learning (CPPCL) framework. Compared with existing
self-paced learning methods which only consider a single modality and cannot
deal with prior knowledge, CPPCL is specifically designed to assess the
learning pace by jointly handling data from dual sources and modality-specific
prior information provided in the form of partial curricula. Additionally,
thanks to the learned dictionaries, we demonstrate that the proposed CPPCL
embeds robust coupled representations for SBIR. Our approach is extensively
evaluated on four publicly available datasets (i.e. CUFS, Flickr15K, QueenMary
SBIR and TU-Berlin Extension datasets), showing superior performance over
competing SBIR methods.
| cs.CV | in this paper we address the problem of learning robust crossdomain representations for sketchbased image retrieval sbir while most sbir approaches focus on extracting low and midlevel descriptors for direct feature matching recent works have shown the benefit of learning coupled feature representations to describe data from two related sources however crossdomain representation learning methods are typically cast into nonconvex minimization problems that are difficult to optimize leading to unsatisfactory performance inspired by selfpaced learning a learning methodology designed to overcome convergence issues related to local optima by exploiting the samples in a meaningful order ie easy to hard we introduce the crosspaced partial curriculum learning cppcl framework compared with existing selfpaced learning methods which only consider a single modality and cannot deal with prior knowledge cppcl is specifically designed to assess the learning pace by jointly handling data from dual sources and modalityspecific prior information provided in the form of partial curricula additionally thanks to the learned dictionaries we demonstrate that the proposed cppcl embeds robust coupled representations for sbir our approach is extensively evaluated on four publicly available datasets ie cufs flickr15k queenmary sbir and tuberlin extension datasets showing superior performance over competing sbir methods | [['in', 'this', 'paper', 'we', 'address', 'the', 'problem', 'of', 'learning', 'robust', 'crossdomain', 'representations', 'for', 'sketchbased', 'image', 'retrieval', 'sbir', 'while', 'most', 'sbir', 'approaches', 'focus', 'on', 'extracting', 'low', 'and', 'midlevel', 'descriptors', 'for', 'direct', 'feature', 'matching', 'recent', 'works', 'have', 'shown', 'the', 'benefit', 'of', 'learning', 'coupled', 'feature', 'representations', 'to', 'describe', 'data', 'from', 'two', 'related', 'sources', 'however', 'crossdomain', 'representation', 'learning', 'methods', 'are', 'typically', 'cast', 'into', 'nonconvex', 'minimization', 'problems', 'that', 'are', 'difficult', 'to', 'optimize', 'leading', 'to', 'unsatisfactory', 'performance', 'inspired', 'by', 'selfpaced', 'learning', 'a', 'learning', 'methodology', 'designed', 'to', 'overcome', 'convergence', 'issues', 'related', 'to', 'local', 'optima', 'by', 'exploiting', 'the', 'samples', 'in', 'a', 'meaningful', 'order', 'ie', 'easy', 'to', 'hard', 'we', 'introduce', 'the', 'crosspaced', 'partial', 'curriculum', 'learning', 'cppcl', 'framework', 'compared', 'with', 'existing', 'selfpaced', 'learning', 'methods', 'which', 'only', 'consider', 'a', 'single', 'modality', 'and', 'can', 'not', 'deal', 'with', 'prior', 'knowledge', 'cppcl', 'is', 'specifically', 'designed', 'to', 'assess', 'the', 'learning', 'pace', 'by', 'jointly', 'handling', 'data', 'from', 'dual', 'sources', 'and', 'modalityspecific', 'prior', 'information', 'provided', 'in', 'the', 'form', 'of', 'partial', 'curricula', 'additionally', 'thanks', 'to', 'the', 'learned', 'dictionaries', 'we', 'demonstrate', 'that', 'the', 'proposed', 'cppcl', 'embeds', 'robust', 'coupled', 'representations', 'for', 'sbir', 'our', 'approach', 'is', 'extensively', 'evaluated', 'on', 'four', 'publicly', 'available', 'datasets', 'ie', 'cufs', 'flickr15k', 'queenmary', 'sbir', 'and', 'tuberlin', 'extension', 'datasets', 'showing', 'superior', 'performance', 'over', 'competing', 'sbir', 'methods']] | [0.016861188841703085, -0.04458379815571392, -0.07165619441761803, 0.08329620903465323, -0.15706383276862115, -0.19740922918232778, -0.0014292154311894988, 0.4614763819063321, -0.28727331479880003, -0.32079935113881497, 0.08994285755444509, -0.28616247117185056, -0.16549962950536073, 0.18250734553887293, -0.17118929987534498, 0.1080257583105077, 0.12634119883012504, 0.028365618199444352, -0.09896843428842915, -0.3128815341276678, 0.3317484936079918, 0.02313560597025431, 0.3808899458258962, 0.012979936611671478, 0.15498535722518006, -0.02405275786534334, -0.07959524252666877, -0.0007804002374028549, -0.05645597671578005, 0.21955962277268273, 0.4000505604900611, 0.22056289282269204, 0.3417033826132329, -0.39599566898451977, -0.23012906936212227, 0.095768799382047, 0.14726472810292857, 0.08392007585259703, -0.06508653125821207, -0.36053019693264593, 0.07914887839235747, -0.1474071023460382, 0.06234456536312325, -0.21373656321890078, -0.0788173383448082, -0.047988643476632065, -0.30270735536200494, 0.018663676417408844, 0.064768385887146, 0.04218899825205787, -0.06947280097072228, -0.13285462620835273, 0.0836461625002229, 0.12011164153376833, 0.05352491730382332, 0.0610107665684504, 0.10616265661083162, -0.18292406609592338, -0.16647473984003927, 0.36314810417497007, -0.03622414183814843, -0.21431676983737794, 0.2229508678190028, 0.0029517747246875213, -0.16792364210391847, 0.10260896332179889, 0.24022039699439818, 0.15005681938223112, -0.181314037897839, 0.04161716485649753, -0.007380644327554947, 0.17606164665522578, 0.036722707429614206, -0.013157621816469308, 0.15328817416269044, 0.22955238920373794, 0.03288015906627362, 0.1439951256586191, -0.07976881290953129, -0.086056822227935, -0.14836626041394013, -0.06179288358141023, -0.1975359432041072, -0.07772744384956941, -0.06379473047996632, -0.10957219880059338, 0.3759497849031901, 0.24796708756102584, 0.19973562858903254, 0.08946021743811285, 0.36056588284002666, 0.003115840219797041, 0.13047267102087157, 0.1065925119110407, 0.18083694568500877, 0.029287343924769605, 0.10246759288980124, -0.1731903369084765, 0.08225507569344094, 0.05828948465581888] |
1,803.01505 | On Chromatic Core Subgraph of Simple Graphs | If distinct colours represent distinct technology types that are placed at
the vertices of a simple graph in accordance to a minimum proper colouring, a
disaster recovery strategy could rely on an answer to the question: "What is
the maximum destruction, if any, the graph (a network) can undergo while
ensuring that at least one of each technology type remain, in accordance to a
minimum proper colouring of the remaining induced subgraph." In this paper, we
introduce the notion of a chromatic core subgraph $H$ of a given simple graph
$G$ in answer to the stated problem. Since for any subgraph $H$ of $G$ it holds
that $\chi(H) \leq \chi(G)$, the problem is well defined.
| math.GM | if distinct colours represent distinct technology types that are placed at the vertices of a simple graph in accordance to a minimum proper colouring a disaster recovery strategy could rely on an answer to the question what is the maximum destruction if any the graph a network can undergo while ensuring that at least one of each technology type remain in accordance to a minimum proper colouring of the remaining induced subgraph in this paper we introduce the notion of a chromatic core subgraph h of a given simple graph g in answer to the stated problem since for any subgraph h of g it holds that chih leq chig the problem is well defined | [['if', 'distinct', 'colours', 'represent', 'distinct', 'technology', 'types', 'that', 'are', 'placed', 'at', 'the', 'vertices', 'of', 'a', 'simple', 'graph', 'in', 'accordance', 'to', 'a', 'minimum', 'proper', 'colouring', 'a', 'disaster', 'recovery', 'strategy', 'could', 'rely', 'on', 'an', 'answer', 'to', 'the', 'question', 'what', 'is', 'the', 'maximum', 'destruction', 'if', 'any', 'the', 'graph', 'a', 'network', 'can', 'undergo', 'while', 'ensuring', 'that', 'at', 'least', 'one', 'of', 'each', 'technology', 'type', 'remain', 'in', 'accordance', 'to', 'a', 'minimum', 'proper', 'colouring', 'of', 'the', 'remaining', 'induced', 'subgraph', 'in', 'this', 'paper', 'we', 'introduce', 'the', 'notion', 'of', 'a', 'chromatic', 'core', 'subgraph', 'h', 'of', 'a', 'given', 'simple', 'graph', 'g', 'in', 'answer', 'to', 'the', 'stated', 'problem', 'since', 'for', 'any', 'subgraph', 'h', 'of', 'g', 'it', 'holds', 'that', 'chih', 'leq', 'chig', 'the', 'problem', 'is', 'well', 'defined']] | [-0.1739464769301855, 0.1124259071031069, -0.040688260830938815, 0.023162955151992324, -0.13890956457218398, -0.16093872306544496, 0.08013910480025832, 0.3995141930675701, -0.284320844369738, -0.32949762290910534, 0.07957412212601174, -0.2961699522626789, -0.12870146873933466, 0.09578134092178357, -0.17098490016777879, -0.02462959073321975, 0.11933471308919885, 0.10983463633481576, 0.046210075629389155, -0.25673417490476785, 0.28718309004021725, -0.03845696424579491, 0.1917997658819608, 0.09536418586402484, 0.09295511240311696, 0.010791205942792736, 0.02187211142205026, 0.09946987536108202, -0.17355570919785152, 0.05654426218547008, 0.2660834447197292, 0.20287586440453712, 0.30787365916792464, -0.3701901476668275, -0.18146748270677485, 0.24062460735035332, 0.11271096194142718, 0.047204632308010176, -0.0019214973228214227, -0.18423946436656558, 0.1653376054879197, -0.11637695988883143, -0.09728813783022697, 0.06052719372446123, 0.1053191895880129, -0.051617451312283624, -0.28143904829478783, -0.009082657576579115, 0.10484124767978716, 0.035996657209065946, 0.03907707774525751, -0.1234836887244297, -0.047053108554657386, 0.11122894727058061, -0.07250149788516232, 0.10864782945819847, 0.06484179009642937, -0.15350765282004747, -0.14923699045472819, 0.4201960650151191, -0.01872749530264865, -0.104590863066361, 0.12027751784771681, -0.13371140445056168, -0.20557090121361873, 0.0955535696576471, 0.10871271708899218, 0.135567452126871, -0.12229181296475555, 0.08228912592420111, -0.09962857550253039, 0.12680211743015957, 0.12202593116899547, 0.03284123188856503, 0.17989467323717215, 0.15499763449087092, 0.19188589806385015, 0.13007645806216675, 0.03654827564023435, 0.05672585838271872, -0.3252078534387376, -0.11151309452303078, -0.25553176829226965, 0.05183000811173216, -0.13023908967962083, -0.1985348013918037, 0.4032502840394559, 0.1275731214089319, 0.19522605150452127, 0.059554083313307034, 0.24132486158253058, 0.08092158009986515, 0.06351306259470141, 0.16517368410916433, 0.15222799773125545, 0.14655103938978004, -0.02263379928898876, -0.1838702930258992, 0.10889554962961247, 0.1162057860713938] |
1,803.01506 | Maximal perimeters of polytope sections and origin-symmetry | Let $P\subset\mathbb{R}^n$ $(n\geq 3)$ be a convex polytope containing the
origin in its interior. Let $\mbox{vol}_{n-2} \big( \mbox{relbd} ( P\cap\lbrace
t\xi + \xi^\perp \rbrace ) \big)$ denote the $(n-2)$-dimensional volume of the
relative boundary of $P\cap\lbrace t\xi + \xi^\perp \rbrace$ for
$t\in\mathbb{R}$, $\xi\in S^{n-1}$. We prove the following: if \begin{align*}
\mbox{vol}_{n-2} \Big( \mbox{relbd} \big( P\cap\xi^\perp \big) \Big)
= \max_{t\in\mathbb{R}} \mbox{vol}_{n-2} \Big( \mbox{relbd} \big(
P\cap\lbrace t\xi + \xi^\perp \rbrace \big) \Big)
\ \ \forall \ \ \xi\in S^{n-1}, \end{align*} then $P$ is origin-symmetric,
i.e. $P = -P$. Our result gives a partial affirmative answer to a conjecture by
Makai, Martini, and \'Odor. We also characterize the origin-symmetry of $C^1$
convex bodies in terms of the dual quermassintegrals of their sections; this
can be seen as a dual version of the conjecture of Makai et al.
| math.MG | let psubsetmathbbrn ngeq 3 be a convex polytope containing the origin in its interior let mboxvol_n2 big mboxrelbd pcaplbrace txi xiperp rbrace big denote the n2dimensional volume of the relative boundary of pcaplbrace txi xiperp rbrace for tinmathbbr xiin sn1 we prove the following if beginalign mboxvol_n2 big mboxrelbd big pcapxiperp big big max_tinmathbbr mboxvol_n2 big mboxrelbd big pcaplbrace txi xiperp rbrace big big forall xiin sn1 endalign then p is originsymmetric ie p p our result gives a partial affirmative answer to a conjecture by makai martini and odor we also characterize the originsymmetry of c1 convex bodies in terms of the dual quermassintegrals of their sections this can be seen as a dual version of the conjecture of makai et al | [['let', 'psubsetmathbbrn', 'ngeq', '3', 'be', 'a', 'convex', 'polytope', 'containing', 'the', 'origin', 'in', 'its', 'interior', 'let', 'mboxvol_n2', 'big', 'mboxrelbd', 'pcaplbrace', 'txi', 'xiperp', 'rbrace', 'big', 'denote', 'the', 'n2dimensional', 'volume', 'of', 'the', 'relative', 'boundary', 'of', 'pcaplbrace', 'txi', 'xiperp', 'rbrace', 'for', 'tinmathbbr', 'xiin', 'sn1', 'we', 'prove', 'the', 'following', 'if', 'beginalign', 'mboxvol_n2', 'big', 'mboxrelbd', 'big', 'pcapxiperp', 'big', 'big', 'max_tinmathbbr', 'mboxvol_n2', 'big', 'mboxrelbd', 'big', 'pcaplbrace', 'txi', 'xiperp', 'rbrace', 'big', 'big', 'forall', 'xiin', 'sn1', 'endalign', 'then', 'p', 'is', 'originsymmetric', 'ie', 'p', 'p', 'our', 'result', 'gives', 'a', 'partial', 'affirmative', 'answer', 'to', 'a', 'conjecture', 'by', 'makai', 'martini', 'and', 'odor', 'we', 'also', 'characterize', 'the', 'originsymmetry', 'of', 'c1', 'convex', 'bodies', 'in', 'terms', 'of', 'the', 'dual', 'quermassintegrals', 'of', 'their', 'sections', 'this', 'can', 'be', 'seen', 'as', 'a', 'dual', 'version', 'of', 'the', 'conjecture', 'of', 'makai', 'et', 'al']] | [-0.16153822068179793, 0.056498335708644896, -0.04312128323020742, 0.02434236359852953, -0.04018467157578268, -0.17335458266149675, -0.04640273378864557, 0.22488105478657394, -0.32928707939768287, -0.12501003273504496, 0.12021115256919518, -0.3815106338383082, -0.0837364444556106, 0.12193262123917582, -0.20240763379867432, -0.013500896991257939, 0.039003166338788864, 0.03729320889507115, -0.03292667338655902, -0.2900110807645471, 0.2987496463441047, -0.11246924715883591, 0.118184973556204, 0.11253447749284136, 0.0702865036877514, 0.0034977679078255883, 0.08862142824810468, -0.0025985228022983096, -0.27283967680790844, 0.09914955137172292, 0.2799875148368545, 0.2621404372934377, 0.30462683191006423, -0.35787181895883646, -0.09095758335477039, 0.25654334628547565, 0.17523052883843163, -0.10353919416822556, -0.012910630137213514, -0.295191990602918, 0.19118420373523184, -0.1010903065237647, -0.170198288577914, -0.012226330512594589, 0.1433567929574672, -0.018763123487098878, -0.33002600167729274, 0.05590375453138826, 0.10732812084656985, 0.059573646628947444, -0.052340746167538484, -0.15293438702493029, -0.023104476549847545, -0.013044439115318931, -0.021777763999133098, 0.17281233993977183, 0.0009685796255073627, 0.01245785949501295, -0.047681476220394634, 0.3623355485365859, -0.023613399263234622, -0.13580897533845454, 0.016136305657129327, -0.18419963022901387, -0.14544987466045411, 0.04427658682865161, 0.11372270632316084, 0.1567402804669525, -0.014491958876273461, 0.28582698411157575, -0.10632795329350478, 0.06834509621712793, 0.18565219074307682, -0.0706848995525296, 0.11467888450030894, 0.09916964252135753, 0.0745536887611286, 0.05794810878451397, -0.0215407795218473, 0.01577843590042781, -0.3130392012237219, -0.2403814567002554, -0.1434332782054367, 0.23367980398049876, -0.15624809659493621, -0.14467407786128397, 0.18838343671386076, 0.015905314582955687, 0.2336763303742564, 0.06988024363341201, 0.1887555035347698, 0.02250698791472476, -0.042464001728378296, 0.10716741975835141, 0.030728804824106833, 0.14263140739082603, 0.07990061155199504, -0.1554046385929364, 0.009492407130280963, 0.16413141907184942] |
1,803.01507 | On the Existence of Leapfrogging Pair of Circular Vortex Filaments | We propose and analyze a system of nonlinear partial differential equations
describing the motion of a pair of vortex filaments. Furthermore, for a pair of
coaxial circular vortex filaments, we derive a condition for leapfrogging to
occur and prove that the condition is necessary and sufficient for the
occurrence of leapfrogging.
| math.DS math.AP | we propose and analyze a system of nonlinear partial differential equations describing the motion of a pair of vortex filaments furthermore for a pair of coaxial circular vortex filaments we derive a condition for leapfrogging to occur and prove that the condition is necessary and sufficient for the occurrence of leapfrogging | [['we', 'propose', 'and', 'analyze', 'a', 'system', 'of', 'nonlinear', 'partial', 'differential', 'equations', 'describing', 'the', 'motion', 'of', 'a', 'pair', 'of', 'vortex', 'filaments', 'furthermore', 'for', 'a', 'pair', 'of', 'coaxial', 'circular', 'vortex', 'filaments', 'we', 'derive', 'a', 'condition', 'for', 'leapfrogging', 'to', 'occur', 'and', 'prove', 'that', 'the', 'condition', 'is', 'necessary', 'and', 'sufficient', 'for', 'the', 'occurrence', 'of', 'leapfrogging']] | [-0.24598134526362023, 0.09135231540045317, -0.05884059651882625, 0.0685925913367457, -0.07381455813004982, -0.12284776860592413, -0.007402871749089921, 0.3333637241420208, -0.23969280456338882, -0.24056782869293408, 0.09396042687562751, -0.18322667716911026, -0.14461862909443238, 0.16974822545478888, 0.00631352269328108, 0.05732077294412781, 0.07351436029535298, 0.04739734037852317, -0.0398887901557792, -0.16119735708058464, 0.36853038578056824, -0.0587862013820924, 0.2510162708075607, 0.061090646932522454, 0.2244599639785056, -0.01104486495822522, -0.0014618899965403126, 0.04211041283812009, -0.22068714161073064, 0.0859385948701232, 0.14317367105361292, 0.07632034916120271, 0.2197235342042119, -0.48241564386761654, -0.1271963812520399, 0.08824225282296538, 0.163809374449592, 0.16525088306333796, -0.02232909241380791, -0.25197343194090266, 0.15092057962993197, -0.12321286871298856, -0.21179017575238557, -0.04609046423552083, 0.07631299137046524, 0.09643183929809168, -0.35008042349534874, 0.10375772643030859, 0.14584639838294072, 0.037960366507439745, -0.06622025690169311, 0.03955247332844153, -0.04545496672611026, 0.05621876823259335, -0.02953219602761023, -0.054825639854386155, 0.10494606337491788, -0.15565509557285728, -0.08322488366827077, 0.39194735081172455, -0.04739266096650824, -0.194735571595968, 0.13557484724065838, -0.1284058389308698, -0.09836901088847834, 0.13656562543017606, 0.19168630614876747, 0.13582854867711955, -0.15601239848297602, -0.034275106358679704, -0.10494832129345513, 0.10588264720989209, 0.12213345016261526, 0.008645054473377326, 0.2333734840081603, 0.15601940761667257, 0.11704321671277285, 0.20561381034991322, -0.13790078607260012, -0.08865375502272417, -0.3654615984973954, -0.21785113867372274, -0.06974980863286, 0.002933511127005605, -0.0026915107608896077, -0.21147032640874386, 0.36442085406651686, 0.08676114598033476, 0.22265267838591563, 0.03538197067146208, 0.24127432338747323, 0.15491189776038677, 0.004872950451338992, 0.04001799571857441, 0.20034247304440714, 0.20952533178177535, 0.11244598655577968, -0.2565055466987485, -0.0006013295211482281, 0.10895688147923234] |
1,803.01508 | Production of open-charm mesons in relativistic heavy-ion collisions | We present a theoretical framework to study open charm production in
relativistic heavy-ion collisions. The coupling strength between the charm
quarks and the QGP constituents, quantified by the spatial diffusion
coefficient $2\pi TD_{s}$, is obtained by performing a phenomenological fit
analysis to the lattice QCD calculations, resulting in $2\pi TD_{s}=const.$
(\textbf{Model-A}) and $2\pi TD_{s}=1.3 + (T/T_{c})^2$ (\textbf{Model-B}). We
find that the relative azimuthal distribution of the initially back-to-back
generated $c\bar{c}$ pairs presents a broadening behaviour, which is more
pronounced for $c\bar{c}$ pairs with small initial $p_{\rm T}$, and when the
Model-B approach is adopted. The competition between the initial drag and the
subsequent collective effects tends to restrict the time dependence of charm
quark $R_{\rm AA}$. Concerning the theoretical uncertainty on final D-meson
nuclear modification, the nuclear shadowing and pp baseline components are
dominat at high and low $p_{\rm T}$ ($p_{\rm T}\lesssim3~{\rm GeV/{\it c}}$),
respectively. The measured D-meson $R_{\rm AA}(p_{\rm T})$ favors Model-A
assumption for the diffusion coefficient both at RHIC and LHC, while their
$v_{2}(p_{\rm T})$ prefer Model-B at moderate $p_{\rm T}$. These results
confirm the necessity to consider the temperature- and/or momentum-dependence
of $2\pi TD_{s}$ to describe well the D-meson $R_{\rm AA}$ and $v_{\rm 2}$
simultaneously.
| hep-ph nucl-th | we present a theoretical framework to study open charm production in relativistic heavyion collisions the coupling strength between the charm quarks and the qgp constituents quantified by the spatial diffusion coefficient 2pi td_s is obtained by performing a phenomenological fit analysis to the lattice qcd calculations resulting in 2pi td_sconst textbfmodela and 2pi td_s13 tt_c2 textbfmodelb we find that the relative azimuthal distribution of the initially backtoback generated cbarc pairs presents a broadening behaviour which is more pronounced for cbarc pairs with small initial p_rm t and when the modelb approach is adopted the competition between the initial drag and the subsequent collective effects tends to restrict the time dependence of charm quark r_rm aa concerning the theoretical uncertainty on final dmeson nuclear modification the nuclear shadowing and pp baseline components are dominat at high and low p_rm t p_rm tlesssim3rm gevit c respectively the measured dmeson r_rm aap_rm t favors modela assumption for the diffusion coefficient both at rhic and lhc while their v_2p_rm t prefer modelb at moderate p_rm t these results confirm the necessity to consider the temperature andor momentumdependence of 2pi td_s to describe well the dmeson r_rm aa and v_rm 2 simultaneously | [['we', 'present', 'a', 'theoretical', 'framework', 'to', 'study', 'open', 'charm', 'production', 'in', 'relativistic', 'heavyion', 'collisions', 'the', 'coupling', 'strength', 'between', 'the', 'charm', 'quarks', 'and', 'the', 'qgp', 'constituents', 'quantified', 'by', 'the', 'spatial', 'diffusion', 'coefficient', '2pi', 'td_s', 'is', 'obtained', 'by', 'performing', 'a', 'phenomenological', 'fit', 'analysis', 'to', 'the', 'lattice', 'qcd', 'calculations', 'resulting', 'in', '2pi', 'td_sconst', 'textbfmodela', 'and', '2pi', 'td_s13', 'tt_c2', 'textbfmodelb', 'we', 'find', 'that', 'the', 'relative', 'azimuthal', 'distribution', 'of', 'the', 'initially', 'backtoback', 'generated', 'cbarc', 'pairs', 'presents', 'a', 'broadening', 'behaviour', 'which', 'is', 'more', 'pronounced', 'for', 'cbarc', 'pairs', 'with', 'small', 'initial', 'p_rm', 't', 'and', 'when', 'the', 'modelb', 'approach', 'is', 'adopted', 'the', 'competition', 'between', 'the', 'initial', 'drag', 'and', 'the', 'subsequent', 'collective', 'effects', 'tends', 'to', 'restrict', 'the', 'time', 'dependence', 'of', 'charm', 'quark', 'r_rm', 'aa', 'concerning', 'the', 'theoretical', 'uncertainty', 'on', 'final', 'dmeson', 'nuclear', 'modification', 'the', 'nuclear', 'shadowing', 'and', 'pp', 'baseline', 'components', 'are', 'dominat', 'at', 'high', 'and', 'low', 'p_rm', 't', 'p_rm', 'tlesssim3rm', 'gevit', 'c', 'respectively', 'the', 'measured', 'dmeson', 'r_rm', 'aap_rm', 't', 'favors', 'modela', 'assumption', 'for', 'the', 'diffusion', 'coefficient', 'both', 'at', 'rhic', 'and', 'lhc', 'while', 'their', 'v_2p_rm', 't', 'prefer', 'modelb', 'at', 'moderate', 'p_rm', 't', 'these', 'results', 'confirm', 'the', 'necessity', 'to', 'consider', 'the', 'temperature', 'andor', 'momentumdependence', 'of', '2pi', 'td_s', 'to', 'describe', 'well', 'the', 'dmeson', 'r_rm', 'aa', 'and', 'v_rm', '2', 'simultaneously']] | [-0.10115876371901561, 0.24400327624314275, -0.12463247530035558, 0.0987068174683601, 0.0009465367138307756, -0.141654953992004, 0.013862062571082674, 0.34592847061265475, -0.22239193177894148, -0.2580569784025325, -0.064865953944799, -0.35339420178602815, 0.07236247388304684, 0.11501054002425551, 0.0736943701189499, 0.06748297877020949, 0.09972976233946715, -0.000617391020254627, -0.08530313895097373, -0.18237617864097952, 0.27631651974741506, 0.054614269927982725, 0.21919583648452975, 0.19034490252220856, 0.02751120674077675, 0.0637264064810585, -0.03625243192834838, 0.01211781794917209, -0.16639920687492654, -0.004170880017708256, 0.21650115584348772, 0.014163939988713575, 0.16006809132202915, -0.3148187101764985, -0.12034206951560614, 0.06256861544423858, 0.12901462536641636, 0.07624952701659123, 0.004605165307506973, -0.233486435561397, 0.10417521239931242, -0.21550548887514162, -0.14062248542843903, -0.08596173928397176, 0.0862163115086775, -0.015867036383620987, -0.3239573045482576, 0.16808777397586258, 0.0033452726923205393, 0.08705635772769173, -0.004514795669515408, -0.21657134600578568, -0.07555565455591999, 0.01783405223825376, 0.08736569422397139, 0.132079538137101, 0.1690948570308066, -0.1340926573934833, -0.09002049855097972, 0.4008605156266935, -0.0651732989908708, -0.11810042076873355, 0.15901087500467037, -0.2192317636790856, -0.0942199050877926, 0.12008669137398845, 0.20066937134254978, 0.09030512220309121, -0.1435224939914358, 0.0571489696019434, 0.017558278767050718, 0.17887665458689128, 0.079712435350807, 0.04360674080836309, 0.15089008051424205, 0.1526856996364043, -0.03259593830965807, 0.04820906878168651, -0.12520883694968885, -0.08589891127691024, -0.3666085952488189, -0.05540343878378711, -0.07187712093186199, 0.06508361101601545, -0.1258404534840371, -0.05367574410961638, 0.3494321323628903, 0.08032513273933523, 0.29846621749932384, 0.0063829268920064675, 0.28968592561020745, 0.09057774595033709, 0.032842557025824656, 0.1406438904790042, 0.25729003000799666, 0.17513992341176768, 0.19105917469266784, -0.3467218704126697, 0.07474862423564517, 0.04751405789863065] |
1,803.01509 | Compactness and generic finiteness for free boundary minimal
hypersurfaces (I) | Given a compact Riemannian manifold with boundary, we prove that the space of
embedded, which may be improper, free boundary minimal hypersurfaces with
uniform area and Morse index upper bound is compact in the sense of smoothly
graphical convergence away from finitely many points. We show that the limit of
a sequence of such hypersurfaces always inherits a non-trivial Jacobi field
when it has multiplicity one. In a forthcoming paper, we will construct Jacobi
fields when the convergence has higher multiplicity.
| math.DG | given a compact riemannian manifold with boundary we prove that the space of embedded which may be improper free boundary minimal hypersurfaces with uniform area and morse index upper bound is compact in the sense of smoothly graphical convergence away from finitely many points we show that the limit of a sequence of such hypersurfaces always inherits a nontrivial jacobi field when it has multiplicity one in a forthcoming paper we will construct jacobi fields when the convergence has higher multiplicity | [['given', 'a', 'compact', 'riemannian', 'manifold', 'with', 'boundary', 'we', 'prove', 'that', 'the', 'space', 'of', 'embedded', 'which', 'may', 'be', 'improper', 'free', 'boundary', 'minimal', 'hypersurfaces', 'with', 'uniform', 'area', 'and', 'morse', 'index', 'upper', 'bound', 'is', 'compact', 'in', 'the', 'sense', 'of', 'smoothly', 'graphical', 'convergence', 'away', 'from', 'finitely', 'many', 'points', 'we', 'show', 'that', 'the', 'limit', 'of', 'a', 'sequence', 'of', 'such', 'hypersurfaces', 'always', 'inherits', 'a', 'nontrivial', 'jacobi', 'field', 'when', 'it', 'has', 'multiplicity', 'one', 'in', 'a', 'forthcoming', 'paper', 'we', 'will', 'construct', 'jacobi', 'fields', 'when', 'the', 'convergence', 'has', 'higher', 'multiplicity']] | [-0.18149249099286985, 0.10875667871930349, -0.13213307117859338, 0.061532057506998104, -0.08574170437583953, -0.12920767926599508, -0.03505940136016795, 0.3692188559985363, -0.2632883846023936, -0.2363022197480601, 0.13584844654506464, -0.2553722278824375, -0.14130467932418356, 0.1991017627943721, -0.16486595759605183, 0.02172197617251242, 0.11702568314245178, 0.13964634701425646, -0.10062289874379833, -0.2540898099886598, 0.41421348780945494, -0.030213600139559052, 0.2117169995067848, 0.054771375135277155, 0.08992592496567486, -0.015146851884546104, 0.0552936885850849, 0.053741196900200856, -0.16227471040375674, 0.13992737419903278, 0.2586544160443692, 0.08455406211856982, 0.2561504158829511, -0.3462100999665527, -0.21604175570156472, 0.21028079390295862, 0.1848504237347731, 0.029649992339761445, -0.057514158613623384, -0.2575924191508948, 0.13797040318748283, -0.10580461446259079, -0.2121308441331357, -0.06976770268132289, -0.0014004166062668334, 0.04082383344202866, -0.2484532554007285, -0.0005263041152998254, 0.11844329084240958, 0.07240914244939183, -0.05010435068519947, -0.09167163191294228, -0.07362310529721004, 0.07902067518910899, 0.05781125446011163, 0.09423019403568757, 0.08647596211759029, -0.06909112989281614, -0.07513156056225898, 0.316133493879511, -0.09346654883551377, -0.2793208005389682, 0.1640723416995671, -0.19518652966498962, -0.1698929084016493, 0.15581358182761404, 0.13432639641802252, 0.12933350685569975, -0.08064692035887999, 0.2130658971138563, -0.08117387277924996, 0.10689674120074437, 0.11320848590521901, 0.011082673019925018, 0.17348363045832993, 0.09787049986721005, 0.19474094144261248, 0.14367309481014762, -0.046492048619705954, -0.07578344624719502, -0.34840750846045987, -0.21521972835331257, -0.1941972741121311, 0.12563393490365993, -0.1610292032773155, -0.24116781580430402, 0.3538040763836492, 0.03720387403226607, 0.17722476518103553, 0.10570121804154535, 0.24086450033729184, 0.12322002908582856, 0.012873390666496606, 0.16390558458105833, 0.19168777500543696, 0.1557995645087902, 0.030074505928765843, -0.07312523838374074, -0.04037691462486063, 0.12333369004413669] |
1,803.0151 | SED constraints on the highest-$z$ blazar jet: QSO J0906+6930 | We report on Gemini, NuSTAR and 8-year Fermi observations of the most distant
blazar QSO~J0906$+$6930 ($z=5.48$). We construct a broadband spectral energy
distribution (SED) and model the SED using a synchro-Compton model. The
measurements find a $\sim 4 \times 10^9 M_\odot$ mass for the black hole and a
spectral break at $\sim$4 keV in the combined fit of the new NuSTAR and
archival Chandra data. The SED fitting constrains the bulk Doppler factor
$\delta$ of the jet to $9^{+2.5}_{-3}$ for QSO~J0906$+$6930. Similar, but
weaker $\delta$ constraints are derived from SED modeling of the three other
claimed $z>5$ blazars. Together, these extrapolate to $\sim620$ similar
sources, fully 20\% of the optically bright, high mass AGN expected at
$5<z<5.5$. This has interesting implications for the early growth of massive
black holes.
| astro-ph.HE | we report on gemini nustar and 8year fermi observations of the most distant blazar qsoj09066930 z548 we construct a broadband spectral energy distribution sed and model the sed using a synchrocompton model the measurements find a sim 4 times 109 m_odot mass for the black hole and a spectral break at sim4 kev in the combined fit of the new nustar and archival chandra data the sed fitting constrains the bulk doppler factor delta of the jet to 925_3 for qsoj09066930 similar but weaker delta constraints are derived from sed modeling of the three other claimed z5 blazars together these extrapolate to sim620 similar sources fully 20 of the optically bright high mass agn expected at 5z55 this has interesting implications for the early growth of massive black holes | [['we', 'report', 'on', 'gemini', 'nustar', 'and', '8year', 'fermi', 'observations', 'of', 'the', 'most', 'distant', 'blazar', 'qsoj09066930', 'z548', 'we', 'construct', 'a', 'broadband', 'spectral', 'energy', 'distribution', 'sed', 'and', 'model', 'the', 'sed', 'using', 'a', 'synchrocompton', 'model', 'the', 'measurements', 'find', 'a', 'sim', '4', 'times', '109', 'm_odot', 'mass', 'for', 'the', 'black', 'hole', 'and', 'a', 'spectral', 'break', 'at', 'sim4', 'kev', 'in', 'the', 'combined', 'fit', 'of', 'the', 'new', 'nustar', 'and', 'archival', 'chandra', 'data', 'the', 'sed', 'fitting', 'constrains', 'the', 'bulk', 'doppler', 'factor', 'delta', 'of', 'the', 'jet', 'to', '925_3', 'for', 'qsoj09066930', 'similar', 'but', 'weaker', 'delta', 'constraints', 'are', 'derived', 'from', 'sed', 'modeling', 'of', 'the', 'three', 'other', 'claimed', 'z5', 'blazars', 'together', 'these', 'extrapolate', 'to', 'sim620', 'similar', 'sources', 'fully', '20', 'of', 'the', 'optically', 'bright', 'high', 'mass', 'agn', 'expected', 'at', '5z55', 'this', 'has', 'interesting', 'implications', 'for', 'the', 'early', 'growth', 'of', 'massive', 'black', 'holes']] | [-0.027417780649322536, 0.07817601723476283, -0.08482057187751296, 0.16539158802310516, -0.09674762431231718, -0.12609253260081693, 0.05213822415398975, 0.42385589508264654, -0.11478707784572767, -0.40547519633846896, 0.05987796679631086, -0.33261694442931444, 0.05924524570206901, 0.212976194972608, -0.00884170990602504, 0.009163636226965595, 0.052127753836928956, -0.12354240626014108, -0.08344164722779344, -0.20393006448003073, 0.2891590683195259, 0.12511036095149333, 0.19246395511624043, -0.017644702239082224, 0.07928719719770484, -0.061508687697501195, -0.07658879591819583, -0.0631395899840901, -0.16592826312332745, 0.06287273313970335, 0.18864519701098964, 0.099851585738267, 0.1759952411859206, -0.31706963245186115, -0.25179300637495133, 0.04822852297671019, 0.17199022384856136, 0.0037922760736452594, -0.01914463360745069, -0.25013741443774873, 0.038146439759481336, -0.23105558374476048, -0.16792960152886208, 0.05471301719080657, 0.008548949447069918, -0.005405363312738407, -0.21780159806967864, 0.14788612331857062, -0.022512056873951695, 0.036787930361536, -0.183668595457059, -0.10161656664023476, -0.07167015366271258, 0.04574600136989067, 0.05276600202553034, 0.07298637060410974, 0.14436462570466252, -0.1329503760789521, -0.0621964204408634, 0.36610095377921337, -0.05527864896594697, 0.058841836143044696, 0.18643297538660736, -0.2284528707274266, -0.24424505619437345, 0.17418639983741507, 0.14504194114734645, 0.11821255622424125, -0.1633673546114756, 0.021430519422621377, -0.01537914760223019, 0.26532086481212547, 0.017686801305371185, 0.07329632733918486, 0.33049841584908146, 0.11270993004643148, 8.978221129866378e-05, 0.09149735981284926, -0.25446563591192956, 0.03766820910236528, -0.26182171080126276, -0.05235852984215824, -0.1638253181571922, 0.15168355086878424, -0.1877043186231599, -0.0775560902449445, 0.4030330667963191, 0.09766037083459049, 0.2518251913509542, 0.06963899226919297, 0.2901488827151444, 0.1063283248644908, 0.07102481954010023, 0.1405923136588817, 0.3595637414273956, 0.10777223758932744, 0.10514366526847645, -0.20764445570380158, -0.02114657237337181, -0.030529743349630264] |
1,803.01511 | Science Objectives of the Ganymede Laser Altimeter (GALA) for the JUICE
Mission | Laser altimetry is a powerful tool for addressing the major objectives of
planetary physics and geodesy, and have been applied in planetary explorations
of the Moon, Mars, Mercury, and the asteroids Eros, and Itokawa. The JUpiter
Icy Moons Explorer (JUICE), led by European Space Agency (ESA), has started
development to explore the emergence of habitable worlds around gas giants. The
Ganymede Laser Altimeter (GALA) will be the first laser altimeter for icy
bodies, and will measure the shape and topography of the large icy moons of
Jupiter, (globally for Ganymede, and using flyby ground-tracks for Europa and
Callisto). Such information is crucial for understanding the formation of
surface features and can tremendously improve our understanding of the icy
tectonics. In addition, the GALA will infer the presence or absence of a
subsurface ocean by measuring the tidal and rotational responses. Furthermore,
it also improves the accuracy of gravity field measurements reflecting the
interior structure, collaborating with the radio science experiment. In
addition to range measurements, the signal strength and the waveform of the
laser pulses reflected from the moon's surface contain information about
surface reflectance at the laser wavelength and small scale roughness.
Therefore we can infer the degrees of chemical and physical alterations, e.g.,
erosion, space weathering, compaction and deposition of exogenous materials,
through GALA measurements without being affected by illumination conditions.
JUICE spacecraft carries ten science payloads including GALA. They work closely
together in a synergistic way with GALA being one of the key instruments for
understanding the evolution of the icy satellites Ganymede, Europa, and
Callisto.
| astro-ph.EP | laser altimetry is a powerful tool for addressing the major objectives of planetary physics and geodesy and have been applied in planetary explorations of the moon mars mercury and the asteroids eros and itokawa the jupiter icy moons explorer juice led by european space agency esa has started development to explore the emergence of habitable worlds around gas giants the ganymede laser altimeter gala will be the first laser altimeter for icy bodies and will measure the shape and topography of the large icy moons of jupiter globally for ganymede and using flyby groundtracks for europa and callisto such information is crucial for understanding the formation of surface features and can tremendously improve our understanding of the icy tectonics in addition the gala will infer the presence or absence of a subsurface ocean by measuring the tidal and rotational responses furthermore it also improves the accuracy of gravity field measurements reflecting the interior structure collaborating with the radio science experiment in addition to range measurements the signal strength and the waveform of the laser pulses reflected from the moons surface contain information about surface reflectance at the laser wavelength and small scale roughness therefore we can infer the degrees of chemical and physical alterations eg erosion space weathering compaction and deposition of exogenous materials through gala measurements without being affected by illumination conditions juice spacecraft carries ten science payloads including gala they work closely together in a synergistic way with gala being one of the key instruments for understanding the evolution of the icy satellites ganymede europa and callisto | [['laser', 'altimetry', 'is', 'a', 'powerful', 'tool', 'for', 'addressing', 'the', 'major', 'objectives', 'of', 'planetary', 'physics', 'and', 'geodesy', 'and', 'have', 'been', 'applied', 'in', 'planetary', 'explorations', 'of', 'the', 'moon', 'mars', 'mercury', 'and', 'the', 'asteroids', 'eros', 'and', 'itokawa', 'the', 'jupiter', 'icy', 'moons', 'explorer', 'juice', 'led', 'by', 'european', 'space', 'agency', 'esa', 'has', 'started', 'development', 'to', 'explore', 'the', 'emergence', 'of', 'habitable', 'worlds', 'around', 'gas', 'giants', 'the', 'ganymede', 'laser', 'altimeter', 'gala', 'will', 'be', 'the', 'first', 'laser', 'altimeter', 'for', 'icy', 'bodies', 'and', 'will', 'measure', 'the', 'shape', 'and', 'topography', 'of', 'the', 'large', 'icy', 'moons', 'of', 'jupiter', 'globally', 'for', 'ganymede', 'and', 'using', 'flyby', 'groundtracks', 'for', 'europa', 'and', 'callisto', 'such', 'information', 'is', 'crucial', 'for', 'understanding', 'the', 'formation', 'of', 'surface', 'features', 'and', 'can', 'tremendously', 'improve', 'our', 'understanding', 'of', 'the', 'icy', 'tectonics', 'in', 'addition', 'the', 'gala', 'will', 'infer', 'the', 'presence', 'or', 'absence', 'of', 'a', 'subsurface', 'ocean', 'by', 'measuring', 'the', 'tidal', 'and', 'rotational', 'responses', 'furthermore', 'it', 'also', 'improves', 'the', 'accuracy', 'of', 'gravity', 'field', 'measurements', 'reflecting', 'the', 'interior', 'structure', 'collaborating', 'with', 'the', 'radio', 'science', 'experiment', 'in', 'addition', 'to', 'range', 'measurements', 'the', 'signal', 'strength', 'and', 'the', 'waveform', 'of', 'the', 'laser', 'pulses', 'reflected', 'from', 'the', 'moons', 'surface', 'contain', 'information', 'about', 'surface', 'reflectance', 'at', 'the', 'laser', 'wavelength', 'and', 'small', 'scale', 'roughness', 'therefore', 'we', 'can', 'infer', 'the', 'degrees', 'of', 'chemical', 'and', 'physical', 'alterations', 'eg', 'erosion', 'space', 'weathering', 'compaction', 'and', 'deposition', 'of', 'exogenous', 'materials', 'through', 'gala', 'measurements', 'without', 'being', 'affected', 'by', 'illumination', 'conditions', 'juice', 'spacecraft', 'carries', 'ten', 'science', 'payloads', 'including', 'gala', 'they', 'work', 'closely', 'together', 'in', 'a', 'synergistic', 'way', 'with', 'gala', 'being', 'one', 'of', 'the', 'key', 'instruments', 'for', 'understanding', 'the', 'evolution', 'of', 'the', 'icy', 'satellites', 'ganymede', 'europa', 'and', 'callisto']] | [-0.08051192524591136, 0.20833282250470606, -0.0958188912237777, 0.04915129031504093, -0.09246127772264096, -0.02874612075713456, 0.005102834835749611, 0.31432847799408403, -0.21401659014649227, -0.38544436477399036, 0.13052753395899092, -0.28615997226316797, -0.14603074921327536, 0.23250493359690633, -0.13022489271978596, 0.04791585386680194, 0.12052086441120667, -0.09287448815167557, 0.0097862051230451, -0.21548199432030277, 0.2475324101229884, 0.1490561480511182, 0.1312336115556401, 0.022624231023035308, 0.0862744803266968, -0.027373108131605265, -0.03773513047770027, -0.0712674798179046, -0.18008334246823246, 0.10585765570290243, 0.25730703693233403, 0.14156087955988786, 0.20763994406912362, -0.4882897276741763, -0.2734963820747266, 0.028835588220557443, 0.06806609947648389, 0.03657814641410932, -0.04768653751067572, -0.32165542992225366, -0.008593252878058557, -0.17443986150053467, -0.17814799281588012, -0.010272875014880254, 0.07231797879722417, 0.014635705082476962, -0.2311722429973694, -0.01298166438813101, 0.06302168275962418, 0.1494085091750982, -0.15859987735639997, -0.11462069686155679, -0.11556548488961692, 0.1565270900831002, 0.0523073000106022, 0.02327062779055663, 0.24444140954206647, -0.09207587017742701, -0.02219719033554745, 0.4440446980748788, -0.0939625279854734, -0.0512282877344667, 0.2427803042214797, -0.23074324720705203, -0.08271195641682708, 0.14724530311582915, 0.19581643317811653, 0.08145458728540689, -0.1463724524434746, 0.03058118238082235, 0.015395452171860105, 0.17980441933338956, 0.16400193192548473, 0.060353374065806036, 0.3485056066853103, 0.20005306283096863, 0.10611681064659398, 0.04553936788714816, -0.21838129761849004, -0.027234455637359458, -0.1595045668650563, -0.17057452589100183, -0.14435224391541682, -0.0032893481236600944, -0.07439874067399227, -0.08404828437671467, 0.34122569857189133, 0.14823770811672993, 0.0901549696261713, -0.054998643238768845, 0.3259223581963154, -0.02707218422178565, 0.10444792142172178, 0.055560084626569535, 0.30627560579802754, 0.08235824515013378, 0.12325745582122125, -0.2401761295275705, 0.15431383093133164, -0.0016231086649282208] |
1,803.01512 | Quasiparticle energy spectra of isolated atoms from coupled-cluster
singles and doubles (CCSD): Comparison with exact CI calculations | In this study, we have calculated single-electron energy spectra via the
Green's function based on the coupled-cluster singles and doubles (GFCCSD)
method for isolated atoms from H to Ne. In order to check the accuracy of the
GFCCSD method, we compared the results with the exact ones calculated from the
full-configuration interaction (FCI). Consequently, we have found that the
GFCCSD method reproduces not only the correct quasiparticle peaks but also
satellite ones by comparing the exact spectra with the 6-31G basis set. It is
also found that open-shell atoms such as C atom exhibit Mott gaps at the Fermi
level, which the exact density-functional theory (DFT) fails to describe. The
GFCCSD successfully reproduces the Mott HOMO-LUMO (highest-occupied molecular
orbital and lowest-unoccupied molecular orbital) gaps even quantitatively. We
also discussed the origin of satellite peaks as shake-up effects by checking
the components of wave function of the satellite peaks. The GFCCSD is a novel
cutting edge to investigate the electronic states in detail.
| cond-mat.mtrl-sci cond-mat.str-el | in this study we have calculated singleelectron energy spectra via the greens function based on the coupledcluster singles and doubles gfccsd method for isolated atoms from h to ne in order to check the accuracy of the gfccsd method we compared the results with the exact ones calculated from the fullconfiguration interaction fci consequently we have found that the gfccsd method reproduces not only the correct quasiparticle peaks but also satellite ones by comparing the exact spectra with the 631g basis set it is also found that openshell atoms such as c atom exhibit mott gaps at the fermi level which the exact densityfunctional theory dft fails to describe the gfccsd successfully reproduces the mott homolumo highestoccupied molecular orbital and lowestunoccupied molecular orbital gaps even quantitatively we also discussed the origin of satellite peaks as shakeup effects by checking the components of wave function of the satellite peaks the gfccsd is a novel cutting edge to investigate the electronic states in detail | [['in', 'this', 'study', 'we', 'have', 'calculated', 'singleelectron', 'energy', 'spectra', 'via', 'the', 'greens', 'function', 'based', 'on', 'the', 'coupledcluster', 'singles', 'and', 'doubles', 'gfccsd', 'method', 'for', 'isolated', 'atoms', 'from', 'h', 'to', 'ne', 'in', 'order', 'to', 'check', 'the', 'accuracy', 'of', 'the', 'gfccsd', 'method', 'we', 'compared', 'the', 'results', 'with', 'the', 'exact', 'ones', 'calculated', 'from', 'the', 'fullconfiguration', 'interaction', 'fci', 'consequently', 'we', 'have', 'found', 'that', 'the', 'gfccsd', 'method', 'reproduces', 'not', 'only', 'the', 'correct', 'quasiparticle', 'peaks', 'but', 'also', 'satellite', 'ones', 'by', 'comparing', 'the', 'exact', 'spectra', 'with', 'the', '631g', 'basis', 'set', 'it', 'is', 'also', 'found', 'that', 'openshell', 'atoms', 'such', 'as', 'c', 'atom', 'exhibit', 'mott', 'gaps', 'at', 'the', 'fermi', 'level', 'which', 'the', 'exact', 'densityfunctional', 'theory', 'dft', 'fails', 'to', 'describe', 'the', 'gfccsd', 'successfully', 'reproduces', 'the', 'mott', 'homolumo', 'highestoccupied', 'molecular', 'orbital', 'and', 'lowestunoccupied', 'molecular', 'orbital', 'gaps', 'even', 'quantitatively', 'we', 'also', 'discussed', 'the', 'origin', 'of', 'satellite', 'peaks', 'as', 'shakeup', 'effects', 'by', 'checking', 'the', 'components', 'of', 'wave', 'function', 'of', 'the', 'satellite', 'peaks', 'the', 'gfccsd', 'is', 'a', 'novel', 'cutting', 'edge', 'to', 'investigate', 'the', 'electronic', 'states', 'in', 'detail']] | [-0.08188813379445108, 0.07196547583277736, -0.09329000148366882, 0.13050203332287022, 0.030101526216227817, -0.09631797062487614, 0.08112138459496547, 0.3785396841071222, -0.2080086347153873, -0.3065690435931919, -0.02573602477027832, -0.33087028407705776, -0.12859074309647592, 0.15306737648195917, 0.049378627154872005, 0.036484597817711205, 0.07038937509927598, -0.010958450759604851, -0.10146529369073579, -0.2105099451272627, 0.2843691063437449, 0.08323172509369457, 0.2337412286393622, 0.07952160770594148, 0.017366777436561183, 0.016043537044724138, 0.04312521687951749, 0.01882176772222756, -0.13519790411468738, 0.09599212117844567, 0.2698220920156809, 0.0075155588023086885, 0.201487076121689, -0.44419699939696683, -0.15447420667226408, 0.004469923568044945, 0.14201395346071594, 0.15853687342450093, -0.020231863256017474, -0.28922506247398366, 0.05783601437828371, -0.1979728825853108, -0.16664727516645877, -0.11556174162694294, 0.0046845276302062205, 0.0622552465401613, -0.18829191142912977, 0.09855244398028128, -0.016792945676593122, 0.03287652967879491, -0.11027055622298293, -0.15243947485704784, -0.07963968141970473, 0.070874987867146, 0.02293352319668076, 0.03372484562294529, 0.14297654085520725, -0.07016838305652928, -0.10502286142704326, 0.4205332788471017, -0.0738807113679207, -0.11926190105378223, 0.17702117407989473, -0.17985063179118432, -0.1217592587139203, 0.16427964746362025, 0.03937834917758563, 0.0873392312500954, -0.12450365713791725, 0.09819772752270867, -0.03673211861572081, 0.17878577996751074, 0.06819730580593489, 0.06472459077395452, 0.18033791256501622, 0.08109044150582381, 0.02367759273369957, 0.10947225708659067, -0.15726230647964462, -0.09211825263637309, -0.2298096026082795, -0.1307933253188392, -0.23916244078919247, -0.01925298449784367, -0.010990719241343195, -0.1763344366777318, 0.42799428258068073, 0.13840213650259078, 0.17330548260360956, 0.005953076967292737, 0.2722530439582809, 0.16585287973886684, 0.06471594548075581, 0.062498644847561666, 0.25219898220001263, 0.13515745405894444, 0.028175748443239664, -0.30609450179227393, 0.037655207502036735, 0.0614408797205582] |
1,803.01513 | Hard X-ray View of HCG 16 (Arp 318) | We report the hard X-ray (3-50 keV) view of the compact group HCG 16 (Arp
318) observed with Nuclear Spectroscopic Telescope Array (NuSTAR). NGC 838 and
NGC 839 are undetected at energies above 8 keV, showing no evidence of heavily
obscured active galactic nuclei (AGNs). This confirms that these are
starburst-dominant galaxies as previously suggested. We perform a comprehensive
broadband (0.3-50 keV) X-ray spectral analysis of the interacting galaxies NGC
833 and NGC 835, using data of NuSTAR, Chandra, and XMM-Newton observed on
multiple epochs from 2000 to 2015. NuSTAR detects the transmitted continua of
low-luminosity active galactic nuclei (LLAGNs) in NGC 833 and NGC 835 with
line-of-sight column densities of $\approx 3 \times10^{23}$ cm$^{-2}$ and
intrinsic 2-10 keV luminosities of $\approx 3\times10^{41}$ erg s$^{-1}$. The
iron-K$\alpha$ to hard X-ray luminosity ratios of NGC 833 and NGC 835 suggest
that their tori are moderately developed, which may have been triggered by the
galaxy interactions. We find that NGC 835 underwent long-term variability in
both intrinsic luminosity (by a factor of 5) and absorption (by $\Delta N_{\rm
H} \approx 2\times10^{23}$ cm$^{-2}$). We discuss the relation between the
X-ray and total infrared luminosities in local LLAGNs hosted by spiral
galaxies. The large diversity in their ratios is consistent with the the
general idea that the mass accretion process in the nucleus and the star
forming activity in the disk are not strongly coupled, regardless of the galaxy
environment.
| astro-ph.GA astro-ph.HE | we report the hard xray 350 kev view of the compact group hcg 16 arp 318 observed with nuclear spectroscopic telescope array nustar ngc 838 and ngc 839 are undetected at energies above 8 kev showing no evidence of heavily obscured active galactic nuclei agns this confirms that these are starburstdominant galaxies as previously suggested we perform a comprehensive broadband 0350 kev xray spectral analysis of the interacting galaxies ngc 833 and ngc 835 using data of nustar chandra and xmmnewton observed on multiple epochs from 2000 to 2015 nustar detects the transmitted continua of lowluminosity active galactic nuclei llagns in ngc 833 and ngc 835 with lineofsight column densities of approx 3 times1023 cm2 and intrinsic 210 kev luminosities of approx 3times1041 erg s1 the ironkalpha to hard xray luminosity ratios of ngc 833 and ngc 835 suggest that their tori are moderately developed which may have been triggered by the galaxy interactions we find that ngc 835 underwent longterm variability in both intrinsic luminosity by a factor of 5 and absorption by delta n_rm h approx 2times1023 cm2 we discuss the relation between the xray and total infrared luminosities in local llagns hosted by spiral galaxies the large diversity in their ratios is consistent with the the general idea that the mass accretion process in the nucleus and the star forming activity in the disk are not strongly coupled regardless of the galaxy environment | [['we', 'report', 'the', 'hard', 'xray', '350', 'kev', 'view', 'of', 'the', 'compact', 'group', 'hcg', '16', 'arp', '318', 'observed', 'with', 'nuclear', 'spectroscopic', 'telescope', 'array', 'nustar', 'ngc', '838', 'and', 'ngc', '839', 'are', 'undetected', 'at', 'energies', 'above', '8', 'kev', 'showing', 'no', 'evidence', 'of', 'heavily', 'obscured', 'active', 'galactic', 'nuclei', 'agns', 'this', 'confirms', 'that', 'these', 'are', 'starburstdominant', 'galaxies', 'as', 'previously', 'suggested', 'we', 'perform', 'a', 'comprehensive', 'broadband', '0350', 'kev', 'xray', 'spectral', 'analysis', 'of', 'the', 'interacting', 'galaxies', 'ngc', '833', 'and', 'ngc', '835', 'using', 'data', 'of', 'nustar', 'chandra', 'and', 'xmmnewton', 'observed', 'on', 'multiple', 'epochs', 'from', '2000', 'to', '2015', 'nustar', 'detects', 'the', 'transmitted', 'continua', 'of', 'lowluminosity', 'active', 'galactic', 'nuclei', 'llagns', 'in', 'ngc', '833', 'and', 'ngc', '835', 'with', 'lineofsight', 'column', 'densities', 'of', 'approx', '3', 'times1023', 'cm2', 'and', 'intrinsic', '210', 'kev', 'luminosities', 'of', 'approx', '3times1041', 'erg', 's1', 'the', 'ironkalpha', 'to', 'hard', 'xray', 'luminosity', 'ratios', 'of', 'ngc', '833', 'and', 'ngc', '835', 'suggest', 'that', 'their', 'tori', 'are', 'moderately', 'developed', 'which', 'may', 'have', 'been', 'triggered', 'by', 'the', 'galaxy', 'interactions', 'we', 'find', 'that', 'ngc', '835', 'underwent', 'longterm', 'variability', 'in', 'both', 'intrinsic', 'luminosity', 'by', 'a', 'factor', 'of', '5', 'and', 'absorption', 'by', 'delta', 'n_rm', 'h', 'approx', '2times1023', 'cm2', 'we', 'discuss', 'the', 'relation', 'between', 'the', 'xray', 'and', 'total', 'infrared', 'luminosities', 'in', 'local', 'llagns', 'hosted', 'by', 'spiral', 'galaxies', 'the', 'large', 'diversity', 'in', 'their', 'ratios', 'is', 'consistent', 'with', 'the', 'the', 'general', 'idea', 'that', 'the', 'mass', 'accretion', 'process', 'in', 'the', 'nucleus', 'and', 'the', 'star', 'forming', 'activity', 'in', 'the', 'disk', 'are', 'not', 'strongly', 'coupled', 'regardless', 'of', 'the', 'galaxy', 'environment']] | [-0.03251448394370949, 0.09247703038859521, -0.01344490418127686, 0.10629817191190533, -0.054968228717554406, -0.07681900447898028, 0.045581037592834314, 0.5298895687864126, -0.050685269208505045, -0.41374994216830563, 0.03684988275446126, -0.3575144646721273, 0.039277018155790704, 0.20000548647065117, -0.02041790522275245, -0.06037271498850359, 0.014624404896834121, -0.1541909631301725, -0.03264718630067333, -0.27385879104533295, 0.22196352532155444, 0.10157036331138482, 0.16356518638795922, -0.019074798917842282, 0.08052048587206304, -0.07058643741041518, -0.0638231169543883, -0.09529198456731477, -0.11360790159479843, 0.026250043278360186, 0.30893914038495285, 0.1009519491914276, 0.20231198607554235, -0.30330988879479437, -0.17022803808210712, 0.0481967453229293, 0.21811188717248806, -0.11105825217258856, -0.020621527183716997, -0.29224000174288395, 0.04398993734653056, -0.23860165250313753, -0.19072565941895506, 0.10776704091922472, 0.06191792179602538, 0.03063253539638362, -0.14679200193832745, 0.20724335766013696, -0.018099872244505988, 0.11315912031955805, -0.205431721601915, -0.10686676708387827, -0.031008737409075667, 0.00138326751092217, 0.011235064744340783, 0.10102360810516922, 0.2198657157307275, -0.09622412857905834, -0.030965906791708755, 0.3519801273642212, -0.007764244456115966, 0.15801570358758096, 0.23385108854819506, -0.20951067636143256, -0.25768173192507815, 0.20027780616576005, 0.11174759085593913, 0.09450781500654479, -0.15080593618496357, 0.01049932484817791, -0.07405728440633835, 0.3284942802089734, 0.004844564125101709, 0.0742756810803476, 0.2782427250955238, 0.05427688551674969, 0.006780045405789698, 0.08579123703075389, -0.316228909217133, 0.03604343313276128, -0.20860637581528488, -0.009637767932669544, -0.08199690322315745, 0.1604524680694726, -0.17256869462985983, -0.04265427987926636, 0.315108807650075, 0.01649696484274059, 0.25580055554809106, 0.011944194699541662, 0.27056955009730843, 0.060905232514422626, 0.06833764790785159, 0.19272193246093366, 0.37937390240151114, 0.19293040489825888, 0.05672039003451175, -0.26686508052726576, 0.016334741634152862, -0.027130977621365963] |
1,803.01514 | Selectively exciting quasi-normal modes in open disordered systems | Transmission through disordered samples can be controlled by illuminating a
sample with waveforms corresponding to the eigenchannels of the transmission
matrix. But can the TM be exploited to selectively excite quasi-normal modes
and so control the spatial profile and dwell time inside the medium? We show in
microwave and numerical studies that spectra of the TM can be analyzed into
modal transmission matrices of rank unity. This makes it possible to enhance
the energy within a sample by a factor equal to the number of channels. Limits
to modal selectivity arise, however, from correlation in the speckle patterns
of neighboring modes. In accord with an effective Hamiltonian model, the degree
of modal speckle correlation grows with increasing modal spectral overlap and
non-orthogonality of the modes of non-Hermitian systems. This is observed when
the coupling of a sample to its surroundings increases, as in the crossover
from localized to diffusive waves.
| physics.class-ph cond-mat.dis-nn | transmission through disordered samples can be controlled by illuminating a sample with waveforms corresponding to the eigenchannels of the transmission matrix but can the tm be exploited to selectively excite quasinormal modes and so control the spatial profile and dwell time inside the medium we show in microwave and numerical studies that spectra of the tm can be analyzed into modal transmission matrices of rank unity this makes it possible to enhance the energy within a sample by a factor equal to the number of channels limits to modal selectivity arise however from correlation in the speckle patterns of neighboring modes in accord with an effective hamiltonian model the degree of modal speckle correlation grows with increasing modal spectral overlap and nonorthogonality of the modes of nonhermitian systems this is observed when the coupling of a sample to its surroundings increases as in the crossover from localized to diffusive waves | [['transmission', 'through', 'disordered', 'samples', 'can', 'be', 'controlled', 'by', 'illuminating', 'a', 'sample', 'with', 'waveforms', 'corresponding', 'to', 'the', 'eigenchannels', 'of', 'the', 'transmission', 'matrix', 'but', 'can', 'the', 'tm', 'be', 'exploited', 'to', 'selectively', 'excite', 'quasinormal', 'modes', 'and', 'so', 'control', 'the', 'spatial', 'profile', 'and', 'dwell', 'time', 'inside', 'the', 'medium', 'we', 'show', 'in', 'microwave', 'and', 'numerical', 'studies', 'that', 'spectra', 'of', 'the', 'tm', 'can', 'be', 'analyzed', 'into', 'modal', 'transmission', 'matrices', 'of', 'rank', 'unity', 'this', 'makes', 'it', 'possible', 'to', 'enhance', 'the', 'energy', 'within', 'a', 'sample', 'by', 'a', 'factor', 'equal', 'to', 'the', 'number', 'of', 'channels', 'limits', 'to', 'modal', 'selectivity', 'arise', 'however', 'from', 'correlation', 'in', 'the', 'speckle', 'patterns', 'of', 'neighboring', 'modes', 'in', 'accord', 'with', 'an', 'effective', 'hamiltonian', 'model', 'the', 'degree', 'of', 'modal', 'speckle', 'correlation', 'grows', 'with', 'increasing', 'modal', 'spectral', 'overlap', 'and', 'nonorthogonality', 'of', 'the', 'modes', 'of', 'nonhermitian', 'systems', 'this', 'is', 'observed', 'when', 'the', 'coupling', 'of', 'a', 'sample', 'to', 'its', 'surroundings', 'increases', 'as', 'in', 'the', 'crossover', 'from', 'localized', 'to', 'diffusive', 'waves']] | [-0.12335517373401672, 0.17914173910714454, -0.06231178644734124, 0.013247750627342611, -0.04307981500091652, -0.1266594614336888, 0.05821399587516984, 0.39572084076081715, -0.2957940477753679, -0.2852872620429844, 0.042810276470457514, -0.3098708706380178, -0.13020822868760054, 0.14212531313144913, -0.011692474169346193, 0.038322654684695104, 0.01656662214702616, 0.01891090697919329, -0.0504705729347188, -0.16607027038776626, 0.28841302706239125, 0.10098677555720012, 0.29863574664574116, 0.01428217565951248, 0.037215668636684615, 0.024795125327073037, -0.009213057979941368, 0.03243978559039533, -0.07213554312033618, 0.07958557618626703, 0.28063108877434084, 0.09944740569296603, 0.22492791768473883, -0.42906649261019386, -0.2236709986999631, 0.07647468351448576, 0.20786055471748113, 0.1250468222113947, 0.008679746168976028, -0.27807544747988383, 0.062658226142327, -0.12129532800143351, -0.13800217252845565, -0.04041119634484251, 0.007480946657403062, 0.028086401394102723, -0.29012713958198827, 0.08689871384820436, 0.045737961592773595, 0.04142570182836304, -0.02775026672286913, -0.049263305108373366, -0.06853253266463677, 0.10904268677288201, 0.04349116150677825, -0.04581985965992014, 0.12341036001220346, -0.09478780061937869, -0.06072412147807578, 0.3563149749860168, -0.07124975444593777, -0.19352156658812117, 0.18115983330799887, -0.20048223479340474, 0.005239161838738558, 0.18183319438248874, 0.1888539690275987, 0.08077776222664397, -0.10817466384740934, 0.034655807219290485, 0.014441306820760171, 0.23365644501677404, 0.09841089660457025, 0.103033219447049, 0.2081582137818138, 0.13242552550354353, 0.034758510136355954, 0.15918421879177913, -0.09258780372018616, -0.03980326213291846, -0.22918845715622108, -0.12485738206189126, -0.2149609700931857, 0.019047024403698744, -0.1098534679232398, -0.14535947792232037, 0.4297889484340946, 0.13994598323789736, 0.21724883355821173, 0.03881700490756581, 0.3022488192655146, 0.17255346092628315, 0.1113696570880711, 0.02015384362079203, 0.27575944271559516, 0.18100642094699046, 0.08532849389438828, -0.27387480952466525, 0.01412075993604958, -0.03135278525141378] |
1,803.01515 | Topological excitations in the ferromagnetic Kitaev-Heisenberg model | With the advancement in synthesizing and analyzing Kitaev materials, the
Kitaev-Heisenberg model on the honeycomb lattice has attracted a lot of
attention in the last few years. Several variations, which include additional
anisotropic interactions as well as response to external magnetic field, have
been investigated and many exotic ordered phases have been discussed. On the
other hand, quantum spin systems are proving to be a fertile ground to realize
and study bosonic analogues of fermionic topological states of matter. Using
the spin-wave theory we show that the ferromagnetic phase of the extended
Kitaev-Heisenberg model hosts topological excitations. Along the zig-zag edge
of the honeycomb lattice we find chiral edge states, which are protected by a
non-zero Chern number topological invariant. We discuss two different scenarios
for the direction of the spin polarization namely $[001]$ and $[111]$, which
are motivated by possible directions of applied field. Dynamic structure
factor, accessible in scattering experiments, is shown to exhibit signatures of
these topological edge excitations. Furthermore, we show that in case of spin
polarization in $[001]$ direction, a topological phase transition occurs once
the Kitaev couplings are made anisotropic.
| cond-mat.str-el | with the advancement in synthesizing and analyzing kitaev materials the kitaevheisenberg model on the honeycomb lattice has attracted a lot of attention in the last few years several variations which include additional anisotropic interactions as well as response to external magnetic field have been investigated and many exotic ordered phases have been discussed on the other hand quantum spin systems are proving to be a fertile ground to realize and study bosonic analogues of fermionic topological states of matter using the spinwave theory we show that the ferromagnetic phase of the extended kitaevheisenberg model hosts topological excitations along the zigzag edge of the honeycomb lattice we find chiral edge states which are protected by a nonzero chern number topological invariant we discuss two different scenarios for the direction of the spin polarization namely 001 and 111 which are motivated by possible directions of applied field dynamic structure factor accessible in scattering experiments is shown to exhibit signatures of these topological edge excitations furthermore we show that in case of spin polarization in 001 direction a topological phase transition occurs once the kitaev couplings are made anisotropic | [['with', 'the', 'advancement', 'in', 'synthesizing', 'and', 'analyzing', 'kitaev', 'materials', 'the', 'kitaevheisenberg', 'model', 'on', 'the', 'honeycomb', 'lattice', 'has', 'attracted', 'a', 'lot', 'of', 'attention', 'in', 'the', 'last', 'few', 'years', 'several', 'variations', 'which', 'include', 'additional', 'anisotropic', 'interactions', 'as', 'well', 'as', 'response', 'to', 'external', 'magnetic', 'field', 'have', 'been', 'investigated', 'and', 'many', 'exotic', 'ordered', 'phases', 'have', 'been', 'discussed', 'on', 'the', 'other', 'hand', 'quantum', 'spin', 'systems', 'are', 'proving', 'to', 'be', 'a', 'fertile', 'ground', 'to', 'realize', 'and', 'study', 'bosonic', 'analogues', 'of', 'fermionic', 'topological', 'states', 'of', 'matter', 'using', 'the', 'spinwave', 'theory', 'we', 'show', 'that', 'the', 'ferromagnetic', 'phase', 'of', 'the', 'extended', 'kitaevheisenberg', 'model', 'hosts', 'topological', 'excitations', 'along', 'the', 'zigzag', 'edge', 'of', 'the', 'honeycomb', 'lattice', 'we', 'find', 'chiral', 'edge', 'states', 'which', 'are', 'protected', 'by', 'a', 'nonzero', 'chern', 'number', 'topological', 'invariant', 'we', 'discuss', 'two', 'different', 'scenarios', 'for', 'the', 'direction', 'of', 'the', 'spin', 'polarization', 'namely', '001', 'and', '111', 'which', 'are', 'motivated', 'by', 'possible', 'directions', 'of', 'applied', 'field', 'dynamic', 'structure', 'factor', 'accessible', 'in', 'scattering', 'experiments', 'is', 'shown', 'to', 'exhibit', 'signatures', 'of', 'these', 'topological', 'edge', 'excitations', 'furthermore', 'we', 'show', 'that', 'in', 'case', 'of', 'spin', 'polarization', 'in', '001', 'direction', 'a', 'topological', 'phase', 'transition', 'occurs', 'once', 'the', 'kitaev', 'couplings', 'are', 'made', 'anisotropic']] | [-0.21153683596796366, 0.25143836730445224, -0.03550920992124555, 0.03840793060672079, -0.07457631603678218, -0.1645063851304072, 0.01161033993208861, 0.41853308368233905, -0.24879775368558463, -0.28085588627765257, 0.0722082620605536, -0.29842894785707036, -0.1580364248062539, 0.16291925804539314, 0.0619580411635119, 0.06523524471608702, -0.03200657749097915, -0.0028026076509386944, -0.09379567304827643, -0.25010982041011853, 0.28424246555760063, -0.042140297554445864, 0.30734105470279854, 0.07919426380296148, 0.014394488971760516, 0.014609686401923018, 0.07466468951785035, 0.0485184299634389, -0.1424523303339224, 0.0871894116637357, 0.22693138831340137, -0.070412202966049, 0.13449114442036877, -0.4627658523799431, -0.25872329023656665, 0.04472123125633125, 0.1253595540039642, 0.18257179797028683, -0.08954784986738276, -0.33207860655496796, 0.06726209217149223, -0.20101410575882, -0.12270320488155008, -0.1159793283391033, 0.013092491634300239, -0.03346322246661951, -0.1841504068132014, 0.04744148340642012, 0.05990632179115588, 0.0944459290526587, -0.04789677467691632, -0.12787317476480678, -0.10518545844537076, 0.07121278458995925, 0.07391426610129495, 0.047103970675849385, 0.0967994861715343, -0.15122219509074605, -0.2027984970769975, 0.39164470482657676, -0.043845282385616455, -0.13344469615909202, 0.18822195026673055, -0.1402128272883435, -0.15192802723056525, 0.10909387034173774, 0.1390137935178705, 0.08011333982370072, -0.08503230539762656, 0.11115993387491432, -0.04396363754721699, 0.11975013217776112, 0.025382045279657567, 0.11094665366865855, 0.3092302316749689, 0.14945746334369786, 0.05913085393796635, 0.1898026098343869, -0.10541122444775156, -0.13003358092460712, -0.21278061307165572, -0.16992265276388036, -0.22917726817691036, 0.035208502218567875, -0.015492306593793033, -0.17143556776363278, 0.4637355058659269, 0.16251215483600234, 0.19258681137705602, -0.0774679540009338, 0.20046944851155885, 0.08359826503256436, 0.055863432265738006, 0.03261453156316933, 0.27385320248813316, 0.1701294357628031, 0.04930953965872847, -0.20979283269750135, 0.028158888841668766, 0.032175675069572786] |
1,803.01516 | A new stereo formulation not using pixel and disparity models | We introduce a new stereo formulation which does not use pixel and disparity
models. Many problems in vision are treated as assigning each pixel a label.
Disparities are labels for stereo. Such pixel-labeling problems are naturally
represented in terms of energy minimization, where the energy function has two
terms: one term penalizes solutions that inconsistent with the observed data,
the other term enforces spatial smoothness. Graph cuts are one of the effi-
cient methods for solving energy minimization. However, exact minimization of
multi labeling problems can be performed by graph cuts only for the case with
convex smoothness terms. In pixel-disparity formulation, convex smoothness
terms do not generate well reconstructed 3D results. Thus, truncated linear or
quadratic smoothness terms, etc. are used, where approximate energy
minimization is necessary. In this paper, we introduce a new site-labeling
formulation, where the sites are not pixels but lines in 3D space, labels are
not disparities but depth numbers. For this formulation, visibility reasoning
is naturally included in the energy function. In addition, this formulation
allows us to use a small smoothness term, which does not affect the 3D results
much. This makes the optimization step very simple, so we could develop an
approximation method for graph cut itself (not for energy minimization) and a
high performance GPU graph cut program. For Tsukuba stereo pair in Middlebury
data set, we got the result in 5ms using GTX1080GPU, 19ms using GTX660GPU.
| cs.CV | we introduce a new stereo formulation which does not use pixel and disparity models many problems in vision are treated as assigning each pixel a label disparities are labels for stereo such pixellabeling problems are naturally represented in terms of energy minimization where the energy function has two terms one term penalizes solutions that inconsistent with the observed data the other term enforces spatial smoothness graph cuts are one of the effi cient methods for solving energy minimization however exact minimization of multi labeling problems can be performed by graph cuts only for the case with convex smoothness terms in pixeldisparity formulation convex smoothness terms do not generate well reconstructed 3d results thus truncated linear or quadratic smoothness terms etc are used where approximate energy minimization is necessary in this paper we introduce a new sitelabeling formulation where the sites are not pixels but lines in 3d space labels are not disparities but depth numbers for this formulation visibility reasoning is naturally included in the energy function in addition this formulation allows us to use a small smoothness term which does not affect the 3d results much this makes the optimization step very simple so we could develop an approximation method for graph cut itself not for energy minimization and a high performance gpu graph cut program for tsukuba stereo pair in middlebury data set we got the result in 5ms using gtx1080gpu 19ms using gtx660gpu | [['we', 'introduce', 'a', 'new', 'stereo', 'formulation', 'which', 'does', 'not', 'use', 'pixel', 'and', 'disparity', 'models', 'many', 'problems', 'in', 'vision', 'are', 'treated', 'as', 'assigning', 'each', 'pixel', 'a', 'label', 'disparities', 'are', 'labels', 'for', 'stereo', 'such', 'pixellabeling', 'problems', 'are', 'naturally', 'represented', 'in', 'terms', 'of', 'energy', 'minimization', 'where', 'the', 'energy', 'function', 'has', 'two', 'terms', 'one', 'term', 'penalizes', 'solutions', 'that', 'inconsistent', 'with', 'the', 'observed', 'data', 'the', 'other', 'term', 'enforces', 'spatial', 'smoothness', 'graph', 'cuts', 'are', 'one', 'of', 'the', 'effi', 'cient', 'methods', 'for', 'solving', 'energy', 'minimization', 'however', 'exact', 'minimization', 'of', 'multi', 'labeling', 'problems', 'can', 'be', 'performed', 'by', 'graph', 'cuts', 'only', 'for', 'the', 'case', 'with', 'convex', 'smoothness', 'terms', 'in', 'pixeldisparity', 'formulation', 'convex', 'smoothness', 'terms', 'do', 'not', 'generate', 'well', 'reconstructed', '3d', 'results', 'thus', 'truncated', 'linear', 'or', 'quadratic', 'smoothness', 'terms', 'etc', 'are', 'used', 'where', 'approximate', 'energy', 'minimization', 'is', 'necessary', 'in', 'this', 'paper', 'we', 'introduce', 'a', 'new', 'sitelabeling', 'formulation', 'where', 'the', 'sites', 'are', 'not', 'pixels', 'but', 'lines', 'in', '3d', 'space', 'labels', 'are', 'not', 'disparities', 'but', 'depth', 'numbers', 'for', 'this', 'formulation', 'visibility', 'reasoning', 'is', 'naturally', 'included', 'in', 'the', 'energy', 'function', 'in', 'addition', 'this', 'formulation', 'allows', 'us', 'to', 'use', 'a', 'small', 'smoothness', 'term', 'which', 'does', 'not', 'affect', 'the', '3d', 'results', 'much', 'this', 'makes', 'the', 'optimization', 'step', 'very', 'simple', 'so', 'we', 'could', 'develop', 'an', 'approximation', 'method', 'for', 'graph', 'cut', 'itself', 'not', 'for', 'energy', 'minimization', 'and', 'a', 'high', 'performance', 'gpu', 'graph', 'cut', 'program', 'for', 'tsukuba', 'stereo', 'pair', 'in', 'middlebury', 'data', 'set', 'we', 'got', 'the', 'result', 'in', '5ms', 'using', 'gtx1080gpu', '19ms', 'using', 'gtx660gpu']] | [-0.057998813247179676, 0.03847233961384738, -0.05810926180605873, 0.11244219220604683, -0.13056985196629378, -0.14690573687528677, -0.006842873208244845, 0.411553021317653, -0.306309720942879, -0.3633608169580713, 0.09330558150972577, -0.2567650236497088, -0.13102617147197979, 0.14253539310573551, -0.14632105604938134, 0.07163297596456812, 0.1404157586753015, 0.01848840906389122, -0.09326475930343993, -0.23482477571263283, 0.2793858045268531, 0.008286701611660677, 0.2501283252194267, 0.06858149997424334, 0.12244478324408128, 0.027603026494536356, -0.008118873217207348, 0.07186746264289531, -0.08873263589656086, 0.11765494486481375, 0.28478942843473526, 0.1682649922736816, 0.2991531262382993, -0.437142064907299, -0.21220398857659692, 0.14439218675974627, 0.1482724878537581, 0.06432991575224903, -0.01695033944420645, -0.217429130276914, 0.0723467204516055, -0.12475658432030569, -0.0381919817420943, -0.09866323661468603, -0.053680476385313244, 0.002690373850908082, -0.3312030787728245, 0.06691440966899571, 0.028438692496977103, 0.03892435398803831, -0.08005399398876009, -0.12195375792537655, 0.005350055666800974, 0.08793999067535785, 0.016401926334545916, 0.07177584875648006, 0.0760834998097913, -0.1454848005435859, -0.09845196823014954, 0.39517090777497227, -0.01771049699715965, -0.2884177367658563, 0.16246191278445749, -0.07920123091778429, -0.15779977901397144, 0.11598837235139618, 0.1649807737598292, 0.14203573929362706, -0.15694934406602787, 0.08931151815391034, -0.05143657531930487, 0.14802399418991188, 0.06743062854993381, 0.03072263503443161, 0.1387653611339468, 0.1323911757564678, 0.1183337353053001, 0.12954408056122765, -0.10880266156665788, -0.07106733820421204, -0.31281348834103295, -0.10719117223323274, -0.21313207083309454, -0.046580177227136525, -0.09615061197598998, -0.18318809748823947, 0.386985299729437, 0.1275418456182173, 0.21395630169467167, 0.08732381045360696, 0.3204561114423619, 0.14134933491914126, 0.10765923661729802, 0.09870837915664667, 0.20349447070901958, 0.04276332668137159, 0.08890366253788294, -0.14633987172946317, 0.07640064791736097, 0.1285563619698976] |
1,803.01517 | Elongational viscosity of weakly entangled polymer melt via
coarse-grained molecular dynamics simulation | We investigated the elongational flows of the weakly entangled linear polymer
melt using a coarse-grained molecular dynamics simulation. We extended the
uniform extensional flow (UEF) method developed by Nicholson and Rutledge (D.
A. Nicholson and G. C. Rutledge, J. Chem. Phys., 145, 244903 (2016)) for
application to Langevin dynamics. We succeeded in observing the elongational
viscosity of the weakly entangled linear polymer melt from the equilibrium
state to the steady state using the extended UEF method, whereas the
conventional rectangular parallelepiped shape technique for extensional flows
has failed to do so for over 20 years.
| cond-mat.soft | we investigated the elongational flows of the weakly entangled linear polymer melt using a coarsegrained molecular dynamics simulation we extended the uniform extensional flow uef method developed by nicholson and rutledge d a nicholson and g c rutledge j chem phys 145 244903 2016 for application to langevin dynamics we succeeded in observing the elongational viscosity of the weakly entangled linear polymer melt from the equilibrium state to the steady state using the extended uef method whereas the conventional rectangular parallelepiped shape technique for extensional flows has failed to do so for over 20 years | [['we', 'investigated', 'the', 'elongational', 'flows', 'of', 'the', 'weakly', 'entangled', 'linear', 'polymer', 'melt', 'using', 'a', 'coarsegrained', 'molecular', 'dynamics', 'simulation', 'we', 'extended', 'the', 'uniform', 'extensional', 'flow', 'uef', 'method', 'developed', 'by', 'nicholson', 'and', 'rutledge', 'd', 'a', 'nicholson', 'and', 'g', 'c', 'rutledge', 'j', 'chem', 'phys', '145', '244903', '2016', 'for', 'application', 'to', 'langevin', 'dynamics', 'we', 'succeeded', 'in', 'observing', 'the', 'elongational', 'viscosity', 'of', 'the', 'weakly', 'entangled', 'linear', 'polymer', 'melt', 'from', 'the', 'equilibrium', 'state', 'to', 'the', 'steady', 'state', 'using', 'the', 'extended', 'uef', 'method', 'whereas', 'the', 'conventional', 'rectangular', 'parallelepiped', 'shape', 'technique', 'for', 'extensional', 'flows', 'has', 'failed', 'to', 'do', 'so', 'for', 'over', '20', 'years']] | [-0.09155180208147207, 0.15537747419736486, -0.11496381691478669, -0.0661520740770279, -0.028956347909270527, -0.16373976998704862, 0.020559071439338175, 0.3575031713661837, -0.26110717317614546, -0.2489307591756013, 0.07440317395276964, -0.2363518839801087, -0.07969108061429034, 0.1373797204120065, -0.012700255390534059, 0.130137359842341, 0.05559743911354862, -0.043086803508328, -0.02888441619839757, -0.21671594014797518, 0.17853006464924584, 0.021567473822134607, 0.2783870195980466, 0.02288478425149112, 0.12830682417645337, 0.03215708444885751, -0.0024671343804158747, 0.0965686984201695, -0.24800754783358028, 0.06933245185931075, 0.23437170368777785, 0.035357970556125363, 0.24390592961076726, -0.4403797946077712, -0.2431725555476039, 0.047196286036930185, 0.10420616211845203, 0.13400625141877484, 0.029737700893979598, -0.27903763188960706, 0.05498030454792241, -0.22311744891959143, -0.11838112650389605, -0.08726170965088928, 0.09426399830609877, 0.027819588433634093, -0.24646027388665429, 0.15849958661388844, 0.08709826170060625, 0.08079560564712007, -0.037864709030551974, -0.10029550558550561, -0.06412625130503735, 0.028693886741282457, -0.04715097340893872, 0.04625753038364681, 0.17383729981040544, -0.10896438158592804, -0.07376174789610655, 0.33201524880813793, -0.12426819783843499, -0.17169897892373673, 0.24639994703342227, -0.10146493623726704, -0.11160479248699515, 0.18676052658640324, 0.13419579242930768, 0.16653342118011194, -0.13680672550455053, 0.061255748511262316, -0.0967748467141683, 0.1683602387907895, 0.08984674239392451, -0.1074776920549413, 0.13808115334200494, 0.14095617379705877, 0.02331499067045986, 0.18359628655115498, -0.10058106394593623, -0.13793308836001744, -0.22649035198574372, -0.15968333166142173, -0.17895981875505854, 0.07472547242279223, -0.023514351812178924, -0.11734537344594348, 0.3574280885464333, 0.07939540416477843, 0.12118009767158235, 0.04016396900183184, 0.19035914965330603, 0.0032989495741005273, -0.002092237275916132, 0.16234742378459333, 0.2485503468543608, 0.19674448526286065, 0.17876636993234105, -0.2563532481163225, 0.03908389750521313, 0.12216783930210674] |
1,803.01518 | Perturbation Analysis of An Eigenvector-Dependent Nonlinear Eigenvalue
Problem With Applications? | The eigenvector-dependent nonlinear eigenvalue problem (NEPv)
$A(P)V=V\Lambda$, where the columns of $V\in\mathbb{C}^{n\times k}$ are
orthonormal, $P=VV^{\mathrm{H}}$, $A(P)$ is Hermitian, and
$\Lambda=V^{\mathrm{H}}A(P)V$, arises in many important applications, such as
the discretized Kohn-Sham equation in electronic structure calculations and the
trace ratio problem in linear discriminant analysis. In this paper, we perform
a perturbation analysis for the NEPv, which gives upper bounds for the distance
between the solution to the original NEPv and the solution to the perturbed
NEPv. A condition number for the NEPv is introduced, which reveals the factors
that affect the sensitivity of the solution. Furthermore, two computable error
bounds are given for the NEPv, which can be used to measure the quality of an
approximate solution. The theoretical results are validated by numerical
experiments for the Kohn-Sham equation and the trace ratio optimization.
| math.NA | the eigenvectordependent nonlinear eigenvalue problem nepv apvvlambda where the columns of vinmathbbcntimes k are orthonormal pvvmathrmh ap is hermitian and lambdavmathrmhapv arises in many important applications such as the discretized kohnsham equation in electronic structure calculations and the trace ratio problem in linear discriminant analysis in this paper we perform a perturbation analysis for the nepv which gives upper bounds for the distance between the solution to the original nepv and the solution to the perturbed nepv a condition number for the nepv is introduced which reveals the factors that affect the sensitivity of the solution furthermore two computable error bounds are given for the nepv which can be used to measure the quality of an approximate solution the theoretical results are validated by numerical experiments for the kohnsham equation and the trace ratio optimization | [['the', 'eigenvectordependent', 'nonlinear', 'eigenvalue', 'problem', 'nepv', 'apvvlambda', 'where', 'the', 'columns', 'of', 'vinmathbbcntimes', 'k', 'are', 'orthonormal', 'pvvmathrmh', 'ap', 'is', 'hermitian', 'and', 'lambdavmathrmhapv', 'arises', 'in', 'many', 'important', 'applications', 'such', 'as', 'the', 'discretized', 'kohnsham', 'equation', 'in', 'electronic', 'structure', 'calculations', 'and', 'the', 'trace', 'ratio', 'problem', 'in', 'linear', 'discriminant', 'analysis', 'in', 'this', 'paper', 'we', 'perform', 'a', 'perturbation', 'analysis', 'for', 'the', 'nepv', 'which', 'gives', 'upper', 'bounds', 'for', 'the', 'distance', 'between', 'the', 'solution', 'to', 'the', 'original', 'nepv', 'and', 'the', 'solution', 'to', 'the', 'perturbed', 'nepv', 'a', 'condition', 'number', 'for', 'the', 'nepv', 'is', 'introduced', 'which', 'reveals', 'the', 'factors', 'that', 'affect', 'the', 'sensitivity', 'of', 'the', 'solution', 'furthermore', 'two', 'computable', 'error', 'bounds', 'are', 'given', 'for', 'the', 'nepv', 'which', 'can', 'be', 'used', 'to', 'measure', 'the', 'quality', 'of', 'an', 'approximate', 'solution', 'the', 'theoretical', 'results', 'are', 'validated', 'by', 'numerical', 'experiments', 'for', 'the', 'kohnsham', 'equation', 'and', 'the', 'trace', 'ratio', 'optimization']] | [-0.1224692864701725, 0.009403610201843549, -0.0876359986656238, 0.06151216108835517, -0.05066228849956622, -0.10414541543533022, 0.029330050740211916, 0.3008335705488347, -0.2911928154528141, -0.30099294430647905, 0.1292993462501237, -0.305071667721495, -0.15732209896668792, 0.18410709981914036, -0.011023175540881662, 0.11582165726532156, 0.06892581742901642, 0.05554305841931357, -0.0952131123514846, -0.21508822763302865, 0.2979796786577656, 0.06227647113398864, 0.24380118690001276, 0.06510120168901407, 0.06456303927295197, -0.040750367729924616, -0.006226432377185959, 0.020588995516300203, -0.1384226095095353, 0.12769307479656372, 0.2745231854621894, 0.1372603099936476, 0.2724386859058331, -0.4052195905134655, -0.15489575581338544, 0.09604051527209007, 0.13005491758947477, 0.08294054897448334, -0.033869372824063666, -0.2704764370519954, 0.09491938239482876, -0.09047247478738427, -0.12448082369250747, -0.0909225600771606, 0.0026330864576336282, 0.019261419522361115, -0.33954256156754964, 0.09271984380992272, 0.04597005744894537, 0.0025634870062416527, -0.0963956509824269, -0.138192160663983, 0.02133862734414064, 0.10266765121442194, 0.052912730877645885, 0.015603330061556056, 0.07333417213521898, -0.09796767152595119, -0.04864212978595438, 0.3856570409754148, -0.0915987078870575, -0.2650594783660311, 0.11418560131166416, -0.07462148517728424, -0.11000294190509101, 0.1204402189164494, 0.16408211171913606, 0.12409483058951222, -0.13025951184950268, 0.1241529503532757, -0.07614170849018802, 0.16563721395169312, 0.06272656538058072, 0.024967540933105808, 0.10139167085469056, 0.11087326672814715, 0.10603234877836747, 0.12756693924221998, -0.06269750450737774, -0.10677233887119936, -0.2856289674742864, -0.16774986854467827, -0.2029977308998171, 0.035466898166431254, -0.13376872367539014, -0.18406594452054167, 0.39640492564783647, 0.13330408410312464, 0.19438079249543638, 0.053766143324677475, 0.2809821526537864, 0.19946998919700631, 0.003988857290152317, 0.08693670368968294, 0.2495121602004824, 0.1742922668864664, 0.04950650799303101, -0.24606020534411072, 0.05309034368882959, 0.11872086556305965] |
1,803.01519 | Spatial Isolation Implies Zero Knowledge Even in a Quantum World | Zero knowledge plays a central role in cryptography and complexity. The
seminal work of Ben-Or et al. (STOC 1988) shows that zero knowledge can be
achieved unconditionally for any language in NEXP, as long as one is willing to
make a suitable physical assumption: if the provers are spatially isolated,
then they can be assumed to be playing independent strategies. Quantum
mechanics, however, tells us that this assumption is unrealistic, because
spatially-isolated provers could share a quantum entangled state and realize a
non-local correlated strategy. The MIP* model captures this setting. In this
work we study the following question: does spatial isolation still suffice to
unconditionally achieve zero knowledge even in the presence of quantum
entanglement? We answer this question in the affirmative: we prove that every
language in NEXP has a 2-prover zero knowledge interactive proof that is sound
against entangled provers; that is, NEXP \subseteq ZK-MIP*. Our proof consists
of constructing a zero knowledge interactive PCP with a strong algebraic
structure, and then lifting it to the MIP* model. This lifting relies on a new
framework that builds on recent advances in low-degree testing against
entangled strategies, and clearly separates classical and quantum tools. Our
main technical contribution consists of developing new algebraic techniques for
obtaining unconditional zero knowledge; this includes a zero knowledge variant
of the celebrated sumcheck protocol, a key building block in many probabilistic
proof systems. A core component of our sumcheck protocol is a new algebraic
commitment scheme, whose analysis relies on algebraic complexity theory.
| quant-ph cs.CC | zero knowledge plays a central role in cryptography and complexity the seminal work of benor et al stoc 1988 shows that zero knowledge can be achieved unconditionally for any language in nexp as long as one is willing to make a suitable physical assumption if the provers are spatially isolated then they can be assumed to be playing independent strategies quantum mechanics however tells us that this assumption is unrealistic because spatiallyisolated provers could share a quantum entangled state and realize a nonlocal correlated strategy the mip model captures this setting in this work we study the following question does spatial isolation still suffice to unconditionally achieve zero knowledge even in the presence of quantum entanglement we answer this question in the affirmative we prove that every language in nexp has a 2prover zero knowledge interactive proof that is sound against entangled provers that is nexp subseteq zkmip our proof consists of constructing a zero knowledge interactive pcp with a strong algebraic structure and then lifting it to the mip model this lifting relies on a new framework that builds on recent advances in lowdegree testing against entangled strategies and clearly separates classical and quantum tools our main technical contribution consists of developing new algebraic techniques for obtaining unconditional zero knowledge this includes a zero knowledge variant of the celebrated sumcheck protocol a key building block in many probabilistic proof systems a core component of our sumcheck protocol is a new algebraic commitment scheme whose analysis relies on algebraic complexity theory | [['zero', 'knowledge', 'plays', 'a', 'central', 'role', 'in', 'cryptography', 'and', 'complexity', 'the', 'seminal', 'work', 'of', 'benor', 'et', 'al', 'stoc', '1988', 'shows', 'that', 'zero', 'knowledge', 'can', 'be', 'achieved', 'unconditionally', 'for', 'any', 'language', 'in', 'nexp', 'as', 'long', 'as', 'one', 'is', 'willing', 'to', 'make', 'a', 'suitable', 'physical', 'assumption', 'if', 'the', 'provers', 'are', 'spatially', 'isolated', 'then', 'they', 'can', 'be', 'assumed', 'to', 'be', 'playing', 'independent', 'strategies', 'quantum', 'mechanics', 'however', 'tells', 'us', 'that', 'this', 'assumption', 'is', 'unrealistic', 'because', 'spatiallyisolated', 'provers', 'could', 'share', 'a', 'quantum', 'entangled', 'state', 'and', 'realize', 'a', 'nonlocal', 'correlated', 'strategy', 'the', 'mip', 'model', 'captures', 'this', 'setting', 'in', 'this', 'work', 'we', 'study', 'the', 'following', 'question', 'does', 'spatial', 'isolation', 'still', 'suffice', 'to', 'unconditionally', 'achieve', 'zero', 'knowledge', 'even', 'in', 'the', 'presence', 'of', 'quantum', 'entanglement', 'we', 'answer', 'this', 'question', 'in', 'the', 'affirmative', 'we', 'prove', 'that', 'every', 'language', 'in', 'nexp', 'has', 'a', '2prover', 'zero', 'knowledge', 'interactive', 'proof', 'that', 'is', 'sound', 'against', 'entangled', 'provers', 'that', 'is', 'nexp', 'subseteq', 'zkmip', 'our', 'proof', 'consists', 'of', 'constructing', 'a', 'zero', 'knowledge', 'interactive', 'pcp', 'with', 'a', 'strong', 'algebraic', 'structure', 'and', 'then', 'lifting', 'it', 'to', 'the', 'mip', 'model', 'this', 'lifting', 'relies', 'on', 'a', 'new', 'framework', 'that', 'builds', 'on', 'recent', 'advances', 'in', 'lowdegree', 'testing', 'against', 'entangled', 'strategies', 'and', 'clearly', 'separates', 'classical', 'and', 'quantum', 'tools', 'our', 'main', 'technical', 'contribution', 'consists', 'of', 'developing', 'new', 'algebraic', 'techniques', 'for', 'obtaining', 'unconditional', 'zero', 'knowledge', 'this', 'includes', 'a', 'zero', 'knowledge', 'variant', 'of', 'the', 'celebrated', 'sumcheck', 'protocol', 'a', 'key', 'building', 'block', 'in', 'many', 'probabilistic', 'proof', 'systems', 'a', 'core', 'component', 'of', 'our', 'sumcheck', 'protocol', 'is', 'a', 'new', 'algebraic', 'commitment', 'scheme', 'whose', 'analysis', 'relies', 'on', 'algebraic', 'complexity', 'theory']] | [-0.1376397076668779, 0.06875659360168838, -0.15765465419023228, 0.07144839377712878, -0.10348024550286761, -0.22930749943180675, 0.07070875170932386, 0.30157662081311504, -0.2655252622661132, -0.2879850225425868, 0.07282567992862539, -0.22008610478636012, -0.13498398158736677, 0.2017184115860267, -0.15207540420871452, 0.042586368825857014, 0.06416943297678433, -0.006025327492999025, -0.00847559898295047, -0.2837491318645203, 0.322138112932294, 0.01062217658856906, 0.2965087038371338, 0.07509392484752311, 0.1025452123296608, 0.051278494592067826, -0.028204991063290094, -0.028967266808821255, -0.09320613776138903, 0.12736799095941512, 0.31874728794153556, 0.17901579418331717, 0.35404278769299957, -0.39752135452116377, -0.18948479846445282, 0.11951389632199004, 0.13627014920885963, 0.17280850435483708, -0.03743179007498809, -0.2444733290271048, 0.11139963911921086, -0.15960100606031508, -0.1286018332821807, -0.08992470549157705, -0.0006218511614963472, -0.06656873182358078, -0.2646712667874928, 0.013009272778993958, 0.19462764347402237, 0.054747685498322346, 0.010851789313559252, -0.07082787197060793, 0.05503680455745254, 0.11698285084644175, -0.038404006525324, 0.06134832238340863, 0.09672947760543274, -0.07351779268239157, -0.18275437692398144, 0.33027433031743547, -0.04836857448477881, -0.19098565232637058, 0.2015953387085154, -0.0409203903360599, -0.19515072489082513, 0.06509982882419145, 0.10926180719594325, 0.1218397774673759, -0.09760969494358192, 0.13222589842618881, -0.11009741764063068, 0.2501645396037184, 0.07232759439809076, 0.06365735606331543, 0.1860200289242254, 0.14272788044132562, 0.09302651149433024, 0.11817444333232506, 0.04650186370482227, -0.14995356888653352, -0.2888116304833726, -0.1822015403986845, -0.21172169407097488, 0.0923543216545606, -0.03799228060841663, -0.15207046001493169, 0.3511125631448522, 0.17781104535368425, 0.10963269755857656, 0.07899466798693151, 0.3395160475005227, 0.062195978881314354, 0.035592909270231746, 0.12005140109690857, 0.20894406754574943, 0.14462418408492153, 0.0934259710533275, -0.15082421135783838, 0.1328633406394008, 0.08685185033341787] |
1,803.0152 | Comparison of Green's functions for transition metal atoms using
self-energy functional theory and coupled-cluster singles and doubles (CCSD) | We demonstrate in the present study that self-consistent calculations based
on the self-energy functional theory (SFT) are possible for the electronic
structure of realistic systems in the context of quantum chemistry. We describe
the procedure of a self-consistent SFT calculation in detail and perform the
calculations for isolated $3 d$ transition metal atoms from V to Cu as a
preliminary study. We compare the one-particle Green's functions (GFs) obtained
in this way and those obtained from the coupled-cluster singles and doubles
(CCSD) method. Although the SFT calculation starts from the spin-unpolarized
Hartree--Fock (HF) state for each of the target systems, the self-consistency
loop correctly leads to degenerate spin-polarized ground states. We examine the
spectral functions in detail to find their commonalities and differences among
the atoms by paying attention to the characteristics of the two approaches. It
is demonstrated via the two approaches that calculations based on the density
functional theory (DFT) can fail in predicting the orbital energy spectra for
spherically symmetric systems. It is found that the two methods are quite
reliable and useful beyond DFT.
| cond-mat.mtrl-sci cond-mat.str-el | we demonstrate in the present study that selfconsistent calculations based on the selfenergy functional theory sft are possible for the electronic structure of realistic systems in the context of quantum chemistry we describe the procedure of a selfconsistent sft calculation in detail and perform the calculations for isolated 3 d transition metal atoms from v to cu as a preliminary study we compare the oneparticle greens functions gfs obtained in this way and those obtained from the coupledcluster singles and doubles ccsd method although the sft calculation starts from the spinunpolarized hartreefock hf state for each of the target systems the selfconsistency loop correctly leads to degenerate spinpolarized ground states we examine the spectral functions in detail to find their commonalities and differences among the atoms by paying attention to the characteristics of the two approaches it is demonstrated via the two approaches that calculations based on the density functional theory dft can fail in predicting the orbital energy spectra for spherically symmetric systems it is found that the two methods are quite reliable and useful beyond dft | [['we', 'demonstrate', 'in', 'the', 'present', 'study', 'that', 'selfconsistent', 'calculations', 'based', 'on', 'the', 'selfenergy', 'functional', 'theory', 'sft', 'are', 'possible', 'for', 'the', 'electronic', 'structure', 'of', 'realistic', 'systems', 'in', 'the', 'context', 'of', 'quantum', 'chemistry', 'we', 'describe', 'the', 'procedure', 'of', 'a', 'selfconsistent', 'sft', 'calculation', 'in', 'detail', 'and', 'perform', 'the', 'calculations', 'for', 'isolated', '3', 'd', 'transition', 'metal', 'atoms', 'from', 'v', 'to', 'cu', 'as', 'a', 'preliminary', 'study', 'we', 'compare', 'the', 'oneparticle', 'greens', 'functions', 'gfs', 'obtained', 'in', 'this', 'way', 'and', 'those', 'obtained', 'from', 'the', 'coupledcluster', 'singles', 'and', 'doubles', 'ccsd', 'method', 'although', 'the', 'sft', 'calculation', 'starts', 'from', 'the', 'spinunpolarized', 'hartreefock', 'hf', 'state', 'for', 'each', 'of', 'the', 'target', 'systems', 'the', 'selfconsistency', 'loop', 'correctly', 'leads', 'to', 'degenerate', 'spinpolarized', 'ground', 'states', 'we', 'examine', 'the', 'spectral', 'functions', 'in', 'detail', 'to', 'find', 'their', 'commonalities', 'and', 'differences', 'among', 'the', 'atoms', 'by', 'paying', 'attention', 'to', 'the', 'characteristics', 'of', 'the', 'two', 'approaches', 'it', 'is', 'demonstrated', 'via', 'the', 'two', 'approaches', 'that', 'calculations', 'based', 'on', 'the', 'density', 'functional', 'theory', 'dft', 'can', 'fail', 'in', 'predicting', 'the', 'orbital', 'energy', 'spectra', 'for', 'spherically', 'symmetric', 'systems', 'it', 'is', 'found', 'that', 'the', 'two', 'methods', 'are', 'quite', 'reliable', 'and', 'useful', 'beyond', 'dft']] | [-0.08458998073494124, 0.065221780981722, -0.09393604061555828, 0.12999477932619433, 0.03392576187158401, -0.1097122320664649, 0.07207213960041219, 0.390151052003245, -0.19431045455230253, -0.2810851563542579, -0.006435150161563429, -0.3187283822701553, -0.15624640626686342, 0.1695925260205973, 0.04586777963225594, 0.05164726595446635, 0.07191874619882052, 0.02986697044506083, -0.1530937495804261, -0.2003369698905271, 0.3252299477299152, 0.04300762702164167, 0.27235947724358506, 0.03558527336068702, 0.011520047415063581, 0.030613160222569963, -0.0071793028331372175, 0.024919493199755133, -0.12237433549418118, 0.1315993287684291, 0.2665329309954737, 0.04908187584160158, 0.2415870535462111, -0.4931148420391458, -0.2171833778344346, -0.0019365649897960966, 0.10377383126950498, 0.17623732304933032, -0.03783299835016846, -0.2513489353488817, 0.06399717742545802, -0.1967745349249342, -0.13373809711473963, -0.1479002884850743, -0.014893847083400809, 0.04143763396933445, -0.210750823632848, 0.07803340874392581, -0.018955663784755016, 0.00682857606758323, -0.10021550386746446, -0.15923419793586382, -0.05037534077589013, 0.10359229154497636, 0.0027092366758603185, 0.023357667308823948, 0.13280724816735875, -0.10018588527461535, -0.09813574477611633, 0.4166026088524233, -0.060515763306090334, -0.1699207035427013, 0.18416917737667565, -0.1462650833811004, -0.15764696312560753, 0.11279494878495887, 0.08789321686287693, 0.1461093251206232, -0.17283158984821384, 0.12272495409739309, -0.006342600256052873, 0.15406597483565695, 0.0035312093449024, 0.031077874884574433, 0.17759482574575905, 0.11966870103706344, 0.004419261237784299, 0.10467837915462808, -0.09752586327514119, -0.14163753761042674, -0.27206295886171167, -0.13159184409907151, -0.18468012461004507, 0.009352138081534107, -0.024186416410986893, -0.1840123844782958, 0.43225416999959043, 0.16677405393494063, 0.14020841306643142, 0.0013786626605609997, 0.2757471619315152, 0.1385351183053807, 0.03617204402787925, 0.04568371112495033, 0.2450502883470251, 0.17182009552966468, 0.043842109244609816, -0.27591951924318636, 0.0034907147905716067, 0.07502762227727289] |
1,803.01521 | Probing one-dimensional systems via noise magnetometry with single spin
qubits | The study of exotic one-dimensional states, particularly those at the edges
of topological materials, demand new experimental probes that can access the
interplay between charge and spin degrees of freedom. One potential approach is
to use a single spin probe, such as a Nitrogen Vacancy center in diamond, which
has recently emerged as a versatile tool to probe nanoscale systems in a
non-invasive fashion. Here we present a theory describing how noise
magnetometry with spin probes can directly address several questions that have
emerged in experimental studies of 1D systems, including those in topological
materials. We show that by controlling the spin degree of freedom of the probe,
it is possible to measure locally and independently local charge and spin
correlations of 1D systems. Visualization of 1D edge states, as well as
sampling correlations with wavevector resolution can be achieved by tuning the
probe-to-sample distance. Furthermore, temperature-dependent measurements of
magnetic noise can clearly delineate the dominant scattering mechanism
(impurities vs. interactions) -- this is of particular relevance to quantum
spin Hall measurements where conductance quantization is not perfect. The
possibility to probe both charge and spin excitations in a wide range of length
scales opens new pathways to bridging the large gap between atomic scale
resolution of scanning probes and global transport measurements.
| cond-mat.mes-hall | the study of exotic onedimensional states particularly those at the edges of topological materials demand new experimental probes that can access the interplay between charge and spin degrees of freedom one potential approach is to use a single spin probe such as a nitrogen vacancy center in diamond which has recently emerged as a versatile tool to probe nanoscale systems in a noninvasive fashion here we present a theory describing how noise magnetometry with spin probes can directly address several questions that have emerged in experimental studies of 1d systems including those in topological materials we show that by controlling the spin degree of freedom of the probe it is possible to measure locally and independently local charge and spin correlations of 1d systems visualization of 1d edge states as well as sampling correlations with wavevector resolution can be achieved by tuning the probetosample distance furthermore temperaturedependent measurements of magnetic noise can clearly delineate the dominant scattering mechanism impurities vs interactions this is of particular relevance to quantum spin hall measurements where conductance quantization is not perfect the possibility to probe both charge and spin excitations in a wide range of length scales opens new pathways to bridging the large gap between atomic scale resolution of scanning probes and global transport measurements | [['the', 'study', 'of', 'exotic', 'onedimensional', 'states', 'particularly', 'those', 'at', 'the', 'edges', 'of', 'topological', 'materials', 'demand', 'new', 'experimental', 'probes', 'that', 'can', 'access', 'the', 'interplay', 'between', 'charge', 'and', 'spin', 'degrees', 'of', 'freedom', 'one', 'potential', 'approach', 'is', 'to', 'use', 'a', 'single', 'spin', 'probe', 'such', 'as', 'a', 'nitrogen', 'vacancy', 'center', 'in', 'diamond', 'which', 'has', 'recently', 'emerged', 'as', 'a', 'versatile', 'tool', 'to', 'probe', 'nanoscale', 'systems', 'in', 'a', 'noninvasive', 'fashion', 'here', 'we', 'present', 'a', 'theory', 'describing', 'how', 'noise', 'magnetometry', 'with', 'spin', 'probes', 'can', 'directly', 'address', 'several', 'questions', 'that', 'have', 'emerged', 'in', 'experimental', 'studies', 'of', '1d', 'systems', 'including', 'those', 'in', 'topological', 'materials', 'we', 'show', 'that', 'by', 'controlling', 'the', 'spin', 'degree', 'of', 'freedom', 'of', 'the', 'probe', 'it', 'is', 'possible', 'to', 'measure', 'locally', 'and', 'independently', 'local', 'charge', 'and', 'spin', 'correlations', 'of', '1d', 'systems', 'visualization', 'of', '1d', 'edge', 'states', 'as', 'well', 'as', 'sampling', 'correlations', 'with', 'wavevector', 'resolution', 'can', 'be', 'achieved', 'by', 'tuning', 'the', 'probetosample', 'distance', 'furthermore', 'temperaturedependent', 'measurements', 'of', 'magnetic', 'noise', 'can', 'clearly', 'delineate', 'the', 'dominant', 'scattering', 'mechanism', 'impurities', 'vs', 'interactions', 'this', 'is', 'of', 'particular', 'relevance', 'to', 'quantum', 'spin', 'hall', 'measurements', 'where', 'conductance', 'quantization', 'is', 'not', 'perfect', 'the', 'possibility', 'to', 'probe', 'both', 'charge', 'and', 'spin', 'excitations', 'in', 'a', 'wide', 'range', 'of', 'length', 'scales', 'opens', 'new', 'pathways', 'to', 'bridging', 'the', 'large', 'gap', 'between', 'atomic', 'scale', 'resolution', 'of', 'scanning', 'probes', 'and', 'global', 'transport', 'measurements']] | [-0.14373483156379294, 0.21682776421721212, -0.07124979056829533, 0.028525011673000294, -0.04394966915638243, -0.1738940050849753, 0.04004415904196041, 0.3706757406223018, -0.31262849835829004, -0.332392730291103, 0.026832591880761723, -0.3076001048635391, -0.11790202772057222, 0.18931453885130972, 0.031682044610831336, 0.04874878378046491, -0.004697137006328958, -0.049569351136235035, -0.06764112322583521, -0.14999695567875412, 0.2743419865675941, 0.0654065858937416, 0.29917115841493436, 0.11864901198431743, 0.0739033316681796, 0.03541870071813111, 0.04453330280665326, 0.054544391549717616, -0.1355352055262297, 0.08635365791669583, 0.2779518037381189, -0.001132516848073469, 0.2034069107538801, -0.441896612764782, -0.26096539878643943, 0.04832879372713651, 0.1632858240111815, 0.18826690842496824, -0.07726988654641073, -0.26317199377201816, 0.046789748541198634, -0.13656232151997627, -0.14407554478715592, -0.14756250167177257, 0.008186773323096442, -0.005742054558977026, -0.24181223495629445, 0.08748098523731197, 0.025932142716805977, 0.06750297384329418, -0.04379950554697152, -0.06382625317201018, -0.050196905507842934, 0.12046649257136041, -0.009525731932570478, 0.036609059775146655, 0.1746855002510145, -0.1571157258213608, -0.1934573706526362, 0.34233529320410433, -0.04941647991254458, -0.1690789287505998, 0.2243860691799054, -0.17331833410257766, -0.09611251962402068, 0.07373987664402379, 0.14083645488964494, 0.11698562558519685, -0.17003261378273296, 0.05338210448422977, -0.01400441000176267, 0.17604497626688115, 0.03811196162739451, 0.16478268089108344, 0.2803800177464694, 0.21395560021521037, 0.08979501373849598, 0.1155896774946681, -0.14630580408210642, -0.05905741830582629, -0.21604306723975458, -0.17467566026304077, -0.2273041662788769, 0.08357826815329114, -0.0559573122009859, -0.13133936562195808, 0.4183636493936746, 0.17006390624220585, 0.20472774349629738, -0.07202309145872432, 0.2809894038165668, 0.06160810418367404, 0.09294921702261731, -0.008634871173146848, 0.2278340254298972, 0.18842198622360012, 0.07402949568029864, -0.2561091712247845, 0.04338349208403467, -0.019152235837821007] |
1,803.01522 | (Pb1-xBix)(Ti1-xMnx)O3: Competing mechanism of Tetragonal-Cubic phase on
A/B site modifications | Structural, vibrational and dielectric properties of (Pb1-xBix)(Ti1-xMnx)O3
(PBTM) (0 x 0.50) polycrystalline ceramics have been examined as a function of
temperature. Synchrotron-based powder x-ray diffraction was employed to confirm
phase purity and crystal structure of samples. Tetragonality (c/a ratio) of the
PBTM system exhibit an increase 1.065, 1.066 for x = 0.06 and 0.09 compositions
respectively, compare to 1.064 for x = 0 sample. Curie point was found ~763 K
and 773 K for x = 0.06 and 0.09 samples respectively. Though, tetragonality
start to decreasing from samples with x 0.18, Curie point of the samples
started decreasing for x 0.12. Temperature-dependent x-ray diffraction reveals
the structural change from tetragonal to cubic structure. Unit cell volume was
found to decrease with increasing temperature; indicate these materials are
negative thermal expansion type until phase transition temperature, with
negative thermal coefficients are -1.571*10-5 /K, -2.44*10-5 /K, and
-5.025*10-6 /K for x = 0, 0.06, and 0.09 samples respectively. Raman spectra
showed softening of the transverse optical phonon modes and increase in the
full width at half maxima with the increase in composition. Field-emission
scanning electron microscope equipped with energy dispersive x-ray spectrometer
(EDS) confirmed compositional homogeneity and dense type microstructure.
| cond-mat.mtrl-sci | structural vibrational and dielectric properties of pb1xbixti1xmnxo3 pbtm 0 x 050 polycrystalline ceramics have been examined as a function of temperature synchrotronbased powder xray diffraction was employed to confirm phase purity and crystal structure of samples tetragonality ca ratio of the pbtm system exhibit an increase 1065 1066 for x 006 and 009 compositions respectively compare to 1064 for x 0 sample curie point was found 763 k and 773 k for x 006 and 009 samples respectively though tetragonality start to decreasing from samples with x 018 curie point of the samples started decreasing for x 012 temperaturedependent xray diffraction reveals the structural change from tetragonal to cubic structure unit cell volume was found to decrease with increasing temperature indicate these materials are negative thermal expansion type until phase transition temperature with negative thermal coefficients are 1571105 k 244105 k and 5025106 k for x 0 006 and 009 samples respectively raman spectra showed softening of the transverse optical phonon modes and increase in the full width at half maxima with the increase in composition fieldemission scanning electron microscope equipped with energy dispersive xray spectrometer eds confirmed compositional homogeneity and dense type microstructure | [['structural', 'vibrational', 'and', 'dielectric', 'properties', 'of', 'pb1xbixti1xmnxo3', 'pbtm', '0', 'x', '050', 'polycrystalline', 'ceramics', 'have', 'been', 'examined', 'as', 'a', 'function', 'of', 'temperature', 'synchrotronbased', 'powder', 'xray', 'diffraction', 'was', 'employed', 'to', 'confirm', 'phase', 'purity', 'and', 'crystal', 'structure', 'of', 'samples', 'tetragonality', 'ca', 'ratio', 'of', 'the', 'pbtm', 'system', 'exhibit', 'an', 'increase', '1065', '1066', 'for', 'x', '006', 'and', '009', 'compositions', 'respectively', 'compare', 'to', '1064', 'for', 'x', '0', 'sample', 'curie', 'point', 'was', 'found', '763', 'k', 'and', '773', 'k', 'for', 'x', '006', 'and', '009', 'samples', 'respectively', 'though', 'tetragonality', 'start', 'to', 'decreasing', 'from', 'samples', 'with', 'x', '018', 'curie', 'point', 'of', 'the', 'samples', 'started', 'decreasing', 'for', 'x', '012', 'temperaturedependent', 'xray', 'diffraction', 'reveals', 'the', 'structural', 'change', 'from', 'tetragonal', 'to', 'cubic', 'structure', 'unit', 'cell', 'volume', 'was', 'found', 'to', 'decrease', 'with', 'increasing', 'temperature', 'indicate', 'these', 'materials', 'are', 'negative', 'thermal', 'expansion', 'type', 'until', 'phase', 'transition', 'temperature', 'with', 'negative', 'thermal', 'coefficients', 'are', '1571105', 'k', '244105', 'k', 'and', '5025106', 'k', 'for', 'x', '0', '006', 'and', '009', 'samples', 'respectively', 'raman', 'spectra', 'showed', 'softening', 'of', 'the', 'transverse', 'optical', 'phonon', 'modes', 'and', 'increase', 'in', 'the', 'full', 'width', 'at', 'half', 'maxima', 'with', 'the', 'increase', 'in', 'composition', 'fieldemission', 'scanning', 'electron', 'microscope', 'equipped', 'with', 'energy', 'dispersive', 'xray', 'spectrometer', 'eds', 'confirmed', 'compositional', 'homogeneity', 'and', 'dense', 'type', 'microstructure']] | [-0.086319692974518, 0.2240907521925309, -0.05034101672078434, -0.053285305779794914, -0.02293669412549781, -0.13269110813638882, 0.15969394737070328, 0.4871842111019712, -0.25246806548369166, -0.3200914204316704, 0.03213502845579856, -0.43101982789996424, 0.0002630369541676421, 0.16137917837569196, 0.02618633364082167, 0.0293249037067749, -0.03361898671443525, -0.029864939517880742, -0.1393049642345623, -0.22160845751580047, 0.18902664422792823, 0.048246061252920254, 0.32557426967220016, 0.03006387356037617, 0.07419064688300224, -0.005384138625193277, 0.061001364432128245, 0.03460248709705315, -0.19471679383943985, -0.026983324328045313, 0.26276352587891255, -0.07303020274511686, 0.15664992125851934, -0.3155567849494171, -0.2301472177042773, 0.021101401012243802, 0.08942849521868323, -0.048026034161279985, -0.0480886445815773, -0.1913410769383374, 0.13221225384622812, -0.06163103319214363, -0.1478492115869334, -0.05520635152627763, 0.03726179287278731, -0.0018495766966799764, -0.26296662760371536, 0.159856237417185, -0.0001688486259234579, 0.16870584762900284, -0.14257294005763374, -0.23895878604257872, -0.09530380484311057, 0.010029674341019831, 0.007924901015174231, 0.10856448016619603, 0.16956177787414115, -0.003772436865409346, -0.027652002031620788, 0.334431947419714, -0.06943966485805025, 0.04274326465827854, 0.12777627836208252, -0.25066974066982145, -0.08157316901855857, 0.27676455413334466, 0.09885244296440904, 0.09216553254028488, -0.11053593556555968, 0.05869438363159517, 0.05471184839322967, 0.3043938548049865, 0.12325225491076708, 0.040765919595172534, 0.19970596069715132, 0.1459159327928271, -0.03854421696159989, 0.13944465935101585, -0.1666191143253328, 0.0663636409524387, -0.17637533169533862, -0.15480314949772467, -0.14555542832056648, 0.12058533570900755, -0.16088083197881994, -0.1548139561321525, 0.2546390526149863, 0.05562841068512123, 0.21906642471685223, -0.0013764903831638788, 0.18223294637435558, 0.06702554405262498, 0.04050429285699992, -0.00751681622779487, 0.20735850911587478, 0.22738813227624632, 0.17198040515772606, -0.2676795081014892, 0.07498726066070575, -0.016362656549991746] |
1,803.01523 | Riemannian optimal model reduction of stable linear systems | In this paper, we develop a method for solving the problem of minimizing the
$H^2$ error norm between the transfer functions of original and reduced systems
on the set of stable matrices and two Euclidean spaces. That is, we develop a
method for identifying the optimal reduced system from all stable linear
systems. However, it is difficult to develop an algorithm for solving this
problem, because the set of stable matrices is highly non-convex. To overcome
this issue, we show that the problem can be transformed into a tractable
Riemannian optimization on the product manifold of the set of skew-symmetric
matrices, the manifold of the symmetric positive-definite matrices, and two
Euclidean spaces. The stability of the reduced systems constructed using the
optimal solutions to our problem is preserved. To solve the reduced problem,
the Riemannian gradient and Hessian are derived and a Riemannian trust-region
method is developed. The initial point in the proposed approach is selected
using the output from the balanced truncation (BT) method. Numerical
experiments demonstrate that our method considerably improves the results given
by BT in the sense of the $H^2$ norm, and also provides reduced systems that
are globally near-optimal solutions to the problem of minimizing the
$H^{\infty}$ error norm. Moreover, we show that our method provides a better
reduced model than BT from the viewpoint of the frequency response.
| math.OC | in this paper we develop a method for solving the problem of minimizing the h2 error norm between the transfer functions of original and reduced systems on the set of stable matrices and two euclidean spaces that is we develop a method for identifying the optimal reduced system from all stable linear systems however it is difficult to develop an algorithm for solving this problem because the set of stable matrices is highly nonconvex to overcome this issue we show that the problem can be transformed into a tractable riemannian optimization on the product manifold of the set of skewsymmetric matrices the manifold of the symmetric positivedefinite matrices and two euclidean spaces the stability of the reduced systems constructed using the optimal solutions to our problem is preserved to solve the reduced problem the riemannian gradient and hessian are derived and a riemannian trustregion method is developed the initial point in the proposed approach is selected using the output from the balanced truncation bt method numerical experiments demonstrate that our method considerably improves the results given by bt in the sense of the h2 norm and also provides reduced systems that are globally nearoptimal solutions to the problem of minimizing the hinfty error norm moreover we show that our method provides a better reduced model than bt from the viewpoint of the frequency response | [['in', 'this', 'paper', 'we', 'develop', 'a', 'method', 'for', 'solving', 'the', 'problem', 'of', 'minimizing', 'the', 'h2', 'error', 'norm', 'between', 'the', 'transfer', 'functions', 'of', 'original', 'and', 'reduced', 'systems', 'on', 'the', 'set', 'of', 'stable', 'matrices', 'and', 'two', 'euclidean', 'spaces', 'that', 'is', 'we', 'develop', 'a', 'method', 'for', 'identifying', 'the', 'optimal', 'reduced', 'system', 'from', 'all', 'stable', 'linear', 'systems', 'however', 'it', 'is', 'difficult', 'to', 'develop', 'an', 'algorithm', 'for', 'solving', 'this', 'problem', 'because', 'the', 'set', 'of', 'stable', 'matrices', 'is', 'highly', 'nonconvex', 'to', 'overcome', 'this', 'issue', 'we', 'show', 'that', 'the', 'problem', 'can', 'be', 'transformed', 'into', 'a', 'tractable', 'riemannian', 'optimization', 'on', 'the', 'product', 'manifold', 'of', 'the', 'set', 'of', 'skewsymmetric', 'matrices', 'the', 'manifold', 'of', 'the', 'symmetric', 'positivedefinite', 'matrices', 'and', 'two', 'euclidean', 'spaces', 'the', 'stability', 'of', 'the', 'reduced', 'systems', 'constructed', 'using', 'the', 'optimal', 'solutions', 'to', 'our', 'problem', 'is', 'preserved', 'to', 'solve', 'the', 'reduced', 'problem', 'the', 'riemannian', 'gradient', 'and', 'hessian', 'are', 'derived', 'and', 'a', 'riemannian', 'trustregion', 'method', 'is', 'developed', 'the', 'initial', 'point', 'in', 'the', 'proposed', 'approach', 'is', 'selected', 'using', 'the', 'output', 'from', 'the', 'balanced', 'truncation', 'bt', 'method', 'numerical', 'experiments', 'demonstrate', 'that', 'our', 'method', 'considerably', 'improves', 'the', 'results', 'given', 'by', 'bt', 'in', 'the', 'sense', 'of', 'the', 'h2', 'norm', 'and', 'also', 'provides', 'reduced', 'systems', 'that', 'are', 'globally', 'nearoptimal', 'solutions', 'to', 'the', 'problem', 'of', 'minimizing', 'the', 'hinfty', 'error', 'norm', 'moreover', 'we', 'show', 'that', 'our', 'method', 'provides', 'a', 'better', 'reduced', 'model', 'than', 'bt', 'from', 'the', 'viewpoint', 'of', 'the', 'frequency', 'response']] | [-0.09267029506840377, 0.007015227186911943, -0.07075871721086255, 0.07309304172511995, -0.03467975511739496, -0.11417441708908882, 0.03417422825389492, 0.36001048868222696, -0.3217583543654265, -0.2643083169241436, 0.14463016371519188, -0.24964061598958714, -0.1979390996067585, 0.21063711417394057, -0.09737437093593014, 0.10595220303678486, 0.10395999348942755, 0.010782711516575156, -0.14791103221016652, -0.27531884015687474, 0.3713920746855105, 0.01976401761307248, 0.2653211870908438, 0.014152691096699397, 0.1523291192736776, -0.03002313146446665, 0.008393013980821706, 0.04911976739614537, -0.08551560985483775, 0.18788133755047706, 0.24913429464920359, 0.16950165650424814, 0.29623906540551354, -0.385654956829967, -0.17957983967893856, 0.1531837451911997, 0.13140343966889695, 0.09015785719800208, -0.03550917282388712, -0.2687843569604281, 0.1380844445655904, -0.1232265375978646, -0.10319206587779003, -0.08773641509469599, -0.0221590525699347, -0.023137477700012305, -0.32037483925627647, 0.07136668930499061, 0.058729808504202605, -0.024660732093512445, -0.12674140834341024, -0.1319188482546971, 0.004390383305560265, 0.09607703986798047, 0.020537249735103354, 0.05186624170320491, 0.0993794165115105, -0.052743635935517626, -0.06867464401615767, 0.3762937586746245, -0.03821217463941399, -0.30495610283937175, 0.13530087774415733, -0.0830321919617875, -0.09142983209520546, 0.13787177745169693, 0.18541690639904118, 0.1831466815492604, -0.1303487983714149, 0.10708372983884017, -0.05641888443746471, 0.15482640174702414, 0.01282288659526135, -0.02370205383964016, 0.08889025878930365, 0.16736029172560457, 0.1820130436078346, 0.15940042116199038, -0.015907084940278895, -0.10454510898749245, -0.2609850229096732, -0.14323616869452444, -0.20600667133995948, 0.014504879545711447, -0.11464747923063053, -0.15979054061296796, 0.3887002700783861, 0.13814799263907065, 0.1862875406513922, 0.10752673196839169, 0.2899591374682911, 0.1568027706881107, 0.02160012277142544, 0.10306572398569967, 0.2243497004071417, 0.14457395595153294, 0.07142535998095159, -0.2520330900414202, 0.0160706344447265, 0.13363238845236733] |
1,803.01524 | Automatic Continuity of $ \ast $-Representations for Discrete Twisted $
C^{\ast} $-Dynamical Systems | In this paper, we will establish the relatively unknown result that every $
\ast $-representation for a discrete twisted $ C^{\ast} $-dynamical system $
(G,A,\alpha,\omega) $ is automatically contractive with respect to the $ L^{1}
$-norm on $ {C_{c}}(G,A) $.
| math.OA math.RT | in this paper we will establish the relatively unknown result that every ast representation for a discrete twisted cast dynamical system gaalphaomega is automatically contractive with respect to the l1 norm on c_cga | [['in', 'this', 'paper', 'we', 'will', 'establish', 'the', 'relatively', 'unknown', 'result', 'that', 'every', 'ast', 'representation', 'for', 'a', 'discrete', 'twisted', 'cast', 'dynamical', 'system', 'gaalphaomega', 'is', 'automatically', 'contractive', 'with', 'respect', 'to', 'the', 'l1', 'norm', 'on', 'c_cga']] | [-0.13401990343305853, 0.09799235653612882, -0.10212592273713991, 0.06830565114655802, -0.08885638259591595, -0.10839111181051139, 0.0268016851154126, 0.4028212399251999, -0.3565542426320814, -0.19168399273785913, 0.17453107892370393, -0.20884299422464064, -0.16852752419729386, 0.16815950105627697, -0.1873103699556762, 0.05845154407283952, 0.12974163637526573, 0.1225052742032154, -0.14725815714336932, -0.18253032256278298, 0.3837963143784192, -0.01905376292885311, 0.1531795623501943, -0.014933334182827704, 0.12842086765674815, 0.021024894543863352, 0.01022183880089752, -0.033712416646942016, -0.09672754940754291, 0.15073102811772016, 0.25104345219029534, 0.09891847934153292, 0.3252637047440775, -0.3608740010071591, -0.1299297166687827, 0.16263583772665552, 0.1347142248865097, 0.006991645501505944, -0.054578972698730084, -0.29845691886880704, 0.1686339798203159, -0.16732142318881327, -0.12508261867708736, -0.09640098651570658, 0.003498102027562357, -0.01099052646708104, -0.3685322704334413, 0.004171294400528554, 0.11051980701496734, 0.018604670824002353, -0.14782749693239888, -0.05847409180921292, 0.0294178600513166, 0.09599629430581004, 0.019223615549685012, 0.147910300371868, 0.054228436830829105, -0.03433530909129449, -0.048017157196638086, 0.3387911563078242, -0.07535543842917128, -0.2609202772859604, 0.18071916567221766, -0.11406994616282323, -0.23204751303719898, 0.07017030404700388, 0.16516039015785342, 0.09911253270242483, -0.15080305807773145, 0.1278004870119114, -0.15236182631023468, 0.19622170931148913, 0.0442465816233908, 0.021875824674122756, 0.1215537475842622, 0.14066087368935828, 0.18148410416418506, 0.15932049139613105, -0.00024342643202192362, -0.03457449275940176, -0.34173665664369063, -0.14224651205774036, -0.16290571017851752, 0.0709483177971936, -0.040304780291813995, -0.1736407287178501, 0.3719568341489761, 0.12469517232309427, 0.20350808737378928, 0.1342322820452072, 0.24075927993943613, 0.1394581160538139, 0.037400744314635956, 0.07815841100208702, 0.16757791774768022, 0.14267968638770043, 0.08336646886422269, -0.1856792999521619, 0.03662978141989198, 0.17091196625223082] |
1,803.01525 | Vortex rings in fragmentation regions in heavy-ion collisions at
$\sqrt{s_{NN}}=$ 39 GeV | Vorticity generated in heavy-ion collisions at energy of $\sqrt{s_{NN}}=$ 39
GeV is studied. Simulations are performed within a model of the three-fluid
dynamics. A peculiar structure consisting of two vortex rings is found: one
ring in the target fragmentation region and another one in the projectile
fragmentation region. These rings are also formed in central collisions. The
matter rotation is opposite in this two rings. These vortex rings are already
formed at the early stage of the collision together with primordial
fragmentation regions. The average vorticity, responsible for the global
polarization of the observed $\Lambda$ and $\bar{\Lambda}$, is also studied. In
the semi-central collisions the average vorticity in the midrapidity region
turns out to be more than an order of magnitude lower than the total one. The
total vorticity is dominated by the contributions of the fragmentation regions
and is produced because of asymmetry of the vortex rings in noncentral
collisions. This suggests that in semi-central collisions the global
polarization in the fragmentation regions should be at least an order of
magnitude higher than that observed by the STAR collaboration in the
midrapidity. This polarization should be asymmetrical in the reaction plain and
correlate with the corresponding directed flow.
| nucl-th hep-ph | vorticity generated in heavyion collisions at energy of sqrts_nn 39 gev is studied simulations are performed within a model of the threefluid dynamics a peculiar structure consisting of two vortex rings is found one ring in the target fragmentation region and another one in the projectile fragmentation region these rings are also formed in central collisions the matter rotation is opposite in this two rings these vortex rings are already formed at the early stage of the collision together with primordial fragmentation regions the average vorticity responsible for the global polarization of the observed lambda and barlambda is also studied in the semicentral collisions the average vorticity in the midrapidity region turns out to be more than an order of magnitude lower than the total one the total vorticity is dominated by the contributions of the fragmentation regions and is produced because of asymmetry of the vortex rings in noncentral collisions this suggests that in semicentral collisions the global polarization in the fragmentation regions should be at least an order of magnitude higher than that observed by the star collaboration in the midrapidity this polarization should be asymmetrical in the reaction plain and correlate with the corresponding directed flow | [['vorticity', 'generated', 'in', 'heavyion', 'collisions', 'at', 'energy', 'of', 'sqrts_nn', '39', 'gev', 'is', 'studied', 'simulations', 'are', 'performed', 'within', 'a', 'model', 'of', 'the', 'threefluid', 'dynamics', 'a', 'peculiar', 'structure', 'consisting', 'of', 'two', 'vortex', 'rings', 'is', 'found', 'one', 'ring', 'in', 'the', 'target', 'fragmentation', 'region', 'and', 'another', 'one', 'in', 'the', 'projectile', 'fragmentation', 'region', 'these', 'rings', 'are', 'also', 'formed', 'in', 'central', 'collisions', 'the', 'matter', 'rotation', 'is', 'opposite', 'in', 'this', 'two', 'rings', 'these', 'vortex', 'rings', 'are', 'already', 'formed', 'at', 'the', 'early', 'stage', 'of', 'the', 'collision', 'together', 'with', 'primordial', 'fragmentation', 'regions', 'the', 'average', 'vorticity', 'responsible', 'for', 'the', 'global', 'polarization', 'of', 'the', 'observed', 'lambda', 'and', 'barlambda', 'is', 'also', 'studied', 'in', 'the', 'semicentral', 'collisions', 'the', 'average', 'vorticity', 'in', 'the', 'midrapidity', 'region', 'turns', 'out', 'to', 'be', 'more', 'than', 'an', 'order', 'of', 'magnitude', 'lower', 'than', 'the', 'total', 'one', 'the', 'total', 'vorticity', 'is', 'dominated', 'by', 'the', 'contributions', 'of', 'the', 'fragmentation', 'regions', 'and', 'is', 'produced', 'because', 'of', 'asymmetry', 'of', 'the', 'vortex', 'rings', 'in', 'noncentral', 'collisions', 'this', 'suggests', 'that', 'in', 'semicentral', 'collisions', 'the', 'global', 'polarization', 'in', 'the', 'fragmentation', 'regions', 'should', 'be', 'at', 'least', 'an', 'order', 'of', 'magnitude', 'higher', 'than', 'that', 'observed', 'by', 'the', 'star', 'collaboration', 'in', 'the', 'midrapidity', 'this', 'polarization', 'should', 'be', 'asymmetrical', 'in', 'the', 'reaction', 'plain', 'and', 'correlate', 'with', 'the', 'corresponding', 'directed', 'flow']] | [-0.15000523998134127, 0.183868290907522, -0.13352597091974686, 0.09764265513279237, 0.04503245460104675, -0.0358686466074207, -0.12455191029394841, 0.34063423163083206, -0.24262255628654106, -0.26019238949233864, 0.004389424081751375, -0.30393937883907973, 0.04586916317199193, 0.14047616593722234, 0.05612238298299554, -0.010834207152245782, 0.05003742418069411, 0.051649168763197396, -0.014810080263861946, -0.2274883679434863, 0.32530831485336187, 0.11471564407535272, 0.2232105832046188, 0.08043028400209382, 0.012306533543271336, -0.0477884132333156, -0.03394164014186467, 0.04688506312761924, -0.1337211510128062, 0.06927224829422671, 0.2348530343686928, 0.014621002264208238, 0.1992076663730371, -0.4170319153716666, -0.15529082884459788, 0.11857001357665052, 0.179990361053871, 0.0936216200940573, -0.05680332313230011, -0.2366133675391051, 0.11436152992648395, -0.20128168376284328, -0.14533348879940697, 0.04095711025769761, 0.07430556767512506, 0.044670560233407285, -0.27889403774217003, 0.14280171627055938, 0.04779038794400713, 0.0698965640584166, -0.03952123350861609, -0.13063074490897844, -0.12340621252183863, 0.022874395770778946, 0.05111794249943209, 0.08185879383356096, 0.18617066455040895, -0.16613987809100922, -0.08654477981026823, 0.3996917633199362, -0.003803584774901702, -0.11713781928521903, 0.16623716978338693, -0.25510305677769923, -0.11461507776943995, 0.21385721743326802, 0.19100700854967306, 0.14244741614426523, -0.15139737554700652, -0.022147525271550568, -0.04523583491105848, 0.14503311586271428, 0.15209206307292847, 0.024706079540353025, 0.2496687011891536, 0.17578120378721224, 0.025353587089935972, 0.13314509172584563, -0.13912010892357526, -0.13397783004496266, -0.3367531606459513, -0.10342933357828975, -0.12308492698243365, -0.0023697884431595553, -0.07314709084425543, -0.03267541444443878, 0.36913875280762437, 0.08477036876781802, 0.26721142594256186, -0.06645663389842489, 0.2838021468408593, 0.09072700650875817, 0.11316438601001273, 0.12104252613051303, 0.31321902688704994, 0.14396872899340624, 0.1605313622682875, -0.24117392977821317, 0.08266156625901185, 0.03251021579563169] |
1,803.01526 | Blind Channel Equalization using Variational Autoencoders | A new maximum likelihood estimation approach for blind channel equalization,
using variational autoencoders (VAEs), is introduced. Significant and
consistent improvements in the error rate of the reconstructed symbols,
compared to constant modulus equalizers, are demonstrated. In fact, for the
channels that were examined, the performance of the new VAE blind channel
equalizer was close to the performance of a nonblind adaptive linear minimum
mean square error equalizer. The new equalization method enables a
significantly lower latency channel acquisition compared to the constant
modulus algorithm (CMA). The VAE uses a convolutional neural network with two
layers and a very small number of free parameters. Although the computational
complexity of the new equalizer is higher compared to CMA, it is still
reasonable, and the number of free parameters to estimate is small.
| eess.SP cs.IT cs.LG math.IT | a new maximum likelihood estimation approach for blind channel equalization using variational autoencoders vaes is introduced significant and consistent improvements in the error rate of the reconstructed symbols compared to constant modulus equalizers are demonstrated in fact for the channels that were examined the performance of the new vae blind channel equalizer was close to the performance of a nonblind adaptive linear minimum mean square error equalizer the new equalization method enables a significantly lower latency channel acquisition compared to the constant modulus algorithm cma the vae uses a convolutional neural network with two layers and a very small number of free parameters although the computational complexity of the new equalizer is higher compared to cma it is still reasonable and the number of free parameters to estimate is small | [['a', 'new', 'maximum', 'likelihood', 'estimation', 'approach', 'for', 'blind', 'channel', 'equalization', 'using', 'variational', 'autoencoders', 'vaes', 'is', 'introduced', 'significant', 'and', 'consistent', 'improvements', 'in', 'the', 'error', 'rate', 'of', 'the', 'reconstructed', 'symbols', 'compared', 'to', 'constant', 'modulus', 'equalizers', 'are', 'demonstrated', 'in', 'fact', 'for', 'the', 'channels', 'that', 'were', 'examined', 'the', 'performance', 'of', 'the', 'new', 'vae', 'blind', 'channel', 'equalizer', 'was', 'close', 'to', 'the', 'performance', 'of', 'a', 'nonblind', 'adaptive', 'linear', 'minimum', 'mean', 'square', 'error', 'equalizer', 'the', 'new', 'equalization', 'method', 'enables', 'a', 'significantly', 'lower', 'latency', 'channel', 'acquisition', 'compared', 'to', 'the', 'constant', 'modulus', 'algorithm', 'cma', 'the', 'vae', 'uses', 'a', 'convolutional', 'neural', 'network', 'with', 'two', 'layers', 'and', 'a', 'very', 'small', 'number', 'of', 'free', 'parameters', 'although', 'the', 'computational', 'complexity', 'of', 'the', 'new', 'equalizer', 'is', 'higher', 'compared', 'to', 'cma', 'it', 'is', 'still', 'reasonable', 'and', 'the', 'number', 'of', 'free', 'parameters', 'to', 'estimate', 'is', 'small']] | [-0.12199846556087812, 0.016875319415703416, -0.057196508423210335, 0.06815977915315531, -0.10383203302223522, -0.22641906252918909, 0.08654378770778959, 0.40543154750843174, -0.28135214873517933, -0.3113209900374596, 0.09846830233895722, -0.23402359658279098, -0.17573824519013914, 0.1924692988825532, -0.16411514874691, 0.14996251663766227, 0.09922985006840183, 0.06610132820474414, -0.13080798224008713, -0.30143923411289086, 0.21849275952778183, 0.13187639687496883, 0.33167131688589085, -0.028682028136413115, 0.12393395089401076, -0.053839870330949245, -0.03055258816681229, -0.03944261617636165, -0.10002567490698241, 0.11712859341597114, 0.21917262907462337, 0.12417412548899077, 0.30130771812624657, -0.3386961243043725, -0.25186709576071453, 0.07067779477220029, 0.15138777644248105, 0.08661852793839689, -0.025740693086901537, -0.27453426144157467, 0.14225003379755297, -0.17926377202742375, 0.020588052813680126, -0.0169275693093928, -0.06638690458539014, -0.001011219541900433, -0.34173597822395657, 0.11815680097430371, 0.00959388311379231, 0.02163389401617818, -0.03763906882287791, -0.2173836100488328, 0.03702100273490382, 0.1212624421576038, 0.026027589577894944, 0.09192105589004664, 0.06708893514453218, -0.1606613107706205, -0.07536527002409388, 0.2953830719137421, -0.09571083589600256, -0.23065997216707237, 0.16371790352411783, -0.0537638298737315, -0.06677876371138085, 0.21009525522732964, 0.21263965845752794, 0.07952128601475404, -0.16800573708202976, 0.01346663770919594, 0.005802017213919988, 0.2341724998389299, 0.0555560013350959, 0.06464176115651543, 0.06865861918060825, 0.21421561219478744, 0.10095293910887379, 0.1584380523230021, -0.1882588476444093, -0.08021684802175653, -0.23353932734507207, -0.15168956264208716, -0.21594485365964758, -0.06781895733259331, -0.1210035166520706, -0.1517441557863584, 0.36856204932197356, 0.1452872957353695, 0.16472238802033154, 0.15019930222143346, 0.35139974974131644, 0.09382585289959725, 0.12055159779623724, 0.12422327150304158, 0.2503131809554851, 0.1713056248308231, 0.05494919798981685, -0.21349737510944788, 0.08467842921292267, 0.046504572259548765] |
1,803.01527 | A comment on 'Testing Goodwin: growth cycles in ten OECD countries' | We revisit the results of Harvie (2000) and show how correcting for a
reporting mistake in some of the estimated parameter values leads to
significantly different conclusions, including realistic parameter values for
the Philips curve and estimated equilibrium employment rates exhibiting on
average one tenth of the relative error of those obtained in Harvie (2000).
| econ.EM q-fin.EC | we revisit the results of harvie 2000 and show how correcting for a reporting mistake in some of the estimated parameter values leads to significantly different conclusions including realistic parameter values for the philips curve and estimated equilibrium employment rates exhibiting on average one tenth of the relative error of those obtained in harvie 2000 | [['we', 'revisit', 'the', 'results', 'of', 'harvie', '2000', 'and', 'show', 'how', 'correcting', 'for', 'a', 'reporting', 'mistake', 'in', 'some', 'of', 'the', 'estimated', 'parameter', 'values', 'leads', 'to', 'significantly', 'different', 'conclusions', 'including', 'realistic', 'parameter', 'values', 'for', 'the', 'philips', 'curve', 'and', 'estimated', 'equilibrium', 'employment', 'rates', 'exhibiting', 'on', 'average', 'one', 'tenth', 'of', 'the', 'relative', 'error', 'of', 'those', 'obtained', 'in', 'harvie', '2000']] | [-0.086246782168746, 0.06677678525447846, -0.05477631079795008, 0.07776754493401809, 0.007995965992185203, -0.10699627354571765, 0.1314044576582753, 0.3169919951395555, -0.17684544763443144, -0.3831817848438566, 0.12716492316685618, -0.26183491012250837, -0.056953240719369864, 0.28624138364737683, -0.10662108515812592, 0.04880774251915599, 0.06960519404912537, 0.03405495140362869, -0.12199397239495408, -0.27354561583435333, 0.282080378992991, 0.062159618430516934, 0.2638376812365922, 0.015099514030258764, 0.060252968814562664, 0.001792807639999823, -0.09216624530540271, 0.013118691979484124, -0.20708948903801766, 0.11413944162936374, 0.18761630234393206, 0.10121638292277402, 0.25876559699800883, -0.33048427977006545, -0.19102656713856214, 0.0670226597819816, 0.07485335775735703, 0.12395776748995889, -0.019150728539733045, -0.23825755543075502, 0.08190222625535998, -0.19436357813802632, -0.1312523909336464, -0.014752660471607339, 0.05808708914978938, 0.043091550810177896, -0.27508276155726474, 0.12639184225011957, 0.0353117532569079, 0.07749437697401101, -0.10000792667269706, -0.2278458509340205, 0.011378310451453382, 0.11969672987576235, 0.06026033665561541, -0.003193095394156196, 0.12071307295594703, -0.1512620092708279, -0.07366345485841685, 0.37498107801445507, -0.07211596738885749, -0.12190498597919941, 0.13047513474117625, -0.14776939082552087, -0.07711212045767091, 0.13982180231674152, 0.14835163563151252, 0.07058312668549743, -0.08926942893727259, -0.002823826655830172, 0.005796749966049736, 0.16590784205631776, 0.08712076847864823, 0.0146276631815867, 0.10465876128185879, 0.064536099542271, -0.00494716235182502, 0.13584629656662317, -0.12982788676904006, -0.13428639082068747, -0.24945097607983785, -0.09771014331331984, -0.09496831663630226, 0.050643386983905324, -0.14458102563512512, -0.09402955694293434, 0.39555862979455425, 0.21065953953022307, 0.2688705819574269, 0.077767239629545, 0.22672151516784322, 0.1121168343688954, 0.009447878798131238, 0.05217013621533459, 0.30739044685350647, 0.07700851361521266, 0.04791246335106817, -0.19590805118734186, 0.11439541789957068, 0.03309494624422355] |
1,803.01528 | Network Phenotyping for Network Traffic Classification and Anomaly
Detection | This paper proposes to develop a network phenotyping mechanism based on
network resource usage analysis and identify abnormal network traffic. The
network phenotyping may use different metrics in the cyber physical system
(CPS), including resource and network usage monitoring, physical state
estimation. The set of devices will collectively decide a holistic view of the
entire system through advanced image processing and machine learning methods.
In this paper, we choose the network traffic pattern as a study case to
demonstrate the effectiveness of the proposed method, while the methodology may
similarly apply to classification and anomaly detection based on other resource
metrics. We apply image processing and machine learning on the network resource
usage to extract and recognize communication patterns. The phenotype method is
experimented on four real-world decentralized applications. With proper length
of sampled continuous network resource usage, the overall recognition accuracy
is about 99%. Additionally, the recognition error is used to detect the anomaly
network traffic. We simulate the anomaly network resource usage that equals to
10%, 20% and 30% of the normal network resource usage. The experiment results
show the proposed anomaly detection method is efficient in detecting each
intensity of anomaly network resource usage.
| cs.NI | this paper proposes to develop a network phenotyping mechanism based on network resource usage analysis and identify abnormal network traffic the network phenotyping may use different metrics in the cyber physical system cps including resource and network usage monitoring physical state estimation the set of devices will collectively decide a holistic view of the entire system through advanced image processing and machine learning methods in this paper we choose the network traffic pattern as a study case to demonstrate the effectiveness of the proposed method while the methodology may similarly apply to classification and anomaly detection based on other resource metrics we apply image processing and machine learning on the network resource usage to extract and recognize communication patterns the phenotype method is experimented on four realworld decentralized applications with proper length of sampled continuous network resource usage the overall recognition accuracy is about 99 additionally the recognition error is used to detect the anomaly network traffic we simulate the anomaly network resource usage that equals to 10 20 and 30 of the normal network resource usage the experiment results show the proposed anomaly detection method is efficient in detecting each intensity of anomaly network resource usage | [['this', 'paper', 'proposes', 'to', 'develop', 'a', 'network', 'phenotyping', 'mechanism', 'based', 'on', 'network', 'resource', 'usage', 'analysis', 'and', 'identify', 'abnormal', 'network', 'traffic', 'the', 'network', 'phenotyping', 'may', 'use', 'different', 'metrics', 'in', 'the', 'cyber', 'physical', 'system', 'cps', 'including', 'resource', 'and', 'network', 'usage', 'monitoring', 'physical', 'state', 'estimation', 'the', 'set', 'of', 'devices', 'will', 'collectively', 'decide', 'a', 'holistic', 'view', 'of', 'the', 'entire', 'system', 'through', 'advanced', 'image', 'processing', 'and', 'machine', 'learning', 'methods', 'in', 'this', 'paper', 'we', 'choose', 'the', 'network', 'traffic', 'pattern', 'as', 'a', 'study', 'case', 'to', 'demonstrate', 'the', 'effectiveness', 'of', 'the', 'proposed', 'method', 'while', 'the', 'methodology', 'may', 'similarly', 'apply', 'to', 'classification', 'and', 'anomaly', 'detection', 'based', 'on', 'other', 'resource', 'metrics', 'we', 'apply', 'image', 'processing', 'and', 'machine', 'learning', 'on', 'the', 'network', 'resource', 'usage', 'to', 'extract', 'and', 'recognize', 'communication', 'patterns', 'the', 'phenotype', 'method', 'is', 'experimented', 'on', 'four', 'realworld', 'decentralized', 'applications', 'with', 'proper', 'length', 'of', 'sampled', 'continuous', 'network', 'resource', 'usage', 'the', 'overall', 'recognition', 'accuracy', 'is', 'about', '99', 'additionally', 'the', 'recognition', 'error', 'is', 'used', 'to', 'detect', 'the', 'anomaly', 'network', 'traffic', 'we', 'simulate', 'the', 'anomaly', 'network', 'resource', 'usage', 'that', 'equals', 'to', '10', '20', 'and', '30', 'of', 'the', 'normal', 'network', 'resource', 'usage', 'the', 'experiment', 'results', 'show', 'the', 'proposed', 'anomaly', 'detection', 'method', 'is', 'efficient', 'in', 'detecting', 'each', 'intensity', 'of', 'anomaly', 'network', 'resource', 'usage']] | [-0.1429747816443805, -0.046477421307416285, -0.05349267226836507, 0.04927050324480716, -0.10090068243042126, -0.18388796654685877, 0.096089805321541, 0.4110963474580933, -0.2551296441603055, -0.3547934432972582, 0.12957034453922212, -0.24420166484595554, -0.21677019551566562, 0.18219838513600342, -0.14979347642889332, 0.09042488111816535, 0.10716147094652964, 0.08978562897690548, -0.01773440166196885, -0.25235227158182033, 0.2858741802735453, 0.053692930113278366, 0.4386276785747578, 0.05560733034183286, 0.08837485274177063, -0.018821725711642485, -0.07010028307056669, -0.040509887250036306, -0.03624982082038712, 0.17293663193391362, 0.3265589575477058, 0.27033204987862613, 0.30099435929246815, -0.40894110268691014, -0.2501221840898625, 0.11619216474813178, 0.13624561672792698, 0.08173104178108426, 0.0004471609827490325, -0.3261396699351008, 0.08200298111441398, -0.2076383123959079, -0.020209542727307652, -0.13087518819664526, -0.016461705222848785, -0.03667782599887655, -0.2521695056126505, 0.02015829713410003, -0.016226803254853782, 0.07117545444442687, -0.04664190784240021, -0.0701827177113669, 0.028461115386308678, 0.18072266749290722, 0.01736688812920436, 0.018297991555817614, 0.22807967066005472, -0.1420464764962559, -0.18186801218552998, 0.38160595765247524, -0.03440658067149786, -0.16921067037997853, 0.19209604915751494, -0.012159516696870177, -0.17641371227138994, 0.08436293660800166, 0.28352139632839257, 0.07055721974513271, -0.2016071731763594, -0.04276475012698329, 0.0010805182622244515, 0.1934558722358386, 0.0418821133195711, 0.03174810668661585, 0.15359202714703107, 0.30239378362137653, 0.08679361067012634, 0.14350853097976096, -0.1709024421776158, -0.05934586981444402, -0.22135163703756075, -0.14957165506965042, -0.19524136911912202, -0.016897543205236686, -0.09531998185171725, -0.11188511102729794, 0.4451824160207649, 0.2331420917567433, 0.1309037037822536, 0.10986756803916985, 0.3544376079740031, 0.02732933649970845, 0.10447011482878234, 0.11446718956452563, 0.13013782645670252, 0.0060934113925984745, 0.18449463748413275, -0.24272719742304782, 0.0928240975431228, 0.021801664282421244] |
1,803.01529 | LSTD: A Low-Shot Transfer Detector for Object Detection | Recent advances in object detection are mainly driven by deep learning with
large-scale detection benchmarks. However, the fully-annotated training set is
often limited for a target detection task, which may deteriorate the
performance of deep detectors. To address this challenge, we propose a novel
low-shot transfer detector (LSTD) in this paper, where we leverage rich
source-domain knowledge to construct an effective target-domain detector with
very few training examples. The main contributions are described as follows.
First, we design a flexible deep architecture of LSTD to alleviate transfer
difficulties in low-shot detection. This architecture can integrate the
advantages of both SSD and Faster RCNN in a unified deep framework. Second, we
introduce a novel regularized transfer learning framework for low-shot
detection, where the transfer knowledge (TK) and background depression (BD)
regularizations are proposed to leverage object knowledge respectively from
source and target domains, in order to further enhance fine-tuning with a few
target images. Finally, we examine our LSTD on a number of challenging low-shot
detection experiments, where LSTD outperforms other state-of-the-art
approaches. The results demonstrate that LSTD is a preferable deep detector for
low-shot scenarios.
| cs.CV | recent advances in object detection are mainly driven by deep learning with largescale detection benchmarks however the fullyannotated training set is often limited for a target detection task which may deteriorate the performance of deep detectors to address this challenge we propose a novel lowshot transfer detector lstd in this paper where we leverage rich sourcedomain knowledge to construct an effective targetdomain detector with very few training examples the main contributions are described as follows first we design a flexible deep architecture of lstd to alleviate transfer difficulties in lowshot detection this architecture can integrate the advantages of both ssd and faster rcnn in a unified deep framework second we introduce a novel regularized transfer learning framework for lowshot detection where the transfer knowledge tk and background depression bd regularizations are proposed to leverage object knowledge respectively from source and target domains in order to further enhance finetuning with a few target images finally we examine our lstd on a number of challenging lowshot detection experiments where lstd outperforms other stateoftheart approaches the results demonstrate that lstd is a preferable deep detector for lowshot scenarios | [['recent', 'advances', 'in', 'object', 'detection', 'are', 'mainly', 'driven', 'by', 'deep', 'learning', 'with', 'largescale', 'detection', 'benchmarks', 'however', 'the', 'fullyannotated', 'training', 'set', 'is', 'often', 'limited', 'for', 'a', 'target', 'detection', 'task', 'which', 'may', 'deteriorate', 'the', 'performance', 'of', 'deep', 'detectors', 'to', 'address', 'this', 'challenge', 'we', 'propose', 'a', 'novel', 'lowshot', 'transfer', 'detector', 'lstd', 'in', 'this', 'paper', 'where', 'we', 'leverage', 'rich', 'sourcedomain', 'knowledge', 'to', 'construct', 'an', 'effective', 'targetdomain', 'detector', 'with', 'very', 'few', 'training', 'examples', 'the', 'main', 'contributions', 'are', 'described', 'as', 'follows', 'first', 'we', 'design', 'a', 'flexible', 'deep', 'architecture', 'of', 'lstd', 'to', 'alleviate', 'transfer', 'difficulties', 'in', 'lowshot', 'detection', 'this', 'architecture', 'can', 'integrate', 'the', 'advantages', 'of', 'both', 'ssd', 'and', 'faster', 'rcnn', 'in', 'a', 'unified', 'deep', 'framework', 'second', 'we', 'introduce', 'a', 'novel', 'regularized', 'transfer', 'learning', 'framework', 'for', 'lowshot', 'detection', 'where', 'the', 'transfer', 'knowledge', 'tk', 'and', 'background', 'depression', 'bd', 'regularizations', 'are', 'proposed', 'to', 'leverage', 'object', 'knowledge', 'respectively', 'from', 'source', 'and', 'target', 'domains', 'in', 'order', 'to', 'further', 'enhance', 'finetuning', 'with', 'a', 'few', 'target', 'images', 'finally', 'we', 'examine', 'our', 'lstd', 'on', 'a', 'number', 'of', 'challenging', 'lowshot', 'detection', 'experiments', 'where', 'lstd', 'outperforms', 'other', 'stateoftheart', 'approaches', 'the', 'results', 'demonstrate', 'that', 'lstd', 'is', 'a', 'preferable', 'deep', 'detector', 'for', 'lowshot', 'scenarios']] | [-0.028343518846039032, -0.0240862024122868, -0.02432798672266103, 0.056424566205414764, -0.13084115270978292, -0.18257964387334683, -0.0034850893158314598, 0.44284767826666704, -0.26324216428942776, -0.3523937758813436, 0.0766433123612424, -0.2785096878094624, -0.2004895824838329, 0.17707220299194593, -0.16506713487686137, 0.07195177753330083, 0.16308936095872037, 0.011674649920943822, -0.11683508721180261, -0.23545604080742075, 0.2986385674392049, 0.0493722513826199, 0.35038989457125597, 0.0614609523424627, 0.15266972040707194, -0.0698597840159326, -0.026246403043812795, -0.037485324002399636, -0.0477932821772442, 0.17409082893030467, 0.35694942404893604, 0.20830098500575972, 0.3281756118229414, -0.39990656200695684, -0.25791413998608853, 0.08993815335923352, 0.15925294521038194, 0.10689195593680582, -0.08679180175028238, -0.3300234503439955, 0.09226600942327767, -0.2172086661253628, 0.02804788939428289, -0.14907558691008269, -0.04441711059079279, -0.037451830003536433, -0.3000271126974022, 0.023347872277136538, 0.09269561356915211, 0.002593752955766143, -0.03182375277140857, -0.1280672707280295, 0.12601839134066894, 0.11465012066041094, 0.015267578215413802, 0.057966440676938034, 0.12060913173230113, -0.23200892176655297, -0.1395078387624282, 0.3101071386321171, -0.09109103550750611, -0.2068829684895841, 0.2368641193226181, -0.017450401161772173, -0.1657410681990252, 0.10647955884703914, 0.2613053789535361, 0.18842229938049598, -0.17078755689231126, 0.006237068570044357, -0.009594066793451438, 0.18340612179977264, 0.019707961157719427, -0.028287923527327744, 0.17170394128566055, 0.32251304751513776, 0.04049979259788587, 0.1542199709034223, -0.19429255014260274, -0.08396275019779725, -0.24302521912959985, -0.08632821626678058, -0.18745392153945725, -0.018601749686373247, -0.030838063873139813, -0.1106402332466599, 0.3639478083171353, 0.26096854284216925, 0.23694626917760517, 0.09547496660348229, 0.3798941610632716, 0.018494897159335607, 0.10945535539523572, 0.08174620430280984, 0.23676214186424338, -0.0023922357657873952, 0.10640392525222253, -0.17662700146918084, 0.04936433894515692, 0.019004545438833332] |
1,803.0153 | Pricing Mechanism in Information Goods | We study three pricing mechanisms' performance and their effects on the
participants in the data industry from the data supply chain perspective. A
win-win pricing strategy for the players in the data supply chain is proposed.
We obtain analytical solutions in each pricing mechanism, including the
decentralized and centralized pricing, Nash Bargaining pricing, and revenue
sharing mechanism.
| econ.EM | we study three pricing mechanisms performance and their effects on the participants in the data industry from the data supply chain perspective a winwin pricing strategy for the players in the data supply chain is proposed we obtain analytical solutions in each pricing mechanism including the decentralized and centralized pricing nash bargaining pricing and revenue sharing mechanism | [['we', 'study', 'three', 'pricing', 'mechanisms', 'performance', 'and', 'their', 'effects', 'on', 'the', 'participants', 'in', 'the', 'data', 'industry', 'from', 'the', 'data', 'supply', 'chain', 'perspective', 'a', 'winwin', 'pricing', 'strategy', 'for', 'the', 'players', 'in', 'the', 'data', 'supply', 'chain', 'is', 'proposed', 'we', 'obtain', 'analytical', 'solutions', 'in', 'each', 'pricing', 'mechanism', 'including', 'the', 'decentralized', 'and', 'centralized', 'pricing', 'nash', 'bargaining', 'pricing', 'and', 'revenue', 'sharing', 'mechanism']] | [-0.16023351357873986, -0.1214045040930311, -0.09315273644435301, 0.1359156297311481, -0.1308163817514453, -0.2027764769614135, 0.2233131376274845, 0.47671299055218697, -0.32921895995866834, -0.23334162728044025, 0.170944509715283, -0.3238310221778719, -0.07832911355715048, 0.1243519477480859, -0.13978490607584254, -0.012529241045724535, 0.026594947999049174, -0.039136834908276796, 0.12246357883212336, -0.2845316188789806, 0.29334932833648564, 0.07001727760622375, 0.4023831463173816, 0.05880516267528659, 0.0764286109029822, -0.017581610156125145, 0.0017845313505906808, -0.0701478167453356, -0.1847548325170289, 0.1386699991447753, 0.35098526143191155, 0.17593679215203514, 0.3625654139016804, -0.4539495002674429, -0.13965468240999862, 0.12835547772415898, 0.03780116918578483, 0.07287949738664586, -0.1273982549993027, -0.22082818325674325, -0.0015310299206982578, -0.326620141256666, -0.046012203266288625, -0.07699652870692182, -0.07087645089874665, 0.06665129299079509, -0.37995637613430355, -0.02761428306500117, -0.029699309304225863, 0.016589696862195667, -0.10363367419657216, -0.1335357567458822, -0.033504442883688104, 0.16725637640379237, 0.1254069251702739, -0.1457595230006662, 0.15998228278272508, -0.15163042745961433, -0.28282579371150124, 0.40425626646008406, -0.015980700798855538, -0.18278974458052402, 0.08534690378266468, -0.04494533072666902, -0.12712557792557372, 0.09889134054333625, 0.2167823695937139, 0.07715456458135393, -0.25525337605524745, 0.04793255985408139, -0.05685469919913694, 0.1002478485257087, 0.019865010309506926, 0.008173715666328607, 0.14118215339993567, 0.23829725410854607, 0.19063066259810799, 0.1189947987400126, 0.01356445765531246, -0.28627553359981167, -0.1863407334190254, -0.10735333082266152, -0.11199814612209275, 0.019863269594089503, -0.15339136435655396, -0.05984102483642729, 0.40239284004558595, 0.14598007129586077, 0.04001749537296986, 0.10534329895387616, 0.3912319618097523, 0.09653360542244882, -0.02502993739765595, 0.1715418456302008, 0.13465948749268264, -0.07136822756575911, 0.21439231612735934, -0.24017003198611764, 0.17323765747673942, 0.01813501388594312] |
1,803.01531 | Synchrotron Polarization of Relativistic Thermal Electrons | Relativistic electrons accelerated by both the first-order and the
second-order Fermi accelerations in some synchrotron sources have a hybrid
shape of thermal and nonthermal energy distribution. This particle acceleration
result is supported by some recent numerical simulations. We calculate the
synchrotron polarization by applying this electron energy distribution. The
polarization degrees in the cases of active galactic nucleus (AGN) jets and
gamma-ray bursts (GRBs) are given as examples. The possible application for the
polarization study of Sgr A* is also mentioned. We finally suggest high-energy
polarization measurements for these synchrotron sources to test our results.
| astro-ph.HE | relativistic electrons accelerated by both the firstorder and the secondorder fermi accelerations in some synchrotron sources have a hybrid shape of thermal and nonthermal energy distribution this particle acceleration result is supported by some recent numerical simulations we calculate the synchrotron polarization by applying this electron energy distribution the polarization degrees in the cases of active galactic nucleus agn jets and gammaray bursts grbs are given as examples the possible application for the polarization study of sgr a is also mentioned we finally suggest highenergy polarization measurements for these synchrotron sources to test our results | [['relativistic', 'electrons', 'accelerated', 'by', 'both', 'the', 'firstorder', 'and', 'the', 'secondorder', 'fermi', 'accelerations', 'in', 'some', 'synchrotron', 'sources', 'have', 'a', 'hybrid', 'shape', 'of', 'thermal', 'and', 'nonthermal', 'energy', 'distribution', 'this', 'particle', 'acceleration', 'result', 'is', 'supported', 'by', 'some', 'recent', 'numerical', 'simulations', 'we', 'calculate', 'the', 'synchrotron', 'polarization', 'by', 'applying', 'this', 'electron', 'energy', 'distribution', 'the', 'polarization', 'degrees', 'in', 'the', 'cases', 'of', 'active', 'galactic', 'nucleus', 'agn', 'jets', 'and', 'gammaray', 'bursts', 'grbs', 'are', 'given', 'as', 'examples', 'the', 'possible', 'application', 'for', 'the', 'polarization', 'study', 'of', 'sgr', 'a', 'is', 'also', 'mentioned', 'we', 'finally', 'suggest', 'highenergy', 'polarization', 'measurements', 'for', 'these', 'synchrotron', 'sources', 'to', 'test', 'our', 'results']] | [-0.052267028347245954, 0.18510365160182118, -0.06165072417965061, 0.15791757634601947, -0.0691296221296254, -0.05794949929082864, 0.026448595764017417, 0.4554838375825631, -0.222462033720589, -0.2979698731514968, -0.005491732788811389, -0.31607427621554385, 0.0012818973511457444, 0.2568156605157511, 0.035273261444251004, 0.014469511405025658, 0.028221451628365014, -0.1085168533272257, -0.02046919335721453, -0.17774611652681702, 0.30081784224970953, 0.17506206337558597, 0.2123886199079846, 0.054792573118021735, 0.09134992838494088, -0.0458560826845075, -0.042363935787426796, 0.011946314684935618, -0.08792328138982779, 0.05601246311868492, 0.22867457000048538, 0.08413379891334395, 0.17933938856233572, -0.3971631364504758, -0.28156699937229096, 0.06244500277956065, 0.10413675075396896, 0.08018449613530385, -0.13065917718493822, -0.25409714050198856, 0.005281849839651075, -0.2045465190551783, -0.2029116469435394, -0.039482317080623226, -0.015466145494658697, 0.10471823240973448, -0.19853827625905213, 0.11405330734835986, 0.05190743375569582, 0.027116785227860277, -0.1091012212790941, -0.0702028389064301, 0.024171959241165927, -0.0029220464859942073, 0.11223622773724952, 0.050699490291605656, 0.18941173248581197, -0.10371267287256686, -0.17059589952818657, 0.3929267393523141, -0.0035782514097120023, -0.08866468669944688, 0.16574243396324548, -0.23036433580380522, -0.16919239275157452, 0.17068461255832135, 0.16168161299275724, 0.11778153183036728, -0.13933485549090333, 0.02657057811371296, -0.020056297858000584, 0.12349642248285052, 0.04950135433066048, 0.027085654280687634, 0.26293128636959745, 0.09214185545417039, -0.014498366796607641, 0.1593337064535406, -0.22725086598411987, -0.0223151767387447, -0.3603528281624772, -0.10436356151966672, -0.19181113757781293, 0.09814372449672144, -0.11249351177416668, -0.08315087891502404, 0.42723054973114477, 0.1037650910451224, 0.1380302667323696, 0.00843923049733827, 0.3439733746804689, 0.11178244435056849, -0.018097392405922477, 0.1631791061770759, 0.34381750629246727, 0.13661853986498165, 0.10356162130146435, -0.24744060403226237, 0.04268668151926249, -0.0054614219716505] |
1,803.01532 | Learning-Based Dequantization For Image Restoration Against Extremely
Poor Illumination | All existing image enhancement methods, such as HDR tone mapping, cannot
recover A/D quantization losses due to insufficient or excessive lighting,
(underflow and overflow problems). The loss of image details due to A/D
quantization is complete and it cannot be recovered by traditional image
processing methods, but the modern data-driven machine learning approach offers
a much needed cure to the problem. In this work we propose a novel approach to
restore and enhance images acquired in low and uneven lighting. First, the ill
illumination is algorithmically compensated by emulating the effects of
artificial supplementary lighting. Then a DCNN trained using only synthetic
data recovers the missing detail caused by quantization.
| cs.CV | all existing image enhancement methods such as hdr tone mapping cannot recover ad quantization losses due to insufficient or excessive lighting underflow and overflow problems the loss of image details due to ad quantization is complete and it cannot be recovered by traditional image processing methods but the modern datadriven machine learning approach offers a much needed cure to the problem in this work we propose a novel approach to restore and enhance images acquired in low and uneven lighting first the ill illumination is algorithmically compensated by emulating the effects of artificial supplementary lighting then a dcnn trained using only synthetic data recovers the missing detail caused by quantization | [['all', 'existing', 'image', 'enhancement', 'methods', 'such', 'as', 'hdr', 'tone', 'mapping', 'can', 'not', 'recover', 'ad', 'quantization', 'losses', 'due', 'to', 'insufficient', 'or', 'excessive', 'lighting', 'underflow', 'and', 'overflow', 'problems', 'the', 'loss', 'of', 'image', 'details', 'due', 'to', 'ad', 'quantization', 'is', 'complete', 'and', 'it', 'can', 'not', 'be', 'recovered', 'by', 'traditional', 'image', 'processing', 'methods', 'but', 'the', 'modern', 'datadriven', 'machine', 'learning', 'approach', 'offers', 'a', 'much', 'needed', 'cure', 'to', 'the', 'problem', 'in', 'this', 'work', 'we', 'propose', 'a', 'novel', 'approach', 'to', 'restore', 'and', 'enhance', 'images', 'acquired', 'in', 'low', 'and', 'uneven', 'lighting', 'first', 'the', 'ill', 'illumination', 'is', 'algorithmically', 'compensated', 'by', 'emulating', 'the', 'effects', 'of', 'artificial', 'supplementary', 'lighting', 'then', 'a', 'dcnn', 'trained', 'using', 'only', 'synthetic', 'data', 'recovers', 'the', 'missing', 'detail', 'caused', 'by', 'quantization']] | [-0.03292241751374344, 0.033266473740306016, -0.06364447209749155, 0.11542271968729827, -0.1282238781048883, -0.19903981616360916, 0.04590907177563557, 0.43461017812868313, -0.29832953581769417, -0.36872679826878346, 0.1543719360675563, -0.2181582468495305, -0.2161005038901099, 0.16498856566405656, -0.281215004103225, 0.0833099781198793, 0.10889092671069582, -0.010876851472338396, -0.06957474430133256, -0.264483185127444, 0.28655346453030817, 0.08359272644988128, 0.34566728186993195, 0.03679604685748927, 0.13424541929245087, 0.007668888637064291, -0.06079462271009106, -0.012048443895764649, -0.012342733274895832, 0.13213429781171726, 0.30243382205662783, 0.15088457761677482, 0.27299931882797474, -0.4509604833063869, -0.2773681434669665, 0.0961591365838623, 0.15108126088411414, 0.14915545510926417, -0.06898909255895498, -0.29415690049894955, 0.10607509563851636, -0.15436082399017842, -0.01763145622265126, -0.13730079292768746, -0.06399791616630475, -0.0680453427025652, -0.28452643626535845, 0.06365888350410387, 0.06556750368742671, 0.06398146301840565, -0.08555977421305475, -0.06978215950740767, 0.019760231553976024, 0.15002431798867683, 0.027994501453317104, 0.07122033010403227, 0.15818375686233463, -0.1884265639050032, -0.07304096436044867, 0.425346511016999, -0.037190338189247996, -0.24214269511867315, 0.1703189347172156, -0.03006866937877411, -0.05949678839117821, 0.14798953805542883, 0.1768764246621036, 0.10514615825377405, -0.1673239189351859, 0.014705068382162218, 0.057734010936526046, 0.14991231162483537, 0.09921262235314186, 0.008010029693001084, 0.16434800635345578, 0.15898263800772838, 0.014726082669637566, 0.1477872305539287, -0.1483026535029889, 0.007622388669655525, -0.20652445278288464, -0.06254225299094937, -0.20957518338920117, 0.03982301477792914, -0.03478603238129706, -0.14341172950922296, 0.3583186752262658, 0.250479646002142, 0.22612032337721238, 9.930476413241454e-05, 0.44037048891186714, 0.08888435799183624, 0.14163090929754876, 0.03815407231117466, 0.16593093630009598, 0.026750804122067557, 0.15719744588048862, -0.1761622708872892, 0.095582041340614, 0.02074786541717393] |
1,803.01533 | The asymmetric multitype contact process | In the multitype contact process, vertices of a graph can be empty or
occupied by a type 1 or a type 2 individual; an individual of type $i$ dies
with rate 1 and sends a descendant to a neighboring empty site with rate
$\lambda_i$. We study this process on $\Z^d$ with $\lambda_1 > \lambda_2$ and
$\lambda_1$ larger than the critical value of the (one-type) contact process.
We prove that, if there is at least one type 1 individual in the initial
configuration, then type 1 has a positive probability of never going extinct.
Conditionally on this event, type 1 takes over a ball of radius growing
linearly in time. We also completely characterize the set of stationary
distributions of the process and prove that the process started from any
initial configuration converges to a convex combination of distributions in
this set.
| math.PR | in the multitype contact process vertices of a graph can be empty or occupied by a type 1 or a type 2 individual an individual of type i dies with rate 1 and sends a descendant to a neighboring empty site with rate lambda_i we study this process on zd with lambda_1 lambda_2 and lambda_1 larger than the critical value of the onetype contact process we prove that if there is at least one type 1 individual in the initial configuration then type 1 has a positive probability of never going extinct conditionally on this event type 1 takes over a ball of radius growing linearly in time we also completely characterize the set of stationary distributions of the process and prove that the process started from any initial configuration converges to a convex combination of distributions in this set | [['in', 'the', 'multitype', 'contact', 'process', 'vertices', 'of', 'a', 'graph', 'can', 'be', 'empty', 'or', 'occupied', 'by', 'a', 'type', '1', 'or', 'a', 'type', '2', 'individual', 'an', 'individual', 'of', 'type', 'i', 'dies', 'with', 'rate', '1', 'and', 'sends', 'a', 'descendant', 'to', 'a', 'neighboring', 'empty', 'site', 'with', 'rate', 'lambda_i', 'we', 'study', 'this', 'process', 'on', 'zd', 'with', 'lambda_1', 'lambda_2', 'and', 'lambda_1', 'larger', 'than', 'the', 'critical', 'value', 'of', 'the', 'onetype', 'contact', 'process', 'we', 'prove', 'that', 'if', 'there', 'is', 'at', 'least', 'one', 'type', '1', 'individual', 'in', 'the', 'initial', 'configuration', 'then', 'type', '1', 'has', 'a', 'positive', 'probability', 'of', 'never', 'going', 'extinct', 'conditionally', 'on', 'this', 'event', 'type', '1', 'takes', 'over', 'a', 'ball', 'of', 'radius', 'growing', 'linearly', 'in', 'time', 'we', 'also', 'completely', 'characterize', 'the', 'set', 'of', 'stationary', 'distributions', 'of', 'the', 'process', 'and', 'prove', 'that', 'the', 'process', 'started', 'from', 'any', 'initial', 'configuration', 'converges', 'to', 'a', 'convex', 'combination', 'of', 'distributions', 'in', 'this', 'set']] | [-0.10707466229505372, 0.15097458144144704, -0.0443627400157441, 0.016431314483127478, -0.0035250464620600855, -0.18425729097798466, 0.09896950852458498, 0.35829416156359783, -0.2851296604145318, -0.20246167099435947, 0.12333275500818022, -0.3144083170220256, -0.08666574773046055, 0.10431115182249674, -0.027994835735963924, -0.041936062445997124, 0.07506948543845543, 0.12228801497923476, -0.009809243003837764, -0.25465789422430263, 0.37764569964326383, -0.015432262044799114, 0.20520600766342664, -0.00823273648108755, 0.11516027816770864, 0.014746331267191895, 0.01659293770873254, 0.023351994379689652, -0.17543361702254126, 0.0488065896722089, 0.1706370787645158, 0.1530422234009685, 0.3427715927562011, -0.38314682291820645, -0.14492352252460217, 0.1879128552041948, 0.16992841864536914, 0.06010794584269336, -0.007402143891834255, -0.23585206826683133, 0.13223055640534898, -0.14942570636215222, -0.17637980113005533, 0.0602045210610543, 0.08738270617489304, 0.045888520981783844, -0.29983395469774093, 0.04724791373654236, 0.09790364819013381, 0.006205552939458617, -0.047055224192860935, -0.1372931814486427, -0.04942077776816275, 0.13391512960993818, 0.0032528567499996697, 0.06448058898843426, 0.10917621068656444, -0.0700439213442483, -0.09364458833089365, 0.297955003939569, -0.04397660451161625, -0.21108061306045522, 0.17985854726949974, -0.21081098140483456, -0.13127721332878406, 0.15742339714696366, 0.14553551224858632, 0.1400208861700126, -0.10051233763141292, 0.10301585442461406, 0.0031079985775120025, 0.16348990909256308, 0.08136282672307321, -0.039062031215455914, 0.1767446490736412, 0.17358428772006715, 0.13029701721555154, 0.10679867255883957, -0.07972657598688133, -0.08583991634108575, -0.33697371219417876, -0.16082210335215288, -0.20981000977002884, 0.16413645134141136, -0.1114825049312328, -0.16496544004684047, 0.3571249203889498, 0.07604634645893904, 0.24433673262330038, 0.08256218152652894, 0.20680691091194084, 0.11153186666301086, 0.020251968582826, 0.08150536216728921, 0.15158373495297772, 0.0560725380250785, 0.05812152613736024, -0.1330841663875617, 0.09489194673452793, 0.08783014485545988] |
1,803.01534 | Path Aggregation Network for Instance Segmentation | The way that information propagates in neural networks is of great
importance. In this paper, we propose Path Aggregation Network (PANet) aiming
at boosting information flow in proposal-based instance segmentation framework.
Specifically, we enhance the entire feature hierarchy with accurate
localization signals in lower layers by bottom-up path augmentation, which
shortens the information path between lower layers and topmost feature. We
present adaptive feature pooling, which links feature grid and all feature
levels to make useful information in each feature level propagate directly to
following proposal subnetworks. A complementary branch capturing different
views for each proposal is created to further improve mask prediction. These
improvements are simple to implement, with subtle extra computational overhead.
Our PANet reaches the 1st place in the COCO 2017 Challenge Instance
Segmentation task and the 2nd place in Object Detection task without
large-batch training. It is also state-of-the-art on MVD and Cityscapes. Code
is available at https://github.com/ShuLiu1993/PANet
| cs.CV | the way that information propagates in neural networks is of great importance in this paper we propose path aggregation network panet aiming at boosting information flow in proposalbased instance segmentation framework specifically we enhance the entire feature hierarchy with accurate localization signals in lower layers by bottomup path augmentation which shortens the information path between lower layers and topmost feature we present adaptive feature pooling which links feature grid and all feature levels to make useful information in each feature level propagate directly to following proposal subnetworks a complementary branch capturing different views for each proposal is created to further improve mask prediction these improvements are simple to implement with subtle extra computational overhead our panet reaches the 1st place in the coco 2017 challenge instance segmentation task and the 2nd place in object detection task without largebatch training it is also stateoftheart on mvd and cityscapes code is available at httpsgithubcomshuliu1993panet | [['the', 'way', 'that', 'information', 'propagates', 'in', 'neural', 'networks', 'is', 'of', 'great', 'importance', 'in', 'this', 'paper', 'we', 'propose', 'path', 'aggregation', 'network', 'panet', 'aiming', 'at', 'boosting', 'information', 'flow', 'in', 'proposalbased', 'instance', 'segmentation', 'framework', 'specifically', 'we', 'enhance', 'the', 'entire', 'feature', 'hierarchy', 'with', 'accurate', 'localization', 'signals', 'in', 'lower', 'layers', 'by', 'bottomup', 'path', 'augmentation', 'which', 'shortens', 'the', 'information', 'path', 'between', 'lower', 'layers', 'and', 'topmost', 'feature', 'we', 'present', 'adaptive', 'feature', 'pooling', 'which', 'links', 'feature', 'grid', 'and', 'all', 'feature', 'levels', 'to', 'make', 'useful', 'information', 'in', 'each', 'feature', 'level', 'propagate', 'directly', 'to', 'following', 'proposal', 'subnetworks', 'a', 'complementary', 'branch', 'capturing', 'different', 'views', 'for', 'each', 'proposal', 'is', 'created', 'to', 'further', 'improve', 'mask', 'prediction', 'these', 'improvements', 'are', 'simple', 'to', 'implement', 'with', 'subtle', 'extra', 'computational', 'overhead', 'our', 'panet', 'reaches', 'the', '1st', 'place', 'in', 'the', 'coco', '2017', 'challenge', 'instance', 'segmentation', 'task', 'and', 'the', '2nd', 'place', 'in', 'object', 'detection', 'task', 'without', 'largebatch', 'training', 'it', 'is', 'also', 'stateoftheart', 'on', 'mvd', 'and', 'cityscapes', 'code', 'is', 'available', 'at', 'httpsgithubcomshuliu1993panet']] | [-0.06178277336671603, 0.040894497556007464, -0.054581886697067136, 0.04113400058315092, -0.11979572888500742, -0.190075500926854, 0.05810732809774306, 0.4519830646104371, -0.2812324432106473, -0.35361140479012976, 0.054478756537574606, -0.26494891772552437, -0.17170577783704988, 0.1354127981602091, -0.11133859251604249, 0.043449065388204984, 0.16378429021982366, 0.03198363710910279, -0.042961561890467015, -0.27645296236308947, 0.28290648671601043, 0.0965881534799662, 0.3817518801792272, 0.06653030018093965, 0.1251959302555153, -0.018543218062043388, -0.05014464973675593, -0.041227199622146195, -0.07093635685180062, 0.18015025489245054, 0.3176481112304285, 0.16839743757293565, 0.2928924160818292, -0.4261384942192609, -0.23962247100140627, 0.05200292027651005, 0.141359060907132, 0.13547285382376847, -0.016457002191335605, -0.30822504668293016, 0.08464446737560512, -0.15876411037081667, 0.022760324985010932, -0.0839576782498336, -0.013977130284434222, -0.07826907165265266, -0.266338532414312, 0.05418108650352128, 0.08131597606451343, 0.03308977800982677, -0.025835504019108682, -0.08630075437997449, -0.024338617049688042, 0.2101623873543981, -0.028774082686887772, 0.08928529415005935, 0.1232288221902652, -0.19508301569395606, -0.10081168166469684, 0.3353983352318505, -0.05066249072736758, -0.18818916931797733, 0.18399714701963182, -0.05396299223440224, -0.16593862708275584, 0.12634771038463574, 0.21436632812001577, 0.1003617195178144, -0.14221963058503356, -0.025674984545218726, 0.015209087941622892, 0.17628419253703775, 0.08288345471123196, 0.02973592459665155, 0.19854490153775017, 0.26911285460698386, 0.09020807415120526, 0.14900093118888358, -0.17736010775797392, -0.07836764103529469, -0.23020536855012733, -0.13348745230948844, -0.1604551141202721, -0.07857235720217697, -0.1101478188886887, -0.08990404560748759, 0.39443622688633323, 0.25490473878156666, 0.22021295520514003, 0.06470552978833631, 0.3580741819413687, 0.036496415735062036, 0.12458373089968566, 0.1161412873701655, 0.19319110862997096, -0.014315503466695498, 0.1080183021767398, -0.1423311866357281, 0.0822545652006389, 0.12189387933513772] |
1,803.01535 | On a criterion for local embeddability of 3-dimensional CR-structures | We introduce a CR-invariant class of Lorentzian metrics on a circle bundle
over a 3-dimensional CR-structure, which we call quasi-Fefferman metrics. These
metrics generalise the Fefferman metric but allow for more control of the Ricci
curvature. Our main result is a criterion for embaddability of 3-dimensional
CR-structures in terms of the Ricci curvature of the quasi-Fefferman metrics in
the spirit of the results by Hill et al.
| math.CV math.DG | we introduce a crinvariant class of lorentzian metrics on a circle bundle over a 3dimensional crstructure which we call quasifefferman metrics these metrics generalise the fefferman metric but allow for more control of the ricci curvature our main result is a criterion for embaddability of 3dimensional crstructures in terms of the ricci curvature of the quasifefferman metrics in the spirit of the results by hill et al | [['we', 'introduce', 'a', 'crinvariant', 'class', 'of', 'lorentzian', 'metrics', 'on', 'a', 'circle', 'bundle', 'over', 'a', '3dimensional', 'crstructure', 'which', 'we', 'call', 'quasifefferman', 'metrics', 'these', 'metrics', 'generalise', 'the', 'fefferman', 'metric', 'but', 'allow', 'for', 'more', 'control', 'of', 'the', 'ricci', 'curvature', 'our', 'main', 'result', 'is', 'a', 'criterion', 'for', 'embaddability', 'of', '3dimensional', 'crstructures', 'in', 'terms', 'of', 'the', 'ricci', 'curvature', 'of', 'the', 'quasifefferman', 'metrics', 'in', 'the', 'spirit', 'of', 'the', 'results', 'by', 'hill', 'et', 'al']] | [-0.17299880205428053, 0.015308573852962581, -0.08957267325604334, 0.057765287268921384, -0.10649246448883787, -0.1048398171988083, -0.04926108609652147, 0.32732817623764277, -0.15648664107720833, -0.2266082094865851, 0.10061217108159326, -0.24787425369868288, -0.23576508776750416, 0.21670713107596384, -0.19292868897900917, 0.020656760490965098, 0.03427856948110275, 0.07270125146533246, -0.08896122706573806, -0.2878454706060438, 0.48899250724207377, 0.06549095825175755, 0.24127605816465802, 0.12501100124791265, 0.11641323364881373, -0.03835220639302861, -0.037306333921151236, 0.08579595868650358, -0.23363049149338622, 0.14316705481905956, 0.1865483839646913, 0.12702068496582797, 0.2304961211339105, -0.2994503464142326, -0.2688908587442711, 0.13407463319890667, 0.07575426259427331, 0.039618436801902135, 0.010385097572680024, -0.32294354191981256, 0.07418967549892841, -0.10724594995554071, -0.13244410040533694, -0.07256747797509888, -0.0215503525105305, -0.002272161204928125, -0.2047723228824907, 0.05093832102284068, 0.1561192982189823, 0.029391532123554498, -0.10901899822420091, -0.06680859746848, -0.026923724512016634, 0.06028322516795015, 0.031902646968497095, 0.058854554503341205, 0.07479191051243106, -0.05174413254644605, -0.1385557293870079, 0.36641614040127024, -0.1352300405742426, -0.29233955912059173, 0.0890894585463684, -0.07237576747866115, -0.10981789897778071, 0.05249553655448835, 0.19522934201268072, 0.22238624448073097, -0.07711729197035311, 0.12900427368003875, -0.07087917445460334, 0.049001668754499406, 0.10604831165983342, -0.02104829096060712, 0.11509416013723239, 0.08384500032843789, 0.1496173731793533, 0.11341499960326473, -0.028801037755329162, -0.09860826409294532, -0.34761859029822517, -0.28649512768606655, -0.13708260532803251, 0.13750023393367883, -0.1680327105714241, -0.20531741100967338, 0.4527902167174034, 0.02783019986236468, 0.2296454528113827, 0.17551684481622942, 0.2191519063344458, -0.006693430061204708, 0.061945201763592195, 0.13304787501692772, 0.258200554868381, 0.1695459161164763, 0.09952714121936879, -0.10506750128843123, -0.039138596403063275, 0.1748802791989874] |
1,803.01536 | Testing a Goodwin model with general capital accumulation rate | We perform econometric tests on a modified Goodwin model where the capital
accumulation rate is constant but not necessarily equal to one as in the
original model (Goodwin, 1967). In addition to this modification, we find that
addressing the methodological and reporting issues in Harvie (2000) leads to
remarkably better results, with near perfect agreement between the estimates of
equilibrium employment rates and the corresponding empirical averages, as well
as significantly improved estimates of equilibrium wage shares. Despite its
simplicity and obvious limitations, the performance of the modified Goodwin
model implied by our results show that it can be used as a starting point for
more sophisticated models for endogenous growth cycles.
| econ.EM q-fin.EC | we perform econometric tests on a modified goodwin model where the capital accumulation rate is constant but not necessarily equal to one as in the original model goodwin 1967 in addition to this modification we find that addressing the methodological and reporting issues in harvie 2000 leads to remarkably better results with near perfect agreement between the estimates of equilibrium employment rates and the corresponding empirical averages as well as significantly improved estimates of equilibrium wage shares despite its simplicity and obvious limitations the performance of the modified goodwin model implied by our results show that it can be used as a starting point for more sophisticated models for endogenous growth cycles | [['we', 'perform', 'econometric', 'tests', 'on', 'a', 'modified', 'goodwin', 'model', 'where', 'the', 'capital', 'accumulation', 'rate', 'is', 'constant', 'but', 'not', 'necessarily', 'equal', 'to', 'one', 'as', 'in', 'the', 'original', 'model', 'goodwin', '1967', 'in', 'addition', 'to', 'this', 'modification', 'we', 'find', 'that', 'addressing', 'the', 'methodological', 'and', 'reporting', 'issues', 'in', 'harvie', '2000', 'leads', 'to', 'remarkably', 'better', 'results', 'with', 'near', 'perfect', 'agreement', 'between', 'the', 'estimates', 'of', 'equilibrium', 'employment', 'rates', 'and', 'the', 'corresponding', 'empirical', 'averages', 'as', 'well', 'as', 'significantly', 'improved', 'estimates', 'of', 'equilibrium', 'wage', 'shares', 'despite', 'its', 'simplicity', 'and', 'obvious', 'limitations', 'the', 'performance', 'of', 'the', 'modified', 'goodwin', 'model', 'implied', 'by', 'our', 'results', 'show', 'that', 'it', 'can', 'be', 'used', 'as', 'a', 'starting', 'point', 'for', 'more', 'sophisticated', 'models', 'for', 'endogenous', 'growth', 'cycles']] | [-0.01777938412487856, 0.03540047623703556, -0.09641912863922439, 0.10644069448712148, -0.037766154460509176, -0.15881179194132397, 0.10274711016453304, 0.3502018431359569, -0.22789740706762782, -0.31691518422615317, 0.13271903893681675, -0.27492735058850876, -0.14101717837911565, 0.21712236354310985, -0.11517868911947257, 0.03166400411646464, 0.07342895989339533, 0.01873743991434042, -0.06610541477649738, -0.2635224991744118, 0.24576467961638368, 0.13570783066097647, 0.30404193178193445, 0.03921467393852903, 0.07369907996534104, -0.019053102336848888, -0.01956877830837454, 0.04487452125925172, -0.1361562199107149, 0.10514824272000364, 0.21132275050685426, 0.1179668081001312, 0.2982640240973394, -0.4188591758221654, -0.22685278689355723, 0.10711526843910438, 0.11613770627965485, 0.10032990812656603, -0.030874939480132264, -0.21307244468023004, 0.05749732136194195, -0.2020548075504069, -0.16229099547490478, -0.08886812537509416, -0.006470618312180575, 0.037540441635168724, -0.2960149225338163, 0.12998948467013957, 0.092518998194594, 0.030250856594648212, -0.0619739130311895, -0.14727756754395419, -0.0405809629675267, 0.1405971955142117, 0.09765206341087053, 0.0007393487280101649, 0.11425870861109745, -0.1422528649459959, -0.13332726173393894, 0.3903111236785272, -0.10782600201127934, -0.18593991522045275, 0.1916764218518178, -0.10385188232716505, -0.10847893303642715, 0.06491868784671949, 0.12272130873004373, 0.05008146892734138, -0.1337695351352782, 0.029317899950651087, -0.04118920782015526, 0.15094038837586204, 0.052207138701175736, 0.0030034907555480978, 0.15892005322010455, 0.14280485401884238, 0.0590923633343274, 0.10223441498237662, -0.02040386753547604, -0.17305878483291184, -0.2669264206571305, -0.10495258911656233, -0.14402838006623955, 0.04980467741253441, -0.10559917136106378, -0.1339787179936788, 0.3733948623495443, 0.19571233216889336, 0.19630191599052133, 0.07997531179405216, 0.2761675567100091, 0.09695618279433152, 0.04229648998911476, 0.07974326722407048, 0.25155864652645377, 0.06859480667169139, 0.1016916424746991, -0.21000808730605058, 0.12518868886815784, 0.023138833925518805] |
1,803.01537 | Predicting Webpage Aesthetics with Heatmap Entropy | Today, eye trackers are extensively used in user interface evaluations.
However, it's still hard to analyze and interpret eye tracking data from the
aesthetic point of view. To find quantitative links between eye movements and
aesthetic experience, we tracked 30 observers' initial landings for 40 web
pages (each displayed for 3 seconds). The web pages were also rated based on
the observers' subjective aesthetic judgments. Shannon entropy was introduced
to analyze the eye-tracking data. The result shows that the heatmap entropy
(visual attention entropy, VAE) is highly correlated with the observers'
aesthetic judgements of the web pages. Its improved version, relative VAE
(rVAE), has a more significant correlation with the perceived aesthetics.
(r=-0.65, F= 26.84, P$<$0.0001). This single metric alone can distinguish
between good- and bad-looking pages with an approximate 85\% accuracy. Further
investigation reveals that the performance of both VAE and rVAE became stable
after 1 second. The curves indicate that their performances could be better, if
the tracking time was extended beyond 3 seconds.
| cs.HC | today eye trackers are extensively used in user interface evaluations however its still hard to analyze and interpret eye tracking data from the aesthetic point of view to find quantitative links between eye movements and aesthetic experience we tracked 30 observers initial landings for 40 web pages each displayed for 3 seconds the web pages were also rated based on the observers subjective aesthetic judgments shannon entropy was introduced to analyze the eyetracking data the result shows that the heatmap entropy visual attention entropy vae is highly correlated with the observers aesthetic judgements of the web pages its improved version relative vae rvae has a more significant correlation with the perceived aesthetics r065 f 2684 p00001 this single metric alone can distinguish between good and badlooking pages with an approximate 85 accuracy further investigation reveals that the performance of both vae and rvae became stable after 1 second the curves indicate that their performances could be better if the tracking time was extended beyond 3 seconds | [['today', 'eye', 'trackers', 'are', 'extensively', 'used', 'in', 'user', 'interface', 'evaluations', 'however', 'its', 'still', 'hard', 'to', 'analyze', 'and', 'interpret', 'eye', 'tracking', 'data', 'from', 'the', 'aesthetic', 'point', 'of', 'view', 'to', 'find', 'quantitative', 'links', 'between', 'eye', 'movements', 'and', 'aesthetic', 'experience', 'we', 'tracked', '30', 'observers', 'initial', 'landings', 'for', '40', 'web', 'pages', 'each', 'displayed', 'for', '3', 'seconds', 'the', 'web', 'pages', 'were', 'also', 'rated', 'based', 'on', 'the', 'observers', 'subjective', 'aesthetic', 'judgments', 'shannon', 'entropy', 'was', 'introduced', 'to', 'analyze', 'the', 'eyetracking', 'data', 'the', 'result', 'shows', 'that', 'the', 'heatmap', 'entropy', 'visual', 'attention', 'entropy', 'vae', 'is', 'highly', 'correlated', 'with', 'the', 'observers', 'aesthetic', 'judgements', 'of', 'the', 'web', 'pages', 'its', 'improved', 'version', 'relative', 'vae', 'rvae', 'has', 'a', 'more', 'significant', 'correlation', 'with', 'the', 'perceived', 'aesthetics', 'r065', 'f', '2684', 'p00001', 'this', 'single', 'metric', 'alone', 'can', 'distinguish', 'between', 'good', 'and', 'badlooking', 'pages', 'with', 'an', 'approximate', '85', 'accuracy', 'further', 'investigation', 'reveals', 'that', 'the', 'performance', 'of', 'both', 'vae', 'and', 'rvae', 'became', 'stable', 'after', '1', 'second', 'the', 'curves', 'indicate', 'that', 'their', 'performances', 'could', 'be', 'better', 'if', 'the', 'tracking', 'time', 'was', 'extended', 'beyond', '3', 'seconds']] | [-0.04554086667842638, 0.023445248328941373, -0.11343297549163454, 0.122021464023352, -0.11456645475100566, -0.2100008613682792, 0.049789428478106856, 0.46218614654466966, -0.20285883880694586, -0.38471733326195207, 0.060420029133164035, -0.359937867206847, -0.13456521087834622, 0.1807177308146939, -0.1817871213267826, 0.03918110626603997, 0.1143584228085034, 0.09783161056022291, -0.07987641950103631, -0.3178802200284518, 0.2337370206073027, 0.11451300408582608, 0.32140361276838036, 0.04764830584757807, 0.08753847993447508, -0.015783432227694374, -0.09547247963334703, 0.017292678723539557, -0.07982345485549665, 0.13690591555701545, 0.28005313707024226, 0.20711418569742907, 0.2725665758998116, -0.35455588511894087, -0.16188805944863363, 0.04076150348238601, 0.10640765180378478, 0.03652846169132351, -0.03144608251152323, -0.38678546517550305, 0.09224475852350927, -0.16068146632058672, -0.044231576576508995, -0.0745982990423046, 0.04088639153704687, -0.020069899924522256, -0.20112028170842677, 0.07273121722498938, 0.027767227672155094, 0.12411151600407402, -0.04342635184743562, -0.06961500078176885, -0.04959348378821913, 0.19912479820438414, 0.09115084315945846, 0.07547404589645702, 0.180600409690245, -0.16665638112634465, -0.134666915474091, 0.3520931743679602, -0.015422612202976561, -0.16386069625364674, 0.20422895603378996, -0.1066031370946189, -0.07456661914360989, 0.1396110269035344, 0.15592018227868548, 0.08083854460563122, -0.15642273906572648, -0.04507061633269983, -0.015577620158166243, 0.2539458349813133, 0.09736134043424761, -0.005890784710874221, 0.2028418127333094, 0.1508065682280226, -0.0034167879643890024, 0.12934844778205035, -0.10366209819370115, -0.05933431913202023, -0.19768840004904253, -0.1705499540793833, -0.15013624881137094, -0.0071120844508287, -0.14704273822195998, -0.1260749084771071, 0.38805176610229936, 0.1941260069837591, 0.16605303814189018, 0.07287409540231517, 0.28713332634973426, 0.008238232262472571, 0.0503275345936289, 0.09587915494403819, 0.2425148888281118, -0.004391454633016802, 0.1929914250775623, -0.12406786966963923, 0.1335047687792385, 0.04025105307017242] |
1,803.01538 | Geometric realization of Dynkin quiver type quantum affine Schur-Weyl
duality | For a Dynkin quiver $Q$ of type ADE and a sum $\beta$ of simple roots, we
construct a bimodule over the quantum loop algebra and the quiver Hecke algebra
of the corresponding type via equivariant K-theory, imitating
Ginzburg-Reshetikhin-Vasserot's geometric realization of the quantum affine
Schur-Weyl duality. Our construction is based on Hernandez-Leclerc's
isomorphism between a certain graded quiver variety and the space of
representations of the quiver $Q$ of dimension vector $\beta$. We identify the
functor induced from our bimodule with Kang-Kashiwara-Kim's generalized quantum
affine Schur-Weyl duality functor. As a by-product, we verify a conjecture by
Kang-Kashiwara-Kim on the simpleness of some poles of normalized R-matrices for
any quiver $Q$ of type ADE.
| math.RT math.QA | for a dynkin quiver q of type ade and a sum beta of simple roots we construct a bimodule over the quantum loop algebra and the quiver hecke algebra of the corresponding type via equivariant ktheory imitating ginzburgreshetikhinvasserots geometric realization of the quantum affine schurweyl duality our construction is based on hernandezleclercs isomorphism between a certain graded quiver variety and the space of representations of the quiver q of dimension vector beta we identify the functor induced from our bimodule with kangkashiwarakims generalized quantum affine schurweyl duality functor as a byproduct we verify a conjecture by kangkashiwarakim on the simpleness of some poles of normalized rmatrices for any quiver q of type ade | [['for', 'a', 'dynkin', 'quiver', 'q', 'of', 'type', 'ade', 'and', 'a', 'sum', 'beta', 'of', 'simple', 'roots', 'we', 'construct', 'a', 'bimodule', 'over', 'the', 'quantum', 'loop', 'algebra', 'and', 'the', 'quiver', 'hecke', 'algebra', 'of', 'the', 'corresponding', 'type', 'via', 'equivariant', 'ktheory', 'imitating', 'ginzburgreshetikhinvasserots', 'geometric', 'realization', 'of', 'the', 'quantum', 'affine', 'schurweyl', 'duality', 'our', 'construction', 'is', 'based', 'on', 'hernandezleclercs', 'isomorphism', 'between', 'a', 'certain', 'graded', 'quiver', 'variety', 'and', 'the', 'space', 'of', 'representations', 'of', 'the', 'quiver', 'q', 'of', 'dimension', 'vector', 'beta', 'we', 'identify', 'the', 'functor', 'induced', 'from', 'our', 'bimodule', 'with', 'kangkashiwarakims', 'generalized', 'quantum', 'affine', 'schurweyl', 'duality', 'functor', 'as', 'a', 'byproduct', 'we', 'verify', 'a', 'conjecture', 'by', 'kangkashiwarakim', 'on', 'the', 'simpleness', 'of', 'some', 'poles', 'of', 'normalized', 'rmatrices', 'for', 'any', 'quiver', 'q', 'of', 'type', 'ade']] | [-0.16487204310568895, 0.06430876384044744, -0.10368344148790294, 0.05855653288202699, -0.15647525765340436, -0.2103509103202007, 0.002316655821844258, 0.3080056708306074, -0.4025863850150596, -0.16905836653472348, 0.05811254856016603, -0.16668735717963004, -0.21924242936074734, 0.1696400199381804, -0.1743203121745451, -0.06489841035482559, 0.04938503338278017, 0.14826134963977067, -0.13246575989548795, -0.26699273990419564, 0.4701486395841295, -0.04167249104092744, 0.2608259386382997, 0.014122670407364653, 0.15213880016976458, 0.07469539722766388, -0.014117735717445613, -0.0639282461173769, -0.15475293444892899, 0.15286237888397988, 0.32169121955944735, 0.0636561210330745, 0.109705917077901, -0.32657803628932347, -0.057476820855729534, 0.22545361545106227, 0.167737315796231, 0.03071381250311705, -0.02122739159756086, -0.298892602997578, 0.062090674275532366, -0.26219901699911463, -0.15993159625425257, -0.04709575414784591, 0.07106134961570867, -0.008516897146844052, -0.2907820366830988, -0.019801940523426643, 0.045039963705295866, 0.17322346100753003, -0.09013221502007747, -0.10404957938854667, -0.09273254520429129, 0.05611023745309054, -0.1104202085322785, 0.05263794203373519, 0.1053217820643278, -0.16027236305156045, -0.2470685163258829, 0.3041188826869157, -0.001073341689665209, -0.20592249929904938, 0.10280455703296783, -0.13399166706526144, -0.15828415667214854, 0.08158972113901242, 0.003536424980583516, 0.12707625903527844, 0.05625039663335139, 0.23578181183653546, -0.13655162009156563, -0.020640979172788898, 0.10767064914107323, 0.0019234329885379836, 0.16932815333659, 0.06848964417691936, -0.013390442424199797, 0.1542071387256411, 0.03096880316734314, -0.08284181386459916, -0.44312141094018115, -0.2381705210059987, -0.0861279500330883, 0.20214948804033073, -0.21690957836280259, -0.17557238401337102, 0.38901679733429445, 0.06887021931311624, 0.1909323558422991, 0.17517776423853568, 0.15350315299901096, 0.07569654841420495, 0.10448394720865921, -0.05070896373875836, 0.09831125258642714, 0.31823653148021547, -0.0684827172673646, -0.1963589933129366, -0.11355744550554929, 0.3368688749996099] |
1,803.01539 | Factorization of Linear Quantum Systems with Delayed Feedback | We consider the transfer functions describing the input-output relation for a
class of linear open quantum systems involving feedback with nonzero time
delays. We show how such transfer functions can be factorized into a product of
terms which are transfer functions of canonical physically realizable
components. We prove under certain conditions that this product converges, and
can be approximated on compact sets. Thus our factorization can be interpreted
as a (possibly infinite) cascade. Our result extends past work where linear
open quantum systems with a state-space realization have been shown to have a
pure cascade realization [Nurdin, H. I., Grivopoulos, S., & Petersen, I. R.
(2016). The transfer function of generic linear quantum stochastic systems has
a pure cascade realization. Automatica, 69, 324-333.]. The functions we
consider are inherently non-Markovian, which is why in our case the resulting
product may have infinitely many terms.
| quant-ph | we consider the transfer functions describing the inputoutput relation for a class of linear open quantum systems involving feedback with nonzero time delays we show how such transfer functions can be factorized into a product of terms which are transfer functions of canonical physically realizable components we prove under certain conditions that this product converges and can be approximated on compact sets thus our factorization can be interpreted as a possibly infinite cascade our result extends past work where linear open quantum systems with a statespace realization have been shown to have a pure cascade realization nurdin h i grivopoulos s petersen i r 2016 the transfer function of generic linear quantum stochastic systems has a pure cascade realization automatica 69 324333 the functions we consider are inherently nonmarkovian which is why in our case the resulting product may have infinitely many terms | [['we', 'consider', 'the', 'transfer', 'functions', 'describing', 'the', 'inputoutput', 'relation', 'for', 'a', 'class', 'of', 'linear', 'open', 'quantum', 'systems', 'involving', 'feedback', 'with', 'nonzero', 'time', 'delays', 'we', 'show', 'how', 'such', 'transfer', 'functions', 'can', 'be', 'factorized', 'into', 'a', 'product', 'of', 'terms', 'which', 'are', 'transfer', 'functions', 'of', 'canonical', 'physically', 'realizable', 'components', 'we', 'prove', 'under', 'certain', 'conditions', 'that', 'this', 'product', 'converges', 'and', 'can', 'be', 'approximated', 'on', 'compact', 'sets', 'thus', 'our', 'factorization', 'can', 'be', 'interpreted', 'as', 'a', 'possibly', 'infinite', 'cascade', 'our', 'result', 'extends', 'past', 'work', 'where', 'linear', 'open', 'quantum', 'systems', 'with', 'a', 'statespace', 'realization', 'have', 'been', 'shown', 'to', 'have', 'a', 'pure', 'cascade', 'realization', 'nurdin', 'h', 'i', 'grivopoulos', 's', 'petersen', 'i', 'r', '2016', 'the', 'transfer', 'function', 'of', 'generic', 'linear', 'quantum', 'stochastic', 'systems', 'has', 'a', 'pure', 'cascade', 'realization', 'automatica', '69', '324333', 'the', 'functions', 'we', 'consider', 'are', 'inherently', 'nonmarkovian', 'which', 'is', 'why', 'in', 'our', 'case', 'the', 'resulting', 'product', 'may', 'have', 'infinitely', 'many', 'terms']] | [-0.13531405213437578, 0.14433800121967463, -0.07266435967527118, 0.0426161834831409, -0.03624483410117104, -0.1581003807603996, -0.038324306545620586, 0.366199982999857, -0.2971019927669871, -0.23062658285167306, 0.11956909995159491, -0.229842314688185, -0.1772781470658403, 0.20986544617933903, -0.044697392437976935, 0.0615493750913029, 0.09689155226930025, -0.001485360705406002, -0.08053719796445089, -0.2393818677614397, 0.34962132580393385, -0.018331330935867068, 0.228201009164703, 0.02549811343271087, 0.11154607800000631, -0.008400256733958287, 0.010786878090378241, 0.023729375277064636, -0.10041059369943972, 0.09502412856586198, 0.29231672731380093, 0.1320029778029532, 0.25014246813457536, -0.38697838334776197, -0.252046398825098, 0.1461342237955818, 0.14455047924156592, 0.10862815353923629, -0.016323644795838137, -0.24239684493901828, 0.06888150162357054, -0.24331224255151518, -0.08524871842460112, -0.10038838922607561, 0.03449182707406845, 0.0259798393014296, -0.3000059958666246, 0.029509199167278115, 0.10087108103135693, 0.003052803158309271, -0.018815341897652292, -0.10354732960488991, 0.008862956151273763, 0.09980134507443042, -0.047213163220237754, 0.016327941522715574, 0.10478932993050585, -0.08000711338257695, -0.16284323441102466, 0.34592696632000997, -0.0776580614533196, -0.2567412973454235, 0.20520397517764083, -0.10215753320181835, -0.13892140842029654, 0.07215554499338177, 0.16408938489167402, 0.12366450178199151, -0.12791621624591185, 0.1418981853643835, -0.10958299830106767, 0.13255571832067947, 0.056649903601682775, 0.06429175625667505, 0.19260240481598367, 0.107183652350362, 0.05473889913058019, 0.17996960211667423, 0.013529012220786184, -0.15031935500331117, -0.3260779948310649, -0.15920206143500956, -0.15900849558228086, 0.1587147487324154, -0.0494171910231284, -0.17650129385882862, 0.36484471318173284, 0.07592027654445314, 0.2327251531586632, 0.0638452430003065, 0.22204236397916016, 0.2206298655315124, 0.0534344880234001, 0.09573387962614074, 0.18399470145252686, 0.13602839263175873, 0.04505152964026581, -0.17460692787859985, 0.0690552261864423, 0.05825040658856643] |
1,803.0154 | Elliptic Stable Envelopes and Finite-dimensional Representations of
Elliptic Quantum Group | We construct a finite dimensional representation of the face type, i.e
dynamical, elliptic quantum group associated with $sl_N$ on the Gelfand-Tsetlin
basis of the tensor product of the $n$-vector representations. The result is
described in a combinatorial way by using the partitions of $[1,n]$. We find
that the change of basis matrix from the standard to the Gelfand-Tsetlin basis
is given by a specialization of the elliptic weight function obtained in the
previous paper[Konno17]. Identifying the elliptic weight functions with the
elliptic stable envelopes obtained by Aganagic and Okounkov, we show a
correspondence of the Gelfand-Tsetlin bases (resp. the standard bases) to the
fixed point classes (resp. the stable classes) in the equivariant elliptic
cohomology $E_T(X)$ of the cotangent bundle $X$ of the partial flag variety. As
a result we obtain a geometric representation of the elliptic quantum group on
$E_T(X)$.
| math.QA math-ph math.AG math.MP math.RT | we construct a finite dimensional representation of the face type ie dynamical elliptic quantum group associated with sl_n on the gelfandtsetlin basis of the tensor product of the nvector representations the result is described in a combinatorial way by using the partitions of 1n we find that the change of basis matrix from the standard to the gelfandtsetlin basis is given by a specialization of the elliptic weight function obtained in the previous paperkonno17 identifying the elliptic weight functions with the elliptic stable envelopes obtained by aganagic and okounkov we show a correspondence of the gelfandtsetlin bases resp the standard bases to the fixed point classes resp the stable classes in the equivariant elliptic cohomology e_tx of the cotangent bundle x of the partial flag variety as a result we obtain a geometric representation of the elliptic quantum group on e_tx | [['we', 'construct', 'a', 'finite', 'dimensional', 'representation', 'of', 'the', 'face', 'type', 'ie', 'dynamical', 'elliptic', 'quantum', 'group', 'associated', 'with', 'sl_n', 'on', 'the', 'gelfandtsetlin', 'basis', 'of', 'the', 'tensor', 'product', 'of', 'the', 'nvector', 'representations', 'the', 'result', 'is', 'described', 'in', 'a', 'combinatorial', 'way', 'by', 'using', 'the', 'partitions', 'of', '1n', 'we', 'find', 'that', 'the', 'change', 'of', 'basis', 'matrix', 'from', 'the', 'standard', 'to', 'the', 'gelfandtsetlin', 'basis', 'is', 'given', 'by', 'a', 'specialization', 'of', 'the', 'elliptic', 'weight', 'function', 'obtained', 'in', 'the', 'previous', 'paperkonno17', 'identifying', 'the', 'elliptic', 'weight', 'functions', 'with', 'the', 'elliptic', 'stable', 'envelopes', 'obtained', 'by', 'aganagic', 'and', 'okounkov', 'we', 'show', 'a', 'correspondence', 'of', 'the', 'gelfandtsetlin', 'bases', 'resp', 'the', 'standard', 'bases', 'to', 'the', 'fixed', 'point', 'classes', 'resp', 'the', 'stable', 'classes', 'in', 'the', 'equivariant', 'elliptic', 'cohomology', 'e_tx', 'of', 'the', 'cotangent', 'bundle', 'x', 'of', 'the', 'partial', 'flag', 'variety', 'as', 'a', 'result', 'we', 'obtain', 'a', 'geometric', 'representation', 'of', 'the', 'elliptic', 'quantum', 'group', 'on', 'e_tx']] | [-0.15870805737961616, 0.05606494961539284, -0.11235768276133708, 0.020593759266193955, -0.06873021970802386, -0.07652108510706707, -0.013786351605917194, 0.30069067532728827, -0.3580261606323932, -0.1939066354451435, 0.09145914919291889, -0.25088986078543324, -0.15646828044471997, 0.170872063103265, -0.10578191586942662, 0.056134871084110013, 0.07371251382865011, 0.12480501966451162, -0.1500103165719338, -0.2461024724111277, 0.4412645201331803, -0.046160583898225534, 0.2286832905041852, -0.012532045032795786, 0.12935309017609273, 0.04054210176774567, -0.041426579910330476, -0.0381942790267723, -0.13103930842589762, 0.21003546027932316, 0.3001086759696981, 0.06123443536926061, 0.16992280000122265, -0.34988756255645836, -0.13865451701650663, 0.176167788299998, 0.09555068019378399, 0.034565298344075145, -0.02053390746171187, -0.2633461032628215, 0.08002279876797859, -0.19649036072992854, -0.19238015722283827, -0.07178270359955995, 0.01815002444532833, 0.04146746542703893, -0.2919016884273982, 0.007705149912674512, 0.08100341462309839, 0.11903282557780455, -0.054739949998578855, -0.1408762961060607, -0.0773831685755535, 0.0724646277492866, -0.03027996927100633, 0.05368991898638861, 0.0816507981225316, -0.1292518583981291, -0.15546262962411025, 0.3748038638316627, -0.0591923074954788, -0.24835167885092752, 0.09215713538495558, -0.15908575249237142, -0.12952661295754037, 0.11889751777052879, 0.10454802241375936, 0.1624636007738965, -0.01891226592082863, 0.15402836377163892, -0.1510808660449194, 0.06929485876067441, 0.09724467806518078, -0.028939648754229504, 0.13010451665946415, 0.08623274194874934, 0.04269439485256693, 0.1443706760582115, 0.004326742258438441, -0.10002838329944228, -0.3432304494082928, -0.19279089705752475, -0.14901006067604092, 0.14868861517004137, -0.14713623481397267, -0.20299169015405433, 0.4458760043606162, 0.033732088027837955, 0.23376305288942864, 0.10465237279256273, 0.18456296001261632, 0.126955801026114, 0.06525489937381021, 0.03241683307902089, 0.13205739187874965, 0.18743871157057584, -0.00442877589791481, -0.18552710941959438, -0.00313058743444604, 0.2578193778238658] |
1,803.01541 | Improving the Improved Training of Wasserstein GANs: A Consistency Term
and Its Dual Effect | Despite being impactful on a variety of problems and applications, the
generative adversarial nets (GANs) are remarkably difficult to train. This
issue is formally analyzed by \cite{arjovsky2017towards}, who also propose an
alternative direction to avoid the caveats in the minmax two-player training of
GANs. The corresponding algorithm, called Wasserstein GAN (WGAN), hinges on the
1-Lipschitz continuity of the discriminator. In this paper, we propose a novel
approach to enforcing the Lipschitz continuity in the training procedure of
WGANs. Our approach seamlessly connects WGAN with one of the recent
semi-supervised learning methods. As a result, it gives rise to not only better
photo-realistic samples than the previous methods but also state-of-the-art
semi-supervised learning results. In particular, our approach gives rise to the
inception score of more than 5.0 with only 1,000 CIFAR-10 images and is the
first that exceeds the accuracy of 90% on the CIFAR-10 dataset using only 4,000
labeled images, to the best of our knowledge.
| cs.CV cs.LG stat.ML | despite being impactful on a variety of problems and applications the generative adversarial nets gans are remarkably difficult to train this issue is formally analyzed by citearjovsky2017towards who also propose an alternative direction to avoid the caveats in the minmax twoplayer training of gans the corresponding algorithm called wasserstein gan wgan hinges on the 1lipschitz continuity of the discriminator in this paper we propose a novel approach to enforcing the lipschitz continuity in the training procedure of wgans our approach seamlessly connects wgan with one of the recent semisupervised learning methods as a result it gives rise to not only better photorealistic samples than the previous methods but also stateoftheart semisupervised learning results in particular our approach gives rise to the inception score of more than 50 with only 1000 cifar10 images and is the first that exceeds the accuracy of 90 on the cifar10 dataset using only 4000 labeled images to the best of our knowledge | [['despite', 'being', 'impactful', 'on', 'a', 'variety', 'of', 'problems', 'and', 'applications', 'the', 'generative', 'adversarial', 'nets', 'gans', 'are', 'remarkably', 'difficult', 'to', 'train', 'this', 'issue', 'is', 'formally', 'analyzed', 'by', 'citearjovsky2017towards', 'who', 'also', 'propose', 'an', 'alternative', 'direction', 'to', 'avoid', 'the', 'caveats', 'in', 'the', 'minmax', 'twoplayer', 'training', 'of', 'gans', 'the', 'corresponding', 'algorithm', 'called', 'wasserstein', 'gan', 'wgan', 'hinges', 'on', 'the', '1lipschitz', 'continuity', 'of', 'the', 'discriminator', 'in', 'this', 'paper', 'we', 'propose', 'a', 'novel', 'approach', 'to', 'enforcing', 'the', 'lipschitz', 'continuity', 'in', 'the', 'training', 'procedure', 'of', 'wgans', 'our', 'approach', 'seamlessly', 'connects', 'wgan', 'with', 'one', 'of', 'the', 'recent', 'semisupervised', 'learning', 'methods', 'as', 'a', 'result', 'it', 'gives', 'rise', 'to', 'not', 'only', 'better', 'photorealistic', 'samples', 'than', 'the', 'previous', 'methods', 'but', 'also', 'stateoftheart', 'semisupervised', 'learning', 'results', 'in', 'particular', 'our', 'approach', 'gives', 'rise', 'to', 'the', 'inception', 'score', 'of', 'more', 'than', '50', 'with', 'only', '1000', 'cifar10', 'images', 'and', 'is', 'the', 'first', 'that', 'exceeds', 'the', 'accuracy', 'of', '90', 'on', 'the', 'cifar10', 'dataset', 'using', 'only', '4000', 'labeled', 'images', 'to', 'the', 'best', 'of', 'our', 'knowledge']] | [0.0173130470517581, -0.02788940308164456, -0.08500992346746035, 0.08958451570763898, -0.1251180367395043, -0.15754199677851433, 0.04579510132092624, 0.444864443789881, -0.247656353462774, -0.35660934485927914, 0.029573805083950553, -0.27988866278573343, -0.17267678721019855, 0.2085057465443149, -0.20556247239120495, 0.06625175865916297, 0.1278444656606716, 0.04995503393449606, -0.07962709420229284, -0.3477885865379507, 0.30704533227253705, 0.031675475365959875, 0.3458383266384212, 0.03339243140847733, 0.14865510406581542, -0.07168489021177475, 0.022658495924611673, -0.019700339302802697, -0.07302801839833616, 0.20020365570701706, 0.2596431584381021, 0.1854869233390603, 0.37572286055924803, -0.39020920336807674, -0.19347859883251098, 0.107900323629833, 0.10339454472817194, 0.11810030120735367, -0.031335017424190974, -0.3384374032358233, 0.11322998213999642, -0.14422234711356652, 0.016425224704270918, -0.14245085923884732, -0.05154445708000985, -0.03306356230108903, -0.2936021473813945, 0.0533294898113803, 0.12042373710741791, 0.036968235983155094, -0.054723844310874716, -0.12174691308805799, 0.005152877514214756, 0.09334931581710967, 0.04962329215143258, 0.11902256247300941, 0.0935049139512464, -0.15791930231110504, -0.1434225867359111, 0.3443778412750898, -0.06253865038851449, -0.18576862157239632, 0.1957818487754617, -0.023062276328579545, -0.11761499764039539, 0.10425343386939345, 0.19465559905988927, 0.1915919075612552, -0.1533970980761716, 0.013814444733538832, -0.06637506644862394, 0.1411690525270294, 0.048188264230982616, -0.009209301415233849, 0.09585478994398354, 0.25444019230781123, 0.08368006334878886, 0.1489265444904912, -0.10838784182217354, -0.07027947526269902, -0.2451969216732929, -0.09785695519046082, -0.21543966707451126, 0.02803232934923308, -0.1150693614690681, -0.1622073617286216, 0.40857697782130575, 0.26160694756963027, 0.24797606990577128, 0.15401190820221716, 0.34728584378862226, 0.013165131520229178, 0.11123014204144382, 0.08960502764257865, 0.23617456587724006, 0.06534982476389417, 0.12328545592474537, -0.12121797846749616, 0.10353569900214027, 0.05257609070917496] |
1,803.01542 | Cross-domain novelty seeking trait mining for sequential recommendation | Transfer learning has attracted a large amount of interest and research in
last decades, and some efforts have been made to build more precise
recommendation systems. Most previous transfer recommendation systems assume
that the target domain shares the same/similar rating patterns with the
auxiliary source domain, which is used to improve the recommendation
performance. However, to the best of our knowledge, almost these works do not
consider the characteristics of sequential data. In this paper, we study the
new cross-domain recommendation scenario for mining novelty-seeking trait.
Recent studies in psychology suggest that novelty-seeking trait is highly
related to consumer behavior, which has a profound business impact on online
recommendation. Previous work performing on only one single target domain may
not fully characterize users' novelty-seeking trait well due to the data
scarcity and sparsity, leading to the poor recommendation performance. Along
this line, we proposed a new cross-domain novelty-seeking trait mining model
(CDNST for short) to improve the sequential recommendation performance by
transferring the knowledge from auxiliary source domain. We conduct systematic
experiments on three domain data sets crawled from Douban (www.douban.com) to
demonstrate the effectiveness of the proposed model. Moreover, we analyze how
the temporal property of sequential data affects the performance of CDNST, and
conduct simulation experiments to validate our analysis.
| cs.IR | transfer learning has attracted a large amount of interest and research in last decades and some efforts have been made to build more precise recommendation systems most previous transfer recommendation systems assume that the target domain shares the samesimilar rating patterns with the auxiliary source domain which is used to improve the recommendation performance however to the best of our knowledge almost these works do not consider the characteristics of sequential data in this paper we study the new crossdomain recommendation scenario for mining noveltyseeking trait recent studies in psychology suggest that noveltyseeking trait is highly related to consumer behavior which has a profound business impact on online recommendation previous work performing on only one single target domain may not fully characterize users noveltyseeking trait well due to the data scarcity and sparsity leading to the poor recommendation performance along this line we proposed a new crossdomain noveltyseeking trait mining model cdnst for short to improve the sequential recommendation performance by transferring the knowledge from auxiliary source domain we conduct systematic experiments on three domain data sets crawled from douban wwwdoubancom to demonstrate the effectiveness of the proposed model moreover we analyze how the temporal property of sequential data affects the performance of cdnst and conduct simulation experiments to validate our analysis | [['transfer', 'learning', 'has', 'attracted', 'a', 'large', 'amount', 'of', 'interest', 'and', 'research', 'in', 'last', 'decades', 'and', 'some', 'efforts', 'have', 'been', 'made', 'to', 'build', 'more', 'precise', 'recommendation', 'systems', 'most', 'previous', 'transfer', 'recommendation', 'systems', 'assume', 'that', 'the', 'target', 'domain', 'shares', 'the', 'samesimilar', 'rating', 'patterns', 'with', 'the', 'auxiliary', 'source', 'domain', 'which', 'is', 'used', 'to', 'improve', 'the', 'recommendation', 'performance', 'however', 'to', 'the', 'best', 'of', 'our', 'knowledge', 'almost', 'these', 'works', 'do', 'not', 'consider', 'the', 'characteristics', 'of', 'sequential', 'data', 'in', 'this', 'paper', 'we', 'study', 'the', 'new', 'crossdomain', 'recommendation', 'scenario', 'for', 'mining', 'noveltyseeking', 'trait', 'recent', 'studies', 'in', 'psychology', 'suggest', 'that', 'noveltyseeking', 'trait', 'is', 'highly', 'related', 'to', 'consumer', 'behavior', 'which', 'has', 'a', 'profound', 'business', 'impact', 'on', 'online', 'recommendation', 'previous', 'work', 'performing', 'on', 'only', 'one', 'single', 'target', 'domain', 'may', 'not', 'fully', 'characterize', 'users', 'noveltyseeking', 'trait', 'well', 'due', 'to', 'the', 'data', 'scarcity', 'and', 'sparsity', 'leading', 'to', 'the', 'poor', 'recommendation', 'performance', 'along', 'this', 'line', 'we', 'proposed', 'a', 'new', 'crossdomain', 'noveltyseeking', 'trait', 'mining', 'model', 'cdnst', 'for', 'short', 'to', 'improve', 'the', 'sequential', 'recommendation', 'performance', 'by', 'transferring', 'the', 'knowledge', 'from', 'auxiliary', 'source', 'domain', 'we', 'conduct', 'systematic', 'experiments', 'on', 'three', 'domain', 'data', 'sets', 'crawled', 'from', 'douban', 'wwwdoubancom', 'to', 'demonstrate', 'the', 'effectiveness', 'of', 'the', 'proposed', 'model', 'moreover', 'we', 'analyze', 'how', 'the', 'temporal', 'property', 'of', 'sequential', 'data', 'affects', 'the', 'performance', 'of', 'cdnst', 'and', 'conduct', 'simulation', 'experiments', 'to', 'validate', 'our', 'analysis']] | [-0.049247042415327784, -0.029219599994786013, -0.05596352006810216, 0.03798310279559631, -0.18397024165964326, -0.12479424036260192, 0.08410519431848885, 0.4438163218034718, -0.25430728654352536, -0.3198402975663507, 0.09500905419666267, -0.30661582031573814, -0.1599597326041056, 0.20057608865373858, -0.1260906232861229, 0.06800036740409829, 0.14311250390108818, 0.05899899894407449, -0.029930780187267095, -0.3148873671116934, 0.32720041714940007, 0.06713273890916473, 0.3864840056138256, 0.07354746024178055, 0.05463905035867356, -0.012254231382730022, -0.08754603020721473, -0.025571963333417304, -0.0941563979032043, 0.16928133327522887, 0.32618766917291325, 0.2107373015572263, 0.34220833919243887, -0.38666452126814804, -0.26591702877284173, 0.10984907114470843, 0.159888392459834, 0.0901269190552949, -0.09389124758679547, -0.323045497710924, 0.0857546022769104, -0.19990712947821102, -0.015779586954382606, -0.1255091123121719, -0.02335284738532769, 0.002578731296615353, -0.26121192032587714, 0.017506088308157183, 0.05415970231954886, 0.06966306583714098, -0.028459408378694206, -0.12511799653965192, 0.03868528544486393, 0.20689937979645598, 0.11006883271945228, 0.010981622211357508, 0.11905862025182265, -0.13936082076151463, -0.1742514272655871, 0.3678025408074833, -0.053511049231299415, -0.20110750277840103, 0.2253018263503551, -0.10344565438012629, -0.17319562459866014, 0.07460935127276641, 0.24447345038172968, 0.1077734912863749, -0.19329376377013083, 0.012185605906639606, -0.056578053690967724, 0.225112072480932, 0.012262587157937769, -0.004066803752301404, 0.17481678299820766, 0.2543993787571358, 0.02680917828155753, 0.1137918867305136, -0.07237701043217945, -0.11842420365876304, -0.15590256868073574, -0.10437706740832745, -0.1891022057859048, 0.001249935195468984, -0.06519703392489017, -0.1259481497288037, 0.3974587361131293, 0.2497564019425996, 0.19674239570248084, 0.025884304239298217, 0.317498889259206, 0.01632279101781583, 0.08340430740589419, 0.04863575021870649, 0.17647729583754532, -0.007179348385901763, 0.17739491795789666, -0.21103296879356584, 0.14481584672410883, -0.01841681566125212] |
1,803.01543 | N\'eel- and Bloch-Type Magnetic Vortices in Rashba Metals | We theoretically study noncoplanar spin textures in polar magnetic
conductors. Starting from the Kondo lattice model with the Rashba spin-orbit
coupling, we derive an effective spin model with generalized
Ruderman-Kittel-Kasuya-Yosida interactions including the anisotropic and
antisymmetric exchange interactions. By performing simulated annealing for the
effective model, we find that a vortex crystal of N\'eel type is stabilized
even in the absence of a magnetic field. Moreover, we demonstrate that a
Bloch-type vortex crystal, which is usually associated with the Dresselhaus
spin-orbit coupling, can also be realized in our Rashba-based model. A magnetic
field turns the vortex crystals into N\'eel- and Bloch-type skyrmion-like
crystals. Our results underscore that the interplay between the spin-orbit
coupling and itinerant magnetism brings fertile possibilities of noncoplanar
magnetic orderings.
| cond-mat.str-el | we theoretically study noncoplanar spin textures in polar magnetic conductors starting from the kondo lattice model with the rashba spinorbit coupling we derive an effective spin model with generalized rudermankittelkasuyayosida interactions including the anisotropic and antisymmetric exchange interactions by performing simulated annealing for the effective model we find that a vortex crystal of neel type is stabilized even in the absence of a magnetic field moreover we demonstrate that a blochtype vortex crystal which is usually associated with the dresselhaus spinorbit coupling can also be realized in our rashbabased model a magnetic field turns the vortex crystals into neel and blochtype skyrmionlike crystals our results underscore that the interplay between the spinorbit coupling and itinerant magnetism brings fertile possibilities of noncoplanar magnetic orderings | [['we', 'theoretically', 'study', 'noncoplanar', 'spin', 'textures', 'in', 'polar', 'magnetic', 'conductors', 'starting', 'from', 'the', 'kondo', 'lattice', 'model', 'with', 'the', 'rashba', 'spinorbit', 'coupling', 'we', 'derive', 'an', 'effective', 'spin', 'model', 'with', 'generalized', 'rudermankittelkasuyayosida', 'interactions', 'including', 'the', 'anisotropic', 'and', 'antisymmetric', 'exchange', 'interactions', 'by', 'performing', 'simulated', 'annealing', 'for', 'the', 'effective', 'model', 'we', 'find', 'that', 'a', 'vortex', 'crystal', 'of', 'neel', 'type', 'is', 'stabilized', 'even', 'in', 'the', 'absence', 'of', 'a', 'magnetic', 'field', 'moreover', 'we', 'demonstrate', 'that', 'a', 'blochtype', 'vortex', 'crystal', 'which', 'is', 'usually', 'associated', 'with', 'the', 'dresselhaus', 'spinorbit', 'coupling', 'can', 'also', 'be', 'realized', 'in', 'our', 'rashbabased', 'model', 'a', 'magnetic', 'field', 'turns', 'the', 'vortex', 'crystals', 'into', 'neel', 'and', 'blochtype', 'skyrmionlike', 'crystals', 'our', 'results', 'underscore', 'that', 'the', 'interplay', 'between', 'the', 'spinorbit', 'coupling', 'and', 'itinerant', 'magnetism', 'brings', 'fertile', 'possibilities', 'of', 'noncoplanar', 'magnetic', 'orderings']] | [-0.249906671574203, 0.2527080322210005, -0.004059151501197943, 0.05314948988654386, -0.08708545886646442, -0.15847302918753972, 0.027764425868531915, 0.41453382255683646, -0.27186284274642725, -0.2977019323990112, -0.031999529133989985, -0.24962943055613981, -0.16375587530797575, 0.16270282011426138, 0.12580451449545904, -0.08308261338000496, -0.03937686658824029, -0.061709261522060486, -0.1276154919618332, -0.22193212740641935, 0.29656511799591345, -0.04159761129024749, 0.29867754937566027, 0.09359054953405042, 0.061279478711946826, 0.018860933200524347, 0.19270449513342322, 0.041546218530691376, -0.14394318596245786, 0.060487526586294416, 0.19450481911379147, -0.1721664821592773, 0.1371739462265987, -0.4755673863114865, -0.1889730502616584, 0.011803800531670572, 0.13718851747718164, 0.21853158560418715, -0.1054488864568312, -0.33393511291199585, 0.0016484899764380803, -0.18069847018223226, -0.12946037496477972, -0.17618103996222098, -0.05427437526083029, -0.00913210304234389, -0.3268329481389828, 0.08818023004857785, 0.11646398541335834, 0.11514284366332903, -0.13220389489447926, -0.09765082294863414, -0.0982841447836197, 0.016780953248584172, 0.07552072368713657, 0.08650396662438667, 0.09718615243332536, -0.14462079914907613, -0.1638583015244477, 0.37934935659291297, -0.06664597230198664, -0.15669879910149953, 0.14002291183933857, -0.15349039842177759, -0.04868478275366067, 0.1217300940713868, 0.11320589557839028, 0.06566445120208995, -0.0980762432791232, 0.11756856037858435, -0.056168545098081835, 0.15837031750129613, -0.01428861842619452, 0.0529206725711957, 0.3237479974826177, 0.20001044201596482, 0.026452237838591502, 0.17550398023303113, -0.14480802583426797, -0.10957410632125367, -0.19712772932872782, -0.1359239471621993, -0.23557221529081585, 0.06003152395265434, -0.10704776252077124, -0.1692449359859272, 0.39010141287150424, 0.1970743910159643, 0.11014103665460484, -0.09342337356467648, 0.22036882410984396, 0.03764481466202959, 0.08588187529410167, 0.013035192994809732, 0.2955624037611533, 0.21541599625895724, 0.07043329651308496, -0.3471147261117017, 0.012786557053677677, 0.017716711307535084] |
1,803.01544 | NMR signals within the generalized Langevin model for fractional
Brownian motion | The methods of Nuclear Magnetic Resonance belong to the best developed and
often used tools for studying random motion of particles in different systems,
including soft biological tissues. In the long-time limit the current
mathematical description of the experiments allows proper interpretation of
measurements of normal and anomalous diffusion. The shorter-time dynamics is
however correctly considered only in a few works that do not go beyond the
standard memoryless Langevin description of the Brownian motion (BM). In the
present work, the attenuation function S(t) for an ensemble of spin-bearing
particles in a magnetic-field gradient, expressed in a form applicable for any
kind of stationary stochastic dynamics of spins with or without a memory, is
calculated in the frame of the model of fractional BM. The solution of the
model for particles trapped in a harmonic potential is obtained in an
exceedingly simple way and used for the calculation of S(t). In the limit of
free particles coupled to a fractal heat bath, the results compare favorably
with experiments acquired in human neuronal tissues. The effect of the trap is
demonstrated by introducing a simple model for the generalized diffusion
coefficient of the particle.
| cond-mat.stat-mech | the methods of nuclear magnetic resonance belong to the best developed and often used tools for studying random motion of particles in different systems including soft biological tissues in the longtime limit the current mathematical description of the experiments allows proper interpretation of measurements of normal and anomalous diffusion the shortertime dynamics is however correctly considered only in a few works that do not go beyond the standard memoryless langevin description of the brownian motion bm in the present work the attenuation function st for an ensemble of spinbearing particles in a magneticfield gradient expressed in a form applicable for any kind of stationary stochastic dynamics of spins with or without a memory is calculated in the frame of the model of fractional bm the solution of the model for particles trapped in a harmonic potential is obtained in an exceedingly simple way and used for the calculation of st in the limit of free particles coupled to a fractal heat bath the results compare favorably with experiments acquired in human neuronal tissues the effect of the trap is demonstrated by introducing a simple model for the generalized diffusion coefficient of the particle | [['the', 'methods', 'of', 'nuclear', 'magnetic', 'resonance', 'belong', 'to', 'the', 'best', 'developed', 'and', 'often', 'used', 'tools', 'for', 'studying', 'random', 'motion', 'of', 'particles', 'in', 'different', 'systems', 'including', 'soft', 'biological', 'tissues', 'in', 'the', 'longtime', 'limit', 'the', 'current', 'mathematical', 'description', 'of', 'the', 'experiments', 'allows', 'proper', 'interpretation', 'of', 'measurements', 'of', 'normal', 'and', 'anomalous', 'diffusion', 'the', 'shortertime', 'dynamics', 'is', 'however', 'correctly', 'considered', 'only', 'in', 'a', 'few', 'works', 'that', 'do', 'not', 'go', 'beyond', 'the', 'standard', 'memoryless', 'langevin', 'description', 'of', 'the', 'brownian', 'motion', 'bm', 'in', 'the', 'present', 'work', 'the', 'attenuation', 'function', 'st', 'for', 'an', 'ensemble', 'of', 'spinbearing', 'particles', 'in', 'a', 'magneticfield', 'gradient', 'expressed', 'in', 'a', 'form', 'applicable', 'for', 'any', 'kind', 'of', 'stationary', 'stochastic', 'dynamics', 'of', 'spins', 'with', 'or', 'without', 'a', 'memory', 'is', 'calculated', 'in', 'the', 'frame', 'of', 'the', 'model', 'of', 'fractional', 'bm', 'the', 'solution', 'of', 'the', 'model', 'for', 'particles', 'trapped', 'in', 'a', 'harmonic', 'potential', 'is', 'obtained', 'in', 'an', 'exceedingly', 'simple', 'way', 'and', 'used', 'for', 'the', 'calculation', 'of', 'st', 'in', 'the', 'limit', 'of', 'free', 'particles', 'coupled', 'to', 'a', 'fractal', 'heat', 'bath', 'the', 'results', 'compare', 'favorably', 'with', 'experiments', 'acquired', 'in', 'human', 'neuronal', 'tissues', 'the', 'effect', 'of', 'the', 'trap', 'is', 'demonstrated', 'by', 'introducing', 'a', 'simple', 'model', 'for', 'the', 'generalized', 'diffusion', 'coefficient', 'of', 'the', 'particle']] | [-0.07074767845188035, 0.14523745194204216, -0.06858195573386183, 0.047877795497091334, -0.026222507998075646, -0.12314308319522145, 0.013426858911164649, 0.3315013376898908, -0.2504048356907636, -0.27204017938735586, 0.041032718456335715, -0.26775366106577775, -0.1306713387615067, 0.21111312866438917, -0.030422735246853943, 0.07584341256733751, 0.048157862592537036, 0.08109882476977266, -0.012686535882191189, -0.1588732013109014, 0.24466261064109554, 0.04931104720587124, 0.2588882987862841, 0.01245201145017442, 0.13884282413103696, 0.02438446345089081, -0.016776165296202333, 0.03851455296838443, -0.11671667483115773, 0.10901194291606468, 0.20072759823475886, 0.04715988835475097, 0.23927966890187236, -0.4700146454464023, -0.254252341047201, 0.09368729797036697, 0.151473864539336, 0.12050805963129581, -0.04888991601425611, -0.2551006031038317, 0.01208356025078198, -0.14237795766287795, -0.1647151558912204, -0.0788643442040969, 0.021182356906744342, 0.04283552435360131, -0.28173817956000374, 0.1258672441569312, 0.1013677955888852, 0.04691655490508614, -0.0914114871923933, -0.0923276806618863, 0.037971529493612856, 0.1259129446807492, 0.03478832191315936, -0.004622511087897389, 0.17090359165058544, -0.17262903040076102, -0.12857641163282096, 0.4043346736046563, -0.11203777402261039, -0.24850343233144181, 0.19678075993336583, -0.16378922503402768, -0.10645360620886397, 0.13652904970998256, 0.15693493095144126, 0.1341955584139214, -0.21313574575954894, 0.09119971742529742, -0.010670811630310103, 0.12838899370035506, 0.03851867945923004, -0.009484234627355667, 0.16739673245077333, 0.19621803153131623, 0.009969234669066887, 0.13007932276984016, -0.10212734677285577, -0.13777557990882391, -0.29141189104363246, -0.17049535985764427, -0.2170214413005548, 0.03280422608205905, -0.09717346243974134, -0.1806069526834714, 0.3910759143315469, 0.1488784564183637, 0.1916092273798616, 0.036367538092842246, 0.26430672381441883, 0.11400816561884615, 0.05472195105297336, 0.04160008048347663, 0.24511458480507523, 0.14810554194627912, 0.12069342487181227, -0.24421390733186854, 0.05819674454687629, 0.04604604465445542] |
1,803.01545 | Optimal and Suboptimal Routing Based on Partial CSI in Random Ad-hoc
Networks | In this paper we consider routing in random wireless-adhoc-networks (WANETs),
where each node is equipped with a single antenna. Our analysis uses a proper
model of the physical layer together with an abstraction of higher
communication layers. We assume that the nodes are distributed according to a
Poisson-point-process and consider routing schemes that select the next relay
based on the geographical locations, the channel gains of its neighbor nodes
and the statistical characterization of all other nodes. While many routing
problems are formulated as optimization problems, the optimal distributed
solution is rarely accessible. In this work, we present the exact optimal
solution for the scenario analyzed. The optimal routing is given as a
maximization of a routing metric which depends solely on the known partial
channel state information (CSI) and includes an expectation with respect to the
interference statistics. The optimal routing scheme is important because it
gives an upper bound on the performance of any other routing scheme. We also
present sub-optimal routing schemes that only use part of the available
knowledge and require much lower computational complexity. Numerical results
demonstrate that the performance of the low complexity schemes is close to
optimal and outperforms other tested routing schemes.
| cs.IT math.IT | in this paper we consider routing in random wirelessadhocnetworks wanets where each node is equipped with a single antenna our analysis uses a proper model of the physical layer together with an abstraction of higher communication layers we assume that the nodes are distributed according to a poissonpointprocess and consider routing schemes that select the next relay based on the geographical locations the channel gains of its neighbor nodes and the statistical characterization of all other nodes while many routing problems are formulated as optimization problems the optimal distributed solution is rarely accessible in this work we present the exact optimal solution for the scenario analyzed the optimal routing is given as a maximization of a routing metric which depends solely on the known partial channel state information csi and includes an expectation with respect to the interference statistics the optimal routing scheme is important because it gives an upper bound on the performance of any other routing scheme we also present suboptimal routing schemes that only use part of the available knowledge and require much lower computational complexity numerical results demonstrate that the performance of the low complexity schemes is close to optimal and outperforms other tested routing schemes | [['in', 'this', 'paper', 'we', 'consider', 'routing', 'in', 'random', 'wirelessadhocnetworks', 'wanets', 'where', 'each', 'node', 'is', 'equipped', 'with', 'a', 'single', 'antenna', 'our', 'analysis', 'uses', 'a', 'proper', 'model', 'of', 'the', 'physical', 'layer', 'together', 'with', 'an', 'abstraction', 'of', 'higher', 'communication', 'layers', 'we', 'assume', 'that', 'the', 'nodes', 'are', 'distributed', 'according', 'to', 'a', 'poissonpointprocess', 'and', 'consider', 'routing', 'schemes', 'that', 'select', 'the', 'next', 'relay', 'based', 'on', 'the', 'geographical', 'locations', 'the', 'channel', 'gains', 'of', 'its', 'neighbor', 'nodes', 'and', 'the', 'statistical', 'characterization', 'of', 'all', 'other', 'nodes', 'while', 'many', 'routing', 'problems', 'are', 'formulated', 'as', 'optimization', 'problems', 'the', 'optimal', 'distributed', 'solution', 'is', 'rarely', 'accessible', 'in', 'this', 'work', 'we', 'present', 'the', 'exact', 'optimal', 'solution', 'for', 'the', 'scenario', 'analyzed', 'the', 'optimal', 'routing', 'is', 'given', 'as', 'a', 'maximization', 'of', 'a', 'routing', 'metric', 'which', 'depends', 'solely', 'on', 'the', 'known', 'partial', 'channel', 'state', 'information', 'csi', 'and', 'includes', 'an', 'expectation', 'with', 'respect', 'to', 'the', 'interference', 'statistics', 'the', 'optimal', 'routing', 'scheme', 'is', 'important', 'because', 'it', 'gives', 'an', 'upper', 'bound', 'on', 'the', 'performance', 'of', 'any', 'other', 'routing', 'scheme', 'we', 'also', 'present', 'suboptimal', 'routing', 'schemes', 'that', 'only', 'use', 'part', 'of', 'the', 'available', 'knowledge', 'and', 'require', 'much', 'lower', 'computational', 'complexity', 'numerical', 'results', 'demonstrate', 'that', 'the', 'performance', 'of', 'the', 'low', 'complexity', 'schemes', 'is', 'close', 'to', 'optimal', 'and', 'outperforms', 'other', 'tested', 'routing', 'schemes']] | [-0.20537837791830452, 0.008323798182692656, -0.04347361029934778, 0.0247668767238572, -0.09431886588425535, -0.2177423320738881, 0.12532533943533164, 0.41806434046458263, -0.26104123019578046, -0.2863069478216031, 0.11132520549951798, -0.2519746246851153, -0.14857236385660602, 0.1669102577019878, -0.11307004824600587, 0.07063895983196973, 0.07548929202238644, 0.08695846838368611, -0.03343130485176737, -0.2785921922127594, 0.313594816993414, 0.10022125177725096, 0.3473747689923685, 0.038532070549807014, 0.13234348315980773, 0.005971193957998596, -0.025163386350455272, 0.0074961365196096, -0.12564624497985039, 0.12308595770490215, 0.2826543815711494, 0.16529033680897998, 0.27756638368215375, -0.399527659950157, -0.22695381654840377, 0.09532895182068883, 0.1532316420819949, 0.1098872323366437, -0.023282516238837023, -0.2429408434816081, 0.11809589202054824, -0.17337888584594535, -0.023487380790439518, -0.0037209115689620376, -0.05730689997841237, 0.05212295939528496, -0.2909481116909195, 0.0006372448387073654, -0.012464448601487235, -0.015426736077055043, -0.059551917650910904, -0.13051866900853135, 0.008236972877351248, 0.14634477220372194, -0.0026246096587250706, 0.0061933995201605176, 0.10063448969587552, -0.10017090989276767, -0.18496400258278078, 0.3979784051812433, 0.013198261230365571, -0.24036997554099393, 0.14908872245554577, -0.02148403786122799, -0.13041118303821844, 0.12982531789586776, 0.2085640442127249, 0.14256398559482109, -0.14599354234477036, 0.05265663183194872, -0.04996134404732724, 0.18260100216962247, 0.029957739499896163, 0.10525024034002928, 0.07755736918353259, 0.2074272174228246, 0.19732251184530358, 0.1383263889504385, -0.06360311407685242, -0.14340511238910353, -0.2710868999158559, -0.1349117227772961, -0.2155857944544734, -0.01698506497154765, -0.12837336000651556, -0.13772535946859857, 0.35594452606558047, 0.1723532111929598, 0.17906342153061144, 0.08176354479780797, 0.3797986453323804, 0.09649818262609776, 0.020281249099890843, 0.1834749803217504, 0.21726790248096517, 0.05497179279395501, 0.09423344908634934, -0.2018520121034611, 0.128856484206732, 0.030625689648929044] |
1,803.01546 | Few-View CT Reconstruction with Group-Sparsity Regularization | Classical total variation (TV) based iterative reconstruction algorithms
assume that the signal is piecewise smooth, which causes reconstruction results
to suffer from the over-smoothing effect. To address this problem, this work
presents a novel computed tomography (CT) reconstruction method for the
few-view problem called the group-sparsity regularization-based simultaneous
algebraic reconstruction technique (GSR-SART). Group-based sparse
representation, which utilizes the concept of a group as the basic unit of
sparse representation instead of a patch, is introduced as the image domain
prior regularization term to eliminate the over-smoothing effect. By grouping
the nonlocal patches into different clusters with similarity measured by
Euclidean distance, the sparsity and nonlocal similarity in a single image are
simultaneously explored. The split Bregman iteration algorithm is applied to
obtain the numerical scheme. Experimental results demonstrate that our method
both qualitatively and quantitatively outperforms several existing
reconstruction methods, including filtered back projection, expectation
maximization, SART, and TV-based projections onto convex sets.
| physics.med-ph eess.IV | classical total variation tv based iterative reconstruction algorithms assume that the signal is piecewise smooth which causes reconstruction results to suffer from the oversmoothing effect to address this problem this work presents a novel computed tomography ct reconstruction method for the fewview problem called the groupsparsity regularizationbased simultaneous algebraic reconstruction technique gsrsart groupbased sparse representation which utilizes the concept of a group as the basic unit of sparse representation instead of a patch is introduced as the image domain prior regularization term to eliminate the oversmoothing effect by grouping the nonlocal patches into different clusters with similarity measured by euclidean distance the sparsity and nonlocal similarity in a single image are simultaneously explored the split bregman iteration algorithm is applied to obtain the numerical scheme experimental results demonstrate that our method both qualitatively and quantitatively outperforms several existing reconstruction methods including filtered back projection expectation maximization sart and tvbased projections onto convex sets | [['classical', 'total', 'variation', 'tv', 'based', 'iterative', 'reconstruction', 'algorithms', 'assume', 'that', 'the', 'signal', 'is', 'piecewise', 'smooth', 'which', 'causes', 'reconstruction', 'results', 'to', 'suffer', 'from', 'the', 'oversmoothing', 'effect', 'to', 'address', 'this', 'problem', 'this', 'work', 'presents', 'a', 'novel', 'computed', 'tomography', 'ct', 'reconstruction', 'method', 'for', 'the', 'fewview', 'problem', 'called', 'the', 'groupsparsity', 'regularizationbased', 'simultaneous', 'algebraic', 'reconstruction', 'technique', 'gsrsart', 'groupbased', 'sparse', 'representation', 'which', 'utilizes', 'the', 'concept', 'of', 'a', 'group', 'as', 'the', 'basic', 'unit', 'of', 'sparse', 'representation', 'instead', 'of', 'a', 'patch', 'is', 'introduced', 'as', 'the', 'image', 'domain', 'prior', 'regularization', 'term', 'to', 'eliminate', 'the', 'oversmoothing', 'effect', 'by', 'grouping', 'the', 'nonlocal', 'patches', 'into', 'different', 'clusters', 'with', 'similarity', 'measured', 'by', 'euclidean', 'distance', 'the', 'sparsity', 'and', 'nonlocal', 'similarity', 'in', 'a', 'single', 'image', 'are', 'simultaneously', 'explored', 'the', 'split', 'bregman', 'iteration', 'algorithm', 'is', 'applied', 'to', 'obtain', 'the', 'numerical', 'scheme', 'experimental', 'results', 'demonstrate', 'that', 'our', 'method', 'both', 'qualitatively', 'and', 'quantitatively', 'outperforms', 'several', 'existing', 'reconstruction', 'methods', 'including', 'filtered', 'back', 'projection', 'expectation', 'maximization', 'sart', 'and', 'tvbased', 'projections', 'onto', 'convex', 'sets']] | [-0.038825855716009085, -0.03621314075089207, -0.10404520794461285, 0.07942422519447159, -0.11117760688035846, -0.14583593441516554, 0.014911649610822727, 0.40832939969473764, -0.36793645335082575, -0.2909517203623086, 0.09961755699355547, -0.24163278755976966, -0.2006889196069862, 0.1508699380118694, -0.13995605002549527, 0.09511744489856555, 0.10357360586854875, 0.0010953888015233372, -0.14837430311538474, -0.25310927761280544, 0.29727557589649223, 0.028466863649603175, 0.34539109460494827, -0.005813751018936991, 0.16309699001048053, 0.04745156796477539, -0.08994352318098352, 0.05333234085073376, -0.05941934518619076, 0.14449085032844633, 0.2655402948516176, 0.18556828885400473, 0.30565476119763363, -0.3870045244448671, -0.2622898125922994, 0.10330397799905193, 0.13886405037728286, 0.08855013309967992, -0.07518140320807058, -0.30328414692102296, 0.08308342910727094, -0.10188963327948984, 0.004977209331149137, -0.10488974297569305, -0.08766068131616951, -0.04243677236464512, -0.32955934291117284, 0.1111974249667439, 0.03999213267506045, -0.0059943416809370605, -0.07956000351910725, -0.12961818114165094, 0.05067917430699852, 0.08346027825456603, 0.024993508629880746, 0.10547437545756111, 0.12822231237078086, -0.06737488518640596, -0.14276587824478107, 0.3481610225525832, -0.033650978305223886, -0.26102737490145955, 0.14451867217767836, -0.05537123706246922, -0.10512465861699495, 0.1631511074833964, 0.18520830341290812, 0.1374895812202196, -0.15273121941228104, 0.06832073569660822, -0.05552977931955339, 0.13158427611511128, 0.06412141776557914, 0.000291520218046284, 0.07806623168596018, 0.13087967251914578, 0.11351865164224843, 0.16503126486082023, -0.15197663152235022, -0.058823355853459554, -0.23734304843176351, -0.0755012938783406, -0.2371518840143261, -0.053389861864209374, -0.10864903452152487, -0.1967512977671025, 0.4036001896503254, 0.15763719902047582, 0.22260428350541347, 0.07525573905303118, 0.4041762089948047, 0.07978867012992084, 0.08648257319950253, 0.03800783956754267, 0.1722243484982755, 0.11013364900013824, 0.06893560257250149, -0.24630735903108297, 0.05977306225318707, 0.17649917594328718] |
1,803.01547 | Energy dependence of light (anti)nuclei and (anti)hypertriton production
in the Au-Au collision from $\sqrt{s_{\rm{NN}}} =5.0$ to $5020$ GeV | The energy dependence of light (anti)nuclei and (anti)hypertriton production
are investigated in central Au-Au collisions from AGS up to LHC energies at
midrapidity, using the parton and hadron cascade model (PACIAE) together with
the dynamically constrained phase-space coalescence model(DCPC). We find that
the yields, yield ratios of the antiparticles to their corresponding particles,
the coalescence parameters $B_A$ and the strangeness population factor $s_3$ of
light (anti)nuclei and (anti)hypertriton strongly depend on the energy.
Furthermore, we analyze and discuss the strangeness population factor $s_3$ and
the coalescence parameters $B_A$, and find a transition point near by 20 GeV.
These results thus suggest the potential usefulness of the $s_3$ and $B_A$ of
light nuclei production in relativistic heavy-ion collisions as a direct probe
of the transition point associated with the QCD critical phenomena. The results
from PACIAE+DCPC model are well consistent with experimental data.
| nucl-th hep-ph | the energy dependence of light antinuclei and antihypertriton production are investigated in central auau collisions from ags up to lhc energies at midrapidity using the parton and hadron cascade model paciae together with the dynamically constrained phasespace coalescence modeldcpc we find that the yields yield ratios of the antiparticles to their corresponding particles the coalescence parameters b_a and the strangeness population factor s_3 of light antinuclei and antihypertriton strongly depend on the energy furthermore we analyze and discuss the strangeness population factor s_3 and the coalescence parameters b_a and find a transition point near by 20 gev these results thus suggest the potential usefulness of the s_3 and b_a of light nuclei production in relativistic heavyion collisions as a direct probe of the transition point associated with the qcd critical phenomena the results from paciaedcpc model are well consistent with experimental data | [['the', 'energy', 'dependence', 'of', 'light', 'antinuclei', 'and', 'antihypertriton', 'production', 'are', 'investigated', 'in', 'central', 'auau', 'collisions', 'from', 'ags', 'up', 'to', 'lhc', 'energies', 'at', 'midrapidity', 'using', 'the', 'parton', 'and', 'hadron', 'cascade', 'model', 'paciae', 'together', 'with', 'the', 'dynamically', 'constrained', 'phasespace', 'coalescence', 'modeldcpc', 'we', 'find', 'that', 'the', 'yields', 'yield', 'ratios', 'of', 'the', 'antiparticles', 'to', 'their', 'corresponding', 'particles', 'the', 'coalescence', 'parameters', 'b_a', 'and', 'the', 'strangeness', 'population', 'factor', 's_3', 'of', 'light', 'antinuclei', 'and', 'antihypertriton', 'strongly', 'depend', 'on', 'the', 'energy', 'furthermore', 'we', 'analyze', 'and', 'discuss', 'the', 'strangeness', 'population', 'factor', 's_3', 'and', 'the', 'coalescence', 'parameters', 'b_a', 'and', 'find', 'a', 'transition', 'point', 'near', 'by', '20', 'gev', 'these', 'results', 'thus', 'suggest', 'the', 'potential', 'usefulness', 'of', 'the', 's_3', 'and', 'b_a', 'of', 'light', 'nuclei', 'production', 'in', 'relativistic', 'heavyion', 'collisions', 'as', 'a', 'direct', 'probe', 'of', 'the', 'transition', 'point', 'associated', 'with', 'the', 'qcd', 'critical', 'phenomena', 'the', 'results', 'from', 'paciaedcpc', 'model', 'are', 'well', 'consistent', 'with', 'experimental', 'data']] | [-0.04133927316870541, 0.25906027481209354, -0.12702116805594416, 0.12349348744444016, 0.026798829506151377, -0.07401211765993919, 0.01754323476592877, 0.3435584335720965, -0.1999045182584918, -0.3047066975517997, -0.023629836480332806, -0.3505262765833842, 0.04903747350908816, 0.1606126939179376, 0.09392412106639572, 0.07226398996010955, 0.09599856866989284, 0.03211291180757273, -0.052517051946571365, -0.18177465660098407, 0.33111675413258906, 0.11188581803414438, 0.22154119074610726, 0.16363524380140007, 0.0665527023632811, 0.027675727106231663, -0.017008495798966447, -0.03927814451578472, -0.15474888229203185, 0.06082630661424316, 0.19725005246665595, 0.07642987295486299, 0.08931746017021526, -0.36956546860081807, -0.15815608794135708, 0.1341264092928863, 0.1460790384028639, 0.09379100719732898, -0.112825650198751, -0.2782259045967034, 0.06958699233489045, -0.2135128746457797, -0.15813518361038795, -0.0502001975130822, -0.01700038212085409, 0.09472531573846936, -0.2814814416691661, 0.12778281296736427, -0.047066840834616284, 0.026439618741694305, -0.045011022045010965, -0.19652840102291, -0.10499844255557816, -0.005473030749375799, 0.12251506479889421, 0.07901177697016724, 0.22973151787716364, -0.15787601128852527, -0.15868489692054158, 0.4204855569904404, 0.005815332115162164, -0.09717735113975193, 0.17412496880694692, -0.19516990921194, -0.14052629493443028, 0.16047111109032164, 0.2568722643490349, 0.077512655859547, -0.16219289822370878, 0.04040201197411599, 0.0024795629932279034, 0.1620215741406095, 0.0578847420002733, 0.05833247616953616, 0.2161392865835556, 0.19449143068133187, -0.05068795308720187, 0.06416159402246453, -0.10469763242914008, -0.11982204706042207, -0.3651709345003058, -0.08110140830477966, -0.08709735783881374, 0.04014813119761779, -0.1383827782915822, -0.036399460667079046, 0.3868983468373439, 0.09822211516023215, 0.29342470398571874, 0.01350377783247885, 0.23891782835791153, 0.0968148984804949, 0.018054279966080295, 0.10000373551488988, 0.31329039592029795, 0.16547789016372658, 0.13359682875286255, -0.2828648958987157, 0.01723295092337399, 0.027175982243248395] |
1,803.01548 | Online learning over a finite action set with limited switching | This paper studies the value of switching actions in the Prediction From
Experts (PFE) problem and Adversarial Multi-Armed Bandits (MAB) problem. First,
we revisit the well-studied and practically motivated setting of PFE with
switching costs. Many algorithms are known to achieve the minimax optimal order
of $O(\sqrt{T \log n})$ in expectation for both regret and number of switches,
where $T$ is the number of iterations and $n$ the number of actions. However,
no high probability (h.p.) guarantees are known. Our main technical
contribution is the first algorithms which with h.p. achieve this optimal order
for both regret and switches. This settles an open problem of [Devroye et al.,
2015], and directly implies the first h.p. guarantees for several problems of
interest.
Next, to investigate the value of switching actions at a more granular level,
we introduce the setting of switching budgets, in which algorithms are limited
to $S \leq T$ switches between actions. This entails a limited number of free
switches, in contrast to the unlimited number of expensive switches in the
switching cost setting. Using the above result and several reductions, we unify
previous work and completely characterize the complexity of this switching
budget setting up to small polylogarithmic factors: for both PFE and MAB, for
all switching budgets $S \leq T$, and for both expectation and h.p. guarantees.
For PFE, we show the optimal rate is $\tilde{\Theta}(\sqrt{T\log n})$ for $S =
\Omega(\sqrt{T\log n})$, and $\min(\tilde{\Theta}(\tfrac{T\log n}{S}), T)$ for
$S = O(\sqrt{T \log n})$. Interestingly, the bandit setting does not exhibit
such a phase transition; instead we show the minimax rate decays steadily as
$\min(\tilde{\Theta}(\tfrac{T\sqrt{n}}{\sqrt{S}}), T)$ for all ranges of $S
\leq T$. These results recover and generalize the known minimax rates for the
(arbitrary) switching cost setting.
| cs.LG math.OC | this paper studies the value of switching actions in the prediction from experts pfe problem and adversarial multiarmed bandits mab problem first we revisit the wellstudied and practically motivated setting of pfe with switching costs many algorithms are known to achieve the minimax optimal order of osqrtt log n in expectation for both regret and number of switches where t is the number of iterations and n the number of actions however no high probability hp guarantees are known our main technical contribution is the first algorithms which with hp achieve this optimal order for both regret and switches this settles an open problem of devroye et al 2015 and directly implies the first hp guarantees for several problems of interest next to investigate the value of switching actions at a more granular level we introduce the setting of switching budgets in which algorithms are limited to s leq t switches between actions this entails a limited number of free switches in contrast to the unlimited number of expensive switches in the switching cost setting using the above result and several reductions we unify previous work and completely characterize the complexity of this switching budget setting up to small polylogarithmic factors for both pfe and mab for all switching budgets s leq t and for both expectation and hp guarantees for pfe we show the optimal rate is tildethetasqrttlog n for s omegasqrttlog n and mintildethetatfractlog ns t for s osqrtt log n interestingly the bandit setting does not exhibit such a phase transition instead we show the minimax rate decays steadily as mintildethetatfractsqrtnsqrts t for all ranges of s leq t these results recover and generalize the known minimax rates for the arbitrary switching cost setting | [['this', 'paper', 'studies', 'the', 'value', 'of', 'switching', 'actions', 'in', 'the', 'prediction', 'from', 'experts', 'pfe', 'problem', 'and', 'adversarial', 'multiarmed', 'bandits', 'mab', 'problem', 'first', 'we', 'revisit', 'the', 'wellstudied', 'and', 'practically', 'motivated', 'setting', 'of', 'pfe', 'with', 'switching', 'costs', 'many', 'algorithms', 'are', 'known', 'to', 'achieve', 'the', 'minimax', 'optimal', 'order', 'of', 'osqrtt', 'log', 'n', 'in', 'expectation', 'for', 'both', 'regret', 'and', 'number', 'of', 'switches', 'where', 't', 'is', 'the', 'number', 'of', 'iterations', 'and', 'n', 'the', 'number', 'of', 'actions', 'however', 'no', 'high', 'probability', 'hp', 'guarantees', 'are', 'known', 'our', 'main', 'technical', 'contribution', 'is', 'the', 'first', 'algorithms', 'which', 'with', 'hp', 'achieve', 'this', 'optimal', 'order', 'for', 'both', 'regret', 'and', 'switches', 'this', 'settles', 'an', 'open', 'problem', 'of', 'devroye', 'et', 'al', '2015', 'and', 'directly', 'implies', 'the', 'first', 'hp', 'guarantees', 'for', 'several', 'problems', 'of', 'interest', 'next', 'to', 'investigate', 'the', 'value', 'of', 'switching', 'actions', 'at', 'a', 'more', 'granular', 'level', 'we', 'introduce', 'the', 'setting', 'of', 'switching', 'budgets', 'in', 'which', 'algorithms', 'are', 'limited', 'to', 's', 'leq', 't', 'switches', 'between', 'actions', 'this', 'entails', 'a', 'limited', 'number', 'of', 'free', 'switches', 'in', 'contrast', 'to', 'the', 'unlimited', 'number', 'of', 'expensive', 'switches', 'in', 'the', 'switching', 'cost', 'setting', 'using', 'the', 'above', 'result', 'and', 'several', 'reductions', 'we', 'unify', 'previous', 'work', 'and', 'completely', 'characterize', 'the', 'complexity', 'of', 'this', 'switching', 'budget', 'setting', 'up', 'to', 'small', 'polylogarithmic', 'factors', 'for', 'both', 'pfe', 'and', 'mab', 'for', 'all', 'switching', 'budgets', 's', 'leq', 't', 'and', 'for', 'both', 'expectation', 'and', 'hp', 'guarantees', 'for', 'pfe', 'we', 'show', 'the', 'optimal', 'rate', 'is', 'tildethetasqrttlog', 'n', 'for', 's', 'omegasqrttlog', 'n', 'and', 'mintildethetatfractlog', 'ns', 't', 'for', 's', 'osqrtt', 'log', 'n', 'interestingly', 'the', 'bandit', 'setting', 'does', 'not', 'exhibit', 'such', 'a', 'phase', 'transition', 'instead', 'we', 'show', 'the', 'minimax', 'rate', 'decays', 'steadily', 'as', 'mintildethetatfractsqrtnsqrts', 't', 'for', 'all', 'ranges', 'of', 's', 'leq', 't', 'these', 'results', 'recover', 'and', 'generalize', 'the', 'known', 'minimax', 'rates', 'for', 'the', 'arbitrary', 'switching', 'cost', 'setting']] | [-0.1470001053645904, 0.11432842684004911, 0.006285353056928505, 0.04910389289454073, -0.05975686978917345, -0.16079303770829584, 0.14890630283991907, 0.3772447737256335, -0.283094227638971, -0.35979298575593704, 0.09762582490376984, -0.247259503766868, -0.10837465201878045, 0.19789475597796613, -0.1280198106163777, 0.07959023602932112, -0.003898042598048179, 0.04662388941855581, -0.03300699492827611, -0.30621642496703394, 0.24763991355372744, 0.016390875288755914, 0.24872372540655174, 0.004784531960968922, 0.09189902575581266, -0.005280078317173641, 0.025224268094179065, 0.028886720982409828, -0.1611666502365217, 0.0846563300085764, 0.28628845599006086, 0.14040931097031062, 0.3205006590282525, -0.384816282063512, -0.17583906240086647, 0.15817371187131035, 0.10517847080724874, 0.0639876245122811, -0.027305133689563908, -0.19776571917433172, 0.10939006112325055, -0.13555954055952785, -0.03868850657153651, -0.05427100986090913, 0.0379274756048704, 0.008194975083522736, -0.35877459050014665, 0.026311533189915096, 0.09762033260042381, -0.003953296460816802, -0.055002682068954506, -0.15494403897129763, 0.05412471880593301, 0.13401129683183485, 0.07713304959441611, 0.048144461776400575, 0.08246705503048303, -0.14719091558190517, -0.1721250155690544, 0.3213715082718974, -0.048740987738762245, -0.130558468478768, 0.16520348156542375, -0.13413768629757392, -0.14817686930344878, 0.1184584855763472, 0.17931852316567773, 0.19970664438738508, -0.09669976678673613, 0.1486411714708752, -0.03809814273779587, 0.1510028958994428, 0.09244944124446372, 0.05251901952324389, 0.05058406353615514, 0.16523519115085536, 0.15223477283215428, 0.12790931010365408, -0.03073118468532635, -0.11426531664254605, -0.30671986461659834, -0.14404916423850103, -0.15360023414279259, 0.039031668021576066, -0.10455988436317616, -0.09593664487748153, 0.3005713111163173, 0.1497265094292248, 0.23710179288296504, 0.17653191152568445, 0.28582974068998185, 0.09812446003397203, -0.00998758927584945, 0.17254494930257158, 0.2054825150481896, 0.09286374703227368, 0.08367636731690842, -0.2311116779887845, 0.10843948068840975, 0.037552735050844006] |
1,803.01549 | Relocalization, Global Optimization and Map Merging for Monocular
Visual-Inertial SLAM | The monocular visual-inertial system (VINS), which consists one camera and
one low-cost inertial measurement unit (IMU), is a popular approach to achieve
accurate 6-DOF state estimation. However, such locally accurate visual-inertial
odometry is prone to drift and cannot provide absolute pose estimation.
Leveraging history information to relocalize and correct drift has become a hot
topic. In this paper, we propose a monocular visual-inertial SLAM system, which
can relocalize camera and get the absolute pose in a previous-built map. Then
4-DOF pose graph optimization is performed to correct drifts and achieve global
consistent. The 4-DOF contains x, y, z, and yaw angle, which is the actual
drifted direction in the visual-inertial system. Furthermore, the proposed
system can reuse a map by saving and loading it in an efficient way. Current
map and previous map can be merged together by the global pose graph
optimization. We validate the accuracy of our system on public datasets and
compare against other state-of-the-art algorithms. We also evaluate the map
merging ability of our system in the large-scale outdoor environment. The
source code of map reuse is integrated into our public code, VINS-Mono.
| cs.CV | the monocular visualinertial system vins which consists one camera and one lowcost inertial measurement unit imu is a popular approach to achieve accurate 6dof state estimation however such locally accurate visualinertial odometry is prone to drift and cannot provide absolute pose estimation leveraging history information to relocalize and correct drift has become a hot topic in this paper we propose a monocular visualinertial slam system which can relocalize camera and get the absolute pose in a previousbuilt map then 4dof pose graph optimization is performed to correct drifts and achieve global consistent the 4dof contains x y z and yaw angle which is the actual drifted direction in the visualinertial system furthermore the proposed system can reuse a map by saving and loading it in an efficient way current map and previous map can be merged together by the global pose graph optimization we validate the accuracy of our system on public datasets and compare against other stateoftheart algorithms we also evaluate the map merging ability of our system in the largescale outdoor environment the source code of map reuse is integrated into our public code vinsmono | [['the', 'monocular', 'visualinertial', 'system', 'vins', 'which', 'consists', 'one', 'camera', 'and', 'one', 'lowcost', 'inertial', 'measurement', 'unit', 'imu', 'is', 'a', 'popular', 'approach', 'to', 'achieve', 'accurate', '6dof', 'state', 'estimation', 'however', 'such', 'locally', 'accurate', 'visualinertial', 'odometry', 'is', 'prone', 'to', 'drift', 'and', 'can', 'not', 'provide', 'absolute', 'pose', 'estimation', 'leveraging', 'history', 'information', 'to', 'relocalize', 'and', 'correct', 'drift', 'has', 'become', 'a', 'hot', 'topic', 'in', 'this', 'paper', 'we', 'propose', 'a', 'monocular', 'visualinertial', 'slam', 'system', 'which', 'can', 'relocalize', 'camera', 'and', 'get', 'the', 'absolute', 'pose', 'in', 'a', 'previousbuilt', 'map', 'then', '4dof', 'pose', 'graph', 'optimization', 'is', 'performed', 'to', 'correct', 'drifts', 'and', 'achieve', 'global', 'consistent', 'the', '4dof', 'contains', 'x', 'y', 'z', 'and', 'yaw', 'angle', 'which', 'is', 'the', 'actual', 'drifted', 'direction', 'in', 'the', 'visualinertial', 'system', 'furthermore', 'the', 'proposed', 'system', 'can', 'reuse', 'a', 'map', 'by', 'saving', 'and', 'loading', 'it', 'in', 'an', 'efficient', 'way', 'current', 'map', 'and', 'previous', 'map', 'can', 'be', 'merged', 'together', 'by', 'the', 'global', 'pose', 'graph', 'optimization', 'we', 'validate', 'the', 'accuracy', 'of', 'our', 'system', 'on', 'public', 'datasets', 'and', 'compare', 'against', 'other', 'stateoftheart', 'algorithms', 'we', 'also', 'evaluate', 'the', 'map', 'merging', 'ability', 'of', 'our', 'system', 'in', 'the', 'largescale', 'outdoor', 'environment', 'the', 'source', 'code', 'of', 'map', 'reuse', 'is', 'integrated', 'into', 'our', 'public', 'code', 'vinsmono']] | [-0.1203919191929427, -0.02799696479088261, -0.08154319909047635, -0.002410382611980851, -0.08207935352067658, -0.19590164631117077, -0.01215764422798878, 0.4457338032198144, -0.27161721987425685, -0.3334970218004948, 0.13601102263051618, -0.27081963819928495, -0.12110877753718492, 0.21010507673665105, -0.1945266282350263, 0.1086598503126957, 0.17353233341177438, 0.02547252783940901, -0.05298141161985895, -0.22450151747649158, 0.2398392900022713, 0.05921168607425562, 0.27286575352125625, 0.0030958950395053404, 0.20189389131370594, 0.013253129741057435, -0.04735951193976888, -0.0021597908904407432, -0.0716790742014241, 0.14815678668113794, 0.2465786741907026, 0.1713228544424522, 0.25209870143609253, -0.3630679958502458, -0.20261419482683554, 0.0615400643645721, 0.1618907220243292, 0.09637362191854805, -0.04612132704027375, -0.37563837212286294, 0.08550241506623632, -0.19132397890733405, -0.03518739815074253, -0.09846870012377154, -0.00394145989377191, -0.017447589455237163, -0.31430054370084787, 0.04012290328441631, 0.010867567186338458, 0.04451537334091244, -0.08123500547546117, -0.07273449532732487, -0.0017597493678231768, 0.2350046541367503, -0.017947590594892118, 0.13856732982203346, 0.1981881741287416, -0.12171384665745723, -0.08054730256043255, 0.37978136806405166, -0.06117552399129811, -0.2391759111112691, 0.18488968695130417, -0.07086073764584919, -0.10792957889513775, 0.14072388419283824, 0.21974741225753397, 0.10021299348875164, -0.1767433192232315, 0.04395123350995538, -0.038787076400373786, 0.20753919227636433, -0.002140624819691965, -0.01843355982913013, 0.1941146543473603, 0.19570507924196953, 0.1598097301302428, 0.10529722168980625, -0.16731116689061795, -0.04560640775025847, -0.1961942054051159, -0.14446180971089706, -0.14895854041572998, -0.028929218195330845, -0.08100728147697728, -0.12276648059250778, 0.3965908447031509, 0.27665907143301427, 0.171725453054383, 0.06409794388695017, 0.4253636483093076, 0.031974698495951526, 0.0485125088075644, 0.10003379776197321, 0.20776154422749052, 0.018872138061735003, 0.10620289894174485, -0.19403316681198576, 0.07643443009850973, 0.07760666887260934] |
1,803.0155 | Deep-Learning in Search of Light Charged Higgs | In this work, we deep-learn light charged Higgs signal in top quark decays
which poses difficulties due to strong W boson contamination. We construct Deep
Neural Networks (DNN) with appropriate architecture and determine signal
extraction efficiency by considering various features (kinematical and human
engineered parameters). Results show that DNN gives better performance than the
classical neural networks and has ability to find regions of high efficiency
even the input features are not human-engineered. In a sense, human-engineered
high-level features are offset by DNNs with different combinations of the
low-level kinematical features. Additionally, it is shown that increasing the
number of processing units in DNNs does not necessarily cause an increase in
efficiency due mainly to increased complexity. Our method and results can set
an example of signal extraction from strong backgrounds.
| hep-ph | in this work we deeplearn light charged higgs signal in top quark decays which poses difficulties due to strong w boson contamination we construct deep neural networks dnn with appropriate architecture and determine signal extraction efficiency by considering various features kinematical and human engineered parameters results show that dnn gives better performance than the classical neural networks and has ability to find regions of high efficiency even the input features are not humanengineered in a sense humanengineered highlevel features are offset by dnns with different combinations of the lowlevel kinematical features additionally it is shown that increasing the number of processing units in dnns does not necessarily cause an increase in efficiency due mainly to increased complexity our method and results can set an example of signal extraction from strong backgrounds | [['in', 'this', 'work', 'we', 'deeplearn', 'light', 'charged', 'higgs', 'signal', 'in', 'top', 'quark', 'decays', 'which', 'poses', 'difficulties', 'due', 'to', 'strong', 'w', 'boson', 'contamination', 'we', 'construct', 'deep', 'neural', 'networks', 'dnn', 'with', 'appropriate', 'architecture', 'and', 'determine', 'signal', 'extraction', 'efficiency', 'by', 'considering', 'various', 'features', 'kinematical', 'and', 'human', 'engineered', 'parameters', 'results', 'show', 'that', 'dnn', 'gives', 'better', 'performance', 'than', 'the', 'classical', 'neural', 'networks', 'and', 'has', 'ability', 'to', 'find', 'regions', 'of', 'high', 'efficiency', 'even', 'the', 'input', 'features', 'are', 'not', 'humanengineered', 'in', 'a', 'sense', 'humanengineered', 'highlevel', 'features', 'are', 'offset', 'by', 'dnns', 'with', 'different', 'combinations', 'of', 'the', 'lowlevel', 'kinematical', 'features', 'additionally', 'it', 'is', 'shown', 'that', 'increasing', 'the', 'number', 'of', 'processing', 'units', 'in', 'dnns', 'does', 'not', 'necessarily', 'cause', 'an', 'increase', 'in', 'efficiency', 'due', 'mainly', 'to', 'increased', 'complexity', 'our', 'method', 'and', 'results', 'can', 'set', 'an', 'example', 'of', 'signal', 'extraction', 'from', 'strong', 'backgrounds']] | [-0.06141352034621657, 0.06910242608305103, -0.038923559789187635, 0.07340686086010044, -0.09820840168887605, -0.1663415366461357, 0.02127802443708508, 0.4226082923034063, -0.27262182978626626, -0.35160008218999095, 0.023836273298813746, -0.27687665538575784, -0.18066217810488663, 0.19944414612837136, -0.11870095494848032, 0.08245490885411318, 0.1363602167281967, 0.005116088469870962, -0.06239950722978952, -0.25736669894809333, 0.27947976341327796, 0.07767011800292843, 0.335737410821737, 0.056248451303690675, 0.07824004795760489, -0.05209357069375423, -0.029721639763850432, -0.0417545369020305, -0.027026667510933924, 0.1280073091137008, 0.28258190311697456, 0.16117697871433428, 0.25775028441387876, -0.4033765842779898, -0.23157600710132661, 0.1405176891837842, 0.17525701264743335, 0.11918448026363666, -0.04270553643671939, -0.2998046024675624, 0.1419489874325406, -0.16051515337223043, -0.02441943402831944, -0.1259637665308009, -0.007660246722830029, 0.00444787196868744, -0.2650069266271133, 0.03040424655549801, 0.0910040064356648, 0.04035087389728198, -0.008679798120059645, -0.1321072447185333, -0.02972105808932191, 0.11035227807095417, 0.06355524861003058, 0.052540793928962486, 0.18820478912944405, -0.22655637064554657, -0.11856114027681403, 0.334526516439823, -0.07207435504410219, -0.23040905853984162, 0.23737735973957638, -0.09424233004414978, -0.1319856257070429, 0.14414632139512554, 0.22117071030661464, 0.049297265163980995, -0.1496098357037856, 0.048830621786272295, 0.02741589478861827, 0.22321174371844302, 0.04968920756632892, 0.09579289721217579, 0.20759670338414324, 0.19366357897479947, 0.005204500845418527, 0.14059000401757657, -0.11436366513729669, -0.04341989597305655, -0.24605643748520659, -0.07014438428271275, -0.13318263675587683, 0.0038341454089207286, -0.10735812688183684, -0.10748018451245465, 0.3825594495623731, 0.18951308689429425, 0.2523449425513928, 0.048784844051652516, 0.32525436681193803, 0.09425230824910194, 0.14875986600079788, 0.08614887018831303, 0.2551796548319264, 0.08129742802120746, 0.11204904903872655, -0.19639164194500502, 0.08305873728419941, 0.015183632339064319] |
1,803.01551 | The Connes character formula for locally compact spectral triples | A fundamental tool in noncommutative geometry is Connes' character formula.
This formula is used in an essential way in the applications of noncommutative
geometry to index theory and to the spectral characterisation of manifolds.
A non-compact space is modelled in noncommutative geometry by a non-unital
spectral triple. Our aim is to establish the Connes character formula for
non-unital spectral triples. This is significantly more difficult than in the
unital case and we achieve it with the use of recently developed double
operator integration techniques. Previously, only partial extensions of Connes'
character formula to the non-unital case were known.
In the course of the proof, we establish two more results of importance in
noncommutative geometry: an asymptotic for the heat semigroup of a non-unital
spectral triple, and the analyticity of the associated $\zeta$-function.
We require certain assumptions on the underlying spectral triple, and we
verify these assumptions in the case of spectral triples associated to
arbitrary complete Riemannian manifolds and also in the case of Moyal planes.
| math.OA | a fundamental tool in noncommutative geometry is connes character formula this formula is used in an essential way in the applications of noncommutative geometry to index theory and to the spectral characterisation of manifolds a noncompact space is modelled in noncommutative geometry by a nonunital spectral triple our aim is to establish the connes character formula for nonunital spectral triples this is significantly more difficult than in the unital case and we achieve it with the use of recently developed double operator integration techniques previously only partial extensions of connes character formula to the nonunital case were known in the course of the proof we establish two more results of importance in noncommutative geometry an asymptotic for the heat semigroup of a nonunital spectral triple and the analyticity of the associated zetafunction we require certain assumptions on the underlying spectral triple and we verify these assumptions in the case of spectral triples associated to arbitrary complete riemannian manifolds and also in the case of moyal planes | [['a', 'fundamental', 'tool', 'in', 'noncommutative', 'geometry', 'is', 'connes', 'character', 'formula', 'this', 'formula', 'is', 'used', 'in', 'an', 'essential', 'way', 'in', 'the', 'applications', 'of', 'noncommutative', 'geometry', 'to', 'index', 'theory', 'and', 'to', 'the', 'spectral', 'characterisation', 'of', 'manifolds', 'a', 'noncompact', 'space', 'is', 'modelled', 'in', 'noncommutative', 'geometry', 'by', 'a', 'nonunital', 'spectral', 'triple', 'our', 'aim', 'is', 'to', 'establish', 'the', 'connes', 'character', 'formula', 'for', 'nonunital', 'spectral', 'triples', 'this', 'is', 'significantly', 'more', 'difficult', 'than', 'in', 'the', 'unital', 'case', 'and', 'we', 'achieve', 'it', 'with', 'the', 'use', 'of', 'recently', 'developed', 'double', 'operator', 'integration', 'techniques', 'previously', 'only', 'partial', 'extensions', 'of', 'connes', 'character', 'formula', 'to', 'the', 'nonunital', 'case', 'were', 'known', 'in', 'the', 'course', 'of', 'the', 'proof', 'we', 'establish', 'two', 'more', 'results', 'of', 'importance', 'in', 'noncommutative', 'geometry', 'an', 'asymptotic', 'for', 'the', 'heat', 'semigroup', 'of', 'a', 'nonunital', 'spectral', 'triple', 'and', 'the', 'analyticity', 'of', 'the', 'associated', 'zetafunction', 'we', 'require', 'certain', 'assumptions', 'on', 'the', 'underlying', 'spectral', 'triple', 'and', 'we', 'verify', 'these', 'assumptions', 'in', 'the', 'case', 'of', 'spectral', 'triples', 'associated', 'to', 'arbitrary', 'complete', 'riemannian', 'manifolds', 'and', 'also', 'in', 'the', 'case', 'of', 'moyal', 'planes']] | [-0.11100846572908157, 0.008555300790621586, -0.11814254269295607, 0.1420758872907272, -0.10416523378387273, -0.13609035200921885, -0.009853839931072644, 0.35928032355360595, -0.2706149840469371, -0.24432584156383233, 0.10651705982037316, -0.22510598149677985, -0.16775007304281042, 0.2401802195937384, -0.1739967508909169, 0.035641754652003206, 0.047053106558363304, 0.07517259928723236, -0.12684577879922307, -0.21600291260843535, 0.4333385001469673, 0.05135418747338545, 0.2163954184457929, 0.08364826547688838, 0.03606013677094177, 0.061164659697629783, -0.06371712376060615, -0.03225849716133769, -0.1678686246264681, 0.1614066575463098, 0.2753643773731787, 0.06426920485682786, 0.19829495445858822, -0.36197894727474594, -0.17975738218281395, 0.12878424768597, 0.1076597850825862, 0.024852756113487195, 0.007875426833522057, -0.2649786419190287, 0.09256154848038252, -0.1967637595686927, -0.16115679467063262, -0.07611014972811184, 0.020520212875639862, -0.04413575805297278, -0.2413332967244717, 0.02150761202964455, 0.16091388179808405, 0.08472087662470673, -0.07085872118512775, -0.039699283825424335, -0.007012229374924068, 0.10868582185021186, -0.01659287034578801, -0.040468232840838204, 0.07238436863948423, -0.04415020120683608, -0.13993302373080907, 0.3237435589600579, -0.060469900402790974, -0.2518826317692916, 0.14307608963158655, -0.1803808229174521, -0.16527904689323203, 0.11480857527264988, 0.05992235807163349, 0.18985000470406319, -0.09434496062942388, 0.1833662795311777, -0.0432094107494207, 0.11633660371628511, 0.07466027219723685, 0.06718430223212724, 0.1250136098712234, 0.080655572700303, 0.07245423549965742, 0.16366973555371928, -0.03667505915172914, -0.1208280425754387, -0.3144373423588204, -0.20698862111038832, -0.1612825211563922, 0.1371559549616762, -0.1495552419265627, -0.18873940279752197, 0.3892424306874332, 0.1080737334216036, 0.1685585321371825, 0.01750442000801664, 0.2551547095000026, 0.13444295183668498, 0.06882905205767827, 0.01502825723994658, 0.1764917942528411, 0.2756939127800021, 0.09195272864897298, -0.15781888340428718, -0.02013858302260738, 0.1633026956535696] |
1,803.01552 | Fixed-point elimination in the Intuitionistic Propositional Calculus
(extended version) | It is a consequence of existing literature that least and greatest
fixed-points of monotone polynomials on Heyting algebras-that is, the alge-
braic models of the Intuitionistic Propositional Calculus-always exist, even
when these algebras are not complete as lattices. The reason is that these
extremal fixed-points are definable by formulas of the IPC. Consequently, the
$\mu$-calculus based on intuitionistic logic is trivial, every $\mu$-formula
being equiv- alent to a fixed-point free formula. We give in this paper an
axiomatization of least and greatest fixed-points of formulas, and an algorithm
to compute a fixed-point free formula equivalent to a given $\mu$-formula. The
axiomatization of the greatest fixed-point is simple. The axiomatization of the
least fixed- point is more complex, in particular every monotone formula
converges to its least fixed-point by Kleene's iteration in a finite number of
steps, but there is no uniform upper bound on the number of iterations. We
extract, out of the algorithm, upper bounds for such n, depending on the size
of the formula. For some formulas, we show that these upper bounds are
polynomial and optimal.
| math.LO cs.LO | it is a consequence of existing literature that least and greatest fixedpoints of monotone polynomials on heyting algebrasthat is the alge braic models of the intuitionistic propositional calculusalways exist even when these algebras are not complete as lattices the reason is that these extremal fixedpoints are definable by formulas of the ipc consequently the mucalculus based on intuitionistic logic is trivial every muformula being equiv alent to a fixedpoint free formula we give in this paper an axiomatization of least and greatest fixedpoints of formulas and an algorithm to compute a fixedpoint free formula equivalent to a given muformula the axiomatization of the greatest fixedpoint is simple the axiomatization of the least fixed point is more complex in particular every monotone formula converges to its least fixedpoint by kleenes iteration in a finite number of steps but there is no uniform upper bound on the number of iterations we extract out of the algorithm upper bounds for such n depending on the size of the formula for some formulas we show that these upper bounds are polynomial and optimal | [['it', 'is', 'a', 'consequence', 'of', 'existing', 'literature', 'that', 'least', 'and', 'greatest', 'fixedpoints', 'of', 'monotone', 'polynomials', 'on', 'heyting', 'algebrasthat', 'is', 'the', 'alge', 'braic', 'models', 'of', 'the', 'intuitionistic', 'propositional', 'calculusalways', 'exist', 'even', 'when', 'these', 'algebras', 'are', 'not', 'complete', 'as', 'lattices', 'the', 'reason', 'is', 'that', 'these', 'extremal', 'fixedpoints', 'are', 'definable', 'by', 'formulas', 'of', 'the', 'ipc', 'consequently', 'the', 'mucalculus', 'based', 'on', 'intuitionistic', 'logic', 'is', 'trivial', 'every', 'muformula', 'being', 'equiv', 'alent', 'to', 'a', 'fixedpoint', 'free', 'formula', 'we', 'give', 'in', 'this', 'paper', 'an', 'axiomatization', 'of', 'least', 'and', 'greatest', 'fixedpoints', 'of', 'formulas', 'and', 'an', 'algorithm', 'to', 'compute', 'a', 'fixedpoint', 'free', 'formula', 'equivalent', 'to', 'a', 'given', 'muformula', 'the', 'axiomatization', 'of', 'the', 'greatest', 'fixedpoint', 'is', 'simple', 'the', 'axiomatization', 'of', 'the', 'least', 'fixed', 'point', 'is', 'more', 'complex', 'in', 'particular', 'every', 'monotone', 'formula', 'converges', 'to', 'its', 'least', 'fixedpoint', 'by', 'kleenes', 'iteration', 'in', 'a', 'finite', 'number', 'of', 'steps', 'but', 'there', 'is', 'no', 'uniform', 'upper', 'bound', 'on', 'the', 'number', 'of', 'iterations', 'we', 'extract', 'out', 'of', 'the', 'algorithm', 'upper', 'bounds', 'for', 'such', 'n', 'depending', 'on', 'the', 'size', 'of', 'the', 'formula', 'for', 'some', 'formulas', 'we', 'show', 'that', 'these', 'upper', 'bounds', 'are', 'polynomial', 'and', 'optimal']] | [-0.13652775619286875, 0.08528021220949815, -0.10288577997796554, 0.10154511289221187, -0.112150674049169, -0.163636147896996, 0.07401037105887939, 0.3322391361734793, -0.2653801601885234, -0.24528659270197617, 0.13472109348223793, -0.28542803587013127, -0.1251764718586537, 0.22083570623617765, -0.10875682365078555, 0.03494956381165154, 0.0025276407457383004, 0.12952592128119564, -0.08453067535229322, -0.28739580099528794, 0.2915893220040147, -0.03847670781368253, 0.17766735390865238, 0.07902899043276737, 0.1231859313542948, -0.020382866989505494, 0.009159109561761978, 0.02980287413712654, -0.15970778750648854, 0.12948353996626655, 0.28653934011380944, 0.19791079180494034, 0.2984928470946806, -0.388044366432488, -0.06615404906093358, 0.18841864862400343, 0.13374356770530174, 0.07629872216595768, 0.030299640992918778, -0.18674921748059997, 0.13471600569332134, -0.15133261212310886, -0.10904121416815593, -0.07980198446282391, 0.0702060465148445, 0.029618165218981647, -0.24143658099317197, -0.02007655528147763, 0.1883839002743332, 0.10926055065359483, -0.030567190885454374, -0.14858437451602374, -0.02044782105380785, 0.04298929154749902, 0.010628266206095364, 0.018334203999552687, 0.05964764642416063, -0.10641726138633228, -0.16024995641519793, 0.324672060434596, -0.04474968938051728, -0.1967601917978734, 0.12195617456704715, -0.12154190634945565, -0.1545985179248208, 0.1357038357692355, 0.054409301889919555, 0.17352542898678194, -0.08602505774767662, 0.18085069645927576, -0.15613519776570425, 0.166036199929757, 0.1321404918233764, 0.04361412706416584, 0.11562494811533534, 0.11328496728456641, 0.13539116911453294, 0.1517131959935282, 0.038682444457827654, -0.10007296669123283, -0.3694732684778881, -0.16389520170520938, -0.16599508739565894, 0.03280379435315197, -0.15892523140771483, -0.24155018787625862, 0.3230701291007595, 0.15078798717803368, 0.14423064194556515, 0.16587536351092286, 0.28692030958242, 0.21749883860883718, 0.04700349294185891, 0.09831480860136618, 0.15620774360939907, 0.17070675739429175, -0.0264541622952395, -0.15246481392078765, 0.09281952833851516, 0.19475002184452353] |
1,803.01553 | Low-Energy Excitations in Quantum Spin-Liquids Identified by Optical
Spectroscopy | The electrodynamic response of organic spin liquids with highly-frustrated
triangular lattices has been measured in a wide energy range. While the overall
optical spectra of these Mott insulators are governed by transitions between
the Hubbard bands, distinct in-gap excitations can be identified at low
temperatures and frequencies which we attribute to the quantum spin liquid
state. For the strongly correlated
$\beta^{\prime}$-EtMe$_3$\-Sb\-[Pd(dmit)$_2$]$_2$, we discover enhanced
conductivity below $175~{\rm cm}^{-1}$, comparable to the energy of the
magnetic coupling $J\approx 250$ K. For $\omega\rightarrow 0$ these
low-frequency excitations vanish faster than the charge-carrier response
subject to Mott-Hubbard correlations, resulting in a dome-shape band peaked at
100~\cm. Possible relations to spinons, magnons and disorder are discussed.
| cond-mat.str-el | the electrodynamic response of organic spin liquids with highlyfrustrated triangular lattices has been measured in a wide energy range while the overall optical spectra of these mott insulators are governed by transitions between the hubbard bands distinct ingap excitations can be identified at low temperatures and frequencies which we attribute to the quantum spin liquid state for the strongly correlated betaprimeetme_3sbpddmit_2_2 we discover enhanced conductivity below 175rm cm1 comparable to the energy of the magnetic coupling japprox 250 k for omegarightarrow 0 these lowfrequency excitations vanish faster than the chargecarrier response subject to motthubbard correlations resulting in a domeshape band peaked at 100cm possible relations to spinons magnons and disorder are discussed | [['the', 'electrodynamic', 'response', 'of', 'organic', 'spin', 'liquids', 'with', 'highlyfrustrated', 'triangular', 'lattices', 'has', 'been', 'measured', 'in', 'a', 'wide', 'energy', 'range', 'while', 'the', 'overall', 'optical', 'spectra', 'of', 'these', 'mott', 'insulators', 'are', 'governed', 'by', 'transitions', 'between', 'the', 'hubbard', 'bands', 'distinct', 'ingap', 'excitations', 'can', 'be', 'identified', 'at', 'low', 'temperatures', 'and', 'frequencies', 'which', 'we', 'attribute', 'to', 'the', 'quantum', 'spin', 'liquid', 'state', 'for', 'the', 'strongly', 'correlated', 'betaprimeetme_3sbpddmit_2_2', 'we', 'discover', 'enhanced', 'conductivity', 'below', '175rm', 'cm1', 'comparable', 'to', 'the', 'energy', 'of', 'the', 'magnetic', 'coupling', 'japprox', '250', 'k', 'for', 'omegarightarrow', '0', 'these', 'lowfrequency', 'excitations', 'vanish', 'faster', 'than', 'the', 'chargecarrier', 'response', 'subject', 'to', 'motthubbard', 'correlations', 'resulting', 'in', 'a', 'domeshape', 'band', 'peaked', 'at', '100cm', 'possible', 'relations', 'to', 'spinons', 'magnons', 'and', 'disorder', 'are', 'discussed']] | [-0.16192019245066092, 0.29687555720538344, -0.0004882076007544721, 0.06305546268960674, -0.023817571779337087, -0.18379147132055476, 0.06467568804723543, 0.4107324514503873, -0.24771753214128794, -0.2820763171505217, -0.003487530768925854, -0.3735963704081577, -0.057838884929895674, 0.16374269132117886, 0.0890956379456121, -0.002986081143191785, -0.07672820683705424, -0.042975819488632744, -0.10353632675058747, -0.15923244101764344, 0.23120956326228218, 0.02276286433147557, 0.29649515620031214, 0.11756114997909567, 0.02873947729630003, -0.02714108490308217, 0.1437066385881343, 0.0006098102590222971, -0.1650539550485961, 0.031033677108790896, 0.3479446294726035, -0.1657395359030455, 0.15320080162000355, -0.39787672771089666, -0.21121668015871572, 0.03592403905483287, 0.1602956384597688, 0.11550647234907288, 0.019424668342353554, -0.2933598304628779, 0.02370321924943443, -0.15854459652813888, -0.1088020888054658, -0.11369687596169395, 0.01634713673724904, -0.00216828061106461, -0.212125443682553, 0.1597355231044626, 0.046198851140557766, 0.10092923058829176, -0.11760164288282736, -0.17778793826630904, -0.1082355966876953, 0.05174518293709657, 0.039144986236485046, 0.03371932952976658, 0.15064367959104957, -0.14600790300568856, -0.1129124154071879, 0.3538031813714209, -0.0721081568665403, -0.05980552032316497, 0.22955209110252595, -0.20571529577751088, -0.04475373344991459, 0.2469142214779597, 0.11384621336564867, 0.06739582964582283, -0.11327391656098562, 0.0421666073339987, 0.011260205486772257, 0.1947209215680257, 0.022330986605017283, 0.18359554650856358, 0.30679456723871035, 0.15384993185353285, 0.021419707779695683, 0.1288479641656639, -0.1252683092105211, -0.04604248387296898, -0.19814794792562995, -0.10154454127688883, -0.2473555836194289, 0.06255011442929097, -0.028129731336717468, -0.14758585781337472, 0.43363723537346366, 0.1422212446864626, 0.14901352389245678, -0.012474436004253088, 0.17413035064611002, 0.1764998770481266, 0.08653576594324561, 0.0682865743025488, 0.27498210744650337, 0.15779520475536313, 0.09766150679259877, -0.3034649326406214, -0.01149447003583458, -0.007033044483017074] |
1,803.01554 | Attenuation of the NMR signal due to hydrodynamic Brownian motion | Nuclear magnetic resonance (NMR) is a widely used nondestructive method to
study random motion of spin-bearing particles in different systems. In the
long-time limit the theoretical description of the NMR experiments is well
developed and allows proper interpretation of measurements of normal and
anomalous diffusion. The traditional description becomes, however, insufficient
for the shorter-time dynamics of the particles. In the present paper, the
all-time attenuation function of the NMR signal in a magnetic-field gradient
due to the Brownian motion (BM) of particles in incompressible liquids is
calculated by using the method of accumulation of phases by a precessing
magnetic moment, without reference to a concrete model of the stochastic
dynamics. The obtained expressions are then used to evaluate the attenuation
within the hydrodynamic theory of the BM. It is shown that the well-known time
behavior of the formulas corresponding to the Einstein theory of diffusion in
the case of steady gradient and Hahn's echo experiments is reached at times
much larger than the characteristic time of the loss of memory in the particle
dynamics. At shorter times the attenuation function significantly differs from
the classical formulas used to interpret these experiments.
| cond-mat.stat-mech | nuclear magnetic resonance nmr is a widely used nondestructive method to study random motion of spinbearing particles in different systems in the longtime limit the theoretical description of the nmr experiments is well developed and allows proper interpretation of measurements of normal and anomalous diffusion the traditional description becomes however insufficient for the shortertime dynamics of the particles in the present paper the alltime attenuation function of the nmr signal in a magneticfield gradient due to the brownian motion bm of particles in incompressible liquids is calculated by using the method of accumulation of phases by a precessing magnetic moment without reference to a concrete model of the stochastic dynamics the obtained expressions are then used to evaluate the attenuation within the hydrodynamic theory of the bm it is shown that the wellknown time behavior of the formulas corresponding to the einstein theory of diffusion in the case of steady gradient and hahns echo experiments is reached at times much larger than the characteristic time of the loss of memory in the particle dynamics at shorter times the attenuation function significantly differs from the classical formulas used to interpret these experiments | [['nuclear', 'magnetic', 'resonance', 'nmr', 'is', 'a', 'widely', 'used', 'nondestructive', 'method', 'to', 'study', 'random', 'motion', 'of', 'spinbearing', 'particles', 'in', 'different', 'systems', 'in', 'the', 'longtime', 'limit', 'the', 'theoretical', 'description', 'of', 'the', 'nmr', 'experiments', 'is', 'well', 'developed', 'and', 'allows', 'proper', 'interpretation', 'of', 'measurements', 'of', 'normal', 'and', 'anomalous', 'diffusion', 'the', 'traditional', 'description', 'becomes', 'however', 'insufficient', 'for', 'the', 'shortertime', 'dynamics', 'of', 'the', 'particles', 'in', 'the', 'present', 'paper', 'the', 'alltime', 'attenuation', 'function', 'of', 'the', 'nmr', 'signal', 'in', 'a', 'magneticfield', 'gradient', 'due', 'to', 'the', 'brownian', 'motion', 'bm', 'of', 'particles', 'in', 'incompressible', 'liquids', 'is', 'calculated', 'by', 'using', 'the', 'method', 'of', 'accumulation', 'of', 'phases', 'by', 'a', 'precessing', 'magnetic', 'moment', 'without', 'reference', 'to', 'a', 'concrete', 'model', 'of', 'the', 'stochastic', 'dynamics', 'the', 'obtained', 'expressions', 'are', 'then', 'used', 'to', 'evaluate', 'the', 'attenuation', 'within', 'the', 'hydrodynamic', 'theory', 'of', 'the', 'bm', 'it', 'is', 'shown', 'that', 'the', 'wellknown', 'time', 'behavior', 'of', 'the', 'formulas', 'corresponding', 'to', 'the', 'einstein', 'theory', 'of', 'diffusion', 'in', 'the', 'case', 'of', 'steady', 'gradient', 'and', 'hahns', 'echo', 'experiments', 'is', 'reached', 'at', 'times', 'much', 'larger', 'than', 'the', 'characteristic', 'time', 'of', 'the', 'loss', 'of', 'memory', 'in', 'the', 'particle', 'dynamics', 'at', 'shorter', 'times', 'the', 'attenuation', 'function', 'significantly', 'differs', 'from', 'the', 'classical', 'formulas', 'used', 'to', 'interpret', 'these', 'experiments']] | [-0.08520105128164256, 0.14438912283911026, -0.10771906318535146, 0.059501681842620634, -0.01845837698906268, -0.0758042219241983, -0.003836289607294786, 0.33180535917513465, -0.2671368205919862, -0.2861158055424886, 0.06794572828558126, -0.2580280466361345, -0.11024021886068543, 0.22168008110571752, -0.006100021766370015, 0.07840185485547409, 0.02016992054904174, 0.060641897127865566, -0.07681000612210483, -0.17031746721630425, 0.23830377585315882, 0.06534751338124471, 0.2929208701623506, 0.027873923009457558, 0.11248824627285725, 0.006113187257984752, -0.014731632124044393, 0.023051115848418128, -0.13043454952532652, 0.0889840901314624, 0.1968887067595987, 0.057513555631923834, 0.21060798833587843, -0.46734075245300405, -0.21812103190704396, 0.08883434363003624, 0.1457353634562184, 0.1456606182318769, -0.022263621700633514, -0.27089448362270274, 0.04775933443299053, -0.12712558036498528, -0.14732802356103142, -0.06409680155399991, 0.04882600378294132, 0.03999123673726755, -0.2613446952382985, 0.14361881976334476, 0.07110437378961298, 0.05925534714233915, -0.09400982320780474, -0.10004780295942174, 0.03355370393439539, 0.09882521407041503, 0.07792384018570087, 0.039655950852963875, 0.17117742897351396, -0.14302494014750425, -0.12081841077949655, 0.399615422839691, -0.1127453666600846, -0.1903825292069661, 0.19536906613135024, -0.19786279990566025, -0.05482194560310362, 0.16846262436164053, 0.15761628567094083, 0.14565363940782844, -0.1598265106495666, 0.04729146948237413, -0.004631689355071438, 0.13823874824999, 0.018258797556259913, -0.0008196200023552304, 0.16077183792367578, 0.17548542608519233, 0.01222343890878715, 0.143364631938503, -0.13162338739800217, -0.12981383243183556, -0.26835100616659285, -0.15996095510199665, -0.20210780553813829, 0.05127423324462908, -0.0918083977197009, -0.14590348392391062, 0.3923057481401453, 0.17736534106967922, 0.18243536818282385, 0.03961373515745723, 0.31089098855951114, 0.14147293861207896, 0.05788883215404655, 0.03965146854078691, 0.25350494758765163, 0.17722263474409516, 0.1323690174564131, -0.2780390095627426, 0.08829493105019394, 0.05785225564284605] |
1,803.01555 | Beyond Context: Exploring Semantic Similarity for Tiny Face Detection | Tiny face detection aims to find faces with high degrees of variability in
scale, resolution and occlusion in cluttered scenes. Due to the very little
information available on tiny faces, it is not sufficient to detect them merely
based on the information presented inside the tiny bounding boxes or their
context. In this paper, we propose to exploit the semantic similarity among all
predicted targets in each image to boost current face detectors. To this end,
we present a novel framework to model semantic similarity as pairwise
constraints within the metric learning scheme, and then refine our predictions
with the semantic similarity by utilizing the graph cut techniques. Experiments
conducted on three widely-used benchmark datasets have demonstrated the
improvement over the-state-of-the-arts gained by applying this idea.
| cs.CV | tiny face detection aims to find faces with high degrees of variability in scale resolution and occlusion in cluttered scenes due to the very little information available on tiny faces it is not sufficient to detect them merely based on the information presented inside the tiny bounding boxes or their context in this paper we propose to exploit the semantic similarity among all predicted targets in each image to boost current face detectors to this end we present a novel framework to model semantic similarity as pairwise constraints within the metric learning scheme and then refine our predictions with the semantic similarity by utilizing the graph cut techniques experiments conducted on three widelyused benchmark datasets have demonstrated the improvement over thestateofthearts gained by applying this idea | [['tiny', 'face', 'detection', 'aims', 'to', 'find', 'faces', 'with', 'high', 'degrees', 'of', 'variability', 'in', 'scale', 'resolution', 'and', 'occlusion', 'in', 'cluttered', 'scenes', 'due', 'to', 'the', 'very', 'little', 'information', 'available', 'on', 'tiny', 'faces', 'it', 'is', 'not', 'sufficient', 'to', 'detect', 'them', 'merely', 'based', 'on', 'the', 'information', 'presented', 'inside', 'the', 'tiny', 'bounding', 'boxes', 'or', 'their', 'context', 'in', 'this', 'paper', 'we', 'propose', 'to', 'exploit', 'the', 'semantic', 'similarity', 'among', 'all', 'predicted', 'targets', 'in', 'each', 'image', 'to', 'boost', 'current', 'face', 'detectors', 'to', 'this', 'end', 'we', 'present', 'a', 'novel', 'framework', 'to', 'model', 'semantic', 'similarity', 'as', 'pairwise', 'constraints', 'within', 'the', 'metric', 'learning', 'scheme', 'and', 'then', 'refine', 'our', 'predictions', 'with', 'the', 'semantic', 'similarity', 'by', 'utilizing', 'the', 'graph', 'cut', 'techniques', 'experiments', 'conducted', 'on', 'three', 'widelyused', 'benchmark', 'datasets', 'have', 'demonstrated', 'the', 'improvement', 'over', 'thestateofthearts', 'gained', 'by', 'applying', 'this', 'idea']] | [-0.04327684832387604, -0.00471930274181068, -0.04709209989197552, 0.05670090185292065, -0.11686430894583463, -0.1320395693462342, 0.06059677063953131, 0.4457586405649781, -0.24995941454917192, -0.399784509383142, 0.07176358800753951, -0.29982623967528343, -0.15402168896235527, 0.12947297279164194, -0.1618676006849855, 0.07540876712370664, 0.11623873995244503, 0.05136129455640912, -0.0759215818271041, -0.2705914365064818, 0.3244562216177583, 0.05910227718949318, 0.31694853625074026, 0.09336398123204707, 0.1666380538456142, -0.03361507579870522, -0.08908081926219165, 0.03580227197147906, -0.0785154128447175, 0.19169874763302505, 0.29284155124425887, 0.1876713674105704, 0.2593220423348248, -0.4237082782462239, -0.20412065805494786, 0.09825376925989986, 0.10799551015347242, 0.09100443568185437, -0.06457530286815018, -0.37169023747742175, 0.11915050832275301, -0.1508759757298976, -0.0002094086855649948, -0.12127996201068163, -0.01334669402241707, -0.05002255344390869, -0.22084895308688282, 0.023214734530076383, 0.042401400629431006, 0.053048555985093115, -0.00822857160307467, -0.08423385339044034, 0.05088479587621987, 0.15775184878520668, 0.052441288020461795, 0.043261886036023496, 0.11672424674779176, -0.17182486551441253, -0.12211481265723706, 0.40672369685769083, -0.06428352681919933, -0.23887985761277378, 0.2305604240465909, -0.09937380548194051, -0.13684467625245453, 0.10642570988833905, 0.21962984277307987, 0.13576379113271833, -0.1728252887390554, -0.0013907534526661038, -0.03760451896395534, 0.18927993749454616, 0.07433577443659306, 0.01868649773672223, 0.22566264755278825, 0.22087379728257656, 0.05603724770434201, 0.14090054722037165, -0.17434049706929364, -0.0416127243489027, -0.21817851048707962, -0.0733964697048068, -0.18863647387269886, -0.06283559325139504, -0.10292559326416813, -0.12225953048467636, 0.38278760632043124, 0.263996778646484, 0.2558725202474743, 0.06253983778506518, 0.3642252600230277, -0.012059116503689437, 0.14637396810017525, 0.06098614203929901, 0.21364632866624741, 0.023107107136398554, 0.10136766784545034, -0.15003579397732392, 0.06670075912587345, 0.06439059890434146] |
1,803.01556 | Inclusion of machine learning kernel ridge regression potential energy
surfaces in on-the-fly nonadiabatic molecular dynamics simulation | We discuss a theoretical approach that employs machine learning potential
energy surfaces (ML-PESs) in the nonadiabatic dynamics simulation of polyatomic
systems by taking 6-aminopyrimidine as a typical example. The Zhu-Nakamura
theory is employed in the surface hopping dynamics, which does not require the
calculation of the nonadiabatic coupling vectors. The kernel ridge regression
is used in the construction of the adiabatic PESs. In the nonadiabatic dynamics
simulation, we use ML-PESs for most geometries and switch back to the
electronic structure calculations for a few geometries either near the S1/S0
conical intersections or in the out-of-confidence regions. The dynamics results
based on ML-PESs are consistent with those based on CASSCF PESs. The ML-PESs
are further used to achieve the highly efficient massive dynamics simulations
with a large number of trajectories. This work displays the powerful role of ML
methods in the nonadiabatic dynamics simulation of polyatomic systems.
| physics.chem-ph | we discuss a theoretical approach that employs machine learning potential energy surfaces mlpess in the nonadiabatic dynamics simulation of polyatomic systems by taking 6aminopyrimidine as a typical example the zhunakamura theory is employed in the surface hopping dynamics which does not require the calculation of the nonadiabatic coupling vectors the kernel ridge regression is used in the construction of the adiabatic pess in the nonadiabatic dynamics simulation we use mlpess for most geometries and switch back to the electronic structure calculations for a few geometries either near the s1s0 conical intersections or in the outofconfidence regions the dynamics results based on mlpess are consistent with those based on casscf pess the mlpess are further used to achieve the highly efficient massive dynamics simulations with a large number of trajectories this work displays the powerful role of ml methods in the nonadiabatic dynamics simulation of polyatomic systems | [['we', 'discuss', 'a', 'theoretical', 'approach', 'that', 'employs', 'machine', 'learning', 'potential', 'energy', 'surfaces', 'mlpess', 'in', 'the', 'nonadiabatic', 'dynamics', 'simulation', 'of', 'polyatomic', 'systems', 'by', 'taking', '6aminopyrimidine', 'as', 'a', 'typical', 'example', 'the', 'zhunakamura', 'theory', 'is', 'employed', 'in', 'the', 'surface', 'hopping', 'dynamics', 'which', 'does', 'not', 'require', 'the', 'calculation', 'of', 'the', 'nonadiabatic', 'coupling', 'vectors', 'the', 'kernel', 'ridge', 'regression', 'is', 'used', 'in', 'the', 'construction', 'of', 'the', 'adiabatic', 'pess', 'in', 'the', 'nonadiabatic', 'dynamics', 'simulation', 'we', 'use', 'mlpess', 'for', 'most', 'geometries', 'and', 'switch', 'back', 'to', 'the', 'electronic', 'structure', 'calculations', 'for', 'a', 'few', 'geometries', 'either', 'near', 'the', 's1s0', 'conical', 'intersections', 'or', 'in', 'the', 'outofconfidence', 'regions', 'the', 'dynamics', 'results', 'based', 'on', 'mlpess', 'are', 'consistent', 'with', 'those', 'based', 'on', 'casscf', 'pess', 'the', 'mlpess', 'are', 'further', 'used', 'to', 'achieve', 'the', 'highly', 'efficient', 'massive', 'dynamics', 'simulations', 'with', 'a', 'large', 'number', 'of', 'trajectories', 'this', 'work', 'displays', 'the', 'powerful', 'role', 'of', 'ml', 'methods', 'in', 'the', 'nonadiabatic', 'dynamics', 'simulation', 'of', 'polyatomic', 'systems']] | [-0.12324486306574221, 0.07911325446265335, -0.11457101359378107, 0.0683808908951404, -0.005563629694532008, -0.12706571400606967, 0.014794799964066543, 0.37315237655356115, -0.22865420875556688, -0.2608020721430269, 0.05321233557414315, -0.24608188861748204, -0.16317130222483278, 0.23837449869865346, 0.005581638607610431, 0.07267546536442954, 0.07791078934032056, -0.016738162620135374, -0.07117381973108018, -0.1824174951357741, 0.2889350787380762, 0.09632290371033984, 0.27474273332174765, 0.03359153151460406, 0.045510407223547295, 0.011759657223592512, 0.03415736936343213, -0.016943940750530198, -0.1254074084744793, 0.13913479224558817, 0.2400333722341909, 0.046652825229102746, 0.26366107736733585, -0.4851029582787305, -0.25082938621502154, 0.05180770130310622, 0.13462506719062933, 0.16194962737548244, -0.05557123385531466, -0.227319795702998, -0.005959187156501382, -0.14822347735753283, -0.13295003150253454, -0.13680459233000875, -0.03347197231293345, 0.044964330471379474, -0.2255082700095146, 0.07307641297908656, 0.0055958313104282655, 0.047314571001202746, -0.05117397620860073, -0.10002187007921748, -0.046199172266319186, 0.08801793081592121, -0.00865260307586545, 0.01582154863798577, 0.16801478409777498, -0.11157478559471201, -0.13144791602260536, 0.40289408354955314, -0.07772838167147711, -0.22341531578503135, 0.24464961587929995, -0.10472291166661307, -0.13464306221188357, 0.1563674025884312, 0.17856270439774058, 0.16316674167885342, -0.11083706687633013, 0.08166440961576882, 0.026483865011768002, 0.11760869053735708, -0.013413401559874829, 0.0032420222155956756, 0.18428351880154675, 0.18371165520511568, -0.0013089241822146708, 0.09819892580950788, -0.12531429585619158, -0.18693635826801053, -0.2713825990536457, -0.11526702071670217, -0.18594943744715742, 0.026549622376175346, -0.06447853341594761, -0.17745099714698476, 0.3910492951076271, 0.13895518629578874, 0.17955732033199942, 0.01035141328611644, 0.30034181537727517, 0.0818606448325833, 0.07422391871417251, 0.1034564066552169, 0.2459528132328867, 0.13763063090704641, 0.05718811884030907, -0.27154204786832753, 0.05081179862706146, 0.05637197130191554] |
1,803.01557 | Automatic Translating between Ancient Chinese and Contemporary Chinese
with Limited Aligned Corpora | The Chinese language has evolved a lot during the long-term development.
Therefore, native speakers now have trouble in reading sentences written in
ancient Chinese. In this paper, we propose to build an end-to-end neural model
to automatically translate between ancient and contemporary Chinese. However,
the existing ancient-contemporary Chinese parallel corpora are not aligned at
the sentence level and sentence-aligned corpora are limited, which makes it
difficult to train the model. To build the sentence level parallel training
data for the model, we propose an unsupervised algorithm that constructs
sentence-aligned ancient-contemporary pairs by using the fact that the aligned
sentence pair shares many of the tokens. Based on the aligned corpus, we
propose an end-to-end neural model with copying mechanism and local attention
to translate between ancient and contemporary Chinese. Experiments show that
the proposed unsupervised algorithm achieves 99.4% F1 score for sentence
alignment, and the translation model achieves 26.95 BLEU from ancient to
contemporary, and 36.34 BLEU from contemporary to ancient.
| cs.CL | the chinese language has evolved a lot during the longterm development therefore native speakers now have trouble in reading sentences written in ancient chinese in this paper we propose to build an endtoend neural model to automatically translate between ancient and contemporary chinese however the existing ancientcontemporary chinese parallel corpora are not aligned at the sentence level and sentencealigned corpora are limited which makes it difficult to train the model to build the sentence level parallel training data for the model we propose an unsupervised algorithm that constructs sentencealigned ancientcontemporary pairs by using the fact that the aligned sentence pair shares many of the tokens based on the aligned corpus we propose an endtoend neural model with copying mechanism and local attention to translate between ancient and contemporary chinese experiments show that the proposed unsupervised algorithm achieves 994 f1 score for sentence alignment and the translation model achieves 2695 bleu from ancient to contemporary and 3634 bleu from contemporary to ancient | [['the', 'chinese', 'language', 'has', 'evolved', 'a', 'lot', 'during', 'the', 'longterm', 'development', 'therefore', 'native', 'speakers', 'now', 'have', 'trouble', 'in', 'reading', 'sentences', 'written', 'in', 'ancient', 'chinese', 'in', 'this', 'paper', 'we', 'propose', 'to', 'build', 'an', 'endtoend', 'neural', 'model', 'to', 'automatically', 'translate', 'between', 'ancient', 'and', 'contemporary', 'chinese', 'however', 'the', 'existing', 'ancientcontemporary', 'chinese', 'parallel', 'corpora', 'are', 'not', 'aligned', 'at', 'the', 'sentence', 'level', 'and', 'sentencealigned', 'corpora', 'are', 'limited', 'which', 'makes', 'it', 'difficult', 'to', 'train', 'the', 'model', 'to', 'build', 'the', 'sentence', 'level', 'parallel', 'training', 'data', 'for', 'the', 'model', 'we', 'propose', 'an', 'unsupervised', 'algorithm', 'that', 'constructs', 'sentencealigned', 'ancientcontemporary', 'pairs', 'by', 'using', 'the', 'fact', 'that', 'the', 'aligned', 'sentence', 'pair', 'shares', 'many', 'of', 'the', 'tokens', 'based', 'on', 'the', 'aligned', 'corpus', 'we', 'propose', 'an', 'endtoend', 'neural', 'model', 'with', 'copying', 'mechanism', 'and', 'local', 'attention', 'to', 'translate', 'between', 'ancient', 'and', 'contemporary', 'chinese', 'experiments', 'show', 'that', 'the', 'proposed', 'unsupervised', 'algorithm', 'achieves', '994', 'f1', 'score', 'for', 'sentence', 'alignment', 'and', 'the', 'translation', 'model', 'achieves', '2695', 'bleu', 'from', 'ancient', 'to', 'contemporary', 'and', '3634', 'bleu', 'from', 'contemporary', 'to', 'ancient']] | [-0.02790197843697461, 0.009823540359887048, -0.06285729074452377, 0.12539624094409552, -0.17481822212542988, -0.12871959601944816, 0.04251545016161816, 0.47105245458536177, -0.29088452170784557, -0.359633230457797, 0.014554498435302678, -0.3014493049122393, -0.12366014686208102, 0.20543047278949628, -0.131584565137636, -0.0018928212306971819, 0.16300414810425737, 0.0841137221223622, -0.020771319150584954, -0.3162145808151683, 0.26814243470541194, 0.05155626864834401, 0.4052293821935009, -0.028440202482384425, 0.17299982982778442, -0.09245891027290186, -0.012283776359597468, -0.11893415244943432, -0.019864358273640484, 0.2138531327206618, 0.3398363224257065, 0.22993979498498002, 0.3083032586922248, -0.42392112653257336, -0.12424623735729347, 0.07497616082798901, 0.127932232508799, 0.13232582175896251, -0.013336694189464475, -0.3437017982052463, 0.10946770235544669, -0.1571336253868334, 0.0814336708442267, -0.10086414338830484, 0.019800028602999734, -0.03572093299956137, -0.21229489232228962, 0.046640030478871185, 0.1490969836547877, 0.10232690305144485, -0.0400122661764423, -0.14824484490186163, 0.01630862010203583, 0.19287724980979032, 0.08920740274018345, 0.14946001017379792, 0.06971367162142722, -0.13217333848471022, -0.17565599015369168, 0.3774745271265882, -0.10825838967894186, -0.20971670179809415, 0.17710762823721007, -0.021329879798449036, -0.15499771867275425, 0.05270560584821791, 0.22684038534384138, 0.051905767016519895, -0.19630546182534606, -0.0043016715090921, -0.06951054100404089, 0.24811743990278, 0.12617912804034287, -0.0639609964242287, 0.251203843214514, 0.2701294396260062, -0.07122588804783886, 0.14513059593034242, -0.10759911137199579, -0.08765096814690507, -0.16740230501354117, -0.11141700012047055, -0.15966320481830798, -0.022845105072113674, -0.03227038764626918, -0.17012150200821882, 0.36768701868922504, 0.24969635020836062, 0.13463955966509739, 0.14694380564044035, 0.30357132542954535, -0.047517481054993545, 0.13395349987114066, 0.14343759025968378, 0.15511701685089455, -0.07374115945308604, 0.16535505229598438, -0.12119298167936739, 0.12223767254094493, 0.06811731228452621] |
1,803.01558 | Signatures of the self-modulation instability of relativistic proton
bunches in the AWAKE experiment | We investigate numerically the detection of the self-modulation instability
in a virtual detector located downstream from the plasma in the context of
AWAKE. We show that the density structures, appearing in the temporally
resolving virtual detector, map the transverse beam phase space distribution at
the plasma exit. As a result, the proton bunch radius that appears to grow
along the bunch in the detector results from the divergence increase along the
bunch, related with the spatial growth of the self-modulated wakefields. In
addition, asymmetric bunch structures in the detector are a result of
asymmetries of the bunch divergence, and do not necessarily reflect asymmetric
beam density distributions in the plasma.
| physics.plasm-ph physics.acc-ph | we investigate numerically the detection of the selfmodulation instability in a virtual detector located downstream from the plasma in the context of awake we show that the density structures appearing in the temporally resolving virtual detector map the transverse beam phase space distribution at the plasma exit as a result the proton bunch radius that appears to grow along the bunch in the detector results from the divergence increase along the bunch related with the spatial growth of the selfmodulated wakefields in addition asymmetric bunch structures in the detector are a result of asymmetries of the bunch divergence and do not necessarily reflect asymmetric beam density distributions in the plasma | [['we', 'investigate', 'numerically', 'the', 'detection', 'of', 'the', 'selfmodulation', 'instability', 'in', 'a', 'virtual', 'detector', 'located', 'downstream', 'from', 'the', 'plasma', 'in', 'the', 'context', 'of', 'awake', 'we', 'show', 'that', 'the', 'density', 'structures', 'appearing', 'in', 'the', 'temporally', 'resolving', 'virtual', 'detector', 'map', 'the', 'transverse', 'beam', 'phase', 'space', 'distribution', 'at', 'the', 'plasma', 'exit', 'as', 'a', 'result', 'the', 'proton', 'bunch', 'radius', 'that', 'appears', 'to', 'grow', 'along', 'the', 'bunch', 'in', 'the', 'detector', 'results', 'from', 'the', 'divergence', 'increase', 'along', 'the', 'bunch', 'related', 'with', 'the', 'spatial', 'growth', 'of', 'the', 'selfmodulated', 'wakefields', 'in', 'addition', 'asymmetric', 'bunch', 'structures', 'in', 'the', 'detector', 'are', 'a', 'result', 'of', 'asymmetries', 'of', 'the', 'bunch', 'divergence', 'and', 'do', 'not', 'necessarily', 'reflect', 'asymmetric', 'beam', 'density', 'distributions', 'in', 'the', 'plasma']] | [-0.1168187016166154, 0.21965130637399852, -0.11645643971860409, 0.07523815528362651, 0.03693177073516629, -0.07478418195440265, -0.07755203827876936, 0.4073386458129707, -0.245595361166422, -0.28790679539299824, 0.038484860691030257, -0.28778221794319425, -0.007503429546274922, 0.16247984854271635, -0.016441175794567574, 0.06025709930267608, 0.0682348059664946, 0.023978861641477455, -0.05152484379624101, -0.12143884612543678, 0.31110827626491133, 0.14075294828719714, 0.32553890957073733, 0.07797789864072746, 0.09611918445337903, 0.0049750415523621165, -0.018175518089397387, -0.0048206451393939045, -0.11633923765435941, 0.051987572987987236, 0.2002575567457825, 0.09182879607224921, 0.21727336226560345, -0.46652733815664593, -0.1980222893455489, 0.042799497399987146, 0.1837903719945726, 0.10590760589111596, -0.06913517515005713, -0.2565253909306855, 0.0380454711700705, -0.17725654072551564, -0.1897231883411719, 0.08091815785883227, -0.036146894706921145, 0.09182757318961773, -0.24135997460477732, 0.06521540292623368, 0.05019561445171183, -0.017417036386376077, -0.01989051035012711, -0.05715713695284318, -0.01056184429590675, 0.0589007271242074, 0.07390229142355648, 0.09191031272057444, 0.1947725935161791, -0.16330318257043308, -0.06679651934907517, 0.3165532775900581, -0.031515901046805087, -0.1638765927996825, 0.13336221326819875, -0.28030967891893604, -0.027539174415340477, 0.2073578387160193, 0.22588241172277115, 0.06921655521093106, -0.08341023309833624, 0.006017447416988117, -0.011748195173938505, 0.14259174346119505, 0.18871945351446895, 0.014169960009696132, 0.21286721148274163, 0.16154540268365633, 0.08617235126968642, 0.1665780234425752, -0.18129725491797383, -0.05026522723703899, -0.37428856349804185, -0.10884928638115525, -0.1365672247018665, -0.02938903453958284, -0.030640389486507047, -0.16508972621946172, 0.4473362619014965, 0.13028678449971431, 0.21702997758561238, -0.035749913984909655, 0.2827318887818943, 0.08732431530846621, 0.08501732782884078, 0.08504872527396815, 0.2296601556876505, 0.1329418707300316, 0.1563734976659444, -0.26995985008014195, 0.045665127712047913, 0.011119403630833734] |
1,803.01559 | Prime Number Decomposition using the Talbot Effect | We report on prime number decomposition by use of the Talbot effect, a
well-known phenomenon in classical near field optics whose description is
closely related to Gauss sums. The latter are a mathematical tool from number
theory used to analyze the properties of prime numbers as well as to decompose
composite numbers into their prime factors. We employ the well-established
connection between the Talbot effect and Gauss sums to implement prime number
decompositions with a novel approach, making use of the longitudinal intensity
profile of the Talbot carpet. The new algorithm is experimentally verified and
the limits of the approach are discussed.
| physics.optics | we report on prime number decomposition by use of the talbot effect a wellknown phenomenon in classical near field optics whose description is closely related to gauss sums the latter are a mathematical tool from number theory used to analyze the properties of prime numbers as well as to decompose composite numbers into their prime factors we employ the wellestablished connection between the talbot effect and gauss sums to implement prime number decompositions with a novel approach making use of the longitudinal intensity profile of the talbot carpet the new algorithm is experimentally verified and the limits of the approach are discussed | [['we', 'report', 'on', 'prime', 'number', 'decomposition', 'by', 'use', 'of', 'the', 'talbot', 'effect', 'a', 'wellknown', 'phenomenon', 'in', 'classical', 'near', 'field', 'optics', 'whose', 'description', 'is', 'closely', 'related', 'to', 'gauss', 'sums', 'the', 'latter', 'are', 'a', 'mathematical', 'tool', 'from', 'number', 'theory', 'used', 'to', 'analyze', 'the', 'properties', 'of', 'prime', 'numbers', 'as', 'well', 'as', 'to', 'decompose', 'composite', 'numbers', 'into', 'their', 'prime', 'factors', 'we', 'employ', 'the', 'wellestablished', 'connection', 'between', 'the', 'talbot', 'effect', 'and', 'gauss', 'sums', 'to', 'implement', 'prime', 'number', 'decompositions', 'with', 'a', 'novel', 'approach', 'making', 'use', 'of', 'the', 'longitudinal', 'intensity', 'profile', 'of', 'the', 'talbot', 'carpet', 'the', 'new', 'algorithm', 'is', 'experimentally', 'verified', 'and', 'the', 'limits', 'of', 'the', 'approach', 'are', 'discussed']] | [-0.1344451879872484, 0.09880814655665673, -0.13857007922485412, 0.10298676063151409, -0.11397387494113953, -0.0975736209474431, 0.014598916184303224, 0.33584535095438944, -0.3088242611345634, -0.3319289285835682, 0.06968688062739138, -0.23494476515471058, -0.2079705473437321, 0.26205500030853585, -0.04126488685827045, 0.06417783631888382, -0.03872628893255822, 0.049112298653698434, -0.0013981100534746313, -0.22580936779359392, 0.3042641555474998, 0.028897818880139703, 0.2888869794049099, 0.028970624393253933, 0.0746220061007668, 0.03931452796849258, -0.036662089117967034, 0.030580745626460102, -0.12967134762427532, 0.12781201000781914, 0.1907599538144674, 0.10859744141663552, 0.25153679749471886, -0.40039889744537716, -0.14519874128860003, 0.0881061554594221, 0.1423846863429336, 0.05720876171892764, -0.022876983852007007, -0.23378545951609517, 0.04629504513999849, -0.12141189823045816, -0.1720859398197967, -0.1050939744648834, 0.0072311363057416, 0.05293442040006174, -0.23029433164800353, 0.02248980249643472, 0.03341627278588895, 0.09257901789547474, 0.02712473659045702, -0.15246006785252808, 0.07138330538017566, 0.09595921162661969, 0.028010771660061152, -0.025129368903078868, 0.06608620596428712, -0.10047234175726771, -0.15181017553835524, 0.40522598534566806, -0.039214563421338944, -0.17792511320551377, 0.13771940342278458, -0.16879117349961625, -0.10294238001783836, 0.1249306118252742, 0.1732465757431426, 0.10381642177554906, -0.06757855458258122, 0.0353527511093382, -0.07129321797915242, 0.12293386777095935, 0.11972524413117665, 0.05567688861971393, 0.20955462760164165, 0.12796118909346998, 0.005181106414609388, 0.22298164583523483, -0.10776733024292351, -0.05265511228136864, -0.2953325500198202, -0.16192091503819706, -0.21296049066472286, 0.07737637446353249, -0.047707203254914, -0.176594006043731, 0.36602217106915574, 0.14462241808709508, 0.16405761239173658, 0.05755403571232569, 0.31219257839827563, 0.11725237077859905, 0.07902068976431574, 0.004905916266508547, 0.1941526183383722, 0.2629386824121991, 0.048630752824429496, -0.20373386400980034, -0.017732532562541904, 0.1356599256245068] |
1,803.0156 | The start of the Abiogenesis: Preservation of homochirality in proteins
as a necessary and sufficient condition for the establishment of the
metabolism | Biosystems contain an almost infinite amount of vital important details,
which together ensure their life. There are, however, some common structures
and reactions in the systems: the homochirality of carbohydrates and proteins,
the metabolism and the genetics. The Abiogenesis, or the origin of life, is
probably not a result of a series of single events, but rather the result of a
gradual process with increasing complexity of molecules and chemical reactions,
and the prebiotic synthesis of molecules might not have left a trace of the
establishment of structures and reactions at the beginning of the evolution.
But alternatively, one might be able to determine some order in the formation
of the chemical denominators in the Abiogenesis. Here we review experimental
results and present a model of the start of the Abionenesis, where the
spontaneous formation of homochirality in proteins is the precondition for the
establishment of homochirality of carbohydrates and for the metabolism at the
start of the Abiogenesis.
| q-bio.BM cond-mat.soft | biosystems contain an almost infinite amount of vital important details which together ensure their life there are however some common structures and reactions in the systems the homochirality of carbohydrates and proteins the metabolism and the genetics the abiogenesis or the origin of life is probably not a result of a series of single events but rather the result of a gradual process with increasing complexity of molecules and chemical reactions and the prebiotic synthesis of molecules might not have left a trace of the establishment of structures and reactions at the beginning of the evolution but alternatively one might be able to determine some order in the formation of the chemical denominators in the abiogenesis here we review experimental results and present a model of the start of the abionenesis where the spontaneous formation of homochirality in proteins is the precondition for the establishment of homochirality of carbohydrates and for the metabolism at the start of the abiogenesis | [['biosystems', 'contain', 'an', 'almost', 'infinite', 'amount', 'of', 'vital', 'important', 'details', 'which', 'together', 'ensure', 'their', 'life', 'there', 'are', 'however', 'some', 'common', 'structures', 'and', 'reactions', 'in', 'the', 'systems', 'the', 'homochirality', 'of', 'carbohydrates', 'and', 'proteins', 'the', 'metabolism', 'and', 'the', 'genetics', 'the', 'abiogenesis', 'or', 'the', 'origin', 'of', 'life', 'is', 'probably', 'not', 'a', 'result', 'of', 'a', 'series', 'of', 'single', 'events', 'but', 'rather', 'the', 'result', 'of', 'a', 'gradual', 'process', 'with', 'increasing', 'complexity', 'of', 'molecules', 'and', 'chemical', 'reactions', 'and', 'the', 'prebiotic', 'synthesis', 'of', 'molecules', 'might', 'not', 'have', 'left', 'a', 'trace', 'of', 'the', 'establishment', 'of', 'structures', 'and', 'reactions', 'at', 'the', 'beginning', 'of', 'the', 'evolution', 'but', 'alternatively', 'one', 'might', 'be', 'able', 'to', 'determine', 'some', 'order', 'in', 'the', 'formation', 'of', 'the', 'chemical', 'denominators', 'in', 'the', 'abiogenesis', 'here', 'we', 'review', 'experimental', 'results', 'and', 'present', 'a', 'model', 'of', 'the', 'start', 'of', 'the', 'abionenesis', 'where', 'the', 'spontaneous', 'formation', 'of', 'homochirality', 'in', 'proteins', 'is', 'the', 'precondition', 'for', 'the', 'establishment', 'of', 'homochirality', 'of', 'carbohydrates', 'and', 'for', 'the', 'metabolism', 'at', 'the', 'start', 'of', 'the', 'abiogenesis']] | [-0.11410306457760214, 0.15152775713095598, -0.0644007208823415, 0.06090463285046916, 0.0011366561815567033, -0.05543052643954553, 0.07940467977690027, 0.3122362921698184, -0.2655168730128981, -0.2820151116038802, 0.11483491027633412, -0.24141416815404274, -0.15667976592991595, 0.14773646188101178, -0.021766181584282576, -0.016203805397535805, 0.05637147479257369, 0.06938622535288899, 0.02413238592952773, -0.22216832247427135, 0.3009831586593314, 0.10131197838890779, 0.20055231052050013, 0.10665496834848501, 0.07101145320162296, -0.08371513369316354, -0.018791642841659014, -0.08738743832122677, -0.11300259102666396, 0.15126215685100022, 0.2542102635142547, 0.1725567913779258, 0.2708254642873012, -0.4905268045089243, -0.24262524787572365, 0.12718001603520226, 0.14282076585082973, 0.14625312906433532, -0.08835221959802593, -0.2057325226384439, 0.06475831268213783, -0.11749626532833599, -0.13512220727338728, -0.019118123308717143, 0.050836269133665325, 0.04216842616878112, -0.23444697412933352, 0.07733549444517711, 0.08024077023721382, 0.10070043170376669, -0.11143997049436587, -0.11084060437529336, -0.07178497760662739, 0.18608351826779782, 0.04960523128617832, -0.013047966717070416, 0.17181529257375794, -0.1706101260902478, -0.10591974971474066, 0.43366388783236093, -0.004135016031427709, -0.1168144349409621, 0.24428352257060004, -0.16253265109844506, -0.2033719706431597, 0.15284464293737202, 0.12740271779578888, 0.11457524038674428, -0.16183098231713416, 0.029896866789535632, 0.02876099639371792, 0.15629489450491493, 0.06711993655160399, 0.038583194443519826, 0.23852885489004275, 0.20196670302649652, 0.006938194965094894, 0.0683092962533436, -0.03799794384431612, -0.10645753555176661, -0.2629654455319919, -0.20765432180937002, -0.13266984279609367, 0.05990902844781817, -0.03732242277172052, -0.18594245926537434, 0.3917196362185044, 0.1139760727557955, 0.20802614661346225, 0.006940203222970749, 0.216615125254722, 0.03208273894129957, 0.10169393012942628, -0.011971184804068901, 0.20331699906478495, 0.11607884485392442, 0.11444011722879979, -0.2506462371601617, 0.20685413640133943, -0.017583602345312793] |
1,803.01561 | Concave/convex switchable lens using active phase-change material
Ge3Sb2Te6 | Normally, the focal length of a conventional lens is fixed. Scientists have
made much effort in modulating it into bifocal, which is very important for
virtual reality (VR) and argument reality (AR) 3D display. It is even much more
difficult for a lens to realize both convex and concave functions with one
geometric structure, that is, a concave/convex switchable lens, which can tune
3D real-images and virtual-images in AR and VR, corresponding to long depth of
view in 3D display. Based on the tunable refractive indexes of phase-change
materials, here we propose a series of concave/convex switchable lenses. When
the phase-change material is in different states, one switchable lens is able
to perform a negative or positive focal length, or perform negative and
positive focal lengths simultaneously. The lenses can be either cylindrical,
spherical or other types. For the superior characteristics, these switchable
lenses can be employed in various optical fields.
| physics.optics | normally the focal length of a conventional lens is fixed scientists have made much effort in modulating it into bifocal which is very important for virtual reality vr and argument reality ar 3d display it is even much more difficult for a lens to realize both convex and concave functions with one geometric structure that is a concaveconvex switchable lens which can tune 3d realimages and virtualimages in ar and vr corresponding to long depth of view in 3d display based on the tunable refractive indexes of phasechange materials here we propose a series of concaveconvex switchable lenses when the phasechange material is in different states one switchable lens is able to perform a negative or positive focal length or perform negative and positive focal lengths simultaneously the lenses can be either cylindrical spherical or other types for the superior characteristics these switchable lenses can be employed in various optical fields | [['normally', 'the', 'focal', 'length', 'of', 'a', 'conventional', 'lens', 'is', 'fixed', 'scientists', 'have', 'made', 'much', 'effort', 'in', 'modulating', 'it', 'into', 'bifocal', 'which', 'is', 'very', 'important', 'for', 'virtual', 'reality', 'vr', 'and', 'argument', 'reality', 'ar', '3d', 'display', 'it', 'is', 'even', 'much', 'more', 'difficult', 'for', 'a', 'lens', 'to', 'realize', 'both', 'convex', 'and', 'concave', 'functions', 'with', 'one', 'geometric', 'structure', 'that', 'is', 'a', 'concaveconvex', 'switchable', 'lens', 'which', 'can', 'tune', '3d', 'realimages', 'and', 'virtualimages', 'in', 'ar', 'and', 'vr', 'corresponding', 'to', 'long', 'depth', 'of', 'view', 'in', '3d', 'display', 'based', 'on', 'the', 'tunable', 'refractive', 'indexes', 'of', 'phasechange', 'materials', 'here', 'we', 'propose', 'a', 'series', 'of', 'concaveconvex', 'switchable', 'lenses', 'when', 'the', 'phasechange', 'material', 'is', 'in', 'different', 'states', 'one', 'switchable', 'lens', 'is', 'able', 'to', 'perform', 'a', 'negative', 'or', 'positive', 'focal', 'length', 'or', 'perform', 'negative', 'and', 'positive', 'focal', 'lengths', 'simultaneously', 'the', 'lenses', 'can', 'be', 'either', 'cylindrical', 'spherical', 'or', 'other', 'types', 'for', 'the', 'superior', 'characteristics', 'these', 'switchable', 'lenses', 'can', 'be', 'employed', 'in', 'various', 'optical', 'fields']] | [-0.09864750805376535, 0.12844516536542808, -0.07578479553629087, 0.05164933542489705, -0.13088617360706897, -0.2451829127936105, -0.03229085523510139, 0.5024529558500187, -0.24800878490755748, -0.31388545817509605, 0.0863858826963181, -0.26119572561759274, -0.19088453342106768, 0.23424483087670134, -0.06364091565647326, 0.05637557991083411, 0.0007239557269823131, -0.03935314098610574, -0.0662962009742756, -0.19098110951564506, 0.2819958049917262, -0.0018231709981524704, 0.2669060660804303, 0.027784293288546272, 0.090543643179609, 0.02304999643136691, 0.0269167957508674, 0.0893178221694625, -0.07993041531983865, 0.11716669199217873, 0.248443759509031, 0.04845511609838413, 0.24678758942309592, -0.4288003376916351, -0.21538249230099804, 0.08016166601005016, 0.1262075084671003, 0.08512565560932678, -0.06834145121547103, -0.2660991744507079, 0.09946592398387874, -0.09661033407366215, -0.14873410935901205, -0.0580901542597219, 0.03149404467377287, 0.03242248517067341, -0.26189380184311306, -0.024290322923826543, 0.02655402499629222, 0.06773118145104448, -0.047837841272941675, -0.07731516019834968, 0.0002857386283013945, 0.13105087018600703, -0.01587609264487088, 0.03460947127431481, 0.1338530567024628, -0.12309046018081124, -0.06964096728862332, 0.40537397556581956, -0.0029727038665881282, -0.22679179705891933, 0.19742684844012479, -0.11155204952775732, -0.017728351969146888, 0.1653617435785779, 0.21505808853544295, 0.12105937891846034, -0.09335401353526676, -7.771656398455169e-07, -0.0033232495126208203, 0.22012253148143723, 0.10678272969370721, 0.02718152533341574, 0.24986109696016115, 0.14217958257583613, 0.0770936496321412, 0.13967803540684895, -0.12270043035515978, -0.017602474594351228, -0.2204776512233903, -0.1852520814496749, -0.19218822399891863, 0.0623163231742262, -0.10635055772264429, -0.22714809087576227, 0.36688109439947714, 0.09506175368586743, 0.15663091599434964, -0.005008594476736632, 0.31721121489051607, 0.08434499290478009, 0.15892470357377056, -0.021226386033348588, 0.2694909000783321, 0.0646429086469689, 0.11234320284198694, -0.1549213499373025, 0.056676297339191974, 0.003655674039142444] |
1,803.01562 | Local Distance Metric Learning for Nearest Neighbor Algorithm | Distance metric learning is a successful way to enhance the performance of
the nearest neighbor classifier. In most cases, however, the distribution of
data does not obey a regular form and may change in different parts of the
feature space. Regarding that, this paper proposes a novel local distance
metric learning method, namely Local Mahalanobis Distance Learning (LMDL), in
order to enhance the performance of the nearest neighbor classifier. LMDL
considers the neighborhood influence and learns multiple distance metrics for a
reduced set of input samples. The reduced set is called as prototypes which try
to preserve local discriminative information as much as possible. The proposed
LMDL can be kernelized very easily, which is significantly desirable in the
case of highly nonlinear data. The quality as well as the efficiency of the
proposed method assesses through a set of different experiments on various
datasets and the obtained results show that LDML as well as the kernelized
version is superior to the other related state-of-the-art methods.
| cs.CV cs.LG stat.ML | distance metric learning is a successful way to enhance the performance of the nearest neighbor classifier in most cases however the distribution of data does not obey a regular form and may change in different parts of the feature space regarding that this paper proposes a novel local distance metric learning method namely local mahalanobis distance learning lmdl in order to enhance the performance of the nearest neighbor classifier lmdl considers the neighborhood influence and learns multiple distance metrics for a reduced set of input samples the reduced set is called as prototypes which try to preserve local discriminative information as much as possible the proposed lmdl can be kernelized very easily which is significantly desirable in the case of highly nonlinear data the quality as well as the efficiency of the proposed method assesses through a set of different experiments on various datasets and the obtained results show that ldml as well as the kernelized version is superior to the other related stateoftheart methods | [['distance', 'metric', 'learning', 'is', 'a', 'successful', 'way', 'to', 'enhance', 'the', 'performance', 'of', 'the', 'nearest', 'neighbor', 'classifier', 'in', 'most', 'cases', 'however', 'the', 'distribution', 'of', 'data', 'does', 'not', 'obey', 'a', 'regular', 'form', 'and', 'may', 'change', 'in', 'different', 'parts', 'of', 'the', 'feature', 'space', 'regarding', 'that', 'this', 'paper', 'proposes', 'a', 'novel', 'local', 'distance', 'metric', 'learning', 'method', 'namely', 'local', 'mahalanobis', 'distance', 'learning', 'lmdl', 'in', 'order', 'to', 'enhance', 'the', 'performance', 'of', 'the', 'nearest', 'neighbor', 'classifier', 'lmdl', 'considers', 'the', 'neighborhood', 'influence', 'and', 'learns', 'multiple', 'distance', 'metrics', 'for', 'a', 'reduced', 'set', 'of', 'input', 'samples', 'the', 'reduced', 'set', 'is', 'called', 'as', 'prototypes', 'which', 'try', 'to', 'preserve', 'local', 'discriminative', 'information', 'as', 'much', 'as', 'possible', 'the', 'proposed', 'lmdl', 'can', 'be', 'kernelized', 'very', 'easily', 'which', 'is', 'significantly', 'desirable', 'in', 'the', 'case', 'of', 'highly', 'nonlinear', 'data', 'the', 'quality', 'as', 'well', 'as', 'the', 'efficiency', 'of', 'the', 'proposed', 'method', 'assesses', 'through', 'a', 'set', 'of', 'different', 'experiments', 'on', 'various', 'datasets', 'and', 'the', 'obtained', 'results', 'show', 'that', 'ldml', 'as', 'well', 'as', 'the', 'kernelized', 'version', 'is', 'superior', 'to', 'the', 'other', 'related', 'stateoftheart', 'methods']] | [-0.04427484550695049, -0.017913662411823367, -0.06745532763235998, 0.08609761968723544, -0.1175685025575548, -0.14702264922557445, 0.03883842854524917, 0.393324433939486, -0.29837343517602877, -0.3153901784897288, 0.07456280808986687, -0.2906710071909446, -0.17830099490692658, 0.19488105259636251, -0.10092832417817922, 0.06661811167240801, 0.08020129047828249, 0.09916424756960535, -0.10148255506043448, -0.2773759152141127, 0.3209589832595822, 0.09352161826724868, 0.3502668317112072, 0.018603179936024655, 0.11260130198206753, 0.0028509180254598218, -0.008469588357512272, 0.06777941212317828, -0.04146082987542131, 0.1519994839299016, 0.260461598949893, 0.19060878187315766, 0.31233090065169805, -0.34753787473820874, -0.21975173510997215, 0.12145336560916337, 0.14459346673059528, 0.07511901296613094, -0.005168281912962656, -0.3037758634082133, 0.10819478377716889, -0.14777083576248004, -0.05391295858454413, -0.1272233063209569, -0.03056582267589231, 0.023695975869309112, -0.2891496771509282, 0.04978561538084206, 0.07348902012000041, -0.010178280647889507, -0.03025658834844873, -0.12377118405377742, -0.0039024261733596553, 0.1528231580031854, 0.03735556233555033, 0.08072127899468774, 0.13466002912794398, -0.12154759620082076, -0.12116093314025642, 0.3963354045025459, -0.09138706818481385, -0.22016527323569057, 0.22702262455188646, -0.056587522829564786, -0.09377530061074806, 0.06762526828579878, 0.2305312725862988, 0.13369040534740723, -0.17424831590785578, 0.02653918781767815, -0.03232494862210687, 0.14854359137967638, 0.029341230088015792, 0.052950763137920236, 0.15069973367981884, 0.20104261717713642, 0.09636481202465891, 0.15340721863996318, -0.13312211086854292, -0.07488953155534989, -0.2307510588764605, -0.12892518417126067, -0.24627002418217273, -0.040063565226307954, -0.13778129863105898, -0.15891632233269332, 0.40820944720521435, 0.19217480795256361, 0.24632353898671613, 0.06844748594803826, 0.3029822729891393, 0.03623518377722443, 0.11291282593908651, 0.08347774282234108, 0.23181530492800492, 0.045976206921495316, 0.060373665617279165, -0.18522233206767408, 0.12095139777605854, 0.08468388534355455] |
1,803.01563 | Fast decaying solutions of Lane-Emden equations involving nonhomogeneous
potential | We are interested in studying positive solutions of Lane-Emden equation
$$ -\Delta u= V u^p\quad {\rm in}\quad \mathbb{R}^N\setminus\{0\}, $$
where $V$ is a nonhomogeneous potential satisfying some extra hypotheses. We
construct a sequence of fast decaying solutions.
| math.AP | we are interested in studying positive solutions of laneemden equation delta u v upquad rm inquad mathbbrnsetminus0 where v is a nonhomogeneous potential satisfying some extra hypotheses we construct a sequence of fast decaying solutions | [['we', 'are', 'interested', 'in', 'studying', 'positive', 'solutions', 'of', 'laneemden', 'equation', 'delta', 'u', 'v', 'upquad', 'rm', 'inquad', 'mathbbrnsetminus0', 'where', 'v', 'is', 'a', 'nonhomogeneous', 'potential', 'satisfying', 'some', 'extra', 'hypotheses', 'we', 'construct', 'a', 'sequence', 'of', 'fast', 'decaying', 'solutions']] | [-0.2519089157200035, 0.07840574351961122, 0.00031845939948278317, 0.0959453316138345, -0.10298122765551157, -0.2882634099737248, -0.04868066907682292, 0.2984182590563946, -0.3044595289427568, -0.16939168116625616, 0.10056459241861697, -0.38185276118490624, -0.06466754569726832, 0.13738628794603489, -0.0017570109955747338, 0.03790284316603314, 0.0574433201485697, 0.06643971170791808, -0.07051467503804494, -0.17946527016294353, 0.35889777683598156, -0.1821045747355503, 0.07818073782083743, -0.0013309506192693814, 0.09239866170922623, -0.10709015964804326, 0.022200161673347738, -0.021268998053582275, -0.2935705608414376, 0.02171202439486104, 0.1848343841950683, 0.12886240044334793, 0.35320555725518393, -0.366285273750477, -0.1684131311280105, 0.23466771920485532, 0.17930522304959595, -0.0030239932239055634, -0.11070652549867244, -0.3206826325725107, 0.17913919249001672, -0.10005184291409985, -0.22976096735938506, -0.04086615262991365, 0.1531754978110685, 0.14388971074539073, -0.4215968822553644, 0.12918348313199685, 0.053945530914728916, -0.010933892541181515, -0.15458824341048433, -0.14603025140240788, -0.02397728982545874, -0.01569011343150016, 0.02207036762197009, 0.12048772342763293, -0.03289788997019915, -0.15964500795063727, 0.03074350638095947, 0.35817499968278055, -0.1561396324678379, -0.2896638318129322, 0.10034562230986707, -0.13920379903934457, -0.13151171383009674, 0.06999739017063643, 0.13142375289188588, 0.18053299232440836, -0.13150022439110806, 0.2683944537249558, -0.03698826619588277, 0.11302576674258008, 0.11928767079542227, -0.02580714239464963, 0.08226047738400452, 0.11822356305578176, 0.09511145799393382, 0.07195106743122726, -0.0015830299953984864, -0.005516231402426082, -0.39150113705545664, -0.17183327148942387, -0.06914289624375455, 0.180175532340346, -0.09110648108317572, -0.16239232630194986, 0.3481131727971575, 0.04317150107475326, 0.19482452318291454, 0.03998777325100759, 0.12865667845471762, 0.20882241756600492, -0.08429210917914615, 0.11808150846456342, 0.06409197036769268, 0.14982774881098201, 0.13885678512537303, -0.17929058687706642, -0.03085743578370003, 0.12379530009210986] |
1,803.01564 | Band structures in coupled-cluster singles-and-doubles Green's function
(GFCCSD) | We demonstrate that coupled-cluster singles-and-doubles Green's function
(GFCCSD) method is a powerful and prominent tool drawing the electronic band
structures and the total energies, which many theoretical techniques struggle
to reproduce. We have calculated single-electron energy spectra via GFCCSD
method for various kinds of systems, ranging from ionic to covalent and van der
Waals, for the first time: one-dimensional LiH chain, one-dimensional C chain,
and one-dimensional Be chain. We have found that the band gap becomes narrower
than in HF due to the correlation effect. We also show that the band structures
obtained from GFCCSD method include both quasiparticle and satellite peaks
successfully. Besides, taking one-dimensional LiH as an example, we discuss the
validity of restricting the active space to suppress the computational cost of
GFCCSD method while maintaining the accuracy. We show that the calculated
results without bands that do not contribute to the chemical bonds are in good
agreement with full-band calculations. With GFCCSD method, we can calculate the
total energy and band structures with high precision.
| cond-mat.mtrl-sci | we demonstrate that coupledcluster singlesanddoubles greens function gfccsd method is a powerful and prominent tool drawing the electronic band structures and the total energies which many theoretical techniques struggle to reproduce we have calculated singleelectron energy spectra via gfccsd method for various kinds of systems ranging from ionic to covalent and van der waals for the first time onedimensional lih chain onedimensional c chain and onedimensional be chain we have found that the band gap becomes narrower than in hf due to the correlation effect we also show that the band structures obtained from gfccsd method include both quasiparticle and satellite peaks successfully besides taking onedimensional lih as an example we discuss the validity of restricting the active space to suppress the computational cost of gfccsd method while maintaining the accuracy we show that the calculated results without bands that do not contribute to the chemical bonds are in good agreement with fullband calculations with gfccsd method we can calculate the total energy and band structures with high precision | [['we', 'demonstrate', 'that', 'coupledcluster', 'singlesanddoubles', 'greens', 'function', 'gfccsd', 'method', 'is', 'a', 'powerful', 'and', 'prominent', 'tool', 'drawing', 'the', 'electronic', 'band', 'structures', 'and', 'the', 'total', 'energies', 'which', 'many', 'theoretical', 'techniques', 'struggle', 'to', 'reproduce', 'we', 'have', 'calculated', 'singleelectron', 'energy', 'spectra', 'via', 'gfccsd', 'method', 'for', 'various', 'kinds', 'of', 'systems', 'ranging', 'from', 'ionic', 'to', 'covalent', 'and', 'van', 'der', 'waals', 'for', 'the', 'first', 'time', 'onedimensional', 'lih', 'chain', 'onedimensional', 'c', 'chain', 'and', 'onedimensional', 'be', 'chain', 'we', 'have', 'found', 'that', 'the', 'band', 'gap', 'becomes', 'narrower', 'than', 'in', 'hf', 'due', 'to', 'the', 'correlation', 'effect', 'we', 'also', 'show', 'that', 'the', 'band', 'structures', 'obtained', 'from', 'gfccsd', 'method', 'include', 'both', 'quasiparticle', 'and', 'satellite', 'peaks', 'successfully', 'besides', 'taking', 'onedimensional', 'lih', 'as', 'an', 'example', 'we', 'discuss', 'the', 'validity', 'of', 'restricting', 'the', 'active', 'space', 'to', 'suppress', 'the', 'computational', 'cost', 'of', 'gfccsd', 'method', 'while', 'maintaining', 'the', 'accuracy', 'we', 'show', 'that', 'the', 'calculated', 'results', 'without', 'bands', 'that', 'do', 'not', 'contribute', 'to', 'the', 'chemical', 'bonds', 'are', 'in', 'good', 'agreement', 'with', 'fullband', 'calculations', 'with', 'gfccsd', 'method', 'we', 'can', 'calculate', 'the', 'total', 'energy', 'and', 'band', 'structures', 'with', 'high', 'precision']] | [-0.05979727722563886, 0.058094070871038905, -0.05199638923689359, 0.0854294106134175, -0.0011391979614658468, -0.13174125480261692, 0.07020755062023035, 0.44589406569604073, -0.2366392205072534, -0.3323729181629137, -0.002520322914031395, -0.31333940723888887, -0.1336312073794109, 0.21218584051297856, 0.051225580523044045, 0.04487574773636707, 0.076180163462999, -0.06427611934693431, -0.09324259732707993, -0.19382489997529861, 0.26786251584709947, 0.08892956432285747, 0.2714510485033929, 0.11475618375939202, 0.022375055453767615, 0.022758754311934026, 0.04130861688317103, 0.042543193278386474, -0.15039589453338592, 0.11874064075906579, 0.2527709047161263, -0.018984720799741308, 0.2303843886189207, -0.45806569159692206, -0.22143633543243688, 0.0648770414901754, 0.12634233257887587, 0.17190357421169378, -0.037309869589317125, -0.24758329589647302, 0.08259282435205098, -0.20038792333350733, -0.12138172882724796, -0.14007408746047023, -0.02075731988235779, 0.06197832879636536, -0.2014506712484245, 0.09749508027339315, 0.001825730168927439, 0.016853669455394453, -0.0919271292490058, -0.15937708391526922, -0.08577116425824213, 0.1025991638455562, 0.00579448752849192, 0.012038982255637822, 0.1257178327592211, -0.07332191971191288, -0.0973055574036556, 0.4201918607412358, -0.0894930323427605, -0.11365037998349885, 0.2201664745697432, -0.14025075852143518, -0.13997868495613072, 0.1757640888578308, 0.09844378268445385, 0.06255171480781492, -0.12241397391916556, 0.08741004676930056, 0.022320271659774717, 0.18328105504748538, 0.050083538905866226, 0.05864088900745316, 0.17077663714980937, 0.12297689823775425, 0.03599398662356836, 0.11111264348583924, -0.1368097512446862, -0.08400728222266524, -0.20614140518230095, -0.16369390418648322, -0.20424683780144878, -0.012256292838340807, -0.04668366867093474, -0.17242360371578286, 0.3950470804082527, 0.14282285292309357, 0.1702586375314676, 0.05821890620027046, 0.25391916125963204, 0.15136647659709357, 0.06550129727093977, 0.06405870105310746, 0.24395934909033815, 0.13269084748211343, 0.06058427874555469, -0.2537640121664863, 0.015802041065366663, 0.037648526841454956] |
1,803.01565 | First Electromagnetic Pulse Associated with a Gravitational-Wave Event:
Profile, Duration, and Delay | We study the first electromagnetic pulse after the gravitational wave chirp
signal, focusing on the profile and duration. It is found that the light curve,
especially the steep decay (SD) phase, can be very different by adopting
different viewing angle $\theta_{\rm view}$ on the jet shell. For an on-axis
jet with a power-law radiation spectrum, the observed flux in the SD is
proportional to $t_{\rm{obs}}^{-2-\beta}$ with $\beta$ being the spectral index
and $t_{\rm{obs}}$ being the observer time. Here, $t_{\rm{obs}}=0$ is set at
the observed time of the jet ejected from the central engine. The SD may become
steep by increasing $\theta_{\rm view}$. We also study the bolometric
luminosity $L$ from a jet shell with a non-power-law radiation spectrum. For an
on-axis jet, $L{\propto}t_{\rm{obs}}^{-3}$ is found in the SD. However, the SD
is steeper than $L{\propto}t_{\rm{obs}}^{-3}$ for the radiation from an
off-axis jet. The higher value of $\theta_{\rm view}$ is, the steeper of SD
would be. Then, we suggest that the SD phase can be used to discriminate an
off-axis jet from an on-axis jet. The reason for above behaviors is discussed.
In addition, we find that the duration of first electromagnetic pulse is close
to its peak time, especially for $\theta_{\rm{view}}\sim20^\circ$. This result
is consistent with that found in GW~170817/GRB~170817A. Thus, the jet
corresponding to the prompt emission of GRB~170817A should be immediately
ejected after the merger. Our results also reveal that the duration of the
first electromagnetic pulse can provide the information of the time to search
gravitational waves.
| astro-ph.HE | we study the first electromagnetic pulse after the gravitational wave chirp signal focusing on the profile and duration it is found that the light curve especially the steep decay sd phase can be very different by adopting different viewing angle theta_rm view on the jet shell for an onaxis jet with a powerlaw radiation spectrum the observed flux in the sd is proportional to t_rmobs2beta with beta being the spectral index and t_rmobs being the observer time here t_rmobs0 is set at the observed time of the jet ejected from the central engine the sd may become steep by increasing theta_rm view we also study the bolometric luminosity l from a jet shell with a nonpowerlaw radiation spectrum for an onaxis jet lproptot_rmobs3 is found in the sd however the sd is steeper than lproptot_rmobs3 for the radiation from an offaxis jet the higher value of theta_rm view is the steeper of sd would be then we suggest that the sd phase can be used to discriminate an offaxis jet from an onaxis jet the reason for above behaviors is discussed in addition we find that the duration of first electromagnetic pulse is close to its peak time especially for theta_rmviewsim20circ this result is consistent with that found in gw170817grb170817a thus the jet corresponding to the prompt emission of grb170817a should be immediately ejected after the merger our results also reveal that the duration of the first electromagnetic pulse can provide the information of the time to search gravitational waves | [['we', 'study', 'the', 'first', 'electromagnetic', 'pulse', 'after', 'the', 'gravitational', 'wave', 'chirp', 'signal', 'focusing', 'on', 'the', 'profile', 'and', 'duration', 'it', 'is', 'found', 'that', 'the', 'light', 'curve', 'especially', 'the', 'steep', 'decay', 'sd', 'phase', 'can', 'be', 'very', 'different', 'by', 'adopting', 'different', 'viewing', 'angle', 'theta_rm', 'view', 'on', 'the', 'jet', 'shell', 'for', 'an', 'onaxis', 'jet', 'with', 'a', 'powerlaw', 'radiation', 'spectrum', 'the', 'observed', 'flux', 'in', 'the', 'sd', 'is', 'proportional', 'to', 't_rmobs2beta', 'with', 'beta', 'being', 'the', 'spectral', 'index', 'and', 't_rmobs', 'being', 'the', 'observer', 'time', 'here', 't_rmobs0', 'is', 'set', 'at', 'the', 'observed', 'time', 'of', 'the', 'jet', 'ejected', 'from', 'the', 'central', 'engine', 'the', 'sd', 'may', 'become', 'steep', 'by', 'increasing', 'theta_rm', 'view', 'we', 'also', 'study', 'the', 'bolometric', 'luminosity', 'l', 'from', 'a', 'jet', 'shell', 'with', 'a', 'nonpowerlaw', 'radiation', 'spectrum', 'for', 'an', 'onaxis', 'jet', 'lproptot_rmobs3', 'is', 'found', 'in', 'the', 'sd', 'however', 'the', 'sd', 'is', 'steeper', 'than', 'lproptot_rmobs3', 'for', 'the', 'radiation', 'from', 'an', 'offaxis', 'jet', 'the', 'higher', 'value', 'of', 'theta_rm', 'view', 'is', 'the', 'steeper', 'of', 'sd', 'would', 'be', 'then', 'we', 'suggest', 'that', 'the', 'sd', 'phase', 'can', 'be', 'used', 'to', 'discriminate', 'an', 'offaxis', 'jet', 'from', 'an', 'onaxis', 'jet', 'the', 'reason', 'for', 'above', 'behaviors', 'is', 'discussed', 'in', 'addition', 'we', 'find', 'that', 'the', 'duration', 'of', 'first', 'electromagnetic', 'pulse', 'is', 'close', 'to', 'its', 'peak', 'time', 'especially', 'for', 'theta_rmviewsim20circ', 'this', 'result', 'is', 'consistent', 'with', 'that', 'found', 'in', 'gw170817grb170817a', 'thus', 'the', 'jet', 'corresponding', 'to', 'the', 'prompt', 'emission', 'of', 'grb170817a', 'should', 'be', 'immediately', 'ejected', 'after', 'the', 'merger', 'our', 'results', 'also', 'reveal', 'that', 'the', 'duration', 'of', 'the', 'first', 'electromagnetic', 'pulse', 'can', 'provide', 'the', 'information', 'of', 'the', 'time', 'to', 'search', 'gravitational', 'waves']] | [-0.08325656969291081, 0.14091611337533352, -0.12895780642226826, 0.12355240377345596, -0.08625275900751567, -0.10907643420820232, -0.012265770238076077, 0.44818622371578803, -0.2147413620183275, -0.30044956194984984, 0.07096684933353796, -0.2664659661250418, -0.035569767278741254, 0.24477277514162152, -0.0030081177141792217, -0.02647139329571071, 0.03759189169903068, 0.008054693239157997, -0.10453715456170641, -0.12094048074251361, 0.31003320370428644, 0.15116204706127526, 0.22193638386765924, 0.05975671132576087, 0.05041715355406775, -0.015335922724887973, -0.0205180128434192, -0.012320740589276567, -0.08431594298089608, -0.012274546050619273, 0.1917654361278124, 0.11200737026539158, 0.1734783654578305, -0.4017498105541101, -0.207173562394436, 0.09168179823490256, 0.14525120614524015, 0.06789184893008138, -0.044112524414648774, -0.2618276601348103, 0.07556567900801234, -0.1954900692341101, -0.15604395259836817, 0.07261102079780253, 0.05588209713030545, 0.025276053965484845, -0.23730072522341258, 0.05999428015990711, 0.028092103617561152, -0.02571241449579963, -0.04546446725773839, -0.06297149658002738, -0.03773472046090259, 0.04987305516499232, 0.13707159323614, 0.12283722877447097, 0.1480740698485742, -0.12404878759808212, -0.06563028272768086, 0.3957330385589453, -0.04376574131483871, -0.07117166451644152, 0.12729924015479438, -0.2032102659024054, -0.07351834869172547, 0.2270212229799296, 0.1425384076170959, 0.09271581832903483, -0.11022884368927019, -0.03340996641591268, -0.004657916664506106, 0.2159118388939771, 0.04557866312479448, 0.028823324621342062, 0.2626824723690229, 0.14306706808016972, 0.02624800686388597, 0.12623384470868185, -0.2028843546190803, -0.023403122371299285, -0.32677157874577906, -0.11203314823892395, -0.16031524540520595, 0.09130807827458455, -0.13426142348448666, -0.09628246813539232, 0.40236374754535004, 0.08713974555540203, 0.18648498749921527, 0.058644756308344544, 0.28881800212118713, 0.15996252480789602, 0.04623856758278962, 0.11888804841885862, 0.36679026198985637, 0.0989690156268017, 0.13890033488049264, -0.2393941803697924, 0.07708517033568599, -0.01074557020767882] |
1,803.01566 | Measurement independent magnetocaloric effect in Mn-rich
Mn-Fe-Ni-Sn(Sb/In) Heusler alloys | We report a systematic study on the magneto-structural transition in Mn-rich
Fe-doped Mn-Fe-Ni-Sn(Sb/In) Heusler alloys by keeping the total valence
electron concentration (e/a ratio) fixed. The martensitic transition (MT)
temperature is found to shift by following a proportional relationship with the
e/a ratio of the magnetic elements alone. The magnetic entropy change across MT
for a selected sample (Mn49FeNi40Sn9In) has been estimated from three different
measurement methods (isofield magnetization (M) vs temperature (T), isothermal
M vs field (H) and heat capacity (HC) vs T). We observed that though the peak
value of magnetic entropy change changes with the measurement methods, the
broadened shape of the magnetic entropy change vs T curves and the
corresponding cooling power (~140 Jkg-1) remains invariant. The equivalent
adiabatic temperature change ~ -2.6 K has been obtained from indirect
measurements of temperature change. Moreover, an exchange bias field ~ 783 Oe
at 5 K and a magnetoresistance of -30% are also obtained in one of these
materials.
| cond-mat.mtrl-sci physics.app-ph | we report a systematic study on the magnetostructural transition in mnrich fedoped mnfenisnsbin heusler alloys by keeping the total valence electron concentration ea ratio fixed the martensitic transition mt temperature is found to shift by following a proportional relationship with the ea ratio of the magnetic elements alone the magnetic entropy change across mt for a selected sample mn49feni40sn9in has been estimated from three different measurement methods isofield magnetization m vs temperature t isothermal m vs field h and heat capacity hc vs t we observed that though the peak value of magnetic entropy change changes with the measurement methods the broadened shape of the magnetic entropy change vs t curves and the corresponding cooling power 140 jkg1 remains invariant the equivalent adiabatic temperature change 26 k has been obtained from indirect measurements of temperature change moreover an exchange bias field 783 oe at 5 k and a magnetoresistance of 30 are also obtained in one of these materials | [['we', 'report', 'a', 'systematic', 'study', 'on', 'the', 'magnetostructural', 'transition', 'in', 'mnrich', 'fedoped', 'mnfenisnsbin', 'heusler', 'alloys', 'by', 'keeping', 'the', 'total', 'valence', 'electron', 'concentration', 'ea', 'ratio', 'fixed', 'the', 'martensitic', 'transition', 'mt', 'temperature', 'is', 'found', 'to', 'shift', 'by', 'following', 'a', 'proportional', 'relationship', 'with', 'the', 'ea', 'ratio', 'of', 'the', 'magnetic', 'elements', 'alone', 'the', 'magnetic', 'entropy', 'change', 'across', 'mt', 'for', 'a', 'selected', 'sample', 'mn49feni40sn9in', 'has', 'been', 'estimated', 'from', 'three', 'different', 'measurement', 'methods', 'isofield', 'magnetization', 'm', 'vs', 'temperature', 't', 'isothermal', 'm', 'vs', 'field', 'h', 'and', 'heat', 'capacity', 'hc', 'vs', 't', 'we', 'observed', 'that', 'though', 'the', 'peak', 'value', 'of', 'magnetic', 'entropy', 'change', 'changes', 'with', 'the', 'measurement', 'methods', 'the', 'broadened', 'shape', 'of', 'the', 'magnetic', 'entropy', 'change', 'vs', 't', 'curves', 'and', 'the', 'corresponding', 'cooling', 'power', '140', 'jkg1', 'remains', 'invariant', 'the', 'equivalent', 'adiabatic', 'temperature', 'change', '26', 'k', 'has', 'been', 'obtained', 'from', 'indirect', 'measurements', 'of', 'temperature', 'change', 'moreover', 'an', 'exchange', 'bias', 'field', '783', 'oe', 'at', '5', 'k', 'and', 'a', 'magnetoresistance', 'of', '30', 'are', 'also', 'obtained', 'in', 'one', 'of', 'these', 'materials']] | [-0.13609819603749576, 0.2186896576504529, -0.03188226126337376, 0.008431630722509745, -0.017943628087568168, -0.13467555936091605, 0.1375690833411705, 0.39556358501506156, -0.24818337940348265, -0.3863979386112008, 0.020913010210885357, -0.334627209798409, -0.020463481496195667, 0.17122972834532937, 0.031082272520647027, 0.005343656151149518, -0.043801002571574196, 0.06461663631041749, -0.16287224652478471, -0.21501357951171648, 0.2518999058251771, 0.04444167961796316, 0.32131347436314595, 0.054250018895030595, 0.04981959402488055, -0.015125319906450713, 0.03893279182151533, 0.08734650017084697, -0.18855250124896628, -0.015342268188667218, 0.21804367513276446, -0.008359643057561837, 0.17985657615682635, -0.3037952537443067, -0.1904447361810479, 0.08176680087135771, 0.08330116031589942, 0.028394009726933945, -0.051981238412106626, -0.18933361747230476, 0.06415354691815968, -0.0969440941624224, -0.060305615451234654, -0.05153942278896769, 0.06657189674800836, -0.006935510129178277, -0.25484236060993937, 0.14853337407093464, 0.07204087515576528, 0.18345091538503766, -0.11108364949289423, -0.1896905721678661, -0.0658157672583818, 0.05894163262266188, 0.053020817220199086, 0.11033941894689073, 0.23646156462984017, -0.06736981834117801, -0.07657574764631975, 0.3066615622060803, -0.11503383703529835, -0.010725756844457908, 0.12488412022148856, -0.20623381829892212, -0.08888375631664903, 0.18528464461903638, 0.10562167115037879, 0.1085180371749, -0.1454577440610872, 0.08850312034654706, 0.03549710640277809, 0.18703718755083779, 0.0583147236581844, -0.023038137138474923, 0.20264295742023164, 0.12436155785316935, 0.011925533439259594, 0.13864667244473447, -0.16453328486740923, -0.042668676956031375, -0.2190597576801128, -0.16452426813805524, -0.17038614746520464, 0.0976276287364248, -0.12753401509195475, -0.13722888166263986, 0.35706930302489454, 0.1206856415967475, 0.2238872000732674, -0.019866112467589587, 0.22998129186602548, 0.14084969268058045, 0.08123789790074508, 0.08606190014726077, 0.25166336657443583, 0.21778308942269248, 0.20358413151310137, -0.3257377088093796, 0.10904490196695313, -0.019305905255560692] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.