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.1036 | Casimir-Polder Potential of a Driven Atom | We investigate theoretically the Casimir-Polder potential of an atom which is
driven by a laser field close to a surface. This problem is addressed in the
framework of macroscopic quantum electrodynamics using the Green's tensor
formalism and we distinguish between two different approaches, a perturbative
ansatz and a method based on Bloch equations. We apply our results to a
concrete example, namely an atom close to a perfectly conducting mirror, and
create a scenario where the tunable Casimir-Polder potential becomes similar to
the respective potential of an undriven atom due to fluctuating field modes.
Whereas the perturbative approach is restricted to large detunings, the ansatz
based on Bloch equations is exact and yields an expression for the potential
which does not exceed 1/2 of the undriven Casimir-Polder potential.
| quant-ph | we investigate theoretically the casimirpolder potential of an atom which is driven by a laser field close to a surface this problem is addressed in the framework of macroscopic quantum electrodynamics using the greens tensor formalism and we distinguish between two different approaches a perturbative ansatz and a method based on bloch equations we apply our results to a concrete example namely an atom close to a perfectly conducting mirror and create a scenario where the tunable casimirpolder potential becomes similar to the respective potential of an undriven atom due to fluctuating field modes whereas the perturbative approach is restricted to large detunings the ansatz based on bloch equations is exact and yields an expression for the potential which does not exceed 12 of the undriven casimirpolder potential | [['we', 'investigate', 'theoretically', 'the', 'casimirpolder', 'potential', 'of', 'an', 'atom', 'which', 'is', 'driven', 'by', 'a', 'laser', 'field', 'close', 'to', 'a', 'surface', 'this', 'problem', 'is', 'addressed', 'in', 'the', 'framework', 'of', 'macroscopic', 'quantum', 'electrodynamics', 'using', 'the', 'greens', 'tensor', 'formalism', 'and', 'we', 'distinguish', 'between', 'two', 'different', 'approaches', 'a', 'perturbative', 'ansatz', 'and', 'a', 'method', 'based', 'on', 'bloch', 'equations', 'we', 'apply', 'our', 'results', 'to', 'a', 'concrete', 'example', 'namely', 'an', 'atom', 'close', 'to', 'a', 'perfectly', 'conducting', 'mirror', 'and', 'create', 'a', 'scenario', 'where', 'the', 'tunable', 'casimirpolder', 'potential', 'becomes', 'similar', 'to', 'the', 'respective', 'potential', 'of', 'an', 'undriven', 'atom', 'due', 'to', 'fluctuating', 'field', 'modes', 'whereas', 'the', 'perturbative', 'approach', 'is', 'restricted', 'to', 'large', 'detunings', 'the', 'ansatz', 'based', 'on', 'bloch', 'equations', 'is', 'exact', 'and', 'yields', 'an', 'expression', 'for', 'the', 'potential', 'which', 'does', 'not', 'exceed', '12', 'of', 'the', 'undriven', 'casimirpolder', 'potential']] | [-0.1250485274285893, 0.12715424120733587, -0.10602704398479545, 0.054408451902418165, -0.053837925701373024, -0.17322751297979266, 0.043646953081406537, 0.3467836182389874, -0.22125499693356687, -0.2563250379789679, -0.00305287278843025, -0.2754320997555624, -0.15340172556170728, 0.2072445881240128, -0.004981538433639798, 0.04026448758668266, 0.01823023672477575, 0.04583360646938672, -0.06060554549185326, -0.17397414694642066, 0.3266654462531733, 0.03771618154405587, 0.2946773227013182, 0.10913431342487456, 0.10391598962632997, 0.004337273348937742, 0.07878542763137375, 0.022801697778049856, -0.12651173714948527, 0.11433978056720662, 0.18907581270286755, 0.01228237812028965, 0.27373072679620236, -0.470122238562908, -0.1673156352917431, 0.07723280754726147, 0.13828834114974597, 0.22326802693169157, -0.028190286841891066, -0.311304108465265, -0.0006855856845504604, -0.18703864230883482, -0.16779744018640486, -0.0998311673738499, 0.003936202550903545, -0.00621424866039888, -0.28796417214834946, 0.050899309986562, 0.02174797967018094, 0.020144551825069357, -0.11544880597830343, -0.04357397735839186, 0.04294031108474883, 0.09047385567464516, 0.02236808054658468, 0.042499313203734346, 0.13182858837899403, -0.12603759218654886, -0.0881920224383066, 0.4102985956342309, -0.10469838614517357, -0.22954392304200155, 0.1926575257020886, -0.10113745018134068, -0.021256059330880817, 0.08782987537324516, 0.12832462790538557, 0.1410440567524347, -0.1536549523989379, 0.10875760526869271, -0.004232991410390241, 0.18318593370258895, 0.07423691955045797, -0.007445291783369612, 0.2098755037754927, 0.12343435303773731, 0.04726784320519073, 0.1694558231361043, -0.06997674232570716, -0.15296836565903504, -0.31459863308555214, -0.14615005090925592, -0.23931080895999912, 0.060674005575606316, -0.0506993024860094, -0.22076073214702774, 0.3727988751943485, 0.15713081974899978, 0.15979827929595558, -0.007297606038264348, 0.31446546023653354, 0.1755447888326671, 0.03268935867890832, 0.025117026732914383, 0.28585544219822623, 0.17914480725448811, 0.04917278174980311, -0.2746919680539577, -0.05463403229191499, 0.0423066811854369] |
1,802.10361 | Optimal encoding in stochastic latent-variable Models | In this work we explore encoding strategies learned by statistical models of
sensory coding in noisy spiking networks. Early stages of sensory communication
in neural systems can be viewed as encoding channels in the
information-theoretic sense. However, neural populations face constraints not
commonly considered in communications theory. Using restricted Boltzmann
machines as a model of sensory encoding, we find that networks with sufficient
capacity learn to balance precision and noise-robustness in order to adaptively
communicate stimuli with varying information content. Mirroring variability
suppression observed in sensory systems, informative stimuli are encoded with
high precision, at the cost of more variable responses to frequent, hence less
informative stimuli. Curiously, we also find that statistical criticality in
the neural population code emerges at model sizes where the input statistics
are well captured. These phenomena have well-defined thermodynamic
interpretations, and we discuss their connection to prevailing theories of
coding and statistical criticality in neural populations.
| q-bio.NC | in this work we explore encoding strategies learned by statistical models of sensory coding in noisy spiking networks early stages of sensory communication in neural systems can be viewed as encoding channels in the informationtheoretic sense however neural populations face constraints not commonly considered in communications theory using restricted boltzmann machines as a model of sensory encoding we find that networks with sufficient capacity learn to balance precision and noiserobustness in order to adaptively communicate stimuli with varying information content mirroring variability suppression observed in sensory systems informative stimuli are encoded with high precision at the cost of more variable responses to frequent hence less informative stimuli curiously we also find that statistical criticality in the neural population code emerges at model sizes where the input statistics are well captured these phenomena have welldefined thermodynamic interpretations and we discuss their connection to prevailing theories of coding and statistical criticality in neural populations | [['in', 'this', 'work', 'we', 'explore', 'encoding', 'strategies', 'learned', 'by', 'statistical', 'models', 'of', 'sensory', 'coding', 'in', 'noisy', 'spiking', 'networks', 'early', 'stages', 'of', 'sensory', 'communication', 'in', 'neural', 'systems', 'can', 'be', 'viewed', 'as', 'encoding', 'channels', 'in', 'the', 'informationtheoretic', 'sense', 'however', 'neural', 'populations', 'face', 'constraints', 'not', 'commonly', 'considered', 'in', 'communications', 'theory', 'using', 'restricted', 'boltzmann', 'machines', 'as', 'a', 'model', 'of', 'sensory', 'encoding', 'we', 'find', 'that', 'networks', 'with', 'sufficient', 'capacity', 'learn', 'to', 'balance', 'precision', 'and', 'noiserobustness', 'in', 'order', 'to', 'adaptively', 'communicate', 'stimuli', 'with', 'varying', 'information', 'content', 'mirroring', 'variability', 'suppression', 'observed', 'in', 'sensory', 'systems', 'informative', 'stimuli', 'are', 'encoded', 'with', 'high', 'precision', 'at', 'the', 'cost', 'of', 'more', 'variable', 'responses', 'to', 'frequent', 'hence', 'less', 'informative', 'stimuli', 'curiously', 'we', 'also', 'find', 'that', 'statistical', 'criticality', 'in', 'the', 'neural', 'population', 'code', 'emerges', 'at', 'model', 'sizes', 'where', 'the', 'input', 'statistics', 'are', 'well', 'captured', 'these', 'phenomena', 'have', 'welldefined', 'thermodynamic', 'interpretations', 'and', 'we', 'discuss', 'their', 'connection', 'to', 'prevailing', 'theories', 'of', 'coding', 'and', 'statistical', 'criticality', 'in', 'neural', 'populations']] | [-0.11095454880744096, 0.1346093122709518, -0.06575043739040236, 0.12337267640166254, -0.055075877729043564, -0.24550599005918852, 0.07056082813850433, 0.42308537275407854, -0.3102243437744236, -0.3122199688989081, 0.054463860752692106, -0.24109199070249146, -0.23631159655633382, 0.12300036070059593, -0.16683594426017648, 0.07731286123223406, 0.051346394086354656, 0.06543788491705384, -0.016158445305145028, -0.2631647712428515, 0.2652890961188333, 0.08340873866415534, 0.2999946382540082, -0.06482828743633275, 0.09695406375134266, -0.04169896048551891, -0.03291893081194231, -0.01702552078533795, -0.06638184458442035, 0.1363045096529133, 0.35632619477370864, 0.2140816177737801, 0.27641469439119026, -0.47910460450006404, -0.30845515205337987, 0.10340163988669367, 0.15506075432609864, 0.12922532541530304, 0.004499719545492553, -0.2816598328247078, 0.0671361712064888, -0.14720699680956864, -0.0028186437159188485, -0.12772721788803065, -0.004266920226846675, 0.0308442647579604, -0.2747875675712222, 0.10056312331040604, 0.044657794746423236, 0.12251469833886643, -0.06377840863148633, -0.07056507873839062, -0.014594286951346715, 0.16803764847817979, 0.007316887570739614, 0.03284993061510919, 0.17962938361482597, -0.2089433275656407, -0.15709316276249746, 0.3238757527454398, -0.0011125673121760453, -0.20328953652642667, 0.2245712034759651, -0.1156117647524776, -0.1788422619911695, 0.07879920297541264, 0.2511336965621204, 0.04243148431353467, -0.18889568414612623, -0.025496425220090282, 0.01288143989299179, 0.2145314356986139, 0.06957000963953569, 0.14189153917725075, 0.22802060824324144, 0.20665859392427496, -0.030525597610425104, 0.1384107150914037, -0.05847789803642387, -0.12750024720413708, -0.21998017471387835, -0.027434450488439517, -0.17509896665394895, 0.023190396372324597, -0.11389056424655121, -0.10357899332886614, 0.33391351164563704, 0.21956100605587525, 0.20714363382553289, 0.12442800897827654, 0.29736699035244163, 0.059904417780911136, 0.10720638602843362, 0.10229928295226082, 0.18429715466864813, 0.11435567903314031, 0.1354519531596452, -0.1760099094122109, 0.137225404430769, -0.004038443056694967] |
1,802.10362 | Relativistic positron scattering from heavy ground-state nuclei | Cross sections and spin asymmetries for elastic positron scattering and for
the emission of positron bremsstrahlung in collision with nuclei of zero and
half-integer spin are calculated within the relativistic partial-wave theory.
For elastic scattering, comparison is made with the respective results from
electron scattering by 208Pb, 89Y and 23Na nuclei at high energies (up to 400
MeV). It is found that the difference between electron and positron intensities
diminishes with energy, although the diffraction oscillations, which differ in
phase for the two species, prevail up to the highest energies considered.
Magnetic scattering strongly reduces the spin asymmetries for nuclei with spin,
both for positrons and electrons. For the elementary process of bremsstrahlung
the cross section, which is studied for the 197Au and 208Pb targets at low
energies (1-30 MeV), increases with photon frequency for large scattering
angles and small photon emission angles, in contrast to the usual behaviour of
the doubly differential cross section, or of the triply differential cross
section at small scattering angles.
| physics.atom-ph | cross sections and spin asymmetries for elastic positron scattering and for the emission of positron bremsstrahlung in collision with nuclei of zero and halfinteger spin are calculated within the relativistic partialwave theory for elastic scattering comparison is made with the respective results from electron scattering by 208pb 89y and 23na nuclei at high energies up to 400 mev it is found that the difference between electron and positron intensities diminishes with energy although the diffraction oscillations which differ in phase for the two species prevail up to the highest energies considered magnetic scattering strongly reduces the spin asymmetries for nuclei with spin both for positrons and electrons for the elementary process of bremsstrahlung the cross section which is studied for the 197au and 208pb targets at low energies 130 mev increases with photon frequency for large scattering angles and small photon emission angles in contrast to the usual behaviour of the doubly differential cross section or of the triply differential cross section at small scattering angles | [['cross', 'sections', 'and', 'spin', 'asymmetries', 'for', 'elastic', 'positron', 'scattering', 'and', 'for', 'the', 'emission', 'of', 'positron', 'bremsstrahlung', 'in', 'collision', 'with', 'nuclei', 'of', 'zero', 'and', 'halfinteger', 'spin', 'are', 'calculated', 'within', 'the', 'relativistic', 'partialwave', 'theory', 'for', 'elastic', 'scattering', 'comparison', 'is', 'made', 'with', 'the', 'respective', 'results', 'from', 'electron', 'scattering', 'by', '208pb', '89y', 'and', '23na', 'nuclei', 'at', 'high', 'energies', 'up', 'to', '400', 'mev', 'it', 'is', 'found', 'that', 'the', 'difference', 'between', 'electron', 'and', 'positron', 'intensities', 'diminishes', 'with', 'energy', 'although', 'the', 'diffraction', 'oscillations', 'which', 'differ', 'in', 'phase', 'for', 'the', 'two', 'species', 'prevail', 'up', 'to', 'the', 'highest', 'energies', 'considered', 'magnetic', 'scattering', 'strongly', 'reduces', 'the', 'spin', 'asymmetries', 'for', 'nuclei', 'with', 'spin', 'both', 'for', 'positrons', 'and', 'electrons', 'for', 'the', 'elementary', 'process', 'of', 'bremsstrahlung', 'the', 'cross', 'section', 'which', 'is', 'studied', 'for', 'the', '197au', 'and', '208pb', 'targets', 'at', 'low', 'energies', '130', 'mev', 'increases', 'with', 'photon', 'frequency', 'for', 'large', 'scattering', 'angles', 'and', 'small', 'photon', 'emission', 'angles', 'in', 'contrast', 'to', 'the', 'usual', 'behaviour', 'of', 'the', 'doubly', 'differential', 'cross', 'section', 'or', 'of', 'the', 'triply', 'differential', 'cross', 'section', 'at', 'small', 'scattering', 'angles']] | [-0.03837111035883651, 0.2772455440794892, -0.008114986679887018, 0.12784761932216937, 0.035204881577435544, -0.10511198790227792, 0.012687954902284252, 0.3923465059845742, -0.2217546778489802, -0.3010240087554936, -0.09037245917119961, -0.4001915089180132, 0.07393137473684556, 0.21122077267325248, 0.1472072741395446, 0.05355604444293821, 0.04340918179663145, 0.0014833637658038165, -0.06008067340954734, -0.14999215665037732, 0.3151070819129741, 0.11589044969702836, 0.2513903526151665, 0.18497474790138405, 0.0860756606351674, 0.11261268334879809, 0.029658147495756126, -0.056101586030100487, -0.09050879871478151, 0.07355848542998085, 0.30296948342303553, -0.04372194402006803, 0.05175189373745437, -0.419996454593647, -0.13639681716283, 0.06745459056313498, 0.15079293334723384, 0.12148840054420822, -0.05625509381215705, -0.260300262421594, 0.018446083475852453, -0.18424883608829723, -0.16626174381866782, -0.04483661201995719, 0.06413271547441023, 0.0444556249709553, -0.25923061973404093, 0.10812968453736022, -0.02653542446976819, 0.03139185253530741, -0.1079615326514131, -0.20837091825655604, -0.03768300847430904, -0.00592399809750762, 0.12045243591282669, 0.004463215263178909, 0.18379775350015745, -0.11240216259317226, -0.11753918210897281, 0.37515731845948713, -0.01797091688523181, -0.10791430978598185, 0.12431962725584372, -0.2550492986106785, -0.06746694336295359, 0.3169072874350451, 0.1704776060812355, 0.10165494498488191, -0.1324741326136436, 0.04839476739376901, 0.008106717995525035, 0.15882396985670125, 0.15320556080501796, 0.03586660234358566, 0.1876145938680653, 0.16936233937908637, -0.0038515997164130927, 0.013155310379666647, -0.23966286799601133, -0.05713099194129547, -0.3018756269712944, -0.10450055846363777, -0.08412060507430123, 0.06075999574842358, -0.03326296493486804, -0.09047208509284509, 0.30507274726069117, 0.03375066369133777, 0.24965572820033832, 0.012993197334111186, 0.321899025650493, 0.1548727501284735, 0.060992065438417245, 0.042603007986221506, 0.3517389136439481, 0.235523944879119, 0.10697920216774814, -0.27848596461341685, 0.03024534034789596, -0.04128460965332496] |
1,802.10363 | General Video Game AI: a Multi-Track Framework for Evaluating Agents,
Games and Content Generation Algorithms | General Video Game Playing (GVGP) aims at designing an agent that is capable
of playing multiple video games with no human intervention. In 2014, The
General Video Game AI (GVGAI) competition framework was created and released
with the purpose of providing researchers a common open-source and easy to use
platform for testing their AI methods with potentially infinity of games
created using Video Game Description Language (VGDL). The framework has been
expanded into several tracks during the last few years to meet the demand of
different research directions. The agents are required either to play multiple
unknown games with or without access to game simulations, or to design new game
levels or rules. This survey paper presents the VGDL, the GVGAI framework,
existing tracks, and reviews the wide use of GVGAI framework in research,
education and competitions five years after its birth. A future plan of
framework improvements is also described.
| cs.AI | general video game playing gvgp aims at designing an agent that is capable of playing multiple video games with no human intervention in 2014 the general video game ai gvgai competition framework was created and released with the purpose of providing researchers a common opensource and easy to use platform for testing their ai methods with potentially infinity of games created using video game description language vgdl the framework has been expanded into several tracks during the last few years to meet the demand of different research directions the agents are required either to play multiple unknown games with or without access to game simulations or to design new game levels or rules this survey paper presents the vgdl the gvgai framework existing tracks and reviews the wide use of gvgai framework in research education and competitions five years after its birth a future plan of framework improvements is also described | [['general', 'video', 'game', 'playing', 'gvgp', 'aims', 'at', 'designing', 'an', 'agent', 'that', 'is', 'capable', 'of', 'playing', 'multiple', 'video', 'games', 'with', 'no', 'human', 'intervention', 'in', '2014', 'the', 'general', 'video', 'game', 'ai', 'gvgai', 'competition', 'framework', 'was', 'created', 'and', 'released', 'with', 'the', 'purpose', 'of', 'providing', 'researchers', 'a', 'common', 'opensource', 'and', 'easy', 'to', 'use', 'platform', 'for', 'testing', 'their', 'ai', 'methods', 'with', 'potentially', 'infinity', 'of', 'games', 'created', 'using', 'video', 'game', 'description', 'language', 'vgdl', 'the', 'framework', 'has', 'been', 'expanded', 'into', 'several', 'tracks', 'during', 'the', 'last', 'few', 'years', 'to', 'meet', 'the', 'demand', 'of', 'different', 'research', 'directions', 'the', 'agents', 'are', 'required', 'either', 'to', 'play', 'multiple', 'unknown', 'games', 'with', 'or', 'without', 'access', 'to', 'game', 'simulations', 'or', 'to', 'design', 'new', 'game', 'levels', 'or', 'rules', 'this', 'survey', 'paper', 'presents', 'the', 'vgdl', 'the', 'gvgai', 'framework', 'existing', 'tracks', 'and', 'reviews', 'the', 'wide', 'use', 'of', 'gvgai', 'framework', 'in', 'research', 'education', 'and', 'competitions', 'five', 'years', 'after', 'its', 'birth', 'a', 'future', 'plan', 'of', 'framework', 'improvements', 'is', 'also', 'described']] | [-0.07733756208326667, 0.05270677606817723, -0.10552344888448716, 0.051862316582507145, -0.10909202372655273, -0.19368710881642376, 0.030636435493361206, 0.42956108652676145, -0.22116850084625184, -0.3867037382007887, 0.08218474054941907, -0.26430439978217085, -0.1426961973666524, 0.14956555056851356, -0.1351634744616846, 0.03866619297264454, 0.12579800207866357, 0.03538376298112174, 0.053746085554982226, -0.31943660355638714, 0.2775782693829387, 0.06701949271528672, 0.2736722188085938, 0.04193029567288856, 0.09845109222340398, 0.02453560252673924, -0.06257241709778706, 0.014610369174430768, -0.10812950791951152, 0.15804876611568033, 0.3529101306494946, 0.26570042958017437, 0.4353779103855292, -0.47345365467170875, -0.1589593235667174, 0.08342703261723121, 0.12104967559687793, 0.1112769362439091, -0.08910267187903324, -0.3108845296688378, 0.07412041137965085, -0.22957716211055715, -0.0666779722739011, -0.055486258977713684, 0.0009381824514518182, -0.030027537035445372, -0.26947254372450213, -0.08942015636576495, 0.02212897952335576, 0.13969011505444845, -0.05643987986026332, -0.12905709175315375, 0.055372097122793396, 0.23820677402972554, 0.06388098906880865, 0.06563521687484657, 0.12449842775240541, -0.17488670743536205, -0.21616217236965896, 0.4032748560607433, -0.03391027166197697, -0.10598696695252632, 0.20120960098691285, -0.02504923912230879, -0.13934536626872918, 0.08700457676391428, 0.223470734845226, 0.12458129869153102, -0.2018346550563971, 0.028946551610764194, -0.0039733853749930855, 0.1469665612280369, 0.058930194171456, -0.006584039389466246, 0.2549211584404111, 0.2258583078486845, 0.04988522348925471, 0.09520137949225803, -0.01614826424905914, -0.17757462502612423, -0.21474443215333547, -0.10457479533428947, -0.0860574153593431, -0.02964724821484803, -0.0240649710498595, -0.11486838353176912, 0.39151359841848415, 0.17444959979038685, 0.0696478524976798, 0.04683951884818574, 0.31136061320702235, 0.011910458486527204, 0.0707032651718085, 0.0637929070647806, 0.15489531194092707, 0.014799082490305105, 0.22452612054844698, -0.13359918480428556, 0.09164868584523599, 0.011217645963576313] |
1,802.10364 | On critical $\mathrm{L}^p$-differentiability of $\mathrm{BD}$-maps | We prove that functions of locally bounded deformation on $\mathbb{R}^n$ are
$\mathrm{L}^{n/(n-1)}$-differentiable almost everywhere. More generally, we
show that this critical $\mathrm{L}^p$-differentiability result holds for
functions of locally bounded $\mathbb{A}$-variation, provided that the first
order, homogeneous, linear differential operator $\mathbb{A}$ has finite
dimensional null-space.
| math.FA | we prove that functions of locally bounded deformation on mathbbrn are mathrmlnn1differentiable almost everywhere more generally we show that this critical mathrmlpdifferentiability result holds for functions of locally bounded mathbbavariation provided that the first order homogeneous linear differential operator mathbba has finite dimensional nullspace | [['we', 'prove', 'that', 'functions', 'of', 'locally', 'bounded', 'deformation', 'on', 'mathbbrn', 'are', 'mathrmlnn1differentiable', 'almost', 'everywhere', 'more', 'generally', 'we', 'show', 'that', 'this', 'critical', 'mathrmlpdifferentiability', 'result', 'holds', 'for', 'functions', 'of', 'locally', 'bounded', 'mathbbavariation', 'provided', 'that', 'the', 'first', 'order', 'homogeneous', 'linear', 'differential', 'operator', 'mathbba', 'has', 'finite', 'dimensional', 'nullspace']] | [-0.1724504176385292, 0.12934891488857386, -0.03721558566137058, 0.02896708984598063, -0.07153438049845579, -0.12076548162120872, -0.062067257740148686, 0.39361780718332384, -0.33588861219766664, -0.059762681084798604, 0.13107941106597826, -0.2707353726756282, -0.18330742449431522, 0.22891472557150735, -0.07128536379782528, 0.10148897889728953, 0.033161745951851694, 0.10895011337792002, -0.11563329260637302, -0.3304875982334701, 0.4698647504172674, -0.11190717658255159, 0.22491012865722906, 0.07784224787681568, 0.14917182414678903, 0.005504932788359683, 0.017902330384680594, 0.0757763122390138, -0.17649331581817865, 0.10703045614319286, 0.29844037361624765, 0.07961354075885582, 0.2775073585713782, -0.4020054958101998, -0.20471568042185248, 0.20675844161930243, 0.1360160594283626, -0.0009688144640588179, -0.06039945500024038, -0.22415484637930627, 0.21279879118792894, -0.11896120806837954, -0.19194274788676965, -0.11699279361381763, 0.059301860176208546, 0.02491735971373756, -0.31821946581689325, 0.09074951097278333, 0.1862638235183024, 0.060632368958577876, -0.14322689356191493, -0.09184749459666086, -0.06717007405056459, 0.06370908728369125, -0.05743763627620732, 0.08464480610564351, 0.057685997462036405, -0.008913089358851189, -0.04692286011058747, 0.32731569344859296, -0.0908090228856564, -0.29719568130264923, 0.13530106912934925, -0.27179831214158273, -0.11989306146846856, 0.06222929542021054, 0.1271695656156758, 0.19456270873183157, -0.07772588243753445, 0.236290427083831, -0.11765274130625696, 0.17205355825220667, 0.09860090246969243, 0.004236618261330012, 0.01902957217449822, 0.07118322076730249, 0.2724093705324865, 0.13809251898854244, 0.07609376339128286, -0.06798200657954667, -0.403290815923999, -0.1036858357852552, -0.1767375336437509, 0.12411678911800064, -0.11383040852435841, -0.25211561975500935, 0.2973302000361245, 0.05084876231593648, 0.15077794375034367, 0.1667761071244391, 0.225245566266339, 0.203502532708027, 0.0202050326937219, 0.12674413519207298, 0.155172888780149, 0.14242546169496165, 0.033883434072954625, -0.10283233834112562, 0.025354190048102927, 0.15418427762583967] |
1,802.10365 | Topological quantum critical point in a triple-Weyl semimetal:
non-Fermi-liquid behaviors and instabilities | We study the quantum critical phenomena emerging at the transition from
triple-Weyl semimetal to band insulator, which is a topological phase
transition described by the change of topological invariant. The critical point
realizes a new type of semimetal state in which the fermion dispersion is cubic
along two directions and quadratic along the third. Our renormalization group
analysis reveals that, the Coulomb interaction is marginal at low energies and
even arbitrarily weak Coulomb interaction suffices to induce an infrared fixed
point. We compute a number of observable quantities, and show that they all
exhibit non-Fermi liquid behaviors at the fixed point. When the interplay
between the Coulomb and short-range four-fermion interactions is considered,
the system becomes unstable below a finite energy scale. The system undergoes a
first-order topological transition when the fermion flavor $N$ is small, and
enters into a nematic phase if $N$ is large enough. Non-Fermi liquid behaviors
are hidden by the instability at low temperatures, but can still be observed at
higher temperatures. Experimental detection of the predicted phenomena is
discussed.
| cond-mat.str-el cond-mat.mtrl-sci cond-mat.stat-mech | we study the quantum critical phenomena emerging at the transition from tripleweyl semimetal to band insulator which is a topological phase transition described by the change of topological invariant the critical point realizes a new type of semimetal state in which the fermion dispersion is cubic along two directions and quadratic along the third our renormalization group analysis reveals that the coulomb interaction is marginal at low energies and even arbitrarily weak coulomb interaction suffices to induce an infrared fixed point we compute a number of observable quantities and show that they all exhibit nonfermi liquid behaviors at the fixed point when the interplay between the coulomb and shortrange fourfermion interactions is considered the system becomes unstable below a finite energy scale the system undergoes a firstorder topological transition when the fermion flavor n is small and enters into a nematic phase if n is large enough nonfermi liquid behaviors are hidden by the instability at low temperatures but can still be observed at higher temperatures experimental detection of the predicted phenomena is discussed | [['we', 'study', 'the', 'quantum', 'critical', 'phenomena', 'emerging', 'at', 'the', 'transition', 'from', 'tripleweyl', 'semimetal', 'to', 'band', 'insulator', 'which', 'is', 'a', 'topological', 'phase', 'transition', 'described', 'by', 'the', 'change', 'of', 'topological', 'invariant', 'the', 'critical', 'point', 'realizes', 'a', 'new', 'type', 'of', 'semimetal', 'state', 'in', 'which', 'the', 'fermion', 'dispersion', 'is', 'cubic', 'along', 'two', 'directions', 'and', 'quadratic', 'along', 'the', 'third', 'our', 'renormalization', 'group', 'analysis', 'reveals', 'that', 'the', 'coulomb', 'interaction', 'is', 'marginal', 'at', 'low', 'energies', 'and', 'even', 'arbitrarily', 'weak', 'coulomb', 'interaction', 'suffices', 'to', 'induce', 'an', 'infrared', 'fixed', 'point', 'we', 'compute', 'a', 'number', 'of', 'observable', 'quantities', 'and', 'show', 'that', 'they', 'all', 'exhibit', 'nonfermi', 'liquid', 'behaviors', 'at', 'the', 'fixed', 'point', 'when', 'the', 'interplay', 'between', 'the', 'coulomb', 'and', 'shortrange', 'fourfermion', 'interactions', 'is', 'considered', 'the', 'system', 'becomes', 'unstable', 'below', 'a', 'finite', 'energy', 'scale', 'the', 'system', 'undergoes', 'a', 'firstorder', 'topological', 'transition', 'when', 'the', 'fermion', 'flavor', 'n', 'is', 'small', 'and', 'enters', 'into', 'a', 'nematic', 'phase', 'if', 'n', 'is', 'large', 'enough', 'nonfermi', 'liquid', 'behaviors', 'are', 'hidden', 'by', 'the', 'instability', 'at', 'low', 'temperatures', 'but', 'can', 'still', 'be', 'observed', 'at', 'higher', 'temperatures', 'experimental', 'detection', 'of', 'the', 'predicted', 'phenomena', 'is', 'discussed']] | [-0.21294280293734807, 0.2919534756515166, -0.09553048192508701, 0.08373397196062315, -0.030216550392944408, -0.21038714105439982, 0.07517712102030757, 0.32257348264770946, -0.2685185325112536, -0.2701470283684374, 0.03463960577661557, -0.3497395913930203, -0.14657333991142396, 0.12567855410636455, 0.06232074017057077, -0.002696803977027878, -0.03844303094471494, 0.03376854831371563, -0.13591250161113133, -0.18452947318618154, 0.3330828461564553, -0.009989792832317922, 0.2930621433971, 0.10631336967043321, 0.07312006117968724, -0.02508263305672103, 0.11410018619974198, 0.03953383057967, -0.11044640433427613, -0.025959287164264478, 0.2751060320611711, -0.07723405107523947, 0.19739521110106537, -0.36974370770755854, -0.2096589987551601, 0.07933457945500254, 0.12294911531244415, 0.13735192177961741, -0.06665077851633622, -0.2891266679514371, 0.08006378865717835, -0.14589725379917728, -0.1727877390924199, -0.09822848810139916, -0.005454008925128086, -0.04517456027043545, -0.24070852888405495, 0.07538726313799705, 0.038944979973041034, 0.07217079816899936, -0.03142784632897625, -0.06734599323539149, -0.08332265473650662, 0.10518197975310112, 0.06957249405349594, 0.045195864918962894, 0.13431223443891296, -0.1635053586716571, -0.05808895181104455, 0.41044491308944664, -0.059697050045929505, -0.09904793166587579, 0.22306160724001947, -0.1757239436024222, -0.11381992554538295, 0.23325834148724017, 0.11807367631940749, 0.06256652558382986, -0.08428638600613841, 0.11770442623954337, -0.0019782290033910467, 0.1623039403045483, -0.0035323593410898813, 0.04486119220750513, 0.28332530901681674, 0.17414274874100483, 0.08068545493993094, 0.13675373608457866, -0.08946158753804348, -0.11888730755054402, -0.3279085536433876, -0.13224081766534726, -0.21727030195801617, 0.048108930882764314, -0.09475562509492871, -0.18071487807165618, 0.37132379813129807, 0.1188926388102787, 0.20901367328953982, -0.009863892859169122, 0.22447144140853365, 0.16547617304269974, 0.0607840306334326, 0.05951579036084057, 0.26403858204340114, 0.09055774254007158, 0.09050045040136354, -0.27013013182721773, 0.040890474386256315, 0.09533384888588141] |
1,802.10366 | The Tilting Theory of Contraction Algebras | To every minimal model of a complete local isolated cDV singularity
Donovan--Wemyss associate a finite dimensional symmetric algebra known as the
contraction algebra. We construct the first known standard derived equivalences
between these algebras and then use the structure of an associated hyperplane
arrangement to control the compositions, obtaining a faithful group action on
the bounded derived category. Further, we determine precisely those standard
equivalences which are induced by two-term tilting complexes and show that any
standard equivalence between contraction algebras (up to algebra isomorphism)
can be viewed as the composition of our constructed functors. Thus, for a
contraction algebra, we obtain a complete picture of its derived equivalence
class and, in particular, of its derived autoequivalence group.
| math.RT math.AG | to every minimal model of a complete local isolated cdv singularity donovanwemyss associate a finite dimensional symmetric algebra known as the contraction algebra we construct the first known standard derived equivalences between these algebras and then use the structure of an associated hyperplane arrangement to control the compositions obtaining a faithful group action on the bounded derived category further we determine precisely those standard equivalences which are induced by twoterm tilting complexes and show that any standard equivalence between contraction algebras up to algebra isomorphism can be viewed as the composition of our constructed functors thus for a contraction algebra we obtain a complete picture of its derived equivalence class and in particular of its derived autoequivalence group | [['to', 'every', 'minimal', 'model', 'of', 'a', 'complete', 'local', 'isolated', 'cdv', 'singularity', 'donovanwemyss', 'associate', 'a', 'finite', 'dimensional', 'symmetric', 'algebra', 'known', 'as', 'the', 'contraction', 'algebra', 'we', 'construct', 'the', 'first', 'known', 'standard', 'derived', 'equivalences', 'between', 'these', 'algebras', 'and', 'then', 'use', 'the', 'structure', 'of', 'an', 'associated', 'hyperplane', 'arrangement', 'to', 'control', 'the', 'compositions', 'obtaining', 'a', 'faithful', 'group', 'action', 'on', 'the', 'bounded', 'derived', 'category', 'further', 'we', 'determine', 'precisely', 'those', 'standard', 'equivalences', 'which', 'are', 'induced', 'by', 'twoterm', 'tilting', 'complexes', 'and', 'show', 'that', 'any', 'standard', 'equivalence', 'between', 'contraction', 'algebras', 'up', 'to', 'algebra', 'isomorphism', 'can', 'be', 'viewed', 'as', 'the', 'composition', 'of', 'our', 'constructed', 'functors', 'thus', 'for', 'a', 'contraction', 'algebra', 'we', 'obtain', 'a', 'complete', 'picture', 'of', 'its', 'derived', 'equivalence', 'class', 'and', 'in', 'particular', 'of', 'its', 'derived', 'autoequivalence', 'group']] | [-0.11772485951391551, 0.04418486974942876, -0.07690424010412306, 0.09162773935195918, -0.1010733570298578, -0.11790207720910892, -0.006783565697379601, 0.37268771570669407, -0.4256754852672163, -0.2244787942747482, 0.11140912934106925, -0.1763212351152339, -0.13152100992763144, 0.16961448434859705, -0.10352743612841153, -0.07358557445645873, 0.06364774267770286, 0.11218106825477801, -0.15251101679805443, -0.20441477638908112, 0.4030135479023378, -0.008025387413481362, 0.24125502319035366, -0.014612036718366047, 0.13899860826010504, 0.004801446054544713, -0.004055151158673132, 0.05403130053359474, -0.1887718458895887, 0.14875668538017914, 0.26993610088227904, 0.09962740888357417, 0.1408668151990964, -0.3665907008791816, -0.12572938423508254, 0.16974063601113984, 0.11544593359526788, 0.06177777944144626, -0.06959167354975022, -0.3022466903456893, 0.1054995965737945, -0.23257604581065094, -0.15736718164979774, -0.08046476406037298, 0.05758602667249676, -0.02051835047065193, -0.2664047958250715, -0.005998132957352532, 0.11329102791591078, 0.11053547779153873, -0.10797165534220254, -0.03445220075977536, -0.12281178620357353, 0.13820484006363484, -0.09241800486910133, 0.023975899709691096, 0.12341839282397324, -0.0705132626023061, -0.17349419251291287, 0.3792775795659703, -0.05169801909126278, -0.1875795253341556, 0.17352731878526956, -0.1442753865908927, -0.15007276851763454, 0.09519088266688025, 0.03974346218742112, 0.1390660483008012, -0.09119394021238098, 0.16214662748757097, -0.11989672138936754, 0.06004256856902383, 0.09474124232880198, -0.013655886320699738, 0.12396418203651491, 0.0804757981095463, 0.06285253947433563, 0.1571898403344676, 0.0649954289666568, -0.05567178449943725, -0.37601004566392326, -0.16339353212497681, -0.082171045936262, 0.1292897796847372, -0.11801480362950485, -0.18630965578600636, 0.3544990506170429, 0.10642014657352199, 0.20463092777575564, 0.14925396787977785, 0.20544420612546113, 0.08283861269517682, 0.1267359390313554, 0.0007155265531733505, 0.17332594831768647, 0.2605784363650645, -0.07893057538467085, -0.14491487917356974, 0.003332901726134567, 0.22156940444019865] |
1,802.10367 | Deep-6DPose: Recovering 6D Object Pose from a Single RGB Image | Detecting objects and their 6D poses from only RGB images is an important
task for many robotic applications. While deep learning methods have made
significant progress in visual object detection and segmentation, the object
pose estimation task is still challenging. In this paper, we introduce an
end-toend deep learning framework, named Deep-6DPose, that jointly detects,
segments, and most importantly recovers 6D poses of object instances from a
single RGB image. In particular, we extend the recent state-of-the-art instance
segmentation network Mask R-CNN with a novel pose estimation branch to directly
regress 6D object poses without any post-refinements. Our key technical
contribution is the decoupling of pose parameters into translation and rotation
so that the rotation can be regressed via a Lie algebra representation. The
resulting pose regression loss is differential and unconstrained, making the
training tractable. The experiments on two standard pose benchmarking datasets
show that our proposed approach compares favorably with the state-of-the-art
RGB-based multi-stage pose estimation methods. Importantly, due to the
end-to-end architecture, Deep-6DPose is considerably faster than competing
multi-stage methods, offers an inference speed of 10 fps that is well suited
for robotic applications.
| cs.CV cs.RO | detecting objects and their 6d poses from only rgb images is an important task for many robotic applications while deep learning methods have made significant progress in visual object detection and segmentation the object pose estimation task is still challenging in this paper we introduce an endtoend deep learning framework named deep6dpose that jointly detects segments and most importantly recovers 6d poses of object instances from a single rgb image in particular we extend the recent stateoftheart instance segmentation network mask rcnn with a novel pose estimation branch to directly regress 6d object poses without any postrefinements our key technical contribution is the decoupling of pose parameters into translation and rotation so that the rotation can be regressed via a lie algebra representation the resulting pose regression loss is differential and unconstrained making the training tractable the experiments on two standard pose benchmarking datasets show that our proposed approach compares favorably with the stateoftheart rgbbased multistage pose estimation methods importantly due to the endtoend architecture deep6dpose is considerably faster than competing multistage methods offers an inference speed of 10 fps that is well suited for robotic applications | [['detecting', 'objects', 'and', 'their', '6d', 'poses', 'from', 'only', 'rgb', 'images', 'is', 'an', 'important', 'task', 'for', 'many', 'robotic', 'applications', 'while', 'deep', 'learning', 'methods', 'have', 'made', 'significant', 'progress', 'in', 'visual', 'object', 'detection', 'and', 'segmentation', 'the', 'object', 'pose', 'estimation', 'task', 'is', 'still', 'challenging', 'in', 'this', 'paper', 'we', 'introduce', 'an', 'endtoend', 'deep', 'learning', 'framework', 'named', 'deep6dpose', 'that', 'jointly', 'detects', 'segments', 'and', 'most', 'importantly', 'recovers', '6d', 'poses', 'of', 'object', 'instances', 'from', 'a', 'single', 'rgb', 'image', 'in', 'particular', 'we', 'extend', 'the', 'recent', 'stateoftheart', 'instance', 'segmentation', 'network', 'mask', 'rcnn', 'with', 'a', 'novel', 'pose', 'estimation', 'branch', 'to', 'directly', 'regress', '6d', 'object', 'poses', 'without', 'any', 'postrefinements', 'our', 'key', 'technical', 'contribution', 'is', 'the', 'decoupling', 'of', 'pose', 'parameters', 'into', 'translation', 'and', 'rotation', 'so', 'that', 'the', 'rotation', 'can', 'be', 'regressed', 'via', 'a', 'lie', 'algebra', 'representation', 'the', 'resulting', 'pose', 'regression', 'loss', 'is', 'differential', 'and', 'unconstrained', 'making', 'the', 'training', 'tractable', 'the', 'experiments', 'on', 'two', 'standard', 'pose', 'benchmarking', 'datasets', 'show', 'that', 'our', 'proposed', 'approach', 'compares', 'favorably', 'with', 'the', 'stateoftheart', 'rgbbased', 'multistage', 'pose', 'estimation', 'methods', 'importantly', 'due', 'to', 'the', 'endtoend', 'architecture', 'deep6dpose', 'is', 'considerably', 'faster', 'than', 'competing', 'multistage', 'methods', 'offers', 'an', 'inference', 'speed', 'of', '10', 'fps', 'that', 'is', 'well', 'suited', 'for', 'robotic', 'applications']] | [-0.04101774838889706, -0.044298964679515135, -0.04107928550397248, 0.03530393032554496, -0.12905973000401308, -0.20993238134036327, -0.029155550849163377, 0.4670987657635756, -0.24051949083862026, -0.3832325877763493, 0.09519326721340843, -0.22487103566274289, -0.20864443788709847, 0.2273308277717265, -0.24214377525419442, 0.10710029235000863, 0.20784146513830384, 0.043244899027859385, -0.10037429460688778, -0.2638805170072769, 0.2791959366067718, -0.0042965469819255695, 0.3219251798152033, -0.014309533074834768, 0.17635170051083982, -0.009612485042611219, -0.013730833376504725, -0.03526069123409283, -0.027594903598662273, 0.20777684760326773, 0.3130588362287001, 0.20846520214209982, 0.27832532624977274, -0.39682872860651947, -0.24185357059405246, 0.060994412975244064, 0.1711681445139339, 0.12928096859523858, -0.06277826924254085, -0.37005689516967244, 0.05156173773170651, -0.15278859699458774, 0.01473017546738012, -0.1373303206080733, 0.0010478791417604637, -0.08666328895354958, -0.27062315313631424, 0.060404358400062294, 0.051874803369687666, 0.03714163132700259, -0.05973968725352872, -0.1204833626828116, 0.05402774078127392, 0.19418896213629405, 0.04523549557653377, 0.11189201840898022, 0.17175705463412907, -0.26809673921240534, -0.13459294915968634, 0.3878048252840729, -0.03289207343036453, -0.20107027118564988, 0.20907516080921557, -0.009818893168931421, -0.18973638449856284, 0.13751750928349793, 0.20164226054760587, 0.1847769780661506, -0.14013713318348417, 0.0332213543433286, -0.04804584287542283, 0.19865757609596071, 0.03437762520574641, -0.04428113106531901, 0.19995783830476602, 0.28721557567705924, 0.07096214633233815, 0.12416196971785014, -0.24053502783341252, -0.05097023782360813, -0.20585948771938845, -0.1122654854818551, -0.14644089229809848, -0.05384660788442251, -0.11354057337168501, -0.13031149835897732, 0.38019525042087166, 0.2745149072282441, 0.23479552389218714, 0.1274664352835237, 0.4167488896611916, 0.0296222517787575, 0.1318127049738035, 0.07861970875503334, 0.2188821374919549, -0.0008674572151073295, 0.05982163789272106, -0.17419450544833165, 0.09726167965298214, 0.06751959606291442] |
1,802.10368 | Large scale distribution of mass versus light from Baryon Acoustic
Oscillations: Measurement in the final SDSS-III BOSS Data Release 12 | Baryon Acoustic Oscillations (BAOs) in the early Universe are predicted to
leave an as yet undetected signature on the relative clustering of total mass
versus luminous matter. This signature, a modulation of the relative
large-scale clustering of baryons and dark matter, offers a new angle to
compare the large scale distribution of light versus mass. A detection of this
effect would provide an important confirmation of the standard cosmological
paradigm and constrain alternatives to dark matter as well as non-standard
fluctuations such as Compensated Isocurvature Perturbations (CIPs). The first
attempt to measure this effect in the SDSS-III BOSS Data Release 10 CMASS
sample remained inconclusive but allowed to develop a method, which we detail
here and use to conduct the second observational search. When using the same
model as in our previous study and including CIPs in the model, the DR12 data
are consistent with a null-detection, a result in tension with the strong
evidence previously measured with the DR10 data. This tension remains when we
use a more realistic model taking into account our knowledge of the survey flux
limit, as the data then privilege a zero effect. In the absence of CIPs, we
obtain a null detection consistent with both the absence of the effect and the
amplitude predicted in previous theoretical studies. This shows the necessity
of more accurate data in order to prove or disprove the theoretical
predictions.
| astro-ph.CO | baryon acoustic oscillations baos in the early universe are predicted to leave an as yet undetected signature on the relative clustering of total mass versus luminous matter this signature a modulation of the relative largescale clustering of baryons and dark matter offers a new angle to compare the large scale distribution of light versus mass a detection of this effect would provide an important confirmation of the standard cosmological paradigm and constrain alternatives to dark matter as well as nonstandard fluctuations such as compensated isocurvature perturbations cips the first attempt to measure this effect in the sdssiii boss data release 10 cmass sample remained inconclusive but allowed to develop a method which we detail here and use to conduct the second observational search when using the same model as in our previous study and including cips in the model the dr12 data are consistent with a nulldetection a result in tension with the strong evidence previously measured with the dr10 data this tension remains when we use a more realistic model taking into account our knowledge of the survey flux limit as the data then privilege a zero effect in the absence of cips we obtain a null detection consistent with both the absence of the effect and the amplitude predicted in previous theoretical studies this shows the necessity of more accurate data in order to prove or disprove the theoretical predictions | [['baryon', 'acoustic', 'oscillations', 'baos', 'in', 'the', 'early', 'universe', 'are', 'predicted', 'to', 'leave', 'an', 'as', 'yet', 'undetected', 'signature', 'on', 'the', 'relative', 'clustering', 'of', 'total', 'mass', 'versus', 'luminous', 'matter', 'this', 'signature', 'a', 'modulation', 'of', 'the', 'relative', 'largescale', 'clustering', 'of', 'baryons', 'and', 'dark', 'matter', 'offers', 'a', 'new', 'angle', 'to', 'compare', 'the', 'large', 'scale', 'distribution', 'of', 'light', 'versus', 'mass', 'a', 'detection', 'of', 'this', 'effect', 'would', 'provide', 'an', 'important', 'confirmation', 'of', 'the', 'standard', 'cosmological', 'paradigm', 'and', 'constrain', 'alternatives', 'to', 'dark', 'matter', 'as', 'well', 'as', 'nonstandard', 'fluctuations', 'such', 'as', 'compensated', 'isocurvature', 'perturbations', 'cips', 'the', 'first', 'attempt', 'to', 'measure', 'this', 'effect', 'in', 'the', 'sdssiii', 'boss', 'data', 'release', '10', 'cmass', 'sample', 'remained', 'inconclusive', 'but', 'allowed', 'to', 'develop', 'a', 'method', 'which', 'we', 'detail', 'here', 'and', 'use', 'to', 'conduct', 'the', 'second', 'observational', 'search', 'when', 'using', 'the', 'same', 'model', 'as', 'in', 'our', 'previous', 'study', 'and', 'including', 'cips', 'in', 'the', 'model', 'the', 'dr12', 'data', 'are', 'consistent', 'with', 'a', 'nulldetection', 'a', 'result', 'in', 'tension', 'with', 'the', 'strong', 'evidence', 'previously', 'measured', 'with', 'the', 'dr10', 'data', 'this', 'tension', 'remains', 'when', 'we', 'use', 'a', 'more', 'realistic', 'model', 'taking', 'into', 'account', 'our', 'knowledge', 'of', 'the', 'survey', 'flux', 'limit', 'as', 'the', 'data', 'then', 'privilege', 'a', 'zero', 'effect', 'in', 'the', 'absence', 'of', 'cips', 'we', 'obtain', 'a', 'null', 'detection', 'consistent', 'with', 'both', 'the', 'absence', 'of', 'the', 'effect', 'and', 'the', 'amplitude', 'predicted', 'in', 'previous', 'theoretical', 'studies', 'this', 'shows', 'the', 'necessity', 'of', 'more', 'accurate', 'data', 'in', 'order', 'to', 'prove', 'or', 'disprove', 'the', 'theoretical', 'predictions']] | [-0.08754848288613018, 0.08634507768611316, -0.09730984198515592, 0.12539975896050173, -0.10557794095627193, -0.058063909988489065, 0.06008862995478357, 0.307270611391467, -0.20628199185011908, -0.3851563932639065, 0.08616494573150954, -0.3064827266646497, -0.0670296289699136, 0.1761400488586207, -0.010371094545477936, 0.020340537128504366, 0.037573140885295536, 0.011046294451230567, -0.03635303119893973, -0.24015519491764153, 0.3002286900982967, 0.10910786594392667, 0.28292004393081477, 0.02280762894600951, 0.04461129145056475, -0.041610066106559, -0.11605175935807799, 0.02162737624593288, -0.14870128411643363, 0.04983516214094285, 0.1945884485463968, 0.11582847650801152, 0.23444408080179308, -0.3932255339558306, -0.22210582830252704, 0.16197588419790604, 0.17216964488736644, 0.16978107018803712, -0.08953782217790361, -0.2990227112594735, 0.05914752574169362, -0.17227853835331566, -0.13022736781919053, -0.07177641272448518, 0.0010336112142701086, -0.029002887613324705, -0.24951487579503387, 0.15983926432592602, 0.02817553300130761, 0.0337741130577593, -0.08922994910169328, -0.11106457560250921, -0.019796660682788632, 0.07267153669767892, 0.08326521881400399, 0.03456302171328169, 0.10544924360422964, -0.1457778851467522, -0.08856264704533306, 0.41405202849398787, -0.13818539960705273, -0.10937740278213509, 0.14391419531151267, -0.16024315077008616, -0.15392286751764536, 0.07398041328345024, 0.1783877196962592, 0.07264324971690476, -0.13614437738014484, 0.02669320558674497, -0.01700708330576288, 0.20638666349334706, 0.006561853465270893, 0.040520726578663395, 0.2671759584155897, 0.19116828582853737, 0.04831941023715852, 0.09922421624902074, -0.15025289407389336, -0.013711533362672118, -0.31042574251327537, -0.10059853945902683, -0.14759204419960012, 0.03894114236403578, -0.08220644844945567, -0.1688948181489932, 0.3644281109485872, 0.1872312653840395, 0.2523274185820402, 0.07150296012194554, 0.36522825410718035, 0.047717018843756925, 0.07259290909910462, 0.02436389709353158, 0.3167200168265544, 0.12356192382566374, 0.10054114744958371, -0.20925131698195715, 0.05170746185417399, -0.04798525354046182] |
1,802.10369 | An affine model of the dynamics of astrophysical discs | Thin astrophysical discs are very often modelled using the equations of
two-dimensional hydrodynamics. We derive an extension of this model that
describes more accurately the behaviour of a thin disc in the absence of
self-gravity, magnetic fields and complex internal motions. The ideal fluid
theory is derived directly from Hamilton's Principle for a three-dimensional
fluid after making a specific approximation to the deformation gradient tensor.
We express the equations in Eulerian form after projection on to a reference
plane. The disc is thought of as a set of fluid columns, each of which is
capable of a time-dependent affine transformation, consisting of a translation
together with a linear transformation in three dimensions. Therefore, in
addition to the usual two-dimensional hydrodynamics in the reference plane, the
theory allows for a deformation of the midplane (as occurs in warped discs) and
for the internal shearing motions that accompany such deformations. It also
allows for the vertical expansions driven in non-circular discs by a variation
of the vertical gravitational field around the horizontal streamlines, or by a
divergence of the horizontal velocity. The equations of the affine model embody
conservation laws for energy and potential vorticity, even for non-planar
discs. We verify that they reproduce exactly the linear theories of
three-dimensional warped and eccentric discs in a secular approximation.
However, the affine model does not rely on any secular or small-amplitude
assumptions and should be useful in more general circumstances.
| astro-ph.SR | thin astrophysical discs are very often modelled using the equations of twodimensional hydrodynamics we derive an extension of this model that describes more accurately the behaviour of a thin disc in the absence of selfgravity magnetic fields and complex internal motions the ideal fluid theory is derived directly from hamiltons principle for a threedimensional fluid after making a specific approximation to the deformation gradient tensor we express the equations in eulerian form after projection on to a reference plane the disc is thought of as a set of fluid columns each of which is capable of a timedependent affine transformation consisting of a translation together with a linear transformation in three dimensions therefore in addition to the usual twodimensional hydrodynamics in the reference plane the theory allows for a deformation of the midplane as occurs in warped discs and for the internal shearing motions that accompany such deformations it also allows for the vertical expansions driven in noncircular discs by a variation of the vertical gravitational field around the horizontal streamlines or by a divergence of the horizontal velocity the equations of the affine model embody conservation laws for energy and potential vorticity even for nonplanar discs we verify that they reproduce exactly the linear theories of threedimensional warped and eccentric discs in a secular approximation however the affine model does not rely on any secular or smallamplitude assumptions and should be useful in more general circumstances | [['thin', 'astrophysical', 'discs', 'are', 'very', 'often', 'modelled', 'using', 'the', 'equations', 'of', 'twodimensional', 'hydrodynamics', 'we', 'derive', 'an', 'extension', 'of', 'this', 'model', 'that', 'describes', 'more', 'accurately', 'the', 'behaviour', 'of', 'a', 'thin', 'disc', 'in', 'the', 'absence', 'of', 'selfgravity', 'magnetic', 'fields', 'and', 'complex', 'internal', 'motions', 'the', 'ideal', 'fluid', 'theory', 'is', 'derived', 'directly', 'from', 'hamiltons', 'principle', 'for', 'a', 'threedimensional', 'fluid', 'after', 'making', 'a', 'specific', 'approximation', 'to', 'the', 'deformation', 'gradient', 'tensor', 'we', 'express', 'the', 'equations', 'in', 'eulerian', 'form', 'after', 'projection', 'on', 'to', 'a', 'reference', 'plane', 'the', 'disc', 'is', 'thought', 'of', 'as', 'a', 'set', 'of', 'fluid', 'columns', 'each', 'of', 'which', 'is', 'capable', 'of', 'a', 'timedependent', 'affine', 'transformation', 'consisting', 'of', 'a', 'translation', 'together', 'with', 'a', 'linear', 'transformation', 'in', 'three', 'dimensions', 'therefore', 'in', 'addition', 'to', 'the', 'usual', 'twodimensional', 'hydrodynamics', 'in', 'the', 'reference', 'plane', 'the', 'theory', 'allows', 'for', 'a', 'deformation', 'of', 'the', 'midplane', 'as', 'occurs', 'in', 'warped', 'discs', 'and', 'for', 'the', 'internal', 'shearing', 'motions', 'that', 'accompany', 'such', 'deformations', 'it', 'also', 'allows', 'for', 'the', 'vertical', 'expansions', 'driven', 'in', 'noncircular', 'discs', 'by', 'a', 'variation', 'of', 'the', 'vertical', 'gravitational', 'field', 'around', 'the', 'horizontal', 'streamlines', 'or', 'by', 'a', 'divergence', 'of', 'the', 'horizontal', 'velocity', 'the', 'equations', 'of', 'the', 'affine', 'model', 'embody', 'conservation', 'laws', 'for', 'energy', 'and', 'potential', 'vorticity', 'even', 'for', 'nonplanar', 'discs', 'we', 'verify', 'that', 'they', 'reproduce', 'exactly', 'the', 'linear', 'theories', 'of', 'threedimensional', 'warped', 'and', 'eccentric', 'discs', 'in', 'a', 'secular', 'approximation', 'however', 'the', 'affine', 'model', 'does', 'not', 'rely', 'on', 'any', 'secular', 'or', 'smallamplitude', 'assumptions', 'and', 'should', 'be', 'useful', 'in', 'more', 'general', 'circumstances']] | [-0.1391502563863254, 0.11087607397195119, -0.09189843272648845, 0.07060987407730633, -0.09047092305754709, -0.06689869627142364, -0.044577117892422316, 0.33249210230298815, -0.2746906187925645, -0.2597912085175766, 0.0800929619367765, -0.20507775878601017, -0.1344071901982067, 0.19373533227343412, -0.05094243068825689, 0.047114258907138044, 0.02510200173472239, -0.012927759863153289, -0.08319012229949754, -0.1812518250854403, 0.32802599612702044, 0.033018988759535906, 0.2054033225936666, -0.05764603883004452, 0.11353493904702774, -0.016323228376497072, -0.02226971046613993, 0.07438347082612604, -0.15624757027122727, 0.08034837743825425, 0.19422611244757687, 0.04482162644288931, 0.2289646000892144, -0.4731850764175822, -0.24028172833601383, 0.04017444314309376, 0.150170118849084, 0.14021645875240948, -0.027511270045433467, -0.21338513089375344, 0.050917699363255554, -0.1615872677525639, -0.19997811680345282, -0.06658884125588783, 0.044868203817733134, 0.027400271828533915, -0.2672895041922155, 0.10840898327121608, 0.13539056397433186, 0.0851600160390013, -0.10850022817551225, -0.02740136437454037, -0.08359058811682972, 0.07366844493728944, 0.03665595401701309, 0.04055772500332712, 0.1681670964998095, -0.16239822490380504, -0.05312787794177951, 0.446127253592423, -0.09269811084921281, -0.28071419174000933, 0.1948279234205416, -0.162087794340251, -0.1074131257809455, 0.15049090204177865, 0.17731643326478355, 0.1270106633032676, -0.13570966006193766, 0.09817585347191812, -0.05306643654615913, 0.12572416040323328, 0.09098966073299825, -0.05415825015950736, 0.27393705066969376, 0.0984375300131471, 0.05099802124726621, 0.12174753077035448, -0.08986621888409435, -0.1294210664240274, -0.32661614494736185, -0.16536168335202123, -0.13149256543020565, 0.06663098191663884, -0.11248928959497874, -0.21657884219083698, 0.34287257450618014, 0.0924856254059398, 0.18273402710336178, 0.022380572473060512, 0.29483441299982843, 0.09504334810824784, 0.0910806041996816, 0.10617560655554513, 0.2647524672238164, 0.16846497026606136, 0.08721486866124906, -0.2139820312935749, 0.03601726647545014, 0.09128418921606953] |
1,802.1037 | Quantum Interference of Force | We show that a quantum particle subjected to a positive force in one path of
a Mach-Zehnder interferometer and a null force in the other path may receive a
negative average momentum transfer when it leaves the interferometer by a
particular exit. In this scenario, an ensemble of particles may receive an
average momentum in the opposite direction of the applied force due to quantum
interference, a behavior with no classical analogue. We discuss some
experimental schemes that could verify the effect with current technology, with
electrons or neutrons in Mach-Zehnder interferometers in free space and with
atoms from a Bose-Einstein condensate.
| quant-ph | we show that a quantum particle subjected to a positive force in one path of a machzehnder interferometer and a null force in the other path may receive a negative average momentum transfer when it leaves the interferometer by a particular exit in this scenario an ensemble of particles may receive an average momentum in the opposite direction of the applied force due to quantum interference a behavior with no classical analogue we discuss some experimental schemes that could verify the effect with current technology with electrons or neutrons in machzehnder interferometers in free space and with atoms from a boseeinstein condensate | [['we', 'show', 'that', 'a', 'quantum', 'particle', 'subjected', 'to', 'a', 'positive', 'force', 'in', 'one', 'path', 'of', 'a', 'machzehnder', 'interferometer', 'and', 'a', 'null', 'force', 'in', 'the', 'other', 'path', 'may', 'receive', 'a', 'negative', 'average', 'momentum', 'transfer', 'when', 'it', 'leaves', 'the', 'interferometer', 'by', 'a', 'particular', 'exit', 'in', 'this', 'scenario', 'an', 'ensemble', 'of', 'particles', 'may', 'receive', 'an', 'average', 'momentum', 'in', 'the', 'opposite', 'direction', 'of', 'the', 'applied', 'force', 'due', 'to', 'quantum', 'interference', 'a', 'behavior', 'with', 'no', 'classical', 'analogue', 'we', 'discuss', 'some', 'experimental', 'schemes', 'that', 'could', 'verify', 'the', 'effect', 'with', 'current', 'technology', 'with', 'electrons', 'or', 'neutrons', 'in', 'machzehnder', 'interferometers', 'in', 'free', 'space', 'and', 'with', 'atoms', 'from', 'a', 'boseeinstein', 'condensate']] | [-0.1791189190927053, 0.23383044241499568, -0.1415461505918453, 0.027253511283026242, -0.027744186850374237, -0.1649319404809206, 0.031753405093160623, 0.4024188482001716, -0.23168270117329323, -0.2698106388287509, -0.01331170802757911, -0.2991467934722702, -0.12537818422367542, 0.18677891599922897, -0.05386356675230405, 0.011989707841683983, 0.08653732789703188, 0.0725839443290241, -0.031165016390492812, -0.1952065978308811, 0.3062066048401974, 0.08334458118542006, 0.2813433847828385, 0.030285119115575857, 0.1370077585783221, 0.023534966705768715, 0.03921641007650132, 0.04366106864643585, -0.08576993361402499, 0.03648561195415609, 0.19952402392621427, 0.02355831852821889, 0.2635707921330251, -0.4804168447633, -0.20805930125289687, 0.13365377900281958, 0.13822894365818916, 0.16900458055155754, -0.09812040380932682, -0.28478797625604213, -0.03414655961644124, -0.1919448212994372, -0.14442377391855651, 0.004066741413564659, 0.011645213639199296, 0.016974240625916303, -0.25570323759251656, 0.02799454278440452, 0.02055390007501724, 0.008337467319934684, -0.024996820823563373, -0.07862877941179071, 0.04394725344929041, 0.05923333724957261, 0.009688685465531022, 0.06705604932686388, 0.13601053868621296, -0.1528432772965079, -0.16987457824870944, 0.3841844797682236, -0.09127280355645709, -0.22935261042313834, 0.1435819952200879, -0.17790057310177124, -0.024201658746118054, 0.10719322348378744, 0.1409822124440004, 0.07318292854481614, -0.09861931495905475, 0.011841972576518195, -0.012460697314464579, 0.15627359347783176, 0.11382584490210694, 0.05834285844021531, 0.2583513178666608, 0.09428504391062055, 0.10803664432308983, 0.16907195554299773, -0.13295068045822428, -0.11828349546675443, -0.2827378151819621, -0.20173064190392181, -0.19211431573528578, 0.09100506679319284, -0.04298103626734148, -0.13132326398957886, 0.31210510782879214, 0.15333021568207472, 0.20411984829971677, -0.02600798780536827, 0.3682287880721703, 0.1056209962824177, 0.0708037684854193, 0.033707362426189234, 0.25234990867965296, 0.12282699504273706, 0.10594551507657503, -0.2537067172861676, -0.000973187291118152, -0.003882354874090821] |
1,802.10371 | CoMP in the Sky: UAV Placement and Movement Optimization for Multi-User
Communications | Driven by the recent advancement in unmanned aerial vehicle (UAV) technology,
this paper proposes a new wireless network architecture of \emph{coordinate
multipoint (CoMP) in the sky} to harness both the benefits of interference
mitigation via CoMP and high mobility of UAVs. Specifically, we consider uplink
communications in a multi-UAV enabled multi-user system, where each UAV
forwards its received signals from all ground users to a central processor (CP)
for joint decoding. Moreover, we consider the case where the users may move on
the ground, thus the UAVs need to adjust their locations in accordance with the
user locations over time to maximize the network throughput. Utilizing random
matrix theory, we first characterize in closed-form a set of approximated upper
and lower bounds of the user's achievable rate in each time episode under a
realistic line-of-sight (LoS) channel model with random phase, which are shown
very tight both analytically and numerically. UAV placement and movement over
different episodes are then optimized based on the derived bounds to maximize
the minimum of user average achievable rates over all episodes for both cases
of full information (of current and future episodes) and current information on
the user's movement. Interestingly, it is shown that the optimized location of
each UAV at any particular episode is the weighted average of the ground user
locations at the current episode as well as its own location at the previous
and/or next episode. Finally, simulation results are provided to validate and
compare the performance of the proposed UAV placement and movement designs
under different practical application scenarios.
| cs.IT math.IT | driven by the recent advancement in unmanned aerial vehicle uav technology this paper proposes a new wireless network architecture of emphcoordinate multipoint comp in the sky to harness both the benefits of interference mitigation via comp and high mobility of uavs specifically we consider uplink communications in a multiuav enabled multiuser system where each uav forwards its received signals from all ground users to a central processor cp for joint decoding moreover we consider the case where the users may move on the ground thus the uavs need to adjust their locations in accordance with the user locations over time to maximize the network throughput utilizing random matrix theory we first characterize in closedform a set of approximated upper and lower bounds of the users achievable rate in each time episode under a realistic lineofsight los channel model with random phase which are shown very tight both analytically and numerically uav placement and movement over different episodes are then optimized based on the derived bounds to maximize the minimum of user average achievable rates over all episodes for both cases of full information of current and future episodes and current information on the users movement interestingly it is shown that the optimized location of each uav at any particular episode is the weighted average of the ground user locations at the current episode as well as its own location at the previous andor next episode finally simulation results are provided to validate and compare the performance of the proposed uav placement and movement designs under different practical application scenarios | [['driven', 'by', 'the', 'recent', 'advancement', 'in', 'unmanned', 'aerial', 'vehicle', 'uav', 'technology', 'this', 'paper', 'proposes', 'a', 'new', 'wireless', 'network', 'architecture', 'of', 'emphcoordinate', 'multipoint', 'comp', 'in', 'the', 'sky', 'to', 'harness', 'both', 'the', 'benefits', 'of', 'interference', 'mitigation', 'via', 'comp', 'and', 'high', 'mobility', 'of', 'uavs', 'specifically', 'we', 'consider', 'uplink', 'communications', 'in', 'a', 'multiuav', 'enabled', 'multiuser', 'system', 'where', 'each', 'uav', 'forwards', 'its', 'received', 'signals', 'from', 'all', 'ground', 'users', 'to', 'a', 'central', 'processor', 'cp', 'for', 'joint', 'decoding', 'moreover', 'we', 'consider', 'the', 'case', 'where', 'the', 'users', 'may', 'move', 'on', 'the', 'ground', 'thus', 'the', 'uavs', 'need', 'to', 'adjust', 'their', 'locations', 'in', 'accordance', 'with', 'the', 'user', 'locations', 'over', 'time', 'to', 'maximize', 'the', 'network', 'throughput', 'utilizing', 'random', 'matrix', 'theory', 'we', 'first', 'characterize', 'in', 'closedform', 'a', 'set', 'of', 'approximated', 'upper', 'and', 'lower', 'bounds', 'of', 'the', 'users', 'achievable', 'rate', 'in', 'each', 'time', 'episode', 'under', 'a', 'realistic', 'lineofsight', 'los', 'channel', 'model', 'with', 'random', 'phase', 'which', 'are', 'shown', 'very', 'tight', 'both', 'analytically', 'and', 'numerically', 'uav', 'placement', 'and', 'movement', 'over', 'different', 'episodes', 'are', 'then', 'optimized', 'based', 'on', 'the', 'derived', 'bounds', 'to', 'maximize', 'the', 'minimum', 'of', 'user', 'average', 'achievable', 'rates', 'over', 'all', 'episodes', 'for', 'both', 'cases', 'of', 'full', 'information', 'of', 'current', 'and', 'future', 'episodes', 'and', 'current', 'information', 'on', 'the', 'users', 'movement', 'interestingly', 'it', 'is', 'shown', 'that', 'the', 'optimized', 'location', 'of', 'each', 'uav', 'at', 'any', 'particular', 'episode', 'is', 'the', 'weighted', 'average', 'of', 'the', 'ground', 'user', 'locations', 'at', 'the', 'current', 'episode', 'as', 'well', 'as', 'its', 'own', 'location', 'at', 'the', 'previous', 'andor', 'next', 'episode', 'finally', 'simulation', 'results', 'are', 'provided', 'to', 'validate', 'and', 'compare', 'the', 'performance', 'of', 'the', 'proposed', 'uav', 'placement', 'and', 'movement', 'designs', 'under', 'different', 'practical', 'application', 'scenarios']] | [-0.18921041613094539, 0.04115100839814215, 0.008433567533312841, 0.01462369749382095, -0.07342120521528603, -0.17600698248382166, 0.1399211209184353, 0.42161950245120583, -0.23912152836222, -0.30488437276456304, 0.10590636817279972, -0.24949668554630663, -0.16715130224361902, 0.1786629342349506, -0.11890824891666542, 0.056901737424461966, 0.07072942041297436, 0.07929288457750609, -0.03684319171594508, -0.2715321379197516, 0.2474469277031301, 0.11624906770343524, 0.34108082949934715, 0.03610351324296203, 0.09823717489656307, 0.024341477448474473, -0.016637155031713174, -0.040109585944871164, -0.12468290052744095, 0.09760433826830181, 0.3051522185506169, 0.1934606661052667, 0.27753901640729356, -0.45556285163900245, -0.2333655216940498, 0.08596418933336471, 0.16271838087538013, 0.04558322031381215, -0.04180600705318326, -0.324494967527702, 0.12605293009086338, -0.24125017694381692, -0.044964179342482674, 0.04011712428699013, -0.032948839366291616, 0.08812834413870159, -0.3358180969592559, -0.016534527860285874, -0.052276190909531776, 0.0375254055034584, -0.09072023126713628, -0.08137118532782593, -0.005590229495536796, 0.2279863474220976, 0.049654126717830725, 0.0018961919551036617, 0.13166908289183132, -0.11531088234271941, -0.12260100929663957, 0.38114879138464497, 0.0012011912327833734, -0.1860340913512217, 0.1518790082942402, -0.12441545096226037, -0.09797557223183934, 0.13911277802964284, 0.25672887223447827, 0.08880449635835812, -0.16432987273419852, -0.003533733696424106, -0.008343445317180785, 0.1071330077978674, 0.07462208036715959, 0.06206336090622773, 0.20198557093782826, 0.16624862542863242, 0.17540606794032348, 0.10832044474560364, -0.15644310337000403, -0.13472050913273856, -0.225720746353108, -0.09728450749011695, -0.20226632607035888, -0.020624781070753585, -0.08469515471933987, -0.03877654512049161, 0.40270880471315784, 0.16856014769923217, 0.16114915535305158, 0.11932283354419565, 0.39031388287887325, 0.09050502012852199, 0.020378402487533673, 0.13413771370817482, 0.1906682969050215, 0.05679279773959948, 0.15812929315797536, -0.2090495495196042, 0.10297315789327069, 0.00279703820683784] |
1,802.10372 | Safe and free instantons | We investigate the instanton dynamics of asymptotically safe and free quantum
field theories featuring respectively controllable ultraviolet and infrared
fixed points. We start by briefly reviewing the salient points about the
instanton calculus for pure Yang Mills (YM) and QCD. We then move on to
determine the role of instantons within the controllable regime of the QCD
conformal window. In this region we add a fermion-mass operator and determine
the density of instantons per unit volume as function of the fermion mass.
Finally, for the first time, we extend the instanton calculus to asymptotically
safe theories.
| hep-th hep-lat hep-ph nucl-th | we investigate the instanton dynamics of asymptotically safe and free quantum field theories featuring respectively controllable ultraviolet and infrared fixed points we start by briefly reviewing the salient points about the instanton calculus for pure yang mills ym and qcd we then move on to determine the role of instantons within the controllable regime of the qcd conformal window in this region we add a fermionmass operator and determine the density of instantons per unit volume as function of the fermion mass finally for the first time we extend the instanton calculus to asymptotically safe theories | [['we', 'investigate', 'the', 'instanton', 'dynamics', 'of', 'asymptotically', 'safe', 'and', 'free', 'quantum', 'field', 'theories', 'featuring', 'respectively', 'controllable', 'ultraviolet', 'and', 'infrared', 'fixed', 'points', 'we', 'start', 'by', 'briefly', 'reviewing', 'the', 'salient', 'points', 'about', 'the', 'instanton', 'calculus', 'for', 'pure', 'yang', 'mills', 'ym', 'and', 'qcd', 'we', 'then', 'move', 'on', 'to', 'determine', 'the', 'role', 'of', 'instantons', 'within', 'the', 'controllable', 'regime', 'of', 'the', 'qcd', 'conformal', 'window', 'in', 'this', 'region', 'we', 'add', 'a', 'fermionmass', 'operator', 'and', 'determine', 'the', 'density', 'of', 'instantons', 'per', 'unit', 'volume', 'as', 'function', 'of', 'the', 'fermion', 'mass', 'finally', 'for', 'the', 'first', 'time', 'we', 'extend', 'the', 'instanton', 'calculus', 'to', 'asymptotically', 'safe', 'theories']] | [-0.12148649721833256, 0.2021267759555485, -0.08716326902019016, 0.1079441310709323, -0.04164494342451993, -0.09633214289109067, 0.10566956174686008, 0.3349549379199743, -0.16834435613418464, -0.22999749371471503, 0.0799598474392648, -0.2854710154933855, -0.15744403635229295, 0.06096534464692619, -0.06562011160015875, 0.055555340392553866, -0.0675086885263833, 0.053833615689654835, -0.09256675352420037, -0.2567556418653112, 0.3446435356551471, 0.02145916150160095, 0.20482852239122926, 0.08792556486635779, 0.12702194771069722, 0.04192931748063226, -0.054407298031340666, 0.015360221994342282, -0.1916188610290798, 0.08277023495399287, 0.21307080561139932, 0.05931984139412331, 0.17767394332986441, -0.4436887430686814, -0.18925488088279963, 0.07996101410632643, 0.1526358694245573, 0.1194019518394877, -0.010768218580778921, -0.2715634115544769, 0.08590844967693556, -0.14127618802012876, -0.19780553763363665, -0.0961996597761754, 0.01887016241501745, -0.05515956293917649, -0.22526712944575897, 0.016401380897150375, -0.03912309231236577, 0.01562929429928772, -0.06715154813112652, -0.08535845813215322, -0.03797034679640395, 0.12467884260210364, 0.07028986036796898, 0.07709582207219985, 0.161313331448279, -0.2068079576541398, -0.13545126714840686, 0.3647230047499761, -0.07411548644995491, -0.17624258872820064, 0.11120661799213849, -0.15064121441779812, -0.1315012656074638, 0.0759340648073703, 0.12842274351472346, 0.19314493725444967, -0.10317408420572367, 0.21071506671675402, -0.013472803758001342, 0.13716786730704675, 0.12028412179643055, 0.06178957653901307, 0.2617043768501996, 0.1262173729580051, 0.058714457952495046, 0.1433307282319826, -0.05242764946645669, -0.19155400383169763, -0.42631333984900266, -0.1717148574677291, -0.10739122962453014, 0.07099333243968431, -0.1213594182330174, -0.1932466731426151, 0.3572352329501882, 0.1669645365004726, 0.175946095630934, 0.0829355009094191, 0.22796515843219822, 0.12674514446674343, 0.04750344261992723, 0.0732386354211485, 0.22976885712705553, 0.12544240500816764, 0.09282167145162627, -0.2661250235287298, -0.14453183029642483, 0.1862063785204858] |
1,802.10373 | Crossover from mean-field to $2d$ Directed Percolation in the contact
process | We study the contact process on spatially embedded networks, consisting of a
regular square lattice with long-range connections. To generate the networks, a
long-range connection is randomly added to each node $i$ of a square lattice,
following the probability, $P_{ij}\sim{r_{ij}^{-\alpha}}$ , where $r_{ij}$ is
the Manhattan distance between nodes $i$ and $j$, and the exponent $\alpha$ is
a tunable parameter. Extensive Monte Carlo simulations and a finite-size
scaling analysis for different values of $\alpha$ reveal a crossover from the
mean-field to $2d$ Directed Percolation universality class with increasing
$\alpha$, in the range $3<\alpha<4$.
| cond-mat.stat-mech | we study the contact process on spatially embedded networks consisting of a regular square lattice with longrange connections to generate the networks a longrange connection is randomly added to each node i of a square lattice following the probability p_ijsimr_ijalpha where r_ij is the manhattan distance between nodes i and j and the exponent alpha is a tunable parameter extensive monte carlo simulations and a finitesize scaling analysis for different values of alpha reveal a crossover from the meanfield to 2d directed percolation universality class with increasing alpha in the range 3alpha4 | [['we', 'study', 'the', 'contact', 'process', 'on', 'spatially', 'embedded', 'networks', 'consisting', 'of', 'a', 'regular', 'square', 'lattice', 'with', 'longrange', 'connections', 'to', 'generate', 'the', 'networks', 'a', 'longrange', 'connection', 'is', 'randomly', 'added', 'to', 'each', 'node', 'i', 'of', 'a', 'square', 'lattice', 'following', 'the', 'probability', 'p_ijsimr_ijalpha', 'where', 'r_ij', 'is', 'the', 'manhattan', 'distance', 'between', 'nodes', 'i', 'and', 'j', 'and', 'the', 'exponent', 'alpha', 'is', 'a', 'tunable', 'parameter', 'extensive', 'monte', 'carlo', 'simulations', 'and', 'a', 'finitesize', 'scaling', 'analysis', 'for', 'different', 'values', 'of', 'alpha', 'reveal', 'a', 'crossover', 'from', 'the', 'meanfield', 'to', '2d', 'directed', 'percolation', 'universality', 'class', 'with', 'increasing', 'alpha', 'in', 'the', 'range', '3alpha4']] | [-0.16453787555737007, 0.1771849367664092, -0.01792731864714167, 0.017950003440980963, -0.024956946869820563, -0.21091941008344292, 0.08721813639211985, 0.4090963509554664, -0.28862010545821654, -0.24988254102774793, 0.03480950980576583, -0.36363023729580973, -0.16467838707483476, 0.0946876026224345, 0.0648674644012418, 0.03723955617380044, 0.039646946729367805, 0.018541168808264452, -0.07925210981112388, -0.179527168479318, 0.3053818565327674, 0.054479941818863155, 0.2544146166794235, 0.022765001106098578, 0.06633382444011254, 0.022645213501527907, 0.004323526398123553, 0.08974812294149564, -0.22473686263482603, 0.08563866746197972, 0.15813937846234896, -0.01716466050905486, 0.26137927517346626, -0.3554188903214203, -0.23728158975847893, 0.14506415873765946, 0.11825864797251093, 0.0767349572903994, 0.008325452411857745, -0.3004939210911592, 0.08054167963564396, -0.17139335026343663, -0.11584915134266743, 0.012709719698048301, 0.05964750163257122, 0.11052361930811053, -0.32213193387207056, 0.05817588529446059, 0.01955789712568124, 0.08843602238015996, 0.012793925505441924, -0.09231921934212248, -0.005084178493254715, 0.14834294255124406, -0.005010817457676038, 0.06829836090457522, 0.08824935743274788, -0.11043450602317333, -0.12527956010566818, 0.34254954446934993, 0.00429870155122545, -0.18634220069895188, 0.19745868629155058, -0.13341892146919337, -0.13214202324031957, 0.13020524392939276, 0.17173612483828846, 0.05468405679696136, -0.1280975616019633, 0.08356439382575141, -0.035781794434620276, 0.1989613687309126, -0.021149234980758692, -0.041004204540513456, 0.17540647389056782, 0.19146163691249157, 0.06739703486156133, 0.1605672547283272, -0.1331336045860856, -0.2037831540322966, -0.28111881212227874, -0.1269982376963728, -0.2789191915343205, 0.09458352158544585, -0.18818544129689044, -0.20940709226868218, 0.371525409590039, 0.1357637387700379, 0.2341523537101845, 0.10703748643605246, 0.17265054944695699, 0.07231786446645856, 0.046934393503599695, 0.0722945582639012, 0.15023437121676075, 0.1394244728092518, 0.06517856436160703, -0.19461915258369927, 0.023632238789771994, 0.09043294179977643] |
1,802.10374 | Extreme statistics and index distribution in the classical $1d$ Coulomb
gas | We consider a one-dimensional gas of $N$ charged particles confined by an
external harmonic potential and interacting via the one-dimensional Coulomb
potential. For this system we show that in equilibrium the charges settle, on
an average, uniformly and symmetrically on a finite region centred around the
origin. We study the statistics of the position of the rightmost particle
$x_{\max}$ and show that the limiting distribution describing its typical
fluctuations is different from the Tracy-Widom distribution found in the
one-dimensional log-gas. We also compute the large deviation functions which
characterise the atypical fluctuations of $x_{\max}$ far away from its mean
value. In addition, we study the gap between the two rightmost particles as
well as the index $N_+$, i.e., the number of particles on the positive
semi-axis. We compute the limiting distributions associated to the typical
fluctuations of these observables as well as the corresponding large deviation
functions. We provide numerical supports to our analytical predictions. Part of
these results were announced in a recent Letter, Phys. Rev. Lett. 119, 060601
(2017).
| cond-mat.stat-mech math-ph math.MP math.PR | we consider a onedimensional gas of n charged particles confined by an external harmonic potential and interacting via the onedimensional coulomb potential for this system we show that in equilibrium the charges settle on an average uniformly and symmetrically on a finite region centred around the origin we study the statistics of the position of the rightmost particle x_max and show that the limiting distribution describing its typical fluctuations is different from the tracywidom distribution found in the onedimensional loggas we also compute the large deviation functions which characterise the atypical fluctuations of x_max far away from its mean value in addition we study the gap between the two rightmost particles as well as the index n_ ie the number of particles on the positive semiaxis we compute the limiting distributions associated to the typical fluctuations of these observables as well as the corresponding large deviation functions we provide numerical supports to our analytical predictions part of these results were announced in a recent letter phys rev lett 119 060601 2017 | [['we', 'consider', 'a', 'onedimensional', 'gas', 'of', 'n', 'charged', 'particles', 'confined', 'by', 'an', 'external', 'harmonic', 'potential', 'and', 'interacting', 'via', 'the', 'onedimensional', 'coulomb', 'potential', 'for', 'this', 'system', 'we', 'show', 'that', 'in', 'equilibrium', 'the', 'charges', 'settle', 'on', 'an', 'average', 'uniformly', 'and', 'symmetrically', 'on', 'a', 'finite', 'region', 'centred', 'around', 'the', 'origin', 'we', 'study', 'the', 'statistics', 'of', 'the', 'position', 'of', 'the', 'rightmost', 'particle', 'x_max', 'and', 'show', 'that', 'the', 'limiting', 'distribution', 'describing', 'its', 'typical', 'fluctuations', 'is', 'different', 'from', 'the', 'tracywidom', 'distribution', 'found', 'in', 'the', 'onedimensional', 'loggas', 'we', 'also', 'compute', 'the', 'large', 'deviation', 'functions', 'which', 'characterise', 'the', 'atypical', 'fluctuations', 'of', 'x_max', 'far', 'away', 'from', 'its', 'mean', 'value', 'in', 'addition', 'we', 'study', 'the', 'gap', 'between', 'the', 'two', 'rightmost', 'particles', 'as', 'well', 'as', 'the', 'index', 'n_', 'ie', 'the', 'number', 'of', 'particles', 'on', 'the', 'positive', 'semiaxis', 'we', 'compute', 'the', 'limiting', 'distributions', 'associated', 'to', 'the', 'typical', 'fluctuations', 'of', 'these', 'observables', 'as', 'well', 'as', 'the', 'corresponding', 'large', 'deviation', 'functions', 'we', 'provide', 'numerical', 'supports', 'to', 'our', 'analytical', 'predictions', 'part', 'of', 'these', 'results', 'were', 'announced', 'in', 'a', 'recent', 'letter', 'phys', 'rev', 'lett', '119', '060601', '2017']] | [-0.09375210907892324, 0.15490949040104168, -0.07279824996093179, 0.036185253597795966, 0.03211116351406364, -0.06158642589991145, 0.032612284990575384, 0.33197680198423124, -0.22514531154404668, -0.2930341890314594, 0.050156495739322376, -0.3405843276420937, -0.11925939252079629, 0.14545239627648912, -0.02658076069458141, 0.04203328467179638, 0.021203492279164494, 0.04417423337495968, -0.06283661884543322, -0.18315890477559366, 0.28188242245301165, 0.06767561491304899, 0.24632911222493825, 0.0793802948004347, 0.07236145689590451, 0.031228868749595302, -0.013197318138554692, 0.016633036703227418, -0.1834419986620881, 0.07100978383301373, 0.13260668005301235, 0.03706621622447582, 0.24168560006107917, -0.38299801277325435, -0.16411154318929594, 0.15133918324649773, 0.15615957628059038, 0.08631473495008643, -0.03721257911050035, -0.2916767584379105, 0.047322952681433356, -0.1692786367404658, -0.22108099455671276, -0.03063888500773293, 0.06425451220506255, 0.0977625620277489, -0.25356021678239543, 0.12678104223912884, 0.04173138471018961, 0.03416952288021361, -0.05298589032882934, -0.14653146719929816, -0.021358548086958334, 0.12438480110893793, 0.05492313139839098, -0.004155037251492853, 0.15760652856243884, -0.12633798469220944, -0.09320740695933209, 0.3517441094332539, -0.09685349428396234, -0.19230409310582805, 0.1916170264210771, -0.22225236885304397, -0.10356458993354703, 0.10735208719749662, 0.186287235989071, 0.141798096777433, -0.13876386039945132, 0.1038279399402467, -0.09960595156915267, 0.1259840162424713, 0.05646649828208063, 0.009070626805152963, 0.24554123060010813, 0.10283971361966585, 0.040147317976430605, 0.1737052974085707, -0.12993545128710512, -0.15475445220739964, -0.36220150285345665, -0.15743711802231916, -0.23956015747697915, 0.06481706913807156, -0.07162802808837596, -0.18717277659200002, 0.4013946749264826, 0.16756749319816555, 0.26193983270512783, 0.0705998332315015, 0.21407825393492685, 0.14193069302709774, -0.01568471140721265, 0.10040142463848871, 0.24432882180245702, 0.1323918794555699, 0.08207179290543803, -0.2210332768421401, -0.002184899906655226, 0.03339245079413933] |
1,802.10375 | i2kit: A Tool for Immutable Infrastructure Deployments based on
Lightweight Virtual Machines specialized to run Containers | Container technologies, like Docker, are becoming increasingly popular.
Containers provide exceptional developer experience because containers offer
lightweight isolation and ease of software distribution. Containers are also
widely used in production environments, where a different set of challenges
arise such as security, networking, service discovery and load balancing.
Container cluster management tools, such as Kubernetes, attempt to solve these
problems by introducing a new control layer with the container as the unit of
deployment. However, adding a new control layer is an extra configuration step
and an additional potential source of runtime errors. The virtual machine
technology offered by cloud providers is more mature and proven in terms of
security, networking, service discovery and load balancing. However, virtual
machines are heavier than containers for local development, are less flexible
for resource allocation, and suffer longer boot times. This paper presents an
alternative to containers that enjoy the best features of both approaches: (1)
the use of mature, proven cloud vendor technology; (2) no need for a new
control layer; and (3) as lightweight as containers. Our solution is i2kit, a
deployment tool based on the immutable infrastructure pattern, where the
virtual machine is the unit of deployment. The i2kit tool accepts a simplified
format of Kubernetes Deployment Manifests in order to reuse Kubernetes' most
successful principles, but it creates a lightweight virtual machine for each
Pod using Linuxkit. Linuxkit alleviates the drawback in size that using virtual
machines would otherwise entail, because the footprint of Linuxkit is
approximately 60MB. Finally, the attack surface of the system is reduced since
Linuxkit only installs the minimum set of OS dependencies to run containers,
and different Pods are isolated by hypervisor technology.
| cs.DC cs.SE | container technologies like docker are becoming increasingly popular containers provide exceptional developer experience because containers offer lightweight isolation and ease of software distribution containers are also widely used in production environments where a different set of challenges arise such as security networking service discovery and load balancing container cluster management tools such as kubernetes attempt to solve these problems by introducing a new control layer with the container as the unit of deployment however adding a new control layer is an extra configuration step and an additional potential source of runtime errors the virtual machine technology offered by cloud providers is more mature and proven in terms of security networking service discovery and load balancing however virtual machines are heavier than containers for local development are less flexible for resource allocation and suffer longer boot times this paper presents an alternative to containers that enjoy the best features of both approaches 1 the use of mature proven cloud vendor technology 2 no need for a new control layer and 3 as lightweight as containers our solution is i2kit a deployment tool based on the immutable infrastructure pattern where the virtual machine is the unit of deployment the i2kit tool accepts a simplified format of kubernetes deployment manifests in order to reuse kubernetes most successful principles but it creates a lightweight virtual machine for each pod using linuxkit linuxkit alleviates the drawback in size that using virtual machines would otherwise entail because the footprint of linuxkit is approximately 60mb finally the attack surface of the system is reduced since linuxkit only installs the minimum set of os dependencies to run containers and different pods are isolated by hypervisor technology | [['container', 'technologies', 'like', 'docker', 'are', 'becoming', 'increasingly', 'popular', 'containers', 'provide', 'exceptional', 'developer', 'experience', 'because', 'containers', 'offer', 'lightweight', 'isolation', 'and', 'ease', 'of', 'software', 'distribution', 'containers', 'are', 'also', 'widely', 'used', 'in', 'production', 'environments', 'where', 'a', 'different', 'set', 'of', 'challenges', 'arise', 'such', 'as', 'security', 'networking', 'service', 'discovery', 'and', 'load', 'balancing', 'container', 'cluster', 'management', 'tools', 'such', 'as', 'kubernetes', 'attempt', 'to', 'solve', 'these', 'problems', 'by', 'introducing', 'a', 'new', 'control', 'layer', 'with', 'the', 'container', 'as', 'the', 'unit', 'of', 'deployment', 'however', 'adding', 'a', 'new', 'control', 'layer', 'is', 'an', 'extra', 'configuration', 'step', 'and', 'an', 'additional', 'potential', 'source', 'of', 'runtime', 'errors', 'the', 'virtual', 'machine', 'technology', 'offered', 'by', 'cloud', 'providers', 'is', 'more', 'mature', 'and', 'proven', 'in', 'terms', 'of', 'security', 'networking', 'service', 'discovery', 'and', 'load', 'balancing', 'however', 'virtual', 'machines', 'are', 'heavier', 'than', 'containers', 'for', 'local', 'development', 'are', 'less', 'flexible', 'for', 'resource', 'allocation', 'and', 'suffer', 'longer', 'boot', 'times', 'this', 'paper', 'presents', 'an', 'alternative', 'to', 'containers', 'that', 'enjoy', 'the', 'best', 'features', 'of', 'both', 'approaches', '1', 'the', 'use', 'of', 'mature', 'proven', 'cloud', 'vendor', 'technology', '2', 'no', 'need', 'for', 'a', 'new', 'control', 'layer', 'and', '3', 'as', 'lightweight', 'as', 'containers', 'our', 'solution', 'is', 'i2kit', 'a', 'deployment', 'tool', 'based', 'on', 'the', 'immutable', 'infrastructure', 'pattern', 'where', 'the', 'virtual', 'machine', 'is', 'the', 'unit', 'of', 'deployment', 'the', 'i2kit', 'tool', 'accepts', 'a', 'simplified', 'format', 'of', 'kubernetes', 'deployment', 'manifests', 'in', 'order', 'to', 'reuse', 'kubernetes', 'most', 'successful', 'principles', 'but', 'it', 'creates', 'a', 'lightweight', 'virtual', 'machine', 'for', 'each', 'pod', 'using', 'linuxkit', 'linuxkit', 'alleviates', 'the', 'drawback', 'in', 'size', 'that', 'using', 'virtual', 'machines', 'would', 'otherwise', 'entail', 'because', 'the', 'footprint', 'of', 'linuxkit', 'is', 'approximately', '60mb', 'finally', 'the', 'attack', 'surface', 'of', 'the', 'system', 'is', 'reduced', 'since', 'linuxkit', 'only', 'installs', 'the', 'minimum', 'set', 'of', 'os', 'dependencies', 'to', 'run', 'containers', 'and', 'different', 'pods', 'are', 'isolated', 'by', 'hypervisor', 'technology']] | [-0.1437626563780941, 0.06810849881238855, -0.044561405114152214, 0.037089516345242206, -0.11318096603182229, -0.21729606141251598, 0.07263542069503191, 0.3664262146392668, -0.2764420867478475, -0.3448151024634188, 0.14801885260438377, -0.23894297249953855, -0.0833136574043469, 0.19543420834128153, -0.11777462789534845, 0.0822745776375417, 0.0732582474747588, -0.021677735518896953, 0.03242342580988241, -0.24625442612619902, 0.29007316207089884, 0.05565254711715335, 0.34237837929617276, 0.07729368110864678, 0.06107744839973748, 0.017975691481578078, -0.0039000753573649985, -0.028566098316699606, -0.02611472553769338, 0.15699497029862622, 0.2986072338355536, 0.2315988765402951, 0.3356261254542253, -0.48244293964510276, -0.1644148083200509, 0.04205751233649525, 0.17014447854493153, 0.04982814874330705, -0.06191628229449799, -0.23367281494408168, 0.12274370844475925, -0.27016356569122185, -0.13238075680184094, -0.08252731584859166, 0.01054239857095209, 0.012109074761075053, -0.23755281256342475, -0.07647005501721817, 0.006803111704913053, 0.07587454653091051, -0.01369638789699159, -0.12657946559219538, 0.012623915243047205, 0.15199385096827014, 0.00820271904326298, 0.030508642981506205, 0.1987119750881737, -0.15380669901359148, -0.12218320357274602, 0.43388461124151945, 0.02511288639660713, -0.17094200695441528, 0.22094866368792612, 0.035204279681837015, -0.13604643209160053, 0.09189336469227617, 0.2034768315751783, 0.05519133221866055, -0.19524541570212353, 0.0556479318253696, 0.038667009527033024, 0.1873214992752235, 0.08458953520092605, 0.05880784163293852, 0.17730926452543247, 0.25138123724778944, 0.1304286545074799, 0.13446084465831518, -0.05795058173804798, -0.10114646695130929, -0.23267933975227856, -0.20367904755964197, -0.17336744509214028, -0.009357896085659212, -0.0652161847541786, -0.1885404877119105, 0.29431777732954784, 0.13605714850127698, 0.10473617428998379, 0.05830263115126978, 0.40059011624279345, 0.032193668664073236, 0.16571612317220902, 0.14801395785063506, 0.15289002706042745, -0.009357924023643136, 0.18018567976330152, -0.1208397800983353, 0.13370647836222568, -0.0051710311535068535] |
1,802.10376 | Push Forward: Global Fixed-Priority Scheduling of Arbitrary-Deadline
Sporadic Task Systems | The sporadic task model is often used to analyze recurrent execution of
identical tasks in real-time systems. A sporadic task defines an infinite
sequence of task instances, also called jobs, that arrive under the minimum
inter-arrival time constraint. To ensure the system safety, timeliness has to
be guaranteed in addition to functional correctness, i.e., all jobs of all
tasks have to be finished before the job deadlines. We focus on analyzing
arbitrary-deadline task sets on a homogeneous (identical) multiprocessor system
under any given global fixed-priority scheduling approach and provide a series
of schedulability tests with different tradeoffs between their time complexity
and their accuracy. Under the arbitrary-deadline setting, the relative deadline
of a task can be longer than the minimum inter-arrival time of the jobs of the
task. We show that global deadline-monotonic (DM) scheduling has a speedup
bound of $3-1/M$ against any optimal scheduling algorithms, where $M$ is the
number of identical processors, and prove that this bound is asymptotically
tight.
| cs.OS cs.DC | the sporadic task model is often used to analyze recurrent execution of identical tasks in realtime systems a sporadic task defines an infinite sequence of task instances also called jobs that arrive under the minimum interarrival time constraint to ensure the system safety timeliness has to be guaranteed in addition to functional correctness ie all jobs of all tasks have to be finished before the job deadlines we focus on analyzing arbitrarydeadline task sets on a homogeneous identical multiprocessor system under any given global fixedpriority scheduling approach and provide a series of schedulability tests with different tradeoffs between their time complexity and their accuracy under the arbitrarydeadline setting the relative deadline of a task can be longer than the minimum interarrival time of the jobs of the task we show that global deadlinemonotonic dm scheduling has a speedup bound of 31m against any optimal scheduling algorithms where m is the number of identical processors and prove that this bound is asymptotically tight | [['the', 'sporadic', 'task', 'model', 'is', 'often', 'used', 'to', 'analyze', 'recurrent', 'execution', 'of', 'identical', 'tasks', 'in', 'realtime', 'systems', 'a', 'sporadic', 'task', 'defines', 'an', 'infinite', 'sequence', 'of', 'task', 'instances', 'also', 'called', 'jobs', 'that', 'arrive', 'under', 'the', 'minimum', 'interarrival', 'time', 'constraint', 'to', 'ensure', 'the', 'system', 'safety', 'timeliness', 'has', 'to', 'be', 'guaranteed', 'in', 'addition', 'to', 'functional', 'correctness', 'ie', 'all', 'jobs', 'of', 'all', 'tasks', 'have', 'to', 'be', 'finished', 'before', 'the', 'job', 'deadlines', 'we', 'focus', 'on', 'analyzing', 'arbitrarydeadline', 'task', 'sets', 'on', 'a', 'homogeneous', 'identical', 'multiprocessor', 'system', 'under', 'any', 'given', 'global', 'fixedpriority', 'scheduling', 'approach', 'and', 'provide', 'a', 'series', 'of', 'schedulability', 'tests', 'with', 'different', 'tradeoffs', 'between', 'their', 'time', 'complexity', 'and', 'their', 'accuracy', 'under', 'the', 'arbitrarydeadline', 'setting', 'the', 'relative', 'deadline', 'of', 'a', 'task', 'can', 'be', 'longer', 'than', 'the', 'minimum', 'interarrival', 'time', 'of', 'the', 'jobs', 'of', 'the', 'task', 'we', 'show', 'that', 'global', 'deadlinemonotonic', 'dm', 'scheduling', 'has', 'a', 'speedup', 'bound', 'of', '31m', 'against', 'any', 'optimal', 'scheduling', 'algorithms', 'where', 'm', 'is', 'the', 'number', 'of', 'identical', 'processors', 'and', 'prove', 'that', 'this', 'bound', 'is', 'asymptotically', 'tight']] | [-0.23233117208879742, 0.054648071189894724, -0.10130457239954369, 0.05818411895471281, -0.06571551966799065, -0.19878871069341805, 0.11408153816447333, 0.4113951111241296, -0.22379910677486325, -0.361662231897646, 0.1292314743203753, -0.21641908390505343, -0.08512362455717803, 0.19927245338001978, -0.13562922977035438, 0.14288486335325337, 0.13935718055010443, 0.11088325559492049, -0.03046774479664677, -0.37512777391705454, 0.23093201188220186, 0.04128545322343389, 0.2985275552220504, 0.03248417856040127, 0.08790445451766414, 0.004007959535912327, 0.03204550824933598, -0.02023698320693296, -0.07177341751885703, 0.039127778212730745, 0.28406585142398194, 0.21800121449668725, 0.31969149750859843, -0.4509280800865674, -0.11838964560294743, 0.17918874126402026, 0.11011248710709884, 0.01183790176158181, 0.040565995405491745, -0.24259232027421457, 0.14796830981287248, -0.1556698726338294, 0.005318868387583065, -0.050681983103385626, 0.041950939101693424, 0.030043292553482218, -0.28428255091565924, 0.013457941124034953, 0.04896210338321105, 0.03252531475856067, -0.08597467776954822, -0.05325916180855693, 0.03867685264381378, 0.16583543321441696, 0.08092615108500287, 0.018661004248196663, 0.12487072805058419, -0.09175410552488304, -0.1773751719004434, 0.43765395654145606, -0.0026734644115608912, -0.19465068629971757, 0.17567293201023654, -0.04639586006863887, -0.21017514224748435, 0.11015778970152648, 0.23056156076823495, 0.11083224715855874, -0.18670695139419125, 0.06254857521025486, -0.06123741054386826, 0.1980360293679911, 0.08291524491324928, 0.035620062470274126, 0.13241481942685773, 0.22553761714132306, 0.15237098726767884, 0.151323217546469, 0.011615993606175372, -0.08050401314734394, -0.24061349827090497, -0.14588947506312003, -0.19735089835988484, 0.006269447985596909, -0.11412696109953414, -0.125256201778741, 0.36143587716502246, 0.15009315818929986, 0.16164483696870183, 0.1961607309390924, 0.32027983467054105, 0.1131903881797139, 0.040930111554121566, 0.18999949011514947, 0.11959745401944256, -0.008018599130409938, 0.10555803061387739, -0.22832768449490393, 0.12232365862680425, 0.035268264919554135] |
1,802.10377 | Gravity-Induced Geometric Phases and Entanglement in Spinors and
Neutrinos: Gravitational Zeeman Effect | We show Zeeman-like splitting in the energy of spinors propagating in a
background gravitational field, analogous to the spinors in an electromagnetic
field, otherwise termed the Gravitational Zeeman Effect. These spinors are also
found to acquire a geometric phase, in a similar way as they do in the presence
of magnetic fields. However, in a gravitational background, the Aharonov-Bohm
type effect, in addition to Berry-like phase, arises. Based on this result, we
investigate geometric phases acquired by neutrinos propagating in a strong
gravitational field. We also explore entanglement of neutrino states due to
gravity, which could induce neutrino-antineutrino oscillation in the first
place. We show that entangled states also acquire geometric phases which are
determined by the relative strength between gravitational field and neutrino
masses.
| gr-qc astro-ph.HE quant-ph | we show zeemanlike splitting in the energy of spinors propagating in a background gravitational field analogous to the spinors in an electromagnetic field otherwise termed the gravitational zeeman effect these spinors are also found to acquire a geometric phase in a similar way as they do in the presence of magnetic fields however in a gravitational background the aharonovbohm type effect in addition to berrylike phase arises based on this result we investigate geometric phases acquired by neutrinos propagating in a strong gravitational field we also explore entanglement of neutrino states due to gravity which could induce neutrinoantineutrino oscillation in the first place we show that entangled states also acquire geometric phases which are determined by the relative strength between gravitational field and neutrino masses | [['we', 'show', 'zeemanlike', 'splitting', 'in', 'the', 'energy', 'of', 'spinors', 'propagating', 'in', 'a', 'background', 'gravitational', 'field', 'analogous', 'to', 'the', 'spinors', 'in', 'an', 'electromagnetic', 'field', 'otherwise', 'termed', 'the', 'gravitational', 'zeeman', 'effect', 'these', 'spinors', 'are', 'also', 'found', 'to', 'acquire', 'a', 'geometric', 'phase', 'in', 'a', 'similar', 'way', 'as', 'they', 'do', 'in', 'the', 'presence', 'of', 'magnetic', 'fields', 'however', 'in', 'a', 'gravitational', 'background', 'the', 'aharonovbohm', 'type', 'effect', 'in', 'addition', 'to', 'berrylike', 'phase', 'arises', 'based', 'on', 'this', 'result', 'we', 'investigate', 'geometric', 'phases', 'acquired', 'by', 'neutrinos', 'propagating', 'in', 'a', 'strong', 'gravitational', 'field', 'we', 'also', 'explore', 'entanglement', 'of', 'neutrino', 'states', 'due', 'to', 'gravity', 'which', 'could', 'induce', 'neutrinoantineutrino', 'oscillation', 'in', 'the', 'first', 'place', 'we', 'show', 'that', 'entangled', 'states', 'also', 'acquire', 'geometric', 'phases', 'which', 'are', 'determined', 'by', 'the', 'relative', 'strength', 'between', 'gravitational', 'field', 'and', 'neutrino', 'masses']] | [-0.20872138295322656, 0.25439423259079924, -0.08499514886364341, 0.13008972113858908, -0.08132121033966541, -0.06305757196620107, 0.003537589855492115, 0.35398311825096607, -0.23438380631804467, -0.3200504757016897, 0.0006241019992157817, -0.2008870452195406, -0.17227998304367065, 0.16455515429098158, -0.012891622558236122, -0.0601533412002027, -0.006428758908994496, 0.04373372543975711, -0.09631851996015757, -0.18466024904605002, 0.3586571329832077, 0.03464861008152366, 0.25419833765923977, 0.0396295974208042, 0.07676832716912031, -0.03259686097688973, -0.008671946130692958, 0.03121561399102211, -0.08192686108715133, 0.019089187988080084, 0.18745514291897417, 0.04454183961264789, 0.1584871103167534, -0.4662207183837891, -0.21300079187750817, 0.14801132545992732, 0.15138747449219228, 0.1953865117263049, -0.09546387202013285, -0.3690132340490818, -0.0037493272870779038, -0.14863323475420476, -0.12032527313381433, -0.07712720119580627, -0.0029117752313613894, -0.03891307940054685, -0.24232308408990502, 0.08025871715811081, 0.020824762205884327, 0.010032006710767746, -0.08448900577798486, -0.05873957050219178, -0.029684145737439393, 0.05982756809145212, 0.11003356146812439, 0.04852035569027066, 0.11367844174429774, -0.15811254870891572, -0.1160238264799118, 0.3824625956118107, -0.121485704254359, -0.18225561210210436, 0.15890548351593314, -0.19441401164629496, -0.10165063038468361, 0.13015996208041905, 0.18240150982141495, 0.0814572613351047, -0.13342323850095272, 0.07651007146341726, -0.006035845447331667, 0.13774818530678748, 0.09514795406162739, 0.10299431364703923, 0.3289013956785202, 0.060395614046603444, 0.0735239848382771, 0.12311321376636625, -0.11664329797960818, -0.039450831547379495, -0.32289374362304807, -0.15559838380664587, -0.14654177419841288, 0.0840197310167132, -0.03316710029612295, -0.1713572979308665, 0.3963286400400102, 0.1674050022419542, 0.15727189745008946, -0.05180141811445355, 0.261275387853384, 0.0962068055011332, 0.06170304869487882, 0.0452296725474298, 0.38798747164011, 0.19931111657246947, 0.10772725122608244, -0.26070110696554183, -0.04474766789749265, 0.05718846157193184] |
1,802.10378 | Observing of the super-Planckian near-field thermal radiation between
graphene sheets | Thermal radiation can be substantially enhanced in the near-field scenario
due to the tunneling of evanescent waves. The monolayer graphene could play a
vital role in this process owning to its strong infrared plasmonic response,
however, which still lacks an experimental verification due to the technical
challenges. Here, we manage to make a direct measurement about plasmon-mediated
thermal radiation between two macroscopic graphene sheets using a custom-made
setup. Super-Planckian radiation with efficiency 4.5 times larger than the
blackbody limit is observed at a 430-nm vacuum gap on insulating silicon
hosting substrates. The positive role of graphene plasmons is further confirmed
on conductive silicon substrates which have strong infrared loss and thermal
emittance. Based on these, a thermophotovoltaic cell made of the
graphene-silicon heterostructure is lastly discussed. The current work
validates the classic thermodynamical theory in treating graphene and also
paves a way to pursue the application of near-field thermal management.
| physics.optics physics.app-ph | thermal radiation can be substantially enhanced in the nearfield scenario due to the tunneling of evanescent waves the monolayer graphene could play a vital role in this process owning to its strong infrared plasmonic response however which still lacks an experimental verification due to the technical challenges here we manage to make a direct measurement about plasmonmediated thermal radiation between two macroscopic graphene sheets using a custommade setup superplanckian radiation with efficiency 45 times larger than the blackbody limit is observed at a 430nm vacuum gap on insulating silicon hosting substrates the positive role of graphene plasmons is further confirmed on conductive silicon substrates which have strong infrared loss and thermal emittance based on these a thermophotovoltaic cell made of the graphenesilicon heterostructure is lastly discussed the current work validates the classic thermodynamical theory in treating graphene and also paves a way to pursue the application of nearfield thermal management | [['thermal', 'radiation', 'can', 'be', 'substantially', 'enhanced', 'in', 'the', 'nearfield', 'scenario', 'due', 'to', 'the', 'tunneling', 'of', 'evanescent', 'waves', 'the', 'monolayer', 'graphene', 'could', 'play', 'a', 'vital', 'role', 'in', 'this', 'process', 'owning', 'to', 'its', 'strong', 'infrared', 'plasmonic', 'response', 'however', 'which', 'still', 'lacks', 'an', 'experimental', 'verification', 'due', 'to', 'the', 'technical', 'challenges', 'here', 'we', 'manage', 'to', 'make', 'a', 'direct', 'measurement', 'about', 'plasmonmediated', 'thermal', 'radiation', 'between', 'two', 'macroscopic', 'graphene', 'sheets', 'using', 'a', 'custommade', 'setup', 'superplanckian', 'radiation', 'with', 'efficiency', '45', 'times', 'larger', 'than', 'the', 'blackbody', 'limit', 'is', 'observed', 'at', 'a', '430nm', 'vacuum', 'gap', 'on', 'insulating', 'silicon', 'hosting', 'substrates', 'the', 'positive', 'role', 'of', 'graphene', 'plasmons', 'is', 'further', 'confirmed', 'on', 'conductive', 'silicon', 'substrates', 'which', 'have', 'strong', 'infrared', 'loss', 'and', 'thermal', 'emittance', 'based', 'on', 'these', 'a', 'thermophotovoltaic', 'cell', 'made', 'of', 'the', 'graphenesilicon', 'heterostructure', 'is', 'lastly', 'discussed', 'the', 'current', 'work', 'validates', 'the', 'classic', 'thermodynamical', 'theory', 'in', 'treating', 'graphene', 'and', 'also', 'paves', 'a', 'way', 'to', 'pursue', 'the', 'application', 'of', 'nearfield', 'thermal', 'management']] | [-0.12261798392981291, 0.13901136639537678, -0.054316895781084895, 0.004995722438385807, -0.055039010954399906, -0.14423416098890204, 0.07303369670097405, 0.42738140502323707, -0.21794762586243452, -0.3072456283122301, 0.019621146183926613, -0.29255186720130344, -0.13314703886086743, 0.24907236881786957, -0.040703730788081885, 0.04494661901262589, 0.014145166575132559, -0.12194052348223826, -0.0046989514088879025, -0.16323421465232968, 0.25629246085571744, 0.12868813360109926, 0.34535639758377024, 0.16169334593539436, 0.04391453941042225, -0.017888315928479035, 0.029934763517230747, -0.010767103129376968, -0.12117709677821646, 0.10263969475907894, 0.2379375179732839, -0.0782960993827631, 0.2624534759003048, -0.5163301185642679, -0.22064489563306172, 0.04024642275413498, 0.14640522247646004, 0.12385664075768242, -0.09510882308008149, -0.22471490379422904, 0.06051548546180129, -0.1372497449008127, -0.125115317273885, -0.030308604519814254, -0.041952023751412826, -0.06398591362638399, -0.21539381354678577, 0.046725128902859674, 0.03444213887055715, 0.03435903153692683, -0.05592882073717192, -0.09173929234345754, -0.05244987099741896, 0.05392445943939189, 0.033346326414612125, 0.01321402243260915, 0.2555924265800665, -0.13682620213987925, -0.09357824340462685, 0.38740556870276727, -0.06105639440211234, -0.10775320601028701, 0.194076598387522, -0.14814011742360889, -0.014629839863628149, 0.1484271274258693, 0.11096705994879207, 0.09115137559361756, -0.17681295734674982, 0.04845435572710509, 0.016355447879371543, 0.17900616744222742, 0.11716418400717278, 0.1404370296249787, 0.3116074081844029, 0.25008282574514545, 0.028983987147609393, 0.1579617566099235, -0.0954091911848324, -0.00726523634356757, -0.22776417273387778, -0.19438835043460131, -0.18302033356701333, 0.11897162870678585, -0.07153154453767153, -0.20021884093681971, 0.3539786150927345, 0.18487918951238194, 0.11490941563000281, -0.03598058368700246, 0.35327137892755367, 0.10086040878435597, 0.09124527647159994, -0.008067994673425952, 0.33330186042701826, 0.14472153990839917, 0.14803819560445844, -0.26429637423561264, 0.037571710807581746, -0.04571284002314011] |
1,802.10379 | Tunable sub-gap radiation detection with superconducting resonators | We have fabricated planar amorphous Indium Oxide superconducting resonators
($T_c\sim2.8$ K) that are sensitive to frequency-selective radiation in the
range of 7 to 10 GHz. Those values lay far below twice the superconducting gap
that worths about 200 GHz. The photons detection consists in a shift of the
fundamental resonance frequency. We show that the detected frequency can be
adjusted by modulating the total length of the superconducting resonator. We
attribute those observations to the excitation of higher-order resonance modes.
The coupling between the fundamental lumped and the higher order distributed
resonance is due to the kinetic inductance non-linearity with current. These
devices, that we have called Sub-gap Kinetic Inductance Detectors (SKIDs), are
to be distinguished from the standard Kinetic Inductance Detectors (KIDs) in
which quasi-particles are generated when incident light breaks down Cooper
pairs.
| cond-mat.supr-con astro-ph.IM physics.app-ph | we have fabricated planar amorphous indium oxide superconducting resonators t_csim28 k that are sensitive to frequencyselective radiation in the range of 7 to 10 ghz those values lay far below twice the superconducting gap that worths about 200 ghz the photons detection consists in a shift of the fundamental resonance frequency we show that the detected frequency can be adjusted by modulating the total length of the superconducting resonator we attribute those observations to the excitation of higherorder resonance modes the coupling between the fundamental lumped and the higher order distributed resonance is due to the kinetic inductance nonlinearity with current these devices that we have called subgap kinetic inductance detectors skids are to be distinguished from the standard kinetic inductance detectors kids in which quasiparticles are generated when incident light breaks down cooper pairs | [['we', 'have', 'fabricated', 'planar', 'amorphous', 'indium', 'oxide', 'superconducting', 'resonators', 't_csim28', 'k', 'that', 'are', 'sensitive', 'to', 'frequencyselective', 'radiation', 'in', 'the', 'range', 'of', '7', 'to', '10', 'ghz', 'those', 'values', 'lay', 'far', 'below', 'twice', 'the', 'superconducting', 'gap', 'that', 'worths', 'about', '200', 'ghz', 'the', 'photons', 'detection', 'consists', 'in', 'a', 'shift', 'of', 'the', 'fundamental', 'resonance', 'frequency', 'we', 'show', 'that', 'the', 'detected', 'frequency', 'can', 'be', 'adjusted', 'by', 'modulating', 'the', 'total', 'length', 'of', 'the', 'superconducting', 'resonator', 'we', 'attribute', 'those', 'observations', 'to', 'the', 'excitation', 'of', 'higherorder', 'resonance', 'modes', 'the', 'coupling', 'between', 'the', 'fundamental', 'lumped', 'and', 'the', 'higher', 'order', 'distributed', 'resonance', 'is', 'due', 'to', 'the', 'kinetic', 'inductance', 'nonlinearity', 'with', 'current', 'these', 'devices', 'that', 'we', 'have', 'called', 'subgap', 'kinetic', 'inductance', 'detectors', 'skids', 'are', 'to', 'be', 'distinguished', 'from', 'the', 'standard', 'kinetic', 'inductance', 'detectors', 'kids', 'in', 'which', 'quasiparticles', 'are', 'generated', 'when', 'incident', 'light', 'breaks', 'down', 'cooper', 'pairs']] | [-0.18199589138472438, 0.2504316404176512, 0.027215167039767243, -0.00232270933491619, -0.08813185876417429, -0.15230177654149502, 0.01611358471936021, 0.4106756605319959, -0.20129734680364678, -0.3502104758999233, -0.007690553650561076, -0.35601501783033956, -0.03621750102987639, 0.2080860253234387, 0.034049753431419846, 0.021110259785244233, 0.005835580882875431, -0.03311184489805447, -0.04446104572231608, -0.15424723773091836, 0.2715784538466364, 0.04770756277248712, 0.3209319744763294, 0.0606723034236216, 0.09072568380322896, -0.09124224843401321, 0.09211927335849382, -0.028075179624322214, -0.1328721503454481, 0.06715159752945367, 0.31840126209409164, -0.01938213834441022, 0.23239253305206845, -0.4321479112245983, -0.1999547669131841, 0.07492304992462907, 0.12876529579183885, 0.09300170364331006, 0.01850676424871374, -0.27056786472229916, 0.09330209260333777, -0.135646852195487, -0.06814644065730649, -0.007274714295045102, -0.04077731455585226, 0.027052495775646286, -0.22204408255104618, 0.056507178638270476, 0.04503538206226675, 0.04012284924003078, -0.001141963776615028, -0.12005222229553121, -0.03812191901987601, 0.021922032796310373, -0.022701053181663156, 0.0033819082952839764, 0.21914202740233868, -0.09427920586772655, -0.07332873059247613, 0.2846477889819981, -0.08852622183424917, -0.10682363194042355, 0.14789326852922768, -0.17503222222334908, -0.011004850087176197, 0.20949763369648472, 0.11958777425544602, 0.04279617164844185, -0.1575731980246518, 0.018620517461550162, 0.044096598513704496, 0.24266309197291844, 0.1476042469791872, 0.13881405795525228, 0.2549358093095733, 0.1693297247231686, 0.03442054471225107, 0.14105174180795962, -0.14739636423440888, 6.765550828741906e-05, -0.28063722531822394, -0.11506582590877394, -0.21055440494048416, 0.06842989804524284, -0.04132727383365907, -0.1292803433495731, 0.4034312503496395, 0.1967693599557182, 0.17550643911424155, -0.028384935397031557, 0.3022196058374725, 0.170032579955974, 0.1724485704260423, 0.0169181248936382, 0.3436859325834907, 0.18301033079834247, 0.10472031343812332, -0.2631373717537136, -0.026523012629381025, -0.046423290243470354] |
1,802.1038 | Note on the dynamical evolution of C/2017 K2 PANSTARRS | (Abreviated) Comet C/2017 K2 PANSTARRS drew attention to its activity already
at a time of its discovery in May 2017 when it was about 16 au from the Sun.
This Oort spike comet will approach its perihelion in December 2022, and the
question about its dynamical past is one of the important issues to explore. To
this aim it is necessary to obtain its precise osculating orbit, its original
orbit, and propagate its motion backwards in time to the previous perihelion.
We study a dynamical evolution of C/2017 K2 to the previous perihelion
(backward calculations for about 3-4 Myr) as well as to the future (forward
calculations for about 0.033 Myr). Outside the planetary system both Galactic
and stellar perturbations were taken into account. We derived that C/2017 K2 is
a dynamically old Oort spike comet (1/a$_{prev}$ = (48.7 $\pm$ 7,9) x10$^{-6}$
au$^{-1}$) with the previous perihelion distance below 10 au for 97 per cent of
VCs (nominal q$_{prev}$ = 3.77 au). It means that C/2017 K2 has already visited
our planetary zone during its previous perihelion passage. Thus, it is almost
certainly a dynamically old Oort spike comet.
| astro-ph.EP | abreviated comet c2017 k2 panstarrs drew attention to its activity already at a time of its discovery in may 2017 when it was about 16 au from the sun this oort spike comet will approach its perihelion in december 2022 and the question about its dynamical past is one of the important issues to explore to this aim it is necessary to obtain its precise osculating orbit its original orbit and propagate its motion backwards in time to the previous perihelion we study a dynamical evolution of c2017 k2 to the previous perihelion backward calculations for about 34 myr as well as to the future forward calculations for about 0033 myr outside the planetary system both galactic and stellar perturbations were taken into account we derived that c2017 k2 is a dynamically old oort spike comet 1a_prev 487 pm 79 x106 au1 with the previous perihelion distance below 10 au for 97 per cent of vcs nominal q_prev 377 au it means that c2017 k2 has already visited our planetary zone during its previous perihelion passage thus it is almost certainly a dynamically old oort spike comet | [['abreviated', 'comet', 'c2017', 'k2', 'panstarrs', 'drew', 'attention', 'to', 'its', 'activity', 'already', 'at', 'a', 'time', 'of', 'its', 'discovery', 'in', 'may', '2017', 'when', 'it', 'was', 'about', '16', 'au', 'from', 'the', 'sun', 'this', 'oort', 'spike', 'comet', 'will', 'approach', 'its', 'perihelion', 'in', 'december', '2022', 'and', 'the', 'question', 'about', 'its', 'dynamical', 'past', 'is', 'one', 'of', 'the', 'important', 'issues', 'to', 'explore', 'to', 'this', 'aim', 'it', 'is', 'necessary', 'to', 'obtain', 'its', 'precise', 'osculating', 'orbit', 'its', 'original', 'orbit', 'and', 'propagate', 'its', 'motion', 'backwards', 'in', 'time', 'to', 'the', 'previous', 'perihelion', 'we', 'study', 'a', 'dynamical', 'evolution', 'of', 'c2017', 'k2', 'to', 'the', 'previous', 'perihelion', 'backward', 'calculations', 'for', 'about', '34', 'myr', 'as', 'well', 'as', 'to', 'the', 'future', 'forward', 'calculations', 'for', 'about', '0033', 'myr', 'outside', 'the', 'planetary', 'system', 'both', 'galactic', 'and', 'stellar', 'perturbations', 'were', 'taken', 'into', 'account', 'we', 'derived', 'that', 'c2017', 'k2', 'is', 'a', 'dynamically', 'old', 'oort', 'spike', 'comet', '1a_prev', '487', 'pm', '79', 'x106', 'au1', 'with', 'the', 'previous', 'perihelion', 'distance', 'below', '10', 'au', 'for', '97', 'per', 'cent', 'of', 'vcs', 'nominal', 'q_prev', '377', 'au', 'it', 'means', 'that', 'c2017', 'k2', 'has', 'already', 'visited', 'our', 'planetary', 'zone', 'during', 'its', 'previous', 'perihelion', 'passage', 'thus', 'it', 'is', 'almost', 'certainly', 'a', 'dynamically', 'old', 'oort', 'spike', 'comet']] | [-0.08378177684105656, 0.128964533248438, -0.11613805712856717, 0.06566404034887012, -0.08526810966935512, -0.07903894735626071, 0.0993529264223636, 0.3546190079578475, -0.2418641427204617, -0.35654376851193403, 0.13310642344184925, -0.3069593515058325, -0.09049180176209759, 0.1835806714295334, -0.132436086992557, 0.038872778901477924, 0.11952558007418505, 0.05605389994216731, -0.004486738721764571, -0.3205748451370242, 0.15650095511479556, 0.12566578414643537, 0.024253288862874377, -0.019113467286366065, 0.053043085086549556, -0.005078902985346881, -0.0024661130246681137, -0.1400195693295147, -0.17670894180624305, 0.07079931917927555, 0.19146005595865898, 0.15217348505149758, 0.2477797348077434, -0.3660478831445043, -0.1947370510195961, 0.0153462587862049, 0.141876454515433, 0.09094348376415469, 0.022677693299546435, -0.33425077189867564, 0.11236682175878888, -0.20218855012082368, -0.22361576730209226, 0.05094921622925589, 0.18853932104853763, -0.058536298123716905, -0.16708017199526767, 0.0851674912434474, 0.07468217963359092, 0.12289611965699461, -0.14406276498291942, -0.14802518463504777, -0.0525382075458765, 0.1318655377777759, 0.09049668096610018, 0.12245853636791376, 0.16479847281793686, 0.00430290702780759, -0.03541028683161917, 0.4088405570971805, -0.05785548722723852, 0.02850644207288939, 0.19646616635617573, -0.24064390198453456, -0.14891320372604439, 0.16893099075485324, 0.15722771367007815, 0.11736158933238806, -0.1676481789623771, 0.02336151843947182, -0.01605344548871791, 0.20616849076688742, 0.14577125772028357, -0.01507103935676954, 0.25818523539205057, 0.13453657427972585, 0.038259902621644575, 0.03814269440953393, -0.22342685200022283, -0.09337820613731605, -0.20312132077492975, -0.09669023988220991, -0.11759354503372231, 0.09470532212683276, -0.11128245966951048, -0.022774509169362685, 0.32978843336773883, 0.15394124402979237, 0.20939924265887286, 0.0413051621178228, 0.27742313298623306, 0.02534608825021801, 0.07536673542911287, 0.14134713557322284, 0.3621604119301648, 0.12835988908049625, 0.14669354859789885, -0.17392611348611378, 0.095229378125215, 0.03470519483089447] |
1,802.10381 | Complex Langevin Dynamics in Large $N$ Unitary Matrix Models | Using complex Langevin dynamics we examine the phase structure of complex
unitary matrix models and compare the numerical results with analytic results
found at large $N$. The actions we consider are manifestly complex, and thus
the dominant contribution to the path integral comes from the space of
complexified gauge field configuration. For this reason, the eigenvalues of
unitary matrix lie off the unit circle and venture out in the complex plane.
One example of a complex unitary matrix model, with Polyakov line as the
unitary matrix, is an effective description of a QCD at finite density and
temperature with $N$ number of colors and $N_f$ number of quark flavors defined
on the manifold $S^1 \times S^3$. A distinct feature of this model, the
occurrence of a series of Gross-Witten-Wadia transitions, as a function of the
quark chemical potential, is reproduced using complex Langevin simulations. We
simulate several other observables including Polyakov lines and quark number
density, for large $N$ and $N_f$ and found excellent match with the analytic
results.
| hep-th hep-lat | using complex langevin dynamics we examine the phase structure of complex unitary matrix models and compare the numerical results with analytic results found at large n the actions we consider are manifestly complex and thus the dominant contribution to the path integral comes from the space of complexified gauge field configuration for this reason the eigenvalues of unitary matrix lie off the unit circle and venture out in the complex plane one example of a complex unitary matrix model with polyakov line as the unitary matrix is an effective description of a qcd at finite density and temperature with n number of colors and n_f number of quark flavors defined on the manifold s1 times s3 a distinct feature of this model the occurrence of a series of grosswittenwadia transitions as a function of the quark chemical potential is reproduced using complex langevin simulations we simulate several other observables including polyakov lines and quark number density for large n and n_f and found excellent match with the analytic results | [['using', 'complex', 'langevin', 'dynamics', 'we', 'examine', 'the', 'phase', 'structure', 'of', 'complex', 'unitary', 'matrix', 'models', 'and', 'compare', 'the', 'numerical', 'results', 'with', 'analytic', 'results', 'found', 'at', 'large', 'n', 'the', 'actions', 'we', 'consider', 'are', 'manifestly', 'complex', 'and', 'thus', 'the', 'dominant', 'contribution', 'to', 'the', 'path', 'integral', 'comes', 'from', 'the', 'space', 'of', 'complexified', 'gauge', 'field', 'configuration', 'for', 'this', 'reason', 'the', 'eigenvalues', 'of', 'unitary', 'matrix', 'lie', 'off', 'the', 'unit', 'circle', 'and', 'venture', 'out', 'in', 'the', 'complex', 'plane', 'one', 'example', 'of', 'a', 'complex', 'unitary', 'matrix', 'model', 'with', 'polyakov', 'line', 'as', 'the', 'unitary', 'matrix', 'is', 'an', 'effective', 'description', 'of', 'a', 'qcd', 'at', 'finite', 'density', 'and', 'temperature', 'with', 'n', 'number', 'of', 'colors', 'and', 'n_f', 'number', 'of', 'quark', 'flavors', 'defined', 'on', 'the', 'manifold', 's1', 'times', 's3', 'a', 'distinct', 'feature', 'of', 'this', 'model', 'the', 'occurrence', 'of', 'a', 'series', 'of', 'grosswittenwadia', 'transitions', 'as', 'a', 'function', 'of', 'the', 'quark', 'chemical', 'potential', 'is', 'reproduced', 'using', 'complex', 'langevin', 'simulations', 'we', 'simulate', 'several', 'other', 'observables', 'including', 'polyakov', 'lines', 'and', 'quark', 'number', 'density', 'for', 'large', 'n', 'and', 'n_f', 'and', 'found', 'excellent', 'match', 'with', 'the', 'analytic', 'results']] | [-0.13039006242671838, 0.1686185562450848, -0.07357496042465846, 0.052974495028294405, -0.02326755205268514, -0.10650644608712673, 0.036529130469070824, 0.37368071105705913, -0.17374183077188815, -0.2713356499598753, 0.05758128388159352, -0.28697884932006074, -0.14550907080221545, 0.12753558108450833, 0.028765443158639076, 0.057402749650577116, 0.04093133647975749, 0.07065635023792909, -0.10916191765063128, -0.21567349461425295, 0.3421640437641925, -0.009862927350728117, 0.20533566926220245, 0.05315024429138684, 0.09669367301129025, 0.009463513896872219, -0.05058987362078837, -0.015412345597659617, -0.07251942870840872, 0.07102325855693697, 0.22688099432085415, 0.04991938561454592, 0.15294244845904761, -0.42291398763039406, -0.2103973036127705, 0.12260161354564704, 0.13434637838577818, 0.06965097605344459, 0.0006785547578001785, -0.27148507292983093, 0.047485688327916366, -0.16270960672736476, -0.21019311668695717, -0.10316477304313486, 0.03384055397900362, -0.017794443665006193, -0.28307101352191283, 0.03928372628636212, -0.030160777830138537, 0.07435222199329963, -0.006725348317279265, -0.15371728098703985, -0.039282756201790635, 0.11727018056495236, 0.03658578265802769, 0.07023217679502872, 0.14757398995102422, -0.15738045452052407, -0.08773131065412297, 0.40909546642349315, -0.07557969268675915, -0.18769672226998405, 0.1660967248880453, -0.16704898978825988, -0.13585869943690018, 0.13560594725229683, 0.13291280611126116, 0.11666322573082599, -0.0998193062680013, 0.15252722203648875, -0.07380892907010292, 0.13982873360802744, 0.02857180656148837, -0.008988509279780487, 0.20350236430635557, 0.13606406966521895, 0.019546739591737472, 0.0910939210178551, -0.03137684995776935, -0.16553342159556433, -0.33553708074669514, -0.136291963643444, -0.18373587601694152, 0.0985065765069941, -0.176575302691254, -0.17020606895297016, 0.4058857442089219, 0.09686089534940716, 0.26320174923331957, 0.07392189963638077, 0.2551145178414661, 0.1291701729838549, 0.038599293629401885, 0.05360457257329095, 0.1300921942377408, 0.20702951698090066, 0.05738525217972123, -0.27531448748932613, -0.08105912929422845, 0.11833395807833008] |
1,802.10382 | Effect of exchange-correlation spin-torque on spin dynamics | A recently proposed exchange-correlation functional (Dewhurst et al.
10.1021/acs.jctc.7b01049) with in density functional theory, which ensures that
the exchange-correlation magnetic field is source-free, is shown to give
non-zero internal spin-torque. This spin-torque is identically zero for all
conventional local and semi-local functionals. Extension of this source-free
functional to the time domain is used to study the effect of the internal
spin-torque on the laser induced spin-dynamics in bulk Co, Ni and interfaces of
these metals with Pt. It is shown that the internal spin-torque contribute
significantly to spin-dynamics only when the magneto crystalline anisotropy
energy is small, as in the case of cubic bulk materials. For surfaces or
interfaces, where the anisotropy energy is large, these torques are too small
to cause any significant precession of spins in early times ($<$ 100fs).
Further more it is shown that the spin-dynamics caused by the internal
spin-torque is slow compared to the inter-site spin transfer and spin-orbit
mediated spin-flips.
| cond-mat.mtrl-sci | a recently proposed exchangecorrelation functional dewhurst et al 101021acsjctc7b01049 with in density functional theory which ensures that the exchangecorrelation magnetic field is sourcefree is shown to give nonzero internal spintorque this spintorque is identically zero for all conventional local and semilocal functionals extension of this sourcefree functional to the time domain is used to study the effect of the internal spintorque on the laser induced spindynamics in bulk co ni and interfaces of these metals with pt it is shown that the internal spintorque contribute significantly to spindynamics only when the magneto crystalline anisotropy energy is small as in the case of cubic bulk materials for surfaces or interfaces where the anisotropy energy is large these torques are too small to cause any significant precession of spins in early times 100fs further more it is shown that the spindynamics caused by the internal spintorque is slow compared to the intersite spin transfer and spinorbit mediated spinflips | [['a', 'recently', 'proposed', 'exchangecorrelation', 'functional', 'dewhurst', 'et', 'al', '101021acsjctc7b01049', 'with', 'in', 'density', 'functional', 'theory', 'which', 'ensures', 'that', 'the', 'exchangecorrelation', 'magnetic', 'field', 'is', 'sourcefree', 'is', 'shown', 'to', 'give', 'nonzero', 'internal', 'spintorque', 'this', 'spintorque', 'is', 'identically', 'zero', 'for', 'all', 'conventional', 'local', 'and', 'semilocal', 'functionals', 'extension', 'of', 'this', 'sourcefree', 'functional', 'to', 'the', 'time', 'domain', 'is', 'used', 'to', 'study', 'the', 'effect', 'of', 'the', 'internal', 'spintorque', 'on', 'the', 'laser', 'induced', 'spindynamics', 'in', 'bulk', 'co', 'ni', 'and', 'interfaces', 'of', 'these', 'metals', 'with', 'pt', 'it', 'is', 'shown', 'that', 'the', 'internal', 'spintorque', 'contribute', 'significantly', 'to', 'spindynamics', 'only', 'when', 'the', 'magneto', 'crystalline', 'anisotropy', 'energy', 'is', 'small', 'as', 'in', 'the', 'case', 'of', 'cubic', 'bulk', 'materials', 'for', 'surfaces', 'or', 'interfaces', 'where', 'the', 'anisotropy', 'energy', 'is', 'large', 'these', 'torques', 'are', 'too', 'small', 'to', 'cause', 'any', 'significant', 'precession', 'of', 'spins', 'in', 'early', 'times', '100fs', 'further', 'more', 'it', 'is', 'shown', 'that', 'the', 'spindynamics', 'caused', 'by', 'the', 'internal', 'spintorque', 'is', 'slow', 'compared', 'to', 'the', 'intersite', 'spin', 'transfer', 'and', 'spinorbit', 'mediated', 'spinflips']] | [-0.18360179617801414, 0.19031453177986013, -0.03190860779980173, 0.03621135559764558, -0.07642302299885974, -0.10734915890876058, -0.015082622005138546, 0.37043776008748003, -0.25829174428839574, -0.3162929088409458, -0.020778225544332105, -0.27359760430484237, -0.14532560667676198, 0.1946321436031661, 0.0016555512798708174, -0.005209293948220355, -0.01396379267718256, -0.019051157645639274, -0.02862506314345587, -0.23799730402526337, 0.26688697706753395, 0.05922918008071939, 0.3053787321958981, 0.08063612743159877, 0.05515699521048817, -0.0190861374109548, 0.09230073076043907, 0.03323961401436865, -0.10640839047879457, 0.06213864636329281, 0.24574242218990217, -0.08568463211141333, 0.22038220322703, -0.5217877193716923, -0.234256852931848, 0.06516722906320416, 0.0827644172051994, 0.1866628263446551, -0.037568539222751524, -0.24988773405210224, 0.10675585912706863, -0.16391547323906092, -0.08813399140414625, -0.12626166933128466, 0.046497125309353765, 0.04323417592231281, -0.27953076859718406, 0.10199016827315867, 0.11701379448489903, 0.04665409758771685, -0.08737592326549741, -0.10949615103664337, -0.11089273423029038, 0.017089984374606147, 0.09286759402179583, 0.10189955312510734, 0.1639611618865475, -0.09951750183018385, -0.08026203119147618, 0.3396610309998807, -0.06589009836860388, -0.18343763127348495, 0.20245261418379165, -0.16604502569557494, -0.051934689068682975, 0.13135179348120635, 0.10153393082127168, 0.11444048597114523, -0.1573744258324974, 0.12909516716238364, 0.07398992791006874, 0.16798664480387293, 0.045168811174157955, 0.044859672482306885, 0.20966582997496447, 0.1483041833853349, 0.07319496613424482, 0.09841133005517934, -0.09782682931316751, -0.08032568097726878, -0.22896347804956574, -0.15306062851321894, -0.2499035135185189, 0.09472453157877089, -0.06881958643526713, -0.1787457415222133, 0.36478652990144955, 0.14063088005928734, 0.13089844100358713, -0.0608371110722217, 0.2929104389078528, 0.14051488071435142, 0.11759477833818112, 0.0576271564342904, 0.2707534866481596, 0.18324451335530437, 0.10602095648464928, -0.30115278617950614, 0.07445467325749916, 0.013828480191371562] |
1,802.10383 | Using surface lattice resonances to engineer nonlinear optical processes
in metal nanoparticle arrays | Collective responses of localized surface plasmon resonances, known as
surface lattice resonances (SLRs) in metal nanoparticle arrays, can lead to
high quality factors (~100), large local-field enhancements and strong
light-matter interactions. SLRs have found many applications in linear optics,
but little work of the influence of SLRs on nonlinear optics has been reported.
Here we show how SLRs could be utilized to enhance nonlinear optical
interactions. We devote special attention to the sum-frequency,
difference-frequency, and third-harmonic generation processes because of their
potential for the realization of novel sources of light. We also demonstrate
how such arrays could be engineered to enhance higher-order nonlinear optical
interactions through cascaded nonlinear processes. In particular, we
demonstrate how the efficiency of third-harmonic generation could be engineered
via cascaded second-order responses.
| physics.optics | collective responses of localized surface plasmon resonances known as surface lattice resonances slrs in metal nanoparticle arrays can lead to high quality factors 100 large localfield enhancements and strong lightmatter interactions slrs have found many applications in linear optics but little work of the influence of slrs on nonlinear optics has been reported here we show how slrs could be utilized to enhance nonlinear optical interactions we devote special attention to the sumfrequency differencefrequency and thirdharmonic generation processes because of their potential for the realization of novel sources of light we also demonstrate how such arrays could be engineered to enhance higherorder nonlinear optical interactions through cascaded nonlinear processes in particular we demonstrate how the efficiency of thirdharmonic generation could be engineered via cascaded secondorder responses | [['collective', 'responses', 'of', 'localized', 'surface', 'plasmon', 'resonances', 'known', 'as', 'surface', 'lattice', 'resonances', 'slrs', 'in', 'metal', 'nanoparticle', 'arrays', 'can', 'lead', 'to', 'high', 'quality', 'factors', '100', 'large', 'localfield', 'enhancements', 'and', 'strong', 'lightmatter', 'interactions', 'slrs', 'have', 'found', 'many', 'applications', 'in', 'linear', 'optics', 'but', 'little', 'work', 'of', 'the', 'influence', 'of', 'slrs', 'on', 'nonlinear', 'optics', 'has', 'been', 'reported', 'here', 'we', 'show', 'how', 'slrs', 'could', 'be', 'utilized', 'to', 'enhance', 'nonlinear', 'optical', 'interactions', 'we', 'devote', 'special', 'attention', 'to', 'the', 'sumfrequency', 'differencefrequency', 'and', 'thirdharmonic', 'generation', 'processes', 'because', 'of', 'their', 'potential', 'for', 'the', 'realization', 'of', 'novel', 'sources', 'of', 'light', 'we', 'also', 'demonstrate', 'how', 'such', 'arrays', 'could', 'be', 'engineered', 'to', 'enhance', 'higherorder', 'nonlinear', 'optical', 'interactions', 'through', 'cascaded', 'nonlinear', 'processes', 'in', 'particular', 'we', 'demonstrate', 'how', 'the', 'efficiency', 'of', 'thirdharmonic', 'generation', 'could', 'be', 'engineered', 'via', 'cascaded', 'secondorder', 'responses']] | [-0.1038374821914153, 0.19733090070076287, -0.0106335157738252, 0.0608661984969374, -0.09968799652369131, -0.12702063688387474, 0.005155320386476223, 0.46959486201642053, -0.28125385309953893, -0.2882849270559197, 0.03397946289439301, -0.2805210844232952, -0.24992005171490803, 0.2437216110290989, -0.017198000531939286, 0.08652768450667195, 0.03524661058327183, -0.08680276994756053, 0.0134069392825329, -0.19666238131541167, 0.24333100444045924, 0.06764440038537103, 0.3082062452698925, 0.1397851724325428, 0.055953454743656844, -0.022974878630881743, 0.031156856614711976, -0.045639413617743506, -0.06805451861065295, 0.13708165808329506, 0.2808240774043259, 0.020702525568638174, 0.27169740904447814, -0.49416084676271393, -0.26071134070673635, 0.07481058276099493, 0.21697526418286125, 0.1746505828840392, -0.11318758162318744, -0.27450864425756866, 0.010758103961716331, -0.1481962684054105, -0.11760826336426868, -0.11965002614398679, -0.042104140822110434, 0.07001381911086066, -0.2510631385976301, 0.014319668895156595, 0.06876398717600202, 0.03910367219664511, 0.0028425491551706005, -0.06996141065148608, -0.023433654413868982, 0.08403899541701235, -0.033569460775377966, -0.068551842163923, 0.17698540241690353, -0.15895883716820253, -0.15931119397652174, 0.420844342855234, -0.13755786969577746, -0.16660427668737987, 0.20875462540794934, -0.16722384559374953, -0.06709949833910084, 0.1494541694308513, 0.32986151805934716, 0.1093217716995804, -0.14355600919225253, 0.009423507938331495, 0.05257237410645873, 0.2083577423241906, 0.09510069640560283, 0.19565305093465934, 0.24316633240659796, 0.19718113287152456, -0.04012606375608667, 0.15945207853967855, -0.07221878304271885, -0.007846994643350915, -0.19368136691350846, -0.1162688793865816, -0.1340438871836615, 0.045401316749612015, -0.041385642211978504, -0.12279007412605948, 0.3944826604731913, 0.15622480598367042, 0.11867236951366067, -0.0693328904897152, 0.2507515611008756, 0.15829743520219972, 0.14549290852081623, -0.06910477857297612, 0.3674869981764387, 0.1321358306717778, 0.08454707773431899, -0.2714544935775588, 0.02965296088581136, -0.024282146053063492] |
1,802.10384 | Existence and Behavior Results For a Nonlocal Nonlinear Parabolic
Equation With Variable Exponent | In this paper, we study the solvability of a Cauchy- Dirichlet problem for
nonlinear parabolic equation with non standard growths and nonlocal terms. We
show the existence of weak solutions of the considered problem under more
general conditions. In addition, we obtain some results on the behavior of the
solution when the problem is homogeneous.
| math.AP | in this paper we study the solvability of a cauchy dirichlet problem for nonlinear parabolic equation with non standard growths and nonlocal terms we show the existence of weak solutions of the considered problem under more general conditions in addition we obtain some results on the behavior of the solution when the problem is homogeneous | [['in', 'this', 'paper', 'we', 'study', 'the', 'solvability', 'of', 'a', 'cauchy', 'dirichlet', 'problem', 'for', 'nonlinear', 'parabolic', 'equation', 'with', 'non', 'standard', 'growths', 'and', 'nonlocal', 'terms', 'we', 'show', 'the', 'existence', 'of', 'weak', 'solutions', 'of', 'the', 'considered', 'problem', 'under', 'more', 'general', 'conditions', 'in', 'addition', 'we', 'obtain', 'some', 'results', 'on', 'the', 'behavior', 'of', 'the', 'solution', 'when', 'the', 'problem', 'is', 'homogeneous']] | [-0.1372138059338216, -0.005557160964235664, -0.051681370457465, 0.055794393021444025, -0.0803698500745337, -0.08622272474352609, -0.04075861493421888, 0.28653742139312355, -0.3077775516293266, -0.20408892369067128, 0.16798784491098062, -0.28356652710248126, -0.18377902948043562, 0.20435068818147886, -0.055317857607521795, 0.09897740414704789, 0.10042711853642355, 0.05780596944757483, -0.10267558655786244, -0.26028704731301827, 0.4300746081227606, -0.05175432822222568, 0.2503371748734604, 0.07181802068053829, 0.07999984545802528, -0.004012430476194078, 0.031820567172359336, 0.06150623675097119, -0.20622310555878687, 0.10044693751472303, 0.21664004535837608, 0.04983771231702783, 0.3282412062314424, -0.4408327367156744, -0.1990049836141142, 0.16138452901081604, 0.0818476348776709, 0.11409247003241696, -0.06640706808988894, -0.27793590653349054, 0.14909579676829957, -0.08287842001088641, -0.2017454404045235, -0.025704711861908435, -0.04281483119861646, 0.03694449379743839, -0.3143795189193704, 0.14883468127386137, 0.1127239846878431, 0.021464100327681413, -0.20871341590854256, -0.03728331405119124, 0.07871052489869974, 0.044667969430817966, 0.09675780316730115, -0.0731272234539078, -0.04004393576390364, -0.18387813100337305, -0.057527806846932934, 0.40695520768111404, -0.10450531377203086, -0.3152726370163939, 0.16383513207124037, -0.13410497539761393, -0.12619151784615082, 0.041569229621778836, 0.17169756526974114, 0.20488033754412424, -0.17317332967147442, 0.14992127801974262, -0.12623207493769853, 0.10693955001505938, 0.07993965209885077, 0.006363767331508411, 0.0754918222738938, 0.16416117853315718, 0.1616489762948318, 0.21021480802869932, 0.005142426130954515, -0.11195282905616544, -0.3613277019424872, -0.15573079411617735, -0.08260291584513405, 0.08783089330589229, -0.08835857825496615, -0.21732268997214058, 0.41905636557123876, 0.1347313711589033, 0.1549578353085301, 0.09857317715544592, 0.20253496268256144, 0.21743190554393962, -0.060171643509106205, 0.06635812674807808, 0.20926133737401953, 0.1311939445874569, 0.13496622161685742, -0.24207434761337937, 0.05432807300874794, 0.1020691812207753] |
1,802.10385 | Finitistic dimension conjecture and extensions of algebras | An extension of algebras is a homomorphism of algebras preserving identities.
We use extensions of algebras to study the finitistic dimension conjecture over
Artin algebras. Let $f: B \to A$ be an extension of Artin algebras. We denote
by $fin.dim(f)$ the relative finitistic dimension of $f$, which is defined to
be the supremum of relative projective dimensions of finitely generated left
$A$-modules of finite projective dimension. We prove that, if $B$ is
representation-finite and $fin.dim(f)\leq 1$, then $A$ has finite finitistic
dimension. For the case of $fin.dim(f)> 1$, we give a sufficient condition for
$A$ with finite finitistic dimension. Also, we prove the following result: Let
$I$, $J$, $K$ be three ideals of an Artin algebra $A$ such that $IJK=0$ and
$K\supseteq rad(A)$. If both $A/I$ and $A/J$ are $A$-syzygy-finite, then the
finitistic dimension of $A$ is finite.
| math.RA | an extension of algebras is a homomorphism of algebras preserving identities we use extensions of algebras to study the finitistic dimension conjecture over artin algebras let f b to a be an extension of artin algebras we denote by findimf the relative finitistic dimension of f which is defined to be the supremum of relative projective dimensions of finitely generated left amodules of finite projective dimension we prove that if b is representationfinite and findimfleq 1 then a has finite finitistic dimension for the case of findimf 1 we give a sufficient condition for a with finite finitistic dimension also we prove the following result let i j k be three ideals of an artin algebra a such that ijk0 and ksupseteq rada if both ai and aj are asyzygyfinite then the finitistic dimension of a is finite | [['an', 'extension', 'of', 'algebras', 'is', 'a', 'homomorphism', 'of', 'algebras', 'preserving', 'identities', 'we', 'use', 'extensions', 'of', 'algebras', 'to', 'study', 'the', 'finitistic', 'dimension', 'conjecture', 'over', 'artin', 'algebras', 'let', 'f', 'b', 'to', 'a', 'be', 'an', 'extension', 'of', 'artin', 'algebras', 'we', 'denote', 'by', 'findimf', 'the', 'relative', 'finitistic', 'dimension', 'of', 'f', 'which', 'is', 'defined', 'to', 'be', 'the', 'supremum', 'of', 'relative', 'projective', 'dimensions', 'of', 'finitely', 'generated', 'left', 'amodules', 'of', 'finite', 'projective', 'dimension', 'we', 'prove', 'that', 'if', 'b', 'is', 'representationfinite', 'and', 'findimfleq', '1', 'then', 'a', 'has', 'finite', 'finitistic', 'dimension', 'for', 'the', 'case', 'of', 'findimf', '1', 'we', 'give', 'a', 'sufficient', 'condition', 'for', 'a', 'with', 'finite', 'finitistic', 'dimension', 'also', 'we', 'prove', 'the', 'following', 'result', 'let', 'i', 'j', 'k', 'be', 'three', 'ideals', 'of', 'an', 'artin', 'algebra', 'a', 'such', 'that', 'ijk0', 'and', 'ksupseteq', 'rada', 'if', 'both', 'ai', 'and', 'aj', 'are', 'asyzygyfinite', 'then', 'the', 'finitistic', 'dimension', 'of', 'a', 'is', 'finite']] | [-0.16485198865164863, 0.09601066025116421, -0.09585503852841529, 0.031054306411974583, -0.07018016273099364, -0.20552555340779663, -0.08420730565999154, 0.32101534080522304, -0.3862471677870913, -0.1354716934094375, 0.1192496347022384, -0.262109377913558, -0.08090093876164632, 0.1695800487615281, -0.16429999061493258, -0.07618009543159243, 0.002644179999179235, 0.13887971562375737, -0.08099193763778065, -0.3641377734443681, 0.40579728941630683, -0.06962223967826559, 0.1716856637003454, 0.10601086053771502, 0.1290202193106807, -0.0031472206270943084, 0.016920262476725675, 0.041009923788916436, -0.2063591212046793, 0.10552167464894327, 0.31699328421205847, 0.11643770821815864, 0.268724821236295, -0.31124475893254083, -0.09139951413574939, 0.27414322491015564, 0.16348160916911156, -0.013372546496667024, 0.008407783331208382, -0.25504648272533703, 0.20537456575865773, -0.22949251462705433, -0.16330874734910938, -0.0597657565112141, 0.17293158248084542, -0.06007735277561358, -0.3322285909653698, -0.02456977288084366, 0.15066564576684896, 0.21805365683482678, -0.07603256035398578, -0.09074508775886374, -0.08315019236143792, 0.04922529621663588, -0.07352500193695904, 0.029456597871048318, 0.06060202163644135, -0.05980994167145003, -0.18293603925937504, 0.3486569137524136, -0.04233952505852689, -0.24484027483302986, 0.12617729695965396, -0.20963805155108936, -0.11413261988976349, 0.052696150127854766, 0.03772930928442458, 0.14114825745028528, 0.018916264134035868, 0.2746160393497011, -0.16842711504520566, 0.07939063252486063, 0.09775513125086119, -0.016638346961840536, 0.07120397574776276, 0.10271908555737216, 0.1154659063075528, 0.14431342816026177, 0.030715708086394112, 0.07837382333959933, -0.3655961314498475, -0.2300988601125551, -0.12381854035651707, 0.1915132307419271, -0.13183314079794922, -0.13061268965600792, 0.3875894438277817, 0.1401067961635294, 0.16674896486978413, 0.1568120511850187, 0.21396129022027846, 0.05761359878030789, 0.07855731602070261, 0.06704604808438683, 0.057936686048792166, 0.30120095981912914, -0.09357614350014817, -0.08903519004216474, -0.04955042231207093, 0.2555017563987128] |
1,802.10386 | Parameterized Aspects of Strong Subgraph Closure | Motivated by the role of triadic closures in social networks, and the
importance of finding a maximum subgraph avoiding a fixed pattern, we introduce
and initiate the parameterized study of the Strong F-closure problem, where F
is a fixed graph. This is a generalization of Strong Triadic Closure, whereas
it is a relaxation of F-free Edge Deletion. In Strong F-closure, we want to
select a maximum number of edges of the input graph G, and mark them as strong
edges, in the following way: whenever a subset of the strong edges forms a
subgraph isomorphic to F, then the corresponding induced subgraph of G is not
isomorphic to F. Hence the subgraph of G defined by the strong edges is not
necessarily F-free, but whenever it contains a copy of F, there are additional
edges in G to destroy that strong copy of F in G.
We study Strong F-closure from a parameterized perspective with various
natural parameterizations. Our main focus is on the number k of strong edges as
the parameter. We show that the problem is FPT with this parameterization for
every fixed graph F, whereas it does not admit a polynomial kernel even when F
=P_3. In fact, this latter case is equivalent to the Strong Triadic Closure
problem, which motivates us to study this problem on input graphs belonging to
well known graph classes. We show that Strong Triadic Closure does not admit a
polynomial kernel even when the input graph is a split graph, whereas it admits
a polynomial kernel when the input graph is planar, and even d-degenerate.
Furthermore, on graphs of maximum degree at most 4, we show that Strong Triadic
Closure is FPT with the above guarantee parameterization k - \mu(G), where
\mu(G) is the maximum matching size of G. We conclude with some results on the
parameterization of Strong F-closure by the number of edges of G that are not
selected as strong.
| cs.DS cs.DM | motivated by the role of triadic closures in social networks and the importance of finding a maximum subgraph avoiding a fixed pattern we introduce and initiate the parameterized study of the strong fclosure problem where f is a fixed graph this is a generalization of strong triadic closure whereas it is a relaxation of ffree edge deletion in strong fclosure we want to select a maximum number of edges of the input graph g and mark them as strong edges in the following way whenever a subset of the strong edges forms a subgraph isomorphic to f then the corresponding induced subgraph of g is not isomorphic to f hence the subgraph of g defined by the strong edges is not necessarily ffree but whenever it contains a copy of f there are additional edges in g to destroy that strong copy of f in g we study strong fclosure from a parameterized perspective with various natural parameterizations our main focus is on the number k of strong edges as the parameter we show that the problem is fpt with this parameterization for every fixed graph f whereas it does not admit a polynomial kernel even when f p_3 in fact this latter case is equivalent to the strong triadic closure problem which motivates us to study this problem on input graphs belonging to well known graph classes we show that strong triadic closure does not admit a polynomial kernel even when the input graph is a split graph whereas it admits a polynomial kernel when the input graph is planar and even ddegenerate furthermore on graphs of maximum degree at most 4 we show that strong triadic closure is fpt with the above guarantee parameterization k mug where mug is the maximum matching size of g we conclude with some results on the parameterization of strong fclosure by the number of edges of g that are not selected as strong | [['motivated', 'by', 'the', 'role', 'of', 'triadic', 'closures', 'in', 'social', 'networks', 'and', 'the', 'importance', 'of', 'finding', 'a', 'maximum', 'subgraph', 'avoiding', 'a', 'fixed', 'pattern', 'we', 'introduce', 'and', 'initiate', 'the', 'parameterized', 'study', 'of', 'the', 'strong', 'fclosure', 'problem', 'where', 'f', 'is', 'a', 'fixed', 'graph', 'this', 'is', 'a', 'generalization', 'of', 'strong', 'triadic', 'closure', 'whereas', 'it', 'is', 'a', 'relaxation', 'of', 'ffree', 'edge', 'deletion', 'in', 'strong', 'fclosure', 'we', 'want', 'to', 'select', 'a', 'maximum', 'number', 'of', 'edges', 'of', 'the', 'input', 'graph', 'g', 'and', 'mark', 'them', 'as', 'strong', 'edges', 'in', 'the', 'following', 'way', 'whenever', 'a', 'subset', 'of', 'the', 'strong', 'edges', 'forms', 'a', 'subgraph', 'isomorphic', 'to', 'f', 'then', 'the', 'corresponding', 'induced', 'subgraph', 'of', 'g', 'is', 'not', 'isomorphic', 'to', 'f', 'hence', 'the', 'subgraph', 'of', 'g', 'defined', 'by', 'the', 'strong', 'edges', 'is', 'not', 'necessarily', 'ffree', 'but', 'whenever', 'it', 'contains', 'a', 'copy', 'of', 'f', 'there', 'are', 'additional', 'edges', 'in', 'g', 'to', 'destroy', 'that', 'strong', 'copy', 'of', 'f', 'in', 'g', 'we', 'study', 'strong', 'fclosure', 'from', 'a', 'parameterized', 'perspective', 'with', 'various', 'natural', 'parameterizations', 'our', 'main', 'focus', 'is', 'on', 'the', 'number', 'k', 'of', 'strong', 'edges', 'as', 'the', 'parameter', 'we', 'show', 'that', 'the', 'problem', 'is', 'fpt', 'with', 'this', 'parameterization', 'for', 'every', 'fixed', 'graph', 'f', 'whereas', 'it', 'does', 'not', 'admit', 'a', 'polynomial', 'kernel', 'even', 'when', 'f', 'p_3', 'in', 'fact', 'this', 'latter', 'case', 'is', 'equivalent', 'to', 'the', 'strong', 'triadic', 'closure', 'problem', 'which', 'motivates', 'us', 'to', 'study', 'this', 'problem', 'on', 'input', 'graphs', 'belonging', 'to', 'well', 'known', 'graph', 'classes', 'we', 'show', 'that', 'strong', 'triadic', 'closure', 'does', 'not', 'admit', 'a', 'polynomial', 'kernel', 'even', 'when', 'the', 'input', 'graph', 'is', 'a', 'split', 'graph', 'whereas', 'it', 'admits', 'a', 'polynomial', 'kernel', 'when', 'the', 'input', 'graph', 'is', 'planar', 'and', 'even', 'ddegenerate', 'furthermore', 'on', 'graphs', 'of', 'maximum', 'degree', 'at', 'most', '4', 'we', 'show', 'that', 'strong', 'triadic', 'closure', 'is', 'fpt', 'with', 'the', 'above', 'guarantee', 'parameterization', 'k', 'mug', 'where', 'mug', 'is', 'the', 'maximum', 'matching', 'size', 'of', 'g', 'we', 'conclude', 'with', 'some', 'results', 'on', 'the', 'parameterization', 'of', 'strong', 'fclosure', 'by', 'the', 'number', 'of', 'edges', 'of', 'g', 'that', 'are', 'not', 'selected', 'as', 'strong']] | [-0.17990707456514332, 0.09406733299867392, -0.03475566281620819, 0.03685839514855899, -0.14788620320230003, -0.11808963383930936, 0.06082734794390745, 0.39601922714995724, -0.3033809987643177, -0.3126364278685406, 0.046099117822144355, -0.277313679485724, -0.16596751271042032, 0.11154095861680713, -0.06709766073754084, -0.002417509633595504, 0.1159861374753774, 0.12328891331515626, 0.015644050004523583, -0.2280526740520553, 0.313400980861962, -0.028901198864377732, 0.19510893333910723, 0.09218507255442046, 0.0659069413314878, 0.026071453187034417, 0.011068852724234727, 0.10288502478836441, -0.15667394663820952, 0.05442280469990315, 0.24712742883073763, 0.1596856946386745, 0.29184143328560497, -0.38640845893775955, -0.1813889480576012, 0.23614810315661447, 0.09264792130775518, 0.04190351149630138, 0.023077346646369106, -0.204637918504161, 0.164634978401582, -0.10074422804960971, -0.06514952660718137, -0.01444387504964417, 0.09033161824905658, 0.013377735242566727, -0.30546153679553917, 0.0016803095912172044, 0.1695455691528382, 0.04121875414659082, 0.055869581570233744, -0.10774617097587136, -0.048632532583837575, 0.07172307469495834, -0.015570166908100109, 0.10894259502980684, 0.046864086147535566, -0.16333038311709527, -0.09864393503744608, 0.3861639055356708, -0.06373653528527168, -0.14907931401814997, 0.15792760818781812, -0.15890999982203138, -0.18062855105852924, 0.12217008762171847, 0.10834759501290632, 0.13839044067515438, -0.07338302048510542, 0.14892751809334343, -0.14727277626106486, 0.14452577236643774, 0.09154300028139092, 0.004339263410339382, 0.11970913090824362, 0.12253843519888888, 0.18765478868420435, 0.17004223579955738, 0.006711566767701009, 0.013602785220677236, -0.32087054965594014, -0.0744477272268698, -0.2221384238440114, 0.05641921636173567, -0.13212941232267217, -0.21687882399836386, 0.40978186833744756, 0.10177307900453329, 0.2252967424713934, 0.06895476659778738, 0.2386686354411354, 0.10019469369461069, 0.07338951644016214, 0.15040711733306586, 0.15922336398619893, 0.16121612731048204, -0.06865303550275316, -0.20480518847540008, 0.09754964450557028, 0.10764060348759745] |
1,802.10387 | Deterministic transfer of an unknown qutrit state assisted by the low-Q
microwave resonators | Qutrits (i.e., three-level quantum systems) can be used to achieve many
quantum information and communication tasks due to their large Hilbert spaces.
In this work, we propose a scheme to transfer an unknown quantum state between
two flux qutrits coupled to two superconducting coplanar waveguide resonators.
The quantum state transfer can be deterministically achieved without
measurements. Because resonator photons are virtually excited during the
operation time, the decoherences caused by the resonator decay and the unwanted
inter-resonator crosstalk are greatly suppressed. Moreover, our approach can be
adapted to other solid-state qutrits coupled to circuit resonators. Numerical
simulations show that the high-fidelity transfer of quantum state between the
two qutrits is feasible with current circuit QED technology.
| quant-ph | qutrits ie threelevel quantum systems can be used to achieve many quantum information and communication tasks due to their large hilbert spaces in this work we propose a scheme to transfer an unknown quantum state between two flux qutrits coupled to two superconducting coplanar waveguide resonators the quantum state transfer can be deterministically achieved without measurements because resonator photons are virtually excited during the operation time the decoherences caused by the resonator decay and the unwanted interresonator crosstalk are greatly suppressed moreover our approach can be adapted to other solidstate qutrits coupled to circuit resonators numerical simulations show that the highfidelity transfer of quantum state between the two qutrits is feasible with current circuit qed technology | [['qutrits', 'ie', 'threelevel', 'quantum', 'systems', 'can', 'be', 'used', 'to', 'achieve', 'many', 'quantum', 'information', 'and', 'communication', 'tasks', 'due', 'to', 'their', 'large', 'hilbert', 'spaces', 'in', 'this', 'work', 'we', 'propose', 'a', 'scheme', 'to', 'transfer', 'an', 'unknown', 'quantum', 'state', 'between', 'two', 'flux', 'qutrits', 'coupled', 'to', 'two', 'superconducting', 'coplanar', 'waveguide', 'resonators', 'the', 'quantum', 'state', 'transfer', 'can', 'be', 'deterministically', 'achieved', 'without', 'measurements', 'because', 'resonator', 'photons', 'are', 'virtually', 'excited', 'during', 'the', 'operation', 'time', 'the', 'decoherences', 'caused', 'by', 'the', 'resonator', 'decay', 'and', 'the', 'unwanted', 'interresonator', 'crosstalk', 'are', 'greatly', 'suppressed', 'moreover', 'our', 'approach', 'can', 'be', 'adapted', 'to', 'other', 'solidstate', 'qutrits', 'coupled', 'to', 'circuit', 'resonators', 'numerical', 'simulations', 'show', 'that', 'the', 'highfidelity', 'transfer', 'of', 'quantum', 'state', 'between', 'the', 'two', 'qutrits', 'is', 'feasible', 'with', 'current', 'circuit', 'qed', 'technology']] | [-0.17411630899958505, 0.23383735504379227, 0.026631596843423002, -0.024111555724661667, -0.004934166445685872, -0.2796190508023097, 0.022623098348989953, 0.4403265640982587, -0.25392351244528105, -0.3046169531519589, 0.029164025263965193, -0.27759865643296006, -0.08276662484196753, 0.2747929697727849, -0.04778183283031404, 0.1376268188308539, 0.10529141358685969, -0.0354519985989539, -0.03255977446578668, -0.2541714140499043, 0.29557921939954995, 0.019926073331715026, 0.32721385055879965, 0.01346578788622443, 0.09880209808510824, -0.0778404004382098, 0.07967374432061253, -0.06105082828134041, -0.05186666559724284, 0.10620620680354728, 0.3235150433691411, 0.06814496138871744, 0.22850941934076877, -0.5035202129551306, -0.18884149183326499, 0.11525054061323693, 0.1684253561021439, 0.19762298005536713, -0.0001686889284836321, -0.336777733855656, -0.003473055737639039, -0.19458853212538466, -0.03491649797973063, -0.12603800103534013, -0.08129278825724433, -0.07082874036458289, -0.2541863471911899, 0.0073625894086756585, 0.05151552818354283, -0.015058855530163595, 0.0429890101438324, 0.02285713962166859, 0.027406087123130543, 0.10619005415255428, -0.1193591669976615, -0.007869148543626392, 0.21066895184701245, -0.0809346234670776, -0.20419756040591264, 0.3090907884922264, -0.03818417497627549, -0.2106555719249721, 0.17116827039240762, -0.0983875165894178, -0.011284571654837707, 0.09671046111154659, 0.13539111919416083, 0.04981972042326655, -0.15975853777891988, 0.018619296581540577, 0.05605578523707287, 0.2501036914924545, 0.07642506962995334, 0.14599176279895393, 0.19033692592096613, 0.1177819749352458, 0.046014892909342645, 0.18917394182715036, -0.045058101636421835, -0.13634582544056748, -0.25575089541360224, -0.17178776869871493, -0.23888710150013454, 0.0980315970885166, -0.05503162395601474, -0.10304379070595164, 0.3511786903807598, 0.1511875822947457, 0.1312100531990993, -0.04593701252978745, 0.3590807874911818, 0.14462227568206987, 0.08074592468770349, 0.0650144180740583, 0.2963940349672439, 0.18645095824994595, 0.06918493520211556, -0.34201219781093173, -0.002766122270760865, -0.019465671157753415] |
1,802.10388 | One-step implementation of a hybrid Fredkin gate with quantum memories
and single superconducting qubit in circuit QED and its applications | In a recent remarkable experiment [R. B. Patel et al., Science advances 2,
e1501531 (2016)], a 3-qubit quantum Fredkin (i.e., controlled-SWAP) gate was
demonstrated by using linear optics. Here we propose a simple experimental
scheme by utilizing the dispersive interaction in superconducting quantum
circuit to implement a hybrid Fredkin gate with a superconducting flux qubit as
the control qubit and two separated quantum memories as the target qudits. The
quantum memories considered here are prepared by the superconducting coplanar
waveguide resonators or nitrogen-vacancy center ensembles. In particular, it is
shown that this Fredkin gate can be realized using a single-step operation and
more importantly, each target qudit can be in an arbitrary state with arbitrary
degrees of freedom. Furthermore, we show that this experimental scheme has many
potential applications in quantum computation and quantum information
processing such as generating arbitrary entangled states (discrete-variable
states or continuous-variable states) of the two memories, measuring the
fidelity and the entanglement between the two memories. With state-of-the-art
circuit QED technology, the numerical simulation is performed to demonstrate
that two-memory NOON states, entangled coherent states, and entangled cat
states can be efficiently synthesized.
| quant-ph | in a recent remarkable experiment r b patel et al science advances 2 e1501531 2016 a 3qubit quantum fredkin ie controlledswap gate was demonstrated by using linear optics here we propose a simple experimental scheme by utilizing the dispersive interaction in superconducting quantum circuit to implement a hybrid fredkin gate with a superconducting flux qubit as the control qubit and two separated quantum memories as the target qudits the quantum memories considered here are prepared by the superconducting coplanar waveguide resonators or nitrogenvacancy center ensembles in particular it is shown that this fredkin gate can be realized using a singlestep operation and more importantly each target qudit can be in an arbitrary state with arbitrary degrees of freedom furthermore we show that this experimental scheme has many potential applications in quantum computation and quantum information processing such as generating arbitrary entangled states discretevariable states or continuousvariable states of the two memories measuring the fidelity and the entanglement between the two memories with stateoftheart circuit qed technology the numerical simulation is performed to demonstrate that twomemory noon states entangled coherent states and entangled cat states can be efficiently synthesized | [['in', 'a', 'recent', 'remarkable', 'experiment', 'r', 'b', 'patel', 'et', 'al', 'science', 'advances', '2', 'e1501531', '2016', 'a', '3qubit', 'quantum', 'fredkin', 'ie', 'controlledswap', 'gate', 'was', 'demonstrated', 'by', 'using', 'linear', 'optics', 'here', 'we', 'propose', 'a', 'simple', 'experimental', 'scheme', 'by', 'utilizing', 'the', 'dispersive', 'interaction', 'in', 'superconducting', 'quantum', 'circuit', 'to', 'implement', 'a', 'hybrid', 'fredkin', 'gate', 'with', 'a', 'superconducting', 'flux', 'qubit', 'as', 'the', 'control', 'qubit', 'and', 'two', 'separated', 'quantum', 'memories', 'as', 'the', 'target', 'qudits', 'the', 'quantum', 'memories', 'considered', 'here', 'are', 'prepared', 'by', 'the', 'superconducting', 'coplanar', 'waveguide', 'resonators', 'or', 'nitrogenvacancy', 'center', 'ensembles', 'in', 'particular', 'it', 'is', 'shown', 'that', 'this', 'fredkin', 'gate', 'can', 'be', 'realized', 'using', 'a', 'singlestep', 'operation', 'and', 'more', 'importantly', 'each', 'target', 'qudit', 'can', 'be', 'in', 'an', 'arbitrary', 'state', 'with', 'arbitrary', 'degrees', 'of', 'freedom', 'furthermore', 'we', 'show', 'that', 'this', 'experimental', 'scheme', 'has', 'many', 'potential', 'applications', 'in', 'quantum', 'computation', 'and', 'quantum', 'information', 'processing', 'such', 'as', 'generating', 'arbitrary', 'entangled', 'states', 'discretevariable', 'states', 'or', 'continuousvariable', 'states', 'of', 'the', 'two', 'memories', 'measuring', 'the', 'fidelity', 'and', 'the', 'entanglement', 'between', 'the', 'two', 'memories', 'with', 'stateoftheart', 'circuit', 'qed', 'technology', 'the', 'numerical', 'simulation', 'is', 'performed', 'to', 'demonstrate', 'that', 'twomemory', 'noon', 'states', 'entangled', 'coherent', 'states', 'and', 'entangled', 'cat', 'states', 'can', 'be', 'efficiently', 'synthesized']] | [-0.1568154821945955, 0.2507525522491716, -0.042575344117859036, -0.026244755082492095, 0.05295087855123985, -0.29133633022466976, 0.05501419786484011, 0.430747684111358, -0.21384202799339208, -0.30073028366376836, 0.03925440514207347, -0.25229340470996836, -0.12529949564737097, 0.24818357831538124, -0.03983176929418684, 0.1656630306745008, 0.08189616259312638, -0.02359484015933929, -0.073357805210386, -0.2703367064116142, 0.24394494282352108, 0.01505497384626138, 0.3320772989367646, 0.004647551387328134, 0.13367033347998175, -0.003943954236424898, 0.10589092785194616, -0.0334313612441302, -0.03590861790476621, 0.11150693804618993, 0.3188014566395757, 0.09061951096349906, 0.2433069603998334, -0.4763099494870872, -0.2140485895872717, 0.050470413267737636, 0.10437017478194634, 0.23354285207679695, -0.066267889049746, -0.35975525195720376, 0.006804771959200822, -0.22461899828606396, -0.060616971842283686, -0.13462263150691425, 0.006621753811956414, -0.042839640400983314, -0.24784178869555934, 0.0040562369970865144, 0.04638796950432582, 0.02705605669317627, 0.05398733489045132, -0.030226541269991185, 0.012591287631401292, 0.0723076398629615, -0.20264063508910757, 0.035932384753694896, 0.17872565508299376, -0.09455623575711562, -0.2710754966979185, 0.2785138646328461, -0.016413084332711034, -0.18092595912536147, 0.1410702828478108, -0.0830420186074691, -0.06107179048816643, 0.0056815596087084665, 0.09769204985325335, 0.09202157166756449, -0.12337387922490316, 0.06950188795028264, -0.009706573587121261, 0.22955572292188642, 0.08842300235103535, 0.16416451719499403, 0.18242166660443168, 0.114821312388265, 0.044641718847028694, 0.22378608243983059, -0.0768937515670694, -0.12412711801614502, -0.2864631463232781, -0.20100788571321035, -0.2814016888338712, 0.11139469670497322, -0.01710927312383466, -0.10824559109773041, 0.40134976124177374, 0.11425155682754652, 0.13209457658181187, -0.06190296988158176, 0.31232685112063924, 0.0889453055238181, 0.09203094256552367, 0.08540407617286008, 0.2409083887218668, 0.19146723210466124, 0.05207761178063529, -0.26580204648811934, 0.021216136858403, -0.02599181039261967] |
1,802.10389 | Asymmetric Josephson Effect in Inversion Symmetry Breaking Topological
Materials | Topological materials which possess topologically protected surface states
have attracted much attention in recent years. In this work, we study the
critical current of superconductor/inversion symmetry breaking topological
material/superconductor junctions. We found surprisingly that, in topological
materials with broken inversion symmetry, the magnitude of the critical
Josephson currents $|I^{+}_c(B)|$ at fixed magnetic field $B$ is not the same
for critical currents $|I^{-}_c(B)|$ flowing in the opposite direction.
Moreover, the critical currents violate the $| I_{c}^{\pm}(B)| =
|I_{c}^{\pm}(-B)|$ relation and give rise to asymmetric Fraunhofer patterns. We
call this phenomenon asymmetric Josephson effect (AJE). AJE can be use to
detect inversion symmetry breaking in topological materials such as in quantum
spin Hall systems and Weyl semimetals.
| cond-mat.supr-con | topological materials which possess topologically protected surface states have attracted much attention in recent years in this work we study the critical current of superconductorinversion symmetry breaking topological materialsuperconductor junctions we found surprisingly that in topological materials with broken inversion symmetry the magnitude of the critical josephson currents i_cb at fixed magnetic field b is not the same for critical currents i_cb flowing in the opposite direction moreover the critical currents violate the i_cpmb i_cpmb relation and give rise to asymmetric fraunhofer patterns we call this phenomenon asymmetric josephson effect aje aje can be use to detect inversion symmetry breaking in topological materials such as in quantum spin hall systems and weyl semimetals | [['topological', 'materials', 'which', 'possess', 'topologically', 'protected', 'surface', 'states', 'have', 'attracted', 'much', 'attention', 'in', 'recent', 'years', 'in', 'this', 'work', 'we', 'study', 'the', 'critical', 'current', 'of', 'superconductorinversion', 'symmetry', 'breaking', 'topological', 'materialsuperconductor', 'junctions', 'we', 'found', 'surprisingly', 'that', 'in', 'topological', 'materials', 'with', 'broken', 'inversion', 'symmetry', 'the', 'magnitude', 'of', 'the', 'critical', 'josephson', 'currents', 'i_cb', 'at', 'fixed', 'magnetic', 'field', 'b', 'is', 'not', 'the', 'same', 'for', 'critical', 'currents', 'i_cb', 'flowing', 'in', 'the', 'opposite', 'direction', 'moreover', 'the', 'critical', 'currents', 'violate', 'the', 'i_cpmb', 'i_cpmb', 'relation', 'and', 'give', 'rise', 'to', 'asymmetric', 'fraunhofer', 'patterns', 'we', 'call', 'this', 'phenomenon', 'asymmetric', 'josephson', 'effect', 'aje', 'aje', 'can', 'be', 'use', 'to', 'detect', 'inversion', 'symmetry', 'breaking', 'in', 'topological', 'materials', 'such', 'as', 'in', 'quantum', 'spin', 'hall', 'systems', 'and', 'weyl', 'semimetals']] | [-0.25346604491815766, 0.24632582609080325, -0.03503936795739952, 0.052511516004723896, -0.11234453369419031, -0.204146314292736, 0.04430830199698653, 0.3637123684304843, -0.24027513907026124, -0.2632719708965459, 0.030249235367641673, -0.2889334594642897, -0.1923074549162299, 0.15157908081598237, -0.016732097949422556, 0.03586418426450376, -0.10777464973389966, -0.036764919706577553, -0.13716561352586323, -0.1658973195034703, 0.2805784555203324, -0.06432159611321943, 0.4149380227328714, 0.08070160481873728, -0.013880265433418163, -0.054163287722702146, 0.12185281782129079, 0.04078816980072254, -0.14162538544983239, 0.02674982817405664, 0.23314824707190926, -0.10824014865921451, 0.09978508164918204, -0.49547268247761583, -0.2107973818735587, 0.10092408419373113, 0.16083220631277206, 0.18632145231021482, -0.10736801899935401, -0.33482954892065, 0.08767513656527351, -0.16400497578887627, -0.13527677942562952, -0.0906845912296718, 0.048764977791056104, -0.07247162003864731, -0.17264846023257582, 0.0799835527811302, 0.0861964505219217, 0.15091623062558404, 0.004978184865941422, -0.06322423091004474, -0.1172497858242089, 0.05576056285564779, 0.10034870935407458, 0.032276776510316435, 0.13003343107379597, -0.18048737900024023, -0.17234138364117557, 0.3459082127061732, -0.011245351493008298, -0.13922471528348979, 0.15434597078454468, -0.17974883523436452, -0.14469182480622186, 0.12692791488183952, 0.14075571234090203, 0.06701362710937413, -0.0693932744512044, 0.08371688295561615, -0.048737978972836375, 0.07407192140817642, 0.05063165061244177, 0.09224280885446372, 0.32131561440407136, 0.10981182481051174, 0.14020861797846443, 0.158765190459335, -0.08647452073530593, -0.07018961231523288, -0.28017483323539066, -0.1913158689548663, -0.20270487210721871, 0.10500679147622544, 0.019561371538807305, -0.18584126099909937, 0.4512749015003306, 0.20829816463770806, 0.18122398364144043, -0.0705588104154214, 0.21148301791741486, 0.1644114480778968, 0.15089763644837065, 0.043437475650443126, 0.24248793948475922, 0.168171790476521, 0.1453825174446363, -0.26250298687367946, 0.04480940163447394, 0.02929954188918575] |
1,802.1039 | Achieving balanced open circuit voltage and short circuit current by
tuning the interfacial energetics in organic bulk heterojunction solar cells:
A drift-diffusion simulation | In organic bulk heterojunction solar cells, the donor/acceptor interfacial
energy offset ($\Delta E$) is found to provide the driving force for efficient
charge separation which gives rise to high short circuit current density
($J_\mathrm{sc}$), but a high $\Delta E$ inevitably undermines the open circuit
voltage ($V_\mathrm{oc}$). In this paper, employing the device model method we
calculated the steady state current density-voltage ($J-V$) and the
$J_\mathrm{sc}-\Delta E$ curves under two different charge separation
mechanisms to investigate the optimum driving force required for achieving
sizable $V_\mathrm{oc}$ and $J_\mathrm{sc}$ simultaneously. Under the Marcus
charge transfer mechanism, with the increased $\Delta E$ the Jsc increases
rapidly for $\Delta E\leq 0.2$ eV, and then maintains a nearly constant value
before decreasing at the Marcus inverted region, which is due to the
accumulation of undissociated excitons within their lifetime and is beneficial
for obtaining a sizable $J_\mathrm{sc}$ under a $\Delta E$ much smaller than
the reorganization energy $\lambda$. For the coherent charge transfer mechanism
in which the driving force act as the energy window of accessible charge
separated states, with two typical types of density of states for the charge
transfer excitons, it is shown that the highest $J_\mathrm{sc}$ can also be
achieved under a small $\Delta E$ of 0.2\,eV if the high-lying delocalized
states are harvested in high proportion. This work demonstrates the existence
of the optimum driving force of 0.2\,eV and provides some guidelines for
engineering the interfacial energetics to achieve the high balanced
$J_\mathrm{sc}$ and $V_\mathrm{oc}$.
| cond-mat.mtrl-sci | in organic bulk heterojunction solar cells the donoracceptor interfacial energy offset delta e is found to provide the driving force for efficient charge separation which gives rise to high short circuit current density j_mathrmsc but a high delta e inevitably undermines the open circuit voltage v_mathrmoc in this paper employing the device model method we calculated the steady state current densityvoltage jv and the j_mathrmscdelta e curves under two different charge separation mechanisms to investigate the optimum driving force required for achieving sizable v_mathrmoc and j_mathrmsc simultaneously under the marcus charge transfer mechanism with the increased delta e the jsc increases rapidly for delta eleq 02 ev and then maintains a nearly constant value before decreasing at the marcus inverted region which is due to the accumulation of undissociated excitons within their lifetime and is beneficial for obtaining a sizable j_mathrmsc under a delta e much smaller than the reorganization energy lambda for the coherent charge transfer mechanism in which the driving force act as the energy window of accessible charge separated states with two typical types of density of states for the charge transfer excitons it is shown that the highest j_mathrmsc can also be achieved under a small delta e of 02ev if the highlying delocalized states are harvested in high proportion this work demonstrates the existence of the optimum driving force of 02ev and provides some guidelines for engineering the interfacial energetics to achieve the high balanced j_mathrmsc and v_mathrmoc | [['in', 'organic', 'bulk', 'heterojunction', 'solar', 'cells', 'the', 'donoracceptor', 'interfacial', 'energy', 'offset', 'delta', 'e', 'is', 'found', 'to', 'provide', 'the', 'driving', 'force', 'for', 'efficient', 'charge', 'separation', 'which', 'gives', 'rise', 'to', 'high', 'short', 'circuit', 'current', 'density', 'j_mathrmsc', 'but', 'a', 'high', 'delta', 'e', 'inevitably', 'undermines', 'the', 'open', 'circuit', 'voltage', 'v_mathrmoc', 'in', 'this', 'paper', 'employing', 'the', 'device', 'model', 'method', 'we', 'calculated', 'the', 'steady', 'state', 'current', 'densityvoltage', 'jv', 'and', 'the', 'j_mathrmscdelta', 'e', 'curves', 'under', 'two', 'different', 'charge', 'separation', 'mechanisms', 'to', 'investigate', 'the', 'optimum', 'driving', 'force', 'required', 'for', 'achieving', 'sizable', 'v_mathrmoc', 'and', 'j_mathrmsc', 'simultaneously', 'under', 'the', 'marcus', 'charge', 'transfer', 'mechanism', 'with', 'the', 'increased', 'delta', 'e', 'the', 'jsc', 'increases', 'rapidly', 'for', 'delta', 'eleq', '02', 'ev', 'and', 'then', 'maintains', 'a', 'nearly', 'constant', 'value', 'before', 'decreasing', 'at', 'the', 'marcus', 'inverted', 'region', 'which', 'is', 'due', 'to', 'the', 'accumulation', 'of', 'undissociated', 'excitons', 'within', 'their', 'lifetime', 'and', 'is', 'beneficial', 'for', 'obtaining', 'a', 'sizable', 'j_mathrmsc', 'under', 'a', 'delta', 'e', 'much', 'smaller', 'than', 'the', 'reorganization', 'energy', 'lambda', 'for', 'the', 'coherent', 'charge', 'transfer', 'mechanism', 'in', 'which', 'the', 'driving', 'force', 'act', 'as', 'the', 'energy', 'window', 'of', 'accessible', 'charge', 'separated', 'states', 'with', 'two', 'typical', 'types', 'of', 'density', 'of', 'states', 'for', 'the', 'charge', 'transfer', 'excitons', 'it', 'is', 'shown', 'that', 'the', 'highest', 'j_mathrmsc', 'can', 'also', 'be', 'achieved', 'under', 'a', 'small', 'delta', 'e', 'of', '02ev', 'if', 'the', 'highlying', 'delocalized', 'states', 'are', 'harvested', 'in', 'high', 'proportion', 'this', 'work', 'demonstrates', 'the', 'existence', 'of', 'the', 'optimum', 'driving', 'force', 'of', '02ev', 'and', 'provides', 'some', 'guidelines', 'for', 'engineering', 'the', 'interfacial', 'energetics', 'to', 'achieve', 'the', 'high', 'balanced', 'j_mathrmsc', 'and', 'v_mathrmoc']] | [-0.165555388595373, 0.19915852546961285, -0.013346661071770263, 0.06026380167492812, 0.022687102529443493, -0.17481422027830834, 0.10431205308159106, 0.3455165471489087, -0.2622416767095454, -0.3402219212090612, -0.013032325950435802, -0.25664032630099, -0.0646121041783832, 0.1961650320738631, -0.018735845419429128, -0.008441024202052966, 0.028955175875193508, -0.007458165773716832, -0.03172116665350473, -0.15232097587143148, 0.23520538689711032, 0.08438231506238668, 0.32098339469949444, 0.14183910898546773, 0.08184046962458164, -0.03415290907381979, 0.06123201370846349, -0.011772482660752991, -0.1459999952877139, 0.08772522436064276, 0.23575869719459375, 0.0100529937743217, 0.24722003777514304, -0.4176591578834933, -0.18790677738181616, 0.09946286618182328, 0.1188855353144646, 0.10529386318309909, -0.05645525884960801, -0.20885767899287677, 0.09680724968221655, -0.16798023778410273, -0.11338354224793243, -0.04973371507607647, 0.06947678252900681, 0.02163403090628341, -0.29609518484712755, 0.10842369176523879, 0.043701014308786125, 0.0006956850594171315, -0.09586091928110912, -0.1462910895799633, -0.06891284303928241, 0.10543820753701759, 0.02341220283463274, 0.07638484771721342, 0.17584295820878734, -0.13427882727951365, -0.04458276488941378, 0.3319037294415526, -0.05340089175537708, -0.1544902141490751, 0.1529998682316177, -0.15541280572464275, -0.03208729196669368, 0.1770560434472955, 0.09657502977739373, 0.09506355979468303, -0.12523326808047935, 0.05796229690919469, 0.038009341362881095, 0.16129043877503857, 0.09611405932425314, 0.06279999703699954, 0.2093812962580272, 0.18164352615833407, 0.11965852903109814, 0.0865128349141441, -0.10391151930651943, -0.06017688911577517, -0.26121801245151366, -0.14290908835385735, -0.16579472162753098, 0.10205245699949009, -0.05210852895226918, -0.13265140179950216, 0.4104413913509016, 0.11643760736592976, 0.18754330880156803, 0.001197824283014244, 0.2664192405929558, 0.1489993139350025, 0.06296289763374885, 0.0690058440630024, 0.2587899731339604, 0.1118582462959765, 0.12275079949489556, -0.2890619676664071, 0.06760166805383773, -0.014800014152780391] |
1,802.10391 | Magnetocaloric effect in some magnetic materials in alternating magnetic
fields up to 22 Hz | Direct measurements of the magnetocaloric effect (MCE) in different materials
(Gd, Fe48Rh52, Ni43Mn37.9In12.1Co7 and Ni2.07Co0.09Mn0.84Ga) in alternating
magnetic fields with frequencies f < 22 Hz and an amplitude deltaH = 6.2 kOe
are carried out. The MCE in Gd shows inconsiderable changes with field
frequency. Near paramagnetic-ferromagnetic phase transition in
Ni43Mn37.9In12.1Co7 Heusler alloy a slight reduction of MCE with frequency is
observed. In weak alternating fields in materials with AFM-FM
magneto-structural phase transitions (Fe48Rh52, Ni43Mn37.9In12.1Co7) it is not
possible to get a structural contribution to overall MCE because of
irreversibility of the transitions in these fields. Near magneto-structural
phase transitions the MCE in these alloys has only magnetic contribution, and
does not show a significant dependence on the magnetic field frequency. In
Ni2.07Co0.09Mn0.84Ga Heusler alloy the MCE vanishes at frequencies about 20 Hz.
The obtained results show the increase of frequencies of operating cycles is
one of the powerful methods to improve the efficiency of magnetic refrigerators
in case of Gd as a refrigerant.
| cond-mat.mtrl-sci | direct measurements of the magnetocaloric effect mce in different materials gd fe48rh52 ni43mn379in121co7 and ni207co009mn084ga in alternating magnetic fields with frequencies f 22 hz and an amplitude deltah 62 koe are carried out the mce in gd shows inconsiderable changes with field frequency near paramagneticferromagnetic phase transition in ni43mn379in121co7 heusler alloy a slight reduction of mce with frequency is observed in weak alternating fields in materials with afmfm magnetostructural phase transitions fe48rh52 ni43mn379in121co7 it is not possible to get a structural contribution to overall mce because of irreversibility of the transitions in these fields near magnetostructural phase transitions the mce in these alloys has only magnetic contribution and does not show a significant dependence on the magnetic field frequency in ni207co009mn084ga heusler alloy the mce vanishes at frequencies about 20 hz the obtained results show the increase of frequencies of operating cycles is one of the powerful methods to improve the efficiency of magnetic refrigerators in case of gd as a refrigerant | [['direct', 'measurements', 'of', 'the', 'magnetocaloric', 'effect', 'mce', 'in', 'different', 'materials', 'gd', 'fe48rh52', 'ni43mn379in121co7', 'and', 'ni207co009mn084ga', 'in', 'alternating', 'magnetic', 'fields', 'with', 'frequencies', 'f', '22', 'hz', 'and', 'an', 'amplitude', 'deltah', '62', 'koe', 'are', 'carried', 'out', 'the', 'mce', 'in', 'gd', 'shows', 'inconsiderable', 'changes', 'with', 'field', 'frequency', 'near', 'paramagneticferromagnetic', 'phase', 'transition', 'in', 'ni43mn379in121co7', 'heusler', 'alloy', 'a', 'slight', 'reduction', 'of', 'mce', 'with', 'frequency', 'is', 'observed', 'in', 'weak', 'alternating', 'fields', 'in', 'materials', 'with', 'afmfm', 'magnetostructural', 'phase', 'transitions', 'fe48rh52', 'ni43mn379in121co7', 'it', 'is', 'not', 'possible', 'to', 'get', 'a', 'structural', 'contribution', 'to', 'overall', 'mce', 'because', 'of', 'irreversibility', 'of', 'the', 'transitions', 'in', 'these', 'fields', 'near', 'magnetostructural', 'phase', 'transitions', 'the', 'mce', 'in', 'these', 'alloys', 'has', 'only', 'magnetic', 'contribution', 'and', 'does', 'not', 'show', 'a', 'significant', 'dependence', 'on', 'the', 'magnetic', 'field', 'frequency', 'in', 'ni207co009mn084ga', 'heusler', 'alloy', 'the', 'mce', 'vanishes', 'at', 'frequencies', 'about', '20', 'hz', 'the', 'obtained', 'results', 'show', 'the', 'increase', 'of', 'frequencies', 'of', 'operating', 'cycles', 'is', 'one', 'of', 'the', 'powerful', 'methods', 'to', 'improve', 'the', 'efficiency', 'of', 'magnetic', 'refrigerators', 'in', 'case', 'of', 'gd', 'as', 'a', 'refrigerant']] | [-0.19054252162551993, 0.20384655957591089, 0.013747962461606523, -0.02404955805466172, -0.06971081499615388, -0.06881482463780862, 0.12512012517856802, 0.40340814260160845, -0.2491524311992678, -0.3119130561626546, 0.03987131496612576, -0.3020445144124282, -0.1155404561750923, 0.23975053064786134, 0.034621495548873, -0.03602857257174269, -0.020567621329834886, 0.06482252716324084, -0.12780717941954625, -0.20575071385450613, 0.1917593076137031, 0.052912573235192495, 0.30131410934315744, 0.04416091868855581, 0.03688117858188547, -0.07315113827004839, 0.1254681050896075, 0.04978231905520579, -0.11094747270401092, -0.034620414787907505, 0.3066882472959863, -0.047376199868644116, 0.19551717409875932, -0.36554803638748684, -0.20280926518593054, 0.09178555953601127, 0.07008669119785024, 0.09232790248504111, -0.06118249627138684, -0.23153874269615454, 0.08461841822833202, -0.08440400862912084, -0.05502628003155136, -0.10210555158837277, 0.0020819584747100144, 0.004807391341858704, -0.27362979084229583, 0.11597453440231076, 0.1213438226893295, 0.20124053039178727, -0.10159940012451854, -0.19263829149685469, -0.030040744874773956, 0.022609588019787127, 0.08804020657987115, 0.07407201891824318, 0.1677493606545743, -0.08931883070973834, -0.12705688528155992, 0.3443107857090083, -0.08623005586800872, -0.007729493366305236, 0.1525481950423449, -0.24118625191722515, -0.12665147242094776, 0.22399168812141868, 0.1285971528798591, 0.0969415981275071, -0.13754286538664204, 0.10754764378315526, 0.1346781759761618, 0.21061118253192324, 0.051404289468221225, 0.00998378109637719, 0.2057301895411175, 0.1727642969430015, 0.021504300257938494, 0.18646630444741885, -0.15475621360804956, -0.03131417888639329, -0.18785049252591696, -0.18452043660210482, -0.19781204601334537, 0.045001261114405326, -0.12965142102732255, -0.2123795691640324, 0.3773393800443596, 0.18307553644842248, 0.1507551484521787, -0.0750492766727901, 0.2207965452934372, 0.10822268779342105, 0.11073673911582513, 0.020685344356094384, 0.33956688469584295, 0.2239928194351352, 0.20619938824219025, -0.2741994415498843, 0.09532237620312412, -0.02234963962369284] |
1,802.10392 | Non-magic Hypergraphs | This article studies a generalization of magic squares to $k$-uniform
hypergraphs. In traditional magic squares the entries come from the natural
numbers. A magic labeling of the vertices in a graph or hypergraph has since
been generalized to allow for labels coming from any abelian group. We
demonstrate an algorithm for determining whether a given hypergraph has a magic
labeling over some abelian group. A slight adjustment of this algorithm also
allows one to determine whether a given hypergraph can be magically labeled
over $\mathbb{Z}$. As a demonstration, we use these algorithms to determine the
number of magic $n_3$-configurations for $n=7, \dots, 14$.
| math.CO | this article studies a generalization of magic squares to kuniform hypergraphs in traditional magic squares the entries come from the natural numbers a magic labeling of the vertices in a graph or hypergraph has since been generalized to allow for labels coming from any abelian group we demonstrate an algorithm for determining whether a given hypergraph has a magic labeling over some abelian group a slight adjustment of this algorithm also allows one to determine whether a given hypergraph can be magically labeled over mathbbz as a demonstration we use these algorithms to determine the number of magic n_3configurations for n7 dots 14 | [['this', 'article', 'studies', 'a', 'generalization', 'of', 'magic', 'squares', 'to', 'kuniform', 'hypergraphs', 'in', 'traditional', 'magic', 'squares', 'the', 'entries', 'come', 'from', 'the', 'natural', 'numbers', 'a', 'magic', 'labeling', 'of', 'the', 'vertices', 'in', 'a', 'graph', 'or', 'hypergraph', 'has', 'since', 'been', 'generalized', 'to', 'allow', 'for', 'labels', 'coming', 'from', 'any', 'abelian', 'group', 'we', 'demonstrate', 'an', 'algorithm', 'for', 'determining', 'whether', 'a', 'given', 'hypergraph', 'has', 'a', 'magic', 'labeling', 'over', 'some', 'abelian', 'group', 'a', 'slight', 'adjustment', 'of', 'this', 'algorithm', 'also', 'allows', 'one', 'to', 'determine', 'whether', 'a', 'given', 'hypergraph', 'can', 'be', 'magically', 'labeled', 'over', 'mathbbz', 'as', 'a', 'demonstration', 'we', 'use', 'these', 'algorithms', 'to', 'determine', 'the', 'number', 'of', 'magic', 'n_3configurations', 'for', 'n7', 'dots', '14']] | [-0.08507229489109971, 0.09887960983349545, -0.06620600460982863, 0.073420086229567, -0.12728606224717462, -0.17942284719616758, 0.08628873800968423, 0.4107477241652269, -0.25584944540990845, -0.3560683172305717, 0.10743163222693564, -0.2682862293054224, -0.11248118693565987, 0.14124977252418724, -0.1477455792939473, 0.0313143964455116, 0.12919272367716808, 0.11816094535991878, -0.02424904442501857, -0.27508563058611746, 0.26800099043540804, -0.01634768033788229, 0.17555909604975478, 0.04279081547614552, 0.09824394245230246, 0.0324911597394841, 0.00913860923245403, 0.06886417763398997, -0.11335175820425444, 0.11654039012158618, 0.2722234088087491, 0.1674963187166106, 0.2969986265707834, -0.37530018754449546, -0.14616381389764593, 0.26840373342308926, 0.1591416421967248, 0.13518661710515836, 0.003664798400017853, -0.2408171927592918, 0.09641900607019517, -0.18772482105037747, -0.08235342309846744, -0.04742184443759969, 0.04102033367791377, 7.407215661277958e-05, -0.3077818012029371, -0.11080302528417259, 0.04606551298810005, 0.09204831118675465, 0.04072908642553432, -0.18809922131728016, 0.060013165099400224, 0.10474719845132865, -0.02619091167534683, 0.036806521300390804, 0.009032489220593489, -0.11230262530985854, -0.2133926129078164, 0.36620457530679074, -0.003543683202188535, -0.16050055619173995, 0.09657066266107209, -0.11197464819997549, -0.23457765202585826, 0.1404359607190332, 0.12393307295061794, 0.137123965457374, -0.04988549961754139, 0.08399002903195865, -0.1799796668849155, 0.17248061556807337, 0.11643108241625276, 0.008792394413795396, 0.1466932108023149, 0.14511659921731287, 0.13031391339723533, 0.17430737504379495, -0.053722184754031545, 0.019232480229773356, -0.2824428966086285, -0.14470743181585682, -0.24940801319647946, 0.1126219274512693, -0.09901430155150592, -0.20675272755233534, 0.42827346011558, 0.10612949089366286, 0.188920750940109, 0.059726340440558454, 0.22039617949585413, 0.036540248539691386, 0.08109085638916083, 0.0813536302131765, 0.14203115684972098, 0.20064574510230587, -0.05268099754546568, -0.14024792247858153, 0.0273526187725913, 0.13133838612074947] |
1,802.10393 | A Bayesian Model for Activities Recommendation and Event Structure
Optimization Using Visitors Tracking | In events that are composed by many activities, there is a problem that
involves retrieve and management the information of visitors that are visiting
the activities. This management is crucial to find some activities that are
drawing attention of visitors; identify an ideal positioning for activities;
which path is more frequented by visitors. In this work, these features are
studied using Complex Network theory. For the beginning, an artificial database
was generated to study the mentioned features. Secondly, this work shows a
method to optimize the event structure that is better than a random method and
a recommendation system that achieves ~95% of accuracy.
| cs.NE cs.AI cs.LG | in events that are composed by many activities there is a problem that involves retrieve and management the information of visitors that are visiting the activities this management is crucial to find some activities that are drawing attention of visitors identify an ideal positioning for activities which path is more frequented by visitors in this work these features are studied using complex network theory for the beginning an artificial database was generated to study the mentioned features secondly this work shows a method to optimize the event structure that is better than a random method and a recommendation system that achieves 95 of accuracy | [['in', 'events', 'that', 'are', 'composed', 'by', 'many', 'activities', 'there', 'is', 'a', 'problem', 'that', 'involves', 'retrieve', 'and', 'management', 'the', 'information', 'of', 'visitors', 'that', 'are', 'visiting', 'the', 'activities', 'this', 'management', 'is', 'crucial', 'to', 'find', 'some', 'activities', 'that', 'are', 'drawing', 'attention', 'of', 'visitors', 'identify', 'an', 'ideal', 'positioning', 'for', 'activities', 'which', 'path', 'is', 'more', 'frequented', 'by', 'visitors', 'in', 'this', 'work', 'these', 'features', 'are', 'studied', 'using', 'complex', 'network', 'theory', 'for', 'the', 'beginning', 'an', 'artificial', 'database', 'was', 'generated', 'to', 'study', 'the', 'mentioned', 'features', 'secondly', 'this', 'work', 'shows', 'a', 'method', 'to', 'optimize', 'the', 'event', 'structure', 'that', 'is', 'better', 'than', 'a', 'random', 'method', 'and', 'a', 'recommendation', 'system', 'that', 'achieves', '95', 'of', 'accuracy']] | [-0.1075632755024484, 0.07199823189456275, -0.07289606152559057, 0.0741163737268205, -0.10454803749095075, -0.12745116534642875, 0.03359551013944348, 0.43086153582239956, -0.21003617157335752, -0.33213895426776546, 0.10322517963896434, -0.3464529983063515, -0.20959373370099527, 0.2187780279245299, -0.10923454779325627, -0.013859150371550081, 0.09104775812011212, 0.08581136066081504, -0.01229795647220901, -0.27631021308703707, 0.29193408302335927, 0.09907193148795229, 0.2987293431786104, 0.021416682570886154, 0.06088233886447807, -0.014786452836303327, -0.04180593712729975, 0.006437942975585779, -0.06445335590517341, 0.1731653052254562, 0.31923844313132577, 0.19300007921321174, 0.3223098278641163, -0.37671876756044537, -0.23339853970817506, 0.06406762754956546, 0.1142752851323726, 0.06445265956006971, -0.06558704920084543, -0.2850380197006206, 0.13544741004835276, -0.16178581349623317, -0.09194425200649466, -0.07268784891885634, 0.03798380891720836, 0.008315818788944922, -0.2560456681654054, -0.001375640554425235, 0.06336115332893454, 0.0846397297976252, -0.019739738647611096, -0.049836494976681515, -0.00542999197764752, 0.2007665247253429, 0.02839289121150684, 0.04253526300733658, 0.14365642061546588, -0.14841478221933357, -0.14545259261201585, 0.3966688638767944, 0.018876959029512363, -0.17129913970935517, 0.1629169525202507, -0.0793460462636386, -0.1626671792115443, 0.13614727897556106, 0.19989125127008614, 0.10726714074665394, -0.22443174398022864, -0.012441961946583783, -0.061373013394096725, 0.17267928229053864, 0.04425924656914923, -0.0012810116794963295, 0.18218058562377756, 0.2163022251513142, 0.0801242190729961, 0.11962072774678326, -0.060827910367291994, -0.08876017858542931, -0.21285895383558595, -0.14912345812011224, -0.17325818976790358, 0.011135079029302757, -0.03612886120922317, -0.12922579486173794, 0.4057743281949885, 0.22323423093901232, 0.18637987571911743, 0.018747257157184113, 0.29044243223212945, 0.0671898638113187, 0.0694978378014639, 0.09493362955534114, 0.18612245314607906, -0.009215607898882948, 0.12889100188140917, -0.14333765520915712, 0.12129785609431565, 0.040420307292011924] |
1,802.10394 | Effects of quadratic coupling and squeezed vacuum injection in an
optomechanical cavity assisted with a Bose-Einstein condensate | We investigate theoretically a hybrid system consisting of a Bose-Einstein
condensate (BEC) trapped inside a laser driven membrane-in-the-middle
optomechanical cavity assisted with squeezed vacuum injection whose moving
membrane interacts both linearly and quadratically with the radiation pressure
of the cavity. It is shown that such a hybrid system is very suitable for
generating strong quadrature squeezing in the mechanical mode of the membrane
and the Bogoliubov mode of the BEC in the unresolved sideband regime. More
interestingly, by choosing a suitable sign for the quadratic optomechanical
coupling (QOC) one can achieve a very high degree of squeezing in the
mechanical mode and a strong entanglement between the mechanical and atomic
modes without the necessity of using squeezed light injection. Furthermore, the
QOC changes the effective oscillation frequencies of both the mechanical and
the atomic modes and affects their relaxation times. It can also make the
system switch form optical bistability to tristability
| quant-ph | we investigate theoretically a hybrid system consisting of a boseeinstein condensate bec trapped inside a laser driven membraneinthemiddle optomechanical cavity assisted with squeezed vacuum injection whose moving membrane interacts both linearly and quadratically with the radiation pressure of the cavity it is shown that such a hybrid system is very suitable for generating strong quadrature squeezing in the mechanical mode of the membrane and the bogoliubov mode of the bec in the unresolved sideband regime more interestingly by choosing a suitable sign for the quadratic optomechanical coupling qoc one can achieve a very high degree of squeezing in the mechanical mode and a strong entanglement between the mechanical and atomic modes without the necessity of using squeezed light injection furthermore the qoc changes the effective oscillation frequencies of both the mechanical and the atomic modes and affects their relaxation times it can also make the system switch form optical bistability to tristability | [['we', 'investigate', 'theoretically', 'a', 'hybrid', 'system', 'consisting', 'of', 'a', 'boseeinstein', 'condensate', 'bec', 'trapped', 'inside', 'a', 'laser', 'driven', 'membraneinthemiddle', 'optomechanical', 'cavity', 'assisted', 'with', 'squeezed', 'vacuum', 'injection', 'whose', 'moving', 'membrane', 'interacts', 'both', 'linearly', 'and', 'quadratically', 'with', 'the', 'radiation', 'pressure', 'of', 'the', 'cavity', 'it', 'is', 'shown', 'that', 'such', 'a', 'hybrid', 'system', 'is', 'very', 'suitable', 'for', 'generating', 'strong', 'quadrature', 'squeezing', 'in', 'the', 'mechanical', 'mode', 'of', 'the', 'membrane', 'and', 'the', 'bogoliubov', 'mode', 'of', 'the', 'bec', 'in', 'the', 'unresolved', 'sideband', 'regime', 'more', 'interestingly', 'by', 'choosing', 'a', 'suitable', 'sign', 'for', 'the', 'quadratic', 'optomechanical', 'coupling', 'qoc', 'one', 'can', 'achieve', 'a', 'very', 'high', 'degree', 'of', 'squeezing', 'in', 'the', 'mechanical', 'mode', 'and', 'a', 'strong', 'entanglement', 'between', 'the', 'mechanical', 'and', 'atomic', 'modes', 'without', 'the', 'necessity', 'of', 'using', 'squeezed', 'light', 'injection', 'furthermore', 'the', 'qoc', 'changes', 'the', 'effective', 'oscillation', 'frequencies', 'of', 'both', 'the', 'mechanical', 'and', 'the', 'atomic', 'modes', 'and', 'affects', 'their', 'relaxation', 'times', 'it', 'can', 'also', 'make', 'the', 'system', 'switch', 'form', 'optical', 'bistability', 'to', 'tristability']] | [-0.21189503394845433, 0.25476858272878944, -0.06671400926547665, -0.013851011119473506, -0.02039796676782364, -0.205856121932524, 0.06734134737952875, 0.36698378463992604, -0.2642892174557538, -0.23974213689430862, 0.03784715186262283, -0.23694900356502713, -0.09763736563342575, 0.23174700746006383, 0.011885079582019611, 0.07898477135275148, 0.0480296853301728, 0.000765228967219101, 0.012990624326783674, -0.14900324976157495, 0.29367684401222505, 0.05082671923599647, 0.3344233349995001, 0.024985576930798982, 0.14165394879589593, -0.007510842274457805, 0.11134854309861303, -0.0197669345775227, -0.08202507457793361, 0.08383424667375182, 0.18826068545183117, 0.015534550172129744, 0.2875977526250369, -0.4402516825663808, -0.1908724902467312, 0.09891850629432347, 0.15823539231572986, 0.1949244576175452, -0.03566047964254961, -0.26554376124649454, -0.027401448628025765, -0.1580864314418202, -0.13827621020180614, -0.10099666804461249, -0.015169790176993334, 0.022872843600405184, -0.27366476836246684, 0.0703876657035404, 0.05503000875346755, 0.03862968968889235, -0.05448569141567292, 0.005959606906368495, -0.038217095952284966, 0.04780689934820035, -0.022536457991104965, 0.008246689713192418, 0.21445376347860715, -0.17458101707215015, -0.04638654406268248, 0.38004007686762825, -0.13896801743785067, -0.16683657947731645, 0.1867548650204155, -0.13848646405140722, 0.015390497862091778, 0.13110074975013145, 0.12601709685680507, 0.08027610793329873, -0.11041150177142729, 0.023287651181913373, 0.016787740849203578, 0.23642144145100916, 0.14236674258656995, 0.14196347975551984, 0.25224038165699886, 0.17327150434108549, 0.0379186720728237, 0.22657228070066163, -0.0814049941224144, -0.07831371854071652, -0.26971080198602165, -0.12265298841214788, -0.19005310162155134, 0.0424426301515747, -0.0921921363557263, -0.15238375892295153, 0.4080044594700571, 0.08401052037707384, 0.12245742836660754, -0.02386855424112199, 0.3307463689584677, 0.16010100347921252, 0.06381417807700161, 0.016411080064962766, 0.36643985265522805, 0.15504533460051262, 0.08821385489825748, -0.3844200255116448, -0.04136636131443083, -0.04622631636141848] |
1,802.10395 | Turbulent channel flow perturbed by triangular ripples | This paper presents an experimental investigation of the perturbation of a
turbulent closed-conduit flow by two-dimensional triangular ripples. Two ripple
configurations were employed: one single asymmetric triangular ripple, and two
consecutive asymmetric triangular ripples, all of them with the same geometry.
Different water flows were imposed over either one or two ripples fixed to the
bottom wall of a closed conduit, and the flow field was measured by PIV
(particle image velocimetry). Reynolds numbers based on the channel height were
moderate, varying between 27500 and 34700. The regime was hydraulically smooth,
and the blockage ratio was significant. Experimental data for this specific
case remain scarce, and the physics involved has yet to be fully elucidated.
Using the instantaneous flow fields, the mean velocities and fluctuations were
computed, and the shear stresses over the ripples were determined. The
velocities and stresses obtained in this way for the single ripple and for the
pair of ripples are compared, and the surface shear stress is discussed in
terms of bed stability. Our results show that for the single and upstream
ripples the shear stress increases at the leading edge and decreases toward the
crest, while for the downstream ripple it decreases monotonically between the
reattachment point and the crest. The stress distribution over the downstream
ripple, which is different from both the upstream and single ripples, is shown
to sustain existing ripples over loose beds.
| physics.flu-dyn | this paper presents an experimental investigation of the perturbation of a turbulent closedconduit flow by twodimensional triangular ripples two ripple configurations were employed one single asymmetric triangular ripple and two consecutive asymmetric triangular ripples all of them with the same geometry different water flows were imposed over either one or two ripples fixed to the bottom wall of a closed conduit and the flow field was measured by piv particle image velocimetry reynolds numbers based on the channel height were moderate varying between 27500 and 34700 the regime was hydraulically smooth and the blockage ratio was significant experimental data for this specific case remain scarce and the physics involved has yet to be fully elucidated using the instantaneous flow fields the mean velocities and fluctuations were computed and the shear stresses over the ripples were determined the velocities and stresses obtained in this way for the single ripple and for the pair of ripples are compared and the surface shear stress is discussed in terms of bed stability our results show that for the single and upstream ripples the shear stress increases at the leading edge and decreases toward the crest while for the downstream ripple it decreases monotonically between the reattachment point and the crest the stress distribution over the downstream ripple which is different from both the upstream and single ripples is shown to sustain existing ripples over loose beds | [['this', 'paper', 'presents', 'an', 'experimental', 'investigation', 'of', 'the', 'perturbation', 'of', 'a', 'turbulent', 'closedconduit', 'flow', 'by', 'twodimensional', 'triangular', 'ripples', 'two', 'ripple', 'configurations', 'were', 'employed', 'one', 'single', 'asymmetric', 'triangular', 'ripple', 'and', 'two', 'consecutive', 'asymmetric', 'triangular', 'ripples', 'all', 'of', 'them', 'with', 'the', 'same', 'geometry', 'different', 'water', 'flows', 'were', 'imposed', 'over', 'either', 'one', 'or', 'two', 'ripples', 'fixed', 'to', 'the', 'bottom', 'wall', 'of', 'a', 'closed', 'conduit', 'and', 'the', 'flow', 'field', 'was', 'measured', 'by', 'piv', 'particle', 'image', 'velocimetry', 'reynolds', 'numbers', 'based', 'on', 'the', 'channel', 'height', 'were', 'moderate', 'varying', 'between', '27500', 'and', '34700', 'the', 'regime', 'was', 'hydraulically', 'smooth', 'and', 'the', 'blockage', 'ratio', 'was', 'significant', 'experimental', 'data', 'for', 'this', 'specific', 'case', 'remain', 'scarce', 'and', 'the', 'physics', 'involved', 'has', 'yet', 'to', 'be', 'fully', 'elucidated', 'using', 'the', 'instantaneous', 'flow', 'fields', 'the', 'mean', 'velocities', 'and', 'fluctuations', 'were', 'computed', 'and', 'the', 'shear', 'stresses', 'over', 'the', 'ripples', 'were', 'determined', 'the', 'velocities', 'and', 'stresses', 'obtained', 'in', 'this', 'way', 'for', 'the', 'single', 'ripple', 'and', 'for', 'the', 'pair', 'of', 'ripples', 'are', 'compared', 'and', 'the', 'surface', 'shear', 'stress', 'is', 'discussed', 'in', 'terms', 'of', 'bed', 'stability', 'our', 'results', 'show', 'that', 'for', 'the', 'single', 'and', 'upstream', 'ripples', 'the', 'shear', 'stress', 'increases', 'at', 'the', 'leading', 'edge', 'and', 'decreases', 'toward', 'the', 'crest', 'while', 'for', 'the', 'downstream', 'ripple', 'it', 'decreases', 'monotonically', 'between', 'the', 'reattachment', 'point', 'and', 'the', 'crest', 'the', 'stress', 'distribution', 'over', 'the', 'downstream', 'ripple', 'which', 'is', 'different', 'from', 'both', 'the', 'upstream', 'and', 'single', 'ripples', 'is', 'shown', 'to', 'sustain', 'existing', 'ripples', 'over', 'loose', 'beds']] | [-0.15773920729256571, 0.20194291499909264, -0.06535850205069312, 0.009936462905145538, -0.0056617996737698155, -0.09572730651065096, -0.03192343457616015, 0.3695729221699053, -0.3014333995324078, -0.29503069725690473, 0.09865293624421485, -0.26796110003789214, -0.0998764037654398, 0.2044515695181025, -0.011329333485577834, 0.06968805846245546, 0.04380667495896542, 0.009209079139038985, -0.024215648563454283, -0.20699542173754487, 0.26452152655010336, 0.07479529821309903, 0.3684725499579458, 0.08091462149579833, 0.07389106726372245, -0.03223034083955632, -0.025444557900331784, 0.07096888158775982, -0.17181794607027956, 0.044682436702965664, 0.16122182801161122, -0.021503014514094282, 0.22078060633944477, -0.48852588238740535, -0.22963846273367003, 0.01300975977009612, 0.13413894067092896, 0.11902507140796936, -0.020372988369641024, -0.24678391360593477, 0.10398791488741749, -0.11692351542848789, -0.09240206284448504, 0.011101219644529167, 0.02016988355171634, 0.0691466755592485, -0.24901154630913816, 0.12402426088750683, 0.034504056059161264, 0.11051340141044609, -0.08058540242250431, -0.1071477964428125, -0.10433306645477544, 0.14226477215736943, 0.08761139036405124, 0.04953974268686705, 0.19644807795150976, -0.15083211560027096, -0.030063185278840106, 0.3655933484892714, -0.05589416594814573, -0.1948305188420034, 0.19715656719601046, -0.1658297005683537, -0.020068352360199083, 0.19907050529506926, 0.17547897280771926, 0.06917429793649152, -0.09004307686600127, -0.03294709717387189, -0.038870103428429316, 0.11512287176359176, 0.15959234251279447, -0.07121011969163725, 0.24884279940983858, 0.1506309130812136, 0.05863744557377529, 0.15519837949977955, -0.17861786125549456, -0.073128956405181, -0.28313464175203235, -0.12065350604926012, -0.13476243634419194, -0.02379013766466383, -0.09470533938982609, -0.16377484433366496, 0.40655817606502437, 0.07244602608669334, 0.19376001241145221, 0.035801547136386565, 0.2951683599265003, 0.08883492008166725, 0.08217933909678511, 0.10313320145861984, 0.283807783632475, 0.12215609459712266, 0.1311315343632957, -0.20411787559840314, 0.08488229922508693, 0.0031327975277612306] |
1,802.10396 | Black Hole Lattices Under the Microscope | It is known how to choose initial data for Einstein's equations describing an
arbitrary number of black holes at a moment of time symmetry. This idea has
been used to give insight into the cosmological averaging problem. We study the
local curvature of the initial data space, for configurations of 8, 120, or 600
black holes obtained by choosing points either regularly or randomly on the
3-sphere. We conclude that the asymptotic regions are remarkably close to that
of Schwarzschild, while the region in between shows interesting behaviour. The
cosmological back reaction as defined in the recent literature is actually a
bit smaller for the random configurations.
| gr-qc | it is known how to choose initial data for einsteins equations describing an arbitrary number of black holes at a moment of time symmetry this idea has been used to give insight into the cosmological averaging problem we study the local curvature of the initial data space for configurations of 8 120 or 600 black holes obtained by choosing points either regularly or randomly on the 3sphere we conclude that the asymptotic regions are remarkably close to that of schwarzschild while the region in between shows interesting behaviour the cosmological back reaction as defined in the recent literature is actually a bit smaller for the random configurations | [['it', 'is', 'known', 'how', 'to', 'choose', 'initial', 'data', 'for', 'einsteins', 'equations', 'describing', 'an', 'arbitrary', 'number', 'of', 'black', 'holes', 'at', 'a', 'moment', 'of', 'time', 'symmetry', 'this', 'idea', 'has', 'been', 'used', 'to', 'give', 'insight', 'into', 'the', 'cosmological', 'averaging', 'problem', 'we', 'study', 'the', 'local', 'curvature', 'of', 'the', 'initial', 'data', 'space', 'for', 'configurations', 'of', '8', '120', 'or', '600', 'black', 'holes', 'obtained', 'by', 'choosing', 'points', 'either', 'regularly', 'or', 'randomly', 'on', 'the', '3sphere', 'we', 'conclude', 'that', 'the', 'asymptotic', 'regions', 'are', 'remarkably', 'close', 'to', 'that', 'of', 'schwarzschild', 'while', 'the', 'region', 'in', 'between', 'shows', 'interesting', 'behaviour', 'the', 'cosmological', 'back', 'reaction', 'as', 'defined', 'in', 'the', 'recent', 'literature', 'is', 'actually', 'a', 'bit', 'smaller', 'for', 'the', 'random', 'configurations']] | [-0.13938701453087765, 0.10526321254462269, -0.09458880312115206, 0.10135900965243334, -0.05557300934620271, -0.12320779219583095, 0.03622700132388256, 0.33432591542880113, -0.22529386977499752, -0.339186901696653, 0.11085898253117975, -0.28367660300388375, -0.07716376276112327, 0.19015091042378135, -0.035442473090778186, 0.022772358169030643, 0.02142083317380851, 0.07441017781950046, -0.06695872292718981, -0.2795424094754402, 0.35652850508237277, 0.06944999529623261, 0.23694135208622874, -0.02920159312818095, 0.1022355483396623, -0.01685892836034089, 0.0011158831184729934, 0.04066873256037682, -0.16365899604804504, 0.056106924086974534, 0.20816870099455814, 0.12127417681312241, 0.2516103646996492, -0.4264441666097563, -0.21149603243825835, 0.09303377319027226, 0.1673669001505336, 0.15289987212647554, -0.07008270000947517, -0.274225511283518, 0.10606305690255956, -0.12236447130965296, -0.1621660661935876, -0.027196976591214957, 0.06512426498789932, -0.013906865707646498, -0.2501633834816237, 0.04172837630645416, 0.0447386565278763, -0.015029720528210104, -0.07742683637765384, -0.10178993940114035, -0.026498964069428567, 0.1260890291968935, 0.11433155529383814, 0.05100291977755107, 0.12194882358628908, -0.07281168273684925, -0.07369237258664776, 0.3686753997109204, -0.02477075927238041, -0.20651313110916206, 0.1440280330254235, -0.18152360578511503, -0.11427170375936499, 0.12753275566011946, 0.14269827984743447, 0.13482505493040117, -0.13339806412929825, 0.09337300802015255, -0.03151260557036116, 0.15564540406323482, 0.10957148601083416, 0.0159896592322354, 0.26884169891372184, 0.11079230537272503, 0.06148455080480498, 0.1490791733844519, -0.05917885002819386, -0.12385559528543849, -0.28515448689321493, -0.11798555592605932, -0.18652330399229775, 0.09970230093904744, -0.15404130984968115, -0.15324653931414692, 0.3490864647700338, 0.10796192436365881, 0.2473520087513411, 0.0358813390501331, 0.24337063194830547, 0.053087596952366846, 0.0355659604559992, 0.07853718091098365, 0.2696494365668046, 0.10024256595392998, 0.11268943097990737, -0.18060631378962894, 0.022172875559853963, 0.07054573213942697] |
1,802.10397 | Continued Brightening of the Afterglow of GW170817/GRB 170817A as due to
a Delayed Energy Injection | The brightness of the multi-wavelength afterglow of GRB 170817A is increasing
unexpectedly even $\sim$ 160 days after the associated gravitational burst.
Here we suggest that the brightening can be caused by a late-time energy
injection process. We use an empirical expression to mimic the evolution of the
injection luminosity, which is consisted of a power-law rising phase and a
power-law decreasing phase. It is found that the power-law indices of the two
phases are $0.92$ and $-2.8$, respectively, with the peak time of the injection
being $\sim 110$ days. The energy injection could be due to some kind of
accretion, with the total accreted mass being $\sim 0.006 M_\odot$. However,
normal fall-back accretion, which usually lasts for a much shorter period,
cannot provide a natural explanation. Our best-fit decaying index of $-2.8$ is
also at odds with the expected value of $-5/3$ for normal fall-back accretion.
Noting that the expansion velocities of the kilonova components associated with
GW170817 is $0.1-0.3\,c$, we argue that there should also be some ejecta with
correspondingly lower velocities during the coalescence of the double neutron
star system. They are bound by the gravitational well of the remnant central
compact object and might be accreted at a timescale of about 100 days,
providing a reasonable explanation for the energy injection. Detailed studies
on the long-lasting brightening of GRB 170817A thus may provide useful
information on the matter ejection during the merger process of binary neutron
stars.
| astro-ph.HE | the brightness of the multiwavelength afterglow of grb 170817a is increasing unexpectedly even sim 160 days after the associated gravitational burst here we suggest that the brightening can be caused by a latetime energy injection process we use an empirical expression to mimic the evolution of the injection luminosity which is consisted of a powerlaw rising phase and a powerlaw decreasing phase it is found that the powerlaw indices of the two phases are 092 and 28 respectively with the peak time of the injection being sim 110 days the energy injection could be due to some kind of accretion with the total accreted mass being sim 0006 m_odot however normal fallback accretion which usually lasts for a much shorter period cannot provide a natural explanation our bestfit decaying index of 28 is also at odds with the expected value of 53 for normal fallback accretion noting that the expansion velocities of the kilonova components associated with gw170817 is 0103c we argue that there should also be some ejecta with correspondingly lower velocities during the coalescence of the double neutron star system they are bound by the gravitational well of the remnant central compact object and might be accreted at a timescale of about 100 days providing a reasonable explanation for the energy injection detailed studies on the longlasting brightening of grb 170817a thus may provide useful information on the matter ejection during the merger process of binary neutron stars | [['the', 'brightness', 'of', 'the', 'multiwavelength', 'afterglow', 'of', 'grb', '170817a', 'is', 'increasing', 'unexpectedly', 'even', 'sim', '160', 'days', 'after', 'the', 'associated', 'gravitational', 'burst', 'here', 'we', 'suggest', 'that', 'the', 'brightening', 'can', 'be', 'caused', 'by', 'a', 'latetime', 'energy', 'injection', 'process', 'we', 'use', 'an', 'empirical', 'expression', 'to', 'mimic', 'the', 'evolution', 'of', 'the', 'injection', 'luminosity', 'which', 'is', 'consisted', 'of', 'a', 'powerlaw', 'rising', 'phase', 'and', 'a', 'powerlaw', 'decreasing', 'phase', 'it', 'is', 'found', 'that', 'the', 'powerlaw', 'indices', 'of', 'the', 'two', 'phases', 'are', '092', 'and', '28', 'respectively', 'with', 'the', 'peak', 'time', 'of', 'the', 'injection', 'being', 'sim', '110', 'days', 'the', 'energy', 'injection', 'could', 'be', 'due', 'to', 'some', 'kind', 'of', 'accretion', 'with', 'the', 'total', 'accreted', 'mass', 'being', 'sim', '0006', 'm_odot', 'however', 'normal', 'fallback', 'accretion', 'which', 'usually', 'lasts', 'for', 'a', 'much', 'shorter', 'period', 'can', 'not', 'provide', 'a', 'natural', 'explanation', 'our', 'bestfit', 'decaying', 'index', 'of', '28', 'is', 'also', 'at', 'odds', 'with', 'the', 'expected', 'value', 'of', '53', 'for', 'normal', 'fallback', 'accretion', 'noting', 'that', 'the', 'expansion', 'velocities', 'of', 'the', 'kilonova', 'components', 'associated', 'with', 'gw170817', 'is', '0103c', 'we', 'argue', 'that', 'there', 'should', 'also', 'be', 'some', 'ejecta', 'with', 'correspondingly', 'lower', 'velocities', 'during', 'the', 'coalescence', 'of', 'the', 'double', 'neutron', 'star', 'system', 'they', 'are', 'bound', 'by', 'the', 'gravitational', 'well', 'of', 'the', 'remnant', 'central', 'compact', 'object', 'and', 'might', 'be', 'accreted', 'at', 'a', 'timescale', 'of', 'about', '100', 'days', 'providing', 'a', 'reasonable', 'explanation', 'for', 'the', 'energy', 'injection', 'detailed', 'studies', 'on', 'the', 'longlasting', 'brightening', 'of', 'grb', '170817a', 'thus', 'may', 'provide', 'useful', 'information', 'on', 'the', 'matter', 'ejection', 'during', 'the', 'merger', 'process', 'of', 'binary', 'neutron', 'stars']] | [-0.1015148239994723, 0.21020034644628355, -0.10674958073058749, 0.12042059689522366, -0.11469717596124286, -0.09642387558880003, 0.047832750116331944, 0.3996442954917728, -0.1877191224564408, -0.3519055599972791, 0.10044202923821093, -0.2963291143619792, -0.021450759134838876, 0.24328040199028714, -0.02558515112870276, -0.03888879295368969, 0.09733375752416219, -0.009221367691344044, -0.09626526690012857, -0.22093687428613637, 0.2664447112310353, 0.11174017495448658, 0.17023989371641413, 0.022759462832337964, 0.05949193709510614, -0.08150042208781767, -0.022513331420921538, -0.06936730057603961, -0.13505565148502438, -0.004926973084834137, 0.17154392863418985, 0.13012723001956755, 0.20774706748325794, -0.39667731044327076, -0.22339344238021885, 0.10802982100942539, 0.15913210633013752, 0.02059364334981564, -0.06899643592880382, -0.24557299914729253, 0.080325595218895, -0.26250231208248814, -0.14437072791731084, 0.06214063473555928, 0.09219832260633096, 0.01789653269599165, -0.22752312844652003, 0.16357683155422884, 0.056018817399124156, 0.0164441333589032, -0.11431068807929229, -0.034546037163504274, -0.0595564417776756, 0.010742548356582391, 0.1250024555464511, 0.08349013587515956, 0.1558719517368943, -0.1139898923113633, -0.04447808798742616, 0.393272416967574, -0.05862015377753318, 0.015357474048710833, 0.17700722317029702, -0.19246168444576794, -0.12131204699548695, 0.22457140992314428, 0.11826844703931655, 0.0732501360599369, -0.12684870753205416, -0.06658483207630596, 0.021197758831423844, 0.2166751704277293, 0.06249054579288386, 0.047949753762551305, 0.3536583999040463, 0.16876467393471617, -0.0007837520126667342, 0.08990530980291053, -0.19060037809852085, -0.027925731910825456, -0.2846694190549776, -0.11479947152687624, -0.14452425269308575, 0.14624346584219078, -0.15892312271479195, -0.10104594126303151, 0.38465906386708076, 0.07857846204651311, 0.22220636813232822, 0.051086828530924513, 0.2606672226022388, 0.1559213515727576, 0.06521902877347847, 0.13113457111243731, 0.32303474940619475, 0.12277463860075566, 0.10736037064459623, -0.20844439765307046, 0.1388672713549707, -0.012124793426253489] |
1,802.10398 | How efficient is transport of quantum cargo through multiple highways? | Quantum states can be efficiently transferred over a long distance if the
entire quantum channel can be divided into several small blocks. We consider a
scenario in which each block consists of two copies of a multiparty state --
one is used for distributing an arbitrary quantum state to multiple parties
while the other channel is required to concentrate it back to a single party.
Both in noiseless and local noisy scenarios, we find one-shot quantum
capacities of these channels in terms of fidelity, when the initial shared
states in each block are the generalized Greenberger-Horne-Zeilinger and the
generalized W states. We also consider a situation where optimal local
measurements transform multipartite states to bipartite ones which can then be
used as single-path channels for quantum state transmission in each segment. We
show that in some parameter ranges, the former protocol provides strictly
better fidelities than that of the latter, thereby establishing the importance
of distributing and concentrating arbitrary quantum states via multipartite
entangled states in long distance quantum communication, over the local
measurement based protocol. Moreover, we show that in presence of bit flip or
bit-phase flip noise, shared generalized Greenberger-Horne-Zeilinger states
possess an inherent noise detection and correction mechanism, leading to the
same fidelity as in the noiseless case. We consider further noise models also,
which do not enjoy the same mechanism. In addition to the fidelity based
advantages, the multipath scheme is shown to be useful when one considers a
situation in which the completion of the teleportation needs to be delayed. We
also find the efficiencies of a quantum channel when a quantum state is
transferred over long distances and the entire channel is divided into several
small blocks.
| quant-ph | quantum states can be efficiently transferred over a long distance if the entire quantum channel can be divided into several small blocks we consider a scenario in which each block consists of two copies of a multiparty state one is used for distributing an arbitrary quantum state to multiple parties while the other channel is required to concentrate it back to a single party both in noiseless and local noisy scenarios we find oneshot quantum capacities of these channels in terms of fidelity when the initial shared states in each block are the generalized greenbergerhornezeilinger and the generalized w states we also consider a situation where optimal local measurements transform multipartite states to bipartite ones which can then be used as singlepath channels for quantum state transmission in each segment we show that in some parameter ranges the former protocol provides strictly better fidelities than that of the latter thereby establishing the importance of distributing and concentrating arbitrary quantum states via multipartite entangled states in long distance quantum communication over the local measurement based protocol moreover we show that in presence of bit flip or bitphase flip noise shared generalized greenbergerhornezeilinger states possess an inherent noise detection and correction mechanism leading to the same fidelity as in the noiseless case we consider further noise models also which do not enjoy the same mechanism in addition to the fidelity based advantages the multipath scheme is shown to be useful when one considers a situation in which the completion of the teleportation needs to be delayed we also find the efficiencies of a quantum channel when a quantum state is transferred over long distances and the entire channel is divided into several small blocks | [['quantum', 'states', 'can', 'be', 'efficiently', 'transferred', 'over', 'a', 'long', 'distance', 'if', 'the', 'entire', 'quantum', 'channel', 'can', 'be', 'divided', 'into', 'several', 'small', 'blocks', 'we', 'consider', 'a', 'scenario', 'in', 'which', 'each', 'block', 'consists', 'of', 'two', 'copies', 'of', 'a', 'multiparty', 'state', 'one', 'is', 'used', 'for', 'distributing', 'an', 'arbitrary', 'quantum', 'state', 'to', 'multiple', 'parties', 'while', 'the', 'other', 'channel', 'is', 'required', 'to', 'concentrate', 'it', 'back', 'to', 'a', 'single', 'party', 'both', 'in', 'noiseless', 'and', 'local', 'noisy', 'scenarios', 'we', 'find', 'oneshot', 'quantum', 'capacities', 'of', 'these', 'channels', 'in', 'terms', 'of', 'fidelity', 'when', 'the', 'initial', 'shared', 'states', 'in', 'each', 'block', 'are', 'the', 'generalized', 'greenbergerhornezeilinger', 'and', 'the', 'generalized', 'w', 'states', 'we', 'also', 'consider', 'a', 'situation', 'where', 'optimal', 'local', 'measurements', 'transform', 'multipartite', 'states', 'to', 'bipartite', 'ones', 'which', 'can', 'then', 'be', 'used', 'as', 'singlepath', 'channels', 'for', 'quantum', 'state', 'transmission', 'in', 'each', 'segment', 'we', 'show', 'that', 'in', 'some', 'parameter', 'ranges', 'the', 'former', 'protocol', 'provides', 'strictly', 'better', 'fidelities', 'than', 'that', 'of', 'the', 'latter', 'thereby', 'establishing', 'the', 'importance', 'of', 'distributing', 'and', 'concentrating', 'arbitrary', 'quantum', 'states', 'via', 'multipartite', 'entangled', 'states', 'in', 'long', 'distance', 'quantum', 'communication', 'over', 'the', 'local', 'measurement', 'based', 'protocol', 'moreover', 'we', 'show', 'that', 'in', 'presence', 'of', 'bit', 'flip', 'or', 'bitphase', 'flip', 'noise', 'shared', 'generalized', 'greenbergerhornezeilinger', 'states', 'possess', 'an', 'inherent', 'noise', 'detection', 'and', 'correction', 'mechanism', 'leading', 'to', 'the', 'same', 'fidelity', 'as', 'in', 'the', 'noiseless', 'case', 'we', 'consider', 'further', 'noise', 'models', 'also', 'which', 'do', 'not', 'enjoy', 'the', 'same', 'mechanism', 'in', 'addition', 'to', 'the', 'fidelity', 'based', 'advantages', 'the', 'multipath', 'scheme', 'is', 'shown', 'to', 'be', 'useful', 'when', 'one', 'considers', 'a', 'situation', 'in', 'which', 'the', 'completion', 'of', 'the', 'teleportation', 'needs', 'to', 'be', 'delayed', 'we', 'also', 'find', 'the', 'efficiencies', 'of', 'a', 'quantum', 'channel', 'when', 'a', 'quantum', 'state', 'is', 'transferred', 'over', 'long', 'distances', 'and', 'the', 'entire', 'channel', 'is', 'divided', 'into', 'several', 'small', 'blocks']] | [-0.15799274393613286, 0.16805221408645618, -0.07036004246192727, 0.05031353860079222, 0.013806908975969603, -0.24336354540502456, 0.0739256974568934, 0.3607373517336892, -0.30684266286135936, -0.24536064542427077, 0.08922291582397429, -0.23426121570077454, -0.08894415959098265, 0.18887323726105656, -0.0745722778085355, 0.07614609270013128, 0.07557066325973455, 0.07226192632174873, -0.05192086807409209, -0.2981080242506136, 0.29720602949407504, 0.02337451803445129, 0.305252467685029, 0.025470707964433643, 0.09093498552535126, 0.04516194166668446, 0.03312511468497732, -0.01353345424471859, -0.06014127787224786, 0.06458698596878816, 0.2856974224103409, 0.13092193219658807, 0.2611203458530049, -0.4313978926073892, -0.2297053059153523, 0.14001798416910602, 0.13896343475603995, 0.17533842527145743, 0.005846295564382581, -0.3088079497105845, 0.0755991713095998, -0.20398769692801838, -0.03827766606795555, -0.04196424063308336, -0.02371309862095625, -0.03768374521102829, -0.29176893327979647, 0.07607406735057358, 0.050377392561582794, -0.04692446761797612, -0.0034446100017438966, -0.0643929953493693, 0.01204895791729767, 0.1785889330586536, -0.05461353459601878, -0.006388355838300013, 0.10551268889912213, -0.127869027357958, -0.1575352819652977, 0.345588503735708, -0.04204919817305297, -0.24062635908679417, 0.15446942215554205, -0.10908197348438706, -0.09603897200943572, 0.07116309302039148, 0.1557736326684409, 0.09694135504100201, -0.13150454022097427, 0.02344163078447335, -0.031029902230568417, 0.19747789773152125, 0.056870552171219856, 0.15999367867979544, 0.16954138020552192, 0.08578354382890785, 0.1111019912633239, 0.21726392253268187, -0.09130759924115177, -0.1712943849167027, -0.2907237925796674, -0.2064763609929248, -0.219823380727453, 0.07647153836554652, -0.06457811871894217, -0.09469857487275599, 0.40365156865185564, 0.1205912318038556, 0.21767271885810197, 0.02492019386486487, 0.3155473845660792, 0.08730836352870093, 0.07039244529454315, 0.12370724663970635, 0.20897531672762723, 0.12681245889204243, 0.030731056606750407, -0.19908474442377316, 0.08917442387868221, -0.006995070207177113] |
1,802.10399 | Compressing Neural Networks using the Variational Information Bottleneck | Neural networks can be compressed to reduce memory and computational
requirements, or to increase accuracy by facilitating the use of a larger base
architecture. In this paper we focus on pruning individual neurons, which can
simultaneously trim model size, FLOPs, and run-time memory. To improve upon the
performance of existing compression algorithms we utilize the information
bottleneck principle instantiated via a tractable variational bound.
Minimization of this information theoretic bound reduces the redundancy between
adjacent layers by aggregating useful information into a subset of neurons that
can be preserved. In contrast, the activations of disposable neurons are shut
off via an attractive form of sparse regularization that emerges naturally from
this framework, providing tangible advantages over traditional sparsity
penalties without contributing additional tuning parameters to the energy
landscape. We demonstrate state-of-the-art compression rates across an array of
datasets and network architectures.
| cs.CV | neural networks can be compressed to reduce memory and computational requirements or to increase accuracy by facilitating the use of a larger base architecture in this paper we focus on pruning individual neurons which can simultaneously trim model size flops and runtime memory to improve upon the performance of existing compression algorithms we utilize the information bottleneck principle instantiated via a tractable variational bound minimization of this information theoretic bound reduces the redundancy between adjacent layers by aggregating useful information into a subset of neurons that can be preserved in contrast the activations of disposable neurons are shut off via an attractive form of sparse regularization that emerges naturally from this framework providing tangible advantages over traditional sparsity penalties without contributing additional tuning parameters to the energy landscape we demonstrate stateoftheart compression rates across an array of datasets and network architectures | [['neural', 'networks', 'can', 'be', 'compressed', 'to', 'reduce', 'memory', 'and', 'computational', 'requirements', 'or', 'to', 'increase', 'accuracy', 'by', 'facilitating', 'the', 'use', 'of', 'a', 'larger', 'base', 'architecture', 'in', 'this', 'paper', 'we', 'focus', 'on', 'pruning', 'individual', 'neurons', 'which', 'can', 'simultaneously', 'trim', 'model', 'size', 'flops', 'and', 'runtime', 'memory', 'to', 'improve', 'upon', 'the', 'performance', 'of', 'existing', 'compression', 'algorithms', 'we', 'utilize', 'the', 'information', 'bottleneck', 'principle', 'instantiated', 'via', 'a', 'tractable', 'variational', 'bound', 'minimization', 'of', 'this', 'information', 'theoretic', 'bound', 'reduces', 'the', 'redundancy', 'between', 'adjacent', 'layers', 'by', 'aggregating', 'useful', 'information', 'into', 'a', 'subset', 'of', 'neurons', 'that', 'can', 'be', 'preserved', 'in', 'contrast', 'the', 'activations', 'of', 'disposable', 'neurons', 'are', 'shut', 'off', 'via', 'an', 'attractive', 'form', 'of', 'sparse', 'regularization', 'that', 'emerges', 'naturally', 'from', 'this', 'framework', 'providing', 'tangible', 'advantages', 'over', 'traditional', 'sparsity', 'penalties', 'without', 'contributing', 'additional', 'tuning', 'parameters', 'to', 'the', 'energy', 'landscape', 'we', 'demonstrate', 'stateoftheart', 'compression', 'rates', 'across', 'an', 'array', 'of', 'datasets', 'and', 'network', 'architectures']] | [-0.10032714239539618, 0.06505170600767023, -0.041258103078799256, 0.04854849683771451, -0.10998368282729747, -0.18795273420632097, 0.12476356407538294, 0.4146701090701638, -0.34335643976451236, -0.3399230586496968, 0.07056787933044611, -0.2212207498266659, -0.17959250780053648, 0.15960048718694994, -0.1353044063876654, 0.0472763646385758, 0.12126295495586774, 0.027752400560846144, -0.08293742861711018, -0.3063790549421749, 0.24508558890405804, 0.09426686257546675, 0.3397294651941522, 0.02925801736216807, 0.10167400103643642, -0.009846833407390097, 0.013048334933936279, 0.006915375262545091, -0.05726063023339908, 0.20298912824653353, 0.28650951817968584, 0.18966858556860702, 0.33579034827226867, -0.5230288867382927, -0.2539383697815583, 0.10608246745640769, 0.19164528853279797, 0.09046864300870901, 0.013790913687437668, -0.27250884928747166, 0.0882718571583932, -0.17682063000620152, 0.008510769473666207, -0.13860220513603788, -0.08917028217160321, 0.026674453083240818, -0.30341012034637865, 0.050071775431064426, 0.0789642711034819, 0.013778731215362114, -0.014647705827225396, -0.11038030266550415, 0.008416911480611468, 0.13592085847796226, 0.022383244079867946, 0.033952868597231914, 0.16765891895332236, -0.16095807876748344, -0.11195434714132484, 0.28781857718680554, -0.040203527106527, -0.21403648921021043, 0.16813950778929687, 0.011769243882612345, -0.11200525315564311, 0.14415458001936157, 0.23470600925927573, 0.0461415222231695, -0.15384034503330576, 0.056025741199536766, 0.016010174375846453, 0.21485815025496144, 0.10159087867033503, 0.08568830216379426, 0.1542473314742802, 0.2583585375431159, 0.08569887117978106, 0.19297208793210327, -0.07711285140847536, -0.07795467652737144, -0.22550146399950938, -0.10449818878001962, -0.19767320290181442, -0.00551070772435067, -0.1557896445033261, -0.0822580679466763, 0.3789296990115169, 0.1786505096948686, 0.21312045960204926, 0.11448068552421808, 0.36776399233292606, 0.05095162919346005, 0.17877363046657638, 0.11688411869571036, 0.1668487001979948, 0.05096776551956721, 0.06791484104188701, -0.2042324715904918, 0.0868768209016862, 0.04094424495037566] |
1,802.104 | A framework for (de)composing with Boolean automata networks | Boolean automata networks (BANs) are a generalisation of Boolean cellular
automata. In such, any theorem describing the way BANs compute information is a
strong tool that can be applied to a wide range of models of computation. In
this paper we explore a way of working with BANs which involves adding external
inputs to the base model (via modules), and more importantly, a way to link
networks together using the above mentioned inputs (via wirings). Our aim is to
develop a powerful formalism for BAN (de)composition. We formulate two results:
the first one shows that our modules/wirings definition is complete, the second
one uses modules/wirings to prove simulation results amongst BANs.
| cs.DM cs.LO | boolean automata networks bans are a generalisation of boolean cellular automata in such any theorem describing the way bans compute information is a strong tool that can be applied to a wide range of models of computation in this paper we explore a way of working with bans which involves adding external inputs to the base model via modules and more importantly a way to link networks together using the above mentioned inputs via wirings our aim is to develop a powerful formalism for ban decomposition we formulate two results the first one shows that our moduleswirings definition is complete the second one uses moduleswirings to prove simulation results amongst bans | [['boolean', 'automata', 'networks', 'bans', 'are', 'a', 'generalisation', 'of', 'boolean', 'cellular', 'automata', 'in', 'such', 'any', 'theorem', 'describing', 'the', 'way', 'bans', 'compute', 'information', 'is', 'a', 'strong', 'tool', 'that', 'can', 'be', 'applied', 'to', 'a', 'wide', 'range', 'of', 'models', 'of', 'computation', 'in', 'this', 'paper', 'we', 'explore', 'a', 'way', 'of', 'working', 'with', 'bans', 'which', 'involves', 'adding', 'external', 'inputs', 'to', 'the', 'base', 'model', 'via', 'modules', 'and', 'more', 'importantly', 'a', 'way', 'to', 'link', 'networks', 'together', 'using', 'the', 'above', 'mentioned', 'inputs', 'via', 'wirings', 'our', 'aim', 'is', 'to', 'develop', 'a', 'powerful', 'formalism', 'for', 'ban', 'decomposition', 'we', 'formulate', 'two', 'results', 'the', 'first', 'one', 'shows', 'that', 'our', 'moduleswirings', 'definition', 'is', 'complete', 'the', 'second', 'one', 'uses', 'moduleswirings', 'to', 'prove', 'simulation', 'results', 'amongst', 'bans']] | [-0.12090393080089856, 0.043493067563742126, -0.08719952726617046, 0.08358732987955692, -0.09329707207961367, -0.16183254161183167, 0.0806418392869191, 0.3545446529591439, -0.27939657750325875, -0.2835789084468686, 0.06745289734120422, -0.21493730020128327, -0.22708444944112946, 0.22145889843215977, -0.07959672517261741, 0.01886379382564524, 0.06121936210200464, 0.043366880630305325, -0.009732299851715018, -0.21592253612123702, 0.34511678039583316, 0.018921323342744364, 0.26567943303561725, 0.03530819517551759, 0.09405667527894908, 0.022983175134200843, -0.03844592982151229, 0.05133801322310753, -0.08555162347249212, 0.16614898095129554, 0.29998854933875435, 0.16822256927310122, 0.29876051754306215, -0.4179327587742324, -0.23485048396893085, 0.13533027590158472, 0.10507777865993184, 0.14165418358720464, 0.001415305545979709, -0.2275019105216232, 0.1459199690148918, -0.21538567351638724, -0.10594133996840464, -0.11682269609185607, -0.026781768307363223, 0.030381939835299594, -0.2951126492778779, -0.023333514656085488, 0.09342929611225247, 0.02873587869657759, -0.03059471087581521, -0.05146604826793485, 0.01718423628342261, 0.16253296563128403, -0.044900867997224383, 0.0324440118151828, 0.11364661380563171, -0.08948294264734338, -0.17121511556789143, 0.36154774561045916, -0.05959847273621195, -0.2141000062158895, 0.21832511131438093, -0.06792448593491535, -0.1753155212900644, 0.06602870493618891, 0.14193083262156456, 0.10360479962354133, -0.18512711505653387, 0.044854773857327467, -0.08712164802399866, 0.17969322507910498, 0.038743107857336416, 0.008447019136596233, 0.1682629451805025, 0.2038924487632349, 0.09460143796638201, 0.20099130471839374, -0.011443698037535362, -0.11350746574991066, -0.2753073617542556, -0.15518003609435288, -0.13138461616232033, 0.04312652253135697, -0.04852238094523323, -0.13827595847804064, 0.398498277675463, 0.1624932753503186, 0.17173737243518505, 0.15225058298695773, 0.32261876165525083, 0.08768815998577538, 0.09609605046416368, 0.06400109526333869, 0.1553067661599692, 0.17953650384218595, 0.08991656165117176, -0.11021443758156672, 0.05477063607962785, 0.08876890287555139] |
1,802.10401 | Variable domain N-linked glycosylation and negative surface charge are
key features of monoclonal ACPA: implications for B-cell selection | Autoreactive B cells have a central role in the pathogenesis of rheumatoid
arthritis (RA), and recent findings have proposed that anti-citrullinated
protein autoantibodies (ACPA) may be directly pathogenic. Herein, we
demonstrate the frequency of variable-region glycosylation in single-cell
cloned mAbs. A total of 14 ACPA mAbs were evaluated for predicted N-linked
glycosylation motifs in silico and compared to 452 highly-mutated mAbs from RA
patients and controls. Variable region N-linked motifs (N-X-S/T) were
strikingly prevalent within ACPA (100%) compared to somatically hypermutated
(SHM) RA bone marrow plasma cells (21%), and synovial plasma cells from
seropositive (39%) and seronegative RA (7%). When normalized for SHM, ACPA
still had significantly higher frequency of N-linked motifs compared to all
studied mAbs including highly-mutated HIV broadly-neutralizing and
malaria-associated mAbs. The Fab glycans of ACPA-mAbs were highly sialylated,
contributed to altered charge, but did not influence antigen binding. The
analysis revealed evidence of unusual B-cell selection pressure and
SHM-mediated decreased in surface charge and isoelectric point in ACPA. It is
still unknown how these distinct features of anti-citrulline immunity may have
an impact on pathogenesis. However, it is evident that they offer selective
advantages for ACPA+ B cells, possibly also through non-antigen driven
mechanisms.
| q-bio.BM q-bio.CB | autoreactive b cells have a central role in the pathogenesis of rheumatoid arthritis ra and recent findings have proposed that anticitrullinated protein autoantibodies acpa may be directly pathogenic herein we demonstrate the frequency of variableregion glycosylation in singlecell cloned mabs a total of 14 acpa mabs were evaluated for predicted nlinked glycosylation motifs in silico and compared to 452 highlymutated mabs from ra patients and controls variable region nlinked motifs nxst were strikingly prevalent within acpa 100 compared to somatically hypermutated shm ra bone marrow plasma cells 21 and synovial plasma cells from seropositive 39 and seronegative ra 7 when normalized for shm acpa still had significantly higher frequency of nlinked motifs compared to all studied mabs including highlymutated hiv broadlyneutralizing and malariaassociated mabs the fab glycans of acpamabs were highly sialylated contributed to altered charge but did not influence antigen binding the analysis revealed evidence of unusual bcell selection pressure and shmmediated decreased in surface charge and isoelectric point in acpa it is still unknown how these distinct features of anticitrulline immunity may have an impact on pathogenesis however it is evident that they offer selective advantages for acpa b cells possibly also through nonantigen driven mechanisms | [['autoreactive', 'b', 'cells', 'have', 'a', 'central', 'role', 'in', 'the', 'pathogenesis', 'of', 'rheumatoid', 'arthritis', 'ra', 'and', 'recent', 'findings', 'have', 'proposed', 'that', 'anticitrullinated', 'protein', 'autoantibodies', 'acpa', 'may', 'be', 'directly', 'pathogenic', 'herein', 'we', 'demonstrate', 'the', 'frequency', 'of', 'variableregion', 'glycosylation', 'in', 'singlecell', 'cloned', 'mabs', 'a', 'total', 'of', '14', 'acpa', 'mabs', 'were', 'evaluated', 'for', 'predicted', 'nlinked', 'glycosylation', 'motifs', 'in', 'silico', 'and', 'compared', 'to', '452', 'highlymutated', 'mabs', 'from', 'ra', 'patients', 'and', 'controls', 'variable', 'region', 'nlinked', 'motifs', 'nxst', 'were', 'strikingly', 'prevalent', 'within', 'acpa', '100', 'compared', 'to', 'somatically', 'hypermutated', 'shm', 'ra', 'bone', 'marrow', 'plasma', 'cells', '21', 'and', 'synovial', 'plasma', 'cells', 'from', 'seropositive', '39', 'and', 'seronegative', 'ra', '7', 'when', 'normalized', 'for', 'shm', 'acpa', 'still', 'had', 'significantly', 'higher', 'frequency', 'of', 'nlinked', 'motifs', 'compared', 'to', 'all', 'studied', 'mabs', 'including', 'highlymutated', 'hiv', 'broadlyneutralizing', 'and', 'malariaassociated', 'mabs', 'the', 'fab', 'glycans', 'of', 'acpamabs', 'were', 'highly', 'sialylated', 'contributed', 'to', 'altered', 'charge', 'but', 'did', 'not', 'influence', 'antigen', 'binding', 'the', 'analysis', 'revealed', 'evidence', 'of', 'unusual', 'bcell', 'selection', 'pressure', 'and', 'shmmediated', 'decreased', 'in', 'surface', 'charge', 'and', 'isoelectric', 'point', 'in', 'acpa', 'it', 'is', 'still', 'unknown', 'how', 'these', 'distinct', 'features', 'of', 'anticitrulline', 'immunity', 'may', 'have', 'an', 'impact', 'on', 'pathogenesis', 'however', 'it', 'is', 'evident', 'that', 'they', 'offer', 'selective', 'advantages', 'for', 'acpa', 'b', 'cells', 'possibly', 'also', 'through', 'nonantigen', 'driven', 'mechanisms']] | [-0.06735857243807426, 0.13182229506142268, -0.009264622642477348, 0.05101253943583964, 0.0003352068705596233, -0.16536204815114455, 0.10925323714609028, 0.38601289339626943, -0.1763592199336539, -0.27880408687649366, 0.0551234275297277, -0.2877003252709824, -0.20865025759682243, 0.18387316125654998, -0.10658253172855911, -0.017660748649928008, 0.024558898097456337, -0.00042081699844022266, 0.07872264918710914, -0.21261601038646116, 0.1705191375260226, 0.07644466231093625, 0.3067045023949827, 0.04335661599275152, 0.05118339618571265, -0.05048041875967807, -0.04438540905642786, 0.0253514678534273, -0.12010790370848434, 0.06037338700494093, 0.2919180917253341, 0.12210850652989225, 0.2913183995950051, -0.4318526189512181, -0.24671282298109734, 0.06646615533982633, 0.20398127245131492, 0.07649911040582699, -0.048219835754964864, -0.2528953423184124, 0.1356437448399457, -0.1671790308015271, -0.053539074856859166, -0.050167737172438144, 0.0400152559178408, 0.04815768598244256, -0.25461442600121426, 0.151976040200441, -0.006040740323054497, 0.12903496172391082, -0.11259988484817654, -0.21911897619198906, -0.08130310310580519, 0.15180691846094826, 0.07135125576986683, 0.048389390401053625, 0.2346089255342087, -0.10419882176688215, -0.0960949274439039, 0.3170493058173261, 0.029179745124744586, -0.1473738724286948, 0.2198023183711504, -0.14869783474724038, -0.1473959653862228, 0.19043993882744578, 0.16201656145460985, 0.08009087091535737, -0.15894393330286294, -0.030027740118424587, 0.021550642209422717, 0.17661261598753256, 0.13288027374710012, 0.004577176396027615, 0.1526266105009925, 0.17801293179957714, -0.06058280983089871, 0.0524672921878175, -0.1091884590107744, -0.056828093847331125, -0.12124720545068302, -0.11622217298317396, -0.0564764986314704, 0.020453808930415603, -0.04488256332131174, -0.12056040131904266, 0.36339403177952506, 0.08500920826520852, 0.14272115105773256, 0.0023326008008726835, 0.18681177397925264, -0.01548070023396139, 0.13610726279999216, 0.014813325978571275, 0.2080822553583599, 0.08797545521520078, 0.10137949346518907, -0.24929601245921085, 0.14544803548739113, -0.03774063489234451] |
1,802.10402 | Investigation of Dark Matter in the 3-2-3-1 Model | We prove that the $SU(3)_C\otimes SU(2)_L \otimes SU(3)_R\otimes U(1)_X$
(3-2-3-1) gauge model always contains a matter parity $W_P=(-1)^{3(B-L)+2s}$ as
conserved residual gauge symmetry, where $B-L=2(\beta T_{8R}+X)$ is a
$SU(3)_R\otimes U(1)_X$ charge. Due to the non-Abelian nature of $B-L$, the
$W$-odd and $W$-even fields are actually unified in gauge multiplets. We
investigate two viable versions for dark matter according to
$\beta=\pm1/\sqrt{3}$, where the dark matter candidates can be fermion, scalar,
or vector fields. We figure out the parameter spaces in the allowed regions of
the relic density and direct detection cross-sections. Additionally, we examine
the neutrino masses induced by the seesaw mechanism along with associated
lepton flavor violation processes. The new gauge boson searches at the LEPII
and LHC are discussed.
| hep-ph | we prove that the su3_cotimes su2_l otimes su3_rotimes u1_x 3231 gauge model always contains a matter parity w_p13bl2s as conserved residual gauge symmetry where bl2beta t_8rx is a su3_rotimes u1_x charge due to the nonabelian nature of bl the wodd and weven fields are actually unified in gauge multiplets we investigate two viable versions for dark matter according to betapm1sqrt3 where the dark matter candidates can be fermion scalar or vector fields we figure out the parameter spaces in the allowed regions of the relic density and direct detection crosssections additionally we examine the neutrino masses induced by the seesaw mechanism along with associated lepton flavor violation processes the new gauge boson searches at the lepii and lhc are discussed | [['we', 'prove', 'that', 'the', 'su3_cotimes', 'su2_l', 'otimes', 'su3_rotimes', 'u1_x', '3231', 'gauge', 'model', 'always', 'contains', 'a', 'matter', 'parity', 'w_p13bl2s', 'as', 'conserved', 'residual', 'gauge', 'symmetry', 'where', 'bl2beta', 't_8rx', 'is', 'a', 'su3_rotimes', 'u1_x', 'charge', 'due', 'to', 'the', 'nonabelian', 'nature', 'of', 'bl', 'the', 'wodd', 'and', 'weven', 'fields', 'are', 'actually', 'unified', 'in', 'gauge', 'multiplets', 'we', 'investigate', 'two', 'viable', 'versions', 'for', 'dark', 'matter', 'according', 'to', 'betapm1sqrt3', 'where', 'the', 'dark', 'matter', 'candidates', 'can', 'be', 'fermion', 'scalar', 'or', 'vector', 'fields', 'we', 'figure', 'out', 'the', 'parameter', 'spaces', 'in', 'the', 'allowed', 'regions', 'of', 'the', 'relic', 'density', 'and', 'direct', 'detection', 'crosssections', 'additionally', 'we', 'examine', 'the', 'neutrino', 'masses', 'induced', 'by', 'the', 'seesaw', 'mechanism', 'along', 'with', 'associated', 'lepton', 'flavor', 'violation', 'processes', 'the', 'new', 'gauge', 'boson', 'searches', 'at', 'the', 'lepii', 'and', 'lhc', 'are', 'discussed']] | [-0.14805566572948642, 0.30357638948303445, -0.03123927969768967, 0.1819444466918788, -0.13659999921270038, -0.17700998982333618, 0.004344213632461818, 0.331797987692382, -0.1794635080165513, -0.28967296785634494, 0.033280156425240896, -0.2397988648923195, -0.020990314377147868, 0.04154359484091401, 0.03634836905149986, -0.008483479706489522, -0.06659927430724644, 0.02940409381509475, -0.0527988488279769, -0.2510382515297312, 0.29845923147285763, -0.0018496996986315302, 0.24075976969755214, 0.06449557827259211, 0.11541363941100628, -0.01994428662026463, -0.04835783758544889, -0.11213468062424395, -0.10550359860296696, 0.0161352441686651, 0.1714273402183924, 0.050115013165075495, 0.07363651900187783, -0.39394779226378257, -0.16958347920976255, 0.22601757411561582, 0.15394259593095225, 0.10013102643272799, -0.11541291256738907, -0.3815985834630935, 0.0966643348660158, -0.23421178221216668, -0.09667412873519504, -0.09173264602887565, -0.05630017801228425, -0.12040513284990322, -0.33222573017296586, 0.12638990904568978, -0.07847514426862093, -0.021805536641698816, -0.036499350841926494, -0.14996199113843234, -0.10404817716663946, -0.08570497598620537, 0.2148695216352201, -0.007820089901392551, 0.1918528086171769, -0.256202503008029, -0.16393896032873864, 0.44638841236415117, -0.08152478474759213, -0.1971329326538936, 0.14753875400587593, -0.10266572056317945, -0.22364940742111725, 0.09054201190238413, 0.1403066890962098, 0.08120692347621788, -0.14742887399523802, 0.22324146769141132, -0.09639387289163373, 0.13325021329295375, 0.029633300848629165, 0.07911770167639075, 0.3305333607379631, 0.11841761371849671, 0.08759088458736305, 0.03260096529316481, -0.07871202710337694, -0.08257221036499528, -0.4581399396871743, -0.1697571449265208, -0.08503895722653555, 0.05820038796443006, -0.05957642468843994, -0.03938534361836703, 0.42830590807792285, 0.12017343025654555, 0.19232106295657223, -0.0014187030413228532, 0.23552307465680591, 0.06376546111423523, 0.10983062992277352, 0.02316479993093273, 0.26758192722159235, 0.18734650193389668, 0.05123452830340956, -0.23440872517859807, -0.09478882589660909, 0.1230512784105604] |
1,802.10403 | Survivable Network Design for Group Connectivity in Low-Treewidth Graphs | In the Group Steiner Tree problem (GST), we are given a (vertex or
edge)-weighted graph $G=(V,E)$ on $n$ vertices, a root vertex $r$ and a
collection of groups $\{S_i\}_{i\in[h]}: S_i\subseteq V(G)$. The goal is to
find a min-cost subgraph $H$ that connects the root to every group. We consider
a fault-tolerant variant of GST, which we call Restricted (Rooted) Group SNDP.
In this setting, each group $S_i$ has a demand $k_i\in[k],k\in\mathbb N$, and
we wish to find a min-cost $H\subseteq G$ such that, for each group $S_i$,
there is a vertex in $S_i$ connected to the root via $k_i$ (vertex or edge)
disjoint paths.
While GST admits $O(\log^2 n\log h)$ approximation, its high connectivity
variants are Label-Cover hard, and for the vertex-weighted version, the
hardness holds even when $k=2$. Previously, positive results were known only
for the edge-weighted version when $k=2$ [Gupta et al., SODA 2010; Khandekar et
al., Theor. Comput. Sci., 2012] and for a relaxed variant where the disjoint
paths may end at different vertices in a group [Chalermsook et al., SODA 2015].
Our main result is an $O(\log n\log h)$ approximation for Restricted Group
SNDP that runs in time $n^{f(k, w)}$, where $w$ is the treewidth of $G$. This
nearly matches the lower bound when $k$ and $w$ are constant. The key to
achieving this result is a non-trivial extension of the framework in
[Chalermsook et al., SODA 2017], which embeds all feasible solutions to the
problem into a dynamic program (DP) table. However, finding the optimal
solution in the DP table remains intractable. We formulate a linear program
relaxation for the DP and obtain an approximate solution via randomized
rounding. This framework also allows us to systematically construct DP tables
for high-connectivity problems. As a result, we present new exact algorithms
for several variants of survivable network design problems in low-treewidth
graphs.
| cs.DS cs.DM | in the group steiner tree problem gst we are given a vertex or edgeweighted graph gve on n vertices a root vertex r and a collection of groups s_i_iinh s_isubseteq vg the goal is to find a mincost subgraph h that connects the root to every group we consider a faulttolerant variant of gst which we call restricted rooted group sndp in this setting each group s_i has a demand k_iinkkinmathbb n and we wish to find a mincost hsubseteq g such that for each group s_i there is a vertex in s_i connected to the root via k_i vertex or edge disjoint paths while gst admits olog2 nlog h approximation its high connectivity variants are labelcover hard and for the vertexweighted version the hardness holds even when k2 previously positive results were known only for the edgeweighted version when k2 gupta et al soda 2010 khandekar et al theor comput sci 2012 and for a relaxed variant where the disjoint paths may end at different vertices in a group chalermsook et al soda 2015 our main result is an olog nlog h approximation for restricted group sndp that runs in time nfk w where w is the treewidth of g this nearly matches the lower bound when k and w are constant the key to achieving this result is a nontrivial extension of the framework in chalermsook et al soda 2017 which embeds all feasible solutions to the problem into a dynamic program dp table however finding the optimal solution in the dp table remains intractable we formulate a linear program relaxation for the dp and obtain an approximate solution via randomized rounding this framework also allows us to systematically construct dp tables for highconnectivity problems as a result we present new exact algorithms for several variants of survivable network design problems in lowtreewidth graphs | [['in', 'the', 'group', 'steiner', 'tree', 'problem', 'gst', 'we', 'are', 'given', 'a', 'vertex', 'or', 'edgeweighted', 'graph', 'gve', 'on', 'n', 'vertices', 'a', 'root', 'vertex', 'r', 'and', 'a', 'collection', 'of', 'groups', 's_i_iinh', 's_isubseteq', 'vg', 'the', 'goal', 'is', 'to', 'find', 'a', 'mincost', 'subgraph', 'h', 'that', 'connects', 'the', 'root', 'to', 'every', 'group', 'we', 'consider', 'a', 'faulttolerant', 'variant', 'of', 'gst', 'which', 'we', 'call', 'restricted', 'rooted', 'group', 'sndp', 'in', 'this', 'setting', 'each', 'group', 's_i', 'has', 'a', 'demand', 'k_iinkkinmathbb', 'n', 'and', 'we', 'wish', 'to', 'find', 'a', 'mincost', 'hsubseteq', 'g', 'such', 'that', 'for', 'each', 'group', 's_i', 'there', 'is', 'a', 'vertex', 'in', 's_i', 'connected', 'to', 'the', 'root', 'via', 'k_i', 'vertex', 'or', 'edge', 'disjoint', 'paths', 'while', 'gst', 'admits', 'olog2', 'nlog', 'h', 'approximation', 'its', 'high', 'connectivity', 'variants', 'are', 'labelcover', 'hard', 'and', 'for', 'the', 'vertexweighted', 'version', 'the', 'hardness', 'holds', 'even', 'when', 'k2', 'previously', 'positive', 'results', 'were', 'known', 'only', 'for', 'the', 'edgeweighted', 'version', 'when', 'k2', 'gupta', 'et', 'al', 'soda', '2010', 'khandekar', 'et', 'al', 'theor', 'comput', 'sci', '2012', 'and', 'for', 'a', 'relaxed', 'variant', 'where', 'the', 'disjoint', 'paths', 'may', 'end', 'at', 'different', 'vertices', 'in', 'a', 'group', 'chalermsook', 'et', 'al', 'soda', '2015', 'our', 'main', 'result', 'is', 'an', 'olog', 'nlog', 'h', 'approximation', 'for', 'restricted', 'group', 'sndp', 'that', 'runs', 'in', 'time', 'nfk', 'w', 'where', 'w', 'is', 'the', 'treewidth', 'of', 'g', 'this', 'nearly', 'matches', 'the', 'lower', 'bound', 'when', 'k', 'and', 'w', 'are', 'constant', 'the', 'key', 'to', 'achieving', 'this', 'result', 'is', 'a', 'nontrivial', 'extension', 'of', 'the', 'framework', 'in', 'chalermsook', 'et', 'al', 'soda', '2017', 'which', 'embeds', 'all', 'feasible', 'solutions', 'to', 'the', 'problem', 'into', 'a', 'dynamic', 'program', 'dp', 'table', 'however', 'finding', 'the', 'optimal', 'solution', 'in', 'the', 'dp', 'table', 'remains', 'intractable', 'we', 'formulate', 'a', 'linear', 'program', 'relaxation', 'for', 'the', 'dp', 'and', 'obtain', 'an', 'approximate', 'solution', 'via', 'randomized', 'rounding', 'this', 'framework', 'also', 'allows', 'us', 'to', 'systematically', 'construct', 'dp', 'tables', 'for', 'highconnectivity', 'problems', 'as', 'a', 'result', 'we', 'present', 'new', 'exact', 'algorithms', 'for', 'several', 'variants', 'of', 'survivable', 'network', 'design', 'problems', 'in', 'lowtreewidth', 'graphs']] | [-0.15015180167700196, 0.08549682989193118, -0.02778008394634886, 0.0168189672409732, -0.1232568412656487, -0.18630151749394908, 0.12425487978989412, 0.37212184581770363, -0.2971373630238838, -0.3383584782737077, 0.06861444510267463, -0.2948631130953926, -0.16650436580697497, 0.1287030532499683, -0.11634271204158074, 0.0455278610353813, 0.08107496017210566, 0.022545819395151077, 0.0033123741024742425, -0.30596031960403075, 0.2280831146815184, 0.026697792395605113, 0.19911109757334572, 0.026878929740008543, 0.07977178374077916, 0.08043783450139558, 0.006745395655574726, 0.05732388350238145, -0.19025871516398915, 0.06091073357977324, 0.29194345313705283, 0.14722345909641643, 0.28171124860103375, -0.35762139786430175, -0.14343628856982027, 0.167596944912472, 0.10999936715310912, 0.077659760415093, -0.005400452727879161, -0.20137533306055042, 0.11804622102900725, -0.133833962219088, -0.06802707273058176, 0.020906062805932938, 0.11878582156007217, -0.04674834831600099, -0.32503798965091135, 0.005279242294581558, 0.09301431091631403, -0.03319395717295661, 0.02051692429669478, -0.16914614268944356, 0.0057279940167435815, 0.06072792964793431, -0.0975745763877874, 0.12748775483038363, 0.020596886329927632, -0.07584028257665658, -0.19069679747504664, 0.36381170925877915, -0.02287800108134845, -0.12515454416865598, 0.1295152107474975, -0.05236892877601889, -0.22677688517687664, 0.09958808203212449, 0.16053832405501908, 0.15554930047952745, -0.10227018408683819, 0.18871291437018786, -0.15751201870909617, 0.12123744818727754, 0.10654192704633617, -0.04168909342737451, 0.06278132121562774, 0.12639579021509448, 0.15473078501029647, 0.1524259125784642, 0.004078929998724423, -0.02812648439094449, -0.27985826234114985, -0.13373853908694217, -0.19076155774754844, 0.03607560675468283, -0.1270153343938975, -0.16960259830685204, 0.36210982573353884, 0.0847241156984262, 0.21569855375178526, 0.123887323895039, 0.21646696030355916, 0.07446711366725686, 0.00492141094817949, 0.24225826750328094, 0.13280207376155645, 0.12300067238752475, 0.019427760392765548, -0.18283756255677813, 0.07076055750714941, 0.178696488721831] |
1,802.10404 | Measurement of the full excitation spectrum of the
7Li(p,{\gamma}){\alpha}{\alpha} reaction at 441 keV | A current challenge for ab initio calculations is systems that contain large
continuum contributions such as 8Be. We report on new measurements of radiative
decay widths in this nucleus that test recent Green's function Monte Carlo
calculations.
Traditionally, {\gamma} ray detectors have been utilized to measure the high
energy photons from the 7Li(p, {\gamma}){\alpha}{\alpha} reaction. However, due
to the complicated response function of these detectors it has not yet been
possible to extract the full {\gamma} ray spectrum from this reaction. Here we
present an alternative measurement using large area Silicon detectors to detect
the two {\alpha} particles, which provides a practically background free
spectrum and retains good energy resolution.
The resulting spectrum is analyzed using a many-level multi channel R-matrix
parametrization. Improved values for the radiative widths are extracted from
the R-matrix fit. We find evidence for significant non-resonant continuum
contributions and tentative evidence for a broad 0+ resonance at 12 MeV.
| nucl-ex | a current challenge for ab initio calculations is systems that contain large continuum contributions such as 8be we report on new measurements of radiative decay widths in this nucleus that test recent greens function monte carlo calculations traditionally gamma ray detectors have been utilized to measure the high energy photons from the 7lip gammaalphaalpha reaction however due to the complicated response function of these detectors it has not yet been possible to extract the full gamma ray spectrum from this reaction here we present an alternative measurement using large area silicon detectors to detect the two alpha particles which provides a practically background free spectrum and retains good energy resolution the resulting spectrum is analyzed using a manylevel multi channel rmatrix parametrization improved values for the radiative widths are extracted from the rmatrix fit we find evidence for significant nonresonant continuum contributions and tentative evidence for a broad 0 resonance at 12 mev | [['a', 'current', 'challenge', 'for', 'ab', 'initio', 'calculations', 'is', 'systems', 'that', 'contain', 'large', 'continuum', 'contributions', 'such', 'as', '8be', 'we', 'report', 'on', 'new', 'measurements', 'of', 'radiative', 'decay', 'widths', 'in', 'this', 'nucleus', 'that', 'test', 'recent', 'greens', 'function', 'monte', 'carlo', 'calculations', 'traditionally', 'gamma', 'ray', 'detectors', 'have', 'been', 'utilized', 'to', 'measure', 'the', 'high', 'energy', 'photons', 'from', 'the', '7lip', 'gammaalphaalpha', 'reaction', 'however', 'due', 'to', 'the', 'complicated', 'response', 'function', 'of', 'these', 'detectors', 'it', 'has', 'not', 'yet', 'been', 'possible', 'to', 'extract', 'the', 'full', 'gamma', 'ray', 'spectrum', 'from', 'this', 'reaction', 'here', 'we', 'present', 'an', 'alternative', 'measurement', 'using', 'large', 'area', 'silicon', 'detectors', 'to', 'detect', 'the', 'two', 'alpha', 'particles', 'which', 'provides', 'a', 'practically', 'background', 'free', 'spectrum', 'and', 'retains', 'good', 'energy', 'resolution', 'the', 'resulting', 'spectrum', 'is', 'analyzed', 'using', 'a', 'manylevel', 'multi', 'channel', 'rmatrix', 'parametrization', 'improved', 'values', 'for', 'the', 'radiative', 'widths', 'are', 'extracted', 'from', 'the', 'rmatrix', 'fit', 'we', 'find', 'evidence', 'for', 'significant', 'nonresonant', 'continuum', 'contributions', 'and', 'tentative', 'evidence', 'for', 'a', 'broad', '0', 'resonance', 'at', '12', 'mev']] | [-0.04281804581133704, 0.10484665161617925, -0.08771171804255573, 0.10749279817345699, -0.03202555430260346, -0.13204566708545348, 0.02594378951471299, 0.4291471390078138, -0.22216812557981988, -0.32691424990710066, 0.014935750337348222, -0.34258898068219423, -0.04521855728786537, 0.19729871126075618, 0.07151271787006408, 0.09129071140695917, 0.09726723154859715, -0.023874187566290953, -0.0587249731596737, -0.09244899142925676, 0.26898610104016324, 0.13052477291478826, 0.2484916372892545, 0.099671592221392, 0.07844571693495757, -0.00499808249725519, -0.04037344289367626, -0.0476385034976135, -0.180076077850524, 0.062412582619703914, 0.24383154242317878, 0.07452288681432899, 0.1641029804136212, -0.39508712191232725, -0.2286665364762915, 0.09454121850821569, 0.1605194944882226, 0.13115833049845319, -0.08500154365212534, -0.2418290369341297, 0.0556825943977425, -0.1955174904586257, -0.10630754999032146, -0.08480603020411524, 0.03486616867226794, -0.022616192074278126, -0.25622705989333455, 0.0580589141923395, -0.05221583215078633, 0.04037751132033775, -0.062007167068689965, -0.18362438087167807, 0.035337885673231394, 0.09866237625675767, 0.034060197552255554, 0.03927955659003744, 0.1518365959085426, -0.10290434996070537, -0.10806070717119023, 0.3545625344850123, -0.08293649581518318, -0.1537054219301545, 0.17067942312822101, -0.17272298881710557, -0.17101185506601868, 0.2564535040016237, 0.14143379915530155, 0.10598688088564238, -0.18330228619743139, 0.08376993107116218, 0.001676899191041134, 0.21340729149769208, 0.024522907431482485, 0.0467418327707013, 0.1949781315005997, 0.14737210266359493, -0.022694989274513272, 0.07616638458153159, -0.16941798971138747, -0.05378802979746405, -0.29823396751338516, -0.11464652438390706, -0.1734951460139679, 0.11256414392549854, -0.007467848711186028, -0.16428734337923265, 0.3573469291073515, 0.1239153982927459, 0.17875763672207923, 0.012333518968692883, 0.30718947962343107, 0.1444245901703222, 0.09962894463770729, 0.03272417971962377, 0.31694625346235145, 0.14074974773623244, 0.060047506786711315, -0.22004853871093424, 0.030927735396912077, -0.022076774252223243] |
1,802.10405 | Massive MIMO for Ultra-reliable Communications with Constellations for
Dual Coherent-noncoherent Detection | The stringent requirements of ultra-reliable low-latency communications
(URLLC) require rethinking of the physical layer transmission techniques.
Massive antenna arrays are seen as an enabler of the emerging $5^\text{th}$
generation systems, due to increases in spectral efficiency and degrees of
freedom for transmissions, which can greatly improve reliability under
demanding latency requirements. Massive array coherent processing relies on
accurate channel state information (CSI) in order to achieve high reliability.
In this paper, we investigate the impact of imperfect CSI in a single-input
multiple-output (SIMO) system on the coherent receiver. An amplitude-phase
keying (APK) symbol constellation is proposed, where each two symmetric symbols
reside on distinct power levels. The symbols are demodulated using a dual-stage
non-coherent and coherent detection strategy, in order to improve symbol
reliability. By means of analysis and simulation, we find an adequate scaling
of the constellation and show that for high signal-to-noise ratio (SNR) and
inaccurate CSI regime, the proposed scheme enhances receiver performance.
| cs.IT math.IT | the stringent requirements of ultrareliable lowlatency communications urllc require rethinking of the physical layer transmission techniques massive antenna arrays are seen as an enabler of the emerging 5textth generation systems due to increases in spectral efficiency and degrees of freedom for transmissions which can greatly improve reliability under demanding latency requirements massive array coherent processing relies on accurate channel state information csi in order to achieve high reliability in this paper we investigate the impact of imperfect csi in a singleinput multipleoutput simo system on the coherent receiver an amplitudephase keying apk symbol constellation is proposed where each two symmetric symbols reside on distinct power levels the symbols are demodulated using a dualstage noncoherent and coherent detection strategy in order to improve symbol reliability by means of analysis and simulation we find an adequate scaling of the constellation and show that for high signaltonoise ratio snr and inaccurate csi regime the proposed scheme enhances receiver performance | [['the', 'stringent', 'requirements', 'of', 'ultrareliable', 'lowlatency', 'communications', 'urllc', 'require', 'rethinking', 'of', 'the', 'physical', 'layer', 'transmission', 'techniques', 'massive', 'antenna', 'arrays', 'are', 'seen', 'as', 'an', 'enabler', 'of', 'the', 'emerging', '5textth', 'generation', 'systems', 'due', 'to', 'increases', 'in', 'spectral', 'efficiency', 'and', 'degrees', 'of', 'freedom', 'for', 'transmissions', 'which', 'can', 'greatly', 'improve', 'reliability', 'under', 'demanding', 'latency', 'requirements', 'massive', 'array', 'coherent', 'processing', 'relies', 'on', 'accurate', 'channel', 'state', 'information', 'csi', 'in', 'order', 'to', 'achieve', 'high', 'reliability', 'in', 'this', 'paper', 'we', 'investigate', 'the', 'impact', 'of', 'imperfect', 'csi', 'in', 'a', 'singleinput', 'multipleoutput', 'simo', 'system', 'on', 'the', 'coherent', 'receiver', 'an', 'amplitudephase', 'keying', 'apk', 'symbol', 'constellation', 'is', 'proposed', 'where', 'each', 'two', 'symmetric', 'symbols', 'reside', 'on', 'distinct', 'power', 'levels', 'the', 'symbols', 'are', 'demodulated', 'using', 'a', 'dualstage', 'noncoherent', 'and', 'coherent', 'detection', 'strategy', 'in', 'order', 'to', 'improve', 'symbol', 'reliability', 'by', 'means', 'of', 'analysis', 'and', 'simulation', 'we', 'find', 'an', 'adequate', 'scaling', 'of', 'the', 'constellation', 'and', 'show', 'that', 'for', 'high', 'signaltonoise', 'ratio', 'snr', 'and', 'inaccurate', 'csi', 'regime', 'the', 'proposed', 'scheme', 'enhances', 'receiver', 'performance']] | [-0.29705918782024243, 0.031744798277754734, 0.02072116331337617, 0.00514475032627487, -0.05203862552148982, -0.21674244784009764, 0.10053102615011784, 0.3781036336530143, -0.21437587070529565, -0.2931467695400501, 0.11861567925706577, -0.2207463719432081, -0.16875955324025993, 0.18047418648777053, -0.14569285223917225, 0.07318710401252759, 0.0779903628729069, 0.026144396867423963, -0.06349579181369336, -0.2634314275227296, 0.2791670199725419, 0.17313874118889755, 0.408879025409428, -0.008794229198918821, 0.11154804836648206, 0.037679886440925583, -0.021261953354741518, -0.11653825131286748, -0.06950475881496505, 0.07819811506525208, 0.34052997086128484, 0.18423752695059356, 0.217174944252922, -0.423131773660246, -0.27095403635086346, 0.05058804997660888, 0.19211787045153472, 0.06172816297046852, -0.04489600396258398, -0.28693259470403576, 0.13674096747014958, -0.25113575344379896, -0.03017005319699633, -0.0056447704749492305, -0.09152063343208283, 0.05977886616706084, -0.34516984670876694, 0.03938465937375067, -0.01158871220347161, 0.036693245688907035, -0.021609135700437505, -0.11868827706814791, 0.02823577013063746, 0.15257700559539863, -0.041982120114903994, -0.031941140053393796, 0.08163368284891849, -0.13055323713118783, -0.08879154868340358, 0.3449079681378909, -0.021326477652809653, -0.21530822347491407, 0.16237783666665798, -0.10913996720382084, -0.10736380020273664, 0.1964972973174344, 0.26896074831258887, 0.05285123143142137, -0.12695317124971786, 0.0174711130134827, 0.09965609503575625, 0.2640752398419397, 0.10474995604883401, 0.2246889061613892, 0.17682803419526094, 0.20281966920130146, 0.12353290835371575, 0.1336427502369938, -0.1598318012085003, -0.07092720832980166, -0.2021945444195388, -0.13599420495180917, -0.19120749257257183, -0.0025107051411536164, -0.10860846382563931, -0.054522659468392916, 0.3094938116123441, 0.16374940917907785, 0.08435989529915297, 0.057059159740441456, 0.4334880429176757, 0.13036340313817327, 0.03551109085002771, 0.09421592129943654, 0.2270805345831785, 0.13916706447670527, 0.11827533049449229, -0.2272271090896072, 0.0537258602398185, -0.033885790184379004] |
1,802.10406 | The Underlying Mechanisms of Time Dilation and Doppler Effect in Curved
Space-Time | In this paper, we theoretically investigate the time dilation and Doppler
effect in curved space-time from the perspective of quantum field theory (QFT).
A Coordinate Transformation which Maintains the Period of Clocks is introduced,
and such coordinate transformation is named as CTMPC throughout this paper. By
analogy with the Lorentz transformation in Minkowski space-time, CTMPC is a
correct transformation in curved space-times in a sense that it shows the
correct relation between the time measured by the two observers, moreover,
Lorentz transformation is just a special case of CTMPC applied in Minkowski
space-time. We demonstrate that the Coordinate Transformation which Maintains
the Local Metric (CTMLM) is one CTMPC, while the mathematical forms of physics
formulas in QFT will be maintained. As applications of CTMLM, the time dilation
and Doppler effect with an arbitrary time-dependent relative velocity in curved
space-time are analysed. For Minkowski space-time, the time dilation and
Doppler effect agree with the clock hypothesis. For curved space-time, we show
that even if the emitted wave has a narrow frequency range, the Doppler effect
may, in general, broaden the frequency spectrum and, at the meantime, shift the
frequencies values. These new findings will deepen our understanding on the
nature of space-time and the Doppler effect in curved space-time, they may also
provide theoretical guidance in future astronomical observations.
| hep-th gr-qc | in this paper we theoretically investigate the time dilation and doppler effect in curved spacetime from the perspective of quantum field theory qft a coordinate transformation which maintains the period of clocks is introduced and such coordinate transformation is named as ctmpc throughout this paper by analogy with the lorentz transformation in minkowski spacetime ctmpc is a correct transformation in curved spacetimes in a sense that it shows the correct relation between the time measured by the two observers moreover lorentz transformation is just a special case of ctmpc applied in minkowski spacetime we demonstrate that the coordinate transformation which maintains the local metric ctmlm is one ctmpc while the mathematical forms of physics formulas in qft will be maintained as applications of ctmlm the time dilation and doppler effect with an arbitrary timedependent relative velocity in curved spacetime are analysed for minkowski spacetime the time dilation and doppler effect agree with the clock hypothesis for curved spacetime we show that even if the emitted wave has a narrow frequency range the doppler effect may in general broaden the frequency spectrum and at the meantime shift the frequencies values these new findings will deepen our understanding on the nature of spacetime and the doppler effect in curved spacetime they may also provide theoretical guidance in future astronomical observations | [['in', 'this', 'paper', 'we', 'theoretically', 'investigate', 'the', 'time', 'dilation', 'and', 'doppler', 'effect', 'in', 'curved', 'spacetime', 'from', 'the', 'perspective', 'of', 'quantum', 'field', 'theory', 'qft', 'a', 'coordinate', 'transformation', 'which', 'maintains', 'the', 'period', 'of', 'clocks', 'is', 'introduced', 'and', 'such', 'coordinate', 'transformation', 'is', 'named', 'as', 'ctmpc', 'throughout', 'this', 'paper', 'by', 'analogy', 'with', 'the', 'lorentz', 'transformation', 'in', 'minkowski', 'spacetime', 'ctmpc', 'is', 'a', 'correct', 'transformation', 'in', 'curved', 'spacetimes', 'in', 'a', 'sense', 'that', 'it', 'shows', 'the', 'correct', 'relation', 'between', 'the', 'time', 'measured', 'by', 'the', 'two', 'observers', 'moreover', 'lorentz', 'transformation', 'is', 'just', 'a', 'special', 'case', 'of', 'ctmpc', 'applied', 'in', 'minkowski', 'spacetime', 'we', 'demonstrate', 'that', 'the', 'coordinate', 'transformation', 'which', 'maintains', 'the', 'local', 'metric', 'ctmlm', 'is', 'one', 'ctmpc', 'while', 'the', 'mathematical', 'forms', 'of', 'physics', 'formulas', 'in', 'qft', 'will', 'be', 'maintained', 'as', 'applications', 'of', 'ctmlm', 'the', 'time', 'dilation', 'and', 'doppler', 'effect', 'with', 'an', 'arbitrary', 'timedependent', 'relative', 'velocity', 'in', 'curved', 'spacetime', 'are', 'analysed', 'for', 'minkowski', 'spacetime', 'the', 'time', 'dilation', 'and', 'doppler', 'effect', 'agree', 'with', 'the', 'clock', 'hypothesis', 'for', 'curved', 'spacetime', 'we', 'show', 'that', 'even', 'if', 'the', 'emitted', 'wave', 'has', 'a', 'narrow', 'frequency', 'range', 'the', 'doppler', 'effect', 'may', 'in', 'general', 'broaden', 'the', 'frequency', 'spectrum', 'and', 'at', 'the', 'meantime', 'shift', 'the', 'frequencies', 'values', 'these', 'new', 'findings', 'will', 'deepen', 'our', 'understanding', 'on', 'the', 'nature', 'of', 'spacetime', 'and', 'the', 'doppler', 'effect', 'in', 'curved', 'spacetime', 'they', 'may', 'also', 'provide', 'theoretical', 'guidance', 'in', 'future', 'astronomical', 'observations']] | [-0.12320162330892075, 0.18351662484235054, -0.11304024553262731, 0.05183016537396017, -0.10611379319905406, -0.11686847756263213, -0.018399223877673246, 0.39143066970131324, -0.23288253747806367, -0.2569944696281002, 0.06476713653979392, -0.21884166897399593, -0.1647667704706287, 0.191985144805922, -0.08153567098142284, 0.01136219496489772, 0.016414751045414486, 0.05796331435205367, -0.11570468513269185, -0.18123458965715986, 0.3156897957648013, 0.11501659824743574, 0.3051584717489917, 0.0066312462707477, 0.10143944417359307, 0.020633404164713015, -0.06142091506047075, 0.067007940236686, -0.08201050275814244, 0.03513339816816841, 0.23375225484940326, 0.1117057333014802, 0.237859169152755, -0.3968361277538524, -0.2409790269944265, 0.054340501128333725, 0.13190328548673144, 0.14262969634728506, -0.06652092994179973, -0.32197268707224996, -0.013318552595996557, -0.11193760994313008, -0.15869019356883923, -0.04309050805642511, 0.05056856967469988, -0.054043339955603224, -0.20243156638375862, 0.09338782173361121, 0.0873038656310638, 0.05097991849416522, -0.09995491812178106, -0.010675325372614208, 0.025783186031427856, 0.09715836193127972, 0.06159823240024572, 0.05015078167155109, 0.11237547138955926, -0.04918952392336838, -0.10780683874973976, 0.43148422665480113, -0.07795992474442485, -0.23266971145144286, 0.11833255261795043, -0.21642036563867736, -0.11333284838797732, 0.08136302964272478, 0.15755961662917226, 0.10437517726138511, -0.11636854447661554, 0.1243824641186856, -0.008848151893727374, 0.1342665898304808, 0.13637597058280976, 0.06917682477985553, 0.21343452737373472, 0.07114090927589806, 0.0412975808883655, 0.10680895185214467, -0.08294687476397182, -0.09811474838594829, -0.35636265352540825, -0.18105635881915483, -0.14116396434298992, 0.06465968719264008, -0.1259123535620111, -0.13347548533541462, 0.3688023688392369, 0.1520259747102736, 0.15778663098441298, 0.031789998872059015, 0.27392574276934656, 0.12847521218969227, 0.05409437985596283, 0.07012245427230718, 0.29418769428782443, 0.12240466711551158, 0.13297053460027436, -0.2151251049783443, 0.0013123959415005865, 0.08490525533798737] |
1,802.10407 | Short Packet Structure for Ultra-Reliable Machine-type Communication:
Tradeoff between Detection and Decoding | Machine-type communication requires rethinking of the structure of short
packets due to the coding limitations and the significant role of the control
information. In ultra-reliable low-latency communication (URLLC), it is crucial
to optimally use the limited degrees of freedom (DoFs) to send data and control
information. We consider a URLLC model for short packet transmission with
acknowledgement (ACK). We compare the detection/decoding performance of two
short packet structures: (1) time-multiplexed detection sequence and data; and
(2) structure in which both packet detection and data decoding use all DoFs.
Specifically, as an instance of the second structure we use superimposed
sequences for detection and data. We derive the probabilities of false alarm
and misdetection for an AWGN channel and numerically minimize the packet error
probability (PER), showing that for delay-constrained data and ACK exchange,
there is a tradeoff between the resources spent for detection and decoding. We
show that the optimal PER for the superimposed structure is achieved for higher
detection overhead. For this reason, the PER is also higher than in the
preamble case. However, the superimposed structure is advantageous due to its
flexibility to achieve optimal operation without the need to use multiple
codebooks.
| cs.IT math.IT | machinetype communication requires rethinking of the structure of short packets due to the coding limitations and the significant role of the control information in ultrareliable lowlatency communication urllc it is crucial to optimally use the limited degrees of freedom dofs to send data and control information we consider a urllc model for short packet transmission with acknowledgement ack we compare the detectiondecoding performance of two short packet structures 1 timemultiplexed detection sequence and data and 2 structure in which both packet detection and data decoding use all dofs specifically as an instance of the second structure we use superimposed sequences for detection and data we derive the probabilities of false alarm and misdetection for an awgn channel and numerically minimize the packet error probability per showing that for delayconstrained data and ack exchange there is a tradeoff between the resources spent for detection and decoding we show that the optimal per for the superimposed structure is achieved for higher detection overhead for this reason the per is also higher than in the preamble case however the superimposed structure is advantageous due to its flexibility to achieve optimal operation without the need to use multiple codebooks | [['machinetype', 'communication', 'requires', 'rethinking', 'of', 'the', 'structure', 'of', 'short', 'packets', 'due', 'to', 'the', 'coding', 'limitations', 'and', 'the', 'significant', 'role', 'of', 'the', 'control', 'information', 'in', 'ultrareliable', 'lowlatency', 'communication', 'urllc', 'it', 'is', 'crucial', 'to', 'optimally', 'use', 'the', 'limited', 'degrees', 'of', 'freedom', 'dofs', 'to', 'send', 'data', 'and', 'control', 'information', 'we', 'consider', 'a', 'urllc', 'model', 'for', 'short', 'packet', 'transmission', 'with', 'acknowledgement', 'ack', 'we', 'compare', 'the', 'detectiondecoding', 'performance', 'of', 'two', 'short', 'packet', 'structures', '1', 'timemultiplexed', 'detection', 'sequence', 'and', 'data', 'and', '2', 'structure', 'in', 'which', 'both', 'packet', 'detection', 'and', 'data', 'decoding', 'use', 'all', 'dofs', 'specifically', 'as', 'an', 'instance', 'of', 'the', 'second', 'structure', 'we', 'use', 'superimposed', 'sequences', 'for', 'detection', 'and', 'data', 'we', 'derive', 'the', 'probabilities', 'of', 'false', 'alarm', 'and', 'misdetection', 'for', 'an', 'awgn', 'channel', 'and', 'numerically', 'minimize', 'the', 'packet', 'error', 'probability', 'per', 'showing', 'that', 'for', 'delayconstrained', 'data', 'and', 'ack', 'exchange', 'there', 'is', 'a', 'tradeoff', 'between', 'the', 'resources', 'spent', 'for', 'detection', 'and', 'decoding', 'we', 'show', 'that', 'the', 'optimal', 'per', 'for', 'the', 'superimposed', 'structure', 'is', 'achieved', 'for', 'higher', 'detection', 'overhead', 'for', 'this', 'reason', 'the', 'per', 'is', 'also', 'higher', 'than', 'in', 'the', 'preamble', 'case', 'however', 'the', 'superimposed', 'structure', 'is', 'advantageous', 'due', 'to', 'its', 'flexibility', 'to', 'achieve', 'optimal', 'operation', 'without', 'the', 'need', 'to', 'use', 'multiple', 'codebooks']] | [-0.23165229016031402, 0.03918128275709489, -0.009604511940135405, 0.06933028456540062, -0.06621656903925423, -0.22196437205928257, 0.14389056447021759, 0.4000903529377702, -0.27870840907741623, -0.30850730441176355, 0.1267740750691304, -0.2708204284289446, -0.1524360712713156, 0.16749538967911248, -0.11879335761022491, 0.07017685010438211, 0.07575007746449838, 0.07266961241332003, -0.04745455720444741, -0.28088928391464435, 0.25859641114321463, 0.1457517124616947, 0.3429785724311398, 0.05981963420859896, 0.112296667883101, 0.06498643060525258, -0.02183468376692289, -0.1176817981335215, -0.08706358572600995, 0.10868675758441289, 0.2892578161632021, 0.20778497896897488, 0.28763557323493444, -0.43729692770120426, -0.240921288728714, 0.08907170639409182, 0.15408420402270098, 0.12773767911458914, -0.06728349521708413, -0.2375827299299626, 0.1280856896681377, -0.20413368687403793, -0.01721265422514616, -0.02336698816730999, 0.000762046625216802, 0.03154908234360986, -0.314404981997079, 0.044866740699851505, 0.010585898753160086, 0.02256357884273315, -0.045876044469388526, -0.05098669066643104, 0.02899075933278371, 0.18477397957004799, 0.018954367067617103, 0.011945533658115145, 0.058650711939061205, -0.13745494241503856, -0.13010789200436707, 0.382421494829349, -0.02534514623253833, -0.22072983011603356, 0.13274123706460858, -0.07325013454000537, -0.09934370819813548, 0.18432765351668096, 0.2377212435553352, 0.06725956479039712, -0.1405915531464136, -0.03346484290638891, 0.06520686849402503, 0.22395513255674487, 0.11319741240630929, 0.1569828113123106, 0.13810393271418528, 0.18236189405792036, 0.1225613274348852, 0.12844321274867235, -0.16437576852309016, -0.08749373512915694, -0.24347061032029346, -0.14810244597655792, -0.18782701729498327, 0.0062233779340600355, -0.07824071936282473, -0.06176199826101462, 0.3576646317178622, 0.18199838555047815, 0.1569612676385217, 0.12466014041028058, 0.3901964640388122, 0.09639377144630998, 0.06997560274202186, 0.14955503575276965, 0.18702293833574424, 0.07150337591659851, 0.08084698466775127, -0.20682861534057734, 0.08278114526556471, -0.042792081569011015] |
1,802.10408 | A Neurorobotic Experiment for Crossmodal Conflict Resolution in Complex
Environments | Crossmodal conflict resolution is crucial for robot sensorimotor coupling
through the interaction with the environment, yielding swift and robust
behaviour also in noisy conditions. In this paper, we propose a neurorobotic
experiment in which an iCub robot exhibits human-like responses in a complex
crossmodal environment. To better understand how humans deal with multisensory
conflicts, we conducted a behavioural study exposing 33 subjects to congruent
and incongruent dynamic audio-visual cues. In contrast to previous studies
using simplified stimuli, we designed a scenario with four animated avatars and
observed that the magnitude and extension of the visual bias are related to the
semantics embedded in the scene, i.e., visual cues that are congruent with
environmental statistics (moving lips and vocalization) induce the strongest
bias. We implement a deep learning model that processes stereophonic sound,
facial features, and body motion to trigger a discrete behavioural response.
After training the model, we exposed the iCub to the same experimental
conditions as the human subjects, showing that the robot can replicate similar
responses in real time. Our interdisciplinary work provides important insights
into how crossmodal conflict resolution can be modelled in robots and
introduces future research directions for the efficient combination of sensory
observations with internally generated knowledge and expectations.
| cs.RO cs.HC | crossmodal conflict resolution is crucial for robot sensorimotor coupling through the interaction with the environment yielding swift and robust behaviour also in noisy conditions in this paper we propose a neurorobotic experiment in which an icub robot exhibits humanlike responses in a complex crossmodal environment to better understand how humans deal with multisensory conflicts we conducted a behavioural study exposing 33 subjects to congruent and incongruent dynamic audiovisual cues in contrast to previous studies using simplified stimuli we designed a scenario with four animated avatars and observed that the magnitude and extension of the visual bias are related to the semantics embedded in the scene ie visual cues that are congruent with environmental statistics moving lips and vocalization induce the strongest bias we implement a deep learning model that processes stereophonic sound facial features and body motion to trigger a discrete behavioural response after training the model we exposed the icub to the same experimental conditions as the human subjects showing that the robot can replicate similar responses in real time our interdisciplinary work provides important insights into how crossmodal conflict resolution can be modelled in robots and introduces future research directions for the efficient combination of sensory observations with internally generated knowledge and expectations | [['crossmodal', 'conflict', 'resolution', 'is', 'crucial', 'for', 'robot', 'sensorimotor', 'coupling', 'through', 'the', 'interaction', 'with', 'the', 'environment', 'yielding', 'swift', 'and', 'robust', 'behaviour', 'also', 'in', 'noisy', 'conditions', 'in', 'this', 'paper', 'we', 'propose', 'a', 'neurorobotic', 'experiment', 'in', 'which', 'an', 'icub', 'robot', 'exhibits', 'humanlike', 'responses', 'in', 'a', 'complex', 'crossmodal', 'environment', 'to', 'better', 'understand', 'how', 'humans', 'deal', 'with', 'multisensory', 'conflicts', 'we', 'conducted', 'a', 'behavioural', 'study', 'exposing', '33', 'subjects', 'to', 'congruent', 'and', 'incongruent', 'dynamic', 'audiovisual', 'cues', 'in', 'contrast', 'to', 'previous', 'studies', 'using', 'simplified', 'stimuli', 'we', 'designed', 'a', 'scenario', 'with', 'four', 'animated', 'avatars', 'and', 'observed', 'that', 'the', 'magnitude', 'and', 'extension', 'of', 'the', 'visual', 'bias', 'are', 'related', 'to', 'the', 'semantics', 'embedded', 'in', 'the', 'scene', 'ie', 'visual', 'cues', 'that', 'are', 'congruent', 'with', 'environmental', 'statistics', 'moving', 'lips', 'and', 'vocalization', 'induce', 'the', 'strongest', 'bias', 'we', 'implement', 'a', 'deep', 'learning', 'model', 'that', 'processes', 'stereophonic', 'sound', 'facial', 'features', 'and', 'body', 'motion', 'to', 'trigger', 'a', 'discrete', 'behavioural', 'response', 'after', 'training', 'the', 'model', 'we', 'exposed', 'the', 'icub', 'to', 'the', 'same', 'experimental', 'conditions', 'as', 'the', 'human', 'subjects', 'showing', 'that', 'the', 'robot', 'can', 'replicate', 'similar', 'responses', 'in', 'real', 'time', 'our', 'interdisciplinary', 'work', 'provides', 'important', 'insights', 'into', 'how', 'crossmodal', 'conflict', 'resolution', 'can', 'be', 'modelled', 'in', 'robots', 'and', 'introduces', 'future', 'research', 'directions', 'for', 'the', 'efficient', 'combination', 'of', 'sensory', 'observations', 'with', 'internally', 'generated', 'knowledge', 'and', 'expectations']] | [-0.07084272315357036, 0.08467384170595038, -0.09856770992792008, 0.05446380371908091, -0.1487536883397101, -0.16374274711900702, 0.008853362409675302, 0.4740147859716386, -0.24441439117414548, -0.35181130471356287, 0.028413380152093905, -0.2842704225582637, -0.22974201791358234, 0.14271110571109388, -0.1610945761437738, 0.03841232321928164, 0.10006865214182101, 0.04183846391285496, 0.019012718233331245, -0.22389240780224404, 0.24617455087889753, 0.03987346722059039, 0.2789054398137309, 0.004718428276771424, 0.12467623928643982, -0.006003288948205391, -0.03994203277454967, 0.023927499800943313, -0.06458334399526482, 0.1428161987101239, 0.33934029738570554, 0.168141357705691, 0.2838327893907405, -0.4693492104427195, -0.19655457880991675, 0.08084945477928747, 0.11424588130024609, 0.05912432492329447, -0.059470017030880805, -0.3955298692134081, 0.05912224527114007, -0.13981384060838642, -0.05522170055237617, -0.09791799182653003, 0.0009949334586660068, -0.02200423706694981, -0.2872832489537198, 0.03682962712342737, 0.07151284690617639, 0.14410733072858706, -0.09494829868130825, -0.03272736281631332, 0.023334614358449756, 0.20974743094605705, 0.044807367275615094, 0.0448073749641623, 0.18730494638850145, -0.18434105647211968, -0.14838932143574507, 0.3703464501555644, -0.01831536877879818, -0.19812063238693073, 0.2607836434298067, -0.10215433538142665, -0.12892995162310042, 0.08468930317801149, 0.22866050543962047, 0.0682099439447983, -0.1830529824821461, -0.022492096750248297, -0.026717989748873402, 0.2045824569592928, 0.05535380586276434, -0.020015592796399313, 0.2091449390567255, 0.22706970396051046, 0.010096688056649988, 0.1444571374603958, -0.07306320327117254, -0.08052108058815494, -0.24350581081428876, -0.0970541456276003, -0.09208860840675805, -0.03229456320617578, -0.07458669030080166, -0.07881041929837973, 0.38859880204979036, 0.2548911465929967, 0.220124002315524, 0.0741095737931912, 0.334854653570801, 0.012095101337478148, 0.08794354582114108, 0.025241419424156787, 0.18345040865995757, 0.006866963625903807, 0.14492513651859162, -0.21336668493013883, 0.10770620022587679, -0.02373901778771017] |
1,802.10409 | Solving determinantal systems using homotopy techniques | Let $\K$ be a field of characteristic zero and $\Kbar$ be an algebraic
closure of $\K$. Consider a sequence of polynomials$G=(g\_1,\dots,g\_s)$ in
$\K[X\_1,\dots,X\_n]$, a polynomial matrix $\F=[f\_{i,j}] \in
\K[X\_1,\dots,X\_n]^{p \times q}$, with $p \leq q$,and the algebraic set
$V\_p(F, G)$ of points in $\KKbar$ at which all polynomials in $\G$ and all
$p$-minors of $\F$vanish. Such polynomial systems appear naturally in e.g.
polynomial optimization, computational geometry.We provide bounds on the number
of isolated points in $V\_p(F, G)$ depending on the maxima of the degrees in
rows (resp. columns) of $\F$. Next, we design homotopy algorithms for computing
those points. These algorithms take advantage of the determinantal structure of
the system defining $V\_p(F, G)$. In particular, the algorithms run in time
that is polynomial in the bound on the number of isolated points.
| cs.SC | let k be a field of characteristic zero and kbar be an algebraic closure of k consider a sequence of polynomialsgg_1dotsg_s in kx_1dotsx_n a polynomial matrix ff_ij in kx_1dotsx_np times q with p leq qand the algebraic set v_pf g of points in kkbar at which all polynomials in g and all pminors of fvanish such polynomial systems appear naturally in eg polynomial optimization computational geometrywe provide bounds on the number of isolated points in v_pf g depending on the maxima of the degrees in rows resp columns of f next we design homotopy algorithms for computing those points these algorithms take advantage of the determinantal structure of the system defining v_pf g in particular the algorithms run in time that is polynomial in the bound on the number of isolated points | [['let', 'k', 'be', 'a', 'field', 'of', 'characteristic', 'zero', 'and', 'kbar', 'be', 'an', 'algebraic', 'closure', 'of', 'k', 'consider', 'a', 'sequence', 'of', 'polynomialsgg_1dotsg_s', 'in', 'kx_1dotsx_n', 'a', 'polynomial', 'matrix', 'ff_ij', 'in', 'kx_1dotsx_np', 'times', 'q', 'with', 'p', 'leq', 'qand', 'the', 'algebraic', 'set', 'v_pf', 'g', 'of', 'points', 'in', 'kkbar', 'at', 'which', 'all', 'polynomials', 'in', 'g', 'and', 'all', 'pminors', 'of', 'fvanish', 'such', 'polynomial', 'systems', 'appear', 'naturally', 'in', 'eg', 'polynomial', 'optimization', 'computational', 'geometrywe', 'provide', 'bounds', 'on', 'the', 'number', 'of', 'isolated', 'points', 'in', 'v_pf', 'g', 'depending', 'on', 'the', 'maxima', 'of', 'the', 'degrees', 'in', 'rows', 'resp', 'columns', 'of', 'f', 'next', 'we', 'design', 'homotopy', 'algorithms', 'for', 'computing', 'those', 'points', 'these', 'algorithms', 'take', 'advantage', 'of', 'the', 'determinantal', 'structure', 'of', 'the', 'system', 'defining', 'v_pf', 'g', 'in', 'particular', 'the', 'algorithms', 'run', 'in', 'time', 'that', 'is', 'polynomial', 'in', 'the', 'bound', 'on', 'the', 'number', 'of', 'isolated', 'points']] | [-0.2266123176589608, 0.08362696572497953, -0.07883893341943622, -0.022731905332766474, -0.018003020741045477, -0.1198708966523409, 0.05292624791432172, 0.310014366382733, -0.30963770419359204, -0.28316038878262045, 0.06648302046395839, -0.25083964096568523, -0.11020972657576203, 0.1909935735911131, -0.03362683033570647, 0.016357298803515732, 0.031169344522058964, 0.12243109803670085, -0.09642918934300541, -0.32637489746510984, 0.3037755192071199, -0.061528818994760516, 0.1516643658647372, -0.013562045596539974, 0.06824434486590326, -0.00558079812861979, 0.02307043669000268, 0.01099451226554811, -0.13460682418412762, 0.06663686353899538, 0.31462349550426005, 0.13400412893667818, 0.2563246113229543, -0.40848244562000036, -0.1070266911610961, 0.22116634303890167, 0.15730973887292202, 0.0004216364650055766, 0.03805493310187012, -0.21861563474684953, 0.13851445686630906, -0.08085443127434701, -0.11732007390633226, -0.03289002384804189, 0.08199695307109504, 0.051875928584486246, -0.2954261382431723, -0.015651544973254203, 0.0788189545199275, 0.14053681618347763, 0.021095515510067345, -0.20305411188397557, 0.006599782273173332, 0.04310945245623589, -0.02719274843391031, 0.05010163826495409, 0.08136930806189775, -0.1168089586943388, -0.12639186481572687, 0.37556106509268283, -0.04030124049447477, -0.17576766162365676, 0.12082898428291082, -0.17610891461372374, -0.17064518396556377, 0.17733297662623226, 0.19438745981873945, 0.1417623785417527, -0.038950520541984585, 0.2047873340761289, -0.08780150809884071, 0.09602771778032183, 0.09222431805729867, 0.03013192028924823, 0.15280367390438915, 0.09175357379578054, 0.12077695339359343, 0.10883449267875403, -0.004446844277903437, -0.019861434035003185, -0.32788602761738, -0.15406493071326985, -0.21100081099756063, 0.08349720150604845, -0.16955764956003985, -0.1726763581475243, 0.3933495211601257, 0.09077097553014755, 0.2357302074879408, 0.08554019311629235, 0.22672176387906073, 0.0961811913541751, 0.044597366899251936, 0.13385469022393226, 0.10417797583900391, 0.1577503374144435, -0.004396641623228789, -0.1997136907428503, 0.03432700024126097, 0.13439041066914797] |
1,802.1041 | Tensor Decomposition for Compressing Recurrent Neural Network | In the machine learning fields, Recurrent Neural Network (RNN) has become a
popular architecture for sequential data modeling. However, behind the
impressive performance, RNNs require a large number of parameters for both
training and inference. In this paper, we are trying to reduce the number of
parameters and maintain the expressive power from RNN simultaneously. We
utilize several tensor decompositions method including CANDECOMP/PARAFAC (CP),
Tucker decomposition and Tensor Train (TT) to re-parameterize the Gated
Recurrent Unit (GRU) RNN. We evaluate all tensor-based RNNs performance on
sequence modeling tasks with a various number of parameters. Based on our
experiment results, TT-GRU achieved the best results in a various number of
parameters compared to other decomposition methods.
| cs.LG | in the machine learning fields recurrent neural network rnn has become a popular architecture for sequential data modeling however behind the impressive performance rnns require a large number of parameters for both training and inference in this paper we are trying to reduce the number of parameters and maintain the expressive power from rnn simultaneously we utilize several tensor decompositions method including candecompparafac cp tucker decomposition and tensor train tt to reparameterize the gated recurrent unit gru rnn we evaluate all tensorbased rnns performance on sequence modeling tasks with a various number of parameters based on our experiment results ttgru achieved the best results in a various number of parameters compared to other decomposition methods | [['in', 'the', 'machine', 'learning', 'fields', 'recurrent', 'neural', 'network', 'rnn', 'has', 'become', 'a', 'popular', 'architecture', 'for', 'sequential', 'data', 'modeling', 'however', 'behind', 'the', 'impressive', 'performance', 'rnns', 'require', 'a', 'large', 'number', 'of', 'parameters', 'for', 'both', 'training', 'and', 'inference', 'in', 'this', 'paper', 'we', 'are', 'trying', 'to', 'reduce', 'the', 'number', 'of', 'parameters', 'and', 'maintain', 'the', 'expressive', 'power', 'from', 'rnn', 'simultaneously', 'we', 'utilize', 'several', 'tensor', 'decompositions', 'method', 'including', 'candecompparafac', 'cp', 'tucker', 'decomposition', 'and', 'tensor', 'train', 'tt', 'to', 'reparameterize', 'the', 'gated', 'recurrent', 'unit', 'gru', 'rnn', 'we', 'evaluate', 'all', 'tensorbased', 'rnns', 'performance', 'on', 'sequence', 'modeling', 'tasks', 'with', 'a', 'various', 'number', 'of', 'parameters', 'based', 'on', 'our', 'experiment', 'results', 'ttgru', 'achieved', 'the', 'best', 'results', 'in', 'a', 'various', 'number', 'of', 'parameters', 'compared', 'to', 'other', 'decomposition', 'methods']] | [-0.06297472671589308, 0.003805261681248483, -0.02376136752335649, 0.07078252014961388, -0.14769768375462214, -0.19053822406159157, 0.018911737828156014, 0.4688514676925383, -0.30325388225416344, -0.3201902637037596, 0.0936361513245573, -0.23766282621133877, -0.203042934901947, 0.21539829331940333, -0.08147320143976494, 0.13464734035548181, 0.15722085970143476, 0.0516877875892086, -0.0765192257526347, -0.2901140404221798, 0.2533779224470715, 0.03443390215959465, 0.3484355479544192, -0.03873816094965788, 0.13047514405007588, -0.0475544844092311, -0.039990621618926525, -0.02192045058830429, -0.027073577953208434, 0.17582517695662223, 0.2721417143025942, 0.20943143495191052, 0.3119159409809008, -0.4638528396751274, -0.23645863346163215, 0.11514827796143659, 0.11994460979149792, 0.0768303354679231, 0.0038425930787956246, -0.23865705130523757, 0.11457189764386337, -0.2052365173820586, 0.07044967643001623, -0.20047780153292574, -0.0342009582315784, 0.020584067240921093, -0.3131244760333446, 0.005903896177187562, 0.07873665783533892, 0.025605734392771858, -0.04105803825108236, -0.1981374865955379, 0.039292581881837624, 0.1503184239764028, 0.06585717184076968, 0.04135839922941829, 0.08981713081971464, -0.19093309670809008, -0.15189757804271944, 0.31049804387025925, -0.10195032155892828, -0.2512218509698613, 0.1824483537450106, -0.009169238874803117, -0.21387757813525304, 0.05591564469668491, 0.25912674342429165, 0.10314497462343097, -0.13426757913507653, 0.03399743309311912, -0.027311035534040184, 0.1773024333820662, 0.04965723809590073, 0.008680563197438523, 0.14849164677996254, 0.30513713073001747, -0.022268438670914947, 0.1366556181573399, -0.14197235908604375, -0.07724427327660746, -0.1610734931503733, -0.08807862835544113, -0.18009987772185063, -0.012779700455435535, -0.1408872650728179, -0.16168736310250925, 0.4733507939075169, 0.23747892366117684, 0.23177338974946587, 0.1634381616390065, 0.3774148258462287, 0.002838001769289309, 0.1661184735089671, 0.1200287756428384, 0.16806867448286267, 0.12397989092329353, 0.13336585507025583, -0.1851440708279577, 0.06315908241575878, 0.07176073156133816] |
1,802.10411 | Distance entropy cartography characterises centrality in complex
networks | We introduce distance entropy as a measure of homogeneity in the distribution
of path lengths between a given node and its neighbours in a complex network.
Distance entropy defines a new centrality measure whose properties are
investigated for a variety of synthetic network models. By coupling distance
entropy information with closeness centrality, we introduce a network
cartography which allows one to reduce the degeneracy of ranking based on
closeness alone. We apply this methodology to the empirical multiplex lexical
network encoding the linguistic relationships known to English speaking
toddlers. We show that the distance entropy cartography better predicts how
children learn words compared to closeness centrality. Our results highlight
the importance of distance entropy for gaining insights from distance patterns
in complex networks.
| physics.soc-ph cond-mat.stat-mech cs.CL cs.SI physics.data-an | we introduce distance entropy as a measure of homogeneity in the distribution of path lengths between a given node and its neighbours in a complex network distance entropy defines a new centrality measure whose properties are investigated for a variety of synthetic network models by coupling distance entropy information with closeness centrality we introduce a network cartography which allows one to reduce the degeneracy of ranking based on closeness alone we apply this methodology to the empirical multiplex lexical network encoding the linguistic relationships known to english speaking toddlers we show that the distance entropy cartography better predicts how children learn words compared to closeness centrality our results highlight the importance of distance entropy for gaining insights from distance patterns in complex networks | [['we', 'introduce', 'distance', 'entropy', 'as', 'a', 'measure', 'of', 'homogeneity', 'in', 'the', 'distribution', 'of', 'path', 'lengths', 'between', 'a', 'given', 'node', 'and', 'its', 'neighbours', 'in', 'a', 'complex', 'network', 'distance', 'entropy', 'defines', 'a', 'new', 'centrality', 'measure', 'whose', 'properties', 'are', 'investigated', 'for', 'a', 'variety', 'of', 'synthetic', 'network', 'models', 'by', 'coupling', 'distance', 'entropy', 'information', 'with', 'closeness', 'centrality', 'we', 'introduce', 'a', 'network', 'cartography', 'which', 'allows', 'one', 'to', 'reduce', 'the', 'degeneracy', 'of', 'ranking', 'based', 'on', 'closeness', 'alone', 'we', 'apply', 'this', 'methodology', 'to', 'the', 'empirical', 'multiplex', 'lexical', 'network', 'encoding', 'the', 'linguistic', 'relationships', 'known', 'to', 'english', 'speaking', 'toddlers', 'we', 'show', 'that', 'the', 'distance', 'entropy', 'cartography', 'better', 'predicts', 'how', 'children', 'learn', 'words', 'compared', 'to', 'closeness', 'centrality', 'our', 'results', 'highlight', 'the', 'importance', 'of', 'distance', 'entropy', 'for', 'gaining', 'insights', 'from', 'distance', 'patterns', 'in', 'complex', 'networks']] | [-0.10860529192912627, 0.042420125789788925, -0.11945379528451741, 0.1350314999254784, -0.08970262342306777, -0.1528255673905274, 0.09212698053087796, 0.40875791576577397, -0.32442760868830894, -0.29945213703544643, -0.03520419030938661, -0.316824917668383, -0.17560662892533513, 0.12436143472474598, -0.08845154041560685, 0.03921533735588238, 0.09198095767789073, 0.11211044883272209, -0.06863110768230163, -0.20890978394015655, 0.3688732857202611, 0.0730230437394807, 0.3283528662873508, 0.07770454922191254, 0.10102508041053647, -0.0027214114826808614, -0.0552797852296049, 0.0809282659121403, -0.15665336650053496, 0.2163207313250296, 0.25661002875370664, 0.24405837906675973, 0.30431331775900794, -0.3174110227150888, -0.24725017638316726, 0.11112401010638966, 0.07623846292480584, 0.054266331019826475, 0.020158773737702126, -0.2991307126131, 0.061903820721417424, -0.186904094401535, -0.06866850872804237, -0.08745776256167792, 0.047017074447518924, 0.04029113235902344, -0.2223516348806187, 0.09403250011713887, 0.022319614372360026, 0.08731195758422458, 0.000701709459744, -0.0974854633923832, -0.05737614599283694, 0.19298659872672544, 0.01544516245508945, 0.04829829508283486, 0.1257892323977776, -0.07510452450828521, -0.16777654435500744, 0.3413301070288914, -0.025523518868987034, -0.22314515656117745, 0.1956749539992704, -0.061985612979416196, -0.12817291661763822, 0.016524006234012484, 0.2645842349535324, 0.08711938247485919, -0.16772670495490416, -0.02744664839086524, -0.020676003905331215, 0.19659160171461298, 0.0618721048150787, 0.06587717189582262, 0.16562533906143495, 0.20040708168493054, 0.08564156290840327, 0.16292801089925554, -0.1061681796459678, -0.11533277124787371, -0.2199183614561107, -0.1508692270788417, -0.22878837738776717, 0.030713150580602932, -0.20268047072655404, -0.15200492986290984, 0.43817326247813254, 0.2139785692580347, 0.2690488283363421, 0.13849589810233442, 0.24933995754738164, 0.007463117111171406, 0.0867460297280544, 0.09502372418234988, 0.17552088904270252, 0.12785603004560722, 0.10628311598022294, -0.17246575278563167, 0.14979798204693337, 0.09943687341149236] |
1,802.10412 | Reaction-diffusion on random spatial networks with scale-free jumping
rates via effective medium theory | We study epidemic processes using a metapopulation approach on the line
featuring random transport rates between arbitrarily distant sites. An average
transport network is found using a recently developed variant of the effective
medium approximation (EMA) that is capable of dealing with these long-range
connections. Using a Feynman-Kac argument in the effective medium, we derive an
estimate on the size of the infected domain, and reproduce the known result of
its exponential growth in time. We hereby demonstrate the applicability of
long-range EMA to dynamical processes on networks more intricate than simple
diffusion.
| physics.soc-ph | we study epidemic processes using a metapopulation approach on the line featuring random transport rates between arbitrarily distant sites an average transport network is found using a recently developed variant of the effective medium approximation ema that is capable of dealing with these longrange connections using a feynmankac argument in the effective medium we derive an estimate on the size of the infected domain and reproduce the known result of its exponential growth in time we hereby demonstrate the applicability of longrange ema to dynamical processes on networks more intricate than simple diffusion | [['we', 'study', 'epidemic', 'processes', 'using', 'a', 'metapopulation', 'approach', 'on', 'the', 'line', 'featuring', 'random', 'transport', 'rates', 'between', 'arbitrarily', 'distant', 'sites', 'an', 'average', 'transport', 'network', 'is', 'found', 'using', 'a', 'recently', 'developed', 'variant', 'of', 'the', 'effective', 'medium', 'approximation', 'ema', 'that', 'is', 'capable', 'of', 'dealing', 'with', 'these', 'longrange', 'connections', 'using', 'a', 'feynmankac', 'argument', 'in', 'the', 'effective', 'medium', 'we', 'derive', 'an', 'estimate', 'on', 'the', 'size', 'of', 'the', 'infected', 'domain', 'and', 'reproduce', 'the', 'known', 'result', 'of', 'its', 'exponential', 'growth', 'in', 'time', 'we', 'hereby', 'demonstrate', 'the', 'applicability', 'of', 'longrange', 'ema', 'to', 'dynamical', 'processes', 'on', 'networks', 'more', 'intricate', 'than', 'simple', 'diffusion']] | [-0.11187833385987668, 0.0961793252365208, -0.09338560893190323, 0.11712000843998725, -0.028599045259417387, -0.11669395474081118, 0.07640635770975902, 0.385844918623847, -0.22016470020847215, -0.26993996629952105, 0.06983647358563719, -0.2702156961144459, -0.19812663451567233, 0.17510449158538494, 0.004475857666318094, 0.021817554744155778, 0.0346512002169445, 0.015991492447273065, 0.009654533130527344, -0.21784709629312318, 0.3128798454574319, 0.07362922374284275, 0.26941276108595713, 0.061081198119149686, 0.11658348465558663, 0.061261916347849436, -0.03694506895838566, 0.03426926692081515, -0.1431225790290609, 0.13855652851212183, 0.1666423569568583, 0.0488513852870192, 0.27786696797377, -0.47242909363440927, -0.2746336548864561, 0.0795742341189555, 0.1758593426096023, 0.14368574517548724, -0.052242347353009096, -0.28479396992973904, 0.033493943682681486, -0.1739777359430508, -0.18187105120347452, -0.06721575362908264, 0.026221953357459717, 0.05404810263006698, -0.2861411626981471, 0.10190537660720668, 0.03744628011112562, 0.06184621146749905, -0.035730771891902935, -0.058431921757116756, 0.017422343589245312, 0.11781431590857845, 0.003917498524070427, -0.013493454536943826, 0.13498889251802398, -0.12307378656095674, -0.1076881083990297, 0.33231695369887415, -0.08956186235234546, -0.18004195984973703, 0.22625087731723142, -0.10683944951792959, -0.08443349739035932, 0.13169446541497143, 0.2268615528460472, 0.12738598236233317, -0.20038815528675114, 0.047922796356336526, -0.035785355234658846, 0.16211959083504493, 0.01984875138488508, 0.002774695114743325, 0.10647022756948187, 0.2519008380821556, 0.06772495366592882, 0.12518904135832865, -0.07421628338245985, -0.160015588420974, -0.2331158183114503, -0.10758322194908365, -0.20567503144654134, 0.06592701036252722, -0.16849851873136873, -0.1715989416585334, 0.3773714637443904, 0.1641155119524688, 0.20532669178059987, 0.11892472062340026, 0.25052781864219614, 0.12433000392610988, 0.03785745724935525, 0.09972194159522049, 0.19747270036849282, 0.16107494047572535, 0.1257044097749136, -0.22748444229739928, 0.14142592474117235, 0.07971062589316599] |
1,802.10413 | Towards Open Boundary Molecular Dynamics Simulation of Ionic Liquids | We extend the use of the adaptive resolution method (AdResS) in its Grand
Canonical-like version (GC-AdResS) to the molecular dynamics simulation of
1,3-dimethylimidazolium chloride. We show that the partitioning of the total
system in a subsystem of interest with atomistic details and a reservoir of
coarse-grained particles leads to satisfactory results. The challenging aspect
of this study, compared to previous AdResS simulations, is the presence of
charged particles and the necessity of addressing the question about the
minimal physical input needed to model the coarse-grained particles in the
reservoir. We propose two different approaches and show that in both cases they
are sufficient to capture the decisive physical characteristics that allow a
valid system-reservoir coupling. The technical satisfactory result paves the
way for multiscale analysis of ionic liquids and for truly open boundary
molecular simulations.
| physics.chem-ph | we extend the use of the adaptive resolution method adress in its grand canonicallike version gcadress to the molecular dynamics simulation of 13dimethylimidazolium chloride we show that the partitioning of the total system in a subsystem of interest with atomistic details and a reservoir of coarsegrained particles leads to satisfactory results the challenging aspect of this study compared to previous adress simulations is the presence of charged particles and the necessity of addressing the question about the minimal physical input needed to model the coarsegrained particles in the reservoir we propose two different approaches and show that in both cases they are sufficient to capture the decisive physical characteristics that allow a valid systemreservoir coupling the technical satisfactory result paves the way for multiscale analysis of ionic liquids and for truly open boundary molecular simulations | [['we', 'extend', 'the', 'use', 'of', 'the', 'adaptive', 'resolution', 'method', 'adress', 'in', 'its', 'grand', 'canonicallike', 'version', 'gcadress', 'to', 'the', 'molecular', 'dynamics', 'simulation', 'of', '13dimethylimidazolium', 'chloride', 'we', 'show', 'that', 'the', 'partitioning', 'of', 'the', 'total', 'system', 'in', 'a', 'subsystem', 'of', 'interest', 'with', 'atomistic', 'details', 'and', 'a', 'reservoir', 'of', 'coarsegrained', 'particles', 'leads', 'to', 'satisfactory', 'results', 'the', 'challenging', 'aspect', 'of', 'this', 'study', 'compared', 'to', 'previous', 'adress', 'simulations', 'is', 'the', 'presence', 'of', 'charged', 'particles', 'and', 'the', 'necessity', 'of', 'addressing', 'the', 'question', 'about', 'the', 'minimal', 'physical', 'input', 'needed', 'to', 'model', 'the', 'coarsegrained', 'particles', 'in', 'the', 'reservoir', 'we', 'propose', 'two', 'different', 'approaches', 'and', 'show', 'that', 'in', 'both', 'cases', 'they', 'are', 'sufficient', 'to', 'capture', 'the', 'decisive', 'physical', 'characteristics', 'that', 'allow', 'a', 'valid', 'systemreservoir', 'coupling', 'the', 'technical', 'satisfactory', 'result', 'paves', 'the', 'way', 'for', 'multiscale', 'analysis', 'of', 'ionic', 'liquids', 'and', 'for', 'truly', 'open', 'boundary', 'molecular', 'simulations']] | [-0.10586595869519644, 0.07849154212960491, -0.08609467864864402, 0.06635349549491096, 0.009325344720855356, -0.1216088228837449, 0.02717199592626895, 0.3513271753607249, -0.2263680351242699, -0.32666449891058386, 0.049664573016128054, -0.22527217469005673, -0.1277558854194703, 0.14769993530137948, -0.04087754618031559, 0.08055693935559786, 0.10230291747246627, -0.04537239101266971, -0.03750429382392516, -0.2101393646646843, 0.2782689384529712, 0.09167518851657709, 0.25401869404681576, 0.10143430601391527, 0.11510553000563825, -0.02089667464606464, -0.02116879404315518, 0.018228879249404095, -0.1673836933991643, 0.14320313223654887, 0.2149008445372736, 0.08154699215837927, 0.27070711528261504, -0.47146807347458825, -0.21952839563600718, 0.05724869037426456, 0.14403580351629192, 0.15024934471067455, -0.04561422947380278, -0.23094719184079657, 0.06054648057454162, -0.14773031705300566, -0.15868671697184997, -0.11179328176658601, -0.025247974845546264, 0.019082420218176223, -0.25595540925860405, 0.09403702458711687, 0.05991930802076779, 0.03178503127699649, -0.08236868975735787, -0.09554273167331875, 0.022540559857669805, 0.15222204349831575, 0.012938270908435462, -0.01590772777347377, 0.16838840313462747, -0.14270420761916924, -0.082844822746874, 0.4250527700892201, -0.04811633160268819, -0.23176182000725357, 0.2712756077517514, -0.13369946725907977, -0.1507366806872327, 0.12233457568800077, 0.1257018297013861, 0.10469040228053927, -0.16696103742363413, 0.06146006852698823, -0.07130791246804788, 0.18242086558688983, 0.0049710609743164645, 0.03709466506002678, 0.19551240256125177, 0.21872665963170154, 0.03114287903170205, 0.15163259578144384, -0.06930693181024658, -0.15709730757193432, -0.28222196720264575, -0.1858407209937771, -0.16430249140183958, 0.02954342441236669, -0.08241998892130882, -0.13341949773236625, 0.3869651006327735, 0.24533231492257782, 0.1608711105150481, 0.03676191943663138, 0.2870824676524434, 0.026952351427731898, 0.0276016835640702, 0.03040907676504166, 0.21846014588588367, 0.12240786203355701, 0.11021333439016921, -0.2706825154281601, 0.038744884009335054, 0.04167364304885268] |
1,802.10414 | Multigap Superconductivity in a charge density wave superconductor
LaPt2Si2 | The superconducting gap structure of a charge density wave (CDW)
superconductor LaPt$_2$Si$_2$ ($T_c$ = 1.6~K) having a quasi two dimensional
crystal structure has been investigated using muon spin rotation/relaxation
($\mu$SR) measurements carried out in transverse field (TF), zero field (ZF)
and longitudinal field (LF) geometries. Rigorous analysis of TF-$\mu$SR spectra
in the superconducting state corroborates that the temperature dependence of
the effective penetration depth, $\lambda_L$, derived from muon spin
depolarization, fits to an isotropic $s+s-$wave model suggesting that the Fermi
surface contains two gaps of different magnitude rather than an isotropic gap
expected for a conventional $s-$wave superconductor. On the other hand, ZF
$\mu$SR data do not show any significant change in muon spin relaxation rate
above and below the superconducting transition indicating the fact that
time-reversal symmetry is preserved in the system.
| cond-mat.supr-con cond-mat.str-el | the superconducting gap structure of a charge density wave cdw superconductor lapt_2si_2 t_c 16k having a quasi two dimensional crystal structure has been investigated using muon spin rotationrelaxation musr measurements carried out in transverse field tf zero field zf and longitudinal field lf geometries rigorous analysis of tfmusr spectra in the superconducting state corroborates that the temperature dependence of the effective penetration depth lambda_l derived from muon spin depolarization fits to an isotropic sswave model suggesting that the fermi surface contains two gaps of different magnitude rather than an isotropic gap expected for a conventional swave superconductor on the other hand zf musr data do not show any significant change in muon spin relaxation rate above and below the superconducting transition indicating the fact that timereversal symmetry is preserved in the system | [['the', 'superconducting', 'gap', 'structure', 'of', 'a', 'charge', 'density', 'wave', 'cdw', 'superconductor', 'lapt_2si_2', 't_c', '16k', 'having', 'a', 'quasi', 'two', 'dimensional', 'crystal', 'structure', 'has', 'been', 'investigated', 'using', 'muon', 'spin', 'rotationrelaxation', 'musr', 'measurements', 'carried', 'out', 'in', 'transverse', 'field', 'tf', 'zero', 'field', 'zf', 'and', 'longitudinal', 'field', 'lf', 'geometries', 'rigorous', 'analysis', 'of', 'tfmusr', 'spectra', 'in', 'the', 'superconducting', 'state', 'corroborates', 'that', 'the', 'temperature', 'dependence', 'of', 'the', 'effective', 'penetration', 'depth', 'lambda_l', 'derived', 'from', 'muon', 'spin', 'depolarization', 'fits', 'to', 'an', 'isotropic', 'sswave', 'model', 'suggesting', 'that', 'the', 'fermi', 'surface', 'contains', 'two', 'gaps', 'of', 'different', 'magnitude', 'rather', 'than', 'an', 'isotropic', 'gap', 'expected', 'for', 'a', 'conventional', 'swave', 'superconductor', 'on', 'the', 'other', 'hand', 'zf', 'musr', 'data', 'do', 'not', 'show', 'any', 'significant', 'change', 'in', 'muon', 'spin', 'relaxation', 'rate', 'above', 'and', 'below', 'the', 'superconducting', 'transition', 'indicating', 'the', 'fact', 'that', 'timereversal', 'symmetry', 'is', 'preserved', 'in', 'the', 'system']] | [-0.20016166340263392, 0.23030881856891827, -0.06322123571722345, 0.09376931174704099, -0.07662771361400232, -0.15366391068902996, 0.061954690954845515, 0.36506986062070634, -0.2046704477856331, -0.24379853586750952, -0.011891346206098344, -0.34487739397974854, -0.007481002372294439, 0.2059892704983764, 0.10521663157939629, 0.03377548802404128, -0.06857706240032602, 0.02297489097250174, -0.2041669015042399, -0.19369378811185897, 0.306480453804728, 0.01936973752603852, 0.419204827193453, 0.07161353471350264, 0.055253158782954524, 0.01842007174855098, 0.10384080160204603, 0.050130014284866665, -0.1695445959224647, -0.03127586745981579, 0.26623987877974287, -0.06451320340398303, 0.10768596071548844, -0.43178909499141754, -0.252088263188136, 0.034047808609267864, 0.1475202829478252, 0.11929936297096763, -0.031091518679838344, -0.25671428039133776, 0.04251644299647799, -0.14637538789997273, -0.12766745628058826, -0.08306578328263255, -0.03525077306161014, -0.06237422034610063, -0.21348114180375088, 0.14950727036811065, 0.10457439018081817, 0.17820747625647168, -0.1151409982209743, -0.17416778689684262, -0.04639487932295059, -0.02426562424763247, 0.0941901551674219, 0.1336886491494211, 0.1636645328544546, -0.10434607270039895, -0.11285520816454664, 0.2538158805180115, -0.08696717943585651, -0.09016612357685738, 0.1262093918489744, -0.23753056853699187, -0.053001406426174624, 0.21642162709384027, 0.0757312161674208, 0.023040685982612722, -0.1446900742602972, 0.07892730817195226, -0.051418588991399505, 0.2519940795856669, 0.02809527871079009, 0.051598278428145655, 0.25060497091335215, 0.21115883465884536, 0.07082865955696131, 0.0886312397959762, -0.1748657188586411, -0.030898805534833984, -0.24225262728004687, -0.13760065534998747, -0.22476538431576706, 0.08905975732407322, -0.027850371386607134, -0.1496741722803563, 0.3750659932706957, 0.12548467786093004, 0.17616018975703893, -0.029240567949741628, 0.27754401078687585, 0.10190897614952657, 0.12072456203344645, 0.07332279911321221, 0.24819448548827716, 0.1945056003433737, 0.1194703010171934, -0.347270911137016, 0.037895964599694264, -0.015430819438982078] |
1,802.10415 | Independence and totalness of subspaces in phase space methods | The concepts of independence and totalness of subspaces are introduced in the
context of quasi-probability distributions in phase space, for quantum systems
with finite-dimensional Hilbert space. It is shown that due to the
non-distributivity of the lattice of subspaces, there are various levels of
independence, from pairwise independence up to (full) independence. Pairwise
totalness, totalness and other intermediate concepts are also introduced, which
roughly express that the subspaces overlap strongly among themselves, and they
cover the full Hilbert space. A duality between independence and totalness,
that involves orthocomplementation (logical NOT operation), is discussed.
Another approach to independence is also studied, using Rota's formalism on
independent partitions of the Hilbert space. This is used to define
informational independence, which is proved to be equivalent to independence.
As an application, the pentagram (used in discussions on contextuality) is
analyzed using these concepts.
| math-ph math.MP | the concepts of independence and totalness of subspaces are introduced in the context of quasiprobability distributions in phase space for quantum systems with finitedimensional hilbert space it is shown that due to the nondistributivity of the lattice of subspaces there are various levels of independence from pairwise independence up to full independence pairwise totalness totalness and other intermediate concepts are also introduced which roughly express that the subspaces overlap strongly among themselves and they cover the full hilbert space a duality between independence and totalness that involves orthocomplementation logical not operation is discussed another approach to independence is also studied using rotas formalism on independent partitions of the hilbert space this is used to define informational independence which is proved to be equivalent to independence as an application the pentagram used in discussions on contextuality is analyzed using these concepts | [['the', 'concepts', 'of', 'independence', 'and', 'totalness', 'of', 'subspaces', 'are', 'introduced', 'in', 'the', 'context', 'of', 'quasiprobability', 'distributions', 'in', 'phase', 'space', 'for', 'quantum', 'systems', 'with', 'finitedimensional', 'hilbert', 'space', 'it', 'is', 'shown', 'that', 'due', 'to', 'the', 'nondistributivity', 'of', 'the', 'lattice', 'of', 'subspaces', 'there', 'are', 'various', 'levels', 'of', 'independence', 'from', 'pairwise', 'independence', 'up', 'to', 'full', 'independence', 'pairwise', 'totalness', 'totalness', 'and', 'other', 'intermediate', 'concepts', 'are', 'also', 'introduced', 'which', 'roughly', 'express', 'that', 'the', 'subspaces', 'overlap', 'strongly', 'among', 'themselves', 'and', 'they', 'cover', 'the', 'full', 'hilbert', 'space', 'a', 'duality', 'between', 'independence', 'and', 'totalness', 'that', 'involves', 'orthocomplementation', 'logical', 'not', 'operation', 'is', 'discussed', 'another', 'approach', 'to', 'independence', 'is', 'also', 'studied', 'using', 'rotas', 'formalism', 'on', 'independent', 'partitions', 'of', 'the', 'hilbert', 'space', 'this', 'is', 'used', 'to', 'define', 'informational', 'independence', 'which', 'is', 'proved', 'to', 'be', 'equivalent', 'to', 'independence', 'as', 'an', 'application', 'the', 'pentagram', 'used', 'in', 'discussions', 'on', 'contextuality', 'is', 'analyzed', 'using', 'these', 'concepts']] | [-0.09418409600371629, 0.14506436194985456, -0.10133151888980398, 0.1220635063987824, -0.06146139266368534, -0.11640877643533583, 0.01007633447214695, 0.354030028624194, -0.28448422798620804, -0.2563291510201192, 0.0697659461218531, -0.22482541375793516, -0.14792596899538435, 0.1621544103138149, -0.11512498165081654, 0.043284379514599486, 0.015468960235843302, 0.041295613408354775, -0.08797152854552093, -0.31473691040716534, 0.361917191224971, 0.030023838272817165, 0.2804453295123364, 0.009909205527843109, 0.14950338564147905, 0.06458876803184727, -0.041380792054613785, 0.05339309241722471, -0.11031722356476946, 0.15180909102782608, 0.2979944181029818, 0.2071501104813381, 0.2560095361267616, -0.3657052275857755, -0.16377958600808468, 0.1353995476558339, 0.09261988586762787, 0.03361578734558342, 0.07664312418117854, -0.3089470676811678, 0.03901443935132452, -0.14061351064259986, -0.06096867823840252, -0.13479816782554346, 0.03965444697532803, -0.0034873594995588064, -0.24975247314266327, 0.017828523297378395, 0.09541156562710447, 0.08266308423397796, 0.004873989595632468, -0.0863284128451986, -0.035534797037585775, 0.09944340640712264, 0.008861972399920757, 0.011072656864832555, 0.06975498039142362, -0.0374295036957067, -0.1356456124190507, 0.35959629993885756, 0.027910295263115715, -0.24720871802419425, 0.21533570728830195, -0.13020917316233474, -0.1566112090900008, 0.07155768877627063, 0.0943154223529356, 0.05856314161459782, -0.12160181455048068, 0.13310222674626856, -0.08427094700746238, 0.11768295906118251, 0.09568268479446747, 0.11187344062990243, 0.13786095463105344, 0.08247215975342052, 0.07848683720720666, 0.1512364548784847, 0.004573859317627336, -0.13907886950931111, -0.3343578006007842, -0.16275985497364412, -0.21722383461892605, 0.02226537414337924, -0.08261230984727652, -0.16330405472773626, 0.3334081631286868, 0.14290140404731833, 0.19439328712012086, 0.037571640956282085, 0.23892907561634535, 0.10046969741233625, 0.07300691388081759, 0.03511335369465607, 0.18001863730273077, 0.21874741575281534, 0.007030942294347499, -0.14530375666301032, 0.05694131159356662, 0.12054580772362117] |
1,802.10416 | Inertial drag on a sphere settling in a stratified fluid | We compute the drag force on a sphere settling slowly in a quiescent, linearly stratified fluid. Stratification can significantly enhance the drag experienced by the settling particle. The magnitude of this effect depends on whether fluid-density transport around the settling particle is due to diffusion, to advection by the disturbance flow caused by the particle, or due to both. It therefore matters how efficiently the fluid disturbance is convected away from the particle by fluid-inertial terms. When these terms dominate, the Oseen drag force must be recovered. We compute by perturbation theory how the Oseen drag is modified by diffusion and stratification. Our results are in good agreement with recent direct-numerical simulation studies of the problem at small Reynolds numbers and large (but not too large) Froude numbers. | physics.flu-dyn | we compute the drag force on a sphere settling slowly in a quiescent linearly stratified fluid stratification can significantly enhance the drag experienced by the settling particle the magnitude of this effect depends on whether fluiddensity transport around the settling particle is due to diffusion to advection by the disturbance flow caused by the particle or due to both it therefore matters how efficiently the fluid disturbance is convected away from the particle by fluidinertial terms when these terms dominate the oseen drag force must be recovered we compute by perturbation theory how the oseen drag is modified by diffusion and stratification our results are in good agreement with recent directnumerical simulation studies of the problem at small reynolds numbers and large but not too large froude numbers | [['we', 'compute', 'the', 'drag', 'force', 'on', 'a', 'sphere', 'settling', 'slowly', 'in', 'a', 'quiescent', 'linearly', 'stratified', 'fluid', 'stratification', 'can', 'significantly', 'enhance', 'the', 'drag', 'experienced', 'by', 'the', 'settling', 'particle', 'the', 'magnitude', 'of', 'this', 'effect', 'depends', 'on', 'whether', 'fluiddensity', 'transport', 'around', 'the', 'settling', 'particle', 'is', 'due', 'to', 'diffusion', 'to', 'advection', 'by', 'the', 'disturbance', 'flow', 'caused', 'by', 'the', 'particle', 'or', 'due', 'to', 'both', 'it', 'therefore', 'matters', 'how', 'efficiently', 'the', 'fluid', 'disturbance', 'is', 'convected', 'away', 'from', 'the', 'particle', 'by', 'fluidinertial', 'terms', 'when', 'these', 'terms', 'dominate', 'the', 'oseen', 'drag', 'force', 'must', 'be', 'recovered', 'we', 'compute', 'by', 'perturbation', 'theory', 'how', 'the', 'oseen', 'drag', 'is', 'modified', 'by', 'diffusion', 'and', 'stratification', 'our', 'results', 'are', 'in', 'good', 'agreement', 'with', 'recent', 'directnumerical', 'simulation', 'studies', 'of', 'the', 'problem', 'at', 'small', 'reynolds', 'numbers', 'and', 'large', 'but', 'not', 'too', 'large', 'froude', 'numbers']] | [-0.12171432983316481, 0.25960152739658954, -0.0911905992180109, 0.030256758293136954, -0.05196575894579291, -0.09298588096350431, -0.012186807134188711, 0.2540425442010164, -0.31897950998321173, -0.3513768695108592, 0.09601073811016977, -0.2602490833774209, -0.12168182274140417, 0.19758026433177292, -0.0883723281621933, 0.025723879730328917, 0.07312142336554825, -0.016611695043742658, 0.03493236821889877, -0.24017641225084663, 0.31244776493683457, 0.1047511982396245, 0.2423353362195194, 0.08250281135737896, 0.07225049739703536, -0.042605970881879326, -0.04564184891432524, 0.12933853976428508, -0.16655517789162697, 0.020923981203697622, 0.16079913832619785, 0.0036659020110964774, 0.2657155458033085, -0.49020699824392794, -0.23440960646420717, 0.06064667671918869, 0.18557767446897924, 0.11918450323864818, -0.03863751252181828, -0.216743170902133, 0.04691048476472497, -0.16226011976599694, -0.13912854806426914, -0.05740615880489349, 0.06065417946875095, 0.05701270820200443, -0.23963848458603024, 0.15341531686484813, 0.05579518025368452, 0.033249018624424934, -0.06370519134122879, -0.05449048394709825, -0.044597310913726686, 0.09043389646080323, 0.150754741310142, 0.04258063341677189, 0.22392619917541742, -0.19910101826675236, -0.01300549927353859, 0.4402850104570389, -0.10403693652153015, -0.284629773914814, 0.22685521829873323, -0.17849888080358506, 0.012270268816500902, 0.19641744859516622, 0.19600604061037302, 0.12152170164510608, -0.060846549785346725, 0.04368887774273753, -0.04805913956649602, 0.14113046604394913, 0.09135454053059221, -0.09563198259525234, 0.22478977004438638, 0.10096401907503605, 0.0667312302365899, 0.10978634554240853, -0.10516789767332375, -0.11775747177936137, -0.2475462813079357, -0.10729466284066438, -0.18561141163110734, 0.045841161960852334, -0.10908121103770099, -0.1344571506602806, 0.30515447817742825, 0.16359877537563444, 0.18125297643989324, 0.03964109964668751, 0.3508563882783055, 0.1681397725986317, 0.062481643714010715, 0.12158404595777392, 0.30624532797932624, 0.1577924024499953, 0.12336078714579343, -0.3016799254436046, 0.09125273252930492, 0.09966382370330393] |
1,802.10417 | WACA: Wearable-Assisted Continuous Authentication | One-time login process in conventional authentication systems does not
guarantee that the identified user is the actual user throughout the session.
However, it is necessary to re-verify the user identity periodically throughout
a login session without reducing the user convenience. Continuous
authentication can address this issue. However, existing methods are either not
reliable or not usable. In this paper, we introduce a usable and reliable
method called Wearable Assisted Continuous Authentication (WACA). WACA relies
on the sensor based keystroke dynamics, where the authentication data is
acquired through the built in sensors of a wearable (e.g., smartwatch) while
the user is typing. We implemented the WACA framework and evaluated its
performance on real devices with real users. The empirical evaluation of WACA
reveals that WACA is feasible and its error rate is as low as 1 percent with 30
seconds of processing time and 2 3% for 20 seconds. The computational overhead
is minimal. Furthermore, we tested WACA against different attack scenarios.
WACA is capable of identifying insider threats with very high accuracy (99.2%)
and also robust against powerful adversaries such as imitation and statistical
attackers.
| cs.CR | onetime login process in conventional authentication systems does not guarantee that the identified user is the actual user throughout the session however it is necessary to reverify the user identity periodically throughout a login session without reducing the user convenience continuous authentication can address this issue however existing methods are either not reliable or not usable in this paper we introduce a usable and reliable method called wearable assisted continuous authentication waca waca relies on the sensor based keystroke dynamics where the authentication data is acquired through the built in sensors of a wearable eg smartwatch while the user is typing we implemented the waca framework and evaluated its performance on real devices with real users the empirical evaluation of waca reveals that waca is feasible and its error rate is as low as 1 percent with 30 seconds of processing time and 2 3 for 20 seconds the computational overhead is minimal furthermore we tested waca against different attack scenarios waca is capable of identifying insider threats with very high accuracy 992 and also robust against powerful adversaries such as imitation and statistical attackers | [['onetime', 'login', 'process', 'in', 'conventional', 'authentication', 'systems', 'does', 'not', 'guarantee', 'that', 'the', 'identified', 'user', 'is', 'the', 'actual', 'user', 'throughout', 'the', 'session', 'however', 'it', 'is', 'necessary', 'to', 'reverify', 'the', 'user', 'identity', 'periodically', 'throughout', 'a', 'login', 'session', 'without', 'reducing', 'the', 'user', 'convenience', 'continuous', 'authentication', 'can', 'address', 'this', 'issue', 'however', 'existing', 'methods', 'are', 'either', 'not', 'reliable', 'or', 'not', 'usable', 'in', 'this', 'paper', 'we', 'introduce', 'a', 'usable', 'and', 'reliable', 'method', 'called', 'wearable', 'assisted', 'continuous', 'authentication', 'waca', 'waca', 'relies', 'on', 'the', 'sensor', 'based', 'keystroke', 'dynamics', 'where', 'the', 'authentication', 'data', 'is', 'acquired', 'through', 'the', 'built', 'in', 'sensors', 'of', 'a', 'wearable', 'eg', 'smartwatch', 'while', 'the', 'user', 'is', 'typing', 'we', 'implemented', 'the', 'waca', 'framework', 'and', 'evaluated', 'its', 'performance', 'on', 'real', 'devices', 'with', 'real', 'users', 'the', 'empirical', 'evaluation', 'of', 'waca', 'reveals', 'that', 'waca', 'is', 'feasible', 'and', 'its', 'error', 'rate', 'is', 'as', 'low', 'as', '1', 'percent', 'with', '30', 'seconds', 'of', 'processing', 'time', 'and', '2', '3', 'for', '20', 'seconds', 'the', 'computational', 'overhead', 'is', 'minimal', 'furthermore', 'we', 'tested', 'waca', 'against', 'different', 'attack', 'scenarios', 'waca', 'is', 'capable', 'of', 'identifying', 'insider', 'threats', 'with', 'very', 'high', 'accuracy', '992', 'and', 'also', 'robust', 'against', 'powerful', 'adversaries', 'such', 'as', 'imitation', 'and', 'statistical', 'attackers']] | [-0.15587374557162056, 0.004488116749436469, -0.047079258763256505, 0.05535646781261037, -0.10523450078373472, -0.2902514287018897, 0.11599124994670117, 0.3952149297337274, -0.21982194064601915, -0.32654597654535966, 0.15156642324228242, -0.28298059599725783, -0.1290488658082747, 0.21583055144339497, -0.16844424822090848, 0.09431963161175215, 0.05639796795172466, 0.061685736049470065, -0.02078438627964666, -0.288739339889002, 0.2576610457806571, 0.07702371901958376, 0.3242644580307643, 0.07123281950181401, 0.10829546342641619, 0.02488798970683805, -0.041535955481231214, -0.04459679087756101, -0.03480650989466183, 0.08162153542444513, 0.30485843255914546, 0.23025572626675303, 0.3316647728678544, -0.41972298220907517, -0.1799949164653348, 0.06457100963043805, 0.14806681944559189, 0.07425218806224497, -0.08275261039946329, -0.3360291166004498, 0.1715207354518006, -0.2415590787507795, -0.032421880954093096, -0.08222318133590995, -0.018678269130051942, 0.01089615714956528, -0.27637545257756435, 0.02861398633151013, 0.00540277703438659, 0.12995834296468545, -0.009177859668459467, -0.017945355701738514, 0.011173193994280253, 0.18237221624979094, 0.04070367793461333, -0.0016950737257060166, 0.20191818849636695, -0.09954307042251063, -0.11738661460993761, 0.38268846305766824, -0.0026129855233169084, -0.18234301976658202, 0.20432290682896367, -0.023131377311624787, -0.10555347059475811, 0.12474534534219954, 0.17591169170682897, 0.10991898936068488, -0.17931002243044408, 0.013614330217525413, 0.023520504826730168, 0.2510363828227226, 0.02451257433717114, 0.034555070411816644, 0.13598220554318882, 0.20294934749521465, 0.044069499534403755, 0.07365654378223258, -0.10848097534397164, -0.06856249398740663, -0.23793377368270444, -0.1550936845030535, -0.19758831898530793, 0.0017629485680388185, -0.07279705162414954, -0.11657154287331159, 0.36453300051995224, 0.21044409036686695, 0.11873680975011273, 0.0854806592675379, 0.41958169236250625, 0.02909366173128522, 0.08884939527063555, 0.10846971681316359, 0.17920048346466108, -0.054491225974885996, 0.1650108775413419, -0.1469786138827535, 0.18015665018528298, -0.019789542298059206] |
1,802.10418 | On the Sublinear Convergence of Randomly Perturbed Alternating Gradient
Descent to Second Order Stationary Solutions | The alternating gradient descent (AGD) is a simple but popular algorithm
which has been applied to problems in optimization, machine learning, data
ming, and signal processing, etc. The algorithm updates two blocks of variables
in an alternating manner, in which a gradient step is taken on one block, while
keeping the remaining block fixed. When the objective function is nonconvex, it
is well-known the AGD converges to the first-order stationary solution with a
global sublinear rate.
In this paper, we show that a variant of AGD-type algorithms will not be
trapped by "bad" stationary solutions such as saddle points and local maximum
points. In particular, we consider a smooth unconstrained optimization problem,
and propose a perturbed AGD (PA-GD) which converges (with high probability) to
the set of second-order stationary solutions (SS2) with a global sublinear
rate. To the best of our knowledge, this is the first alternating type
algorithm which takes $\mathcal{O}(\text{polylog}(d)/\epsilon^{7/3})$
iterations to achieve SS2 with high probability [where polylog$(d)$ is
polynomial of the logarithm of dimension $d$ of the problem].
| math.OC cs.IT math.IT stat.ML | the alternating gradient descent agd is a simple but popular algorithm which has been applied to problems in optimization machine learning data ming and signal processing etc the algorithm updates two blocks of variables in an alternating manner in which a gradient step is taken on one block while keeping the remaining block fixed when the objective function is nonconvex it is wellknown the agd converges to the firstorder stationary solution with a global sublinear rate in this paper we show that a variant of agdtype algorithms will not be trapped by bad stationary solutions such as saddle points and local maximum points in particular we consider a smooth unconstrained optimization problem and propose a perturbed agd pagd which converges with high probability to the set of secondorder stationary solutions ss2 with a global sublinear rate to the best of our knowledge this is the first alternating type algorithm which takes mathcalotextpolylogdepsilon73 iterations to achieve ss2 with high probability where polylogd is polynomial of the logarithm of dimension d of the problem | [['the', 'alternating', 'gradient', 'descent', 'agd', 'is', 'a', 'simple', 'but', 'popular', 'algorithm', 'which', 'has', 'been', 'applied', 'to', 'problems', 'in', 'optimization', 'machine', 'learning', 'data', 'ming', 'and', 'signal', 'processing', 'etc', 'the', 'algorithm', 'updates', 'two', 'blocks', 'of', 'variables', 'in', 'an', 'alternating', 'manner', 'in', 'which', 'a', 'gradient', 'step', 'is', 'taken', 'on', 'one', 'block', 'while', 'keeping', 'the', 'remaining', 'block', 'fixed', 'when', 'the', 'objective', 'function', 'is', 'nonconvex', 'it', 'is', 'wellknown', 'the', 'agd', 'converges', 'to', 'the', 'firstorder', 'stationary', 'solution', 'with', 'a', 'global', 'sublinear', 'rate', 'in', 'this', 'paper', 'we', 'show', 'that', 'a', 'variant', 'of', 'agdtype', 'algorithms', 'will', 'not', 'be', 'trapped', 'by', 'bad', 'stationary', 'solutions', 'such', 'as', 'saddle', 'points', 'and', 'local', 'maximum', 'points', 'in', 'particular', 'we', 'consider', 'a', 'smooth', 'unconstrained', 'optimization', 'problem', 'and', 'propose', 'a', 'perturbed', 'agd', 'pagd', 'which', 'converges', 'with', 'high', 'probability', 'to', 'the', 'set', 'of', 'secondorder', 'stationary', 'solutions', 'ss2', 'with', 'a', 'global', 'sublinear', 'rate', 'to', 'the', 'best', 'of', 'our', 'knowledge', 'this', 'is', 'the', 'first', 'alternating', 'type', 'algorithm', 'which', 'takes', 'mathcalotextpolylogdepsilon73', 'iterations', 'to', 'achieve', 'ss2', 'with', 'high', 'probability', 'where', 'polylogd', 'is', 'polynomial', 'of', 'the', 'logarithm', 'of', 'dimension', 'd', 'of', 'the', 'problem']] | [-0.11433946698237232, 0.02068195510016735, -0.09182415012622902, 0.029476642349635707, -0.07422530479293823, -0.17908809314063096, 0.046886246517085686, 0.37211098217201477, -0.3303808940122642, -0.26457810363065476, 0.14751572685644096, -0.25433416305297224, -0.16273253871067345, 0.14013078960537712, -0.10374187577595746, 0.11242691567443179, 0.0526710574256157, 0.07956464628870846, -0.09018169929130146, -0.3223992098830971, 0.25128083996276357, 0.022534185846903795, 0.2720273170543052, -0.02293576586980527, 0.1667870416184722, -0.0026925921566872553, 0.036035108265498675, 0.03737044138778772, -0.06641937441423504, 0.10282438290277882, 0.26399697028872, 0.16555121212029422, 0.35266113448777847, -0.38636029864380345, -0.16249403570015425, 0.17284306108720116, 0.1751143590308803, 0.11812774014394709, -0.04706515138073323, -0.21500316409383124, 0.12398301715240675, -0.0940662452264981, -0.09762989186830598, -0.05892273917044761, -0.014192590850939941, 0.06333805665824309, -0.3456284631534132, 0.0506446011972024, 0.08394039543235354, 0.0020560703609557546, -0.04337202580425249, -0.10101179045090485, 0.05086774081157069, 0.0640544691476103, 0.07820467679477544, 0.11006680895028824, 0.09524448638087546, -0.0952883853588099, -0.11544866810315813, 0.3519806722978119, -0.08435595862170649, -0.2201985428853721, 0.16147177165770937, -0.06636482247250629, -0.1426129244025466, 0.1454854400872567, 0.18770876923057983, 0.19003569075462998, -0.1339506363629993, 0.10617248176565372, -0.06608305818583132, 0.15231754254141944, 0.04197559164859046, -0.04338114377188348, 0.11987187871268604, 0.15646297026410272, 0.20709948532129005, 0.1631744022270356, -0.05900404102392164, -0.1418768662253957, -0.27209577886539255, -0.14269261481240392, -0.2027337388424809, 0.015094842945074679, -0.12421857431979048, -0.19675395497776701, 0.38392305572533747, 0.09840476128876142, 0.22567429275048026, 0.10919646277456109, 0.3252919884563903, 0.16393436147831725, 0.03241219893979603, 0.14871536371347732, 0.18520067160061876, 0.08793176182948009, 0.09273085286207056, -0.2091179747071073, 0.08227425038307552, 0.1397227551677876] |
1,802.10419 | Convolutional Neural Networks with Alternately Updated Clique | Improving information flow in deep networks helps to ease the training
difficulties and utilize parameters more efficiently. Here we propose a new
convolutional neural network architecture with alternately updated clique
(CliqueNet). In contrast to prior networks, there are both forward and backward
connections between any two layers in the same block. The layers are
constructed as a loop and are updated alternately. The CliqueNet has some
unique properties. For each layer, it is both the input and output of any other
layer in the same block, so that the information flow among layers is
maximized. During propagation, the newly updated layers are concatenated to
re-update previously updated layer, and parameters are reused for multiple
times. This recurrent feedback structure is able to bring higher level visual
information back to refine low-level filters and achieve spatial attention. We
analyze the features generated at different stages and observe that using
refined features leads to a better result. We adopt a multi-scale feature
strategy that effectively avoids the progressive growth of parameters.
Experiments on image recognition datasets including CIFAR-10, CIFAR-100, SVHN
and ImageNet show that our proposed models achieve the state-of-the-art
performance with fewer parameters.
| cs.CV | improving information flow in deep networks helps to ease the training difficulties and utilize parameters more efficiently here we propose a new convolutional neural network architecture with alternately updated clique cliquenet in contrast to prior networks there are both forward and backward connections between any two layers in the same block the layers are constructed as a loop and are updated alternately the cliquenet has some unique properties for each layer it is both the input and output of any other layer in the same block so that the information flow among layers is maximized during propagation the newly updated layers are concatenated to reupdate previously updated layer and parameters are reused for multiple times this recurrent feedback structure is able to bring higher level visual information back to refine lowlevel filters and achieve spatial attention we analyze the features generated at different stages and observe that using refined features leads to a better result we adopt a multiscale feature strategy that effectively avoids the progressive growth of parameters experiments on image recognition datasets including cifar10 cifar100 svhn and imagenet show that our proposed models achieve the stateoftheart performance with fewer parameters | [['improving', 'information', 'flow', 'in', 'deep', 'networks', 'helps', 'to', 'ease', 'the', 'training', 'difficulties', 'and', 'utilize', 'parameters', 'more', 'efficiently', 'here', 'we', 'propose', 'a', 'new', 'convolutional', 'neural', 'network', 'architecture', 'with', 'alternately', 'updated', 'clique', 'cliquenet', 'in', 'contrast', 'to', 'prior', 'networks', 'there', 'are', 'both', 'forward', 'and', 'backward', 'connections', 'between', 'any', 'two', 'layers', 'in', 'the', 'same', 'block', 'the', 'layers', 'are', 'constructed', 'as', 'a', 'loop', 'and', 'are', 'updated', 'alternately', 'the', 'cliquenet', 'has', 'some', 'unique', 'properties', 'for', 'each', 'layer', 'it', 'is', 'both', 'the', 'input', 'and', 'output', 'of', 'any', 'other', 'layer', 'in', 'the', 'same', 'block', 'so', 'that', 'the', 'information', 'flow', 'among', 'layers', 'is', 'maximized', 'during', 'propagation', 'the', 'newly', 'updated', 'layers', 'are', 'concatenated', 'to', 'reupdate', 'previously', 'updated', 'layer', 'and', 'parameters', 'are', 'reused', 'for', 'multiple', 'times', 'this', 'recurrent', 'feedback', 'structure', 'is', 'able', 'to', 'bring', 'higher', 'level', 'visual', 'information', 'back', 'to', 'refine', 'lowlevel', 'filters', 'and', 'achieve', 'spatial', 'attention', 'we', 'analyze', 'the', 'features', 'generated', 'at', 'different', 'stages', 'and', 'observe', 'that', 'using', 'refined', 'features', 'leads', 'to', 'a', 'better', 'result', 'we', 'adopt', 'a', 'multiscale', 'feature', 'strategy', 'that', 'effectively', 'avoids', 'the', 'progressive', 'growth', 'of', 'parameters', 'experiments', 'on', 'image', 'recognition', 'datasets', 'including', 'cifar10', 'cifar100', 'svhn', 'and', 'imagenet', 'show', 'that', 'our', 'proposed', 'models', 'achieve', 'the', 'stateoftheart', 'performance', 'with', 'fewer', 'parameters']] | [-0.06078661106238585, 0.05284551384479359, -0.05566256344515495, 0.037880633200060514, -0.10647360636561952, -0.19267778933324195, 0.040809107988102056, 0.47320315643662103, -0.31395047179191676, -0.318713367187354, 0.09303503812545733, -0.2734094037275229, -0.17604122109829434, 0.16341794299691048, -0.09044806509667998, 0.07417962796371382, 0.14491421943370292, 0.03175928444039845, -0.08870628298748107, -0.29905494692225365, 0.29588520478471997, 0.07286349484292302, 0.3256057800414662, -0.013067695514273413, 0.130755845060641, -0.06735851748220661, -0.030660409678670543, -0.03793662192211265, -0.07271886533314101, 0.14206832640116945, 0.2528723986266298, 0.14793539893377336, 0.2801612009079979, -0.48081352565161606, -0.26649781193204775, 0.04212614083718065, 0.1364570889208052, 0.11830209263130129, -0.022319212073901244, -0.27830297701804846, 0.12856680679346913, -0.13863507264032565, 0.019805291993112338, -0.10930227436046436, -0.0423433656838757, 0.007869848629915006, -0.31706247481834093, 0.008255374742297348, 0.07920057774477061, 0.00907935907019588, -0.017373404581415116, -0.15015283911415037, -0.06645295389671686, 0.21566144512503077, -0.010809696429758948, 0.047302642165930824, 0.12564899959655665, -0.17605153225527376, -0.12063295913554689, 0.29237730516781096, -0.07376959577335843, -0.20634068053945032, 0.20123099492710064, -0.020534011163772205, -0.13342203145659476, 0.09810358176017722, 0.21988078001295291, 0.08531777194095036, -0.15001451221162887, -0.019519811704331053, -0.038819845859454104, 0.21470379253120098, 0.07474442743499167, 0.03197037426400043, 0.15718271255015184, 0.22565107810355367, 0.03968673039759908, 0.16468563343296025, -0.14859271935226084, -0.07950831799110072, -0.19725153620124464, -0.10102591756731272, -0.14257334431549584, -0.06810410761042798, -0.12861878057712658, -0.09463617312549441, 0.4231441504760552, 0.22301361504597245, 0.27003877905872525, 0.08219312585363037, 0.32517776023054484, 0.03241653053648031, 0.16091469278751266, 0.1406461875121942, 0.22546351521670766, 0.057812797652173134, 0.11306841288097005, -0.15930856926712852, 0.09671544646271431, 0.06819700605048744] |
1,802.1042 | Limits on Inferring the Past | Here we define and study the properties of retrodictive inference. We derive
equations relating retrodiction entropy and thermodynamic entropy, and as a
special case, show that under equilibrium conditions, the two are identical. We
demonstrate relations involving the KL-divergence and retrodiction probability,
and bound the time rate of change of retrodiction entropy. As a specific case,
we invert various Langevin processes, inferring the initial condition of \(N\)
particles given their final positions at some later time. We evaluate the
retrodiction entropy for Langevin dynamics exactly for special cases, and find
that one's ability to infer the initial state of a system can exhibit two
possible qualitative behaviors depending on the potential energy landscape,
either decreasing indefinitely, or asymptotically approaching a fixed value. We
also study how well we can retrodict points that evolve based on the logistic
map. We find singular changes in the retrodictivity near bifurcations.
Counterintuitively, the transition to chaos is accompanied by maximal
retrodictability.
| stat.OT cond-mat.stat-mech | here we define and study the properties of retrodictive inference we derive equations relating retrodiction entropy and thermodynamic entropy and as a special case show that under equilibrium conditions the two are identical we demonstrate relations involving the kldivergence and retrodiction probability and bound the time rate of change of retrodiction entropy as a specific case we invert various langevin processes inferring the initial condition of n particles given their final positions at some later time we evaluate the retrodiction entropy for langevin dynamics exactly for special cases and find that ones ability to infer the initial state of a system can exhibit two possible qualitative behaviors depending on the potential energy landscape either decreasing indefinitely or asymptotically approaching a fixed value we also study how well we can retrodict points that evolve based on the logistic map we find singular changes in the retrodictivity near bifurcations counterintuitively the transition to chaos is accompanied by maximal retrodictability | [['here', 'we', 'define', 'and', 'study', 'the', 'properties', 'of', 'retrodictive', 'inference', 'we', 'derive', 'equations', 'relating', 'retrodiction', 'entropy', 'and', 'thermodynamic', 'entropy', 'and', 'as', 'a', 'special', 'case', 'show', 'that', 'under', 'equilibrium', 'conditions', 'the', 'two', 'are', 'identical', 'we', 'demonstrate', 'relations', 'involving', 'the', 'kldivergence', 'and', 'retrodiction', 'probability', 'and', 'bound', 'the', 'time', 'rate', 'of', 'change', 'of', 'retrodiction', 'entropy', 'as', 'a', 'specific', 'case', 'we', 'invert', 'various', 'langevin', 'processes', 'inferring', 'the', 'initial', 'condition', 'of', 'n', 'particles', 'given', 'their', 'final', 'positions', 'at', 'some', 'later', 'time', 'we', 'evaluate', 'the', 'retrodiction', 'entropy', 'for', 'langevin', 'dynamics', 'exactly', 'for', 'special', 'cases', 'and', 'find', 'that', 'ones', 'ability', 'to', 'infer', 'the', 'initial', 'state', 'of', 'a', 'system', 'can', 'exhibit', 'two', 'possible', 'qualitative', 'behaviors', 'depending', 'on', 'the', 'potential', 'energy', 'landscape', 'either', 'decreasing', 'indefinitely', 'or', 'asymptotically', 'approaching', 'a', 'fixed', 'value', 'we', 'also', 'study', 'how', 'well', 'we', 'can', 'retrodict', 'points', 'that', 'evolve', 'based', 'on', 'the', 'logistic', 'map', 'we', 'find', 'singular', 'changes', 'in', 'the', 'retrodictivity', 'near', 'bifurcations', 'counterintuitively', 'the', 'transition', 'to', 'chaos', 'is', 'accompanied', 'by', 'maximal', 'retrodictability']] | [-0.13494254569936123, 0.1410611770806774, -0.12375686504547634, 0.10989998677940739, -0.02371063398557805, -0.1588668936563115, 0.08698370851869244, 0.3341074313607908, -0.26639155620078164, -0.2789898806461884, 0.10623064357411838, -0.29516650022818675, -0.16153951280059353, 0.16711631675641384, -0.041413525077364136, 0.0762227377283477, 0.06515429131085834, 0.08666893812121763, -0.1144294855083459, -0.21629566407852596, 0.3506181738279279, 0.0373318781054789, 0.27833702257053267, 0.049018405901733786, 0.11678705122021417, -0.010290701704305379, 0.02761039415134057, 0.0327965544049338, -0.1890560177597499, 0.0245128944873408, 0.1822579761606551, 0.14130785292495163, 0.24678661408683947, -0.41764491003968063, -0.19488939895264565, 0.16720797963620673, 0.1331195903446285, 0.13586420789361, -0.007581846624793064, -0.24525977502006197, 0.03394058015377772, -0.1324877448815612, -0.15104411470726312, -0.10769750592599232, 0.017214164115308274, 0.055773099758211646, -0.25735820563690315, 0.11263903848537725, 0.06356287146392729, 0.02612397247745145, -0.09108610881282198, -0.07979723524167052, -0.06474931129750104, 0.136670275965345, 0.054562400053105045, -0.023546297878267303, 0.15995398995376403, -0.12344383692116319, -0.10989374056638729, 0.32159082476320044, -0.08837995878796304, -0.2103973960367805, 0.20251716505585898, -0.14824322875769388, -0.12802293210801097, 0.05905057047944396, 0.1655169749613701, 0.13113972841491622, -0.1312562704506901, 0.03391425793224405, -0.01323590241673012, 0.14004524022100434, 0.09941505252894374, 0.030232891266895157, 0.1785869918553339, 0.10610076413750874, 0.07410419340500789, 0.1860331951129821, -0.06733371652362327, -0.17928952635453654, -0.3028486794131177, -0.1615932614621406, -0.16773749312926683, 0.0732766835770059, -0.10437646604297052, -0.15452154837473625, 0.36723222156626084, 0.16964718894591752, 0.2414164358900199, 0.098682149265322, 0.22069513486067374, 0.16742123264609085, -0.04228772580052816, 0.08966256353643633, 0.21461239736020235, 0.09366375840749712, 0.08685768796431441, -0.25019348920773593, 0.0970654587862232, 0.06446951687215798] |
1,802.10421 | Late metal-silicate separation on the IAB parent asteroid: Constraints
from combined W and Pt isotopes and thermal modelling | The short-lived $^{182}$Hf-$^{182}$W decay system is a powerful chronometer
for constraining the timing of metal-silicate separation and core formation in
planetesimals and planets. Neutron capture effects on W isotopes, however,
significantly hamper the application of this tool. In order to correct for
neutron capture effects, Pt isotopes have emerged as a reliable in-situ neutron
dosimeter. This study applies this method to IAB iron meteorites, in order to
constrain the timing of metal segregation on the IAB parent body. The
$\epsilon^{182}$W values obtained for the IAB iron meteorites range from -3.61
$\pm$ 0.10 to -2.73 $\pm$ 0.09. Correlating $\epsilon^{\mathrm{i}}$Pt with
$^{182}$W data yields a pre-neutron capture $^{182}$W of -2.90 $\pm$ 0.06. This
corresponds to a metal-silicate separation age of 6.0 $\pm$ 0.8 Ma after CAI
for the IAB parent body, and is interpreted to represent a body-wide melting
event. Later, between 10 and 14 Ma after CAI, an impact led to a catastrophic
break-up and subsequent reassembly of the parent body. Thermal models of the
interior evolution that are consistent with these estimates suggest that the
IAB parent body underwent metal-silicate separation as a result of internal
heating by short-lived radionuclides and accreted at around 1.4 $\pm$ 0.1 Ma
after CAIs with a radius of greater than 60 km.
| astro-ph.EP physics.geo-ph | the shortlived 182hf182w decay system is a powerful chronometer for constraining the timing of metalsilicate separation and core formation in planetesimals and planets neutron capture effects on w isotopes however significantly hamper the application of this tool in order to correct for neutron capture effects pt isotopes have emerged as a reliable insitu neutron dosimeter this study applies this method to iab iron meteorites in order to constrain the timing of metal segregation on the iab parent body the epsilon182w values obtained for the iab iron meteorites range from 361 pm 010 to 273 pm 009 correlating epsilonmathrmipt with 182w data yields a preneutron capture 182w of 290 pm 006 this corresponds to a metalsilicate separation age of 60 pm 08 ma after cai for the iab parent body and is interpreted to represent a bodywide melting event later between 10 and 14 ma after cai an impact led to a catastrophic breakup and subsequent reassembly of the parent body thermal models of the interior evolution that are consistent with these estimates suggest that the iab parent body underwent metalsilicate separation as a result of internal heating by shortlived radionuclides and accreted at around 14 pm 01 ma after cais with a radius of greater than 60 km | [['the', 'shortlived', '182hf182w', 'decay', 'system', 'is', 'a', 'powerful', 'chronometer', 'for', 'constraining', 'the', 'timing', 'of', 'metalsilicate', 'separation', 'and', 'core', 'formation', 'in', 'planetesimals', 'and', 'planets', 'neutron', 'capture', 'effects', 'on', 'w', 'isotopes', 'however', 'significantly', 'hamper', 'the', 'application', 'of', 'this', 'tool', 'in', 'order', 'to', 'correct', 'for', 'neutron', 'capture', 'effects', 'pt', 'isotopes', 'have', 'emerged', 'as', 'a', 'reliable', 'insitu', 'neutron', 'dosimeter', 'this', 'study', 'applies', 'this', 'method', 'to', 'iab', 'iron', 'meteorites', 'in', 'order', 'to', 'constrain', 'the', 'timing', 'of', 'metal', 'segregation', 'on', 'the', 'iab', 'parent', 'body', 'the', 'epsilon182w', 'values', 'obtained', 'for', 'the', 'iab', 'iron', 'meteorites', 'range', 'from', '361', 'pm', '010', 'to', '273', 'pm', '009', 'correlating', 'epsilonmathrmipt', 'with', '182w', 'data', 'yields', 'a', 'preneutron', 'capture', '182w', 'of', '290', 'pm', '006', 'this', 'corresponds', 'to', 'a', 'metalsilicate', 'separation', 'age', 'of', '60', 'pm', '08', 'ma', 'after', 'cai', 'for', 'the', 'iab', 'parent', 'body', 'and', 'is', 'interpreted', 'to', 'represent', 'a', 'bodywide', 'melting', 'event', 'later', 'between', '10', 'and', '14', 'ma', 'after', 'cai', 'an', 'impact', 'led', 'to', 'a', 'catastrophic', 'breakup', 'and', 'subsequent', 'reassembly', 'of', 'the', 'parent', 'body', 'thermal', 'models', 'of', 'the', 'interior', 'evolution', 'that', 'are', 'consistent', 'with', 'these', 'estimates', 'suggest', 'that', 'the', 'iab', 'parent', 'body', 'underwent', 'metalsilicate', 'separation', 'as', 'a', 'result', 'of', 'internal', 'heating', 'by', 'shortlived', 'radionuclides', 'and', 'accreted', 'at', 'around', '14', 'pm', '01', 'ma', 'after', 'cais', 'with', 'a', 'radius', 'of', 'greater', 'than', '60', 'km']] | [-0.05004747607404503, 0.16436830771151395, -0.06309175842282612, 0.039835203461144574, -0.004431872861459851, -0.07224212101683385, 0.07821460833046132, 0.3173412675560429, -0.19581732647209543, -0.38012634982786525, 0.06681890391983182, -0.33114801188022264, 0.02026210299170599, 0.1671648187017659, -0.051445386994902684, -0.015841643723997104, 0.07378034148139527, -0.005321672198163181, -0.11577084416796159, -0.1606743355173754, 0.2168267635401429, 0.08170506783602077, 0.17891749212654626, 0.03140197131873631, 0.04296713401989375, -0.04630169293263973, -0.010839103741525876, -0.06938741784883527, -0.17803183922511467, 0.0682699527727758, 0.20830749932120388, 0.10977124137258748, 0.2043916262231949, -0.36685334218711385, -0.20157926000580872, 0.06210484882793957, 0.15036489274792897, 0.03653089122366864, -0.06380279232838713, -0.24993406122084708, 0.14047515615664719, -0.25003218991772796, -0.16323984284408208, 0.061886517608697275, 0.11018371642283277, -0.021207108204934474, -0.28690901859947365, 0.15170201626719862, 0.036126868080393205, 0.0916068765160162, -0.12855219057556697, -0.20190557755541239, -0.057695359157443775, 0.06167307562967081, 0.05405291368980415, 0.07315971291305998, 0.18121388180226813, -0.02041076869908266, -0.020320427202528753, 0.40350737869966685, -0.05373292639319183, -0.014894786260158914, 0.19477991418140692, -0.1662980054232587, -0.13046244731536363, 0.23576311729905172, 0.17495321049056833, 0.1095918045560943, -0.17055245546578635, -0.04902355740948512, 0.0382045843519225, 0.23202211085547944, 0.09819300186979335, 0.03787950497892935, 0.29114853678975344, 0.19759271289562672, -0.0077442570437574985, 0.04145408308633217, -0.18692757459357381, -0.03393989858421974, -0.21196981425646966, -0.1515448038625281, -0.07726931560489281, 0.08368274914100766, -0.12345827300422371, -0.1008057928652639, 0.30134751049903924, 0.10542648859640083, 0.2187329689682484, -0.008583744638031576, 0.22234619355238067, 0.013540890171169872, 0.09321765932140917, 0.05163687719742018, 0.2968840592427225, 0.18612977424977212, 0.13246117972019242, -0.2318176530381074, 0.1573722183068351, 0.005738176060159032] |
1,802.10422 | Effect of Mars Atmospheric Loss on Snow Melt Potential in a 3.5-Gyr Mars
Climate Evolution Model | Post-Noachian Martian paleochannels indicate the existence of liquid water on
the surface of Mars after about 3.5 Gya (Irwin et al., 2015; Palucis et al.,
2016). In order to explore the effects of variations in CO$_{2}$ partial
pressure and obliquity on the possibility of surface water, we created a
zero-dimensional surface energy balance model. We combine this model with
physically consistent orbital histories to track conditions over the last 3.5
Gyr of Martian history. We find that melting is allowed for atmospheric
pressures corresponding to exponential loss rates of $dP/dt \propto t^{-3.73}$
or faster, but this rate is within $0.5 \sigma$ of the rate calculated from
initial measurements made by the Mars Atmosphere and Volatile EvolutioN (MAVEN)
mission, if we assume all the escaping oxygen measured by MAVEN comes from
atmospheric CO$_{2}$ (Lillis et al., 2017; Tu et al., 2015). Melting at this
loss rate matches selected key geologic constraints on the formation of
Hesperian river networks, assuming optimal melt conditions during the warmest
part of each Mars year (Irwin et al., 2015; Stopar et al., 2006; Kite et al.,
2017a,b). The atmospheric pressure has a larger effect on the surface energy
than changes in Mars's mean obliquity. These results show that initial
measurements of atmosphere loss by MAVEN are consistent with atmospheric loss
being the dominant process that switched Mars from a melt-permitting to a
melt-absent climate (Jakosky et al., 2017), but non-CO$_{2}$ warming will be
required if $<2$ Gya paleochannels are confirmed, or if most of the escaping
oxygen measured by MAVEN comes from H$_{2}$O.
| astro-ph.EP | postnoachian martian paleochannels indicate the existence of liquid water on the surface of mars after about 35 gya irwin et al 2015 palucis et al 2016 in order to explore the effects of variations in co_2 partial pressure and obliquity on the possibility of surface water we created a zerodimensional surface energy balance model we combine this model with physically consistent orbital histories to track conditions over the last 35 gyr of martian history we find that melting is allowed for atmospheric pressures corresponding to exponential loss rates of dpdt propto t373 or faster but this rate is within 05 sigma of the rate calculated from initial measurements made by the mars atmosphere and volatile evolution maven mission if we assume all the escaping oxygen measured by maven comes from atmospheric co_2 lillis et al 2017 tu et al 2015 melting at this loss rate matches selected key geologic constraints on the formation of hesperian river networks assuming optimal melt conditions during the warmest part of each mars year irwin et al 2015 stopar et al 2006 kite et al 2017ab the atmospheric pressure has a larger effect on the surface energy than changes in marss mean obliquity these results show that initial measurements of atmosphere loss by maven are consistent with atmospheric loss being the dominant process that switched mars from a meltpermitting to a meltabsent climate jakosky et al 2017 but nonco_2 warming will be required if 2 gya paleochannels are confirmed or if most of the escaping oxygen measured by maven comes from h_2o | [['postnoachian', 'martian', 'paleochannels', 'indicate', 'the', 'existence', 'of', 'liquid', 'water', 'on', 'the', 'surface', 'of', 'mars', 'after', 'about', '35', 'gya', 'irwin', 'et', 'al', '2015', 'palucis', 'et', 'al', '2016', 'in', 'order', 'to', 'explore', 'the', 'effects', 'of', 'variations', 'in', 'co_2', 'partial', 'pressure', 'and', 'obliquity', 'on', 'the', 'possibility', 'of', 'surface', 'water', 'we', 'created', 'a', 'zerodimensional', 'surface', 'energy', 'balance', 'model', 'we', 'combine', 'this', 'model', 'with', 'physically', 'consistent', 'orbital', 'histories', 'to', 'track', 'conditions', 'over', 'the', 'last', '35', 'gyr', 'of', 'martian', 'history', 'we', 'find', 'that', 'melting', 'is', 'allowed', 'for', 'atmospheric', 'pressures', 'corresponding', 'to', 'exponential', 'loss', 'rates', 'of', 'dpdt', 'propto', 't373', 'or', 'faster', 'but', 'this', 'rate', 'is', 'within', '05', 'sigma', 'of', 'the', 'rate', 'calculated', 'from', 'initial', 'measurements', 'made', 'by', 'the', 'mars', 'atmosphere', 'and', 'volatile', 'evolution', 'maven', 'mission', 'if', 'we', 'assume', 'all', 'the', 'escaping', 'oxygen', 'measured', 'by', 'maven', 'comes', 'from', 'atmospheric', 'co_2', 'lillis', 'et', 'al', '2017', 'tu', 'et', 'al', '2015', 'melting', 'at', 'this', 'loss', 'rate', 'matches', 'selected', 'key', 'geologic', 'constraints', 'on', 'the', 'formation', 'of', 'hesperian', 'river', 'networks', 'assuming', 'optimal', 'melt', 'conditions', 'during', 'the', 'warmest', 'part', 'of', 'each', 'mars', 'year', 'irwin', 'et', 'al', '2015', 'stopar', 'et', 'al', '2006', 'kite', 'et', 'al', '2017ab', 'the', 'atmospheric', 'pressure', 'has', 'a', 'larger', 'effect', 'on', 'the', 'surface', 'energy', 'than', 'changes', 'in', 'marss', 'mean', 'obliquity', 'these', 'results', 'show', 'that', 'initial', 'measurements', 'of', 'atmosphere', 'loss', 'by', 'maven', 'are', 'consistent', 'with', 'atmospheric', 'loss', 'being', 'the', 'dominant', 'process', 'that', 'switched', 'mars', 'from', 'a', 'meltpermitting', 'to', 'a', 'meltabsent', 'climate', 'jakosky', 'et', 'al', '2017', 'but', 'nonco_2', 'warming', 'will', 'be', 'required', 'if', '2', 'gya', 'paleochannels', 'are', 'confirmed', 'or', 'if', 'most', 'of', 'the', 'escaping', 'oxygen', 'measured', 'by', 'maven', 'comes', 'from', 'h_2o']] | [-0.049296180582455086, 0.18087313241736527, -0.05270523056500561, 0.015694401246455235, -0.032304933787541346, -0.023163330517784363, 0.07711364719885282, 0.32880200267649223, -0.2100141021327281, -0.39677603495487523, 0.08084486642544489, -0.2859927915213179, -0.12072075426582277, 0.19125105209851398, -0.1261812922171122, 0.037394200451906785, 0.09106774506301829, -0.09763197810389102, -0.030049637850043515, -0.32944795858460446, 0.2208833900531904, 0.17454026083296706, 0.17157430576738872, 0.05162786927042274, 0.082761943728157, -0.05386939440711191, -0.04296744229706688, -0.04836596459180357, -0.22546686334560712, 0.022140384673108318, 0.18906235317380407, 0.12526388962625437, 0.20270682884673139, -0.4408958381860547, -0.2790691762441589, 0.055018233846978196, 0.013230483175345486, 0.05132683719960868, -0.03027516930371583, -0.24420348922966137, 0.017898770431788908, -0.1919328092687553, -0.11886475832697245, 0.046420953431797606, 0.10443475418686567, -0.011650399491871565, -0.30303986438581976, 0.13333676931459545, 0.06045356771961275, 0.11485493098922644, -0.12514676549378032, -0.1673982922370816, -0.17692816909778142, 0.04821966489450255, 0.01125233068828933, 0.06061042785867973, 0.1678980792752437, -0.033534025184757586, -0.023306875955313444, 0.3398366936880554, -0.10877826490849979, -0.009780054089553174, 0.2363428900679273, -0.17111602378258062, -0.1014930089323541, 0.1955005870776433, 0.16697993324018054, 0.08029223938173081, -0.14838393393626076, 0.06113916306358372, -0.05452678508816227, 0.19511694709475588, 0.14495363217617024, -0.06268840233350338, 0.24563593297986494, 0.1312499770724718, 0.048058143505195695, 0.03219390803180079, -0.15194738168630437, -0.06471742570753239, -0.1903276216283801, -0.1360628761131891, -0.13017738978387863, 0.04163542775636268, -0.015603532043432126, -0.08057775673636745, 0.3285511967527958, 0.1625810416317695, 0.19977731447321392, -0.013211304703990238, 0.2470414917615633, 0.0433892805003486, -0.0013500851271073184, 0.1617519789561195, 0.2984437530666905, 0.09039394495137516, 0.12901723764098866, -0.23898387857761624, 0.16500771071408846, 0.04740210242415478] |
1,802.10423 | $\rho J/\Psi$ Scattering in an Improved Many Body Potential | We calculate the cross-sections for the processes $\rho J/\psi\rightarrow
D^0\bar{D}^0$, $\rho J/\psi\rightarrow D^0\bar{D}^{0*}$ ($D^{0*}\bar{D}^{0}$)
and $\rho J/\psi\rightarrow D^{0*}\bar{D}^{0*}$ using a QCD-motivated many-body
overlap factor to modify the usual sum of two-body interaction model. The
realistic Cornell potential has been used for pairwise interaction in the four
quark Hamiltonian and noted to give lesser cross-sections as compared to the
quadratic potential. The Resonating group method is employed along with the
Born approximation which decouples its integral equations. It is pointed out
that the additional QCD effect (a gluonic field ovelap factor) result in a
significant suppression in the cross sections as compared to the more popular
sum of two-body interaction.
| hep-ph | we calculate the crosssections for the processes rho jpsirightarrow d0bard0 rho jpsirightarrow d0bard0 d0bard0 and rho jpsirightarrow d0bard0 using a qcdmotivated manybody overlap factor to modify the usual sum of twobody interaction model the realistic cornell potential has been used for pairwise interaction in the four quark hamiltonian and noted to give lesser crosssections as compared to the quadratic potential the resonating group method is employed along with the born approximation which decouples its integral equations it is pointed out that the additional qcd effect a gluonic field ovelap factor result in a significant suppression in the cross sections as compared to the more popular sum of twobody interaction | [['we', 'calculate', 'the', 'crosssections', 'for', 'the', 'processes', 'rho', 'jpsirightarrow', 'd0bard0', 'rho', 'jpsirightarrow', 'd0bard0', 'd0bard0', 'and', 'rho', 'jpsirightarrow', 'd0bard0', 'using', 'a', 'qcdmotivated', 'manybody', 'overlap', 'factor', 'to', 'modify', 'the', 'usual', 'sum', 'of', 'twobody', 'interaction', 'model', 'the', 'realistic', 'cornell', 'potential', 'has', 'been', 'used', 'for', 'pairwise', 'interaction', 'in', 'the', 'four', 'quark', 'hamiltonian', 'and', 'noted', 'to', 'give', 'lesser', 'crosssections', 'as', 'compared', 'to', 'the', 'quadratic', 'potential', 'the', 'resonating', 'group', 'method', 'is', 'employed', 'along', 'with', 'the', 'born', 'approximation', 'which', 'decouples', 'its', 'integral', 'equations', 'it', 'is', 'pointed', 'out', 'that', 'the', 'additional', 'qcd', 'effect', 'a', 'gluonic', 'field', 'ovelap', 'factor', 'result', 'in', 'a', 'significant', 'suppression', 'in', 'the', 'cross', 'sections', 'as', 'compared', 'to', 'the', 'more', 'popular', 'sum', 'of', 'twobody', 'interaction']] | [-0.10962431200163404, 0.15021880760926892, -0.1138216699646027, 0.12264895451436233, -0.037434966033928235, -0.13464440203582248, 0.04944522292094512, 0.30685565364547074, -0.22465395413477113, -0.22529926834007105, -0.04568901212553977, -0.34103416717024865, -0.0703584295956211, 0.11940157849608955, 0.11638317670224717, 0.09871697048085346, 0.06070443751350804, 0.07271398525659202, -0.0750780643752983, -0.2085929812208094, 0.2940661750897696, 0.029413815760226163, 0.18024049488249821, 0.15260854635508386, 0.032359486152590426, 0.07790634745766443, -0.039730359282758504, -0.039748216772245035, -0.11421333385139103, 0.029791592663429952, 0.2049309009291594, 0.04626477142166415, 0.17491360346321017, -0.36352094661237466, -0.16306856485230295, 0.12108100169010598, 0.161860917462036, 0.08324939494680923, -0.00021226275822738426, -0.3351776494247908, 0.024119115267509456, -0.26852247438014104, -0.12926550640690107, -0.10644798619776136, 0.04324201864073984, -0.049811943201348186, -0.3322338420526918, 0.10650956521621319, -0.03602496954543447, -0.00975103716848901, -0.03335561264086411, -0.24966682393871317, -0.0019816306777539904, 0.055365281528793275, 0.06220660726884725, 0.11119404201895965, 0.15752385935263225, -0.1498661620490667, -0.10199498187716084, 0.42795964026892624, -0.11731031599790892, -0.19638540721670897, 0.14807480074577378, -0.11827365035639593, -0.08546658481807551, 0.17173969026448, 0.16822780726511996, 0.06762171064663024, -0.20272705080936215, 0.12536701048978743, -0.027567465073877463, 0.12440428308521707, 0.0663609651469246, 0.04085383215418982, 0.10009721076629055, 0.1531414914470925, -0.00461006314597196, 0.1010439789560796, -0.08240765995880658, -0.14635594599854407, -0.32244532979610896, -0.0881890358631844, -0.12130351289589372, 0.06952169715077616, -0.06041997897894665, -0.13172014243900776, 0.34707312944293434, 0.08432128922841339, 0.21818607854139474, -0.003274772912306987, 0.3224555356083093, 0.16280793849404696, 0.11984808928833378, 0.03281557181401661, 0.30502852334865127, 0.23114402204131088, 0.047843046335468965, -0.2917080708106773, 0.024495515860272227, 0.07241783343703935] |
1,802.10424 | Analysis of imperfections in the coherent optical excitation of single
atoms to Rydberg states | We study experimentally various physical limitations and technical
imperfections that lead to damping and finite contrast of optically-driven Rabi
oscillations between ground and Rydberg states of a single atom. Finite
contrast is due to preparation and detection errors and we show how to model
and measure them accurately. Part of these errors originates from the finite
lifetime of Rydberg states and we observe its $n^3$-scaling with the principal
quantum number $n$. To explain the damping of Rabi oscillations, we use simple
numerical models, taking into account independently measured experimental
imperfections, and show that the observed damping actually results from the
accumulation of several small effects, each at the level of a few percents. We
discuss prospects for improving the coherence of ground-Rydberg Rabi
oscillations in view of applications in quantum simulation and quantum
information processing with arrays of single Rydberg atoms.
| physics.atom-ph quant-ph | we study experimentally various physical limitations and technical imperfections that lead to damping and finite contrast of opticallydriven rabi oscillations between ground and rydberg states of a single atom finite contrast is due to preparation and detection errors and we show how to model and measure them accurately part of these errors originates from the finite lifetime of rydberg states and we observe its n3scaling with the principal quantum number n to explain the damping of rabi oscillations we use simple numerical models taking into account independently measured experimental imperfections and show that the observed damping actually results from the accumulation of several small effects each at the level of a few percents we discuss prospects for improving the coherence of groundrydberg rabi oscillations in view of applications in quantum simulation and quantum information processing with arrays of single rydberg atoms | [['we', 'study', 'experimentally', 'various', 'physical', 'limitations', 'and', 'technical', 'imperfections', 'that', 'lead', 'to', 'damping', 'and', 'finite', 'contrast', 'of', 'opticallydriven', 'rabi', 'oscillations', 'between', 'ground', 'and', 'rydberg', 'states', 'of', 'a', 'single', 'atom', 'finite', 'contrast', 'is', 'due', 'to', 'preparation', 'and', 'detection', 'errors', 'and', 'we', 'show', 'how', 'to', 'model', 'and', 'measure', 'them', 'accurately', 'part', 'of', 'these', 'errors', 'originates', 'from', 'the', 'finite', 'lifetime', 'of', 'rydberg', 'states', 'and', 'we', 'observe', 'its', 'n3scaling', 'with', 'the', 'principal', 'quantum', 'number', 'n', 'to', 'explain', 'the', 'damping', 'of', 'rabi', 'oscillations', 'we', 'use', 'simple', 'numerical', 'models', 'taking', 'into', 'account', 'independently', 'measured', 'experimental', 'imperfections', 'and', 'show', 'that', 'the', 'observed', 'damping', 'actually', 'results', 'from', 'the', 'accumulation', 'of', 'several', 'small', 'effects', 'each', 'at', 'the', 'level', 'of', 'a', 'few', 'percents', 'we', 'discuss', 'prospects', 'for', 'improving', 'the', 'coherence', 'of', 'groundrydberg', 'rabi', 'oscillations', 'in', 'view', 'of', 'applications', 'in', 'quantum', 'simulation', 'and', 'quantum', 'information', 'processing', 'with', 'arrays', 'of', 'single', 'rydberg', 'atoms']] | [-0.1258962246489578, 0.2019241013115139, -0.025870654482527504, 0.047299348500590505, 0.007502532790281943, -0.13987902730503785, 0.0827900179761595, 0.35528351647247164, -0.26407446134502865, -0.3088772334324728, 0.045557873860317545, -0.2788935912307352, -0.11048906022583001, 0.2280917333954546, -0.029684198644411353, 0.06136615905727792, 0.10041457176474589, -0.005586901094232287, -0.049102720019540615, -0.21331863721300448, 0.265891726850532, 0.035752997824290235, 0.2868692451273091, 0.08808346497992586, 0.10052311207899557, -0.018751174441006567, 0.037487868232918636, -0.0032754659985325166, -0.1142067885209274, 0.0958417553945245, 0.2297556501292742, 0.058414119980963214, 0.26897565235516857, -0.4742981243479465, -0.19800963559786655, 0.09498269222676754, 0.13252815867973758, 0.2331182221832153, -0.035372262883798355, -0.32667477297197495, 0.025774605973024986, -0.170345720548981, -0.1008246945483344, -0.10721300830399351, 0.018801963618690413, 0.01778898424568719, -0.23054186344545866, 0.0648291438951024, 0.05012456907425076, 0.04855926391402526, -0.04776619022928311, -0.09066767400529768, 0.03562766095274128, 0.13314938880253716, 0.00900734125919241, -0.06890998199128912, 0.15900738836166317, -0.09637223328879502, -0.14797248212354525, 0.3861448098506246, -0.0953580270637758, -0.14947838384125914, 0.17609159468140986, -0.1886219540294925, -0.09252337308800114, 0.10197528382247713, 0.1403809978377207, 0.03377072880310672, -0.0568110248107197, 0.042975324275487635, 0.026150371999080692, 0.19133060443481165, 0.07681239935170327, 0.13680426887502628, 0.19655416679701634, 0.15367310063032033, 0.012799863780050406, 0.1545042264312672, -0.14057982168763244, -0.09074795691163412, -0.3046302332143698, -0.11254768608736672, -0.18536489972778197, 0.06592308293495859, -0.027712575423460555, -0.14466840976716153, 0.42076924734615856, 0.19600402062226618, 0.22637773443379305, 0.006898280983192048, 0.32026730644450124, 0.1050372188495073, 0.02991860513991144, 0.003229598161332043, 0.23826989382838032, 0.1765471787358235, 0.031123229921961735, -0.3272785736813343, 0.026233610337866205, -0.05859792659175582] |
1,802.10425 | Exponentiable Higher Toposes | We characterise the class of exponentiable $\infty$-toposes: $\mathcal X$ is
exponentiable if and only if $\mathcal S\mathrm{h}(\mathcal X)$ is a continuous
$\infty$-category. The heart of the proof is the description of the
$\infty$-category of $\mathcal C$-valued sheaves on $\mathcal X$ as an
$\infty$-category of functors that satisfy finite limits conditions as well as
filtered colimits conditions (instead of limits conditions purely); we call
such functors $\omega$-continuous sheaves.
As an application, we show that when $\mathcal X$ is exponentiable, its
$\infty$-category of stable sheaves $\mathcal S\mathrm{h}(\mathcal X,
\mathrm{Sp})$ is a dualisable object in the $\infty$-category of presentable
stable $\infty$-categories.
| math.CT math.AT | we characterise the class of exponentiable inftytoposes mathcal x is exponentiable if and only if mathcal smathrmhmathcal x is a continuous inftycategory the heart of the proof is the description of the inftycategory of mathcal cvalued sheaves on mathcal x as an inftycategory of functors that satisfy finite limits conditions as well as filtered colimits conditions instead of limits conditions purely we call such functors omegacontinuous sheaves as an application we show that when mathcal x is exponentiable its inftycategory of stable sheaves mathcal smathrmhmathcal x mathrmsp is a dualisable object in the inftycategory of presentable stable inftycategories | [['we', 'characterise', 'the', 'class', 'of', 'exponentiable', 'inftytoposes', 'mathcal', 'x', 'is', 'exponentiable', 'if', 'and', 'only', 'if', 'mathcal', 'smathrmhmathcal', 'x', 'is', 'a', 'continuous', 'inftycategory', 'the', 'heart', 'of', 'the', 'proof', 'is', 'the', 'description', 'of', 'the', 'inftycategory', 'of', 'mathcal', 'cvalued', 'sheaves', 'on', 'mathcal', 'x', 'as', 'an', 'inftycategory', 'of', 'functors', 'that', 'satisfy', 'finite', 'limits', 'conditions', 'as', 'well', 'as', 'filtered', 'colimits', 'conditions', 'instead', 'of', 'limits', 'conditions', 'purely', 'we', 'call', 'such', 'functors', 'omegacontinuous', 'sheaves', 'as', 'an', 'application', 'we', 'show', 'that', 'when', 'mathcal', 'x', 'is', 'exponentiable', 'its', 'inftycategory', 'of', 'stable', 'sheaves', 'mathcal', 'smathrmhmathcal', 'x', 'mathrmsp', 'is', 'a', 'dualisable', 'object', 'in', 'the', 'inftycategory', 'of', 'presentable', 'stable', 'inftycategories']] | [-0.1761376788545596, 0.06081832197623475, -0.09392146970096388, 0.08415822927153817, -0.05488297124883454, -0.11778800866419548, -0.026401142393679994, 0.4103867868843831, -0.4259182170866744, -0.0728071693723139, 0.09684499813562357, -0.192260835457005, -0.08748578068457152, 0.18468328189889066, -0.2750726911925564, -0.0820772788395468, 0.06963653784049184, 0.1477279631077851, -0.06857376955939751, -0.2156544683525633, 0.4441638794384505, -0.06701469094933647, 0.26309019628373026, 0.04794221901775975, 0.1636318490203274, -0.027579666880008423, 0.06963758207367439, -0.03306414632028655, -0.14947269403599325, 0.08371161686158494, 0.3570042767414921, 0.12200417399259382, 0.15044301090467918, -0.3450842775796589, -0.057588504176390796, 0.2275066933741695, 0.08230516704681673, -0.0653065814097461, 0.04212946612265353, -0.33000859065275445, 0.18275673031610878, -0.23634966404030197, -0.07807324089502034, -0.11544827341445182, 0.14784656052330608, 0.053446636977911875, -0.30532169560656736, -0.08959548523355472, 0.12983527077778587, 0.09944423937581871, -0.12455203418595422, -0.04009718108726175, -0.22451563232676372, 0.03637958905616726, -0.06634961530615233, 0.05998731063384759, 0.1781783773857904, -0.11389605333587449, -0.07334940202142062, 0.38645882308483126, -0.1157396566061499, -0.17954871942730327, 0.12637542296985263, -0.13930493352052412, -0.14182878314076286, 0.14244393694557642, -0.03591402632821547, 0.3086850386848183, 0.02596273122425804, 0.29028089333656487, -0.20637016630682506, 0.10064456317769854, 0.08799391220274724, 0.10910755035124327, 0.1165047137973536, 0.17424835105622677, 0.05449578399359445, 0.1058739920980052, 0.00935195705265199, 0.02377706020090141, -0.4300365605636647, -0.19354975828410764, -0.04674414636959371, 0.20464796608215885, -0.0672584277404607, -0.20279799085478054, 0.31882259005582647, 0.10615907030572233, 0.19252712946189077, 0.1818696541858739, 0.21407448582743344, 0.03919846465026862, -0.006852727765707593, -0.025129248755738923, 0.09841134514855711, 0.24295539014825696, -0.08251085985746039, -0.014063116182622157, -0.0007572622871712634, 0.2902975414242399] |
1,802.10426 | Fine-grained wound tissue analysis using deep neural network | Tissue assessment for chronic wounds is the basis of wound grading and
selection of treatment approaches. While several image processing approaches
have been proposed for automatic wound tissue analysis, there has been a
shortcoming in these approaches for clinical practices. In particular,
seemingly, all previous approaches have assumed only 3 tissue types in the
chronic wounds, while these wounds commonly exhibit 7 distinct tissue types
that presence of each one changes the treatment procedure. In this paper, for
the first time, we investigate the classification of 7 wound issue types. We
work with wound professionals to build a new database of 7 types of wound
tissue. We propose to use pre-trained deep neural networks for feature
extraction and classification at the patch-level. We perform experiments to
demonstrate that our approach outperforms other state-of-the-art. We will make
our database publicly available to facilitate research in wound assessment.
| cs.CV | tissue assessment for chronic wounds is the basis of wound grading and selection of treatment approaches while several image processing approaches have been proposed for automatic wound tissue analysis there has been a shortcoming in these approaches for clinical practices in particular seemingly all previous approaches have assumed only 3 tissue types in the chronic wounds while these wounds commonly exhibit 7 distinct tissue types that presence of each one changes the treatment procedure in this paper for the first time we investigate the classification of 7 wound issue types we work with wound professionals to build a new database of 7 types of wound tissue we propose to use pretrained deep neural networks for feature extraction and classification at the patchlevel we perform experiments to demonstrate that our approach outperforms other stateoftheart we will make our database publicly available to facilitate research in wound assessment | [['tissue', 'assessment', 'for', 'chronic', 'wounds', 'is', 'the', 'basis', 'of', 'wound', 'grading', 'and', 'selection', 'of', 'treatment', 'approaches', 'while', 'several', 'image', 'processing', 'approaches', 'have', 'been', 'proposed', 'for', 'automatic', 'wound', 'tissue', 'analysis', 'there', 'has', 'been', 'a', 'shortcoming', 'in', 'these', 'approaches', 'for', 'clinical', 'practices', 'in', 'particular', 'seemingly', 'all', 'previous', 'approaches', 'have', 'assumed', 'only', '3', 'tissue', 'types', 'in', 'the', 'chronic', 'wounds', 'while', 'these', 'wounds', 'commonly', 'exhibit', '7', 'distinct', 'tissue', 'types', 'that', 'presence', 'of', 'each', 'one', 'changes', 'the', 'treatment', 'procedure', 'in', 'this', 'paper', 'for', 'the', 'first', 'time', 'we', 'investigate', 'the', 'classification', 'of', '7', 'wound', 'issue', 'types', 'we', 'work', 'with', 'wound', 'professionals', 'to', 'build', 'a', 'new', 'database', 'of', '7', 'types', 'of', 'wound', 'tissue', 'we', 'propose', 'to', 'use', 'pretrained', 'deep', 'neural', 'networks', 'for', 'feature', 'extraction', 'and', 'classification', 'at', 'the', 'patchlevel', 'we', 'perform', 'experiments', 'to', 'demonstrate', 'that', 'our', 'approach', 'outperforms', 'other', 'stateoftheart', 'we', 'will', 'make', 'our', 'database', 'publicly', 'available', 'to', 'facilitate', 'research', 'in', 'wound', 'assessment']] | [-0.026896277793415198, 0.004809228429085996, -0.014868057989961889, 0.017389506937247026, -0.07698816578031505, -0.17420163562470306, -0.008896673083056581, 0.46384797428977, -0.18354423978837997, -0.2876974319758481, 0.11628427843113545, -0.2902477362690723, -0.20809136651941154, 0.22246464065671578, -0.13686552763061777, 0.06992873055732822, 0.10074603228274835, 0.006564005354597961, -0.02021305108672544, -0.3113384092009741, 0.2970326768269456, -0.015212472463034617, 0.39101917944108583, 0.03058039568036106, 0.07798258234485218, -0.026238627652063556, -0.062438255825800794, -0.010800958965101267, -0.12312877943393637, 0.16759105192857982, 0.3531370096048978, 0.21187311323193755, 0.3545394526022703, -0.48491188915038147, -0.2614717985382176, 0.08449033131401935, 0.18574066967256878, 0.13428583695897706, -0.009133002931277638, -0.24713166517026927, 0.08701802531180725, -0.17448741424376663, -0.06681536338036906, -0.12782727981190364, 0.016333840631127153, -0.027984043319346, -0.2349042105233322, 0.08263265525392728, 0.04138545969450106, 0.13397953254872397, -0.12099347090386875, -0.12729797408635385, 0.05773222201092373, 0.18034398053734474, 0.08740474864336573, 0.07511208633165041, 0.18479095830275893, -0.19416391994797766, -0.15972216456748978, 0.31688916110369847, 0.04608992848239125, -0.17615406707005754, 0.21688942586020757, -0.05199336703413817, -0.1751849294627366, 0.09310280800835319, 0.18679779213661812, 0.08789665193284212, -0.19845967069395806, -0.06481393717615291, 0.013597355996041673, 0.17625473846349712, 0.10297262871379594, -0.05230782055678739, 0.1505907062657994, 0.2925749882012733, -0.04249761506519599, 0.10599114175619596, -0.137959134548086, 0.0024113407336998323, -0.22861029594269108, -0.12350500050345309, -0.04677033977509693, -0.016250975754539394, -0.03648794586239989, -0.19800028749039933, 0.4135360186983359, 0.2243484602348037, 0.1429223282053773, 0.05206351352405849, 0.3205790126262462, -0.045447945212052296, 0.15509707887325283, 0.02405116746635878, 0.20808742079271436, -0.012354521728312112, 0.09246968460422367, -0.16050069989024163, 0.09394026156004569, 0.021537041135310922] |
1,802.10427 | A few remarks on invariable generation in infinite groups | A subset $S$ of a group $G$ invariably generates $G$ if $G$ is generated by
$\{ s^g(s) | s\in S\} $ for any choice of $g(s)\in G, s\in S$. In case $G$ is
topological one defines similarly the notion of topological invariable
generation. A topological group $G$ is said to be $\mathcal{TIG}$ if it is
topologically invariably generated by some subset $S\subseteq G$.
In this paper we study the problem of (topological) invariable generation for
linear groups and for automorphism groups of trees.
Our main results show that the Lie group $\mathrm{SL}_{2}(\mathbb{R})$ and
the automorphism group of a regular tree are $\mathcal{TIG}$, and that the
groups $PSL_m(K) ,m\geq 2$ are not $\mathcal{IG}$ for certain countable fields
of infinite transcendence degree over the prime field.
| math.GR | a subset s of a group g invariably generates g if g is generated by sgs sin s for any choice of gsin g sin s in case g is topological one defines similarly the notion of topological invariable generation a topological group g is said to be mathcaltig if it is topologically invariably generated by some subset ssubseteq g in this paper we study the problem of topological invariable generation for linear groups and for automorphism groups of trees our main results show that the lie group mathrmsl_2mathbbr and the automorphism group of a regular tree are mathcaltig and that the groups psl_mk mgeq 2 are not mathcalig for certain countable fields of infinite transcendence degree over the prime field | [['a', 'subset', 's', 'of', 'a', 'group', 'g', 'invariably', 'generates', 'g', 'if', 'g', 'is', 'generated', 'by', 'sgs', 'sin', 's', 'for', 'any', 'choice', 'of', 'gsin', 'g', 'sin', 's', 'in', 'case', 'g', 'is', 'topological', 'one', 'defines', 'similarly', 'the', 'notion', 'of', 'topological', 'invariable', 'generation', 'a', 'topological', 'group', 'g', 'is', 'said', 'to', 'be', 'mathcaltig', 'if', 'it', 'is', 'topologically', 'invariably', 'generated', 'by', 'some', 'subset', 'ssubseteq', 'g', 'in', 'this', 'paper', 'we', 'study', 'the', 'problem', 'of', 'topological', 'invariable', 'generation', 'for', 'linear', 'groups', 'and', 'for', 'automorphism', 'groups', 'of', 'trees', 'our', 'main', 'results', 'show', 'that', 'the', 'lie', 'group', 'mathrmsl_2mathbbr', 'and', 'the', 'automorphism', 'group', 'of', 'a', 'regular', 'tree', 'are', 'mathcaltig', 'and', 'that', 'the', 'groups', 'psl_mk', 'mgeq', '2', 'are', 'not', 'mathcalig', 'for', 'certain', 'countable', 'fields', 'of', 'infinite', 'transcendence', 'degree', 'over', 'the', 'prime', 'field']] | [-0.25479710067558137, 0.20300036388979262, -0.06957593327388167, -0.003157592074471879, -0.12732538041369668, -0.1135183026560518, 0.029522521623032937, 0.3906170809480908, -0.31480005430057645, -0.2530157308832839, 0.10102663740138362, -0.2781819528900087, -0.14445182865742465, 0.20331433825726733, -0.09382202720935938, -0.07090019229759366, 0.04571391501592408, 0.15275715476158877, -0.023051319390952844, -0.2662202951273528, 0.3773829468188743, -0.1130863188139709, 0.21004928133835823, -0.019321676114863105, 0.08149218456097075, 0.0005115672287627541, 0.0043540876238317835, 0.05543672421080028, -0.13111359075553303, 0.06078516423465395, 0.2799348838081391, 0.07999120007172741, 0.26465159433026764, -0.2978945037767548, -0.21159794433684698, 0.20226304563452843, 0.09052902934992493, -0.005855111365110196, -0.06215834842818179, -0.24439338558847246, 0.22965603819566555, -0.1865479008502634, -0.1153768938885809, -0.005610296705432622, 0.1669755117046438, -0.027673852776482315, -0.2592575659871037, -0.0195054832829869, 0.10106682590036332, 0.11067629689832442, 0.037615391991807724, -0.09272941102771538, -0.1112608817759259, 0.09858394250000731, -0.043233573027276276, 0.10157400371651326, 0.05847423267048976, -0.08104081206015665, -0.11383061175202501, 0.445314550543493, -0.08548375024010652, -0.18919686504222197, 0.11454713778923555, -0.19858034017720613, -0.1882357142428097, 0.10795685005823857, 0.09279268578493743, 0.16690247095639593, -0.025740712375283754, 0.18874578160115374, -0.14456338449612116, 0.11856108313378204, 0.04512802506636443, -0.024203499012369793, 0.16142709260196264, 0.10442687231637858, 0.15031748622302607, 0.09416292796156304, 0.04859835269122288, 0.12219771269933674, -0.35743855851991424, -0.15467449263187832, -0.18697440715161442, 0.11915608278110901, -0.10527989929022592, -0.1725602636479066, 0.42291253439054405, 0.0965459562581161, 0.11304798045452556, 0.08328245526404474, 0.16873630165154563, 0.05489653436936727, 0.06272750436970644, 0.13579940141564042, 0.0490264601050575, 0.21857092661405753, -0.15163170045004867, -0.170394309097901, 0.014528253786105278, 0.16343018086627126] |
1,802.10428 | Stresses in curved nematic membranes | Ordering configurations of a director field on a curved membrane induce
stress. In this work, we present a theoretical framework to calculate the
stress tensor and the torque as a consequence of the nematic ordering; we use
the variational principle and invariance of the energy under Euclidean motions.
Euler-Lagrange equations of the membrane as well as the corresponding boundary
conditions also appear as natural results. The stress tensor found includes
attraction-repulsion forces between defects; likewise, defects are attracted to
patches with the same sign in gaussian curvature. These forces are mediated by
the Green function of Laplace-Beltrami operator of the surface. In addition, we
find non-isotropic forces that involve derivatives of the Green function and
the gaussian curvature, even in the normal direction to the membrane. We
examine the case of axial membranes to analyze the spherical one. For spherical
vesicles we find the modified Young-Laplace law as a consequence of the nematic
texture. In the case of spherical cap with defect at the north pole, we find
that the force is repulsive respect to the north pole, indicating that it is an
unstable equilibrium point.
| cond-mat.soft | ordering configurations of a director field on a curved membrane induce stress in this work we present a theoretical framework to calculate the stress tensor and the torque as a consequence of the nematic ordering we use the variational principle and invariance of the energy under euclidean motions eulerlagrange equations of the membrane as well as the corresponding boundary conditions also appear as natural results the stress tensor found includes attractionrepulsion forces between defects likewise defects are attracted to patches with the same sign in gaussian curvature these forces are mediated by the green function of laplacebeltrami operator of the surface in addition we find nonisotropic forces that involve derivatives of the green function and the gaussian curvature even in the normal direction to the membrane we examine the case of axial membranes to analyze the spherical one for spherical vesicles we find the modified younglaplace law as a consequence of the nematic texture in the case of spherical cap with defect at the north pole we find that the force is repulsive respect to the north pole indicating that it is an unstable equilibrium point | [['ordering', 'configurations', 'of', 'a', 'director', 'field', 'on', 'a', 'curved', 'membrane', 'induce', 'stress', 'in', 'this', 'work', 'we', 'present', 'a', 'theoretical', 'framework', 'to', 'calculate', 'the', 'stress', 'tensor', 'and', 'the', 'torque', 'as', 'a', 'consequence', 'of', 'the', 'nematic', 'ordering', 'we', 'use', 'the', 'variational', 'principle', 'and', 'invariance', 'of', 'the', 'energy', 'under', 'euclidean', 'motions', 'eulerlagrange', 'equations', 'of', 'the', 'membrane', 'as', 'well', 'as', 'the', 'corresponding', 'boundary', 'conditions', 'also', 'appear', 'as', 'natural', 'results', 'the', 'stress', 'tensor', 'found', 'includes', 'attractionrepulsion', 'forces', 'between', 'defects', 'likewise', 'defects', 'are', 'attracted', 'to', 'patches', 'with', 'the', 'same', 'sign', 'in', 'gaussian', 'curvature', 'these', 'forces', 'are', 'mediated', 'by', 'the', 'green', 'function', 'of', 'laplacebeltrami', 'operator', 'of', 'the', 'surface', 'in', 'addition', 'we', 'find', 'nonisotropic', 'forces', 'that', 'involve', 'derivatives', 'of', 'the', 'green', 'function', 'and', 'the', 'gaussian', 'curvature', 'even', 'in', 'the', 'normal', 'direction', 'to', 'the', 'membrane', 'we', 'examine', 'the', 'case', 'of', 'axial', 'membranes', 'to', 'analyze', 'the', 'spherical', 'one', 'for', 'spherical', 'vesicles', 'we', 'find', 'the', 'modified', 'younglaplace', 'law', 'as', 'a', 'consequence', 'of', 'the', 'nematic', 'texture', 'in', 'the', 'case', 'of', 'spherical', 'cap', 'with', 'defect', 'at', 'the', 'north', 'pole', 'we', 'find', 'that', 'the', 'force', 'is', 'repulsive', 'respect', 'to', 'the', 'north', 'pole', 'indicating', 'that', 'it', 'is', 'an', 'unstable', 'equilibrium', 'point']] | [-0.14045014098707226, 0.1388789798617044, -0.08570088684854288, 0.05115193018742326, -0.06732497264515928, -0.06306692174515657, -0.03974718993945268, 0.36818020041751603, -0.27508255321862957, -0.2441813313663231, 0.06454101511745423, -0.2564438441643111, -0.20214703134311143, 0.11051719422672465, -0.021732803631601454, 0.004162823733803566, -0.019149472543929694, 0.04579469189423347, -0.06743566777121517, -0.1619984680155833, 0.33308201745873495, 0.018821478771266116, 0.2978350006129032, 0.08348295644460176, 0.0908293705383536, -0.000812113579232446, 0.03875918448802524, 0.05177655582496476, -0.1679631329675675, 0.08460384897226768, 0.17794667933917335, -0.010290653031739977, 0.2084390329417988, -0.46439933075859985, -0.19740561849496488, 0.09027800874494177, 0.09739106753841043, 0.13890907220963028, -0.027127985876480427, -0.25389616027905015, 0.04235214112646958, -0.1263192633607535, -0.20772469998086973, -0.06076680243882771, 0.0030463454056961804, 0.04056953675719479, -0.259796234941791, 0.15475339350470227, 0.07859001831234162, 0.04290905245579779, -0.13911032750551658, -0.12535311906067756, -0.08992324981860997, 0.10080733252388815, 0.12051142248830768, 0.05502349559608246, 0.19738828497785468, -0.14342458887771772, -0.060639302759501405, 0.3924095742341872, -0.07717609789750729, -0.24912575581261226, 0.15404680888268657, -0.14813510582141418, -0.08825562922634504, 0.11466069744902373, 0.15740290694489514, 0.11643271011342476, -0.12753375018796614, 0.07582719910856066, -0.019755632251686348, 0.10694680767842964, 0.11865867312837353, -0.03424854695506554, 0.2206434370469182, 0.09389526305484876, 0.12091658089149704, 0.1877191407288054, -0.12346598631652292, -0.1193180071548008, -0.34155656230605896, -0.17646639385531027, -0.17945357003519613, 0.036995794015648016, -0.10047304889123689, -0.21741305210036777, 0.34913388496985837, 0.07821234919115781, 0.18230085169598562, 0.04839094164931486, 0.23609129870710996, 0.08033620159364535, 0.10163184586581925, 0.048140547258318754, 0.28792423653786864, 0.15115267803557017, 0.11051996464350371, -0.24401102708877936, -0.0031890284663732213, 0.07220221941749896] |
1,802.10429 | Long lifetimes of ultra-hot particles in interacting Fermi systems | The energy dependence of the relaxation rate of hot electrons due to
interaction with the Fermi sea is studied. We consider 2D and 3D systems,
quasi-1D quantum wires with multiple transverse bands, as well as
single-channel 1D wires. Our analysis includes both spinful and spin-polarized
setups, with short-range and Coulomb interactions. We show that, quite
generally, the relaxation rate is a non-monotonic function of the electron
energy and decays as a power-law at high energies. In other words, ultra-hot
electrons regain their coherence with increasing energy. Such a behavior was
observed in a recent experiment on multi-band quantum wires, J. Reiner et al,
Phys. Rev. X {\bf 7}, 021016 (2017).
| cond-mat.mes-hall cond-mat.str-el | the energy dependence of the relaxation rate of hot electrons due to interaction with the fermi sea is studied we consider 2d and 3d systems quasi1d quantum wires with multiple transverse bands as well as singlechannel 1d wires our analysis includes both spinful and spinpolarized setups with shortrange and coulomb interactions we show that quite generally the relaxation rate is a nonmonotonic function of the electron energy and decays as a powerlaw at high energies in other words ultrahot electrons regain their coherence with increasing energy such a behavior was observed in a recent experiment on multiband quantum wires j reiner et al phys rev x bf 7 021016 2017 | [['the', 'energy', 'dependence', 'of', 'the', 'relaxation', 'rate', 'of', 'hot', 'electrons', 'due', 'to', 'interaction', 'with', 'the', 'fermi', 'sea', 'is', 'studied', 'we', 'consider', '2d', 'and', '3d', 'systems', 'quasi1d', 'quantum', 'wires', 'with', 'multiple', 'transverse', 'bands', 'as', 'well', 'as', 'singlechannel', '1d', 'wires', 'our', 'analysis', 'includes', 'both', 'spinful', 'and', 'spinpolarized', 'setups', 'with', 'shortrange', 'and', 'coulomb', 'interactions', 'we', 'show', 'that', 'quite', 'generally', 'the', 'relaxation', 'rate', 'is', 'a', 'nonmonotonic', 'function', 'of', 'the', 'electron', 'energy', 'and', 'decays', 'as', 'a', 'powerlaw', 'at', 'high', 'energies', 'in', 'other', 'words', 'ultrahot', 'electrons', 'regain', 'their', 'coherence', 'with', 'increasing', 'energy', 'such', 'a', 'behavior', 'was', 'observed', 'in', 'a', 'recent', 'experiment', 'on', 'multiband', 'quantum', 'wires', 'j', 'reiner', 'et', 'al', 'phys', 'rev', 'x', 'bf', '7', '021016', '2017']] | [-0.1387421294294913, 0.1999272106892489, -0.014025931044186918, 0.04938787030303902, -0.004310716689060177, -0.1723578199829667, 0.0395013458029273, 0.3517668775513495, -0.19872147026101988, -0.3340301347571775, -0.06123633468908112, -0.3581298251525251, -0.09957142987655937, 0.1791974762459969, 0.008224576203272157, 0.047020820298428655, 0.027675452148178677, -0.0667197412016605, -0.10028650863694215, -0.23357399896111922, 0.23528549967679716, 0.09495410506630642, 0.3055817897491896, 0.13334974874699607, 0.03987418939872141, 0.08674193008956628, 0.0680107455807439, 0.019127585327064774, -0.14386842399655356, -0.0045246284758381616, 0.23690889998811185, -0.08287285942340765, 0.18845738450048166, -0.44605983598926746, -0.26595281501121204, 0.03380576369551292, 0.11530483546538638, 0.12284564731830577, -0.02102771366053526, -0.29554950826536486, -0.016459480641461022, -0.20013120526516245, -0.10552071573943275, -0.06158970032899786, 0.08597292048736997, 0.07149673861434358, -0.26882127201432415, 0.17292517222840031, 0.06747325836497128, 0.057866358386198864, -0.04385913880285593, -0.11355793990895426, -0.02326427640205403, -0.003942044879044961, 0.032230454325086415, 0.09482133318029276, 0.13128071468656693, -0.102771121094328, -0.12930773120851966, 0.3509701760058556, -0.0647939683168853, -0.10867253877222538, 0.27925836511058816, -0.15696568959958662, -0.0524752571700363, 0.13448713610478497, 0.13312172911070083, 0.07184318500494055, -0.13839038692141345, 0.12041125480681572, -0.06164192814174869, 0.1366516362209249, 0.0538258204458777, 0.09931543214596944, 0.2211135334309635, 0.1787756632910956, -0.016248561958825097, 0.09869773322000774, -0.16718495456467664, -0.07876212282134049, -0.2181440969259444, -0.16263005800476862, -0.2523656728369859, 0.0808400482680529, 0.026671875448184036, -0.1368205460437804, 0.399063826490828, 0.08354214272555818, 0.25006032924150723, -0.011755662201262942, 0.2421809505295316, 0.12765143558152292, 0.0169284529620867, 0.11853581325817478, 0.21344507636861243, 0.1502917043164099, 0.13883191337723524, -0.2665919504136941, -0.024684124031326297, 0.01771210014409975] |
1,802.1043 | Error analysis of Nitsche's mortar method | Optimal a priori and a posteriori error estimates are derived for Nitsche's
mortar finite elements. The analysis is based on the equivalence of the
Nitsche's method and the stabilised mixed method. The Nitsche's method is
defined so that it is robust with respect to large jumps in the material and
mesh parameters over the interface. Numerical results demonstrate the
robustness of the a posteriori estimators.
| math.NA | optimal a priori and a posteriori error estimates are derived for nitsches mortar finite elements the analysis is based on the equivalence of the nitsches method and the stabilised mixed method the nitsches method is defined so that it is robust with respect to large jumps in the material and mesh parameters over the interface numerical results demonstrate the robustness of the a posteriori estimators | [['optimal', 'a', 'priori', 'and', 'a', 'posteriori', 'error', 'estimates', 'are', 'derived', 'for', 'nitsches', 'mortar', 'finite', 'elements', 'the', 'analysis', 'is', 'based', 'on', 'the', 'equivalence', 'of', 'the', 'nitsches', 'method', 'and', 'the', 'stabilised', 'mixed', 'method', 'the', 'nitsches', 'method', 'is', 'defined', 'so', 'that', 'it', 'is', 'robust', 'with', 'respect', 'to', 'large', 'jumps', 'in', 'the', 'material', 'and', 'mesh', 'parameters', 'over', 'the', 'interface', 'numerical', 'results', 'demonstrate', 'the', 'robustness', 'of', 'the', 'a', 'posteriori', 'estimators']] | [-0.0752985910154306, 0.02206996283135735, -0.12204679287970066, 0.037669530193894525, -0.0729506309932241, -0.15604789378121495, 0.05637904159151591, 0.39099951489613605, -0.29327246096844856, -0.27076911480398846, 0.1801643534688852, -0.22980463549924585, -0.12080365006740276, 0.21078643900557206, -0.11539909889778266, 0.11198718207888306, 0.09989827269903169, -0.004393927401934679, -0.13880280655665467, -0.22673695741507868, 0.3132023211568594, 0.04587498671160294, 0.31129291725273317, 0.03382290810919725, 0.16100276960776402, -0.07951953203703921, -0.0570439787939764, 0.06993113479648645, -0.14269526574028601, 0.13972294506831812, 0.20371857956051825, 0.0524469946940931, 0.3129764471991131, -0.3440194018328419, -0.202735276792485, 0.07299148666744049, 0.08092222701614867, 0.12804036788069284, -0.06929945518226864, -0.31358544731942506, 0.1569924976819983, -0.1399693270930304, -0.09625179226008745, -0.0905073401518166, -0.07016240644913453, 0.07486716400688657, -0.3827686764872991, 0.08152928992461127, 0.018675739576037114, 0.07528428158257157, -0.07236681447292749, -0.1258581217808219, -0.036407380350507224, 0.08583814551910529, 0.02340026544048809, -0.02869188698151937, 0.08442688167381746, -0.02028819123426309, -0.042730589117854836, 0.34172175581065506, -0.06058331816457212, -0.3022414653490369, 0.14886239437171472, -0.049254088834501226, -0.059331790544092655, 0.16278664472584542, 0.1596637893611422, 0.19561021979898213, -0.1137179858266161, 0.09014094246712585, -0.03651166988106874, 0.18267887289134355, -0.025785325467586516, -0.042394962154615384, 0.08146934266417072, 0.18732492382136676, 0.15996112766890572, 0.10616269856333159, -0.10717605712393728, -0.08076385202316137, -0.3860942490972005, -0.1642279758476294, -0.2469289467168542, -0.08340699688997119, -0.17815263205355641, -0.24805418086739686, 0.3628420928063301, 0.17331814237941917, 0.10600927389011933, 0.07407738281987035, 0.3333332433580206, 0.14837773176841437, 0.0402007279631037, 0.07399747194722295, 0.2337302118826371, 0.1814617683322957, 0.028517629644976786, -0.2552961962369199, 0.11180896598559159, 0.1773518587390964] |
1,802.10431 | Capacitively Driven Global Interconnect with Magnetoelectric Switching
Based Receiver for Higher Energy Efficiency | We propose capacitively driven low-swing global interconnect circuit using a
receiver that utilizes magnetoelectric (ME) effect induced magnetization
switching to reduce the energy consumption. Capacitively driven wire has
recently been shown to be effective in improving the performance of global
interconnects. Such techniques can reduce the signal swing in the interconnect
by using a capacitive divider network and does not require an additional
voltage supply. However, the large reduction in signal swing makes it necessary
to use differential signaling and amplification for successful regeneration at
the receiver, which add area and static power. ME effect induced magnetization
reversal has recently been proposed which shows the possibility of using a low
voltage to switch a nanomagnet adjacent to a multi-ferroic oxide. Here, we
propose an ME effect based receiver that uses the low voltage at the receiving
end of the global wire to switch a nanomagnet. The nanomagnet is also used as
the free layer of a magnetic tunnel junction (MTJ), the resistance of which is
tuned through the ME effect. This change in MTJ resistance is converted to full
swing binary signals by using simple digital components. This process allows
capacitive low swing interconnection without differential signaling or
amplification, which leads to significant energy efficiency. Our simulation
results indicate that for 5-10 mm long global wires in IBM 45 nm technology,
capacitive ME design consumes 3x lower energy compared to full-swing CMOS
design and 2x lower energy compared to differential amplifier based low-swing
capacitive CMOS design.
| cs.ET | we propose capacitively driven lowswing global interconnect circuit using a receiver that utilizes magnetoelectric me effect induced magnetization switching to reduce the energy consumption capacitively driven wire has recently been shown to be effective in improving the performance of global interconnects such techniques can reduce the signal swing in the interconnect by using a capacitive divider network and does not require an additional voltage supply however the large reduction in signal swing makes it necessary to use differential signaling and amplification for successful regeneration at the receiver which add area and static power me effect induced magnetization reversal has recently been proposed which shows the possibility of using a low voltage to switch a nanomagnet adjacent to a multiferroic oxide here we propose an me effect based receiver that uses the low voltage at the receiving end of the global wire to switch a nanomagnet the nanomagnet is also used as the free layer of a magnetic tunnel junction mtj the resistance of which is tuned through the me effect this change in mtj resistance is converted to full swing binary signals by using simple digital components this process allows capacitive low swing interconnection without differential signaling or amplification which leads to significant energy efficiency our simulation results indicate that for 510 mm long global wires in ibm 45 nm technology capacitive me design consumes 3x lower energy compared to fullswing cmos design and 2x lower energy compared to differential amplifier based lowswing capacitive cmos design | [['we', 'propose', 'capacitively', 'driven', 'lowswing', 'global', 'interconnect', 'circuit', 'using', 'a', 'receiver', 'that', 'utilizes', 'magnetoelectric', 'me', 'effect', 'induced', 'magnetization', 'switching', 'to', 'reduce', 'the', 'energy', 'consumption', 'capacitively', 'driven', 'wire', 'has', 'recently', 'been', 'shown', 'to', 'be', 'effective', 'in', 'improving', 'the', 'performance', 'of', 'global', 'interconnects', 'such', 'techniques', 'can', 'reduce', 'the', 'signal', 'swing', 'in', 'the', 'interconnect', 'by', 'using', 'a', 'capacitive', 'divider', 'network', 'and', 'does', 'not', 'require', 'an', 'additional', 'voltage', 'supply', 'however', 'the', 'large', 'reduction', 'in', 'signal', 'swing', 'makes', 'it', 'necessary', 'to', 'use', 'differential', 'signaling', 'and', 'amplification', 'for', 'successful', 'regeneration', 'at', 'the', 'receiver', 'which', 'add', 'area', 'and', 'static', 'power', 'me', 'effect', 'induced', 'magnetization', 'reversal', 'has', 'recently', 'been', 'proposed', 'which', 'shows', 'the', 'possibility', 'of', 'using', 'a', 'low', 'voltage', 'to', 'switch', 'a', 'nanomagnet', 'adjacent', 'to', 'a', 'multiferroic', 'oxide', 'here', 'we', 'propose', 'an', 'me', 'effect', 'based', 'receiver', 'that', 'uses', 'the', 'low', 'voltage', 'at', 'the', 'receiving', 'end', 'of', 'the', 'global', 'wire', 'to', 'switch', 'a', 'nanomagnet', 'the', 'nanomagnet', 'is', 'also', 'used', 'as', 'the', 'free', 'layer', 'of', 'a', 'magnetic', 'tunnel', 'junction', 'mtj', 'the', 'resistance', 'of', 'which', 'is', 'tuned', 'through', 'the', 'me', 'effect', 'this', 'change', 'in', 'mtj', 'resistance', 'is', 'converted', 'to', 'full', 'swing', 'binary', 'signals', 'by', 'using', 'simple', 'digital', 'components', 'this', 'process', 'allows', 'capacitive', 'low', 'swing', 'interconnection', 'without', 'differential', 'signaling', 'or', 'amplification', 'which', 'leads', 'to', 'significant', 'energy', 'efficiency', 'our', 'simulation', 'results', 'indicate', 'that', 'for', '510', 'mm', 'long', 'global', 'wires', 'in', 'ibm', '45', 'nm', 'technology', 'capacitive', 'me', 'design', 'consumes', '3x', 'lower', 'energy', 'compared', 'to', 'fullswing', 'cmos', 'design', 'and', '2x', 'lower', 'energy', 'compared', 'to', 'differential', 'amplifier', 'based', 'lowswing', 'capacitive', 'cmos', 'design']] | [-0.17968559263948808, 0.07874188932877661, -0.017325870649014807, -0.03355901331508773, -0.12732374281432404, -0.23774394199670273, 0.0921998398753426, 0.39765974998626175, -0.25689267396394694, -0.3575563559888349, 0.05076839887983717, -0.24602816917711384, -0.13046444378584168, 0.23967801783642523, -0.07489408968890808, 0.03636921411190106, -0.007577968361236307, -0.026680696774654244, -0.021676379385195215, -0.1689606927002647, 0.18610089694967075, 0.10322803708924247, 0.3698885335016768, 0.05666553182693731, 0.17053001324209024, -0.04229776882471479, 0.0944859331891853, 0.009432481333841475, -0.0745976415058605, 0.04657540857145677, 0.24367943615177456, -0.019921445171823916, 0.24092443209255532, -0.5172508895777318, -0.18032861470187805, 0.06302653582462547, 0.11412695737707676, 0.12364577702151573, -0.07405879641312878, -0.2144022623157813, 0.13413397562975177, -0.21052612894765882, -0.03064682816288301, -0.04449673056108307, -0.006036334010601348, 0.016210759031510324, -0.2863919157287752, 0.0057979096466086195, 0.044818382987714546, 0.05470632549983506, 0.019819489903320386, -0.11360030109039032, -0.044004235425203736, 0.08629905829260753, -0.026726127519600133, 0.048186413995085324, 0.23396566370121982, -0.07575995569659055, -0.14502996964456172, 0.26410064018350476, -0.06904210008025094, -0.15943664371758243, 0.1193117246449906, -0.10519319252296332, -0.028619422681857735, 0.16790824526126796, 0.17177434784493276, 0.023088857579064006, -0.19068876705702623, 0.02309490558821993, 0.10183971899048407, 0.23445223768678855, 0.08611442442052067, 0.03837460471811343, 0.2047882598207085, 0.2638254597935141, 0.0930850659541926, 0.1920284823651131, -0.1439794618313258, -0.036165482438512725, -0.2076625382002652, -0.14274168699238526, -0.1661875601021611, 0.09400038629472113, -0.05425067563536482, -0.13432063923005907, 0.3991439626989316, 0.17062393691086647, 0.12449075120824332, -0.007046286223874408, 0.3748618173527018, 0.1651287938164053, 0.15153015541787052, 0.051406062966478726, 0.2645735443363023, 0.1759896150695122, 0.18767637113983535, -0.2903807679832704, 0.08954703754897476, -0.04544996383542917] |
1,802.10432 | Talking about Probability, Inference and Decisions. Part 1: The Witches
of Bayes | In October 2017 the Italian National Institute of Statistics (ISTAT), Italy's
body for official statistics, has published the book of fairy tales Le streghe
di Bayes (The witches of Bayes) written by ISTAT staff members with the
commendable aim of introducing statistical and probabilistic reasoning to
children. In this paper the fairy tale which gives the name to the book is
analyzed in a dialog between three teachers with different background and
expertise. The outcomes are definitively discouraging, especially when the
story is compared to the appendix of the book, in which the teaching power of
every story is indeed explained (as a matter of fact, without the appendix the
fairy tale of the witches seemed to be written with the purpose of make the
'Bayesians', meant as the villagers from 'Bayes', ridiculous). In fact the
fairy tale of the witches does not contain any Bayesian reasoning, the
suggested decision strategy is simply wrong and the story does not even seem to
be easily modifiable (besides the trivial correction of the decision strategy)
in order to make it usable as a teaching tool. As it happens in real dialogues,
besides the fairy tale in question, the dialogue touches several issues somehow
related to the story and concerning probability, inference, prediction and
decision making. The present paper is an indirect response to the invitation by
the ISBA bulletin to comment on the fairy tale.
| math.HO math.PR physics.data-an | in october 2017 the italian national institute of statistics istat italys body for official statistics has published the book of fairy tales le streghe di bayes the witches of bayes written by istat staff members with the commendable aim of introducing statistical and probabilistic reasoning to children in this paper the fairy tale which gives the name to the book is analyzed in a dialog between three teachers with different background and expertise the outcomes are definitively discouraging especially when the story is compared to the appendix of the book in which the teaching power of every story is indeed explained as a matter of fact without the appendix the fairy tale of the witches seemed to be written with the purpose of make the bayesians meant as the villagers from bayes ridiculous in fact the fairy tale of the witches does not contain any bayesian reasoning the suggested decision strategy is simply wrong and the story does not even seem to be easily modifiable besides the trivial correction of the decision strategy in order to make it usable as a teaching tool as it happens in real dialogues besides the fairy tale in question the dialogue touches several issues somehow related to the story and concerning probability inference prediction and decision making the present paper is an indirect response to the invitation by the isba bulletin to comment on the fairy tale | [['in', 'october', '2017', 'the', 'italian', 'national', 'institute', 'of', 'statistics', 'istat', 'italys', 'body', 'for', 'official', 'statistics', 'has', 'published', 'the', 'book', 'of', 'fairy', 'tales', 'le', 'streghe', 'di', 'bayes', 'the', 'witches', 'of', 'bayes', 'written', 'by', 'istat', 'staff', 'members', 'with', 'the', 'commendable', 'aim', 'of', 'introducing', 'statistical', 'and', 'probabilistic', 'reasoning', 'to', 'children', 'in', 'this', 'paper', 'the', 'fairy', 'tale', 'which', 'gives', 'the', 'name', 'to', 'the', 'book', 'is', 'analyzed', 'in', 'a', 'dialog', 'between', 'three', 'teachers', 'with', 'different', 'background', 'and', 'expertise', 'the', 'outcomes', 'are', 'definitively', 'discouraging', 'especially', 'when', 'the', 'story', 'is', 'compared', 'to', 'the', 'appendix', 'of', 'the', 'book', 'in', 'which', 'the', 'teaching', 'power', 'of', 'every', 'story', 'is', 'indeed', 'explained', 'as', 'a', 'matter', 'of', 'fact', 'without', 'the', 'appendix', 'the', 'fairy', 'tale', 'of', 'the', 'witches', 'seemed', 'to', 'be', 'written', 'with', 'the', 'purpose', 'of', 'make', 'the', 'bayesians', 'meant', 'as', 'the', 'villagers', 'from', 'bayes', 'ridiculous', 'in', 'fact', 'the', 'fairy', 'tale', 'of', 'the', 'witches', 'does', 'not', 'contain', 'any', 'bayesian', 'reasoning', 'the', 'suggested', 'decision', 'strategy', 'is', 'simply', 'wrong', 'and', 'the', 'story', 'does', 'not', 'even', 'seem', 'to', 'be', 'easily', 'modifiable', 'besides', 'the', 'trivial', 'correction', 'of', 'the', 'decision', 'strategy', 'in', 'order', 'to', 'make', 'it', 'usable', 'as', 'a', 'teaching', 'tool', 'as', 'it', 'happens', 'in', 'real', 'dialogues', 'besides', 'the', 'fairy', 'tale', 'in', 'question', 'the', 'dialogue', 'touches', 'several', 'issues', 'somehow', 'related', 'to', 'the', 'story', 'and', 'concerning', 'probability', 'inference', 'prediction', 'and', 'decision', 'making', 'the', 'present', 'paper', 'is', 'an', 'indirect', 'response', 'to', 'the', 'invitation', 'by', 'the', 'isba', 'bulletin', 'to', 'comment', 'on', 'the', 'fairy', 'tale']] | [-0.04113852361717371, 0.06496695044769969, -0.1208242652824659, 0.1253391508008943, -0.17298207227364346, -0.127714343989211, 0.0701618980896948, 0.3238438042287418, -0.21472803666053022, -0.3479276261613684, 0.11114008557946141, -0.2999039328917373, -0.1591973451625019, 0.17585971131798808, -0.16112221805704147, -0.032856709374659836, 0.07401230497749352, 0.0951669415129617, 0.01606692751873626, -0.30336899697011965, 0.2897285936912725, 0.11830765500412563, 0.2775572508524729, 0.06806800856486808, 0.06896057958539532, 0.029189012771854626, -0.06490849608638807, -0.0359799411050227, -0.09831345686892365, 0.12299906249426501, 0.3555372737339946, 0.2195530975274091, 0.34537719178326654, -0.363557921719354, -0.10750098053089396, 0.0557223639967465, 0.10425770184427792, 0.06561079248328446, 0.03170171871885055, -0.322724682104054, 0.013818412183430127, -0.20180912642418428, -0.11312714485895381, -0.047807281964975024, -0.011294717896388088, -0.023971558782357447, -0.17678521724019247, 0.015574786406392678, 0.125388651809708, 0.09364208626646273, -0.006037716618556057, -0.1370964495985724, 0.0038013108700969333, 0.16788404308349467, 0.09912653791913396, 0.043853151235286165, 0.08792296106704434, -0.1508573463916632, -0.15410569323202408, 0.38899916743526164, -0.018041071686873366, -0.14861677483872585, 0.1546026151179942, -0.12034677999911578, -0.15234928629432265, 0.06456476438985771, 0.13266572225523715, 0.056139918580024976, -0.162991655289257, 0.0456023990025634, -0.043591573838486164, 0.1769056319865077, 0.0737864400552968, -0.07349115548712327, 0.23465284802767908, 0.16798400048138046, -0.005762954563050893, 0.08138270348190496, -0.028484951628485945, -0.09842154933912395, -0.2798076162349095, -0.18729373415744982, -0.15239622317433488, 0.06089017226466986, 0.005689622888020768, -0.19260636015538957, 0.34249375561683326, 0.17478440143574664, 0.13245277647000198, 0.04056968614276027, 0.24099179704401105, 0.02886936432726714, 0.046661767163049574, 0.06985502925652637, 0.1986425527807134, 0.048771428041400056, 0.17212848298609518, -0.12222285239904403, 0.12089169589501672, 0.029077504890641467] |
1,802.10433 | How long, O Bayesian network, will I sample thee? A program analysis
perspective on expected sampling times | Bayesian networks (BNs) are probabilistic graphical models for describing
complex joint probability distributions. The main problem for BNs is inference:
Determine the probability of an event given observed evidence. Since exact
inference is often infeasible for large BNs, popular approximate inference
methods rely on sampling.
We study the problem of determining the expected time to obtain a single
valid sample from a BN. To this end, we translate the BN together with
observations into a probabilistic program. We provide proof rules that yield
the exact expected runtime of this program in a fully automated fashion. We
implemented our approach and successfully analyzed various real-world BNs taken
from the Bayesian network repository.
| cs.PL | bayesian networks bns are probabilistic graphical models for describing complex joint probability distributions the main problem for bns is inference determine the probability of an event given observed evidence since exact inference is often infeasible for large bns popular approximate inference methods rely on sampling we study the problem of determining the expected time to obtain a single valid sample from a bn to this end we translate the bn together with observations into a probabilistic program we provide proof rules that yield the exact expected runtime of this program in a fully automated fashion we implemented our approach and successfully analyzed various realworld bns taken from the bayesian network repository | [['bayesian', 'networks', 'bns', 'are', 'probabilistic', 'graphical', 'models', 'for', 'describing', 'complex', 'joint', 'probability', 'distributions', 'the', 'main', 'problem', 'for', 'bns', 'is', 'inference', 'determine', 'the', 'probability', 'of', 'an', 'event', 'given', 'observed', 'evidence', 'since', 'exact', 'inference', 'is', 'often', 'infeasible', 'for', 'large', 'bns', 'popular', 'approximate', 'inference', 'methods', 'rely', 'on', 'sampling', 'we', 'study', 'the', 'problem', 'of', 'determining', 'the', 'expected', 'time', 'to', 'obtain', 'a', 'single', 'valid', 'sample', 'from', 'a', 'bn', 'to', 'this', 'end', 'we', 'translate', 'the', 'bn', 'together', 'with', 'observations', 'into', 'a', 'probabilistic', 'program', 'we', 'provide', 'proof', 'rules', 'that', 'yield', 'the', 'exact', 'expected', 'runtime', 'of', 'this', 'program', 'in', 'a', 'fully', 'automated', 'fashion', 'we', 'implemented', 'our', 'approach', 'and', 'successfully', 'analyzed', 'various', 'realworld', 'bns', 'taken', 'from', 'the', 'bayesian', 'network', 'repository']] | [-0.06678430078265903, -0.042200318825937735, -0.10802351340215217, 0.15271385231785276, -0.11362555535795453, -0.12871207362292586, 0.09517259335906773, 0.41702264287248925, -0.26823817373060427, -0.3368714196389323, 0.10480715817171946, -0.20263348309205728, -0.13685750994864884, 0.18567967002053518, -0.03055274894729525, 0.1134361978200776, 0.15906553045840097, 0.018481903231486695, -0.053961608191031275, -0.22379740492885444, 0.26779125324190334, 0.0611574146560989, 0.29059057367277574, -0.04412972885981068, 0.12507886023822803, 0.05454203336675827, -0.07210778973698784, 0.015851004325012834, -0.14820256028441042, 0.15411536318149316, 0.31678592851365156, 0.25898836941986875, 0.27853606182763035, -0.44724411155727245, -0.20841498729177155, 0.11267698390895987, 0.13635858145609564, 0.15089109233818604, -0.026125811706381, -0.3035230494465108, 0.09902784161202542, -0.1900742583916531, -0.03768652387231857, -0.0827312259976794, -0.0015140896545605617, 0.013577035634551902, -0.30217668426701344, 0.026554467714483942, 0.07050507760665438, 0.018680569513119874, -0.04047063640780277, -0.1303821692436195, 0.018715924009689137, 0.12286490995671835, 0.032049931991669174, 0.027169122129913653, 0.08463301669873365, -0.09064918227476983, -0.14422907436954546, 0.331646649091429, -0.0004206894333726047, -0.1794638575331585, 0.16747404102483546, -0.053404697003094734, -0.24722429008751706, 0.13988779401742257, 0.24177323410136475, 0.16281267664990984, -0.20497214999721125, 0.0590334435298762, -0.04457819376241516, 0.18032307356495308, -0.022561248878503706, -0.04886947000432793, 0.2189930472522974, 0.23094548109650342, 0.020966959110385663, 0.13811436180562317, -0.10534171923247233, -0.12292025754278577, -0.26270183675863723, -0.12188463542308356, -0.18874207289620965, 0.03606972408031013, -0.13013093832548317, -0.18696843876360772, 0.34700643657161306, 0.1925236395589571, 0.19316746645658445, 0.1823497907162082, 0.292691688883949, 0.14364637597778662, 0.033744650469203524, 0.098707549710263, 0.1789996953825844, 0.09189662511821266, 0.06929203506290645, -0.12077226078238439, 0.1427508579747466, 0.008424618755475627] |
1,802.10434 | The phase structure of Causal Dynamical Triangulations with toroidal
spatial topology | We investigate the impact of topology on the phase structure of
four-dimensional Causal Dynamical Triangulations (CDT). Using numerical Monte
Carlo simulations we study CDT with toroidal spatial topology. We confirm
existence of all four distinct phases of quantum geometry earlier observed in
CDT with spherical spatial topology. We plot the toroidal CDT phase diagram and
find that it looks very similar to the case of the spherical spatial topology.
| hep-th gr-qc hep-lat | we investigate the impact of topology on the phase structure of fourdimensional causal dynamical triangulations cdt using numerical monte carlo simulations we study cdt with toroidal spatial topology we confirm existence of all four distinct phases of quantum geometry earlier observed in cdt with spherical spatial topology we plot the toroidal cdt phase diagram and find that it looks very similar to the case of the spherical spatial topology | [['we', 'investigate', 'the', 'impact', 'of', 'topology', 'on', 'the', 'phase', 'structure', 'of', 'fourdimensional', 'causal', 'dynamical', 'triangulations', 'cdt', 'using', 'numerical', 'monte', 'carlo', 'simulations', 'we', 'study', 'cdt', 'with', 'toroidal', 'spatial', 'topology', 'we', 'confirm', 'existence', 'of', 'all', 'four', 'distinct', 'phases', 'of', 'quantum', 'geometry', 'earlier', 'observed', 'in', 'cdt', 'with', 'spherical', 'spatial', 'topology', 'we', 'plot', 'the', 'toroidal', 'cdt', 'phase', 'diagram', 'and', 'find', 'that', 'it', 'looks', 'very', 'similar', 'to', 'the', 'case', 'of', 'the', 'spherical', 'spatial', 'topology']] | [-0.19249566116680702, 0.1299406140840248, -0.17091060078878334, 0.1297427743970268, -0.05512756513485658, -0.08078180324535925, 0.01628632963284094, 0.37780421532258607, -0.20240961131302343, -0.27867035033262294, 0.03405097985903368, -0.23055748417433622, -0.26058924489695096, 0.11134801427091377, 0.006035349600057563, 0.008716828836823233, 0.02829566719415395, -0.0230595670181556, -0.12892528787673707, -0.23392294508917932, 0.3451053689274451, 0.04728324501269052, 0.27010996183515457, -0.032761564903447164, 0.055121544006186116, 0.00039953835632490075, -0.04599193972197996, 0.1352563025564819, -0.2441921353689606, 0.008936502147411955, 0.17195620661452954, 0.06487450049683938, 0.09819713065171264, -0.46174543658676354, -0.27130700021550275, 0.10004837920997238, 0.12634097489163928, 0.13617157842963934, -0.04462747411647191, -0.2809494590433989, 0.059637715716076935, -0.10580924919981888, -0.18685476244359778, -0.0802358609718689, -0.038370550981304354, -0.05155113204787283, -0.16018822276036834, 0.05386015315256689, 0.02421786272147522, 0.09572231998005747, -0.02129320730117784, -0.030828704639081505, -0.08094172654808432, 0.10399659748857273, -0.011837815044218323, 0.028856652205054095, 0.05392678640782833, -0.06989846570228321, -0.2010404206002536, 0.3349498462849769, 0.011441018319337803, -0.20210276031191798, 0.24720109578060068, -0.25884927879108716, -0.16767886004316201, 0.13222383189460504, 0.13923927609795245, 0.1246404112789078, -0.05806321352534671, 0.12038114060819878, -0.056383382414292166, 0.1540974560801102, 0.03833491656173398, 0.02502152721222112, 0.21827988726073416, 0.18818480916915165, 0.0006372318670585536, 0.20214244747615379, -0.1541484838142397, -0.2675386859724919, -0.27632621293752524, -0.11898585307695296, -0.1636593130879455, 0.0874601376708597, -0.220467517948566, -0.23874846835067307, 0.382904009812552, 0.1208016430415834, 0.20077474721693905, -0.017520671970197473, 0.26512089763106644, 0.014472138258102148, -0.0124982966353064, 0.06785103838647837, 0.24075932960039464, 0.17683235561286192, 0.05596795834034034, -0.28928473946786876, -0.024778867052679045, 0.16923206604585267] |
1,802.10435 | Revealing a mode interplay that controls second harmonic radiation in
gold nanoantennas | In this work, we investigate the generation of second harmonic light by gold
nanorods and demonstrate that the collected nonlinear intensity depends upon a
phase interplay between different modes available in the nanostructure. By
recording the backward and forward emitted second harmonic signals from
nanorods with various lengths, we find that the maximum nonlinear signal
emitted in the forward and backward directions is not obtained for the same
nanorod length. We confirm the experimental results with the help of full-wave
computations done with a surface integral equation method. These observations
are explained by the multipolar nature of the second harmonic emission, which
emphasizes the role played by the relative phase between the second harmonic
modes. Our findings are of a particular importance for the design of plasmonic
nanostructures with controllable nonlinear emission and nonlinear plasmonic
sensors as well as for the coherent control of harmonic generations in
plasmonic nanostructures.
| physics.optics | in this work we investigate the generation of second harmonic light by gold nanorods and demonstrate that the collected nonlinear intensity depends upon a phase interplay between different modes available in the nanostructure by recording the backward and forward emitted second harmonic signals from nanorods with various lengths we find that the maximum nonlinear signal emitted in the forward and backward directions is not obtained for the same nanorod length we confirm the experimental results with the help of fullwave computations done with a surface integral equation method these observations are explained by the multipolar nature of the second harmonic emission which emphasizes the role played by the relative phase between the second harmonic modes our findings are of a particular importance for the design of plasmonic nanostructures with controllable nonlinear emission and nonlinear plasmonic sensors as well as for the coherent control of harmonic generations in plasmonic nanostructures | [['in', 'this', 'work', 'we', 'investigate', 'the', 'generation', 'of', 'second', 'harmonic', 'light', 'by', 'gold', 'nanorods', 'and', 'demonstrate', 'that', 'the', 'collected', 'nonlinear', 'intensity', 'depends', 'upon', 'a', 'phase', 'interplay', 'between', 'different', 'modes', 'available', 'in', 'the', 'nanostructure', 'by', 'recording', 'the', 'backward', 'and', 'forward', 'emitted', 'second', 'harmonic', 'signals', 'from', 'nanorods', 'with', 'various', 'lengths', 'we', 'find', 'that', 'the', 'maximum', 'nonlinear', 'signal', 'emitted', 'in', 'the', 'forward', 'and', 'backward', 'directions', 'is', 'not', 'obtained', 'for', 'the', 'same', 'nanorod', 'length', 'we', 'confirm', 'the', 'experimental', 'results', 'with', 'the', 'help', 'of', 'fullwave', 'computations', 'done', 'with', 'a', 'surface', 'integral', 'equation', 'method', 'these', 'observations', 'are', 'explained', 'by', 'the', 'multipolar', 'nature', 'of', 'the', 'second', 'harmonic', 'emission', 'which', 'emphasizes', 'the', 'role', 'played', 'by', 'the', 'relative', 'phase', 'between', 'the', 'second', 'harmonic', 'modes', 'our', 'findings', 'are', 'of', 'a', 'particular', 'importance', 'for', 'the', 'design', 'of', 'plasmonic', 'nanostructures', 'with', 'controllable', 'nonlinear', 'emission', 'and', 'nonlinear', 'plasmonic', 'sensors', 'as', 'well', 'as', 'for', 'the', 'coherent', 'control', 'of', 'harmonic', 'generations', 'in', 'plasmonic', 'nanostructures']] | [-0.12109638766804398, 0.1647237940478895, -0.039178400525460705, -0.00035224500426322524, -0.056581297817471246, -0.10338159590559517, 0.005463182801168237, 0.432884386446852, -0.25243564071008723, -0.2799338257727807, 0.032541927994047634, -0.2977604372895654, -0.1795402203167745, 0.24843407091028338, 0.026803248296273036, 0.06228734746859753, 0.05202466205400008, -0.04804959451942236, -0.005384366340535199, -0.15225945172781413, 0.3075741731949251, 0.056905262548423326, 0.2914642447093189, 0.06576669399607801, 0.09020027006357509, 0.023591226304337482, -0.02743853384241362, -0.029469195181416385, -0.09572015691522412, 0.16357096803887128, 0.2488509153559704, 0.01423798492115816, 0.25374491472147254, -0.4760815814862515, -0.2295002032996424, 0.028006055501708448, 0.1288827627527312, 0.11859640749968313, -0.09132997858519322, -0.2935163246080179, 0.051276293989495944, -0.05817403800585526, -0.13420662213891946, -0.01404831884741383, -0.029792451724760083, 0.08890351579694902, -0.24006239098657686, 0.053391798330633435, 0.09415622047507462, 0.064438519333708, -0.04608440636688431, -0.0647605410245741, -0.044865853520385274, 0.10442321848799319, 0.03793774302278281, -0.0317641571226636, 0.12531952644915526, -0.1061652442831046, -0.15087522640699308, 0.3721033080712261, -0.10364668220031581, -0.17310202026102167, 0.12419718476449883, -0.1916107656184159, -0.03782310399020578, 0.1520183363932516, 0.18946062917227313, 0.1321695758804879, -0.12710247628840823, 0.00551797432243674, 0.034687703659745474, 0.19767448467346246, 0.11246613197141146, 0.059710432703438024, 0.23010144826499807, 0.175519860194896, 0.004942737007201118, 0.18918747569578107, -0.11372491665459519, -0.06602535819972322, -0.3005194108969932, -0.1461183129366012, -0.21416189700315064, -0.02124338856913484, -0.08879481535053331, -0.12206084960634077, 0.41915788447121843, 0.10978351968446834, 0.1646863641279856, 0.018390699165510702, 0.30369725552131266, 0.13988663245151883, 0.04767656603424916, -0.0045117221947684385, 0.3259989205222802, 0.16683363974885076, 0.11587580815020124, -0.2965263208622838, 0.014210615428977164, 0.034566489471772675] |
1,802.10436 | Black hole information paradox without Hawking radiation | By entangling soft massless particles one can create an arbitrarily large
amount of entanglement entropy that carries an arbitrarily small amount of
energy. Dropping this entropy into the black hole (b.h.) one can increase the
b.h. entropy by an amount that violates Bekenstein bound or any other
reasonable bound, leading to a version of b.h. information paradox that does
not involve Hawking radiation. Among many proposed solutions of the standard
b.h. information paradox with Hawking radiation, only a few can also resolve
this version without the Hawking radiation. The assumption that both versions
should be resolved in the same way significantly helps to reduce the space of
possible resolutions.
| hep-th gr-qc | by entangling soft massless particles one can create an arbitrarily large amount of entanglement entropy that carries an arbitrarily small amount of energy dropping this entropy into the black hole bh one can increase the bh entropy by an amount that violates bekenstein bound or any other reasonable bound leading to a version of bh information paradox that does not involve hawking radiation among many proposed solutions of the standard bh information paradox with hawking radiation only a few can also resolve this version without the hawking radiation the assumption that both versions should be resolved in the same way significantly helps to reduce the space of possible resolutions | [['by', 'entangling', 'soft', 'massless', 'particles', 'one', 'can', 'create', 'an', 'arbitrarily', 'large', 'amount', 'of', 'entanglement', 'entropy', 'that', 'carries', 'an', 'arbitrarily', 'small', 'amount', 'of', 'energy', 'dropping', 'this', 'entropy', 'into', 'the', 'black', 'hole', 'bh', 'one', 'can', 'increase', 'the', 'bh', 'entropy', 'by', 'an', 'amount', 'that', 'violates', 'bekenstein', 'bound', 'or', 'any', 'other', 'reasonable', 'bound', 'leading', 'to', 'a', 'version', 'of', 'bh', 'information', 'paradox', 'that', 'does', 'not', 'involve', 'hawking', 'radiation', 'among', 'many', 'proposed', 'solutions', 'of', 'the', 'standard', 'bh', 'information', 'paradox', 'with', 'hawking', 'radiation', 'only', 'a', 'few', 'can', 'also', 'resolve', 'this', 'version', 'without', 'the', 'hawking', 'radiation', 'the', 'assumption', 'that', 'both', 'versions', 'should', 'be', 'resolved', 'in', 'the', 'same', 'way', 'significantly', 'helps', 'to', 'reduce', 'the', 'space', 'of', 'possible', 'resolutions']] | [-0.09761839935880735, 0.18544514298611514, -0.10594566619673043, 0.14896690799991405, -0.10302912228561323, -0.18228918772805994, 0.04463706764076418, 0.27102325157766494, -0.22633370916880324, -0.3555151723974615, 0.07418714445233858, -0.33691934036484006, -0.012120130268959414, 0.20550454460530876, -0.1416675158180382, 0.023136779947907006, 0.074881207842995, 0.0607443157649693, -0.05701476151877673, -0.2702012826034953, 0.34028164433622987, 0.13326237296019125, 0.25547611372494095, 0.09340248206937941, 0.09939372016826149, 0.014764544440843507, 0.03923877225248912, 0.05013320171632035, -0.10703424901681217, 0.08069931571329132, 0.2034207492759195, 0.18655017855654069, 0.2713668949799527, -0.42976257926143635, -0.2773466472505429, 0.15925700126916442, 0.17094688319949297, 0.17795464136304523, -0.06405624775579113, -0.2082293338543915, 0.0566406387904095, -0.25721336624354396, -0.11784110012370239, -0.05370972910468731, -0.002870185843267299, -0.09596663218316272, -0.19056079867765854, 0.10305313385543499, 0.11655495001362004, -0.10697878321308062, -0.06154103193073234, 0.02681873479447917, -0.05276874180267983, 0.08781766947230683, 0.1015801363124794, 0.017232608792389137, 0.17952207395584757, -0.10187625887573039, -0.11556614644893813, 0.310736806926514, -0.06078133057512411, -0.21872545111445932, 0.16412984594753985, -0.18782420277834758, -0.08021944671561686, 0.16883541223456347, 0.07163327262916286, 0.13069597771765082, -0.15480785793838425, 0.06758216100343324, -0.026294615769058192, 0.27196430644755243, 0.13380369375707632, 0.11560368009014141, 0.31322840011653, 0.008444333577169737, 0.07356621286086311, 0.17790378935137388, -0.054609882649581096, -0.09530659061012824, -0.31750425889472894, -0.18598114997853413, -0.22462464044930056, 0.12735409040333504, -0.157103840550066, -0.11946294527210363, 0.27254543702946893, 0.14549079521157599, 0.1961356561135398, 0.030311798770835095, 0.2974792597729952, 0.10432851864793978, 0.09576063501913476, 0.12933277749721336, 0.2699616275633762, 0.07062449285316222, 0.10448937560645265, -0.2528996462506507, 0.05207092974146982, 0.07185891261666057] |
1,802.10437 | A Simple Method to improve Initialization Robustness for Active Contours
driven by Local Region Fitting Energy | Active contour models based on local region fitting energy can segment images
with intensity inhomogeneity effectively, but their segmentation results are
easy to error if the initial contour is inappropriate. In this paper, we
present a simple and universal method of improving the robustness of initial
contour for these local fitting-based models. The core idea of proposed method
is exchanging the fitting values on the two sides of contour, so that the
fitting values inside the contour are always larger (or smaller) than the
values outside the contour in the process of curve evolution. In this way, the
whole curve will evolve along the inner (or outer) boundaries of object, and
less likely to be stuck in the object or background. Experimental results have
proved that using the proposed method can enhance the robustness of initial
contour and meanwhile keep the original advantages in the local fitting-based
models.
| cs.CV | active contour models based on local region fitting energy can segment images with intensity inhomogeneity effectively but their segmentation results are easy to error if the initial contour is inappropriate in this paper we present a simple and universal method of improving the robustness of initial contour for these local fittingbased models the core idea of proposed method is exchanging the fitting values on the two sides of contour so that the fitting values inside the contour are always larger or smaller than the values outside the contour in the process of curve evolution in this way the whole curve will evolve along the inner or outer boundaries of object and less likely to be stuck in the object or background experimental results have proved that using the proposed method can enhance the robustness of initial contour and meanwhile keep the original advantages in the local fittingbased models | [['active', 'contour', 'models', 'based', 'on', 'local', 'region', 'fitting', 'energy', 'can', 'segment', 'images', 'with', 'intensity', 'inhomogeneity', 'effectively', 'but', 'their', 'segmentation', 'results', 'are', 'easy', 'to', 'error', 'if', 'the', 'initial', 'contour', 'is', 'inappropriate', 'in', 'this', 'paper', 'we', 'present', 'a', 'simple', 'and', 'universal', 'method', 'of', 'improving', 'the', 'robustness', 'of', 'initial', 'contour', 'for', 'these', 'local', 'fittingbased', 'models', 'the', 'core', 'idea', 'of', 'proposed', 'method', 'is', 'exchanging', 'the', 'fitting', 'values', 'on', 'the', 'two', 'sides', 'of', 'contour', 'so', 'that', 'the', 'fitting', 'values', 'inside', 'the', 'contour', 'are', 'always', 'larger', 'or', 'smaller', 'than', 'the', 'values', 'outside', 'the', 'contour', 'in', 'the', 'process', 'of', 'curve', 'evolution', 'in', 'this', 'way', 'the', 'whole', 'curve', 'will', 'evolve', 'along', 'the', 'inner', 'or', 'outer', 'boundaries', 'of', 'object', 'and', 'less', 'likely', 'to', 'be', 'stuck', 'in', 'the', 'object', 'or', 'background', 'experimental', 'results', 'have', 'proved', 'that', 'using', 'the', 'proposed', 'method', 'can', 'enhance', 'the', 'robustness', 'of', 'initial', 'contour', 'and', 'meanwhile', 'keep', 'the', 'original', 'advantages', 'in', 'the', 'local', 'fittingbased', 'models']] | [-0.06215380860285714, 0.06732122035464272, -0.10730453306097991, 0.05131059405250592, -0.06888103441058381, -0.11389328398729197, 0.029906043423358602, 0.41817335425750224, -0.2461716194158873, -0.31856994968964847, 0.11611855605765045, -0.24563822597013535, -0.11869851950826626, 0.21832417682398464, -0.07972972714393305, 0.047183750003298615, 0.08940540249396518, 0.03990443376509624, -0.08478664401981577, -0.24962327696030606, 0.30727639103880955, 0.06671644507504597, 0.2873577664769884, 0.023536173850172072, 0.0629460847074468, -0.014662474625102067, -0.029693289389330392, 0.022510401495556172, -0.08784280637189874, 0.15931266555059198, 0.19013928482640827, 0.11276428446463133, 0.23902500374242663, -0.4155717409606016, -0.21385701186876316, 0.0980505572971762, 0.21050135642793533, 0.10320363419265738, -0.007862553169566987, -0.2875079615859667, 0.09652071837587534, -0.11496837792062276, -0.140348891375234, -0.044810019582950486, 0.014536695621712637, 0.022323978155524143, -0.22748440285087437, 0.08589513221050839, 0.07033390012204747, 0.022385762806201505, -0.09682851451971392, -0.11481705901206697, -0.046862184472784806, 0.13745734908120907, 0.03871695033091316, 0.056881078783221344, 0.17904105116739064, -0.1558329293054428, -0.02435573435080162, 0.32225248617170427, -0.030669725583917368, -0.23329355940537377, 0.17642470608100397, -0.12915140725483462, -0.08133080682868289, 0.15306603207215164, 0.13195961830678168, 0.13058578835900975, -0.11106723105862133, 0.04344745017344296, 0.004465863750492399, 0.1608270487494018, 0.05534872198729096, -0.027759668398396792, 0.22665525051588947, 0.1335158864098343, 0.062392770447626686, 0.13354975376765849, -0.16580303072790942, -0.1078799015439644, -0.29287676664849593, -0.1316356367456752, -0.16943124431575574, -0.04708763551300492, -0.11238025166882859, -0.1734305362789766, 0.4063267969979426, 0.1879229165890531, 0.26345281861093195, 0.05996563303680789, 0.3376192462857108, 0.11336593869821848, 0.10708944942146174, 0.08513376763958887, 0.24032780916958646, 0.039619771277569736, 0.04566498209621657, -0.19032134011394117, 0.09867967695715157, 0.08217807971192775] |
1,802.10438 | Sensor and Sink Placement, Scheduling and Routing Algorithms for
Connected Coverage of Wireless Sensor Networks | A sensor is a small electronic device which has the ability to sense, compute
and communicate either with other sensors or directly with a base station
(sink). In a wireless sensor network (WSN), the sensors monitor a region and
transmit the collected data packets through routes to the sinks. In this study,
we propose a mixed--integer linear programming (MILP) model to maximize the
number of time periods that a WSN carries out the desired tasks with limited
energy and budget. Our sink and sensor placement, scheduling, routing with
connected coverage ($SPSRC$) model is the first in the literature that combines
the decisions for the locations of sinks and sensors, activity schedules of the
deployed sensors, and data flow routes from each active sensor to its assigned
sink for connected coverage of the network over a finite planning horizon. The
problem is NP--hard and difficult to solve even for small instances. Assuming
that the sink locations are known, we develop heuristics which construct a
feasible solution of the problem by gradually satisfying the constraints. Then,
we introduce search heuristics to determine the locations of the sinks to
maximize the network lifetime. Computational experiments reveal that our
heuristic methods can find near optimal solutions in an acceptable amount of
time compared to the commercial solver CPLEX 12.7.0.
| cs.NI eess.SP | a sensor is a small electronic device which has the ability to sense compute and communicate either with other sensors or directly with a base station sink in a wireless sensor network wsn the sensors monitor a region and transmit the collected data packets through routes to the sinks in this study we propose a mixedinteger linear programming milp model to maximize the number of time periods that a wsn carries out the desired tasks with limited energy and budget our sink and sensor placement scheduling routing with connected coverage spsrc model is the first in the literature that combines the decisions for the locations of sinks and sensors activity schedules of the deployed sensors and data flow routes from each active sensor to its assigned sink for connected coverage of the network over a finite planning horizon the problem is nphard and difficult to solve even for small instances assuming that the sink locations are known we develop heuristics which construct a feasible solution of the problem by gradually satisfying the constraints then we introduce search heuristics to determine the locations of the sinks to maximize the network lifetime computational experiments reveal that our heuristic methods can find near optimal solutions in an acceptable amount of time compared to the commercial solver cplex 1270 | [['a', 'sensor', 'is', 'a', 'small', 'electronic', 'device', 'which', 'has', 'the', 'ability', 'to', 'sense', 'compute', 'and', 'communicate', 'either', 'with', 'other', 'sensors', 'or', 'directly', 'with', 'a', 'base', 'station', 'sink', 'in', 'a', 'wireless', 'sensor', 'network', 'wsn', 'the', 'sensors', 'monitor', 'a', 'region', 'and', 'transmit', 'the', 'collected', 'data', 'packets', 'through', 'routes', 'to', 'the', 'sinks', 'in', 'this', 'study', 'we', 'propose', 'a', 'mixedinteger', 'linear', 'programming', 'milp', 'model', 'to', 'maximize', 'the', 'number', 'of', 'time', 'periods', 'that', 'a', 'wsn', 'carries', 'out', 'the', 'desired', 'tasks', 'with', 'limited', 'energy', 'and', 'budget', 'our', 'sink', 'and', 'sensor', 'placement', 'scheduling', 'routing', 'with', 'connected', 'coverage', 'spsrc', 'model', 'is', 'the', 'first', 'in', 'the', 'literature', 'that', 'combines', 'the', 'decisions', 'for', 'the', 'locations', 'of', 'sinks', 'and', 'sensors', 'activity', 'schedules', 'of', 'the', 'deployed', 'sensors', 'and', 'data', 'flow', 'routes', 'from', 'each', 'active', 'sensor', 'to', 'its', 'assigned', 'sink', 'for', 'connected', 'coverage', 'of', 'the', 'network', 'over', 'a', 'finite', 'planning', 'horizon', 'the', 'problem', 'is', 'nphard', 'and', 'difficult', 'to', 'solve', 'even', 'for', 'small', 'instances', 'assuming', 'that', 'the', 'sink', 'locations', 'are', 'known', 'we', 'develop', 'heuristics', 'which', 'construct', 'a', 'feasible', 'solution', 'of', 'the', 'problem', 'by', 'gradually', 'satisfying', 'the', 'constraints', 'then', 'we', 'introduce', 'search', 'heuristics', 'to', 'determine', 'the', 'locations', 'of', 'the', 'sinks', 'to', 'maximize', 'the', 'network', 'lifetime', 'computational', 'experiments', 'reveal', 'that', 'our', 'heuristic', 'methods', 'can', 'find', 'near', 'optimal', 'solutions', 'in', 'an', 'acceptable', 'amount', 'of', 'time', 'compared', 'to', 'the', 'commercial', 'solver', 'cplex', '1270']] | [-0.17020469443833403, 0.034456312775605895, -0.03488664893503083, -0.01104040472946678, -0.10919259695353256, -0.19656616358835005, 0.13208896037034482, 0.3974227268144349, -0.30379355643118655, -0.35371593801548407, 0.11355412942923118, -0.31315351383193185, -0.10662269918574456, 0.14252436778586464, -0.10081421051331617, 0.0645950411021531, 0.10066822743713508, 0.07900658654915081, 0.002743113356156636, -0.24303857153933686, 0.24504214361262133, 0.0834565115178648, 0.29506814382452445, 0.028477289533312213, 0.13170615345387607, -0.014539661877432285, -0.01552802484447711, 0.025119634968050208, -0.09598611871710278, 0.09686322823475838, 0.34346116111596403, 0.17236107148264893, 0.2875003847494835, -0.4826352751953092, -0.23824299914135694, 0.12709910900138371, 0.10864393538838932, 0.07110516047090233, -0.02169483315980793, -0.25967421349373027, 0.14001125602865436, -0.1784082618781374, -0.07001677003610775, -0.007854280223042886, 0.007074028534257663, 0.0511876004655567, -0.3016420371795648, -0.042391668030313245, -0.06559334929693038, -0.02866649100661417, -0.11250070480806057, -0.07620053973797465, -0.020360321457123506, 0.17170474025155374, 0.019905880104046463, 0.012197786196848708, 0.16668731934406195, -0.11972446964779503, -0.14090516054984278, 0.3789245914276167, 0.03127641448855539, -0.20168179329093022, 0.15723168034629817, -0.040556486049736634, -0.09816714643096011, 0.15250539977242736, 0.2385892646474803, 0.16639948022664985, -0.17566420712778083, 0.010960338567873184, -0.031869593163175405, 0.17143751772351248, 0.04543747526275812, 0.010525141544553024, 0.19291184769582143, 0.21066915708219755, 0.20139967740913767, 0.1456205888407057, -0.12571494923969817, -0.08101304123944073, -0.24354253938937315, -0.10159849520842328, -0.2162388079390626, 0.01275314407196836, -0.09058980567977279, -0.11691825900762125, 0.37384488117319714, 0.19101944404097151, 0.17495997176966935, 0.10321097617868821, 0.3626224622130394, 0.0817575774201253, 0.10133925046707573, 0.15132100345070743, 0.17950359673596153, 0.04215371300995124, 0.1444236065112011, -0.2124259557485772, 0.07631891206664111, -0.004174178833942686] |
1,802.10439 | On the norm attainment set of a bounded linear operator and
semi-inner-products in normed spaces | We obtain a complete characterization of the norm attainment set of a bounded
linear functional on a normed space, in terms of a semi-inner-product defined
on the space. Motivated by this result, we further apply the concept of
semi-inner-products to obtain a complete characterization of the norm
attainment set of a bounded linear operator between any two real normed spaces.
In particular, this answers an open question raised recently in [Sain, D.,
\textit{On the norm attainment set of a bounded linear operator}, J. Math.
Anal. Appl., \textbf{457} (2018), 67-76.]. Our results illustrate the
applicability of semi-inner-products towards a better understanding of the
geometry of normed spaces.
| math.FA | we obtain a complete characterization of the norm attainment set of a bounded linear functional on a normed space in terms of a semiinnerproduct defined on the space motivated by this result we further apply the concept of semiinnerproducts to obtain a complete characterization of the norm attainment set of a bounded linear operator between any two real normed spaces in particular this answers an open question raised recently in sain d textiton the norm attainment set of a bounded linear operator j math anal appl textbf457 2018 6776 our results illustrate the applicability of semiinnerproducts towards a better understanding of the geometry of normed spaces | [['we', 'obtain', 'a', 'complete', 'characterization', 'of', 'the', 'norm', 'attainment', 'set', 'of', 'a', 'bounded', 'linear', 'functional', 'on', 'a', 'normed', 'space', 'in', 'terms', 'of', 'a', 'semiinnerproduct', 'defined', 'on', 'the', 'space', 'motivated', 'by', 'this', 'result', 'we', 'further', 'apply', 'the', 'concept', 'of', 'semiinnerproducts', 'to', 'obtain', 'a', 'complete', 'characterization', 'of', 'the', 'norm', 'attainment', 'set', 'of', 'a', 'bounded', 'linear', 'operator', 'between', 'any', 'two', 'real', 'normed', 'spaces', 'in', 'particular', 'this', 'answers', 'an', 'open', 'question', 'raised', 'recently', 'in', 'sain', 'd', 'textiton', 'the', 'norm', 'attainment', 'set', 'of', 'a', 'bounded', 'linear', 'operator', 'j', 'math', 'anal', 'appl', 'textbf457', '2018', '6776', 'our', 'results', 'illustrate', 'the', 'applicability', 'of', 'semiinnerproducts', 'towards', 'a', 'better', 'understanding', 'of', 'the', 'geometry', 'of', 'normed', 'spaces']] | [-0.09580309419404892, 0.023305172605268168, -0.04374093325182219, 0.02235625220152239, -0.07012410321760745, -0.021408235193008468, 0.06496848322096326, 0.29679088443517687, -0.2911666240277035, -0.2215364345438069, 0.12499023157482346, -0.24602680423163942, -0.15708675713588793, 0.20875912760162638, -0.15577330991032967, 0.0521229421099027, 0.04317247393940176, 0.03153295171934934, -0.11578570728500684, -0.29933284584965025, 0.35537461149284527, -0.01384205480682708, 0.2000109355577955, 0.10007500797953633, 0.11827048609432365, 0.04223593461460301, -0.05460198596119881, 0.03959828261674071, -0.1810596123603838, 0.21483105592085935, 0.2845639224563326, 0.14651483147449437, 0.3828192785027481, -0.3442165783828213, -0.1739778259769082, 0.1875074371313011, 0.041507935302243344, -0.017193173315553437, 0.0002328225788438604, -0.3225789890757629, 0.05855413681572481, -0.12603039048789513, -0.15773416166859014, -0.10708299959078431, 0.05998751633756218, -0.020206240454821715, -0.3179103073442266, 0.03906261894319739, 0.18484110818022773, 0.11704518245089622, -0.13917249979983484, -0.0987861209371615, -0.010569339804351329, 0.04370963957072014, -0.08305251275499662, 0.09240861746615597, 0.04497469811301146, -0.03517860159544008, -0.16449405185523489, 0.3214582285355954, -0.036538282702011725, -0.23672368877700398, 0.1589401079253072, -0.17323607927897855, -0.09190471893109914, 0.03322567691405614, 0.20195966504869006, 0.158455578441776, -0.0947947406830887, 0.2206959632890565, -0.14610670933145142, 0.11867642059279163, 0.1351458609458946, 0.04240390203804487, 0.07929715525048474, 0.17824758946939948, 0.15611957381202263, 0.13563141860511332, 0.0716585587000563, -0.058324145249623274, -0.35395712689274833, -0.17444497349760718, -0.2069909509005291, 0.08626978465222887, -0.07696794344200975, -0.19349972236724128, 0.37209453667026193, 0.0637348420031014, 0.21832828773629098, 0.09065731665829108, 0.17302876591150249, 0.08847763704488032, -0.0497593105992391, 0.0838822717734036, 0.1851135032428872, 0.21742671637884564, 0.08854623369074294, -0.1608340228331231, -0.017754005973360368, 0.15979887715532512] |
1,802.1044 | Precision medicine as a control problem: Using simulation and deep
reinforcement learning to discover adaptive, personalized multi-cytokine
therapy for sepsis | Sepsis is a life-threatening condition affecting one million people per year
in the US in which dysregulation of the body's own immune system causes damage
to its tissues, resulting in a 28 - 50% mortality rate. Clinical trials for
sepsis treatment over the last 20 years have failed to produce a single
currently FDA approved drug treatment. In this study, we attempt to discover an
effective cytokine mediation treatment strategy for sepsis using a previously
developed agent-based model that simulates the innate immune response to
infection: the Innate Immune Response agent-based model (IIRABM). Previous
attempts at reducing mortality with multi-cytokine mediation using the IIRABM
have failed to reduce mortality across all patient parameterizations and
motivated us to investigate whether adaptive, personalized multi-cytokine
mediation can control the trajectory of sepsis and lower patient mortality. We
used the IIRABM to compute a treatment policy in which systemic patient
measurements are used in a feedback loop to inform future treatment. Using deep
reinforcement learning, we identified a policy that achieves 0% mortality on
the patient parameterization on which it was trained. More importantly, this
policy also achieves 0.8% mortality over 500 randomly selected patient
parameterizations with baseline mortalities ranging from 1 - 99% (with an
average of 49%) spanning the entire clinically plausible parameter space of the
IIRABM. These results suggest that adaptive, personalized multi-cytokine
mediation therapy could be a promising approach for treating sepsis. We hope
that this work motivates researchers to consider such an approach as part of
future clinical trials. To the best of our knowledge, this work is the first to
consider adaptive, personalized multi-cytokine mediation therapy for sepsis,
and is the first to exploit deep reinforcement learning on a biological
simulation.
| cs.LG q-bio.TO | sepsis is a lifethreatening condition affecting one million people per year in the us in which dysregulation of the bodys own immune system causes damage to its tissues resulting in a 28 50 mortality rate clinical trials for sepsis treatment over the last 20 years have failed to produce a single currently fda approved drug treatment in this study we attempt to discover an effective cytokine mediation treatment strategy for sepsis using a previously developed agentbased model that simulates the innate immune response to infection the innate immune response agentbased model iirabm previous attempts at reducing mortality with multicytokine mediation using the iirabm have failed to reduce mortality across all patient parameterizations and motivated us to investigate whether adaptive personalized multicytokine mediation can control the trajectory of sepsis and lower patient mortality we used the iirabm to compute a treatment policy in which systemic patient measurements are used in a feedback loop to inform future treatment using deep reinforcement learning we identified a policy that achieves 0 mortality on the patient parameterization on which it was trained more importantly this policy also achieves 08 mortality over 500 randomly selected patient parameterizations with baseline mortalities ranging from 1 99 with an average of 49 spanning the entire clinically plausible parameter space of the iirabm these results suggest that adaptive personalized multicytokine mediation therapy could be a promising approach for treating sepsis we hope that this work motivates researchers to consider such an approach as part of future clinical trials to the best of our knowledge this work is the first to consider adaptive personalized multicytokine mediation therapy for sepsis and is the first to exploit deep reinforcement learning on a biological simulation | [['sepsis', 'is', 'a', 'lifethreatening', 'condition', 'affecting', 'one', 'million', 'people', 'per', 'year', 'in', 'the', 'us', 'in', 'which', 'dysregulation', 'of', 'the', 'bodys', 'own', 'immune', 'system', 'causes', 'damage', 'to', 'its', 'tissues', 'resulting', 'in', 'a', '28', '50', 'mortality', 'rate', 'clinical', 'trials', 'for', 'sepsis', 'treatment', 'over', 'the', 'last', '20', 'years', 'have', 'failed', 'to', 'produce', 'a', 'single', 'currently', 'fda', 'approved', 'drug', 'treatment', 'in', 'this', 'study', 'we', 'attempt', 'to', 'discover', 'an', 'effective', 'cytokine', 'mediation', 'treatment', 'strategy', 'for', 'sepsis', 'using', 'a', 'previously', 'developed', 'agentbased', 'model', 'that', 'simulates', 'the', 'innate', 'immune', 'response', 'to', 'infection', 'the', 'innate', 'immune', 'response', 'agentbased', 'model', 'iirabm', 'previous', 'attempts', 'at', 'reducing', 'mortality', 'with', 'multicytokine', 'mediation', 'using', 'the', 'iirabm', 'have', 'failed', 'to', 'reduce', 'mortality', 'across', 'all', 'patient', 'parameterizations', 'and', 'motivated', 'us', 'to', 'investigate', 'whether', 'adaptive', 'personalized', 'multicytokine', 'mediation', 'can', 'control', 'the', 'trajectory', 'of', 'sepsis', 'and', 'lower', 'patient', 'mortality', 'we', 'used', 'the', 'iirabm', 'to', 'compute', 'a', 'treatment', 'policy', 'in', 'which', 'systemic', 'patient', 'measurements', 'are', 'used', 'in', 'a', 'feedback', 'loop', 'to', 'inform', 'future', 'treatment', 'using', 'deep', 'reinforcement', 'learning', 'we', 'identified', 'a', 'policy', 'that', 'achieves', '0', 'mortality', 'on', 'the', 'patient', 'parameterization', 'on', 'which', 'it', 'was', 'trained', 'more', 'importantly', 'this', 'policy', 'also', 'achieves', '08', 'mortality', 'over', '500', 'randomly', 'selected', 'patient', 'parameterizations', 'with', 'baseline', 'mortalities', 'ranging', 'from', '1', '99', 'with', 'an', 'average', 'of', '49', 'spanning', 'the', 'entire', 'clinically', 'plausible', 'parameter', 'space', 'of', 'the', 'iirabm', 'these', 'results', 'suggest', 'that', 'adaptive', 'personalized', 'multicytokine', 'mediation', 'therapy', 'could', 'be', 'a', 'promising', 'approach', 'for', 'treating', 'sepsis', 'we', 'hope', 'that', 'this', 'work', 'motivates', 'researchers', 'to', 'consider', 'such', 'an', 'approach', 'as', 'part', 'of', 'future', 'clinical', 'trials', 'to', 'the', 'best', 'of', 'our', 'knowledge', 'this', 'work', 'is', 'the', 'first', 'to', 'consider', 'adaptive', 'personalized', 'multicytokine', 'mediation', 'therapy', 'for', 'sepsis', 'and', 'is', 'the', 'first', 'to', 'exploit', 'deep', 'reinforcement', 'learning', 'on', 'a', 'biological', 'simulation']] | [-0.001414415427795164, 0.08030394583523524, -0.06449137271209571, 0.08165412869414619, -0.1306510404749936, -0.18001400198442763, 0.11322984032107523, 0.39708788610756185, -0.1932228258554078, -0.30453930325885686, 0.09634673906870525, -0.28168190996994485, -0.182716504654108, 0.19149175692462359, -0.16649896675535208, 0.03518461366909062, 0.06068071789726336, 0.037350688475180825, 0.04504569829358749, -0.3172661010225658, 0.2212068508428876, 0.08951535401845126, 0.2911904085459837, 0.015852476188041323, 0.11558354393250948, 0.028018591622241983, -0.03958655282435773, -0.038507328257383115, -0.12244499988265226, 0.1141956864845412, 0.3691199123967121, 0.2160021381625024, 0.39818211464589176, -0.4011933635522568, -0.2827032102782319, 0.11387418329324639, 0.11031357459293088, 0.1257801744279044, -0.017352478061083892, -0.25294069892948895, 0.05882270352602555, -0.24314515536743816, -0.09074351482848998, -0.06285900259440189, -0.03341186878866321, -0.0799178144294222, -0.32991619514851594, 0.08397250238485349, -0.06097567953199175, 0.10487088672916182, -0.1264137037738899, -0.1292346951139932, 0.008353705868436508, 0.170958637758705, 0.10098974976035703, 0.08349910958834138, 0.18145044907443622, -0.14867141601394238, -0.15165086339262657, 0.3121622792673811, -0.005970491985442429, -0.1446122586407311, 0.18220240803285473, -0.08124609531675635, -0.1349556708817778, 0.13438214265055345, 0.252980031878472, 0.09906514279968585, -0.2214226535789907, -0.06915425647649205, 0.018753308519469145, 0.16478698452589935, 0.04849294202693894, -0.08476953064812368, 0.14700735888105826, 0.24644138510471536, 0.014857328882991102, 0.06266559014350401, -0.11211259456623174, -0.08197920452604514, -0.2237093168289278, -0.12998322464978931, -0.038519980189112075, 0.06282505635221844, -0.07698346334875161, -0.13875088038244468, 0.392600344187411, 0.2315757517906708, 0.11865310549232247, 0.09466609489899774, 0.2695077126912004, 0.012064842776945557, 0.12077133406949597, 0.018052509265000603, 0.1887471895661616, 0.015102554094236928, 0.08723304465577152, -0.24846134970405429, 0.16312760694426387, -0.020231980123653265] |
1,802.10441 | A Primer on Resurgent Transseries and Their Asymptotics | The computation of observables in general interacting theories, be them
quantum mechanical, field, gauge or string theories, is a non-trivial problem
which in many cases can only be addressed by resorting to perturbative methods.
In most physically interesting problems these perturbative expansions result in
asymptotic series with zero radius of convergence. These asymptotic series then
require the use of resurgence and transseries in order for the associated
observables to become nonperturbatively well-defined. Resurgence encodes the
complete large-order asymptotic behaviour of the coefficients from a
perturbative expansion, generically in terms of (multi) instanton sectors and
for each problem in terms of its Stokes constants. Some observables arise from
linear problems, and have a finite number of instanton sectors and associated
Stokes constants; some other observables arise from nonlinear problems, and
have an infinite number of instanton sectors and Stokes constants. By means of
two very explicit examples, and with emphasis on a pedagogical style of
presentation, this work aims at serving as a primer on the aforementioned
resurgent, large-order asymptotics of general perturbative expansions. This
includes discussions of transseries, Stokes phenomena, generalized
steepest-descent methods, Borel transforms, nonlinear resonance, and alien
calculus. Furthermore, resurgent properties of transseries---usually described
mathematically via alien calculus---are recast in equivalent physical
languages: either a "statistical mechanical" language, as motions in chains and
lattices; or a "conformal field theoretical" language, with underlying
Virasoro-like algebraic structures.
| hep-th hep-lat hep-ph math-ph math.MP quant-ph | the computation of observables in general interacting theories be them quantum mechanical field gauge or string theories is a nontrivial problem which in many cases can only be addressed by resorting to perturbative methods in most physically interesting problems these perturbative expansions result in asymptotic series with zero radius of convergence these asymptotic series then require the use of resurgence and transseries in order for the associated observables to become nonperturbatively welldefined resurgence encodes the complete largeorder asymptotic behaviour of the coefficients from a perturbative expansion generically in terms of multi instanton sectors and for each problem in terms of its stokes constants some observables arise from linear problems and have a finite number of instanton sectors and associated stokes constants some other observables arise from nonlinear problems and have an infinite number of instanton sectors and stokes constants by means of two very explicit examples and with emphasis on a pedagogical style of presentation this work aims at serving as a primer on the aforementioned resurgent largeorder asymptotics of general perturbative expansions this includes discussions of transseries stokes phenomena generalized steepestdescent methods borel transforms nonlinear resonance and alien calculus furthermore resurgent properties of transseriesusually described mathematically via alien calculusare recast in equivalent physical languages either a statistical mechanical language as motions in chains and lattices or a conformal field theoretical language with underlying virasorolike algebraic structures | [['the', 'computation', 'of', 'observables', 'in', 'general', 'interacting', 'theories', 'be', 'them', 'quantum', 'mechanical', 'field', 'gauge', 'or', 'string', 'theories', 'is', 'a', 'nontrivial', 'problem', 'which', 'in', 'many', 'cases', 'can', 'only', 'be', 'addressed', 'by', 'resorting', 'to', 'perturbative', 'methods', 'in', 'most', 'physically', 'interesting', 'problems', 'these', 'perturbative', 'expansions', 'result', 'in', 'asymptotic', 'series', 'with', 'zero', 'radius', 'of', 'convergence', 'these', 'asymptotic', 'series', 'then', 'require', 'the', 'use', 'of', 'resurgence', 'and', 'transseries', 'in', 'order', 'for', 'the', 'associated', 'observables', 'to', 'become', 'nonperturbatively', 'welldefined', 'resurgence', 'encodes', 'the', 'complete', 'largeorder', 'asymptotic', 'behaviour', 'of', 'the', 'coefficients', 'from', 'a', 'perturbative', 'expansion', 'generically', 'in', 'terms', 'of', 'multi', 'instanton', 'sectors', 'and', 'for', 'each', 'problem', 'in', 'terms', 'of', 'its', 'stokes', 'constants', 'some', 'observables', 'arise', 'from', 'linear', 'problems', 'and', 'have', 'a', 'finite', 'number', 'of', 'instanton', 'sectors', 'and', 'associated', 'stokes', 'constants', 'some', 'other', 'observables', 'arise', 'from', 'nonlinear', 'problems', 'and', 'have', 'an', 'infinite', 'number', 'of', 'instanton', 'sectors', 'and', 'stokes', 'constants', 'by', 'means', 'of', 'two', 'very', 'explicit', 'examples', 'and', 'with', 'emphasis', 'on', 'a', 'pedagogical', 'style', 'of', 'presentation', 'this', 'work', 'aims', 'at', 'serving', 'as', 'a', 'primer', 'on', 'the', 'aforementioned', 'resurgent', 'largeorder', 'asymptotics', 'of', 'general', 'perturbative', 'expansions', 'this', 'includes', 'discussions', 'of', 'transseries', 'stokes', 'phenomena', 'generalized', 'steepestdescent', 'methods', 'borel', 'transforms', 'nonlinear', 'resonance', 'and', 'alien', 'calculus', 'furthermore', 'resurgent', 'properties', 'of', 'transseriesusually', 'described', 'mathematically', 'via', 'alien', 'calculusare', 'recast', 'in', 'equivalent', 'physical', 'languages', 'either', 'a', 'statistical', 'mechanical', 'language', 'as', 'motions', 'in', 'chains', 'and', 'lattices', 'or', 'a', 'conformal', 'field', 'theoretical', 'language', 'with', 'underlying', 'virasorolike', 'algebraic', 'structures']] | [-0.1205760787092408, 0.10798008705030143, -0.11887174421746749, 0.10558834533362339, -0.11926248237490654, -0.13392781471626627, 0.006874582551212774, 0.31011101965275073, -0.26665649390727697, -0.23316066688961454, 0.11004726893837667, -0.2686938901224898, -0.15445259561555252, 0.19695361812288562, -0.05146305830308443, 0.09252078169361792, 0.039000484542274436, 0.04993151847893993, -0.07923790799764295, -0.22456213052384555, 0.31402120637396974, -0.028363364909051194, 0.21877379201869998, 0.0349605833283729, 0.08630533315034376, -0.012259536509712537, -0.0473668329231441, 0.04986085246064047, -0.143634587523217, 0.12698759853012032, 0.31726741360500454, 0.07706386276210347, 0.24830566756323807, -0.44757789298064177, -0.1932086186333456, 0.05953721313116451, 0.17413872032529779, 0.12185409226920456, 0.026903117274244628, -0.2762625891280671, 0.024242164794769552, -0.17425026268180874, -0.15341819915144395, -0.15138792882983884, -0.003554473106438915, 0.014341494755612479, -0.25046256558348734, 0.06664261974808243, 0.029458259597627653, 0.1124446276947856, 0.006960575304821961, -0.10705021087959822, 0.029162071686651973, 0.11250763291079137, 0.12886930933804253, -0.017556329566157526, 0.08573133808043268, -0.19053573955574798, -0.15541673991208274, 0.3877357941576176, -0.05741734847478155, -0.23049795153654284, 0.16881248781561023, -0.12759228453867966, -0.17840733384196128, 0.1138822490349412, 0.12617060302239325, 0.14520133606054716, -0.12819809120769302, 0.1982840389011027, -0.009878432926100989, 0.09800119253703289, 0.11875857101546393, 0.0828641874055999, 0.22981711997340123, 0.05799606746269597, -0.004424222263559285, 0.11736682034537403, 0.07195492371748616, -0.13569427023124364, -0.3728420163359907, -0.11559702613080541, -0.13167430102230154, 0.0881788566832741, -0.14003258279725236, -0.22014897272197737, 0.3925588588251008, 0.09254325218983771, 0.17839608419893516, 0.05058960979830267, 0.23835905109428698, 0.14630134189837715, 0.033324680311812294, 0.006358471477611197, 0.1820979688370911, 0.18444273619602125, 0.0895062864292413, -0.21733133652247488, -0.017880342714488507, 0.16083985609312854] |
1,802.10442 | Three-particle $N\pi\pi$ state contribution to the nucleon two-point
function in lattice QCD | The three-particle $N\pi\pi$-state contribution to the QCD two-point function
of standard nucleon interpolating fields is computed to leading order in chiral
perturbation theory. Using the experimental values for two low-energy
coefficients the impact of this contribution on lattice QCD calculations of the
nucleon mass is estimated. The impact is found to be at the per mille level at
most and negligible in practice.
| hep-lat | the threeparticle npipistate contribution to the qcd twopoint function of standard nucleon interpolating fields is computed to leading order in chiral perturbation theory using the experimental values for two lowenergy coefficients the impact of this contribution on lattice qcd calculations of the nucleon mass is estimated the impact is found to be at the per mille level at most and negligible in practice | [['the', 'threeparticle', 'npipistate', 'contribution', 'to', 'the', 'qcd', 'twopoint', 'function', 'of', 'standard', 'nucleon', 'interpolating', 'fields', 'is', 'computed', 'to', 'leading', 'order', 'in', 'chiral', 'perturbation', 'theory', 'using', 'the', 'experimental', 'values', 'for', 'two', 'lowenergy', 'coefficients', 'the', 'impact', 'of', 'this', 'contribution', 'on', 'lattice', 'qcd', 'calculations', 'of', 'the', 'nucleon', 'mass', 'is', 'estimated', 'the', 'impact', 'is', 'found', 'to', 'be', 'at', 'the', 'per', 'mille', 'level', 'at', 'most', 'and', 'negligible', 'in', 'practice']] | [-0.076903902339719, 0.18805751235284393, -0.08514996011170649, 0.10263990120015919, -0.02259642630815506, 0.0029562915104531474, 0.023507430644390443, 0.3271374463614437, -0.18787147972409823, -0.2615246585299892, 0.009689493626806765, -0.3437856556096625, -0.0476135108695035, 0.12004191723967632, 0.08529387675826589, 0.06831529617122742, 0.007959537042845641, 0.08559803096877952, -0.1013417111619586, -0.259786072472531, 0.3237417658355327, 0.06945831350411379, 0.21941453590989113, 0.20001566333455906, 0.044818596328578646, -0.0032464516980032767, -0.040034744573096116, -0.037437527560659, -0.11731396997798114, 0.10444012054452492, 0.2480256937016102, -0.03347950141065784, 0.18304072566811116, -0.4034019181384675, -0.14340132638256275, 0.06136515359544466, 0.11400019225754565, 0.14827811325930298, 0.013056431812489586, -0.1956562331967777, 0.11186915165894935, -0.18402878621653204, -0.16163062391382071, -0.09839872961616024, -0.04289274044605272, -0.07701641570536359, -0.32829353844206177, 0.1260782337124129, -0.11086380207392897, 0.027532688134435317, -0.015386210675651749, -0.2294147800534002, -0.02978447336523283, 0.10770808897852417, 0.1093406237158624, 0.14802700995642226, 0.16149851244183316, -0.2006510978136512, -0.11127252143717581, 0.44111547796919404, -0.06383203935336261, -0.20614981106031807, 0.07549206666918772, -0.20986167174733936, -0.15168037238500773, 0.13470243249509123, 0.17672512536087343, 0.07224445035136605, -0.16023861613845633, 0.08040579881485281, 0.026513384294606025, 0.20994234358659014, 0.08322856904217793, 0.05561029734165077, 0.19484028472535073, 0.1379269929790509, -0.03016267131052671, 0.06965548425514792, -0.0877088047601583, -0.13743386501746793, -0.3683318684718782, -0.03203032934857953, -0.22306322851668922, 0.037616802274339625, -0.10117318505217554, -0.12961024131565804, 0.41646945934682605, 0.1561451431499013, 0.1932782421879951, 0.022033337578778307, 0.3290973379006309, 0.19109165807998169, 0.10796354195824073, 0.02901195767633673, 0.3137282181395999, 0.16172793656662707, 0.06642157891615023, -0.27634333788357196, 0.010674174657211669, 0.12156867884820508] |
1,802.10443 | Modeling our survival in a zombie apocalypse | In this work we applied several concepts on the modeling of complex systems
in an attempt to save mankind in the case of a zombie apocalypse. We developed
a dynamical system in order to model a zombie outbreak in which we, regular
humans, are aided by military personnel in the fight against the zombies. Our
analysis has shown that the initial amount of military personnel play a key
rule on our survival, even when the zombies are extremely aggressive and in
large advantage.This document is a pre-print version of the paper de
Mendon\c{c}a, J.P.A., Teixeira, L.M.V., Sato, F. et al. Math Intelligencer
(2019). https://doi.org/10.1007/s00283-019-09893-9.
| physics.pop-ph math.DS | in this work we applied several concepts on the modeling of complex systems in an attempt to save mankind in the case of a zombie apocalypse we developed a dynamical system in order to model a zombie outbreak in which we regular humans are aided by military personnel in the fight against the zombies our analysis has shown that the initial amount of military personnel play a key rule on our survival even when the zombies are extremely aggressive and in large advantagethis document is a preprint version of the paper de mendoncca jpa teixeira lmv sato f et al math intelligencer 2019 httpsdoiorg101007s00283019098939 | [['in', 'this', 'work', 'we', 'applied', 'several', 'concepts', 'on', 'the', 'modeling', 'of', 'complex', 'systems', 'in', 'an', 'attempt', 'to', 'save', 'mankind', 'in', 'the', 'case', 'of', 'a', 'zombie', 'apocalypse', 'we', 'developed', 'a', 'dynamical', 'system', 'in', 'order', 'to', 'model', 'a', 'zombie', 'outbreak', 'in', 'which', 'we', 'regular', 'humans', 'are', 'aided', 'by', 'military', 'personnel', 'in', 'the', 'fight', 'against', 'the', 'zombies', 'our', 'analysis', 'has', 'shown', 'that', 'the', 'initial', 'amount', 'of', 'military', 'personnel', 'play', 'a', 'key', 'rule', 'on', 'our', 'survival', 'even', 'when', 'the', 'zombies', 'are', 'extremely', 'aggressive', 'and', 'in', 'large', 'advantagethis', 'document', 'is', 'a', 'preprint', 'version', 'of', 'the', 'paper', 'de', 'mendoncca', 'jpa', 'teixeira', 'lmv', 'sato', 'f', 'et', 'al', 'math', 'intelligencer', '2019', 'httpsdoiorg101007s00283019098939']] | [-0.11110767721092457, 0.06697631191296877, -0.09904066370892348, 0.058424763233944924, -0.07177833565464704, -0.09549667628246848, 0.05217878239363026, 0.3001097594710565, -0.18640122170292653, -0.31689969887311503, 0.14147491389793335, -0.27141737167050345, -0.21282442311507346, 0.19646924387174888, -0.19304092812102916, 0.022909239487777844, 0.04956287215233292, 0.004210792806940061, 0.08518530557042744, -0.326474783702357, 0.27475653118961074, 0.09612765138257655, 0.2789766410421027, 0.02311678305913759, 0.035203832534768865, 0.024673356524770065, -0.0469055617006846, -0.014937737329614044, -0.111978789937056, 0.09024661430849297, 0.31452742142436824, 0.13895769281506465, 0.36784508319036796, -0.42530453959387715, -0.19869070456796648, 0.13354476223386233, 0.11406181166686191, 0.131056406145044, -0.02117991208854952, -0.2993883655779986, 0.08474436610081869, -0.24697675076451633, -0.11960694401773929, -0.05127971779813271, 0.07771700998021308, 8.725039753140789e-05, -0.25188028174544697, 0.01024029700841644, 0.09556043963264997, 0.10585603992095088, -0.04422959297120866, -0.09342375926853222, -0.01314194192003348, 0.1302002860722478, 0.0039326930568452075, 0.04698419258330423, 0.08016204249371986, -0.1247861033771187, -0.10862762391587978, 0.3555293677024322, -0.014772693866329028, -0.16365496401149449, 0.19982620324623382, -0.07112664629308747, -0.179788472642661, 0.055435973477761934, 0.22841514574160965, 0.13125233374314732, -0.12186715225207892, 0.0754432944888664, -0.03651047820723293, 0.13254133267973614, 0.08202456425654121, -0.07271395185685689, 0.1455205515797001, 0.1880475697222876, 0.04786029282616138, 0.08795152727680483, -0.054867136836199475, -0.10715567178034113, -0.23870270979581493, -0.15361142323189875, -0.16051015548066855, 0.05958284905305972, 0.012616225117316129, -0.1399083898162428, 0.36391931285362433, 0.20070631691890925, 0.13083982033341532, -0.019024982819066262, 0.25512558747414904, 0.051261550410291054, 0.042635610285630024, 0.09010168616337204, 0.20273133093435872, 0.04202712294507292, 0.1837101111160868, -0.18276550574228168, 0.09077230149345232, 0.07109885103078467] |
1,802.10444 | On the Low-Complexity, Hardware-Friendly Tridiagonal Matrix Inversion
for Correlated Massive MIMO Systems | In massive MIMO (M-MIMO) systems, one of the key challenges in the
implementation is the large-scale matrix inversion operation, as widely used in
channel estimation, equalization, detection, and decoding procedures.
Traditionally, to handle this complexity issue, several low-complexity matrix
inversion approximation methods have been proposed, including the classic
Cholesky decomposition and the Neumann series expansion (NSE). However, the
conventional approaches failed to exploit neither the special structure of
channel matrices nor the critical issues in the hardware implementation, which
results in poorer throughput performance and longer processing delay. In this
paper, by targeting at the correlated M-MIMO systems, we propose a modified NSE
based on tridiagonal matrix inversion approximation (TMA) to accommodate the
complexity as well as the performance issue in the conventional hardware
implementation, and analyze the corresponding approximation errors. Meanwhile,
we investigate the VLSI implementation for the proposed detection algorithm
based on a Xilinx Virtex-7 XC7VX690T FPGA platform. It is shown that for
correlated massive MIMO systems, it can achieve near-MMSE performance and $630$
Mb/s throughput. Compared with other benchmark systems, the proposed pipelined
TMA detector can get high throughput-to-hardware ratio. Finally, we also
propose a fast iteration structure for further research.
| eess.SP cs.AR cs.NA math.NA | in massive mimo mmimo systems one of the key challenges in the implementation is the largescale matrix inversion operation as widely used in channel estimation equalization detection and decoding procedures traditionally to handle this complexity issue several lowcomplexity matrix inversion approximation methods have been proposed including the classic cholesky decomposition and the neumann series expansion nse however the conventional approaches failed to exploit neither the special structure of channel matrices nor the critical issues in the hardware implementation which results in poorer throughput performance and longer processing delay in this paper by targeting at the correlated mmimo systems we propose a modified nse based on tridiagonal matrix inversion approximation tma to accommodate the complexity as well as the performance issue in the conventional hardware implementation and analyze the corresponding approximation errors meanwhile we investigate the vlsi implementation for the proposed detection algorithm based on a xilinx virtex7 xc7vx690t fpga platform it is shown that for correlated massive mimo systems it can achieve nearmmse performance and 630 mbs throughput compared with other benchmark systems the proposed pipelined tma detector can get high throughputtohardware ratio finally we also propose a fast iteration structure for further research | [['in', 'massive', 'mimo', 'mmimo', 'systems', 'one', 'of', 'the', 'key', 'challenges', 'in', 'the', 'implementation', 'is', 'the', 'largescale', 'matrix', 'inversion', 'operation', 'as', 'widely', 'used', 'in', 'channel', 'estimation', 'equalization', 'detection', 'and', 'decoding', 'procedures', 'traditionally', 'to', 'handle', 'this', 'complexity', 'issue', 'several', 'lowcomplexity', 'matrix', 'inversion', 'approximation', 'methods', 'have', 'been', 'proposed', 'including', 'the', 'classic', 'cholesky', 'decomposition', 'and', 'the', 'neumann', 'series', 'expansion', 'nse', 'however', 'the', 'conventional', 'approaches', 'failed', 'to', 'exploit', 'neither', 'the', 'special', 'structure', 'of', 'channel', 'matrices', 'nor', 'the', 'critical', 'issues', 'in', 'the', 'hardware', 'implementation', 'which', 'results', 'in', 'poorer', 'throughput', 'performance', 'and', 'longer', 'processing', 'delay', 'in', 'this', 'paper', 'by', 'targeting', 'at', 'the', 'correlated', 'mmimo', 'systems', 'we', 'propose', 'a', 'modified', 'nse', 'based', 'on', 'tridiagonal', 'matrix', 'inversion', 'approximation', 'tma', 'to', 'accommodate', 'the', 'complexity', 'as', 'well', 'as', 'the', 'performance', 'issue', 'in', 'the', 'conventional', 'hardware', 'implementation', 'and', 'analyze', 'the', 'corresponding', 'approximation', 'errors', 'meanwhile', 'we', 'investigate', 'the', 'vlsi', 'implementation', 'for', 'the', 'proposed', 'detection', 'algorithm', 'based', 'on', 'a', 'xilinx', 'virtex7', 'xc7vx690t', 'fpga', 'platform', 'it', 'is', 'shown', 'that', 'for', 'correlated', 'massive', 'mimo', 'systems', 'it', 'can', 'achieve', 'nearmmse', 'performance', 'and', '630', 'mbs', 'throughput', 'compared', 'with', 'other', 'benchmark', 'systems', 'the', 'proposed', 'pipelined', 'tma', 'detector', 'can', 'get', 'high', 'throughputtohardware', 'ratio', 'finally', 'we', 'also', 'propose', 'a', 'fast', 'iteration', 'structure', 'for', 'further', 'research']] | [-0.13407072877811257, -0.040577800135635306, -0.04007836643494275, 0.04787575173818297, -0.05469551646633376, -0.22476985106849312, 0.03873541524343641, 0.402238726224604, -0.24885383005015044, -0.3112879409942366, 0.16086432435098763, -0.21347017417977568, -0.2029561154344436, 0.18915817345960642, -0.09049083766800532, 0.13959067537819878, 0.09581131470896771, -0.0004002529279333759, -0.14718507406154296, -0.2708236638643091, 0.22933023415398612, 0.13529179102121924, 0.38989592151453045, 0.01305707114509731, 0.07447087714459695, -0.02329586115690114, -0.006921385147935511, -0.044993927918072225, -0.03827590238582861, 0.08286211454231507, 0.30309756650194447, 0.1728812029417019, 0.27450725830438016, -0.43342049491070017, -0.20734343650453377, 0.051138924686506354, 0.1982689516774881, 0.0834489793300931, -0.0771675753780197, -0.2663890921135301, 0.10697351458009469, -0.22521449113996084, -0.04331099996416395, -0.07085712553557807, -0.05327370772577081, -0.0023282856189192356, -0.293927470932188, 0.045413271332475365, 0.01442359161085671, 0.013926025163089729, 0.0031830964180889552, -0.17629165358290427, 0.09917431246947633, 0.07043766270084453, -0.010597629317189737, -0.010216029585187972, 0.10900976697924054, -0.07963279779044745, -0.1311575046530803, 0.38001813989678757, -0.028634610278830568, -0.2335085713277761, 0.1936526799663482, -0.0470234592206269, -0.1478491267676987, 0.1286518261530217, 0.22959952449797244, 0.06551985142579429, -0.1644443125123919, 0.062450670116368914, 0.03263330844313842, 0.20379943090505626, 0.04879042379928665, 0.07987037401380327, 0.11582336453257704, 0.22852310786969687, 0.0642962348001341, 0.14710717752279656, -0.12820423147714263, -0.10636557853922092, -0.1825542468382582, -0.1520851153626804, -0.18959932696410695, -0.03239460218813897, -0.07878395471121831, -0.13716592760777943, 0.36486443238947247, 0.1919754937252137, 0.10923002039433423, 0.0667569124370238, 0.4121677872056814, 0.1050713528612024, 0.11754314236693982, 0.1313217613024452, 0.19565088896773247, 0.12203925474746767, 0.1479173550596802, -0.2590232817382986, 0.05882259789995693, 0.045635272935276645] |
1,802.10445 | Changes in the metallicity of gas giant planets due to pebble accretion | We run numerical simulations to study the accretion of gas and dust grains
onto gas giant planets embedded into massive protoplanetary discs. The outcome
is found to depend on the disc cooling rate, planet mass, grain size and
irradiative feedback from the planet. If radiative cooling is efficient,
planets accrete both gas and pebbles rapidly, open a gap and usually become
massive brown dwarfs. In the inefficient cooling case, gas is too hot to
accrete onto the planet but pebble accretion continues and the planets migrate
inward rapidly. Radiative feedback from the planet tends to suppress gas
accretion. Our simulations predict that metal enrichment of planets by dust
grain accretion inversely correlates with the final planet mass, in accordance
with the observed trend in the inferred bulk composition of Solar System and
exosolar giant planets. To account for observations, however, as much as
~30-50% of the dust mass should be in the form of large grains.
| astro-ph.EP | we run numerical simulations to study the accretion of gas and dust grains onto gas giant planets embedded into massive protoplanetary discs the outcome is found to depend on the disc cooling rate planet mass grain size and irradiative feedback from the planet if radiative cooling is efficient planets accrete both gas and pebbles rapidly open a gap and usually become massive brown dwarfs in the inefficient cooling case gas is too hot to accrete onto the planet but pebble accretion continues and the planets migrate inward rapidly radiative feedback from the planet tends to suppress gas accretion our simulations predict that metal enrichment of planets by dust grain accretion inversely correlates with the final planet mass in accordance with the observed trend in the inferred bulk composition of solar system and exosolar giant planets to account for observations however as much as 3050 of the dust mass should be in the form of large grains | [['we', 'run', 'numerical', 'simulations', 'to', 'study', 'the', 'accretion', 'of', 'gas', 'and', 'dust', 'grains', 'onto', 'gas', 'giant', 'planets', 'embedded', 'into', 'massive', 'protoplanetary', 'discs', 'the', 'outcome', 'is', 'found', 'to', 'depend', 'on', 'the', 'disc', 'cooling', 'rate', 'planet', 'mass', 'grain', 'size', 'and', 'irradiative', 'feedback', 'from', 'the', 'planet', 'if', 'radiative', 'cooling', 'is', 'efficient', 'planets', 'accrete', 'both', 'gas', 'and', 'pebbles', 'rapidly', 'open', 'a', 'gap', 'and', 'usually', 'become', 'massive', 'brown', 'dwarfs', 'in', 'the', 'inefficient', 'cooling', 'case', 'gas', 'is', 'too', 'hot', 'to', 'accrete', 'onto', 'the', 'planet', 'but', 'pebble', 'accretion', 'continues', 'and', 'the', 'planets', 'migrate', 'inward', 'rapidly', 'radiative', 'feedback', 'from', 'the', 'planet', 'tends', 'to', 'suppress', 'gas', 'accretion', 'our', 'simulations', 'predict', 'that', 'metal', 'enrichment', 'of', 'planets', 'by', 'dust', 'grain', 'accretion', 'inversely', 'correlates', 'with', 'the', 'final', 'planet', 'mass', 'in', 'accordance', 'with', 'the', 'observed', 'trend', 'in', 'the', 'inferred', 'bulk', 'composition', 'of', 'solar', 'system', 'and', 'exosolar', 'giant', 'planets', 'to', 'account', 'for', 'observations', 'however', 'as', 'much', 'as', '3050', 'of', 'the', 'dust', 'mass', 'should', 'be', 'in', 'the', 'form', 'of', 'large', 'grains']] | [-0.044826542556014225, 0.21748104912172167, -0.015756236056450944, 0.07569616400108387, -0.10297150022159211, -0.05024164861056189, 0.06266443118847047, 0.3417523625330665, -0.17797143353770176, -0.33919559685417855, 0.09304373529411326, -0.2772025572709166, 0.011564322036858171, 0.1716789495981991, -0.06653950157432029, 0.008128149661784753, 0.134441189752229, -0.14865558663568196, -0.010721903779761842, -0.29014788974577993, 0.3199322964527453, 0.10040793671475676, 0.01724536848278382, 0.009205141462212523, -0.012331432127095282, -0.18342533624933985, -0.044669589006867357, -0.08983282725332686, -0.24294920335845605, -0.03452153390464492, 0.20954297119244122, 0.08642348574283414, 0.2200245350220193, -0.47832899246937954, -0.23660973449631667, 0.046254541439199014, 0.23244071196024427, 0.04521373194009543, -0.09658617995909224, -0.16006067481775504, 0.044495879099346124, -0.24509845172556546, -0.17266614090663213, 0.08897214963470991, 0.09441539740939146, -0.03180668221529441, -0.31638494300214237, 0.10323939649149394, 0.11817334871739149, 0.03120001883078844, -0.1516397265577092, -0.09056712805520362, -0.15943184160203552, 0.05753167076125884, 0.06542975990137515, 0.05424922602460123, 0.357195461615144, -0.10537007461654213, 0.0789286576044292, 0.44198703861389405, -0.11527873349274532, -0.03230177694095824, 0.3178317850957123, -0.30044909740312364, -0.07203889903030358, 0.20808396554098296, 0.2212192572724934, 0.11756170286426847, -0.1244814118059973, -0.03678457119773763, -0.03540447818186994, 0.1822674477507229, 0.07319057417006637, 0.025671093676907893, 0.4938655636536005, 0.1748652417633984, 0.026060687145964507, 0.08813678817928004, -0.1721429704361631, -0.11833617068343581, -0.08111278458426778, -0.18242685773517364, -0.19496309292466882, 0.07473375187971844, -0.1166704199778719, -0.1319308954780587, 0.21275647030844808, 0.12416413822062075, 0.228041978003696, 0.04869767049631964, 0.35438682710847413, 0.08134717205524421, 0.18105516856154188, 0.18613392897009945, 0.3038234976806845, 0.17044282308331907, 0.12222980734748909, -0.3536195937806788, 0.12845367468943528, -0.008845730929468304] |
1,802.10446 | Identifying Sources and Sinks in the Presence of Multiple Agents with
Gaussian Process Vector Calculus | In systems of multiple agents, identifying the cause of observed agent
dynamics is challenging. Often, these agents operate in diverse, non-stationary
environments, where models rely on hand-crafted environment-specific features
to infer influential regions in the system's surroundings. To overcome the
limitations of these inflexible models, we present GP-LAPLACE, a technique for
locating sources and sinks from trajectories in time-varying fields. Using
Gaussian processes, we jointly infer a spatio-temporal vector field, as well as
canonical vector calculus operations on that field. Notably, we do this from
only agent trajectories without requiring knowledge of the environment, and
also obtain a metric for denoting the significance of inferred causal features
in the environment by exploiting our probabilistic method. To evaluate our
approach, we apply it to both synthetic and real-world GPS data, demonstrating
the applicability of our technique in the presence of multiple agents, as well
as its superiority over existing methods.
| cs.MA cs.AI | in systems of multiple agents identifying the cause of observed agent dynamics is challenging often these agents operate in diverse nonstationary environments where models rely on handcrafted environmentspecific features to infer influential regions in the systems surroundings to overcome the limitations of these inflexible models we present gplaplace a technique for locating sources and sinks from trajectories in timevarying fields using gaussian processes we jointly infer a spatiotemporal vector field as well as canonical vector calculus operations on that field notably we do this from only agent trajectories without requiring knowledge of the environment and also obtain a metric for denoting the significance of inferred causal features in the environment by exploiting our probabilistic method to evaluate our approach we apply it to both synthetic and realworld gps data demonstrating the applicability of our technique in the presence of multiple agents as well as its superiority over existing methods | [['in', 'systems', 'of', 'multiple', 'agents', 'identifying', 'the', 'cause', 'of', 'observed', 'agent', 'dynamics', 'is', 'challenging', 'often', 'these', 'agents', 'operate', 'in', 'diverse', 'nonstationary', 'environments', 'where', 'models', 'rely', 'on', 'handcrafted', 'environmentspecific', 'features', 'to', 'infer', 'influential', 'regions', 'in', 'the', 'systems', 'surroundings', 'to', 'overcome', 'the', 'limitations', 'of', 'these', 'inflexible', 'models', 'we', 'present', 'gplaplace', 'a', 'technique', 'for', 'locating', 'sources', 'and', 'sinks', 'from', 'trajectories', 'in', 'timevarying', 'fields', 'using', 'gaussian', 'processes', 'we', 'jointly', 'infer', 'a', 'spatiotemporal', 'vector', 'field', 'as', 'well', 'as', 'canonical', 'vector', 'calculus', 'operations', 'on', 'that', 'field', 'notably', 'we', 'do', 'this', 'from', 'only', 'agent', 'trajectories', 'without', 'requiring', 'knowledge', 'of', 'the', 'environment', 'and', 'also', 'obtain', 'a', 'metric', 'for', 'denoting', 'the', 'significance', 'of', 'inferred', 'causal', 'features', 'in', 'the', 'environment', 'by', 'exploiting', 'our', 'probabilistic', 'method', 'to', 'evaluate', 'our', 'approach', 'we', 'apply', 'it', 'to', 'both', 'synthetic', 'and', 'realworld', 'gps', 'data', 'demonstrating', 'the', 'applicability', 'of', 'our', 'technique', 'in', 'the', 'presence', 'of', 'multiple', 'agents', 'as', 'well', 'as', 'its', 'superiority', 'over', 'existing', 'methods']] | [-0.07362589736569773, 0.017127546134115372, -0.0656948749139603, 0.07385578672826365, -0.09750938599589407, -0.12396195248977558, 0.07864576789418336, 0.42787335870938525, -0.268392433953547, -0.34049612910461585, 0.08928217043993189, -0.24177763950885148, -0.18662039271077593, 0.20506108876056592, -0.08690866107133695, 0.0531984416109579, 0.06265840456644828, 0.05354139893441587, 0.003690338849303992, -0.2125948571452141, 0.3361989247637826, 0.023959745955024217, 0.27962094087411676, -0.020207210258278693, 0.13888705124200723, 0.016102311629298573, -0.05493421559977169, 0.024092651475724335, -0.020008827059624507, 0.1267065308969216, 0.29149542768971365, 0.19673547338115405, 0.29069551430969826, -0.44686278323265344, -0.289998829114641, 0.11200222051539223, 0.13208559130293293, 0.10472075361443835, -0.007739562489331473, -0.3510608368252744, 0.07694587003464443, -0.13649871530533592, -0.08774372558046535, -0.13159491683551539, -0.03361137831627668, 0.05979398558721752, -0.27479585991996164, 0.05235213559491377, 0.058066451719905425, 0.07775034906493651, -0.09384698989388936, -0.08664037599511495, 0.009465175016737555, 0.17539002068932294, 0.03808229300036171, -0.008327544024969274, 0.18039794539485277, -0.17255044618979956, -0.16862927639945033, 0.3658987456882322, -0.06747074575301863, -0.22353879100518423, 0.26214993189126756, -0.09297342716426765, -0.15109976345194956, 0.08709159171023104, 0.2533865806558547, 0.16397873119048373, -0.16370007651543395, 0.05123726356455213, -0.007807627666389217, 0.14979368438189095, 0.014463641856973236, 0.04195067571236979, 0.19338460867702206, 0.1659898123974484, 0.03748848919309927, 0.10451129304931021, -0.09890153735397837, -0.13648056082830234, -0.23661634530573203, -0.10369365019849627, -0.18695039477677564, 0.00022291963309603366, -0.09404599358222678, -0.14399095487150024, 0.3680328687517652, 0.26222333032637835, 0.22832987884789505, 0.05832033121259883, 0.3506200292094208, 0.042772699854607264, 0.07777159901751154, 0.09702852812935472, 0.1914525986417052, 0.06869182413651582, 0.09891566189518827, -0.177943792560679, 0.1068494774769312, -0.01792136293669181] |
1,802.10447 | Oriented Convex Containers of Polygons | We consider the optimal containment of polygonal regions within convex
containers with the special property of 'orientedness' - an oriented region
enables us to choose a preferred direction on the plane (this direction is not
necessarily an axis of symmetry) - and derive preliminary results.
| math.GM | we consider the optimal containment of polygonal regions within convex containers with the special property of orientedness an oriented region enables us to choose a preferred direction on the plane this direction is not necessarily an axis of symmetry and derive preliminary results | [['we', 'consider', 'the', 'optimal', 'containment', 'of', 'polygonal', 'regions', 'within', 'convex', 'containers', 'with', 'the', 'special', 'property', 'of', 'orientedness', 'an', 'oriented', 'region', 'enables', 'us', 'to', 'choose', 'a', 'preferred', 'direction', 'on', 'the', 'plane', 'this', 'direction', 'is', 'not', 'necessarily', 'an', 'axis', 'of', 'symmetry', 'and', 'derive', 'preliminary', 'results']] | [-0.17470840950097358, 0.06416887130901505, -0.04204298101276869, -0.020284410211301986, -0.16714929170640452, -0.07862944390425193, 0.05682289454021624, 0.454394522522177, -0.2703449459957136, -0.2088323761043804, 0.0966833190704208, -0.22272783584914924, -0.045258071317913984, 0.1525872167964865, -0.11676292044978168, -0.024704313836991787, 0.01471682700018088, 0.024253341458028273, -0.09025916503742337, -0.17867091099088567, 0.29589660625372616, 0.03181248340046122, 0.31140779122887624, 0.07032835691989887, 0.08889247412748989, 0.10011168357561387, 0.03594886600261643, 0.0562461036080051, -0.19261624072013156, 0.13503947900608182, 0.2270871431322857, 0.1262347809859507, 0.20833482344945273, -0.4322583429692757, -0.10045124727877833, 0.11124337624226298, 0.1772786461570788, 0.08509983838580194, -0.05129290002930377, -0.23443187462786833, 0.07240946119141188, -0.08388576570100018, -0.26895187391589087, 0.017028979347309188, 7.041099126495065e-05, -0.009230020056877817, -0.3087446353553484, -0.011872560606293735, 0.08884590509391967, 0.05494859603987563, -0.05862300859631172, -0.060981270602150334, 0.0061853429125178425, 0.13280016630666241, 0.05632419953222519, 0.09711643353858519, 0.11683359814508419, -0.03523128785170792, -0.11840664871713324, 0.41035274305336533, 0.04599998259939076, -0.28680910589173436, 0.13988362063121582, -0.1502740700463099, -0.1474791473398606, 0.13186991864737743, 0.20495399117602833, 0.19594343949020618, -0.11964364440756894, 0.08024188581094634, -0.12152585489231915, 0.16124473421257876, 0.052459163774204044, -0.048934865543352704, 0.20970310669924533, 0.09444427534583069, 0.20772318202736123, 0.19842500958613873, -0.08629351814964875, -0.12789255877335867, -0.33640192440223127, -0.17639803995067874, -0.10513670446761396, -0.0444876059076965, -0.1357256915926839, -0.18892605321127035, 0.3888050193587939, 0.10112214520839709, 0.21536218580080285, 0.06124589825049043, 0.24861964075604365, 0.05627162683577765, 0.05868624337017536, 0.11255432736305963, 0.25873471947575344, 0.1137701722216748, 0.03529553220696038, -0.17705669733584814, 0.0825722552946813, 0.04505127167240495] |
1,802.10448 | Quantum cognition goes beyond-quantum: modeling the collective
participant in psychological measurements | In psychological measurements, two levels should be distinguished: the
'individual level', relative to the different participants in a given cognitive
situation, and the 'collective level', relative to the overall statistics of
their outcomes, which we propose to associate with a notion of 'collective
participant'. When the distinction between these two levels is properly
formalized, it reveals why the modeling of the collective participant generally
requires beyond-quantum - non-Bornian - probabilistic models, when sequential
measurements at the individual level are considered, and this though a pure
quantum description remains valid for single measurement situations.
| q-bio.NC cs.AI quant-ph | in psychological measurements two levels should be distinguished the individual level relative to the different participants in a given cognitive situation and the collective level relative to the overall statistics of their outcomes which we propose to associate with a notion of collective participant when the distinction between these two levels is properly formalized it reveals why the modeling of the collective participant generally requires beyondquantum nonbornian probabilistic models when sequential measurements at the individual level are considered and this though a pure quantum description remains valid for single measurement situations | [['in', 'psychological', 'measurements', 'two', 'levels', 'should', 'be', 'distinguished', 'the', 'individual', 'level', 'relative', 'to', 'the', 'different', 'participants', 'in', 'a', 'given', 'cognitive', 'situation', 'and', 'the', 'collective', 'level', 'relative', 'to', 'the', 'overall', 'statistics', 'of', 'their', 'outcomes', 'which', 'we', 'propose', 'to', 'associate', 'with', 'a', 'notion', 'of', 'collective', 'participant', 'when', 'the', 'distinction', 'between', 'these', 'two', 'levels', 'is', 'properly', 'formalized', 'it', 'reveals', 'why', 'the', 'modeling', 'of', 'the', 'collective', 'participant', 'generally', 'requires', 'beyondquantum', 'nonbornian', 'probabilistic', 'models', 'when', 'sequential', 'measurements', 'at', 'the', 'individual', 'level', 'are', 'considered', 'and', 'this', 'though', 'a', 'pure', 'quantum', 'description', 'remains', 'valid', 'for', 'single', 'measurement', 'situations']] | [-0.09615175227324167, 0.17042990760463808, -0.12431661971430812, 0.10307398546073172, -0.018291423024816646, -0.17134950259803897, 0.09269863332673493, 0.36787041073871984, -0.27474082535029287, -0.34926962798280226, -0.012146269713735416, -0.26802090971420206, -0.1035956394703438, 0.1270797959011462, -0.08812122457764215, -0.0035033101733360026, 0.0646303661322842, 0.10697512625613147, -0.02430369875768924, -0.2237868891718487, 0.3181634476822284, 0.06541174204580279, 0.34029223377712897, 0.0278352623546703, 0.0869110200761093, 0.04111596553379463, -0.03656099569052458, 0.04658188141183928, -0.05257451744853622, 0.1269190801605065, 0.3416413785287053, 0.12762249389197677, 0.3086167029829489, -0.41782277178847127, -0.16898411305155606, 0.10083076851442456, 0.09248312371265557, 0.1222037727258996, 0.05122297675245338, -0.26215261369296866, 0.07081860836284856, -0.16946052759885788, -0.08741717367536492, -0.07634228065402972, -0.003242541596086489, -0.028757003363635805, -0.23349134314080908, 0.08689528822691904, 0.07000656904112677, 0.12038754067487187, -0.04403274267291029, -0.0903574334560997, 0.0005741253262385726, 0.1955382191091, 0.0394630875153881, -0.04297747988700091, 0.14730769333740076, -0.1514666511496115, -0.142959757325136, 0.39854628356794514, 0.007990811819521089, -0.2511822246015072, 0.2232553438283503, -0.1783596151922312, -0.164638457836635, 0.054795798354057804, 0.15432126415479513, 0.07571832903971275, -0.1365743121610851, -0.040882684286528574, -0.010474870995514923, 0.18638303530299002, 0.02702377208818992, 0.04519181268082725, 0.22309170842377676, 0.13268346371025674, 0.006953663309104741, 0.07934430626919493, -0.059565080526388356, -0.15359292420972553, -0.31010503307398823, -0.11149285974032763, -0.0985783137122376, 0.04580345820221636, -0.036874090936746345, -0.13013504412439134, 0.3936901436497768, 0.14177241963851783, 0.20357590198723807, 0.022477543024191013, 0.3057852924697929, 0.13785303741460667, 0.015513166793001194, 0.003935763731391893, 0.24649555521512714, 0.062024631444364785, 0.0512189452846845, -0.2115816515378861, 0.14026122693903745, -0.01898956768628624] |
1,802.10449 | Classical electrodynamics and gauge symmetry of the X-boson | In this paper we have obtained several new results concerning the X-boson,
which is being considered recently as one of the main candidate of the dark
matter particle content. The classical electrodynamics for the X-boson model
was explored to understand its propagation in space-time. The field equations
(Maxwell-type) and the corresponding wave equations were obtained. They
indicate the dispersion relations of both a massive and massless particles.
These results can be interpreted as a photon and the X-boson (with a mass of 17
MeV), respectively. The gauge symmetry and gauge transformations were
discussed. A full model diagonalization was introduced to obtain a Maxwell
sector added up to a Proca sector. After that, we have obtained the retarded
Green functions which yield the inhomogeneous solutions of the wave equations
for the X-boson fields. We have applied this solution to the charge point
motion, and we transformed the potential solution to a quadrature problem. In
particular, as an example, we have analyzed the point charge in a straight line
uniform motion, where the corresponding electromagnetic charge were calculated.
| hep-ph hep-th | in this paper we have obtained several new results concerning the xboson which is being considered recently as one of the main candidate of the dark matter particle content the classical electrodynamics for the xboson model was explored to understand its propagation in spacetime the field equations maxwelltype and the corresponding wave equations were obtained they indicate the dispersion relations of both a massive and massless particles these results can be interpreted as a photon and the xboson with a mass of 17 mev respectively the gauge symmetry and gauge transformations were discussed a full model diagonalization was introduced to obtain a maxwell sector added up to a proca sector after that we have obtained the retarded green functions which yield the inhomogeneous solutions of the wave equations for the xboson fields we have applied this solution to the charge point motion and we transformed the potential solution to a quadrature problem in particular as an example we have analyzed the point charge in a straight line uniform motion where the corresponding electromagnetic charge were calculated | [['in', 'this', 'paper', 'we', 'have', 'obtained', 'several', 'new', 'results', 'concerning', 'the', 'xboson', 'which', 'is', 'being', 'considered', 'recently', 'as', 'one', 'of', 'the', 'main', 'candidate', 'of', 'the', 'dark', 'matter', 'particle', 'content', 'the', 'classical', 'electrodynamics', 'for', 'the', 'xboson', 'model', 'was', 'explored', 'to', 'understand', 'its', 'propagation', 'in', 'spacetime', 'the', 'field', 'equations', 'maxwelltype', 'and', 'the', 'corresponding', 'wave', 'equations', 'were', 'obtained', 'they', 'indicate', 'the', 'dispersion', 'relations', 'of', 'both', 'a', 'massive', 'and', 'massless', 'particles', 'these', 'results', 'can', 'be', 'interpreted', 'as', 'a', 'photon', 'and', 'the', 'xboson', 'with', 'a', 'mass', 'of', '17', 'mev', 'respectively', 'the', 'gauge', 'symmetry', 'and', 'gauge', 'transformations', 'were', 'discussed', 'a', 'full', 'model', 'diagonalization', 'was', 'introduced', 'to', 'obtain', 'a', 'maxwell', 'sector', 'added', 'up', 'to', 'a', 'proca', 'sector', 'after', 'that', 'we', 'have', 'obtained', 'the', 'retarded', 'green', 'functions', 'which', 'yield', 'the', 'inhomogeneous', 'solutions', 'of', 'the', 'wave', 'equations', 'for', 'the', 'xboson', 'fields', 'we', 'have', 'applied', 'this', 'solution', 'to', 'the', 'charge', 'point', 'motion', 'and', 'we', 'transformed', 'the', 'potential', 'solution', 'to', 'a', 'quadrature', 'problem', 'in', 'particular', 'as', 'an', 'example', 'we', 'have', 'analyzed', 'the', 'point', 'charge', 'in', 'a', 'straight', 'line', 'uniform', 'motion', 'where', 'the', 'corresponding', 'electromagnetic', 'charge', 'were', 'calculated']] | [-0.12326466543494131, 0.12734972422260232, -0.09120924522920343, 0.0853561386697534, -0.059918692201377285, -0.09065738716427321, -0.0022019677079780113, 0.34216804696585645, -0.20735219443238087, -0.30350604718048335, 0.08853561512726381, -0.2774825457282449, -0.11960465885402466, 0.15604689615230943, 0.02563696627674455, 0.07160291215900956, -0.0023589232746003704, 0.05833150596101239, -0.07328117275491505, -0.22304409790508958, 0.30296255823552865, 0.025236339123115282, 0.23756213488443542, 0.03861228786461817, 0.12196915033829017, -0.004001766961829906, -0.024307757730143334, 0.03317816783303649, -0.11935665844748655, 0.06899669245169869, 0.1881103010012091, 0.053545378549394874, 0.1981892885457703, -0.42053511240307917, -0.2283726050465537, 0.07399648511306044, 0.14462397002816116, 0.14852016510055613, -0.0963150022382086, -0.3355428923069584, 0.06639342809053646, -0.17574754979630763, -0.1912358879384225, -0.045647708529775795, -0.01051716020381057, 0.02712630258809606, -0.25097193206006935, 0.0739857843066354, 0.012467730555561668, -0.024449753305155107, -0.11069892481728774, -0.1163064567478035, -0.036998971159019595, 0.08632938846395435, 0.09790010276562745, 0.05357875892977146, 0.09756492012754527, -0.15332557368145155, -0.10916080919560045, 0.4110030244178647, -0.07869297728625084, -0.24054458810397508, 0.15256129880171185, -0.12777732448987741, -0.09385601491918681, 0.1344017385609649, 0.1485835746703246, 0.11409215280648576, -0.19673826213693246, 0.09984125242143901, -0.05510075392968164, 0.12322337470719834, 0.09356696177697317, 0.01862235817878338, 0.21008975971166033, 0.10002243205235573, -0.0010337845887988806, 0.13226689368589592, -0.07781562617376701, -0.11131593550354327, -0.322563225900839, -0.17920026572061365, -0.13898054137296806, 0.06114888977373829, -0.06699578400019329, -0.14145335379659876, 0.397677312282295, 0.13503253362134934, 0.14731108243259686, 0.006632780176005326, 0.22292786824585742, 0.1954646959764597, 0.08570888899107972, 0.056029985625751906, 0.29814860780739266, 0.17565357714854393, 0.14815178429390388, -0.20353120955008885, -0.06762687353396112, 0.07185599718650337] |
1,802.1045 | Thermodynamics of Ricci-Gauss-Bonnet Dark Energy | We investigate the validity of generalized second law of thermodynamics of a
physical system comprising of newly proposed dark energy model called Ricci
Gauss-Bonnet and cold dark matter enveloped by apparent horizon and event
horizon in flat Friedmann-Robertson-Walker (FRW) universe. For this purpose,
Bekenstein entropy, Renyi, logarithmic and power law entropic corrections are
used. It is found that this law exhibits the validity on both apparent and
event horizons except for the case of logarithmic entropic correction at
apparent horizon. Also, we check the thermodynamical equilibrium condition for
all cases of entropy and found its vitality in all cases of entropy.
| gr-qc | we investigate the validity of generalized second law of thermodynamics of a physical system comprising of newly proposed dark energy model called ricci gaussbonnet and cold dark matter enveloped by apparent horizon and event horizon in flat friedmannrobertsonwalker frw universe for this purpose bekenstein entropy renyi logarithmic and power law entropic corrections are used it is found that this law exhibits the validity on both apparent and event horizons except for the case of logarithmic entropic correction at apparent horizon also we check the thermodynamical equilibrium condition for all cases of entropy and found its vitality in all cases of entropy | [['we', 'investigate', 'the', 'validity', 'of', 'generalized', 'second', 'law', 'of', 'thermodynamics', 'of', 'a', 'physical', 'system', 'comprising', 'of', 'newly', 'proposed', 'dark', 'energy', 'model', 'called', 'ricci', 'gaussbonnet', 'and', 'cold', 'dark', 'matter', 'enveloped', 'by', 'apparent', 'horizon', 'and', 'event', 'horizon', 'in', 'flat', 'friedmannrobertsonwalker', 'frw', 'universe', 'for', 'this', 'purpose', 'bekenstein', 'entropy', 'renyi', 'logarithmic', 'and', 'power', 'law', 'entropic', 'corrections', 'are', 'used', 'it', 'is', 'found', 'that', 'this', 'law', 'exhibits', 'the', 'validity', 'on', 'both', 'apparent', 'and', 'event', 'horizons', 'except', 'for', 'the', 'case', 'of', 'logarithmic', 'entropic', 'correction', 'at', 'apparent', 'horizon', 'also', 'we', 'check', 'the', 'thermodynamical', 'equilibrium', 'condition', 'for', 'all', 'cases', 'of', 'entropy', 'and', 'found', 'its', 'vitality', 'in', 'all', 'cases', 'of', 'entropy']] | [-0.13403873775606182, 0.08490355822746412, -0.14735627733170986, 0.16811710392645937, -0.05436406851663153, -0.19497042492327124, -0.011755106972396779, 0.2556601637089164, -0.18226760998368263, -0.3039682433412567, 0.06960732872726967, -0.3338868436080837, -0.04885895861921334, 0.16342646049768986, -0.08086754267316053, 0.08842542700614725, -0.061416105459453446, 0.08380080184364451, -0.021222126806191732, -0.25918830557735545, 0.3578296455803632, 0.12280261494786396, 0.27473382642815386, 0.10724144296646856, 0.146265814440454, -0.05239003429899343, -0.011280276160226158, 0.10746575637266247, -0.23240776489395706, 0.024093318716761205, 0.17885116234163542, 0.09623705537178286, 0.20686789426841948, -0.37082124227602586, -0.24709591148668983, 0.13873039972553453, 0.11443049085815207, 0.0905060870636319, -0.04498767473453674, -0.23257439941084843, 0.031172899924688927, -0.2716296445117286, -0.18280341053360816, -0.060643645471404536, 0.0721174200056213, -0.06655840459510241, -0.15416680623104076, 0.23076764599040916, 0.07205582996553714, -0.02701645292858086, -0.12465136732541873, -0.011698787841752245, -0.027318437546860464, 0.02754580927090627, 0.12280957563664985, -0.08119091853997347, 0.16524527764113822, -0.10011679245306566, -0.08411298232328257, 0.3615389672098773, -0.06713006893255849, -0.13063992340449648, 0.09329220550688039, -0.19199484629362895, -0.13597899905203076, 0.052872667243556666, 0.10304881146380512, 0.1260445526825399, -0.1745725287756154, 0.14958192035267684, 0.047606084728829615, 0.14131914591877767, 0.1245078361376493, 0.038706663567203994, 0.29187141506388636, 0.08303642466821072, 0.013365862003555246, 0.20972045279098767, -0.06597683467385866, -0.19861653579472757, -0.4334509278564612, -0.21491305954237977, -0.18930272874595266, 0.039068233065012066, -0.21335507934785675, -0.16098319344904902, 0.3000345871424173, 0.09298309644149376, 0.10220396190439121, 0.10772226393075272, 0.2552089948428444, 0.08186380649999817, 0.015589766361114412, 0.15719151899845588, 0.31540295604321333, 0.10152965072440998, 0.16075026422812796, -0.26404651603690293, 0.014306166564289591, 0.09698882023112314] |
1,802.10451 | Reconstruction of brain networks involved in magnetophosphene perception
using dense electroencephalography | Characterizing functional brain networks in humans during magnetophosphene
perception. Dense electroencephalography (EEG, 128 channels) was performed in
N=3 volunteers during high-level (50 mT) magnetic field (MF) exposure.
Functional brain networks were reconstructed, at the cortical level from scalp
recordings, using the EEG source connectivity method. Magnetophosphene
perception appears to consistently activate the right inferior
occipito-temporal pathway. This study provides the very first neuroimaging
results characterizing magnetophosphene perception in humans. The use of
dense-EEG source connectivity is a promising approach in the field of
bioelectromagnetics.
| q-bio.NC | characterizing functional brain networks in humans during magnetophosphene perception dense electroencephalography eeg 128 channels was performed in n3 volunteers during highlevel 50 mt magnetic field mf exposure functional brain networks were reconstructed at the cortical level from scalp recordings using the eeg source connectivity method magnetophosphene perception appears to consistently activate the right inferior occipitotemporal pathway this study provides the very first neuroimaging results characterizing magnetophosphene perception in humans the use of denseeeg source connectivity is a promising approach in the field of bioelectromagnetics | [['characterizing', 'functional', 'brain', 'networks', 'in', 'humans', 'during', 'magnetophosphene', 'perception', 'dense', 'electroencephalography', 'eeg', '128', 'channels', 'was', 'performed', 'in', 'n3', 'volunteers', 'during', 'highlevel', '50', 'mt', 'magnetic', 'field', 'mf', 'exposure', 'functional', 'brain', 'networks', 'were', 'reconstructed', 'at', 'the', 'cortical', 'level', 'from', 'scalp', 'recordings', 'using', 'the', 'eeg', 'source', 'connectivity', 'method', 'magnetophosphene', 'perception', 'appears', 'to', 'consistently', 'activate', 'the', 'right', 'inferior', 'occipitotemporal', 'pathway', 'this', 'study', 'provides', 'the', 'very', 'first', 'neuroimaging', 'results', 'characterizing', 'magnetophosphene', 'perception', 'in', 'humans', 'the', 'use', 'of', 'denseeeg', 'source', 'connectivity', 'is', 'a', 'promising', 'approach', 'in', 'the', 'field', 'of', 'bioelectromagnetics']] | [-0.0764907451279192, 0.08631644668955221, -0.0649096863512623, 0.08028023360866537, -0.06899589681661272, -0.16709510409217104, -0.0018584603915013462, 0.4406358421926039, -0.21659266840980715, -0.3114712219909731, 0.02968891819515434, -0.2789883027750864, -0.2904761674735381, 0.15681535790461193, -0.09961949141853187, 0.021577229386711694, 0.1087326656280826, 0.12752605167902017, 0.04291504268332508, -0.18308950564543525, 0.1775845892878855, 0.042688687500285816, 0.34244053326098317, 0.008378462703247746, 0.07128678833931146, -0.03905032294611615, -0.033564538459282325, -0.05441271950187812, -0.027463997226118683, 0.1538917829046946, 0.3812413673752537, 0.18062680683390472, 0.33282064372696074, -0.5160206120057278, -0.24662090299078768, 0.03031445974035256, 0.09764255734766464, 0.023938658080591136, -0.012309860286628267, -0.3992190053251695, 0.13920472588120814, -0.07687602601720984, -0.005957414020211941, -0.04602799869190862, -0.018973413953019016, -0.05737684553544141, -0.25528995194528475, 0.14600407858435288, -0.061990139355142436, 0.178615696705788, -0.12511395583355642, -0.05197263771600752, 0.024397498294037867, 0.24479339090007615, 0.030597308248068285, 0.13372815049047224, 0.24690166190378818, -0.19206043471672, -0.09792039173105395, 0.23191434741917863, -0.002415876224053552, -0.11947128829737026, 0.21388237447623748, -0.12941618317230436, -0.17322194600949087, 0.13271383869360728, 0.15597764291542482, 0.052649862820237696, -0.24514698540421584, 0.015032973291958312, 0.06033124440315976, 0.19381918639213924, 0.09172842851335025, -0.052700086729601026, 0.158411328467619, 0.2503507714942995, -0.04398375556030008, 0.12977769753491752, -0.1855948625065117, 0.0037304908261600747, -0.1844822937308485, -0.08406136065429773, -0.17024348401716988, 0.023976123528674256, -0.10492114745170238, -0.09542826722454593, 0.4295957773385278, 0.1543458267956613, 0.11606764912335987, 0.07764355037136968, 0.2870398171095974, -0.010463168390140117, 0.10937332361095013, 0.04661533621936498, 0.1537990078374923, 0.1374489612265838, 0.19300586517047452, -0.20311089936385762, 0.10903058253812144, -0.02003577980773905] |
1,802.10452 | Influences of the coordinate dependent noncommutative space on charged
and spin currents | We study the charged and spin currents on a coordinate dependent
noncommutative space. Starting from the noncommutative extended relativistic
equation of motion, the non-relativistic approximation is obtained by using the
Foldy-Wouthuysen transformation, and then the charged and spin currents are
derived by using the extended Drude model. We find that the charged current is
twisted by modifying the off-diagonal elements of the Hall conductivity,
however, the spin current is not affected up to leading order of the
noncommutative parameter.
| physics.gen-ph hep-th | we study the charged and spin currents on a coordinate dependent noncommutative space starting from the noncommutative extended relativistic equation of motion the nonrelativistic approximation is obtained by using the foldywouthuysen transformation and then the charged and spin currents are derived by using the extended drude model we find that the charged current is twisted by modifying the offdiagonal elements of the hall conductivity however the spin current is not affected up to leading order of the noncommutative parameter | [['we', 'study', 'the', 'charged', 'and', 'spin', 'currents', 'on', 'a', 'coordinate', 'dependent', 'noncommutative', 'space', 'starting', 'from', 'the', 'noncommutative', 'extended', 'relativistic', 'equation', 'of', 'motion', 'the', 'nonrelativistic', 'approximation', 'is', 'obtained', 'by', 'using', 'the', 'foldywouthuysen', 'transformation', 'and', 'then', 'the', 'charged', 'and', 'spin', 'currents', 'are', 'derived', 'by', 'using', 'the', 'extended', 'drude', 'model', 'we', 'find', 'that', 'the', 'charged', 'current', 'is', 'twisted', 'by', 'modifying', 'the', 'offdiagonal', 'elements', 'of', 'the', 'hall', 'conductivity', 'however', 'the', 'spin', 'current', 'is', 'not', 'affected', 'up', 'to', 'leading', 'order', 'of', 'the', 'noncommutative', 'parameter']] | [-0.09803409939572875, 0.21558864518434187, -0.042452263492572154, 0.04243170571236435, -0.043263274327486376, -0.11633361752816959, -0.03186588895306745, 0.3248193262592901, -0.27233193036687525, -0.24878279136234446, 0.05429078367998517, -0.26698521349013227, -0.09875897615204883, 0.15410380442390997, 0.029244407752080807, 0.0191514939836026, -0.02577851780784564, 0.03426164666874499, -0.1701725619827409, -0.1857334879946105, 0.369148261055256, 0.04391898791293932, 0.24662668699445792, 0.04057783496719372, 0.12103126275860056, 0.07582761688582317, -0.04475825515728962, 0.06651108966561188, -0.10431041347227263, 0.09479286512242088, 0.15230378558670607, -0.03400121374008588, 0.11036546136948126, -0.43164663778358625, -0.16715004184295104, 0.03172013388145008, 0.1131349909885586, 0.15404304744133465, -0.04868260389812809, -0.32803576899385906, 0.03350085549386619, -0.22067929816113996, -0.1634061348129394, -0.10020348796314454, 0.0015845239822623097, 0.007228864717910279, -0.2717941392366362, 0.12004068964823184, 0.0777344585667494, -0.021284162962832785, -0.08980235418517, -0.107474359954837, -0.054905163206725935, 0.06629287903536041, 0.06029758882219608, 0.046713861362725685, 0.18894995252684324, -0.1361725395604308, -0.13624591216197401, 0.37297334404119964, -0.09716802298627747, -0.26389412845991833, 0.10390502692176666, -0.20124753859907954, -0.061253267971067865, 0.13561754275254811, 0.09500266303885964, 0.14102538156284822, -0.17896488050729792, 0.1682364493114815, -0.05063060753023888, 0.08649480123591574, 0.05479918430335348, 0.002417441722760095, 0.2375845766590932, 0.09766054061489014, 0.006456290259721536, 0.1277223816495153, -0.08287419428565551, -0.12323698448606685, -0.3081803975650404, -0.14999343672637605, -0.18755475079782213, 0.12439582978181477, -0.09078774942454286, -0.12068654595626684, 0.4287172022063427, 0.17413536649008718, 0.1444003772509249, -0.023794324125481558, 0.266840633865493, 0.20261165524443872, 0.0771491876980172, 0.06424864939755842, 0.26790346161615625, 0.19608125901969645, 0.10278449216385997, -0.30304006927741006, -1.0189853750074966e-05, 0.13289075818714463] |
1,802.10453 | Symmetric indefinite triangular factorization revealing the rank profile
matrix | We present a novel recursive algorithm for reducing a symmetric matrix to a
triangular factorization which reveals the rank profile matrix. That is, the
algorithm computes a factorization $\mathbf{P}^T\mathbf{A}\mathbf{P} =
\mathbf{L}\mathbf{D}\mathbf{L}^T$ where $\mathbf{P}$ is a permutation matrix,
$\mathbf{L}$ is lower triangular with a unit diagonal and $\mathbf{D}$ is
symmetric block diagonal with $1{\times}1$ and $2{\times}2$ antidiagonal
blocks. The novel algorithm requires $O(n^2r^{\omega-2})$ arithmetic
operations. Furthermore, experimental results demonstrate that our algorithm
can even be slightly more than twice as fast as the state of the art
unsymmetric Gaussian elimination in most cases, that is it achieves
approximately the same computational speed. By adapting the pivoting strategy
developed in the unsymmetric case, we show how to recover the rank profile
matrix from the permutation matrix and the support of the block-diagonal
matrix. There is an obstruction in characteristic $2$ for revealing the rank
profile matrix which requires to relax the shape of the block diagonal by
allowing the 2-dimensional blocks to have a non-zero bottom-right coefficient.
This relaxed decomposition can then be transformed into a standard
$\mathbf{P}\mathbf{L}\mathbf{D}\mathbf{L}^T\mathbf{P}^T$ decomposition at a
negligible cost.
| cs.NA | we present a novel recursive algorithm for reducing a symmetric matrix to a triangular factorization which reveals the rank profile matrix that is the algorithm computes a factorization mathbfptmathbfamathbfp mathbflmathbfdmathbflt where mathbfp is a permutation matrix mathbfl is lower triangular with a unit diagonal and mathbfd is symmetric block diagonal with 1times1 and 2times2 antidiagonal blocks the novel algorithm requires on2romega2 arithmetic operations furthermore experimental results demonstrate that our algorithm can even be slightly more than twice as fast as the state of the art unsymmetric gaussian elimination in most cases that is it achieves approximately the same computational speed by adapting the pivoting strategy developed in the unsymmetric case we show how to recover the rank profile matrix from the permutation matrix and the support of the blockdiagonal matrix there is an obstruction in characteristic 2 for revealing the rank profile matrix which requires to relax the shape of the block diagonal by allowing the 2dimensional blocks to have a nonzero bottomright coefficient this relaxed decomposition can then be transformed into a standard mathbfpmathbflmathbfdmathbfltmathbfpt decomposition at a negligible cost | [['we', 'present', 'a', 'novel', 'recursive', 'algorithm', 'for', 'reducing', 'a', 'symmetric', 'matrix', 'to', 'a', 'triangular', 'factorization', 'which', 'reveals', 'the', 'rank', 'profile', 'matrix', 'that', 'is', 'the', 'algorithm', 'computes', 'a', 'factorization', 'mathbfptmathbfamathbfp', 'mathbflmathbfdmathbflt', 'where', 'mathbfp', 'is', 'a', 'permutation', 'matrix', 'mathbfl', 'is', 'lower', 'triangular', 'with', 'a', 'unit', 'diagonal', 'and', 'mathbfd', 'is', 'symmetric', 'block', 'diagonal', 'with', '1times1', 'and', '2times2', 'antidiagonal', 'blocks', 'the', 'novel', 'algorithm', 'requires', 'on2romega2', 'arithmetic', 'operations', 'furthermore', 'experimental', 'results', 'demonstrate', 'that', 'our', 'algorithm', 'can', 'even', 'be', 'slightly', 'more', 'than', 'twice', 'as', 'fast', 'as', 'the', 'state', 'of', 'the', 'art', 'unsymmetric', 'gaussian', 'elimination', 'in', 'most', 'cases', 'that', 'is', 'it', 'achieves', 'approximately', 'the', 'same', 'computational', 'speed', 'by', 'adapting', 'the', 'pivoting', 'strategy', 'developed', 'in', 'the', 'unsymmetric', 'case', 'we', 'show', 'how', 'to', 'recover', 'the', 'rank', 'profile', 'matrix', 'from', 'the', 'permutation', 'matrix', 'and', 'the', 'support', 'of', 'the', 'blockdiagonal', 'matrix', 'there', 'is', 'an', 'obstruction', 'in', 'characteristic', '2', 'for', 'revealing', 'the', 'rank', 'profile', 'matrix', 'which', 'requires', 'to', 'relax', 'the', 'shape', 'of', 'the', 'block', 'diagonal', 'by', 'allowing', 'the', '2dimensional', 'blocks', 'to', 'have', 'a', 'nonzero', 'bottomright', 'coefficient', 'this', 'relaxed', 'decomposition', 'can', 'then', 'be', 'transformed', 'into', 'a', 'standard', 'mathbfpmathbflmathbfdmathbfltmathbfpt', 'decomposition', 'at', 'a', 'negligible', 'cost']] | [-0.09348559885818924, 0.08303542483397243, -0.09021941972737708, 0.014883885340664578, -0.061056548711018295, -0.1827823826487557, 0.013050504519593564, 0.3750106565738944, -0.3075129437711439, -0.2274083276596767, 0.14914455543740504, -0.22388613727790388, -0.18867147327612407, 0.1319006036818874, -0.046672514160904524, 0.047796866137518504, 0.05341213846854358, 0.06687966462711549, -0.15549992837656068, -0.25308182869445195, 0.2830523497124721, 0.040161081436301836, 0.2731003098068124, 0.0015118029471275142, 0.12036666067698124, 0.046420364545404234, -0.00444831789619374, 0.008105463359646075, -0.018371593015920305, 0.11404857959794092, 0.2501252996311946, 0.15101976419629698, 0.24744627268228214, -0.40632148257414386, -0.12301073086299849, 0.12137157525946597, 0.14738564522915773, 0.12121075916134445, -0.035449399947951446, -0.21799499999112662, 0.15726467314313844, -0.17209461431908, -0.12030405141327223, -0.08482793843458322, -0.007635647227950606, -0.05685343335790094, -0.3501733290454881, 0.062000583767340606, 0.08712516580867073, -0.012833467589437285, 0.0029915697298499504, -0.2081692676028152, 0.03374544924670111, 0.06521627640970772, -0.0166025224766186, 0.030321586527861655, 0.12128746471452442, -0.0665225340992699, -0.07385261924223001, 0.36685672028794547, -0.055553417693938005, -0.2471129426319914, 0.09661482254688797, -0.0914250611577617, -0.10122385788021017, 0.15016828391658651, 0.13254111462976487, 0.09863109006437298, -0.06987918217518282, 0.10804062622330755, -0.12427218588841656, 0.21353927824979604, 0.06201609911460599, -0.03743733656301629, 0.11958994474480278, 0.12542558073553003, 0.14810592243884457, 0.15974877050030045, -0.044959261857333004, -0.08056593048174611, -0.24474225675327366, -0.16854019452875946, -0.23183563192486129, 0.04333723712162199, -0.16085086397230375, -0.17592981637492563, 0.4284460419016382, 0.08244255487807095, 0.22536595839350906, 0.1144217477955284, 0.31039262897419656, 0.12358970064955925, 0.10114355214384639, 0.1197822878782724, 0.14078874008687722, 0.18459548527343114, 0.028034955647109946, -0.1823968154825376, 0.08326385632178492, 0.13313120327951433] |
1,802.10454 | Dissipative operators and operator Lipschitz functions | The purpose of this paper is to obtain an integral representation for the
difference $f(L_1)-f(L_2)$ of functions of maximal dissipative operators. This
representation in terms of double operator integrals will allow us to establish
Lipschitz type estimates for functions of maximal dissipative operators. We
also consider a similar problem for quasicommutators, i.e., operators of the
form $f(L_1)R-Rf(L_2)$.
| math.FA math.CA math.CV math.SP | the purpose of this paper is to obtain an integral representation for the difference fl_1fl_2 of functions of maximal dissipative operators this representation in terms of double operator integrals will allow us to establish lipschitz type estimates for functions of maximal dissipative operators we also consider a similar problem for quasicommutators ie operators of the form fl_1rrfl_2 | [['the', 'purpose', 'of', 'this', 'paper', 'is', 'to', 'obtain', 'an', 'integral', 'representation', 'for', 'the', 'difference', 'fl_1fl_2', 'of', 'functions', 'of', 'maximal', 'dissipative', 'operators', 'this', 'representation', 'in', 'terms', 'of', 'double', 'operator', 'integrals', 'will', 'allow', 'us', 'to', 'establish', 'lipschitz', 'type', 'estimates', 'for', 'functions', 'of', 'maximal', 'dissipative', 'operators', 'we', 'also', 'consider', 'a', 'similar', 'problem', 'for', 'quasicommutators', 'ie', 'operators', 'of', 'the', 'form', 'fl_1rrfl_2']] | [-0.12663508010181515, 0.057495184998631224, -0.07722986564040184, 0.11593539491930807, -0.0938230833504349, -0.05928981394760988, 0.01146638733969832, 0.29359522678635336, -0.3000524394891479, -0.18808926621621305, 0.11456881385423581, -0.28135670152577485, -0.15204083912751892, 0.22667390204627405, -0.09617737289306454, 0.053329963846640155, 0.06881025839512321, 0.06933212793770839, -0.16181819899515673, -0.18419685519977727, 0.43648209517652337, -0.037383581342344936, 0.1875622428276322, 0.08661611176688563, 0.12238688756796447, 0.030156243516301567, -0.0736487272491848, -0.07827562767673622, -0.14946447322568432, 0.20119758140168745, 0.2554703497751193, 0.06375051736831665, 0.27875008847225796, -0.42148824720220135, -0.14412814358418638, 0.21790504712950098, 0.17077092960138213, 0.035542987134646285, 0.01986908126961101, -0.23130309134721755, 0.06115064079534601, -0.18825859691609037, -0.21409239990806037, -0.10744955831799995, 0.02872948446734385, 0.046999843486330725, -0.37582962407984516, 0.08261930367179131, 0.08139159811491316, 0.016319274648346684, -0.13591066214509986, -0.05146296779540452, 0.06381042858755047, 0.12154934944754298, -0.0313865386267108, 0.005311279430646788, 0.02368309093977917, -0.11759772343899716, -0.1195253668522293, 0.3161834694783796, -0.08945090448780155, -0.2998174465515397, 0.11653929285027764, -0.18526233752596785, -0.12579463395205412, 0.03458696244792505, 0.1797411188821901, 0.17377771830016916, -0.2135621660473672, 0.12938501601192084, -0.06557171481915496, 0.0760933243500238, 0.04000470917671919, 0.11426531965421005, 0.07455975819717754, 0.07554356046020985, 0.18632997814565896, 0.19469089178283783, 0.03457952935925939, -0.06373274334791032, -0.37228856919841335, -0.21300552711737428, -0.10376298497007652, 0.04650456007908691, -0.11019927275959741, -0.23683316947214983, 0.43149878512644635, 0.11670591265640476, 0.17006808830933137, 0.11558434914543547, 0.18701637099412355, 0.23303305059671403, 0.09678371086377989, 0.029847161065448415, 0.1765361288562417, 0.17407455065033653, 0.09008800529620864, -0.19423000829463655, 0.01715737444941293, 0.20477174889634955] |
1,802.10455 | Parallel Transport of Higher Flat Gerbes as an Extended Homotopy Quantum
Field Theory | We prove that the parallel transport of a flat $n-1$-gerbe on any given
target space gives rise to an $n$-dimensional extended homotopy quantum field
theory. In case the target space is the classifying space of a finite group, we
provide explicit formulae for this homotopy quantum field theory in terms of
transgression. Moreover, we use the geometric theory of orbifolds to give a
dimension-independent version of twisted and equivariant Dijkgraaf-Witten
models. Finally, we introduce twisted equivariant Dijkgraaf-Witten theories
giving us in the 3-2-1-dimensional case a new class of equivariant modular
tensor categories which can be understood as twisted versions of the
equivariant modular categories constructed by Maier, Nikolaus and Schweigert.
| math.QA math-ph math.AT math.MP | we prove that the parallel transport of a flat n1gerbe on any given target space gives rise to an ndimensional extended homotopy quantum field theory in case the target space is the classifying space of a finite group we provide explicit formulae for this homotopy quantum field theory in terms of transgression moreover we use the geometric theory of orbifolds to give a dimensionindependent version of twisted and equivariant dijkgraafwitten models finally we introduce twisted equivariant dijkgraafwitten theories giving us in the 321dimensional case a new class of equivariant modular tensor categories which can be understood as twisted versions of the equivariant modular categories constructed by maier nikolaus and schweigert | [['we', 'prove', 'that', 'the', 'parallel', 'transport', 'of', 'a', 'flat', 'n1gerbe', 'on', 'any', 'given', 'target', 'space', 'gives', 'rise', 'to', 'an', 'ndimensional', 'extended', 'homotopy', 'quantum', 'field', 'theory', 'in', 'case', 'the', 'target', 'space', 'is', 'the', 'classifying', 'space', 'of', 'a', 'finite', 'group', 'we', 'provide', 'explicit', 'formulae', 'for', 'this', 'homotopy', 'quantum', 'field', 'theory', 'in', 'terms', 'of', 'transgression', 'moreover', 'we', 'use', 'the', 'geometric', 'theory', 'of', 'orbifolds', 'to', 'give', 'a', 'dimensionindependent', 'version', 'of', 'twisted', 'and', 'equivariant', 'dijkgraafwitten', 'models', 'finally', 'we', 'introduce', 'twisted', 'equivariant', 'dijkgraafwitten', 'theories', 'giving', 'us', 'in', 'the', '321dimensional', 'case', 'a', 'new', 'class', 'of', 'equivariant', 'modular', 'tensor', 'categories', 'which', 'can', 'be', 'understood', 'as', 'twisted', 'versions', 'of', 'the', 'equivariant', 'modular', 'categories', 'constructed', 'by', 'maier', 'nikolaus', 'and', 'schweigert']] | [-0.15776301686712932, 0.09165572773530006, -0.12252457476456032, 0.1336763679772337, -0.10418600784005405, -0.1319199182859091, -0.022145349161359962, 0.34306193492157716, -0.29422342476095553, -0.23464907575551003, 0.0715257795429658, -0.143775526795397, -0.1889401129751562, 0.19181263884126915, -0.18680408885310812, -0.030352220069791113, 0.011942959072886505, 0.07313740557896313, -0.13711834461297664, -0.27338258563606155, 0.41745197273590645, -0.007153592605544167, 0.24802438109966538, 0.04083845203102645, 0.11069501221841463, 0.023642181836625684, -0.019105241459872677, 0.030760845991132223, -0.16025742931351572, 0.20865398675864824, 0.2927649349825107, 0.03608088305211304, 0.14235521480005897, -0.4117630869324241, -0.17959890922392222, 0.12575028657208187, 0.12345149898281425, 0.09489964777451426, -0.014676160160582687, -0.31530268529917455, 0.07259870345800001, -0.23732232699708178, -0.1471147455914799, -0.15174592148717145, 0.013047228708741403, -0.039449215927552954, -0.23302119758815687, -0.03208820622144528, 0.054036219917655545, 0.10111921551097706, -0.11079798376831775, -0.030650391902722347, -0.011088666453887926, 0.1155296001740009, -0.016352087378971904, 0.060446146518757966, 0.09792261130272228, -0.1217140666422408, -0.17173660645766237, 0.3723487016858063, -0.08766877125332863, -0.2497249144851883, 0.11002678734850939, -0.08072414721370996, -0.19535931703312515, 0.10295917823144765, 0.08525969153357164, 0.1717720567031163, -0.008320483605368672, 0.20541623829990172, -0.12624212592909825, 0.06307425708553502, 0.05287811175754694, 0.008219019609947349, 0.15978428819782545, 0.07353658634281465, 0.07362074345332857, 0.2079146437392631, -0.0036453644018272094, -0.10828346195935368, -0.39067850704087276, -0.24579025572927443, -0.07723342556567322, 0.17183830391911564, -0.10608396800555872, -0.23414589877231656, 0.4327574287471579, 0.09665396049070372, 0.16188276915160382, 0.15160515651032852, 0.19924962637667484, 0.09832548834796925, 0.03860009637461088, 0.022786727253452082, 0.13776353717059175, 0.23138869526604555, 0.009622980650513277, -0.10331945626171758, -0.09857694542244355, 0.2628519808847422] |
1,802.10456 | Room-temperature lasing action in GaN quantum wells in the infrared 1.5
micron region | Large-scale optoelectronics integration is strongly limited by the lack of
efficient light sources, which could be integrated with the silicon
complementary metal-oxide-semiconductor (CMOS) technology. Persistent efforts
continue to achieve efficient light emission from silicon in the extending the
silicon technology into fully integrated optoelectronic circuits. Here, we
report the realization of room-temperature stimulated emission in the
technologically crucial 1.5 micron wavelength range from Er-doped GaN
multiple-quantum wells on silicon and sapphire. Employing the well-acknowledged
variable stripe technique, we have demonstrated an optical gain up to 170 cm-1
in the multiple-quantum well structures. The observation of the stimulated
emission is accompanied by the characteristic threshold behavior of emission
intensity as a function of pump fluence, spectral linewidth narrowing and
excitation length. The demonstration of room-temperature lasing at the minimum
loss window of optical fibers and in the eye-safe wavelength region of 1.5
micron are highly sought-after for use in many applications including defense,
industrial processing, communication, medicine, spectroscopy and imaging. As
the synthesis of Er-doped GaN epitaxial layers on silicon and sapphire has been
successfully demonstrated, the results laid the foundation for achieving hybrid
GaN-Si lasers providing a new pathway towards full photonic integration for
silicon optoelectronics.
| physics.app-ph cond-mat.mtrl-sci | largescale optoelectronics integration is strongly limited by the lack of efficient light sources which could be integrated with the silicon complementary metaloxidesemiconductor cmos technology persistent efforts continue to achieve efficient light emission from silicon in the extending the silicon technology into fully integrated optoelectronic circuits here we report the realization of roomtemperature stimulated emission in the technologically crucial 15 micron wavelength range from erdoped gan multiplequantum wells on silicon and sapphire employing the wellacknowledged variable stripe technique we have demonstrated an optical gain up to 170 cm1 in the multiplequantum well structures the observation of the stimulated emission is accompanied by the characteristic threshold behavior of emission intensity as a function of pump fluence spectral linewidth narrowing and excitation length the demonstration of roomtemperature lasing at the minimum loss window of optical fibers and in the eyesafe wavelength region of 15 micron are highly soughtafter for use in many applications including defense industrial processing communication medicine spectroscopy and imaging as the synthesis of erdoped gan epitaxial layers on silicon and sapphire has been successfully demonstrated the results laid the foundation for achieving hybrid gansi lasers providing a new pathway towards full photonic integration for silicon optoelectronics | [['largescale', 'optoelectronics', 'integration', 'is', 'strongly', 'limited', 'by', 'the', 'lack', 'of', 'efficient', 'light', 'sources', 'which', 'could', 'be', 'integrated', 'with', 'the', 'silicon', 'complementary', 'metaloxidesemiconductor', 'cmos', 'technology', 'persistent', 'efforts', 'continue', 'to', 'achieve', 'efficient', 'light', 'emission', 'from', 'silicon', 'in', 'the', 'extending', 'the', 'silicon', 'technology', 'into', 'fully', 'integrated', 'optoelectronic', 'circuits', 'here', 'we', 'report', 'the', 'realization', 'of', 'roomtemperature', 'stimulated', 'emission', 'in', 'the', 'technologically', 'crucial', '15', 'micron', 'wavelength', 'range', 'from', 'erdoped', 'gan', 'multiplequantum', 'wells', 'on', 'silicon', 'and', 'sapphire', 'employing', 'the', 'wellacknowledged', 'variable', 'stripe', 'technique', 'we', 'have', 'demonstrated', 'an', 'optical', 'gain', 'up', 'to', '170', 'cm1', 'in', 'the', 'multiplequantum', 'well', 'structures', 'the', 'observation', 'of', 'the', 'stimulated', 'emission', 'is', 'accompanied', 'by', 'the', 'characteristic', 'threshold', 'behavior', 'of', 'emission', 'intensity', 'as', 'a', 'function', 'of', 'pump', 'fluence', 'spectral', 'linewidth', 'narrowing', 'and', 'excitation', 'length', 'the', 'demonstration', 'of', 'roomtemperature', 'lasing', 'at', 'the', 'minimum', 'loss', 'window', 'of', 'optical', 'fibers', 'and', 'in', 'the', 'eyesafe', 'wavelength', 'region', 'of', '15', 'micron', 'are', 'highly', 'soughtafter', 'for', 'use', 'in', 'many', 'applications', 'including', 'defense', 'industrial', 'processing', 'communication', 'medicine', 'spectroscopy', 'and', 'imaging', 'as', 'the', 'synthesis', 'of', 'erdoped', 'gan', 'epitaxial', 'layers', 'on', 'silicon', 'and', 'sapphire', 'has', 'been', 'successfully', 'demonstrated', 'the', 'results', 'laid', 'the', 'foundation', 'for', 'achieving', 'hybrid', 'gansi', 'lasers', 'providing', 'a', 'new', 'pathway', 'towards', 'full', 'photonic', 'integration', 'for', 'silicon', 'optoelectronics']] | [-0.05956120934332626, 0.11764350539254208, -0.006974175465483294, -0.07342794061117516, -0.023598598406593105, -0.1683074179799201, 0.04228247285105421, 0.5353644358324439, -0.23333325387068968, -0.3070314844478663, 0.07517893395531561, -0.2834733142431384, -0.09401992972636102, 0.29595597729809126, -0.009740358661465321, 0.09631887749692768, -0.0023276686652953147, -0.15798488369553673, 0.00915295411464378, -0.13694552477860197, 0.18421208830514677, 0.10215302810728626, 0.387683610001826, 0.09511803862002051, 0.1055175993135389, -0.03323035807840583, 0.02382815704201063, -0.1225554608842073, -0.11311096455800888, 0.14714225655307575, 0.30943724847094595, 0.004039359963807866, 0.2753425714279506, -0.4349922338962123, -0.26832828336699427, 0.023090591516383752, 0.14628548416925585, 0.10937467120689986, -0.12409358028956803, -0.27717787985647174, 0.0519588579820488, -0.11021044659808431, -0.09871710118319725, -0.02344333901003535, 0.010181578805156964, -0.00313184255251794, -0.19701947156863753, -0.007932509249313829, 0.009547056390889635, 0.089946351157221, -0.0462184619700194, -0.1179607684144332, -0.03214783869221645, 0.04319917175049266, -0.10899043934685844, 0.010409297543929472, 0.23677319992536783, -0.11655522080385411, -0.15365159035807627, 0.34005810729969216, -0.07347999287921252, -0.006975992031844466, 0.15092266833098433, -0.1492560639067515, -0.0371012982196051, 0.20990593084466777, 0.14932510889820133, 0.12697870447062792, -0.1556114199243448, 0.027429097658439008, 0.08548856776549804, 0.24878553027757538, 0.11085930199847005, 0.19969810314514502, 0.2472114382093126, 0.29895807150988934, 0.02895960628324692, 0.14604360862618446, -0.1662412783040722, -0.015352368739680673, -0.21556681434891772, -0.17744042585771388, -0.18141755430094367, 0.1027027689026222, -0.05561434793633786, -0.15260730048241236, 0.3870563408958593, 0.14360668633147428, 0.11122817927923966, -0.030412442934086393, 0.30829004047210423, 0.09788745386426204, 0.1422189211054724, -0.037840064500971715, 0.3140759696799083, 0.19208948310091617, 0.1668665569028532, -0.199038163267019, 0.02267538816656214, -0.07385692783579116] |
1,802.10457 | The density of expected persistence diagrams and its kernel based
estimation | Persistence diagrams play a fundamental role in Topological Data Analysis
where they are used as topological descriptors of filtrations built on top of
data. They consist in discrete multisets of points in the plane $\mathbb{R}^2$
that can equivalently be seen as discrete measures in $\mathbb{R}^2$. When the
data come as a random point cloud, these discrete measures become random
measures whose expectation is studied in this paper. First, we show that for a
wide class of filtrations, including the \v{C}ech and Rips-Vietoris
filtrations, the expected persistence diagram, that is a deterministic measure
on $\mathbb{R}^2$ , has a density with respect to the Lebesgue measure. Second,
building on the previous result we show that the persistence surface recently
introduced in [Adams & al., Persistence images: a stable vector representation
of persistent homology] can be seen as a kernel estimator of this density. We
propose a cross-validation scheme for selecting an optimal bandwidth, which is
proven to be a consistent procedure to estimate the density.
| cs.CG | persistence diagrams play a fundamental role in topological data analysis where they are used as topological descriptors of filtrations built on top of data they consist in discrete multisets of points in the plane mathbbr2 that can equivalently be seen as discrete measures in mathbbr2 when the data come as a random point cloud these discrete measures become random measures whose expectation is studied in this paper first we show that for a wide class of filtrations including the vcech and ripsvietoris filtrations the expected persistence diagram that is a deterministic measure on mathbbr2 has a density with respect to the lebesgue measure second building on the previous result we show that the persistence surface recently introduced in adams al persistence images a stable vector representation of persistent homology can be seen as a kernel estimator of this density we propose a crossvalidation scheme for selecting an optimal bandwidth which is proven to be a consistent procedure to estimate the density | [['persistence', 'diagrams', 'play', 'a', 'fundamental', 'role', 'in', 'topological', 'data', 'analysis', 'where', 'they', 'are', 'used', 'as', 'topological', 'descriptors', 'of', 'filtrations', 'built', 'on', 'top', 'of', 'data', 'they', 'consist', 'in', 'discrete', 'multisets', 'of', 'points', 'in', 'the', 'plane', 'mathbbr2', 'that', 'can', 'equivalently', 'be', 'seen', 'as', 'discrete', 'measures', 'in', 'mathbbr2', 'when', 'the', 'data', 'come', 'as', 'a', 'random', 'point', 'cloud', 'these', 'discrete', 'measures', 'become', 'random', 'measures', 'whose', 'expectation', 'is', 'studied', 'in', 'this', 'paper', 'first', 'we', 'show', 'that', 'for', 'a', 'wide', 'class', 'of', 'filtrations', 'including', 'the', 'vcech', 'and', 'ripsvietoris', 'filtrations', 'the', 'expected', 'persistence', 'diagram', 'that', 'is', 'a', 'deterministic', 'measure', 'on', 'mathbbr2', 'has', 'a', 'density', 'with', 'respect', 'to', 'the', 'lebesgue', 'measure', 'second', 'building', 'on', 'the', 'previous', 'result', 'we', 'show', 'that', 'the', 'persistence', 'surface', 'recently', 'introduced', 'in', 'adams', 'al', 'persistence', 'images', 'a', 'stable', 'vector', 'representation', 'of', 'persistent', 'homology', 'can', 'be', 'seen', 'as', 'a', 'kernel', 'estimator', 'of', 'this', 'density', 'we', 'propose', 'a', 'crossvalidation', 'scheme', 'for', 'selecting', 'an', 'optimal', 'bandwidth', 'which', 'is', 'proven', 'to', 'be', 'a', 'consistent', 'procedure', 'to', 'estimate', 'the', 'density']] | [-0.11940330956713296, 0.10618704670714578, -0.14198906748497392, 0.10628577384413802, -0.03176485339354258, -0.09800904708972666, 0.04490975065564271, 0.38850384326069615, -0.3032656823001162, -0.2425518806430773, 0.13837653732043692, -0.23934596662875265, -0.16146243028233584, 0.18132256626267917, -0.12769708642736077, 0.06569557530456223, 0.04125030941213481, 0.04462729373772163, -0.05297368253595778, -0.2542263105402526, 0.3211107212249772, 0.008876733301440254, 0.2876408108859323, 0.0070694703077606395, 0.06757111273691407, -0.011134533389122226, -0.05054529899207409, 0.06323655826126924, -0.14435390663002182, 0.13537164113222389, 0.2754625502129784, 0.08302696972968988, 0.25815827266778796, -0.3667131676222198, -0.2137797645467799, 0.17391567898157517, 0.13553394535956614, 0.04963816678719013, -0.025470013560698133, -0.30478818077826875, 0.12388157989189494, -0.14931570840544736, -0.11114071615083958, -0.10531932487501763, 0.031414453902107196, 0.04531269809231162, -0.2723986056167632, 0.02951009721145965, 0.05725651921529788, 0.07062398008420132, -0.05467322284239344, -0.08756328381423373, -0.05703910636948421, 0.10685548725832632, 0.011874613248801324, 0.09389199894976627, 0.11013151766965165, -0.08845420749566983, -0.15897454894147814, 0.3705619615968317, -0.09094024706573692, -0.22593255119863898, 0.15695367292209994, -0.11418224472436123, -0.17033054804487618, 0.11337132675689646, 0.15026892471651082, 0.10951278193970211, -0.10150942022346499, 0.09943478129534924, -0.0988291249370377, 0.12647357017067407, 0.0567087239556713, 0.04518938944092952, 0.17638013482210227, 0.14509812188189244, 0.13662055198219605, 0.1430270333577937, -0.09743645812777686, -0.1087137831014843, -0.28279201285040473, -0.1727263024833519, -0.21880993465383652, 0.05367303378388897, -0.09740520221812403, -0.24083660129108467, 0.36958888217857294, 0.12400039614003618, 0.2558165256230495, 0.07837187399782124, 0.24625715354486602, 0.13675865319964942, 0.06266218165401369, 0.0485625795845408, 0.151253013627138, 0.10817499957656765, 0.04069301193667343, -0.10376697698829958, 0.07349743671074975, 0.13458929098414957] |
1,802.10458 | A High GOPs/Slice Time Series Classifier for Portable and Embedded
Biomedical Applications | Nowadays a diverse range of physiological data can be captured continuously
for various applications in particular wellbeing and healthcare. Such data
require efficient methods for classification and analysis. Deep learning
algorithms have shown remarkable potential regarding such analyses, however,
the use of these algorithms on low-power wearable devices is challenged by
resource constraints such as area and power consumption. Most of the available
on-chip deep learning processors contain complex and dense hardware
architectures in order to achieve the highest possible throughput. Such a trend
in hardware design may not be efficient in applications where on-node
computation is required and the focus is more on the area and power efficiency
as in the case of portable and embedded biomedical devices. This paper presents
an efficient time-series classifier capable of automatically detecting
effective features and classifying the input signals in real-time. In the
proposed classifier, throughput is traded off with hardware complexity and cost
using resource sharing techniques. A Convolutional Neural Network (CNN) is
employed to extract input features and then a Long-Short-Term-Memory (LSTM)
architecture with ternary weight precision classifies the input signals
according to the extracted features. Hardware implementation on a Xilinx FPGA
confirm that the proposed hardware can accurately classify multiple complex
biomedical time series data with low area and power consumption and outperform
all previously presented state-of-the-art records. Most notably, our classifier
reaches 1.3$\times$ higher GOPs/Slice than similar state of the art FPGA-based
accelerators.
| cs.LG eess.SP | nowadays a diverse range of physiological data can be captured continuously for various applications in particular wellbeing and healthcare such data require efficient methods for classification and analysis deep learning algorithms have shown remarkable potential regarding such analyses however the use of these algorithms on lowpower wearable devices is challenged by resource constraints such as area and power consumption most of the available onchip deep learning processors contain complex and dense hardware architectures in order to achieve the highest possible throughput such a trend in hardware design may not be efficient in applications where onnode computation is required and the focus is more on the area and power efficiency as in the case of portable and embedded biomedical devices this paper presents an efficient timeseries classifier capable of automatically detecting effective features and classifying the input signals in realtime in the proposed classifier throughput is traded off with hardware complexity and cost using resource sharing techniques a convolutional neural network cnn is employed to extract input features and then a longshorttermmemory lstm architecture with ternary weight precision classifies the input signals according to the extracted features hardware implementation on a xilinx fpga confirm that the proposed hardware can accurately classify multiple complex biomedical time series data with low area and power consumption and outperform all previously presented stateoftheart records most notably our classifier reaches 13times higher gopsslice than similar state of the art fpgabased accelerators | [['nowadays', 'a', 'diverse', 'range', 'of', 'physiological', 'data', 'can', 'be', 'captured', 'continuously', 'for', 'various', 'applications', 'in', 'particular', 'wellbeing', 'and', 'healthcare', 'such', 'data', 'require', 'efficient', 'methods', 'for', 'classification', 'and', 'analysis', 'deep', 'learning', 'algorithms', 'have', 'shown', 'remarkable', 'potential', 'regarding', 'such', 'analyses', 'however', 'the', 'use', 'of', 'these', 'algorithms', 'on', 'lowpower', 'wearable', 'devices', 'is', 'challenged', 'by', 'resource', 'constraints', 'such', 'as', 'area', 'and', 'power', 'consumption', 'most', 'of', 'the', 'available', 'onchip', 'deep', 'learning', 'processors', 'contain', 'complex', 'and', 'dense', 'hardware', 'architectures', 'in', 'order', 'to', 'achieve', 'the', 'highest', 'possible', 'throughput', 'such', 'a', 'trend', 'in', 'hardware', 'design', 'may', 'not', 'be', 'efficient', 'in', 'applications', 'where', 'onnode', 'computation', 'is', 'required', 'and', 'the', 'focus', 'is', 'more', 'on', 'the', 'area', 'and', 'power', 'efficiency', 'as', 'in', 'the', 'case', 'of', 'portable', 'and', 'embedded', 'biomedical', 'devices', 'this', 'paper', 'presents', 'an', 'efficient', 'timeseries', 'classifier', 'capable', 'of', 'automatically', 'detecting', 'effective', 'features', 'and', 'classifying', 'the', 'input', 'signals', 'in', 'realtime', 'in', 'the', 'proposed', 'classifier', 'throughput', 'is', 'traded', 'off', 'with', 'hardware', 'complexity', 'and', 'cost', 'using', 'resource', 'sharing', 'techniques', 'a', 'convolutional', 'neural', 'network', 'cnn', 'is', 'employed', 'to', 'extract', 'input', 'features', 'and', 'then', 'a', 'longshorttermmemory', 'lstm', 'architecture', 'with', 'ternary', 'weight', 'precision', 'classifies', 'the', 'input', 'signals', 'according', 'to', 'the', 'extracted', 'features', 'hardware', 'implementation', 'on', 'a', 'xilinx', 'fpga', 'confirm', 'that', 'the', 'proposed', 'hardware', 'can', 'accurately', 'classify', 'multiple', 'complex', 'biomedical', 'time', 'series', 'data', 'with', 'low', 'area', 'and', 'power', 'consumption', 'and', 'outperform', 'all', 'previously', 'presented', 'stateoftheart', 'records', 'most', 'notably', 'our', 'classifier', 'reaches', '13times', 'higher', 'gopsslice', 'than', 'similar', 'state', 'of', 'the', 'art', 'fpgabased', 'accelerators']] | [-0.11366747941475552, 0.0017106022659523022, -0.031230074672911983, 0.0357005532620013, -0.09761362251403749, -0.22086113746055108, 0.027243906958924178, 0.4367759824356335, -0.24373921141143826, -0.3590424205753634, 0.11661615596813524, -0.27036634746254384, -0.17642510244145226, 0.2828814282399054, -0.12460464294032197, 0.12362599003070997, 0.10736510080969933, 0.05753269819363665, -0.030192167116587773, -0.2901919800071762, 0.22444534477425548, 0.0893867694965313, 0.3812532355555166, 0.016954632114288676, 0.09918907810297087, -0.031014739137747858, -0.02920853680708151, -0.03385177656835165, -0.01972146300936907, 0.1779794798184855, 0.37171888624767685, 0.20742548948241413, 0.2931748662535977, -0.46404617168327683, -0.23851038625217083, 0.10065575803900695, 0.1362617731683402, 0.04383130476344377, -0.04963710892660211, -0.2691033716645872, 0.11136328245480306, -0.20786084183372366, -0.011001164702430932, -0.16098822677273175, 0.005695644801912399, 0.03733493631425051, -0.2510205815390994, 0.0007617974599861166, -0.001305695792309876, 0.05998886465274084, -0.04023048010991556, -0.1302722020703567, 0.028339227793328304, 0.14645193369947693, -0.02827796208014031, 0.04443725443476986, 0.18267075126417553, -0.18443851312547802, -0.1430329253944831, 0.3491843967483594, -0.012218158514824454, -0.16627804313020922, 0.20141224207607314, -0.021004419383775983, -0.1638538639049213, 0.11263269527703842, 0.25657126726383644, 0.06383600291093557, -0.1736853062772216, 0.03424117618360314, 0.061975081108956255, 0.22048524927554858, 0.04626027232684736, 0.08606813375989342, 0.17901575455663957, 0.29186757374455374, 0.03439047399800844, 0.12519623219676349, -0.11789892521850033, -0.04166327346674501, -0.1793843942082937, -0.12444063603806381, -0.20910644031211367, -0.00887671688166233, -0.10049835173338532, -0.10781362430930325, 0.40279378180400044, 0.1911946301508703, 0.1614082808045145, 0.09660552873706016, 0.4040536761968436, 0.05096638716038906, 0.17140750454850176, 0.14215965643644524, 0.1556569214230682, 0.018420806647135086, 0.16827422455868596, -0.16316184209625867, 0.07604439960930469, -0.028466121676058557] |
1,802.10459 | Phase Transition for the Contact Process in a Random Environment on
Zd*Z+ | We review the results in Chen & Yao(2009,2012) which concern the contact
process in a static random environment on the half space Z^d*Z^+ and make some
addition to them. Furthermore, we explain why our methods cannot apply to the
whole space case and compare our results with some related works.
| math.PR | we review the results in chen yao20092012 which concern the contact process in a static random environment on the half space zdz and make some addition to them furthermore we explain why our methods cannot apply to the whole space case and compare our results with some related works | [['we', 'review', 'the', 'results', 'in', 'chen', 'yao20092012', 'which', 'concern', 'the', 'contact', 'process', 'in', 'a', 'static', 'random', 'environment', 'on', 'the', 'half', 'space', 'zdz', 'and', 'make', 'some', 'addition', 'to', 'them', 'furthermore', 'we', 'explain', 'why', 'our', 'methods', 'can', 'not', 'apply', 'to', 'the', 'whole', 'space', 'case', 'and', 'compare', 'our', 'results', 'with', 'some', 'related', 'works']] | [-0.035919670509744664, 0.05326170958958718, -0.06365536617552292, 0.09143535525209719, -0.10505637275625249, -0.085739887899206, 0.07952429205701896, 0.4212776176935556, -0.21603357182739644, -0.2678965395981712, 0.14599922403446114, -0.2708858696895899, -0.22320444135907658, 0.22737726847622164, -0.12766919936984777, 0.0036173471610765067, 0.06302401450063501, 0.041032814097647766, -0.08928976920718441, -0.3482666955690603, 0.35903281961776773, 0.01919804450732713, 0.2500388155482253, 0.06878841086765941, 0.025763089226900925, 0.01693354902446878, -0.06977614508561637, 0.03770862758154886, -0.16338344555044051, 0.1068700526113983, 0.20684124856274955, 0.09675228611889239, 0.24129901777914897, -0.4161706785766446, -0.21946455811967655, 0.0997762649643178, 0.12908383429392564, 0.12665603340042716, -0.026550326964399795, -0.2721734909027131, 0.08159213412401019, -0.13372619371214994, -0.13708035236376584, -0.1240481285150258, -0.03821970061494075, 0.029722275573532193, -0.20519219706671274, -0.0031494701623308416, 0.09791030761386667, -0.04110654230628695, -0.09903730121346152, -0.11077104515529104, 0.04869391464115101, 0.15180858860400562, 0.06237249443134084, 0.04320302731072416, 0.10307371307506549, -0.06748371860202478, -0.1286885241730785, 0.3720762293253626, -0.06690747790722823, -0.24189879669218647, 0.2612389908837421, -0.1647076147646472, -0.18449097577178356, 0.045306756783618916, 0.1502819093780554, 0.11501250343815404, -0.10418796430969117, 0.05796358415771428, -0.04395090745362852, 0.13734270005049753, 0.014869144300417024, -0.01327240717958431, 0.11404083144603944, 0.12909306588164549, 0.03227817862085542, 0.13982344723819773, -0.06255941190911286, -0.14087696175794212, -0.3098669159701284, -0.17149780778100296, -0.1395511827526652, 0.009996786884956385, -0.040174894395393644, -0.10875616853638571, 0.38599955853150814, 0.24152891490874545, 0.27501080645134257, 0.0638025092003791, 0.2843236613505501, 0.04087439495404916, 0.027004751813959102, 0.0846605768465266, 0.21612181608227785, 0.109257006181442, 0.14966872987356417, -0.15489104867209585, 0.05915490565916561, 0.01518741858248808] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.