id float64 706 1.8k | title stringlengths 1 343 | abstract stringlengths 6 6.09k | categories stringlengths 5 125 | processed_abstract stringlengths 2 5.96k | tokenized_abstract stringlengths 8 8.74k | centroid stringlengths 2.1k 2.17k |
|---|---|---|---|---|---|---|
1,802.0066 | Investigation of modified ATLAS pixel implantations after irradiation
with neutrons | The innermost part of the tracking detector of the ATLAS experiment consists
mainly of planar n$^+$-in-n silicon pixel sensors. During the phase-0 upgrade,
the Insertable B-Layer (IBL) was installed closest to the beam pipe. Its pixels
are arranged with a pitch of $250\,\mu$m$\,\times\,50\,\mu$m with a rectangular
shaped n$^+$ implantation. Based on this design modified pixel designs have
been developed in Dortmund.
Six of these new pixel designs are arranged in structures of ten columns and
were placed beside structures with the standard design on one sensor. Because
of a special guard ring design, each structure can be powered and investigated
separately. Several of these sensors were bump bonded to FE-I4 read-out chips.
One of these modules was irradiated with reactor neutrons up to a fluence of $5
\times 10^{15} \, n_{\text{eq}}\text{cm}^{-2}$.
This contribution presents important sensor characteristics, charge
collection determined with radioactive sources and hit efficiency measurements,
performed in laboratory and test beam, of this irradiated device. It is shown
that the new modified designs perform similar or better than the IBL standard
design in terms of charge collection and tracking efficiency, at the cost of a
slightly increased leakage current.
| physics.ins-det | the innermost part of the tracking detector of the atlas experiment consists mainly of planar ninn silicon pixel sensors during the phase0 upgrade the insertable blayer ibl was installed closest to the beam pipe its pixels are arranged with a pitch of 250mumtimes50mum with a rectangular shaped n implantation based on this design modified pixel designs have been developed in dortmund six of these new pixel designs are arranged in structures of ten columns and were placed beside structures with the standard design on one sensor because of a special guard ring design each structure can be powered and investigated separately several of these sensors were bump bonded to fei4 readout chips one of these modules was irradiated with reactor neutrons up to a fluence of 5 times 1015 n_texteqtextcm2 this contribution presents important sensor characteristics charge collection determined with radioactive sources and hit efficiency measurements performed in laboratory and test beam of this irradiated device it is shown that the new modified designs perform similar or better than the ibl standard design in terms of charge collection and tracking efficiency at the cost of a slightly increased leakage current | [['the', 'innermost', 'part', 'of', 'the', 'tracking', 'detector', 'of', 'the', 'atlas', 'experiment', 'consists', 'mainly', 'of', 'planar', 'ninn', 'silicon', 'pixel', 'sensors', 'during', 'the', 'phase0', 'upgrade', 'the', 'insertable', 'blayer', 'ibl', 'was', 'installed', 'closest', 'to', 'the', 'beam', 'pipe', 'its', 'pixels', 'are', 'arranged', 'with', 'a', 'pitch', 'of', '250mumtimes50mum', 'with', 'a', 'rectangular', 'shaped', 'n', 'implantation', 'based', 'on', 'this', 'design', 'modified', 'pixel', 'designs', 'have', 'been', 'developed', 'in', 'dortmund', 'six', 'of', 'these', 'new', 'pixel', 'designs', 'are', 'arranged', 'in', 'structures', 'of', 'ten', 'columns', 'and', 'were', 'placed', 'beside', 'structures', 'with', 'the', 'standard', 'design', 'on', 'one', 'sensor', 'because', 'of', 'a', 'special', 'guard', 'ring', 'design', 'each', 'structure', 'can', 'be', 'powered', 'and', 'investigated', 'separately', 'several', 'of', 'these', 'sensors', 'were', 'bump', 'bonded', 'to', 'fei4', 'readout', 'chips', 'one', 'of', 'these', 'modules', 'was', 'irradiated', 'with', 'reactor', 'neutrons', 'up', 'to', 'a', 'fluence', 'of', '5', 'times', '1015', 'n_texteqtextcm2', 'this', 'contribution', 'presents', 'important', 'sensor', 'characteristics', 'charge', 'collection', 'determined', 'with', 'radioactive', 'sources', 'and', 'hit', 'efficiency', 'measurements', 'performed', 'in', 'laboratory', 'and', 'test', 'beam', 'of', 'this', 'irradiated', 'device', 'it', 'is', 'shown', 'that', 'the', 'new', 'modified', 'designs', 'perform', 'similar', 'or', 'better', 'than', 'the', 'ibl', 'standard', 'design', 'in', 'terms', 'of', 'charge', 'collection', 'and', 'tracking', 'efficiency', 'at', 'the', 'cost', 'of', 'a', 'slightly', 'increased', 'leakage', 'current']] | [-0.08279224213378682, 0.11493719876446623, -0.0011538225622411739, -0.0527174651853126, -0.0044709947480364364, -0.19907350556806047, -0.04397968910733595, 0.4362865433002763, -0.18103899063785223, -0.37036658665091, 0.10749873631396034, -0.3277146618706769, -0.02412006424422911, 0.19368218518100044, -0.09718827512722086, 0.10286303226398849, 0.0735383548963, -0.0025149259488395554, -0.04734910542406687, -0.24087406103338233, 0.21420258487403848, 0.16375914034483202, 0.30109263794432256, -0.006129592607550798, 0.12490432179889623, -0.037810253917531886, -0.04035480839430672, -0.002187758679204482, -0.07541407998348618, 0.11799083831175132, 0.25435865317728923, 0.07155182171598116, 0.19600960789273117, -0.4787882654729517, -0.12980263527888963, 0.059126442729277494, 0.09670191888320953, -0.01666357953279735, -0.09658111937150875, -0.26943080053303115, 0.11033693216295239, -0.1913076692478771, -0.11664688095767448, 0.07055671437828619, -0.009143367427044568, 0.060372719114542284, -0.2384510156676852, -0.06041234551973522, 0.007825683063005117, 0.043064485316442205, -0.020132833486794434, -0.17344900190909493, -0.0003422026106334747, 0.0928614766335739, -0.048785514265120504, 0.01446407585791213, 0.24326099551523084, -0.09332277887981345, -0.09990941518125065, 0.3169197035467926, 0.034083864919979376, -0.16271047833597937, 0.15249526577610326, -0.17041253878089768, -0.07708065985067886, 0.18705752438983567, 0.17856190572406086, 0.09888059579509687, -0.19144614245971675, -0.005962325278929673, 0.01369612543605902, 0.1979237989958455, 0.13915133279342046, 0.026993424956131964, 0.23587774418627575, 0.28466269089047735, 0.06548440197257925, 0.17032353106348658, -0.19677042734234573, 0.00598910869535138, -0.30441319123727884, -0.1234615974331354, -0.12381877773689066, 0.016739431937086456, -0.026431173447409938, -0.13529479885836096, 0.4233412319073126, 0.11467985130172778, 0.16414883324401633, -0.05197800410554764, 0.31125198744306776, 0.032952760038166704, 0.17198939186377213, 0.01168120290930482, 0.28896763511348833, 0.10773349659358884, 0.13175845809994227, -0.16075637925074415, 0.04525016899656584, 0.025294589392712064] |
1,802.00661 | Field-Embedded Particles Driven by Active Flips | Systems of independent active particles embedded into a fluctuating
environment are relevant to many areas of soft-matter science. We use a minimal
model of noninteracting spin-carrying Brownian particles in a Gaussian field
and show that activity-driven spin dynamics leads to patterned order. We find
that the competition between mediated interactions and active noise alone can
yield such diverse behaviors as phase transitions and microphase separation,
from lamellar up to hexagonal ordering of clusters of opposite magnetization.
These rest on complex multibody interactions. We find regimes of stationary
patterns, but also dynamical regimes of relentless birth and growth of lumps of
magnetization opposite to the surrounding one. Our approach combines
Monte-Carlo simulations with analytical methods based on dynamical density
functional approaches.
| cond-mat.soft cond-mat.stat-mech | systems of independent active particles embedded into a fluctuating environment are relevant to many areas of softmatter science we use a minimal model of noninteracting spincarrying brownian particles in a gaussian field and show that activitydriven spin dynamics leads to patterned order we find that the competition between mediated interactions and active noise alone can yield such diverse behaviors as phase transitions and microphase separation from lamellar up to hexagonal ordering of clusters of opposite magnetization these rest on complex multibody interactions we find regimes of stationary patterns but also dynamical regimes of relentless birth and growth of lumps of magnetization opposite to the surrounding one our approach combines montecarlo simulations with analytical methods based on dynamical density functional approaches | [['systems', 'of', 'independent', 'active', 'particles', 'embedded', 'into', 'a', 'fluctuating', 'environment', 'are', 'relevant', 'to', 'many', 'areas', 'of', 'softmatter', 'science', 'we', 'use', 'a', 'minimal', 'model', 'of', 'noninteracting', 'spincarrying', 'brownian', 'particles', 'in', 'a', 'gaussian', 'field', 'and', 'show', 'that', 'activitydriven', 'spin', 'dynamics', 'leads', 'to', 'patterned', 'order', 'we', 'find', 'that', 'the', 'competition', 'between', 'mediated', 'interactions', 'and', 'active', 'noise', 'alone', 'can', 'yield', 'such', 'diverse', 'behaviors', 'as', 'phase', 'transitions', 'and', 'microphase', 'separation', 'from', 'lamellar', 'up', 'to', 'hexagonal', 'ordering', 'of', 'clusters', 'of', 'opposite', 'magnetization', 'these', 'rest', 'on', 'complex', 'multibody', 'interactions', 'we', 'find', 'regimes', 'of', 'stationary', 'patterns', 'but', 'also', 'dynamical', 'regimes', 'of', 'relentless', 'birth', 'and', 'growth', 'of', 'lumps', 'of', 'magnetization', 'opposite', 'to', 'the', 'surrounding', 'one', 'our', 'approach', 'combines', 'montecarlo', 'simulations', 'with', 'analytical', 'methods', 'based', 'on', 'dynamical', 'density', 'functional', 'approaches']] | [-0.14521924181414458, 0.2295944354729727, -0.09976592986398221, 0.05624596872269952, -0.025199782675675426, -0.12668730491423047, 0.028160420437537446, 0.3791449407891681, -0.2602453863946721, -0.32094253373458437, 0.014315048053200977, -0.30055983693649374, -0.1743538709823042, 0.1548311277156851, 0.04284470066971456, 0.0032830115873366595, 0.010316483672553053, -0.029204416131445518, -0.03911161319507907, -0.17946007894352078, 0.2651212104829028, -0.024068082201605043, 0.2768537218410832, 0.00946989298487703, 0.10921761953504756, 0.00018998158629983662, 0.03392721990530845, 0.054088499816134575, -0.15962027961371253, 0.07807924632846455, 0.21592434868992616, 0.010833705579898378, 0.2192783394692621, -0.4896454465575516, -0.24031433540706834, 0.0733129922960264, 0.19436769872360551, 0.13665524092502893, -0.06968170205072965, -0.2964855746909355, 0.005797584580917222, -0.1454721222689841, -0.12346709607712304, -0.09754686798745145, 0.017404078120792595, 0.07501832270305991, -0.2689954977482557, 0.14217840558630995, 0.06688561720220605, 0.039203161179708935, -0.07402666578418575, -0.07721385401770628, -0.04612583248138738, 0.13541893047416428, 0.054436565174061494, -0.01221250978220875, 0.21886815718607977, -0.1322907750494778, -0.1334265435405541, 0.3538011529308278, -0.03181139309987581, -0.1738353298757526, 0.3090782758061929, -0.14550238383623462, -0.11105301538482308, 0.1537336702613781, 0.22431662137290306, 0.09144417496863752, -0.14174691665830325, 0.03428115699401436, 0.007088970776142863, 0.1865032069811908, 0.03188255376492937, 0.026625499944202602, 0.2713951135597502, 0.21689805302303283, 0.04162511238003693, 0.14669917806362112, -0.06762460171982336, -0.21167015221047525, -0.22210951978728796, -0.10798405732299822, -0.15055928931493934, 0.0402245153983434, -0.10768240386726878, -0.19236139817318568, 0.36474845291425784, 0.17182379550067708, 0.17258776490731786, -0.007128689696158593, 0.24375882860428344, 0.027224228143071134, 0.03837294466793537, 0.0313681656960398, 0.210940444994291, 0.15471900388753662, 0.07841147299623116, -0.23960144642430048, 0.03930172109079043, 0.014996837768315648] |
1,802.00662 | Dual Memory Neural Computer for Asynchronous Two-view Sequential
Learning | One of the core tasks in multi-view learning is to capture relations among
views. For sequential data, the relations not only span across views, but also
extend throughout the view length to form long-term intra-view and inter-view
interactions. In this paper, we present a new memory augmented neural network
model that aims to model these complex interactions between two asynchronous
sequential views. Our model uses two encoders for reading from and writing to
two external memories for encoding input views. The intra-view interactions and
the long-term dependencies are captured by the use of memories during this
encoding process. There are two modes of memory accessing in our system:
late-fusion and early-fusion, corresponding to late and early inter-view
interactions. In the late-fusion mode, the two memories are separated,
containing only view-specific contents. In the early-fusion mode, the two
memories share the same addressing space, allowing cross-memory accessing. In
both cases, the knowledge from the memories will be combined by a decoder to
make predictions over the output space. The resulting dual memory neural
computer is demonstrated on a comprehensive set of experiments, including a
synthetic task of summing two sequences and the tasks of drug prescription and
disease progression in healthcare. The results demonstrate competitive
performance over both traditional algorithms and deep learning methods designed
for multi-view problems.
| cs.LG stat.ML | one of the core tasks in multiview learning is to capture relations among views for sequential data the relations not only span across views but also extend throughout the view length to form longterm intraview and interview interactions in this paper we present a new memory augmented neural network model that aims to model these complex interactions between two asynchronous sequential views our model uses two encoders for reading from and writing to two external memories for encoding input views the intraview interactions and the longterm dependencies are captured by the use of memories during this encoding process there are two modes of memory accessing in our system latefusion and earlyfusion corresponding to late and early interview interactions in the latefusion mode the two memories are separated containing only viewspecific contents in the earlyfusion mode the two memories share the same addressing space allowing crossmemory accessing in both cases the knowledge from the memories will be combined by a decoder to make predictions over the output space the resulting dual memory neural computer is demonstrated on a comprehensive set of experiments including a synthetic task of summing two sequences and the tasks of drug prescription and disease progression in healthcare the results demonstrate competitive performance over both traditional algorithms and deep learning methods designed for multiview problems | [['one', 'of', 'the', 'core', 'tasks', 'in', 'multiview', 'learning', 'is', 'to', 'capture', 'relations', 'among', 'views', 'for', 'sequential', 'data', 'the', 'relations', 'not', 'only', 'span', 'across', 'views', 'but', 'also', 'extend', 'throughout', 'the', 'view', 'length', 'to', 'form', 'longterm', 'intraview', 'and', 'interview', 'interactions', 'in', 'this', 'paper', 'we', 'present', 'a', 'new', 'memory', 'augmented', 'neural', 'network', 'model', 'that', 'aims', 'to', 'model', 'these', 'complex', 'interactions', 'between', 'two', 'asynchronous', 'sequential', 'views', 'our', 'model', 'uses', 'two', 'encoders', 'for', 'reading', 'from', 'and', 'writing', 'to', 'two', 'external', 'memories', 'for', 'encoding', 'input', 'views', 'the', 'intraview', 'interactions', 'and', 'the', 'longterm', 'dependencies', 'are', 'captured', 'by', 'the', 'use', 'of', 'memories', 'during', 'this', 'encoding', 'process', 'there', 'are', 'two', 'modes', 'of', 'memory', 'accessing', 'in', 'our', 'system', 'latefusion', 'and', 'earlyfusion', 'corresponding', 'to', 'late', 'and', 'early', 'interview', 'interactions', 'in', 'the', 'latefusion', 'mode', 'the', 'two', 'memories', 'are', 'separated', 'containing', 'only', 'viewspecific', 'contents', 'in', 'the', 'earlyfusion', 'mode', 'the', 'two', 'memories', 'share', 'the', 'same', 'addressing', 'space', 'allowing', 'crossmemory', 'accessing', 'in', 'both', 'cases', 'the', 'knowledge', 'from', 'the', 'memories', 'will', 'be', 'combined', 'by', 'a', 'decoder', 'to', 'make', 'predictions', 'over', 'the', 'output', 'space', 'the', 'resulting', 'dual', 'memory', 'neural', 'computer', 'is', 'demonstrated', 'on', 'a', 'comprehensive', 'set', 'of', 'experiments', 'including', 'a', 'synthetic', 'task', 'of', 'summing', 'two', 'sequences', 'and', 'the', 'tasks', 'of', 'drug', 'prescription', 'and', 'disease', 'progression', 'in', 'healthcare', 'the', 'results', 'demonstrate', 'competitive', 'performance', 'over', 'both', 'traditional', 'algorithms', 'and', 'deep', 'learning', 'methods', 'designed', 'for', 'multiview', 'problems']] | [-0.11079789903359832, 0.07807884374752003, -0.06190410563053943, 0.07019764774928364, -0.07516797182378704, -0.1759732796064647, 0.051694314159922886, 0.43216723655522976, -0.29840615456622027, -0.31997658648416055, 0.07685979937350904, -0.2862657942932856, -0.15355811133351246, 0.18965323726728525, -0.07822318178498083, 0.03521264563918252, 0.10577048071233246, 0.043928385428713496, -0.04510194846726437, -0.29450835127661573, 0.2838110778792287, 0.004727293809318561, 0.30976964350513836, -0.022105967673404073, 0.11960823942003858, 0.02783868096755921, -0.0685106866725686, -0.022063472190935768, -0.029292661179439433, 0.14918327714851196, 0.3098949038001053, 0.1973690802848001, 0.3034377226830219, -0.4706974021758436, -0.20851513565328247, 0.055553567650753796, 0.12916497128403368, 0.11540986452665594, -0.00934412250892449, -0.294028874564295, 0.058225150088589916, -0.16082780493781212, 0.04109597799833864, -0.11713079301019509, -0.007880766731600656, -0.004637522417599232, -0.28290749618274813, 0.002564178316081072, 0.06428006921487395, 0.05985297576127643, -0.08443310658158562, -0.08279621771577729, 0.027015847517220578, 0.2009849842374765, 0.02318540598557943, 0.017645205015233607, 0.09852586534247233, -0.1777609991560759, -0.17507524974644184, 0.3436853526401575, -0.03393206228308069, -0.17681751669496643, 0.21081704525621953, -0.06659799488584718, -0.1257719382195285, 0.08664962311633173, 0.21330736869303682, 0.0891093716555689, -0.17982104195161136, 0.013713989241902405, -0.0014728332688618037, 0.1823978651944479, 0.05921468144838905, 0.053798217511804844, 0.21326380754773575, 0.21731054716575374, -0.03883930767861549, 0.12937756154860836, -0.09068959434524812, -0.13133931412583613, -0.23186276277044304, -0.11598986642396387, -0.16283926967379456, -0.030935125235676725, -0.08397337955722362, -0.11132948614087784, 0.39944570721234884, 0.19872554882183774, 0.19208722444320167, 0.08482866405918482, 0.34218027872136897, -0.020682824219706904, 0.12282014415756783, 0.0998044346846722, 0.17603505969681363, 0.05320580914216138, 0.15255473404195746, -0.18007600032487298, 0.08301130507607013, 0.032494033137077674] |
1,802.00663 | Stochastic model for quantum spin dynamics in magnetic nanostructures | We develop a numerical model that reproduces the thermal equilibrium and the
spin transfer mechanisms in magnetic nanomaterials. We analyze the coherent
two-particle spin exchange interaction and the electron-electron collisions.
Our study is based on a quantum atomistic approach and the particle dynamics is
performed by using a Monte Carlo technique. The coherent quantum evolution of
the atoms is interrupted by instantaneous collisions with itinerant electrons.
The collision processes are associated to the quantum collapse of the local
atomic wave function. We show that particle-particle interactions beyond the
molecular field approximation can be included in this framework. Our model is
able to reproduce the thermal equilibrium and strongly out-of-equilibrium
phenomena such as the ultrafast dynamics of the magnetization in nanomatrials.
| cond-mat.mes-hall | we develop a numerical model that reproduces the thermal equilibrium and the spin transfer mechanisms in magnetic nanomaterials we analyze the coherent twoparticle spin exchange interaction and the electronelectron collisions our study is based on a quantum atomistic approach and the particle dynamics is performed by using a monte carlo technique the coherent quantum evolution of the atoms is interrupted by instantaneous collisions with itinerant electrons the collision processes are associated to the quantum collapse of the local atomic wave function we show that particleparticle interactions beyond the molecular field approximation can be included in this framework our model is able to reproduce the thermal equilibrium and strongly outofequilibrium phenomena such as the ultrafast dynamics of the magnetization in nanomatrials | [['we', 'develop', 'a', 'numerical', 'model', 'that', 'reproduces', 'the', 'thermal', 'equilibrium', 'and', 'the', 'spin', 'transfer', 'mechanisms', 'in', 'magnetic', 'nanomaterials', 'we', 'analyze', 'the', 'coherent', 'twoparticle', 'spin', 'exchange', 'interaction', 'and', 'the', 'electronelectron', 'collisions', 'our', 'study', 'is', 'based', 'on', 'a', 'quantum', 'atomistic', 'approach', 'and', 'the', 'particle', 'dynamics', 'is', 'performed', 'by', 'using', 'a', 'monte', 'carlo', 'technique', 'the', 'coherent', 'quantum', 'evolution', 'of', 'the', 'atoms', 'is', 'interrupted', 'by', 'instantaneous', 'collisions', 'with', 'itinerant', 'electrons', 'the', 'collision', 'processes', 'are', 'associated', 'to', 'the', 'quantum', 'collapse', 'of', 'the', 'local', 'atomic', 'wave', 'function', 'we', 'show', 'that', 'particleparticle', 'interactions', 'beyond', 'the', 'molecular', 'field', 'approximation', 'can', 'be', 'included', 'in', 'this', 'framework', 'our', 'model', 'is', 'able', 'to', 'reproduce', 'the', 'thermal', 'equilibrium', 'and', 'strongly', 'outofequilibrium', 'phenomena', 'such', 'as', 'the', 'ultrafast', 'dynamics', 'of', 'the', 'magnetization', 'in', 'nanomatrials']] | [-0.12674978399109252, 0.1992985443251223, -0.13758008199706753, 0.1149489289852047, 0.030659854779912142, -0.08768281900957853, 0.0057545016038411554, 0.37813217244541447, -0.285490513129645, -0.2580321626972501, -0.010661171470424394, -0.28768692303355, -0.1327605469408763, 0.1676363992444122, 0.11051003265922435, 0.04115826926123695, 0.059518340692323236, -0.046888538784965746, -0.033957938323220034, -0.17381124800078945, 0.2896047973312719, 0.0855035263164059, 0.246398737200168, 0.09813300785491195, 0.09241135480242367, 0.061194388618489276, 0.05041455052706938, 0.009583192760077845, -0.14651317183506, 0.07913707244892784, 0.2119166022230198, -0.0057277375433061805, 0.22615310873742364, -0.5084241722561732, -0.2356381454199803, 0.040164613211918776, 0.13560148421332568, 0.19716886604721306, -0.05563987087861424, -0.26601085942551617, 0.016212732675915754, -0.20472994445971832, -0.1308603937651555, -0.11747069361603998, -0.04731982185196194, 0.060582708729775385, -0.2755321420322196, 0.11761066105467181, 0.04900022563250626, 0.04185534331227551, -0.05339954831410481, -0.024097696956278395, -0.030092846766552505, 0.07102164368638221, -0.011523196606274632, 0.03196366805144969, 0.22164243345047122, -0.12548827183503314, -0.17352187067677244, 0.39307762777918026, -0.05784079254636181, -0.16370454044159533, 0.2270562359926236, -0.15334608092387558, -0.05960770669009756, 0.14488940291544972, 0.1483640800457166, 0.11329784615262717, -0.19101126680635855, 0.08665139327107482, -0.010260763914522934, 0.1455597497499352, -0.04312033585405776, 0.036071025789911004, 0.2119804269227223, 0.19739394497611568, -0.0009986446082529401, 0.14982583420644632, -0.11432772344457642, -0.19532027123730725, -0.2844527011361568, -0.13693231521878674, -0.22549501906673447, 0.0812895213171376, -0.04729259700833295, -0.13390482808150225, 0.38843699815847416, 0.2098913285294313, 0.15298614231478266, -0.03226907262109032, 0.3012872619570053, 0.14124797641186185, 0.015767974942382582, 0.06067961136646131, 0.26589787796828424, 0.1713399638797493, 0.09676974199853149, -0.36113029449176387, 0.07881527517221774, 0.044089644331438076] |
1,802.00664 | Convolutional neural network-based regression for depth prediction in
digital holography | Digital holography enables us to reconstruct objects in three-dimensional
space from holograms captured by an imaging device. For the reconstruction, we
need to know the depth position of the recoded object in advance. In this
study, we propose depth prediction using convolutional neural network
(CNN)-based regression. In the previous researches, the depth of an object was
estimated through reconstructed images at different depth positions from a
hologram using a certain metric that indicates the most focused depth position;
however, such a depth search is time-consuming. The CNN of the proposed method
can directly predict the depth position with millimeter precision from
holograms.
| cs.CV eess.IV | digital holography enables us to reconstruct objects in threedimensional space from holograms captured by an imaging device for the reconstruction we need to know the depth position of the recoded object in advance in this study we propose depth prediction using convolutional neural network cnnbased regression in the previous researches the depth of an object was estimated through reconstructed images at different depth positions from a hologram using a certain metric that indicates the most focused depth position however such a depth search is timeconsuming the cnn of the proposed method can directly predict the depth position with millimeter precision from holograms | [['digital', 'holography', 'enables', 'us', 'to', 'reconstruct', 'objects', 'in', 'threedimensional', 'space', 'from', 'holograms', 'captured', 'by', 'an', 'imaging', 'device', 'for', 'the', 'reconstruction', 'we', 'need', 'to', 'know', 'the', 'depth', 'position', 'of', 'the', 'recoded', 'object', 'in', 'advance', 'in', 'this', 'study', 'we', 'propose', 'depth', 'prediction', 'using', 'convolutional', 'neural', 'network', 'cnnbased', 'regression', 'in', 'the', 'previous', 'researches', 'the', 'depth', 'of', 'an', 'object', 'was', 'estimated', 'through', 'reconstructed', 'images', 'at', 'different', 'depth', 'positions', 'from', 'a', 'hologram', 'using', 'a', 'certain', 'metric', 'that', 'indicates', 'the', 'most', 'focused', 'depth', 'position', 'however', 'such', 'a', 'depth', 'search', 'is', 'timeconsuming', 'the', 'cnn', 'of', 'the', 'proposed', 'method', 'can', 'directly', 'predict', 'the', 'depth', 'position', 'with', 'millimeter', 'precision', 'from', 'holograms']] | [-0.013681169192982363, 0.013522193687522839, -0.08363439551983759, 0.0030609292877545836, -0.08339621880840437, -0.13557685876046033, -0.009374913266476463, 0.467294290515722, -0.2953406765876685, -0.3423338717251432, 0.07370379150333796, -0.25970480444055855, -0.1764409469495363, 0.2038745326149807, -0.154414709826347, 0.1229230936116758, 0.10581692394015252, 0.037777346248428025, -0.10047723218917336, -0.20321445915774972, 0.2737751760173078, 0.07150016067659154, 0.3201221651671564, -0.023249702434530298, 0.12499230412090671, 0.057745196267633754, -0.08699793884914149, 0.017786827859156036, -0.10166319289654734, 0.1618624239082576, 0.2614368473444426, 0.1873750674593098, 0.20474269067612932, -0.44425740905617384, -0.2579215080888175, 0.059618890705500166, 0.15461079171840467, 0.14413971783063723, -0.02708505990221074, -0.3598680365282823, 0.057336781959177234, -0.09203661508018188, -0.06390644231007672, -0.037295070937925986, -0.0057205618119469896, -0.04078436932782186, -0.23988922628774947, 0.022968523430309314, -0.02157407625596605, 0.08970371410068051, -0.060601254758498105, -0.060607657212006186, 0.01282131279289138, 0.20444963220963439, -0.057385818611924065, 0.10987010024095356, 0.12304705701877966, -0.2403996027800638, -0.09194420916758769, 0.3387089939057535, -0.04381181553517487, -0.20027459526489325, 0.1505126471261867, -0.14205535053385093, -0.07072151813418696, 0.17861637433844746, 0.21257248546188587, 0.1485695336379257, -0.15424921671750352, 0.010848061103994647, -0.05178880165604984, 0.25223698763076363, 0.09560128743303757, -0.006091440721944559, 0.24812989104904382, 0.23156109114414922, 0.015765541360950937, 0.15808434009337433, -0.2790742468308, 0.0393411476831591, -0.21799759892746806, -0.12113252692107185, -0.23772012354696498, -0.014210764887085295, -0.07788150143517437, -0.12622977883838044, 0.397923002352792, 0.2666293973349692, 0.2501948992539124, 0.057713737120103165, 0.39126140741156595, 0.05015178849377359, 0.15427320527241511, 0.041430099009006634, 0.24186042743716754, 0.0385899753423919, 0.1460997900507851, -0.13017580315685265, 0.07477024690175027, 0.09094923325841699] |
1,802.00665 | A novel approach to estimate the Cox model with temporal covariates and
its application to medical cost data | We propose a novel approach to estimate the Cox model with temporal
covariates. Our new approach treats the temporal covariates as arising from a
longitudinal process which is modeled jointly with the event time. Different
from the literature, the longitudinal process in our model is specified as a
bounded variational process and determined by a family of Initial Value
Problems associated with an Ordinary Differential Equation. Our specification
has the advantage that only the observation of the temporal covariates at the
time to event and the time to event itself are required to fit the model, while
it is fine but not necessary to have more longitudinal observations. This fact
makes our approach very useful for many medical outcome datasets, like the New
York State Statewide Planning and Research Cooperative System and the National
Inpatient Sample, where it is important to find the hazard rate of being
discharged given the accumulative cost but only the total cost at the discharge
time is available due to the protection of patient information. Our estimation
procedure is based on maximizing the full information likelihood function. The
resulting estimators are shown to be consistent and asymptotically normally
distributed. Variable selection techniques, like Adaptive LASSO, can be easily
modified and incorporated into our estimation procedure. The oracle property is
verified for the resulting estimator of the regression coefficients.
Simulations and a real example illustrate the practical utility of the proposed
model. Finally, a couple of potential extensions of our approach are discussed.
| stat.ME | we propose a novel approach to estimate the cox model with temporal covariates our new approach treats the temporal covariates as arising from a longitudinal process which is modeled jointly with the event time different from the literature the longitudinal process in our model is specified as a bounded variational process and determined by a family of initial value problems associated with an ordinary differential equation our specification has the advantage that only the observation of the temporal covariates at the time to event and the time to event itself are required to fit the model while it is fine but not necessary to have more longitudinal observations this fact makes our approach very useful for many medical outcome datasets like the new york state statewide planning and research cooperative system and the national inpatient sample where it is important to find the hazard rate of being discharged given the accumulative cost but only the total cost at the discharge time is available due to the protection of patient information our estimation procedure is based on maximizing the full information likelihood function the resulting estimators are shown to be consistent and asymptotically normally distributed variable selection techniques like adaptive lasso can be easily modified and incorporated into our estimation procedure the oracle property is verified for the resulting estimator of the regression coefficients simulations and a real example illustrate the practical utility of the proposed model finally a couple of potential extensions of our approach are discussed | [['we', 'propose', 'a', 'novel', 'approach', 'to', 'estimate', 'the', 'cox', 'model', 'with', 'temporal', 'covariates', 'our', 'new', 'approach', 'treats', 'the', 'temporal', 'covariates', 'as', 'arising', 'from', 'a', 'longitudinal', 'process', 'which', 'is', 'modeled', 'jointly', 'with', 'the', 'event', 'time', 'different', 'from', 'the', 'literature', 'the', 'longitudinal', 'process', 'in', 'our', 'model', 'is', 'specified', 'as', 'a', 'bounded', 'variational', 'process', 'and', 'determined', 'by', 'a', 'family', 'of', 'initial', 'value', 'problems', 'associated', 'with', 'an', 'ordinary', 'differential', 'equation', 'our', 'specification', 'has', 'the', 'advantage', 'that', 'only', 'the', 'observation', 'of', 'the', 'temporal', 'covariates', 'at', 'the', 'time', 'to', 'event', 'and', 'the', 'time', 'to', 'event', 'itself', 'are', 'required', 'to', 'fit', 'the', 'model', 'while', 'it', 'is', 'fine', 'but', 'not', 'necessary', 'to', 'have', 'more', 'longitudinal', 'observations', 'this', 'fact', 'makes', 'our', 'approach', 'very', 'useful', 'for', 'many', 'medical', 'outcome', 'datasets', 'like', 'the', 'new', 'york', 'state', 'statewide', 'planning', 'and', 'research', 'cooperative', 'system', 'and', 'the', 'national', 'inpatient', 'sample', 'where', 'it', 'is', 'important', 'to', 'find', 'the', 'hazard', 'rate', 'of', 'being', 'discharged', 'given', 'the', 'accumulative', 'cost', 'but', 'only', 'the', 'total', 'cost', 'at', 'the', 'discharge', 'time', 'is', 'available', 'due', 'to', 'the', 'protection', 'of', 'patient', 'information', 'our', 'estimation', 'procedure', 'is', 'based', 'on', 'maximizing', 'the', 'full', 'information', 'likelihood', 'function', 'the', 'resulting', 'estimators', 'are', 'shown', 'to', 'be', 'consistent', 'and', 'asymptotically', 'normally', 'distributed', 'variable', 'selection', 'techniques', 'like', 'adaptive', 'lasso', 'can', 'be', 'easily', 'modified', 'and', 'incorporated', 'into', 'our', 'estimation', 'procedure', 'the', 'oracle', 'property', 'is', 'verified', 'for', 'the', 'resulting', 'estimator', 'of', 'the', 'regression', 'coefficients', 'simulations', 'and', 'a', 'real', 'example', 'illustrate', 'the', 'practical', 'utility', 'of', 'the', 'proposed', 'model', 'finally', 'a', 'couple', 'of', 'potential', 'extensions', 'of', 'our', 'approach', 'are', 'discussed']] | [-0.043391373744686906, 0.04154200425711112, -0.10557082332604704, 0.08059923384167736, -0.10277612310521274, -0.15948063811581387, 0.04067555241577086, 0.38629140304439225, -0.2803798217990017, -0.31685333078357614, 0.15060962374163753, -0.26474726837701523, -0.13604403394561917, 0.20299726880347801, -0.08787964606518114, 0.08316309100416629, 0.0883551568597902, 0.052381344136748054, -0.014924268884422175, -0.27301099850241894, 0.2757055403953154, 0.09400954417722217, 0.31118396372884993, 0.013272531744401886, 0.1487120473615991, 0.03526509493902356, -0.06468246438232277, 0.03143066691134789, -0.07911236278646412, 0.10440270823279493, 0.26052425054716405, 0.1676040135360764, 0.3261580050383331, -0.38127382720715386, -0.2321179496757837, 0.08802537630248046, 0.10271808112356887, 0.1058852668836414, -0.013516364302234027, -0.28869241408566354, 0.04878167492273426, -0.170771100685714, -0.09209801095089147, -0.07773034252897508, -0.026559828774464365, 0.004832630030394189, -0.34930583968690715, 0.08836081924731372, 0.036116235473557086, 0.01597437318150512, -0.058247579063707394, -0.11144492408752758, -0.032964232939046614, 0.11094045031557485, 0.08673564917259464, 0.024417265943771884, 0.12871382556674693, -0.08364665018383277, -0.09954710338813316, 0.35154449085394857, -0.026937470175863173, -0.20708367709192516, 0.16652661865393995, -0.11676717781827517, -0.11571142868881645, 0.12248258187477043, 0.20845582910440108, 0.12029313780216552, -0.1941616200386671, 0.04139649312257925, -0.02302143266160599, 0.1575012691191733, -0.008580096885147184, -0.005503502119189272, 0.15884335321960555, 0.19949372778062216, 0.061817866309615686, 0.12001467626145947, -0.10333670890604443, -0.10632492364704729, -0.3065100558335904, -0.13367912380202948, -0.192152479893494, -0.017083363500006613, -0.1060425052266716, -0.16316567752913286, 0.3937418784207178, 0.18773686013823476, 0.1836150624442408, 0.08592851949254285, 0.321313572972108, 0.13850143526045433, 0.08099424489868073, 0.059786551577314315, 0.17840146730033687, 0.06783856755982225, 0.09052061584122056, -0.2120438156171555, 0.15209793185000778, 0.00905587058060714] |
1,802.00666 | Stellar dynamics: rotation, convection, and magnetic fields | Stars are changing entities in a constant evolution during their lives. At
non-secular time scales (from seconds to years) the effect of dynamical
processes such as convection, rotation, and magnetic fields can modify the
stellar oscillations. Convection excites acoustic modes in solar-like stars,
while rotation and magnetic fields can perturb the oscillation frequencies
lifting the degeneracy in the azimuthal component m of the eigenfrequencies.
Moreover, the interaction between rotation, convection, and magnetic fields can
produce magnetic dynamos, which sometimes yield to regular magnetic activity
cycles. In this chapter we review how stellar dynamics can be studied and
explain what long-term seismic observations can bring to the understanding of
this field. Thus, we show how we can study some properties of the convective
time scales operating in a star like the Sun. We also compare the stratified
information we can obtain on the internal (radial) differential rotation from
main sequence solar-like stars, to the Sun, and to more evolved sub giants, and
giants. We complement this information on the internal rotation with the
determination of the surface (latitudinal differential) rotation obtained
directly from the light curves. Indeed, when stars are active there can be
spots on their surfaces dimming the light emitted. When the star rotates, the
emitted light will be modulated by the presence of these spots with a period
corresponding to the rotation rate at the active latitudes (where the spots
develop). We conclude this chapter by discussing the seismology of fast
rotating stars and, from a theoretical point of view, what are the current
challenges to infer properties of the internal structure and dynamics of
intermediate- and high-mass stars.
| astro-ph.SR | stars are changing entities in a constant evolution during their lives at nonsecular time scales from seconds to years the effect of dynamical processes such as convection rotation and magnetic fields can modify the stellar oscillations convection excites acoustic modes in solarlike stars while rotation and magnetic fields can perturb the oscillation frequencies lifting the degeneracy in the azimuthal component m of the eigenfrequencies moreover the interaction between rotation convection and magnetic fields can produce magnetic dynamos which sometimes yield to regular magnetic activity cycles in this chapter we review how stellar dynamics can be studied and explain what longterm seismic observations can bring to the understanding of this field thus we show how we can study some properties of the convective time scales operating in a star like the sun we also compare the stratified information we can obtain on the internal radial differential rotation from main sequence solarlike stars to the sun and to more evolved sub giants and giants we complement this information on the internal rotation with the determination of the surface latitudinal differential rotation obtained directly from the light curves indeed when stars are active there can be spots on their surfaces dimming the light emitted when the star rotates the emitted light will be modulated by the presence of these spots with a period corresponding to the rotation rate at the active latitudes where the spots develop we conclude this chapter by discussing the seismology of fast rotating stars and from a theoretical point of view what are the current challenges to infer properties of the internal structure and dynamics of intermediate and highmass stars | [['stars', 'are', 'changing', 'entities', 'in', 'a', 'constant', 'evolution', 'during', 'their', 'lives', 'at', 'nonsecular', 'time', 'scales', 'from', 'seconds', 'to', 'years', 'the', 'effect', 'of', 'dynamical', 'processes', 'such', 'as', 'convection', 'rotation', 'and', 'magnetic', 'fields', 'can', 'modify', 'the', 'stellar', 'oscillations', 'convection', 'excites', 'acoustic', 'modes', 'in', 'solarlike', 'stars', 'while', 'rotation', 'and', 'magnetic', 'fields', 'can', 'perturb', 'the', 'oscillation', 'frequencies', 'lifting', 'the', 'degeneracy', 'in', 'the', 'azimuthal', 'component', 'm', 'of', 'the', 'eigenfrequencies', 'moreover', 'the', 'interaction', 'between', 'rotation', 'convection', 'and', 'magnetic', 'fields', 'can', 'produce', 'magnetic', 'dynamos', 'which', 'sometimes', 'yield', 'to', 'regular', 'magnetic', 'activity', 'cycles', 'in', 'this', 'chapter', 'we', 'review', 'how', 'stellar', 'dynamics', 'can', 'be', 'studied', 'and', 'explain', 'what', 'longterm', 'seismic', 'observations', 'can', 'bring', 'to', 'the', 'understanding', 'of', 'this', 'field', 'thus', 'we', 'show', 'how', 'we', 'can', 'study', 'some', 'properties', 'of', 'the', 'convective', 'time', 'scales', 'operating', 'in', 'a', 'star', 'like', 'the', 'sun', 'we', 'also', 'compare', 'the', 'stratified', 'information', 'we', 'can', 'obtain', 'on', 'the', 'internal', 'radial', 'differential', 'rotation', 'from', 'main', 'sequence', 'solarlike', 'stars', 'to', 'the', 'sun', 'and', 'to', 'more', 'evolved', 'sub', 'giants', 'and', 'giants', 'we', 'complement', 'this', 'information', 'on', 'the', 'internal', 'rotation', 'with', 'the', 'determination', 'of', 'the', 'surface', 'latitudinal', 'differential', 'rotation', 'obtained', 'directly', 'from', 'the', 'light', 'curves', 'indeed', 'when', 'stars', 'are', 'active', 'there', 'can', 'be', 'spots', 'on', 'their', 'surfaces', 'dimming', 'the', 'light', 'emitted', 'when', 'the', 'star', 'rotates', 'the', 'emitted', 'light', 'will', 'be', 'modulated', 'by', 'the', 'presence', 'of', 'these', 'spots', 'with', 'a', 'period', 'corresponding', 'to', 'the', 'rotation', 'rate', 'at', 'the', 'active', 'latitudes', 'where', 'the', 'spots', 'develop', 'we', 'conclude', 'this', 'chapter', 'by', 'discussing', 'the', 'seismology', 'of', 'fast', 'rotating', 'stars', 'and', 'from', 'a', 'theoretical', 'point', 'of', 'view', 'what', 'are', 'the', 'current', 'challenges', 'to', 'infer', 'properties', 'of', 'the', 'internal', 'structure', 'and', 'dynamics', 'of', 'intermediate', 'and', 'highmass', 'stars']] | [-0.12880442234751086, 0.2389684385376058, -0.07892670038697908, 0.09316353244785171, -0.1275339267608397, -0.01797551161229844, 0.04319213251918348, 0.36815190866479575, -0.27621224006411116, -0.35965014792672906, 0.08900606585365833, -0.24524456270664546, -0.1066964364256641, 0.2210647285412447, -0.07035977492019589, -0.04041858288378719, 0.08265155421336254, 0.02696096215644556, -0.04855792867225969, -0.21307752466574997, 0.31218975248430403, 0.040251333694355185, 0.1749151062969517, -0.04696382370406274, 0.02648813821155427, -0.10331127636016062, -0.03359000227722078, -0.01081167304728565, -0.13410324158325895, 0.059276458527205506, 0.20864993861358358, 0.11239787681729316, 0.18758013981181398, -0.46066570130427714, -0.24024640999191416, 0.04630690129264172, 0.1878190674849982, 0.11056387287562858, -0.04883666989348212, -0.25681347940389904, 0.03972433856516609, -0.09165801638367885, -0.16891785477961643, -0.04706440051902443, 0.04808865641406995, 0.05978385743455673, -0.2350916397765131, 0.07193056362192662, 0.08164262712571849, 0.13166026246125684, -0.09636985274062689, -0.06537801912312166, -0.09712407959460168, 0.1405270897048333, 0.09747497408867323, 0.04256613029646464, 0.16800328660618885, -0.12302434928131005, -0.04083561627761327, 0.3750059407520558, -0.11230648314877588, -0.11213823855507472, 0.1926094181509173, -0.24247618502768864, -0.10808312053692516, 0.10748541520434222, 0.21421562662310348, 0.1426485147631325, -0.1201413156681847, -0.014263673993282886, 0.010758457946800713, 0.16498221718069128, 0.09154118946646048, 0.03167706935724924, 0.3332774059853871, 0.14582676174998888, 0.030947435043264193, 0.0830584456684494, -0.2025301535055385, -0.07474628942365659, -0.23561796814725627, -0.09239846391850787, -0.07709012311823989, 0.07252285349169038, -0.07657872476331276, -0.11850983756456895, 0.4191784502792763, 0.13874709913747668, 0.18992179122536934, -0.008561162268175878, 0.31612569970212795, 0.10009230596633677, 0.08139026869068866, 0.12605823182270645, 0.31757247217596213, 0.2128690588030263, 0.1347109534755363, -0.293946616824139, 0.04821363320003686, 0.006700118261344758] |
1,802.00667 | Bayesian study of relativistic open and hidden charm in anisotropic
lattice QCD | We present the first combined study of correlators and spectral properties of
charmonium and open-charm-mesons at finite temperature using a fully
relativistic lattice QCD approach. The QCD medium is captured by second
generation anisotropic 24^3xN_t lattices from the FASTSUM collaboration,
including 2+1 flavors of clover discretized quarks with m_pi~380 MeV. Two
Bayesian methods are deployed to reconstruct the spectral functions, the recent
BR method as well as the Maximum Entropy Method with Fourier basis. We take
particular care to disentangle genuine in-medium effects from method artifacts
with the help of the reconstructed correlator. Consistent with the direct
inspection of correlators, we observe no significant in-medium modification for
J/Psi and eta_c around the crossover, while the chi_c states on the other hand
show clear changes around the transition. At the highest temperature, T=352
MeV, J/Psi and eta_c also exhibit discernible changes compared to the vacuum.
For D mesons around $T_c$, no significant modifications are observed, but we
find clear indications that no bound state survives at the highest temperature
of T=352 MeV. Above T_c we discover a significant difference between D and D*
mesons, the latter being much more strongly affected by the medium.
| hep-lat hep-ph nucl-th | we present the first combined study of correlators and spectral properties of charmonium and opencharmmesons at finite temperature using a fully relativistic lattice qcd approach the qcd medium is captured by second generation anisotropic 243xn_t lattices from the fastsum collaboration including 21 flavors of clover discretized quarks with m_pi380 mev two bayesian methods are deployed to reconstruct the spectral functions the recent br method as well as the maximum entropy method with fourier basis we take particular care to disentangle genuine inmedium effects from method artifacts with the help of the reconstructed correlator consistent with the direct inspection of correlators we observe no significant inmedium modification for jpsi and eta_c around the crossover while the chi_c states on the other hand show clear changes around the transition at the highest temperature t352 mev jpsi and eta_c also exhibit discernible changes compared to the vacuum for d mesons around t_c no significant modifications are observed but we find clear indications that no bound state survives at the highest temperature of t352 mev above t_c we discover a significant difference between d and d mesons the latter being much more strongly affected by the medium | [['we', 'present', 'the', 'first', 'combined', 'study', 'of', 'correlators', 'and', 'spectral', 'properties', 'of', 'charmonium', 'and', 'opencharmmesons', 'at', 'finite', 'temperature', 'using', 'a', 'fully', 'relativistic', 'lattice', 'qcd', 'approach', 'the', 'qcd', 'medium', 'is', 'captured', 'by', 'second', 'generation', 'anisotropic', '243xn_t', 'lattices', 'from', 'the', 'fastsum', 'collaboration', 'including', '21', 'flavors', 'of', 'clover', 'discretized', 'quarks', 'with', 'm_pi380', 'mev', 'two', 'bayesian', 'methods', 'are', 'deployed', 'to', 'reconstruct', 'the', 'spectral', 'functions', 'the', 'recent', 'br', 'method', 'as', 'well', 'as', 'the', 'maximum', 'entropy', 'method', 'with', 'fourier', 'basis', 'we', 'take', 'particular', 'care', 'to', 'disentangle', 'genuine', 'inmedium', 'effects', 'from', 'method', 'artifacts', 'with', 'the', 'help', 'of', 'the', 'reconstructed', 'correlator', 'consistent', 'with', 'the', 'direct', 'inspection', 'of', 'correlators', 'we', 'observe', 'no', 'significant', 'inmedium', 'modification', 'for', 'jpsi', 'and', 'eta_c', 'around', 'the', 'crossover', 'while', 'the', 'chi_c', 'states', 'on', 'the', 'other', 'hand', 'show', 'clear', 'changes', 'around', 'the', 'transition', 'at', 'the', 'highest', 'temperature', 't352', 'mev', 'jpsi', 'and', 'eta_c', 'also', 'exhibit', 'discernible', 'changes', 'compared', 'to', 'the', 'vacuum', 'for', 'd', 'mesons', 'around', 't_c', 'no', 'significant', 'modifications', 'are', 'observed', 'but', 'we', 'find', 'clear', 'indications', 'that', 'no', 'bound', 'state', 'survives', 'at', 'the', 'highest', 'temperature', 'of', 't352', 'mev', 'above', 't_c', 'we', 'discover', 'a', 'significant', 'difference', 'between', 'd', 'and', 'd', 'mesons', 'the', 'latter', 'being', 'much', 'more', 'strongly', 'affected', 'by', 'the', 'medium']] | [-0.055230293322002834, 0.21084574378031168, -0.12281932032597746, 0.10155256341540929, -0.02459771820809073, -0.126236927106065, 0.07440142524478204, 0.39756549479182257, -0.17028185731621132, -0.25827780727574484, 0.0017311735910938142, -0.3594640822761613, -0.05296533425868628, 0.12624027588692038, 0.06720940161872893, 0.0682603922509093, 0.08500961873165154, 0.03555176111354314, -0.13795231613503928, -0.17464682298397863, 0.32792661134698525, 0.026185200481546766, 0.2513903974347371, 0.1697868464992659, 0.033822836371713336, -0.012254021697717303, -0.04163347262216663, 0.004900830948943312, -0.11660937417164337, 0.0316928469064612, 0.21047334309959626, 0.02459598332643509, 0.1693884624832827, -0.3475302986409317, -0.20619171470938685, 0.12646155283127494, 0.12950906051171726, 0.09803421205458321, -0.023568134229556545, -0.3101537804914381, 0.10624375918671425, -0.16426017906447438, -0.13431517122978434, -0.11836097170995112, -0.014257299671682747, -0.06380176858417938, -0.25324913123721615, 0.13515880953088932, -0.02860300252375074, 0.07137100121620646, -0.044766340443141206, -0.22113074555725573, -0.042721332758021084, 0.06609106175551945, 0.06752921759440103, 0.11493178613934706, 0.12643783734498318, -0.13831563006796715, -0.12676789177621298, 0.40511957209735633, -0.08683154008232374, -0.09414804034787132, 0.166746430687589, -0.20967115929716842, -0.12330980630631143, 0.17708295245996697, 0.17499063655417016, 0.08153670752282313, -0.1274534406987554, 0.029959359889580036, -0.0017471595486487322, 0.21501853367861143, 0.09342169925258396, 0.08010278038118292, 0.19314607401239745, 0.14583964051029824, 0.002061033719268806, 0.10426469820463644, -0.07136311848831185, -0.07803226818895324, -0.31816132393408014, -0.09660220299345848, -0.16383576062210697, 0.027690504818778248, -0.10899659266153244, -0.12237146085170296, 0.3762104490454844, 0.12842955781107254, 0.22927411806155393, 0.002479990462505041, 0.2761772040480827, 0.11006526388054555, 0.08563625413250733, 0.12413042571217298, 0.27425077313834684, 0.1633196850171055, 0.15424696181125522, -0.30671623183251484, 0.008607102299797685, 0.018873509357713085] |
1,802.00668 | A Renormalization Group Procedure for Fiber Bundle Models | We introduce two versions of a renormalization group scheme for the equal
load sharing fiber bundle model. The renormalization group is based on
formulating the fiber bundle model in the language of damage mechanics. A
central concept is the work performed on the fiber bundle to produce a given
damage. The renormalization group conserves this work. In the first version of
the renormalization group, we take advantage of ordering the strength of the
individual fibers. This procedure, which is the simpler one, gives EXACT
results -but cannot be generalized to other fiber bundle models such as the
local load sharing one. The second renormalization group scheme based on the
physical location of the individual fibers may be generalized to other fiber
bundle models.
| cond-mat.soft cond-mat.mtrl-sci cond-mat.stat-mech physics.app-ph | we introduce two versions of a renormalization group scheme for the equal load sharing fiber bundle model the renormalization group is based on formulating the fiber bundle model in the language of damage mechanics a central concept is the work performed on the fiber bundle to produce a given damage the renormalization group conserves this work in the first version of the renormalization group we take advantage of ordering the strength of the individual fibers this procedure which is the simpler one gives exact results but cannot be generalized to other fiber bundle models such as the local load sharing one the second renormalization group scheme based on the physical location of the individual fibers may be generalized to other fiber bundle models | [['we', 'introduce', 'two', 'versions', 'of', 'a', 'renormalization', 'group', 'scheme', 'for', 'the', 'equal', 'load', 'sharing', 'fiber', 'bundle', 'model', 'the', 'renormalization', 'group', 'is', 'based', 'on', 'formulating', 'the', 'fiber', 'bundle', 'model', 'in', 'the', 'language', 'of', 'damage', 'mechanics', 'a', 'central', 'concept', 'is', 'the', 'work', 'performed', 'on', 'the', 'fiber', 'bundle', 'to', 'produce', 'a', 'given', 'damage', 'the', 'renormalization', 'group', 'conserves', 'this', 'work', 'in', 'the', 'first', 'version', 'of', 'the', 'renormalization', 'group', 'we', 'take', 'advantage', 'of', 'ordering', 'the', 'strength', 'of', 'the', 'individual', 'fibers', 'this', 'procedure', 'which', 'is', 'the', 'simpler', 'one', 'gives', 'exact', 'results', 'but', 'can', 'not', 'be', 'generalized', 'to', 'other', 'fiber', 'bundle', 'models', 'such', 'as', 'the', 'local', 'load', 'sharing', 'one', 'the', 'second', 'renormalization', 'group', 'scheme', 'based', 'on', 'the', 'physical', 'location', 'of', 'the', 'individual', 'fibers', 'may', 'be', 'generalized', 'to', 'other', 'fiber', 'bundle', 'models']] | [-0.18214001938242524, 0.055727692497443526, -0.14488719315117887, 0.007480335186213075, -0.12009384115076353, -0.16785297990821663, 0.040340365646707434, 0.40515660077724003, -0.2780397673843489, -0.22483227601755532, 0.08101714262551057, -0.2228384783938377, -0.15492188101333956, 0.16894004094008838, -0.09020600911425126, 0.010449310073689107, 0.034380941696825526, 0.09135472278050598, -0.06740758257106907, -0.23592093490691285, 0.3601622115501443, 0.05830237846032927, 0.35436345398756525, 0.03665864242300872, 0.1126896060267163, 0.04048640496518102, -0.03261504810108172, -0.010719770389128356, -0.0912378177501171, 0.14814305415512213, 0.21332725746851205, 0.052381138148296987, 0.29237783004740076, -0.39918292967242097, -0.249905169130333, 0.12572695530440298, 0.09218488507969831, 0.09880311929924984, 0.017137226242113918, -0.2461181283297558, 0.07431525102020392, -0.21610180365913098, -0.13805186545904424, -0.04628550037535118, -0.059521792967232964, -0.00507124894929509, -0.1976720920694436, -0.003595791719553451, 0.02145578948810937, 0.056379517465229, -0.01877359530114899, -0.036466435964910254, -0.03949988813650224, 0.12349226801175504, 0.030075589025903855, 0.0020635833723410485, 0.2055963362649744, -0.07874095046727528, -0.08488104057182828, 0.45402824980086615, -0.07886102690451569, -0.23720103914045818, 0.09779055803289427, -0.0690900118863811, -0.15521515234779085, 0.1259682754452731, 0.15121166971361927, 0.10414888235109468, -0.08616535158287134, 0.03592887773148475, -0.08912666085656852, 0.15061111532662425, 0.008667724697114599, 0.005570848904279692, 0.11070340514303215, 0.1793369391272145, 0.06985930700959157, 0.07866261291952294, -0.05112624072071706, -0.11121095849892064, -0.3478732123490303, -0.2109266985799261, -0.14835671476471507, 0.07331930249077437, -0.08839047717065701, -0.1277321024700218, 0.44849059518797263, 0.10803934644941511, 0.20435649162578967, 0.07575244868959059, 0.3010963606648147, 0.0996785334287016, 0.1324771042639059, 0.023901231166335843, 0.2208467089390803, 0.14689240999700082, 0.018886117208298418, -0.20581546681393276, 0.005166249691448625, 0.18096086689301075] |
1,802.00669 | Finitistic dimension and Endomorphism algebras of Gorenstein projective
modules | Let $A$ be an Artin algebra, $M$ be a Gorenstein projective $A$-module and $B
=$ End$_A M$, then $M$ is a $A$-$B$-bimodule. We use the restricted flat
dimension of $M_B$ to give a characterization of the homological dimensions of
$A$ and $B$, and obtain the following main results: (1) if $A$ is a CM-finite
algebra with $\cal GP$($A$) = add$_AE$ and fin.dim $A \geq 2,$ then ${\rm
fin.dim}\ B \leq {\rm fin.dim}\ A + {\rm rfd}(M_B) +{\rm pd}_B{\rm Hom}_A(M,
E);$ (2) If $A$ is a CM-finite $n$-Gorenstein algebra with $\cal GP$($A$) =
add$_AE$ and $n \geq 2$, then gl.dim $B \leq n + {\rm pd}_B{\rm Hom}_A(M, E).$
| math.RT | let a be an artin algebra m be a gorenstein projective amodule and b end_a m then m is a abbimodule we use the restricted flat dimension of m_b to give a characterization of the homological dimensions of a and b and obtain the following main results 1 if a is a cmfinite algebra with cal gpa add_ae and findim a geq 2 then rm findim b leq rm findim a rm rfdm_b rm pd_brm hom_am e 2 if a is a cmfinite ngorenstein algebra with cal gpa add_ae and n geq 2 then gldim b leq n rm pd_brm hom_am e | [['let', 'a', 'be', 'an', 'artin', 'algebra', 'm', 'be', 'a', 'gorenstein', 'projective', 'amodule', 'and', 'b', 'end_a', 'm', 'then', 'm', 'is', 'a', 'abbimodule', 'we', 'use', 'the', 'restricted', 'flat', 'dimension', 'of', 'm_b', 'to', 'give', 'a', 'characterization', 'of', 'the', 'homological', 'dimensions', 'of', 'a', 'and', 'b', 'and', 'obtain', 'the', 'following', 'main', 'results', '1', 'if', 'a', 'is', 'a', 'cmfinite', 'algebra', 'with', 'cal', 'gpa', 'add_ae', 'and', 'findim', 'a', 'geq', '2', 'then', 'rm', 'findim', 'b', 'leq', 'rm', 'findim', 'a', 'rm', 'rfdm_b', 'rm', 'pd_brm', 'hom_am', 'e', '2', 'if', 'a', 'is', 'a', 'cmfinite', 'ngorenstein', 'algebra', 'with', 'cal', 'gpa', 'add_ae', 'and', 'n', 'geq', '2', 'then', 'gldim', 'b', 'leq', 'n', 'rm', 'pd_brm', 'hom_am', 'e']] | [-0.18249652574780167, 0.13369667797580345, -0.04172971586306249, -0.012949481737920113, -0.028484723715972837, -0.23772486498058643, -0.02953417488544058, 0.33895623888219556, -0.30080745489366595, -0.21022930467295992, 0.11616669185159187, -0.2742403256055969, -0.045944488301913264, 0.12106380270673864, -0.07922564800428127, -0.09833372288673956, 0.0018740289829551212, 0.13181456934500446, -0.13668343484381673, -0.26181337637926944, 0.28178344915310544, -0.0654594613819994, 0.10894122278137554, 0.02199701437105735, 0.08826142390789364, -0.024028379415031723, 0.08320137989076395, 0.009092303287107698, -0.28168925491752483, 0.07293149002737576, 0.2695702950079595, 0.12192087469031654, 0.21697639253350995, -0.2669350191830627, -0.04718121653422713, 0.2229529173133434, 0.14882485652142155, -0.08590848010874563, 0.03253379663432478, -0.24114438124822193, 0.2556690328994826, -0.19448912921812264, -0.11296549703304966, -0.013711503296289392, 0.22473645580792298, -0.0865274400260019, -0.3879412346975177, 0.02694395201541083, 0.11877453338194599, 0.14081662818188628, -0.012689390730473303, -0.1565893381553632, -0.12438109082480271, -0.024205787313891756, -0.11920279598674707, 0.16683683072226824, 0.05935864777414389, -0.05877035131217331, -0.09109403136416629, 0.38285595428458946, -0.04654626956870479, -0.15322077247284113, 0.10581530693177414, -0.22347819866232013, -0.13615126825708856, 0.09865492412079406, 0.060367426632212534, 0.1973385801038114, 0.029919681149304555, 0.29021578038960033, -0.15525092323177986, 0.18049364573051851, 0.07328810334526083, -0.05835426237273921, 0.0966992405254484, 0.11259669689361447, 0.06838268979442536, 0.035825403917941354, -0.031389177821937106, 0.20735385532300638, -0.39591484997541676, -0.24007582404119995, -0.10346778153732258, 0.2760510339191364, -0.12628477362597296, -0.016766131495035464, 0.26864694964180713, 0.039218278321367435, 0.26737321103091843, 0.1227461090311408, 0.16234576849827684, 0.03198390048477919, 0.023985203633445404, 0.14767651494732628, 0.07701498166137245, 0.2747081797369706, -0.020415493417330968, -0.1177875447858085, -0.12246326669069227, 0.1183022698087077] |
1,802.0067 | Coherent two-mode dynamics of a nanowire force sensor | Classically coherent dynamics analogous to those of quantum two-level systems
are studied in the setting of force sensing. We demonstrate quantitative
control over the coupling between two orthogonal mechanical modes of a nanowire
cantilever, through measurement of avoided crossings as we deterministically
position the nanowire inside an electric field. Furthermore, we demonstrate
Rabi oscillations between the two mechanical modes in the strong coupling
regime. These results give prospects of implementing coherent two-mode control
techniques for force sensing signal enhancement.
| cond-mat.mes-hall physics.app-ph | classically coherent dynamics analogous to those of quantum twolevel systems are studied in the setting of force sensing we demonstrate quantitative control over the coupling between two orthogonal mechanical modes of a nanowire cantilever through measurement of avoided crossings as we deterministically position the nanowire inside an electric field furthermore we demonstrate rabi oscillations between the two mechanical modes in the strong coupling regime these results give prospects of implementing coherent twomode control techniques for force sensing signal enhancement | [['classically', 'coherent', 'dynamics', 'analogous', 'to', 'those', 'of', 'quantum', 'twolevel', 'systems', 'are', 'studied', 'in', 'the', 'setting', 'of', 'force', 'sensing', 'we', 'demonstrate', 'quantitative', 'control', 'over', 'the', 'coupling', 'between', 'two', 'orthogonal', 'mechanical', 'modes', 'of', 'a', 'nanowire', 'cantilever', 'through', 'measurement', 'of', 'avoided', 'crossings', 'as', 'we', 'deterministically', 'position', 'the', 'nanowire', 'inside', 'an', 'electric', 'field', 'furthermore', 'we', 'demonstrate', 'rabi', 'oscillations', 'between', 'the', 'two', 'mechanical', 'modes', 'in', 'the', 'strong', 'coupling', 'regime', 'these', 'results', 'give', 'prospects', 'of', 'implementing', 'coherent', 'twomode', 'control', 'techniques', 'for', 'force', 'sensing', 'signal', 'enhancement']] | [-0.23985396826616193, 0.21213470683657842, -0.044896206229076356, 0.0034566588664450976, 0.0002647127036618281, -0.1976815232052173, 0.04417397522461848, 0.42557047906367085, -0.28493808389087266, -0.2880210097454771, -0.013752054396568786, -0.22685131254971405, -0.16047736468335874, 0.2713505156762615, -0.01031683562205562, 0.08308079412731613, 0.05746138648754811, -0.008924452086934183, -0.004258523294348506, -0.1245703807342326, 0.2654151483203131, 0.005260846452327752, 0.3507997503716357, 0.01963705088518843, 0.0873856369989535, 0.049794866226000496, 0.10125741204600545, -0.014950881467519116, -0.11100054590515586, 0.07839718555347829, 0.2545945960556782, 0.015537009662889604, 0.27662051909992214, -0.4887575175011931, -0.1593908994765127, 0.08073715415276304, 0.1709449773778125, 0.19833320563753384, -0.06554130977609113, -0.3262293936000972, -0.022318619497922024, -0.11747829412121939, -0.10608055076526501, -0.10111071247183069, -0.05317635900087513, 0.01652390389597114, -0.25136223826793175, 0.06949247960944342, 0.038611142088576585, 0.08225868673570737, -0.049057302519066044, -0.004781202310725717, 0.058531160136283955, 0.11014032306715468, -0.024348475663816628, -0.06531994318872501, 0.23174702354317792, -0.13063153649586004, -0.20117295581753117, 0.3265782885159118, -0.11169344077146129, -0.1785246944526517, 0.15837809716976142, -0.14721227489128896, -0.02294627510459174, 0.09764993961759005, 0.14709647366470552, 0.06527957757728622, -0.132010542068489, 0.04815647303114964, 0.036519565041872516, 0.16573001425772246, 0.10808277617597693, 0.12536742078446889, 0.2080654792511199, 0.1392616280413504, 0.07568716544280701, 0.1827928200393585, -0.09192608966480327, -0.113404546286675, -0.2895450995221168, -0.11476947153370262, -0.17017856520848185, 0.05849052958567686, -0.06656864178190126, -0.14807962346822023, 0.40877190349576403, 0.13715216414885054, 0.1432271134226194, -0.02544383518103086, 0.34817897495401057, 0.11656188984737507, 0.017796885322402173, -0.021381937097050722, 0.38672426202234256, 0.23084291684901034, 0.03504150180305248, -0.34207148723675623, -0.05985259254687006, -0.026631361262613458] |
1,802.00671 | Handwritten Isolated Bangla Compound Character Recognition: a new
benchmark using a novel deep learning approach | In this work, a novel deep learning technique for the recognition of
handwritten Bangla isolated compound character is presented and a new benchmark
of recognition accuracy on the CMATERdb 3.1.3.3 dataset is reported. Greedy
layer wise training of Deep Neural Network has helped to make significant
strides in various pattern recognition problems. We employ layerwise training
to Deep Convolutional Neural Networks (DCNN) in a supervised fashion and
augment the training process with the RMSProp algorithm to achieve faster
convergence. We compare results with those obtained from standard shallow
learning methods with predefined features, as well as standard DCNNs.
Supervised layerwise trained DCNNs are found to outperform standard shallow
learning models such as Support Vector Machines as well as regular DCNNs of
similar architecture by achieving error rate of 9.67% thereby setting a new
benchmark on the CMATERdb 3.1.3.3 with recognition accuracy of 90.33%,
representing an improvement of nearly 10%.
| cs.CV | in this work a novel deep learning technique for the recognition of handwritten bangla isolated compound character is presented and a new benchmark of recognition accuracy on the cmaterdb 3133 dataset is reported greedy layer wise training of deep neural network has helped to make significant strides in various pattern recognition problems we employ layerwise training to deep convolutional neural networks dcnn in a supervised fashion and augment the training process with the rmsprop algorithm to achieve faster convergence we compare results with those obtained from standard shallow learning methods with predefined features as well as standard dcnns supervised layerwise trained dcnns are found to outperform standard shallow learning models such as support vector machines as well as regular dcnns of similar architecture by achieving error rate of 967 thereby setting a new benchmark on the cmaterdb 3133 with recognition accuracy of 9033 representing an improvement of nearly 10 | [['in', 'this', 'work', 'a', 'novel', 'deep', 'learning', 'technique', 'for', 'the', 'recognition', 'of', 'handwritten', 'bangla', 'isolated', 'compound', 'character', 'is', 'presented', 'and', 'a', 'new', 'benchmark', 'of', 'recognition', 'accuracy', 'on', 'the', 'cmaterdb', '3133', 'dataset', 'is', 'reported', 'greedy', 'layer', 'wise', 'training', 'of', 'deep', 'neural', 'network', 'has', 'helped', 'to', 'make', 'significant', 'strides', 'in', 'various', 'pattern', 'recognition', 'problems', 'we', 'employ', 'layerwise', 'training', 'to', 'deep', 'convolutional', 'neural', 'networks', 'dcnn', 'in', 'a', 'supervised', 'fashion', 'and', 'augment', 'the', 'training', 'process', 'with', 'the', 'rmsprop', 'algorithm', 'to', 'achieve', 'faster', 'convergence', 'we', 'compare', 'results', 'with', 'those', 'obtained', 'from', 'standard', 'shallow', 'learning', 'methods', 'with', 'predefined', 'features', 'as', 'well', 'as', 'standard', 'dcnns', 'supervised', 'layerwise', 'trained', 'dcnns', 'are', 'found', 'to', 'outperform', 'standard', 'shallow', 'learning', 'models', 'such', 'as', 'support', 'vector', 'machines', 'as', 'well', 'as', 'regular', 'dcnns', 'of', 'similar', 'architecture', 'by', 'achieving', 'error', 'rate', 'of', '967', 'thereby', 'setting', 'a', 'new', 'benchmark', 'on', 'the', 'cmaterdb', '3133', 'with', 'recognition', 'accuracy', 'of', '9033', 'representing', 'an', 'improvement', 'of', 'nearly', '10']] | [0.008496447275673983, -0.051500096178715954, -0.029655428564225966, 0.05596163641040898, -0.09924497677875846, -0.23163070617206144, 0.03043701660338064, 0.48996146873339713, -0.2594320229254663, -0.34142149734817095, 0.042269611031898364, -0.2662458360685823, -0.1950938221810998, 0.22921446570189008, -0.1486004181550003, 0.16236510324673165, 0.18358413865883527, 0.07589446940778086, -0.09250152031359757, -0.3561317871555986, 0.2547669010799403, 0.06389748532072666, 0.371862345687645, -0.026540267412494493, 0.13937895498535402, -0.09094397799618192, 0.012285180421133569, -0.05279557448858708, -0.027921599401989263, 0.18635557447372617, 0.30421020639482627, 0.1748727519258907, 0.3266942618639777, -0.3740060316440149, -0.23609894857860653, 0.071550866663956, 0.17123950178572445, 0.1254532191927401, -0.0295079740267497, -0.362195070976729, 0.12287703573613133, -0.17574652922558504, 0.03670195095403583, -0.17791213731487726, -0.05960387667491032, -0.0028144749844034246, -0.28799972415045405, 0.04206998229976869, 0.1169126111304625, 0.12484188257222807, -0.05072983932500118, -0.1745045491487988, 0.03794822821803016, 0.1383261581939089, 0.01620785632985644, 0.13686276312554943, 0.10994478819333954, -0.23967884301759565, -0.19730109324203743, 0.3366910193190479, -0.1333785247547558, -0.15810180845476637, 0.22181797890155108, 0.04808334764655704, -0.14761315790261298, 0.10899082460321936, 0.29047071214940323, 0.11114167934596139, -0.1605178228635716, -0.018830233680915662, -0.0631400929723285, 0.15919518210431374, 0.07935628746542454, -0.018461005324685333, 0.1279949456482232, 0.3673590180157815, 0.0022430699443657127, 0.14930715428934052, -0.17337410111955348, -0.051706472655520745, -0.16443545450675207, -0.08004924847475635, -0.19132620759852131, -0.031152357945793727, -0.10287320375697993, -0.17684897038954367, 0.36670848690973434, 0.19484558439932315, 0.2209824461914949, 0.1797138078250741, 0.3241944424558006, -0.0021162533377853516, 0.1978751598738584, 0.11783975942822911, 0.22340471832231687, 0.013856518565170816, 0.14507409794593618, -0.12508567724370667, 0.06838808331526065, 0.07851665614535344] |
1,802.00672 | Separation of two electromagnetic or electromagnetic - hadronic showers
in CALICE SiW ECAL and ILD | CALICE collaboration is developing highly granular calorimeters suitable for
individual reconstruction of particles in the jets using Particle Flow
Algorithms. Such calorimeters should provide the best jet energy resolution at
future high energy $e^{+}e^{-}$ colliders. At high jet energies, typically
above 70-100 GeV, the jet particle showers start to overlap, and the resolution
is determined by the ability to separate them. Here, we present the results on
the separation of two overlapping electromagnetic or electromagnetic - hadronic
showers obtained by mixing of the single shower events collected with CALICE
SiW ECAL and AHCAL physics prototypes during beam tests at CERN'07 and
FermiLab'11, and using International Large Detector (ILD) Monte Carlo
simulations. We use three available PFA reconstruction programs (Pandora,
Garlic and Arbor).
| physics.ins-det hep-ex | calice collaboration is developing highly granular calorimeters suitable for individual reconstruction of particles in the jets using particle flow algorithms such calorimeters should provide the best jet energy resolution at future high energy ee colliders at high jet energies typically above 70100 gev the jet particle showers start to overlap and the resolution is determined by the ability to separate them here we present the results on the separation of two overlapping electromagnetic or electromagnetic hadronic showers obtained by mixing of the single shower events collected with calice siw ecal and ahcal physics prototypes during beam tests at cern07 and fermilab11 and using international large detector ild monte carlo simulations we use three available pfa reconstruction programs pandora garlic and arbor | [['calice', 'collaboration', 'is', 'developing', 'highly', 'granular', 'calorimeters', 'suitable', 'for', 'individual', 'reconstruction', 'of', 'particles', 'in', 'the', 'jets', 'using', 'particle', 'flow', 'algorithms', 'such', 'calorimeters', 'should', 'provide', 'the', 'best', 'jet', 'energy', 'resolution', 'at', 'future', 'high', 'energy', 'ee', 'colliders', 'at', 'high', 'jet', 'energies', 'typically', 'above', '70100', 'gev', 'the', 'jet', 'particle', 'showers', 'start', 'to', 'overlap', 'and', 'the', 'resolution', 'is', 'determined', 'by', 'the', 'ability', 'to', 'separate', 'them', 'here', 'we', 'present', 'the', 'results', 'on', 'the', 'separation', 'of', 'two', 'overlapping', 'electromagnetic', 'or', 'electromagnetic', 'hadronic', 'showers', 'obtained', 'by', 'mixing', 'of', 'the', 'single', 'shower', 'events', 'collected', 'with', 'calice', 'siw', 'ecal', 'and', 'ahcal', 'physics', 'prototypes', 'during', 'beam', 'tests', 'at', 'cern07', 'and', 'fermilab11', 'and', 'using', 'international', 'large', 'detector', 'ild', 'monte', 'carlo', 'simulations', 'we', 'use', 'three', 'available', 'pfa', 'reconstruction', 'programs', 'pandora', 'garlic', 'and', 'arbor']] | [-0.0597362766245834, 0.2183683970903962, -0.08022593541321259, 0.10586378848015823, -0.047398987625326426, -0.09320874894116105, -0.08002238159318369, 0.4407733264653122, -0.18662767149429738, -0.42132611793833746, 0.045349758223067, -0.33817728206577924, 0.06858947249755513, 0.15687411422684727, 0.08156495009149824, 0.16790204737805017, 0.1937899828131287, -0.07112381672814387, -0.04189834960622854, -0.13309800272275293, 0.22882785882112108, 0.26478082922232504, 0.27253823299665286, 0.07340980825912473, 0.1957013574741906, 0.03918257580694406, -0.09060934343680489, 0.004738577301105281, -0.12389637467215628, 0.058330786724559214, 0.28698897627847536, 0.1111126195838941, 0.172353704327286, -0.42383538681168514, -0.11415498712327049, 0.042271097825581846, 0.09727851159385398, -0.004848062749482503, -0.06850217280913332, -0.3159875524613787, 0.10565608585040093, -0.22249224576159937, -0.1098454690483563, -0.014827551629331684, -0.105660031694418, 0.02591416971883228, -0.2399555181912264, 0.00411378765408294, -0.06717132079461981, 0.07731402839901817, 0.036277937194129, -0.1707882876703594, 0.025957786110268923, 0.0467283738289858, 0.035618223637311146, 0.0524198513227601, 0.2119720794628335, -0.1610187063005385, -0.18079983072057992, 0.3543607927780567, 0.02273119577674289, -0.1497965447960261, 0.26067669409916133, -0.22486384146447694, -0.11885676658203621, 0.2380751000811197, 0.273735431054247, 0.06803919538511198, -0.21242981417957663, 0.014553063799051897, 0.03960944834642676, 0.14434650091125684, 0.08967124924314122, -0.0031222238267983207, 0.2320441445570533, 0.2715918225071886, 0.01811427317907987, 0.10205065248487126, -0.17653119166703513, 0.009049465605879532, -0.3551120591514251, -0.10824201845352639, -0.17027510365299067, -0.02116337083593136, -0.029116387761852453, -0.10001478485074364, 0.3814114535290028, 0.09254623295254066, 0.12178131355708387, -0.024394283644432406, 0.3600390838349567, -0.012567571331081646, 0.04293686106112324, 0.08704015763453012, 0.3182813704205567, 0.09416797490469611, 0.18731518308514683, -0.18369099467272768, 0.0016691476584044325, 0.060274877037633866] |
1,802.00673 | Representation Learning for Resource Usage Prediction | Creating a model of a computer system that can be used for tasks such as
predicting future resource usage and detecting anomalies is a challenging
problem. Most current systems rely on heuristics and overly simplistic
assumptions about the workloads and system statistics. These heuristics are
typically a one-size-fits-all solution so as to be applicable in a wide range
of applications and systems environments.
With this paper, we present our ongoing work of integrating systems telemetry
ranging from standard resource usage statistics to kernel and library calls of
applications into a machine learning model. Intuitively, such a ML model
approximates, at any point in time, the state of a system and allows us to
solve tasks such as resource usage prediction and anomaly detection. To achieve
this goal, we leverage readily-available information that does not require any
changes to the applications run on the system. We train recurrent neural
networks to learn a model of the system under consideration. As a proof of
concept, we train models specifically to predict future resource usage of
running applications.
| cs.DC cs.LG cs.OS | creating a model of a computer system that can be used for tasks such as predicting future resource usage and detecting anomalies is a challenging problem most current systems rely on heuristics and overly simplistic assumptions about the workloads and system statistics these heuristics are typically a onesizefitsall solution so as to be applicable in a wide range of applications and systems environments with this paper we present our ongoing work of integrating systems telemetry ranging from standard resource usage statistics to kernel and library calls of applications into a machine learning model intuitively such a ml model approximates at any point in time the state of a system and allows us to solve tasks such as resource usage prediction and anomaly detection to achieve this goal we leverage readilyavailable information that does not require any changes to the applications run on the system we train recurrent neural networks to learn a model of the system under consideration as a proof of concept we train models specifically to predict future resource usage of running applications | [['creating', 'a', 'model', 'of', 'a', 'computer', 'system', 'that', 'can', 'be', 'used', 'for', 'tasks', 'such', 'as', 'predicting', 'future', 'resource', 'usage', 'and', 'detecting', 'anomalies', 'is', 'a', 'challenging', 'problem', 'most', 'current', 'systems', 'rely', 'on', 'heuristics', 'and', 'overly', 'simplistic', 'assumptions', 'about', 'the', 'workloads', 'and', 'system', 'statistics', 'these', 'heuristics', 'are', 'typically', 'a', 'onesizefitsall', 'solution', 'so', 'as', 'to', 'be', 'applicable', 'in', 'a', 'wide', 'range', 'of', 'applications', 'and', 'systems', 'environments', 'with', 'this', 'paper', 'we', 'present', 'our', 'ongoing', 'work', 'of', 'integrating', 'systems', 'telemetry', 'ranging', 'from', 'standard', 'resource', 'usage', 'statistics', 'to', 'kernel', 'and', 'library', 'calls', 'of', 'applications', 'into', 'a', 'machine', 'learning', 'model', 'intuitively', 'such', 'a', 'ml', 'model', 'approximates', 'at', 'any', 'point', 'in', 'time', 'the', 'state', 'of', 'a', 'system', 'and', 'allows', 'us', 'to', 'solve', 'tasks', 'such', 'as', 'resource', 'usage', 'prediction', 'and', 'anomaly', 'detection', 'to', 'achieve', 'this', 'goal', 'we', 'leverage', 'readilyavailable', 'information', 'that', 'does', 'not', 'require', 'any', 'changes', 'to', 'the', 'applications', 'run', 'on', 'the', 'system', 'we', 'train', 'recurrent', 'neural', 'networks', 'to', 'learn', 'a', 'model', 'of', 'the', 'system', 'under', 'consideration', 'as', 'a', 'proof', 'of', 'concept', 'we', 'train', 'models', 'specifically', 'to', 'predict', 'future', 'resource', 'usage', 'of', 'running', 'applications']] | [-0.09112453077919781, -0.012476853794817413, -0.09612204074161128, 0.06819780699576118, -0.12447933323548309, -0.18425200529662625, 0.07656966959192817, 0.39889955047251924, -0.27578233865023194, -0.37121495820049727, 0.14433128387135055, -0.24336855868667565, -0.173296842430053, 0.248127556491111, -0.10192765822368009, 0.10496653906535357, 0.12590110578441194, 0.028857100498197334, -0.055214842408895494, -0.22832265052146145, 0.2754741662075477, 0.04767710183081882, 0.3080634966971619, 0.047938053426665385, 0.09911358735258026, -0.005363680444923895, 0.01373953781489815, 0.0037633582829896895, -0.04156852963921015, 0.1572312933250214, 0.31638550282682576, 0.2304465007203232, 0.31894582898489066, -0.43408733737255845, -0.2587470908635961, 0.1469057584553957, 0.13215275479680194, 0.13021820932626724, -0.019163858321096214, -0.2668902639938252, 0.08428733882427748, -0.21071217540917653, -0.05632888509226697, -0.13570295838971755, -0.005219233158443655, 0.010963063234729425, -0.3046436062907534, 0.00046957316409264294, 0.045789109197046075, 0.04645642922925097, -0.045153179264161736, -0.07786489342938044, 0.06782790730175163, 0.16518041999212332, 0.019350770311430097, 0.029389107587880322, 0.1793394209444523, -0.18855954939965158, -0.16384817632513918, 0.4280707502045802, -0.04276606561083879, -0.19822115377789098, 0.2427625304753227, -0.016009038888982363, -0.17634788710091795, 0.04634139572935445, 0.2795841235637532, 0.11416216571948358, -0.17041196771232145, 0.03580742787603023, 0.00027153827782188143, 0.210210298367144, 0.00675518979451486, 0.04045794160504426, 0.22139496649748514, 0.25528017422982624, 0.0603933602890798, 0.09836655950572874, -0.060311072817338364, -0.08179811545248543, -0.24407232859837158, -0.1487621936414923, -0.1864285615246211, 0.024074687437636643, -0.02491260396524532, -0.15240244564841435, 0.3918730921298266, 0.26068288510399207, 0.18491687705607288, 0.1062917762156576, 0.3156817213339465, 0.08040158409159631, 0.11810354960982555, 0.10061242464131542, 0.13043056449653315, 0.01786377049916025, 0.1676686184214694, -0.1466009006090462, 0.0785955556468772, -0.01707959042063781] |
1,802.00674 | Helioseismology: Observations and Space Missions | The great success of Helioseismology resides in the remarkable progress
achieved in the understanding of the structure and dynamics of the solar
interior. This success mainly relies on the ability to conceive, implement, and
operate specific instrumentation with enough sensitivity to detect and measure
small fluctuations (in velocity and/or intensity) on the solar surface that are
well below one meter per second or a few parts per million. Furthermore the
limitation of the ground observations imposing the day-night cycle (thus a
periodic discontinuity in the observations) was overcome with the deployment of
ground-based networks --properly placed at different longitudes all over the
Earth-- allowing longer and continuous observations of the Sun and consequently
increasing their duty cycles. In this chapter, we start by a short historical
overview of helioseismology. Then we describe the different techniques used to
do helioseismic analyses along with a description of the main instrumental
concepts. We in particular focus on the instruments that have been operating
long enough to study the solar magnetic activity. Finally, we give a highlight
of the main results obtained with such high-duty cycle observations (>80%)
lasting over the last few decades.
| astro-ph.SR | the great success of helioseismology resides in the remarkable progress achieved in the understanding of the structure and dynamics of the solar interior this success mainly relies on the ability to conceive implement and operate specific instrumentation with enough sensitivity to detect and measure small fluctuations in velocity andor intensity on the solar surface that are well below one meter per second or a few parts per million furthermore the limitation of the ground observations imposing the daynight cycle thus a periodic discontinuity in the observations was overcome with the deployment of groundbased networks properly placed at different longitudes all over the earth allowing longer and continuous observations of the sun and consequently increasing their duty cycles in this chapter we start by a short historical overview of helioseismology then we describe the different techniques used to do helioseismic analyses along with a description of the main instrumental concepts we in particular focus on the instruments that have been operating long enough to study the solar magnetic activity finally we give a highlight of the main results obtained with such highduty cycle observations 80 lasting over the last few decades | [['the', 'great', 'success', 'of', 'helioseismology', 'resides', 'in', 'the', 'remarkable', 'progress', 'achieved', 'in', 'the', 'understanding', 'of', 'the', 'structure', 'and', 'dynamics', 'of', 'the', 'solar', 'interior', 'this', 'success', 'mainly', 'relies', 'on', 'the', 'ability', 'to', 'conceive', 'implement', 'and', 'operate', 'specific', 'instrumentation', 'with', 'enough', 'sensitivity', 'to', 'detect', 'and', 'measure', 'small', 'fluctuations', 'in', 'velocity', 'andor', 'intensity', 'on', 'the', 'solar', 'surface', 'that', 'are', 'well', 'below', 'one', 'meter', 'per', 'second', 'or', 'a', 'few', 'parts', 'per', 'million', 'furthermore', 'the', 'limitation', 'of', 'the', 'ground', 'observations', 'imposing', 'the', 'daynight', 'cycle', 'thus', 'a', 'periodic', 'discontinuity', 'in', 'the', 'observations', 'was', 'overcome', 'with', 'the', 'deployment', 'of', 'groundbased', 'networks', 'properly', 'placed', 'at', 'different', 'longitudes', 'all', 'over', 'the', 'earth', 'allowing', 'longer', 'and', 'continuous', 'observations', 'of', 'the', 'sun', 'and', 'consequently', 'increasing', 'their', 'duty', 'cycles', 'in', 'this', 'chapter', 'we', 'start', 'by', 'a', 'short', 'historical', 'overview', 'of', 'helioseismology', 'then', 'we', 'describe', 'the', 'different', 'techniques', 'used', 'to', 'do', 'helioseismic', 'analyses', 'along', 'with', 'a', 'description', 'of', 'the', 'main', 'instrumental', 'concepts', 'we', 'in', 'particular', 'focus', 'on', 'the', 'instruments', 'that', 'have', 'been', 'operating', 'long', 'enough', 'to', 'study', 'the', 'solar', 'magnetic', 'activity', 'finally', 'we', 'give', 'a', 'highlight', 'of', 'the', 'main', 'results', 'obtained', 'with', 'such', 'highduty', 'cycle', 'observations', '80', 'lasting', 'over', 'the', 'last', 'few', 'decades']] | [-0.11759385979185984, 0.14467976686397666, -0.017778514050893902, 0.046320351283065976, -0.06066556246215968, -0.06617019972763956, 0.052781082293950024, 0.38214064530145964, -0.21938070497279497, -0.3629721909565361, 0.1565745570972611, -0.259618953664444, -0.1183520034507015, 0.22330621371817727, -0.08474841520165731, 0.007374062352372627, 0.10270035773405413, 0.034293732458823604, -0.07261014046380296, -0.2428401648324277, 0.2439738195328238, 0.09388776526443268, 0.23610389259104667, 0.044497201996120186, 0.0986237971754714, -0.036821609313942884, -0.06822523708014112, -0.001515865697844052, -0.12956717545695076, 0.13243819909709456, 0.23418613400212243, 0.1456692808638572, 0.29470470242913027, -0.4924292056288227, -0.23696354649421808, 0.08312938635752193, 0.1063383983607453, 0.06586359508433624, -0.016250450555602775, -0.2504582359798645, 0.06170447889874738, -0.1292731601585585, -0.14578684942282147, -0.022083552464181068, 0.027896897656548965, 0.05779922575028123, -0.17906423944299796, -0.0012684082692047875, 0.03787764064097581, 0.13082157932221888, -0.06762960090939152, -0.08897190147055019, -0.010003761577076819, 0.1716698858384533, 0.08142914045111914, 0.04117361814339682, 0.10844791365885421, -0.10401912437335245, -0.07407249030166943, 0.35542238634569867, -0.09233985086565984, -0.08112438306040866, 0.21410225902340915, -0.22089676812389178, -0.16430894476361574, 0.13905454734462852, 0.17568482970328708, 0.10125426753473125, -0.12806890865781737, 0.020506111761297737, 0.00344688642623001, 0.17724190557277517, 0.07355511706984161, 0.051083008977462, 0.26727016310354595, 0.20298840622050002, 0.07891512347483322, 0.08082829969322407, -0.18082945457488103, -0.08322100543637613, -0.26999593737633215, -0.09264281979198323, -0.13896567584689412, 0.0599715527514682, -0.053147912441713026, -0.11170476006564538, 0.446231218750319, 0.2029156397354918, 0.1961901727720703, 0.02650148608035555, 0.33268910607225016, 0.05526864502677008, 0.09878057540014484, 0.040734714634201835, 0.2935661864681414, 0.1319357754062175, 0.15272902562321275, -0.18574006241167235, 0.0675625430616109, 0.004470951084850209] |
1,802.00675 | Schwarzschild Fuzzball and Explicitly Unitary Hawking Radiations | We provide a fuzzball picture for Schwarzshild black holes, in which matters
and energy consisting the hole are not positioned on the central point
exclusively but oscillate around there in a serial of eigen-modes, each of
which features a special level of binding degrees and are quantum mechanically
possible to be measured outside the horizon. By listing these modes explicitly
for holes as large as $6M_\mathrm{pl}$, we find that their number increases
exponentially with the area. Basing on this picture, we present a simple but
explicitly unitary derivation of hawking radiations.
| hep-th gr-qc | we provide a fuzzball picture for schwarzshild black holes in which matters and energy consisting the hole are not positioned on the central point exclusively but oscillate around there in a serial of eigenmodes each of which features a special level of binding degrees and are quantum mechanically possible to be measured outside the horizon by listing these modes explicitly for holes as large as 6m_mathrmpl we find that their number increases exponentially with the area basing on this picture we present a simple but explicitly unitary derivation of hawking radiations | [['we', 'provide', 'a', 'fuzzball', 'picture', 'for', 'schwarzshild', 'black', 'holes', 'in', 'which', 'matters', 'and', 'energy', 'consisting', 'the', 'hole', 'are', 'not', 'positioned', 'on', 'the', 'central', 'point', 'exclusively', 'but', 'oscillate', 'around', 'there', 'in', 'a', 'serial', 'of', 'eigenmodes', 'each', 'of', 'which', 'features', 'a', 'special', 'level', 'of', 'binding', 'degrees', 'and', 'are', 'quantum', 'mechanically', 'possible', 'to', 'be', 'measured', 'outside', 'the', 'horizon', 'by', 'listing', 'these', 'modes', 'explicitly', 'for', 'holes', 'as', 'large', 'as', '6m_mathrmpl', 'we', 'find', 'that', 'their', 'number', 'increases', 'exponentially', 'with', 'the', 'area', 'basing', 'on', 'this', 'picture', 'we', 'present', 'a', 'simple', 'but', 'explicitly', 'unitary', 'derivation', 'of', 'hawking', 'radiations']] | [-0.13894410586088068, 0.16481447763120136, -0.063200038885245, 0.09069441501439239, -0.03551273708128267, -0.14726251731109288, 0.07381730914090036, 0.34147675654126536, -0.18190994031416874, -0.2971260692717301, 0.08375221829499221, -0.32353560800612385, -0.09719387078140344, 0.19841082046429317, -0.03656197761495908, -0.02069413861673739, 0.029310558506080674, 0.06700638359600108, -0.051754319738312106, -0.2027377447527316, 0.3343841925677326, 0.10442398821081346, 0.22440979877072903, 0.04735098369160874, 0.09040120558606254, 0.017319776992210083, 0.03518957570195198, 0.07482014660620027, -0.12459925900822984, 0.08920613624310741, 0.2541358797397051, 0.10905814143932528, 0.22567430020620424, -0.43812431427132753, -0.18540397720773602, 0.07210384524013433, 0.17248804285708402, 0.1621062876501431, -0.08253499401164138, -0.24077541844712363, 0.06789691948021452, -0.18262687675240968, -0.14024282682997485, -0.06538516722309093, 0.054115315940645004, -0.011505225973410738, -0.15127342025128504, 0.09568168222904205, 0.07894352108447088, -0.011530355560696787, -0.05822719474737015, -0.06247916522746285, -0.0523148726982375, 0.12954884679574105, 0.0717628490852399, -0.018368496268198618, 0.1859221344244563, -0.09377677376744234, -0.0908141594600036, 0.35118078548047277, -0.00012979468123780355, -0.2068043663062983, 0.17579535126634355, -0.20183874931082957, -0.09735562284638744, 0.116172107124132, 0.15025574828291105, 0.15952303495465053, -0.1295614721460475, 0.08110164340275029, -0.04047771847237729, 0.17214904363079567, 0.11498172607065903, 0.10470619528140458, 0.3541162092368015, 0.11756630603922531, 0.02875092233427697, 0.14073901017869098, -0.03667254089377821, -0.12538691267319438, -0.3570961967524555, -0.13663900838647453, -0.1832978466939595, 0.09888675523058434, -0.07234075369487983, -0.21921603133281073, 0.3773154406446136, 0.09362786368259954, 0.24030751194287506, 0.048391188487100105, 0.24790923757803587, 0.11419282612235596, 0.09326539065740588, 0.12141544738163551, 0.28901356706499226, 0.06102180369198322, 0.0631955487627743, -0.19236080979721415, -0.04033160602880849, 0.04730383079085085] |
1,802.00676 | Spin-isomer conversion of water at room temperature, and
quantum-rotor-induced nuclear polarization, in the water-endofullerene
H$_2$O@C$_{60}$ | Water exists in two forms, para and ortho, that have nuclear spin states with
different symmetries. Here we report the conversion of fullerene-encapsulated
para-water to ortho-water. The enrichment of para-water at low temperatures is
monitored via changes in the electrical polarizability of the material. Upon
rapid dissolution of the material in toluene the excess para-water converts to
ortho- water. In H$_2{}^{16}$O@C$_{60}$ the conversion leads to a slow increase
in the NMR signal. In H$_2{}^{16}$O@C$_{60}$ the conversion gives rise to weak
signal enhancements attributed to quantum-rotor-induced nuclear spin
polarization. The time constants for the spin-isomer conversion of
fullerene-encapsulated water in ambient temperature solution are estimated as
30$\pm$4 s for the $^{16}$O-isotopologue of water, and 16$\pm$3 s for the
$^{17}$O isotopologue.
| physics.chem-ph | water exists in two forms para and ortho that have nuclear spin states with different symmetries here we report the conversion of fullereneencapsulated parawater to orthowater the enrichment of parawater at low temperatures is monitored via changes in the electrical polarizability of the material upon rapid dissolution of the material in toluene the excess parawater converts to ortho water in h_216oc_60 the conversion leads to a slow increase in the nmr signal in h_216oc_60 the conversion gives rise to weak signal enhancements attributed to quantumrotorinduced nuclear spin polarization the time constants for the spinisomer conversion of fullereneencapsulated water in ambient temperature solution are estimated as 30pm4 s for the 16oisotopologue of water and 16pm3 s for the 17o isotopologue | [['water', 'exists', 'in', 'two', 'forms', 'para', 'and', 'ortho', 'that', 'have', 'nuclear', 'spin', 'states', 'with', 'different', 'symmetries', 'here', 'we', 'report', 'the', 'conversion', 'of', 'fullereneencapsulated', 'parawater', 'to', 'orthowater', 'the', 'enrichment', 'of', 'parawater', 'at', 'low', 'temperatures', 'is', 'monitored', 'via', 'changes', 'in', 'the', 'electrical', 'polarizability', 'of', 'the', 'material', 'upon', 'rapid', 'dissolution', 'of', 'the', 'material', 'in', 'toluene', 'the', 'excess', 'parawater', 'converts', 'to', 'ortho', 'water', 'in', 'h_216oc_60', 'the', 'conversion', 'leads', 'to', 'a', 'slow', 'increase', 'in', 'the', 'nmr', 'signal', 'in', 'h_216oc_60', 'the', 'conversion', 'gives', 'rise', 'to', 'weak', 'signal', 'enhancements', 'attributed', 'to', 'quantumrotorinduced', 'nuclear', 'spin', 'polarization', 'the', 'time', 'constants', 'for', 'the', 'spinisomer', 'conversion', 'of', 'fullereneencapsulated', 'water', 'in', 'ambient', 'temperature', 'solution', 'are', 'estimated', 'as', '30pm4', 's', 'for', 'the', '16oisotopologue', 'of', 'water', 'and', '16pm3', 's', 'for', 'the', '17o', 'isotopologue']] | [-0.10273375161629808, 0.1956589685098545, -0.0009636382052154691, -0.023773308351493296, 0.026085112032035854, -0.0635318912960052, 0.07313934715594761, 0.38594742827453055, -0.2396722666684303, -0.3117563723091472, 0.05461635082427345, -0.2923255504721457, -0.015137701031021975, 0.15282274447884914, 0.048778072895213694, -0.024496561173257325, -0.03951711562537664, -0.027489483308756037, -0.08382538541404715, -0.12316486762987601, 0.23379726268283957, 0.05468237760837551, 0.27258069567835413, 0.12776326785715683, 0.1011889603309887, -0.09523688023909926, 0.04156602901482099, -0.1037761042720999, -0.11693904847400903, 0.0661030930041798, 0.3131605173452749, 0.0586537184269243, 0.1291035674847998, -0.4500630804094243, -0.1866044960244819, 0.07035278035159986, 0.09485252895853943, 0.133944508690924, -0.07331077069534946, -0.21647546405543214, -0.0024750877238877184, -0.14323886406716999, -0.10217540978814836, -0.059412471622832724, 0.060278271526299616, 0.014352258601066497, -0.23248243929298074, 0.13790824625070566, 0.037172269172597305, 0.06766992831090884, -0.14041200753402067, -0.17654634939154257, -0.08773578802828451, 0.07259104650903929, 0.022106654386178735, 0.04093930672073888, 0.2046375715693979, -0.12407510889366873, -0.05740466084633324, 0.38713208184921527, -0.17433152535745688, -0.08362524813829779, 0.2095857831641092, -0.19093879257739932, -0.14195947586936322, 0.2570428245382065, 0.15427626390010118, 0.07655318806300292, -0.13091357969804793, 0.009679565781167382, 0.037703122285001715, 0.182806064634844, 0.1196990745133712, 0.07269185427408498, 0.19905434897891036, 0.15600175371074732, 0.03538126195780933, 0.14224646083574305, -0.1702405873283341, -0.04648960787836496, -0.19313588408702934, -0.24792930572860045, -0.12357211646598738, 0.09144275748749843, -0.0386549750936054, -0.09461717618742606, 0.35216938804726006, 0.07425506050312505, 0.18187405090901773, -0.06572971677592208, 0.2415462422912504, 0.10277272910949446, 0.05151908280042646, 0.019992957583855133, 0.3094540962630564, 0.20581874007837395, 0.14431515306565776, -0.3455191394041485, 0.14122850833846642, -0.01922327062735955] |
1,802.00677 | Stochastic Kriging for Inadequate Simulation Models | Stochastic kriging is a popular metamodeling technique for representing the
unknown response surface of a simulation model. However, the simulation model
may be inadequate in the sense that there may be a non-negligible discrepancy
between it and the real system of interest. Failing to account for the model
discrepancy may conceivably result in erroneous prediction of the real system's
performance and mislead the decision-making process. This paper proposes a
metamodel that extends stochastic kriging to incorporate the model discrepancy.
Both the simulation outputs and the real data are used to characterize the
model discrepancy. The proposed metamodel can provably enhance the prediction
of the real system's performance. We derive general results for experiment
design and analysis, and demonstrate the advantage of the proposed metamodel
relative to competing methods. Finally, we study the effect of Common Random
Numbers (CRN). The use of CRN is well known to be detrimental to the prediction
accuracy of stochastic kriging in general. By contrast, we show that the effect
of CRN in the new context is substantially more complex. The use of CRN can be
either detrimental or beneficial depending on the interplay between the
magnitude of the observation errors and other parameters involved.
| stat.ME | stochastic kriging is a popular metamodeling technique for representing the unknown response surface of a simulation model however the simulation model may be inadequate in the sense that there may be a nonnegligible discrepancy between it and the real system of interest failing to account for the model discrepancy may conceivably result in erroneous prediction of the real systems performance and mislead the decisionmaking process this paper proposes a metamodel that extends stochastic kriging to incorporate the model discrepancy both the simulation outputs and the real data are used to characterize the model discrepancy the proposed metamodel can provably enhance the prediction of the real systems performance we derive general results for experiment design and analysis and demonstrate the advantage of the proposed metamodel relative to competing methods finally we study the effect of common random numbers crn the use of crn is well known to be detrimental to the prediction accuracy of stochastic kriging in general by contrast we show that the effect of crn in the new context is substantially more complex the use of crn can be either detrimental or beneficial depending on the interplay between the magnitude of the observation errors and other parameters involved | [['stochastic', 'kriging', 'is', 'a', 'popular', 'metamodeling', 'technique', 'for', 'representing', 'the', 'unknown', 'response', 'surface', 'of', 'a', 'simulation', 'model', 'however', 'the', 'simulation', 'model', 'may', 'be', 'inadequate', 'in', 'the', 'sense', 'that', 'there', 'may', 'be', 'a', 'nonnegligible', 'discrepancy', 'between', 'it', 'and', 'the', 'real', 'system', 'of', 'interest', 'failing', 'to', 'account', 'for', 'the', 'model', 'discrepancy', 'may', 'conceivably', 'result', 'in', 'erroneous', 'prediction', 'of', 'the', 'real', 'systems', 'performance', 'and', 'mislead', 'the', 'decisionmaking', 'process', 'this', 'paper', 'proposes', 'a', 'metamodel', 'that', 'extends', 'stochastic', 'kriging', 'to', 'incorporate', 'the', 'model', 'discrepancy', 'both', 'the', 'simulation', 'outputs', 'and', 'the', 'real', 'data', 'are', 'used', 'to', 'characterize', 'the', 'model', 'discrepancy', 'the', 'proposed', 'metamodel', 'can', 'provably', 'enhance', 'the', 'prediction', 'of', 'the', 'real', 'systems', 'performance', 'we', 'derive', 'general', 'results', 'for', 'experiment', 'design', 'and', 'analysis', 'and', 'demonstrate', 'the', 'advantage', 'of', 'the', 'proposed', 'metamodel', 'relative', 'to', 'competing', 'methods', 'finally', 'we', 'study', 'the', 'effect', 'of', 'common', 'random', 'numbers', 'crn', 'the', 'use', 'of', 'crn', 'is', 'well', 'known', 'to', 'be', 'detrimental', 'to', 'the', 'prediction', 'accuracy', 'of', 'stochastic', 'kriging', 'in', 'general', 'by', 'contrast', 'we', 'show', 'that', 'the', 'effect', 'of', 'crn', 'in', 'the', 'new', 'context', 'is', 'substantially', 'more', 'complex', 'the', 'use', 'of', 'crn', 'can', 'be', 'either', 'detrimental', 'or', 'beneficial', 'depending', 'on', 'the', 'interplay', 'between', 'the', 'magnitude', 'of', 'the', 'observation', 'errors', 'and', 'other', 'parameters', 'involved']] | [-0.07776230906110594, 0.02059557459003587, -0.07604299269817845, 0.09847466196271543, -0.07080114494316542, -0.12192841801305662, 0.060804780638758, 0.357419218437456, -0.29371464371461253, -0.3287962634799693, 0.0940489947805228, -0.25077838621256715, -0.20770386450025416, 0.19500585546571966, -0.09190873960477661, 0.06816643097990159, 0.07503177009139154, -0.001927692205621744, -0.048973539145078376, -0.26014701611170515, 0.3037026793311055, 0.08399686669397294, 0.30508105733417834, 0.0417238235539153, 0.06990044116891976, -0.013445197945067556, -0.03385603170837252, 0.033900141964336605, -0.06968569812983076, 0.12747803162174984, 0.2537229746280603, 0.14843494695173717, 0.285095487239223, -0.4285043091396216, -0.25625589542820976, 0.13827531120503536, 0.1111335577602655, 0.09583128516763524, -0.019762115094160787, -0.2630748018088877, 0.0821488382992096, -0.1788481658268439, -0.08279909379487792, -0.0973857102316603, -0.03727516494357921, 0.012304602661778467, -0.3228813427214946, 0.05898594923888394, 0.08031437343330007, 0.02278378177153405, -0.039098225807743005, -0.11729748104757456, 0.012618602076826158, 0.1569883769352326, 0.056748536467317014, 0.020636076824833177, 0.10895888015847821, -0.0907230744461281, -0.12492708764776082, 0.40525461855957556, -0.06673435340828529, -0.23447952887637719, 0.2091529826919113, -0.1187935285972216, -0.11239500807588873, 0.09912124416210581, 0.2227684416873708, 0.08008728433756074, -0.15123050027391194, 0.0491615041731225, 0.0012488881074566038, 0.16749575515464885, -0.013295110140753975, -0.014657031308892347, 0.16339694854836143, 0.20397565471963142, 0.03877157962707868, 0.12103860895558911, -0.094961939426373, -0.11510772928338142, -0.2527531125189634, -0.15025438424977872, -0.1812654091185661, -0.01497447528424743, -0.0975762019397506, -0.1410549843739999, 0.38131675280480826, 0.2525496470534837, 0.1840427707735655, 0.052697693566375194, 0.33305581817263036, 0.12294512592845751, 0.05227981280329539, 0.02316103498194011, 0.23213066584922037, 0.09090641337615349, 0.05697235345943415, -0.2198505660205443, 0.16693487028993817, -0.0010618988761500498] |
1,802.00678 | A Simple Object that Spans the Whole Consensus Hierarchy | This paper presents a simple generalization of the basic atomic read/write
register object, whose genericity parameter spans the whole set of integers and
is such that its k-parameterized instance has exactly consensus number k. This
object, whose definition is pretty natural, is a sliding window register of
size k. Its interest lies in its simplicity and its genericity dimension which
provides a global view capturing the whole consensus hierarchy. Hence, this
short article must be seen as a simple pedagogical introduction to Herlihy's
consensus hierarchy.
| cs.DC | this paper presents a simple generalization of the basic atomic readwrite register object whose genericity parameter spans the whole set of integers and is such that its kparameterized instance has exactly consensus number k this object whose definition is pretty natural is a sliding window register of size k its interest lies in its simplicity and its genericity dimension which provides a global view capturing the whole consensus hierarchy hence this short article must be seen as a simple pedagogical introduction to herlihys consensus hierarchy | [['this', 'paper', 'presents', 'a', 'simple', 'generalization', 'of', 'the', 'basic', 'atomic', 'readwrite', 'register', 'object', 'whose', 'genericity', 'parameter', 'spans', 'the', 'whole', 'set', 'of', 'integers', 'and', 'is', 'such', 'that', 'its', 'kparameterized', 'instance', 'has', 'exactly', 'consensus', 'number', 'k', 'this', 'object', 'whose', 'definition', 'is', 'pretty', 'natural', 'is', 'a', 'sliding', 'window', 'register', 'of', 'size', 'k', 'its', 'interest', 'lies', 'in', 'its', 'simplicity', 'and', 'its', 'genericity', 'dimension', 'which', 'provides', 'a', 'global', 'view', 'capturing', 'the', 'whole', 'consensus', 'hierarchy', 'hence', 'this', 'short', 'article', 'must', 'be', 'seen', 'as', 'a', 'simple', 'pedagogical', 'introduction', 'to', 'herlihys', 'consensus', 'hierarchy']] | [-0.17179201466907912, 0.10026960347724312, -0.08698941247866435, 0.02192189299282344, -0.13922681058483088, -0.1803245075923555, 0.05855372948982917, 0.32745065903838944, -0.34161824930240126, -0.2953799423049478, 0.09459322359385516, -0.18085681935224462, -0.11443983044694452, 0.11658181701512897, -0.11705420620684677, 0.021586923019083985, 0.07442594346973826, 0.12360982476897976, -0.06521857898572789, -0.27315862687195047, 0.2666079513810794, 0.04897464901647147, 0.21762298081508455, 0.04119296797058162, 0.15788875633631558, -0.008166830633383464, 0.01691195055951967, 0.03556595628752428, -0.1019855658610194, 0.11880417020224474, 0.2755871187457267, 0.22127132583683468, 0.33068054243922235, -0.32349770176498327, -0.15658017114243086, 0.1364777458502966, 0.15556002664653695, 0.10565078734550351, -0.02003043290665921, -0.24369014386115048, 0.11700136428698897, -0.18033516044344972, -0.12650727308081353, -0.05685058972414802, 0.08832324559197706, -0.030122739032787435, -0.2094418981934295, 0.0001816871082958053, 0.15544124367263387, 0.11134237783176906, -0.007205176869448384, -0.08264746205223834, 0.03166377070798155, 0.12164727081681656, -0.01709103965857888, 0.055658753439510135, 0.12067040046676994, -0.09632601680179291, -0.08229466982404976, 0.421689371364739, 0.019256522314732565, -0.1849309084454195, 0.21080104445709902, -0.07944450570708689, -0.12823660958503538, 0.10387333276517251, 0.08914224719354773, 0.10313608426573302, -0.14813799059347194, 0.15878149452345336, -0.14843400482307462, 0.18478629484854858, 0.07364279163234375, 0.06971126385580967, 0.21450510103912915, 0.2560911564485115, 0.13263638272662373, 0.1364427507019547, -0.02311506017234505, -0.10110843135591815, -0.32242897190975356, -0.14254393968731166, -0.1817369496340261, 0.07127545105348176, -0.08698589418268324, -0.22257650601951515, 0.4453216507483055, 0.13244136898394893, 0.2255353190443095, 0.1120074249105528, 0.29575983402045336, 0.09324472811199752, 0.05504242763786084, 0.043530484065687394, 0.12633232066736502, 0.10540131580303697, 0.1019306369125843, -0.15040571716586676, 0.0980745923705399, 0.092154821665848] |
1,802.00679 | A version of the Loebl-Koml\'os-S\'os conjecture for skewed trees | Loebl, Koml\'os, and S\'os conjectured that any graph with at least half of
its vertices of degree at least k contains every tree with at most k edges. We
propose a version of this conjecture for skewed trees, i.e., we consider the
class of trees with at most k edges such that the sizes of the colour classes
of the trees have a given ratio. We show that our conjecture is asymptotically
correct for dense graphs. The proof relies on the regularity method. Our result
implies bounds on Ramsey number of several trees of given skew.
| math.CO | loebl komlos and sos conjectured that any graph with at least half of its vertices of degree at least k contains every tree with at most k edges we propose a version of this conjecture for skewed trees ie we consider the class of trees with at most k edges such that the sizes of the colour classes of the trees have a given ratio we show that our conjecture is asymptotically correct for dense graphs the proof relies on the regularity method our result implies bounds on ramsey number of several trees of given skew | [['loebl', 'komlos', 'and', 'sos', 'conjectured', 'that', 'any', 'graph', 'with', 'at', 'least', 'half', 'of', 'its', 'vertices', 'of', 'degree', 'at', 'least', 'k', 'contains', 'every', 'tree', 'with', 'at', 'most', 'k', 'edges', 'we', 'propose', 'a', 'version', 'of', 'this', 'conjecture', 'for', 'skewed', 'trees', 'ie', 'we', 'consider', 'the', 'class', 'of', 'trees', 'with', 'at', 'most', 'k', 'edges', 'such', 'that', 'the', 'sizes', 'of', 'the', 'colour', 'classes', 'of', 'the', 'trees', 'have', 'a', 'given', 'ratio', 'we', 'show', 'that', 'our', 'conjecture', 'is', 'asymptotically', 'correct', 'for', 'dense', 'graphs', 'the', 'proof', 'relies', 'on', 'the', 'regularity', 'method', 'our', 'result', 'implies', 'bounds', 'on', 'ramsey', 'number', 'of', 'several', 'trees', 'of', 'given', 'skew']] | [-0.15555809832100445, 0.12178034500478437, -0.0705150318002173, 0.010616841997640828, -0.04574583344704782, -0.11956459529756103, 0.06800964832655154, 0.3499353378235052, -0.22506243590760278, -0.3191315787262283, 0.09337879724383431, -0.3078912845182155, -0.13820613677671645, 0.14624081367946928, -0.07782579590154153, -0.002066346494757454, 0.10656683598062955, 0.09978359080074976, 0.015575512765887348, -0.344381282861832, 0.3388044655633469, -0.02854871324962005, 0.17833953369942415, 0.0993466787719323, 0.12120728203444742, 0.06553548688922699, -0.02238061334840798, 0.0581142077135155, -0.1701870532620736, 0.11003400580860519, 0.24409744830336422, 0.17345900407720669, 0.2451321544261494, -0.33702123858620325, -0.14259062552688798, 0.19596674886512724, 0.08448523668691148, 0.09640585570014082, -0.005723148242395837, -0.1806116302808126, 0.18949753980511255, -0.06260559836800894, -0.14358108375260295, 0.0283579175156774, 0.06638745262171142, -0.005328200524672866, -0.2618478896523205, 0.018022178793520045, 0.1404777341231238, 0.05221015933784656, 0.05584502591106381, -0.2202432658862866, -0.048272455293044914, 0.05942709088655344, -0.030361067560685722, 0.04233562472533473, 0.00526836997535914, -0.11362981796961928, -0.18182628924841993, 0.32886352043230244, -0.05180311457661446, -0.12402691056195181, 0.1847625118874324, -0.16133153165477174, -0.2336945178200646, 0.10965117478432755, 0.12395559165937205, 0.1850695200520628, -0.053091118490556255, 0.09996288342942232, -0.16107929329155013, 0.13691062618939517, 0.16884497275653607, 0.01931740798075528, 0.16232055011399402, 0.15003170482426262, 0.17103338603677307, 0.18214725778670982, -0.032649218056273334, 0.025358211816637777, -0.28295639652545407, -0.11345433273042242, -0.2191893628781448, 0.040574280161915034, -0.2145250161312712, -0.21838647870148029, 0.377891323275738, 0.1417188882138968, 0.23043326931656338, 0.20563010283512995, 0.2127212309084522, 0.08119725565241727, 0.06868505423578124, 0.19561382487396864, 0.11061846303831165, 0.1708059706046091, -0.015117846487555653, -0.1256838748086011, 0.11730106872225103, 0.16392071883698614] |
1,802.0068 | A Generative Model for Natural Sounds Based on Latent Force Modelling | Recent advances in analysis of subband amplitude envelopes of natural sounds
have resulted in convincing synthesis, showing subband amplitudes to be a
crucial component of perception. Probabilistic latent variable analysis is
particularly revealing, but existing approaches don't incorporate prior
knowledge about the physical behaviour of amplitude envelopes, such as
exponential decay and feedback. We use latent force modelling, a probabilistic
learning paradigm that incorporates physical knowledge into Gaussian process
regression, to model correlation across spectral subband envelopes. We augment
the standard latent force model approach by explicitly modelling correlations
over multiple time steps. Incorporating this prior knowledge strengthens the
interpretation of the latent functions as the source that generated the signal.
We examine this interpretation via an experiment which shows that sounds
generated by sampling from our probabilistic model are perceived to be more
realistic than those generated by similar models based on nonnegative matrix
factorisation, even in cases where our model is outperformed from a
reconstruction error perspective.
| cs.LG cs.SD eess.AS stat.ML | recent advances in analysis of subband amplitude envelopes of natural sounds have resulted in convincing synthesis showing subband amplitudes to be a crucial component of perception probabilistic latent variable analysis is particularly revealing but existing approaches dont incorporate prior knowledge about the physical behaviour of amplitude envelopes such as exponential decay and feedback we use latent force modelling a probabilistic learning paradigm that incorporates physical knowledge into gaussian process regression to model correlation across spectral subband envelopes we augment the standard latent force model approach by explicitly modelling correlations over multiple time steps incorporating this prior knowledge strengthens the interpretation of the latent functions as the source that generated the signal we examine this interpretation via an experiment which shows that sounds generated by sampling from our probabilistic model are perceived to be more realistic than those generated by similar models based on nonnegative matrix factorisation even in cases where our model is outperformed from a reconstruction error perspective | [['recent', 'advances', 'in', 'analysis', 'of', 'subband', 'amplitude', 'envelopes', 'of', 'natural', 'sounds', 'have', 'resulted', 'in', 'convincing', 'synthesis', 'showing', 'subband', 'amplitudes', 'to', 'be', 'a', 'crucial', 'component', 'of', 'perception', 'probabilistic', 'latent', 'variable', 'analysis', 'is', 'particularly', 'revealing', 'but', 'existing', 'approaches', 'dont', 'incorporate', 'prior', 'knowledge', 'about', 'the', 'physical', 'behaviour', 'of', 'amplitude', 'envelopes', 'such', 'as', 'exponential', 'decay', 'and', 'feedback', 'we', 'use', 'latent', 'force', 'modelling', 'a', 'probabilistic', 'learning', 'paradigm', 'that', 'incorporates', 'physical', 'knowledge', 'into', 'gaussian', 'process', 'regression', 'to', 'model', 'correlation', 'across', 'spectral', 'subband', 'envelopes', 'we', 'augment', 'the', 'standard', 'latent', 'force', 'model', 'approach', 'by', 'explicitly', 'modelling', 'correlations', 'over', 'multiple', 'time', 'steps', 'incorporating', 'this', 'prior', 'knowledge', 'strengthens', 'the', 'interpretation', 'of', 'the', 'latent', 'functions', 'as', 'the', 'source', 'that', 'generated', 'the', 'signal', 'we', 'examine', 'this', 'interpretation', 'via', 'an', 'experiment', 'which', 'shows', 'that', 'sounds', 'generated', 'by', 'sampling', 'from', 'our', 'probabilistic', 'model', 'are', 'perceived', 'to', 'be', 'more', 'realistic', 'than', 'those', 'generated', 'by', 'similar', 'models', 'based', 'on', 'nonnegative', 'matrix', 'factorisation', 'even', 'in', 'cases', 'where', 'our', 'model', 'is', 'outperformed', 'from', 'a', 'reconstruction', 'error', 'perspective']] | [-0.026651470968060476, 0.06718591244610499, -0.12141205910476124, 0.10274327982628417, -0.1359705818764303, -0.14112599143383545, 0.05013304165675767, 0.42292689569528746, -0.2833307537179932, -0.30847685226479415, 0.06074922161730323, -0.23618997364310818, -0.19697485420685965, 0.1844010084176307, -0.062468011312936465, 0.046494292944622866, 0.0936525845197293, 0.00552296720052712, -0.04974506995728556, -0.18207624723912222, 0.3228142567845823, 0.06262281155740877, 0.28734366084982016, -0.03317874310385881, 0.0951620012978619, 0.013960024948911331, -0.11084454498362124, -0.03852264160493218, -0.05380120603714553, 0.12269300646543994, 0.2694942398042224, 0.18293940658394084, 0.28791547414653423, -0.42280655257175415, -0.3347437488787907, 0.08815815676671435, 0.14399165405054232, 0.10627663832775804, -0.014115309588477138, -0.30305184208372105, 0.04650282892017807, -0.18817287426933926, -0.0286154838237888, -0.10722118760341978, -0.03082078111609854, -0.03784763251904041, -0.304712642800962, 0.10215529475841413, 0.13547601997149442, 0.06102300977990406, -0.06831841022156929, -0.16185419551102714, 0.015535515618844415, 0.12647631204739776, 0.05721514769401489, 0.02942974920788745, 0.13872772103187236, -0.1463591365272519, -0.12486393836403042, 0.33356329497482934, -0.08420320347424834, -0.21106119594484005, 0.1791822153609246, -0.1069955478316911, -0.13731546610090062, 0.12576140147639708, 0.19326585064987717, 0.07234373530804959, -0.1581031475845818, 0.03275121913881644, -0.0286307068447928, 0.22351450413324922, 0.05248122752509402, 0.024756417477960296, 0.2061221260964027, 0.18094954338018437, -0.018121099306721497, 0.10924922987604924, -0.07656235575716966, -0.13544747922803807, -0.2555630754583527, -0.07996539799232949, -0.18756351521481765, 0.013525180467375138, -0.10500067116613222, -0.1553899630927627, 0.39397907103616864, 0.2004400156379777, 0.20753617815193046, 0.08176633651692672, 0.34300962582511724, 0.11060938724673956, 0.07066288695278221, 0.0509531113500586, 0.17538660998073988, 0.10632820009201202, 0.07755302428926851, -0.15260995974553362, 0.15103358188102245, 0.02775961666004791] |
1,802.00681 | Approximating fixed point of({\lambda},{\rho})-firmly nonexpansive
mappings in modular function spaces | In this paper, we first introduce an iterative process in modular function
spaces and then extend the idea of a {\lambda}-firmly nonexpansive mapping from
Banach spaces to modular function spaces. We call such mappings as
({\lambda},{\rho})-firmly nonexpansive mappings. We incorporate the two ideas
to approximate fixed points of ({\lambda},{\rho})-firmly nonexpansive mappings
using the above mentioned iterative process in modular function spaces. We give
an example to validate our results.
| math.FA | in this paper we first introduce an iterative process in modular function spaces and then extend the idea of a lambdafirmly nonexpansive mapping from banach spaces to modular function spaces we call such mappings as lambdarhofirmly nonexpansive mappings we incorporate the two ideas to approximate fixed points of lambdarhofirmly nonexpansive mappings using the above mentioned iterative process in modular function spaces we give an example to validate our results | [['in', 'this', 'paper', 'we', 'first', 'introduce', 'an', 'iterative', 'process', 'in', 'modular', 'function', 'spaces', 'and', 'then', 'extend', 'the', 'idea', 'of', 'a', 'lambdafirmly', 'nonexpansive', 'mapping', 'from', 'banach', 'spaces', 'to', 'modular', 'function', 'spaces', 'we', 'call', 'such', 'mappings', 'as', 'lambdarhofirmly', 'nonexpansive', 'mappings', 'we', 'incorporate', 'the', 'two', 'ideas', 'to', 'approximate', 'fixed', 'points', 'of', 'lambdarhofirmly', 'nonexpansive', 'mappings', 'using', 'the', 'above', 'mentioned', 'iterative', 'process', 'in', 'modular', 'function', 'spaces', 'we', 'give', 'an', 'example', 'to', 'validate', 'our', 'results']] | [-0.0808307447357837, 0.019747320679457378, -0.10139941477752996, 0.14239585736906907, -0.07987779161935164, -0.0641393183067328, 0.0844218077183927, 0.4338005469039534, -0.37920645630043565, -0.14617055709558455, 0.11732575674294353, -0.266111721157689, -0.24856722865705239, 0.1981598406070561, -0.15426259258564448, 0.10696752401153473, -0.009571941802278161, -0.025348523180141594, -0.19159017617560245, -0.2820784625787796, 0.5000459345226939, 0.0010541690033719394, 0.1775679876040103, 0.033942592767716356, 0.1558367791938398, 0.05828671889012736, -0.022089222812968674, -0.09016360532294845, -0.1604862446600402, 0.11804558249246894, 0.34365160044663673, 0.1619014419248384, 0.3399845820033189, -0.3643809938238877, -0.13567185861227865, 0.17629788784931102, 0.12676076157103208, -0.004207509573351479, -0.05713054495440288, -0.2989735740490935, 0.04276497532246691, -0.12108580896517995, -0.10613010004233343, -0.1611975161923152, -0.06798561248279204, 0.06380433359211593, -0.3316330096515065, -0.09626950818875973, 0.12827712830833413, 0.09667423872672247, -0.14125229873355816, -0.056517829532932606, 0.028418794468355674, 0.10537493019364774, -0.0027909690918132774, 0.12361571825617416, 0.1186145127779155, 0.03304720741597879, -0.15012030109452704, 0.28317549023212807, -0.06435764264879805, -0.2529382157619252, 0.17014469972557641, -0.08796553178267046, -0.23474564758185862, 0.05840802592909754, 0.1922787632793188, 0.1775360316828345, -0.15189790669969763, 0.13445116405879767, -0.09566522721257625, 0.09280272271258361, 0.05520185002718459, -0.017685056043167908, 0.09173781526359645, 0.1336129175668413, 0.14073464023231558, 0.24472536588666227, 0.037408113860609854, -0.0806748839483286, -0.35229605921741686, -0.1794737188258406, -0.14917053187717544, 0.00025276857724582607, -0.11697853599991614, -0.18966558334332975, 0.3648220777060046, 0.19176881178987748, 0.23812944128065172, 0.17117771215623978, 0.20938142507591032, 0.109318240425747, 0.019060801799324425, 0.09829971865242855, 0.1674787163854379, 0.13292303394568575, 0.05161370016690908, -0.045747059217484835, -0.06197828281614365, 0.24659994762447296] |
1,802.00682 | How do Humans Understand Explanations from Machine Learning Systems? An
Evaluation of the Human-Interpretability of Explanation | Recent years have seen a boom in interest in machine learning systems that
can provide a human-understandable rationale for their predictions or
decisions. However, exactly what kinds of explanation are truly
human-interpretable remains poorly understood. This work advances our
understanding of what makes explanations interpretable in the specific context
of verification. Suppose we have a machine learning system that predicts X, and
we provide rationale for this prediction X. Given an input, an explanation, and
an output, is the output consistent with the input and the supposed rationale?
Via a series of user-studies, we identify what kinds of increases in complexity
have the greatest effect on the time it takes for humans to verify the
rationale, and which seem relatively insensitive.
| cs.AI | recent years have seen a boom in interest in machine learning systems that can provide a humanunderstandable rationale for their predictions or decisions however exactly what kinds of explanation are truly humaninterpretable remains poorly understood this work advances our understanding of what makes explanations interpretable in the specific context of verification suppose we have a machine learning system that predicts x and we provide rationale for this prediction x given an input an explanation and an output is the output consistent with the input and the supposed rationale via a series of userstudies we identify what kinds of increases in complexity have the greatest effect on the time it takes for humans to verify the rationale and which seem relatively insensitive | [['recent', 'years', 'have', 'seen', 'a', 'boom', 'in', 'interest', 'in', 'machine', 'learning', 'systems', 'that', 'can', 'provide', 'a', 'humanunderstandable', 'rationale', 'for', 'their', 'predictions', 'or', 'decisions', 'however', 'exactly', 'what', 'kinds', 'of', 'explanation', 'are', 'truly', 'humaninterpretable', 'remains', 'poorly', 'understood', 'this', 'work', 'advances', 'our', 'understanding', 'of', 'what', 'makes', 'explanations', 'interpretable', 'in', 'the', 'specific', 'context', 'of', 'verification', 'suppose', 'we', 'have', 'a', 'machine', 'learning', 'system', 'that', 'predicts', 'x', 'and', 'we', 'provide', 'rationale', 'for', 'this', 'prediction', 'x', 'given', 'an', 'input', 'an', 'explanation', 'and', 'an', 'output', 'is', 'the', 'output', 'consistent', 'with', 'the', 'input', 'and', 'the', 'supposed', 'rationale', 'via', 'a', 'series', 'of', 'userstudies', 'we', 'identify', 'what', 'kinds', 'of', 'increases', 'in', 'complexity', 'have', 'the', 'greatest', 'effect', 'on', 'the', 'time', 'it', 'takes', 'for', 'humans', 'to', 'verify', 'the', 'rationale', 'and', 'which', 'seem', 'relatively', 'insensitive']] | [-0.07195725337563393, 0.07142978720306321, -0.09473880820636017, 0.10009125540479241, -0.11033918512209008, -0.15046856377351409, 0.04220793676407387, 0.4093870439256231, -0.2558194135121691, -0.30866942583816126, 0.09318563854321837, -0.23258697123189145, -0.20846155745869813, 0.21203108020272338, -0.13483718937883774, 0.03879209024986873, 0.060042291932040824, 0.07057451381745826, -0.03203178888264423, -0.26409545200876894, 0.279784172885896, 0.05641344622320806, 0.2928470075712539, 0.040974460751749577, 0.11124760559760034, -0.02826482801659343, -0.03632758858584566, -0.008667740679811686, -0.10534686157152465, 0.14697638142388314, 0.29961038715361304, 0.20950751022513334, 0.32098235342418774, -0.42505533125561973, -0.2147361903373773, 0.10151604918161562, 0.13898295902763494, 0.11547577736879854, -0.06359530022309627, -0.24446463160372028, 0.07088776233819469, -0.1543863387933622, -0.09092971143157531, -0.140485955698144, 0.0583637931306536, -0.03172575212617327, -0.23402087783809597, -0.007224461936857551, 0.10244541929569095, 0.08188032521090159, -0.054128218162804845, -0.12493436790052025, 0.05328077883265602, 0.14897354759159498, 0.07437335041468032, 0.05204252763457286, 0.08214129157519588, -0.1697406994140086, -0.14891438843527188, 0.3966615546300697, -0.01820204485168991, -0.15125214472063817, 0.22642135774561514, -0.11602903855770516, -0.17274089388592984, 0.08447170356521383, 0.1751796046931607, 0.07542707000005369, -0.14565008574087793, 0.027979822664444026, -0.054882066264205304, 0.18739927055236574, 0.009541041012077282, 0.036618112025704856, 0.28194115598065156, 0.2331290954723954, -0.016560687652478614, 0.09344866298294316, -0.023157036678458098, -0.07210893502730566, -0.2921227668625458, -0.1480692857488369, -0.1337730940800005, 0.04324342533946037, -0.03650835300747227, -0.13098005370702595, 0.36115923806404077, 0.22021423382114638, 0.26382338716830417, 0.0568442529833798, 0.2915943334189554, 0.0939263033651514, 0.056235301438330984, 0.0697077691865464, 0.23379707300337033, 0.06695139361545444, 0.10720029266861578, -0.14933291535514095, 0.19045928524671277, -0.01408182227363189] |
1,802.00683 | Disentangling Respiratory Sinus Arrhythmia in Heart Rate Variability
Records | Different measures of heart rate variability and particularly of respiratory
sinus arrhythmia are widely used in research and clinical applications.
Inspired by the ideas from the theory of coupled oscillators, we use
simultaneous measurements of respiratory and cardiac activity to perform a
nonlinear decomposition of the heart rate variability into the
respiratory-related component and the rest. We suggest to exploit the technique
as a universal preprocessing tool, both for the analysis of respiratory
influence on the heart rate as well as in cases when effects of other factors
on the heart rate variability are in focus. The theoretical consideration is
illustrated by the analysis of 25 data sets from healthy subjects.
| physics.med-ph nlin.PS physics.bio-ph | different measures of heart rate variability and particularly of respiratory sinus arrhythmia are widely used in research and clinical applications inspired by the ideas from the theory of coupled oscillators we use simultaneous measurements of respiratory and cardiac activity to perform a nonlinear decomposition of the heart rate variability into the respiratoryrelated component and the rest we suggest to exploit the technique as a universal preprocessing tool both for the analysis of respiratory influence on the heart rate as well as in cases when effects of other factors on the heart rate variability are in focus the theoretical consideration is illustrated by the analysis of 25 data sets from healthy subjects | [['different', 'measures', 'of', 'heart', 'rate', 'variability', 'and', 'particularly', 'of', 'respiratory', 'sinus', 'arrhythmia', 'are', 'widely', 'used', 'in', 'research', 'and', 'clinical', 'applications', 'inspired', 'by', 'the', 'ideas', 'from', 'the', 'theory', 'of', 'coupled', 'oscillators', 'we', 'use', 'simultaneous', 'measurements', 'of', 'respiratory', 'and', 'cardiac', 'activity', 'to', 'perform', 'a', 'nonlinear', 'decomposition', 'of', 'the', 'heart', 'rate', 'variability', 'into', 'the', 'respiratoryrelated', 'component', 'and', 'the', 'rest', 'we', 'suggest', 'to', 'exploit', 'the', 'technique', 'as', 'a', 'universal', 'preprocessing', 'tool', 'both', 'for', 'the', 'analysis', 'of', 'respiratory', 'influence', 'on', 'the', 'heart', 'rate', 'as', 'well', 'as', 'in', 'cases', 'when', 'effects', 'of', 'other', 'factors', 'on', 'the', 'heart', 'rate', 'variability', 'are', 'in', 'focus', 'the', 'theoretical', 'consideration', 'is', 'illustrated', 'by', 'the', 'analysis', 'of', '25', 'data', 'sets', 'from', 'healthy', 'subjects']] | [-0.04880453326781704, 0.06125133224466646, -0.06531697443517094, 0.06295189666032622, -0.02224639621563256, -0.11926822754639116, 0.04411485790677199, 0.32407163412902845, -0.2457543732894754, -0.2548915998205881, 0.19696339006980204, -0.2802655002586438, -0.19987997252663428, 0.3050697407642887, -0.10146559334190731, 0.050222792832011524, 0.0732199045279148, 0.06795234942639417, 0.012113546474244107, -0.20037617213939402, 0.2754633009052751, 0.038437884402546016, 0.3650338017635725, 0.03370645909718323, 0.09550124984763732, 0.027246081282977352, -0.08727157900363884, -0.012887083858516814, -0.09122879144481637, 0.12903878405605526, 0.3053296615284952, 0.19172314781039446, 0.30558252184736456, -0.43557942186228255, -0.2505484448068521, 0.058165714517235755, 0.10063097062732347, 0.07869694334962829, -0.024792681450278246, -0.2741251814687117, 0.07029198556027205, -0.12048246076499874, -0.07126819985199043, -0.04476415724493563, 0.01138013887473128, 0.03995088007809086, -0.2641974211416461, 0.1702181018423289, 0.006666053544507701, 0.1659600937908346, -0.09709913974035192, -0.09016151031987234, 0.004068195390176367, 0.20900011975662147, 0.11897384128744969, 0.015335705465721813, 0.16662438401783056, -0.1516029718797654, -0.13274571732194587, 0.3655347566797652, -0.061218187809837135, -0.14550075147893618, 0.22440872447649865, -0.12703147572041912, -0.12166661963671108, 0.0921750261363658, 0.2312241128286008, 0.10276989875869318, -0.17329954467991643, -0.013445670896379108, 0.08300660631238398, 0.17057895498688924, 0.03109704495661638, 0.017456556810066103, 0.1534482677297836, 0.20907005999364298, -0.03002172078281133, 0.14581257770398887, -0.1469915315635841, -0.06709159632128749, -0.247898487187922, -0.10430892417419024, -0.10888181575997309, 0.009960703600452028, -0.07738956154101867, -0.13325914193198762, 0.4499844387342984, 0.13199953382189217, 0.1770749120041728, -0.011939765292812477, 0.2906540524891832, 0.061018436190418225, 0.07093274859203534, 0.007116934830661524, 0.23494348490653053, 0.13501595105150377, 0.06395948382771828, -0.26122825529257004, 0.09917775558900427, 0.03566521391145546] |
1,802.00684 | Privacy of Information Sharing Schemes in a Cloud-based Multi-sensor
Estimation Problem | In this paper, we consider a multi-sensor estimation problem wherein each
sensor collects noisy information about its local process, which is only
observed by that sensor, and a common process, which is simultaneously observed
by all sensors. The objective is to assess the privacy level of (the local
process of) each sensor while the common process is estimated using cloud
computing technology. The privacy level of a sensor is defined as the
conditional entropy of its local process given the shared information with the
cloud. Two information sharing schemes are considered: a local scheme, and a
global scheme. Under the local scheme, each sensor estimates the common process
based on its the measurement and transmits its estimate to a cloud. Under the
global scheme, the cloud receives the sum of sensors' measurements. It is shown
that, in the local scheme, the privacy level of each sensor is always above a
certain level which is characterized using Shannon's mutual information. It is
also proved that this result becomes tight as the number of sensors increases.
We also show that the global scheme is asymptotically private, i.e., the
privacy loss of the global scheme decreases to zero at the rate of O(1/M) where
M is the number of sensors.
| math.OC | in this paper we consider a multisensor estimation problem wherein each sensor collects noisy information about its local process which is only observed by that sensor and a common process which is simultaneously observed by all sensors the objective is to assess the privacy level of the local process of each sensor while the common process is estimated using cloud computing technology the privacy level of a sensor is defined as the conditional entropy of its local process given the shared information with the cloud two information sharing schemes are considered a local scheme and a global scheme under the local scheme each sensor estimates the common process based on its the measurement and transmits its estimate to a cloud under the global scheme the cloud receives the sum of sensors measurements it is shown that in the local scheme the privacy level of each sensor is always above a certain level which is characterized using shannons mutual information it is also proved that this result becomes tight as the number of sensors increases we also show that the global scheme is asymptotically private ie the privacy loss of the global scheme decreases to zero at the rate of o1m where m is the number of sensors | [['in', 'this', 'paper', 'we', 'consider', 'a', 'multisensor', 'estimation', 'problem', 'wherein', 'each', 'sensor', 'collects', 'noisy', 'information', 'about', 'its', 'local', 'process', 'which', 'is', 'only', 'observed', 'by', 'that', 'sensor', 'and', 'a', 'common', 'process', 'which', 'is', 'simultaneously', 'observed', 'by', 'all', 'sensors', 'the', 'objective', 'is', 'to', 'assess', 'the', 'privacy', 'level', 'of', 'the', 'local', 'process', 'of', 'each', 'sensor', 'while', 'the', 'common', 'process', 'is', 'estimated', 'using', 'cloud', 'computing', 'technology', 'the', 'privacy', 'level', 'of', 'a', 'sensor', 'is', 'defined', 'as', 'the', 'conditional', 'entropy', 'of', 'its', 'local', 'process', 'given', 'the', 'shared', 'information', 'with', 'the', 'cloud', 'two', 'information', 'sharing', 'schemes', 'are', 'considered', 'a', 'local', 'scheme', 'and', 'a', 'global', 'scheme', 'under', 'the', 'local', 'scheme', 'each', 'sensor', 'estimates', 'the', 'common', 'process', 'based', 'on', 'its', 'the', 'measurement', 'and', 'transmits', 'its', 'estimate', 'to', 'a', 'cloud', 'under', 'the', 'global', 'scheme', 'the', 'cloud', 'receives', 'the', 'sum', 'of', 'sensors', 'measurements', 'it', 'is', 'shown', 'that', 'in', 'the', 'local', 'scheme', 'the', 'privacy', 'level', 'of', 'each', 'sensor', 'is', 'always', 'above', 'a', 'certain', 'level', 'which', 'is', 'characterized', 'using', 'shannons', 'mutual', 'information', 'it', 'is', 'also', 'proved', 'that', 'this', 'result', 'becomes', 'tight', 'as', 'the', 'number', 'of', 'sensors', 'increases', 'we', 'also', 'show', 'that', 'the', 'global', 'scheme', 'is', 'asymptotically', 'private', 'ie', 'the', 'privacy', 'loss', 'of', 'the', 'global', 'scheme', 'decreases', 'to', 'zero', 'at', 'the', 'rate', 'of', 'o1m', 'where', 'm', 'is', 'the', 'number', 'of', 'sensors']] | [-0.1678401825736965, 0.052692772459535714, -0.06635933295387217, 0.014246314867204343, -0.01742465240691883, -0.16885704105575952, 0.09557234802438568, 0.3434427153085165, -0.32668423954091497, -0.2870921021246392, 0.1255477573238943, -0.2787130091537312, -0.13215164718210273, 0.1500837851950116, -0.11723792477756073, 0.06697860725138534, 0.03451178775276935, 0.13440898328272688, -0.006096830051662266, -0.2834801893953486, 0.32562780824764337, 0.08865306367152843, 0.33996785483390524, 0.03765009747815863, 0.17678407016536446, 0.020809857989099, -0.043209460451479116, 0.006029555326606629, -0.07345847219888431, 0.13849058154810687, 0.2311262558889238, 0.17845708675736535, 0.3330985095063989, -0.37665994688958504, -0.20045228888717107, 0.10816850987429492, 0.09300465941438137, 0.08477719038373967, -0.03251209388743492, -0.2726263343019114, 0.1552946824852629, -0.16608677842712777, -0.06741136159063969, -0.007373056280008261, -0.019019769279709185, 0.02040004082319916, -0.34235213164708034, 0.046030909819292254, 0.02614130242165304, 0.0274541933822855, -0.04615688152444787, -0.045455633217225906, -0.05055239549635545, 0.1681621361406889, 0.013820822552298669, 0.029625855539790424, 0.20234261147884858, -0.12650956128440474, -0.07596843946131243, 0.35891059699247857, -0.021023628007224647, -0.18784686129153277, 0.13766746748810194, -0.1104449598154656, -0.10302240000703093, 0.11207371776257664, 0.1438977210265067, 0.10739670354189072, -0.1892301775155148, 0.05501311988561922, -0.04951093179412222, 0.1687946225952915, 0.020894841677936666, 0.09469845347052468, 0.1491367460952865, 0.16596352267821413, 0.17515166110813546, 0.11725878090471713, -0.13033572831393583, -0.09829123778907572, -0.2938114390950335, -0.14630900585241075, -0.2325150930656768, -0.006657109735308638, -0.08768751662752337, -0.11893328322490772, 0.34486270274898134, 0.16241254978745745, 0.23721006624895521, 0.026267968428069232, 0.4040249005086036, 0.1492084476288075, 0.07196952269417076, 0.09522132209506659, 0.20660904403168545, 0.08753147647729602, 0.10649688324468111, -0.17721252880680063, 0.13580418784837217, 0.028144375395236745] |
1,802.00685 | Ultrafast Response of Plasmonic Nanostructures | Plasmonic metal nanostructures are an integral part of nanophotonic device
applications owing to their ability to generate strong localized
electromagnetic fields when illuminated from the far-field. These
nanostructures can be prepared in the laboratory with precise shape and size by
various chemical and physical synthesis techniques as demonstrated in recent
years. Typically, the size of these structures is in the range of few nm to a
few hundred nm, i.e., much below the wavelength of light of observation or
excitation. The focus of this chapter is to exploit the ultrafast response of
metal nanostructures following femtosecond laser pulse excitation. Femtosecond
laser pulses are very important experimental probes to explore the material
response at an ultrafast time scale (~10-10,000 fs) on the order of the
electronic and vibrational wave packet dynamics in solids and molecules.
Broadly, after ultrafast optical excitation the system of study undergoes
various microscopic dynamical changes which can be monitored in real time so as
to understand the intermediate stages before the system returns to the
equilibrium.
| cond-mat.mes-hall | plasmonic metal nanostructures are an integral part of nanophotonic device applications owing to their ability to generate strong localized electromagnetic fields when illuminated from the farfield these nanostructures can be prepared in the laboratory with precise shape and size by various chemical and physical synthesis techniques as demonstrated in recent years typically the size of these structures is in the range of few nm to a few hundred nm ie much below the wavelength of light of observation or excitation the focus of this chapter is to exploit the ultrafast response of metal nanostructures following femtosecond laser pulse excitation femtosecond laser pulses are very important experimental probes to explore the material response at an ultrafast time scale 1010000 fs on the order of the electronic and vibrational wave packet dynamics in solids and molecules broadly after ultrafast optical excitation the system of study undergoes various microscopic dynamical changes which can be monitored in real time so as to understand the intermediate stages before the system returns to the equilibrium | [['plasmonic', 'metal', 'nanostructures', 'are', 'an', 'integral', 'part', 'of', 'nanophotonic', 'device', 'applications', 'owing', 'to', 'their', 'ability', 'to', 'generate', 'strong', 'localized', 'electromagnetic', 'fields', 'when', 'illuminated', 'from', 'the', 'farfield', 'these', 'nanostructures', 'can', 'be', 'prepared', 'in', 'the', 'laboratory', 'with', 'precise', 'shape', 'and', 'size', 'by', 'various', 'chemical', 'and', 'physical', 'synthesis', 'techniques', 'as', 'demonstrated', 'in', 'recent', 'years', 'typically', 'the', 'size', 'of', 'these', 'structures', 'is', 'in', 'the', 'range', 'of', 'few', 'nm', 'to', 'a', 'few', 'hundred', 'nm', 'ie', 'much', 'below', 'the', 'wavelength', 'of', 'light', 'of', 'observation', 'or', 'excitation', 'the', 'focus', 'of', 'this', 'chapter', 'is', 'to', 'exploit', 'the', 'ultrafast', 'response', 'of', 'metal', 'nanostructures', 'following', 'femtosecond', 'laser', 'pulse', 'excitation', 'femtosecond', 'laser', 'pulses', 'are', 'very', 'important', 'experimental', 'probes', 'to', 'explore', 'the', 'material', 'response', 'at', 'an', 'ultrafast', 'time', 'scale', '1010000', 'fs', 'on', 'the', 'order', 'of', 'the', 'electronic', 'and', 'vibrational', 'wave', 'packet', 'dynamics', 'in', 'solids', 'and', 'molecules', 'broadly', 'after', 'ultrafast', 'optical', 'excitation', 'the', 'system', 'of', 'study', 'undergoes', 'various', 'microscopic', 'dynamical', 'changes', 'which', 'can', 'be', 'monitored', 'in', 'real', 'time', 'so', 'as', 'to', 'understand', 'the', 'intermediate', 'stages', 'before', 'the', 'system', 'returns', 'to', 'the', 'equilibrium']] | [-0.10340055492127964, 0.19288408943777766, -0.06482439815788668, 0.00681268004149463, -0.017724033246731618, -0.11847531914190229, 0.0098446326167736, 0.4867367655611955, -0.29421779032543127, -0.3315117154136085, 0.07825197804286613, -0.2618062083882186, -0.0917805513234798, 0.2287719695203381, 0.018760028306929362, 0.07884559458718889, 0.005864001935921037, -0.04771836970232912, -0.021253361526501955, -0.15519976274650435, 0.2590139928548018, 0.07515294770947822, 0.2680889160273123, 0.06091441465376397, 0.07333572647470937, -0.019494601599288314, 0.04593794634731035, -0.07652479620683475, -0.09253540607692795, 0.09600534208761094, 0.2832286045595538, 0.0023055212501954486, 0.2733532060185701, -0.5239344118328313, -0.25565371169163104, 0.014810190631487247, 0.14182589850911992, 0.1614006807519255, -0.05282313793349306, -0.2731660305654641, 0.03720783125388728, -0.09652835428824968, -0.13538196568581215, -0.062000468784540935, 0.04762453693047871, 0.07018322517686199, -0.20417787783060046, 0.0034328288372506843, 0.011353693759039916, 0.0819810153377024, -0.06075407944884173, -0.0478119863784106, -0.029225029160141858, 0.08409683030879142, 0.025966675113059976, 0.031133794038385683, 0.22428441090652576, -0.13412630692718153, -0.07531971905446617, 0.3989996347168582, -0.044970473619012616, -0.040647439807432996, 0.20923718123851046, -0.19798722629815604, -0.024975602530885335, 0.2047492854941923, 0.19392684949987318, 0.1613536592842956, -0.15368627915828773, 0.003982649009796025, 0.037689073912378475, 0.25107457654098786, 0.11627445333484372, 0.15517895439014215, 0.23837712847905995, 0.22757569055028876, -0.009050365679996562, 0.13242086591942998, -0.10127972704689046, -0.04469850592965469, -0.2182733913519855, -0.11899409367952264, -0.20173277817225668, 0.09063422061341399, -0.047793667832614725, -0.13573711324681545, 0.44806235649253756, 0.15740786676058138, 0.15173221326890518, -0.04676706358423931, 0.2813073501056997, 0.10434215054186007, 0.06464454985620487, -0.04520927223145477, 0.2787616577684141, 0.13071483504936407, 0.13775536587693282, -0.25133386622775433, 0.053385731596747664, -0.038409676474447436] |
1,802.00686 | Invariants for Laplacians on periodic graphs | We consider a Laplacian on periodic discrete graphs. Its spectrum consists of
a finite number of bands. In a class of periodic 1-forms, i.e., functions
defined on edges of the periodic graph, we introduce a subclass of minimal
forms with a minimal number $\cI$ of edges in their supports on the period. We
obtain a specific decomposition of the Laplacian into a direct integral in
terms of minimal forms, where fiber Laplacians (matrices) have the minimal
number $2\cI$ of coefficients depending on the quasimomentum and show that the
number $\cI$ is an invariant of the periodic graph. Using this decomposition,
we estimate the position of each band, the Lebesgue measure of the Laplacian
spectrum and the effective masses at the bottom of the spectrum in terms of the
invariant $\cI$ and the minimal forms. In addition, we consider an inverse
problem: we determine necessary and sufficient conditions for matrices
depending on the quasimomentum on a finite graph to be fiber Laplacians.
Moreover, similar results for Schr\"odinger operators with periodic potentials
are obtained.
| math.SP | we consider a laplacian on periodic discrete graphs its spectrum consists of a finite number of bands in a class of periodic 1forms ie functions defined on edges of the periodic graph we introduce a subclass of minimal forms with a minimal number ci of edges in their supports on the period we obtain a specific decomposition of the laplacian into a direct integral in terms of minimal forms where fiber laplacians matrices have the minimal number 2ci of coefficients depending on the quasimomentum and show that the number ci is an invariant of the periodic graph using this decomposition we estimate the position of each band the lebesgue measure of the laplacian spectrum and the effective masses at the bottom of the spectrum in terms of the invariant ci and the minimal forms in addition we consider an inverse problem we determine necessary and sufficient conditions for matrices depending on the quasimomentum on a finite graph to be fiber laplacians moreover similar results for schrodinger operators with periodic potentials are obtained | [['we', 'consider', 'a', 'laplacian', 'on', 'periodic', 'discrete', 'graphs', 'its', 'spectrum', 'consists', 'of', 'a', 'finite', 'number', 'of', 'bands', 'in', 'a', 'class', 'of', 'periodic', '1forms', 'ie', 'functions', 'defined', 'on', 'edges', 'of', 'the', 'periodic', 'graph', 'we', 'introduce', 'a', 'subclass', 'of', 'minimal', 'forms', 'with', 'a', 'minimal', 'number', 'ci', 'of', 'edges', 'in', 'their', 'supports', 'on', 'the', 'period', 'we', 'obtain', 'a', 'specific', 'decomposition', 'of', 'the', 'laplacian', 'into', 'a', 'direct', 'integral', 'in', 'terms', 'of', 'minimal', 'forms', 'where', 'fiber', 'laplacians', 'matrices', 'have', 'the', 'minimal', 'number', '2ci', 'of', 'coefficients', 'depending', 'on', 'the', 'quasimomentum', 'and', 'show', 'that', 'the', 'number', 'ci', 'is', 'an', 'invariant', 'of', 'the', 'periodic', 'graph', 'using', 'this', 'decomposition', 'we', 'estimate', 'the', 'position', 'of', 'each', 'band', 'the', 'lebesgue', 'measure', 'of', 'the', 'laplacian', 'spectrum', 'and', 'the', 'effective', 'masses', 'at', 'the', 'bottom', 'of', 'the', 'spectrum', 'in', 'terms', 'of', 'the', 'invariant', 'ci', 'and', 'the', 'minimal', 'forms', 'in', 'addition', 'we', 'consider', 'an', 'inverse', 'problem', 'we', 'determine', 'necessary', 'and', 'sufficient', 'conditions', 'for', 'matrices', 'depending', 'on', 'the', 'quasimomentum', 'on', 'a', 'finite', 'graph', 'to', 'be', 'fiber', 'laplacians', 'moreover', 'similar', 'results', 'for', 'schrodinger', 'operators', 'with', 'periodic', 'potentials', 'are', 'obtained']] | [-0.18430686552535025, 0.09284118085514825, -0.03353578506081163, 0.03361586317942854, -0.06614225873810767, -0.07414410554950959, 0.02738371869135234, 0.3682733814733114, -0.2501714832165785, -0.24049408779049303, 0.12198435520679739, -0.274789423425818, -0.14237529796865436, 0.16830766924019708, -0.05473213822496456, 0.05932009174340072, 0.08312284986744499, 0.1103191993400803, -0.086368693718251, -0.18555484047177934, 0.38690807436162616, -0.02609714780721748, 0.20777792440133702, 0.0747209543100836, 0.0908325022217213, 0.026428159535998665, -0.03234559647981976, -0.010865767268540218, -0.15845973625506324, 0.14288461298412203, 0.16953014842049377, 0.047743999352950976, 0.23157868652511931, -0.41507116884908135, -0.18288810722725957, 0.18175874841372258, 0.08845302987331796, 0.027971953921542878, 0.014234796821341267, -0.25666753107093665, 0.11796530942045892, -0.11454784180097587, -0.13781442221019918, -0.031581893561228196, 0.03686488217440004, 0.0372230492379756, -0.29130813460361366, 0.041250013617481436, 0.038437190367595145, 0.07278143027960732, -0.09026959159395151, -0.11335705644696166, -0.05616370396013236, 0.09692071042192435, -0.022445015530292576, -0.04733787473663552, 0.055148753038013885, -0.08617629142538018, -0.10696256375866152, 0.38175654595946534, -0.11398653880480611, -0.2710650251492074, 0.1500480559774353, -0.14643591459927677, -0.135360699525506, 0.10261689344480938, 0.17115240624414113, 0.12772227842251807, -0.09361610276221533, 0.14989157358037405, -0.09065634806025011, 0.137281500358592, 0.09304222525288051, 0.057357221953461913, 0.15206065299043878, 0.10576282010538972, 0.15366184001527072, 0.17208456718676032, -0.05618311793268359, -0.04483534532397637, -0.3173140616139822, -0.15924224228058992, -0.22743134063053114, 0.05799958263850657, -0.14438469158856562, -0.2582757277604824, 0.5102395196472518, 0.057489755834478, 0.24540949692916975, 0.0914287677862578, 0.20336195913399432, 0.17521589653320033, 0.0592169369675923, 0.07388487654569292, 0.14076234515598426, 0.162956941178428, 0.03187050484937795, -0.2029752648021612, -0.021391005509897892, 0.1242971552443304] |
1,802.00687 | Large-distance behaviour of the massless vector two-point function in de
Sitter spacetime | We study the long-distance behaviour of the massless vector propagator in
(n)-dimensional de Sitter spacetime, where $n \geq 4$. Specifically, we
consider the massless limit of the vector propagator in the Stueckelberg
theory, which is an extension of Proca theory, with an additional gauge-fixing
term. We work to leading order in the de Sitter-invariant distance $Z$ to show
that, in the large $Z$ limit, this propagator tends to a gauge dependent
constant, where the gauge worked in is described by the Stueckelberg parameter
$\xi$. In the Landau gauge, where $\xi=0$, this constant is found to be 0. This
result is in agreement with the 4 dimensional case discussed by Youssef.
| gr-qc | we study the longdistance behaviour of the massless vector propagator in ndimensional de sitter spacetime where n geq 4 specifically we consider the massless limit of the vector propagator in the stueckelberg theory which is an extension of proca theory with an additional gaugefixing term we work to leading order in the de sitterinvariant distance z to show that in the large z limit this propagator tends to a gauge dependent constant where the gauge worked in is described by the stueckelberg parameter xi in the landau gauge where xi0 this constant is found to be 0 this result is in agreement with the 4 dimensional case discussed by youssef | [['we', 'study', 'the', 'longdistance', 'behaviour', 'of', 'the', 'massless', 'vector', 'propagator', 'in', 'ndimensional', 'de', 'sitter', 'spacetime', 'where', 'n', 'geq', '4', 'specifically', 'we', 'consider', 'the', 'massless', 'limit', 'of', 'the', 'vector', 'propagator', 'in', 'the', 'stueckelberg', 'theory', 'which', 'is', 'an', 'extension', 'of', 'proca', 'theory', 'with', 'an', 'additional', 'gaugefixing', 'term', 'we', 'work', 'to', 'leading', 'order', 'in', 'the', 'de', 'sitterinvariant', 'distance', 'z', 'to', 'show', 'that', 'in', 'the', 'large', 'z', 'limit', 'this', 'propagator', 'tends', 'to', 'a', 'gauge', 'dependent', 'constant', 'where', 'the', 'gauge', 'worked', 'in', 'is', 'described', 'by', 'the', 'stueckelberg', 'parameter', 'xi', 'in', 'the', 'landau', 'gauge', 'where', 'xi0', 'this', 'constant', 'is', 'found', 'to', 'be', '0', 'this', 'result', 'is', 'in', 'agreement', 'with', 'the', '4', 'dimensional', 'case', 'discussed', 'by', 'youssef']] | [-0.17198552717031404, 0.23867609306392049, -0.06532494519752535, 0.06476970054738393, -0.061480973948809234, -0.13836780935102566, -0.023777464821680704, 0.298995274102146, -0.18244240014305846, -0.24071189124475825, 0.020820848663887857, -0.2635951186022298, -0.1544455349381844, 0.05857439471662722, -0.02415626402732662, 0.0037515599534592844, -0.042931350794705475, 0.09796062918718565, -0.03668580541164953, -0.2838126947616481, 0.3552182959308001, 0.04253819565373388, 0.22649667440617288, 0.01638453798368573, 0.10663921958343549, 0.07184731549244713, -0.005854429931125857, -0.028141093232922933, -0.1580016740410594, 0.017760244553739375, 0.23096801133572378, 0.0170276032845405, 0.21809881020506675, -0.3258010328747332, -0.19580297492105853, 0.10231885857964781, 0.20679871992800725, 0.128888904183722, 0.006728651035915721, -0.29955161109524353, 0.07164087761405179, -0.15517397837882693, -0.1994984435160983, -0.050205534518781035, 0.018458366917911917, -0.11418601757296445, -0.2877724193375219, 0.10863229762762786, 0.027226653474975715, 0.011599645890634168, -0.047742977551057594, -0.0942257514350455, -0.03156457722864368, 0.02779210826583122, 0.1431678556360897, 0.14287196138069372, 0.04205543549079183, -0.1630371728433767, -0.09778376729756763, 0.3754515272311189, -0.17725515326336874, -0.27031692904843524, 0.10646693672222847, -0.20219969052652068, -0.15127060645344584, 0.07397206606851382, 0.10180597807365385, 0.15626049017142082, -0.12726155996153302, 0.2795905794144677, -0.021639164571057665, 0.15722385880706663, 0.10945653585209088, 0.01787908748156042, 0.13652761943045666, 0.0877316325606609, 0.022068049394610253, 0.10221990443321623, -0.007498851371929049, -0.12625087228741244, -0.41100070280107587, -0.1761245802976191, -0.1437748077071526, 0.1354287253184752, -0.15238396400924434, -0.1536875787995417, 0.29942425706169823, 0.15418039619742724, 0.19448461029255254, 0.04410333231366663, 0.22713464437560602, 0.17319641960784793, 0.04539787124588408, 0.06990175559608773, 0.24092517336407168, 0.14998786672103134, 0.09083869160914963, -0.23048772695050998, -0.14436457626606253, 0.10451466098046777] |
1,802.00688 | Hierarchical Aggregation Approach for Distributed clustering of spatial
datasets | In this paper, we present a new approach of distributed clustering for
spatial datasets, based on an innovative and efficient aggregation technique.
This distributed approach consists of two phases: 1) local clustering phase,
where each node performs a clustering on its local data, 2) aggregation phase,
where the local clusters are aggregated to produce global clusters. This
approach is characterised by the fact that the local clusters are represented
in a simple and efficient way. And The aggregation phase is designed in such a
way that the final clusters are compact and accurate while the overall process
is efficient in both response time and memory allocation. We evaluated the
approach with different datasets and compared it to well-known clustering
techniques. The experimental results show that our approach is very promising
and outperforms all those algorithms
| cs.DB cs.DC cs.LG | in this paper we present a new approach of distributed clustering for spatial datasets based on an innovative and efficient aggregation technique this distributed approach consists of two phases 1 local clustering phase where each node performs a clustering on its local data 2 aggregation phase where the local clusters are aggregated to produce global clusters this approach is characterised by the fact that the local clusters are represented in a simple and efficient way and the aggregation phase is designed in such a way that the final clusters are compact and accurate while the overall process is efficient in both response time and memory allocation we evaluated the approach with different datasets and compared it to wellknown clustering techniques the experimental results show that our approach is very promising and outperforms all those algorithms | [['in', 'this', 'paper', 'we', 'present', 'a', 'new', 'approach', 'of', 'distributed', 'clustering', 'for', 'spatial', 'datasets', 'based', 'on', 'an', 'innovative', 'and', 'efficient', 'aggregation', 'technique', 'this', 'distributed', 'approach', 'consists', 'of', 'two', 'phases', '1', 'local', 'clustering', 'phase', 'where', 'each', 'node', 'performs', 'a', 'clustering', 'on', 'its', 'local', 'data', '2', 'aggregation', 'phase', 'where', 'the', 'local', 'clusters', 'are', 'aggregated', 'to', 'produce', 'global', 'clusters', 'this', 'approach', 'is', 'characterised', 'by', 'the', 'fact', 'that', 'the', 'local', 'clusters', 'are', 'represented', 'in', 'a', 'simple', 'and', 'efficient', 'way', 'and', 'the', 'aggregation', 'phase', 'is', 'designed', 'in', 'such', 'a', 'way', 'that', 'the', 'final', 'clusters', 'are', 'compact', 'and', 'accurate', 'while', 'the', 'overall', 'process', 'is', 'efficient', 'in', 'both', 'response', 'time', 'and', 'memory', 'allocation', 'we', 'evaluated', 'the', 'approach', 'with', 'different', 'datasets', 'and', 'compared', 'it', 'to', 'wellknown', 'clustering', 'techniques', 'the', 'experimental', 'results', 'show', 'that', 'our', 'approach', 'is', 'very', 'promising', 'and', 'outperforms', 'all', 'those', 'algorithms']] | [-0.09490044841163413, 0.04891826159383291, -0.12799683051114832, 0.051126763325562395, -0.04327694385105537, -0.12024806231191312, 0.04275468370480532, 0.440909473956735, -0.26288860545114234, -0.3196225773336159, 0.09234198020357225, -0.2584820217142502, -0.18122299472042533, 0.18090524635519142, -0.026018591597676277, 0.03858258201464735, 0.07203405706418885, 0.02232309382546831, -0.024608225599297807, -0.289049759663262, 0.3001427250345134, 0.050607253148875854, 0.3547067027832209, -0.025090685759291603, 0.10383769284882065, -0.01806247262629094, -0.06806801954474025, 0.07052189433791985, -0.05900147438682055, 0.16619779604694082, 0.2523865611947797, 0.15497965563209382, 0.27781079925113805, -0.39504272808079366, -0.1942844546848425, 0.08126065746915562, 0.17207903545004902, 0.10834795748491564, -0.0941918152505187, -0.2661114216747659, 0.12627120887584709, -0.15190883928530471, -0.04742266066303408, -0.12946742789612875, -0.0007189575996663835, 0.03806215625006223, -0.31038645309982477, 0.1348166855500528, 0.04264065263516925, -0.024711526104214565, -0.07578085321950277, -0.11489644656647686, 0.04444591250374085, 0.13242178557578613, -0.0316377795338027, 0.033889805704907135, 0.12504346321716353, -0.0947014063441505, -0.131541416676784, 0.3857477266617395, -0.02395858415574939, -0.1710163884451268, 0.23829982214676285, -0.04892254587515102, -0.1803019903772683, 0.09960371150324741, 0.17007446281473945, 0.16131596619056332, -0.17052580181992164, 0.023440945511080186, -0.025375517547406534, 0.1729163529144393, -0.00927445611881989, 0.015143936343008169, 0.15186429001666882, 0.2535572183007995, 0.1090878903870126, 0.13526783380140034, -0.10410373746288112, -0.09240839685899792, -0.22400300704477424, -0.1146111050662714, -0.20744280463377773, -0.06410498401943457, -0.1374217728731714, -0.14639325742782267, 0.3989504664170521, 0.17814257851612098, 0.22718224933163988, 0.07373057815970646, 0.36752319123457977, 0.05253962521803462, 0.06223399528405733, 0.11077865422875793, 0.1773469456842307, 0.01272607538331714, 0.08912806570426457, -0.1873274611679975, 0.06865598697008359, 0.028737442854239986] |
1,802.00689 | TikZ-FeynHand: Basic User Guide | This is a userguide for the LaTex package Tikz-FeynHand at
https://ctan.org/pkg/tikz-feynhand which let's you draw Feynman diagrams using
TikZ. It contains many examples and a 5-minute introduction to TikZ.
The package is a low-end modification of the package TikZ-Feynman at
https://ctan.org/pkg/tikz-feynman, one of whose principal advantages is the
automatic generation of diagrams, for which it needs LuaTex. FeynHand only
provides the manual mode and hence runs in LaTex without any reference to
LuaTex.
In addition it provides some NEW STYLES for vertices and propagators,
alternative SHORTER KEYWORDS in addition to TikZ-Feynman's longer ones, some
shortcut commands for QUICKLY CUSTOMIZING the diagrams' look, and the new
feature to put one propagator "ON TOP" of another.
| cs.OH hep-ph hep-th | this is a userguide for the latex package tikzfeynhand at httpsctanorgpkgtikzfeynhand which lets you draw feynman diagrams using tikz it contains many examples and a 5minute introduction to tikz the package is a lowend modification of the package tikzfeynman at httpsctanorgpkgtikzfeynman one of whose principal advantages is the automatic generation of diagrams for which it needs luatex feynhand only provides the manual mode and hence runs in latex without any reference to luatex in addition it provides some new styles for vertices and propagators alternative shorter keywords in addition to tikzfeynmans longer ones some shortcut commands for quickly customizing the diagrams look and the new feature to put one propagator on top of another | [['this', 'is', 'a', 'userguide', 'for', 'the', 'latex', 'package', 'tikzfeynhand', 'at', 'httpsctanorgpkgtikzfeynhand', 'which', 'lets', 'you', 'draw', 'feynman', 'diagrams', 'using', 'tikz', 'it', 'contains', 'many', 'examples', 'and', 'a', '5minute', 'introduction', 'to', 'tikz', 'the', 'package', 'is', 'a', 'lowend', 'modification', 'of', 'the', 'package', 'tikzfeynman', 'at', 'httpsctanorgpkgtikzfeynman', 'one', 'of', 'whose', 'principal', 'advantages', 'is', 'the', 'automatic', 'generation', 'of', 'diagrams', 'for', 'which', 'it', 'needs', 'luatex', 'feynhand', 'only', 'provides', 'the', 'manual', 'mode', 'and', 'hence', 'runs', 'in', 'latex', 'without', 'any', 'reference', 'to', 'luatex', 'in', 'addition', 'it', 'provides', 'some', 'new', 'styles', 'for', 'vertices', 'and', 'propagators', 'alternative', 'shorter', 'keywords', 'in', 'addition', 'to', 'tikzfeynmans', 'longer', 'ones', 'some', 'shortcut', 'commands', 'for', 'quickly', 'customizing', 'the', 'diagrams', 'look', 'and', 'the', 'new', 'feature', 'to', 'put', 'one', 'propagator', 'on', 'top', 'of', 'another']] | [-0.06731243642638916, 0.08594557576079496, -0.1436045782849471, 0.08480814086908701, -0.161257955358825, -0.18798319520602855, 0.06494509104626235, 0.38078707944009904, -0.23320675071189614, -0.31033390109801545, 0.08723396583673518, -0.2904540562793334, -0.09987126760376251, 0.23060667209292404, -0.04424274530018044, -0.010547418673914448, 0.0919875767229943, 0.055227296944777265, -0.02277781846541389, -0.23997138020425826, 0.24578066992956413, 0.04180924964211359, 0.21760010406827537, 0.04837766438983729, 0.09323230531353886, 0.04330859730775233, -0.07012584148966011, -0.0339366083694883, -0.08686515698470523, 0.1270726331483538, 0.2367941940042286, 0.1626580339273281, 0.26142001676016324, -0.394018926884039, -0.1393470135604458, 0.041557498639623554, 0.13861036991752754, 0.14900818923879938, -0.02258463535201083, -0.24895774665131956, 0.0789092870463974, -0.16760316574684928, -0.11009339526487148, -0.09448758302099794, 0.047399720031263255, -0.047860576860415185, -0.2606586719401807, -0.04588154743416844, 0.03128182428462483, 0.05816409989286249, 0.047046596568162666, -0.12115212576463819, -0.020278653159311093, 0.16765165151418926, 0.0037678178839350694, 0.06864501050756112, 0.09902254460200234, -0.1267231578596489, -0.09363484412222822, 0.38153323412777107, -0.020484636953344272, -0.21562923799556133, 0.193851947923687, -0.06568452573346549, -0.15106836348232405, 0.1363461973514434, 0.10749471022216515, 0.09259249768698606, -0.17672619917299423, 0.05891508124899293, 0.02381359569937269, 0.1730832396005498, 0.10092568118995596, -0.005471831440020387, 0.1801154353442628, 0.13472338328309352, 0.017248556665775898, 0.18253881879429393, -0.024479156584156867, -0.08463306050033909, -0.31820410781618313, -0.20154293666585027, -0.11891333985215305, -0.03357016157998625, -0.0819118559729334, -0.2195298182201424, 0.4365177444904764, 0.17216201151816923, 0.14419573988731751, 0.03941451881959965, 0.3450051118384733, 0.056131814475928514, 0.15468551096382385, 0.08415551431407438, 0.15378482066036123, 0.03237617175120895, 0.1482553460078192, -0.12378227428280722, 0.04815884591863604, 0.08490834417361244] |
1,802.0069 | Modelling contextuality by probabilistic programs with hypergraph
semantics | Models of a phenomenon are often developed by examining it under different
experimental conditions, or measurement contexts. The resultant probabilistic
models assume that the underlying random variables, which define a measurable
set of outcomes, can be defined independent of the measurement context. The
phenomenon is deemed contextual when this assumption fails. Contextuality is an
important issue in quantum physics. However, there has been growing speculation
that it manifests outside the quantum realm with human cognition being a
particularly prominent area of investigation. This article contributes the
foundations of a probabilistic programming language that allows convenient
exploration of contextuality in wide range of applications relevant to
cognitive science and artificial intelligence. Specific syntax is proposed to
allow the specification of "measurement contexts". Each such context delivers a
partial model of the phenomenon based on the associated experimental condition
described by the measurement context. The probabilistic program is translated
into a hypergraph in a modular way. Recent theoretical results from the field
of quantum physics show that contextuality can be equated with the possibility
of constructing a probabilistic model on the resulting hypergraph. The use of
hypergraphs opens the door for a theoretically succinct and efficient
computational semantics sensitive to modelling both contextual and
non-contextual phenomena. Finally, this article raises awareness of
contextuality beyond quantum physics and to contribute formal methods to detect
its presence by means of hypergraph semantics.
| cs.AI | models of a phenomenon are often developed by examining it under different experimental conditions or measurement contexts the resultant probabilistic models assume that the underlying random variables which define a measurable set of outcomes can be defined independent of the measurement context the phenomenon is deemed contextual when this assumption fails contextuality is an important issue in quantum physics however there has been growing speculation that it manifests outside the quantum realm with human cognition being a particularly prominent area of investigation this article contributes the foundations of a probabilistic programming language that allows convenient exploration of contextuality in wide range of applications relevant to cognitive science and artificial intelligence specific syntax is proposed to allow the specification of measurement contexts each such context delivers a partial model of the phenomenon based on the associated experimental condition described by the measurement context the probabilistic program is translated into a hypergraph in a modular way recent theoretical results from the field of quantum physics show that contextuality can be equated with the possibility of constructing a probabilistic model on the resulting hypergraph the use of hypergraphs opens the door for a theoretically succinct and efficient computational semantics sensitive to modelling both contextual and noncontextual phenomena finally this article raises awareness of contextuality beyond quantum physics and to contribute formal methods to detect its presence by means of hypergraph semantics | [['models', 'of', 'a', 'phenomenon', 'are', 'often', 'developed', 'by', 'examining', 'it', 'under', 'different', 'experimental', 'conditions', 'or', 'measurement', 'contexts', 'the', 'resultant', 'probabilistic', 'models', 'assume', 'that', 'the', 'underlying', 'random', 'variables', 'which', 'define', 'a', 'measurable', 'set', 'of', 'outcomes', 'can', 'be', 'defined', 'independent', 'of', 'the', 'measurement', 'context', 'the', 'phenomenon', 'is', 'deemed', 'contextual', 'when', 'this', 'assumption', 'fails', 'contextuality', 'is', 'an', 'important', 'issue', 'in', 'quantum', 'physics', 'however', 'there', 'has', 'been', 'growing', 'speculation', 'that', 'it', 'manifests', 'outside', 'the', 'quantum', 'realm', 'with', 'human', 'cognition', 'being', 'a', 'particularly', 'prominent', 'area', 'of', 'investigation', 'this', 'article', 'contributes', 'the', 'foundations', 'of', 'a', 'probabilistic', 'programming', 'language', 'that', 'allows', 'convenient', 'exploration', 'of', 'contextuality', 'in', 'wide', 'range', 'of', 'applications', 'relevant', 'to', 'cognitive', 'science', 'and', 'artificial', 'intelligence', 'specific', 'syntax', 'is', 'proposed', 'to', 'allow', 'the', 'specification', 'of', 'measurement', 'contexts', 'each', 'such', 'context', 'delivers', 'a', 'partial', 'model', 'of', 'the', 'phenomenon', 'based', 'on', 'the', 'associated', 'experimental', 'condition', 'described', 'by', 'the', 'measurement', 'context', 'the', 'probabilistic', 'program', 'is', 'translated', 'into', 'a', 'hypergraph', 'in', 'a', 'modular', 'way', 'recent', 'theoretical', 'results', 'from', 'the', 'field', 'of', 'quantum', 'physics', 'show', 'that', 'contextuality', 'can', 'be', 'equated', 'with', 'the', 'possibility', 'of', 'constructing', 'a', 'probabilistic', 'model', 'on', 'the', 'resulting', 'hypergraph', 'the', 'use', 'of', 'hypergraphs', 'opens', 'the', 'door', 'for', 'a', 'theoretically', 'succinct', 'and', 'efficient', 'computational', 'semantics', 'sensitive', 'to', 'modelling', 'both', 'contextual', 'and', 'noncontextual', 'phenomena', 'finally', 'this', 'article', 'raises', 'awareness', 'of', 'contextuality', 'beyond', 'quantum', 'physics', 'and', 'to', 'contribute', 'formal', 'methods', 'to', 'detect', 'its', 'presence', 'by', 'means', 'of', 'hypergraph', 'semantics']] | [-0.08534959460105215, 0.09575352707747299, -0.1071248529213399, 0.09523299525353011, -0.13275083827912776, -0.1760476037835408, 0.04521479790830135, 0.31629675418062425, -0.28816526468124304, -0.3273451380889144, 0.052190706980917115, -0.2110103269816982, -0.17326045927148426, 0.20113789251486755, -0.11841185839965188, 0.08462883660691309, 0.06918641374846757, 0.042526569324668105, -0.0232022836203932, -0.2045974732343957, 0.30829026545765564, 0.054878482130318346, 0.2940813098358105, 0.0667946146841451, 0.09022545127868, 0.02264941665915805, -0.03367880619618135, 0.05757420740229192, -0.11359925206871642, 0.15777550191054807, 0.32548827667284186, 0.22627625506181193, 0.33471856198951155, -0.42145462971376746, -0.23920081608740842, 0.09734044108476506, 0.09935253247692201, 0.11420200205062875, -0.0331380572649977, -0.3314928860779394, 0.040567478278892836, -0.16369702675167405, -0.08449382616386733, -0.1001143647835737, 0.023606752470776995, -0.06475390308141389, -0.24613930710556656, 0.022469942631575753, 0.10435288070737825, 0.0981683633545528, 0.009191876261243842, -0.06622174459309399, 0.03895656623123949, 0.0942431054505154, 0.0020735717688486993, 0.013848323551141411, 0.14740144080899067, -0.12951812660117357, -0.18845338093345626, 0.40043299546334565, 0.00683920809221985, -0.19429480980244607, 0.20115342775151426, -0.10052758905109377, -0.18607841042001128, 0.059555467416270914, 0.13599232665422423, 0.07682243323417201, -0.16309155520439003, 0.11768434680245839, -0.06633901325965366, 0.17589999095964645, 0.02773420254111682, 0.08776598922467153, 0.24490942272128896, 0.20964568395886504, 0.034644326874210186, 0.12833005468883926, -0.01049962468581119, -0.14940378572505883, -0.31663821177687823, -0.15467513492535145, -0.15550718632457255, 0.0391669705103707, -0.06125807474260606, -0.15348409394643744, 0.39322857502561975, 0.2159353882582269, 0.1498410885565375, 0.02795360877388974, 0.2795913210588001, 0.10027244977257062, 0.05486157429690489, 0.022295652807020304, 0.1931670124697695, 0.14238935251916318, 0.09477199995927278, -0.15566183725196311, 0.1538047765554215, 0.0038314463760654783] |
1,802.00691 | Stable and efficient time integration of a dynamic pore network model
for two-phase flow in porous media | We study three different time integration methods for a dynamic pore network
model for immiscible two-phase flow in porous media. Considered are two
explicit methods, the forward Euler and midpoint methods, and a new
semi-implicit method developed herein. The explicit methods are known to suffer
from numerical instabilities at low capillary numbers. A new time-step
criterion is suggested in order to stabilize them. Numerical experiments,
including a Haines jump case, are performed and these demonstrate that
stabilization is achieved. Further, the results from the Haines jump case are
consistent with experimental observations. A performance analysis reveals that
the semi-implicit method is able to perform stable simulations with much less
computational effort than the explicit methods at low capillary numbers. The
relative benefit of using the semi-implicit method increases with decreasing
capillary number $\mathrm{Ca}$, and at $\mathrm{Ca} \sim 10^{-8}$ the
computational time needed is reduced by three orders of magnitude. This
increased efficiency enables simulations in the low-capillary number regime
that are unfeasible with explicit methods and the range of capillary numbers
for which the pore network model is a tractable modeling alternative is thus
greatly extended by the semi-implicit method.
| physics.comp-ph physics.flu-dyn | we study three different time integration methods for a dynamic pore network model for immiscible twophase flow in porous media considered are two explicit methods the forward euler and midpoint methods and a new semiimplicit method developed herein the explicit methods are known to suffer from numerical instabilities at low capillary numbers a new timestep criterion is suggested in order to stabilize them numerical experiments including a haines jump case are performed and these demonstrate that stabilization is achieved further the results from the haines jump case are consistent with experimental observations a performance analysis reveals that the semiimplicit method is able to perform stable simulations with much less computational effort than the explicit methods at low capillary numbers the relative benefit of using the semiimplicit method increases with decreasing capillary number mathrmca and at mathrmca sim 108 the computational time needed is reduced by three orders of magnitude this increased efficiency enables simulations in the lowcapillary number regime that are unfeasible with explicit methods and the range of capillary numbers for which the pore network model is a tractable modeling alternative is thus greatly extended by the semiimplicit method | [['we', 'study', 'three', 'different', 'time', 'integration', 'methods', 'for', 'a', 'dynamic', 'pore', 'network', 'model', 'for', 'immiscible', 'twophase', 'flow', 'in', 'porous', 'media', 'considered', 'are', 'two', 'explicit', 'methods', 'the', 'forward', 'euler', 'and', 'midpoint', 'methods', 'and', 'a', 'new', 'semiimplicit', 'method', 'developed', 'herein', 'the', 'explicit', 'methods', 'are', 'known', 'to', 'suffer', 'from', 'numerical', 'instabilities', 'at', 'low', 'capillary', 'numbers', 'a', 'new', 'timestep', 'criterion', 'is', 'suggested', 'in', 'order', 'to', 'stabilize', 'them', 'numerical', 'experiments', 'including', 'a', 'haines', 'jump', 'case', 'are', 'performed', 'and', 'these', 'demonstrate', 'that', 'stabilization', 'is', 'achieved', 'further', 'the', 'results', 'from', 'the', 'haines', 'jump', 'case', 'are', 'consistent', 'with', 'experimental', 'observations', 'a', 'performance', 'analysis', 'reveals', 'that', 'the', 'semiimplicit', 'method', 'is', 'able', 'to', 'perform', 'stable', 'simulations', 'with', 'much', 'less', 'computational', 'effort', 'than', 'the', 'explicit', 'methods', 'at', 'low', 'capillary', 'numbers', 'the', 'relative', 'benefit', 'of', 'using', 'the', 'semiimplicit', 'method', 'increases', 'with', 'decreasing', 'capillary', 'number', 'mathrmca', 'and', 'at', 'mathrmca', 'sim', '108', 'the', 'computational', 'time', 'needed', 'is', 'reduced', 'by', 'three', 'orders', 'of', 'magnitude', 'this', 'increased', 'efficiency', 'enables', 'simulations', 'in', 'the', 'lowcapillary', 'number', 'regime', 'that', 'are', 'unfeasible', 'with', 'explicit', 'methods', 'and', 'the', 'range', 'of', 'capillary', 'numbers', 'for', 'which', 'the', 'pore', 'network', 'model', 'is', 'a', 'tractable', 'modeling', 'alternative', 'is', 'thus', 'greatly', 'extended', 'by', 'the', 'semiimplicit', 'method']] | [-0.09777170784830574, 0.11015802209644958, -0.0643096413665387, 0.041877461346630104, -0.057522949129441586, -0.1571901937572177, 0.04024266234534995, 0.38034384364567736, -0.2315403337716051, -0.3398849430429951, 0.10424235158429909, -0.2417408705420457, -0.12506613044546197, 0.23785040944213512, -0.026718798645392613, 0.08756042830646038, 0.08038540390780856, -0.056080061262325634, -0.06978812103071028, -0.24781667738081148, 0.2503905142004548, 0.047631195746670185, 0.2805729932274926, 0.051999031403471556, 0.11700334286352801, -0.11202573155615557, -0.05675098006293256, 0.06693718273305979, -0.17110345108989994, 0.09191654959358472, 0.2546542955638851, 0.028999837615561706, 0.31427056814430565, -0.4546239657140283, -0.24400344839388574, 0.05246699537660572, 0.1566420042093981, 0.13587107906233833, -0.028379644916476633, -0.23305365580710627, 0.1013027317587917, -0.19310846973442172, -0.11702795148452635, -0.10354107664651656, -0.017308623241704135, 0.03855954256357142, -0.2932078911375905, 0.10128936467066446, 0.010732985616770324, 0.06295341721405744, -0.02870493324500602, -0.1286494935956345, 0.008774423927423499, 0.0679875886592541, 0.06450648211736094, -0.01213383353955886, 0.10115479315118618, -0.10217510104036481, -0.08028914851614485, 0.3747340206638294, -0.046509176639057126, -0.22777610325387546, 0.24031802183559176, -0.08910674817869982, -0.07922477809365508, 0.23759974697456945, 0.156102711945851, 0.1563048185854559, -0.060206164675518356, 0.011004534107756125, -0.004183509953753658, 0.1729680991746367, 0.05579609559016135, -0.04839071292656834, 0.10356600699014962, 0.2323500314559886, 0.06919523904090205, 0.12647871025369833, -0.1003775294913563, -0.11954507507167007, -0.2750533193635641, -0.15314277697529485, -0.16251523508419277, -0.03370363079442608, -0.11876471546469639, -0.10036594032866772, 0.33277837547754485, 0.1645239705673207, 0.1305096996800294, 0.12098352879559296, 0.352703456316025, 0.10660954690464432, 0.05742055263552598, 0.05516426607217423, 0.21221034849683443, 0.11153821662442867, 0.13329324334682452, -0.24071673936057816, 0.06298489129249618, 0.11834161158863002] |
1,802.00692 | Sensing adsorption kinetics through slip velocity measurements of
polymer melts | The evolution over time of the non-linear slip behavior of a
polydimethylsiloxane (PDMS) polymer melt on a weakly adsorbing surface made of
short non-entangled PDMS chains densely end-grafted to the surface of a fused
silica prism has been measured. The critical shear rate at which the melt
enters the nonlinear slip regime has been shown to increase with time. The
adsorption kinetics of the melt on the same surface has been determined
independently using ellipsometry. We show that the evolution of slip can be
explained by the slow adsorption of melt chains using the Brochard-de Gennes's
model.
| physics.flu-dyn cond-mat.soft | the evolution over time of the nonlinear slip behavior of a polydimethylsiloxane pdms polymer melt on a weakly adsorbing surface made of short nonentangled pdms chains densely endgrafted to the surface of a fused silica prism has been measured the critical shear rate at which the melt enters the nonlinear slip regime has been shown to increase with time the adsorption kinetics of the melt on the same surface has been determined independently using ellipsometry we show that the evolution of slip can be explained by the slow adsorption of melt chains using the brochardde genness model | [['the', 'evolution', 'over', 'time', 'of', 'the', 'nonlinear', 'slip', 'behavior', 'of', 'a', 'polydimethylsiloxane', 'pdms', 'polymer', 'melt', 'on', 'a', 'weakly', 'adsorbing', 'surface', 'made', 'of', 'short', 'nonentangled', 'pdms', 'chains', 'densely', 'endgrafted', 'to', 'the', 'surface', 'of', 'a', 'fused', 'silica', 'prism', 'has', 'been', 'measured', 'the', 'critical', 'shear', 'rate', 'at', 'which', 'the', 'melt', 'enters', 'the', 'nonlinear', 'slip', 'regime', 'has', 'been', 'shown', 'to', 'increase', 'with', 'time', 'the', 'adsorption', 'kinetics', 'of', 'the', 'melt', 'on', 'the', 'same', 'surface', 'has', 'been', 'determined', 'independently', 'using', 'ellipsometry', 'we', 'show', 'that', 'the', 'evolution', 'of', 'slip', 'can', 'be', 'explained', 'by', 'the', 'slow', 'adsorption', 'of', 'melt', 'chains', 'using', 'the', 'brochardde', 'genness', 'model']] | [-0.1017999899414319, 0.23432376678836972, -0.14697283022595864, -0.09785504516606268, 0.01706637010762566, -0.16664600170854676, -0.02442932965135888, 0.41931857549046214, -0.311458036695656, -0.23133786395192146, 0.11482967189758232, -0.2794884105654139, -0.0870590874288035, 0.151342235601164, 0.020464463031997806, 0.1128194384080799, 0.04242719852635147, -0.009779610832859028, -0.048821159655620394, -0.256644450946662, 0.20045205056667328, 0.06192645961418748, 0.3117065768688917, 0.11429284926699965, 0.12937542734373558, -0.009155538982074512, 0.077506486724719, 0.08744626165318646, -0.2302796874223675, 0.050169479699903416, 0.2202091634812716, -0.05810788049068498, 0.1994456082190338, -0.5026840992664036, -0.3105982788495327, 0.04387323538723745, 0.13810813328202226, 0.13033474655209207, -0.0055570507226021665, -0.2661016087194807, 0.0359024035793386, -0.1253447320140702, -0.0787822401347129, 0.014537478140310237, 0.01182162902857128, 0.07227629012624293, -0.1744871636950656, 0.0859853006507221, 0.03819950220273122, 0.08194815737048262, -0.053335920084071786, -0.07330607887553542, -0.13940449606529193, 0.09192739209944481, 0.07065390553202872, -0.0050167634985164595, 0.25228035355869094, -0.07466465056334672, 0.01011703207500671, 0.34988810327884395, -0.11956990761192221, -0.13794228008697054, 0.2320448052824328, -0.1423499672085439, -0.0430224369819227, 0.2647119263260576, 0.15494491917718398, 0.11838443255738208, -0.1700428031482979, 0.041616620074369406, -0.02731797957890912, 0.22294800235326157, 0.15255851412351293, -0.07574813459068537, 0.23913215826216497, 0.2973455186822991, -0.0044094095104619075, 0.19486624229405272, -0.1355596893663077, -0.07099702519021536, -0.19170389884568162, -0.1987677698820143, -0.22388280339931188, 0.022517746657525237, -0.06893483140554867, -0.18153731872076415, 0.3619033873056699, 0.011192565710332832, 0.17318585513919396, 0.055521904653869567, 0.17445083723256463, 0.06290521420244323, 0.11036808772110625, -0.029084664191070357, 0.2705871207541541, 0.15647897023560578, 0.11091094299979312, -0.2675070916449553, 0.17547163104050253, 0.0641451271397895] |
1,802.00693 | A high-resolution study of levels in the astrophysically important
nucleus $^{26}$Mg and resulting updated level assignments | The $^{22}$Ne($\alpha,n$)$^{25}$Mg reaction is an important source of
neutrons for the s-process. Due to the difficulty in directly measuring the
cross section of this reaction and the competing
$^{22}$Ne($\alpha,\gamma$)$^{26}$Mg reaction, indirect methods are frequently
used to try to instead calculate the relevant reaction rates. Uncertainty,
however, persists in the number and properties of the pertinent excited states
of $^{26}$Mg.
In this paper, the results of proton and deuteron scattering from $^{26}$Mg
are presented, giving a list of levels in $^{26}$Mg. In addition, level
assignments in $^{26}$Mg are discussed, including some possible changes to the
previously accepted assignments in $^{26}$Mg.
| nucl-ex astro-ph.SR | the 22nealphan25mg reaction is an important source of neutrons for the sprocess due to the difficulty in directly measuring the cross section of this reaction and the competing 22nealphagamma26mg reaction indirect methods are frequently used to try to instead calculate the relevant reaction rates uncertainty however persists in the number and properties of the pertinent excited states of 26mg in this paper the results of proton and deuteron scattering from 26mg are presented giving a list of levels in 26mg in addition level assignments in 26mg are discussed including some possible changes to the previously accepted assignments in 26mg | [['the', '22nealphan25mg', 'reaction', 'is', 'an', 'important', 'source', 'of', 'neutrons', 'for', 'the', 'sprocess', 'due', 'to', 'the', 'difficulty', 'in', 'directly', 'measuring', 'the', 'cross', 'section', 'of', 'this', 'reaction', 'and', 'the', 'competing', '22nealphagamma26mg', 'reaction', 'indirect', 'methods', 'are', 'frequently', 'used', 'to', 'try', 'to', 'instead', 'calculate', 'the', 'relevant', 'reaction', 'rates', 'uncertainty', 'however', 'persists', 'in', 'the', 'number', 'and', 'properties', 'of', 'the', 'pertinent', 'excited', 'states', 'of', '26mg', 'in', 'this', 'paper', 'the', 'results', 'of', 'proton', 'and', 'deuteron', 'scattering', 'from', '26mg', 'are', 'presented', 'giving', 'a', 'list', 'of', 'levels', 'in', '26mg', 'in', 'addition', 'level', 'assignments', 'in', '26mg', 'are', 'discussed', 'including', 'some', 'possible', 'changes', 'to', 'the', 'previously', 'accepted', 'assignments', 'in', '26mg']] | [-0.03709277456315855, 0.17533497177573001, -0.013006221010312062, 0.14040426762581737, 0.018909094328380595, -0.05873490964718671, 0.08323801802165542, 0.3356957965050683, -0.22838942512794577, -0.3255779806976066, -0.013940627868945777, -0.3180427982876397, -0.022236125675415754, 0.16280176422342357, -0.010812987648703233, 0.07827849602420824, 0.042959631364228146, 0.07519133774695372, -0.02387312974726706, -0.201902935870528, 0.34079168571366203, 0.11689576964551698, 0.240674037241725, 0.14606735592171777, 0.015102793688349651, -0.02745494360311164, -0.032014480246362664, -0.08579148609435769, -0.11140862341636246, 0.13494518810815256, 0.34685873338068374, 0.11996426598893271, 0.16135242625581797, -0.41796202983970593, -0.15765872709170886, 0.09536164487956675, 0.12536702869046065, 0.16823639130605517, -0.055292083830055266, -0.26603290476516417, 0.04800326331527998, -0.1876669371838098, -0.10597690209896878, -0.052711492935854073, 0.061493579787437365, 0.05301191849925677, -0.22968483340898246, 0.05217362902682237, 0.0009921784983063587, 0.02148081169868208, -0.11752351699396968, -0.23536546826550755, -0.02277621375443884, 0.13008010025710018, 0.11637901929160109, 0.0029078264190989423, 0.13608927407650032, -0.12740150806635167, -0.10416725862093947, 0.41948577316684854, -0.012014916504150012, -0.15787393939116914, 0.15494012416838998, -0.13810885947837373, -0.17195523677939417, 0.1929794310643855, 0.1530261394294976, 0.1288123734511736, -0.1908808411522345, 0.029055948038185675, 0.03980270377595467, 0.14119619827228364, 0.11113655437818831, 0.042153664177866895, 0.10775793286397903, 0.15620173428282894, -0.027794918802689122, 0.08845532151418879, -0.13388340457370787, -0.08595829399013327, -0.2930840506321854, -0.134284601506255, -0.07197807682678103, 0.047859406893640155, 0.03652571727368261, -0.09373188901438632, 0.35407681051980366, 0.1339842604586121, 0.22123959323983977, -0.06654275052550465, 0.2732870887372304, 0.10839842068210169, 0.030039252499306595, 0.020789370194754818, 0.3043813377332455, 0.19822728632234338, 0.06753327959979122, -0.27194492021490907, 0.17654377405503482, -0.025025536870640335] |
1,802.00694 | Charge and current orders in the spin-fermion model with overlapping hot
spots | Experiments carried over the last years on the underdoped cuprates have
revealed a variety of symmetry-breaking phenomena in the pseudogap state.
Charge-density waves, breaking of $C_{4}$ rotational symmetry as well as
time-reversal symmetry breaking have all been observed in several cuprate
families. In this regard, theoretical models where multiple non-superconducting
orders emerge are of particular interest. We consider the recently introduced
(Phys. Rev. B 93, 085131 (2016)) spin-fermion model with overlapping 'hot
spots' on the Fermi surface. Focusing on the particle-hole instabilities we
obtain a rich phase diagram with the chemical potential relative to the
dispersion at $(0,\pi);\;(\pi,0)$ and the Fermi surface curvature in the
antinodal regions being the control parameters. We find evidence for d-wave
Pomeranchuk instability, d-form factor charge density waves as well as
commensurate and incommensurate staggered bond current phases similar to the
d-density wave state. The current orders are found to be promoted by the
curvature. Considering the appropriate parameter range for the hole-doped
cuprates, we discuss the relation of our results to the pseudogap state and
incommensurate magnetic phases of the cuprates.
| cond-mat.str-el cond-mat.supr-con | experiments carried over the last years on the underdoped cuprates have revealed a variety of symmetrybreaking phenomena in the pseudogap state chargedensity waves breaking of c_4 rotational symmetry as well as timereversal symmetry breaking have all been observed in several cuprate families in this regard theoretical models where multiple nonsuperconducting orders emerge are of particular interest we consider the recently introduced phys rev b 93 085131 2016 spinfermion model with overlapping hot spots on the fermi surface focusing on the particlehole instabilities we obtain a rich phase diagram with the chemical potential relative to the dispersion at 0pipi0 and the fermi surface curvature in the antinodal regions being the control parameters we find evidence for dwave pomeranchuk instability dform factor charge density waves as well as commensurate and incommensurate staggered bond current phases similar to the ddensity wave state the current orders are found to be promoted by the curvature considering the appropriate parameter range for the holedoped cuprates we discuss the relation of our results to the pseudogap state and incommensurate magnetic phases of the cuprates | [['experiments', 'carried', 'over', 'the', 'last', 'years', 'on', 'the', 'underdoped', 'cuprates', 'have', 'revealed', 'a', 'variety', 'of', 'symmetrybreaking', 'phenomena', 'in', 'the', 'pseudogap', 'state', 'chargedensity', 'waves', 'breaking', 'of', 'c_4', 'rotational', 'symmetry', 'as', 'well', 'as', 'timereversal', 'symmetry', 'breaking', 'have', 'all', 'been', 'observed', 'in', 'several', 'cuprate', 'families', 'in', 'this', 'regard', 'theoretical', 'models', 'where', 'multiple', 'nonsuperconducting', 'orders', 'emerge', 'are', 'of', 'particular', 'interest', 'we', 'consider', 'the', 'recently', 'introduced', 'phys', 'rev', 'b', '93', '085131', '2016', 'spinfermion', 'model', 'with', 'overlapping', 'hot', 'spots', 'on', 'the', 'fermi', 'surface', 'focusing', 'on', 'the', 'particlehole', 'instabilities', 'we', 'obtain', 'a', 'rich', 'phase', 'diagram', 'with', 'the', 'chemical', 'potential', 'relative', 'to', 'the', 'dispersion', 'at', '0pipi0', 'and', 'the', 'fermi', 'surface', 'curvature', 'in', 'the', 'antinodal', 'regions', 'being', 'the', 'control', 'parameters', 'we', 'find', 'evidence', 'for', 'dwave', 'pomeranchuk', 'instability', 'dform', 'factor', 'charge', 'density', 'waves', 'as', 'well', 'as', 'commensurate', 'and', 'incommensurate', 'staggered', 'bond', 'current', 'phases', 'similar', 'to', 'the', 'ddensity', 'wave', 'state', 'the', 'current', 'orders', 'are', 'found', 'to', 'be', 'promoted', 'by', 'the', 'curvature', 'considering', 'the', 'appropriate', 'parameter', 'range', 'for', 'the', 'holedoped', 'cuprates', 'we', 'discuss', 'the', 'relation', 'of', 'our', 'results', 'to', 'the', 'pseudogap', 'state', 'and', 'incommensurate', 'magnetic', 'phases', 'of', 'the', 'cuprates']] | [-0.2097896942283426, 0.228281996066549, -0.024070251884737184, 0.05831753394632999, -0.07135109873222453, -0.09739695911162666, 0.0825679467192718, 0.34313466726669245, -0.22206081946779574, -0.2760862094483205, 0.011821289027242788, -0.32715198722534944, -0.1266797918334071, 0.13188500645570456, 0.04517796301549035, 0.0518960048311523, -0.08671387850905636, -0.0353659506913391, -0.14702257211187056, -0.2479145511040198, 0.31804944774135946, -0.008959229588508606, 0.3267206486314535, 0.07238081028951066, -0.001158333465989147, -0.02055725483223796, 0.1032728905413699, -0.005288807537207114, -0.1954794577509165, -0.018016303713832584, 0.29989645376362856, -0.07032388838939369, 0.1565221034336303, -0.4286888817644545, -0.3064590755357806, 0.02422339197913451, 0.13480613254542861, 0.1553141473346789, -0.04512152604160032, -0.3485055901056954, 0.0012131885831643428, -0.20814226434699126, -0.15172377271178578, -0.13266621231567113, 0.0033737983527992454, -0.010474567940192563, -0.2000510155968368, 0.15904104361443647, 0.041984361587300165, 0.09567511202767491, -0.09456300286043967, -0.1452056938968599, -0.10490135369689337, 0.0009828090681029218, 0.11435211258873876, 0.11353093358821102, 0.07699896036381168, -0.12461614756578845, -0.12954407626363848, 0.3630462694913149, -0.01210574010120971, -0.07195574686995575, 0.1752306014698531, -0.19771526370480258, -0.11408885336347989, 0.1513489436677524, 0.11214672984289271, 0.05048772887326777, -0.06621889677031764, 0.06859933581502577, -0.05202647092411228, 0.14653681400564633, 0.07819731750525534, 0.08996803938544222, 0.2701926255119698, 0.19419533738999495, 0.04404703995745097, 0.09864519260158497, -0.14188480597654624, -0.09708935957268945, -0.2581588076670388, -0.10566390616154032, -0.17549894055684231, -0.021923671778308094, -0.03859533507085871, -0.15962483689188958, 0.45273201027618987, 0.13782000900778388, 0.22705228047179324, -0.10222931553343577, 0.1891792568630938, 0.10375450742231415, 0.061579490036237985, 0.07740884971073163, 0.2654978203440883, 0.14887212942287859, 0.0916467985770266, -0.28844681411449397, 0.04512299602418872, 0.03133072455712993] |
1,802.00695 | AN-aided Secure Transmission in Multi-user MIMO SWIPT Systems | In this paper, an energy harvesting scheme for a multi-user
multiple-input-multiple-output (MIMO) secrecy channel with artificial noise
(AN) transmission is investigated. Joint optimization of the transmit
beamforming matrix, the AN covariance matrix, and the power splitting ratio is
conducted to minimize the transmit power under the target secrecy rate, the
total transmit power, and the harvested energy constraints. The original
problem is shown to be non-convex, which is tackled by a two-layer
decomposition approach. The inner layer problem is solved through semi-definite
relaxation, and the outer problem is shown to be a single-variable optimization
that can be solved by one-dimensional (1-D) line search. To reduce
computational complexity, a sequential parametric convex approximation (SPCA)
method is proposed to find a near-optimal solution. Furthermore, tightness of
the relaxation for the 1-D search method is validated by showing that the
optimal solution of the relaxed problem is rank-one. Simulation results
demonstrate that the proposed SPCA method achieves the same performance as the
scheme based on 1-D search method but with much lower complexity.
| cs.IT math.IT | in this paper an energy harvesting scheme for a multiuser multipleinputmultipleoutput mimo secrecy channel with artificial noise an transmission is investigated joint optimization of the transmit beamforming matrix the an covariance matrix and the power splitting ratio is conducted to minimize the transmit power under the target secrecy rate the total transmit power and the harvested energy constraints the original problem is shown to be nonconvex which is tackled by a twolayer decomposition approach the inner layer problem is solved through semidefinite relaxation and the outer problem is shown to be a singlevariable optimization that can be solved by onedimensional 1d line search to reduce computational complexity a sequential parametric convex approximation spca method is proposed to find a nearoptimal solution furthermore tightness of the relaxation for the 1d search method is validated by showing that the optimal solution of the relaxed problem is rankone simulation results demonstrate that the proposed spca method achieves the same performance as the scheme based on 1d search method but with much lower complexity | [['in', 'this', 'paper', 'an', 'energy', 'harvesting', 'scheme', 'for', 'a', 'multiuser', 'multipleinputmultipleoutput', 'mimo', 'secrecy', 'channel', 'with', 'artificial', 'noise', 'an', 'transmission', 'is', 'investigated', 'joint', 'optimization', 'of', 'the', 'transmit', 'beamforming', 'matrix', 'the', 'an', 'covariance', 'matrix', 'and', 'the', 'power', 'splitting', 'ratio', 'is', 'conducted', 'to', 'minimize', 'the', 'transmit', 'power', 'under', 'the', 'target', 'secrecy', 'rate', 'the', 'total', 'transmit', 'power', 'and', 'the', 'harvested', 'energy', 'constraints', 'the', 'original', 'problem', 'is', 'shown', 'to', 'be', 'nonconvex', 'which', 'is', 'tackled', 'by', 'a', 'twolayer', 'decomposition', 'approach', 'the', 'inner', 'layer', 'problem', 'is', 'solved', 'through', 'semidefinite', 'relaxation', 'and', 'the', 'outer', 'problem', 'is', 'shown', 'to', 'be', 'a', 'singlevariable', 'optimization', 'that', 'can', 'be', 'solved', 'by', 'onedimensional', '1d', 'line', 'search', 'to', 'reduce', 'computational', 'complexity', 'a', 'sequential', 'parametric', 'convex', 'approximation', 'spca', 'method', 'is', 'proposed', 'to', 'find', 'a', 'nearoptimal', 'solution', 'furthermore', 'tightness', 'of', 'the', 'relaxation', 'for', 'the', '1d', 'search', 'method', 'is', 'validated', 'by', 'showing', 'that', 'the', 'optimal', 'solution', 'of', 'the', 'relaxed', 'problem', 'is', 'rankone', 'simulation', 'results', 'demonstrate', 'that', 'the', 'proposed', 'spca', 'method', 'achieves', 'the', 'same', 'performance', 'as', 'the', 'scheme', 'based', 'on', '1d', 'search', 'method', 'but', 'with', 'much', 'lower', 'complexity']] | [-0.15328346825314357, -0.02757644952071132, -0.06381497642347206, 0.0312245473073905, -0.0784846251419581, -0.20763805019669235, 0.05180827614864992, 0.37546665097641596, -0.32884320030536723, -0.29442022980793436, 0.11603115793276468, -0.2187740972128642, -0.1799370707519462, 0.16952463540330748, -0.07410618730218095, 0.12211988907964791, 0.07019138481632313, 0.00470191306051086, -0.07826821920598911, -0.301387915708919, 0.2525602902559673, 0.14082868830026948, 0.3564062720164657, 0.0258343494425336, 0.10980792291571989, -0.01117448733352563, 0.023586523405495375, 0.011698343555497773, -0.07649131572239533, 0.1011781254071085, 0.2938567640752915, 0.2146755688412882, 0.2963192647542147, -0.38562694878920034, -0.23995465957422685, 0.10202360924963347, 0.1601163169588236, 0.0630672996130991, -0.07719696718884413, -0.24015652182347635, 0.13076699441298842, -0.16021750869558138, -0.033591494643512895, -0.027388757606968284, -0.09496508210568744, -0.005507495132042095, -0.38495053216705427, 0.05357194782289512, 0.02903832554926767, -0.029122335926684388, -0.08568341827759629, -0.14020611017339807, 0.03351989038672079, 0.05417806223370409, 0.04163530536050744, 0.004076452062958304, 0.1005300908760332, -0.051869677487925134, -0.1147537592014915, 0.3722855351478382, -0.02155698783805265, -0.28546274855239867, 0.10190545875640751, -0.04232055863557274, -0.06506172232192886, 0.21709076962022877, 0.23963054341318854, 0.14493063163450537, -0.18938263232600602, 0.09242128049167257, -0.07562382382217465, 0.2189793362225721, 0.04385053874267375, 0.013517876585726353, 0.11176757942748201, 0.20818348075092002, 0.204381356947124, 0.1930682432365275, -0.09495048066875075, -0.11613672646858236, -0.18780411315862747, -0.12508699334473075, -0.2872401709904593, 0.01001025231774239, -0.09876412502738223, -0.06991004923338015, 0.36930343269191596, 0.10010199865381068, 0.13633394508129534, 0.13820038981365917, 0.4073324894422994, 0.21290640140924713, 0.019721077197327224, 0.13616767045220032, 0.23883361198994166, 0.14267435069332884, 0.07919221095747643, -0.31791058917091614, 0.04323967789327178, 0.07323267007904018] |
1,802.00696 | Size-aware Sharding For Improving Tail Latencies in In-memory Key-value
Stores | This paper introduces the concept of size-aware sharding to improve tail
latencies for in-memory key-value stores, and describes its implementation in
the Minos key-value store. Tail latencies are crucial in distributed
applications with high fan-out ratios, because overall response time is
determined by the slowest response. Size-aware sharding distributes requests
for keys to cores according to the size of the item associated with the key. In
particular, requests for small and large items are sent to disjoint subsets of
cores. Size-aware sharding improves tail latencies by avoiding head-of-line
blocking, in which a request for a small item gets queued behind a request for
a large item. Alternative size-unaware approaches to sharding, such as
keyhash-based sharding, request dispatching and stealing do not avoid
head-of-line blocking, and therefore exhibit worse tail latencies. The
challenge in implementing size-aware sharding is to maintain high throughput by
avoiding the cost of software dispatching and by achieving load balancing
between different cores. Minos uses hardware dispatch for all requests for
small items, which form the very large majority of all requests. It achieves
load balancing by adapting the number of cores handling requests for small and
large items to their relative presence in the workload. We compare Minos to
three state-of-the-art designs of in-memory KV stores. Compared to its closest
competitor, Minos achieves a 99th percentile latency that is up to two orders
of magnitude lower. Put differently, for a given value for the 99th percentile
latency equal to 10 times the mean service time, Minos achieves a throughput
that is up to 7.4 times higher.
| cs.DB cs.OS | this paper introduces the concept of sizeaware sharding to improve tail latencies for inmemory keyvalue stores and describes its implementation in the minos keyvalue store tail latencies are crucial in distributed applications with high fanout ratios because overall response time is determined by the slowest response sizeaware sharding distributes requests for keys to cores according to the size of the item associated with the key in particular requests for small and large items are sent to disjoint subsets of cores sizeaware sharding improves tail latencies by avoiding headofline blocking in which a request for a small item gets queued behind a request for a large item alternative sizeunaware approaches to sharding such as keyhashbased sharding request dispatching and stealing do not avoid headofline blocking and therefore exhibit worse tail latencies the challenge in implementing sizeaware sharding is to maintain high throughput by avoiding the cost of software dispatching and by achieving load balancing between different cores minos uses hardware dispatch for all requests for small items which form the very large majority of all requests it achieves load balancing by adapting the number of cores handling requests for small and large items to their relative presence in the workload we compare minos to three stateoftheart designs of inmemory kv stores compared to its closest competitor minos achieves a 99th percentile latency that is up to two orders of magnitude lower put differently for a given value for the 99th percentile latency equal to 10 times the mean service time minos achieves a throughput that is up to 74 times higher | [['this', 'paper', 'introduces', 'the', 'concept', 'of', 'sizeaware', 'sharding', 'to', 'improve', 'tail', 'latencies', 'for', 'inmemory', 'keyvalue', 'stores', 'and', 'describes', 'its', 'implementation', 'in', 'the', 'minos', 'keyvalue', 'store', 'tail', 'latencies', 'are', 'crucial', 'in', 'distributed', 'applications', 'with', 'high', 'fanout', 'ratios', 'because', 'overall', 'response', 'time', 'is', 'determined', 'by', 'the', 'slowest', 'response', 'sizeaware', 'sharding', 'distributes', 'requests', 'for', 'keys', 'to', 'cores', 'according', 'to', 'the', 'size', 'of', 'the', 'item', 'associated', 'with', 'the', 'key', 'in', 'particular', 'requests', 'for', 'small', 'and', 'large', 'items', 'are', 'sent', 'to', 'disjoint', 'subsets', 'of', 'cores', 'sizeaware', 'sharding', 'improves', 'tail', 'latencies', 'by', 'avoiding', 'headofline', 'blocking', 'in', 'which', 'a', 'request', 'for', 'a', 'small', 'item', 'gets', 'queued', 'behind', 'a', 'request', 'for', 'a', 'large', 'item', 'alternative', 'sizeunaware', 'approaches', 'to', 'sharding', 'such', 'as', 'keyhashbased', 'sharding', 'request', 'dispatching', 'and', 'stealing', 'do', 'not', 'avoid', 'headofline', 'blocking', 'and', 'therefore', 'exhibit', 'worse', 'tail', 'latencies', 'the', 'challenge', 'in', 'implementing', 'sizeaware', 'sharding', 'is', 'to', 'maintain', 'high', 'throughput', 'by', 'avoiding', 'the', 'cost', 'of', 'software', 'dispatching', 'and', 'by', 'achieving', 'load', 'balancing', 'between', 'different', 'cores', 'minos', 'uses', 'hardware', 'dispatch', 'for', 'all', 'requests', 'for', 'small', 'items', 'which', 'form', 'the', 'very', 'large', 'majority', 'of', 'all', 'requests', 'it', 'achieves', 'load', 'balancing', 'by', 'adapting', 'the', 'number', 'of', 'cores', 'handling', 'requests', 'for', 'small', 'and', 'large', 'items', 'to', 'their', 'relative', 'presence', 'in', 'the', 'workload', 'we', 'compare', 'minos', 'to', 'three', 'stateoftheart', 'designs', 'of', 'inmemory', 'kv', 'stores', 'compared', 'to', 'its', 'closest', 'competitor', 'minos', 'achieves', 'a', '99th', 'percentile', 'latency', 'that', 'is', 'up', 'to', 'two', 'orders', 'of', 'magnitude', 'lower', 'put', 'differently', 'for', 'a', 'given', 'value', 'for', 'the', '99th', 'percentile', 'latency', 'equal', 'to', '10', 'times', 'the', 'mean', 'service', 'time', 'minos', 'achieves', 'a', 'throughput', 'that', 'is', 'up', 'to', '74', 'times', 'higher']] | [-0.17805189552419584, 0.09289528757185754, 0.007602266542245309, 0.040356361026994796, -0.08425726816635723, -0.20451301327805474, 0.16850394359293444, 0.3752751347659401, -0.23058681944457365, -0.3521827318734497, 0.08160394376531356, -0.315523996590023, -0.012379449164105017, 0.14927469048867464, -0.16030628472212846, 0.07759690169013077, 0.07132752801295254, 0.021495437633982577, -0.02490123757138639, -0.3247482842475161, 0.2121581779305585, 0.124286440414983, 0.3294863964867771, 0.05572073887663626, 0.08435689023327689, -0.013800863171169577, -0.030815858461139652, -0.026894649846530963, -0.023575208053796447, 0.10026409716865178, 0.30329379174035304, 0.1987075872589336, 0.2979959707559166, -0.44299896484869894, -0.11105486632923978, 0.08280688836130985, 0.12239745702926619, 0.01963364813556216, 0.0007846215396917375, -0.2393215841644393, 0.17763515481251946, -0.246555434663549, -0.05462488583866651, -0.05927469609194713, 0.03721124971964101, 0.08155647142205474, -0.29932049002932465, 0.015588766007229339, -0.0046907292678444595, -0.014067463804209647, -0.012291142254952312, -0.13067987131120912, 0.0465576983519014, 0.163528294405853, 0.0723205106026067, 0.029347751011653232, 0.14457741564445653, -0.11725859642714666, -0.1250069703367113, 0.41788677700123816, -0.009804864821941123, -0.1228315357190815, 0.15049370320499406, -0.054701985243147025, -0.12381260310906138, 0.17267476216900748, 0.20217053831397924, 0.03221632545189427, -0.16208038981931733, -0.003838676229649938, -0.010906963319474355, 0.18919109024266287, 0.1632089986422554, 0.06154131972819365, 0.14534197743917102, 0.21950835659432175, 0.14565136314048469, 0.12094885521286795, -0.07564650870730573, -0.10735414079534858, -0.20766612636141998, -0.13579069781153238, -0.16774905766559, 0.0013995360928364712, -0.14136379821437625, -0.13553647359006482, 0.3524616433491627, 0.17493392384697704, 0.19288587986397765, 0.17113652794401688, 0.3759226275954482, 0.06945881022225213, 0.16157683832372371, 0.20724272678512357, 0.096478180663819, -0.03566973209796228, 0.16216360945899813, -0.20297209792337273, 0.16008186694902418, 0.012767191563891752] |
1,802.00697 | Holographic Aspects of Quasi-topological Gravity | In this paper, we study the holography of quasi-topological gravity in
several aspects. We redo the calculation of shear viscosity on the boundary CFT
with a new method which is associated with conserved Noether current and show
that it has only one mode explicitly. Then we study the butterfly effect in AdS
planar black hole and find it has two butterfly velocity modes because of the
quasi-topological term. We obtain new black hole solution through introducing
matter fields. We calculate the thermoelectric DC conductivity with momentum
dissipation in quasi-topological gravity and find its results are the same with
those of Einstein and Gauss-Bonnet gravities. These results show us explicit
similarities and differences between quasi-topological term and actual
topological term in the context of holography.
| hep-th | in this paper we study the holography of quasitopological gravity in several aspects we redo the calculation of shear viscosity on the boundary cft with a new method which is associated with conserved noether current and show that it has only one mode explicitly then we study the butterfly effect in ads planar black hole and find it has two butterfly velocity modes because of the quasitopological term we obtain new black hole solution through introducing matter fields we calculate the thermoelectric dc conductivity with momentum dissipation in quasitopological gravity and find its results are the same with those of einstein and gaussbonnet gravities these results show us explicit similarities and differences between quasitopological term and actual topological term in the context of holography | [['in', 'this', 'paper', 'we', 'study', 'the', 'holography', 'of', 'quasitopological', 'gravity', 'in', 'several', 'aspects', 'we', 'redo', 'the', 'calculation', 'of', 'shear', 'viscosity', 'on', 'the', 'boundary', 'cft', 'with', 'a', 'new', 'method', 'which', 'is', 'associated', 'with', 'conserved', 'noether', 'current', 'and', 'show', 'that', 'it', 'has', 'only', 'one', 'mode', 'explicitly', 'then', 'we', 'study', 'the', 'butterfly', 'effect', 'in', 'ads', 'planar', 'black', 'hole', 'and', 'find', 'it', 'has', 'two', 'butterfly', 'velocity', 'modes', 'because', 'of', 'the', 'quasitopological', 'term', 'we', 'obtain', 'new', 'black', 'hole', 'solution', 'through', 'introducing', 'matter', 'fields', 'we', 'calculate', 'the', 'thermoelectric', 'dc', 'conductivity', 'with', 'momentum', 'dissipation', 'in', 'quasitopological', 'gravity', 'and', 'find', 'its', 'results', 'are', 'the', 'same', 'with', 'those', 'of', 'einstein', 'and', 'gaussbonnet', 'gravities', 'these', 'results', 'show', 'us', 'explicit', 'similarities', 'and', 'differences', 'between', 'quasitopological', 'term', 'and', 'actual', 'topological', 'term', 'in', 'the', 'context', 'of', 'holography']] | [-0.18060240974732406, 0.10010024754052621, -0.09158927133877671, 0.07232013325612512, -0.11839375895027432, -0.14815732297457515, -0.015566096114437846, 0.30715184965200965, -0.21587180538523582, -0.29304140595899475, 0.06772022135086328, -0.32842406926811823, -0.20286270994843253, 0.17974470986894542, -0.04812683011104743, 0.0076066439463418995, -0.008937448389910823, 0.053784146510635414, -0.10400502288229613, -0.23758783696159239, 0.3727840649850306, 0.009833219862963644, 0.263038071610349, 0.06873109189402912, 0.09226331975397413, -0.05742779173118423, -0.024836592428806807, 0.10210504211230023, -0.21229658150819417, 0.06488605868352967, 0.19312249091754277, 0.02021839048322891, 0.1691656499169767, -0.40801194990654627, -0.2406017469287279, 0.03854875967297102, 0.10628256496537718, 0.17710023134807876, -0.08974578471257232, -0.23597007208774168, 0.06102800651288201, -0.23272440116946405, -0.10381919182386369, -0.11620599434771124, 0.03835360973607749, -0.054820729243088395, -0.18835581665212708, 0.14075852518961315, 0.024653042551137566, -0.009397018464252112, -0.1117043343434606, -0.04118304084723575, -0.07202961926926829, 0.10981596983413422, 0.1673788791503607, 0.01993311599512855, 0.09410461386845957, -0.1667810461780567, -0.0963592102620638, 0.3595300806806453, -0.10848703437424716, -0.22516449036512284, 0.1796994343955791, -0.23477772475340433, -0.12191945831516697, 0.03337719628489726, 0.11217637321322164, 0.1599247649522318, -0.14749999900138186, 0.13271792734045565, -0.012876679549076325, 0.12615111246592395, 0.10252068933445, 0.07747031422707462, 0.30564933555621293, 0.08572661532689968, 0.03664912131892878, 0.18955231002426795, -0.08130688261618131, -0.06530565236725154, -0.32779630856032693, -0.20972633395989937, -0.1446122013437543, 0.04375904544647182, -0.15537932719739583, -0.1875669960037715, 0.3892123981288845, 0.17268162396090525, 0.12963212913769717, 0.039949054939619776, 0.2585884694821171, 0.1307828156127324, 0.07198749566751142, 0.10373264001757507, 0.31917172513203695, 0.14558099806421407, 0.13510671841926994, -0.3109485256342938, -0.0852424604480245, 0.14833935868040088] |
1,802.00698 | On the zero-crossing of the three-gluon Green's function from lattice
simulations | We report on some efforts recently made in order to gain a better
understanding of some IR properties of the 3-point gluon Green's function by
exploiting results from large-volume quenched lattice simulations. These
lattice results have been obtained by using both tree-level Symanzik and the
standard Wilson action, in the aim of assessing the possible impact of effects
presumably resulting from a particular choice for the discretization of the
action. The main resulting feature is the existence of a negative logaritmic
divergence at zero-momentum, which pulls the 3-gluon form factors down at low
momenta and, consequently, yields a zero-crossing at a given deep IR momentum.
The results can be correctly explained by analyzing the relevant
Dyson-Schwinger equations and appropriate truncation schemes.
| hep-lat hep-ph | we report on some efforts recently made in order to gain a better understanding of some ir properties of the 3point gluon greens function by exploiting results from largevolume quenched lattice simulations these lattice results have been obtained by using both treelevel symanzik and the standard wilson action in the aim of assessing the possible impact of effects presumably resulting from a particular choice for the discretization of the action the main resulting feature is the existence of a negative logaritmic divergence at zeromomentum which pulls the 3gluon form factors down at low momenta and consequently yields a zerocrossing at a given deep ir momentum the results can be correctly explained by analyzing the relevant dysonschwinger equations and appropriate truncation schemes | [['we', 'report', 'on', 'some', 'efforts', 'recently', 'made', 'in', 'order', 'to', 'gain', 'a', 'better', 'understanding', 'of', 'some', 'ir', 'properties', 'of', 'the', '3point', 'gluon', 'greens', 'function', 'by', 'exploiting', 'results', 'from', 'largevolume', 'quenched', 'lattice', 'simulations', 'these', 'lattice', 'results', 'have', 'been', 'obtained', 'by', 'using', 'both', 'treelevel', 'symanzik', 'and', 'the', 'standard', 'wilson', 'action', 'in', 'the', 'aim', 'of', 'assessing', 'the', 'possible', 'impact', 'of', 'effects', 'presumably', 'resulting', 'from', 'a', 'particular', 'choice', 'for', 'the', 'discretization', 'of', 'the', 'action', 'the', 'main', 'resulting', 'feature', 'is', 'the', 'existence', 'of', 'a', 'negative', 'logaritmic', 'divergence', 'at', 'zeromomentum', 'which', 'pulls', 'the', '3gluon', 'form', 'factors', 'down', 'at', 'low', 'momenta', 'and', 'consequently', 'yields', 'a', 'zerocrossing', 'at', 'a', 'given', 'deep', 'ir', 'momentum', 'the', 'results', 'can', 'be', 'correctly', 'explained', 'by', 'analyzing', 'the', 'relevant', 'dysonschwinger', 'equations', 'and', 'appropriate', 'truncation', 'schemes']] | [-0.08219489552973469, 0.13248966817459293, -0.1304935270974274, 0.06525274534413422, -0.047705999804537526, -0.0503832857540139, 0.06744039602277507, 0.365962609810339, -0.2070145297733959, -0.2743396474902849, 0.09485958088458754, -0.2707035384979869, -0.12814297463960392, 0.15724436462325744, 0.014273874715647915, 0.07684981472759454, 0.05873327228348425, 0.0014451013585506391, -0.12044647244461389, -0.2526970541427943, 0.3509767815001186, 0.06582349309219579, 0.272887314207975, 0.10867790584952748, 0.1059021443379456, 0.007226235468002144, -0.08358354450873107, 0.026871407812476652, -0.11350181688143764, 0.10329204548173392, 0.20476689599723794, 0.03331766022207631, 0.2466068061872978, -0.39209245685641925, -0.20132027065366015, 0.038486806725821464, 0.14126588376662272, 0.1278058587994873, -0.041968640648136456, -0.2613941614154326, 0.07519819910738094, -0.15118099022887585, -0.1733735550179585, -0.11585747827737292, -0.04917453594259487, -0.003623972570885373, -0.2842641227439908, 0.05026358185905563, 0.021279380498992757, 0.05361995200168588, -0.02380979013021204, -0.1813671082558403, -0.04984363453262601, 0.13642678250970458, 0.07434649468295676, 0.07865616760008838, 0.08986057887384899, -0.2125028693463561, -0.10892685303514561, 0.3906484308329311, -0.08028182936716856, -0.1916523066249268, 0.1692737140923677, -0.16457248780460768, -0.11409899117502052, 0.1540972585859011, 0.1390047174963084, 0.10430154810305531, -0.17253149031519058, 0.1068993037927815, -0.011229391998230394, 0.1330220535366742, 0.10367368678908703, 0.058683513261547145, 0.21967062077769808, 0.13781197108366827, -0.032851859167110455, 0.11449019229405151, -0.04162807162843398, -0.10433093519267542, -0.327025096748055, -0.059688579906855735, -0.1449639147824862, 0.07773731610437562, -0.11583696850270037, -0.10860988248355133, 0.37437555138675943, 0.14830591481502267, 0.2106889901059287, 0.04141385877631943, 0.2681304368475252, 0.16006707313493634, 0.11331309293481437, 0.046960146535834496, 0.2324423335424301, 0.11098596847746983, 0.07194183280302811, -0.288788723382206, 0.01192397690591718, 0.14428459542460956] |
1,802.00699 | Data Dwarfs: A Lens Towards Fully Understanding Big Data and AI
Workloads | The complexity and diversity of big data and AI workloads make understanding
them difficult and challenging. This paper proposes a new approach to
characterizing big data and AI workloads. We consider each big data and AI
workload as a pipeline of one or more classes of unit of computations performed
on different initial or intermediate data inputs. Each class of unit of
computation captures the common requirements while being reasonably divorced
from individual implementations, and hence we call it a data dwarf. For the
first time, among a wide variety of big data and AI workloads, we identify
eight data dwarfs that takes up most of run time, including Matrix, Sampling,
Logic, Transform, Set, Graph, Sort and Statistic. We implement the eight data
dwarfs on different software stacks as the micro benchmarks of an open-source
big data and AI benchmark suite, and perform comprehensive characterization of
those data dwarfs from perspective of data sizes, types, sources, and patterns
as a lens towards fully understanding big data and AI workloads.
| cs.DC cs.PF | the complexity and diversity of big data and ai workloads make understanding them difficult and challenging this paper proposes a new approach to characterizing big data and ai workloads we consider each big data and ai workload as a pipeline of one or more classes of unit of computations performed on different initial or intermediate data inputs each class of unit of computation captures the common requirements while being reasonably divorced from individual implementations and hence we call it a data dwarf for the first time among a wide variety of big data and ai workloads we identify eight data dwarfs that takes up most of run time including matrix sampling logic transform set graph sort and statistic we implement the eight data dwarfs on different software stacks as the micro benchmarks of an opensource big data and ai benchmark suite and perform comprehensive characterization of those data dwarfs from perspective of data sizes types sources and patterns as a lens towards fully understanding big data and ai workloads | [['the', 'complexity', 'and', 'diversity', 'of', 'big', 'data', 'and', 'ai', 'workloads', 'make', 'understanding', 'them', 'difficult', 'and', 'challenging', 'this', 'paper', 'proposes', 'a', 'new', 'approach', 'to', 'characterizing', 'big', 'data', 'and', 'ai', 'workloads', 'we', 'consider', 'each', 'big', 'data', 'and', 'ai', 'workload', 'as', 'a', 'pipeline', 'of', 'one', 'or', 'more', 'classes', 'of', 'unit', 'of', 'computations', 'performed', 'on', 'different', 'initial', 'or', 'intermediate', 'data', 'inputs', 'each', 'class', 'of', 'unit', 'of', 'computation', 'captures', 'the', 'common', 'requirements', 'while', 'being', 'reasonably', 'divorced', 'from', 'individual', 'implementations', 'and', 'hence', 'we', 'call', 'it', 'a', 'data', 'dwarf', 'for', 'the', 'first', 'time', 'among', 'a', 'wide', 'variety', 'of', 'big', 'data', 'and', 'ai', 'workloads', 'we', 'identify', 'eight', 'data', 'dwarfs', 'that', 'takes', 'up', 'most', 'of', 'run', 'time', 'including', 'matrix', 'sampling', 'logic', 'transform', 'set', 'graph', 'sort', 'and', 'statistic', 'we', 'implement', 'the', 'eight', 'data', 'dwarfs', 'on', 'different', 'software', 'stacks', 'as', 'the', 'micro', 'benchmarks', 'of', 'an', 'opensource', 'big', 'data', 'and', 'ai', 'benchmark', 'suite', 'and', 'perform', 'comprehensive', 'characterization', 'of', 'those', 'data', 'dwarfs', 'from', 'perspective', 'of', 'data', 'sizes', 'types', 'sources', 'and', 'patterns', 'as', 'a', 'lens', 'towards', 'fully', 'understanding', 'big', 'data', 'and', 'ai', 'workloads']] | [-0.09037668442080822, 0.004127868015223359, -0.07274241139974512, 0.07842160677799084, -0.10760761469260917, -0.15951832678973588, 0.08060227790861198, 0.36878611556303925, -0.25744092004640945, -0.3966793974519834, 0.13171156750958876, -0.29749725090846774, -0.0941333170599971, 0.2527346276600994, -0.08224730731688171, 0.08634579691763129, 0.15712383767512775, -0.015746108779804948, -0.032515942996654376, -0.2755503879431924, 0.3515876427929319, -0.0014590998125102745, 0.288872904598695, -0.05496951221411265, 0.05837447153949923, -0.043145593404549466, -0.07236084688803424, -0.018454739749541826, -0.10429273414055813, 0.10404526744969189, 0.3143692714873062, 0.2978763320461224, 0.29909907965838206, -0.4519874823648901, -0.12897413383381298, 0.100438683302026, 0.10556968862256973, 0.05851899234153683, -0.047911964390394496, -0.27423875419059274, 0.09008465734856015, -0.1663789834507559, -0.05361495287048757, -0.137533273152489, 0.05250092500203548, 0.0031370449471618076, -0.26184004123361243, -0.04017248304186047, 0.029653247646965395, 0.10821901148008789, -0.04056732983124503, -0.12272751913543724, 0.028175161408877672, 0.16395755186566763, 0.020797664522750996, 0.009818025500260117, 0.13739534787084223, -0.1275243166952598, -0.12240603416276401, 0.43575642773738277, -0.0113780046454989, -0.08542536031565018, 0.2131390227996827, -0.06601472600148274, -0.20708575107972826, 0.05268565426751442, 0.23380898383512166, 0.09610176189201912, -0.18747848636862, 0.05561230704601656, 0.023781638460222784, 0.1680880243257625, 0.02453257820635108, 0.028278155384596285, 0.19577075638698094, 0.2551820344655339, 0.030522773805564854, 0.08145288391226142, -0.12277126852743267, -0.08951823919813132, -0.21555196769678822, -0.16187874096054475, -0.15622005829058544, 0.037018801562333774, -0.13558225792773432, -0.17769224793180416, 0.3858013212771745, 0.16946413597924162, 0.21195784809354407, 0.08543826497474014, 0.36651557356604103, -0.0023507361034910915, 0.13879285866984292, 0.08863544141730437, 0.069275989988681, 0.02486025734898254, 0.15344935918044983, -0.1250712861439224, 0.02907712568567526, -0.06637700604079926] |
1,802.007 | The edge cloud: A holistic view of communication, computation and
caching | The evolution of communication networks shows a clear shift of focus from
just improving the communications aspects to enabling new important services,
from Industry 4.0 to automated driving, virtual/augmented reality, Internet of
Things (IoT), and so on. This trend is evident in the roadmap planned for the
deployment of the fifth generation (5G) communication networks. This ambitious
goal requires a paradigm shift towards a vision that looks at communication,
computation and caching (3C) resources as three components of a single holistic
system. The further step is to bring these 3C resources closer to the mobile
user, at the edge of the network, to enable very low latency and high
reliability services. The scope of this chapter is to show that signal
processing techniques can play a key role in this new vision. In particular, we
motivate the joint optimization of 3C resources. Then we show how graph-based
representations can play a key role in building effective learning methods and
devising innovative resource allocation techniques.
| eess.SP | the evolution of communication networks shows a clear shift of focus from just improving the communications aspects to enabling new important services from industry 40 to automated driving virtualaugmented reality internet of things iot and so on this trend is evident in the roadmap planned for the deployment of the fifth generation 5g communication networks this ambitious goal requires a paradigm shift towards a vision that looks at communication computation and caching 3c resources as three components of a single holistic system the further step is to bring these 3c resources closer to the mobile user at the edge of the network to enable very low latency and high reliability services the scope of this chapter is to show that signal processing techniques can play a key role in this new vision in particular we motivate the joint optimization of 3c resources then we show how graphbased representations can play a key role in building effective learning methods and devising innovative resource allocation techniques | [['the', 'evolution', 'of', 'communication', 'networks', 'shows', 'a', 'clear', 'shift', 'of', 'focus', 'from', 'just', 'improving', 'the', 'communications', 'aspects', 'to', 'enabling', 'new', 'important', 'services', 'from', 'industry', '40', 'to', 'automated', 'driving', 'virtualaugmented', 'reality', 'internet', 'of', 'things', 'iot', 'and', 'so', 'on', 'this', 'trend', 'is', 'evident', 'in', 'the', 'roadmap', 'planned', 'for', 'the', 'deployment', 'of', 'the', 'fifth', 'generation', '5g', 'communication', 'networks', 'this', 'ambitious', 'goal', 'requires', 'a', 'paradigm', 'shift', 'towards', 'a', 'vision', 'that', 'looks', 'at', 'communication', 'computation', 'and', 'caching', '3c', 'resources', 'as', 'three', 'components', 'of', 'a', 'single', 'holistic', 'system', 'the', 'further', 'step', 'is', 'to', 'bring', 'these', '3c', 'resources', 'closer', 'to', 'the', 'mobile', 'user', 'at', 'the', 'edge', 'of', 'the', 'network', 'to', 'enable', 'very', 'low', 'latency', 'and', 'high', 'reliability', 'services', 'the', 'scope', 'of', 'this', 'chapter', 'is', 'to', 'show', 'that', 'signal', 'processing', 'techniques', 'can', 'play', 'a', 'key', 'role', 'in', 'this', 'new', 'vision', 'in', 'particular', 'we', 'motivate', 'the', 'joint', 'optimization', 'of', '3c', 'resources', 'then', 'we', 'show', 'how', 'graphbased', 'representations', 'can', 'play', 'a', 'key', 'role', 'in', 'building', 'effective', 'learning', 'methods', 'and', 'devising', 'innovative', 'resource', 'allocation', 'techniques']] | [-0.17324649720884314, 0.024718877126848917, -0.06519010908356528, 0.024233115744697522, -0.10834461690363952, -0.16818553518018367, 0.0647956552722196, 0.3976585515093331, -0.2735848140903882, -0.3356512284684336, 0.08766379847940875, -0.23312146847829132, -0.1914094552218846, 0.19853198912744296, -0.12131132021995211, 0.04813952429969681, 0.07591351063172447, -0.007010024289384757, -0.015687471241463066, -0.23808408163419767, 0.2838979737588954, 0.11999046088128192, 0.38131708705161765, 0.08121684932635484, 0.03053830412398206, -0.0022352918274075972, -0.05217418080002705, -0.07411395681371753, -0.05782050029177676, 0.21170045058072612, 0.38016881207685643, 0.21463487385317864, 0.38601955697479906, -0.4389983617655206, -0.21950898630680835, 0.08438723070104039, 0.1988526411381516, 0.07060697166357054, -0.07534316349448068, -0.2736726790871017, 0.06812310598012651, -0.21793217962698602, -0.0957182184793055, -0.04052185011096299, 0.02616709148193278, -0.00103968549974081, -0.2387123273731005, -0.02536766673526982, 0.017556053143358084, 0.05498312497880628, -0.017469896423834855, -0.07704309721565351, 0.03366876898969456, 0.21962381413819768, 0.0004058354491617803, 0.04529505275564677, 0.1619607531291677, -0.17916723493083447, -0.15600553176240858, 0.4400044877036679, 0.008593875677722348, -0.09706444129711245, 0.18052550516710275, -0.0438223145632414, -0.24054850022899124, 0.07603983311039372, 0.25226031495939666, 0.0257580956105546, -0.14480444018178187, 0.02084669458311443, 0.06070747641596671, 0.17132389413905558, 0.015575993079237821, 0.10131850629397554, 0.2611089609180032, 0.2795270004908827, 0.14280257616918812, 0.1137648830119316, -0.07247258438700356, -0.08844380178375215, -0.22525077874249802, -0.17549812931868405, -0.17885342647503244, 0.022991281585191467, -0.07791859555738218, -0.06942722453627871, 0.38532654055757676, 0.21516634493770942, 0.11286849766492663, 0.04973023918048456, 0.3949870573123917, 0.04288971107438911, 0.1252882401742859, 0.12346547090579052, 0.21186725123609393, 0.023919061893915256, 0.24099537600456486, -0.1472957235542353, 0.06053121577346379, -0.0005297403862109272] |
1,802.00701 | Induced map on K theory for certain \Gamma-equivariant maps between
Hilbert spaces | Higson-Kapsparov-Trout introduced an infinite-dimensional Clifford algebra of
a Hilbert space, and verified Bott periodicity on K-theory. To develop
algebraic topology of maps between Hilbert spaces, in this paper we introduce
an induced Hilbert Clifford algebra, and construct an induced map between
K-theory of the Higson-Kasparov-Trout Clifford algebra and the induced Clifford
algebra. We also compute its K-group for some concrete case.
| math.KT | higsonkapsparovtrout introduced an infinitedimensional clifford algebra of a hilbert space and verified bott periodicity on ktheory to develop algebraic topology of maps between hilbert spaces in this paper we introduce an induced hilbert clifford algebra and construct an induced map between ktheory of the higsonkasparovtrout clifford algebra and the induced clifford algebra we also compute its kgroup for some concrete case | [['higsonkapsparovtrout', 'introduced', 'an', 'infinitedimensional', 'clifford', 'algebra', 'of', 'a', 'hilbert', 'space', 'and', 'verified', 'bott', 'periodicity', 'on', 'ktheory', 'to', 'develop', 'algebraic', 'topology', 'of', 'maps', 'between', 'hilbert', 'spaces', 'in', 'this', 'paper', 'we', 'introduce', 'an', 'induced', 'hilbert', 'clifford', 'algebra', 'and', 'construct', 'an', 'induced', 'map', 'between', 'ktheory', 'of', 'the', 'higsonkasparovtrout', 'clifford', 'algebra', 'and', 'the', 'induced', 'clifford', 'algebra', 'we', 'also', 'compute', 'its', 'kgroup', 'for', 'some', 'concrete', 'case']] | [-0.1919561234318604, 0.07284798206227745, -0.06048213128963391, 0.11062928723858007, -0.10823457659679954, -0.10890096519142389, -0.05580005022673473, 0.3697598212856357, -0.43292505780266505, -0.175149504347878, 0.099313225776699, -0.1664983678976137, -0.23694219307626707, 0.2361817577759088, -0.25457691333367155, -0.06914564642080469, 0.025529275466766903, 0.06835377238438291, -0.19825255638777706, -0.27635206855730926, 0.4830434609015109, 0.043236171479447416, 0.18050371436007573, 0.01937625705564426, 0.16301860559289738, 0.05225713259808845, -0.04013050615913787, -0.08266189737863033, -0.1345700342208147, 0.1517728649837486, 0.32740026564037394, 0.058000048792179106, 0.1572032373840526, -0.42237174334162375, -0.05217044132809013, 0.24454545707962774, 0.12057216276051634, -0.0444421369811299, -0.040168551406507394, -0.36784065542821537, 0.007162038774784039, -0.2395242528390076, -0.08347118895706106, -0.1906078097773558, 0.09092714839567573, -0.19212565208011764, -0.2028684919005481, -0.08815583902839334, 0.09042789862822678, 0.2543425650604196, -0.12632673353911772, 0.02717860237403252, -0.12684443441487975, 0.06328766974541596, -0.14088135111635014, 0.03500987324169127, 0.126731743120541, 0.042102856533917585, -0.23098755847283844, 0.3013090630361842, 0.011010588749540749, -0.273075315406767, 0.04702057919891204, -0.1531988037276571, -0.19108259988853993, 0.02833673065938687, 0.06999185128863585, 0.08773630061897181, 0.027976892841190606, 0.25247586169378766, -0.12879274779204594, 0.05561457965049451, 0.06103919324922865, 0.039510998417134, 0.01844601402595892, 0.0487020161571139, 0.07802033007650053, 0.18879367052814214, 0.039941861290263676, -0.06737817464281916, -0.3851840733155861, -0.26353135311155246, -0.12719751115477942, 0.16194092719894598, -0.13132396206122593, -0.22854396637718558, 0.4829525550338045, 0.1150683725915723, 0.18497473007794155, 0.09893163803459729, 0.23027421738084217, 0.12813797708348199, 0.036627140409171074, 0.07415173207488605, 0.0885294626838867, 0.32797174594538697, -0.005869670684244168, -0.132123439229425, -0.12687739899571418, 0.2996030173153948] |
1,802.00702 | Differential invariants of Einstein-Weyl structures in 3D | Einstein-Weyl structures on a three-dimensional manifold $M$ is given by a
system $E$ of PDEs on sections of a bundle over $M$. This system is invariant
under the Lie pseudogroup $G$ of local diffeomorphisms on $M$. Two
Einstein-Weyl structures are locally equivalent if there exists a local
diffeomorphism taking one to the other. Our goal is to describe the quotient
equation $E/G$ whose solutions correspond to nonequivalent Einstein-Weyl
structures. The approach uses symmetries of the Manakov-Santini integrable
system and the action of the corresponding Lie pseudogroup.
| math.DG math-ph math.MP nlin.SI | einsteinweyl structures on a threedimensional manifold m is given by a system e of pdes on sections of a bundle over m this system is invariant under the lie pseudogroup g of local diffeomorphisms on m two einsteinweyl structures are locally equivalent if there exists a local diffeomorphism taking one to the other our goal is to describe the quotient equation eg whose solutions correspond to nonequivalent einsteinweyl structures the approach uses symmetries of the manakovsantini integrable system and the action of the corresponding lie pseudogroup | [['einsteinweyl', 'structures', 'on', 'a', 'threedimensional', 'manifold', 'm', 'is', 'given', 'by', 'a', 'system', 'e', 'of', 'pdes', 'on', 'sections', 'of', 'a', 'bundle', 'over', 'm', 'this', 'system', 'is', 'invariant', 'under', 'the', 'lie', 'pseudogroup', 'g', 'of', 'local', 'diffeomorphisms', 'on', 'm', 'two', 'einsteinweyl', 'structures', 'are', 'locally', 'equivalent', 'if', 'there', 'exists', 'a', 'local', 'diffeomorphism', 'taking', 'one', 'to', 'the', 'other', 'our', 'goal', 'is', 'to', 'describe', 'the', 'quotient', 'equation', 'eg', 'whose', 'solutions', 'correspond', 'to', 'nonequivalent', 'einsteinweyl', 'structures', 'the', 'approach', 'uses', 'symmetries', 'of', 'the', 'manakovsantini', 'integrable', 'system', 'and', 'the', 'action', 'of', 'the', 'corresponding', 'lie', 'pseudogroup']] | [-0.26199088655791225, 0.04644942824420151, -0.08204987623490566, 0.04167629521188521, -0.1124466905900992, -0.14132251697700732, -0.07301609884530609, 0.34489412445488365, -0.2795907659239547, -0.24147570787842365, 0.10260792966758789, -0.2713266890062842, -0.16413857755359523, 0.15805356887028402, -0.08430798913807024, 0.003741842618775229, 0.06478300463234962, 0.12256760766653907, -0.12644760932253543, -0.2561222169518492, 0.4682509120293828, -0.04164848260603152, 0.23700811939184055, -0.062040673528911634, 0.22705658404210713, -0.055486924477939514, 0.03990033925186063, 0.02902557601784031, -0.13657837388170666, 0.09829422472542974, 0.23680631389711485, 0.07146418488281238, 0.17284930435139254, -0.37181517444984163, -0.16970229369783124, 0.12024318927162608, 0.08688334423996547, 0.01866052091814751, 0.032558878376094495, -0.33114460889293357, 0.10603239222667939, -0.09948561251093092, -0.13866534171257774, -0.05725750347686022, 0.07868555850392683, -0.03187564000227423, -0.18419825234233814, 0.009549474906782771, 0.10698132499575962, 0.06752959485057482, -0.12181239406210045, -0.02378977603024565, -0.13993771758396178, 0.06557948286320235, -0.022630766334640253, 0.05939976731856722, 0.1274349269088964, -0.0289788511013179, -0.09906746399166538, 0.4606288538292743, -0.07791662435209769, -0.32950271731567415, 0.18078568790021332, -0.12003972015863415, -0.14678281041533622, 0.17043054002055594, 0.12207114352671386, 0.1638975373095681, -0.09205843325227846, 0.22630438051487015, -0.11186658579356655, 0.0757882914310971, 0.05808171294467134, -0.024412231595623633, 0.18316088151186705, 0.1589566582765127, 0.1731657790626551, 0.06691863682448626, 0.027536042941582583, -0.07041437783126914, -0.3772266144366112, -0.1588245886432137, -0.0938778782945646, 0.18069352495462396, -0.07545170947610871, -0.16648717592253762, 0.3928173954143774, 0.04848243534662436, 0.1969625983917869, 0.05689206158439087, 0.16648868930953836, 0.08011696103900715, 0.0949828025159361, 0.11024316097068232, 0.14727251208928782, 0.19822581349817905, -0.007374956679996103, -0.1911113859576628, -0.07965259463526309, 0.19890041119787236] |
1,802.00703 | From Clustering Supersequences to Entropy Minimizing Subsequences for
Single and Double Deletions | A binary string transmitted via a memoryless i.i.d. deletion channel is
received as a subsequence of the original input. From this, one obtains a
posterior distribution on the channel input, corresponding to a set of
candidate supersequences weighted by the number of times the received
subsequence can be embedded in them. In a previous work it is conjectured on
the basis of experimental data that the entropy of the posterior is minimized
and maximized by the constant and the alternating strings, respectively. In
this work, in addition to revisiting the entropy minimization conjecture, we
also address several related combinatorial problems. We present an algorithm
for counting the number of subsequence embeddings using a run-length encoding
of strings. We then describe methods for clustering the space of supersequences
such that the cardinality of the resulting sets depends only on the length of
the received subsequence and its Hamming weight, but not its exact form. Then,
we consider supersequences that contain a single embedding of a fixed
subsequence, referred to as singletons, and provide a closed form expression
for enumerating them using the same run-length encoding. We prove an analogous
result for the minimization and maximization of the number of singletons, by
the alternating and the uniform strings, respectively. Next, we prove the
original minimal entropy conjecture for the special cases of single and double
deletions using similar clustering techniques and the same run-length encoding,
which allow us to characterize the distribution of the number of subsequence
embeddings in the space of compatible supersequences to demonstrate the effect
of an entropy decreasing operation.
| cs.IT cs.DM math.IT | a binary string transmitted via a memoryless iid deletion channel is received as a subsequence of the original input from this one obtains a posterior distribution on the channel input corresponding to a set of candidate supersequences weighted by the number of times the received subsequence can be embedded in them in a previous work it is conjectured on the basis of experimental data that the entropy of the posterior is minimized and maximized by the constant and the alternating strings respectively in this work in addition to revisiting the entropy minimization conjecture we also address several related combinatorial problems we present an algorithm for counting the number of subsequence embeddings using a runlength encoding of strings we then describe methods for clustering the space of supersequences such that the cardinality of the resulting sets depends only on the length of the received subsequence and its hamming weight but not its exact form then we consider supersequences that contain a single embedding of a fixed subsequence referred to as singletons and provide a closed form expression for enumerating them using the same runlength encoding we prove an analogous result for the minimization and maximization of the number of singletons by the alternating and the uniform strings respectively next we prove the original minimal entropy conjecture for the special cases of single and double deletions using similar clustering techniques and the same runlength encoding which allow us to characterize the distribution of the number of subsequence embeddings in the space of compatible supersequences to demonstrate the effect of an entropy decreasing operation | [['a', 'binary', 'string', 'transmitted', 'via', 'a', 'memoryless', 'iid', 'deletion', 'channel', 'is', 'received', 'as', 'a', 'subsequence', 'of', 'the', 'original', 'input', 'from', 'this', 'one', 'obtains', 'a', 'posterior', 'distribution', 'on', 'the', 'channel', 'input', 'corresponding', 'to', 'a', 'set', 'of', 'candidate', 'supersequences', 'weighted', 'by', 'the', 'number', 'of', 'times', 'the', 'received', 'subsequence', 'can', 'be', 'embedded', 'in', 'them', 'in', 'a', 'previous', 'work', 'it', 'is', 'conjectured', 'on', 'the', 'basis', 'of', 'experimental', 'data', 'that', 'the', 'entropy', 'of', 'the', 'posterior', 'is', 'minimized', 'and', 'maximized', 'by', 'the', 'constant', 'and', 'the', 'alternating', 'strings', 'respectively', 'in', 'this', 'work', 'in', 'addition', 'to', 'revisiting', 'the', 'entropy', 'minimization', 'conjecture', 'we', 'also', 'address', 'several', 'related', 'combinatorial', 'problems', 'we', 'present', 'an', 'algorithm', 'for', 'counting', 'the', 'number', 'of', 'subsequence', 'embeddings', 'using', 'a', 'runlength', 'encoding', 'of', 'strings', 'we', 'then', 'describe', 'methods', 'for', 'clustering', 'the', 'space', 'of', 'supersequences', 'such', 'that', 'the', 'cardinality', 'of', 'the', 'resulting', 'sets', 'depends', 'only', 'on', 'the', 'length', 'of', 'the', 'received', 'subsequence', 'and', 'its', 'hamming', 'weight', 'but', 'not', 'its', 'exact', 'form', 'then', 'we', 'consider', 'supersequences', 'that', 'contain', 'a', 'single', 'embedding', 'of', 'a', 'fixed', 'subsequence', 'referred', 'to', 'as', 'singletons', 'and', 'provide', 'a', 'closed', 'form', 'expression', 'for', 'enumerating', 'them', 'using', 'the', 'same', 'runlength', 'encoding', 'we', 'prove', 'an', 'analogous', 'result', 'for', 'the', 'minimization', 'and', 'maximization', 'of', 'the', 'number', 'of', 'singletons', 'by', 'the', 'alternating', 'and', 'the', 'uniform', 'strings', 'respectively', 'next', 'we', 'prove', 'the', 'original', 'minimal', 'entropy', 'conjecture', 'for', 'the', 'special', 'cases', 'of', 'single', 'and', 'double', 'deletions', 'using', 'similar', 'clustering', 'techniques', 'and', 'the', 'same', 'runlength', 'encoding', 'which', 'allow', 'us', 'to', 'characterize', 'the', 'distribution', 'of', 'the', 'number', 'of', 'subsequence', 'embeddings', 'in', 'the', 'space', 'of', 'compatible', 'supersequences', 'to', 'demonstrate', 'the', 'effect', 'of', 'an', 'entropy', 'decreasing', 'operation']] | [-0.13912506720275972, 0.08555418534231796, -0.06723455808186098, 0.07185419967667453, -0.05499664638316352, -0.11711285844573686, 0.10035802350358117, 0.34997457964524226, -0.32653456398774783, -0.262854019651846, 0.10050004069787946, -0.29059983573593484, -0.11416642514897789, 0.1658299023471059, -0.08842900593968472, 0.07848709256083158, 0.06180519384592486, 0.13290139093071354, -0.07215760539192059, -0.29430510728598586, 0.30391221305077104, 0.019892282500306422, 0.2760988559120717, 0.009748899314099373, 0.10999621072573537, 0.05303188089912294, -0.03733642569696709, 0.023378929638279453, -0.1303095486406422, 0.15187881665546946, 0.21998332440407084, 0.2201706824834919, 0.24970867715051603, -0.3910737257465092, -0.18893621607337474, 0.14618023008266928, 0.16482618389743955, 0.10978166823733912, -0.03661282655427953, -0.2263012828124273, 0.12723477481698467, -0.14319792603966833, -0.03884226815967724, -0.031157091279581932, 0.022968963366644137, 0.04302047776465101, -0.275441556849599, 0.028817466928394354, 0.08505269453657427, 0.00176448669370221, -0.05278084732385145, -0.12133226649107776, 0.008444626452544011, 0.11516204733808322, 0.06820666966683292, 0.08080882556608011, 0.053499667339697764, -0.11446482500764345, -0.13176032008560395, 0.3468038872619413, -0.053806628797281805, -0.23139737096661522, 0.1080064146223717, -0.06954292136769014, -0.15874941739471365, 0.1254720984395215, 0.14736709974784676, 0.14178858886355128, -0.1163182806837376, 0.08560683296804256, -0.10692589610932801, 0.17364083909540226, 0.13885301372689335, 0.06167387936292823, 0.1710321147715623, 0.1235955309874817, 0.08974891670638788, 0.221265210713424, -0.08504698000660066, -0.05704313199931463, -0.28453742591414416, -0.15383249462691004, -0.2271246763144288, 0.038766678897996246, -0.12985959531644795, -0.20196085042673453, 0.3816068714709374, 0.11841067541265768, 0.24079755096554925, 0.1379832590781188, 0.2678610541254739, 0.10184474861642062, 0.04392710259635629, 0.09101932682989029, 0.12284854293927565, 0.1307676835926749, -0.0008382176805530243, -0.19992449185436315, 0.06251995767597412, 0.12537374530501408] |
1,802.00704 | A third order gas-kinetic scheme for unstructured grid | In our study, a compact third order gas-kinetic scheme is constructed for
unstructured grid which is combined the compact least-square reconstruction
(CLS) method. The CLS method can achieve arbitrary high order compact
reconstruction using the stencil from the whole computational domain
implicitly. A large sparse linear system resulted from the CLS reconstruction
method is solved by applying the generalized minimal residual algorithm
(GMRES), and the Reverse-Cuthill-McKee (RCM) algorithm and the incomplete
lower-upper (ILU) factorization method are implemented to accelerate the
convergence of the iterative method. Different from the traditional flux
solver, the BGK based gas-kinetic scheme is in the nature of spatial and
temporal accuracy. Applying the second order expansion to the distribution
function, the third order flux solver can be obtained directly. The accuracy of
present method is validated by several numerical cases such as the advection of
density perturbation problem, Sod shock wave problem, Lax shock tube test case,
Shu-Osher problem, shock-vortex interaction, and lid-driven cavity flow. The
advantages of this high order gas-kinetic scheme are exhibited in some
benchmarks including incompressible flow and supersonic compressible flow,
inviscid flow and viscous flow.
| physics.comp-ph | in our study a compact third order gaskinetic scheme is constructed for unstructured grid which is combined the compact leastsquare reconstruction cls method the cls method can achieve arbitrary high order compact reconstruction using the stencil from the whole computational domain implicitly a large sparse linear system resulted from the cls reconstruction method is solved by applying the generalized minimal residual algorithm gmres and the reversecuthillmckee rcm algorithm and the incomplete lowerupper ilu factorization method are implemented to accelerate the convergence of the iterative method different from the traditional flux solver the bgk based gaskinetic scheme is in the nature of spatial and temporal accuracy applying the second order expansion to the distribution function the third order flux solver can be obtained directly the accuracy of present method is validated by several numerical cases such as the advection of density perturbation problem sod shock wave problem lax shock tube test case shuosher problem shockvortex interaction and liddriven cavity flow the advantages of this high order gaskinetic scheme are exhibited in some benchmarks including incompressible flow and supersonic compressible flow inviscid flow and viscous flow | [['in', 'our', 'study', 'a', 'compact', 'third', 'order', 'gaskinetic', 'scheme', 'is', 'constructed', 'for', 'unstructured', 'grid', 'which', 'is', 'combined', 'the', 'compact', 'leastsquare', 'reconstruction', 'cls', 'method', 'the', 'cls', 'method', 'can', 'achieve', 'arbitrary', 'high', 'order', 'compact', 'reconstruction', 'using', 'the', 'stencil', 'from', 'the', 'whole', 'computational', 'domain', 'implicitly', 'a', 'large', 'sparse', 'linear', 'system', 'resulted', 'from', 'the', 'cls', 'reconstruction', 'method', 'is', 'solved', 'by', 'applying', 'the', 'generalized', 'minimal', 'residual', 'algorithm', 'gmres', 'and', 'the', 'reversecuthillmckee', 'rcm', 'algorithm', 'and', 'the', 'incomplete', 'lowerupper', 'ilu', 'factorization', 'method', 'are', 'implemented', 'to', 'accelerate', 'the', 'convergence', 'of', 'the', 'iterative', 'method', 'different', 'from', 'the', 'traditional', 'flux', 'solver', 'the', 'bgk', 'based', 'gaskinetic', 'scheme', 'is', 'in', 'the', 'nature', 'of', 'spatial', 'and', 'temporal', 'accuracy', 'applying', 'the', 'second', 'order', 'expansion', 'to', 'the', 'distribution', 'function', 'the', 'third', 'order', 'flux', 'solver', 'can', 'be', 'obtained', 'directly', 'the', 'accuracy', 'of', 'present', 'method', 'is', 'validated', 'by', 'several', 'numerical', 'cases', 'such', 'as', 'the', 'advection', 'of', 'density', 'perturbation', 'problem', 'sod', 'shock', 'wave', 'problem', 'lax', 'shock', 'tube', 'test', 'case', 'shuosher', 'problem', 'shockvortex', 'interaction', 'and', 'liddriven', 'cavity', 'flow', 'the', 'advantages', 'of', 'this', 'high', 'order', 'gaskinetic', 'scheme', 'are', 'exhibited', 'in', 'some', 'benchmarks', 'including', 'incompressible', 'flow', 'and', 'supersonic', 'compressible', 'flow', 'inviscid', 'flow', 'and', 'viscous', 'flow']] | [-0.09795669574740824, 0.006589419684362608, -0.0886717690254055, 0.04030554155706541, -0.06656010758520646, -0.11666782208779765, -0.04466303408076823, 0.3673392820279472, -0.297845683518572, -0.30965737499051044, 0.15145535333719165, -0.21723224832881038, -0.08233580804061513, 0.19030052830451066, -0.020179893849622252, 0.15747791199828498, 0.11004048000105175, -0.03997979371854524, -0.09054991201920419, -0.2415707599669746, 0.277199028704602, 0.04233713255450641, 0.3168310041329568, 0.026962944564849628, 0.16024137695401824, -0.08267995540006598, -0.0548441782491384, 0.0511613746787159, -0.049825162770083316, 0.1191143757340007, 0.2006787695390413, 0.08106510323065506, 0.2760869527483809, -0.43055791995273185, -0.26083510655623215, 0.03294828014095201, 0.1625775602053861, 0.11937452197410064, -0.04130202211864334, -0.27580422261131127, 0.10082371682849722, -0.20104382500553933, -0.12053315024976465, -0.10860254761064425, -0.08777029834851459, 0.044087456534795746, -0.324015115428675, 0.1484534581801639, 0.04484077761266995, 0.0279799396323122, -0.04184812131647409, -0.0872324677440082, 0.0015886544139932963, 0.06503301537544517, 0.027994063657908037, 0.0695157340269761, 0.08129668921413882, -0.09315670978733348, -0.06960699899674772, 0.42306300773090877, -0.0693764460962624, -0.26322604026031365, 0.16912725294177716, -0.07994842855771492, -0.06567912112414878, 0.2270825380398022, 0.22253599702022397, 0.1636328384607063, -0.11456159207371676, 0.06352481746580452, -0.045913399634598166, 0.1577111983948111, 0.06699123423275344, -0.09795315381539935, 0.08240546042017721, 0.19923223983522012, 0.07776230793883819, 0.13845106856743958, -0.1129056096927213, -0.09428490023128688, -0.2777776102750347, -0.10890978242137603, -0.20101533874173413, -0.05045706440752518, -0.1494617291771267, -0.15864559793256347, 0.3705782850951497, 0.15057843014505784, 0.09751668086871607, 0.036093894950661724, 0.38271013479475136, 0.15830636274576146, 0.014966299900641808, 0.1506208038535788, 0.19531479734331908, 0.15223854158334638, 0.12480488095105022, -0.2845342599709741, 0.004712272138631606, 0.22897918831562153] |
1,802.00705 | Tuning the magnetodynamic properties of all-perpendicular spin valves
using He+ irradiation | Using He+ ion irradiation, we demonstrate how the magnetodynamic properties
of both ferromagnetic layers in all-perpendicular [Co/Pd]/Cu/[Co/Ni] spin
valves can be tuned by varying the He+ ion fluence. As the perpendicular
magnetic anisotropy of both layers is gradually reduced by the irradiation,
different magnetic configurations can be achieved from all-perpendicular,
through orthogonal, to all in-plane. In addition, both the magnetic damping and
the inhomogeneous broadening of the Co/Ni layer improve substantially with
increasing fluence. GMR of the spin valve is negatively affected and decreases
linearly from an original value of 1.14% to 0.4% at the maximum fluence of
50*10^14 He+/cm^2.
| cond-mat.mtrl-sci | using he ion irradiation we demonstrate how the magnetodynamic properties of both ferromagnetic layers in allperpendicular copdcuconi spin valves can be tuned by varying the he ion fluence as the perpendicular magnetic anisotropy of both layers is gradually reduced by the irradiation different magnetic configurations can be achieved from allperpendicular through orthogonal to all inplane in addition both the magnetic damping and the inhomogeneous broadening of the coni layer improve substantially with increasing fluence gmr of the spin valve is negatively affected and decreases linearly from an original value of 114 to 04 at the maximum fluence of 501014 hecm2 | [['using', 'he', 'ion', 'irradiation', 'we', 'demonstrate', 'how', 'the', 'magnetodynamic', 'properties', 'of', 'both', 'ferromagnetic', 'layers', 'in', 'allperpendicular', 'copdcuconi', 'spin', 'valves', 'can', 'be', 'tuned', 'by', 'varying', 'the', 'he', 'ion', 'fluence', 'as', 'the', 'perpendicular', 'magnetic', 'anisotropy', 'of', 'both', 'layers', 'is', 'gradually', 'reduced', 'by', 'the', 'irradiation', 'different', 'magnetic', 'configurations', 'can', 'be', 'achieved', 'from', 'allperpendicular', 'through', 'orthogonal', 'to', 'all', 'inplane', 'in', 'addition', 'both', 'the', 'magnetic', 'damping', 'and', 'the', 'inhomogeneous', 'broadening', 'of', 'the', 'coni', 'layer', 'improve', 'substantially', 'with', 'increasing', 'fluence', 'gmr', 'of', 'the', 'spin', 'valve', 'is', 'negatively', 'affected', 'and', 'decreases', 'linearly', 'from', 'an', 'original', 'value', 'of', '114', 'to', '04', 'at', 'the', 'maximum', 'fluence', 'of', '501014', 'hecm2']] | [-0.08606667461215842, 0.27195064748809034, 0.03785635967862469, -0.033323023541906506, -0.010481004024638554, -0.12949591532007468, -0.005110933849283931, 0.4400335099091943, -0.287126331818195, -0.38179779722716434, 0.016125166499440804, -0.3024943965743771, -0.004160777884250393, 0.21088782032210457, 0.023399366436488166, -0.0010471272410596817, -0.006240829198184062, -0.032256970557441214, -0.09138909178995053, -0.21357539358871933, 0.2665048410963951, 0.09087351976527966, 0.339473490565255, 0.10176129091046371, 0.04435362703432994, 0.012175415485755217, 0.12129045714985351, 0.0591867831393088, -0.08451979495204832, 0.00843270721237118, 0.18013888885675722, -0.04682054127357444, 0.19005318521908057, -0.4704541521032854, -0.19824528251299445, -0.021544381710926395, 0.16507673072890017, 0.11428509784710346, -0.0034183783133571247, -0.24582227852613647, 0.05998330388921408, -0.1441609266627466, -0.10991417936866685, -0.008908905226699248, -0.03045162752422751, 0.07462260453030467, -0.28355532842783293, 0.06776118037119812, 0.09122611257266633, 0.08071808205746418, -0.09851191259388413, -0.15004706151821479, -0.14648916395095996, 0.05469788060694629, 0.08503805058865752, 0.09982914986963175, 0.2302375337612644, -0.11541775212390348, -0.0689245499100308, 0.27793558003685, -0.09279837408008015, -0.1237496770063073, 0.11285966459295846, -0.1790376226797852, -0.01675927872788541, 0.1954030457418412, 0.15099782527101283, 0.12002694781166406, -0.12167685448515173, 0.020877852968215867, 0.04145078379090647, 0.19499238008523076, 0.11620732935677681, -0.004431129910755067, 0.22347101754489906, 0.1709165906465888, 0.0303898353737836, 0.18481495696902797, -0.16419380604959455, 0.03331891083329612, -0.14463857608866326, -0.11983479147929015, -0.16855635192620624, 0.08261799353307911, -0.12127412636307001, -0.11468947396556638, 0.42718776581542833, 0.18231886918941625, 0.18394555522090927, -0.0690895492039925, 0.24517189223813463, 0.13682652550763735, 0.06889071522876905, 0.03214910532328851, 0.2803403934539885, 0.2109317792132877, 0.1351780086442144, -0.3161975951266608, 0.1293950916543527, -0.05811113202754332] |
1,802.00706 | Extending Causal Consistency to any Object Defined by a Sequential
Specification | This paper presents a simple generalization of causal consistency suited to
any object defined by a sequential specification. As causality is captured by a
partial order on the set of operations issued by the processes on shared
objects (concurrent operations are not ordered), it follows that causal
consistency allows different processes to have different views of each object
history.
| cs.DC | this paper presents a simple generalization of causal consistency suited to any object defined by a sequential specification as causality is captured by a partial order on the set of operations issued by the processes on shared objects concurrent operations are not ordered it follows that causal consistency allows different processes to have different views of each object history | [['this', 'paper', 'presents', 'a', 'simple', 'generalization', 'of', 'causal', 'consistency', 'suited', 'to', 'any', 'object', 'defined', 'by', 'a', 'sequential', 'specification', 'as', 'causality', 'is', 'captured', 'by', 'a', 'partial', 'order', 'on', 'the', 'set', 'of', 'operations', 'issued', 'by', 'the', 'processes', 'on', 'shared', 'objects', 'concurrent', 'operations', 'are', 'not', 'ordered', 'it', 'follows', 'that', 'causal', 'consistency', 'allows', 'different', 'processes', 'to', 'have', 'different', 'views', 'of', 'each', 'object', 'history']] | [-0.1452191431643599, 0.08637135252909009, -0.10054122811278045, 0.10122880194793944, -0.14195854864004304, -0.12471820695830857, 0.08311169001202778, 0.37259630955187445, -0.2781484954501108, -0.31572549453920734, 0.10131300890313114, -0.2039912989941698, -0.11481241300954657, 0.15561717957005664, -0.1439963640582006, 0.0712154758225937, 0.07992767643625454, 0.04472616958131982, -0.04655824450507634, -0.255451294593513, 0.36899429327666255, 0.0472290377306231, 0.2591346919189318, -0.06328644591651983, 0.15896888580804658, 0.08866173132338513, -0.07783255334233202, 0.09212654865331064, -0.06108451099196642, 0.10510689793628152, 0.28275839351433313, 0.25131601639786516, 0.26576883854123495, -0.44815800702041486, -0.2097984580086323, 0.03510316896994235, 0.07305189963209174, 0.05454304384193936, 0.024739293859071903, -0.3200143633757607, 0.10317656344150082, -0.17250600682918804, -0.01914955023676157, -0.10286857730756371, 0.013180267223614758, -0.01917056161594593, -0.2684166116434765, 0.034374176863959785, 0.12961186361262353, 0.060335314608922906, 0.0011680303802476975, -0.015727139172791425, -0.010062731025045958, 0.16884800019058382, -0.00383846218533956, 0.014882232654460911, 0.14086800193319382, -0.07734676865245199, -0.21812965894528366, 0.3908885791897774, 0.004411905631028368, -0.21410805802058303, 0.26164725713305553, -0.07773503931476024, -0.16826881606415925, 0.0808597925608441, 0.1313096408306037, 0.149537761695683, -0.2423663994265815, 0.07946846274248624, -0.07440398204913837, 0.1545464048572516, 0.07718183582459213, 0.04209506083121997, 0.2394411710674985, 0.15934143884707305, 0.052538965501175344, 0.14562268154222077, -0.013035064050138502, -0.10575064653688568, -0.3314069486775641, -0.12676312695494144, -0.15644471820441896, -0.006597426944654987, -0.08445068620691881, -0.17622165410321647, 0.3631415918106371, 0.16781589107872066, 0.20773123062641943, 0.06977610198496761, 0.31553392696304844, 0.07389592442891395, 0.10227317783302801, 0.04878140034122487, 0.11277682902449268, 0.09517074219677281, 0.09143114498800646, -0.12218262027294012, 0.21003073622014815, 0.07183961851238194] |
1,802.00707 | Comparing transverse momentum balance of b jet pairs in pp and PbPb
collisions at $\sqrt{s_\mathrm{NN}} =$ 5.02 TeV | The transverse momentum balance of pairs of back-to-back b quark jets in PbPb
and pp collisions recorded with the CMS detector at the LHC is reported. The
center-of-mass energy in both collision systems is 5.02 TeV per nucleon pair.
Compared to the pp collision baseline, b quark jets have a larger imbalance in
the most central PbPb collisions, as expected from the jet quenching effect.
The data are also compared to the corresponding measurement with inclusive
dijets. In the most central collisions, the imbalance of b quark dijets is
comparable to that of inclusive dijets.
| hep-ex nucl-ex | the transverse momentum balance of pairs of backtoback b quark jets in pbpb and pp collisions recorded with the cms detector at the lhc is reported the centerofmass energy in both collision systems is 502 tev per nucleon pair compared to the pp collision baseline b quark jets have a larger imbalance in the most central pbpb collisions as expected from the jet quenching effect the data are also compared to the corresponding measurement with inclusive dijets in the most central collisions the imbalance of b quark dijets is comparable to that of inclusive dijets | [['the', 'transverse', 'momentum', 'balance', 'of', 'pairs', 'of', 'backtoback', 'b', 'quark', 'jets', 'in', 'pbpb', 'and', 'pp', 'collisions', 'recorded', 'with', 'the', 'cms', 'detector', 'at', 'the', 'lhc', 'is', 'reported', 'the', 'centerofmass', 'energy', 'in', 'both', 'collision', 'systems', 'is', '502', 'tev', 'per', 'nucleon', 'pair', 'compared', 'to', 'the', 'pp', 'collision', 'baseline', 'b', 'quark', 'jets', 'have', 'a', 'larger', 'imbalance', 'in', 'the', 'most', 'central', 'pbpb', 'collisions', 'as', 'expected', 'from', 'the', 'jet', 'quenching', 'effect', 'the', 'data', 'are', 'also', 'compared', 'to', 'the', 'corresponding', 'measurement', 'with', 'inclusive', 'dijets', 'in', 'the', 'most', 'central', 'collisions', 'the', 'imbalance', 'of', 'b', 'quark', 'dijets', 'is', 'comparable', 'to', 'that', 'of', 'inclusive', 'dijets']] | [-0.07065691975386519, 0.2352522017471002, -0.1558410418759051, 0.1767323255820788, 0.024385991861651603, -0.09920147793171437, -0.10777723883327685, 0.3332722854212319, -0.1626253145820412, -0.2915780070777002, -0.12806166546223194, -0.4320872590730065, 0.21667889915406705, 0.10290345472381696, 0.06501610769253029, 0.14273797063107946, 0.21946059371785898, 0.003748028063656468, -0.02317914902722757, -0.20298510530081235, 0.2914747892045661, 0.14050595917199787, 0.22106319534543314, 0.15737044779877912, 0.052687853286778066, 0.08680439174518381, -0.059379593518219496, -0.024089159350842236, -0.043897155263402966, 0.021035578558650358, 0.2917716000014671, -0.015160926259858043, 0.13056537626697193, -0.3154218874185493, -0.00938069894174604, 0.1497172951293913, 0.1590590954268057, 0.05521939049572929, -0.07929680148433697, -0.2659367880734958, 0.16220959035777732, -0.3388205883142195, -0.056534327708772925, 0.04002968879220517, 0.05002613640635421, 0.04261559035236898, -0.3238963091059735, 0.18051249190497115, -0.04661014351601663, 0.08763208914744226, 0.014542748980028065, -0.22954323577057373, -0.17264018294548517, -0.044218898402821075, 0.12136231945386451, 0.18956301726498886, 0.22603563248719039, -0.20667812406992245, -0.2725275242603139, 0.40087514662821044, 0.071715726223039, -0.13868045815707822, 0.25868337142624354, -0.2817662813406634, -0.08319262193613931, 0.1603047451004386, 0.3389163445289198, 0.04914690176221101, -0.24769864165175118, -0.0032469074296961097, -0.03859535503740373, 0.1494469259718531, 0.12058258317410946, 0.09318881323806157, 0.14077471564033706, 0.23841571246126764, -0.011691219783633163, 0.09138681853288098, -0.2038703111049376, -0.07340423990237085, -0.45969779314963444, -0.04839645804543244, -0.1022919206732982, 0.026753827311882847, -0.08014104858907797, 0.04684179197800787, 0.3417162154850207, 0.08311678798667058, 0.38185988945004185, -0.06844191143632328, 0.3195858781667132, 0.09434280818891956, 0.10302691498317902, 0.15899822202658181, 0.35066250494044077, 0.14523988051438017, 0.2900982775774441, -0.26582955341099906, 0.03543419834520472, 0.06278293497958466] |
1,802.00708 | Numerical methods for conservation laws with rough flux | Finite volume methods are proposed for computing approximate pathwise
entropy/kinetic solutions to conservation laws with a rough path dependent flux
function. For a convex flux, it is demonstrated that rough path oscillations
may lead to "cancellations" in the solution. Making use of this property, we
show that for $\alpha$-H{\"o}lder continuous rough paths the convergence rate
of the numerical methods can improve from $\mathcal{O}(\text{COST}^{-\gamma})$,
for some $\gamma \in \left[\alpha/(12-8\alpha), \alpha/(10-6\alpha)\right]$,
with $\alpha\in (0, 1)$, to $\mathcal{O}(\text{COST}^{-\min(1/4,\alpha/2)})$.
Numerical examples support the theoretical results.
| math.NA | finite volume methods are proposed for computing approximate pathwise entropykinetic solutions to conservation laws with a rough path dependent flux function for a convex flux it is demonstrated that rough path oscillations may lead to cancellations in the solution making use of this property we show that for alphaholder continuous rough paths the convergence rate of the numerical methods can improve from mathcalotextcostgamma for some gamma in leftalpha128alpha alpha106alpharight with alphain 0 1 to mathcalotextcostmin14alpha2 numerical examples support the theoretical results | [['finite', 'volume', 'methods', 'are', 'proposed', 'for', 'computing', 'approximate', 'pathwise', 'entropykinetic', 'solutions', 'to', 'conservation', 'laws', 'with', 'a', 'rough', 'path', 'dependent', 'flux', 'function', 'for', 'a', 'convex', 'flux', 'it', 'is', 'demonstrated', 'that', 'rough', 'path', 'oscillations', 'may', 'lead', 'to', 'cancellations', 'in', 'the', 'solution', 'making', 'use', 'of', 'this', 'property', 'we', 'show', 'that', 'for', 'alphaholder', 'continuous', 'rough', 'paths', 'the', 'convergence', 'rate', 'of', 'the', 'numerical', 'methods', 'can', 'improve', 'from', 'mathcalotextcostgamma', 'for', 'some', 'gamma', 'in', 'leftalpha128alpha', 'alpha106alpharight', 'with', 'alphain', '0', '1', 'to', 'mathcalotextcostmin14alpha2', 'numerical', 'examples', 'support', 'the', 'theoretical', 'results']] | [-0.10421210850932096, 0.08454801080331795, -0.1152989846641982, 0.08198398395784591, -0.10477323714937818, -0.09787764036292701, 0.07292002211569955, 0.41674749131657574, -0.30841018774203566, -0.24210215487370365, 0.10588916628560248, -0.30629837772759955, -0.13283440435158186, 0.263599487499481, -0.11549473463214542, 0.13415427982660108, 0.09731404358325035, -0.013805137885930506, -0.09871433645266255, -0.22950950358062983, 0.27304492569017286, -0.019128978411716065, 0.24344783979713133, 0.09291215546086039, 0.12386816711851249, -0.05617414675898066, -0.029480993429100828, 0.05451040214393288, -0.19979659018166498, 0.09617764091021136, 0.2451666152889007, 0.09409370427755148, 0.27554701448810337, -0.425088782966333, -0.24502845618285632, 0.10792857825167869, 0.14268994645221697, 0.05659307255164573, -0.0771496057461359, -0.23401527588353738, 0.12920281102292633, -0.11404085052689832, -0.17578790443459233, -0.11679135456583217, 0.041396816818680814, 0.10446484623427846, -0.3574583296860127, 0.08792021745619805, 0.0425024427118172, -0.0020572495720300233, -0.07580866541492899, -0.08153604008379932, -0.013402143444277738, 0.08626137877811409, 0.0945103675660089, 0.037719485019088575, 0.05712403849036874, -0.09704723998009668, -0.1531680147852871, 0.3097879153823382, -0.054593210476205536, -0.29233337726787123, 0.18310476482331164, -0.12789117043690854, -0.12495028998359646, 0.2011918138075424, 0.11475360196077657, 0.13072577833296045, -0.1324422482621709, 0.09637039511366502, -0.0010722215275133127, 0.12056741183378587, 0.03808030491621282, -0.015075594719842468, 0.11381454422007664, 0.14735821254649445, 0.17232650536798724, 0.08796366990013905, -0.03929847480092002, -0.11450376910598654, -0.36603410349619625, -0.1555183746018692, -0.17942031892629243, 0.07135824327920809, -0.14035057068165196, -0.20848200402810776, 0.29928127815946937, 0.1716583232827313, 0.1589571284497843, 0.14683562495414854, 0.256450054566621, 0.17455878743509712, 0.012008835579954871, 0.09414569668986492, 0.22558271159045704, 0.12935746031029052, 0.0906966402391462, -0.18916855454996326, 0.04947660817446089, 0.09808200313464592] |
1,802.00709 | Asymptotic behavior for an additive functional of two independent
self-similar Gaussian processes | We derive the asymptotic behavior for an additive functional of two
independent self-similar Gaussian processes when their intersection local time
exists, using the method of moments.
| math.PR | we derive the asymptotic behavior for an additive functional of two independent selfsimilar gaussian processes when their intersection local time exists using the method of moments | [['we', 'derive', 'the', 'asymptotic', 'behavior', 'for', 'an', 'additive', 'functional', 'of', 'two', 'independent', 'selfsimilar', 'gaussian', 'processes', 'when', 'their', 'intersection', 'local', 'time', 'exists', 'using', 'the', 'method', 'of', 'moments']] | [-0.1419765603943513, 0.09170880256939339, -0.17884174970766673, 0.0914118610895597, -0.005901981897365589, -0.0699654956921362, 0.07464117503080231, 0.36084143731456536, -0.30943625720325285, -0.19356468226760626, 0.07585857556058237, -0.24692528766508287, -0.14951974466944543, 0.16562463895668492, 0.028973534488334104, 0.09649592716819964, -0.04841279936954379, 0.06043452626237503, -0.04764663245385656, -0.2497518895767056, 0.3509411308914423, -0.0136014439093952, 0.28874359795680415, -0.038188110589264676, 0.14786625026653594, 0.038213729607657745, -0.06261918167225443, 0.012522337958216667, -0.17821631915509129, 0.09832398333730033, 0.21252246748190373, 0.10651472858528276, 0.2971583389892028, -0.4690248089341017, -0.16382391937077045, 0.14853515117787397, 0.1379398634800544, 0.05855161270413261, -0.019358075698479436, -0.23797167035249564, 0.11201612078226529, -0.11637317217313327, -0.19579472908606896, -0.10261423434489049, 0.03679551198505438, 0.1075626699737488, -0.341927230071563, 0.12290830240369989, 0.12691177148371935, 0.08857710304884957, -0.06004548792798932, -0.13561905902595475, 0.026262039855982248, 0.16413876236653707, 0.07062110226028241, -0.07522992440947117, 0.10860737309289667, -0.07087897360011433, -0.12626777274104264, 0.2764501345272248, -0.13522357196332171, -0.23460002394858748, 0.16604710624624902, -0.13563265758924758, -0.1399251728032071, 0.11878467770293355, 0.1520349605438801, 0.1421329657582996, -0.20556119201948883, 0.1587346818190641, -0.027425242587924004, 0.10433159560824816, 0.05690232886431309, 0.03248465512520992, 0.13091259254500842, 0.10535270186105314, 0.09973488328978419, 0.16893376811192587, -0.07836696555694708, -0.13726580587144083, -0.3377603915734933, -0.12617445944880062, -0.20189873619864768, 0.06466647964687301, -0.22790898620867386, -0.27269888611940235, 0.3557710955456759, 0.07937881165148261, 0.18638646187117466, 0.1407967905800503, 0.2644187324957994, 0.2212142484405866, -0.09994827224335705, 0.10658549615002882, 0.12633120454847813, 0.15283346670464829, -0.012885550977304004, -0.19513045561213332, 0.11748925463941234, 0.09329106393628396] |
1,802.0071 | Black phosphorus Q-switched and mode-locked Er:ZBLAN fiber lasers at 3.5
um | With the proposal of dual-wavelength pumping (DWP) scheme, DWP Er:ZBLAN fiber
lasers at 3.5 um have become a fascinating area of research. However, limited
by the absence of suitable saturable absorber, passively Q-switched and
mode-locked fiber lasers have not been realized in this spectral region. Based
on the layer-dependent bandgap and excellent photoelectric characteristics of
black phosphorus (BP), BP is a promising candidate for saturable absorber near
3.5 um. Here, we fabricated a 3.5-um saturable absorber mirror (SAM) by
transferring liquid-phase exfoliated BP flakes onto a gold-coated mirror. With
the as-prepared BP SAM, we realized stable Q-switching and continuous-wave
mode-locking operations in the DWP Er:ZBLAN fiber lasers at 3.5 um. To the best
of our knowledge, it is the first time to achieve passively Q-switched and
mode-locked pulses in 3.5 um spectral region. The research results will not
only promote the development of 3.5-um pulsed fiber lasers but also open the
photonic application of two-dimensional materials in this spectral region
| physics.optics | with the proposal of dualwavelength pumping dwp scheme dwp erzblan fiber lasers at 35 um have become a fascinating area of research however limited by the absence of suitable saturable absorber passively qswitched and modelocked fiber lasers have not been realized in this spectral region based on the layerdependent bandgap and excellent photoelectric characteristics of black phosphorus bp bp is a promising candidate for saturable absorber near 35 um here we fabricated a 35um saturable absorber mirror sam by transferring liquidphase exfoliated bp flakes onto a goldcoated mirror with the asprepared bp sam we realized stable qswitching and continuouswave modelocking operations in the dwp erzblan fiber lasers at 35 um to the best of our knowledge it is the first time to achieve passively qswitched and modelocked pulses in 35 um spectral region the research results will not only promote the development of 35um pulsed fiber lasers but also open the photonic application of twodimensional materials in this spectral region | [['with', 'the', 'proposal', 'of', 'dualwavelength', 'pumping', 'dwp', 'scheme', 'dwp', 'erzblan', 'fiber', 'lasers', 'at', '35', 'um', 'have', 'become', 'a', 'fascinating', 'area', 'of', 'research', 'however', 'limited', 'by', 'the', 'absence', 'of', 'suitable', 'saturable', 'absorber', 'passively', 'qswitched', 'and', 'modelocked', 'fiber', 'lasers', 'have', 'not', 'been', 'realized', 'in', 'this', 'spectral', 'region', 'based', 'on', 'the', 'layerdependent', 'bandgap', 'and', 'excellent', 'photoelectric', 'characteristics', 'of', 'black', 'phosphorus', 'bp', 'bp', 'is', 'a', 'promising', 'candidate', 'for', 'saturable', 'absorber', 'near', '35', 'um', 'here', 'we', 'fabricated', 'a', '35um', 'saturable', 'absorber', 'mirror', 'sam', 'by', 'transferring', 'liquidphase', 'exfoliated', 'bp', 'flakes', 'onto', 'a', 'goldcoated', 'mirror', 'with', 'the', 'asprepared', 'bp', 'sam', 'we', 'realized', 'stable', 'qswitching', 'and', 'continuouswave', 'modelocking', 'operations', 'in', 'the', 'dwp', 'erzblan', 'fiber', 'lasers', 'at', '35', 'um', 'to', 'the', 'best', 'of', 'our', 'knowledge', 'it', 'is', 'the', 'first', 'time', 'to', 'achieve', 'passively', 'qswitched', 'and', 'modelocked', 'pulses', 'in', '35', 'um', 'spectral', 'region', 'the', 'research', 'results', 'will', 'not', 'only', 'promote', 'the', 'development', 'of', '35um', 'pulsed', 'fiber', 'lasers', 'but', 'also', 'open', 'the', 'photonic', 'application', 'of', 'twodimensional', 'materials', 'in', 'this', 'spectral', 'region']] | [-0.07923211101879132, 0.10545021972211543, -0.054181636581779456, -0.09358321211657313, -0.026681994897080584, -0.2491060799336992, 0.05232096188410651, 0.5638174304855056, -0.19776096155983397, -0.25729673341993475, 0.09028717798028082, -0.24713036973844282, -0.1044073527737055, 0.28201126485364514, -0.07814769760207127, 0.0740794952504075, -0.014534189167898148, -0.16754866364935878, 0.03251640022499487, -0.17740617308299989, 0.2004779988710652, 0.07534952328132931, 0.364877574230195, -0.023987609468167647, 0.14375856059486977, -0.03288465463265311, 0.09860333591932431, -0.11634587617882061, -0.1557124002603814, 0.10439387275691843, 0.2529940917389467, -0.07331041606812505, 0.27762513485504314, -0.38281230310676617, -0.26385804037563504, 0.01234198491438292, 0.15342205154302063, 0.13265249167579896, -0.14136688970393152, -0.273782290291274, 0.13925219067023137, -0.1226309623598354, -0.14251363476505502, 0.021569169883150607, -0.02978683768888004, 0.038068584398570235, -0.1712531189346919, -0.064377828951001, 0.053017571970121934, 0.0453095039119944, -0.05452883103425847, -0.034710883073103105, -0.0992030664885533, -0.021360212459694595, -0.08759242146334145, 0.02205760036886204, 0.24448191670817324, -0.11882951522420626, -0.07428141766577027, 0.349706765380688, -0.11779870666359785, -0.016284699969401118, 0.14190842704992973, -0.14360445358324797, -0.023448418971383944, 0.23213116400584113, 0.11293076054680569, 0.14391297060064973, -0.09308786019682884, 0.026193391712149607, -0.0061865752300946045, 0.2861316809336131, 0.17675607017008588, 0.1686455326504074, 0.24491224581870483, 0.25521883473265916, 0.01054594463785179, 0.1105566079277196, -0.12044780386349885, 0.015208509570220486, -0.19646985359941027, -0.16961471571630682, -0.1807314506266266, 0.11515370085598989, -0.0570480215097632, -0.12536111355293542, 0.4192455293604098, 0.058194921945687386, 0.11504579784232191, -0.05551240877684904, 0.3139084373600781, 0.09191747983932146, 0.11869737113884185, -0.00457669234892819, 0.35353099652566017, 0.17140588662878145, 0.15469457628496458, -0.19214063588005956, -0.06028353861765936, -0.034844870718370655] |
1,802.00711 | Gromov--Witten invariants of the Riemann sphere | A conjectural formula for the $k$-point generating function of Gromov--Witten
invariants of the Riemann sphere for all genera and all degrees was proposed in
\cite{DY2}. In this paper, we give a proof of this formula together with an
explicit analytic (as opposed to formal) expression for the corresponding
matrix resolvent. We also give a formula for the $k$-point function as a sum of
$(k-1)!$ products of hypergeometric functions of one variable. We show that the
$k$-point generating function coincides with the $\epsilon\rightarrow 0$
asymptotics of the analytic $k$-point function, and also compute three more
asymptotics of the analytic function for $\epsilon\rightarrow \infty$,
$q\rightarrow 0$, $q\rightarrow\infty$, thus defining new invariants for the
Riemann sphere.
| math.AG math-ph math.MP | a conjectural formula for the kpoint generating function of gromovwitten invariants of the riemann sphere for all genera and all degrees was proposed in citedy2 in this paper we give a proof of this formula together with an explicit analytic as opposed to formal expression for the corresponding matrix resolvent we also give a formula for the kpoint function as a sum of k1 products of hypergeometric functions of one variable we show that the kpoint generating function coincides with the epsilonrightarrow 0 asymptotics of the analytic kpoint function and also compute three more asymptotics of the analytic function for epsilonrightarrow infty qrightarrow 0 qrightarrowinfty thus defining new invariants for the riemann sphere | [['a', 'conjectural', 'formula', 'for', 'the', 'kpoint', 'generating', 'function', 'of', 'gromovwitten', 'invariants', 'of', 'the', 'riemann', 'sphere', 'for', 'all', 'genera', 'and', 'all', 'degrees', 'was', 'proposed', 'in', 'citedy2', 'in', 'this', 'paper', 'we', 'give', 'a', 'proof', 'of', 'this', 'formula', 'together', 'with', 'an', 'explicit', 'analytic', 'as', 'opposed', 'to', 'formal', 'expression', 'for', 'the', 'corresponding', 'matrix', 'resolvent', 'we', 'also', 'give', 'a', 'formula', 'for', 'the', 'kpoint', 'function', 'as', 'a', 'sum', 'of', 'k1', 'products', 'of', 'hypergeometric', 'functions', 'of', 'one', 'variable', 'we', 'show', 'that', 'the', 'kpoint', 'generating', 'function', 'coincides', 'with', 'the', 'epsilonrightarrow', '0', 'asymptotics', 'of', 'the', 'analytic', 'kpoint', 'function', 'and', 'also', 'compute', 'three', 'more', 'asymptotics', 'of', 'the', 'analytic', 'function', 'for', 'epsilonrightarrow', 'infty', 'qrightarrow', '0', 'qrightarrowinfty', 'thus', 'defining', 'new', 'invariants', 'for', 'the', 'riemann', 'sphere']] | [-0.16051790849451208, 0.0288523877805866, -0.12159946681432691, 0.11780252860834091, -0.061087376974423284, -0.09809388666014586, 0.046146626460540574, 0.27984490322082173, -0.2316694933418018, -0.19937309202006354, 0.05781860673908211, -0.2727791963718898, -0.19708597723261587, 0.22165700910928926, -0.01844208033954991, 0.07669703543485541, -0.0110040596399423, 0.04164814108350713, -0.15292605536316323, -0.21439621234977885, 0.34852942508379264, -0.03255446380821273, 0.18303841739959484, 0.11793116974045656, 0.11266968709865718, 0.047998027314731316, 0.01050672258134, -0.09833182952050785, -0.19305876411746276, 0.10525658520678657, 0.2838753098455657, 0.10987645302001121, 0.20070341349180257, -0.3782294198775032, -0.11087737254898197, 0.11608880220904082, 0.16220613013553833, 0.03460346039251557, 0.014947766013392538, -0.18827318057550915, 0.10820404149957799, -0.18263300682675826, -0.2527912636869587, -0.10822052695065006, 0.07416623806264917, 0.06139188497607912, -0.3011338892725429, 0.05535468642847263, 0.05678597314233359, 0.07172022636015234, -0.07592161114735063, -0.18833552503409529, -0.017312039875832852, 0.132020184092523, 0.07176818945611428, 0.09009072446497157, 0.01868690951544392, -0.12587639464514463, -0.06400642500791166, 0.30340312807987047, -0.0887563861657067, -0.2785611249190489, 0.08345849759643897, -0.17382738964598893, -0.15144567349177254, 0.10335739325403535, 0.07997399743180722, 0.21444713424924494, -0.07948383982459616, 0.1579928729988751, -0.09594973671690761, 0.06250260502565652, 0.1368745021671722, 0.028055180749756152, 0.13600383200017468, 0.01242041320230263, 0.0833694897508914, 0.20552342095678405, -0.0174606568429486, -0.05642181871267634, -0.4064701687145446, -0.25624099654045757, -0.2364202683647818, 0.13430017016902898, -0.1794274646503514, -0.2664551946467587, 0.4175951719683196, 0.062489252853473384, 0.22733156207167277, 0.2367583834981945, 0.2540686210185023, 0.20914614032413478, 0.02619661535469017, 0.0353553199300742, 0.09008326148822172, 0.1667271540521012, -0.0036189001943317373, -0.1357645250017023, -0.0037181773389290485, 0.2146214497084397] |
1,802.00712 | Magneto-transport properties of proposed triply degenerate topological
semimetal Pd$_{3}$Bi$_{2}$S$_{2}$ | We report transport properties of single-crystalline Pd$_{3}$Bi$_{2}$S$_{2}$,
which has been predicted to host an unconventional electronic phase of matter
beyond three-dimensional Dirac and Weyl semimetals. Similar to several
topological systems, the resistivity shows field induced
metal-semiconductor-like crossover at low temperature. Large, anisotropic and
non-saturating magnetoresistance (MR) has been observed in transverse
experimental configuration. At 2 K and 9 T, the MR value reaches as high as
$\sim$1.1$\times$10$^{3}$ \%. Hall resistivity reveals the presence of two
types of charge carriers and has been analyzed using two-band model. In spite
of the large density ($>$ 10$^{21}$ cm$^{-3}$), the mobility of charge carriers
is found to be quite high ($\sim$ 0.75$\times$10$^{4}$ cm$^{2}$ V$^{-1}$
s$^{-1}$ for hole and $\sim$ 0.3$\times$10$^{4}$ cm$^{2}$ V$^{-1}$ s$^{-1}$ for
electron). The observed magneto-electrical properties indicate that
Pd$_{3}$Bi$_{2}$S$_{2}$ may be a new member of the topological semimetal
family, which can have a significant impact in technological applications.
| cond-mat.mtrl-sci | we report transport properties of singlecrystalline pd_3bi_2s_2 which has been predicted to host an unconventional electronic phase of matter beyond threedimensional dirac and weyl semimetals similar to several topological systems the resistivity shows field induced metalsemiconductorlike crossover at low temperature large anisotropic and nonsaturating magnetoresistance mr has been observed in transverse experimental configuration at 2 k and 9 t the mr value reaches as high as sim11times103 hall resistivity reveals the presence of two types of charge carriers and has been analyzed using twoband model in spite of the large density 1021 cm3 the mobility of charge carriers is found to be quite high sim 075times104 cm2 v1 s1 for hole and sim 03times104 cm2 v1 s1 for electron the observed magnetoelectrical properties indicate that pd_3bi_2s_2 may be a new member of the topological semimetal family which can have a significant impact in technological applications | [['we', 'report', 'transport', 'properties', 'of', 'singlecrystalline', 'pd_3bi_2s_2', 'which', 'has', 'been', 'predicted', 'to', 'host', 'an', 'unconventional', 'electronic', 'phase', 'of', 'matter', 'beyond', 'threedimensional', 'dirac', 'and', 'weyl', 'semimetals', 'similar', 'to', 'several', 'topological', 'systems', 'the', 'resistivity', 'shows', 'field', 'induced', 'metalsemiconductorlike', 'crossover', 'at', 'low', 'temperature', 'large', 'anisotropic', 'and', 'nonsaturating', 'magnetoresistance', 'mr', 'has', 'been', 'observed', 'in', 'transverse', 'experimental', 'configuration', 'at', '2', 'k', 'and', '9', 't', 'the', 'mr', 'value', 'reaches', 'as', 'high', 'as', 'sim11times103', 'hall', 'resistivity', 'reveals', 'the', 'presence', 'of', 'two', 'types', 'of', 'charge', 'carriers', 'and', 'has', 'been', 'analyzed', 'using', 'twoband', 'model', 'in', 'spite', 'of', 'the', 'large', 'density', '1021', 'cm3', 'the', 'mobility', 'of', 'charge', 'carriers', 'is', 'found', 'to', 'be', 'quite', 'high', 'sim', '075times104', 'cm2', 'v1', 's1', 'for', 'hole', 'and', 'sim', '03times104', 'cm2', 'v1', 's1', 'for', 'electron', 'the', 'observed', 'magnetoelectrical', 'properties', 'indicate', 'that', 'pd_3bi_2s_2', 'may', 'be', 'a', 'new', 'member', 'of', 'the', 'topological', 'semimetal', 'family', 'which', 'can', 'have', 'a', 'significant', 'impact', 'in', 'technological', 'applications']] | [-0.16909776734690188, 0.18482950620498947, -0.02477129855265854, -0.011520853361068624, -0.031553051924887804, -0.1606911871365952, 0.014166195194917262, 0.3700927040334923, -0.18741076630176912, -0.3599094454172655, 0.012616008953587648, -0.35648910562567254, -0.09764354274416646, 0.2067479300824595, 0.003567703434840796, 0.027693495114750052, -0.07706989649788919, -0.01957987464224616, -0.11771818257518218, -0.201284216998429, 0.2260325518700935, 0.010612376892926, 0.32467331821825485, 0.13431719325911973, 0.08350481132643152, -0.0742899162995345, 0.1250624476126164, 0.08545265970949797, -0.12312074187765903, -0.005430699775246441, 0.26600177832945177, -0.08598552848186, 0.19532890859595003, -0.38622851745086784, -0.25647659587891813, 0.019554751271263084, 0.15542909034019245, 0.08579709669674172, -0.10607991463352814, -0.2748088402878361, 0.1257139995978181, -0.19545258332129753, -0.1299094626125186, -0.09385283541013585, 0.07044196029520652, -0.04692673023975064, -0.20695675891024848, 0.15378576785273163, -0.010788324675423669, 0.10762547763024873, -0.08002979458963617, -0.17269704620360482, -0.09110984246490907, 0.03970685651433383, 0.08600757175318381, 0.0619901742651796, 0.16068079399526225, -0.1387588389313628, -0.0953542939288185, 0.3574504983947441, -0.06914438478853421, -0.019140219514040237, 0.1918941072670492, -0.24455008979437623, -0.11294582217984589, 0.2105281364753948, 0.14333720606295985, 0.06963311360343129, -0.13292089266477958, 0.08126679832649959, -0.04890760938646866, 0.15563144104172152, 0.006136827329371838, 0.11215222464108192, 0.2877013166071781, 0.17727857037837094, 0.030478756083836052, 0.07639929120996901, -0.18563329255710362, 0.027959844320418037, -0.19022465061977611, -0.19015906381268874, -0.21458097900171494, 0.12839476601055538, -0.08257692060150547, -0.15028917891508403, 0.4000793629002275, 0.15650852215525873, 0.23779803264146368, -0.09185954048265274, 0.18854320936023872, 0.13872533999482525, 0.09488592141561568, 0.08659322882617712, 0.24819349424570059, 0.17444001299540465, 0.15128752671789827, -0.23639626183104537, 0.07523732407494112, -0.015232593027531362] |
1,802.00713 | EPPS16 - Bringing nuclear PDFs to the LHC era | We report on EPPS16, the first global analysis of nuclear parton distribution
functions (nPDFs) to include LHC data. Also for the first time, a full flavour
dependence of nPDFs is allowed. While the included Z and W data are found to
have insufficient statistics to yield stringent constraints, the CMS 5.02 TeV
proton-lead dijet data prove crucial in setting the shape of nuclear gluon
modifications. With these and other observables being measured in proton-lead
runs, we are experiencing a shift of nPDFs to the LHC precision era.
| hep-ph | we report on epps16 the first global analysis of nuclear parton distribution functions npdfs to include lhc data also for the first time a full flavour dependence of npdfs is allowed while the included z and w data are found to have insufficient statistics to yield stringent constraints the cms 502 tev protonlead dijet data prove crucial in setting the shape of nuclear gluon modifications with these and other observables being measured in protonlead runs we are experiencing a shift of npdfs to the lhc precision era | [['we', 'report', 'on', 'epps16', 'the', 'first', 'global', 'analysis', 'of', 'nuclear', 'parton', 'distribution', 'functions', 'npdfs', 'to', 'include', 'lhc', 'data', 'also', 'for', 'the', 'first', 'time', 'a', 'full', 'flavour', 'dependence', 'of', 'npdfs', 'is', 'allowed', 'while', 'the', 'included', 'z', 'and', 'w', 'data', 'are', 'found', 'to', 'have', 'insufficient', 'statistics', 'to', 'yield', 'stringent', 'constraints', 'the', 'cms', '502', 'tev', 'protonlead', 'dijet', 'data', 'prove', 'crucial', 'in', 'setting', 'the', 'shape', 'of', 'nuclear', 'gluon', 'modifications', 'with', 'these', 'and', 'other', 'observables', 'being', 'measured', 'in', 'protonlead', 'runs', 'we', 'are', 'experiencing', 'a', 'shift', 'of', 'npdfs', 'to', 'the', 'lhc', 'precision', 'era']] | [-0.0465149544821731, 0.16197609959234452, -0.17524426211014218, 0.1715064388218111, -0.05134651068084199, -0.08332500758784256, -0.031002017091317422, 0.38446180389701634, -0.17960126462510262, -0.3018820231469969, 0.052372847306381524, -0.32851976208688544, 0.10000079116602054, 0.1719946825512867, 0.06741482479733298, 0.18222943118013357, 0.14227521708890817, -0.027193437865667646, -0.07815634526697726, -0.29018466737677995, 0.31017345015559045, 0.11018963129227531, 0.22099342287100596, 0.13871615374696322, 0.04792853226837028, 0.04499269935741335, -0.13360988865833964, -0.0629773536608715, -0.16183288073188615, 0.0737940759408748, 0.29208802937091083, 0.12263404693850584, 0.1499889107399631, -0.40545064272979897, -0.09326200441446626, 0.14363088227016316, 0.11448182079983854, 0.0866493832871275, -0.059980294141308246, -0.29206478966924565, 0.09947956867493293, -0.2452571851297699, -0.11706516717094928, -0.08666160059343467, -0.0060054203334810406, 0.03186274050057855, -0.3112285779099965, 0.1402296681735188, -0.07070774023003619, 0.05236522729198138, -0.01448937681578528, -0.2235316276850029, -0.07786341642040288, 0.032704373125800455, 0.09787759766512519, 0.08678684035722894, 0.17538202306705303, -0.1838875878923412, -0.1757051691428983, 0.37766542166856854, 0.00487625223969848, -0.12774121477643305, 0.129597300808106, -0.2643168804439149, -0.24252714123041635, 0.09610764590766409, 0.2802835092505162, 0.015261264839049044, -0.19395205306809868, 0.12917154569087827, 0.01971966441956231, 0.19507598749699134, 0.03630485431687243, 0.10081198765500181, 0.11674859796265333, 0.19851734527606174, 0.02972669550752931, 0.042590349141224663, -0.11983569608479418, -0.07228106623194341, -0.4322298484929334, -0.013634156425023216, -0.10778250285670504, 0.012159619064220152, -0.05978248435863422, -0.042413038615105224, 0.36171740795025364, 0.1025139176361691, 0.29689765744307345, 0.018719151171844924, 0.29230718824198876, 0.0898463968080522, 0.08939812300812411, 0.06392957992188034, 0.2906038206567099, 0.13501469756679974, 0.18951710889697337, -0.1815309513681575, 0.07008298668453748, 0.02128962318991022] |
1,802.00714 | Incremental Control and Guidance of Hybrid Aircraft Applied to a
Tailsitter UAV | Hybrid unmanned aircraft can significantly increase the potential of micro
air vehicles, because they combine hovering capability with a wing for fast and
efficient forward flight. However, these vehicles are very difficult to
control, because their aerodynamics are hard to model and they are susceptible
to wind gusts. This often leads to composite and complex controllers, with
different modes for hover, transition and forward flight. In this paper, we
propose incremental nonlinear dynamic inversion control for the attitude and
position control. The result is a single, continuous controller, that is able
to track the desired acceleration of the vehicle across the flight envelope.
The proposed controller is implemented on the Cyclone hybrid UAV. Multiple
outdoor experiments are performed, showing that unmodeled forces and moments
are effectively compensated by the incremental control structure. Finally, we
provide a comprehensive procedure for the implementation of the controller on
other types of hybrid UAVs.
| cs.RO cs.SY | hybrid unmanned aircraft can significantly increase the potential of micro air vehicles because they combine hovering capability with a wing for fast and efficient forward flight however these vehicles are very difficult to control because their aerodynamics are hard to model and they are susceptible to wind gusts this often leads to composite and complex controllers with different modes for hover transition and forward flight in this paper we propose incremental nonlinear dynamic inversion control for the attitude and position control the result is a single continuous controller that is able to track the desired acceleration of the vehicle across the flight envelope the proposed controller is implemented on the cyclone hybrid uav multiple outdoor experiments are performed showing that unmodeled forces and moments are effectively compensated by the incremental control structure finally we provide a comprehensive procedure for the implementation of the controller on other types of hybrid uavs | [['hybrid', 'unmanned', 'aircraft', 'can', 'significantly', 'increase', 'the', 'potential', 'of', 'micro', 'air', 'vehicles', 'because', 'they', 'combine', 'hovering', 'capability', 'with', 'a', 'wing', 'for', 'fast', 'and', 'efficient', 'forward', 'flight', 'however', 'these', 'vehicles', 'are', 'very', 'difficult', 'to', 'control', 'because', 'their', 'aerodynamics', 'are', 'hard', 'to', 'model', 'and', 'they', 'are', 'susceptible', 'to', 'wind', 'gusts', 'this', 'often', 'leads', 'to', 'composite', 'and', 'complex', 'controllers', 'with', 'different', 'modes', 'for', 'hover', 'transition', 'and', 'forward', 'flight', 'in', 'this', 'paper', 'we', 'propose', 'incremental', 'nonlinear', 'dynamic', 'inversion', 'control', 'for', 'the', 'attitude', 'and', 'position', 'control', 'the', 'result', 'is', 'a', 'single', 'continuous', 'controller', 'that', 'is', 'able', 'to', 'track', 'the', 'desired', 'acceleration', 'of', 'the', 'vehicle', 'across', 'the', 'flight', 'envelope', 'the', 'proposed', 'controller', 'is', 'implemented', 'on', 'the', 'cyclone', 'hybrid', 'uav', 'multiple', 'outdoor', 'experiments', 'are', 'performed', 'showing', 'that', 'unmodeled', 'forces', 'and', 'moments', 'are', 'effectively', 'compensated', 'by', 'the', 'incremental', 'control', 'structure', 'finally', 'we', 'provide', 'a', 'comprehensive', 'procedure', 'for', 'the', 'implementation', 'of', 'the', 'controller', 'on', 'other', 'types', 'of', 'hybrid', 'uavs']] | [-0.15615881372243165, 0.1277890035804982, -0.06284224800455074, 0.015411385118301648, -0.11259614269870023, -0.17874967738675573, 0.03276644987054169, 0.45948451140817875, -0.2684708496928215, -0.35620081876404586, 0.13221561380118751, -0.2151127254590392, -0.1511981401918456, 0.21362157635235537, -0.14503389959068347, 0.12709837330350032, 0.08920716772864883, -0.021952320834582983, 0.012186912509884375, -0.15318528327935685, 0.23381711121182888, 0.0680102434506019, 0.2817527720487366, 0.00015975280354420344, 0.1531165697053075, -0.021889019262841126, 0.010521465692824373, 0.010939088373755415, -0.048086468359009205, 0.12745512002147735, 0.28488397972658275, 0.11291089234233369, 0.2851323312660679, -0.48887083876878024, -0.2070627376809716, 0.06707703282901396, 0.13371173022935787, 0.07616423265077174, -0.05737211713179325, -0.32094305514047544, 0.1111547760013491, -0.20789320182676116, -0.11784328359179198, -0.09551747809319447, -0.01224280617510279, 0.0828607965966997, -0.2858530365896877, -0.025149226404416063, 0.01668702905997634, 0.03318442665350934, -0.08525385807578763, -0.046408783540440104, -0.025728062040482957, 0.1771657274104655, 0.03937694643236076, -0.019319094376599726, 0.19892923776991667, -0.08780853223560067, -0.10180796779381732, 0.3970028534159064, 0.02636162516622183, -0.21768950986365476, 0.22477546154210964, -0.06227185014945765, -0.0598279763571918, 0.15340442581723135, 0.2569453700709467, 0.10543360826559364, -0.16666878859240872, -0.018472984640393406, 0.04143042785736422, 0.1541457797586918, 0.01999869659077376, -0.03646738493194183, 0.18100089890261492, 0.1988964212872088, 0.17379444245559475, 0.10130017792223953, -0.1415574827324599, -0.137424629808714, -0.2413417480175849, -0.1185834785255914, -0.10811630168308814, -0.059905373469615976, -0.03791682330251206, -0.11947271735640243, 0.38788487725115073, 0.1830398351761202, 0.1290811470290646, 0.07573148481994091, 0.4088438753566394, 0.10319356185073654, 0.040195580354581276, 0.0871749263179178, 0.27515973114951825, 0.027416055660384398, 0.1709870557130004, -0.27230729835418366, 0.11325798561175664, 0.011920116383116693] |
1,802.00715 | Dislocation charges reveal two-dimensional topological crystalline
invariants | We identify a one-to-one correspondence between the charge localized around a
dislocation characterized by a generic Burgers vector and the Berry phase
associated with the electronic Bloch waves of two-dimensional crystalline
insulators. Using this correspondence, we reveal a link between dislocation
charges and the topological invariants of inversion and rotation
symmetry-protected insulating phases both in the absence and in the presence of
time-reversal symmetry. Our findings demonstrate that dislocation charges can
be used as generic probes of crystalline topologies.
| cond-mat.mes-hall | we identify a onetoone correspondence between the charge localized around a dislocation characterized by a generic burgers vector and the berry phase associated with the electronic bloch waves of twodimensional crystalline insulators using this correspondence we reveal a link between dislocation charges and the topological invariants of inversion and rotation symmetryprotected insulating phases both in the absence and in the presence of timereversal symmetry our findings demonstrate that dislocation charges can be used as generic probes of crystalline topologies | [['we', 'identify', 'a', 'onetoone', 'correspondence', 'between', 'the', 'charge', 'localized', 'around', 'a', 'dislocation', 'characterized', 'by', 'a', 'generic', 'burgers', 'vector', 'and', 'the', 'berry', 'phase', 'associated', 'with', 'the', 'electronic', 'bloch', 'waves', 'of', 'twodimensional', 'crystalline', 'insulators', 'using', 'this', 'correspondence', 'we', 'reveal', 'a', 'link', 'between', 'dislocation', 'charges', 'and', 'the', 'topological', 'invariants', 'of', 'inversion', 'and', 'rotation', 'symmetryprotected', 'insulating', 'phases', 'both', 'in', 'the', 'absence', 'and', 'in', 'the', 'presence', 'of', 'timereversal', 'symmetry', 'our', 'findings', 'demonstrate', 'that', 'dislocation', 'charges', 'can', 'be', 'used', 'as', 'generic', 'probes', 'of', 'crystalline', 'topologies']] | [-0.24305611120277568, 0.2118914787527881, -0.0633862722617916, 0.024499454734481493, -0.02795798698133683, -0.12605278954628996, 0.0707348187931495, 0.36138566170783737, -0.24713673680737802, -0.2644735745189688, 0.026733457980253086, -0.2638573435995775, -0.23906657594857336, 0.09287428771605409, 0.015347867965391731, 0.02885205965618827, -0.07182399461729617, -0.05778299553520223, -0.16685554693759524, -0.15164413391139073, 0.3083138668119813, -0.08154583288521706, 0.34065401768665526, 0.07844983911896243, 0.03767706235705674, -0.018670127137646646, 0.04574280765049065, 0.04068647806025759, -0.13310416855400242, 0.08491750153465362, 0.2719165880993433, -0.0892331522146735, 0.08891709952886347, -0.5147158747798279, -0.21854583427451457, 0.055370704639302215, 0.11141747697197561, 0.13641730882816866, -0.09375160827619743, -0.39073558236601985, 0.09043516592370181, -0.13162624906701378, -0.14764271563956444, -0.12750038930179575, -0.012894637246109262, -0.011745344325045383, -0.19760501330506197, 0.12529452910198818, 0.06856953576678716, 0.10126565761357263, -0.13271197212176233, 0.04162563467869842, -0.197694621871143, 0.07629624800167129, 0.06855875234815138, 0.030882076301340815, 0.0949529810953013, -0.14375017789970565, -0.19491674227616454, 0.397252969561687, -0.025360983112661897, -0.21128953596034758, 0.19233297118091885, -0.11076329073509868, -0.0969154654730913, 0.14843272489401263, 0.0975060549443455, 0.07335914944923377, -0.04651236563222483, 0.050785059177116315, -0.056611292892359666, 0.13300432969780662, 0.05618211170850039, 0.06605274698260842, 0.3469526483382605, 0.10466187707844037, 0.04969416354794668, 0.16382196076255576, -0.1410635878469005, -0.09080715135588677, -0.32968096745707376, -0.2391468547520381, -0.26919603053055985, 0.04450458857006853, -0.10569278516842029, -0.18823573078158534, 0.45024208498151996, 0.10199454103602403, 0.1988647068980374, -0.0438549933554251, 0.18392478330414505, 0.08731798017161745, 0.046735236421227455, 0.05078866815524576, 0.2160819741653034, 0.2209585486127276, 0.07236311191551481, -0.2717819971421474, 0.005257635654386463, 0.0969983933941473] |
1,802.00716 | Configuration Spaces of Manifolds with Boundary | We study ordered configuration spaces of compact manifolds with boundary. We
show that for a large class of such manifolds, the real homotopy type of the
configuration spaces only depends on the real homotopy type of the pair
consisting of the manifold and its boundary. We moreover describe explicit real
models of these configuration spaces using three different approaches. We do
this by adapting previous constructions for configuration spaces of closed
manifolds which relied on Kontsevich's proof of the formality of the little
disks operads. We also prove that our models are compatible with the richer
structure of configuration spaces, respectively a module over the Swiss-Cheese
operad, a module over the associative algebra of configurations in a collar
around the boundary of the manifold, and a module over the little disks operad.
| math.AT math.QA | we study ordered configuration spaces of compact manifolds with boundary we show that for a large class of such manifolds the real homotopy type of the configuration spaces only depends on the real homotopy type of the pair consisting of the manifold and its boundary we moreover describe explicit real models of these configuration spaces using three different approaches we do this by adapting previous constructions for configuration spaces of closed manifolds which relied on kontsevichs proof of the formality of the little disks operads we also prove that our models are compatible with the richer structure of configuration spaces respectively a module over the swisscheese operad a module over the associative algebra of configurations in a collar around the boundary of the manifold and a module over the little disks operad | [['we', 'study', 'ordered', 'configuration', 'spaces', 'of', 'compact', 'manifolds', 'with', 'boundary', 'we', 'show', 'that', 'for', 'a', 'large', 'class', 'of', 'such', 'manifolds', 'the', 'real', 'homotopy', 'type', 'of', 'the', 'configuration', 'spaces', 'only', 'depends', 'on', 'the', 'real', 'homotopy', 'type', 'of', 'the', 'pair', 'consisting', 'of', 'the', 'manifold', 'and', 'its', 'boundary', 'we', 'moreover', 'describe', 'explicit', 'real', 'models', 'of', 'these', 'configuration', 'spaces', 'using', 'three', 'different', 'approaches', 'we', 'do', 'this', 'by', 'adapting', 'previous', 'constructions', 'for', 'configuration', 'spaces', 'of', 'closed', 'manifolds', 'which', 'relied', 'on', 'kontsevichs', 'proof', 'of', 'the', 'formality', 'of', 'the', 'little', 'disks', 'operads', 'we', 'also', 'prove', 'that', 'our', 'models', 'are', 'compatible', 'with', 'the', 'richer', 'structure', 'of', 'configuration', 'spaces', 'respectively', 'a', 'module', 'over', 'the', 'swisscheese', 'operad', 'a', 'module', 'over', 'the', 'associative', 'algebra', 'of', 'configurations', 'in', 'a', 'collar', 'around', 'the', 'boundary', 'of', 'the', 'manifold', 'and', 'a', 'module', 'over', 'the', 'little', 'disks', 'operad']] | [-0.16998481796701637, 0.03547532791554025, -0.055916754562393624, 0.0912922761203707, -0.09682058739285408, -0.08838339544000161, -0.029518087073511473, 0.4108856524707693, -0.28256216374663357, -0.24061056237780687, 0.13962739380517494, -0.1919140300720535, -0.17421171634641447, 0.2129395728459878, -0.14059735355884628, -0.04376069114192488, 0.10943715822544288, 0.08134075517723845, -0.1179720845927174, -0.26009586329878814, 0.5362921430531776, -0.012054706951885513, 0.21710799210141526, -0.006852700262132919, 0.14950422692521842, -0.015038113169738966, 0.00030646211764013225, 0.020838145575853007, -0.16404610451288384, 0.1629132809378489, 0.2165111533486197, 0.06305609087311578, 0.18480586142201597, -0.39391114404707245, -0.17665499263922824, 0.15629779036636604, 0.1230778684804329, 0.041673945031079435, -0.006583483540453017, -0.2891155474494691, 0.11678299080636917, -0.17868606411767277, -0.10264087630308825, -0.07296023073352197, 0.0343702269972048, 0.021308243160037266, -0.2265711040610878, -0.08212375130956802, 0.10811110563350446, 0.10750914869695959, -0.15508609076090524, -0.08461568010688732, -0.08254333812157821, 0.10954133419418764, -0.03795999170026996, 0.027172097479430675, 0.11547982627102597, -0.08658328208592579, -0.15213711685712702, 0.3120612207884816, -0.0480452092491429, -0.2600300700163864, 0.1934692275668071, -0.14735624611873363, -0.1689062773807426, 0.11983555108908507, 0.08194222126974526, 0.20473483428147368, -0.0038793260521770485, 0.18965344272719725, -0.09579903743790717, 0.11484560611742464, 0.06880860332801769, 0.016052679289273467, 0.1539425432230487, 0.18314204872656387, 0.07738650688957988, 0.13699180812744255, -0.01593145398267855, -0.1361715972778973, -0.3188654985843283, -0.19514847316807418, -0.09976761869091372, 0.11178081767160841, -0.15291246008740872, -0.23209914417626956, 0.3997173065912317, 0.06744958367551479, 0.2098257729332104, 0.11719769255741443, 0.2524009508179557, -0.01525031340354348, 0.1035111306559746, 0.04388975888970449, 0.1690752183397611, 0.1660878870576253, 0.06686773500493445, -0.09344722547437855, -0.03286511826533542, 0.14049927893299327] |
1,802.00717 | Effect of partially ionized impurities and radiation on the effective
critical electric field for runaway generation | We derive a formula for the effective critical electric field for runaway
generation and decay that accounts for the presence of partially ionized
impurities in combination with synchrotron and bremsstrahlung radiation losses.
We show that the effective critical field is drastically larger than the
classical Connor-Hastie field, and even exceeds the value obtained by replacing
the free electron density by the total electron density (including both free
and bound electrons). Using a kinetic equation solver with an inductive
electric field, we show that the runaway current decay after an impurity
injection is expected to be linear in time and proportional to the effective
critical electric field in highly inductive tokamak devices. This is relevant
for the efficacy of mitigation strategies for runaway electrons since it
reduces the required amount of injected impurities to achieve a certain current
decay rate.
| physics.plasm-ph | we derive a formula for the effective critical electric field for runaway generation and decay that accounts for the presence of partially ionized impurities in combination with synchrotron and bremsstrahlung radiation losses we show that the effective critical field is drastically larger than the classical connorhastie field and even exceeds the value obtained by replacing the free electron density by the total electron density including both free and bound electrons using a kinetic equation solver with an inductive electric field we show that the runaway current decay after an impurity injection is expected to be linear in time and proportional to the effective critical electric field in highly inductive tokamak devices this is relevant for the efficacy of mitigation strategies for runaway electrons since it reduces the required amount of injected impurities to achieve a certain current decay rate | [['we', 'derive', 'a', 'formula', 'for', 'the', 'effective', 'critical', 'electric', 'field', 'for', 'runaway', 'generation', 'and', 'decay', 'that', 'accounts', 'for', 'the', 'presence', 'of', 'partially', 'ionized', 'impurities', 'in', 'combination', 'with', 'synchrotron', 'and', 'bremsstrahlung', 'radiation', 'losses', 'we', 'show', 'that', 'the', 'effective', 'critical', 'field', 'is', 'drastically', 'larger', 'than', 'the', 'classical', 'connorhastie', 'field', 'and', 'even', 'exceeds', 'the', 'value', 'obtained', 'by', 'replacing', 'the', 'free', 'electron', 'density', 'by', 'the', 'total', 'electron', 'density', 'including', 'both', 'free', 'and', 'bound', 'electrons', 'using', 'a', 'kinetic', 'equation', 'solver', 'with', 'an', 'inductive', 'electric', 'field', 'we', 'show', 'that', 'the', 'runaway', 'current', 'decay', 'after', 'an', 'impurity', 'injection', 'is', 'expected', 'to', 'be', 'linear', 'in', 'time', 'and', 'proportional', 'to', 'the', 'effective', 'critical', 'electric', 'field', 'in', 'highly', 'inductive', 'tokamak', 'devices', 'this', 'is', 'relevant', 'for', 'the', 'efficacy', 'of', 'mitigation', 'strategies', 'for', 'runaway', 'electrons', 'since', 'it', 'reduces', 'the', 'required', 'amount', 'of', 'injected', 'impurities', 'to', 'achieve', 'a', 'certain', 'current', 'decay', 'rate']] | [-0.1090075327661327, 0.2172426519583509, -0.002552380873079317, 0.08325178448306532, -0.01930688068513637, -0.12573231141541855, 0.04656475573859137, 0.3190119341555713, -0.23234551193941708, -0.3252070705689814, 0.0492178114338616, -0.2776063486285832, -0.04253118782493191, 0.2308249406101506, 0.005147625577460596, 0.013272095419318024, 0.015023176637613147, 0.024405075372129246, -0.029699011157482753, -0.2124417183483762, 0.31618305093244364, 0.10838238227829013, 0.31158813204535324, 0.10937113523402292, 0.06793059771070661, 0.045792489838988884, 0.044509197369325855, 0.0482976926807854, -0.09330855848589714, 0.0695489167853299, 0.17976040053316325, 0.0471272651085873, 0.24368031344551971, -0.48751384642083145, -0.22941535274646635, 0.07393593285772679, 0.16660567860294512, 0.13297003473026975, -0.1105675011210184, -0.21831168158762698, 0.0750794027901619, -0.1887006407748719, -0.13807805897353767, -0.05361140613187698, 0.03918375471687835, 0.038375616363803114, -0.333854995999465, 0.0983410713406688, 0.02346498370204337, 0.007483519080594398, -0.11929597250201514, -0.10614974853123768, 0.006581005738184288, 0.053435159904504384, 0.09710884373803771, 0.05240153539014737, 0.22632479753920579, -0.194150024230349, -0.06736321314541704, 0.3354266194653684, -0.12216428406015663, -0.1474524369949232, 0.13890805092312908, -0.16965864214074353, -0.017576186885665833, 0.21279708547112736, 0.12107232766752334, 0.11633390732500973, -0.13897573626330256, 0.07481383445353815, 0.032664079224164394, 0.1361305179020417, 0.03894596458480194, 0.010186233578006859, 0.22250022409834724, 0.1387584434347261, 0.09440086631819714, 0.13874330277726782, -0.11624855852172966, -0.04546250243657741, -0.2913449467136609, -0.1643405853272112, -0.1666832955358415, 0.09056860864486384, -0.06778448897671625, -0.1587546420438836, 0.3689278554967672, 0.19598982347625957, 0.1246332261994805, -0.002999517914798597, 0.32630123692038265, 0.23439959123177265, 0.07310295971852822, 0.1320779268120321, 0.2632878015857136, 0.1413690657456122, 0.08702415937686042, -0.3024022249712447, 0.04837188312945807, 0.03523022068522708] |
1,802.00718 | Hippocampal and striatal involvement in cognitive tasks: a computational
model | The hippocampus and the striatum support episodic and procedural memory,
respectively, and "place" and "response" learning within spatial navigation.
Recently this dichotomy has been linked to "model-based" and "model-free"
reinforcement learning. Here we present a well-constrained neural model of how
both systems support spatial navigation, and apply the same model to more
abstract problems such as sequential decision making. In particular, we show
that if a task can be transformed into a Markov Decision Process, the machinery
provided by the hippocampus and striatum can be utilized to solve it. These
results show how the hippocampal complex can represent non-spatial problems,
including context, probabilities and action-dependent information, in support
of "model-based" reinforcement learning to complement learning within the
striatum.
| q-bio.NC | the hippocampus and the striatum support episodic and procedural memory respectively and place and response learning within spatial navigation recently this dichotomy has been linked to modelbased and modelfree reinforcement learning here we present a wellconstrained neural model of how both systems support spatial navigation and apply the same model to more abstract problems such as sequential decision making in particular we show that if a task can be transformed into a markov decision process the machinery provided by the hippocampus and striatum can be utilized to solve it these results show how the hippocampal complex can represent nonspatial problems including context probabilities and actiondependent information in support of modelbased reinforcement learning to complement learning within the striatum | [['the', 'hippocampus', 'and', 'the', 'striatum', 'support', 'episodic', 'and', 'procedural', 'memory', 'respectively', 'and', 'place', 'and', 'response', 'learning', 'within', 'spatial', 'navigation', 'recently', 'this', 'dichotomy', 'has', 'been', 'linked', 'to', 'modelbased', 'and', 'modelfree', 'reinforcement', 'learning', 'here', 'we', 'present', 'a', 'wellconstrained', 'neural', 'model', 'of', 'how', 'both', 'systems', 'support', 'spatial', 'navigation', 'and', 'apply', 'the', 'same', 'model', 'to', 'more', 'abstract', 'problems', 'such', 'as', 'sequential', 'decision', 'making', 'in', 'particular', 'we', 'show', 'that', 'if', 'a', 'task', 'can', 'be', 'transformed', 'into', 'a', 'markov', 'decision', 'process', 'the', 'machinery', 'provided', 'by', 'the', 'hippocampus', 'and', 'striatum', 'can', 'be', 'utilized', 'to', 'solve', 'it', 'these', 'results', 'show', 'how', 'the', 'hippocampal', 'complex', 'can', 'represent', 'nonspatial', 'problems', 'including', 'context', 'probabilities', 'and', 'actiondependent', 'information', 'in', 'support', 'of', 'modelbased', 'reinforcement', 'learning', 'to', 'complement', 'learning', 'within', 'the', 'striatum']] | [0.015255301497221561, 0.06013786026781772, -0.08598221091048444, 0.11084618596752557, -0.16208136515786586, -0.15443030062478857, 0.04284171351839362, 0.47494919200317337, -0.31756610233115695, -0.28927225055088196, 0.12894329328239912, -0.1963201982000748, -0.2547717413123129, 0.1734257195010718, -0.13335087595081305, 0.06984301474659656, 0.06346172323624083, 0.05181784979935925, 0.006199559404009606, -0.21741536378138304, 0.2650812000600558, 0.0027208025567233562, 0.2771374999300845, 0.017851119328258655, 0.14350326025811166, 0.013560369531860796, 0.0012240184163201159, 0.02459252933513815, -0.0536462676860476, 0.15824021313781456, 0.36225985086886053, 0.2413496975984298, 0.35238561372004323, -0.4737323226754443, -0.26235036810433837, 0.11158391013267939, 0.1844097447534234, 0.06298826379164801, -0.01586046892524622, -0.35488038977323955, 0.07104460632041791, -0.17826428225705937, 0.004699578638962012, -0.14816593175450088, -0.03145209657051995, -0.0025694612137405043, -0.2894737703757266, 0.024434376081799047, 0.11323717177719257, 0.042648479374030886, -0.10053368669074281, -0.06578437313516387, -0.006221336008728308, 0.17476964135796336, 0.007565730257044641, 0.05356153355560155, 0.15709894724284945, -0.1463386924696644, -0.21488969706756583, 0.33070600313781684, -0.0013381700264289975, -0.20556883971696183, 0.2169263455345911, -0.04954235539455914, -0.19453674494841341, 0.05364487281313829, 0.2616552938707173, 0.08654322420736238, -0.16785389420544825, 0.03842346753798804, -0.025319230470459086, 0.1799223550745302, 0.017715579368395067, -0.033198474736694815, 0.1750647347041611, 0.260773713430153, 0.011263360476547505, 0.13159650678389265, -0.0812662813962453, -0.13262506506318952, -0.1926841770409275, -0.13005425305879217, -0.11590845407365616, -0.02178613537077997, -0.104657454999219, -0.11249551377495971, 0.3302559316694989, 0.22159800356869602, 0.20163560871397918, 0.11096764697448619, 0.29922872511827847, 0.08616625429900615, 0.0975030963649476, 0.10218637101934291, 0.17661926156241384, 0.08450300399790187, 0.12627013601457415, -0.19748418672420717, 0.147003068490017, 0.025952220760222713] |
1,802.00719 | Path Laplacian operators and superdiffusive processes on graphs. II.
Two-dimensional lattice | In this paper we consider a generalized diffusion equation on a square
lattice corresponding to Mellin transforms of the $k$-path Laplacian. In
particular, we prove that superdiffusion occurs when the parameter $s$ in the
Mellin transform is in the interval $(2,4)$ and that normal diffusion prevails
when $s>4$.
| math.FA | in this paper we consider a generalized diffusion equation on a square lattice corresponding to mellin transforms of the kpath laplacian in particular we prove that superdiffusion occurs when the parameter s in the mellin transform is in the interval 24 and that normal diffusion prevails when s4 | [['in', 'this', 'paper', 'we', 'consider', 'a', 'generalized', 'diffusion', 'equation', 'on', 'a', 'square', 'lattice', 'corresponding', 'to', 'mellin', 'transforms', 'of', 'the', 'kpath', 'laplacian', 'in', 'particular', 'we', 'prove', 'that', 'superdiffusion', 'occurs', 'when', 'the', 'parameter', 's', 'in', 'the', 'mellin', 'transform', 'is', 'in', 'the', 'interval', '24', 'and', 'that', 'normal', 'diffusion', 'prevails', 'when', 's4']] | [-0.12762434949399903, 0.1762951566464229, -0.07116448153586437, 0.09603805641139236, -0.09216044725811419, -0.0902665420435369, 0.009012530191588061, 0.36840427309895557, -0.3252818105975166, -0.15795000677462667, 0.13104596310101138, -0.2905272008889976, -0.19048581668175757, 0.1469267192975773, -0.04110855598870936, -0.007131345841723184, 0.02784727668040432, 0.08303452907906224, -0.11148941702170607, -0.22889333721347307, 0.3089693272486329, -0.06510935857901738, 0.24914426496252418, 0.03821136313975634, 0.10939636052353308, 0.056123808899428695, 0.011940786294871941, -0.02153760867076926, -0.1803448808414032, 0.05704770021839067, 0.19748864974826574, 0.004268473562357637, 0.2286688581419488, -0.4055375606209661, -0.18425891096315658, 0.15365537704201415, 0.17908838110452052, 0.02199231000849977, 0.013391807910617596, -0.2234886159809927, 0.04268453649031775, -0.11177316090712945, -0.12836219275535163, -0.009033607978684207, 0.08116847940254956, 0.0031075149308890104, -0.30112877538582933, 0.14916793606244028, 0.14504650064433613, 0.0192960028264982, -0.047653027810156345, -0.11275629400430869, 0.03137307117382685, 0.0021603976650415766, 0.03618168815592071, 0.02908503757013629, 0.030446015057653614, -0.10671104812354315, -0.08366904388337086, 0.3653119821101427, -0.1037672670208849, -0.25512165234734613, 0.056389707645090915, -0.25412061469008523, -0.1646019949694164, 0.09310630076409628, 0.15809197865504152, 0.13819215021794662, -0.11659698911353189, 0.18134378567992826, -0.05524689989397302, 0.1259449774127764, 0.11383694456890225, -0.04362114218626326, 0.04372403188608587, 0.16956944459525403, 0.10609930488863029, 0.1884715522173792, -0.12952680599119049, -0.12000898900441825, -0.3436636480813225, -0.20839210149521628, -0.23050280664271364, 0.09824242045093949, -0.1435588675761513, -0.1832997965781639, 0.37628962510886294, 0.1469393573255123, 0.20176359917968512, 0.08054684506108363, 0.19169359089573845, 0.2199130458951307, 0.021136417984962463, 0.07239154407094854, 0.13454042084049433, 0.12587935496897748, 0.11328997236463086, -0.21242020398979852, -0.019195539750702057, 0.161820275709033] |
1,802.0072 | Path integral action of a particle in $\kappa$-Minkowski spacetime | In this letter, we derive the path integral action of a particle in
$\kappa$-Minkowski spacetime. The equation of motion for an arbitrary potential
due to the $\kappa$-deformation of the Minkowski spacetime is then obtained.
The action contains a dissipative term which owes its origin to the
$\kappa$-Minkowski deformation parameter $a$. We take the example of the
harmonic oscillator and obtain the frequency of oscillations in the path
integral approach as well as operator approach upto the first order in the
deformation parameter $a$. For studying this, we start with the
$\kappa$-deformed dispersion relation which is invariant under the undeformed
$\kappa$-Poincar$\acute{e}$ algebra and take the non-relativistic limit of the
$\kappa$-deformed dispersion relation to find the Hamiltonian. The propagator
for the free particle in the $\kappa$-Minkowski spacetime is also computed
explicitly. In the limit, $a\rightarrow 0$, the commutative results are
recovered.
| physics.gen-ph hep-th | in this letter we derive the path integral action of a particle in kappaminkowski spacetime the equation of motion for an arbitrary potential due to the kappadeformation of the minkowski spacetime is then obtained the action contains a dissipative term which owes its origin to the kappaminkowski deformation parameter a we take the example of the harmonic oscillator and obtain the frequency of oscillations in the path integral approach as well as operator approach upto the first order in the deformation parameter a for studying this we start with the kappadeformed dispersion relation which is invariant under the undeformed kappapoincaracutee algebra and take the nonrelativistic limit of the kappadeformed dispersion relation to find the hamiltonian the propagator for the free particle in the kappaminkowski spacetime is also computed explicitly in the limit arightarrow 0 the commutative results are recovered | [['in', 'this', 'letter', 'we', 'derive', 'the', 'path', 'integral', 'action', 'of', 'a', 'particle', 'in', 'kappaminkowski', 'spacetime', 'the', 'equation', 'of', 'motion', 'for', 'an', 'arbitrary', 'potential', 'due', 'to', 'the', 'kappadeformation', 'of', 'the', 'minkowski', 'spacetime', 'is', 'then', 'obtained', 'the', 'action', 'contains', 'a', 'dissipative', 'term', 'which', 'owes', 'its', 'origin', 'to', 'the', 'kappaminkowski', 'deformation', 'parameter', 'a', 'we', 'take', 'the', 'example', 'of', 'the', 'harmonic', 'oscillator', 'and', 'obtain', 'the', 'frequency', 'of', 'oscillations', 'in', 'the', 'path', 'integral', 'approach', 'as', 'well', 'as', 'operator', 'approach', 'upto', 'the', 'first', 'order', 'in', 'the', 'deformation', 'parameter', 'a', 'for', 'studying', 'this', 'we', 'start', 'with', 'the', 'kappadeformed', 'dispersion', 'relation', 'which', 'is', 'invariant', 'under', 'the', 'undeformed', 'kappapoincaracutee', 'algebra', 'and', 'take', 'the', 'nonrelativistic', 'limit', 'of', 'the', 'kappadeformed', 'dispersion', 'relation', 'to', 'find', 'the', 'hamiltonian', 'the', 'propagator', 'for', 'the', 'free', 'particle', 'in', 'the', 'kappaminkowski', 'spacetime', 'is', 'also', 'computed', 'explicitly', 'in', 'the', 'limit', 'arightarrow', '0', 'the', 'commutative', 'results', 'are', 'recovered']] | [-0.14566602205614682, 0.14552730899795543, -0.12054231948138255, 0.06848301443328703, -0.08567929170701814, -0.07903273725220798, -0.019658799836601036, 0.32108958880754485, -0.28633616500081954, -0.2393070955126398, 0.06300921738316453, -0.24228827615835422, -0.16004487233357909, 0.1646156543629595, -0.05854485381691568, 0.021934842025655307, 0.031160443167512614, 0.14214178602602603, -0.10242072609928099, -0.1777183722967849, 0.36126632580830564, 0.062002696165227855, 0.22068766164559656, 0.0037464708392677044, 0.16865937349696955, 0.029943344437186537, -0.009866963700809772, 0.003917232439245867, -0.16392978145397163, 0.0780861027516843, 0.182712955157394, 0.02202066569926514, 0.19121736067050285, -0.37218223399806605, -0.19088307009550973, 0.07610114986090448, 0.14756392427902346, 0.13014596452821803, -0.007123662216210927, -0.3012471967714204, 0.0009538296718096387, -0.20900375676084904, -0.19723245532562336, -0.05239611841144337, 0.057153122141903295, -0.05234901304019318, -0.24214295585862483, 0.1072453953630706, 0.08039988498490276, 0.015305886841446592, -0.1314924378935045, -0.04507217380054551, -0.031553746344508145, 0.11641121154947989, 0.04968470011237145, 0.04396804388818345, 0.10920963995142854, -0.12744310266229467, -0.08757501520744553, 0.4381021794633589, -0.08065428366408804, -0.27537892382942897, 0.07422107522902281, -0.2117596431264141, -0.1148931163639856, 0.07433413856568327, 0.10543677291454936, 0.12472990812882241, -0.1523863467669614, 0.21298940522187942, -0.006613157773930309, 0.07867613192681439, 0.07961556142148818, 0.04862626193199253, 0.15197940003365173, 0.10430969349091765, 0.04014157425895657, 0.16881237333080312, -0.06664748319198607, -0.13539039550781035, -0.3960124398649171, -0.19033766757406673, -0.1485555291655001, 0.08642139995598869, -0.1470344139773827, -0.16876986344510259, 0.3804241356750329, 0.14854460235253192, 0.17455578740159777, 0.05660997791910895, 0.24972921725281555, 0.21586691214115886, 0.0650171225897266, 0.03802277379588265, 0.26231572349164367, 0.157767511907614, 0.09666411014462727, -0.24693753392827036, -0.0962568772079396, 0.1418144157615261] |
1,802.00721 | Improved Runtime Bounds for the Univariate Marginal Distribution
Algorithm via Anti-Concentration | Unlike traditional evolutionary algorithms which produce offspring via
genetic operators, Estimation of Distribution Algorithms (EDAs) sample
solutions from probabilistic models which are learned from selected
individuals. It is hoped that EDAs may improve optimisation performance on
epistatic fitness landscapes by learning variable interactions. However, hardly
any rigorous results are available to support claims about the performance of
EDAs, even for fitness functions without epistasis. The expected runtime of the
Univariate Marginal Distribution Algorithm (UMDA) on OneMax was recently shown
to be in $\mathcal{O}\left(n\lambda\log \lambda\right)$ by Dang and Lehre
(GECCO 2015). Later, Krejca and Witt (FOGA 2017) proved the lower bound
$\Omega\left(\lambda\sqrt{n}+n\log n\right)$ via an involved drift analysis.
We prove a $\mathcal{O}\left(n\lambda\right)$ bound, given some restrictions
on the population size. This implies the tight bound $\Theta\left(n\log
n\right)$ when $\lambda=\mathcal{O}\left(\log n\right)$, matching the runtime
of classical EAs. Our analysis uses the level-based theorem and
anti-concentration properties of the Poisson-Binomial distribution. We expect
that these generic methods will facilitate further analysis of EDAs.
| cs.NE | unlike traditional evolutionary algorithms which produce offspring via genetic operators estimation of distribution algorithms edas sample solutions from probabilistic models which are learned from selected individuals it is hoped that edas may improve optimisation performance on epistatic fitness landscapes by learning variable interactions however hardly any rigorous results are available to support claims about the performance of edas even for fitness functions without epistasis the expected runtime of the univariate marginal distribution algorithm umda on onemax was recently shown to be in mathcaloleftnlambdalog lambdaright by dang and lehre gecco 2015 later krejca and witt foga 2017 proved the lower bound omegaleftlambdasqrtnnlog nright via an involved drift analysis we prove a mathcaloleftnlambdaright bound given some restrictions on the population size this implies the tight bound thetaleftnlog nright when lambdamathcaloleftlog nright matching the runtime of classical eas our analysis uses the levelbased theorem and anticoncentration properties of the poissonbinomial distribution we expect that these generic methods will facilitate further analysis of edas | [['unlike', 'traditional', 'evolutionary', 'algorithms', 'which', 'produce', 'offspring', 'via', 'genetic', 'operators', 'estimation', 'of', 'distribution', 'algorithms', 'edas', 'sample', 'solutions', 'from', 'probabilistic', 'models', 'which', 'are', 'learned', 'from', 'selected', 'individuals', 'it', 'is', 'hoped', 'that', 'edas', 'may', 'improve', 'optimisation', 'performance', 'on', 'epistatic', 'fitness', 'landscapes', 'by', 'learning', 'variable', 'interactions', 'however', 'hardly', 'any', 'rigorous', 'results', 'are', 'available', 'to', 'support', 'claims', 'about', 'the', 'performance', 'of', 'edas', 'even', 'for', 'fitness', 'functions', 'without', 'epistasis', 'the', 'expected', 'runtime', 'of', 'the', 'univariate', 'marginal', 'distribution', 'algorithm', 'umda', 'on', 'onemax', 'was', 'recently', 'shown', 'to', 'be', 'in', 'mathcaloleftnlambdalog', 'lambdaright', 'by', 'dang', 'and', 'lehre', 'gecco', '2015', 'later', 'krejca', 'and', 'witt', 'foga', '2017', 'proved', 'the', 'lower', 'bound', 'omegaleftlambdasqrtnnlog', 'nright', 'via', 'an', 'involved', 'drift', 'analysis', 'we', 'prove', 'a', 'mathcaloleftnlambdaright', 'bound', 'given', 'some', 'restrictions', 'on', 'the', 'population', 'size', 'this', 'implies', 'the', 'tight', 'bound', 'thetaleftnlog', 'nright', 'when', 'lambdamathcaloleftlog', 'nright', 'matching', 'the', 'runtime', 'of', 'classical', 'eas', 'our', 'analysis', 'uses', 'the', 'levelbased', 'theorem', 'and', 'anticoncentration', 'properties', 'of', 'the', 'poissonbinomial', 'distribution', 'we', 'expect', 'that', 'these', 'generic', 'methods', 'will', 'facilitate', 'further', 'analysis', 'of', 'edas']] | [-0.05257764341258263, 0.048540494316382264, -0.15381264941677658, 0.12943663341547426, -0.07654162159631053, -0.16747242640613202, 0.0721340644227752, 0.3672542094809378, -0.21008606539591662, -0.323388831835095, 0.09551001481209918, -0.23131920123630045, -0.17363859806209803, 0.20992372681193247, -0.11960444054505848, 0.09579695942630241, 0.10738425196281501, 1.515284204831371e-05, -0.018180557191009066, -0.36263512255920266, 0.25492762554854204, 0.0917817037794497, 0.28599237003545097, -0.0012929462222987182, 0.05106983474733961, 0.009775831078348512, -0.04980400827253697, -0.02522925589862582, -0.15500706604686823, 0.12900172407714675, 0.25793530863465297, 0.24006945039780642, 0.30276731635722054, -0.3790185766779064, -0.17502708376843373, 0.1571332718300113, 0.17600642543364703, 0.08332394436663228, -0.022246815872759642, -0.3048729030007206, 0.06872926075192919, -0.13173337056688578, -0.06297721420399627, -0.08061340200267249, -0.013783538353844098, 0.06840057189307212, -0.3109939951304491, 0.0598623734995626, 0.11473368329310475, 0.05608189161020247, -0.032419540742472684, -0.22608417894558183, -0.007292478059587831, 0.06221628863587084, 0.04707867622393631, 0.039557951066322476, 0.11698843429905253, -0.09219667532136543, -0.1739338583724162, 0.2631464073126047, -0.040928466230413164, -0.1985854446043581, 0.18471567529289948, -0.0924892080838145, -0.16638398400882815, 0.12631518818897666, 0.18623587626709856, 0.13101527612208835, -0.15456483046142097, 0.11392333726103829, -0.041950972742089615, 0.17636764374680292, 0.06746528416421482, 0.011926507598466494, 0.10168806534538699, 0.13379030687244634, 0.11781275134636451, 0.0898896317343929, -0.01630653505812266, -0.11115000335244135, -0.21730584642160441, -0.12546690072911162, -0.23097943321971054, 0.031245765534030006, -0.1472750579717746, -0.15798408570438593, 0.34157789112431564, 0.16898277711142884, 0.14760110242437427, 0.16710113022210343, 0.26196003035383675, 0.11297883832745569, 0.060620765095915304, 0.13187849200965668, 0.1823600601741678, 0.07979426148813218, 0.054602683945135636, -0.18579386714422566, 0.18574606300960597, 0.09259107665539804] |
1,802.00722 | Unusually low thermal conductivity of atomically thin 2D tellurium | Tellurium is a high-performance thermoelectric material due to its superior
electronic transport and low lattice thermal conductivity ($\kappa_L$). Here,
we report the ultralow $\kappa_L$ in the monolayer tellurium, i.e., tellurene,
which has been successfully synthesized in recent experiments. We find
tellurene has a compellingly low room temperature $\kappa_L$ of 2.16 and 4.08 W
m$^{-1}$ K$^{-1}$ along the armchair and zigzag directions, respectively, which
is lower than any reported values for other 2D materials. We attribute this
unusually low $\kappa_L$ to the soft acoustic modes, extremely low-energy
optical modes and the strong scattering among optical-acoustic phonons, which
place tellurene as a potential novel thermoelectric material. Finally, we
disclose that $\kappa_L$ is proportional to the largest acoustic phonon
frequency ($\omega_{D}^{a}$) and the lowest optical phonon frequency at
$\Gamma$ point ($\omega_{\Gamma}^{o}$) in 2D materials, which reflect both
harmonic and anharmonic thermal properties respectively.
| cond-mat.mtrl-sci physics.app-ph | tellurium is a highperformance thermoelectric material due to its superior electronic transport and low lattice thermal conductivity kappa_l here we report the ultralow kappa_l in the monolayer tellurium ie tellurene which has been successfully synthesized in recent experiments we find tellurene has a compellingly low room temperature kappa_l of 216 and 408 w m1 k1 along the armchair and zigzag directions respectively which is lower than any reported values for other 2d materials we attribute this unusually low kappa_l to the soft acoustic modes extremely lowenergy optical modes and the strong scattering among opticalacoustic phonons which place tellurene as a potential novel thermoelectric material finally we disclose that kappa_l is proportional to the largest acoustic phonon frequency omega_da and the lowest optical phonon frequency at gamma point omega_gammao in 2d materials which reflect both harmonic and anharmonic thermal properties respectively | [['tellurium', 'is', 'a', 'highperformance', 'thermoelectric', 'material', 'due', 'to', 'its', 'superior', 'electronic', 'transport', 'and', 'low', 'lattice', 'thermal', 'conductivity', 'kappa_l', 'here', 'we', 'report', 'the', 'ultralow', 'kappa_l', 'in', 'the', 'monolayer', 'tellurium', 'ie', 'tellurene', 'which', 'has', 'been', 'successfully', 'synthesized', 'in', 'recent', 'experiments', 'we', 'find', 'tellurene', 'has', 'a', 'compellingly', 'low', 'room', 'temperature', 'kappa_l', 'of', '216', 'and', '408', 'w', 'm1', 'k1', 'along', 'the', 'armchair', 'and', 'zigzag', 'directions', 'respectively', 'which', 'is', 'lower', 'than', 'any', 'reported', 'values', 'for', 'other', '2d', 'materials', 'we', 'attribute', 'this', 'unusually', 'low', 'kappa_l', 'to', 'the', 'soft', 'acoustic', 'modes', 'extremely', 'lowenergy', 'optical', 'modes', 'and', 'the', 'strong', 'scattering', 'among', 'opticalacoustic', 'phonons', 'which', 'place', 'tellurene', 'as', 'a', 'potential', 'novel', 'thermoelectric', 'material', 'finally', 'we', 'disclose', 'that', 'kappa_l', 'is', 'proportional', 'to', 'the', 'largest', 'acoustic', 'phonon', 'frequency', 'omega_da', 'and', 'the', 'lowest', 'optical', 'phonon', 'frequency', 'at', 'gamma', 'point', 'omega_gammao', 'in', '2d', 'materials', 'which', 'reflect', 'both', 'harmonic', 'and', 'anharmonic', 'thermal', 'properties', 'respectively']] | [-0.14361738760793663, 0.2109375540428606, -0.03387290677663101, -0.05407491243154188, -0.099760857012133, -0.1746009006637378, 0.1006420328538271, 0.45969700629728427, -0.2637548329835029, -0.22916586973672343, 0.031222084504248494, -0.3854535107325385, -0.14332925591388365, 0.2286418115068902, 0.05256003593145262, 0.039429823144387956, -0.006497662500950737, -0.04313946634773975, -0.04001878861985777, -0.16456614966180338, 0.14287880389019847, 0.10087186507070842, 0.3760399989179754, 0.11764406391244003, 0.06674629137041452, -0.05400290230518558, 0.1081811268746421, -0.0027311500414963, -0.16133981549875528, 0.09148561543501589, 0.27787456402987026, -0.18598685413767732, 0.19455741884429817, -0.39761751594588807, -0.21740444390562133, 0.04110402843165819, 0.11740308933540423, 0.14792423450684958, -0.05720992506130774, -0.1706663313848169, 0.09809081326576247, -0.1266429525077937, -0.06498079705963154, -0.09461104896837387, 0.04360615815697373, -0.04296785185747928, -0.1819890991555176, 0.11940961995708715, 0.031279617849656424, 0.06307394556410989, -0.13281253270173876, -0.22923619036421017, -0.07958266505823079, 0.024560674893386338, 0.01671871265727163, 0.014494075355511428, 0.15689483177266084, -0.1071470997016202, -0.07271901554886953, 0.44046004389183246, -0.07340187297054597, -0.0439436098061286, 0.1888840475787773, -0.18319153684812287, -0.07125641946829316, 0.19410714343446644, 0.14294110770688218, 0.059736028023442064, -0.1493738403128784, 0.06413291189359818, 0.018855926945157673, 0.15664508598084745, 0.07439457416615408, 0.14959926495288053, 0.2453605112336252, 0.18265053380025126, -0.004738813814491142, 0.1476626645379693, -0.1309612679119775, 0.10316191698033092, -0.15142306193803856, -0.1752613687388383, -0.21700316313924134, 0.07966411036803671, -0.1019816232798368, -0.20421342345872434, 0.3868894979013535, 0.1489218873224066, 0.16200692799833158, -0.020671686996111945, 0.25818090692358225, 0.1423237855011341, 0.10117912919604746, 0.05813047760233715, 0.30701430756733683, 0.14283981554183192, 0.11680087795062666, -0.3104541667473867, 0.006401510127192444, -0.0321817746490537] |
1,802.00723 | Total perfect codes in graphs realized by commutative rings | Let $R$ be a commutative ring with unity not equal to zero and let
$\Gamma(R)$ be a zero-divisor graph realized by $R$. For a simple, undirected,
connected graph $G = (V, E)$, a {\it total perfect code} denoted by $C(G)$ in
$G$ is a subset $C(G) \subseteq V(G)$ such that $|N(v) \cap C(G)| = 1$ for all
$v \in V(G)$, where $N(v)$ denotes the open neighbourhood of a vertex $v$ in
$G$. In this paper, we study total perfect codes in graphs which are realized
as zero-divisor graphs. We show a zero-divisor graph realized by a local
commutative ring with unity admits a total perfect code if and only if the
graph has degree one vertices. We also show that if $\Gamma(R)$ is a regular
graph on $|Z^*(R)|$ vertices, then $R$ is a reduced ring and $|Z^*(R)| \equiv
0(mod ~2)$, where $Z^*(R)$ is a set of non-zero zero-divisors of $R$. We
provide a characterization for all commutative rings with unity of which the
realized zero-divisor graphs admit total perfect codes. Finally, we determine
the cardinality of a total perfect code in $\Gamma(R)$ and discuss the
significance of the study of total perfect codes in graphs realized by
commutative rings with unity.
| math.CO math.AC math.RA | let r be a commutative ring with unity not equal to zero and let gammar be a zerodivisor graph realized by r for a simple undirected connected graph g v e a it total perfect code denoted by cg in g is a subset cg subseteq vg such that nv cap cg 1 for all v in vg where nv denotes the open neighbourhood of a vertex v in g in this paper we study total perfect codes in graphs which are realized as zerodivisor graphs we show a zerodivisor graph realized by a local commutative ring with unity admits a total perfect code if and only if the graph has degree one vertices we also show that if gammar is a regular graph on zr vertices then r is a reduced ring and zr equiv 0mod 2 where zr is a set of nonzero zerodivisors of r we provide a characterization for all commutative rings with unity of which the realized zerodivisor graphs admit total perfect codes finally we determine the cardinality of a total perfect code in gammar and discuss the significance of the study of total perfect codes in graphs realized by commutative rings with unity | [['let', 'r', 'be', 'a', 'commutative', 'ring', 'with', 'unity', 'not', 'equal', 'to', 'zero', 'and', 'let', 'gammar', 'be', 'a', 'zerodivisor', 'graph', 'realized', 'by', 'r', 'for', 'a', 'simple', 'undirected', 'connected', 'graph', 'g', 'v', 'e', 'a', 'it', 'total', 'perfect', 'code', 'denoted', 'by', 'cg', 'in', 'g', 'is', 'a', 'subset', 'cg', 'subseteq', 'vg', 'such', 'that', 'nv', 'cap', 'cg', '1', 'for', 'all', 'v', 'in', 'vg', 'where', 'nv', 'denotes', 'the', 'open', 'neighbourhood', 'of', 'a', 'vertex', 'v', 'in', 'g', 'in', 'this', 'paper', 'we', 'study', 'total', 'perfect', 'codes', 'in', 'graphs', 'which', 'are', 'realized', 'as', 'zerodivisor', 'graphs', 'we', 'show', 'a', 'zerodivisor', 'graph', 'realized', 'by', 'a', 'local', 'commutative', 'ring', 'with', 'unity', 'admits', 'a', 'total', 'perfect', 'code', 'if', 'and', 'only', 'if', 'the', 'graph', 'has', 'degree', 'one', 'vertices', 'we', 'also', 'show', 'that', 'if', 'gammar', 'is', 'a', 'regular', 'graph', 'on', 'zr', 'vertices', 'then', 'r', 'is', 'a', 'reduced', 'ring', 'and', 'zr', 'equiv', '0mod', '2', 'where', 'zr', 'is', 'a', 'set', 'of', 'nonzero', 'zerodivisors', 'of', 'r', 'we', 'provide', 'a', 'characterization', 'for', 'all', 'commutative', 'rings', 'with', 'unity', 'of', 'which', 'the', 'realized', 'zerodivisor', 'graphs', 'admit', 'total', 'perfect', 'codes', 'finally', 'we', 'determine', 'the', 'cardinality', 'of', 'a', 'total', 'perfect', 'code', 'in', 'gammar', 'and', 'discuss', 'the', 'significance', 'of', 'the', 'study', 'of', 'total', 'perfect', 'codes', 'in', 'graphs', 'realized', 'by', 'commutative', 'rings', 'with', 'unity']] | [-0.2116382175579143, 0.09530437336865699, 0.00571074841506592, -0.02497764466325729, -0.04644799203934831, -0.21481935092570945, -0.0031746676286457847, 0.3897503199753113, -0.32548916452194576, -0.23045577445352947, 0.04677713174553092, -0.30823893093939253, -0.07929698027548703, 0.10438149401347092, -0.09840401054135332, -0.08411228337825917, 0.10209253123357667, 0.15974974684576954, -0.031333269209755425, -0.2848772324035798, 0.2897859094149653, -0.004253307486130814, 0.1361090232993724, 0.052553712402063246, 0.09503615932567186, 0.026307531031101342, 0.0238213022520307, 0.15719246433289655, -0.2442340600008441, 0.0474525544893034, 0.2990203234858474, 0.14902058832731155, 0.21564645496145565, -0.35453226521667375, -0.14366906814876212, 0.25013237048277454, 0.1149251791765567, -0.009377745574518065, -0.006947194232521157, -0.15950460759829263, 0.22825699843625402, -0.22242684437884264, -0.08290544158519345, 0.03548531458510119, 0.16504630085605024, 0.016065532800240732, -0.31265460283977525, -0.03688816449282593, 0.09569526656095556, 0.12029344671237371, 0.0812095350974319, -0.1445371906715328, -0.09440167615045068, 0.018931394522476136, -0.14737000442741804, 0.08442572727518614, 0.06763336699147096, -0.07388695367920825, -0.14407605620746936, 0.4049163718155618, -0.08184258413914094, -0.1595168013427519, 0.06812072585538105, -0.17884402560191837, -0.09731992750882579, 0.10215249724672106, 0.07332055119507426, 0.17514184748650946, -0.05371553563143141, 0.2345811242211947, -0.17055895473575805, 0.11825535762715786, 0.0789778117235544, 0.025812262545770324, 0.1678923418974719, 0.07572431412254034, 0.12288495788310336, 0.15175200775897496, 0.03297624025779341, 0.08753728473573062, -0.3082016284797509, -0.12993413062260753, -0.21738558441012087, 0.13762088205518222, -0.16000798073844122, -0.16603133344836182, 0.41352637220716953, 0.0715750060769631, 0.19307660278232402, 0.041792396896509404, 0.21664822614522436, 0.03910814333672286, 0.06326301038106108, 0.18325805257369376, 0.08994162839430211, 0.22356048114738197, -0.07886503733947274, -0.17295841305942541, -0.0030980227671881864, 0.13903371466267572] |
1,802.00724 | A cost effective and reliable environment monitoring system for HPC
applications | We present a slow control system to gather all relevant environment
information necessary to effectively and reliably run an HPC (High Performance
Computing) system at a high value over price ratio. The scalable and reliable
overall concept is presented as well as a newly developed hardware device for
sensor read out. This device incorporates a Raspberry Pi, an Arduino and PoE
(Power over Ethernet) functionality in a compact form factor. The system is in
use at the 2 PFLOPS cluster of the Johannes Gutenberg-University and
Helmholtz-Institute in Mainz.
| cs.OH | we present a slow control system to gather all relevant environment information necessary to effectively and reliably run an hpc high performance computing system at a high value over price ratio the scalable and reliable overall concept is presented as well as a newly developed hardware device for sensor read out this device incorporates a raspberry pi an arduino and poe power over ethernet functionality in a compact form factor the system is in use at the 2 pflops cluster of the johannes gutenberguniversity and helmholtzinstitute in mainz | [['we', 'present', 'a', 'slow', 'control', 'system', 'to', 'gather', 'all', 'relevant', 'environment', 'information', 'necessary', 'to', 'effectively', 'and', 'reliably', 'run', 'an', 'hpc', 'high', 'performance', 'computing', 'system', 'at', 'a', 'high', 'value', 'over', 'price', 'ratio', 'the', 'scalable', 'and', 'reliable', 'overall', 'concept', 'is', 'presented', 'as', 'well', 'as', 'a', 'newly', 'developed', 'hardware', 'device', 'for', 'sensor', 'read', 'out', 'this', 'device', 'incorporates', 'a', 'raspberry', 'pi', 'an', 'arduino', 'and', 'poe', 'power', 'over', 'ethernet', 'functionality', 'in', 'a', 'compact', 'form', 'factor', 'the', 'system', 'is', 'in', 'use', 'at', 'the', '2', 'pflops', 'cluster', 'of', 'the', 'johannes', 'gutenberguniversity', 'and', 'helmholtzinstitute', 'in', 'mainz']] | [-0.15626967940371222, 0.029756551587123013, -0.08142059813740901, -0.01910561705982789, -0.044345186151520805, -0.18844476987629435, 0.06902946076314588, 0.3792229946269545, -0.2597074039107145, -0.34623061514697795, 0.11194767701293364, -0.2668265509256703, -0.09401677419948608, 0.24901204301737423, -0.07842911047817663, 0.08957585407594262, 0.054888330418941415, 0.04112864875635349, -0.0005191304872548858, -0.23367044077861274, 0.20081842146532305, 0.15152886608712982, 0.3021110052047947, 0.054006266981623204, 0.1466348305923951, 0.009795664920644877, 0.01092405286942457, -0.03217746156841776, -0.06219179843833973, 0.08301478427520759, 0.29855494716659536, 0.1439749748922538, 0.27722673947641324, -0.40537350360564023, -0.11417851500689637, 0.027271549184914937, 0.12343966390201172, 0.046657293038659314, -0.02587194491697605, -0.2640029514251753, 0.15007049339108688, -0.26902665745542753, -0.1077411420816599, -0.08996892895760708, 0.04211269061319357, -0.005136336405696564, -0.27081852079217517, -0.030886601364283367, -0.03893262962404595, 0.07269320048954944, -0.00728045925931182, -0.09357807399883736, 0.0572330555946263, 0.17104802772857594, -0.10453417373084745, 0.06403349456241961, 0.21215818251136603, -0.10697418327584084, -0.09233162809314943, 0.3539714304686979, -0.03092952045547061, -0.16474584141356308, 0.1561693926287685, -0.07663906181534362, -0.11377211194485426, 0.12910517710152752, 0.23802250383291826, 0.047688265038697525, -0.2053837714456888, 0.02856623493189122, 0.05402284421481539, 0.2225698559913178, 0.019814044291283504, 0.023327370309595797, 0.19692577538892714, 0.25277847959118527, 0.07978139231847815, 0.11777495666472025, -0.0773799868333045, -0.04246652661822736, -0.2681742669462205, -0.19365702697406198, -0.1688703000978675, 0.04632443557276802, -0.060590099108129264, -0.0956062600016594, 0.3657638541677274, 0.13691572097487487, 0.16135594884047372, 0.04133367309953238, 0.38041290998198957, 0.06642919909723406, 0.11615572357008797, 0.1390210285912766, 0.17060681790936477, 0.055976050667638, 0.20353684736534866, -0.1907949955155261, 0.04050491718293796, -0.03893011584498941] |
1,802.00725 | Path connectedness, local path connectedness and contractibility of
$\mathcal{S}_c(X)$ | The hyperspace of all nontrivial convergent sequences in a Hausdorff space
$X$ is denoted by $\mathcal{S}_c(X)$. This hyperspace is endowed with the
Vietoris topology. In connection with a question and a problem by
Garc\'ia-Ferreira, Ortiz-Castillo and Rojas-Hern\'andez, concerning conditions
under which $\mathcal S_c(X)$ is pathwise connected, in the current paper we
study the latter property and the contractibility of $\mathcal{S}_c(X)$. We
present necessary conditions on a space $X$ to obtain the path connectedness of
$\mathcal{S}_c(X)$. We also provide some sufficient conditions on a space $X$
to obtain such path connectedness. Further, we characterize the local path
connectedness of $\mathcal{S}_c(X)$ in terms of that of $X$. We prove the
contractibility of $\mathcal{S}_c(X)$ for a class of spaces and, finally, we
study the connectedness of Whitney blocks and Whitney levels for
$\mathcal{S}_c(X)$.
| math.GN | the hyperspace of all nontrivial convergent sequences in a hausdorff space x is denoted by mathcals_cx this hyperspace is endowed with the vietoris topology in connection with a question and a problem by garciaferreira ortizcastillo and rojashernandez concerning conditions under which mathcal s_cx is pathwise connected in the current paper we study the latter property and the contractibility of mathcals_cx we present necessary conditions on a space x to obtain the path connectedness of mathcals_cx we also provide some sufficient conditions on a space x to obtain such path connectedness further we characterize the local path connectedness of mathcals_cx in terms of that of x we prove the contractibility of mathcals_cx for a class of spaces and finally we study the connectedness of whitney blocks and whitney levels for mathcals_cx | [['the', 'hyperspace', 'of', 'all', 'nontrivial', 'convergent', 'sequences', 'in', 'a', 'hausdorff', 'space', 'x', 'is', 'denoted', 'by', 'mathcals_cx', 'this', 'hyperspace', 'is', 'endowed', 'with', 'the', 'vietoris', 'topology', 'in', 'connection', 'with', 'a', 'question', 'and', 'a', 'problem', 'by', 'garciaferreira', 'ortizcastillo', 'and', 'rojashernandez', 'concerning', 'conditions', 'under', 'which', 'mathcal', 's_cx', 'is', 'pathwise', 'connected', 'in', 'the', 'current', 'paper', 'we', 'study', 'the', 'latter', 'property', 'and', 'the', 'contractibility', 'of', 'mathcals_cx', 'we', 'present', 'necessary', 'conditions', 'on', 'a', 'space', 'x', 'to', 'obtain', 'the', 'path', 'connectedness', 'of', 'mathcals_cx', 'we', 'also', 'provide', 'some', 'sufficient', 'conditions', 'on', 'a', 'space', 'x', 'to', 'obtain', 'such', 'path', 'connectedness', 'further', 'we', 'characterize', 'the', 'local', 'path', 'connectedness', 'of', 'mathcals_cx', 'in', 'terms', 'of', 'that', 'of', 'x', 'we', 'prove', 'the', 'contractibility', 'of', 'mathcals_cx', 'for', 'a', 'class', 'of', 'spaces', 'and', 'finally', 'we', 'study', 'the', 'connectedness', 'of', 'whitney', 'blocks', 'and', 'whitney', 'levels', 'for', 'mathcals_cx']] | [-0.20711889282728618, 0.08130877167881968, -0.08023029080807016, 0.09019986596137572, -0.04788920042785601, -0.038910168090548654, 0.07276703285595151, 0.3932220901147677, -0.30001804023407974, -0.17369224917000303, 0.13033155822374212, -0.22930960166984451, -0.17603773095716652, 0.16089439287495155, -0.1759325601070976, -0.005669619651654592, 0.04778426268782753, 0.06732214760021844, -0.07978024226747668, -0.2701126968058256, 0.41084340477648834, -0.05439066827440491, 0.21907205403280947, 0.10844588043087591, 0.15755032251875561, 0.012168461926138172, 0.014284623901431377, 0.07519938219629693, -0.23276864374442643, 0.15748980085347564, 0.2101026094160401, 0.14741752989446888, 0.24040507735111394, -0.36153057290670965, -0.14726255979532232, 0.18493673286329096, 0.07277858398783092, -0.06985507339973432, 0.012818697462073312, -0.30638040005444334, 0.15047048014373735, -0.10216602749692706, -0.13792203379651674, -0.11013618713388076, 0.04131774322774548, 0.05144616744051186, -0.27485930791590363, -0.024436258132650088, 0.12552477194605252, 0.06906762048602104, -0.08507740064882315, -0.01792232441680076, -0.06146469492321977, 0.07937158800733204, 0.0041439865429240925, 0.06572328166892895, 0.027939216208715853, -0.07590540892516191, -0.09935180302440691, 0.33957755407676676, -0.04699600680883472, -0.2254652824342394, 0.16711990485111108, -0.17616569905613477, -0.19306443233329515, 0.08519590590149165, 0.08946810100370875, 0.17688496691676286, -0.11029325244375146, 0.1895957577413915, -0.11747050891415431, 0.06224712142004417, 0.07879861825360701, 0.11334934428405877, 0.07627189030166706, 0.16472643677933285, 0.1884164928530271, 0.18938466349545008, -0.009182517069320266, -0.0007557613412455584, -0.35365746207803916, -0.23243678582545657, -0.1237915197467933, 0.11929530034629772, -0.10656548406371327, -0.19863104390410277, 0.37685908873278934, 0.11105148542600755, 0.2066897269718958, 0.12242458040843933, 0.2049403302729703, 0.035724654658966196, -0.051935658470476764, 0.06885032564258346, 0.12051325237239675, 0.1783723139239905, 0.01198332290021846, -0.13963517931182512, 0.0562872016923323, 0.1892253554497774] |
1,802.00726 | Optical orientation and alignment of excitons in ensembles of inorganic
perovskite nanocrystals | We demonstrate the optical orientation and alignment of excitons in a
two-dimensional layer of CsPbI$_3$ perovskite nanocrystals prepared by
colloidal synthesis and measure the anisotropic exchange splitting of exciton
levels in the nanocrystals. From the experimental data at low temperature (2K),
we obtain the average value of anisotropic splitting of bright exciton states
of the order of 120{\mu}eV. Our calculations demonstrate that there is a
significant contribution to the splitting due to the nanocrystal shape
anisotropy for all inorganic perovskite nanocrystrals.
| cond-mat.mes-hall | we demonstrate the optical orientation and alignment of excitons in a twodimensional layer of cspbi_3 perovskite nanocrystals prepared by colloidal synthesis and measure the anisotropic exchange splitting of exciton levels in the nanocrystals from the experimental data at low temperature 2k we obtain the average value of anisotropic splitting of bright exciton states of the order of 120muev our calculations demonstrate that there is a significant contribution to the splitting due to the nanocrystal shape anisotropy for all inorganic perovskite nanocrystrals | [['we', 'demonstrate', 'the', 'optical', 'orientation', 'and', 'alignment', 'of', 'excitons', 'in', 'a', 'twodimensional', 'layer', 'of', 'cspbi_3', 'perovskite', 'nanocrystals', 'prepared', 'by', 'colloidal', 'synthesis', 'and', 'measure', 'the', 'anisotropic', 'exchange', 'splitting', 'of', 'exciton', 'levels', 'in', 'the', 'nanocrystals', 'from', 'the', 'experimental', 'data', 'at', 'low', 'temperature', '2k', 'we', 'obtain', 'the', 'average', 'value', 'of', 'anisotropic', 'splitting', 'of', 'bright', 'exciton', 'states', 'of', 'the', 'order', 'of', '120muev', 'our', 'calculations', 'demonstrate', 'that', 'there', 'is', 'a', 'significant', 'contribution', 'to', 'the', 'splitting', 'due', 'to', 'the', 'nanocrystal', 'shape', 'anisotropy', 'for', 'all', 'inorganic', 'perovskite', 'nanocrystrals']] | [-0.10308830444170516, 0.1726514114467781, -0.03001046417092409, 0.0037955319865524205, 0.040931108410623446, -0.08944113892679915, 0.05918758731818746, 0.45529286205014097, -0.2488410919904709, -0.33576468208545374, -0.012466549322221286, -0.3123527416853305, -0.08811225625391625, 0.1439612731661742, 0.046628674433295485, 0.012895089462163705, 0.02396131244994983, -0.09121114102817035, -0.06059065048252763, -0.18556479030271072, 0.28279849981205374, 0.022896214907022216, 0.3569111511512082, 0.13757457711462734, 0.09939874042137939, -0.014416678596429432, 0.12364588238157426, -0.02340534763245643, -0.15992098900865648, 0.16384009276207276, 0.24772373134199577, -0.09035532415809133, 0.19756694024287258, -0.3876998645453891, -0.17526622783817067, 0.02186767755760045, 0.13060300783077372, 0.18115231598715617, -0.1512072911556763, -0.24565399903804064, 0.07681348978370853, -0.10026482673350108, -0.087914216295021, -0.06543827184204813, -0.022879806830535962, 0.018701202283271507, -0.2507167229004487, 0.09326397583973181, 0.050617190714501124, 0.05308352641183279, -0.14477199834146642, -0.15855739554139797, -0.08880988078463022, 0.08168767562984855, 0.02876878503851498, 0.0034864077320958995, 0.17314630182742885, -0.10879096171901195, -0.11432902648149035, 0.4026938108845225, -0.0829176647025691, -0.08140681332708159, 0.11345597394282304, -0.20148079726208426, -0.053226648246327155, 0.19292971444658086, 0.14949098815316264, 0.14045131116916862, -0.07793373368161766, 0.061068355602792855, -0.006986986079453667, 0.2498074576635904, 0.03734497724784703, 0.08035691614156659, 0.21312972239979036, 0.17619837716787676, 0.04060285554939433, 0.1640406104181952, -0.13375552172501443, -0.05619129811743675, -0.16836772583236423, -0.20419419339940517, -0.2482400182501967, 0.09378434912171922, -0.11058836082502009, -0.20384134033907064, 0.44515844388523057, 0.10547669425229483, 0.17156239996275194, -0.03353833731358187, 0.24065697328423302, 0.06659567248314925, 0.09523942395956314, -0.025934995352467405, 0.2901561954471318, 0.15323921708284016, 0.09005906034402456, -0.32145532120691167, 0.0673316094281647, -0.026871268796628413] |
1,802.00727 | Hot carrier dynamics in plasmonic transition metal nitrides | Extraction of non-equilibrium hot carriers generated by plasmon decay in
metallic nanostructures is an increasingly exciting prospect for utilizing
plasmonic losses, but the search for optimum plasmonic materials with
long-lived carriers is ongoing. Transition metal nitrides are an exciting class
of new plasmonic materials with superior thermal and mechanical properties
compared to conventional noble metals, but their suitability for plasmonic hot
carrier applications remains unknown. Here, we present fully first-principles
calculations of the plasmonic response, hot carrier generation and subsequent
thermalization of all group IV, V and VI transition metal nitrides, fully
accounting for direct and phonon-assisted transitions as well as
electron-electron and electron-phonon scattering. We find the largest frequency
ranges for plasmonic response in ZrN, HfN and WN, between those of gold and
silver, while we predict strongest absorption in the visible spectrum for the
VN, NbN and TaN. Hot carrier generation is dominated by direct transitions for
most of the relevant energy range in all these nitrides, while phonon-assisted
processes dominate only below 1 eV plasmon energies primarily for the group IV
nitrides. Finally, we predict the maximum hot carrier lifetimes to be around 10
fs for group IV and VI nitrides, a factor of 3 - 4 smaller than noble metals,
due to strong electron-phonon scattering. However, we find longer carrier
lifetimes for group V nitrides, comparable to silver for NbN and TaN, while
exceeding 100 fs (twice that of silver) for VN, making them promising
candidates for efficient hot carrier extraction.
| cond-mat.mtrl-sci physics.comp-ph physics.optics | extraction of nonequilibrium hot carriers generated by plasmon decay in metallic nanostructures is an increasingly exciting prospect for utilizing plasmonic losses but the search for optimum plasmonic materials with longlived carriers is ongoing transition metal nitrides are an exciting class of new plasmonic materials with superior thermal and mechanical properties compared to conventional noble metals but their suitability for plasmonic hot carrier applications remains unknown here we present fully firstprinciples calculations of the plasmonic response hot carrier generation and subsequent thermalization of all group iv v and vi transition metal nitrides fully accounting for direct and phononassisted transitions as well as electronelectron and electronphonon scattering we find the largest frequency ranges for plasmonic response in zrn hfn and wn between those of gold and silver while we predict strongest absorption in the visible spectrum for the vn nbn and tan hot carrier generation is dominated by direct transitions for most of the relevant energy range in all these nitrides while phononassisted processes dominate only below 1 ev plasmon energies primarily for the group iv nitrides finally we predict the maximum hot carrier lifetimes to be around 10 fs for group iv and vi nitrides a factor of 3 4 smaller than noble metals due to strong electronphonon scattering however we find longer carrier lifetimes for group v nitrides comparable to silver for nbn and tan while exceeding 100 fs twice that of silver for vn making them promising candidates for efficient hot carrier extraction | [['extraction', 'of', 'nonequilibrium', 'hot', 'carriers', 'generated', 'by', 'plasmon', 'decay', 'in', 'metallic', 'nanostructures', 'is', 'an', 'increasingly', 'exciting', 'prospect', 'for', 'utilizing', 'plasmonic', 'losses', 'but', 'the', 'search', 'for', 'optimum', 'plasmonic', 'materials', 'with', 'longlived', 'carriers', 'is', 'ongoing', 'transition', 'metal', 'nitrides', 'are', 'an', 'exciting', 'class', 'of', 'new', 'plasmonic', 'materials', 'with', 'superior', 'thermal', 'and', 'mechanical', 'properties', 'compared', 'to', 'conventional', 'noble', 'metals', 'but', 'their', 'suitability', 'for', 'plasmonic', 'hot', 'carrier', 'applications', 'remains', 'unknown', 'here', 'we', 'present', 'fully', 'firstprinciples', 'calculations', 'of', 'the', 'plasmonic', 'response', 'hot', 'carrier', 'generation', 'and', 'subsequent', 'thermalization', 'of', 'all', 'group', 'iv', 'v', 'and', 'vi', 'transition', 'metal', 'nitrides', 'fully', 'accounting', 'for', 'direct', 'and', 'phononassisted', 'transitions', 'as', 'well', 'as', 'electronelectron', 'and', 'electronphonon', 'scattering', 'we', 'find', 'the', 'largest', 'frequency', 'ranges', 'for', 'plasmonic', 'response', 'in', 'zrn', 'hfn', 'and', 'wn', 'between', 'those', 'of', 'gold', 'and', 'silver', 'while', 'we', 'predict', 'strongest', 'absorption', 'in', 'the', 'visible', 'spectrum', 'for', 'the', 'vn', 'nbn', 'and', 'tan', 'hot', 'carrier', 'generation', 'is', 'dominated', 'by', 'direct', 'transitions', 'for', 'most', 'of', 'the', 'relevant', 'energy', 'range', 'in', 'all', 'these', 'nitrides', 'while', 'phononassisted', 'processes', 'dominate', 'only', 'below', '1', 'ev', 'plasmon', 'energies', 'primarily', 'for', 'the', 'group', 'iv', 'nitrides', 'finally', 'we', 'predict', 'the', 'maximum', 'hot', 'carrier', 'lifetimes', 'to', 'be', 'around', '10', 'fs', 'for', 'group', 'iv', 'and', 'vi', 'nitrides', 'a', 'factor', 'of', '3', '4', 'smaller', 'than', 'noble', 'metals', 'due', 'to', 'strong', 'electronphonon', 'scattering', 'however', 'we', 'find', 'longer', 'carrier', 'lifetimes', 'for', 'group', 'v', 'nitrides', 'comparable', 'to', 'silver', 'for', 'nbn', 'and', 'tan', 'while', 'exceeding', '100', 'fs', 'twice', 'that', 'of', 'silver', 'for', 'vn', 'making', 'them', 'promising', 'candidates', 'for', 'efficient', 'hot', 'carrier', 'extraction']] | [-0.07286671646698913, 0.21492680368411116, 0.05172095407796718, 0.02987321998497479, -0.029229450327741196, -0.19169537472294368, 0.10353334982412844, 0.47330980375409126, -0.22600603944165862, -0.29461512518364397, -0.010005828183999315, -0.3602378515900708, -0.10933775201508561, 0.22205565621614548, 0.0635224130914974, 0.029322705060055385, -0.011658985841423884, -0.11524114573229348, -0.06289375895542688, -0.15552787047326105, 0.24125127811900904, 0.046914341903413787, 0.29513593924901693, 0.12541512998126803, -0.02039384758710617, -0.007430296464723947, 0.06904673106876798, -0.050260406079106645, -0.13400632328441253, 0.08931605998411409, 0.31643945648006666, -0.06411008563533914, 0.22527546079096492, -0.4282180498827432, -0.24465384465960985, 0.010512633132748306, 0.16450675490234032, 0.11578809627671496, -0.13243946908461693, -0.2287543739333413, 0.11656363444883742, -0.1457005504644705, -0.09317322288302048, -0.048340116654232636, 0.07338887974610322, 0.008216853647399313, -0.24280067395917942, 0.08582032412065377, 0.02302877408438973, 0.04580783154349655, -0.07569407583805962, -0.17408146372744354, -0.04151461779456738, 0.038019934153856065, 0.011706939529146632, -0.040505864208499276, 0.22222464788871146, -0.1480090534390851, -0.0762370937097375, 0.42655821220918755, -0.10680533983210554, 0.015126308855661725, 0.2241960694463771, -0.1794569160002971, -0.019242506682277335, 0.23750643018388845, 0.12328105138950661, 0.14521858867326537, -0.1317143302547295, 0.03336036284921737, 0.04495458796510156, 0.15908138489171283, 0.07697910938572261, 0.172922827727085, 0.23162613500942109, 0.23430242335622306, 0.0064377531544763415, 0.042209572234614676, -0.09630366924352902, 0.03032895872182381, -0.18904380686581135, -0.20322021752496663, -0.1935549351800859, 0.059034908921305154, -0.06727378368084262, -0.17843815573246874, 0.38108300919583465, 0.12653791440696624, 0.1484944727023697, -0.013880803047480886, 0.24915671525007785, 0.10015168909119923, 0.0964410740177941, 0.05469379791814345, 0.28875190391754885, 0.16020374535487536, 0.06520671474835148, -0.2668477908944803, 0.06281826498185392, -0.015017493431395317] |
1,802.00728 | Measuring Spark on AWS: A Case Study on Mining Scientific Publications
with Annotation Query | Annotation Query (AQ) is a program that provides the ability to query many
different types of NLP annotations on a text, as well as the original content
and structure of the text. The query results may provide new annotations, or
they may select subsets of the content and annotations for deeper processing.
Like GATE's Mimir, AQ is based on region algebras. Our AQ is implemented to run
on a Spark cluster. In this paper we look at how AQ's runtimes are affected by
the size of the collection, the number of nodes in the cluster, the type of
node, and the characteristics of the queries. Cluster size, of course, makes a
large difference in performance so long as skew can be avoided. We find that
there is minimal difference in performance when persisting annotations
serialized to local SSD drives as opposed to deserialized into local memory. We
also find that if the number of nodes is kept constant, then AWS'
storage-optimized instance performs the best. But if we factor in total cost,
the compute-optimized nodes provides the best performance relative to cost.
| cs.DC | annotation query aq is a program that provides the ability to query many different types of nlp annotations on a text as well as the original content and structure of the text the query results may provide new annotations or they may select subsets of the content and annotations for deeper processing like gates mimir aq is based on region algebras our aq is implemented to run on a spark cluster in this paper we look at how aqs runtimes are affected by the size of the collection the number of nodes in the cluster the type of node and the characteristics of the queries cluster size of course makes a large difference in performance so long as skew can be avoided we find that there is minimal difference in performance when persisting annotations serialized to local ssd drives as opposed to deserialized into local memory we also find that if the number of nodes is kept constant then aws storageoptimized instance performs the best but if we factor in total cost the computeoptimized nodes provides the best performance relative to cost | [['annotation', 'query', 'aq', 'is', 'a', 'program', 'that', 'provides', 'the', 'ability', 'to', 'query', 'many', 'different', 'types', 'of', 'nlp', 'annotations', 'on', 'a', 'text', 'as', 'well', 'as', 'the', 'original', 'content', 'and', 'structure', 'of', 'the', 'text', 'the', 'query', 'results', 'may', 'provide', 'new', 'annotations', 'or', 'they', 'may', 'select', 'subsets', 'of', 'the', 'content', 'and', 'annotations', 'for', 'deeper', 'processing', 'like', 'gates', 'mimir', 'aq', 'is', 'based', 'on', 'region', 'algebras', 'our', 'aq', 'is', 'implemented', 'to', 'run', 'on', 'a', 'spark', 'cluster', 'in', 'this', 'paper', 'we', 'look', 'at', 'how', 'aqs', 'runtimes', 'are', 'affected', 'by', 'the', 'size', 'of', 'the', 'collection', 'the', 'number', 'of', 'nodes', 'in', 'the', 'cluster', 'the', 'type', 'of', 'node', 'and', 'the', 'characteristics', 'of', 'the', 'queries', 'cluster', 'size', 'of', 'course', 'makes', 'a', 'large', 'difference', 'in', 'performance', 'so', 'long', 'as', 'skew', 'can', 'be', 'avoided', 'we', 'find', 'that', 'there', 'is', 'minimal', 'difference', 'in', 'performance', 'when', 'persisting', 'annotations', 'serialized', 'to', 'local', 'ssd', 'drives', 'as', 'opposed', 'to', 'deserialized', 'into', 'local', 'memory', 'we', 'also', 'find', 'that', 'if', 'the', 'number', 'of', 'nodes', 'is', 'kept', 'constant', 'then', 'aws', 'storageoptimized', 'instance', 'performs', 'the', 'best', 'but', 'if', 'we', 'factor', 'in', 'total', 'cost', 'the', 'computeoptimized', 'nodes', 'provides', 'the', 'best', 'performance', 'relative', 'to', 'cost']] | [-0.11392082226093254, 0.05147713859300207, -0.04615232989181603, 0.06858087908840796, -0.10232308016330337, -0.12408826823538825, 0.09656849228868042, 0.403402306823653, -0.2919491199807748, -0.3515479063287419, 0.06776508791619319, -0.2882192324893809, -0.08294523089952434, 0.18866771239886196, -0.11655231655914175, 0.01189840221894624, 0.09170511948184094, 0.10458683601451138, -0.044613953270883085, -0.3170687309661412, 0.27969764729613156, 0.07810679602426315, 0.25176570325694436, 0.03460477938219988, 0.05305322085171626, -0.03699877675181754, -0.021583586961470606, 0.043997087578325635, -0.0636846176016534, 0.09271673708191588, 0.28905515754127137, 0.21448299901913748, 0.2886937294980022, -0.4151985169201049, -0.13326933143943986, 0.07511631759305032, 0.1676378597286868, 0.09214459116669507, -0.028224545993384326, -0.258559565848083, 0.13080618674632724, -0.146392772585549, -0.027311222994564798, -0.06816320661091188, 0.051273841421281156, 0.034513305734801394, -0.264206496247171, 0.024560988256831357, 0.05585616107402641, 0.03184451836333012, -0.0011064883571263798, -0.11161170281240894, -0.015005801281470327, 0.1775406194512938, 0.005644189183438957, 0.054514348764472004, 0.1529458167822251, -0.14883954629858737, -0.11886311085847878, 0.3986545407600888, -0.033426433788643704, -0.19403989673279975, 0.20854601376220408, -0.09297798585417218, -0.13847256311366346, 0.08929256238979834, 0.1815960674218875, 0.0710288406207939, -0.1223362083254966, 0.07605227143224069, -0.03906458720835394, 0.23876708768068827, 0.08277435838531016, 0.07156605608228012, 0.16012842676279723, 0.19780930893348697, 0.06392850716404523, 0.1673691359864985, -0.08900355258774449, -0.05010083344811834, -0.27564958866305816, -0.17421747979775654, -0.18586367656419564, 0.01021876478536502, -0.11915099776361994, -0.17607968401517615, 0.38142553127927487, 0.17654716046448984, 0.21430799893660252, 0.07577731944204376, 0.2995678571432662, 0.04729670726280535, 0.13404113572453769, 0.13589595738790575, 0.1521189495213538, 0.008119946799641632, 0.09810094608972109, -0.17448144481912797, 0.10757967525853791, 0.05090716571089234] |
1,802.00729 | The two-time distribution in geometric last-passage percolation | We study the two-time distribution in directed last passage percolation with
geometric weights in the first quadrant. We compute the scaling limit and show
that it is given by a contour integral of a Fredholm determinant.
| math.PR math-ph math.MP | we study the twotime distribution in directed last passage percolation with geometric weights in the first quadrant we compute the scaling limit and show that it is given by a contour integral of a fredholm determinant | [['we', 'study', 'the', 'twotime', 'distribution', 'in', 'directed', 'last', 'passage', 'percolation', 'with', 'geometric', 'weights', 'in', 'the', 'first', 'quadrant', 'we', 'compute', 'the', 'scaling', 'limit', 'and', 'show', 'that', 'it', 'is', 'given', 'by', 'a', 'contour', 'integral', 'of', 'a', 'fredholm', 'determinant']] | [-0.11733739186699192, 0.08501317367578547, -0.105761549461426, 0.05756189975848732, -0.03366923580567042, -0.043496073081365064, 0.021502660380469427, 0.41249334522419506, -0.2815802891596427, -0.19467357432262766, 0.10473073961394322, -0.27536341708360446, -0.24124610408519706, 0.12032541720610526, -0.023213847760214575, 0.07652657877446876, 0.06666887969347751, 0.06655176620309551, -0.0736833019893513, -0.2223284792724169, 0.3455349080678489, -0.017601531361126237, 0.19760041520930827, 0.07217333325146076, 0.11312339465156482, 0.05928911457562612, -0.03352655211670531, 0.0009774690907862452, -0.19693079353540574, 0.10087096786850856, 0.19215683201521946, 0.028993724974700145, 0.2349480177767368, -0.38067198353302145, -0.1743320588591612, 0.1424482465825147, 0.15668754949648347, 0.05588987392062942, 0.025526082660588954, -0.2791616074844367, 0.04569653213062944, -0.15466818565295803, -0.16434639225351727, -0.017963091558259394, 0.08264768661724196, 0.06625656084442097, -0.23455639576746357, 0.07083732702044977, 0.04613815951678488, 0.027261422377907567, -0.004942966327588592, -0.0668058271985501, 0.04551481866898636, 0.14985388099578106, -0.01916265598265454, 0.011150110571179539, 0.10221248966020842, -0.14928137552407053, -0.135999316504846, 0.3082446826899993, -0.08388379568027125, -0.1741090295318928, 0.04679868233183192, -0.24747672975839427, -0.20133767610726258, 0.1237240598226587, 0.08460549728220536, 0.13836495647491473, -0.16113365314797395, 0.09431864209828847, -0.07706649298779666, 0.09576706220913264, 0.07983441255055368, -0.09079505424273925, 0.14722003898997274, 0.14189158581818143, 0.11578717849786496, 0.21954090075774324, -0.11938794223695165, -0.16469408776093689, -0.3524923953227699, -0.2276498801333623, -0.29529091600690865, 0.09243137993487632, -0.15646763131654653, -0.21375908236950636, 0.3943548875136508, 0.1790003119709177, 0.2558850260554916, 0.18511981048181447, 0.21295098362800977, 0.2613100475767472, 0.04451801208779216, 0.09708688725044744, 0.16963518421269125, 0.16288687879245523, 0.09510888684760882, -0.17708170148802715, 0.04164452709826744, 0.20225518605568343] |
1,802.0073 | Etching of Photon Energy into Binding Energy in Depositing Carbon Films
at Different Chamber Pressures | A hot filament chemical vapor deposition is an attractive technique to
deposit carbon films of different applications. In this technique, it is also
feasible to study the influence of chamber pressure in the deposition of carbon
films. In the deposition chamber, having dissociated from the methane
precursor, gaseous carbon atoms first convert into the graphite state atoms and
then into the diamond state atoms. An increase in the chamber pressure changes
the morphology and structure of the deposited carbon films. The growth rate of
the deposited carbon film increases by increasing the chamber pressure from 3.3
kPa to 8.6 kPa. The rate of converting gaseous carbon atoms into diamond atoms
also increases. At 11.3 kPa and 14 kPa chamber pressure, gaseous carbon atoms
convert into graphite state atoms at a high rate. The gas activation and gas
collision processes vary broadly at varying chamber pressure. The morphology
and structure of carbon films got deposited at different growth rates. The
dissociation of molecular hydrogen into atomic hydrogen varies by varying the
chamber pressure. Atomic hydrogen etched the photons released from the hot
filaments. Thus, bits of differently shaped energy result. Gaseous carbon atoms
convert into graphite and diamond state atoms under suitably shaped bits of
energy. Graphite state atoms bind under the same involved bits, which is not
the case when the diamond state atoms bind. The study sets a new trend in
depositing, characterizing, and analyzing carbon films.
| cond-mat.mtrl-sci | a hot filament chemical vapor deposition is an attractive technique to deposit carbon films of different applications in this technique it is also feasible to study the influence of chamber pressure in the deposition of carbon films in the deposition chamber having dissociated from the methane precursor gaseous carbon atoms first convert into the graphite state atoms and then into the diamond state atoms an increase in the chamber pressure changes the morphology and structure of the deposited carbon films the growth rate of the deposited carbon film increases by increasing the chamber pressure from 33 kpa to 86 kpa the rate of converting gaseous carbon atoms into diamond atoms also increases at 113 kpa and 14 kpa chamber pressure gaseous carbon atoms convert into graphite state atoms at a high rate the gas activation and gas collision processes vary broadly at varying chamber pressure the morphology and structure of carbon films got deposited at different growth rates the dissociation of molecular hydrogen into atomic hydrogen varies by varying the chamber pressure atomic hydrogen etched the photons released from the hot filaments thus bits of differently shaped energy result gaseous carbon atoms convert into graphite and diamond state atoms under suitably shaped bits of energy graphite state atoms bind under the same involved bits which is not the case when the diamond state atoms bind the study sets a new trend in depositing characterizing and analyzing carbon films | [['a', 'hot', 'filament', 'chemical', 'vapor', 'deposition', 'is', 'an', 'attractive', 'technique', 'to', 'deposit', 'carbon', 'films', 'of', 'different', 'applications', 'in', 'this', 'technique', 'it', 'is', 'also', 'feasible', 'to', 'study', 'the', 'influence', 'of', 'chamber', 'pressure', 'in', 'the', 'deposition', 'of', 'carbon', 'films', 'in', 'the', 'deposition', 'chamber', 'having', 'dissociated', 'from', 'the', 'methane', 'precursor', 'gaseous', 'carbon', 'atoms', 'first', 'convert', 'into', 'the', 'graphite', 'state', 'atoms', 'and', 'then', 'into', 'the', 'diamond', 'state', 'atoms', 'an', 'increase', 'in', 'the', 'chamber', 'pressure', 'changes', 'the', 'morphology', 'and', 'structure', 'of', 'the', 'deposited', 'carbon', 'films', 'the', 'growth', 'rate', 'of', 'the', 'deposited', 'carbon', 'film', 'increases', 'by', 'increasing', 'the', 'chamber', 'pressure', 'from', '33', 'kpa', 'to', '86', 'kpa', 'the', 'rate', 'of', 'converting', 'gaseous', 'carbon', 'atoms', 'into', 'diamond', 'atoms', 'also', 'increases', 'at', '113', 'kpa', 'and', '14', 'kpa', 'chamber', 'pressure', 'gaseous', 'carbon', 'atoms', 'convert', 'into', 'graphite', 'state', 'atoms', 'at', 'a', 'high', 'rate', 'the', 'gas', 'activation', 'and', 'gas', 'collision', 'processes', 'vary', 'broadly', 'at', 'varying', 'chamber', 'pressure', 'the', 'morphology', 'and', 'structure', 'of', 'carbon', 'films', 'got', 'deposited', 'at', 'different', 'growth', 'rates', 'the', 'dissociation', 'of', 'molecular', 'hydrogen', 'into', 'atomic', 'hydrogen', 'varies', 'by', 'varying', 'the', 'chamber', 'pressure', 'atomic', 'hydrogen', 'etched', 'the', 'photons', 'released', 'from', 'the', 'hot', 'filaments', 'thus', 'bits', 'of', 'differently', 'shaped', 'energy', 'result', 'gaseous', 'carbon', 'atoms', 'convert', 'into', 'graphite', 'and', 'diamond', 'state', 'atoms', 'under', 'suitably', 'shaped', 'bits', 'of', 'energy', 'graphite', 'state', 'atoms', 'bind', 'under', 'the', 'same', 'involved', 'bits', 'which', 'is', 'not', 'the', 'case', 'when', 'the', 'diamond', 'state', 'atoms', 'bind', 'the', 'study', 'sets', 'a', 'new', 'trend', 'in', 'depositing', 'characterizing', 'and', 'analyzing', 'carbon', 'films']] | [-0.018469503885545933, 0.25906357039786004, -0.021544541259679723, -0.07859272053470139, 0.09317602346721693, -0.12690667239283876, 0.11799438868574955, 0.43581631012699185, -0.28336311916687656, -0.3014502701204771, -0.011497557629388953, -0.3186445651740274, 0.06704930480992218, 0.1263441831179691, 0.03565065634432992, -0.012929277546031737, 0.04611410150116607, -0.11890505707407949, -0.04613281810800975, -0.26642905722544413, 0.2304386906873654, 0.13227922003031434, 0.33736421651512133, 0.09812136694442622, 0.10176780448929101, -0.10913356306117435, 0.08565352767698091, -0.04124473033183325, -0.17240566336706342, 0.0698362225772113, 0.19128383192118303, -0.039788155450618694, 0.19603350707877645, -0.5636062267776422, -0.2251581029199502, 0.025099505981461715, 0.11022996596851144, 0.11332004228870955, -0.0995863592883126, -0.23478143387904563, -0.006088424074862685, -0.14041387744369221, -0.11583659750753779, 0.034390595910812435, 0.03595606169096945, 0.03352081716430428, -0.2135692424372723, 0.05602749774380227, 0.020195075977219958, 0.05543954748642717, -0.16095346095384794, -0.14888895131029314, -0.110125128355879, 0.03368176849514438, -0.021228788975242746, 0.03590350589096671, 0.3791013610052305, -0.08476671277439739, 0.046349854034395156, 0.4030655955097505, -0.0932629546845144, -0.04032149310654201, 0.20908205144052558, -0.16147517968368316, -0.05066601718710383, 0.26449448317817625, 0.14961935832173007, 0.09470548396812704, -0.16663583369609877, -0.007985419372415576, -0.012849600218674716, 0.22253727321532563, 0.21737484776360147, 0.036515764947863245, 0.23007624491094417, 0.21685744086065242, 0.0280692276115404, 0.2022451391862314, -0.12464022269362912, -0.01288333408213651, -0.1752531054202749, -0.2731334273478392, -0.1696546317465572, 0.05569396268566845, -0.06606725722062451, -0.1652679820584149, 0.3057329053305747, 0.014549838676422584, 0.1846838867910081, -0.11555215718416388, 0.2775994331787239, 0.013416399208813155, 0.08226123550895038, 0.0018299831754426245, 0.21934726033085847, 0.21461481042401945, 0.13091887510968608, -0.2541663824167776, 0.11679030656071082, -0.003867159251264539] |
1,802.00731 | A unified approach to ruin probabilities with delays for spectrally
negative L\'evy processes | In this paper, we unify two popular approaches for the definition of
actuarial ruin with implementation delays, also known as Parisian ruin. Our new
definition of ruin includes both deterministic delays and exponentially
distributed delays: ruin is declared the first time an excursion in the red
zone lasts longer than an implementation delay with a deterministic and a
stochastic component. For this Parisian ruin with mixed delays, we identify the
joint distribution of the time of ruin and the deficit at ruin, therefore
providing generalizations of many results previously obtained, such as in
\cite{baurdoux_et_al_2015} and \cite{loeffenetal2017} for the case of an
exponential delay and that of a deterministic delay, respectively.
| math.PR | in this paper we unify two popular approaches for the definition of actuarial ruin with implementation delays also known as parisian ruin our new definition of ruin includes both deterministic delays and exponentially distributed delays ruin is declared the first time an excursion in the red zone lasts longer than an implementation delay with a deterministic and a stochastic component for this parisian ruin with mixed delays we identify the joint distribution of the time of ruin and the deficit at ruin therefore providing generalizations of many results previously obtained such as in citebaurdoux_et_al_2015 and citeloeffenetal2017 for the case of an exponential delay and that of a deterministic delay respectively | [['in', 'this', 'paper', 'we', 'unify', 'two', 'popular', 'approaches', 'for', 'the', 'definition', 'of', 'actuarial', 'ruin', 'with', 'implementation', 'delays', 'also', 'known', 'as', 'parisian', 'ruin', 'our', 'new', 'definition', 'of', 'ruin', 'includes', 'both', 'deterministic', 'delays', 'and', 'exponentially', 'distributed', 'delays', 'ruin', 'is', 'declared', 'the', 'first', 'time', 'an', 'excursion', 'in', 'the', 'red', 'zone', 'lasts', 'longer', 'than', 'an', 'implementation', 'delay', 'with', 'a', 'deterministic', 'and', 'a', 'stochastic', 'component', 'for', 'this', 'parisian', 'ruin', 'with', 'mixed', 'delays', 'we', 'identify', 'the', 'joint', 'distribution', 'of', 'the', 'time', 'of', 'ruin', 'and', 'the', 'deficit', 'at', 'ruin', 'therefore', 'providing', 'generalizations', 'of', 'many', 'results', 'previously', 'obtained', 'such', 'as', 'in', 'citebaurdoux_et_al_2015', 'and', 'citeloeffenetal2017', 'for', 'the', 'case', 'of', 'an', 'exponential', 'delay', 'and', 'that', 'of', 'a', 'deterministic', 'delay', 'respectively']] | [-0.1114606083051681, 0.08075261071334588, -0.080115437727525, 0.09469895664477479, -0.03684042377776846, -0.12775008239421165, 0.10935358926589187, 0.37891125598738046, -0.244698008043795, -0.26908742508816497, 0.14719856759917024, -0.2318226424287315, -0.12230739923607972, 0.18583147710672132, -0.15246553789324094, 0.07705082613284941, 0.010581400866309801, 0.026922197883120842, -0.009090650499005008, -0.26792861256506983, 0.2644477027341189, 0.07985485941861514, 0.20433876335758855, 0.025763989581416052, 0.0991956586000958, 0.018914766001722053, -0.04573151283828473, -0.03750680254651578, -0.12646992598517195, 0.026777665906896193, 0.25541301968472974, 0.15273595957464917, 0.3593570945905177, -0.449270854341901, -0.21348383178539937, 0.17361092714148713, 0.13067531846954134, 0.11229805537408942, -0.06268968047677642, -0.312272525778368, 0.0012898725129801918, -0.2102818193466023, -0.13349908263599328, 0.05939121826344894, 0.07433355688893546, 0.056480345514568465, -0.2801987751779422, 0.10940257400566393, 0.0499583856564843, -0.02325079058021031, -0.05816337912067495, -0.11771686163868893, 0.07975995374834854, 0.1256235467692561, 0.10419531394856879, -0.04076522415831547, 0.040678417849078496, -0.0895326948698817, -0.19496354167522104, 0.33368722744355045, -0.1038285297654511, -0.1346524242070262, 0.11145738736053722, -0.11320991144101653, -0.1572125904365546, 0.13146127191268736, 0.1673329708519978, 0.13455630917343553, -0.14974635479868287, 0.028468688283249288, 0.013658362798634227, 0.11100757775690269, 0.13260497512399322, 0.060629387976843176, 0.10421041239708385, 0.2127261989387787, 0.14489928148288056, 0.13429112382948882, -0.06954577754475866, -0.19796916539780796, -0.37777683663147466, -0.18046737100532348, -0.15521635679114196, 0.04621363666632937, -0.10017433069165067, -0.20033911009388114, 0.36922767378079396, 0.1480375927402983, 0.18109926392100062, 0.27391583829497296, 0.3054465056500501, 0.20469895178016653, -0.03425639132210226, 0.10068739942377121, 0.14393630600965548, 0.06100877858180967, 0.1390408209947593, -0.2064129350732805, 0.1501666844964752, -0.014077560286279078] |
1,802.00732 | Holonomic and perverse logarithmic D-modules | We introduce the notion of a holonomic D-module on a smooth (idealized)
logarithmic scheme and show that Verdier duality can be extended to this
context. In contrast to the classical case, the pushforward of a holonomic
module along an open immersion is in general not holonomic. We introduce a
"perverse" t-structure on the category of coherent logarithmic D-modules which
makes the dualizing functor t-exact on holonomic modules. This allows us to
transfer some of the formalism from the classical setting and in particular
show that every holonomic module on an open subscheme can be extended to a
holonomic module on the whole space. Conversely this t-exactness characterizes
holonomic modules among all coherent logarithmic D-modules. We also introduce
logarithmic versions of the Gabber and Kashiwara-Malgrange filtrations.
| math.AG | we introduce the notion of a holonomic dmodule on a smooth idealized logarithmic scheme and show that verdier duality can be extended to this context in contrast to the classical case the pushforward of a holonomic module along an open immersion is in general not holonomic we introduce a perverse tstructure on the category of coherent logarithmic dmodules which makes the dualizing functor texact on holonomic modules this allows us to transfer some of the formalism from the classical setting and in particular show that every holonomic module on an open subscheme can be extended to a holonomic module on the whole space conversely this texactness characterizes holonomic modules among all coherent logarithmic dmodules we also introduce logarithmic versions of the gabber and kashiwaramalgrange filtrations | [['we', 'introduce', 'the', 'notion', 'of', 'a', 'holonomic', 'dmodule', 'on', 'a', 'smooth', 'idealized', 'logarithmic', 'scheme', 'and', 'show', 'that', 'verdier', 'duality', 'can', 'be', 'extended', 'to', 'this', 'context', 'in', 'contrast', 'to', 'the', 'classical', 'case', 'the', 'pushforward', 'of', 'a', 'holonomic', 'module', 'along', 'an', 'open', 'immersion', 'is', 'in', 'general', 'not', 'holonomic', 'we', 'introduce', 'a', 'perverse', 'tstructure', 'on', 'the', 'category', 'of', 'coherent', 'logarithmic', 'dmodules', 'which', 'makes', 'the', 'dualizing', 'functor', 'texact', 'on', 'holonomic', 'modules', 'this', 'allows', 'us', 'to', 'transfer', 'some', 'of', 'the', 'formalism', 'from', 'the', 'classical', 'setting', 'and', 'in', 'particular', 'show', 'that', 'every', 'holonomic', 'module', 'on', 'an', 'open', 'subscheme', 'can', 'be', 'extended', 'to', 'a', 'holonomic', 'module', 'on', 'the', 'whole', 'space', 'conversely', 'this', 'texactness', 'characterizes', 'holonomic', 'modules', 'among', 'all', 'coherent', 'logarithmic', 'dmodules', 'we', 'also', 'introduce', 'logarithmic', 'versions', 'of', 'the', 'gabber', 'and', 'kashiwaramalgrange', 'filtrations']] | [-0.20331484696925467, 0.012706398063821853, -0.13530595722465566, 0.09983439650198805, -0.08665997534614778, -0.15240105008330918, -0.01990197274003989, 0.3486517404596652, -0.41397227084774885, -0.1478167392253395, 0.06084522940011906, -0.11249772942826367, -0.19747447083523917, 0.24991253504319297, -0.2674444341851819, -0.020127784535889665, 0.08518535476140378, 0.061900073865188227, -0.06737687857657287, -0.28006127869687797, 0.4338871008235841, -0.006774835498823273, 0.24953951464305002, 0.05208730206058751, 0.16904068973305966, 0.04505513193491366, 0.03010134795500386, -0.025950760569568018, -0.14007434266914648, 0.18342541784025548, 0.28242242916096605, 0.08078904812329359, 0.2045118882238204, -0.4016831541129279, -0.08269616000113948, 0.16617506646340893, 0.1204393973260472, 0.0908137442508427, 0.02229090618634326, -0.30479647908472424, 0.09870904381386936, -0.2357282259186069, -0.0924965554844558, -0.11778103416004489, 0.03289553199353958, 0.011078211140909022, -0.22764613265134093, -0.04036519218883064, 0.04741278773684415, 0.06199098296553617, -0.09009377038033094, 0.032465430172798675, -0.02909233264677647, 0.021873979367345812, -0.11195538548805241, 0.08624849133869453, 0.16288584651333476, -0.1033099802424981, -0.13337682122965494, 0.3375063905071828, -0.07860961702892617, -0.25643753272954434, 0.16583089704715437, -0.13968796403177322, -0.13848706530482177, 0.07151059591541847, 0.024818932006676352, 0.15944315310973192, -0.021678913035430014, 0.21339416759879132, -0.11428720989985572, 0.08886196563253179, 0.08528670156374574, 0.04921444672049068, 0.118132587169267, 0.08176305752074826, 0.07801507921859381, 0.16047301116932725, -0.025987462108699424, -0.09826804763982974, -0.3817224749814599, -0.2646460150715704, -0.04581189133140499, 0.1362892285219606, -0.044925270853362294, -0.16904456628816983, 0.4193862539654982, 0.13265066538588144, 0.20417594706879988, 0.1521069114781811, 0.30495848528470004, 0.06500660264564137, 0.06958174828304758, 0.03445648093662795, 0.14960720301572902, 0.2095576734357183, -0.0065858429222698175, -0.1444742506737971, -0.0171153424195044, 0.17918713631919556] |
1,802.00733 | A Mathematical Framework for Resilience: Dynamics, Uncertainties,
Strategies and Recovery Regimes | Resilience is a rehashed concept in natural hazard management - resilience of
cities to earthquakes, to floods, to fire, etc. In a word, a system is said to
be resilient if there exists a strategy that can drive the system state back to
"normal" after any perturbation. What formal flesh can we put on such a
malleable notion? We propose to frame the concept of resilience in the
mathematical garbs of control theory under uncertainty. Our setting covers
dynamical systems both in discrete or continuous time, deterministic or subject
to uncertainties. We will say that a system state is resilient if there exists
an adaptive strategy such that the generated state and control paths,
contingent on uncertainties, lay within an acceptable domain of random
processes, called recovery regimes. We point out how such recovery regimes can
be delineated thanks to so called risk measures, making the connection with
resilience indicators. Our definition of resilience extends others, be they "`
a la Holling" or rooted in viability theory. Indeed, our definition of
resilience is a form of controlability for whole random processes (regimes),
whereas others require that the state values must belong to an acceptable
subset of the state set.
| math.OC | resilience is a rehashed concept in natural hazard management resilience of cities to earthquakes to floods to fire etc in a word a system is said to be resilient if there exists a strategy that can drive the system state back to normal after any perturbation what formal flesh can we put on such a malleable notion we propose to frame the concept of resilience in the mathematical garbs of control theory under uncertainty our setting covers dynamical systems both in discrete or continuous time deterministic or subject to uncertainties we will say that a system state is resilient if there exists an adaptive strategy such that the generated state and control paths contingent on uncertainties lay within an acceptable domain of random processes called recovery regimes we point out how such recovery regimes can be delineated thanks to so called risk measures making the connection with resilience indicators our definition of resilience extends others be they a la holling or rooted in viability theory indeed our definition of resilience is a form of controlability for whole random processes regimes whereas others require that the state values must belong to an acceptable subset of the state set | [['resilience', 'is', 'a', 'rehashed', 'concept', 'in', 'natural', 'hazard', 'management', 'resilience', 'of', 'cities', 'to', 'earthquakes', 'to', 'floods', 'to', 'fire', 'etc', 'in', 'a', 'word', 'a', 'system', 'is', 'said', 'to', 'be', 'resilient', 'if', 'there', 'exists', 'a', 'strategy', 'that', 'can', 'drive', 'the', 'system', 'state', 'back', 'to', 'normal', 'after', 'any', 'perturbation', 'what', 'formal', 'flesh', 'can', 'we', 'put', 'on', 'such', 'a', 'malleable', 'notion', 'we', 'propose', 'to', 'frame', 'the', 'concept', 'of', 'resilience', 'in', 'the', 'mathematical', 'garbs', 'of', 'control', 'theory', 'under', 'uncertainty', 'our', 'setting', 'covers', 'dynamical', 'systems', 'both', 'in', 'discrete', 'or', 'continuous', 'time', 'deterministic', 'or', 'subject', 'to', 'uncertainties', 'we', 'will', 'say', 'that', 'a', 'system', 'state', 'is', 'resilient', 'if', 'there', 'exists', 'an', 'adaptive', 'strategy', 'such', 'that', 'the', 'generated', 'state', 'and', 'control', 'paths', 'contingent', 'on', 'uncertainties', 'lay', 'within', 'an', 'acceptable', 'domain', 'of', 'random', 'processes', 'called', 'recovery', 'regimes', 'we', 'point', 'out', 'how', 'such', 'recovery', 'regimes', 'can', 'be', 'delineated', 'thanks', 'to', 'so', 'called', 'risk', 'measures', 'making', 'the', 'connection', 'with', 'resilience', 'indicators', 'our', 'definition', 'of', 'resilience', 'extends', 'others', 'be', 'they', 'a', 'la', 'holling', 'or', 'rooted', 'in', 'viability', 'theory', 'indeed', 'our', 'definition', 'of', 'resilience', 'is', 'a', 'form', 'of', 'controlability', 'for', 'whole', 'random', 'processes', 'regimes', 'whereas', 'others', 'require', 'that', 'the', 'state', 'values', 'must', 'belong', 'to', 'an', 'acceptable', 'subset', 'of', 'the', 'state', 'set']] | [-0.14113552788538591, 0.12286800170596154, -0.1225625349405312, 0.06383356185658473, -0.07207603657817734, -0.13187819354209993, 0.1189769768709678, 0.3697370183701646, -0.2958267953066269, -0.2221595151164291, 0.12391950991848122, -0.2612325765444346, -0.16919351617534817, 0.16569473127934284, -0.16620168975454622, 0.03855679329784352, 0.037031523794249385, 0.043236692902888646, -0.007127970590717064, -0.22372265671836022, 0.3075100767304209, 0.04754385375655351, 0.2833085101506464, 0.008459544206948057, 0.09836480364545572, -0.02149259498015008, 0.019322603689126517, 0.0617699435049649, -0.10808821386085676, 0.06037007900411073, 0.29389518599158954, 0.198021723841298, 0.3525298312163855, -0.4184652671636063, -0.22327306196188593, 0.1525258935467644, 0.09056119668554058, 0.08140096319981907, -0.006856480092451699, -0.2764423421812149, 0.0913895160483662, -0.19171577424246922, -0.13987154796736181, -0.09624037777468068, 0.02999565588804532, -0.0014501916890849872, -0.2925965855170127, 0.015156990382820368, 0.08156362361990674, 0.032189508707604696, -0.030893903565403, -0.04812933243300328, -0.021591072968012482, 0.13267528470985743, 0.004332093106183622, 0.03152723251651896, 0.14795698366666626, -0.09241152483238173, -0.12876534604049306, 0.38872826684323347, -0.03201543146979577, -0.23480145806655744, 0.1947730715500609, -0.08660240250010619, -0.1458449100419803, 0.08360248738341508, 0.17684359797270616, 0.05451433226105054, -0.14733303267534284, 0.051166437837421155, -0.01983970091963301, 0.18749135719420393, 0.04420427498954101, 0.04918368111782688, 0.18192502451889522, 0.18317136430889558, 0.1436483561564997, 0.10082666538905219, -0.028597494950209155, -0.13332243201474905, -0.29276016740869654, -0.10660604637695895, -0.11928620823297878, 0.06767995623819416, -0.053960736432841536, -0.19816238792347057, 0.3690000882132302, 0.19500970498335604, 0.15208740869765075, 0.061808303192766305, 0.25892805408244496, 0.10767272340820697, 0.03620679178797849, 0.0908914515950565, 0.20041576677895323, 0.0720005851721258, 0.056411022655380776, -0.1450640930210915, 0.14916821462529883, 0.03290971442914511] |
1,802.00734 | Unveiling Galaxy Bias via the Halo Model, KiDS and GAMA | We measure the projected galaxy clustering and galaxy-galaxy lensing signals
using the Galaxy And Mass Assembly (GAMA) survey and Kilo-Degree Survey (KiDS)
to study galaxy bias. We use the concept of non-linear and stochastic galaxy
biasing in the framework of halo occupation statistics to constrain the
parameters of the halo occupation statistics and to unveil the origin of galaxy
biasing. The bias function $\Gamma_{\text{gm}}(r_{\text{p}})$, where
$r_{\text{p}}$ is the projected comoving separation, is evaluated using the
analytical halo model from which the scale dependence of
$\Gamma_{\text{gm}}(r_{\text{p}})$, and the origin of the non-linearity and
stochasticity in halo occupation models can be inferred. Our observations
unveil the physical reason for the non-linearity and stochasticity, further
explored using hydrodynamical simulations, with the stochasticity mostly
originating from the non-Poissonian behaviour of satellite galaxies in the dark
matter haloes and their spatial distribution, which does not follow the spatial
distribution of dark matter in the halo. The observed non-linearity is mostly
due to the presence of the central galaxies, as was noted from previous
theoretical work on the same topic. We also see that overall, more massive
galaxies reveal a stronger scale dependence, and out to a larger radius. Our
results show that a wealth of information about galaxy bias is hidden in halo
occupation models. These models should therefore be used to determine the
influence of galaxy bias in cosmological studies.
| astro-ph.CO | we measure the projected galaxy clustering and galaxygalaxy lensing signals using the galaxy and mass assembly gama survey and kilodegree survey kids to study galaxy bias we use the concept of nonlinear and stochastic galaxy biasing in the framework of halo occupation statistics to constrain the parameters of the halo occupation statistics and to unveil the origin of galaxy biasing the bias function gamma_textgmr_textp where r_textp is the projected comoving separation is evaluated using the analytical halo model from which the scale dependence of gamma_textgmr_textp and the origin of the nonlinearity and stochasticity in halo occupation models can be inferred our observations unveil the physical reason for the nonlinearity and stochasticity further explored using hydrodynamical simulations with the stochasticity mostly originating from the nonpoissonian behaviour of satellite galaxies in the dark matter haloes and their spatial distribution which does not follow the spatial distribution of dark matter in the halo the observed nonlinearity is mostly due to the presence of the central galaxies as was noted from previous theoretical work on the same topic we also see that overall more massive galaxies reveal a stronger scale dependence and out to a larger radius our results show that a wealth of information about galaxy bias is hidden in halo occupation models these models should therefore be used to determine the influence of galaxy bias in cosmological studies | [['we', 'measure', 'the', 'projected', 'galaxy', 'clustering', 'and', 'galaxygalaxy', 'lensing', 'signals', 'using', 'the', 'galaxy', 'and', 'mass', 'assembly', 'gama', 'survey', 'and', 'kilodegree', 'survey', 'kids', 'to', 'study', 'galaxy', 'bias', 'we', 'use', 'the', 'concept', 'of', 'nonlinear', 'and', 'stochastic', 'galaxy', 'biasing', 'in', 'the', 'framework', 'of', 'halo', 'occupation', 'statistics', 'to', 'constrain', 'the', 'parameters', 'of', 'the', 'halo', 'occupation', 'statistics', 'and', 'to', 'unveil', 'the', 'origin', 'of', 'galaxy', 'biasing', 'the', 'bias', 'function', 'gamma_textgmr_textp', 'where', 'r_textp', 'is', 'the', 'projected', 'comoving', 'separation', 'is', 'evaluated', 'using', 'the', 'analytical', 'halo', 'model', 'from', 'which', 'the', 'scale', 'dependence', 'of', 'gamma_textgmr_textp', 'and', 'the', 'origin', 'of', 'the', 'nonlinearity', 'and', 'stochasticity', 'in', 'halo', 'occupation', 'models', 'can', 'be', 'inferred', 'our', 'observations', 'unveil', 'the', 'physical', 'reason', 'for', 'the', 'nonlinearity', 'and', 'stochasticity', 'further', 'explored', 'using', 'hydrodynamical', 'simulations', 'with', 'the', 'stochasticity', 'mostly', 'originating', 'from', 'the', 'nonpoissonian', 'behaviour', 'of', 'satellite', 'galaxies', 'in', 'the', 'dark', 'matter', 'haloes', 'and', 'their', 'spatial', 'distribution', 'which', 'does', 'not', 'follow', 'the', 'spatial', 'distribution', 'of', 'dark', 'matter', 'in', 'the', 'halo', 'the', 'observed', 'nonlinearity', 'is', 'mostly', 'due', 'to', 'the', 'presence', 'of', 'the', 'central', 'galaxies', 'as', 'was', 'noted', 'from', 'previous', 'theoretical', 'work', 'on', 'the', 'same', 'topic', 'we', 'also', 'see', 'that', 'overall', 'more', 'massive', 'galaxies', 'reveal', 'a', 'stronger', 'scale', 'dependence', 'and', 'out', 'to', 'a', 'larger', 'radius', 'our', 'results', 'show', 'that', 'a', 'wealth', 'of', 'information', 'about', 'galaxy', 'bias', 'is', 'hidden', 'in', 'halo', 'occupation', 'models', 'these', 'models', 'should', 'therefore', 'be', 'used', 'to', 'determine', 'the', 'influence', 'of', 'galaxy', 'bias', 'in', 'cosmological', 'studies']] | [-0.0591586238104875, 0.04928497810656803, -0.14720362671401485, 0.14955822616528686, -0.13326345766004774, -0.017769955886511264, -0.006951165011352194, 0.36165669292677194, -0.19661205288347056, -0.3838388036736952, 0.014019307922613475, -0.2784867006017261, -0.07991740538688775, 0.17341952323061247, 0.022324986917997842, -0.008565631170703065, -0.005855893723492045, -0.06876465114536197, -0.027828358760286522, -0.2882987573472552, 0.3335885206802881, 0.10017276734496201, 0.23177055660718388, -0.011192147104468728, 0.10229706195241306, -0.042297131581498046, -0.10992518545286398, 0.005395738014028341, -0.17591929350529817, 0.026022526917846074, 0.19643810046661006, 0.12364154985178695, 0.2654296446624877, -0.36718041839360793, -0.22729162295166003, 0.11330542971654722, 0.2062676694725139, 0.11612164846155792, -0.09181421940677735, -0.308843073418497, 0.06309328575337401, -0.17875478157241428, -0.12889509143237124, 0.035232721943819864, -0.022463110942875834, 0.08045710145026012, -0.22264629846696543, 0.19880803158373186, 0.04449805466408309, 0.042978245932317805, -0.03859817023242483, -0.0814939822796857, -0.06822905717334445, 0.10117787629808715, 0.058178104283017874, 0.022471206712257948, 0.225583856366159, -0.17551183988273675, -0.01766801649604791, 0.40355114875377956, -0.05298223345536306, -0.09672844368781496, 0.1789370363247664, -0.22706884267660957, -0.17405026982513455, 0.030477691897041432, 0.18797937786855204, 0.044448033688240685, -0.16160499036777765, 0.05095800249286445, -0.016522930946978574, 0.2458974122658089, 0.0029630447024828754, 0.03328156168098368, 0.3052574081479439, 0.11316022542138983, 0.07935678850065285, 0.06916026560741427, -0.17941766028213482, -0.07495967707291129, -0.23056556202599104, -0.06359854398864886, -0.2033918267822758, 0.06070682343027199, -0.12916845026003493, -0.11541244252501721, 0.39311742874373784, 0.19567924852474658, 0.2455028648181334, 0.08782280159981123, 0.30794909570665496, 0.09118799707721337, 0.10660864154124283, 0.02492151936374804, 0.2702904478937853, 0.17520985721681168, 0.04875894606032359, -0.2673025261860208, 0.0662122539797565, -0.05567995954853749] |
1,802.00735 | Regularized $\kappa$-distributions with non-diverging moments | For various plasma applications the so-called (non-relativistic)
$\kappa$-distribution is widely used to reproduce and interpret the
suprathermal particle populations exhibiting a power-law distribution in
velocity or energy. Despite its reputation the standard $\kappa$-distribution
as a concept is still disputable, mainly due to the velocity moments $M_{l}$
which make possible a macroscopic characterization, but whose existence is
restricted only to low orders $l < 2\kappa-1$. In fact, the definition of the
$\kappa$-distribution itself is conditioned by the existence of the moment of
order $l=2$ (i.e., kinetic temperature) satisfied only for $\kappa > 3/2$. In
order to resolve these critical limitations we introduce the regularized
$\kappa$-distribution with non-diverging moments. For the evaluation of all
velocity moments a general analytical expression is provided enabling a
significant step towards a macroscopic (fluid-like) description of space
plasmas, and, in general, any system of $\kappa$-distributed particles.
| physics.plasm-ph physics.space-ph | for various plasma applications the socalled nonrelativistic kappadistribution is widely used to reproduce and interpret the suprathermal particle populations exhibiting a powerlaw distribution in velocity or energy despite its reputation the standard kappadistribution as a concept is still disputable mainly due to the velocity moments m_l which make possible a macroscopic characterization but whose existence is restricted only to low orders l 2kappa1 in fact the definition of the kappadistribution itself is conditioned by the existence of the moment of order l2 ie kinetic temperature satisfied only for kappa 32 in order to resolve these critical limitations we introduce the regularized kappadistribution with nondiverging moments for the evaluation of all velocity moments a general analytical expression is provided enabling a significant step towards a macroscopic fluidlike description of space plasmas and in general any system of kappadistributed particles | [['for', 'various', 'plasma', 'applications', 'the', 'socalled', 'nonrelativistic', 'kappadistribution', 'is', 'widely', 'used', 'to', 'reproduce', 'and', 'interpret', 'the', 'suprathermal', 'particle', 'populations', 'exhibiting', 'a', 'powerlaw', 'distribution', 'in', 'velocity', 'or', 'energy', 'despite', 'its', 'reputation', 'the', 'standard', 'kappadistribution', 'as', 'a', 'concept', 'is', 'still', 'disputable', 'mainly', 'due', 'to', 'the', 'velocity', 'moments', 'm_l', 'which', 'make', 'possible', 'a', 'macroscopic', 'characterization', 'but', 'whose', 'existence', 'is', 'restricted', 'only', 'to', 'low', 'orders', 'l', '2kappa1', 'in', 'fact', 'the', 'definition', 'of', 'the', 'kappadistribution', 'itself', 'is', 'conditioned', 'by', 'the', 'existence', 'of', 'the', 'moment', 'of', 'order', 'l2', 'ie', 'kinetic', 'temperature', 'satisfied', 'only', 'for', 'kappa', '32', 'in', 'order', 'to', 'resolve', 'these', 'critical', 'limitations', 'we', 'introduce', 'the', 'regularized', 'kappadistribution', 'with', 'nondiverging', 'moments', 'for', 'the', 'evaluation', 'of', 'all', 'velocity', 'moments', 'a', 'general', 'analytical', 'expression', 'is', 'provided', 'enabling', 'a', 'significant', 'step', 'towards', 'a', 'macroscopic', 'fluidlike', 'description', 'of', 'space', 'plasmas', 'and', 'in', 'general', 'any', 'system', 'of', 'kappadistributed', 'particles']] | [-0.11505507482011823, 0.16584062788730664, -0.07040910084942614, 0.10609804067750508, -0.06982095354325037, -0.10691963396898478, 0.003906318377006636, 0.3181620425864184, -0.22954993186702094, -0.29092408888667387, 0.05365834468091926, -0.2403887698331671, -0.047440478357116365, 0.1692846876519807, -0.020688056842516706, 0.05798478072711409, 0.004311611547889392, 0.05548687536697699, -0.03671911485063211, -0.1692529991150147, 0.2975728296144546, 0.0660880575055107, 0.2541539551142984, 0.06898261106702207, 0.11331005597038425, -0.0347829802390052, -0.0015830456663303784, 0.03985677266822292, -0.12902530958656355, 0.10871397577656133, 0.20247677072243642, 0.04955660336460565, 0.26160349565461266, -0.3819602653248249, -0.22176696140366695, 0.1038993500975253, 0.165508574875833, 0.08891752071382926, -0.02179136854276931, -0.2357635940968936, 0.051304306942004246, -0.16610342033384165, -0.2163022548337569, -0.09600049911668511, 0.058900893290262046, 0.05010308976536685, -0.28792149045021975, 0.12560503930533237, 0.09805540110997475, 0.04811357773405357, -0.06784014772865106, -0.12004507106412746, -0.004504258160642518, 0.07395133794027034, 0.0690867111994375, 0.023388928828937727, 0.12434752710353937, -0.14466608095579325, -0.050899185474798846, 0.41206463146954775, -0.04526246377491277, -0.18454434520762114, 0.20478465488982678, -0.19128838439478818, -0.11859810528392992, 0.14537219340610488, 0.12603406883592644, 0.10358735623966603, -0.16839014138536948, 0.07578729494941339, -0.020522126489502454, 0.1612255990124532, 0.06955949409123864, 0.04100118435487613, 0.21662755882117665, 0.13187757233857944, 0.06344226576782165, 0.09016843779389848, -0.0785656541919023, -0.10870084892253112, -0.3101476102312823, -0.16832891155848362, -0.20761576929914827, 0.06144137236197907, -0.0754290266715782, -0.19999403225761042, 0.3641352540623043, 0.1489700889248863, 0.19865641152880487, 0.04501854955392081, 0.31138617730271206, 0.1649709513239277, 0.0337107061156935, 0.07281454335422302, 0.2285394291631388, 0.16394021578411824, 0.11119344583916457, -0.19917922748089598, 0.10310211005437113, 0.07155680465070109] |
1,802.00736 | From Quantum Foundations to Applications and Back | Quantum non-locality has been an extremely fruitful subject of research,
leading the scientific revolution towards quantum information science, in
particular to device-independent quantum information processing. We argue that
time is ripe to work on another basic problem in the foundations of quantum
physics, the quantum measurement problem, that should produce good physics both
in theoretical, mathematical, experimental and applied physics. We briefly
review how quantum non-locality contributed to physics (including some
outstanding open problems) and suggest ways in which questions around
Macroscopic Quantumness could equally contribute to all aspects of physics.
| quant-ph | quantum nonlocality has been an extremely fruitful subject of research leading the scientific revolution towards quantum information science in particular to deviceindependent quantum information processing we argue that time is ripe to work on another basic problem in the foundations of quantum physics the quantum measurement problem that should produce good physics both in theoretical mathematical experimental and applied physics we briefly review how quantum nonlocality contributed to physics including some outstanding open problems and suggest ways in which questions around macroscopic quantumness could equally contribute to all aspects of physics | [['quantum', 'nonlocality', 'has', 'been', 'an', 'extremely', 'fruitful', 'subject', 'of', 'research', 'leading', 'the', 'scientific', 'revolution', 'towards', 'quantum', 'information', 'science', 'in', 'particular', 'to', 'deviceindependent', 'quantum', 'information', 'processing', 'we', 'argue', 'that', 'time', 'is', 'ripe', 'to', 'work', 'on', 'another', 'basic', 'problem', 'in', 'the', 'foundations', 'of', 'quantum', 'physics', 'the', 'quantum', 'measurement', 'problem', 'that', 'should', 'produce', 'good', 'physics', 'both', 'in', 'theoretical', 'mathematical', 'experimental', 'and', 'applied', 'physics', 'we', 'briefly', 'review', 'how', 'quantum', 'nonlocality', 'contributed', 'to', 'physics', 'including', 'some', 'outstanding', 'open', 'problems', 'and', 'suggest', 'ways', 'in', 'which', 'questions', 'around', 'macroscopic', 'quantumness', 'could', 'equally', 'contribute', 'to', 'all', 'aspects', 'of', 'physics']] | [-0.047481092977450116, 0.15528938260871616, -0.12427097250410653, 0.1123118023605567, -0.11082697745187434, -0.19575895096820134, -0.00101745273447135, 0.29248879627826124, -0.29399167784684144, -0.33535809540650346, 0.05238127780586972, -0.29220918150475395, -0.16898243795891016, 0.2711931133622324, -0.11691515235119428, 0.1333478479799661, 0.06158233906659247, 0.015928025162973248, -0.028197824791237548, -0.29778374211253744, 0.2526249458404401, 0.08895874599373521, 0.29080188230376, 0.16317547669450005, 0.04411576193972276, -0.03304410099491968, -0.03320384745557721, -0.00045546469698240467, -0.16663578853531164, 0.15183147580035358, 0.3874251171639496, 0.18821961209331486, 0.3593294718763331, -0.4838996228076272, -0.23654087198959603, 0.046969562055092756, 0.14289370257468834, 0.16666294473119767, -0.11406288992045549, -0.2907476451882458, -0.020163181099073533, -0.1200818857894494, -0.1192679800256923, -0.1012824950893256, 0.05253534808058988, -0.10737642111604685, -0.10927178962463206, 0.05496638600463764, 0.06753012764646293, 0.06410662077653867, 0.03135875326576182, -0.09231938304543331, 0.14442868905837883, 0.15283703382874092, 0.007838448107877111, 0.03234916413970455, 0.13149591530724378, -0.1765773309711981, -0.24545024071339067, 0.43394278517954954, 0.03880122136631674, -0.1524595159187831, 0.1989634356737792, -0.1373007169817216, -0.22368668515112375, -0.03246251218389351, 0.17811620693428667, 0.00967130420031026, -0.15607582811000092, 0.09525071983967631, -0.007320642179635527, 0.14489227839218513, 0.004063297984200519, 0.15115525070475516, 0.31719785370956083, 0.14584928174544085, 0.032594054292600885, 0.10898927392650416, -0.02404963449769459, -0.23907688642330058, -0.323006707640201, -0.1809000291830891, -0.16805038565467878, 0.11758432027648438, 0.019062076788971323, -0.11058605696678489, 0.4037277501199272, 0.2464014180925685, 0.10054179144879946, -0.10116138739977032, 0.2610825622597566, 0.01626843026747088, 0.01352403736622124, 0.036841162270610475, 0.2804073768294964, 0.1650646110474654, 0.14424793769677097, -0.17679240286432124, 0.07664267547878918, -0.023628960414738446] |
1,802.00737 | Survey of astrophysical conditions in neutrino-driven supernova ejecta
nucleosynthesis | Core-collapse supernovae produce elements between Fe and Ag depending on the
properties of the ejected matter. Despite the fast progress in supernova
simulations in the last decades, there are still uncertainties in the
astrophysical conditions. In this paper we investigate the impact of
astrophysical uncertainties on the nucleosynthesis. Since a systematic study
based on trajectories from hydrodynamic simulations is computationally very
expensive, we rely on a steady-state model. By varying the mass and radius of
the proto-neutron star as well as electron fraction in the steady-state model,
we cover a wide range of astrophysical conditions. In our study, we find four
abundance patterns which can be formed in neutron-rich neutrino-driven ejecta.
This provides a unique template of trajectories that can be used to investigate
the impact of nuclear physics input on the nucleosynthesis for representative
astrophysical conditions. Furthermore, we link these four patterns to the
neutron-to-seed and alpha-to-seed ratios at $T=3$~GK. Therefore, our results
give a good overview of the potential nucleosynthesis evolution which can occur
in a supernova simulation.
| astro-ph.HE astro-ph.SR | corecollapse supernovae produce elements between fe and ag depending on the properties of the ejected matter despite the fast progress in supernova simulations in the last decades there are still uncertainties in the astrophysical conditions in this paper we investigate the impact of astrophysical uncertainties on the nucleosynthesis since a systematic study based on trajectories from hydrodynamic simulations is computationally very expensive we rely on a steadystate model by varying the mass and radius of the protoneutron star as well as electron fraction in the steadystate model we cover a wide range of astrophysical conditions in our study we find four abundance patterns which can be formed in neutronrich neutrinodriven ejecta this provides a unique template of trajectories that can be used to investigate the impact of nuclear physics input on the nucleosynthesis for representative astrophysical conditions furthermore we link these four patterns to the neutrontoseed and alphatoseed ratios at t3gk therefore our results give a good overview of the potential nucleosynthesis evolution which can occur in a supernova simulation | [['corecollapse', 'supernovae', 'produce', 'elements', 'between', 'fe', 'and', 'ag', 'depending', 'on', 'the', 'properties', 'of', 'the', 'ejected', 'matter', 'despite', 'the', 'fast', 'progress', 'in', 'supernova', 'simulations', 'in', 'the', 'last', 'decades', 'there', 'are', 'still', 'uncertainties', 'in', 'the', 'astrophysical', 'conditions', 'in', 'this', 'paper', 'we', 'investigate', 'the', 'impact', 'of', 'astrophysical', 'uncertainties', 'on', 'the', 'nucleosynthesis', 'since', 'a', 'systematic', 'study', 'based', 'on', 'trajectories', 'from', 'hydrodynamic', 'simulations', 'is', 'computationally', 'very', 'expensive', 'we', 'rely', 'on', 'a', 'steadystate', 'model', 'by', 'varying', 'the', 'mass', 'and', 'radius', 'of', 'the', 'protoneutron', 'star', 'as', 'well', 'as', 'electron', 'fraction', 'in', 'the', 'steadystate', 'model', 'we', 'cover', 'a', 'wide', 'range', 'of', 'astrophysical', 'conditions', 'in', 'our', 'study', 'we', 'find', 'four', 'abundance', 'patterns', 'which', 'can', 'be', 'formed', 'in', 'neutronrich', 'neutrinodriven', 'ejecta', 'this', 'provides', 'a', 'unique', 'template', 'of', 'trajectories', 'that', 'can', 'be', 'used', 'to', 'investigate', 'the', 'impact', 'of', 'nuclear', 'physics', 'input', 'on', 'the', 'nucleosynthesis', 'for', 'representative', 'astrophysical', 'conditions', 'furthermore', 'we', 'link', 'these', 'four', 'patterns', 'to', 'the', 'neutrontoseed', 'and', 'alphatoseed', 'ratios', 'at', 't3gk', 'therefore', 'our', 'results', 'give', 'a', 'good', 'overview', 'of', 'the', 'potential', 'nucleosynthesis', 'evolution', 'which', 'can', 'occur', 'in', 'a', 'supernova', 'simulation']] | [-0.06745310157116148, 0.12042529953898684, -0.08005945021120299, 0.1086892216442807, -0.046863871043786365, -0.029891168094417525, 0.03643064240306904, 0.3780331070967285, -0.22014865625671864, -0.33356102715091157, 0.07317975954772139, -0.24588104992705798, -0.07442778514398794, 0.25016285493204904, -0.01560526606049063, 0.005842840010050817, 0.14515953441150486, -0.02339201634805206, -0.12286502447733212, -0.22982996325091726, 0.31799304933242856, 0.09015919741553564, 0.2044825383151571, 0.05217495083897596, 0.03876328521402597, -0.09746523169174214, -0.0392061387357812, -0.012174408998578742, -0.18752618583905478, 0.04242750812894277, 0.22109921112288639, 0.16348012533160813, 0.20383017593329505, -0.471545709618589, -0.2552583145412167, 0.10774976239883385, 0.16585118101821059, 0.1225309931975235, -0.13154124912121223, -0.23241621680305494, 0.06645121576106508, -0.21173066933572823, -0.1046774523842725, -0.017054567648474836, 0.011519882218202665, 0.08033460773073048, -0.265512105199464, 0.06689688281178297, -0.002604535397646638, 0.03447799660664584, -0.04716224626394078, -0.09905385406177845, -0.011269799947816258, 0.10170162171873796, 0.06707659947347738, -0.02974236042479918, 0.14859853355890318, -0.13990267758934005, -0.020373389415908605, 0.454401567051675, -0.05565953168219754, -0.11680326766162623, 0.2136568385411963, -0.17486542963334137, -0.1770419725604976, 0.12769441450862878, 0.22166188274111068, 0.13896750213877698, -0.15249591835752307, 0.036969584533792274, -0.03601167124482648, 0.1555926450749948, 0.029104306914156212, 0.040732496050536394, 0.28196974207752473, 0.22244585922453552, -0.005633026594296098, 0.0690917631034695, -0.13395509066010294, -0.07475628144484722, -0.291533676547087, -0.0956980252213682, -0.1120964250370716, 0.095924982301464, -0.09156890987902616, -0.15644671864131288, 0.38846136702756795, 0.1650250304595656, 0.20722404079112625, -0.0374605991320485, 0.2723769637855834, 0.03485814639480807, 0.014056382484601013, 0.07572734511978481, 0.304946612037297, 0.14423817544039116, 0.09859995143917677, -0.25845589041793054, 0.12561702268015193, 0.04005357751018545] |
1,802.00738 | $4$-index theory of gravity and its relation with the violation of the
energy-momentum conservation law | Recently, a $4$-index generalization of the Einstein theory is proposed by
Moulin (Eur. Phys. J. C 77, 878 (2017)). Using this method, we find the most
general $2$-index field equations derivable from the Einstein-Hilbert action.
The application of Newtonian limit, the role of gravitational coupling constant
and the effects of the properties of ordinary energy-momentum tensor in
obtaining a $4$-index gravity theory have been studied. We also address the
results of building Weyl free $4$-index gravity theory. Our study displays that
both the Einstein and Rastall theories can be obtained as the subclasses of a
$4$-index gravity theory which shows the power of $4$-index method in unifying
various gravitational theories. It is also obtained that the violation of the
energy-momentum conservation law may be allowed in $4$-index gravity theory,
and moreover, the contraction of $4$-index theory generally admits a
non-minimal coupling between geometry and matter field in the Rastall way. This
study also shows that, unlike the Einstein case, the gravitational coupling
constant of $4$-index Rastall theory generally differs from that of the
ordinary $2$-index Rastall theory.
| physics.gen-ph | recently a 4index generalization of the einstein theory is proposed by moulin eur phys j c 77 878 2017 using this method we find the most general 2index field equations derivable from the einsteinhilbert action the application of newtonian limit the role of gravitational coupling constant and the effects of the properties of ordinary energymomentum tensor in obtaining a 4index gravity theory have been studied we also address the results of building weyl free 4index gravity theory our study displays that both the einstein and rastall theories can be obtained as the subclasses of a 4index gravity theory which shows the power of 4index method in unifying various gravitational theories it is also obtained that the violation of the energymomentum conservation law may be allowed in 4index gravity theory and moreover the contraction of 4index theory generally admits a nonminimal coupling between geometry and matter field in the rastall way this study also shows that unlike the einstein case the gravitational coupling constant of 4index rastall theory generally differs from that of the ordinary 2index rastall theory | [['recently', 'a', '4index', 'generalization', 'of', 'the', 'einstein', 'theory', 'is', 'proposed', 'by', 'moulin', 'eur', 'phys', 'j', 'c', '77', '878', '2017', 'using', 'this', 'method', 'we', 'find', 'the', 'most', 'general', '2index', 'field', 'equations', 'derivable', 'from', 'the', 'einsteinhilbert', 'action', 'the', 'application', 'of', 'newtonian', 'limit', 'the', 'role', 'of', 'gravitational', 'coupling', 'constant', 'and', 'the', 'effects', 'of', 'the', 'properties', 'of', 'ordinary', 'energymomentum', 'tensor', 'in', 'obtaining', 'a', '4index', 'gravity', 'theory', 'have', 'been', 'studied', 'we', 'also', 'address', 'the', 'results', 'of', 'building', 'weyl', 'free', '4index', 'gravity', 'theory', 'our', 'study', 'displays', 'that', 'both', 'the', 'einstein', 'and', 'rastall', 'theories', 'can', 'be', 'obtained', 'as', 'the', 'subclasses', 'of', 'a', '4index', 'gravity', 'theory', 'which', 'shows', 'the', 'power', 'of', '4index', 'method', 'in', 'unifying', 'various', 'gravitational', 'theories', 'it', 'is', 'also', 'obtained', 'that', 'the', 'violation', 'of', 'the', 'energymomentum', 'conservation', 'law', 'may', 'be', 'allowed', 'in', '4index', 'gravity', 'theory', 'and', 'moreover', 'the', 'contraction', 'of', '4index', 'theory', 'generally', 'admits', 'a', 'nonminimal', 'coupling', 'between', 'geometry', 'and', 'matter', 'field', 'in', 'the', 'rastall', 'way', 'this', 'study', 'also', 'shows', 'that', 'unlike', 'the', 'einstein', 'case', 'the', 'gravitational', 'coupling', 'constant', 'of', '4index', 'rastall', 'theory', 'generally', 'differs', 'from', 'that', 'of', 'the', 'ordinary', '2index', 'rastall', 'theory']] | [-0.15197302264787552, 0.10860281586278714, -0.1292710426989627, 0.05362287622555501, -0.09906907049191874, -0.1342760298169602, -0.05244326135038403, 0.22787471590721506, -0.18944892317574935, -0.30294530975532397, 0.007910170692340129, -0.24859962894418144, -0.2144945544311724, 0.14735263990077827, -0.04221961498628818, -0.017368564757749984, -0.04068279831465018, 0.049092979031604436, -0.09962210502201892, -0.23881654939640545, 0.32143706692603685, 0.05900856124047758, 0.26506549399296786, 0.05838880067333411, 0.08813571288134629, -0.005667694825889532, -0.020908505161224448, 0.11828950135363529, -0.1569474402074847, 0.08847383102454708, 0.19545301762251657, 0.0990741335442237, 0.21810407067601711, -0.3927547093375591, -0.27810263995996726, 0.0591183421780792, 0.0634989757235504, 0.16061809610793798, -0.046521686922527304, -0.3015623448119304, 0.03345897481224294, -0.23403784161759802, -0.14235215871673773, -0.07528161267502664, 0.05002215778912907, -0.056367240559393905, -0.22531690156497694, 0.1268309641106246, 0.05465286530259639, 0.002104334123212302, -0.08399353524812071, -0.07542521415980753, -0.020082354118737083, 0.039116021624561084, 0.11585832193314945, 0.07104227591916329, 0.10763028649992104, -0.14810266772595546, -0.09268842168457511, 0.42798238243423614, -0.1461799703314795, -0.2113475124377989, 0.13899022089790994, -0.13551147624397766, -0.1589871938208823, 0.0555136778186691, 0.0766239336923312, 0.16985516780337068, -0.13856323515617494, 0.22838824928874982, -0.058431127521677714, 0.11711202321921364, 0.1188023025959225, 0.024705631128646495, 0.25155860677001063, 0.05408408429136889, -0.00874211713224439, 0.08776865552816182, 0.0007265709540517317, -0.13104904581934718, -0.3712316402313063, -0.16427959707739243, -0.1386771401940282, 0.09401222083607089, -0.1390434501710411, -0.14779167645479327, 0.33006576156127926, 0.14744873846931078, 0.060761832850814226, 0.06950877970255553, 0.21648387232595412, 0.1368331776630649, 0.06163724725289891, 0.07093705708360941, 0.36612022726002047, 0.24678693197030932, 0.09980028516239366, -0.25564608889260976, -0.07487663649033102, 0.13932879389986189] |
1,802.00739 | Nonlinearities induced by parametric resonance in effectively 1D atomic
Bose condensates | We present a numerical study of the dynamical effects following a sudden
change of the transverse trapping frequency in an elongated Bose-Einstein
condensate, which induces periodic oscillations of the radial density. At early
times, we observe an exponential growth of the number of resonant longitudinal
phonons, in agreement with the predictions of the Bogoliubov-de Gennes
treatment. We then observe an ordered sequence of phenomena induced by the
nonlinearities of the system. The first is a loss of the nonseparability of the
resonant phonon pairs. This is followed by the saturation of the exponential
growth and a strong depletion of condensed atoms. Notably, these effects are
well-described by effective 1D dynamics, and are hardly affected by the damping
of the radial oscillations. Finally, the atomic spectrum becomes broad,
featureless and almost incoherent, in agreement with experimental results. The
link between this sequence of events and the preheating scenario in
inflationary cosmology is striking, as is the similarity of techniques used to
study them.
| cond-mat.quant-gas gr-qc | we present a numerical study of the dynamical effects following a sudden change of the transverse trapping frequency in an elongated boseeinstein condensate which induces periodic oscillations of the radial density at early times we observe an exponential growth of the number of resonant longitudinal phonons in agreement with the predictions of the bogoliubovde gennes treatment we then observe an ordered sequence of phenomena induced by the nonlinearities of the system the first is a loss of the nonseparability of the resonant phonon pairs this is followed by the saturation of the exponential growth and a strong depletion of condensed atoms notably these effects are welldescribed by effective 1d dynamics and are hardly affected by the damping of the radial oscillations finally the atomic spectrum becomes broad featureless and almost incoherent in agreement with experimental results the link between this sequence of events and the preheating scenario in inflationary cosmology is striking as is the similarity of techniques used to study them | [['we', 'present', 'a', 'numerical', 'study', 'of', 'the', 'dynamical', 'effects', 'following', 'a', 'sudden', 'change', 'of', 'the', 'transverse', 'trapping', 'frequency', 'in', 'an', 'elongated', 'boseeinstein', 'condensate', 'which', 'induces', 'periodic', 'oscillations', 'of', 'the', 'radial', 'density', 'at', 'early', 'times', 'we', 'observe', 'an', 'exponential', 'growth', 'of', 'the', 'number', 'of', 'resonant', 'longitudinal', 'phonons', 'in', 'agreement', 'with', 'the', 'predictions', 'of', 'the', 'bogoliubovde', 'gennes', 'treatment', 'we', 'then', 'observe', 'an', 'ordered', 'sequence', 'of', 'phenomena', 'induced', 'by', 'the', 'nonlinearities', 'of', 'the', 'system', 'the', 'first', 'is', 'a', 'loss', 'of', 'the', 'nonseparability', 'of', 'the', 'resonant', 'phonon', 'pairs', 'this', 'is', 'followed', 'by', 'the', 'saturation', 'of', 'the', 'exponential', 'growth', 'and', 'a', 'strong', 'depletion', 'of', 'condensed', 'atoms', 'notably', 'these', 'effects', 'are', 'welldescribed', 'by', 'effective', '1d', 'dynamics', 'and', 'are', 'hardly', 'affected', 'by', 'the', 'damping', 'of', 'the', 'radial', 'oscillations', 'finally', 'the', 'atomic', 'spectrum', 'becomes', 'broad', 'featureless', 'and', 'almost', 'incoherent', 'in', 'agreement', 'with', 'experimental', 'results', 'the', 'link', 'between', 'this', 'sequence', 'of', 'events', 'and', 'the', 'preheating', 'scenario', 'in', 'inflationary', 'cosmology', 'is', 'striking', 'as', 'is', 'the', 'similarity', 'of', 'techniques', 'used', 'to', 'study', 'them']] | [-0.16945472097794675, 0.20841231891828987, -0.09037048293760529, 0.06647629591343165, -0.0017025796294120358, -0.0813629926666675, 0.014930722296502396, 0.35602023336967387, -0.2543134731815461, -0.27371972818272533, 0.036051880857507684, -0.28529074273818106, -0.12741908505501479, 0.18197946988454342, 0.019148016672575686, 0.03030707478310545, 0.03965156959128325, 9.474621505051115e-05, -0.058162468755732714, -0.2151068735588917, 0.33341520002836156, 0.05936573542666012, 0.26416496082243546, 0.04892845628035749, 0.04008710710619243, 0.003429822764577873, -0.005997644906596246, 0.012069134202636318, -0.15960620973064465, 0.08840961952659267, 0.1840934828441176, 0.03010832535010981, 0.26302531648450245, -0.4305295242128871, -0.2176307207375857, 0.08930052093080716, 0.16194899235478383, 0.16788273097380974, -0.05598669628365494, -0.26761776043883995, 0.011193668199588119, -0.14467803894019007, -0.15567180846047438, -0.038299412541321395, 0.03842645581167789, 0.03640346736776539, -0.27514688870697107, 0.16372078538345558, 0.07796045058937945, 0.06849060922481671, -0.06511859359495618, -0.018431776675343927, -0.03826578330524542, 0.064024158583862, 0.05990910147356996, 0.0007106839797034124, 0.13097986810047318, -0.13638877989523066, -0.10148925658597116, 0.372157344176365, -0.1288770512748872, -0.08357815437570766, 0.18516681846633645, -0.1724961318311362, -0.06700328964579069, 0.16325682957001306, 0.1230941398930161, 0.07561389129194948, -0.11069276348765318, 0.04554295831469152, -0.013039888846429272, 0.15792951335049707, 0.07510685467557912, 0.05298927419358666, 0.24373305184525196, 0.19377674252358207, 0.010211054586379983, 0.1425401387254012, -0.08569059141190798, -0.0866038262223204, -0.29856369479697337, -0.08980015769347917, -0.1728654351418861, 0.029753846441177123, -0.07136316143406014, -0.18094830377383825, 0.4228308851525969, 0.10669907187076644, 0.23655228074755014, 0.0005486828190947159, 0.28265462497559685, 0.15624941657742852, 0.024743003908682754, 0.012671718908812316, 0.2780818577451965, 0.14936422231681876, 0.09488016597202255, -0.33155400484418035, 0.034888079625634866, -0.004530579005483032] |
1,802.0074 | First application studies at the laser-driven LIGHT beamline: Improving
proton beam homogeneity and imaging of a solid target | In the last two decades, the generation of intense ion beams based on
laser-driven sources has become an extensively investigated field. The LIGHT
collaboration combines a laserdriven intense ion source with conventional
accelerator technology based on the Expertise of laser, plasma and accelerator
physicists. Our collaboration has installed a laser-driven multi-MeV ion
beamline at the GSI Helmholtzzentrum fuer Schwerionenforschung delivering
intense proton bunches in the subnanosecond regime. We investigate possible
applications for this beamline, especially in this report we focus on the
imaging capabilities. We report on our proton beam homogenization and on first
imaging results of a solid target.
| physics.acc-ph | in the last two decades the generation of intense ion beams based on laserdriven sources has become an extensively investigated field the light collaboration combines a laserdriven intense ion source with conventional accelerator technology based on the expertise of laser plasma and accelerator physicists our collaboration has installed a laserdriven multimev ion beamline at the gsi helmholtzzentrum fuer schwerionenforschung delivering intense proton bunches in the subnanosecond regime we investigate possible applications for this beamline especially in this report we focus on the imaging capabilities we report on our proton beam homogenization and on first imaging results of a solid target | [['in', 'the', 'last', 'two', 'decades', 'the', 'generation', 'of', 'intense', 'ion', 'beams', 'based', 'on', 'laserdriven', 'sources', 'has', 'become', 'an', 'extensively', 'investigated', 'field', 'the', 'light', 'collaboration', 'combines', 'a', 'laserdriven', 'intense', 'ion', 'source', 'with', 'conventional', 'accelerator', 'technology', 'based', 'on', 'the', 'expertise', 'of', 'laser', 'plasma', 'and', 'accelerator', 'physicists', 'our', 'collaboration', 'has', 'installed', 'a', 'laserdriven', 'multimev', 'ion', 'beamline', 'at', 'the', 'gsi', 'helmholtzzentrum', 'fuer', 'schwerionenforschung', 'delivering', 'intense', 'proton', 'bunches', 'in', 'the', 'subnanosecond', 'regime', 'we', 'investigate', 'possible', 'applications', 'for', 'this', 'beamline', 'especially', 'in', 'this', 'report', 'we', 'focus', 'on', 'the', 'imaging', 'capabilities', 'we', 'report', 'on', 'our', 'proton', 'beam', 'homogenization', 'and', 'on', 'first', 'imaging', 'results', 'of', 'a', 'solid', 'target']] | [-0.08591357261640951, 0.2204150206585473, -0.07534114641137421, 0.009747320592869074, -0.000845589863602072, -0.15651252340408972, -0.036563176629133526, 0.46776599434902894, -0.14953210005536677, -0.2760328788659535, 0.05832189662032761, -0.3210465330630541, 0.05109466269612312, 0.29470052555203435, 0.0122133246390149, 0.10005825331900269, 0.12078947628149762, -0.0449644158501178, 0.009044419228448532, -0.14146290670149028, 0.26251720399130135, 0.21370017036795616, 0.3864403085783124, 0.1628796123713255, 0.20126097914762794, 0.024741875701583923, -0.027794199250638484, -0.12039003166370094, -0.0918166780708998, 0.1409719830006361, 0.2674931513145566, 0.095949132416863, 0.30776632770895956, -0.5297656469792128, -0.2377122225612402, 0.011093196058645845, 0.09773693290539086, 0.09478012258652597, -0.2281555295281578, -0.2705940664559603, -0.02665968403336592, -0.1871416357997805, -0.13270970159472198, 0.02323516353033483, -0.013270952118327841, 0.103498146799393, -0.23914295787224546, -0.09408426143229008, -0.055096894735470414, 0.13256902657914907, -0.03368810885818675, -0.13243473772890865, 0.13284220454748719, -0.011565053765662015, 0.013202899796888233, 0.10247426405083387, 0.17438579179754016, -0.13071827937383204, -0.12591284677386283, 0.3628812746331096, -5.040432326495648e-05, -0.020281209759414196, 0.1722898091294337, -0.2664679700043052, -0.12789596607210116, 0.12579545323736965, 0.2221938967553433, 0.15286611553747206, -0.16185888059437276, 0.03980358764412813, -0.010900942627340555, 0.1780308428674107, 0.15658835225738585, 0.03641846176236868, 0.225339447921142, 0.31867135513573885, 0.0019219364831224084, 0.11436126520202379, -0.17310705284355207, 0.011394968202221207, -0.2611069440189749, -0.10491240976843982, -0.12092152869328857, 0.009629192189313471, 0.12073064625292318, -0.06043989953293931, 0.44396698316559197, 0.14321161697153, 0.029573052884079517, -0.13975754796527326, 0.34814015196170656, 0.03628553154179826, 0.055174070838838817, 0.027307115504518153, 0.2937128433119506, 0.13209646406350659, 0.2255410753376782, -0.24068777065724134, -0.0017226115940138698, 0.004894349030219018] |
1,802.00741 | Topology of the Quantum Hall Effect. The M\"obius strip model | Here we conjecture on a topological model based on the M\"obius strip derived
from the current distribution at the plateaus of the Quantum Hall Effect (QHE).
It can account for the fractional values of the QHE in an easy way.
| cond-mat.str-el | here we conjecture on a topological model based on the mobius strip derived from the current distribution at the plateaus of the quantum hall effect qhe it can account for the fractional values of the qhe in an easy way | [['here', 'we', 'conjecture', 'on', 'a', 'topological', 'model', 'based', 'on', 'the', 'mobius', 'strip', 'derived', 'from', 'the', 'current', 'distribution', 'at', 'the', 'plateaus', 'of', 'the', 'quantum', 'hall', 'effect', 'qhe', 'it', 'can', 'account', 'for', 'the', 'fractional', 'values', 'of', 'the', 'qhe', 'in', 'an', 'easy', 'way']] | [-0.1552506706211716, 0.13534067189066262, -0.13958206718089058, 0.03454881468787789, -0.04895436312071979, -0.1147528923000209, 0.07371745432610624, 0.32033616374246776, -0.2829285732470453, -0.29382151970639825, 0.06739544486335944, -0.2296772671805229, -0.17286132723093034, 0.2817886101955082, -0.050066019839141516, 0.08638528823830711, -0.06559706377447583, -0.03160047503188253, -0.05870909709483385, -0.2385289843659848, 0.31618374285753814, -0.022041875662398524, 0.31470045329770074, 0.07614317146362737, 0.058076581452041864, -0.0061471598106436435, 0.046252387610729785, 0.07088434561155736, -0.1851158170029521, 0.052143620955757794, 0.13615976385772227, -0.09227857379009947, 0.2007966585108079, -0.45363024082034825, -0.11912550212000497, 0.012293329858221114, 0.09391404544003308, 0.16465480499900878, -0.04923208633554168, -0.3174615006428212, 0.07514034947380424, -0.14225944029167295, -0.07639603409916162, -0.008343920204788446, 0.03536076904274523, -0.10997229136992245, -0.19042329310905187, 0.09122596871457063, 0.08577008219435811, 0.0606034618569538, -0.056859532289672644, -0.1682418330339715, -0.03543751443503425, 0.11788911155890673, -0.021134337273542768, -0.006810345291160047, 0.10990067612729035, -0.18182009823503903, -0.20246950294822455, 0.3770230285823345, -0.04027636975515634, -0.19965535001829265, 0.0860963842831552, -0.20779905463568865, -0.12300606342032552, 0.07397777223959565, 0.11355559648945927, 0.07952109721954911, -0.07107215905562043, 0.11462801967281848, -0.10367818176746368, 0.09439650648273527, -0.010985565232113003, 0.041627956368029115, 0.301951410388574, 0.10488180238753557, 0.07802323771174997, 0.171304504503496, -0.1849784518009983, -0.07143390364944935, -0.3586680630221963, -0.218677602824755, -0.267491686437279, 0.13325789161026477, -0.04409673373447731, -0.2054274330381304, 0.43254651948809625, 0.22278252149699257, 0.18292370368726552, 0.035246464586816725, 0.28642980637960136, 0.24203525385819374, 0.10328285349532962, 0.03779830907005817, 0.18075254349969327, 0.16040553353959694, 0.10452290389221161, -0.28451457756455056, 0.08726992902811617, 0.06479127507191151] |
1,802.00742 | Ideal gas with a varying (negative absolute) temperature: An alternative
to dark energy? | The present work is an attempt to investigate whether the evolutionary
history of the Universe from the offset of inflation can be described by
assuming the cosmic fluid to be an ideal gas with a specific gas constant but a
varying negative absolute temperature (NAT). The motivation of this work is to
search for an alternative to the "exotic" and "supernatural" dark energy (DE).
In fact, the NAT works as an "effective quintessence" and there is need to deal
neither with exotic matter like DE nor with modified gravity theories. For the
sake of completeness, we release some clarifications on NATs in Section 3 of
the paper.
| physics.gen-ph | the present work is an attempt to investigate whether the evolutionary history of the universe from the offset of inflation can be described by assuming the cosmic fluid to be an ideal gas with a specific gas constant but a varying negative absolute temperature nat the motivation of this work is to search for an alternative to the exotic and supernatural dark energy de in fact the nat works as an effective quintessence and there is need to deal neither with exotic matter like de nor with modified gravity theories for the sake of completeness we release some clarifications on nats in section 3 of the paper | [['the', 'present', 'work', 'is', 'an', 'attempt', 'to', 'investigate', 'whether', 'the', 'evolutionary', 'history', 'of', 'the', 'universe', 'from', 'the', 'offset', 'of', 'inflation', 'can', 'be', 'described', 'by', 'assuming', 'the', 'cosmic', 'fluid', 'to', 'be', 'an', 'ideal', 'gas', 'with', 'a', 'specific', 'gas', 'constant', 'but', 'a', 'varying', 'negative', 'absolute', 'temperature', 'nat', 'the', 'motivation', 'of', 'this', 'work', 'is', 'to', 'search', 'for', 'an', 'alternative', 'to', 'the', 'exotic', 'and', 'supernatural', 'dark', 'energy', 'de', 'in', 'fact', 'the', 'nat', 'works', 'as', 'an', 'effective', 'quintessence', 'and', 'there', 'is', 'need', 'to', 'deal', 'neither', 'with', 'exotic', 'matter', 'like', 'de', 'nor', 'with', 'modified', 'gravity', 'theories', 'for', 'the', 'sake', 'of', 'completeness', 'we', 'release', 'some', 'clarifications', 'on', 'nats', 'in', 'section', '3', 'of', 'the', 'paper']] | [-0.0956649709630009, 0.12070564511852235, -0.11298755427961733, 0.0852465383190592, -0.11886341035992742, -0.12390386083415736, -0.006320507580057553, 0.33245218067351623, -0.21335590621195386, -0.3697423864347495, 0.08029825529997524, -0.24935825794030017, -0.08213231764803423, 0.1473237834413858, -0.07855288187372629, -0.02579274172154821, -0.05230019352981977, 0.046934842889275505, -0.026937883477832113, -0.28789200659876113, 0.35549259700412017, 0.14398576624236706, 0.20414983783195786, 0.057178149565566924, 0.08994455401411403, -0.02884901689896447, -0.0454352651069933, 0.007330005504321481, -0.20099359293491145, 0.09078112270500267, 0.20709184336119166, 0.13365914725272038, 0.22830652792624712, -0.40153379029829367, -0.22696994256367473, 0.16535493720618782, 0.14310228927757276, 0.14639047887524434, -0.08153165990560725, -0.2657929143093735, 0.08255300747021754, -0.20398183394589017, -0.15328489138448836, -0.03314873275877995, 0.02651130553404583, -0.01076355631567677, -0.20676374679135384, 0.07810108395044205, 0.0572011241924331, 0.027447305515269253, -0.08019665658047476, -0.08094193978739955, 0.01476256196413224, 0.04511346097025916, 0.06374729164684557, 0.06287094406243936, 0.11157624005279113, -0.16161503102935015, -0.10578494505721762, 0.4021415873474189, -0.11637408641454215, -0.15721856678670673, 0.19655858038023777, -0.08326902804095472, -0.1274950824738872, 0.06911887786629671, 0.09714121718795221, 0.08356735383151709, -0.14260149990843834, 0.1288999140417779, 0.00877852280075862, 0.18256866490625054, 0.08360341542931361, 0.01113063134427104, 0.2862073708604151, 0.1370069725856742, 0.047248140229869666, 0.06792215929610358, -0.02685927426242313, -0.05542398938282489, -0.34147270571301197, -0.21533814886863403, -0.1542163266991831, 0.07928644562133035, -0.04122822271920001, -0.16007501311234643, 0.3241809224100592, 0.13403347502998403, 0.19545689229548813, 0.01232316558223183, 0.2796591540241492, 0.07476051099419977, 0.002214544942323989, 0.08032357576520782, 0.2500175307104995, 0.09444301324966146, 0.12836479490718622, -0.19966867052793294, 0.021710682925811717, 0.0025139570271021853] |
1,802.00743 | The quiescent state of the neutron-star X-ray transient GRS 1747-312 in
the globular cluster Terzan 6 | We studied the transient neutron-star low-mass X-ray binary GRS 1747-312,
located in the globular cluster Terzan 6, in its quiescent state after its
outburst in August 2004, using an archival XMM-Newton observation. A source was
detected in this cluster and its X-ray spectrum can be fitted with the
combination of a soft, neutron-star atmosphere model and a hard, power-law
model. Both contributed roughly equally to the observed 0.5-10 keV luminosity
(~4.8X10^33 erg/s). This type of X-ray spectrum is typically observed for
quiescent neutron-star X-ray transients that are perhaps accreting in
quiescence at very low rates. Therefore, if this X-ray source is the quiescent
counterpart of GRS 1747-312, then this source is also accreting at low levels
in-between outbursts. Since source confusion a likely problem in globular
clusters, it is quite possible that part, if not all, of the emission we
observed is not related to GRS 1747-312, and is instead associated with another
source or conglomeration of sources in the cluster. Currently, it is not
possible to determine exactly which part of the emission truly originates from
GRS 1747-312, and a Chandra observation (when no source is in outburst in
Terzan 6) is needed to be conclusive. Assuming that the detected emission is
due to GRS 1747-312, we discuss the observed results in the context of what is
known about other quiescent systems. We also investigated the thermal evolution
of the neutron star in GRS 1747-312, and inferred that GRS 1747-312 can be
considered a typical quiescent system under our assumptions.
| astro-ph.HE | we studied the transient neutronstar lowmass xray binary grs 1747312 located in the globular cluster terzan 6 in its quiescent state after its outburst in august 2004 using an archival xmmnewton observation a source was detected in this cluster and its xray spectrum can be fitted with the combination of a soft neutronstar atmosphere model and a hard powerlaw model both contributed roughly equally to the observed 0510 kev luminosity 48x1033 ergs this type of xray spectrum is typically observed for quiescent neutronstar xray transients that are perhaps accreting in quiescence at very low rates therefore if this xray source is the quiescent counterpart of grs 1747312 then this source is also accreting at low levels inbetween outbursts since source confusion a likely problem in globular clusters it is quite possible that part if not all of the emission we observed is not related to grs 1747312 and is instead associated with another source or conglomeration of sources in the cluster currently it is not possible to determine exactly which part of the emission truly originates from grs 1747312 and a chandra observation when no source is in outburst in terzan 6 is needed to be conclusive assuming that the detected emission is due to grs 1747312 we discuss the observed results in the context of what is known about other quiescent systems we also investigated the thermal evolution of the neutron star in grs 1747312 and inferred that grs 1747312 can be considered a typical quiescent system under our assumptions | [['we', 'studied', 'the', 'transient', 'neutronstar', 'lowmass', 'xray', 'binary', 'grs', '1747312', 'located', 'in', 'the', 'globular', 'cluster', 'terzan', '6', 'in', 'its', 'quiescent', 'state', 'after', 'its', 'outburst', 'in', 'august', '2004', 'using', 'an', 'archival', 'xmmnewton', 'observation', 'a', 'source', 'was', 'detected', 'in', 'this', 'cluster', 'and', 'its', 'xray', 'spectrum', 'can', 'be', 'fitted', 'with', 'the', 'combination', 'of', 'a', 'soft', 'neutronstar', 'atmosphere', 'model', 'and', 'a', 'hard', 'powerlaw', 'model', 'both', 'contributed', 'roughly', 'equally', 'to', 'the', 'observed', '0510', 'kev', 'luminosity', '48x1033', 'ergs', 'this', 'type', 'of', 'xray', 'spectrum', 'is', 'typically', 'observed', 'for', 'quiescent', 'neutronstar', 'xray', 'transients', 'that', 'are', 'perhaps', 'accreting', 'in', 'quiescence', 'at', 'very', 'low', 'rates', 'therefore', 'if', 'this', 'xray', 'source', 'is', 'the', 'quiescent', 'counterpart', 'of', 'grs', '1747312', 'then', 'this', 'source', 'is', 'also', 'accreting', 'at', 'low', 'levels', 'inbetween', 'outbursts', 'since', 'source', 'confusion', 'a', 'likely', 'problem', 'in', 'globular', 'clusters', 'it', 'is', 'quite', 'possible', 'that', 'part', 'if', 'not', 'all', 'of', 'the', 'emission', 'we', 'observed', 'is', 'not', 'related', 'to', 'grs', '1747312', 'and', 'is', 'instead', 'associated', 'with', 'another', 'source', 'or', 'conglomeration', 'of', 'sources', 'in', 'the', 'cluster', 'currently', 'it', 'is', 'not', 'possible', 'to', 'determine', 'exactly', 'which', 'part', 'of', 'the', 'emission', 'truly', 'originates', 'from', 'grs', '1747312', 'and', 'a', 'chandra', 'observation', 'when', 'no', 'source', 'is', 'in', 'outburst', 'in', 'terzan', '6', 'is', 'needed', 'to', 'be', 'conclusive', 'assuming', 'that', 'the', 'detected', 'emission', 'is', 'due', 'to', 'grs', '1747312', 'we', 'discuss', 'the', 'observed', 'results', 'in', 'the', 'context', 'of', 'what', 'is', 'known', 'about', 'other', 'quiescent', 'systems', 'we', 'also', 'investigated', 'the', 'thermal', 'evolution', 'of', 'the', 'neutron', 'star', 'in', 'grs', '1747312', 'and', 'inferred', 'that', 'grs', '1747312', 'can', 'be', 'considered', 'a', 'typical', 'quiescent', 'system', 'under', 'our', 'assumptions']] | [-0.058896839170018214, 0.11391431969829137, -0.09458103322214446, 0.15639699647715316, -0.11936237535066903, -0.11038636311329901, 0.05783056149072945, 0.44164153281971813, -0.19910524349601474, -0.33936150359082967, 0.14394244285533206, -0.3254259877726436, -0.04206384226540104, 0.22776283723209054, -0.054267365781590346, -0.028110144244739784, 0.08789789634221233, -0.0052760663861408826, -0.02881618129881099, -0.2597258941181935, 0.2636699774423614, 0.0826831945264712, 0.15293642072286456, -0.024512420322047545, 0.06438093224819749, -0.07211828712467104, -0.010838446890935301, -0.05184811216406524, -0.06636943144130054, 0.00657332089706324, 0.29215586597379295, 0.140748261164641, 0.1533357908166945, -0.3345108511373401, -0.22642251655459403, 0.06849637963419082, 0.16543739086342976, -0.011365216146688908, 0.0015485229548066854, -0.23174828388681634, 0.08940087280469015, -0.23213429902121424, -0.17667150282487273, 0.09779614457581193, 0.07511463618092239, -0.008099404863081873, -0.14887577723572032, 0.15670916406973265, 0.06561178207537159, -0.009196032939478755, -0.1819260387751274, -0.030661409208085386, -0.020273153684102, 0.050173938312684185, 0.057054824530147014, 0.09984031073469668, 0.12993599203415215, -0.11992256619036197, -0.0797583240736276, 0.35575976001657544, -0.018509442000184208, 0.025938157573342325, 0.23677777602151037, -0.21876317991502583, -0.2554032076187432, 0.1655826877579093, 0.07882900247536599, 0.11386977734416723, -0.18658239002880872, 0.003809520618058741, -0.04333437705505639, 0.3153806951260194, 0.05338217931427062, 0.06197648848546669, 0.33330293150618673, 0.10968851736327634, -0.025842480273917317, 0.20809334521344863, -0.24246540617966092, -0.02032779211504385, -0.23212293408974075, -0.010609486774075777, -0.16515952325752006, 0.135910570630047, -0.03285456562851323, -0.13948026265925728, 0.3196680336492136, 0.058133829426020384, 0.17840355478972197, -0.03247912647621706, 0.28356330539658664, 0.12702581286104395, 0.049378486528992654, 0.16066529452707617, 0.35708053583465516, 0.1467800837699324, 0.12215871658548713, -0.21698643078422175, 0.11345167660340667, -0.030393322066403924] |
1,802.00744 | Excess-tuberculosis-mortality in young women: high accuracy exploration | In a general way at all ages and for almost all diseases, male death rates
are higher than female death rates. Here we report a case in which the opposite
holds, namely for tuberculosis (TB) mortality between the ages of 5 and 25,
female death rates are about two times higher than male rates. What makes this
observation of interest is that it occurs in all countries for which data are
available (e.g. Britain, Switzerland and United States), and in all years from
the end of the 19th century up to the time in the 1960s when TB became a very
rare disease in all developed countries. The fact that this regularity holds
despite a drastic reduction in the number of deaths is also noteworthy. What is
the practical usefulness of this investigation? So far, the reason of this
anomaly remains an open question but the effect is so accurate that it can be
used for probing the reliability and accuracy of mortality records. This will
be explained in the case of developing countries. For instance, it turns out
that in South African TB death data as published (and revised) by the "World
Health Organization", female deaths were certainly under-estimated by a factor
of two.
| physics.med-ph physics.bio-ph physics.soc-ph | in a general way at all ages and for almost all diseases male death rates are higher than female death rates here we report a case in which the opposite holds namely for tuberculosis tb mortality between the ages of 5 and 25 female death rates are about two times higher than male rates what makes this observation of interest is that it occurs in all countries for which data are available eg britain switzerland and united states and in all years from the end of the 19th century up to the time in the 1960s when tb became a very rare disease in all developed countries the fact that this regularity holds despite a drastic reduction in the number of deaths is also noteworthy what is the practical usefulness of this investigation so far the reason of this anomaly remains an open question but the effect is so accurate that it can be used for probing the reliability and accuracy of mortality records this will be explained in the case of developing countries for instance it turns out that in south african tb death data as published and revised by the world health organization female deaths were certainly underestimated by a factor of two | [['in', 'a', 'general', 'way', 'at', 'all', 'ages', 'and', 'for', 'almost', 'all', 'diseases', 'male', 'death', 'rates', 'are', 'higher', 'than', 'female', 'death', 'rates', 'here', 'we', 'report', 'a', 'case', 'in', 'which', 'the', 'opposite', 'holds', 'namely', 'for', 'tuberculosis', 'tb', 'mortality', 'between', 'the', 'ages', 'of', '5', 'and', '25', 'female', 'death', 'rates', 'are', 'about', 'two', 'times', 'higher', 'than', 'male', 'rates', 'what', 'makes', 'this', 'observation', 'of', 'interest', 'is', 'that', 'it', 'occurs', 'in', 'all', 'countries', 'for', 'which', 'data', 'are', 'available', 'eg', 'britain', 'switzerland', 'and', 'united', 'states', 'and', 'in', 'all', 'years', 'from', 'the', 'end', 'of', 'the', '19th', 'century', 'up', 'to', 'the', 'time', 'in', 'the', '1960s', 'when', 'tb', 'became', 'a', 'very', 'rare', 'disease', 'in', 'all', 'developed', 'countries', 'the', 'fact', 'that', 'this', 'regularity', 'holds', 'despite', 'a', 'drastic', 'reduction', 'in', 'the', 'number', 'of', 'deaths', 'is', 'also', 'noteworthy', 'what', 'is', 'the', 'practical', 'usefulness', 'of', 'this', 'investigation', 'so', 'far', 'the', 'reason', 'of', 'this', 'anomaly', 'remains', 'an', 'open', 'question', 'but', 'the', 'effect', 'is', 'so', 'accurate', 'that', 'it', 'can', 'be', 'used', 'for', 'probing', 'the', 'reliability', 'and', 'accuracy', 'of', 'mortality', 'records', 'this', 'will', 'be', 'explained', 'in', 'the', 'case', 'of', 'developing', 'countries', 'for', 'instance', 'it', 'turns', 'out', 'that', 'in', 'south', 'african', 'tb', 'death', 'data', 'as', 'published', 'and', 'revised', 'by', 'the', 'world', 'health', 'organization', 'female', 'deaths', 'were', 'certainly', 'underestimated', 'by', 'a', 'factor', 'of', 'two']] | [-0.06469938749243029, 0.16090484918726938, -0.026777064211655228, 0.14039275394695833, -0.02902765064841, -0.1260228431715471, 0.09671728940816914, 0.3578593410937706, -0.18569350553131322, -0.29319050889916537, 0.1522068816981074, -0.30555550164156936, -0.14357326285822725, 0.241642795076094, -0.12487173235134744, -0.0607562730952007, 0.09118060513240535, 0.0651205208584121, 0.01325092040309001, -0.35515641180980134, 0.24904233586077193, 0.06357838986668644, 0.29625905513445416, 0.050961983403781566, 0.04731689194421761, -0.03321795446525623, -0.03248559228050886, -0.015951860920389797, -0.07918339846953863, 0.1077882442160555, 0.31940684590670393, 0.17678814348821506, 0.3490702333746523, -0.38730008976261426, -0.19419149599696806, 0.12380499628077193, 0.13102480532600055, 0.13756836907506534, -0.013587921990717693, -0.24314984578139534, 0.05011846070041562, -0.19553102681458723, -0.13667991015060646, -0.012152581199117732, 0.09099979737500956, -0.03871825003269606, -0.22440422980977995, 0.16023103716121645, 0.016238066203119916, 0.1580858569047073, -0.03876492856865431, -0.16788481143132852, -0.035853659313898986, 0.19828038083846544, 0.11535095773330639, 0.01696461345773281, 0.09827003724555053, -0.13815674678218073, -0.08656931036242807, 0.3599197873300532, -0.011955917156556984, -0.08828984566782487, 0.1878313031490529, -0.2259413057324908, -0.14546753340514332, 0.10642073379670519, 0.15352216432915955, 0.07355712158662245, -0.22476992439684493, -0.009855832215739277, -0.02338739492726035, 0.11835571327303514, 0.13511077561983612, -0.020802045666624042, 0.1820397549376982, 0.18111496406334748, 0.03967420408706658, 0.05805730297480051, -0.09336866571499806, -0.1017891698108032, -0.2112601031958148, -0.1694788640267755, -0.09475424696816268, 0.06707086461970992, -0.05213865735071212, -0.10519434149467909, 0.38707033565676796, 0.16483237079185684, 0.1398081666063063, 0.04555476116834254, 0.22927535900437251, 0.03745624020684329, 0.09848980997439201, 0.08819428515654602, 0.24608915980632712, 0.06147135867149478, 0.1325193578354651, -0.15453650442111055, 0.162025397775195, -0.026139597176778606] |
1,802.00745 | Explaining First Impressions: Modeling, Recognizing, and Explaining
Apparent Personality from Videos | Explainability and interpretability are two critical aspects of decision
support systems. Within computer vision, they are critical in certain tasks
related to human behavior analysis such as in health care applications. Despite
their importance, it is only recently that researchers are starting to explore
these aspects. This paper provides an introduction to explainability and
interpretability in the context of computer vision with an emphasis on looking
at people tasks. Specifically, we review and study those mechanisms in the
context of first impressions analysis. To the best of our knowledge, this is
the first effort in this direction. Additionally, we describe a challenge we
organized on explainability in first impressions analysis from video. We
analyze in detail the newly introduced data set, the evaluation protocol, and
summarize the results of the challenge. Finally, derived from our study, we
outline research opportunities that we foresee will be decisive in the near
future for the development of the explainable computer vision field.
| cs.CV | explainability and interpretability are two critical aspects of decision support systems within computer vision they are critical in certain tasks related to human behavior analysis such as in health care applications despite their importance it is only recently that researchers are starting to explore these aspects this paper provides an introduction to explainability and interpretability in the context of computer vision with an emphasis on looking at people tasks specifically we review and study those mechanisms in the context of first impressions analysis to the best of our knowledge this is the first effort in this direction additionally we describe a challenge we organized on explainability in first impressions analysis from video we analyze in detail the newly introduced data set the evaluation protocol and summarize the results of the challenge finally derived from our study we outline research opportunities that we foresee will be decisive in the near future for the development of the explainable computer vision field | [['explainability', 'and', 'interpretability', 'are', 'two', 'critical', 'aspects', 'of', 'decision', 'support', 'systems', 'within', 'computer', 'vision', 'they', 'are', 'critical', 'in', 'certain', 'tasks', 'related', 'to', 'human', 'behavior', 'analysis', 'such', 'as', 'in', 'health', 'care', 'applications', 'despite', 'their', 'importance', 'it', 'is', 'only', 'recently', 'that', 'researchers', 'are', 'starting', 'to', 'explore', 'these', 'aspects', 'this', 'paper', 'provides', 'an', 'introduction', 'to', 'explainability', 'and', 'interpretability', 'in', 'the', 'context', 'of', 'computer', 'vision', 'with', 'an', 'emphasis', 'on', 'looking', 'at', 'people', 'tasks', 'specifically', 'we', 'review', 'and', 'study', 'those', 'mechanisms', 'in', 'the', 'context', 'of', 'first', 'impressions', 'analysis', 'to', 'the', 'best', 'of', 'our', 'knowledge', 'this', 'is', 'the', 'first', 'effort', 'in', 'this', 'direction', 'additionally', 'we', 'describe', 'a', 'challenge', 'we', 'organized', 'on', 'explainability', 'in', 'first', 'impressions', 'analysis', 'from', 'video', 'we', 'analyze', 'in', 'detail', 'the', 'newly', 'introduced', 'data', 'set', 'the', 'evaluation', 'protocol', 'and', 'summarize', 'the', 'results', 'of', 'the', 'challenge', 'finally', 'derived', 'from', 'our', 'study', 'we', 'outline', 'research', 'opportunities', 'that', 'we', 'foresee', 'will', 'be', 'decisive', 'in', 'the', 'near', 'future', 'for', 'the', 'development', 'of', 'the', 'explainable', 'computer', 'vision', 'field']] | [-0.07605504317490279, 0.03453811856573184, -0.07280388996063632, 0.059469621062554046, -0.10496254684696407, -0.0813352327190527, 0.02965339215299548, 0.4131375538103236, -0.23874561518500997, -0.33369068244073846, 0.14013525850356282, -0.2866256307435673, -0.23957651653239187, 0.23125490918169794, -0.13648430256864186, 0.049498849243815965, 0.09738595319952839, 0.056554865197471854, -0.03254261722937578, -0.2836104883408209, 0.31937069131600315, 0.06097307006400898, 0.3127266665124012, 0.0986199265890667, 0.018156343550456443, -0.006652175460549645, -0.07257043015293824, -0.007810669265828043, -0.15012189412352983, 0.18529152765331217, 0.34396925983282756, 0.2013992691301278, 0.367054496429064, -0.4307576909239562, -0.1860644116986004, 0.07443322565219125, 0.12932285935319257, 0.11683870194503253, -0.06716418301202678, -0.2998131971232265, 0.08564745624360787, -0.1686865782054762, -0.08978036731048106, -0.12619762360147616, 0.008222366272436702, -0.011052001585434162, -0.19043220217345552, -0.025711437653597888, 0.06634982893794025, 0.12017066141666621, -0.05746261815415291, -0.10605739181972572, 0.07445559734273585, 0.21157825278826994, 0.09289824689955176, 0.027367940983067284, 0.1220858330551371, -0.21769647445066967, -0.1615795846918668, 0.40046376458503913, -0.0015912759611998106, -0.14856534046940975, 0.2121607336148315, -0.10090293624268482, -0.223565970320524, 0.022676154725113005, 0.2529324886254357, 0.06874224772887691, -0.1746989319147835, 0.04029829672877472, -0.012354981469037305, 0.13523271873757337, 0.009826038167489774, 0.016671205558169797, 0.23962955469406158, 0.2506351028305461, 0.010824808382294463, 0.11589738371732217, -0.03899594860549711, -0.10699119856698239, -0.29073812179970293, -0.17183622238394636, -0.14353630248217042, -0.010474025815104445, -0.027255014097244835, -0.07776955409713511, 0.4167660890416529, 0.2790493496090361, 0.1671361519410363, 0.012652981024727507, 0.3184115501170474, 0.04357031150437297, 0.043700192635805706, 0.05060683213666363, 0.22365628090927248, 0.023873622722502024, 0.1624721855045232, -0.16516213789113662, 0.06594704495122035, 0.013961735651564767] |
1,802.00746 | Kinetic-MHD simulations of gyroresonance instability driven by CR
pressure anisotropy | The transport of cosmic rays (CRs) is crucial for the understanding of almost
all high-energy phenomena. Both pre-existing large-scale magnetohydrodynamic
(MHD) turbulence and locally generated turbulence through plasma instabilities
are important for the CR propagation in astrophysical media. The potential role
of the resonant instability triggered by CR pressure anisotropy to regulate the
parallel spatial diffusion of low-energy CRs ($\lesssim 100$ GeV) in the
interstellar and intracluster medium of galaxies (ISM and ICM) has been showed
in previous theoretical works. This work aims to study the gyroresonance
instability via direct numerical simulations, in order to access quantitatively
the wave-particle scattering rates. For this we employ a 1D PIC-MHD code to
follow the growth and saturation of the gyroresonance instability. We extract
from the simulations the pitch-angle diffusion coefficient $D_{\mu\mu}$
produced by the instability during the linear and saturation phases, and a very
good agreement (within a factor of 3) is found with the values predicted by the
quasilinear theory (QLT). Our results support the applicability of the QLT for
modeling the scattering of low-energy CRs by the gyroresonance instability in
the complex interplay between this instability and the large-scale MHD
turbulence.
| astro-ph.HE | the transport of cosmic rays crs is crucial for the understanding of almost all highenergy phenomena both preexisting largescale magnetohydrodynamic mhd turbulence and locally generated turbulence through plasma instabilities are important for the cr propagation in astrophysical media the potential role of the resonant instability triggered by cr pressure anisotropy to regulate the parallel spatial diffusion of lowenergy crs lesssim 100 gev in the interstellar and intracluster medium of galaxies ism and icm has been showed in previous theoretical works this work aims to study the gyroresonance instability via direct numerical simulations in order to access quantitatively the waveparticle scattering rates for this we employ a 1d picmhd code to follow the growth and saturation of the gyroresonance instability we extract from the simulations the pitchangle diffusion coefficient d_mumu produced by the instability during the linear and saturation phases and a very good agreement within a factor of 3 is found with the values predicted by the quasilinear theory qlt our results support the applicability of the qlt for modeling the scattering of lowenergy crs by the gyroresonance instability in the complex interplay between this instability and the largescale mhd turbulence | [['the', 'transport', 'of', 'cosmic', 'rays', 'crs', 'is', 'crucial', 'for', 'the', 'understanding', 'of', 'almost', 'all', 'highenergy', 'phenomena', 'both', 'preexisting', 'largescale', 'magnetohydrodynamic', 'mhd', 'turbulence', 'and', 'locally', 'generated', 'turbulence', 'through', 'plasma', 'instabilities', 'are', 'important', 'for', 'the', 'cr', 'propagation', 'in', 'astrophysical', 'media', 'the', 'potential', 'role', 'of', 'the', 'resonant', 'instability', 'triggered', 'by', 'cr', 'pressure', 'anisotropy', 'to', 'regulate', 'the', 'parallel', 'spatial', 'diffusion', 'of', 'lowenergy', 'crs', 'lesssim', '100', 'gev', 'in', 'the', 'interstellar', 'and', 'intracluster', 'medium', 'of', 'galaxies', 'ism', 'and', 'icm', 'has', 'been', 'showed', 'in', 'previous', 'theoretical', 'works', 'this', 'work', 'aims', 'to', 'study', 'the', 'gyroresonance', 'instability', 'via', 'direct', 'numerical', 'simulations', 'in', 'order', 'to', 'access', 'quantitatively', 'the', 'waveparticle', 'scattering', 'rates', 'for', 'this', 'we', 'employ', 'a', '1d', 'picmhd', 'code', 'to', 'follow', 'the', 'growth', 'and', 'saturation', 'of', 'the', 'gyroresonance', 'instability', 'we', 'extract', 'from', 'the', 'simulations', 'the', 'pitchangle', 'diffusion', 'coefficient', 'd_mumu', 'produced', 'by', 'the', 'instability', 'during', 'the', 'linear', 'and', 'saturation', 'phases', 'and', 'a', 'very', 'good', 'agreement', 'within', 'a', 'factor', 'of', '3', 'is', 'found', 'with', 'the', 'values', 'predicted', 'by', 'the', 'quasilinear', 'theory', 'qlt', 'our', 'results', 'support', 'the', 'applicability', 'of', 'the', 'qlt', 'for', 'modeling', 'the', 'scattering', 'of', 'lowenergy', 'crs', 'by', 'the', 'gyroresonance', 'instability', 'in', 'the', 'complex', 'interplay', 'between', 'this', 'instability', 'and', 'the', 'largescale', 'mhd', 'turbulence']] | [-0.13626833417526396, 0.18021130554966236, -0.04179699346423149, 0.11993579254424395, -0.04900471658911556, -0.012186226780575357, -0.0323292498311371, 0.3338961287426125, -0.29254366970424983, -0.28487310236515967, 0.019107308228328627, -0.25642395117013767, -0.08053871403742385, 0.2187105213488011, 0.0959703333908692, 0.05183854792121565, 0.03057966123359572, -0.09165214569749017, 0.02952454918260245, -0.18385124887388787, 0.32928771128093726, 0.20076996790441243, 0.2811518810983551, 0.07141838811742338, 0.03648968093605761, -0.050141093267225906, -0.059596382721180195, 0.0017686828327561287, -0.17813889113351347, 0.05480184028488829, 0.22191608080910027, 0.03694306236692156, 0.2423813960171844, -0.4913266719245401, -0.33291726830954615, 0.008753864816389978, 0.19553001344105916, 0.08942870172966076, -0.08814257569856157, -0.22659065288025887, 0.07993218027496417, -0.1577426907116253, -0.14553056627413943, -0.00447726294055189, -0.024149965614962736, 0.04539526557384402, -0.2872084369352945, 0.137908947661421, 0.06877710449013026, 0.05747534180623724, -0.10756260876445786, -0.02356159973975369, -0.016708771255798636, 0.06738478975787171, 0.10591606945534678, 0.03676486111515643, 0.14790916735257365, -0.16644216929684932, -0.07386141441897244, 0.42147326108717703, -0.05441765769593124, -0.10986218092668998, 0.24236713405453453, -0.211400971220313, -0.08363293361678524, 0.19183776684497533, 0.19473237906043467, 0.04974743749419423, -0.11458567782354198, 0.060594906013667287, -0.027329487255529354, 0.12528013540799485, 0.04745315244592922, -0.01479367374133864, 0.20465768899057846, 0.17651608275666245, -0.012773401253415567, 0.0667233398821401, -0.11188815654696603, -0.05404156729805675, -0.257971505921236, -0.10259469848518309, -0.11780857913085799, 0.07151284759533347, -0.10832858982757898, -0.11949780364704661, 0.37216205256991086, 0.18417006696415084, 0.1639082802876242, -0.036020094282483976, 0.31860040295624026, 0.08747882472020328, 0.0096034962328543, 0.1594529959667278, 0.32703338511974406, 0.2050564816736273, 0.1565090225298742, -0.28923651699442415, 0.07666397381475881, 0.04452520574222466] |
1,802.00747 | Translation in Cylindrically Symmetric Vacuum | Starting from the stationary cylindrically symmetric solution, but with the
coordinates $z$ and $\phi$ interchanged, and supposing that it could describe
the vacuum spacetime of a translating cylinder, we investigate its physical and
geometrical properties. This hypothesis is not entirely new since it has
already been considered in a previous paper describing a translating source. We
show that this metric is geometrically related to the vacuum field produced by
a stationary rotating cylindrical source{, known as Lewis solution. However, we
find new physical properties, different from those of the Lewis vacuum
solution. Moreover, we show that no translating cylindrical dust solution can
exist in General Relativity.
| gr-qc | starting from the stationary cylindrically symmetric solution but with the coordinates z and phi interchanged and supposing that it could describe the vacuum spacetime of a translating cylinder we investigate its physical and geometrical properties this hypothesis is not entirely new since it has already been considered in a previous paper describing a translating source we show that this metric is geometrically related to the vacuum field produced by a stationary rotating cylindrical source known as lewis solution however we find new physical properties different from those of the lewis vacuum solution moreover we show that no translating cylindrical dust solution can exist in general relativity | [['starting', 'from', 'the', 'stationary', 'cylindrically', 'symmetric', 'solution', 'but', 'with', 'the', 'coordinates', 'z', 'and', 'phi', 'interchanged', 'and', 'supposing', 'that', 'it', 'could', 'describe', 'the', 'vacuum', 'spacetime', 'of', 'a', 'translating', 'cylinder', 'we', 'investigate', 'its', 'physical', 'and', 'geometrical', 'properties', 'this', 'hypothesis', 'is', 'not', 'entirely', 'new', 'since', 'it', 'has', 'already', 'been', 'considered', 'in', 'a', 'previous', 'paper', 'describing', 'a', 'translating', 'source', 'we', 'show', 'that', 'this', 'metric', 'is', 'geometrically', 'related', 'to', 'the', 'vacuum', 'field', 'produced', 'by', 'a', 'stationary', 'rotating', 'cylindrical', 'source', 'known', 'as', 'lewis', 'solution', 'however', 'we', 'find', 'new', 'physical', 'properties', 'different', 'from', 'those', 'of', 'the', 'lewis', 'vacuum', 'solution', 'moreover', 'we', 'show', 'that', 'no', 'translating', 'cylindrical', 'dust', 'solution', 'can', 'exist', 'in', 'general', 'relativity']] | [-0.12599908633658416, 0.10458493115652774, -0.12340060992271833, 0.0692339698028452, -0.07656618418558589, -0.13089898580087805, -0.03334579462040532, 0.37453343116080845, -0.2476731874224431, -0.2603579734996805, 0.11027745710782495, -0.23758131724272696, -0.12146609772067025, 0.17140616933411024, -0.06766039041696854, 0.04981280357152979, 0.018591298661326534, 0.028649562376744625, -0.07623954572196487, -0.16166698882127847, 0.3472188025721753, 0.014320444405729056, 0.2611109958368547, 0.023618767705728422, 0.12260735694446408, -0.06292376003474137, -0.0016027879703543939, 0.07901516308972859, -0.13562905042368276, 0.04884834196154942, 0.17557917302913684, 0.15838312980671412, 0.19726663555528196, -0.4086597376626055, -0.22171837464853558, 0.09873958656955335, 0.14981111409230474, 0.16488378434354123, -0.11980875831027075, -0.27795218800212135, 0.08437651955909184, -0.14776416602193043, -0.19510420599407605, -0.06106523046586311, 0.045359543104049806, -0.004152604107490196, -0.2063608312197381, 0.03312084368289501, 0.11385519951768659, -0.00040891058089536665, -0.10547799551266439, -0.07908367359228784, -0.021761459228143376, 0.08346267421905584, 0.10656976609991617, 0.07227903134233477, 0.09842834987168042, -0.10193350665570008, -0.04860960609138996, 0.4062583947308221, -0.0692773425231143, -0.2752756235664183, 0.1980985948126236, -0.16925989014957593, -0.10048871247519581, 0.1169542862488976, 0.12477972869814005, 0.15928653070158413, -0.1918146146795238, 0.12425586842890073, -0.10923659283105495, 0.17556944143637698, 0.15545981646875656, -0.002777422781054036, 0.24969547603911948, 0.09306761591677677, 0.007674106594970239, 0.18056531459585112, -0.022435395600590505, -0.131417746515066, -0.34233667726083744, -0.16814198044462586, -0.16073339312987509, 0.1147157283323292, -0.0647253672377358, -0.1814483763289831, 0.342141222305385, 0.10813152882762535, 0.14773500171261575, 0.0033162833827208365, 0.2519204302928147, 0.08664938810452784, 0.026268412488653272, 0.11608860705856164, 0.31494439177584116, 0.1032615913372522, 0.10605338887083081, -0.15632179531187504, 0.01872240425140228, 0.04502291265734524] |
1,802.00748 | Short-term Memory of Deep RNN | The extension of deep learning towards temporal data processing is gaining an
increasing research interest. In this paper we investigate the properties of
state dynamics developed in successive levels of deep recurrent neural networks
(RNNs) in terms of short-term memory abilities. Our results reveal interesting
insights that shed light on the nature of layering as a factor of RNN design.
Noticeably, higher layers in a hierarchically organized RNN architecture
results to be inherently biased towards longer memory spans even prior to
training of the recurrent connections. Moreover, in the context of Reservoir
Computing framework, our analysis also points out the benefit of a layered
recurrent organization as an efficient approach to improve the memory skills of
reservoir models.
| cs.LG cs.AI math.DS stat.ML | the extension of deep learning towards temporal data processing is gaining an increasing research interest in this paper we investigate the properties of state dynamics developed in successive levels of deep recurrent neural networks rnns in terms of shortterm memory abilities our results reveal interesting insights that shed light on the nature of layering as a factor of rnn design noticeably higher layers in a hierarchically organized rnn architecture results to be inherently biased towards longer memory spans even prior to training of the recurrent connections moreover in the context of reservoir computing framework our analysis also points out the benefit of a layered recurrent organization as an efficient approach to improve the memory skills of reservoir models | [['the', 'extension', 'of', 'deep', 'learning', 'towards', 'temporal', 'data', 'processing', 'is', 'gaining', 'an', 'increasing', 'research', 'interest', 'in', 'this', 'paper', 'we', 'investigate', 'the', 'properties', 'of', 'state', 'dynamics', 'developed', 'in', 'successive', 'levels', 'of', 'deep', 'recurrent', 'neural', 'networks', 'rnns', 'in', 'terms', 'of', 'shortterm', 'memory', 'abilities', 'our', 'results', 'reveal', 'interesting', 'insights', 'that', 'shed', 'light', 'on', 'the', 'nature', 'of', 'layering', 'as', 'a', 'factor', 'of', 'rnn', 'design', 'noticeably', 'higher', 'layers', 'in', 'a', 'hierarchically', 'organized', 'rnn', 'architecture', 'results', 'to', 'be', 'inherently', 'biased', 'towards', 'longer', 'memory', 'spans', 'even', 'prior', 'to', 'training', 'of', 'the', 'recurrent', 'connections', 'moreover', 'in', 'the', 'context', 'of', 'reservoir', 'computing', 'framework', 'our', 'analysis', 'also', 'points', 'out', 'the', 'benefit', 'of', 'a', 'layered', 'recurrent', 'organization', 'as', 'an', 'efficient', 'approach', 'to', 'improve', 'the', 'memory', 'skills', 'of', 'reservoir', 'models']] | [-0.11500301319805874, 0.062346915024090004, -0.07194084500483537, 0.06898059901560388, -0.09093556794637846, -0.14586712940895963, 0.07582907645935509, 0.440326393850274, -0.3173650959033077, -0.3007078201083814, 0.06521443697777814, -0.22088089181204973, -0.24680455508878676, 0.17876998620833887, -0.08715507602487454, 0.01761349159592794, 0.13309185215571928, 0.014906824043541515, -0.048217939946926754, -0.27685889738760605, 0.26152589405744764, 0.10590731240049304, 0.34552028355330733, 0.00832762534258309, 0.10008347104007567, -0.059970455465175335, -0.02448087518292842, -0.04139555885724849, -0.030567397527562917, 0.21227383844838557, 0.2882088717872386, 0.14399991466385564, 0.36708812889548303, -0.498144478687101, -0.3032779707178726, 0.04292816229922287, 0.16769196915980902, 0.0772404173010234, -0.023055551929786106, -0.30490694216342046, 0.06491637059834675, -0.17507902949543322, -0.05137017242545341, -0.13267916922903447, 0.0017182852626951822, -0.001606715499754932, -0.2322593827542486, 0.003788541447740222, 0.1547407054291028, 0.045255813901549424, -0.05402319672343842, -0.12666148422838394, 0.016397813911218258, 0.15959907025177728, 0.026971817268177045, 0.04779495683624962, 0.12122964520023156, -0.2138543797408278, -0.14197485515121686, 0.2933541921804012, -0.05029036610789787, -0.1613546188731315, 0.17579527983986537, -0.03759381134690464, -0.19346715241544327, 0.08754156827058454, 0.27961353982119996, 0.07752808573324296, -0.1670150633652742, -0.0013836013149249099, -0.015231271708478867, 0.19858137342163315, 0.013605209862639717, 0.08507481430286258, 0.22005284758397156, 0.33968219340984096, 0.016004604453189394, 0.17402227896056532, -0.07008672894523242, -0.15130838937070853, -0.17225790176130198, -0.1404533427429654, -0.16549246999735046, 0.026621927198425124, -0.11047049684319803, -0.15610201083028974, 0.429186199464188, 0.21502355970757997, 0.21654996209604255, 0.11247799509220709, 0.3120382415698999, 0.02669249302155133, 0.15443048253260805, 0.09672804593929421, 0.18425835332817445, 0.09230199924243962, 0.18320582163425447, -0.18726165117932705, 0.09601847666327573, 0.020079078440854357] |
1,802.00749 | On computational issues for stability analysis of LPV systems using parameter dependent Lyapunov functions and LMIs | This paper deals with the robust stability analysis of linear systems, subject to time-varying parameters. The Parameter Dependent Lyapunov Function are considered, assuming that the temporal derivative of the parameters are bounded. Some computational issues are discussed, which are present in Linear Matrix Inequality (LMI) based approaches and are exacerbated as the quantity of time-varying parameters increases. A possible solution to deal with issues is proposed by modifying the inclusion of the information regarding the time-derivative bounds. Complexity in the number of LMIs constraints can be reduced from very complex to linear. Numerical examples are provide to illustrate the advantages of the proposed methodology. | math.OC | this paper deals with the robust stability analysis of linear systems subject to timevarying parameters the parameter dependent lyapunov function are considered assuming that the temporal derivative of the parameters are bounded some computational issues are discussed which are present in linear matrix inequality lmi based approaches and are exacerbated as the quantity of timevarying parameters increases a possible solution to deal with issues is proposed by modifying the inclusion of the information regarding the timederivative bounds complexity in the number of lmis constraints can be reduced from very complex to linear numerical examples are provide to illustrate the advantages of the proposed methodology | [['this', 'paper', 'deals', 'with', 'the', 'robust', 'stability', 'analysis', 'of', 'linear', 'systems', 'subject', 'to', 'timevarying', 'parameters', 'the', 'parameter', 'dependent', 'lyapunov', 'function', 'are', 'considered', 'assuming', 'that', 'the', 'temporal', 'derivative', 'of', 'the', 'parameters', 'are', 'bounded', 'some', 'computational', 'issues', 'are', 'discussed', 'which', 'are', 'present', 'in', 'linear', 'matrix', 'inequality', 'lmi', 'based', 'approaches', 'and', 'are', 'exacerbated', 'as', 'the', 'quantity', 'of', 'timevarying', 'parameters', 'increases', 'a', 'possible', 'solution', 'to', 'deal', 'with', 'issues', 'is', 'proposed', 'by', 'modifying', 'the', 'inclusion', 'of', 'the', 'information', 'regarding', 'the', 'timederivative', 'bounds', 'complexity', 'in', 'the', 'number', 'of', 'lmis', 'constraints', 'can', 'be', 'reduced', 'from', 'very', 'complex', 'to', 'linear', 'numerical', 'examples', 'are', 'provide', 'to', 'illustrate', 'the', 'advantages', 'of', 'the', 'proposed', 'methodology']] | [-0.13615727770285538, 0.06451367058504659, -0.024026810947151925, 0.045009376033424184, -0.12355356336607096, -0.15420489150654668, -0.0029480457227551737, 0.3133952352576531, -0.32896191143215847, -0.3121818376149839, 0.1830952706625864, -0.2652662231927164, -0.17778479526840293, 0.22205731860147074, -0.11417311121924566, 0.1420212588765515, 0.04565567682416608, 0.019290481978644563, -0.12000499484901621, -0.27193095655037236, 0.3277625658083707, 0.062290419184137136, 0.22839604112176368, 0.041397036836804964, 0.07871901629886661, -0.0462249281811707, -0.08623935781920758, 0.0657951730178096, -0.12009627969585451, 0.13217277051164553, 0.2806862142438499, 0.16169154584461537, 0.31123142194253606, -0.4260441593718357, -0.23354138284384346, 0.08404393222120304, 0.10638588616767755, 0.07271611517157558, -0.03450299951677712, -0.2686177616616568, 0.09164103985173054, -0.13862111323620552, -0.15192507631414068, -0.10729185897686805, -0.02071989303490577, 0.09295196914284204, -0.32228217707373774, 0.09939641308469269, 0.03569152612740604, 0.02223450497079354, -0.0696077039062332, -0.14360090481260648, -0.003162604264126947, 0.07809936985442899, 0.09441424663796519, -0.053033744389092766, 0.10293526741980503, -0.09159078177449723, -0.09772796818288043, 0.34749166613731247, -0.028476229400929205, -0.3069839648938236, 0.14843260544540288, -0.07998562885824448, -0.13195755092825634, 0.09335877827475787, 0.18416542301061922, 0.09474092836563404, -0.1544243329150889, 0.12392500794633704, -0.004304202201847847, 0.19097506117004043, 0.018567097247936405, 0.08776679226698783, 0.11823150214667504, 0.17174066196625623, 0.09731015003769873, 0.16755135607113167, -0.006994079816370056, -0.14411042058278467, -0.30462047916192275, -0.0887055638550709, -0.18255658003125483, -0.0467746266949689, -0.12808447723853952, -0.12668542691860168, 0.4011604367361332, 0.14786594356141555, 0.19986053270762427, 0.07865935917652678, 0.3040578515322592, 0.18913941261640643, 0.015161087109635655, 0.03738047832247013, 0.25473542933160875, 0.1649698991118035, 0.0725801140249062, -0.23718058628639063, 0.1223721537053979, 0.03660193523837034] |
1,802.0075 | Optimal probabilistic polynomial time compression and the Slepian-Wolf
theorem: tighter version and simple proofs | We give simplify the proofs of the 2 results in Marius Zimand's paper
"Kolmogorov complexity version of Slepian-Wolf coding, proceedings of STOC
2017, p22--32". The first is a universal polynomial time compression algorithm:
on input $\varepsilon > 0$, a number $k$ and a string $x$ it computes in
polynomial time with probability $1-\varepsilon$ a program that outputs $x$ and
has length $k + O(\log^2 (|x|/\varepsilon))$, provided that there exists such a
program of length at most $k$. The second result, is a distributed compression
algorithm, in which several parties each send some string to a common receiver.
Marius Zimand proved a variant of the Slepian-Wolf theorem using Kolmogorov
complexity (in stead of Shannon entropy).
With our simpler proof we improve the parameters of Zimand's result.
| cs.IT math.IT | we give simplify the proofs of the 2 results in marius zimands paper kolmogorov complexity version of slepianwolf coding proceedings of stoc 2017 p2232 the first is a universal polynomial time compression algorithm on input varepsilon 0 a number k and a string x it computes in polynomial time with probability 1varepsilon a program that outputs x and has length k olog2 xvarepsilon provided that there exists such a program of length at most k the second result is a distributed compression algorithm in which several parties each send some string to a common receiver marius zimand proved a variant of the slepianwolf theorem using kolmogorov complexity in stead of shannon entropy with our simpler proof we improve the parameters of zimands result | [['we', 'give', 'simplify', 'the', 'proofs', 'of', 'the', '2', 'results', 'in', 'marius', 'zimands', 'paper', 'kolmogorov', 'complexity', 'version', 'of', 'slepianwolf', 'coding', 'proceedings', 'of', 'stoc', '2017', 'p2232', 'the', 'first', 'is', 'a', 'universal', 'polynomial', 'time', 'compression', 'algorithm', 'on', 'input', 'varepsilon', '0', 'a', 'number', 'k', 'and', 'a', 'string', 'x', 'it', 'computes', 'in', 'polynomial', 'time', 'with', 'probability', '1varepsilon', 'a', 'program', 'that', 'outputs', 'x', 'and', 'has', 'length', 'k', 'olog2', 'xvarepsilon', 'provided', 'that', 'there', 'exists', 'such', 'a', 'program', 'of', 'length', 'at', 'most', 'k', 'the', 'second', 'result', 'is', 'a', 'distributed', 'compression', 'algorithm', 'in', 'which', 'several', 'parties', 'each', 'send', 'some', 'string', 'to', 'a', 'common', 'receiver', 'marius', 'zimand', 'proved', 'a', 'variant', 'of', 'the', 'slepianwolf', 'theorem', 'using', 'kolmogorov', 'complexity', 'in', 'stead', 'of', 'shannon', 'entropy', 'with', 'our', 'simpler', 'proof', 'we', 'improve', 'the', 'parameters', 'of', 'zimands', 'result']] | [-0.18873992485993465, 0.06466577100024248, -0.12309085063170641, 0.03926383640500717, -0.048701144258181256, -0.2216064948433389, 0.10360269756153381, 0.29174615677911786, -0.2993057654054913, -0.2641423201964547, 0.07719040967834492, -0.2516428094396057, -0.1274412289785687, 0.20025087860800947, -0.12555874895382052, 0.07970319880502454, 0.029291334950054686, 0.07762907099483224, -0.03907773503936672, -0.3441924612581109, 0.22891643178008964, 0.04200372213187317, 0.21363164013455388, 0.02633166271261871, 0.11809896259801463, 0.006120655790437013, -0.029771990643348546, -0.004583135216186444, -0.17304570244996284, 0.07766891098581255, 0.3147004657716025, 0.2090159476385452, 0.29609628521526854, -0.3466650818629811, -0.14749529400335934, 0.09391725643072277, 0.11190788800595328, 0.10310188638492643, -0.007487483622389846, -0.22206361193675547, 0.1300142101594247, -0.11824283993340336, -0.04917753206100315, 0.024208984252375863, 0.0621973856468685, 0.0005708165777226289, -0.2840453555031369, 0.026773691716759154, 0.13447852301954602, 0.027318166510667652, 0.014376437627167131, -0.1318323177518323, 0.0660186564840842, 0.06399886313204964, 0.010515883669722826, 0.14954052259757494, 0.05319897316318626, -0.05453860428436504, -0.16192996416939423, 0.31414116276816156, -0.055644641316030176, -0.15567670808522963, 0.11136387966253096, -0.09520532927320649, -0.19515091517629723, 0.15966442547505721, 0.14559075397555715, 0.11567094537895173, -0.05301857829714815, 0.1640188365932166, -0.12258840406623979, 0.26590265588214, 0.1651339713134803, 0.07446884079060206, 0.0489802444644738, 0.1275917704993238, 0.09620210682041944, 0.1692582539340947, -0.02058785896321448, -0.06725112333854971, -0.33713204741943625, -0.1797443619191957, -0.24575935721901868, 0.05990886768947045, -0.1539584720757072, -0.13733024170530067, 0.31565470929878453, 0.11129763609690903, 0.19097694115092356, 0.16570248604014826, 0.3102441987284692, 0.08511663701404662, -0.0246614797002015, 0.20210217382215584, 0.11077560970758592, 0.14811061624010716, 0.10449342929059639, -0.1502865472578075, 0.08101544266877075, 0.19267123269382863] |
1,802.00751 | Choquet-Deny groups and the infinite conjugacy class property | A countable discrete group $G$ is called Choquet-Deny if for every
non-degenerate probability measure $\mu$ on $G$ it holds that all bounded
$\mu$-harmonic functions are constant. We show that a finitely generated group
$G$ is Choquet-Deny if and only if it is virtually nilpotent. For general
countable discrete groups, we show that $G$ is Choquet-Deny if and only if none
of its quotients has the infinite conjugacy class property. Moreover, when $G$
is not Choquet-Deny, then this is witnessed by a symmetric, finite entropy,
non-degenerate measure.
| math.GR math.DS math.PR | a countable discrete group g is called choquetdeny if for every nondegenerate probability measure mu on g it holds that all bounded muharmonic functions are constant we show that a finitely generated group g is choquetdeny if and only if it is virtually nilpotent for general countable discrete groups we show that g is choquetdeny if and only if none of its quotients has the infinite conjugacy class property moreover when g is not choquetdeny then this is witnessed by a symmetric finite entropy nondegenerate measure | [['a', 'countable', 'discrete', 'group', 'g', 'is', 'called', 'choquetdeny', 'if', 'for', 'every', 'nondegenerate', 'probability', 'measure', 'mu', 'on', 'g', 'it', 'holds', 'that', 'all', 'bounded', 'muharmonic', 'functions', 'are', 'constant', 'we', 'show', 'that', 'a', 'finitely', 'generated', 'group', 'g', 'is', 'choquetdeny', 'if', 'and', 'only', 'if', 'it', 'is', 'virtually', 'nilpotent', 'for', 'general', 'countable', 'discrete', 'groups', 'we', 'show', 'that', 'g', 'is', 'choquetdeny', 'if', 'and', 'only', 'if', 'none', 'of', 'its', 'quotients', 'has', 'the', 'infinite', 'conjugacy', 'class', 'property', 'moreover', 'when', 'g', 'is', 'not', 'choquetdeny', 'then', 'this', 'is', 'witnessed', 'by', 'a', 'symmetric', 'finite', 'entropy', 'nondegenerate', 'measure']] | [-0.15136922937059819, 0.20759516338232992, -0.10497607747201136, 0.04062257810133011, -0.1390709568973804, -0.1862352533742439, 0.007855826988816261, 0.4398532044575658, -0.3253107369812422, -0.129308715116146, 0.12569072924630154, -0.28773242209193317, -0.1240370029605232, 0.21208475777191696, -0.12188148295485177, -0.06077578774894328, 0.09962077097707363, 0.19717002887452065, -0.032588996764727284, -0.2859796633900598, 0.3629702606108473, -0.14281053508653543, 0.2261046806680645, 0.0752931529829322, 0.1738335610540627, -0.01351163478914735, 0.02302266929710154, 0.053581922509989076, -0.11706862923935216, -0.0015903726879366521, 0.2735819290013074, 0.12113065819383252, 0.3155136038440951, -0.2592301361819832, -0.20199634613425926, 0.3187180354021663, 0.07571485713882328, -0.04223784665728724, -0.07556136529269997, -0.23794198233287694, 0.23441850582440926, -0.20150997329416664, -0.11682756866198467, -0.05196204497803782, 0.20020151985700912, -0.013165533466827731, -0.2628426137921769, 0.005448785247714367, 0.12615815197052652, 0.033838716725450614, 0.012976191909496435, -0.020649535798902222, -0.12345815755881716, 0.07857351032861368, -0.03594059314643747, 0.04113368062454081, 0.06403044218584614, -0.0009771137427928489, -0.06503456237801719, 0.42766363003702706, -0.11112188733031236, -0.2496884959901488, 0.13020909451446389, -0.24536376269425936, -0.22825693504798206, 0.12194850515076068, 0.020974669746274866, 0.18680128230453405, -0.04402311034531056, 0.27156810413607463, -0.19285829873149132, 0.14171559440356485, 0.061203726951769274, -0.026381614582131205, 0.09465748377057702, 0.05465827900699751, 0.17677061496908927, 0.09216970419727785, 0.08712586693920542, 0.08577374875177304, -0.3622955831829025, -0.14030558843880372, -0.2315075935289632, 0.13968759311141776, -0.06670985763945324, -0.1850506378321497, 0.32193039045777433, 0.027255376178208134, 0.08087159805866175, 0.14955303188803237, 0.21791913997122023, 0.12713141540108724, 0.046436494053882914, 0.17451244576964095, 0.10602868042972892, 0.1999874703483223, -0.18609566474874872, -0.12306168582831878, 0.04505820201471621, 0.16333720538014584] |
1,802.00752 | Deep Convolutional Neural Networks for Breast Cancer Histology Image
Analysis | Breast cancer is one of the main causes of cancer death worldwide. Early
diagnostics significantly increases the chances of correct treatment and
survival, but this process is tedious and often leads to a disagreement between
pathologists. Computer-aided diagnosis systems showed potential for improving
the diagnostic accuracy. In this work, we develop the computational approach
based on deep convolution neural networks for breast cancer histology image
classification. Hematoxylin and eosin stained breast histology microscopy image
dataset is provided as a part of the ICIAR 2018 Grand Challenge on Breast
Cancer Histology Images. Our approach utilizes several deep neural network
architectures and gradient boosted trees classifier. For 4-class classification
task, we report 87.2% accuracy. For 2-class classification task to detect
carcinomas we report 93.8% accuracy, AUC 97.3%, and sensitivity/specificity
96.5/88.0% at the high-sensitivity operating point. To our knowledge, this
approach outperforms other common methods in automated histopathological image
classification. The source code for our approach is made publicly available at
https://github.com/alexander-rakhlin/ICIAR2018
| cs.CV | breast cancer is one of the main causes of cancer death worldwide early diagnostics significantly increases the chances of correct treatment and survival but this process is tedious and often leads to a disagreement between pathologists computeraided diagnosis systems showed potential for improving the diagnostic accuracy in this work we develop the computational approach based on deep convolution neural networks for breast cancer histology image classification hematoxylin and eosin stained breast histology microscopy image dataset is provided as a part of the iciar 2018 grand challenge on breast cancer histology images our approach utilizes several deep neural network architectures and gradient boosted trees classifier for 4class classification task we report 872 accuracy for 2class classification task to detect carcinomas we report 938 accuracy auc 973 and sensitivityspecificity 965880 at the highsensitivity operating point to our knowledge this approach outperforms other common methods in automated histopathological image classification the source code for our approach is made publicly available at httpsgithubcomalexanderrakhliniciar2018 | [['breast', 'cancer', 'is', 'one', 'of', 'the', 'main', 'causes', 'of', 'cancer', 'death', 'worldwide', 'early', 'diagnostics', 'significantly', 'increases', 'the', 'chances', 'of', 'correct', 'treatment', 'and', 'survival', 'but', 'this', 'process', 'is', 'tedious', 'and', 'often', 'leads', 'to', 'a', 'disagreement', 'between', 'pathologists', 'computeraided', 'diagnosis', 'systems', 'showed', 'potential', 'for', 'improving', 'the', 'diagnostic', 'accuracy', 'in', 'this', 'work', 'we', 'develop', 'the', 'computational', 'approach', 'based', 'on', 'deep', 'convolution', 'neural', 'networks', 'for', 'breast', 'cancer', 'histology', 'image', 'classification', 'hematoxylin', 'and', 'eosin', 'stained', 'breast', 'histology', 'microscopy', 'image', 'dataset', 'is', 'provided', 'as', 'a', 'part', 'of', 'the', 'iciar', '2018', 'grand', 'challenge', 'on', 'breast', 'cancer', 'histology', 'images', 'our', 'approach', 'utilizes', 'several', 'deep', 'neural', 'network', 'architectures', 'and', 'gradient', 'boosted', 'trees', 'classifier', 'for', '4class', 'classification', 'task', 'we', 'report', '872', 'accuracy', 'for', '2class', 'classification', 'task', 'to', 'detect', 'carcinomas', 'we', 'report', '938', 'accuracy', 'auc', '973', 'and', 'sensitivityspecificity', '965880', 'at', 'the', 'highsensitivity', 'operating', 'point', 'to', 'our', 'knowledge', 'this', 'approach', 'outperforms', 'other', 'common', 'methods', 'in', 'automated', 'histopathological', 'image', 'classification', 'the', 'source', 'code', 'for', 'our', 'approach', 'is', 'made', 'publicly', 'available', 'at', 'httpsgithubcomalexanderrakhliniciar2018']] | [0.01347405279263442, -0.08660824822548491, -0.02456934566502101, 0.07253572838618101, -0.060127023103026055, -0.19056370343941337, 0.04271323929088584, 0.42553078466787553, -0.14103423304652843, -0.3239287194342185, 0.09314353444810528, -0.31413554582888115, -0.21398128804568656, 0.25634582564546293, -0.18831184729097936, 0.08290747840864918, 0.20036361072039327, 0.017139481416401956, 0.03613178472882376, -0.3664297590700862, 0.2442190098674753, 0.06570683125643811, 0.4102544290138982, 0.08382858105827697, 0.12316737397729109, -0.03376440524581808, -0.08492951904265329, -0.07325387901390712, -0.042843136470764875, 0.17217892753288674, 0.3896038136444986, 0.24175380813913086, 0.34037555180167633, -0.3638404338519486, -0.22022587987176406, 0.11097868425676073, 0.17000941244455484, 0.11381136059152105, -0.017182105254435625, -0.308192370328097, 0.07358568103219836, -0.13717736470966768, -0.012134438467164261, -0.11017955327406526, -0.012256776150584651, -0.08409524134969196, -0.28802765933020663, 0.1447287370235874, 0.0021806737700572764, 0.16885330607720578, -0.09997908782082586, -0.15511297972466892, 0.048444102152596966, 0.1800146319109421, 0.010013067376768539, 0.14084235947423926, 0.18970325445750347, -0.2172442164633256, -0.13396428638579658, 0.2971174494626048, 0.0026106523373761238, -0.128260098117141, 0.21839565449268916, -0.035502694484491185, -0.17609715881591023, 0.12917735934173927, 0.20731255465608017, 0.13944069498654407, -0.18040544344171977, -0.06988393974480016, 0.047307955560823664, 0.1933549982773585, 0.09052360042905769, -0.11363328129160576, 0.1512045630086691, 0.3345393693695466, -0.06541956617281987, 0.11558114080010758, -0.2230116001342256, 0.03898900082239356, -0.17682902335237044, -0.15537875392235434, -0.11686547083230928, -0.012036508386536764, -0.07681151860621564, -0.19487213240100595, 0.3937628304299254, 0.22348696189240003, 0.13425679369053492, 0.0952075946447738, 0.3534183156234809, -0.0676362696208227, 0.13176774746478678, -0.02037105716403741, 0.1866907259891144, 0.026484150270847842, 0.10447974088497293, -0.2255555672618823, 0.09463373966252384, 0.08489781504687972] |
1,802.00753 | Effect of time of day on reward circuitry. A discussion of Byrne et al.
2017 | Byrne and colleagues present a paper on a timely topic with potentially
important results. However, we think that issues in the design and analysis
complicate the interpretation and limit the generalizability of the findings.
Specifically, the details of the small volume correction used in the primary
analysis are not adequately described and, moreover, the results do not appear
to be corroborated by the whole-brain analysis. In addition, the follow-up
multilevel modeling, which is fundamental to the conclusions of the paper, is
inherently circular thereby guaranteeing discovery of the reported effect.
Finally, the study does not control for other factors that vary over the course
of the day and are known to impact MRI measurements, and fails to link the
neural results directly to any relevant behavior.
| q-bio.NC | byrne and colleagues present a paper on a timely topic with potentially important results however we think that issues in the design and analysis complicate the interpretation and limit the generalizability of the findings specifically the details of the small volume correction used in the primary analysis are not adequately described and moreover the results do not appear to be corroborated by the wholebrain analysis in addition the followup multilevel modeling which is fundamental to the conclusions of the paper is inherently circular thereby guaranteeing discovery of the reported effect finally the study does not control for other factors that vary over the course of the day and are known to impact mri measurements and fails to link the neural results directly to any relevant behavior | [['byrne', 'and', 'colleagues', 'present', 'a', 'paper', 'on', 'a', 'timely', 'topic', 'with', 'potentially', 'important', 'results', 'however', 'we', 'think', 'that', 'issues', 'in', 'the', 'design', 'and', 'analysis', 'complicate', 'the', 'interpretation', 'and', 'limit', 'the', 'generalizability', 'of', 'the', 'findings', 'specifically', 'the', 'details', 'of', 'the', 'small', 'volume', 'correction', 'used', 'in', 'the', 'primary', 'analysis', 'are', 'not', 'adequately', 'described', 'and', 'moreover', 'the', 'results', 'do', 'not', 'appear', 'to', 'be', 'corroborated', 'by', 'the', 'wholebrain', 'analysis', 'in', 'addition', 'the', 'followup', 'multilevel', 'modeling', 'which', 'is', 'fundamental', 'to', 'the', 'conclusions', 'of', 'the', 'paper', 'is', 'inherently', 'circular', 'thereby', 'guaranteeing', 'discovery', 'of', 'the', 'reported', 'effect', 'finally', 'the', 'study', 'does', 'not', 'control', 'for', 'other', 'factors', 'that', 'vary', 'over', 'the', 'course', 'of', 'the', 'day', 'and', 'are', 'known', 'to', 'impact', 'mri', 'measurements', 'and', 'fails', 'to', 'link', 'the', 'neural', 'results', 'directly', 'to', 'any', 'relevant', 'behavior']] | [-0.08071942746432291, 0.07156810102733, -0.08227672463371641, 0.0561593080711891, -0.11927164579179907, -0.09791581780004818, 0.0637751242870258, 0.35319962625258733, -0.23258088872627547, -0.32761002769545905, 0.1454291669919806, -0.262178383845215, -0.20211069250390643, 0.23141222976477047, -0.09535642220113899, 0.035334256595917164, 0.10236737606233902, 0.02688964716498814, -0.04697993762850288, -0.2511638757728395, 0.3023216021653738, 0.10796413306767742, 0.2899293675131741, 0.11099025566640887, 0.023782188564331994, 0.016162957434379864, -0.1046524400719338, 0.04486196669602087, -0.1284284164787442, 0.1344367038118579, 0.2649387020381197, 0.13693980946545564, 0.28137742896519957, -0.42348174617019674, -0.22415360646499766, 0.08613196765682438, 0.16580361775344327, 0.09940654511049775, -0.01632129769155105, -0.2575936687164127, 0.10625868046005803, -0.12542173107864246, -0.12933589138149743, -0.1041649888890485, -0.01353296753950417, 0.014608351677474101, -0.24527260217638241, 0.056033400109126455, 0.11338927944944728, 0.04094303303974725, -0.08086886513139313, -0.08674782096770489, 0.021499807857686563, 0.17553792787819272, 0.07515372402526231, 0.009111677172652904, 0.1277392021554064, -0.13853881554678082, -0.11078917436137249, 0.3835188449685654, -0.029944352475309095, -0.18792801572837764, 0.204993633442514, -0.1529831177858074, -0.16372003336067473, 0.09393342375932705, 0.16941365877550746, 0.08630371042287037, -0.14549021688216027, 0.010852361943386587, -0.0051607677143894965, 0.1935474659124064, -0.003042534239486688, 0.03461457360240202, 0.18332929593244834, 0.15575764387003369, -0.007467330919416059, 0.07195629338486238, -0.09423497891134863, -0.08125572757137614, -0.2930785023222958, -0.13283255025892268, -0.14023289581879028, 0.0046031365852705055, -0.02362280785007262, -0.13445323174828588, 0.40107983020725585, 0.21323088434569182, 0.20828289173853895, 0.028449640499376174, 0.2976731693460828, 0.08654927256025581, 0.07880396006022772, 0.04916658823097509, 0.25926957269095713, 0.09435063258500859, 0.11184135243381625, -0.2162985051390789, 0.12265875631350182, -0.021124430799058506] |
1,802.00754 | Signal Processing for MIMO-NOMA: Present and Future Challenges | Non-orthogonal multiple access (NOMA), as the newest member of the multiple
access family, is envisioned to be an essential component of 5G mobile
networks. The combination of NOMA and multi-antenna multi-input multi-output
(MIMO) technologies exhibits a significant potential in improving spectral
efficiency and providing better wireless services to more users. In this
article, we introduce the basic concepts of MIMO-NOMA and summarize the key
technical problems in MIMO-NOMA systems. Then, we explore the problem
formulation, beamforming, user clustering, and power allocation of
single/multi-cluster MIMO-NOMA in the literature along with their limitations.
Furthermore, we point out an important issue of the stability of successive
interference cancellation (SIC) that arises using achievable rates as
performance metrics in practical NOMA/MIMO-NOMA systems. Finally, we discuss
incorporating NOMA with massive/millimeter wave MIMO, and identify the main
challenges and possible future research directions in this area.
| cs.IT math.IT | nonorthogonal multiple access noma as the newest member of the multiple access family is envisioned to be an essential component of 5g mobile networks the combination of noma and multiantenna multiinput multioutput mimo technologies exhibits a significant potential in improving spectral efficiency and providing better wireless services to more users in this article we introduce the basic concepts of mimonoma and summarize the key technical problems in mimonoma systems then we explore the problem formulation beamforming user clustering and power allocation of singlemulticluster mimonoma in the literature along with their limitations furthermore we point out an important issue of the stability of successive interference cancellation sic that arises using achievable rates as performance metrics in practical nomamimonoma systems finally we discuss incorporating noma with massivemillimeter wave mimo and identify the main challenges and possible future research directions in this area | [['nonorthogonal', 'multiple', 'access', 'noma', 'as', 'the', 'newest', 'member', 'of', 'the', 'multiple', 'access', 'family', 'is', 'envisioned', 'to', 'be', 'an', 'essential', 'component', 'of', '5g', 'mobile', 'networks', 'the', 'combination', 'of', 'noma', 'and', 'multiantenna', 'multiinput', 'multioutput', 'mimo', 'technologies', 'exhibits', 'a', 'significant', 'potential', 'in', 'improving', 'spectral', 'efficiency', 'and', 'providing', 'better', 'wireless', 'services', 'to', 'more', 'users', 'in', 'this', 'article', 'we', 'introduce', 'the', 'basic', 'concepts', 'of', 'mimonoma', 'and', 'summarize', 'the', 'key', 'technical', 'problems', 'in', 'mimonoma', 'systems', 'then', 'we', 'explore', 'the', 'problem', 'formulation', 'beamforming', 'user', 'clustering', 'and', 'power', 'allocation', 'of', 'singlemulticluster', 'mimonoma', 'in', 'the', 'literature', 'along', 'with', 'their', 'limitations', 'furthermore', 'we', 'point', 'out', 'an', 'important', 'issue', 'of', 'the', 'stability', 'of', 'successive', 'interference', 'cancellation', 'sic', 'that', 'arises', 'using', 'achievable', 'rates', 'as', 'performance', 'metrics', 'in', 'practical', 'nomamimonoma', 'systems', 'finally', 'we', 'discuss', 'incorporating', 'noma', 'with', 'massivemillimeter', 'wave', 'mimo', 'and', 'identify', 'the', 'main', 'challenges', 'and', 'possible', 'future', 'research', 'directions', 'in', 'this', 'area']] | [-0.2753128687962448, -0.04513303244152501, 0.018938541641785173, 0.00867547111391994, -0.0700427532182449, -0.21578186977124453, 0.07750457846797514, 0.3850839309068057, -0.26932782484694334, -0.2289548409511301, 0.07633405087862409, -0.25889116012742813, -0.23665583890312128, 0.1591868162270717, -0.12232354471976631, 0.07688290525540492, 0.04885061083184759, -0.01764350748165463, -0.05456873241099903, -0.27150432917248646, 0.3428679850108813, 0.16338170511158603, 0.38472820674307157, 0.07035744361525034, 0.0422167795078054, 0.007604969729988897, -0.055497104723523136, -0.0731039454507893, -0.07971188361782208, 0.13415753668306707, 0.3913903906907424, 0.2440711023544308, 0.326455505517223, -0.39701217344289064, -0.27830937701314823, 0.058514418967584844, 0.23574466988389944, 0.03328508190554907, -0.08884316225194994, -0.2741434119546609, 0.12635426803612673, -0.25851359237393323, -0.09470162911673695, -0.009096181645554348, -0.11680133444304666, 0.06692154715636432, -0.30425415591194027, -0.006045118722058561, 0.01316825286179346, 0.045035440495142534, -0.06747071658444666, -0.16519203051129341, 0.08301464574629047, 0.1776674620766383, 0.06044612748949469, -0.021358564538527688, 0.053716324759225775, -0.12562538957840214, -0.1871571734846726, 0.4058320044559413, 0.03968989159563475, -0.21101496848583656, 0.1791529194842752, -0.07413858153949063, -0.15711045921712188, 0.08762470160077333, 0.26845794528625894, 0.0470763792005116, -0.20398262633693942, 0.022948843165280394, 0.013052437808062969, 0.11684864419652659, 0.08240689425117398, 0.18077775286119704, 0.2070772529046058, 0.24825710331490874, 0.14842379131578726, 0.13032893889182567, -0.128719540652785, -0.1349003842295093, -0.2038884179906267, -0.15001981149352814, -0.1728032081095624, 0.020642151242359134, -0.09552400461742212, -0.07953505787699328, 0.39832570365745656, 0.19590875855647027, 0.07569151001992588, 0.047519182429451794, 0.40567472899319046, 0.08452753371722235, 0.07615229671134403, 0.09070416151403185, 0.18728719338992217, 0.11069922473104875, 0.17358795126835708, -0.2029871043619992, -0.009783036119719275, -0.047790694767677215] |
1,802.00755 | Geometrization of almost extremal representations in $\text{PSL}_2\Bbb
R$ | Let $S$ be a closed surface of genus $g$. In this paper, we investigate the
relationship between hyperbolic cone-structure on $S$ and representations of
the fundamental group into $\text{PSL}_2\Bbb R$. We consider surfaces of genus
greater than $g$ and we show that, under suitable conditions, every
representation $\rho:\pi_1 S\longrightarrow \text{PSL}_2\Bbb R$ with Euler
number $\mathcal{E}(\rho)=\pm\big(\chi(S)+1\big)$ arises as holonomy of a
hyperbolic cone-structure $\sigma$ on $S$ with a single cone point of angle
$4\pi$. From this result, we derive that for surfaces of genus $2$ every
representation with $\mathcal{E}(\rho)=\pm1$ arises as the holonomy of some
hyperbolic cone-structure.
| math.GT | let s be a closed surface of genus g in this paper we investigate the relationship between hyperbolic conestructure on s and representations of the fundamental group into textpsl_2bbb r we consider surfaces of genus greater than g and we show that under suitable conditions every representation rhopi_1 slongrightarrow textpsl_2bbb r with euler number mathcalerhopmbigchis1big arises as holonomy of a hyperbolic conestructure sigma on s with a single cone point of angle 4pi from this result we derive that for surfaces of genus 2 every representation with mathcalerhopm1 arises as the holonomy of some hyperbolic conestructure | [['let', 's', 'be', 'a', 'closed', 'surface', 'of', 'genus', 'g', 'in', 'this', 'paper', 'we', 'investigate', 'the', 'relationship', 'between', 'hyperbolic', 'conestructure', 'on', 's', 'and', 'representations', 'of', 'the', 'fundamental', 'group', 'into', 'textpsl_2bbb', 'r', 'we', 'consider', 'surfaces', 'of', 'genus', 'greater', 'than', 'g', 'and', 'we', 'show', 'that', 'under', 'suitable', 'conditions', 'every', 'representation', 'rhopi_1', 'slongrightarrow', 'textpsl_2bbb', 'r', 'with', 'euler', 'number', 'mathcalerhopmbigchis1big', 'arises', 'as', 'holonomy', 'of', 'a', 'hyperbolic', 'conestructure', 'sigma', 'on', 's', 'with', 'a', 'single', 'cone', 'point', 'of', 'angle', '4pi', 'from', 'this', 'result', 'we', 'derive', 'that', 'for', 'surfaces', 'of', 'genus', '2', 'every', 'representation', 'with', 'mathcalerhopm1', 'arises', 'as', 'the', 'holonomy', 'of', 'some', 'hyperbolic', 'conestructure']] | [-0.21347463077875556, 0.12762599527305094, -0.09599145743194767, 0.008104586180159322, -0.06767065278054164, -0.1675895994018403, 0.015993335726170208, 0.3389139287374032, -0.26586916133190597, -0.24620136620617042, 0.05922011041047392, -0.2716932030149325, -0.16809670644642044, 0.22393324490266062, -0.12404112287506622, -0.04888603396172966, 0.05486999224290572, 0.09812226704251702, -0.13308510699519707, -0.20006098867624358, 0.39828940797897594, -0.09772868789932741, 0.16265246592542176, 0.06104276161728507, 0.12629428913476326, 0.015613469941120955, 0.028858110373739594, 0.03959283296529564, -0.1870602883796911, 0.11302932078439382, 0.24573855694904123, 0.06210712333940851, 0.18744497744226327, -0.3747469821953595, -0.21140028288968468, 0.17510288594771298, 0.08032965014177945, -0.025261770152757244, -0.011717572377654173, -0.23819454761362205, 0.12314196506024448, -0.10547124845055883, -0.19044314489089031, -0.0027063852276212426, 0.09241564804187385, -0.03026081294181847, -0.19277825995638806, 0.009334745015122837, 0.0815697467775755, 0.11805632086570865, 0.0180786194690373, -0.13653773188050236, -0.09629728358679561, 0.0849068830120227, 0.0341833217697899, 0.09469588684488929, 0.029891149442572828, -0.10450630459899424, -0.05679307672225179, 0.4043820425066897, -0.1196869134244832, -0.2371375016387432, 0.11007288206488855, -0.19515987614830654, -0.1326309698834134, 0.11370402352223473, 0.16368826805684034, 0.16294226562103598, -0.017829877244288563, 0.18566228397145507, -0.12473952333613109, 0.11451616610421658, 0.11588853142995348, -0.038138891455106516, 0.15317557323586337, 0.1285816775735027, 0.11085760134762974, 0.13782329470424923, -0.0687465406253293, 0.055177490206895975, -0.3701157751743511, -0.22656740602957065, -0.11755108280277621, 0.1957071326592917, -0.11618200867275347, -0.16883087585810372, 0.3842202858418547, 0.03713506414124402, 0.1906297952437433, 0.13106606247764763, 0.19457678437753712, 0.08181741337669933, 0.019277633060150408, 0.1280991363098785, 0.07716491776024072, 0.17043670782599077, -0.08138422766620274, -0.15785201144985533, -0.038287953523698674, 0.1664995552060665] |
1,802.00756 | Infinitary and Cyclic Proof Systems for Transitive Closure Logic | Transitive closure logic is a known extension of first-order logic obtained
by introducing a transitive closure operator. While other extensions of
first-order logic with inductive definitions are a priori parametrized by a set
of inductive definitions, the addition of the transitive closure operator
uniformly captures all finitary inductive definitions. In this paper we present
an infinitary proof system for transitive closure logic which is an infinite
descent-style counterpart to the existing (explicit induction) proof system for
the logic. We show that, as for similar systems for first-order logic with
inductive definitions, our infinitary system is complete for the standard
semantics and subsumes the explicit system. Moreover, the uniformity of the
transitive closure operator allows semantically meaningful complete
restrictions to be defined using simple syntactic criteria. Consequently, the
restriction to regular infinitary (i.e. cyclic) proofs provides the basis for
an effective system for automating inductive reasoning.
| cs.LO | transitive closure logic is a known extension of firstorder logic obtained by introducing a transitive closure operator while other extensions of firstorder logic with inductive definitions are a priori parametrized by a set of inductive definitions the addition of the transitive closure operator uniformly captures all finitary inductive definitions in this paper we present an infinitary proof system for transitive closure logic which is an infinite descentstyle counterpart to the existing explicit induction proof system for the logic we show that as for similar systems for firstorder logic with inductive definitions our infinitary system is complete for the standard semantics and subsumes the explicit system moreover the uniformity of the transitive closure operator allows semantically meaningful complete restrictions to be defined using simple syntactic criteria consequently the restriction to regular infinitary ie cyclic proofs provides the basis for an effective system for automating inductive reasoning | [['transitive', 'closure', 'logic', 'is', 'a', 'known', 'extension', 'of', 'firstorder', 'logic', 'obtained', 'by', 'introducing', 'a', 'transitive', 'closure', 'operator', 'while', 'other', 'extensions', 'of', 'firstorder', 'logic', 'with', 'inductive', 'definitions', 'are', 'a', 'priori', 'parametrized', 'by', 'a', 'set', 'of', 'inductive', 'definitions', 'the', 'addition', 'of', 'the', 'transitive', 'closure', 'operator', 'uniformly', 'captures', 'all', 'finitary', 'inductive', 'definitions', 'in', 'this', 'paper', 'we', 'present', 'an', 'infinitary', 'proof', 'system', 'for', 'transitive', 'closure', 'logic', 'which', 'is', 'an', 'infinite', 'descentstyle', 'counterpart', 'to', 'the', 'existing', 'explicit', 'induction', 'proof', 'system', 'for', 'the', 'logic', 'we', 'show', 'that', 'as', 'for', 'similar', 'systems', 'for', 'firstorder', 'logic', 'with', 'inductive', 'definitions', 'our', 'infinitary', 'system', 'is', 'complete', 'for', 'the', 'standard', 'semantics', 'and', 'subsumes', 'the', 'explicit', 'system', 'moreover', 'the', 'uniformity', 'of', 'the', 'transitive', 'closure', 'operator', 'allows', 'semantically', 'meaningful', 'complete', 'restrictions', 'to', 'be', 'defined', 'using', 'simple', 'syntactic', 'criteria', 'consequently', 'the', 'restriction', 'to', 'regular', 'infinitary', 'ie', 'cyclic', 'proofs', 'provides', 'the', 'basis', 'for', 'an', 'effective', 'system', 'for', 'automating', 'inductive', 'reasoning']] | [-0.12824456442022994, 0.04402160253195891, -0.06690995847909814, 0.13619586860457072, -0.2078758629213553, -0.14830495023892987, 0.057980190897069406, 0.3310892591252923, -0.3140494176704023, -0.23086728332822937, 0.07390330977230203, -0.23552190676542117, -0.08239375126625721, 0.20078323993948288, -0.15003856079824296, 0.04996736995073863, 0.020084310161312006, 0.12217407036061761, -0.11328946332408425, -0.18834113403702052, 0.34395566060751054, -0.04713330091585198, 0.21677790232934058, 0.03981704337962179, 0.15605741238596238, 0.040907367379178244, 0.0012033873451097559, 0.09199675894989115, -0.10955801139410444, 0.1271193220034345, 0.3484920169365877, 0.20664913015854028, 0.2394084351318371, -0.40976675033905646, -0.12216625722875404, 0.09860103412211174, 0.08945173308731885, 0.06847994203902392, 0.028053050104063004, -0.31161856403276844, 0.11591433089213549, -0.23528582923204844, -0.0712401679451836, -0.15936143003313596, 0.08800754948444794, 0.01950053827951908, -0.27054626257288167, -0.05509650070942169, 0.3243231686970426, 0.17727109573186478, -0.04266873396934696, -0.05507491216849303, 0.02089693189999606, 0.04087993634554247, -0.08065973626313887, -0.01218218277143832, 0.10196400594819958, -0.014346632962567836, -0.19465043732472825, 0.31731984660857254, -0.045564475506479435, -0.22275131431848016, 0.15585466778268003, -0.046306478098914444, -0.17947432711500572, 0.08548498922351024, 0.008876602695737448, 0.12138394214626816, -0.15187963347610398, 0.16989267361633312, -0.07610734294091041, 0.21201804189816661, 0.10379265042785038, 0.06545686509343795, 0.16044804372035693, 0.20552325214440417, 0.10828550972251429, 0.17465041555139274, 0.1329029124010251, -0.10204599664171433, -0.3982834740955796, -0.13656482149639892, -0.0419665482356019, -0.013679630975174304, -0.11700028985625169, -0.25270433617535876, 0.36155845671116066, 0.16193793498678133, 0.08437630862075214, 0.20925474477230133, 0.32521741599258447, 0.14687138599492755, 0.09317434194213092, 0.03530487701209495, 0.13499461635850216, 0.1865237946654411, 0.030403949013917655, -0.14947003849536283, 0.1105242323990549, 0.2123924717210078] |
1,802.00757 | Submodularity-Inspired Data Selection for Goal-Oriented Chatbot Training
Based on Sentence Embeddings | Spoken language understanding (SLU) systems, such as goal-oriented chatbots
or personal assistants, rely on an initial natural language understanding (NLU)
module to determine the intent and to extract the relevant information from the
user queries they take as input. SLU systems usually help users to solve
problems in relatively narrow domains and require a large amount of in-domain
training data. This leads to significant data availability issues that inhibit
the development of successful systems. To alleviate this problem, we propose a
technique of data selection in the low-data regime that enables us to train
with fewer labeled sentences, thus smaller labelling costs.
We propose a submodularity-inspired data ranking function, the ratio-penalty
marginal gain, for selecting data points to label based only on the information
extracted from the textual embedding space. We show that the distances in the
embedding space are a viable source of information that can be used for data
selection. Our method outperforms two known active learning techniques and
enables cost-efficient training of the NLU unit. Moreover, our proposed
selection technique does not need the model to be retrained in between the
selection steps, making it time efficient as well.
| cs.CL | spoken language understanding slu systems such as goaloriented chatbots or personal assistants rely on an initial natural language understanding nlu module to determine the intent and to extract the relevant information from the user queries they take as input slu systems usually help users to solve problems in relatively narrow domains and require a large amount of indomain training data this leads to significant data availability issues that inhibit the development of successful systems to alleviate this problem we propose a technique of data selection in the lowdata regime that enables us to train with fewer labeled sentences thus smaller labelling costs we propose a submodularityinspired data ranking function the ratiopenalty marginal gain for selecting data points to label based only on the information extracted from the textual embedding space we show that the distances in the embedding space are a viable source of information that can be used for data selection our method outperforms two known active learning techniques and enables costefficient training of the nlu unit moreover our proposed selection technique does not need the model to be retrained in between the selection steps making it time efficient as well | [['spoken', 'language', 'understanding', 'slu', 'systems', 'such', 'as', 'goaloriented', 'chatbots', 'or', 'personal', 'assistants', 'rely', 'on', 'an', 'initial', 'natural', 'language', 'understanding', 'nlu', 'module', 'to', 'determine', 'the', 'intent', 'and', 'to', 'extract', 'the', 'relevant', 'information', 'from', 'the', 'user', 'queries', 'they', 'take', 'as', 'input', 'slu', 'systems', 'usually', 'help', 'users', 'to', 'solve', 'problems', 'in', 'relatively', 'narrow', 'domains', 'and', 'require', 'a', 'large', 'amount', 'of', 'indomain', 'training', 'data', 'this', 'leads', 'to', 'significant', 'data', 'availability', 'issues', 'that', 'inhibit', 'the', 'development', 'of', 'successful', 'systems', 'to', 'alleviate', 'this', 'problem', 'we', 'propose', 'a', 'technique', 'of', 'data', 'selection', 'in', 'the', 'lowdata', 'regime', 'that', 'enables', 'us', 'to', 'train', 'with', 'fewer', 'labeled', 'sentences', 'thus', 'smaller', 'labelling', 'costs', 'we', 'propose', 'a', 'submodularityinspired', 'data', 'ranking', 'function', 'the', 'ratiopenalty', 'marginal', 'gain', 'for', 'selecting', 'data', 'points', 'to', 'label', 'based', 'only', 'on', 'the', 'information', 'extracted', 'from', 'the', 'textual', 'embedding', 'space', 'we', 'show', 'that', 'the', 'distances', 'in', 'the', 'embedding', 'space', 'are', 'a', 'viable', 'source', 'of', 'information', 'that', 'can', 'be', 'used', 'for', 'data', 'selection', 'our', 'method', 'outperforms', 'two', 'known', 'active', 'learning', 'techniques', 'and', 'enables', 'costefficient', 'training', 'of', 'the', 'nlu', 'unit', 'moreover', 'our', 'proposed', 'selection', 'technique', 'does', 'not', 'need', 'the', 'model', 'to', 'be', 'retrained', 'in', 'between', 'the', 'selection', 'steps', 'making', 'it', 'time', 'efficient', 'as', 'well']] | [-0.05452682882100099, 0.0058167037579359634, -0.05088500615307375, 0.10941180312197263, -0.20315432268145836, -0.1770882769536815, 0.102561703984209, 0.42028841200823847, -0.28790862520568467, -0.3581948500518736, 0.0896061675610805, -0.2727759883432698, -0.11980635686838803, 0.21243631643561744, -0.1377353588364234, 0.056777415310008156, 0.1342714562148199, 0.04277160295138233, -0.03323311642988732, -0.2737903645801309, 0.3140337736566404, 0.044514045026153325, 0.3434805888927689, 0.017493298497835274, 0.11642103342608989, 0.01543516775004958, -0.05040630743728559, -0.037436544944495456, -0.059292021922699764, 0.17681840062570317, 0.3674895769573356, 0.248820339584429, 0.3414509942068865, -0.42861322988020745, -0.22132458993000909, 0.11334175325403185, 0.16648618038376106, 0.13961326795948767, -0.036421712023500155, -0.29843951299369925, 0.07441368072636817, -0.15344563360068653, 0.0019239626432719984, -0.14883943792726648, -0.018276351211457757, -0.019247563814401233, -0.3177222623832916, 0.003328134095002162, 0.07506499564532484, 0.032196533709372345, -0.03246090219748256, -0.07989320704149769, 0.008469310168814111, 0.2016287207517675, 0.03923674936859722, 0.0596599863909528, 0.12644339364365134, -0.15180568284335766, -0.12569668115557808, 0.3923734565780155, -0.021618596920253415, -0.2438676003587285, 0.2136421306481536, -0.040514567484589, -0.14875668073808285, 0.11281804661511591, 0.2486451622833939, 0.10610309580622829, -0.18006701134022718, 0.005687617414055, -0.0036806405080776466, 0.239748306707234, 0.019139972716986545, 0.033387283509057994, 0.18738197829378278, 0.2366949664820966, 0.05073727123243244, 0.11108026630857862, -0.08325171759597173, -0.03967635386353849, -0.22218657084495613, -0.11958834934048354, -0.19847658561101478, -0.01968638952446207, -0.09741214995347515, -0.15425096775012972, 0.3503170875121692, 0.2556690606827799, 0.22445642705057062, 0.07091617278730203, 0.3319151576853504, 0.02578277729243334, 0.1569973235818141, 0.07548191826300402, 0.14571301197253267, -0.01713920117502934, 0.1616824908280059, -0.16886372786677, 0.10254669949706448, 0.026486160917403665] |
1,802.00758 | Strategy Representation by Decision Trees in Reactive Synthesis | Graph games played by two players over finite-state graphs are central in
many problems in computer science. In particular, graph games with
$\omega$-regular winning conditions, specified as parity objectives, which can
express properties such as safety, liveness, fairness, are the basic framework
for verification and synthesis of reactive systems. The decisions for a player
at various states of the graph game are represented as strategies. While the
algorithmic problem for solving graph games with parity objectives has been
widely studied, the most prominent data-structure for strategy representation
in graph games has been binary decision diagrams (BDDs). However, due to the
bit-level representation, BDDs do not retain the inherent flavor of the
decisions of strategies, and are notoriously hard to minimize to obtain
succinct representation. In this work we propose decision trees for strategy
representation in graph games. Decision trees retain the flavor of decisions of
strategies and allow entropy-based minimization to obtain succinct trees.
However, decision trees work in settings (e.g., probabilistic models) where
errors are allowed, and overfitting of data is typically avoided. In contrast,
for strategies in graph games no error is allowed, and the decision tree must
represent the entire strategy. We develop new techniques to extend decision
trees to overcome the above obstacles, while retaining the entropy-based
techniques to obtain succinct trees. We have implemented our techniques to
extend the existing decision tree solvers. We present experimental results for
problems in reactive synthesis to show that decision trees provide a much more
efficient data-structure for strategy representation as compared to BDDs.
| cs.LO | graph games played by two players over finitestate graphs are central in many problems in computer science in particular graph games with omegaregular winning conditions specified as parity objectives which can express properties such as safety liveness fairness are the basic framework for verification and synthesis of reactive systems the decisions for a player at various states of the graph game are represented as strategies while the algorithmic problem for solving graph games with parity objectives has been widely studied the most prominent datastructure for strategy representation in graph games has been binary decision diagrams bdds however due to the bitlevel representation bdds do not retain the inherent flavor of the decisions of strategies and are notoriously hard to minimize to obtain succinct representation in this work we propose decision trees for strategy representation in graph games decision trees retain the flavor of decisions of strategies and allow entropybased minimization to obtain succinct trees however decision trees work in settings eg probabilistic models where errors are allowed and overfitting of data is typically avoided in contrast for strategies in graph games no error is allowed and the decision tree must represent the entire strategy we develop new techniques to extend decision trees to overcome the above obstacles while retaining the entropybased techniques to obtain succinct trees we have implemented our techniques to extend the existing decision tree solvers we present experimental results for problems in reactive synthesis to show that decision trees provide a much more efficient datastructure for strategy representation as compared to bdds | [['graph', 'games', 'played', 'by', 'two', 'players', 'over', 'finitestate', 'graphs', 'are', 'central', 'in', 'many', 'problems', 'in', 'computer', 'science', 'in', 'particular', 'graph', 'games', 'with', 'omegaregular', 'winning', 'conditions', 'specified', 'as', 'parity', 'objectives', 'which', 'can', 'express', 'properties', 'such', 'as', 'safety', 'liveness', 'fairness', 'are', 'the', 'basic', 'framework', 'for', 'verification', 'and', 'synthesis', 'of', 'reactive', 'systems', 'the', 'decisions', 'for', 'a', 'player', 'at', 'various', 'states', 'of', 'the', 'graph', 'game', 'are', 'represented', 'as', 'strategies', 'while', 'the', 'algorithmic', 'problem', 'for', 'solving', 'graph', 'games', 'with', 'parity', 'objectives', 'has', 'been', 'widely', 'studied', 'the', 'most', 'prominent', 'datastructure', 'for', 'strategy', 'representation', 'in', 'graph', 'games', 'has', 'been', 'binary', 'decision', 'diagrams', 'bdds', 'however', 'due', 'to', 'the', 'bitlevel', 'representation', 'bdds', 'do', 'not', 'retain', 'the', 'inherent', 'flavor', 'of', 'the', 'decisions', 'of', 'strategies', 'and', 'are', 'notoriously', 'hard', 'to', 'minimize', 'to', 'obtain', 'succinct', 'representation', 'in', 'this', 'work', 'we', 'propose', 'decision', 'trees', 'for', 'strategy', 'representation', 'in', 'graph', 'games', 'decision', 'trees', 'retain', 'the', 'flavor', 'of', 'decisions', 'of', 'strategies', 'and', 'allow', 'entropybased', 'minimization', 'to', 'obtain', 'succinct', 'trees', 'however', 'decision', 'trees', 'work', 'in', 'settings', 'eg', 'probabilistic', 'models', 'where', 'errors', 'are', 'allowed', 'and', 'overfitting', 'of', 'data', 'is', 'typically', 'avoided', 'in', 'contrast', 'for', 'strategies', 'in', 'graph', 'games', 'no', 'error', 'is', 'allowed', 'and', 'the', 'decision', 'tree', 'must', 'represent', 'the', 'entire', 'strategy', 'we', 'develop', 'new', 'techniques', 'to', 'extend', 'decision', 'trees', 'to', 'overcome', 'the', 'above', 'obstacles', 'while', 'retaining', 'the', 'entropybased', 'techniques', 'to', 'obtain', 'succinct', 'trees', 'we', 'have', 'implemented', 'our', 'techniques', 'to', 'extend', 'the', 'existing', 'decision', 'tree', 'solvers', 'we', 'present', 'experimental', 'results', 'for', 'problems', 'in', 'reactive', 'synthesis', 'to', 'show', 'that', 'decision', 'trees', 'provide', 'a', 'much', 'more', 'efficient', 'datastructure', 'for', 'strategy', 'representation', 'as', 'compared', 'to', 'bdds']] | [-0.06075729935146941, 0.05439651518074028, -0.09652132618642759, 0.14383013337421433, -0.1331130312801357, -0.19037399576502104, 0.12215361755943913, 0.46172243685041575, -0.2743289324496051, -0.34021430627680294, 0.14117810538349052, -0.2223401035565664, -0.14319616702166113, 0.12817267521932793, -0.16039740379315381, 0.1323175910157243, 0.11960782421862377, 0.045755468241473224, 0.026588077203475634, -0.2809418513132579, 0.30937317691962507, 0.016587495841268524, 0.23870495887948018, 0.015251427771998387, 0.09807483030565302, 0.056149677077636996, -0.034101164052445516, 0.04848147310480914, -0.11593339604376382, 0.0979322857079644, 0.40690032870586623, 0.2520890099179073, 0.3127036426837246, -0.43589969457437594, -0.1802186727779461, 0.17093774165054235, 0.1265119731802306, 0.13185321897549063, 0.022296735562792724, -0.25246827938621313, 0.099271823568087, -0.15830670921131967, -0.012498273245771142, -0.11477531544937222, -0.005010134699370931, -0.01918348116279744, -0.28516680256134885, -0.07071795571851087, 0.07791375048896845, 0.03792200015821293, -0.009198372667728393, -0.1911230049187354, 0.013798759507435355, 0.15603464394077365, -0.01673860112205148, -0.006078276425307872, 0.11038907533876743, -0.16589641608115213, -0.29379575255180834, 0.38995276064265005, 0.021569724026702198, -0.18985570017613618, 0.18770231771301113, -0.019721314491813673, -0.23690876342337944, 0.10592393040218774, 0.21058220449405923, 0.1273883756446451, -0.16378490553767072, 0.07568165593365134, -0.04512675797895473, 0.15591948990363116, 0.09317827651678931, 0.03925635718384429, 0.15604755594486408, 0.20740573069391152, 0.14565152495017494, 0.16203259514261256, 0.051017515666271544, -0.1443041299159328, -0.1808615662034843, -0.08739359110557274, -0.10926190085124736, -0.08229655535867685, -0.11935763204003474, -0.19680809438703398, 0.3251569746975221, 0.18560074293670956, 0.10896507329958052, 0.17088916082181693, 0.3089297930728279, 0.0903644214388823, 0.0581719284251734, 0.10122969936689033, 0.154700308680927, 0.12667874882417712, 0.11098878144414402, -0.16548266556050045, 0.17897164972553797, 0.09081269173618114] |
1,802.00759 | Debloating Software through Piece-Wise Compilation and Loading | Programs are bloated. Our study shows that only 5% of libc is used on average
across the Ubuntu Desktop environment (2016 programs); the heaviest user, vlc
media player, only needed 18%.
In this paper: (1) We present a debloating framework built on a compiler
toolchain that can successfully debloat programs (shared/static libraries and
executables). Our solution can successfully compile and load most libraries on
Ubuntu Desktop 16.04. (2) We demonstrate the elimination of over 79% of code
from coreutils and 86% of code from SPEC CPU 2006 benchmark programs without
affecting functionality. We show that even complex programs such as Firefox and
curl can be debloated without a need to recompile. (3) We demonstrate the
security impact of debloating by eliminating over 71% of reusable code gadgets
from the coreutils suite and show that unused code that contains real-world
vulnerabilities can also be successfully eliminated without adverse effects on
the program. (4) We incur a low load time overhead.
| cs.CR | programs are bloated our study shows that only 5 of libc is used on average across the ubuntu desktop environment 2016 programs the heaviest user vlc media player only needed 18 in this paper 1 we present a debloating framework built on a compiler toolchain that can successfully debloat programs sharedstatic libraries and executables our solution can successfully compile and load most libraries on ubuntu desktop 1604 2 we demonstrate the elimination of over 79 of code from coreutils and 86 of code from spec cpu 2006 benchmark programs without affecting functionality we show that even complex programs such as firefox and curl can be debloated without a need to recompile 3 we demonstrate the security impact of debloating by eliminating over 71 of reusable code gadgets from the coreutils suite and show that unused code that contains realworld vulnerabilities can also be successfully eliminated without adverse effects on the program 4 we incur a low load time overhead | [['programs', 'are', 'bloated', 'our', 'study', 'shows', 'that', 'only', '5', 'of', 'libc', 'is', 'used', 'on', 'average', 'across', 'the', 'ubuntu', 'desktop', 'environment', '2016', 'programs', 'the', 'heaviest', 'user', 'vlc', 'media', 'player', 'only', 'needed', '18', 'in', 'this', 'paper', '1', 'we', 'present', 'a', 'debloating', 'framework', 'built', 'on', 'a', 'compiler', 'toolchain', 'that', 'can', 'successfully', 'debloat', 'programs', 'sharedstatic', 'libraries', 'and', 'executables', 'our', 'solution', 'can', 'successfully', 'compile', 'and', 'load', 'most', 'libraries', 'on', 'ubuntu', 'desktop', '1604', '2', 'we', 'demonstrate', 'the', 'elimination', 'of', 'over', '79', 'of', 'code', 'from', 'coreutils', 'and', '86', 'of', 'code', 'from', 'spec', 'cpu', '2006', 'benchmark', 'programs', 'without', 'affecting', 'functionality', 'we', 'show', 'that', 'even', 'complex', 'programs', 'such', 'as', 'firefox', 'and', 'curl', 'can', 'be', 'debloated', 'without', 'a', 'need', 'to', 'recompile', '3', 'we', 'demonstrate', 'the', 'security', 'impact', 'of', 'debloating', 'by', 'eliminating', 'over', '71', 'of', 'reusable', 'code', 'gadgets', 'from', 'the', 'coreutils', 'suite', 'and', 'show', 'that', 'unused', 'code', 'that', 'contains', 'realworld', 'vulnerabilities', 'can', 'also', 'be', 'successfully', 'eliminated', 'without', 'adverse', 'effects', 'on', 'the', 'program', '4', 'we', 'incur', 'a', 'low', 'load', 'time', 'overhead']] | [-0.11024117851387952, -0.013295643453035721, -0.061651945219967856, 0.03723030748350739, -0.08053495799790003, -0.19007791398552717, 0.09783270030292643, 0.3978163067662677, -0.23472333769162804, -0.42148141544191287, 0.13973107465691018, -0.274538921667021, -0.10479404855906577, 0.26380597625998176, -0.09446580338219253, 0.056586782624128626, 0.12863752342966178, -0.04026818815195425, -0.01850522708377571, -0.32115748080624534, 0.256621431402088, 0.044422310429274456, 0.21395922198743475, 0.07632377706830959, 0.052734262778653535, -0.006331449592268312, -0.023693873917429963, -0.006373972785825442, -0.014173674712824264, 0.04008813423721434, 0.2744339804902866, 0.2684241392825089, 0.2937491741999016, -0.4311026764259516, -0.16330194524066013, 0.032257814504593224, 0.11959424286826768, 0.11132712122551831, -0.034141091462610254, -0.26575809826336605, 0.15419543992316762, -0.2614828430406459, -0.0333928528042244, -0.08018650095486506, -0.03740571215053319, 0.01611435002505223, -0.2183327380289602, -0.04653541002117926, 0.01371302151471957, 0.11638702679268241, -0.015491797777751533, -0.13850655898379235, -0.05367282919234947, 0.13010055466415965, -0.030032805574592203, 0.028571407527620482, 0.17066600594923578, -0.06392445313338305, -0.13401189971981303, 0.39636061860659677, -0.08167303049053948, -0.1290266359431477, 0.19618641527886685, -0.04197570188394324, -0.15698559073936919, 0.1267011843458447, 0.260079170510705, 0.11597499019139773, -0.15416676264827733, 0.09897393698168332, -0.02042780596424233, 0.3059067894982827, 0.07150436580096456, -0.0074872706242679775, 0.1535884915161636, 0.15362487856242746, -0.01396265161501897, 0.1373968637025274, -0.07116978651505303, -0.023169266392609904, -0.2620671221974318, -0.16617518069537043, -0.11634680481367539, 0.030062478867226412, -0.07922033059655299, -0.10385151110383888, 0.38667032582225735, 0.2187624414415135, 0.06603160869426929, 0.10697737337500553, 0.34011952212237595, -0.03380683355272276, 0.17356298964277103, 0.20700253782092365, 0.13706969871342956, -0.044054167290738265, 0.1425957985164888, -0.1861715059139306, 0.0901101552941776, -0.0315946515516511] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.