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.0796 | Electric quadrupole and magnetic dipole coupling in plasmonic
nanoparticle arrays | Collective resonances in plasmonic nanoparticle arrays with electric dipole
moment oriented along the lattice wave propagation are theoretically
investigated. The role of electric quadrupole (EQ) and magnetic dipole (MD)
moments of gold nanoparticles in the resonant features of the arrays is
analyzed. We perform both semi-analytical calculations of coupled multipole
equations and rigorous numerical simulations varying contributions of the
electric and magnetic multipoles by changing particle size and shape (spheres
and disks). The arrays in homogeneous and non-homogeneous environments are
considered. We find that even very weak non-resonant EQ and MD moments of a
single particle are significantly enhanced in the periodic lattice at the
wavelength of collective (lattice) resonance excitation. Importantly, we show
that in the infinite arrays, the EQ and MD moments of nanoparticles are coupled
and affect each other resonant contributions. We also demonstrate that at the
lattice-resonance wavelength, the enhanced EQ and MD moments have contributions
to reflection comparable to the dipole one resulting in a significant decrease
of reflection and providing the satisfaction of the generalized Kerker
condition for reflection suppression.
| physics.optics | collective resonances in plasmonic nanoparticle arrays with electric dipole moment oriented along the lattice wave propagation are theoretically investigated the role of electric quadrupole eq and magnetic dipole md moments of gold nanoparticles in the resonant features of the arrays is analyzed we perform both semianalytical calculations of coupled multipole equations and rigorous numerical simulations varying contributions of the electric and magnetic multipoles by changing particle size and shape spheres and disks the arrays in homogeneous and nonhomogeneous environments are considered we find that even very weak nonresonant eq and md moments of a single particle are significantly enhanced in the periodic lattice at the wavelength of collective lattice resonance excitation importantly we show that in the infinite arrays the eq and md moments of nanoparticles are coupled and affect each other resonant contributions we also demonstrate that at the latticeresonance wavelength the enhanced eq and md moments have contributions to reflection comparable to the dipole one resulting in a significant decrease of reflection and providing the satisfaction of the generalized kerker condition for reflection suppression | [['collective', 'resonances', 'in', 'plasmonic', 'nanoparticle', 'arrays', 'with', 'electric', 'dipole', 'moment', 'oriented', 'along', 'the', 'lattice', 'wave', 'propagation', 'are', 'theoretically', 'investigated', 'the', 'role', 'of', 'electric', 'quadrupole', 'eq', 'and', 'magnetic', 'dipole', 'md', 'moments', 'of', 'gold', 'nanoparticles', 'in', 'the', 'resonant', 'features', 'of', 'the', 'arrays', 'is', 'analyzed', 'we', 'perform', 'both', 'semianalytical', 'calculations', 'of', 'coupled', 'multipole', 'equations', 'and', 'rigorous', 'numerical', 'simulations', 'varying', 'contributions', 'of', 'the', 'electric', 'and', 'magnetic', 'multipoles', 'by', 'changing', 'particle', 'size', 'and', 'shape', 'spheres', 'and', 'disks', 'the', 'arrays', 'in', 'homogeneous', 'and', 'nonhomogeneous', 'environments', 'are', 'considered', 'we', 'find', 'that', 'even', 'very', 'weak', 'nonresonant', 'eq', 'and', 'md', 'moments', 'of', 'a', 'single', 'particle', 'are', 'significantly', 'enhanced', 'in', 'the', 'periodic', 'lattice', 'at', 'the', 'wavelength', 'of', 'collective', 'lattice', 'resonance', 'excitation', 'importantly', 'we', 'show', 'that', 'in', 'the', 'infinite', 'arrays', 'the', 'eq', 'and', 'md', 'moments', 'of', 'nanoparticles', 'are', 'coupled', 'and', 'affect', 'each', 'other', 'resonant', 'contributions', 'we', 'also', 'demonstrate', 'that', 'at', 'the', 'latticeresonance', 'wavelength', 'the', 'enhanced', 'eq', 'and', 'md', 'moments', 'have', 'contributions', 'to', 'reflection', 'comparable', 'to', 'the', 'dipole', 'one', 'resulting', 'in', 'a', 'significant', 'decrease', 'of', 'reflection', 'and', 'providing', 'the', 'satisfaction', 'of', 'the', 'generalized', 'kerker', 'condition', 'for', 'reflection', 'suppression']] | [-0.16995041477626988, 0.18060916578131062, -0.014681745011891638, 0.04725368893372693, -0.03369757864624262, -0.09033709602696555, -0.005057374744210392, 0.41101122284041985, -0.21929563579548683, -0.2937512497550675, 0.007862316469794937, -0.31319405512085985, -0.11315855957833784, 0.16317431865526097, 0.09569718309278999, 0.020015705636303338, 0.031208227151738745, -0.008938806339034013, -0.014447586986103229, -0.16925457967162533, 0.2459493382368237, 0.0637439614926864, 0.27155168557805676, 0.07582513576905642, 0.04641862708276936, 0.015938302877226047, 0.03231369129648166, 0.0510009077084916, -0.11991612779704156, 0.1010983611590096, 0.2035296563963805, -0.031101496405899525, 0.16031413088153515, -0.49470353459673266, -0.15661661117736783, 0.02438894318383453, 0.155561836062864, 0.13170510263049176, -0.049650478657734184, -0.26321920622273215, 0.07063869949430228, -0.10521067846300347, -0.1633803937344679, -0.0848002513019102, 0.025179257259837218, 0.11325025287589857, -0.31814886812153936, 0.07634751645166293, 0.10259166372141668, 0.09063565711187299, -0.07915949236335498, -0.13743121893810376, -0.010620607371841157, 0.05027034942925509, 0.05327595728449523, -0.0232209498328822, 0.18534423703593866, -0.10849897273150938, -0.10838601568447692, 0.39392616024107807, -0.0901858894101211, -0.18824753027409316, 0.15012619219986456, -0.22191258255575252, -0.07687654860251183, 0.20395549557304807, 0.2000836984653558, 0.1171233643463347, -0.115769404659846, 0.07260096049368647, 0.03200703889006815, 0.17776121988626464, 0.12277458793882813, 0.026564172402556454, 0.23973344677127897, 0.12154080308042467, 0.007128315780178777, 0.14924443726061976, -0.12497525348727193, -0.08204393946698733, -0.24447812400758268, -0.10838888687879912, -0.1944780571758747, 0.012238793743225479, -0.10013935523814456, -0.17316546014110956, 0.3776097625068256, 0.10862030630132982, 0.11140663422378046, -0.013264980792467082, 0.27646906581574254, 0.14527834300750067, 0.050468545388430354, 0.0005790548053170953, 0.3043786201745804, 0.17721709668104138, 0.09327446432518108, -0.3276952106306063, -0.007059871439955064, -0.006037160712959511] |
1,802.07961 | Well-posedness to the continuous coagulation processes with
collision-induced multiple fragmentation | An existence result on weak solutions to the continuous coagulation equation
with collision-induced multiple fragmentation is established for certain
classes of unbounded coagulation, collision and breakup kernels. In this model,
a pair of particles can coagulate into a larger one if their confrontation is a
completely inelastic collision; otherwise, one of them will split into many
smaller particles due to a destructive collision. In the present work, both
coagulation and fragmentation processes are considered to be intrinsically
nonlinear. The breakup kernel may have a possibility to attain a singularity at
the origin. The proof is based on the classical weak L^1 compactness method
applied to suitably chosen approximating equations. In addition, we study the
uniqueness of weak solutions under additional growth conditions on collision
and breakup kernels which mainly relies on the integrability of higher moments.
Finally, it is obtained that the unique weak solution is mass-conserving.
| math.AP | an existence result on weak solutions to the continuous coagulation equation with collisioninduced multiple fragmentation is established for certain classes of unbounded coagulation collision and breakup kernels in this model a pair of particles can coagulate into a larger one if their confrontation is a completely inelastic collision otherwise one of them will split into many smaller particles due to a destructive collision in the present work both coagulation and fragmentation processes are considered to be intrinsically nonlinear the breakup kernel may have a possibility to attain a singularity at the origin the proof is based on the classical weak l1 compactness method applied to suitably chosen approximating equations in addition we study the uniqueness of weak solutions under additional growth conditions on collision and breakup kernels which mainly relies on the integrability of higher moments finally it is obtained that the unique weak solution is massconserving | [['an', 'existence', 'result', 'on', 'weak', 'solutions', 'to', 'the', 'continuous', 'coagulation', 'equation', 'with', 'collisioninduced', 'multiple', 'fragmentation', 'is', 'established', 'for', 'certain', 'classes', 'of', 'unbounded', 'coagulation', 'collision', 'and', 'breakup', 'kernels', 'in', 'this', 'model', 'a', 'pair', 'of', 'particles', 'can', 'coagulate', 'into', 'a', 'larger', 'one', 'if', 'their', 'confrontation', 'is', 'a', 'completely', 'inelastic', 'collision', 'otherwise', 'one', 'of', 'them', 'will', 'split', 'into', 'many', 'smaller', 'particles', 'due', 'to', 'a', 'destructive', 'collision', 'in', 'the', 'present', 'work', 'both', 'coagulation', 'and', 'fragmentation', 'processes', 'are', 'considered', 'to', 'be', 'intrinsically', 'nonlinear', 'the', 'breakup', 'kernel', 'may', 'have', 'a', 'possibility', 'to', 'attain', 'a', 'singularity', 'at', 'the', 'origin', 'the', 'proof', 'is', 'based', 'on', 'the', 'classical', 'weak', 'l1', 'compactness', 'method', 'applied', 'to', 'suitably', 'chosen', 'approximating', 'equations', 'in', 'addition', 'we', 'study', 'the', 'uniqueness', 'of', 'weak', 'solutions', 'under', 'additional', 'growth', 'conditions', 'on', 'collision', 'and', 'breakup', 'kernels', 'which', 'mainly', 'relies', 'on', 'the', 'integrability', 'of', 'higher', 'moments', 'finally', 'it', 'is', 'obtained', 'that', 'the', 'unique', 'weak', 'solution', 'is', 'massconserving']] | [-0.12659712259968123, 0.10573380379741584, -0.13697144681220355, 0.1137865957579113, -0.07222951289747848, -0.10378135867467543, -0.0209775966699837, 0.33284090491341184, -0.29269644271797773, -0.2228942901073467, 0.1073621354286787, -0.2491783685475385, -0.05448910704224694, 0.1576414549894327, 0.005445219872544716, 0.05853197310550683, 0.11370301118031853, -0.008168502938838638, -0.022023199792938673, -0.24145981565206534, 0.3969062365287421, 0.029256909667533273, 0.21532086521817917, 0.10128502189268858, 0.08656122327345062, -0.009111885229271336, 0.011439301897169782, -0.0025005414638490904, -0.151504039842262, 0.08836900286034358, 0.18175710721866412, 0.06631059632921706, 0.29493423489232856, -0.43021596961838454, -0.20019827219166597, 0.12571259117748615, 0.15363986211112973, 0.12023139010155004, -0.050328832229783085, -0.28889274554719935, 0.10402621293351763, -0.14309747468008577, -0.15862826148656253, -0.06440175860030513, 0.03376750887504646, 0.06497836653436186, -0.31017138209426776, 0.07609238052981443, 0.11909924269824916, -0.024589200276045168, -0.11107681074566177, -0.0668986279653626, -0.022074655360434535, 0.03644691008225489, 0.05566667330999333, -0.015279772297042062, 0.11522270472669581, -0.12222856007948783, -0.06495607866696557, 0.3549793182751861, -0.05449779208339307, -0.23663165488717508, 0.2987727024893397, -0.1500003037096768, -0.10945211363272095, 0.20357255885681633, 0.18513317577870322, 0.14143924101819697, -0.19095680663096054, 0.05522022392405957, -0.02397388215081728, 0.13503836495659258, 0.1288595706918182, 0.010002769790368066, 0.1580915160375793, 0.16664524047895252, 0.08756540324911158, 0.129751635465904, -0.04217589747174136, -0.13159547085385948, -0.32470380491458295, -0.1199122098112973, -0.15490010796355552, 0.08483909623900136, -0.07911208321209316, -0.1707588812640431, 0.3018361691125751, 0.11103498234712918, 0.2294307660919671, 0.030453208912335033, 0.2615605860530418, 0.16944953510347677, 0.07291954207759933, 0.045702085378864894, 0.25161114464146495, 0.13628640319347432, 0.0963145909358931, -0.20817353992190743, 0.0964796738667401, 0.10957564597911372] |
1,802.07962 | Entangled systems are unbounded sources of nonlocal correlations and of
certified random numbers | The outcomes of local measurements made on entangled systems can be certified
to be random provided that the generated statistics violate a Bell inequality.
This way of producing randomness relies only on a minimal set of assumptions
because it is independent of the internal functioning of the devices generating
the random outcomes. In this context it is crucial to understand both
qualitatively and quantitatively how the three fundamental quantities --
entanglement, non-locality and randomness -- relate to each other. To explore
these relationships, we consider the case where repeated (non projective)
measurements are made on the physical systems, each measurement being made on
the post-measurement state of the previous measurement. In this work, we focus
on the following questions: For systems in a given entangled state, how many
nonlocal correlations in a sequence can we obtain by measuring them repeatedly?
And from this generated sequence of non-local correlations, how many random
numbers is it possible to certify? In the standard scenario with a single
measurement in the sequence, it is possible to generate non-local correlations
between two distant observers only and the amount of random numbers is very
limited. Here we show that we can overcome these limitations and obtain any
amount of certified random numbers from an entangled pair of qubit in a pure
state by making sequences of measurements on it. Moreover, the state can be
arbitrarily weakly entangled. In addition, this certification is achieved by
near-maximal violation of a particular Bell inequality for each measurement in
the sequence. We also present numerical results giving insight on the
resistance to imperfections and on the importance of the strength of the
measurements in our scheme.
| quant-ph | the outcomes of local measurements made on entangled systems can be certified to be random provided that the generated statistics violate a bell inequality this way of producing randomness relies only on a minimal set of assumptions because it is independent of the internal functioning of the devices generating the random outcomes in this context it is crucial to understand both qualitatively and quantitatively how the three fundamental quantities entanglement nonlocality and randomness relate to each other to explore these relationships we consider the case where repeated non projective measurements are made on the physical systems each measurement being made on the postmeasurement state of the previous measurement in this work we focus on the following questions for systems in a given entangled state how many nonlocal correlations in a sequence can we obtain by measuring them repeatedly and from this generated sequence of nonlocal correlations how many random numbers is it possible to certify in the standard scenario with a single measurement in the sequence it is possible to generate nonlocal correlations between two distant observers only and the amount of random numbers is very limited here we show that we can overcome these limitations and obtain any amount of certified random numbers from an entangled pair of qubit in a pure state by making sequences of measurements on it moreover the state can be arbitrarily weakly entangled in addition this certification is achieved by nearmaximal violation of a particular bell inequality for each measurement in the sequence we also present numerical results giving insight on the resistance to imperfections and on the importance of the strength of the measurements in our scheme | [['the', 'outcomes', 'of', 'local', 'measurements', 'made', 'on', 'entangled', 'systems', 'can', 'be', 'certified', 'to', 'be', 'random', 'provided', 'that', 'the', 'generated', 'statistics', 'violate', 'a', 'bell', 'inequality', 'this', 'way', 'of', 'producing', 'randomness', 'relies', 'only', 'on', 'a', 'minimal', 'set', 'of', 'assumptions', 'because', 'it', 'is', 'independent', 'of', 'the', 'internal', 'functioning', 'of', 'the', 'devices', 'generating', 'the', 'random', 'outcomes', 'in', 'this', 'context', 'it', 'is', 'crucial', 'to', 'understand', 'both', 'qualitatively', 'and', 'quantitatively', 'how', 'the', 'three', 'fundamental', 'quantities', 'entanglement', 'nonlocality', 'and', 'randomness', 'relate', 'to', 'each', 'other', 'to', 'explore', 'these', 'relationships', 'we', 'consider', 'the', 'case', 'where', 'repeated', 'non', 'projective', 'measurements', 'are', 'made', 'on', 'the', 'physical', 'systems', 'each', 'measurement', 'being', 'made', 'on', 'the', 'postmeasurement', 'state', 'of', 'the', 'previous', 'measurement', 'in', 'this', 'work', 'we', 'focus', 'on', 'the', 'following', 'questions', 'for', 'systems', 'in', 'a', 'given', 'entangled', 'state', 'how', 'many', 'nonlocal', 'correlations', 'in', 'a', 'sequence', 'can', 'we', 'obtain', 'by', 'measuring', 'them', 'repeatedly', 'and', 'from', 'this', 'generated', 'sequence', 'of', 'nonlocal', 'correlations', 'how', 'many', 'random', 'numbers', 'is', 'it', 'possible', 'to', 'certify', 'in', 'the', 'standard', 'scenario', 'with', 'a', 'single', 'measurement', 'in', 'the', 'sequence', 'it', 'is', 'possible', 'to', 'generate', 'nonlocal', 'correlations', 'between', 'two', 'distant', 'observers', 'only', 'and', 'the', 'amount', 'of', 'random', 'numbers', 'is', 'very', 'limited', 'here', 'we', 'show', 'that', 'we', 'can', 'overcome', 'these', 'limitations', 'and', 'obtain', 'any', 'amount', 'of', 'certified', 'random', 'numbers', 'from', 'an', 'entangled', 'pair', 'of', 'qubit', 'in', 'a', 'pure', 'state', 'by', 'making', 'sequences', 'of', 'measurements', 'on', 'it', 'moreover', 'the', 'state', 'can', 'be', 'arbitrarily', 'weakly', 'entangled', 'in', 'addition', 'this', 'certification', 'is', 'achieved', 'by', 'nearmaximal', 'violation', 'of', 'a', 'particular', 'bell', 'inequality', 'for', 'each', 'measurement', 'in', 'the', 'sequence', 'we', 'also', 'present', 'numerical', 'results', 'giving', 'insight', 'on', 'the', 'resistance', 'to', 'imperfections', 'and', 'on', 'the', 'importance', 'of', 'the', 'strength', 'of', 'the', 'measurements', 'in', 'our', 'scheme']] | [-0.13554152228740335, 0.15818631468833821, -0.08379980337799248, 0.053056502321532785, -0.018063569100689226, -0.15197566438153604, 0.07059878387988076, 0.34981947080368164, -0.28676245712995296, -0.3028984158707742, 0.08941668785860368, -0.280014022729312, -0.09926819950970991, 0.23113636557780967, -0.06922493891872934, 0.06536826465353641, 0.08092928565545755, 0.0433101310835723, -0.02357782887712964, -0.27552227554485936, 0.34441283071519, 0.010589040740840069, 0.2719692087640483, 0.03308418088500816, 0.08660364615939979, 0.01718613332992311, -0.018717190601062507, 0.033225992642237676, -0.08245292517729826, 0.12561832003237638, 0.22951539213952682, 0.1520334828441211, 0.2698199396245997, -0.42510408205218125, -0.18800779421861372, 0.15162725709157784, 0.09220236219146227, 0.16247330764121629, -0.032655071374963644, -0.29516470362177377, 0.05673761504284194, -0.13995638107188407, -0.09220858201477804, -0.10693850716657556, 0.0011010361685805077, 0.006570934134248277, -0.27322760225893133, 0.061030839847627666, 0.05541804814915152, 0.025047703880653548, 0.011275441742008875, -0.034057443829790354, 0.01139965839004212, 0.1483619691052875, 0.0009128231139697243, -0.001400907773755654, 0.09911323815964869, -0.12204135528168247, -0.1403864868984551, 0.3485768356693596, -0.020668752025812864, -0.252905363066591, 0.19538923985210935, -0.16626488940958545, -0.15063480298582083, 0.040608620451657904, 0.14492909896699882, 0.10683924131720823, -0.1508516563760307, 0.012386371985325984, -0.0645622347148448, 0.2055555374903713, 0.051229605887996126, 0.0990144343129835, 0.18901910367557764, 0.10890035951309532, 0.05332388173929844, 0.16063857625683015, -0.042910083339071196, -0.09372097541056369, -0.3276091151629459, -0.1648395812864599, -0.24489025508111384, 0.09601626137482261, -0.06946015484381661, -0.11986842348722972, 0.3907156343207699, 0.18596599797589064, 0.20261571087099503, 0.00541863102469267, 0.287416101633877, 0.08078387433695514, 0.03708798824817989, 0.019689209954677163, 0.2666351752335301, 0.13959288892224023, 0.06112340244763687, -0.196349089768083, 0.13816330046095565, 0.014420131004197067] |
1,802.07963 | Semi-explicit solutions to the water-wave dispersion relation and their
role in the nonlinear Hamiltonian coupled-mode theory | The Hamiltonian coupled-mode theory (HCMT), recently derived by Athanassoulis
and Papoutsellis [1], provides an efficient new approach for solving fully
nonlinear water-wave problems over arbitrary bathymetry. In HCMT, heavy use is
made of the roots of a local, water-wave dispersion relation with varying
parameter, which have to be calculated at every horizontal position and every
time instant. Thus, fast and accurate calculation of these roots, valid for all
possible values of the varying parameter, are of fundamental importance. In
this paper, new, semi-explicit and highly accurate root-finding formulae are
derived, especially for the roots corresponding to evanescent modes. The
derivation is based on the successive application of a Picard-type iteration
and the Householder's root finding method. Explicit approximate formulae of
very good accuracy are obtained, which are adequate to support HCMT for many
types of applications. In most demanding cases, e.g. very steep, deep-water
waves, machine-accurate determination of the required roots is achieved by no
more than three iterations, using the explicit forms as initial values.
Exploiting this root-finding procedure in the HCMT, results in an efficient,
numerical solver able to treat fully nonlinear water waves over arbitrary
bathymetry. Applications to demanding nonlinear problems demonstrate the
efficiency and the robustness of the present approach.
| physics.comp-ph | the hamiltonian coupledmode theory hcmt recently derived by athanassoulis and papoutsellis 1 provides an efficient new approach for solving fully nonlinear waterwave problems over arbitrary bathymetry in hcmt heavy use is made of the roots of a local waterwave dispersion relation with varying parameter which have to be calculated at every horizontal position and every time instant thus fast and accurate calculation of these roots valid for all possible values of the varying parameter are of fundamental importance in this paper new semiexplicit and highly accurate rootfinding formulae are derived especially for the roots corresponding to evanescent modes the derivation is based on the successive application of a picardtype iteration and the householders root finding method explicit approximate formulae of very good accuracy are obtained which are adequate to support hcmt for many types of applications in most demanding cases eg very steep deepwater waves machineaccurate determination of the required roots is achieved by no more than three iterations using the explicit forms as initial values exploiting this rootfinding procedure in the hcmt results in an efficient numerical solver able to treat fully nonlinear water waves over arbitrary bathymetry applications to demanding nonlinear problems demonstrate the efficiency and the robustness of the present approach | [['the', 'hamiltonian', 'coupledmode', 'theory', 'hcmt', 'recently', 'derived', 'by', 'athanassoulis', 'and', 'papoutsellis', '1', 'provides', 'an', 'efficient', 'new', 'approach', 'for', 'solving', 'fully', 'nonlinear', 'waterwave', 'problems', 'over', 'arbitrary', 'bathymetry', 'in', 'hcmt', 'heavy', 'use', 'is', 'made', 'of', 'the', 'roots', 'of', 'a', 'local', 'waterwave', 'dispersion', 'relation', 'with', 'varying', 'parameter', 'which', 'have', 'to', 'be', 'calculated', 'at', 'every', 'horizontal', 'position', 'and', 'every', 'time', 'instant', 'thus', 'fast', 'and', 'accurate', 'calculation', 'of', 'these', 'roots', 'valid', 'for', 'all', 'possible', 'values', 'of', 'the', 'varying', 'parameter', 'are', 'of', 'fundamental', 'importance', 'in', 'this', 'paper', 'new', 'semiexplicit', 'and', 'highly', 'accurate', 'rootfinding', 'formulae', 'are', 'derived', 'especially', 'for', 'the', 'roots', 'corresponding', 'to', 'evanescent', 'modes', 'the', 'derivation', 'is', 'based', 'on', 'the', 'successive', 'application', 'of', 'a', 'picardtype', 'iteration', 'and', 'the', 'householders', 'root', 'finding', 'method', 'explicit', 'approximate', 'formulae', 'of', 'very', 'good', 'accuracy', 'are', 'obtained', 'which', 'are', 'adequate', 'to', 'support', 'hcmt', 'for', 'many', 'types', 'of', 'applications', 'in', 'most', 'demanding', 'cases', 'eg', 'very', 'steep', 'deepwater', 'waves', 'machineaccurate', 'determination', 'of', 'the', 'required', 'roots', 'is', 'achieved', 'by', 'no', 'more', 'than', 'three', 'iterations', 'using', 'the', 'explicit', 'forms', 'as', 'initial', 'values', 'exploiting', 'this', 'rootfinding', 'procedure', 'in', 'the', 'hcmt', 'results', 'in', 'an', 'efficient', 'numerical', 'solver', 'able', 'to', 'treat', 'fully', 'nonlinear', 'water', 'waves', 'over', 'arbitrary', 'bathymetry', 'applications', 'to', 'demanding', 'nonlinear', 'problems', 'demonstrate', 'the', 'efficiency', 'and', 'the', 'robustness', 'of', 'the', 'present', 'approach']] | [-0.11984714110017171, 0.05026188892135431, -0.06595389833306811, 0.05713560507607559, -0.08996710921362445, -0.1490814930878653, 0.005201131140404918, 0.34834372521070717, -0.23257580837246325, -0.3018017058338731, 0.12021230363855918, -0.21797482840478274, -0.14987932858997818, 0.27743794395258015, -0.018386752869970546, 0.10634887331292112, 0.08348861486901038, -0.0014113295442548584, -0.0812629919956218, -0.22294762802168067, 0.2605721217773974, 0.055148455489821405, 0.2391001488462898, 0.04307303420988283, 0.13716283580058902, 0.005626146642610504, -0.04759399018154636, 0.011556286020198332, -0.10138482059090595, 0.1534798166626007, 0.29465053236717587, 0.08187877420069915, 0.2840559011040797, -0.4438699788440895, -0.19914087868098335, 0.0760313944083643, 0.15638165573812873, 0.12886222513975218, -0.0456202757632127, -0.24710784116392873, 0.09337031880159646, -0.14696881775010212, -0.17471072839798402, -0.11203727749602989, 0.041104263515931924, 0.021772213924786288, -0.29809800443684525, 0.0848044733335654, 0.008746036794610102, 0.056064949534934364, -0.05762921975985206, -0.13555522437386325, 0.011042030872272447, 0.10016595967013041, 0.01735439987077832, -0.005470229232491091, 0.04857040560928178, -0.12366701080349132, -0.06496322244690189, 0.3839530436771697, -0.025847928753719673, -0.23366161571583927, 0.16706538536549165, -0.07234978517104546, -0.1071724939834455, 0.1664412176199808, 0.16061634406819594, 0.16189062247956584, -0.12695417748053048, 0.07505720023242436, -0.005080268440453859, 0.13553384628968101, 0.1045869842511166, -0.004582373572747439, 0.14116320776606317, 0.13315941932208444, 0.062237598919802864, 0.10039365564626665, -0.027234410416344043, -0.10124877464224635, -0.28991081444500705, -0.1374660960977537, -0.16119783107372543, -0.01663522033497985, -0.12794116211626702, -0.1714858799585568, 0.387302127451145, 0.16773942148707477, 0.15083384328049246, 0.08714355928295756, 0.30588799617780843, 0.17919322740678845, 0.029092609659846634, 0.08698684239814235, 0.21890739219611868, 0.14301057773518372, 0.07235653292238046, -0.19818433363843949, 0.054439615492658515, 0.09948938745796553] |
1,802.07964 | Topological phases of non-Hermitian systems | Recent experimental advances in controlling dissipation have brought about
unprecedented flexibility in engineering non-Hermitian Hamiltonians in open
classical and quantum systems. A particular interest centers on the topological
properties of non-Hermitian systems, which exhibit unique phases with no
Hermitian counterparts. However, no systematic understanding in analogy with
the periodic table of topological insulators and superconductors has been
achieved. In this paper, we develop a coherent framework of topological phases
of non-Hermitian systems. After elucidating the physical meaning and the
mathematical definition of non-Hermitian topological phases, we start with
one-dimensional lattices, which exhibit topological phases with no Hermitian
counterparts and are found to be characterized by an integer topological
winding number even with no symmetry constraint, reminiscent of the quantum
Hall insulator in Hermitian systems. A system with a nonzero winding number,
which is experimentally measurable from the wave-packet dynamics, is shown to
be robust against disorder, a phenomenon observed in the Hatano-Nelson model
with asymmetric hopping amplitudes. We also unveil a novel bulk-edge
correspondence that features an infinite number of (quasi-)edge modes. We then
apply the K-theory to systematically classify all the non-Hermitian topological
phases in the Altland-Zirnbauer classes in all dimensions. The obtained
periodic table unifies time-reversal and particle-hole symmetries, leading to
highly nontrivial predictions such as the absence of non-Hermitian topological
phases in two dimensions. We provide concrete examples for all the nontrivial
non-Hermitian AZ classes in zero and one dimensions. In particular, we identify
a Z2 topological index for arbitrary quantum channels. Our work lays the
cornerstone for a unified understanding of the role of topology in
non-Hermitian systems.
| cond-mat.mes-hall cond-mat.dis-nn cond-mat.quant-gas cond-mat.stat-mech quant-ph | recent experimental advances in controlling dissipation have brought about unprecedented flexibility in engineering nonhermitian hamiltonians in open classical and quantum systems a particular interest centers on the topological properties of nonhermitian systems which exhibit unique phases with no hermitian counterparts however no systematic understanding in analogy with the periodic table of topological insulators and superconductors has been achieved in this paper we develop a coherent framework of topological phases of nonhermitian systems after elucidating the physical meaning and the mathematical definition of nonhermitian topological phases we start with onedimensional lattices which exhibit topological phases with no hermitian counterparts and are found to be characterized by an integer topological winding number even with no symmetry constraint reminiscent of the quantum hall insulator in hermitian systems a system with a nonzero winding number which is experimentally measurable from the wavepacket dynamics is shown to be robust against disorder a phenomenon observed in the hatanonelson model with asymmetric hopping amplitudes we also unveil a novel bulkedge correspondence that features an infinite number of quasiedge modes we then apply the ktheory to systematically classify all the nonhermitian topological phases in the altlandzirnbauer classes in all dimensions the obtained periodic table unifies timereversal and particlehole symmetries leading to highly nontrivial predictions such as the absence of nonhermitian topological phases in two dimensions we provide concrete examples for all the nontrivial nonhermitian az classes in zero and one dimensions in particular we identify a z2 topological index for arbitrary quantum channels our work lays the cornerstone for a unified understanding of the role of topology in nonhermitian systems | [['recent', 'experimental', 'advances', 'in', 'controlling', 'dissipation', 'have', 'brought', 'about', 'unprecedented', 'flexibility', 'in', 'engineering', 'nonhermitian', 'hamiltonians', 'in', 'open', 'classical', 'and', 'quantum', 'systems', 'a', 'particular', 'interest', 'centers', 'on', 'the', 'topological', 'properties', 'of', 'nonhermitian', 'systems', 'which', 'exhibit', 'unique', 'phases', 'with', 'no', 'hermitian', 'counterparts', 'however', 'no', 'systematic', 'understanding', 'in', 'analogy', 'with', 'the', 'periodic', 'table', 'of', 'topological', 'insulators', 'and', 'superconductors', 'has', 'been', 'achieved', 'in', 'this', 'paper', 'we', 'develop', 'a', 'coherent', 'framework', 'of', 'topological', 'phases', 'of', 'nonhermitian', 'systems', 'after', 'elucidating', 'the', 'physical', 'meaning', 'and', 'the', 'mathematical', 'definition', 'of', 'nonhermitian', 'topological', 'phases', 'we', 'start', 'with', 'onedimensional', 'lattices', 'which', 'exhibit', 'topological', 'phases', 'with', 'no', 'hermitian', 'counterparts', 'and', 'are', 'found', 'to', 'be', 'characterized', 'by', 'an', 'integer', 'topological', 'winding', 'number', 'even', 'with', 'no', 'symmetry', 'constraint', 'reminiscent', 'of', 'the', 'quantum', 'hall', 'insulator', 'in', 'hermitian', 'systems', 'a', 'system', 'with', 'a', 'nonzero', 'winding', 'number', 'which', 'is', 'experimentally', 'measurable', 'from', 'the', 'wavepacket', 'dynamics', 'is', 'shown', 'to', 'be', 'robust', 'against', 'disorder', 'a', 'phenomenon', 'observed', 'in', 'the', 'hatanonelson', 'model', 'with', 'asymmetric', 'hopping', 'amplitudes', 'we', 'also', 'unveil', 'a', 'novel', 'bulkedge', 'correspondence', 'that', 'features', 'an', 'infinite', 'number', 'of', 'quasiedge', 'modes', 'we', 'then', 'apply', 'the', 'ktheory', 'to', 'systematically', 'classify', 'all', 'the', 'nonhermitian', 'topological', 'phases', 'in', 'the', 'altlandzirnbauer', 'classes', 'in', 'all', 'dimensions', 'the', 'obtained', 'periodic', 'table', 'unifies', 'timereversal', 'and', 'particlehole', 'symmetries', 'leading', 'to', 'highly', 'nontrivial', 'predictions', 'such', 'as', 'the', 'absence', 'of', 'nonhermitian', 'topological', 'phases', 'in', 'two', 'dimensions', 'we', 'provide', 'concrete', 'examples', 'for', 'all', 'the', 'nontrivial', 'nonhermitian', 'az', 'classes', 'in', 'zero', 'and', 'one', 'dimensions', 'in', 'particular', 'we', 'identify', 'a', 'z2', 'topological', 'index', 'for', 'arbitrary', 'quantum', 'channels', 'our', 'work', 'lays', 'the', 'cornerstone', 'for', 'a', 'unified', 'understanding', 'of', 'the', 'role', 'of', 'topology', 'in', 'nonhermitian', 'systems']] | [-0.20662409592450193, 0.19938212113579382, -0.06885986527877636, 0.04591211639353613, -0.04485470355377743, -0.19288122967970325, 0.03428104642102445, 0.3590819173192755, -0.22849218501134907, -0.25466990348315616, 0.04839188941657165, -0.26906135866183867, -0.23637556966743878, 0.1719178264867871, -0.04286758372849175, 0.09019945578121534, -0.003974346165684448, -0.0166847015822697, -0.13240300841322633, -0.2068521570043203, 0.3207449892337766, -0.043021433481699484, 0.2724629613531618, 0.03798900037411586, 0.021863329213583606, -0.005881563715736642, 0.039451841145425576, 0.014213143029407209, -0.12204325475772487, 0.08484092106421788, 0.2805224296046328, -0.020820059283668625, 0.1732307055302034, -0.43283158739122396, -0.24796193763185506, 0.11312877944085419, 0.12183692373731887, 0.14036568820207126, -0.08343600545487084, -0.3357788617883263, 0.0708791750484999, -0.1773892712254805, -0.1733906664154082, -0.1335406759611092, 0.06308851345759812, -0.06380661481579274, -0.1862805903767917, 0.034884482061814236, 0.08663921486907478, 0.12183472247779997, -0.04643582470812728, -0.06351591500326977, -0.04610179647646302, 0.09874437386669589, 0.0068451938753719245, -0.025214212514831188, 0.05005421926815177, -0.12438710939792123, -0.206628717869249, 0.4097356337731012, -0.000977228300189207, -0.1923706434495721, 0.20909560233411661, -0.11972264563466307, -0.16066705456210506, 0.13048987415301616, 0.11908926195072517, 0.0713628451908596, -0.10091869584980538, 0.11887794653340902, -0.046240251052810655, 0.1447624216511644, 0.016335958565769974, 0.14336838114781883, 0.2682268355698307, 0.1244699158331101, 0.07204412066705981, 0.1657045525043732, 0.00017132815615884188, -0.1535907168765606, -0.28179872369258113, -0.17157203941944973, -0.22345209267602384, 0.0803021164325519, -0.05672337146535234, -0.1985914185432444, 0.47079191926038927, 0.14716275411161106, 0.20831999311159397, -0.005299686736577116, 0.2101655755713011, 0.12791272652981325, 0.052100381396453954, 0.04364811238597265, 0.2140250864868691, 0.16804017336286206, 0.07836119624985903, -0.21137247278294402, -0.009724358859885898, 0.07095739193674591] |
1,802.07965 | An Observationally-Constrained Model of a Flux Rope that Formed in the
Solar Corona | Coronal mass ejections (CMEs) are large-scale eruptions of plasma from the
coronae of stars. Understanding the plasma processes involved in CME initiation
has applications to space weather forecasting and laboratory plasma
experiments. James et al. (Sol. Phys. 292, 71, 2017) used EUV observations to
conclude that a magnetic flux rope formed in the solar corona above NOAA Active
Region 11504 before it erupted on 14 June 2012 (SOL2012-06-14). In this work,
we use data from the Solar Dynamics Observatory to model the coronal magnetic
field of the active region one hour prior to eruption using a nonlinear
force-free field extrapolation, and find a flux rope reaching a maximum height
of 150 Mm above the photosphere. Estimations of the average twist of the
strongly asymmetric extrapolated flux rope are between 1.35 and 1.88 turns,
depending on the choice of axis, although the erupting structure was not
observed to kink. The decay index near the apex of the axis of the extrapolated
flux rope is comparable to typical critical values required for the onset of
the torus instability, so we suggest that the torus instability drove the
eruption.
| astro-ph.SR | coronal mass ejections cmes are largescale eruptions of plasma from the coronae of stars understanding the plasma processes involved in cme initiation has applications to space weather forecasting and laboratory plasma experiments james et al sol phys 292 71 2017 used euv observations to conclude that a magnetic flux rope formed in the solar corona above noaa active region 11504 before it erupted on 14 june 2012 sol20120614 in this work we use data from the solar dynamics observatory to model the coronal magnetic field of the active region one hour prior to eruption using a nonlinear forcefree field extrapolation and find a flux rope reaching a maximum height of 150 mm above the photosphere estimations of the average twist of the strongly asymmetric extrapolated flux rope are between 135 and 188 turns depending on the choice of axis although the erupting structure was not observed to kink the decay index near the apex of the axis of the extrapolated flux rope is comparable to typical critical values required for the onset of the torus instability so we suggest that the torus instability drove the eruption | [['coronal', 'mass', 'ejections', 'cmes', 'are', 'largescale', 'eruptions', 'of', 'plasma', 'from', 'the', 'coronae', 'of', 'stars', 'understanding', 'the', 'plasma', 'processes', 'involved', 'in', 'cme', 'initiation', 'has', 'applications', 'to', 'space', 'weather', 'forecasting', 'and', 'laboratory', 'plasma', 'experiments', 'james', 'et', 'al', 'sol', 'phys', '292', '71', '2017', 'used', 'euv', 'observations', 'to', 'conclude', 'that', 'a', 'magnetic', 'flux', 'rope', 'formed', 'in', 'the', 'solar', 'corona', 'above', 'noaa', 'active', 'region', '11504', 'before', 'it', 'erupted', 'on', '14', 'june', '2012', 'sol20120614', 'in', 'this', 'work', 'we', 'use', 'data', 'from', 'the', 'solar', 'dynamics', 'observatory', 'to', 'model', 'the', 'coronal', 'magnetic', 'field', 'of', 'the', 'active', 'region', 'one', 'hour', 'prior', 'to', 'eruption', 'using', 'a', 'nonlinear', 'forcefree', 'field', 'extrapolation', 'and', 'find', 'a', 'flux', 'rope', 'reaching', 'a', 'maximum', 'height', 'of', '150', 'mm', 'above', 'the', 'photosphere', 'estimations', 'of', 'the', 'average', 'twist', 'of', 'the', 'strongly', 'asymmetric', 'extrapolated', 'flux', 'rope', 'are', 'between', '135', 'and', '188', 'turns', 'depending', 'on', 'the', 'choice', 'of', 'axis', 'although', 'the', 'erupting', 'structure', 'was', 'not', 'observed', 'to', 'kink', 'the', 'decay', 'index', 'near', 'the', 'apex', 'of', 'the', 'axis', 'of', 'the', 'extrapolated', 'flux', 'rope', 'is', 'comparable', 'to', 'typical', 'critical', 'values', 'required', 'for', 'the', 'onset', 'of', 'the', 'torus', 'instability', 'so', 'we', 'suggest', 'that', 'the', 'torus', 'instability', 'drove', 'the', 'eruption']] | [-0.09684107248880586, 0.2173405890780929, 0.013409378797419973, 0.11348683251244192, -0.10192110224570324, -0.02241984188959405, 0.04305752122718086, 0.4124628253255946, -0.1357393362005619, -0.4024672778272951, 0.102705613260686, -0.23247489179956501, -0.09625477025386046, 0.22798188421025722, -0.03447815548192798, 0.019748247311076123, 0.1172042954964815, -0.030372818532978765, -0.04484763081386887, -0.1975812107916116, 0.23073161751082216, 0.16913848899090914, 0.2357154087138337, 0.012300971056007453, 0.07082715572638286, -0.132277214894625, -0.005138691066688783, -0.04699454901352953, -0.1441891205017266, -0.0031501697137247065, 0.13408039197501903, 0.08557215169248347, 0.22470125195670973, -0.43720384939900925, -0.2555195913587168, -0.01941875331103802, 0.16563333398473726, -0.045244736808377345, 0.03361143420774464, -0.2670456340989551, 0.030015751598025296, -0.1178816569226517, -0.1503131061893057, 0.09989316861170369, 0.0641360636350598, -0.009953907682132479, -0.30574717548537395, 0.08638073824836898, 0.013972896867356187, 0.11631885802222265, -0.13321089523960836, -0.05705642866071414, -0.10467270571939849, 0.09069361845786507, 0.11955817653734639, 0.14112312986540634, 0.26459999928452277, -0.10708184593004753, -0.07422649938915227, 0.31244149479914357, -0.0044862024479772195, 0.013876617390259697, 0.16275750482077334, -0.24401997892387411, -0.1393714971991407, 0.2495205125205118, 0.1537074345737425, 0.06783939059068625, -0.07898310135980766, -0.00374224205042009, -0.08466171657106512, 0.1393654051224223, 0.07946333640642037, -0.08772033002806474, 0.29264382477723866, 0.13034139016920046, 0.021807460277970578, 0.11677703084675847, -0.24848749155455546, -0.08099669702067921, -0.29497228302564976, -0.11586278518913566, -0.08882060015473414, 0.08279745429510414, -0.0668246166916671, -0.21767046681127034, 0.4066157354652328, 0.19450663107673863, 0.21898027459864278, -0.09200087659960814, 0.23922046870496627, 0.07300215302085554, 0.04612543591977777, 0.21120803335152968, 0.3543711636869891, 0.22256086512493925, 0.24287950780645415, -0.22346569413973674, 0.02309327042485411, 0.10660283921689198] |
1,802.07966 | Incremental and Iterative Learning of Answer Set Programs from Mutually
Distinct Examples | Over the years the Artificial Intelligence (AI) community has produced
several datasets which have given the machine learning algorithms the
opportunity to learn various skills across various domains. However, a subclass
of these machine learning algorithms that aimed at learning logic programs,
namely the Inductive Logic Programming algorithms, have often failed at the
task due to the vastness of these datasets. This has impacted the usability of
knowledge representation and reasoning techniques in the development of AI
systems. In this research, we try to address this scalability issue for the
algorithms that learn answer set programs. We present a sound and complete
algorithm which takes the input in a slightly different manner and performs an
efficient and more user controlled search for a solution. We show via
experiments that our algorithm can learn from two popular datasets from machine
learning community, namely bAbl (a question answering dataset) and MNIST (a
dataset for handwritten digit recognition), which to the best of our knowledge
was not previously possible. The system is publicly available at
https://goo.gl/KdWAcV. This paper is under consideration for acceptance in
TPLP.
| cs.AI cs.LG cs.LO | over the years the artificial intelligence ai community has produced several datasets which have given the machine learning algorithms the opportunity to learn various skills across various domains however a subclass of these machine learning algorithms that aimed at learning logic programs namely the inductive logic programming algorithms have often failed at the task due to the vastness of these datasets this has impacted the usability of knowledge representation and reasoning techniques in the development of ai systems in this research we try to address this scalability issue for the algorithms that learn answer set programs we present a sound and complete algorithm which takes the input in a slightly different manner and performs an efficient and more user controlled search for a solution we show via experiments that our algorithm can learn from two popular datasets from machine learning community namely babl a question answering dataset and mnist a dataset for handwritten digit recognition which to the best of our knowledge was not previously possible the system is publicly available at httpsgooglkdwacv this paper is under consideration for acceptance in tplp | [['over', 'the', 'years', 'the', 'artificial', 'intelligence', 'ai', 'community', 'has', 'produced', 'several', 'datasets', 'which', 'have', 'given', 'the', 'machine', 'learning', 'algorithms', 'the', 'opportunity', 'to', 'learn', 'various', 'skills', 'across', 'various', 'domains', 'however', 'a', 'subclass', 'of', 'these', 'machine', 'learning', 'algorithms', 'that', 'aimed', 'at', 'learning', 'logic', 'programs', 'namely', 'the', 'inductive', 'logic', 'programming', 'algorithms', 'have', 'often', 'failed', 'at', 'the', 'task', 'due', 'to', 'the', 'vastness', 'of', 'these', 'datasets', 'this', 'has', 'impacted', 'the', 'usability', 'of', 'knowledge', 'representation', 'and', 'reasoning', 'techniques', 'in', 'the', 'development', 'of', 'ai', 'systems', 'in', 'this', 'research', 'we', 'try', 'to', 'address', 'this', 'scalability', 'issue', 'for', 'the', 'algorithms', 'that', 'learn', 'answer', 'set', 'programs', 'we', 'present', 'a', 'sound', 'and', 'complete', 'algorithm', 'which', 'takes', 'the', 'input', 'in', 'a', 'slightly', 'different', 'manner', 'and', 'performs', 'an', 'efficient', 'and', 'more', 'user', 'controlled', 'search', 'for', 'a', 'solution', 'we', 'show', 'via', 'experiments', 'that', 'our', 'algorithm', 'can', 'learn', 'from', 'two', 'popular', 'datasets', 'from', 'machine', 'learning', 'community', 'namely', 'babl', 'a', 'question', 'answering', 'dataset', 'and', 'mnist', 'a', 'dataset', 'for', 'handwritten', 'digit', 'recognition', 'which', 'to', 'the', 'best', 'of', 'our', 'knowledge', 'was', 'not', 'previously', 'possible', 'the', 'system', 'is', 'publicly', 'available', 'at', 'httpsgooglkdwacv', 'this', 'paper', 'is', 'under', 'consideration', 'for', 'acceptance', 'in', 'tplp']] | [-0.05750525282475994, -0.015508574875275372, -0.09769977358325074, 0.06664514214498922, -0.14747863003932354, -0.18087291553771745, 0.04473953533128628, 0.42804979988270336, -0.2686197161105358, -0.376664287948774, 0.09849209608639486, -0.2538067967668111, -0.1641963099439939, 0.23598917689717686, -0.11720865595982306, 0.09908553884985546, 0.13249030931231875, 0.06682922545070243, -0.036261899843359265, -0.3280054689359127, 0.3118944274248659, 0.03085270427788297, 0.32066423644622166, 0.04452330137751738, 0.11076361224210511, -0.03736192377982661, -0.006785060530819465, -0.0016121025300688213, -0.07129803172036998, 0.1788201151596796, 0.3933658188364158, 0.29192910530707905, 0.38711528653382427, -0.3919460411493977, -0.15092834513117043, 0.10241176878270279, 0.1375739572233417, 0.13709207644917318, -0.04019245063383197, -0.3276225491737326, 0.07832415848064961, -0.16319906147093408, 0.021087740912723044, -0.15022148815462263, 0.019124911655671893, -0.05954462759254966, -0.2585141674589573, -0.0624686377756815, 0.11718055038978087, 0.11957765110354457, -0.03443132808574268, -0.12983753282719085, 0.0958696845608453, 0.1489488432701263, 0.047904771272962735, 0.05434937446682145, 0.1242810433006121, -0.16957789736592935, -0.21963352525296312, 0.379706114768568, -0.013471463316171947, -0.1703614102016824, 0.22857828506837702, -0.030786862741741867, -0.20676640362685753, 0.09523790898318919, 0.26388259074236786, 0.12666753073895556, -0.1789446629325135, 0.06839790546121852, -0.06024727093883687, 0.18533201779549321, 0.06658713800522188, -0.03975711441081431, 0.19153652065077847, 0.2608062234707177, 0.01964291291984005, 0.12669649091031815, -0.06322977241232164, -0.07226861875484852, -0.18582496205862198, -0.11010100677505963, -0.16719324729767523, -0.03439207863791833, -0.05648073547983788, -0.1391106554506728, 0.39758875794294807, 0.26074129140470176, 0.13109562387172546, 0.11059943513876837, 0.33532792837876413, 0.016112590566384217, 0.11924319304655202, 0.12659482826549923, 0.1728370040978512, 0.000348885782295838, 0.18729285795125178, -0.17346126508265217, 0.11225841929489333, -0.001253235710060431] |
1,802.07967 | Near Isometric Terminal Embeddings for Doubling Metrics | Given a metric space $(X,d)$, a set of terminals $K\subseteq X$, and a
parameter $t\ge 1$, we consider metric structures (e.g., spanners, distance
oracles, embedding into normed spaces) that preserve distances for all pairs in
$K\times X$ up to a factor of $t$, and have small size (e.g. number of edges
for spanners, dimension for embeddings). While such terminal (aka source-wise)
metric structures are known to exist in several settings, no terminal spanner
or embedding with distortion close to 1, i.e., $t=1+\epsilon$ for some small
$0<\epsilon<1$, is currently known.
Here we devise such terminal metric structures for {\em doubling} metrics,
and show that essentially any metric structure with distortion $1+\epsilon$ and
size $s(|X|)$ has its terminal counterpart, with distortion $1+O(\epsilon)$ and
size $s(|K|)+1$. In particular, for any doubling metric on $n$ points, a set of
$k=o(n)$ terminals, and constant $0<\epsilon<1$, there exists:
(1) A spanner with stretch $1+\epsilon$ for pairs in $K\times X$, with
$n+o(n)$ edges.
(2) A labeling scheme with stretch $1+\epsilon$ for pairs in $K\times X$,
with label size $\approx \log k$.
(3) An embedding into $\ell_\infty^d$ with distortion $1+\epsilon$ for pairs
in $K\times X$, where $d=O(\log k)$.
Moreover, surprisingly, the last two results apply if only $K$ is a doubling
metric, while $X$ can be arbitrary.
| cs.DS cs.CG | given a metric space xd a set of terminals ksubseteq x and a parameter tge 1 we consider metric structures eg spanners distance oracles embedding into normed spaces that preserve distances for all pairs in ktimes x up to a factor of t and have small size eg number of edges for spanners dimension for embeddings while such terminal aka sourcewise metric structures are known to exist in several settings no terminal spanner or embedding with distortion close to 1 ie t1epsilon for some small 0epsilon1 is currently known here we devise such terminal metric structures for em doubling metrics and show that essentially any metric structure with distortion 1epsilon and size sx has its terminal counterpart with distortion 1oepsilon and size sk1 in particular for any doubling metric on n points a set of kon terminals and constant 0epsilon1 there exists 1 a spanner with stretch 1epsilon for pairs in ktimes x with non edges 2 a labeling scheme with stretch 1epsilon for pairs in ktimes x with label size approx log k 3 an embedding into ell_inftyd with distortion 1epsilon for pairs in ktimes x where dolog k moreover surprisingly the last two results apply if only k is a doubling metric while x can be arbitrary | [['given', 'a', 'metric', 'space', 'xd', 'a', 'set', 'of', 'terminals', 'ksubseteq', 'x', 'and', 'a', 'parameter', 'tge', '1', 'we', 'consider', 'metric', 'structures', 'eg', 'spanners', 'distance', 'oracles', 'embedding', 'into', 'normed', 'spaces', 'that', 'preserve', 'distances', 'for', 'all', 'pairs', 'in', 'ktimes', 'x', 'up', 'to', 'a', 'factor', 'of', 't', 'and', 'have', 'small', 'size', 'eg', 'number', 'of', 'edges', 'for', 'spanners', 'dimension', 'for', 'embeddings', 'while', 'such', 'terminal', 'aka', 'sourcewise', 'metric', 'structures', 'are', 'known', 'to', 'exist', 'in', 'several', 'settings', 'no', 'terminal', 'spanner', 'or', 'embedding', 'with', 'distortion', 'close', 'to', '1', 'ie', 't1epsilon', 'for', 'some', 'small', '0epsilon1', 'is', 'currently', 'known', 'here', 'we', 'devise', 'such', 'terminal', 'metric', 'structures', 'for', 'em', 'doubling', 'metrics', 'and', 'show', 'that', 'essentially', 'any', 'metric', 'structure', 'with', 'distortion', '1epsilon', 'and', 'size', 'sx', 'has', 'its', 'terminal', 'counterpart', 'with', 'distortion', '1oepsilon', 'and', 'size', 'sk1', 'in', 'particular', 'for', 'any', 'doubling', 'metric', 'on', 'n', 'points', 'a', 'set', 'of', 'kon', 'terminals', 'and', 'constant', '0epsilon1', 'there', 'exists', '1', 'a', 'spanner', 'with', 'stretch', '1epsilon', 'for', 'pairs', 'in', 'ktimes', 'x', 'with', 'non', 'edges', '2', 'a', 'labeling', 'scheme', 'with', 'stretch', '1epsilon', 'for', 'pairs', 'in', 'ktimes', 'x', 'with', 'label', 'size', 'approx', 'log', 'k', '3', 'an', 'embedding', 'into', 'ell_inftyd', 'with', 'distortion', '1epsilon', 'for', 'pairs', 'in', 'ktimes', 'x', 'where', 'dolog', 'k', 'moreover', 'surprisingly', 'the', 'last', 'two', 'results', 'apply', 'if', 'only', 'k', 'is', 'a', 'doubling', 'metric', 'while', 'x', 'can', 'be', 'arbitrary']] | [-0.20240993450100248, 0.09631806963562457, 0.012748631230071904, 0.028064225565266006, -0.04779279440901099, -0.2107977652698397, 0.09147635807480234, 0.442775801056996, -0.30625042621529874, -0.2816526112269807, 0.06300165602610483, -0.34378727660693514, -0.10749170751436256, 0.14092210886547735, -0.07813433332697829, 0.012521938737336313, 0.031190094063416697, 0.11147531984114231, -0.07591997605273858, -0.29494745005369905, 0.3292444656209017, -0.04890012125850682, 0.19885654653458354, 0.010718792838675793, 0.14194184998856285, -0.004821532945453118, 0.05712673576691976, 0.09565928346203761, -0.1508670455853532, 0.061841315058140583, 0.2505861282585941, 0.1492592333133171, 0.2442870569345989, -0.30402281276810056, -0.20270692887536895, 0.18249239643270043, 0.1015190523135411, 0.0037044227266540895, -0.01260032556344343, -0.21292178212136675, 0.17272330854421641, -0.06333658903783473, -0.052412695487594016, -0.055948904513990365, 0.13336757901169433, -0.015620570998670211, -0.31994267968520246, -0.02398115460975812, 0.09427753993524955, 0.0003165492425278689, -0.004341701713341395, -0.15316160606184545, 0.0017294384440622078, 0.08217169594774112, -0.03778301680722507, 0.18228843235724176, 0.021086891806379963, -0.07038141855390187, -0.11893075744872196, 0.36968836368088465, -0.05935801810119301, -0.2176394057840718, 0.12934307024373154, -0.1672112930268318, -0.1220942903847362, 0.15619449325514814, 0.16967536491350843, 0.15060132818717437, -0.05028580722109137, 0.1810999542587804, -0.05407228021235474, 0.18867189533193596, 0.1625597435654177, 0.0889176652434309, 0.0704356092431296, 0.12286758255952289, 0.1829638985028186, 0.10300884153212582, -0.04243023572109031, 0.0205570675531747, -0.31966556276893243, -0.1578845118235152, -0.19094080678377606, 0.13999091349139164, -0.2071473569954273, -0.17673650956175363, 0.27679565408923806, 0.03139442372776102, 0.31132758368487257, 0.1225672941834021, 0.2479518371138301, 0.01619396293482658, 0.06911215450628123, 0.20939397980691865, 0.10189366776145246, 0.0783977732868292, -0.05773047235001846, -0.08702951914137184, 0.058506204742186055, 0.09678836754308297] |
1,802.07968 | High-pressure phase diagram of hydrogen and deuterium sulfides from
first principles: structural and vibrational properties including quantum and
anharmonic effects | We study the structural and vibrational properties of the high-temperature
superconducting sulfur trihydride and trideuteride in the high-pressure
$Im\bar{3}m$ and $R3m$ phases by first-principles density-functional-theory
calculations. On lowering pressure, the rhombohedral transition $Im\bar{3}m
\rightarrow R3m$ is expected, with hydrogen bond desymmetrization and
occurrence of trigonal lattice distortion. In hydrostatic conditions we find
that, contrary to what suggested in some recent experiments, if the
rhombohedral distortion exists it affects mainly the hydrogen-bonds, whereas
the resulting cell distortion is minimal. We estimate that the occurrence of a
stress anisotropy of approximately $10\%$ could explain this discrepancy.
Assuming hydrostatic conditions, we calculate the critical pressure at which
the rhombohedral transition occurs. Quantum and anharmonic effects, which are
relevant in this system, are included at nonperturbative level with the
stochastic self-consistent harmonic approximation (SSCHA). Within this
approach, we determine the transition pressure by calculating the free energy
Hessian. We find that quantum anharmonic effects are responsible for a strong
reduction of the critical pressure with respect to the one obtained with the
classical harmonic approach. Moreover, we observe a prominent isotope effect,
as we estimate higher pressure transition for D${}_3$S than for H${}_3$S.
Finally, within SSCHA we calculate the anharmonic phonon spectral functions in
the $Im\bar{3}m$ phase. The strong anharmonicity of the system is confirmed by
the occurrence of very large anharmonic broadenings leading to complex
non-Lorentzian line shapes. However, for the vibrational spectra at zone
center, accessible e.g. by infrared spectroscopy, the broadenings are very
small (linewidth at most around 2~meV) and anharmonic phonon quasiparticles are
well defined.
| cond-mat.mtrl-sci | we study the structural and vibrational properties of the hightemperature superconducting sulfur trihydride and trideuteride in the highpressure imbar3m and r3m phases by firstprinciples densityfunctionaltheory calculations on lowering pressure the rhombohedral transition imbar3m rightarrow r3m is expected with hydrogen bond desymmetrization and occurrence of trigonal lattice distortion in hydrostatic conditions we find that contrary to what suggested in some recent experiments if the rhombohedral distortion exists it affects mainly the hydrogenbonds whereas the resulting cell distortion is minimal we estimate that the occurrence of a stress anisotropy of approximately 10 could explain this discrepancy assuming hydrostatic conditions we calculate the critical pressure at which the rhombohedral transition occurs quantum and anharmonic effects which are relevant in this system are included at nonperturbative level with the stochastic selfconsistent harmonic approximation sscha within this approach we determine the transition pressure by calculating the free energy hessian we find that quantum anharmonic effects are responsible for a strong reduction of the critical pressure with respect to the one obtained with the classical harmonic approach moreover we observe a prominent isotope effect as we estimate higher pressure transition for d_3s than for h_3s finally within sscha we calculate the anharmonic phonon spectral functions in the imbar3m phase the strong anharmonicity of the system is confirmed by the occurrence of very large anharmonic broadenings leading to complex nonlorentzian line shapes however for the vibrational spectra at zone center accessible eg by infrared spectroscopy the broadenings are very small linewidth at most around 2mev and anharmonic phonon quasiparticles are well defined | [['we', 'study', 'the', 'structural', 'and', 'vibrational', 'properties', 'of', 'the', 'hightemperature', 'superconducting', 'sulfur', 'trihydride', 'and', 'trideuteride', 'in', 'the', 'highpressure', 'imbar3m', 'and', 'r3m', 'phases', 'by', 'firstprinciples', 'densityfunctionaltheory', 'calculations', 'on', 'lowering', 'pressure', 'the', 'rhombohedral', 'transition', 'imbar3m', 'rightarrow', 'r3m', 'is', 'expected', 'with', 'hydrogen', 'bond', 'desymmetrization', 'and', 'occurrence', 'of', 'trigonal', 'lattice', 'distortion', 'in', 'hydrostatic', 'conditions', 'we', 'find', 'that', 'contrary', 'to', 'what', 'suggested', 'in', 'some', 'recent', 'experiments', 'if', 'the', 'rhombohedral', 'distortion', 'exists', 'it', 'affects', 'mainly', 'the', 'hydrogenbonds', 'whereas', 'the', 'resulting', 'cell', 'distortion', 'is', 'minimal', 'we', 'estimate', 'that', 'the', 'occurrence', 'of', 'a', 'stress', 'anisotropy', 'of', 'approximately', '10', 'could', 'explain', 'this', 'discrepancy', 'assuming', 'hydrostatic', 'conditions', 'we', 'calculate', 'the', 'critical', 'pressure', 'at', 'which', 'the', 'rhombohedral', 'transition', 'occurs', 'quantum', 'and', 'anharmonic', 'effects', 'which', 'are', 'relevant', 'in', 'this', 'system', 'are', 'included', 'at', 'nonperturbative', 'level', 'with', 'the', 'stochastic', 'selfconsistent', 'harmonic', 'approximation', 'sscha', 'within', 'this', 'approach', 'we', 'determine', 'the', 'transition', 'pressure', 'by', 'calculating', 'the', 'free', 'energy', 'hessian', 'we', 'find', 'that', 'quantum', 'anharmonic', 'effects', 'are', 'responsible', 'for', 'a', 'strong', 'reduction', 'of', 'the', 'critical', 'pressure', 'with', 'respect', 'to', 'the', 'one', 'obtained', 'with', 'the', 'classical', 'harmonic', 'approach', 'moreover', 'we', 'observe', 'a', 'prominent', 'isotope', 'effect', 'as', 'we', 'estimate', 'higher', 'pressure', 'transition', 'for', 'd_3s', 'than', 'for', 'h_3s', 'finally', 'within', 'sscha', 'we', 'calculate', 'the', 'anharmonic', 'phonon', 'spectral', 'functions', 'in', 'the', 'imbar3m', 'phase', 'the', 'strong', 'anharmonicity', 'of', 'the', 'system', 'is', 'confirmed', 'by', 'the', 'occurrence', 'of', 'very', 'large', 'anharmonic', 'broadenings', 'leading', 'to', 'complex', 'nonlorentzian', 'line', 'shapes', 'however', 'for', 'the', 'vibrational', 'spectra', 'at', 'zone', 'center', 'accessible', 'eg', 'by', 'infrared', 'spectroscopy', 'the', 'broadenings', 'are', 'very', 'small', 'linewidth', 'at', 'most', 'around', '2mev', 'and', 'anharmonic', 'phonon', 'quasiparticles', 'are', 'well', 'defined']] | [-0.1259155363088847, 0.2022184856653598, -0.037933495402010894, 0.04489649800835029, -0.014242627353052654, -0.09487595141769224, 0.0971149082114506, 0.40403193158433875, -0.2492021990562087, -0.2537337788965069, 0.027913576332918768, -0.3192589736602727, -0.13529643775490557, 0.14993391666258316, 0.052219295472327974, 0.016042789749686592, -0.011328347478642144, 0.005128614563820144, -0.11253054872744657, -0.17348169594530075, 0.29495641215896556, 0.08374298624564996, 0.27657447794326656, 0.10647722379681432, 0.01548151184235596, -0.04922908632637238, 0.07650980009098671, 0.01984610221725667, -0.20111577681564086, 0.05677512026990631, 0.23988881904543155, -0.053536085175379874, 0.21369397439873808, -0.4001218922776244, -0.22332765859408982, 0.06568658549989027, 0.0963120953963967, 0.15708831558373595, -0.04589794456195603, -0.23572561328506303, 0.0698011186410902, -0.11707299976750085, -0.13662650483283437, -0.11993730288656754, -0.010219958825184712, -0.002083833450414536, -0.22074607254970552, 0.142547696844549, 0.01824427042332005, 0.10491234556531477, -0.118685465703334, -0.1354724433971107, -0.08496197100081075, 0.04108873892405499, 0.0338633268977338, 0.029912178237975155, 0.1760111972911372, -0.06366920921284454, -0.03220269304519105, 0.4522586659646578, -0.07282446115884038, -0.05905793728085146, 0.14710435614226355, -0.20972240240215406, -0.14178810323152455, 0.20758108370604791, 0.09156996253526785, 0.06589701744641865, -0.10802323264735085, 0.06406897717453022, 0.04450049226868451, 0.15847363999290837, 0.09612978918622025, 0.03446359465306159, 0.19207359763926693, 0.1338992604234215, 0.025398254087786117, 0.15417403763618379, -0.12332666228942958, -0.08189253412216665, -0.26199495003351736, -0.12075068581745857, -0.18007529593933935, 0.037996551349005175, -0.09072043527980679, -0.1870730991756159, 0.3382670715902119, 0.11862798119511267, 0.17997255992506528, -0.019693605371728717, 0.251057395820565, 0.1580707049948932, 0.07640233947093956, 0.03792856936897373, 0.2861088485673434, 0.15826424814128717, 0.060303066105079205, -0.3346201262117127, 0.05731468649335309, 0.02330991819811364] |
1,802.07969 | The continuous coagulation and nonlinear multiple fragmentation equation | The present paper deals with the existence and uniqueness of global classical
solutions to the continuous coagulation and nonlinear multiple fragmentation
equations for large classes of unbounded coagulation, collision and breakup
kernels. In addition, it is shown that solutions are mass conserving. The
coagulation and breakup kernels may have singularities on both the co-ordinate
axes whereas the collision kernel grows up to bilinearity.
| math.AP | the present paper deals with the existence and uniqueness of global classical solutions to the continuous coagulation and nonlinear multiple fragmentation equations for large classes of unbounded coagulation collision and breakup kernels in addition it is shown that solutions are mass conserving the coagulation and breakup kernels may have singularities on both the coordinate axes whereas the collision kernel grows up to bilinearity | [['the', 'present', 'paper', 'deals', 'with', 'the', 'existence', 'and', 'uniqueness', 'of', 'global', 'classical', 'solutions', 'to', 'the', 'continuous', 'coagulation', 'and', 'nonlinear', 'multiple', 'fragmentation', 'equations', 'for', 'large', 'classes', 'of', 'unbounded', 'coagulation', 'collision', 'and', 'breakup', 'kernels', 'in', 'addition', 'it', 'is', 'shown', 'that', 'solutions', 'are', 'mass', 'conserving', 'the', 'coagulation', 'and', 'breakup', 'kernels', 'may', 'have', 'singularities', 'on', 'both', 'the', 'coordinate', 'axes', 'whereas', 'the', 'collision', 'kernel', 'grows', 'up', 'to', 'bilinearity']] | [-0.14011821991741835, 0.08180451782656804, -0.0819167794349293, 0.08104480482039175, -0.058044824453573375, -0.07167643148984228, -0.09779403198118662, 0.329568609122246, -0.28586007231876015, -0.21482878574539746, 0.12734642067539786, -0.28625786064990927, -0.05944524276705961, 0.11712402138592941, -0.007999889892599886, 0.14712783314346795, 0.1256310778950888, -0.04060941981890845, -0.06749681259564583, -0.22907001717341324, 0.4235433000509465, 0.014504196137071603, 0.18531573275547653, 0.09193176479773625, 0.10250010550583875, -0.0224783893245908, -0.033970634645176315, -0.026176797107808174, -0.15706091486936202, 0.055226924304392126, 0.21286341484399543, 0.05336056664467804, 0.26644465350915514, -0.4299740145308158, -0.19815478710428117, 0.1209208940466245, 0.18994756027435264, 0.10836406819391182, -0.03410267220285263, -0.25257873644549694, 0.08310687926317019, -0.17827172046675097, -0.17108283378922987, -0.09454968209481901, 0.07690290596690916, 0.1256105997377918, -0.3036564472353175, 0.11142959667458421, 0.10002816614088794, -0.02491058441366823, -0.14781836710781568, -0.07976409968816572, -0.04082664671457476, 0.03357422594276686, 0.09283364156911535, -0.019383774338556186, 0.1159720259999472, -0.13254169577230063, -0.0769039225128908, 0.34272309404516976, -0.02669968575771366, -0.24626033821157992, 0.32857937416032196, -0.15576903912283124, -0.09545828873986408, 0.20817286148667336, 0.22023802326016484, 0.16371944704137387, -0.17179661195370413, 0.09163597838524433, -0.020062914362088555, 0.11250603518315724, 0.16878315900260257, -0.014766877997548335, 0.10336903988250665, 0.14449783883220146, 0.0719703668913257, 0.10731048558262132, -0.05753513157740974, -0.1963791057674421, -0.3288256042823565, -0.14307125916128002, -0.10940188478441938, 0.03185366630731594, -0.12570015999529185, -0.1795704745154436, 0.3219295536714887, 0.0961452200722378, 0.22729864313326303, 0.11917373058312232, 0.22596503081657585, 0.15859715814983089, 0.09401912549658427, 0.12133755642432897, 0.21740840147766802, 0.1276088850831406, 0.15297435496800713, -0.25268345587103375, 0.0938354668148335, 0.09665635658339375] |
1,802.0797 | The exterior derivative of the Lee form of almost Hermitian manifolds | The exterior derivative $d \theta$ of the Lee form $\theta$ of almost
Hermitian manifolds is studied. If $\omega$ is the K\"ahler two-form, it is
proved that the $\mathbb{R}\omega$-component of $d\theta$ is always zero.
expressions for the other components, in $[\lambda_0^{1,1}]$ and in $[[
\lambda^{2,0} ]]$, of $d\theta$ are also obtained. They are given in terms of
the intrinsic torsion. Likewise, it is described some interrelations between
the Lee form and $U(n)$-components of the Riemannian curvature tensor.
| math.DG | the exterior derivative d theta of the lee form theta of almost hermitian manifolds is studied if omega is the kahler twoform it is proved that the mathbbromegacomponent of dtheta is always zero expressions for the other components in lambda_011 and in lambda20 of dtheta are also obtained they are given in terms of the intrinsic torsion likewise it is described some interrelations between the lee form and uncomponents of the riemannian curvature tensor | [['the', 'exterior', 'derivative', 'd', 'theta', 'of', 'the', 'lee', 'form', 'theta', 'of', 'almost', 'hermitian', 'manifolds', 'is', 'studied', 'if', 'omega', 'is', 'the', 'kahler', 'twoform', 'it', 'is', 'proved', 'that', 'the', 'mathbbromegacomponent', 'of', 'dtheta', 'is', 'always', 'zero', 'expressions', 'for', 'the', 'other', 'components', 'in', 'lambda_011', 'and', 'in', 'lambda20', 'of', 'dtheta', 'are', 'also', 'obtained', 'they', 'are', 'given', 'in', 'terms', 'of', 'the', 'intrinsic', 'torsion', 'likewise', 'it', 'is', 'described', 'some', 'interrelations', 'between', 'the', 'lee', 'form', 'and', 'uncomponents', 'of', 'the', 'riemannian', 'curvature', 'tensor']] | [-0.22734306048287053, 0.1274134978442125, -0.0776472704035794, 0.06428164373722557, -0.10308484310730243, -0.15813620500004208, -0.10337970809827388, 0.34980066598091325, -0.2537328036843051, -0.22307474431122692, 0.1002706627141763, -0.29788550603347763, -0.19758482198690025, 0.16944906849276378, -0.06070437924411725, -0.010207283789370681, -0.025352572897632777, 0.1402352317433122, -0.09452423015707763, -0.2771543244713209, 0.3764701003969555, -0.005079616740031142, 0.1841617367479583, 0.08514682800364747, 0.10301991025458129, -0.06946568523572993, -0.032193437021907786, -0.0015191790700273614, -0.13236233508462353, 0.10559001810271555, 0.2294885954412986, 0.08380824731479228, 0.14196205442905768, -0.3273205851781851, -0.15017685556495694, 0.1358214350102443, 0.09333661786267455, -0.027050436985954433, 0.044082892069947234, -0.26442325549383816, 0.11577471445353937, -0.0933905305926242, -0.1577033309370909, -0.07687843051857092, 0.1086450751057603, 0.004803463393612437, -0.2412675689433662, 0.08198024211148075, 0.11639557506652995, 0.026132447723771483, -0.07843154601254304, -0.16887919490658482, -0.08991019588462273, 0.09351518192053052, 0.07354132390030148, 0.10469708397564753, 0.043825438069048483, -0.11681080818779661, -0.011623701041328236, 0.36452266987098353, -0.09042956188163707, -0.31208327005971487, 0.07334453910326874, -0.1849102326865557, -0.09226541198842542, 0.08992449825097833, 0.04119320741762787, 0.152987016601042, -0.09414744484697429, 0.21807860914778873, -0.05138334673894963, 0.06658239821365601, 0.16240400861633916, 0.0009401265964646574, 0.13144698084502573, 0.035857652222186745, 0.08169959644484907, 0.09649548669506362, -0.016439792739463523, -0.10234477470340339, -0.3642834359911126, -0.18509450764067367, -0.19406351529088028, 0.12580506667547242, -0.13518804398940837, -0.17399610045142996, 0.3372465092885557, -0.005529268704187519, 0.1865979020006653, 0.07629501512667662, 0.22905531643666852, 0.12700761678385955, 0.04618080498808077, 0.10658831416930951, 0.2616796094393784, 0.23927882072371495, 0.04893878577145892, -0.16396038126016796, 0.012781632500110378, 0.08233955520874178] |
1,802.07971 | Robustness of classifiers to uniform $\ell\_p$ and Gaussian noise | We study the robustness of classifiers to various kinds of random noise
models. In particular, we consider noise drawn uniformly from the $\ell\_p$
ball for $p \in [1, \infty]$ and Gaussian noise with an arbitrary covariance
matrix. We characterize this robustness to random noise in terms of the
distance to the decision boundary of the classifier. This analysis applies to
linear classifiers as well as classifiers with locally approximately flat
decision boundaries, a condition which is satisfied by state-of-the-art deep
neural networks. The predicted robustness is verified experimentally.
| cs.LG cs.CV stat.ML | we study the robustness of classifiers to various kinds of random noise models in particular we consider noise drawn uniformly from the ell_p ball for p in 1 infty and gaussian noise with an arbitrary covariance matrix we characterize this robustness to random noise in terms of the distance to the decision boundary of the classifier this analysis applies to linear classifiers as well as classifiers with locally approximately flat decision boundaries a condition which is satisfied by stateoftheart deep neural networks the predicted robustness is verified experimentally | [['we', 'study', 'the', 'robustness', 'of', 'classifiers', 'to', 'various', 'kinds', 'of', 'random', 'noise', 'models', 'in', 'particular', 'we', 'consider', 'noise', 'drawn', 'uniformly', 'from', 'the', 'ell_p', 'ball', 'for', 'p', 'in', '1', 'infty', 'and', 'gaussian', 'noise', 'with', 'an', 'arbitrary', 'covariance', 'matrix', 'we', 'characterize', 'this', 'robustness', 'to', 'random', 'noise', 'in', 'terms', 'of', 'the', 'distance', 'to', 'the', 'decision', 'boundary', 'of', 'the', 'classifier', 'this', 'analysis', 'applies', 'to', 'linear', 'classifiers', 'as', 'well', 'as', 'classifiers', 'with', 'locally', 'approximately', 'flat', 'decision', 'boundaries', 'a', 'condition', 'which', 'is', 'satisfied', 'by', 'stateoftheart', 'deep', 'neural', 'networks', 'the', 'predicted', 'robustness', 'is', 'verified', 'experimentally']] | [-0.07965477537800325, 0.07461996616372991, -0.03235950390808284, 0.07738604891875928, -0.009557882345027545, -0.18928208656672557, 0.03831006511410868, 0.4297638842412694, -0.29588166366077284, -0.23329326237779408, 0.10830645632152235, -0.2623065513220023, -0.19209696269403634, 0.13570533860233394, -0.14575405041052197, 0.15322175296023488, 0.04377580288432496, 0.07358430016955192, -0.070680177167312, -0.3121419889582533, 0.3469139835453296, 0.06237741034518959, 0.30879828884181654, -0.0580051657743752, 0.08699707510955208, 0.01112855759195306, -0.011702595299787143, 0.044981420011026785, -0.10196487593930215, 0.08913116364750419, 0.28884606508046834, 0.12063622108491306, 0.31081813969649374, -0.34263798577541654, -0.23466123245783488, 0.16599327261263336, 0.09458207564470782, 0.09496961764075836, 0.033708414513967, -0.3468748274396851, 0.1271569424610458, -0.110578379816037, -0.10124198395483704, -0.10731970557191578, -0.027072947527110293, 0.03282924685150978, -0.33026274999561295, 0.04831776583821259, 0.13504786674721717, 0.03975909067296677, -0.05694674181656658, -0.13691586862445215, 0.010555366955073127, 0.11549632283012298, 0.0322945312403714, 0.026372786894419485, 0.12862174755851316, -0.13158412893905982, -0.1365414880829948, 0.32562878785062244, -0.09657504948237064, -0.26812947235091333, 0.18735621191180227, -0.09639335170240057, -0.11397535615568896, 0.08558851114304905, 0.23116858951239425, 0.07909739875784991, -0.1636727423597635, 0.07328117198498645, -0.02465681099750906, 0.15138058589019981, 0.08087404488204894, 0.00984342421129854, 0.11897368940778753, 0.20165866367592986, 0.07483807323627513, 0.21251066167711874, -0.11360110710004599, -0.05087840802628885, -0.2954458088338883, -0.06585695779226212, -0.22318120913273146, 0.053304319287152874, -0.16117553838342824, -0.20341692578089846, 0.3418134615375576, 0.18903938509439203, 0.23754838156640867, 0.15165711833635048, 0.30602260842517187, 0.09942267211524515, 0.02004734107123857, 0.09480803182073445, 0.18766463442377493, 0.1747853033779062, 0.03695847926957702, -0.15376870210060256, 0.07604910908478567, 0.025510275874032894] |
1,802.07972 | Thermal Model Description of p--Pb Collisions at $\sqrt{s_{NN}} $ = 5.02
TeV | The ALICE data on light flavor hadron production obtained in $p-Pb$
collisions at $\sqrt{s_{NN}} $ = 5.02 TeV are studied in the thermal model
using the canonical approach with exact strangeness conservation. The chemical
freeze-out temperature is independent of centrality except for the lowest
multiplicity bin, with values close to 160 MeV but consistent with those
obtained in $Pb-Pb$ collisions at $\sqrt{s_{NN}}$ = 2.76 TeV. The value of the
strangeness non-equilibrium factor $\gamma_s$ is slowly increasing with
multiplicity from 0.9 to 0.96, i.e. it is always very close to full chemical
equilibrium.
| hep-ph nucl-th | the alice data on light flavor hadron production obtained in ppb collisions at sqrts_nn 502 tev are studied in the thermal model using the canonical approach with exact strangeness conservation the chemical freezeout temperature is independent of centrality except for the lowest multiplicity bin with values close to 160 mev but consistent with those obtained in pbpb collisions at sqrts_nn 276 tev the value of the strangeness nonequilibrium factor gamma_s is slowly increasing with multiplicity from 09 to 096 ie it is always very close to full chemical equilibrium | [['the', 'alice', 'data', 'on', 'light', 'flavor', 'hadron', 'production', 'obtained', 'in', 'ppb', 'collisions', 'at', 'sqrts_nn', '502', 'tev', 'are', 'studied', 'in', 'the', 'thermal', 'model', 'using', 'the', 'canonical', 'approach', 'with', 'exact', 'strangeness', 'conservation', 'the', 'chemical', 'freezeout', 'temperature', 'is', 'independent', 'of', 'centrality', 'except', 'for', 'the', 'lowest', 'multiplicity', 'bin', 'with', 'values', 'close', 'to', '160', 'mev', 'but', 'consistent', 'with', 'those', 'obtained', 'in', 'pbpb', 'collisions', 'at', 'sqrts_nn', '276', 'tev', 'the', 'value', 'of', 'the', 'strangeness', 'nonequilibrium', 'factor', 'gamma_s', 'is', 'slowly', 'increasing', 'with', 'multiplicity', 'from', '09', 'to', '096', 'ie', 'it', 'is', 'always', 'very', 'close', 'to', 'full', 'chemical', 'equilibrium']] | [-0.040785144245398516, 0.2532103209431921, -0.15043922151135428, 0.10621937794814912, 0.07091979310537815, -0.17423047707677725, -0.058472417106621724, 0.3453659579115972, -0.1757952565787716, -0.35589909300291805, -0.09140590559351101, -0.434971329892117, 0.18554795849440472, 0.1122391541995987, 0.0675186073483397, 0.11233449563416104, 0.13971772993485745, 0.06976864977708358, -0.05223376467154267, -0.21665412723348382, 0.2736490033357666, 0.16064478966585372, 0.19913301896303892, 0.17863044005117557, 0.04231612999750866, 0.01786234045762234, 0.028991629885577627, 0.014777433781183503, -0.1780275520293063, 0.0048350693319212604, 0.30914593782809596, 0.0029124524528546564, 0.12550057569686113, -0.2726961698257521, -0.10767332404810057, 0.17100854135338175, 0.10513342860196664, 0.08177608882045645, -0.06313846498895227, -0.23122851858229448, 0.17689823385264614, -0.23070634833767256, -0.187410413496866, 0.007315187040046694, 0.03489433492669899, 0.032261206799846016, -0.2908145609636153, 0.20975180194200424, -0.09159620598042278, 0.14215134981799912, -0.05978233428290009, -0.29014090634359235, -0.14993885673289553, -0.03384537322530418, 0.08689361914411564, 0.14694437188923024, 0.20735265815818912, -0.10450351201887295, -0.10677064571979591, 0.4075022160567427, 0.028300504995447198, -0.09933211937483945, 0.1918430422757114, -0.23036763282346256, -0.17335833399818185, 0.1748840311081724, 0.1945895997053954, 0.045350061975461375, -0.2319603603898307, 0.021187613804542114, -0.003385317313034883, 0.22226202001878886, 0.11814033157935136, 0.05832614557388542, 0.1766991800827424, 0.20269507674102702, 0.0025623570826804535, 0.060528214434894284, -0.07216644036227816, -0.1354897903236613, -0.37150918127278265, -0.01550815451571069, -0.14559486087704643, 0.08235014645576351, -0.16761551021462243, 0.014622974973381235, 0.34007465929378955, 0.11199161687112424, 0.3350468020404825, 0.007970334114402199, 0.2751184261163299, 0.12265226442701696, 0.027074538354416578, 0.15894644425428484, 0.29405744034755094, 0.17069694920432535, 0.2961793890631015, -0.25480992837516026, 0.0017426491746406877, 0.04523643038204212] |
1,802.07973 | On higher dimensional singularities for the fractional Yamabe problem: a
non-local Mazzeo-Pacard program | We consider the problem of constructing solutions to the fractional Yamabe
problem that are singular at a given smooth sub-manifold, and we establish the
classical gluing method of Mazzeo and Pacard for the scalar curvature in the
fractional setting. This proof is based on the analysis of the model linearized
operator, which amounts to the study of an ODE, and thus our main contribution
here is the development of new methods coming from conformal geometry and
scattering theory for the study of non-local ODEs. No traditional phase-plane
analysis is available here. Instead, first, we provide a rigorous construction
of radial fast-decaying solutions by a blow-up argument and a bifurcation
method. Second, we use conformal geometry to rewrite this non-local ODE, giving
a hint of what a non-local phase-plane analysis should be. Third, for the
linear theory, we examine a fractional Schr\"{o}dinger equation with a Hardy
type critical potential. We construct its Green's function, deduce Fredholm
properties, and analyze its asymptotics at the singular points in the spirit of
Frobenius method. Surprisingly enough, a fractional linear ODE may still have a
two-dimensional kernel as in the second order case.
| math.AP | we consider the problem of constructing solutions to the fractional yamabe problem that are singular at a given smooth submanifold and we establish the classical gluing method of mazzeo and pacard for the scalar curvature in the fractional setting this proof is based on the analysis of the model linearized operator which amounts to the study of an ode and thus our main contribution here is the development of new methods coming from conformal geometry and scattering theory for the study of nonlocal odes no traditional phaseplane analysis is available here instead first we provide a rigorous construction of radial fastdecaying solutions by a blowup argument and a bifurcation method second we use conformal geometry to rewrite this nonlocal ode giving a hint of what a nonlocal phaseplane analysis should be third for the linear theory we examine a fractional schrodinger equation with a hardy type critical potential we construct its greens function deduce fredholm properties and analyze its asymptotics at the singular points in the spirit of frobenius method surprisingly enough a fractional linear ode may still have a twodimensional kernel as in the second order case | [['we', 'consider', 'the', 'problem', 'of', 'constructing', 'solutions', 'to', 'the', 'fractional', 'yamabe', 'problem', 'that', 'are', 'singular', 'at', 'a', 'given', 'smooth', 'submanifold', 'and', 'we', 'establish', 'the', 'classical', 'gluing', 'method', 'of', 'mazzeo', 'and', 'pacard', 'for', 'the', 'scalar', 'curvature', 'in', 'the', 'fractional', 'setting', 'this', 'proof', 'is', 'based', 'on', 'the', 'analysis', 'of', 'the', 'model', 'linearized', 'operator', 'which', 'amounts', 'to', 'the', 'study', 'of', 'an', 'ode', 'and', 'thus', 'our', 'main', 'contribution', 'here', 'is', 'the', 'development', 'of', 'new', 'methods', 'coming', 'from', 'conformal', 'geometry', 'and', 'scattering', 'theory', 'for', 'the', 'study', 'of', 'nonlocal', 'odes', 'no', 'traditional', 'phaseplane', 'analysis', 'is', 'available', 'here', 'instead', 'first', 'we', 'provide', 'a', 'rigorous', 'construction', 'of', 'radial', 'fastdecaying', 'solutions', 'by', 'a', 'blowup', 'argument', 'and', 'a', 'bifurcation', 'method', 'second', 'we', 'use', 'conformal', 'geometry', 'to', 'rewrite', 'this', 'nonlocal', 'ode', 'giving', 'a', 'hint', 'of', 'what', 'a', 'nonlocal', 'phaseplane', 'analysis', 'should', 'be', 'third', 'for', 'the', 'linear', 'theory', 'we', 'examine', 'a', 'fractional', 'schrodinger', 'equation', 'with', 'a', 'hardy', 'type', 'critical', 'potential', 'we', 'construct', 'its', 'greens', 'function', 'deduce', 'fredholm', 'properties', 'and', 'analyze', 'its', 'asymptotics', 'at', 'the', 'singular', 'points', 'in', 'the', 'spirit', 'of', 'frobenius', 'method', 'surprisingly', 'enough', 'a', 'fractional', 'linear', 'ode', 'may', 'still', 'have', 'a', 'twodimensional', 'kernel', 'as', 'in', 'the', 'second', 'order', 'case']] | [-0.12285468934916277, -0.005993132932068894, -0.13546194756116242, 0.0848501662487174, -0.125920559616482, -0.13504886276465147, -0.003130218650689943, 0.26605377280886505, -0.2809793386122886, -0.22053501400303968, 0.14438660151171598, -0.29343399985079116, -0.19760319267577947, 0.17953143691262627, -0.05658416200845324, 0.07071827984219319, 0.03872005410611312, 0.03709991296961968, -0.10817683954287241, -0.20727947892923343, 0.38716135603720025, -0.022708564616511873, 0.1976761335997466, 0.049271178407039734, 0.09420541819789388, -0.016525713061824678, -0.03788755160627609, -0.004748683393080818, -0.18794739600339877, 0.14800333449316083, 0.23916137108004631, 0.052039306253526714, 0.3038504130821279, -0.41024349860728104, -0.20536089079572814, 0.1161551092407032, 0.12631771832882882, 0.13944158901180576, -0.033235913906847075, -0.28440617578119, 0.0820696997682891, -0.118963870921784, -0.21964833784620574, -0.09943498196724326, -0.0012368323439930348, 0.0028585181299081827, -0.25471302982855665, 0.09405337143540779, 0.09558375905629525, 0.056430439068440426, -0.09502949624104386, -0.05993976405365987, -0.010934872658021668, 0.04872024291878606, 0.03257024373259752, 0.015873976450591805, 0.052049135005639055, -0.10396336473058909, -0.09950926794702722, 0.3392574265320597, -0.09832762809534695, -0.2521373728584954, 0.12847104978851698, -0.12053689952355195, -0.14071804239226388, 0.08478354339418497, 0.1604578244286847, 0.1771665228867626, -0.16160878406817766, 0.13705613472600506, -0.05230726262906249, 0.14077310537067342, 0.06860421277196245, -0.01616801360951479, 0.12747175210809453, 0.14960122865159065, 0.12487419487962975, 0.15163976086013792, -0.0380767884234956, -0.12124153257451674, -0.3794220075348115, -0.1835090199529077, -0.17496373691283998, 0.11441205520903633, -0.11934893888726637, -0.21348294296098794, 0.4031358733376924, 0.12040380843586233, 0.1706856177615725, 0.09887036279975833, 0.2560275529035704, 0.19182299826501006, 0.014450391719831115, 0.04705200399869082, 0.20929076559123325, 0.17212530233689208, 0.13927361132958507, -0.21120819320160392, -0.010729320490351343, 0.19861779554915476] |
1,802.07974 | Evolution in complex objects | This paper describes work carried out on a model for the evolution of graph
classes in complex objects. By defining evolution rules and propagation
strategies on graph classes, we aim to define a user-definable means to manage
data evolution model which tackles the complex nature of the classes managed,
using the concepts defined in object systems. So, depending on their needs and
on those of the targeted application, designers can choose the evolution
mechanism they consider to suit them best. They can either create new
evolutions or reuse predefined ones to respond to a given need.
| cs.SE | this paper describes work carried out on a model for the evolution of graph classes in complex objects by defining evolution rules and propagation strategies on graph classes we aim to define a userdefinable means to manage data evolution model which tackles the complex nature of the classes managed using the concepts defined in object systems so depending on their needs and on those of the targeted application designers can choose the evolution mechanism they consider to suit them best they can either create new evolutions or reuse predefined ones to respond to a given need | [['this', 'paper', 'describes', 'work', 'carried', 'out', 'on', 'a', 'model', 'for', 'the', 'evolution', 'of', 'graph', 'classes', 'in', 'complex', 'objects', 'by', 'defining', 'evolution', 'rules', 'and', 'propagation', 'strategies', 'on', 'graph', 'classes', 'we', 'aim', 'to', 'define', 'a', 'userdefinable', 'means', 'to', 'manage', 'data', 'evolution', 'model', 'which', 'tackles', 'the', 'complex', 'nature', 'of', 'the', 'classes', 'managed', 'using', 'the', 'concepts', 'defined', 'in', 'object', 'systems', 'so', 'depending', 'on', 'their', 'needs', 'and', 'on', 'those', 'of', 'the', 'targeted', 'application', 'designers', 'can', 'choose', 'the', 'evolution', 'mechanism', 'they', 'consider', 'to', 'suit', 'them', 'best', 'they', 'can', 'either', 'create', 'new', 'evolutions', 'or', 'reuse', 'predefined', 'ones', 'to', 'respond', 'to', 'a', 'given', 'need']] | [-0.09901018682194263, 0.06170188470665986, -0.07771091840307538, 0.08957613204256631, -0.1646011555373358, -0.12732062710468503, 0.0723565257806816, 0.407466799292403, -0.2906133834573363, -0.3684296599822119, 0.1008904269086391, -0.23825643518406045, -0.15607350201025838, 0.16172311807410247, -0.09991086827358231, 0.037725764501374215, 0.04879026492320312, 0.016364879309548996, -0.046310796788020525, -0.2612780014709036, 0.38762412932798423, 0.036977811716496944, 0.25360065339676413, -0.020811528008683428, 0.06406314205742092, 0.0033384062262484804, -0.08250261292171975, 0.013057774068632474, -0.12347392925585154, 0.12817234469791097, 0.267985465832074, 0.1937895892576004, 0.2741460424294928, -0.4391214273964579, -0.20409760831777626, 0.13032844723784365, 0.1537122490760036, 0.0811149795226811, 0.022932589568275336, -0.2790487268042246, 0.08521233516269906, -0.15190719096184088, -0.12475890663821095, -0.10600893438095227, -0.019179280774551444, 0.03443212912437351, -0.23889976334370053, -0.0817646565992618, 0.05239606648683548, 0.024500619147147518, -0.05386096045549493, -0.04838486363587435, 0.005899272492873327, 0.18693516103424676, -0.02383689183140329, -0.021973329736889962, 0.14507379950858498, -0.125374583263086, -0.14066191126282016, 0.41978562747438747, -0.0050412473083270015, -0.2627835316598066, 0.2344073445359148, -0.05583359286386743, -0.1481918974701936, 0.048380188262550895, 0.23571437282468347, 0.13555951621674467, -0.17903934739297256, 0.03260968892694412, 0.03990222692179183, 0.16186197839973224, 0.05619673062271128, -0.00011697663770367701, 0.24366318130099293, 0.16491478050981337, 0.030486999016526777, 0.13360972265460683, 0.014451992040449113, -0.09415589253573368, -0.2487604865261043, -0.09654976478608053, -0.13790725676032403, 0.04892198977177031, -0.018971527236317343, -0.1416792835892314, 0.430827381099031, 0.18059939023320717, 0.19014984039464858, 0.043000579048869746, 0.24829693586555854, 0.0618142628033335, 0.10171343829279067, 0.09429799473825067, 0.15776606951840222, 0.04219223394223567, 0.1283954037450409, -0.16450540137399608, 0.10983821640062767, 0.04715305731224362] |
1,802.07975 | Options for encoding names for data linking at the Australian Bureau of
Statistics | Publicly, ABS has said it would use a cryptographic hash function to convert
names collected in the 2016 Census of Population and Housing into an
unrecognisable value in a way that is not reversible. In 2016, the ABS engaged
the University of Melbourne to provide expert advice on cryptographic hash
functions to meet this objective.
For complex unit-record level data, including Census data, auxiliary data can
be often be used to link individual records, even without names. This is the
basis of ABS's existing bronze linking. This means that records can probably be
re-identified without the encoded name anyway. Protection against
re-identification depends on good processes within ABS.
The undertaking on the encoding of names should therefore be considered in
the full context of auxiliary data and ABS processes. There are several
reasonable interpretations:
1. That the encoding cannot be reversed except with a secret key held by ABS.
This is the property achieved by encryption (Option 1), if properly
implemented;
2. That the encoding, taken alone without auxiliary data, cannot be reversed
to a single value. This is the property achieved by lossy encoding (Option 2),
if properly implemented;
3. That the encoding doesn't make re-identification easier, or increase the
number of records that can be re-identified, except with a secret key held by
ABS. This is the property achieved by HMAC-based linkage key derivation using
subsets of attributes (Option 3), if properly implemented.
We explain and compare the privacy and accuracy guarantees of five possible
approaches. Options 4 and 5 investigate more sophisticated options for future
data linking. We also explain how some commonly-advocated techniques can be
reversed, and hence should not be used.
| cs.CR | publicly abs has said it would use a cryptographic hash function to convert names collected in the 2016 census of population and housing into an unrecognisable value in a way that is not reversible in 2016 the abs engaged the university of melbourne to provide expert advice on cryptographic hash functions to meet this objective for complex unitrecord level data including census data auxiliary data can be often be used to link individual records even without names this is the basis of abss existing bronze linking this means that records can probably be reidentified without the encoded name anyway protection against reidentification depends on good processes within abs the undertaking on the encoding of names should therefore be considered in the full context of auxiliary data and abs processes there are several reasonable interpretations 1 that the encoding cannot be reversed except with a secret key held by abs this is the property achieved by encryption option 1 if properly implemented 2 that the encoding taken alone without auxiliary data cannot be reversed to a single value this is the property achieved by lossy encoding option 2 if properly implemented 3 that the encoding doesnt make reidentification easier or increase the number of records that can be reidentified except with a secret key held by abs this is the property achieved by hmacbased linkage key derivation using subsets of attributes option 3 if properly implemented we explain and compare the privacy and accuracy guarantees of five possible approaches options 4 and 5 investigate more sophisticated options for future data linking we also explain how some commonlyadvocated techniques can be reversed and hence should not be used | [['publicly', 'abs', 'has', 'said', 'it', 'would', 'use', 'a', 'cryptographic', 'hash', 'function', 'to', 'convert', 'names', 'collected', 'in', 'the', '2016', 'census', 'of', 'population', 'and', 'housing', 'into', 'an', 'unrecognisable', 'value', 'in', 'a', 'way', 'that', 'is', 'not', 'reversible', 'in', '2016', 'the', 'abs', 'engaged', 'the', 'university', 'of', 'melbourne', 'to', 'provide', 'expert', 'advice', 'on', 'cryptographic', 'hash', 'functions', 'to', 'meet', 'this', 'objective', 'for', 'complex', 'unitrecord', 'level', 'data', 'including', 'census', 'data', 'auxiliary', 'data', 'can', 'be', 'often', 'be', 'used', 'to', 'link', 'individual', 'records', 'even', 'without', 'names', 'this', 'is', 'the', 'basis', 'of', 'abss', 'existing', 'bronze', 'linking', 'this', 'means', 'that', 'records', 'can', 'probably', 'be', 'reidentified', 'without', 'the', 'encoded', 'name', 'anyway', 'protection', 'against', 'reidentification', 'depends', 'on', 'good', 'processes', 'within', 'abs', 'the', 'undertaking', 'on', 'the', 'encoding', 'of', 'names', 'should', 'therefore', 'be', 'considered', 'in', 'the', 'full', 'context', 'of', 'auxiliary', 'data', 'and', 'abs', 'processes', 'there', 'are', 'several', 'reasonable', 'interpretations', '1', 'that', 'the', 'encoding', 'can', 'not', 'be', 'reversed', 'except', 'with', 'a', 'secret', 'key', 'held', 'by', 'abs', 'this', 'is', 'the', 'property', 'achieved', 'by', 'encryption', 'option', '1', 'if', 'properly', 'implemented', '2', 'that', 'the', 'encoding', 'taken', 'alone', 'without', 'auxiliary', 'data', 'can', 'not', 'be', 'reversed', 'to', 'a', 'single', 'value', 'this', 'is', 'the', 'property', 'achieved', 'by', 'lossy', 'encoding', 'option', '2', 'if', 'properly', 'implemented', '3', 'that', 'the', 'encoding', 'doesnt', 'make', 'reidentification', 'easier', 'or', 'increase', 'the', 'number', 'of', 'records', 'that', 'can', 'be', 'reidentified', 'except', 'with', 'a', 'secret', 'key', 'held', 'by', 'abs', 'this', 'is', 'the', 'property', 'achieved', 'by', 'hmacbased', 'linkage', 'key', 'derivation', 'using', 'subsets', 'of', 'attributes', 'option', '3', 'if', 'properly', 'implemented', 'we', 'explain', 'and', 'compare', 'the', 'privacy', 'and', 'accuracy', 'guarantees', 'of', 'five', 'possible', 'approaches', 'options', '4', 'and', '5', 'investigate', 'more', 'sophisticated', 'options', 'for', 'future', 'data', 'linking', 'we', 'also', 'explain', 'how', 'some', 'commonlyadvocated', 'techniques', 'can', 'be', 'reversed', 'and', 'hence', 'should', 'not', 'be', 'used']] | [-0.1006526480015071, 0.06428851801103024, -0.09487748640843413, 0.12440924220252782, -0.11041022838855331, -0.20555241180583836, 0.09357219652061097, 0.3837356944043528, -0.2604424374468032, -0.33716000814160163, 0.14362002000382001, -0.25806840617887, -0.07750545726200057, 0.21243535939604044, -0.1278196597852829, 0.025625140094621614, 0.06533933400261131, 0.032700006028065796, -0.005195225609402934, -0.32917609119068153, 0.30581631812817334, 0.05156136037951166, 0.29000882935075256, 0.02885282565754923, 0.07896039931823245, 0.01482598654163832, -0.040043773678216064, 0.008219303634356369, -0.07225042698550334, 0.09943753987212073, 0.33030510477467695, 0.20257236549186267, 0.2739335125786337, -0.43105506240644237, -0.1614499610315331, 0.10587172997088849, 0.1531941643983803, 0.09706304771402342, -0.04386861821028023, -0.2856060756082562, 0.09509903467239135, -0.18529218019917607, -0.09334955171258612, -0.08955097950994968, -0.009069730163636533, -0.001619802053001794, -0.26747483418746426, -0.002026195729638196, 0.039040144240822305, 0.049581877081231636, -0.00014243881302801044, -0.10289120606824079, -0.03223780655217442, 0.18785065442620014, -0.007529967556792226, 0.0599098388847514, 0.10056945378638127, -0.10131751107305965, -0.1403028448336673, 0.364194628842683, -0.03246339841322465, -0.19897250372122718, 0.1312660032205961, -0.08469354597682302, -0.14846872795542532, 0.09816180417483503, 0.14091817300174048, 0.05140406225045974, -0.20673909426412798, 0.03284891280557283, -0.040835933835161, 0.254078626611524, 0.07648927659050307, 0.025531479585915805, 0.2012869583307342, 0.12925291706215253, 0.024790822961790995, 0.0829746967041865, -0.05640504449351945, -0.05724748381265354, -0.26768771199763497, -0.1426369125912474, -0.1875291756807234, 0.041777931714472784, -0.040514005582716145, -0.10109681484374133, 0.3384362311220982, 0.17928151133724235, 0.16904058028943836, 0.0009097833258353851, 0.3018122370812026, 0.08818272398446093, 0.12721435979008675, 0.10463241877965629, 0.18489638924016616, 0.0012422081980515611, 0.0773677898418497, -0.13155162386638536, 0.15820275929756464, 0.01339202290316197] |
1,802.07976 | Algorithmic Boundedness-From-Below Conditions for Generic Scalar
Potentials | Checking that a scalar potential is bounded from below (BFB) is an ubiquitous
and notoriously difficult task in many models with extended scalar sectors.
Exact analytic BFB conditions are known only in simple cases. In this work, we
present a novel approach to algorithmically establish the BFB conditions for
any polynomial scalar potential. The method relies on elements of multivariate
algebra, in particular, on resultants and on the spectral theory of tensors,
which is being developed by the mathematical community. We give first a
pedagogical introduction to this approach, illustrate it with elementary
examples, and then present the working Mathematica implementation publicly
available at GitHub. Due to the rapidly increasing complexity of the problem,
we have not yet produced ready-to-use analytical BFB conditions for new
multi-scalar cases. But we are confident that the present implementation can be
dramatically improved and may eventually lead to such results.
| hep-ph hep-th | checking that a scalar potential is bounded from below bfb is an ubiquitous and notoriously difficult task in many models with extended scalar sectors exact analytic bfb conditions are known only in simple cases in this work we present a novel approach to algorithmically establish the bfb conditions for any polynomial scalar potential the method relies on elements of multivariate algebra in particular on resultants and on the spectral theory of tensors which is being developed by the mathematical community we give first a pedagogical introduction to this approach illustrate it with elementary examples and then present the working mathematica implementation publicly available at github due to the rapidly increasing complexity of the problem we have not yet produced readytouse analytical bfb conditions for new multiscalar cases but we are confident that the present implementation can be dramatically improved and may eventually lead to such results | [['checking', 'that', 'a', 'scalar', 'potential', 'is', 'bounded', 'from', 'below', 'bfb', 'is', 'an', 'ubiquitous', 'and', 'notoriously', 'difficult', 'task', 'in', 'many', 'models', 'with', 'extended', 'scalar', 'sectors', 'exact', 'analytic', 'bfb', 'conditions', 'are', 'known', 'only', 'in', 'simple', 'cases', 'in', 'this', 'work', 'we', 'present', 'a', 'novel', 'approach', 'to', 'algorithmically', 'establish', 'the', 'bfb', 'conditions', 'for', 'any', 'polynomial', 'scalar', 'potential', 'the', 'method', 'relies', 'on', 'elements', 'of', 'multivariate', 'algebra', 'in', 'particular', 'on', 'resultants', 'and', 'on', 'the', 'spectral', 'theory', 'of', 'tensors', 'which', 'is', 'being', 'developed', 'by', 'the', 'mathematical', 'community', 'we', 'give', 'first', 'a', 'pedagogical', 'introduction', 'to', 'this', 'approach', 'illustrate', 'it', 'with', 'elementary', 'examples', 'and', 'then', 'present', 'the', 'working', 'mathematica', 'implementation', 'publicly', 'available', 'at', 'github', 'due', 'to', 'the', 'rapidly', 'increasing', 'complexity', 'of', 'the', 'problem', 'we', 'have', 'not', 'yet', 'produced', 'readytouse', 'analytical', 'bfb', 'conditions', 'for', 'new', 'multiscalar', 'cases', 'but', 'we', 'are', 'confident', 'that', 'the', 'present', 'implementation', 'can', 'be', 'dramatically', 'improved', 'and', 'may', 'eventually', 'lead', 'to', 'such', 'results']] | [-0.07480478402680067, 0.08054589691393681, -0.0716470372448484, 0.08465278735910606, -0.12180962603162872, -0.16836837110785793, 0.029355417784743574, 0.37821451001098916, -0.22753722890127093, -0.296662699907208, 0.14373876944771163, -0.22372385743472803, -0.18818233777132612, 0.2346422064615643, -0.07360793050850602, 0.03774262015860885, 0.08986738695897009, 0.04901558403180887, -0.040781410557715454, -0.2789033427930195, 0.285319276688276, 0.042680102891658675, 0.21666808847388994, 0.11122236587107182, 0.06567607661517821, -0.03804779204552713, -0.04446166187520011, -0.0016504422016611262, -0.14995170686896714, 0.12348562395375554, 0.2774077912433799, 0.1683912091180427, 0.24146101614205193, -0.43403297884721465, -0.1431550402481313, 0.10871388050424548, 0.1696363958778906, 0.14541220035936606, -0.07025852008429292, -0.28203999404221364, 0.11215773521131542, -0.18193350185652915, -0.12864621592468697, -0.1628783209460081, 0.019442266430578208, -0.039564007669942426, -0.2813973643542714, 0.0536681232010716, 0.0313661691734399, 0.06880755297048655, -0.030580985509154182, -0.13580985312120453, 0.035208349279606435, 0.08357558231992163, 0.04903026789662824, 0.024533318738414817, 0.09424265017669188, -0.1087877928464329, -0.08952687914110083, 0.3664807721347331, -0.045816488296099724, -0.2367014546227986, 0.20821941807572666, -0.0881167545831724, -0.1826958999768129, 0.10542253210139142, 0.18735304518207296, 0.13414463921041828, -0.17005759313039176, 0.13395070501328893, -0.0344642992131412, 0.15297425282586444, 0.04104473696039249, -0.013591457539467677, 0.17783686685158986, 0.13068979507637504, 0.035155387594897225, 0.15831524487792145, 0.020816753004447953, -0.07376939655370908, -0.3217930776252067, -0.1432425495610279, -0.15859844122773312, 0.02020048736269691, -0.06087070184860264, -0.17577278454571146, 0.3891764453258238, 0.17752104801881727, 0.1440190950548914, 0.08966584858577858, 0.30937602067659675, 0.1204079852251285, 0.05000951323516297, 0.08098759859033274, 0.20473450982356317, 0.12623619315794937, 0.09976367552307026, -0.1393296010871992, 0.048175874778567114, 0.04123620923051582] |
1,802.07977 | AFLOW-SYM: Platform for the complete, automatic and self-consistent
symmetry analysis of crystals | Determination of the symmetry profile of structures is a persistent challenge
in materials science. Results often vary amongst standard packages, hindering
autonomous materials development by requiring continuous user attention and
educated guesses. Here, we present a robust procedure for evaluating the
complete suite of symmetry properties, featuring various representations for
the point-, factor-, space groups, site symmetries, and Wyckoff positions. The
protocol determines a system-specific mapping tolerance that yields symmetry
operations entirely commensurate with fundamental crystallographic principles.
The self consistent tolerance characterizes the effective spatial resolution of
the reported atomic positions. The approach is compared with the most used
programs and is successfully validated against the space group information
provided for over 54,000 entries in the Inorganic Crystal Structure Database.
Subsequently, a complete symmetry analysis is applied to all 1.7$+$ million
entries of the AFLOW data repository. The AFLOW-SYM package has been
implemented in, and made available for, public use through the automated,
$\textit{ab-initio}$ framework AFLOW.
| cond-mat.mtrl-sci | determination of the symmetry profile of structures is a persistent challenge in materials science results often vary amongst standard packages hindering autonomous materials development by requiring continuous user attention and educated guesses here we present a robust procedure for evaluating the complete suite of symmetry properties featuring various representations for the point factor space groups site symmetries and wyckoff positions the protocol determines a systemspecific mapping tolerance that yields symmetry operations entirely commensurate with fundamental crystallographic principles the self consistent tolerance characterizes the effective spatial resolution of the reported atomic positions the approach is compared with the most used programs and is successfully validated against the space group information provided for over 54000 entries in the inorganic crystal structure database subsequently a complete symmetry analysis is applied to all 17 million entries of the aflow data repository the aflowsym package has been implemented in and made available for public use through the automated textitabinitio framework aflow | [['determination', 'of', 'the', 'symmetry', 'profile', 'of', 'structures', 'is', 'a', 'persistent', 'challenge', 'in', 'materials', 'science', 'results', 'often', 'vary', 'amongst', 'standard', 'packages', 'hindering', 'autonomous', 'materials', 'development', 'by', 'requiring', 'continuous', 'user', 'attention', 'and', 'educated', 'guesses', 'here', 'we', 'present', 'a', 'robust', 'procedure', 'for', 'evaluating', 'the', 'complete', 'suite', 'of', 'symmetry', 'properties', 'featuring', 'various', 'representations', 'for', 'the', 'point', 'factor', 'space', 'groups', 'site', 'symmetries', 'and', 'wyckoff', 'positions', 'the', 'protocol', 'determines', 'a', 'systemspecific', 'mapping', 'tolerance', 'that', 'yields', 'symmetry', 'operations', 'entirely', 'commensurate', 'with', 'fundamental', 'crystallographic', 'principles', 'the', 'self', 'consistent', 'tolerance', 'characterizes', 'the', 'effective', 'spatial', 'resolution', 'of', 'the', 'reported', 'atomic', 'positions', 'the', 'approach', 'is', 'compared', 'with', 'the', 'most', 'used', 'programs', 'and', 'is', 'successfully', 'validated', 'against', 'the', 'space', 'group', 'information', 'provided', 'for', 'over', '54000', 'entries', 'in', 'the', 'inorganic', 'crystal', 'structure', 'database', 'subsequently', 'a', 'complete', 'symmetry', 'analysis', 'is', 'applied', 'to', 'all', '17', 'million', 'entries', 'of', 'the', 'aflow', 'data', 'repository', 'the', 'aflowsym', 'package', 'has', 'been', 'implemented', 'in', 'and', 'made', 'available', 'for', 'public', 'use', 'through', 'the', 'automated', 'textitabinitio', 'framework', 'aflow']] | [-0.11805654318642712, 0.0510928918247021, -0.06869662694835794, 0.027071500978162213, -0.0950911321106457, -0.13622131125040113, 0.06293413508833656, 0.42635335412717634, -0.24234674354609584, -0.33955377187399616, 0.10284195450780492, -0.26667954917216014, -0.09706955525663591, 0.18684117410692477, -0.01282487368932174, 0.07896197358889866, 0.06822683481319297, 0.004670540378579209, -0.06704682681067366, -0.23030249011823006, 0.26966738986872857, 0.0659036300295303, 0.3505340051056156, -0.003281857932527219, 0.0967483838366705, 0.040404071882667564, -0.06971340304120413, 0.0046427510915354134, -0.12288185114124527, 0.1425983740557586, 0.28229186043834253, 0.12826274051556302, 0.23831083127447675, -0.4058804071718647, -0.18428811057425676, 0.03123414800652573, 0.10131913172343986, 0.13177423407924513, -0.08017477875034655, -0.3040591873649147, 0.08517495793921333, -0.1789162548183794, -0.1413566197349874, -0.12386629990407176, -0.0007711375672971049, -0.01882604582595729, -0.23074104478770507, 0.023780158299374424, -0.013686232443057722, 0.14498382905918744, -0.06750896471071868, -0.1237393323271986, -0.036449612869933666, 0.1612267141936407, 0.0043308509303437125, 0.029753172307485535, 0.15754581479010202, -0.09481408666338652, -0.12942988132614822, 0.4373878914487338, 0.00010030022822320462, -0.15181835120724094, 0.15624836535162984, -0.07709743801744715, -0.18078452005621887, 0.16442818565053804, 0.13581576672074716, 0.07825953889442908, -0.1700885787129312, 0.10503515298778732, -0.004630855641763417, 0.22028230090584275, 0.013844999196683808, 0.01667371969294524, 0.17856959894059166, 0.18126156001742327, 0.020631472808459114, 0.09775984674962537, -0.04803488755959176, -0.0797553375092966, -0.2539860207827822, -0.14967442850203014, -0.17720199134726558, -0.021469027950849023, -0.06902558786396477, -0.14677058732167125, 0.41862009180889975, 0.141551479725768, 0.12861726477201427, 0.00645227738085293, 0.28052506569412444, 0.0033171556694733518, 0.12820379266275034, 0.06054776923190201, 0.17727421778103997, 0.09310867026478292, 0.07643258633737963, -0.162870558077139, 0.10447074947277865, 0.046792413994309404] |
1,802.07978 | Cambrian acyclic domains: counting $c$-singletons | We study the size of certain acyclic domains that arise from geometric and
combinatorial constructions. These acyclic domains consist of all permutations
visited by commuting equivalence classes of maximal reduced decompositions if
we consider the symmetric group and, more generally, of all c-singletons of a
Cambrian lattice associated to the weak order of a finite Coxeter group. For
this reason, we call these sets Cambrian acyclic domains. Extending a closed
formula of Galambos--Reiner for a particular acyclic domain called Fishburn's
alternating scheme, we provide explicit formulae for the size of any Cambrian
acyclic domain and characterize the Cambrian acyclic domains of minimum or
maximum size.
| math.CO | we study the size of certain acyclic domains that arise from geometric and combinatorial constructions these acyclic domains consist of all permutations visited by commuting equivalence classes of maximal reduced decompositions if we consider the symmetric group and more generally of all csingletons of a cambrian lattice associated to the weak order of a finite coxeter group for this reason we call these sets cambrian acyclic domains extending a closed formula of galambosreiner for a particular acyclic domain called fishburns alternating scheme we provide explicit formulae for the size of any cambrian acyclic domain and characterize the cambrian acyclic domains of minimum or maximum size | [['we', 'study', 'the', 'size', 'of', 'certain', 'acyclic', 'domains', 'that', 'arise', 'from', 'geometric', 'and', 'combinatorial', 'constructions', 'these', 'acyclic', 'domains', 'consist', 'of', 'all', 'permutations', 'visited', 'by', 'commuting', 'equivalence', 'classes', 'of', 'maximal', 'reduced', 'decompositions', 'if', 'we', 'consider', 'the', 'symmetric', 'group', 'and', 'more', 'generally', 'of', 'all', 'csingletons', 'of', 'a', 'cambrian', 'lattice', 'associated', 'to', 'the', 'weak', 'order', 'of', 'a', 'finite', 'coxeter', 'group', 'for', 'this', 'reason', 'we', 'call', 'these', 'sets', 'cambrian', 'acyclic', 'domains', 'extending', 'a', 'closed', 'formula', 'of', 'galambosreiner', 'for', 'a', 'particular', 'acyclic', 'domain', 'called', 'fishburns', 'alternating', 'scheme', 'we', 'provide', 'explicit', 'formulae', 'for', 'the', 'size', 'of', 'any', 'cambrian', 'acyclic', 'domain', 'and', 'characterize', 'the', 'cambrian', 'acyclic', 'domains', 'of', 'minimum', 'or', 'maximum', 'size']] | [-0.18407402189754352, 0.1672130713491688, 0.005423020891041732, 0.07416514812982367, -0.15833379422296204, -0.08913327914242651, 0.06435104796672057, 0.39613348837969276, -0.3592381386597659, -0.23892156729091177, 0.13538920620511122, -0.21105526358930066, -0.1321699171915979, 0.15473853187480321, -0.12771749839771027, -0.04484983373378568, 0.09046773839623247, 0.09039931923097373, -0.09886538255473258, -0.2665639761766857, 0.3858014014115849, -0.11572627429667787, 0.24646765109626392, 0.03359114509829156, 0.11627305831358421, 0.061361528435429816, -0.06467951464868497, 0.08859615512740086, -0.1963711229599379, 0.17961597648750552, 0.2931358981512341, 0.14611075005914068, 0.18160375459210984, -0.4207379506928298, -0.14988097943840364, 0.23320991457348653, 0.11955145312194694, 0.11159392701023642, -0.0018731862788520042, -0.23061640160477848, 0.140982965352105, -0.2074101379745544, -0.14520134979530291, 0.0026602937780576302, 0.10110903622619077, 0.06936465482930561, -0.2566730668403062, -0.018186200164742403, 0.1540340011638096, 0.121424687341513, -0.060409541470089964, -0.10981865887365796, -0.012373817404366884, 0.12394307510397744, -0.06160226949677784, -0.008175939300974064, 0.01026599015584033, -0.08735622675158083, -0.20651290136590308, 0.36183816483061687, 0.05339192797534862, -0.19636291505166276, 0.14546852075385258, -0.11120622184620622, -0.1801500323675938, 0.13511749127350164, 0.13845202893785694, 0.1511359903710328, -0.08067775215478797, 0.11707959051857994, -0.16383792399702704, 0.07653361768347632, 0.137206980438136, 0.014405554110257356, 0.12875997331267333, 0.1073083481226372, 0.1377329231860737, 0.2233669266798625, 0.04125413450574521, -0.06220444052379724, -0.3090352921052745, -0.12576776441168405, -0.13905468356896045, 0.0701533529505718, -0.20011987829282446, -0.24251689224083925, 0.3902386034025018, 0.09893906483079727, 0.1712232542055312, 0.1275391630878599, 0.1775859313943953, 0.03422690719347812, 0.0895496349252176, 0.07632616984968384, 0.03627651873245543, 0.21260310500613688, -0.04545652374294792, -0.1623823954837908, 0.06863050911959041, 0.18150164138562247] |
1,802.07979 | Nautilus multi-grain model: Importance of cosmic-ray-induced desorption
in determining the chemical abundances in the ISM | Species abundances in the interstellar medium (ISM) strongly depend on the
chemistry occurring at the surfaces of the dust grains. To describe the
complexity of the chemistry, various numerical models have been constructed. In
most of these models, the grains are described by a single size of 0.1$\mu$m.
We study the impact on the abundances of many species observed in the cold
cores by considering several grain sizes in the Nautilus multi-grain model. We
used grain sizes with radii in the range of $0.005\mu$m to $0.25\mu$m. We
sampled this range in many bins. We used the previously published, MRN and WD
grain size distributions to calculate the number density of grains in each bin.
Other parameters such as the grain surface temperature or the
cosmic-ray-induced desorption rates also vary with grain sizes. We present the
abundances of various molecules in the gas phase and also on the dust surface
at different time intervals during the simulation. We present a comparative
study of results obtained using the single grain and the multi-grain models. We
also compare our results with the observed abundances in TMC-1 and L134N
clouds. We show that the grain size, the grain size dependent surface
temperature and the peak surface temperature induced by cosmic ray collisions,
play key roles in determining the ice and the gas phase abundances of various
molecules. We also show that the differences between the MRN and the WD models
are crucial for better fitting the observed abundances in different regions in
the ISM. We show that the small grains play a very important role in the
enrichment of the gas phase with the species which are mainly formed on the
grain surface, as non-thermal desorption induced by collisions of cosmic ray
particles is very efficient on the small grains.
| astro-ph.GA astro-ph.IM astro-ph.SR | species abundances in the interstellar medium ism strongly depend on the chemistry occurring at the surfaces of the dust grains to describe the complexity of the chemistry various numerical models have been constructed in most of these models the grains are described by a single size of 01mum we study the impact on the abundances of many species observed in the cold cores by considering several grain sizes in the nautilus multigrain model we used grain sizes with radii in the range of 0005mum to 025mum we sampled this range in many bins we used the previously published mrn and wd grain size distributions to calculate the number density of grains in each bin other parameters such as the grain surface temperature or the cosmicrayinduced desorption rates also vary with grain sizes we present the abundances of various molecules in the gas phase and also on the dust surface at different time intervals during the simulation we present a comparative study of results obtained using the single grain and the multigrain models we also compare our results with the observed abundances in tmc1 and l134n clouds we show that the grain size the grain size dependent surface temperature and the peak surface temperature induced by cosmic ray collisions play key roles in determining the ice and the gas phase abundances of various molecules we also show that the differences between the mrn and the wd models are crucial for better fitting the observed abundances in different regions in the ism we show that the small grains play a very important role in the enrichment of the gas phase with the species which are mainly formed on the grain surface as nonthermal desorption induced by collisions of cosmic ray particles is very efficient on the small grains | [['species', 'abundances', 'in', 'the', 'interstellar', 'medium', 'ism', 'strongly', 'depend', 'on', 'the', 'chemistry', 'occurring', 'at', 'the', 'surfaces', 'of', 'the', 'dust', 'grains', 'to', 'describe', 'the', 'complexity', 'of', 'the', 'chemistry', 'various', 'numerical', 'models', 'have', 'been', 'constructed', 'in', 'most', 'of', 'these', 'models', 'the', 'grains', 'are', 'described', 'by', 'a', 'single', 'size', 'of', '01mum', 'we', 'study', 'the', 'impact', 'on', 'the', 'abundances', 'of', 'many', 'species', 'observed', 'in', 'the', 'cold', 'cores', 'by', 'considering', 'several', 'grain', 'sizes', 'in', 'the', 'nautilus', 'multigrain', 'model', 'we', 'used', 'grain', 'sizes', 'with', 'radii', 'in', 'the', 'range', 'of', '0005mum', 'to', '025mum', 'we', 'sampled', 'this', 'range', 'in', 'many', 'bins', 'we', 'used', 'the', 'previously', 'published', 'mrn', 'and', 'wd', 'grain', 'size', 'distributions', 'to', 'calculate', 'the', 'number', 'density', 'of', 'grains', 'in', 'each', 'bin', 'other', 'parameters', 'such', 'as', 'the', 'grain', 'surface', 'temperature', 'or', 'the', 'cosmicrayinduced', 'desorption', 'rates', 'also', 'vary', 'with', 'grain', 'sizes', 'we', 'present', 'the', 'abundances', 'of', 'various', 'molecules', 'in', 'the', 'gas', 'phase', 'and', 'also', 'on', 'the', 'dust', 'surface', 'at', 'different', 'time', 'intervals', 'during', 'the', 'simulation', 'we', 'present', 'a', 'comparative', 'study', 'of', 'results', 'obtained', 'using', 'the', 'single', 'grain', 'and', 'the', 'multigrain', 'models', 'we', 'also', 'compare', 'our', 'results', 'with', 'the', 'observed', 'abundances', 'in', 'tmc1', 'and', 'l134n', 'clouds', 'we', 'show', 'that', 'the', 'grain', 'size', 'the', 'grain', 'size', 'dependent', 'surface', 'temperature', 'and', 'the', 'peak', 'surface', 'temperature', 'induced', 'by', 'cosmic', 'ray', 'collisions', 'play', 'key', 'roles', 'in', 'determining', 'the', 'ice', 'and', 'the', 'gas', 'phase', 'abundances', 'of', 'various', 'molecules', 'we', 'also', 'show', 'that', 'the', 'differences', 'between', 'the', 'mrn', 'and', 'the', 'wd', 'models', 'are', 'crucial', 'for', 'better', 'fitting', 'the', 'observed', 'abundances', 'in', 'different', 'regions', 'in', 'the', 'ism', 'we', 'show', 'that', 'the', 'small', 'grains', 'play', 'a', 'very', 'important', 'role', 'in', 'the', 'enrichment', 'of', 'the', 'gas', 'phase', 'with', 'the', 'species', 'which', 'are', 'mainly', 'formed', 'on', 'the', 'grain', 'surface', 'as', 'nonthermal', 'desorption', 'induced', 'by', 'collisions', 'of', 'cosmic', 'ray', 'particles', 'is', 'very', 'efficient', 'on', 'the', 'small', 'grains']] | [-0.04041280863802659, 0.1817137433024581, -0.057974100187105145, 0.042522985656879904, 0.048567922849413324, -0.02381214970659654, 0.016955181211035824, 0.41909538818112874, -0.22583914229338514, -0.3449982606632225, 0.026984808874569076, -0.2632783635629941, -0.034970409657522024, 0.16760820752578015, -0.012657840267786661, 0.014467886930836713, 0.03548953820588965, -0.09279004952917665, -0.028929694464935336, -0.27276891889208454, 0.3256117011092887, 0.10402748904711867, 0.21523589320417683, 0.07356932010576603, 0.025947375117477536, -0.10551950796586225, -0.04816827094655926, 0.013346422586779472, -0.21412736283794295, 0.08548438057039028, 0.20990709066691896, 0.05365864078482708, 0.13926462513883991, -0.47677617015601215, -0.28043536331733465, 0.09610225325923855, 0.1289082993666436, 0.10273925398586918, -0.09036670228963622, -0.20423805826280456, 0.024932390075153278, -0.1251380894668558, -0.13544289607365254, 0.04948988852359481, 0.04269120454851349, 0.059267697353468485, -0.21973333843585136, 0.0857795175325749, 0.01911818203437379, 0.07372527353512913, -0.0934845675169727, -0.1869131172652025, -0.0864898349454437, 0.11832803720193993, 0.03739696964818858, -0.02626243628466786, 0.2213689662374051, -0.11545628879566566, 0.00429741473892167, 0.428108863756692, -0.09658251677923915, -0.10442346310464003, 0.25484532334099885, -0.2001525889103443, -0.16949748060650238, 0.1626175442055436, 0.18466429033166712, 0.12437877096551454, -0.1379332259044809, 0.02519470427002288, -0.03759232474198975, 0.1714368160214212, 0.08222369684648337, 0.03255655130971286, 0.25090970165901266, 0.16932965696520977, -0.014086955708404214, 0.12150756682533675, -0.18886691554433713, -0.08175711011577208, -0.2369490733733243, -0.166487547030704, -0.16152791919865472, -0.015894583722189763, -0.16437217099873264, -0.14408532004108873, 0.3335397153003615, 0.15906996086725209, 0.2534818049883312, 5.3315254133510385e-05, 0.2646387359316824, 0.05955288437929131, 0.08438037289622224, 0.08991280071816202, 0.21805600749518153, 0.12505873217547345, 0.09366025532856267, -0.292392672505427, 0.15846980139534225, 0.02169401327905766] |
1,802.0798 | Learning to Route with Sparse Trajectory Sets---Extended Version | Motivated by the increasing availability of vehicle trajectory data, we
propose learn-to-route, a comprehensive trajectory-based routing solution.
Specifically, we first construct a graph-like structure from trajectories as
the routing infrastructure. Second, we enable trajectory-based routing given an
arbitrary (source, destination) pair.
In the first step, given a road network and a collection of trajectories, we
propose a trajectory-based clustering method that identifies regions in a road
network. If a pair of regions are connected by trajectories, we maintain the
paths used by these trajectories and learn a routing preference for travel
between the regions. As trajectories are skewed and sparse, many region pairs
are not connected by trajectories. We thus transfer routing preferences from
region pairs with sufficient trajectories to such region pairs and then use the
transferred preferences to identify paths between the regions. In the second
step, we exploit the above graph-like structure to achieve a comprehensive
trajectory-based routing solution. Empirical studies with two substantial
trajectory data sets offer insight into the proposed solution, indicating that
it is practical. A comparison with a leading routing service offers evidence
that the paper's proposal is able to enhance routing quality.
This is an extended version of "Learning to Route with Sparse Trajectory
Sets" [1], to appear in IEEE ICDE 2018.
| cs.LG | motivated by the increasing availability of vehicle trajectory data we propose learntoroute a comprehensive trajectorybased routing solution specifically we first construct a graphlike structure from trajectories as the routing infrastructure second we enable trajectorybased routing given an arbitrary source destination pair in the first step given a road network and a collection of trajectories we propose a trajectorybased clustering method that identifies regions in a road network if a pair of regions are connected by trajectories we maintain the paths used by these trajectories and learn a routing preference for travel between the regions as trajectories are skewed and sparse many region pairs are not connected by trajectories we thus transfer routing preferences from region pairs with sufficient trajectories to such region pairs and then use the transferred preferences to identify paths between the regions in the second step we exploit the above graphlike structure to achieve a comprehensive trajectorybased routing solution empirical studies with two substantial trajectory data sets offer insight into the proposed solution indicating that it is practical a comparison with a leading routing service offers evidence that the papers proposal is able to enhance routing quality this is an extended version of learning to route with sparse trajectory sets 1 to appear in ieee icde 2018 | [['motivated', 'by', 'the', 'increasing', 'availability', 'of', 'vehicle', 'trajectory', 'data', 'we', 'propose', 'learntoroute', 'a', 'comprehensive', 'trajectorybased', 'routing', 'solution', 'specifically', 'we', 'first', 'construct', 'a', 'graphlike', 'structure', 'from', 'trajectories', 'as', 'the', 'routing', 'infrastructure', 'second', 'we', 'enable', 'trajectorybased', 'routing', 'given', 'an', 'arbitrary', 'source', 'destination', 'pair', 'in', 'the', 'first', 'step', 'given', 'a', 'road', 'network', 'and', 'a', 'collection', 'of', 'trajectories', 'we', 'propose', 'a', 'trajectorybased', 'clustering', 'method', 'that', 'identifies', 'regions', 'in', 'a', 'road', 'network', 'if', 'a', 'pair', 'of', 'regions', 'are', 'connected', 'by', 'trajectories', 'we', 'maintain', 'the', 'paths', 'used', 'by', 'these', 'trajectories', 'and', 'learn', 'a', 'routing', 'preference', 'for', 'travel', 'between', 'the', 'regions', 'as', 'trajectories', 'are', 'skewed', 'and', 'sparse', 'many', 'region', 'pairs', 'are', 'not', 'connected', 'by', 'trajectories', 'we', 'thus', 'transfer', 'routing', 'preferences', 'from', 'region', 'pairs', 'with', 'sufficient', 'trajectories', 'to', 'such', 'region', 'pairs', 'and', 'then', 'use', 'the', 'transferred', 'preferences', 'to', 'identify', 'paths', 'between', 'the', 'regions', 'in', 'the', 'second', 'step', 'we', 'exploit', 'the', 'above', 'graphlike', 'structure', 'to', 'achieve', 'a', 'comprehensive', 'trajectorybased', 'routing', 'solution', 'empirical', 'studies', 'with', 'two', 'substantial', 'trajectory', 'data', 'sets', 'offer', 'insight', 'into', 'the', 'proposed', 'solution', 'indicating', 'that', 'it', 'is', 'practical', 'a', 'comparison', 'with', 'a', 'leading', 'routing', 'service', 'offers', 'evidence', 'that', 'the', 'papers', 'proposal', 'is', 'able', 'to', 'enhance', 'routing', 'quality', 'this', 'is', 'an', 'extended', 'version', 'of', 'learning', 'to', 'route', 'with', 'sparse', 'trajectory', 'sets', '1', 'to', 'appear', 'in', 'ieee', 'icde', '2018']] | [-0.15709448484681618, 0.028746124480780812, -0.10360455463315098, 0.04347705616143367, -0.0929631104149174, -0.14280508553306237, 0.1098197082650255, 0.45040707376620703, -0.27837459978304413, -0.3168843960897489, 0.03894857587359632, -0.29622339388649715, -0.16188824714638256, 0.1541563294622958, -0.10008500358153861, 0.06340688234195113, 0.12046588434554797, 0.021541523078732798, 0.0045245280032576414, -0.2099374203283215, 0.3085158418822375, 0.028138449047937206, 0.3131050515839714, 0.03808449808303178, 0.10656759890273178, 0.003929544990251741, -0.01817376684491037, 0.04512947545226432, -0.11831454653066609, 0.1712669121122665, 0.28996340188523084, 0.20473442712807627, 0.2938208537305478, -0.41429459940838187, -0.2257837695270135, 0.10369835527832108, 0.1491187995402187, 0.1036634786705081, -0.06292217243106314, -0.32656442449967327, 0.09607425779293617, -0.16532794254582428, -0.08804613354049944, -0.07996322852854604, -0.005552147878289365, 0.035226842417475285, -0.2727301530300475, -0.012031701091246938, -0.008664831037869294, -0.012800678288710022, -0.03917712653913584, -0.016712237029162604, -0.009877403547461524, 0.18567892852680465, 0.004057353007067975, 0.056573404382433044, 0.10658396336775826, -0.10087858734576646, -0.1727170702543457, 0.3901540747660983, 0.0017565578260151536, -0.2125125774472025, 0.15957617216507355, -0.050629090543381834, -0.12370921783238364, 0.14686237108719905, 0.20269927490306527, 0.11745644453662318, -0.18383574278904882, -0.01750930988577386, -0.032840888613041797, 0.14063105041063145, 0.05918729030465903, 0.00976645231634628, 0.19815736481670343, 0.21365713187310684, 0.16680452597865603, 0.1275541220700288, -0.09713672861483608, -0.12956075573397988, -0.27838606655633336, -0.13221452346363474, -0.15260724204538934, 0.0008878041311244048, -0.07618796769902779, -0.1295495590039236, 0.39238773448544256, 0.16039834968282274, 0.262325269800642, 0.07292871847837878, 0.32785273719641367, 0.03934536182904241, 0.03808746613677966, 0.15960839667255014, 0.16638179666543174, 0.03059756206615904, 0.11547791465457403, -0.14000825688875676, 0.09470472620932706, 0.05940133065172431] |
1,802.07981 | Unified Dark Energy and Dark Matter from Dynamical Space Time | A unification of dark matter and dark energy based on a dynamical space time
theory is suggested. By introducing a dynamical space time vector field
$\chi_\mu$ as a Lagrange multiplier, a conservation of an energy momentum
tensor $T^{\mu\nu}_{(\chi)}$ is implemented. This Lagrangian generalizes the
"Unified dark energy and dark matter from a scalar field different from
quintessence" [Phys.RevD 81, 043520 (2010)] which did not consider a Lagrangian
formulation. This generalization allows the solutions which were found
previously, but in addition to that also non singular bouncing solutions that
rapidly approach to the $\Lambda$CDM model. The dynamical time vector field
exactly coincides with the cosmic time for the a $\Lambda$CDM solution and
suffers a slight shift (advances slower) with respect to the cosmic time in the
region close to the bounce for the bouncing non singular solutions. In addition
we introduced some exponential potential which could enter into the
$T^{\mu\nu}_{(\chi)}$ stress energy tensor or coupled directly to the measure
$\sqrt{-g}$, gives a possible interaction between DE and DM and could explain
the coincidence problem.
| gr-qc astro-ph.CO | a unification of dark matter and dark energy based on a dynamical space time theory is suggested by introducing a dynamical space time vector field chi_mu as a lagrange multiplier a conservation of an energy momentum tensor tmunu_chi is implemented this lagrangian generalizes the unified dark energy and dark matter from a scalar field different from quintessence physrevd 81 043520 2010 which did not consider a lagrangian formulation this generalization allows the solutions which were found previously but in addition to that also non singular bouncing solutions that rapidly approach to the lambdacdm model the dynamical time vector field exactly coincides with the cosmic time for the a lambdacdm solution and suffers a slight shift advances slower with respect to the cosmic time in the region close to the bounce for the bouncing non singular solutions in addition we introduced some exponential potential which could enter into the tmunu_chi stress energy tensor or coupled directly to the measure sqrtg gives a possible interaction between de and dm and could explain the coincidence problem | [['a', 'unification', 'of', 'dark', 'matter', 'and', 'dark', 'energy', 'based', 'on', 'a', 'dynamical', 'space', 'time', 'theory', 'is', 'suggested', 'by', 'introducing', 'a', 'dynamical', 'space', 'time', 'vector', 'field', 'chi_mu', 'as', 'a', 'lagrange', 'multiplier', 'a', 'conservation', 'of', 'an', 'energy', 'momentum', 'tensor', 'tmunu_chi', 'is', 'implemented', 'this', 'lagrangian', 'generalizes', 'the', 'unified', 'dark', 'energy', 'and', 'dark', 'matter', 'from', 'a', 'scalar', 'field', 'different', 'from', 'quintessence', 'physrevd', '81', '043520', '2010', 'which', 'did', 'not', 'consider', 'a', 'lagrangian', 'formulation', 'this', 'generalization', 'allows', 'the', 'solutions', 'which', 'were', 'found', 'previously', 'but', 'in', 'addition', 'to', 'that', 'also', 'non', 'singular', 'bouncing', 'solutions', 'that', 'rapidly', 'approach', 'to', 'the', 'lambdacdm', 'model', 'the', 'dynamical', 'time', 'vector', 'field', 'exactly', 'coincides', 'with', 'the', 'cosmic', 'time', 'for', 'the', 'a', 'lambdacdm', 'solution', 'and', 'suffers', 'a', 'slight', 'shift', 'advances', 'slower', 'with', 'respect', 'to', 'the', 'cosmic', 'time', 'in', 'the', 'region', 'close', 'to', 'the', 'bounce', 'for', 'the', 'bouncing', 'non', 'singular', 'solutions', 'in', 'addition', 'we', 'introduced', 'some', 'exponential', 'potential', 'which', 'could', 'enter', 'into', 'the', 'tmunu_chi', 'stress', 'energy', 'tensor', 'or', 'coupled', 'directly', 'to', 'the', 'measure', 'sqrtg', 'gives', 'a', 'possible', 'interaction', 'between', 'de', 'and', 'dm', 'and', 'could', 'explain', 'the', 'coincidence', 'problem']] | [-0.14032598191680495, 0.13166938319550622, -0.14839582156718653, 0.1074634749106789, -0.12193491426433492, -0.13693319563411505, -0.017728513225173468, 0.2731276184430017, -0.2585295538226252, -0.31135115442585254, 0.03741240792099715, -0.22882263477598933, -0.09595343937741264, 0.13278397437020698, -0.0315023434582947, 0.026412808166488128, 0.0007686257677371888, 0.06213517162879511, -0.07609173994329894, -0.22376705107744782, 0.3298237505231929, 0.09807918514741365, 0.23126867531853565, 0.024151366597096272, 0.13483849374632187, -0.03522527478909229, -0.021422155875274365, 0.03144905017449192, -0.15258547499380418, 0.04573207639417994, 0.1866942621387459, 0.09167515090666711, 0.24530147694818238, -0.41353123976732603, -0.25255673226407344, 0.18375372269245632, 0.14105608481913806, 0.12131822298739708, -0.07000079671646851, -0.29076167506658857, 0.034918763076283915, -0.19248759888715167, -0.14390693892286543, -0.06133402538526913, -0.011591312048874576, -0.026576354336130488, -0.2502117265803356, 0.11946193482846652, 0.010580632687881862, -0.06661319989832598, -0.12507780314293032, -0.06479047308949863, -0.011854434872379095, -0.014012460658491096, 0.09807899025515379, 0.08501973095459535, 0.12409879979129662, -0.1305331116049167, -0.08378578734597848, 0.3958018203567275, -0.14080638217753458, -0.19746479143607704, 0.17997021630050286, -0.10345402607036865, -0.0982636649188969, 0.13698998840306612, 0.12062371169038884, 0.08562495054879143, -0.14177193403627505, 0.16870040817234172, -0.009235924334429643, 0.16707726801978423, 0.09376737475395203, -0.016866083552732187, 0.25680969756315736, 0.10470948472399921, 0.07957200049148763, 0.06780170022016939, -0.05373163981061867, -0.15388753708958736, -0.3391214091111632, -0.17405994165250482, -0.1380842965452329, 0.046804167728901926, -0.10970708308219293, -0.16200407857540994, 0.40305022940258767, 0.09391136190388352, 0.20570252218954813, 0.06570373627713279, 0.292174131097272, 0.1035408790983424, 0.05237416470601388, 0.07255622089839615, 0.2857968091233702, 0.13168364818180528, 0.15510792946990798, -0.21031677836127688, -0.040318880011053645, 0.07199253734639462] |
1,802.07982 | Shared Services Center for E-Government Policy | It is a general opinion that applicative cooperation represents a useful
vehicle for the development of e-government. At the architectural level,
solutions for applicative cooperation are quite stable, but organizational and
methodological problems prevent the expected and needed development of
cooperation among different administrations. Moreover, the introduction of the
digital government requires a considerable involvement of resources that can be
unsustainable for small public administrations. This work shows how the above
mentioned problems can be (partially) solved with the introduction of a Shared
Services Center (SSC).
| cs.SE | it is a general opinion that applicative cooperation represents a useful vehicle for the development of egovernment at the architectural level solutions for applicative cooperation are quite stable but organizational and methodological problems prevent the expected and needed development of cooperation among different administrations moreover the introduction of the digital government requires a considerable involvement of resources that can be unsustainable for small public administrations this work shows how the above mentioned problems can be partially solved with the introduction of a shared services center ssc | [['it', 'is', 'a', 'general', 'opinion', 'that', 'applicative', 'cooperation', 'represents', 'a', 'useful', 'vehicle', 'for', 'the', 'development', 'of', 'egovernment', 'at', 'the', 'architectural', 'level', 'solutions', 'for', 'applicative', 'cooperation', 'are', 'quite', 'stable', 'but', 'organizational', 'and', 'methodological', 'problems', 'prevent', 'the', 'expected', 'and', 'needed', 'development', 'of', 'cooperation', 'among', 'different', 'administrations', 'moreover', 'the', 'introduction', 'of', 'the', 'digital', 'government', 'requires', 'a', 'considerable', 'involvement', 'of', 'resources', 'that', 'can', 'be', 'unsustainable', 'for', 'small', 'public', 'administrations', 'this', 'work', 'shows', 'how', 'the', 'above', 'mentioned', 'problems', 'can', 'be', 'partially', 'solved', 'with', 'the', 'introduction', 'of', 'a', 'shared', 'services', 'center', 'ssc']] | [-0.1372083491878584, 0.0927207488891517, -0.058097212590266366, 0.11445578882947217, -0.12355343556724661, -0.1673123709380973, 0.09647578145593924, 0.3455072606285644, -0.27863968326710165, -0.30262268367656614, 0.13088393604469506, -0.222048896538137, -0.1394034306800296, 0.18257103550659362, -0.11909722997048913, -0.03135018231791206, 0.09309920990233157, -0.0016078324203357794, 0.023070557833497606, -0.28433197294903356, 0.3148315064230024, 0.07238056481447677, 0.34381365847535605, 0.121045142406771, 0.0743600886076862, -0.03291453512082266, -0.028927709490364027, 0.018585417771625312, -0.06550454595860576, 0.17322145844538978, 0.4164003502837447, 0.23059023343849666, 0.4041363382062247, -0.4259027457947648, -0.19294502831681437, 0.08764637587592006, 0.13430460412217693, 0.09611122122408043, -0.05837964314187682, -0.3019414647633946, 0.06443528412992872, -0.24201555279365114, -0.13760432930186736, -0.0813985027827669, -0.01579159472765791, 0.01895703360178443, -0.2371515654173658, 0.0038315120510497066, 0.024199642895498898, 0.09749661680570869, -0.05511430597953433, -0.10574248184986022, -0.033643739471255346, 0.21707917765584275, 0.07067802863271344, 0.007484541682399225, 0.13328464808576027, -0.17278671830751782, -0.12447690617206485, 0.41977994715751604, 0.05341342006008639, -0.14380758284688602, 0.19889348574784085, -0.05180410530721379, -0.16138002896399864, 0.09358821018344485, 0.1741952274568639, 0.02754022332103273, -0.17828267103542986, 0.06740727353445795, -0.004079368431121111, 0.16072003535254922, 0.06112016755870955, 0.022733260799594614, 0.20899803992794003, 0.21964753099695541, 0.13710796483250898, 0.07842365495026718, 0.026561729783235594, -0.1740311831993939, -0.2625011830363249, -0.1409008052703643, -0.11320129029593583, 0.03168383178431108, -0.0781512874213107, -0.11381495251390693, 0.37282968114325127, 0.16827190964114527, 0.06459574630960475, 0.026980966286257256, 0.3066526813389257, 0.05752815388489601, 0.11100466781550325, 0.07503454840124779, 0.1987085023740588, -0.0007218623447210289, 0.20739212808697377, -0.17461232231323456, 0.1636276172127488, -0.031935906795741514] |
1,802.07983 | Tapir: Automation Support of Exploratory Testing Using Model
Reconstruction of the System Under Test | For a considerable number of software projects, the creation of effective
test cases is hindered by design documentation that is either lacking,
incomplete or obsolete. The exploratory testing approach can serve as a sound
method in such situations. However, the efficiency of this testing approach
strongly depends on the method, the documentation of explored parts of a
system, the organization and distribution of work among individual testers on a
team, and the minimization of potential (very probable) duplicities in
performed tests. In this paper, we present a framework for replacing and
automating a portion of these tasks. A screen-flow-based model of the tested
system is incrementally reconstructed during the exploratory testing process by
tracking testers' activities. With additional metadata, the model serves for an
automated navigation process for a tester. Compared with the exploratory
testing approach, which is manually performed in two case studies, the proposed
framework allows the testers to explore a greater extent of the tested system
and enables greater detection of the defects present in the system. The results
show that the time efficiency of the testing process improved with framework
support. This efficiency can be increased by team-based navigational strategies
that are implemented within the proposed framework, which is documented by
another case study presented in this paper.
| cs.SE | for a considerable number of software projects the creation of effective test cases is hindered by design documentation that is either lacking incomplete or obsolete the exploratory testing approach can serve as a sound method in such situations however the efficiency of this testing approach strongly depends on the method the documentation of explored parts of a system the organization and distribution of work among individual testers on a team and the minimization of potential very probable duplicities in performed tests in this paper we present a framework for replacing and automating a portion of these tasks a screenflowbased model of the tested system is incrementally reconstructed during the exploratory testing process by tracking testers activities with additional metadata the model serves for an automated navigation process for a tester compared with the exploratory testing approach which is manually performed in two case studies the proposed framework allows the testers to explore a greater extent of the tested system and enables greater detection of the defects present in the system the results show that the time efficiency of the testing process improved with framework support this efficiency can be increased by teambased navigational strategies that are implemented within the proposed framework which is documented by another case study presented in this paper | [['for', 'a', 'considerable', 'number', 'of', 'software', 'projects', 'the', 'creation', 'of', 'effective', 'test', 'cases', 'is', 'hindered', 'by', 'design', 'documentation', 'that', 'is', 'either', 'lacking', 'incomplete', 'or', 'obsolete', 'the', 'exploratory', 'testing', 'approach', 'can', 'serve', 'as', 'a', 'sound', 'method', 'in', 'such', 'situations', 'however', 'the', 'efficiency', 'of', 'this', 'testing', 'approach', 'strongly', 'depends', 'on', 'the', 'method', 'the', 'documentation', 'of', 'explored', 'parts', 'of', 'a', 'system', 'the', 'organization', 'and', 'distribution', 'of', 'work', 'among', 'individual', 'testers', 'on', 'a', 'team', 'and', 'the', 'minimization', 'of', 'potential', 'very', 'probable', 'duplicities', 'in', 'performed', 'tests', 'in', 'this', 'paper', 'we', 'present', 'a', 'framework', 'for', 'replacing', 'and', 'automating', 'a', 'portion', 'of', 'these', 'tasks', 'a', 'screenflowbased', 'model', 'of', 'the', 'tested', 'system', 'is', 'incrementally', 'reconstructed', 'during', 'the', 'exploratory', 'testing', 'process', 'by', 'tracking', 'testers', 'activities', 'with', 'additional', 'metadata', 'the', 'model', 'serves', 'for', 'an', 'automated', 'navigation', 'process', 'for', 'a', 'tester', 'compared', 'with', 'the', 'exploratory', 'testing', 'approach', 'which', 'is', 'manually', 'performed', 'in', 'two', 'case', 'studies', 'the', 'proposed', 'framework', 'allows', 'the', 'testers', 'to', 'explore', 'a', 'greater', 'extent', 'of', 'the', 'tested', 'system', 'and', 'enables', 'greater', 'detection', 'of', 'the', 'defects', 'present', 'in', 'the', 'system', 'the', 'results', 'show', 'that', 'the', 'time', 'efficiency', 'of', 'the', 'testing', 'process', 'improved', 'with', 'framework', 'support', 'this', 'efficiency', 'can', 'be', 'increased', 'by', 'teambased', 'navigational', 'strategies', 'that', 'are', 'implemented', 'within', 'the', 'proposed', 'framework', 'which', 'is', 'documented', 'by', 'another', 'case', 'study', 'presented', 'in', 'this', 'paper']] | [-0.09469007484703547, 0.027406346871742114, -0.08738607766018028, 0.03656595255776795, -0.03783240904144588, -0.13597898148443727, 0.08000672299170955, 0.38295771117721283, -0.20349762572995608, -0.36374900916679986, 0.12171030848597487, -0.22317146385162015, -0.14881456837035892, 0.21647084713802628, -0.058157878472203654, 0.08794892705267383, 0.1189908470115846, 0.01402977453988223, -0.015987170300130468, -0.2534051947295666, 0.2931508297799155, 0.11579397206216874, 0.3017102259344288, 0.039818805702296754, 0.058044456570808374, 0.009450774058877003, -0.07336016806463401, 0.034980923191904455, -0.07245711430382687, 0.14742673055845357, 0.26170592861516134, 0.2085117183370693, 0.33869675026230867, -0.396455426877808, -0.20630588334253325, 0.07434491104268957, 0.14919257792644203, 0.07461719034527917, -0.06939464672135988, -0.3095653797078523, 0.08742426763055847, -0.1925686484867973, -0.11801829807726401, -0.08832739611111937, -0.021634129713666402, -0.018806714384395275, -0.28530521146687016, 0.02871179845824372, 0.07908799162334097, 0.08197226663164439, -0.050787004563816095, -0.0823361842760018, 0.041381957286614035, 0.15559318321646146, 0.048384599481470926, 0.02541662200320778, 0.13523255783310603, -0.1322973525905538, -0.1500092181133195, 0.39924398419402896, -0.02470547238813846, -0.2065638638600441, 0.19628403766435526, -0.06864093389317748, -0.148543250280255, 0.08568739248439669, 0.21448401386539143, 0.1520675651596061, -0.19457308533823206, 0.05783341838978231, -0.0015080915209615515, 0.19604061086928207, 0.007792961322480724, -0.037400126591923516, 0.18865472416260412, 0.2645556931960441, 0.025071150230221627, 0.18266845578383212, -0.04935502161360567, -0.05221431861420916, -0.2886079157336748, -0.18111784732013586, -0.17101928418768303, -0.05204040119091847, -0.04799662811121726, -0.13970071551212598, 0.4018840700787093, 0.21353754425966015, 0.1355777773085893, 0.040252059541775714, 0.32943893968172017, 0.04968426389664057, 0.08437465988764806, 0.052743177614840014, 0.20993404701307772, 0.011949956820656856, 0.1023475746579823, -0.19730896616543067, 0.1343808523290569, 0.01348832797236918] |
1,802.07984 | A new optimization problem in FSO communication system | According to the physical phenomena of atmospheric channels and wave
propagation, performance of wireless communication systems can be optimized by
simply adjusting its parameters. This way is more economically favorable than
consuming power or using processing techniques. In this paper for the first
time an optimization problem is developed on the performance of free-space
optical multi-input multi-output (FSO-MIMO) communication system. Also it is
the first time that the optimization of FSO is developed under saturated
atmospheric turbulences. In order to get closer to the actual results, the
effect of pointing error is taken into considerations. Assuming MPSK, DPSK
modulation schemes, new closed-form expressions are derived for Bit Error Rate
(BER) of the proposed structure. Furthermore, an optimization is developed
taking into account the beam width as the variable parameter, and BER as the
objective function, there is no constraint in this system. The obtained results
can be a useful outcome for FSO-MIMO system designers in order to limit effects
of pointing error as well as atmospheric turbulences and thus achieves optimum
performance.
| eess.SP | according to the physical phenomena of atmospheric channels and wave propagation performance of wireless communication systems can be optimized by simply adjusting its parameters this way is more economically favorable than consuming power or using processing techniques in this paper for the first time an optimization problem is developed on the performance of freespace optical multiinput multioutput fsomimo communication system also it is the first time that the optimization of fso is developed under saturated atmospheric turbulences in order to get closer to the actual results the effect of pointing error is taken into considerations assuming mpsk dpsk modulation schemes new closedform expressions are derived for bit error rate ber of the proposed structure furthermore an optimization is developed taking into account the beam width as the variable parameter and ber as the objective function there is no constraint in this system the obtained results can be a useful outcome for fsomimo system designers in order to limit effects of pointing error as well as atmospheric turbulences and thus achieves optimum performance | [['according', 'to', 'the', 'physical', 'phenomena', 'of', 'atmospheric', 'channels', 'and', 'wave', 'propagation', 'performance', 'of', 'wireless', 'communication', 'systems', 'can', 'be', 'optimized', 'by', 'simply', 'adjusting', 'its', 'parameters', 'this', 'way', 'is', 'more', 'economically', 'favorable', 'than', 'consuming', 'power', 'or', 'using', 'processing', 'techniques', 'in', 'this', 'paper', 'for', 'the', 'first', 'time', 'an', 'optimization', 'problem', 'is', 'developed', 'on', 'the', 'performance', 'of', 'freespace', 'optical', 'multiinput', 'multioutput', 'fsomimo', 'communication', 'system', 'also', 'it', 'is', 'the', 'first', 'time', 'that', 'the', 'optimization', 'of', 'fso', 'is', 'developed', 'under', 'saturated', 'atmospheric', 'turbulences', 'in', 'order', 'to', 'get', 'closer', 'to', 'the', 'actual', 'results', 'the', 'effect', 'of', 'pointing', 'error', 'is', 'taken', 'into', 'considerations', 'assuming', 'mpsk', 'dpsk', 'modulation', 'schemes', 'new', 'closedform', 'expressions', 'are', 'derived', 'for', 'bit', 'error', 'rate', 'ber', 'of', 'the', 'proposed', 'structure', 'furthermore', 'an', 'optimization', 'is', 'developed', 'taking', 'into', 'account', 'the', 'beam', 'width', 'as', 'the', 'variable', 'parameter', 'and', 'ber', 'as', 'the', 'objective', 'function', 'there', 'is', 'no', 'constraint', 'in', 'this', 'system', 'the', 'obtained', 'results', 'can', 'be', 'a', 'useful', 'outcome', 'for', 'fsomimo', 'system', 'designers', 'in', 'order', 'to', 'limit', 'effects', 'of', 'pointing', 'error', 'as', 'well', 'as', 'atmospheric', 'turbulences', 'and', 'thus', 'achieves', 'optimum', 'performance']] | [-0.1754349877475761, 0.046379740899326005, -0.06568787021028316, 0.06898534198784653, -0.056479110378388535, -0.1694337654804044, 0.06667193258249694, 0.397418028872241, -0.25291047136792366, -0.3104849823476637, 0.1291029451716253, -0.19629496281199596, -0.16081281318192314, 0.26490587017855005, -0.10071006582447273, 0.11650754252195303, 0.0689822135890341, 0.02011052393765353, -0.0678437841576798, -0.2631918392240015, 0.25375905887169, 0.15590926438487848, 0.28609381675418905, 0.028210826561553402, 0.09407057843979119, -0.00275612029055243, 0.019959806648137814, -0.016126164154753923, -0.11919947008158059, 0.06470385101445786, 0.2798822332214674, 0.15652743339100306, 0.2676313729915658, -0.4005608924650861, -0.2558632222113802, 0.07132581354466418, 0.1767322174136472, 0.0767440508968909, -0.025223104235021096, -0.2835222156389671, 0.08425507247995805, -0.17288396540234852, -0.06204416353036376, -0.02596531436942956, -0.03919361537760672, 0.019130227743549125, -0.34513495681595113, 0.0393405790986863, 0.03485296229071751, 0.03757819091791616, -0.0642022718435756, -0.1365865065723055, 0.017388380333945592, 0.1830921826144571, 0.04042975406354184, 0.020571347745135426, 0.11348217944751549, -0.09428954275927562, -0.08931403705740676, 0.4241305374156903, -0.04313978735427715, -0.2479404644054525, 0.11958483096403892, -0.08005659520156982, -0.054076285665745245, 0.17897117408814237, 0.2153520268990713, 0.0457777337910717, -0.19865125533337158, 0.011449989954845103, 0.024489136070427346, 0.19955347367726706, 0.06068164106622777, 0.0990576386828359, 0.1440640102421372, 0.2153058811036103, 0.11721672387245824, 0.14750493769670892, -0.11272129208972569, -0.09296822012265157, -0.24287535742692212, -0.1467175468638101, -0.17091732038568486, 0.005583209462501519, -0.07090709062322276, -0.06916541760677801, 0.3595480663044488, 0.15863213827833533, 0.11498355201020946, 0.0741324466858607, 0.392576114373172, 0.17990395885015673, 0.0500943500055548, 0.07460110597586368, 0.25208772122996914, 0.11255792928585673, 0.11137933647842146, -0.21705704605247936, 0.10586797580506434, 0.023110373967381963] |
1,802.07985 | Community Detection with Metadata in a Network of Biographies of Western
Art Painters | In this work we look at the structure of the influences between Western art
painters as revealed by their biographies on Wikipedia. We use a modified
version of modularity maximisation with metadata to detect a partition of
artists into communities based on their artistic genre and school in which they
belong. We then use this community structure to discuss how influential artists
reached beyond their own communities and had a lasting impact on others, by
proposing modifications on standard centrality measures.
| physics.soc-ph cs.SI | in this work we look at the structure of the influences between western art painters as revealed by their biographies on wikipedia we use a modified version of modularity maximisation with metadata to detect a partition of artists into communities based on their artistic genre and school in which they belong we then use this community structure to discuss how influential artists reached beyond their own communities and had a lasting impact on others by proposing modifications on standard centrality measures | [['in', 'this', 'work', 'we', 'look', 'at', 'the', 'structure', 'of', 'the', 'influences', 'between', 'western', 'art', 'painters', 'as', 'revealed', 'by', 'their', 'biographies', 'on', 'wikipedia', 'we', 'use', 'a', 'modified', 'version', 'of', 'modularity', 'maximisation', 'with', 'metadata', 'to', 'detect', 'a', 'partition', 'of', 'artists', 'into', 'communities', 'based', 'on', 'their', 'artistic', 'genre', 'and', 'school', 'in', 'which', 'they', 'belong', 'we', 'then', 'use', 'this', 'community', 'structure', 'to', 'discuss', 'how', 'influential', 'artists', 'reached', 'beyond', 'their', 'own', 'communities', 'and', 'had', 'a', 'lasting', 'impact', 'on', 'others', 'by', 'proposing', 'modifications', 'on', 'standard', 'centrality', 'measures']] | [-0.0253454320406524, 0.05171049294567862, -0.14648091674057973, 0.12299327622167766, -0.166168190791835, -0.10201259929921053, 0.10261089055810446, 0.42585115997051753, -0.22183189155349944, -0.36699889884847736, 0.057764473971968266, -0.313417205736501, -0.18757228315218616, 0.1181753529810611, -0.09703956342037813, -0.06224122529642449, 0.08641851410545685, 0.09436460438379903, -0.03426751001295346, -0.3069597814795504, 0.34546572372409295, 0.0942957260772402, 0.2820566266453193, 0.0638752220382477, 0.06342176387782128, 0.0004969759359898299, -0.08643178580857722, 0.038067035055086934, -0.13157337997396143, 0.17938037914580401, 0.28789785996447376, 0.2473985620164945, 0.37235793918026266, -0.4227445728065055, -0.13875221301813, 0.060289085116869784, 0.09952597717904015, 0.05231489619832302, 0.003000615492325138, -0.3681399819676845, 0.05858666083256622, -0.20581925758678052, -0.06948657676485585, -0.06547048130866003, 0.0032579738123595346, 0.02760019418955953, -0.0937385443140994, 0.034284651969318035, 0.010136523996882233, 0.1065871169284722, 0.00036074169968933233, -0.15637518962224325, -0.008782354821623475, 0.17282859210706789, 0.06170260661819168, -0.027482306515728985, 0.16713444996671176, -0.17834474269967573, -0.1799447337268955, 0.37887693053962274, -0.040150728812556206, -0.15181447919688107, 0.2044543782622772, -0.08087234377263137, -0.19272833496884065, 0.004769716296850899, 0.2503329778412058, 0.07210956276739361, -0.11047957953853234, 0.005782401894886093, -0.03222850189302807, 0.17332479349096064, 0.140739317856913, 0.00043776197887865115, 0.219353754038888, 0.16472109724526052, 0.029966238512439125, 0.13243358959386378, -0.016302284842104088, -0.09280034340343174, -0.1608778191960336, -0.11649022739449585, -0.15391984732281186, 0.029156066235844737, -0.02992511002517903, -0.16900575571452026, 0.4911493216583758, 0.1877901440049395, 0.16610568330873288, 0.036512257586618496, 0.2430213376086343, -0.030027513209741886, 0.09187132249195358, 0.09572608843675734, 0.18766616673473221, 0.036443081529190145, 0.1802614643410952, -0.11552163940727894, 0.1452052232372448, 0.06691844813722576] |
1,802.07986 | A Version of $\kappa$-Miller Forcing | Let $\kappa$ be an uncountable cardinal such that $2^{<\kappa} = \kappa$ or
just ${\rm cf}(\kappa) > \omega$, $2^{2^{<\kappa}}= 2^\kappa$, and
$([\kappa]^\kappa, \supseteq)$ collapses $2^\kappa$ to $\omega$. We show under
these assumptions the $\kappa$-Miller forcing with club many splitting nodes
collapses $2^\kappa$ to $\omega$ and adds a $\kappa$-Cohen real.
| math.LO | let kappa be an uncountable cardinal such that 2kappa kappa or just rm cfkappa omega 22kappa 2kappa and kappakappa supseteq collapses 2kappa to omega we show under these assumptions the kappamiller forcing with club many splitting nodes collapses 2kappa to omega and adds a kappacohen real | [['let', 'kappa', 'be', 'an', 'uncountable', 'cardinal', 'such', 'that', '2kappa', 'kappa', 'or', 'just', 'rm', 'cfkappa', 'omega', '22kappa', '2kappa', 'and', 'kappakappa', 'supseteq', 'collapses', '2kappa', 'to', 'omega', 'we', 'show', 'under', 'these', 'assumptions', 'the', 'kappamiller', 'forcing', 'with', 'club', 'many', 'splitting', 'nodes', 'collapses', '2kappa', 'to', 'omega', 'and', 'adds', 'a', 'kappacohen', 'real']] | [-0.30807112495219985, 0.24477547330566585, -0.05471053821316292, 0.07424786444320235, -0.1745286137298789, -0.24912086507132233, 0.025718341118569465, 0.3292044953897942, -0.35196609361920245, -0.11063231867846361, 0.07158358090795404, -0.4012851099548645, -0.02826517619474163, 0.17077539593447, -0.06566353660986521, -0.06137890173772047, 0.05310223070731343, 0.15396974443696265, 0.07803848511972573, -0.147650561882941, 0.3934390160233475, -0.21120007288490616, 0.13039893737106129, 0.02733984824979331, 0.09412558333471764, -0.11265111540249267, 0.16212442786930953, 0.11574549766712237, -0.30921645703550216, -0.01713693081292995, 0.24148807821925297, 0.2105161226246246, 0.30545360580639, -0.2809561375788478, -0.15466970025540092, 0.24647796925070675, 0.11008170019661964, -0.14344370832969977, 0.12774192623057684, -0.33255443949425634, 0.18027297633450998, -0.19200898109133854, -0.149672340515048, -0.1454563019472326, 0.18409411163004333, 0.024875213175492232, -0.3454109219790891, 0.024131418682288294, 0.2057976099597507, 0.07641293613110171, 0.002590979416962973, -0.17582654303242995, -0.07325515719563809, -0.004854951037613805, 0.013720716003241927, 0.1486359420015888, 0.06672083339545616, -0.044334179570162016, -0.0539946180963239, 0.39490845608849856, -0.09661382932735738, -0.2410069553311481, 0.17277570215032198, -0.25356580602914786, -0.17924079262153353, 0.060061556178816526, -0.031182645484371933, 0.06644037649641897, 0.07287876238656599, 0.25161485512318565, -0.13466390254799016, 0.2716926132263832, 0.20923613696250803, 0.012410977844495413, 0.08493008514389742, 0.11716476489984712, 0.14217247939424935, 0.1260265434718539, 0.03454236367035137, 0.08223310979299767, -0.3007882301544034, -0.05214844748572728, -0.10992804074356723, 0.20986937122354501, -0.14091690479125285, -0.22076144013120685, 0.17609209812051335, 0.07098354482590112, 0.17487691516099974, 0.11430530141779156, 0.220124360087306, 0.08059184794682403, 0.03953006456411162, 0.13978943596918916, 0.03157831328856044, 0.10133855633957442, -0.07062826903406964, -0.10460727366207298, 0.016799618360088316, -0.0050228175999553395] |
1,802.07987 | Invariant surfaces in Euclidean space with a log-linear density | A $\lambda$-translating soliton with density vector $\vec{v}$ is a surface in
Euclidean space whose mean curvature $H$ satisfies $2H=2\lambda+\langle
N,\vec{v}\rangle$, where $N$ is the Gauss map. We classify all
$\lambda$-translating solitons that are invariant by a one-parameter group of
translations and a one-parameter group of rotations.
| math.DG | a lambdatranslating soliton with density vector vecv is a surface in euclidean space whose mean curvature h satisfies 2h2lambdalangle nvecvrangle where n is the gauss map we classify all lambdatranslating solitons that are invariant by a oneparameter group of translations and a oneparameter group of rotations | [['a', 'lambdatranslating', 'soliton', 'with', 'density', 'vector', 'vecv', 'is', 'a', 'surface', 'in', 'euclidean', 'space', 'whose', 'mean', 'curvature', 'h', 'satisfies', '2h2lambdalangle', 'nvecvrangle', 'where', 'n', 'is', 'the', 'gauss', 'map', 'we', 'classify', 'all', 'lambdatranslating', 'solitons', 'that', 'are', 'invariant', 'by', 'a', 'oneparameter', 'group', 'of', 'translations', 'and', 'a', 'oneparameter', 'group', 'of', 'rotations']] | [-0.22990367095917463, 0.20816548568704588, -0.10232431003400548, 0.027976766228675842, -0.09209635601886972, -0.12731838155410846, -0.03388600492458367, 0.39720918370982294, -0.24210482300259173, -0.19066665389321066, 0.10092000406902199, -0.2889563843226907, -0.15178963225017386, 0.14195093359607694, -0.06149258760904724, 0.0220325889531523, -0.0235009337563745, 0.15338035457005555, -0.14325685186883097, -0.2111492205982689, 0.3671224225651134, -0.09552304315465418, 0.21517351735383272, -0.06124131754305298, 0.17214740124869754, -0.03395774432944811, 0.021130816788751294, 0.02388180837773358, -0.16903695813992023, 0.10767582451543686, 0.15677791156552054, 0.04467756605167365, 0.20662110019475222, -0.28231028899211774, -0.24535944331331516, 0.18381861978295175, 0.1306697030800437, 0.03350698615593666, -0.03810702234675938, -0.3190321562896398, 0.08768785166003826, -0.08455372148786079, -0.15807840853548524, -0.08796975728844038, 0.1215149145996706, 0.04848836557092992, -0.23095960640983487, 0.09307147372535175, 0.07964469615200703, 0.08742602417160841, -0.05573162346527996, -0.004972981691191142, -0.14178720095448874, 0.036340379918163475, 0.022049472487362273, 0.14520483377220278, 0.1190953105582263, -0.07449472686064175, -0.05544784358194606, 0.4318267827514898, -0.17003745670345696, -0.30406075914983044, 0.03484526937509971, -0.1636566208537922, -0.11359402335206555, 0.16172550737180494, 0.1395833901531825, 0.13308698808859018, -0.0584934041200375, 0.19747300255403388, -0.13950374357624573, 0.11299304520203308, 0.1171611421635713, -0.036911047328348184, 0.15370178722183814, 0.055568766886029734, 0.1517019419063052, 0.09436990731311115, -0.04713456171818755, -0.05896457807499577, -0.39026658186181024, -0.22084226245483893, -0.15445664162292483, 0.10527393217621879, -0.11656623317784662, -0.17774395492266526, 0.3881718957352198, -0.06148420755793764, 0.23812062631953845, 0.09572185995057225, 0.16913593213327907, 0.0652761731762439, 0.07351348185065118, 0.16140173830684612, 0.12943749768998136, 0.19653139869280328, -0.07952348693189296, -0.14892822560134597, -0.12069782887754793, 0.17695582556982778] |
1,802.07988 | Bosonic quantum Hall states in single-layer two-dimensional optical
lattices | Quantum Hall (QH) states of 2D single layer optical lattices are examined
using Bose-Hubbard model (BHM) in presence of artificial gauge field. We study
the QH states of both the homogeneous and inhomogeneous systems. For the
homogeneous case we use cluster Gutzwiller mean field (CGMF) theory with
cluster sizes ranging from $2\times 2$ to $5\times 5$. We, then, consider the
inhomogeneous case, which is relevant to experimental realization. In this
case, we use CGMF and exact diagonalization (ED). The ED studies are using
lattice sizes ranging from $3\times 3$ to $4\times 12$. Our results show that
the geometry of the QH states are sensitive to the magnetic flux $\alpha$ and
cluster sizes. For homogeneous system, among various combinations of
$1/5\leqslant \alpha\leqslant 1/2$ and filling factor $\nu$, only the QH state
of $\alpha=1/4$ with $\nu=1/2$, $1$, $3/2$ and $2$ occur as ground states. For
other combinations, the competing superfluid (SF) state is the ground state and
QH state is metastable. For BHM with envelope potential all the QH states
observed in homogeneous system exist for box potentials, but none for the
harmonic potential. The QH states also persist for very shallow Gaussian
envelope potential. As a possible experimental signature we study the two point
correlations of the QH and SF states.
| cond-mat.quant-gas physics.atom-ph | quantum hall qh states of 2d single layer optical lattices are examined using bosehubbard model bhm in presence of artificial gauge field we study the qh states of both the homogeneous and inhomogeneous systems for the homogeneous case we use cluster gutzwiller mean field cgmf theory with cluster sizes ranging from 2times 2 to 5times 5 we then consider the inhomogeneous case which is relevant to experimental realization in this case we use cgmf and exact diagonalization ed the ed studies are using lattice sizes ranging from 3times 3 to 4times 12 our results show that the geometry of the qh states are sensitive to the magnetic flux alpha and cluster sizes for homogeneous system among various combinations of 15leqslant alphaleqslant 12 and filling factor nu only the qh state of alpha14 with nu12 1 32 and 2 occur as ground states for other combinations the competing superfluid sf state is the ground state and qh state is metastable for bhm with envelope potential all the qh states observed in homogeneous system exist for box potentials but none for the harmonic potential the qh states also persist for very shallow gaussian envelope potential as a possible experimental signature we study the two point correlations of the qh and sf states | [['quantum', 'hall', 'qh', 'states', 'of', '2d', 'single', 'layer', 'optical', 'lattices', 'are', 'examined', 'using', 'bosehubbard', 'model', 'bhm', 'in', 'presence', 'of', 'artificial', 'gauge', 'field', 'we', 'study', 'the', 'qh', 'states', 'of', 'both', 'the', 'homogeneous', 'and', 'inhomogeneous', 'systems', 'for', 'the', 'homogeneous', 'case', 'we', 'use', 'cluster', 'gutzwiller', 'mean', 'field', 'cgmf', 'theory', 'with', 'cluster', 'sizes', 'ranging', 'from', '2times', '2', 'to', '5times', '5', 'we', 'then', 'consider', 'the', 'inhomogeneous', 'case', 'which', 'is', 'relevant', 'to', 'experimental', 'realization', 'in', 'this', 'case', 'we', 'use', 'cgmf', 'and', 'exact', 'diagonalization', 'ed', 'the', 'ed', 'studies', 'are', 'using', 'lattice', 'sizes', 'ranging', 'from', '3times', '3', 'to', '4times', '12', 'our', 'results', 'show', 'that', 'the', 'geometry', 'of', 'the', 'qh', 'states', 'are', 'sensitive', 'to', 'the', 'magnetic', 'flux', 'alpha', 'and', 'cluster', 'sizes', 'for', 'homogeneous', 'system', 'among', 'various', 'combinations', 'of', '15leqslant', 'alphaleqslant', '12', 'and', 'filling', 'factor', 'nu', 'only', 'the', 'qh', 'state', 'of', 'alpha14', 'with', 'nu12', '1', '32', 'and', '2', 'occur', 'as', 'ground', 'states', 'for', 'other', 'combinations', 'the', 'competing', 'superfluid', 'sf', 'state', 'is', 'the', 'ground', 'state', 'and', 'qh', 'state', 'is', 'metastable', 'for', 'bhm', 'with', 'envelope', 'potential', 'all', 'the', 'qh', 'states', 'observed', 'in', 'homogeneous', 'system', 'exist', 'for', 'box', 'potentials', 'but', 'none', 'for', 'the', 'harmonic', 'potential', 'the', 'qh', 'states', 'also', 'persist', 'for', 'very', 'shallow', 'gaussian', 'envelope', 'potential', 'as', 'a', 'possible', 'experimental', 'signature', 'we', 'study', 'the', 'two', 'point', 'correlations', 'of', 'the', 'qh', 'and', 'sf', 'states']] | [-0.13477889717490013, 0.1949339156149931, 0.004828429434980665, 0.06533476548557658, 0.04276238286291205, -0.16582171201173748, 0.04753449512146679, 0.36624957965742355, -0.22190147265791893, -0.2694330359010824, 0.09224526584536458, -0.284665747935928, -0.11495361781711662, 0.1559749312554708, 0.07954245634332655, 0.052529650746977755, 0.02316282112373128, 0.006544885241116087, -0.09289220028385033, -0.23213013592065268, 0.33531041730505723, -0.04518859696053412, 0.25109396077736856, 0.014061890701330931, 0.018369250560534144, 0.006119703077932908, 0.08536389717344373, 0.022839222478935318, -0.14543863506450655, 0.05953968238179749, 0.22006174620640065, 0.012548413194183792, 0.18832573312379064, -0.42690164519562607, -0.18552651803585746, 0.0669153605299514, 0.11699317316192069, 0.1385030952188009, -0.003974386612840351, -0.3020206245050455, 0.07587823281618988, -0.20437163395274963, -0.142452813998153, -0.065072344904322, 0.04656869551455159, -0.012194058366419215, -0.2630965318087311, 0.12966965127700297, 0.02456751601504428, 0.039511325689298764, -0.10200630377955912, -0.17263162595862966, -0.018394152144347097, 0.1098713600921439, -0.05891600441453712, 0.04712648277525746, 0.11607344624630753, -0.1853080374177634, -0.12128200807187352, 0.35783539288012045, -0.04190346357811774, -0.16296427911923578, 0.23571664245939158, -0.17914647215622523, -0.11039926334550339, 0.11848084199508387, 0.10994724126843115, 0.06289485611154565, -0.06300353852233716, 0.09467512502728606, -0.05324447613564275, 0.17109677507389626, 0.028432820190764253, 0.08099085061943957, 0.19910427262075245, 0.12387685575078995, 0.04929011952398079, 0.14456092489667105, -0.15050286845570163, -0.1378582137063079, -0.26922642458230256, -0.1642717110331259, -0.18602613752341962, 0.09690883133693465, -0.0570158195588322, -0.15291960908632193, 0.37443947185806575, 0.11324945135053159, 0.19516920586604447, 0.014794414320273236, 0.20616294121192325, 0.14670262079009608, 0.006418935681826302, 0.06959511954115614, 0.21283255616823832, 0.1732500897321318, 0.04870961086070608, -0.23070955839024723, -0.047752850895769715, 0.018594765553383956] |
1,802.07989 | Electronic properties of phosphorene and graphene nanoribbons with edge
vacancies in magnetic field | The graphene and phosphorene nanostructures have a big potential application
in a large area of actuals research in physics. However, their methods of
synthesis still do not allow the production of perfect materials with an intact
molecular structure. In this paper, the occurrence of atomic vacancies was
considered in the edge structure of the zigzag phosphorene and graphene
nanoribbons. For different concentrations of these edge vacancies, their
influence on the metallic properties was investigated. The calculations were
performed for different sizes of the unit cell. Furthermore, for a smaller
size, the influence of a uniform magnetic field was added.
| cond-mat.mes-hall | the graphene and phosphorene nanostructures have a big potential application in a large area of actuals research in physics however their methods of synthesis still do not allow the production of perfect materials with an intact molecular structure in this paper the occurrence of atomic vacancies was considered in the edge structure of the zigzag phosphorene and graphene nanoribbons for different concentrations of these edge vacancies their influence on the metallic properties was investigated the calculations were performed for different sizes of the unit cell furthermore for a smaller size the influence of a uniform magnetic field was added | [['the', 'graphene', 'and', 'phosphorene', 'nanostructures', 'have', 'a', 'big', 'potential', 'application', 'in', 'a', 'large', 'area', 'of', 'actuals', 'research', 'in', 'physics', 'however', 'their', 'methods', 'of', 'synthesis', 'still', 'do', 'not', 'allow', 'the', 'production', 'of', 'perfect', 'materials', 'with', 'an', 'intact', 'molecular', 'structure', 'in', 'this', 'paper', 'the', 'occurrence', 'of', 'atomic', 'vacancies', 'was', 'considered', 'in', 'the', 'edge', 'structure', 'of', 'the', 'zigzag', 'phosphorene', 'and', 'graphene', 'nanoribbons', 'for', 'different', 'concentrations', 'of', 'these', 'edge', 'vacancies', 'their', 'influence', 'on', 'the', 'metallic', 'properties', 'was', 'investigated', 'the', 'calculations', 'were', 'performed', 'for', 'different', 'sizes', 'of', 'the', 'unit', 'cell', 'furthermore', 'for', 'a', 'smaller', 'size', 'the', 'influence', 'of', 'a', 'uniform', 'magnetic', 'field', 'was', 'added']] | [-0.124785254824662, 0.1373163919739785, -0.017178117194109492, 0.010691235184133278, 0.015478234663441063, -0.10454856579878716, 0.07898875265535099, 0.4438931957508127, -0.24646798176973156, -0.2954312706427329, 0.05044239504448599, -0.2827409655608312, -0.13108104088513012, 0.1359480661281262, 0.002619688789538964, 0.06927138348934629, 0.041596646345399245, -0.019886188813475796, -0.06644611330138463, -0.25802655590961526, 0.26047393016404274, 0.07925923772607789, 0.32933181565668845, 0.12494074594173016, -0.004448932901288223, -0.019742038077439624, 0.0476207405833217, 0.07204196888087976, -0.17013123482842035, 0.1449062207959489, 0.2009458052690583, -0.033699752301956064, 0.26524954787784755, -0.5216995084075012, -0.21398628303531858, 0.007300333646737566, 0.13880344322703855, 0.15480745855643593, -0.11163922579079452, -0.21982827003001038, 0.13226418176929305, -0.130117202483381, -0.1124947287607938, -0.0002458424923584016, 0.028127438808565563, 0.03922046741089699, -0.1956745909369372, 0.03840876785530285, 0.04430248824446791, 0.09992537397655807, -0.13093189228881114, -0.1618079954777101, -0.08042647963803676, 0.13850321835189155, 0.020994446978838455, -0.024111436193131587, 0.21282450301629124, -0.1544143837674361, -0.10896339826756204, 0.4030812821266326, 0.0020968330873533934, -0.15065071553067125, 0.18666981273528302, -0.1662202957274411, -0.13214331042642394, 0.14438502638685433, 0.14150603391074887, 0.11807022025488843, -0.15527461441069126, 0.11589526807339015, -0.022705517295334075, 0.13998057840702435, 0.0951986356516077, 0.07568143552046909, 0.24564332389178675, 0.20659684652763635, 0.040357391796817986, 0.13508499051782896, -0.12933794821546685, -0.018879045581802575, -0.16854196105792066, -0.21961733940612488, -0.19867432521035275, 0.04973365031103392, -0.06966636764006737, -0.2574417945750133, 0.43413519280765095, 0.11886553058984002, 0.16677639039346215, -0.0711474193147186, 0.22875400188595357, 0.04813739016764995, 0.11662306794379321, -0.0076750039659214744, 0.24753050176859503, 0.1499211397986257, 0.10962912414429916, -0.21616736535838985, 0.10825203766051511, -0.03941982459380395] |
1,802.0799 | Joint Antenna Selection and Phase-Only Beamforming Using Mixed-Integer
Nonlinear Programming | In this paper, we consider the problem of joint antenna selection and analog
beamformer design in downlink single-group multicast networks. Our objective is
to reduce the hardware costs by minimizing the number of required phase
shifters at the transmitter while fulfilling given distortion limits at the
receivers. We formulate the problem as an L0 minimization problem and devise a
novel branch-and-cut based algorithm to solve the resulting mixed-integer
nonlinear program to optimality. We also propose a suboptimal heuristic
algorithm to solve the above problem approximately with a low computational
complexity. Computational results illustrate that the solutions produced by the
proposed heuristic algorithm are optimal in most cases. The results also
indicate that the performance of the optimal methods can be significantly
improved by initializing with the result of the suboptimal method.
| math.OC cs.IT math.IT | in this paper we consider the problem of joint antenna selection and analog beamformer design in downlink singlegroup multicast networks our objective is to reduce the hardware costs by minimizing the number of required phase shifters at the transmitter while fulfilling given distortion limits at the receivers we formulate the problem as an l0 minimization problem and devise a novel branchandcut based algorithm to solve the resulting mixedinteger nonlinear program to optimality we also propose a suboptimal heuristic algorithm to solve the above problem approximately with a low computational complexity computational results illustrate that the solutions produced by the proposed heuristic algorithm are optimal in most cases the results also indicate that the performance of the optimal methods can be significantly improved by initializing with the result of the suboptimal method | [['in', 'this', 'paper', 'we', 'consider', 'the', 'problem', 'of', 'joint', 'antenna', 'selection', 'and', 'analog', 'beamformer', 'design', 'in', 'downlink', 'singlegroup', 'multicast', 'networks', 'our', 'objective', 'is', 'to', 'reduce', 'the', 'hardware', 'costs', 'by', 'minimizing', 'the', 'number', 'of', 'required', 'phase', 'shifters', 'at', 'the', 'transmitter', 'while', 'fulfilling', 'given', 'distortion', 'limits', 'at', 'the', 'receivers', 'we', 'formulate', 'the', 'problem', 'as', 'an', 'l0', 'minimization', 'problem', 'and', 'devise', 'a', 'novel', 'branchandcut', 'based', 'algorithm', 'to', 'solve', 'the', 'resulting', 'mixedinteger', 'nonlinear', 'program', 'to', 'optimality', 'we', 'also', 'propose', 'a', 'suboptimal', 'heuristic', 'algorithm', 'to', 'solve', 'the', 'above', 'problem', 'approximately', 'with', 'a', 'low', 'computational', 'complexity', 'computational', 'results', 'illustrate', 'that', 'the', 'solutions', 'produced', 'by', 'the', 'proposed', 'heuristic', 'algorithm', 'are', 'optimal', 'in', 'most', 'cases', 'the', 'results', 'also', 'indicate', 'that', 'the', 'performance', 'of', 'the', 'optimal', 'methods', 'can', 'be', 'significantly', 'improved', 'by', 'initializing', 'with', 'the', 'result', 'of', 'the', 'suboptimal', 'method']] | [-0.12502926045483093, -0.0283161695709564, -0.05528803548210422, 0.03996304555739212, -0.09328414283813695, -0.19381164515547397, 0.11397646315740635, 0.3856855316055612, -0.30004859004855755, -0.3519854400776156, 0.1221260009475678, -0.20847249864991613, -0.21608081229656706, 0.1693103357292854, -0.1366409146020772, 0.11872419432420568, 0.08332482744399317, -0.02239810491961832, -0.08717512775688852, -0.30359834712176437, 0.2596715286103937, 0.10864063119871244, 0.31105224301199647, 0.01927914528019783, 0.13877515039915034, -0.007077354091781242, 0.027889392516426456, 0.02067014580612897, -0.09648316669980338, 0.1117360926915728, 0.33536671447560534, 0.22257617865298085, 0.3314635491581591, -0.4220966507062202, -0.17723864092285396, 0.11807528479408672, 0.15654952869348882, 0.11397039919259837, -0.047412708280821336, -0.23123692067069862, 0.1310471966240612, -0.13547420387626413, -0.0485197625350463, -0.024930449302187404, -0.1157652580584506, 0.021336490135081824, -0.33186622103320734, 0.030353741503039815, 0.004988135185664989, -0.04548316499403187, -0.085315385227312, -0.16586323431159816, 0.0766003333895915, 0.07822728832963256, 0.041923111708984065, 0.034315201532067234, 0.06155706225816189, -0.09547525953380605, -0.15902075040658922, 0.3741499167628842, 0.0038591777081139213, -0.2493389158559437, 0.1138369468065647, -0.02474937016741579, -0.1358532105974199, 0.1908730624371585, 0.2550373709945449, 0.12113538470815953, -0.15394576608366867, 0.038157434996532076, -0.025702430280138744, 0.1617925883420096, 0.04676554350800926, 0.04197113887755243, 0.10066892068925534, 0.20944848608133163, 0.19291940472490432, 0.21701161439960667, -0.05381471363299718, -0.05284420414010191, -0.246749303010399, -0.0960928056573936, -0.22685203869393422, -0.06345091863332729, -0.11134704357374793, -0.08127182324324514, 0.36516638184748307, 0.18269927509818654, 0.1386435515578758, 0.16429694540059295, 0.39142582052252217, 0.1624281684768507, 0.019352407485267988, 0.14700064935742785, 0.22366800102341267, 0.06323580862421059, 0.10818842480151082, -0.3049251180789114, 0.038902333596337386, 0.08136873391549324] |
1,802.07991 | Decomposition of a graph into two disjoint odd subgraphs | An odd (resp. even) subgraph in a multigraph is its subgraph in which every
vertex has odd (resp. even) degree. We say that a multigraph can be decomposed
into two odd subgraphs if its edge set can be partitioned into two sets so that
both form odd subgraphs. In this paper we give a necessary and sufficient
condition for the decomposability of a multigraph into two odd subgraphs. We
also present a polynomial time algorithm for finding such a decomposition or
showing its non-existence. We also deal with the case of the decomposability
into an even subgraph and an odd subgraph.
| math.CO | an odd resp even subgraph in a multigraph is its subgraph in which every vertex has odd resp even degree we say that a multigraph can be decomposed into two odd subgraphs if its edge set can be partitioned into two sets so that both form odd subgraphs in this paper we give a necessary and sufficient condition for the decomposability of a multigraph into two odd subgraphs we also present a polynomial time algorithm for finding such a decomposition or showing its nonexistence we also deal with the case of the decomposability into an even subgraph and an odd subgraph | [['an', 'odd', 'resp', 'even', 'subgraph', 'in', 'a', 'multigraph', 'is', 'its', 'subgraph', 'in', 'which', 'every', 'vertex', 'has', 'odd', 'resp', 'even', 'degree', 'we', 'say', 'that', 'a', 'multigraph', 'can', 'be', 'decomposed', 'into', 'two', 'odd', 'subgraphs', 'if', 'its', 'edge', 'set', 'can', 'be', 'partitioned', 'into', 'two', 'sets', 'so', 'that', 'both', 'form', 'odd', 'subgraphs', 'in', 'this', 'paper', 'we', 'give', 'a', 'necessary', 'and', 'sufficient', 'condition', 'for', 'the', 'decomposability', 'of', 'a', 'multigraph', 'into', 'two', 'odd', 'subgraphs', 'we', 'also', 'present', 'a', 'polynomial', 'time', 'algorithm', 'for', 'finding', 'such', 'a', 'decomposition', 'or', 'showing', 'its', 'nonexistence', 'we', 'also', 'deal', 'with', 'the', 'case', 'of', 'the', 'decomposability', 'into', 'an', 'even', 'subgraph', 'and', 'an', 'odd', 'subgraph']] | [-0.21833369987878468, 0.13035504289341993, -0.08756584939915724, 0.06988375112967621, -0.08357105180989988, -0.15847406886278256, 0.0037763436788250462, 0.4202581039897286, -0.3070890591986994, -0.26467174084224315, 0.12257828679809457, -0.28116067122704913, -0.1578965846859472, 0.05432455408350002, -0.07135099107814528, -0.05696871360483819, 0.15354282863318255, 0.12099084117920092, 0.056209464177102, -0.29022759837236733, 0.29724425916550773, -0.10015985785550115, 0.12718048430564305, 0.11467514378433623, 0.09024015614430946, 0.023477206029698695, 0.04910407057907985, 0.16031816375838354, -0.10988887429014332, 0.035537052042044624, 0.2724456865119167, 0.19383047670494802, 0.260621377580458, -0.4540829228287411, -0.1015616980989897, 0.3416533168811019, 0.19059508014009288, 0.060483988663781026, -0.017074034415591178, -0.20510024861155982, 0.16498388938310712, -0.13700719004728035, -0.06364061635467086, -0.08100385539750062, 0.08398830380733355, -0.0669681649230937, -0.3326808454118448, -0.0450965342910656, 0.18694593512111962, 0.044807084642424444, 0.007455705938224524, -0.14646669250387367, -0.04848410033086075, 0.06868824863686494, -0.09494020128945387, 0.046134360166875145, -0.025667490332161473, -0.1249600542815273, -0.14426745346166414, 0.3920725354795704, -0.008982419027107776, -0.22167315583971173, 0.08562195788617108, -0.13155730689719025, -0.21147530608911916, 0.1200981523592652, 0.1062252480942424, 0.12608850029951865, -0.08902836973677472, 0.07756243351418156, -0.11809506879584623, 0.11400060995601781, 0.12563900872696154, 0.02148930912855828, 0.160998308514752, 0.12078054329509487, 0.21465378096050555, 0.2530276896547305, 0.012328254870406471, 0.08289872438158138, -0.2925988134125819, -0.15069836196443526, -0.21317353249887133, 0.08785395694915021, -0.18870083072959298, -0.18424242614113753, 0.47870988593123265, 0.07350867435262345, 0.2135900827216925, 0.10509386083853459, 0.2666287285132832, 0.08795021218550277, 0.04610310719431479, 0.16867447623148524, 0.08408936058945658, 0.1344280639976853, -0.09733886402653585, -0.15496637085268256, 0.046022024720280184, 0.13626832864016736] |
1,802.07992 | Rodin's formula in arbitrary codimension | We extend the Rodin's formula for $p$--modulus of the family of curves in
$\mathbb{R}^n$ to arbitrary codimension. The proof relies on the formula for
the $p$--modulus of family of level sets of a submersion and an algebraic lemma
relating Jacobi matrices of considered maps. We state appropriate examples.
| math.CA | we extend the rodins formula for pmodulus of the family of curves in mathbbrn to arbitrary codimension the proof relies on the formula for the pmodulus of family of level sets of a submersion and an algebraic lemma relating jacobi matrices of considered maps we state appropriate examples | [['we', 'extend', 'the', 'rodins', 'formula', 'for', 'pmodulus', 'of', 'the', 'family', 'of', 'curves', 'in', 'mathbbrn', 'to', 'arbitrary', 'codimension', 'the', 'proof', 'relies', 'on', 'the', 'formula', 'for', 'the', 'pmodulus', 'of', 'family', 'of', 'level', 'sets', 'of', 'a', 'submersion', 'and', 'an', 'algebraic', 'lemma', 'relating', 'jacobi', 'matrices', 'of', 'considered', 'maps', 'we', 'state', 'appropriate', 'examples']] | [-0.19396623484014222, 0.01647739284362615, -0.08208697075800349, 0.08001870755106211, -0.06928570525875936, -0.10885990204405971, 0.054918432151074136, 0.2631059796937431, -0.25093739487541217, -0.1839929383713752, 0.10639373429148691, -0.2791129812976578, -0.1339413840614725, 0.2755823700572364, -0.15677093312842771, 0.07933216130671401, 0.0234862113041648, 0.05643916657087781, -0.12220439629163593, -0.24494469298952026, 0.4691475004268189, -0.0525196012070713, 0.21522292766409615, 0.07629091931933847, 0.17293478706657575, 0.04361429117852822, -0.019135114819315884, -0.0609025153486679, -0.20051753082467863, 0.20451865195839977, 0.24881643491486707, 0.1377227166473555, 0.17868110428874692, -0.3623124707179765, -0.13075530522716386, 0.19962866934171566, 0.10145812229408573, 0.07657278617261909, 0.008797044664182371, -0.28034345192524296, 0.07342276681447402, -0.1109423814729477, -0.26499619642466615, -0.10041313575735937, 0.040191253433780126, 0.03459458336389313, -0.26711694294742, 0.016764429591906566, 0.17251359569005822, 0.1377928938018158, -0.09949282711992662, -0.1425870842237297, -0.02402280893875286, 0.04457027933676727, -0.00608558199989299, 0.026249123429806787, 0.06871514905166502, -0.03309311616855363, -0.09035474469419569, 0.2818012312515445, -0.0641283200820908, -0.26483436410004896, 0.07707906529928248, -0.1182405332607838, -0.16581686389205666, 0.08126120138331316, 0.15446321677882224, 0.17906537066058567, -0.08087161262422644, 0.18184021136524584, -0.11429788699994485, 0.07127525195634614, 0.1605559466018652, 0.004915750760119408, 0.07162113313097507, 0.05770577552417914, 0.1114264380982301, 0.20241565524823577, -0.007571109585114755, -0.07752311879691358, -0.3627653294533957, -0.2106143451431611, -0.16671447873037928, 0.14090082277349816, -0.1714129464232125, -0.23141904027822116, 0.4274736545048654, 0.04707130774234732, 0.19648462601859742, 0.1453863934148103, 0.18944504913330698, 0.10814694941897567, 0.010397299027924115, 0.03733196279305654, 0.10566092853938851, 0.24841922742780298, -0.017147245108693216, -0.09081866337510291, 0.0013994354909906785, 0.22963550814893097] |
1,802.07993 | Tip-induced Superconductivity Coexisting with Preserved Topological
Properties in Line-nodal Semimetal ZrSiS | ZrSiS was recently shown to be a new material with topologically non-trivial
band structure which exhibits multiple Dirac nodes and a robust linear band
dispersion up to an unusually high energy of 2\,eV. Such a robust linear
dispersion makes the topological properties of ZrSiS insensitive to
perturbations like carrier doping or lattice distortion. Here we show that a
novel superconducting phase with a remarkably high $T_c$ of 7.5\,K can be
induced in single crystals of ZrSiS by a non-superconducting metallic tip of
Ag. From first-principles calculations we show that the observed
superconducting phase might originate from dramatic enhancement of density of
states due to the presence of a metallic tip on ZrSiS. Our calculations also
show that the emerging tip-induced superconducting phase co-exists with the
well preserved topological properties of ZrSiS.
| cond-mat.supr-con | zrsis was recently shown to be a new material with topologically nontrivial band structure which exhibits multiple dirac nodes and a robust linear band dispersion up to an unusually high energy of 2ev such a robust linear dispersion makes the topological properties of zrsis insensitive to perturbations like carrier doping or lattice distortion here we show that a novel superconducting phase with a remarkably high t_c of 75k can be induced in single crystals of zrsis by a nonsuperconducting metallic tip of ag from firstprinciples calculations we show that the observed superconducting phase might originate from dramatic enhancement of density of states due to the presence of a metallic tip on zrsis our calculations also show that the emerging tipinduced superconducting phase coexists with the well preserved topological properties of zrsis | [['zrsis', 'was', 'recently', 'shown', 'to', 'be', 'a', 'new', 'material', 'with', 'topologically', 'nontrivial', 'band', 'structure', 'which', 'exhibits', 'multiple', 'dirac', 'nodes', 'and', 'a', 'robust', 'linear', 'band', 'dispersion', 'up', 'to', 'an', 'unusually', 'high', 'energy', 'of', '2ev', 'such', 'a', 'robust', 'linear', 'dispersion', 'makes', 'the', 'topological', 'properties', 'of', 'zrsis', 'insensitive', 'to', 'perturbations', 'like', 'carrier', 'doping', 'or', 'lattice', 'distortion', 'here', 'we', 'show', 'that', 'a', 'novel', 'superconducting', 'phase', 'with', 'a', 'remarkably', 'high', 't_c', 'of', '75k', 'can', 'be', 'induced', 'in', 'single', 'crystals', 'of', 'zrsis', 'by', 'a', 'nonsuperconducting', 'metallic', 'tip', 'of', 'ag', 'from', 'firstprinciples', 'calculations', 'we', 'show', 'that', 'the', 'observed', 'superconducting', 'phase', 'might', 'originate', 'from', 'dramatic', 'enhancement', 'of', 'density', 'of', 'states', 'due', 'to', 'the', 'presence', 'of', 'a', 'metallic', 'tip', 'on', 'zrsis', 'our', 'calculations', 'also', 'show', 'that', 'the', 'emerging', 'tipinduced', 'superconducting', 'phase', 'coexists', 'with', 'the', 'well', 'preserved', 'topological', 'properties', 'of', 'zrsis']] | [-0.19408625258996598, 0.209358474983632, -0.09197752205797165, -0.010205661861993771, -0.07369577373868523, -0.16339556684802847, 0.12160857341728593, 0.40120957510275695, -0.2816491458877807, -0.2914958522576867, -0.02438689950046677, -0.33149268496994866, -0.20771528575178377, 0.1709872370280098, -0.004642668457431647, 0.026472815244573254, -0.017116979348387937, -0.04271048282180692, -0.1841064183279616, -0.16741420645160132, 0.29964203331968303, 0.02762435187891353, 0.33898717183833016, 0.08955778972110676, 0.03294330969708794, -0.061728166819742046, 0.14461724112656338, 0.0816187986051877, -0.10799451501419517, 0.04712573280122544, 0.26065264923446047, -0.1385336243049846, 0.1789865529196664, -0.4269380706632581, -0.24775222907703057, -0.007901963507685498, 0.11659984182537968, 0.1474602414101348, -0.133340020046413, -0.2971068203079564, 0.1277466859234824, -0.14215185076623926, -0.14894961257543388, -0.1309914432060798, -0.05981980269163392, -0.02688718266173742, -0.21102424716543164, 0.09890456848314835, 0.02942125397318448, 0.04760529164867813, -0.06616194890669853, -0.08575680764136083, -0.13236468961775189, 0.003296060656474633, 0.026215484209415565, 0.044327916737418364, 0.13388788518460312, -0.09967009985520867, -0.08979551218634912, 0.3846997753539272, -0.069860901193025, -0.017570136820556213, 0.18716231303445938, -0.17679996248547927, -0.09496260368627787, 0.2025049295141326, 0.10478847003221967, 0.05265480300717283, -0.09538397865542317, 0.06733930545622653, -0.015395629141730335, 0.2277331660352363, 0.035158946393910824, 0.14891659123965234, 0.2631257934680649, 0.19718273374174708, 0.050470906025410156, 0.1314524625230737, -0.13842856042968635, -0.002951827056649077, -0.20800763816894424, -0.17601494253115402, -0.2423433270518675, 0.07620941942472381, -0.0662811432985317, -0.2591444234804069, 0.41462767842218623, 0.10865418589851669, 0.21954174346525138, -0.07580562065380363, 0.21061513378846508, 0.10547657469945128, 0.10967049866786781, 0.046728287944356905, 0.25924613824441234, 0.16579156558256852, 0.061189106089695716, -0.2907825352602731, 0.06528546262304974, -0.03876279795343298] |
1,802.07994 | Compact $\lambda$-translating solitons with boundary | A $\lambda$-translating soliton with density vector $\vec{v}$ is a surface
$\Sigma$ in Euclidean space ${\mathbb R}^3$ whose mean curvature $H$ satisfies
$2H=2\lambda+\langle N,\vec{v}\rangle$, where $N$ is the Gauss map of $\Sigma$.
In this article we study the shape of a compact $\lambda$-translating soliton
in terms of its boundary. If $\Gamma$ is a given closed curve, we deduce under
what conditions on $\lambda$ there exists a compact $\lambda$-translating
soliton $\Sigma$ with boundary $\Gamma$ and we provide estimates of the surface
area in relation with the height of $\Sigma$. Finally we study the shape of
$\Sigma$ related with the one of $\Gamma$, in particular, we give conditions
that assert that $\Sigma$ inherits the symmetries of its boundary $\Gamma$.
| math.DG | a lambdatranslating soliton with density vector vecv is a surface sigma in euclidean space mathbb r3 whose mean curvature h satisfies 2h2lambdalangle nvecvrangle where n is the gauss map of sigma in this article we study the shape of a compact lambdatranslating soliton in terms of its boundary if gamma is a given closed curve we deduce under what conditions on lambda there exists a compact lambdatranslating soliton sigma with boundary gamma and we provide estimates of the surface area in relation with the height of sigma finally we study the shape of sigma related with the one of gamma in particular we give conditions that assert that sigma inherits the symmetries of its boundary gamma | [['a', 'lambdatranslating', 'soliton', 'with', 'density', 'vector', 'vecv', 'is', 'a', 'surface', 'sigma', 'in', 'euclidean', 'space', 'mathbb', 'r3', 'whose', 'mean', 'curvature', 'h', 'satisfies', '2h2lambdalangle', 'nvecvrangle', 'where', 'n', 'is', 'the', 'gauss', 'map', 'of', 'sigma', 'in', 'this', 'article', 'we', 'study', 'the', 'shape', 'of', 'a', 'compact', 'lambdatranslating', 'soliton', 'in', 'terms', 'of', 'its', 'boundary', 'if', 'gamma', 'is', 'a', 'given', 'closed', 'curve', 'we', 'deduce', 'under', 'what', 'conditions', 'on', 'lambda', 'there', 'exists', 'a', 'compact', 'lambdatranslating', 'soliton', 'sigma', 'with', 'boundary', 'gamma', 'and', 'we', 'provide', 'estimates', 'of', 'the', 'surface', 'area', 'in', 'relation', 'with', 'the', 'height', 'of', 'sigma', 'finally', 'we', 'study', 'the', 'shape', 'of', 'sigma', 'related', 'with', 'the', 'one', 'of', 'gamma', 'in', 'particular', 'we', 'give', 'conditions', 'that', 'assert', 'that', 'sigma', 'inherits', 'the', 'symmetries', 'of', 'its', 'boundary', 'gamma']] | [-0.18138462792787896, 0.11571458360310971, -0.11445920152810256, 0.03758918355308931, -0.07709728105385837, -0.12855469667875583, 0.0031705157016403973, 0.3777039605825976, -0.23927976799671324, -0.18201117823717364, 0.0962934634973001, -0.2655799826525413, -0.14428248092850768, 0.17741962407486872, -0.06590721369189978, -0.004519137710112294, 0.030963192187380372, 0.169469615230347, -0.1185688397912472, -0.1950405238710932, 0.38392525440768194, -0.07043457452796008, 0.18154422986615254, 0.06965492452186402, 0.10754926190221388, -0.03540591380697789, 0.013175422164382772, 0.026903639277678162, -0.2771050210909667, 0.13042211393353922, 0.1654133205669687, 0.09574705974981107, 0.16847921387504852, -0.35208670662005287, -0.2281163068153291, 0.16966656340580238, 0.08960676226221646, -0.01729105494655015, -0.02135150268772952, -0.2648487798951305, 0.12055010564539484, -0.056567176098102016, -0.21170892494550922, 0.02561931224262113, 0.10087753353607759, 0.024348849083476683, -0.2247494162681202, 0.08596259897386883, 0.09506066168838165, 0.05473856839531085, -0.06801142960811328, -0.08579438143581349, -0.08458023954574999, 0.06007465049052578, 0.04455918657977395, 0.12238032188217499, 0.07405243539904947, -0.14501453693670205, -0.02279444409763081, 0.4072102352715375, -0.144054241758759, -0.2732524660889778, 0.10193939747599264, -0.20330851725220941, -0.12523231846525482, 0.14209061240156493, 0.12869048437610137, 0.09221349529546212, -0.060524039019487406, 0.21733729435047217, -0.11056430579730914, 0.14954618230592787, 0.09967113908772406, -0.0073584534816051785, 0.1597213317280668, 0.15836018110470226, 0.12338944145461969, 0.13823326799626412, -0.121042095181908, -0.0033763633967426264, -0.4311672375913252, -0.18448356157904, -0.11859364889504943, 0.11184357930987812, -0.11278450415097484, -0.19634716031386665, 0.3510129286687037, 0.02082677282956674, 0.22718539125727197, 0.0730036812295255, 0.1727303619559838, 0.154008396954292, 0.00195348158217313, 0.1134015650962267, 0.1521836466629777, 0.1810115296311938, -0.009432084682773342, -0.21005099607435496, -0.04407814193288224, 0.07340000110898952] |
1,802.07995 | Multidimensional multiscale scanning in Exponential Families: Limit
theory and statistical consequences | We consider the problem of finding anomalies in a $d$-dimensional field of
independent random variables $\{Y_i\}_{i \in \left\{1,...,n\right\}^d}$, each
distributed according to a one-dimensional natural exponential family $\mathcal
F = \left\{F_\theta\right\}_{\theta \in\Theta}$. Given some baseline parameter
$\theta_0 \in\Theta$, the field is scanned using local likelihood ratio tests
to detect from a (large) given system of regions $\mathcal{R}$ those regions $R
\subset \left\{1,...,n\right\}^d$ with $\theta_i \neq \theta_0$ for some $i \in
R$. We provide a unified methodology which controls the overall family wise
error (FWER) to make a wrong detection at a given error rate.
Fundamental to our method is a Gaussian approximation of the distribution of
the underlying multiscale test statistic with explicit rate of convergence.
From this, we obtain a weak limit theorem which can be seen as a generalized
weak invariance principle to non identically distributed data and is of
independent interest. Furthermore, we give an asymptotic expansion of the
procedures power, which yields minimax optimality in case of Gaussian
observations.
| math.PR math.ST stat.ME stat.TH | we consider the problem of finding anomalies in a ddimensional field of independent random variables y_i_i in left1nrightd each distributed according to a onedimensional natural exponential family mathcal f leftf_thetaright_theta intheta given some baseline parameter theta_0 intheta the field is scanned using local likelihood ratio tests to detect from a large given system of regions mathcalr those regions r subset left1nrightd with theta_i neq theta_0 for some i in r we provide a unified methodology which controls the overall family wise error fwer to make a wrong detection at a given error rate fundamental to our method is a gaussian approximation of the distribution of the underlying multiscale test statistic with explicit rate of convergence from this we obtain a weak limit theorem which can be seen as a generalized weak invariance principle to non identically distributed data and is of independent interest furthermore we give an asymptotic expansion of the procedures power which yields minimax optimality in case of gaussian observations | [['we', 'consider', 'the', 'problem', 'of', 'finding', 'anomalies', 'in', 'a', 'ddimensional', 'field', 'of', 'independent', 'random', 'variables', 'y_i_i', 'in', 'left1nrightd', 'each', 'distributed', 'according', 'to', 'a', 'onedimensional', 'natural', 'exponential', 'family', 'mathcal', 'f', 'leftf_thetaright_theta', 'intheta', 'given', 'some', 'baseline', 'parameter', 'theta_0', 'intheta', 'the', 'field', 'is', 'scanned', 'using', 'local', 'likelihood', 'ratio', 'tests', 'to', 'detect', 'from', 'a', 'large', 'given', 'system', 'of', 'regions', 'mathcalr', 'those', 'regions', 'r', 'subset', 'left1nrightd', 'with', 'theta_i', 'neq', 'theta_0', 'for', 'some', 'i', 'in', 'r', 'we', 'provide', 'a', 'unified', 'methodology', 'which', 'controls', 'the', 'overall', 'family', 'wise', 'error', 'fwer', 'to', 'make', 'a', 'wrong', 'detection', 'at', 'a', 'given', 'error', 'rate', 'fundamental', 'to', 'our', 'method', 'is', 'a', 'gaussian', 'approximation', 'of', 'the', 'distribution', 'of', 'the', 'underlying', 'multiscale', 'test', 'statistic', 'with', 'explicit', 'rate', 'of', 'convergence', 'from', 'this', 'we', 'obtain', 'a', 'weak', 'limit', 'theorem', 'which', 'can', 'be', 'seen', 'as', 'a', 'generalized', 'weak', 'invariance', 'principle', 'to', 'non', 'identically', 'distributed', 'data', 'and', 'is', 'of', 'independent', 'interest', 'furthermore', 'we', 'give', 'an', 'asymptotic', 'expansion', 'of', 'the', 'procedures', 'power', 'which', 'yields', 'minimax', 'optimality', 'in', 'case', 'of', 'gaussian', 'observations']] | [-0.13842593030231629, 0.05796261962860861, -0.09557213502754487, 0.04511979845083031, -0.05772648746024747, -0.16614194062345153, 0.08439301697349867, 0.33664241447494186, -0.2854290713274957, -0.24833724101267332, 0.10309610989987382, -0.22224649526588852, -0.09005090996254024, 0.17970920314297736, -0.09847808311804661, 0.06207177051015011, 0.030516748805676803, 0.05215478146396747, -0.07117457637774213, -0.25524639905980967, 0.26457184280339135, 0.05281212148747155, 0.27470318416613826, -0.041467604877532656, 0.10514871114879588, -0.00301174053178409, -0.02796116935048229, 0.033276194013512776, -0.16995413660997255, 0.094985856476193, 0.24645709658609763, 0.1542690392793559, 0.3017538475259295, -0.3197563028537065, -0.16402441919810554, 0.166073035220352, 0.13203089570322032, 0.07249065286277812, -0.023554353665783064, -0.2740185531661641, 0.09655777738816193, -0.14016120683448682, -0.15366031502925573, -0.05304550337634465, 0.02114881119843127, 0.04993946288284734, -0.4049180220642695, 0.11846587653183993, 0.07107232561270536, 0.0664175532805095, -0.011600603717057116, -0.11812448222043707, 0.0517173114382082, 0.0784749263918039, 0.06636824513970048, 0.05705854359943912, 0.10382993004735817, -0.08353221433020472, -0.06486821862863107, 0.3249020933447429, -0.09331749659361106, -0.22992394611081285, 0.12483608414881728, -0.13748803475883398, -0.16260153043476291, 0.1174524952364652, 0.1708068888130709, 0.13888506686209506, -0.1443768473775507, 0.11859997930905763, -0.07165043214160316, 0.15169589368332875, 0.052863455547383, 0.026238717832866142, 0.18257276731273803, 0.10854503572127729, 0.09938031970669732, 0.14376712241429696, -0.11027342505436742, -0.06738589954146612, -0.3698293757873863, -0.11823426062514297, -0.1913741244077858, 0.07760046185697166, -0.15902010176567663, -0.1910786651274037, 0.3568965086432279, 0.14874964457886797, 0.2098244832163829, 0.10455315844990525, 0.2404028612142136, 0.11799780160346825, 0.004484813349942367, 0.09120433873279311, 0.19592155444284948, 0.13243885234630895, 0.015472196052788096, -0.14891527401599683, 0.05450508627255664, 0.07529027017899467] |
1,802.07996 | Multicolor photometric behavior of the young stellar object V1704 Cygni | Results from BVRI photometric observations of the pre-main sequence star
V1704 Cyg collected during the time period from August 2010 to December 2017
are presented. The star is located in the star-forming HII region IC 5070 and
it exhibits photometric variability in all-optical passbands. After analyzing
the obtained data, V1704 Cyg is classified as a classical T Tauri star.
| astro-ph.SR | results from bvri photometric observations of the premain sequence star v1704 cyg collected during the time period from august 2010 to december 2017 are presented the star is located in the starforming hii region ic 5070 and it exhibits photometric variability in alloptical passbands after analyzing the obtained data v1704 cyg is classified as a classical t tauri star | [['results', 'from', 'bvri', 'photometric', 'observations', 'of', 'the', 'premain', 'sequence', 'star', 'v1704', 'cyg', 'collected', 'during', 'the', 'time', 'period', 'from', 'august', '2010', 'to', 'december', '2017', 'are', 'presented', 'the', 'star', 'is', 'located', 'in', 'the', 'starforming', 'hii', 'region', 'ic', '5070', 'and', 'it', 'exhibits', 'photometric', 'variability', 'in', 'alloptical', 'passbands', 'after', 'analyzing', 'the', 'obtained', 'data', 'v1704', 'cyg', 'is', 'classified', 'as', 'a', 'classical', 't', 'tauri', 'star']] | [-0.02327975336658327, 0.1276605773733504, -0.11269605334586742, 0.04405113680925416, -0.11483806678861902, -0.09318668221679043, 0.10284191344072226, 0.45654994968259544, -0.14196702744811773, -0.3606268173541155, 0.10424339085645777, -0.34052702960999387, -0.029893329530431514, 0.2380863368641912, -0.15315563055705034, -0.045052603007653694, 0.23257978951758623, -0.09334075882655095, -0.0036295780814007707, -0.34691082143731283, 0.18976088224403692, 0.038275037026196196, 0.11429807545388476, -0.16698377248586008, 0.042493651998882886, -0.10941614446704064, -0.14023968465513909, -0.1538641432202176, -0.14465210270626763, -0.0865651285112427, 0.30541762095271496, 0.17491554226236125, 0.15989480627569974, -0.27719018708867543, -0.20530979846718542, -0.006163145693247779, 0.1449731530441919, -0.08861409114641056, 0.010741778142880975, -0.35661564532079193, 0.051496959667195356, -0.15496594030532593, -0.12869171631571494, 0.15505484511193476, 0.14212586680067735, 0.014067257125453468, -0.25207602056437745, 0.15413906582091985, -0.01024085889456042, 0.2275558757808125, -0.19048466339396933, -0.0688181212335302, -0.09685605141873423, 0.11653759617668887, -0.0040843562843898935, 0.18810212464284218, 0.10144980668433402, -0.09109298740268539, -0.06953334475034162, 0.3364821826679665, -0.04440620838125285, 0.2061506651848424, 0.22081373743059343, -0.23865036017735275, -0.20919319788778298, 0.1522449749407538, 0.12938661036784188, 0.1699076486718759, -0.21018409266610416, 0.0038593291629743028, 0.012611936638948688, 0.21558985676158937, 0.08229052790505975, 0.08806088462210539, 0.3093851278127547, 0.1256582724918987, -0.07321231581450424, 0.16519222724284127, -0.39046525977257834, -0.09509210739480822, -0.25336898951546144, -0.0194778390914986, -0.1377496521658542, 0.0922738409421423, -0.11640511893462022, -0.027711674938664624, 0.36645728088261786, 0.029659487359152224, 0.19928027330816053, -0.03291683568896955, 0.2478926619024653, 0.10275104135201361, 0.07059995054697267, 0.2218428000260406, 0.3422177249010195, 0.18592376928580434, 0.26284774812755357, -0.23067480270963228, 0.06889264609893425, 0.06345448105416276] |
1,802.07997 | Generating High-Quality Query Suggestion Candidates for Task-Based
Search | We address the task of generating query suggestions for task-based search.
The current state of the art relies heavily on suggestions provided by a major
search engine. In this paper, we solve the task without reliance on search
engines. Specifically, we focus on the first step of a two-stage pipeline
approach, which is dedicated to the generation of query suggestion candidates.
We present three methods for generating candidate suggestions and apply them on
multiple information sources. Using a purpose-built test collection, we find
that these methods are able to generate high-quality suggestion candidates.
| cs.IR cs.AI cs.CL | we address the task of generating query suggestions for taskbased search the current state of the art relies heavily on suggestions provided by a major search engine in this paper we solve the task without reliance on search engines specifically we focus on the first step of a twostage pipeline approach which is dedicated to the generation of query suggestion candidates we present three methods for generating candidate suggestions and apply them on multiple information sources using a purposebuilt test collection we find that these methods are able to generate highquality suggestion candidates | [['we', 'address', 'the', 'task', 'of', 'generating', 'query', 'suggestions', 'for', 'taskbased', 'search', 'the', 'current', 'state', 'of', 'the', 'art', 'relies', 'heavily', 'on', 'suggestions', 'provided', 'by', 'a', 'major', 'search', 'engine', 'in', 'this', 'paper', 'we', 'solve', 'the', 'task', 'without', 'reliance', 'on', 'search', 'engines', 'specifically', 'we', 'focus', 'on', 'the', 'first', 'step', 'of', 'a', 'twostage', 'pipeline', 'approach', 'which', 'is', 'dedicated', 'to', 'the', 'generation', 'of', 'query', 'suggestion', 'candidates', 'we', 'present', 'three', 'methods', 'for', 'generating', 'candidate', 'suggestions', 'and', 'apply', 'them', 'on', 'multiple', 'information', 'sources', 'using', 'a', 'purposebuilt', 'test', 'collection', 'we', 'find', 'that', 'these', 'methods', 'are', 'able', 'to', 'generate', 'highquality', 'suggestion', 'candidates']] | [-0.07260759953930172, -0.014684306027027227, -0.05205853882756445, 0.0515754037957278, -0.1649561126626307, -0.1345958150873181, 0.1438288761700894, 0.42121447258258377, -0.19736042377408794, -0.40453597301897665, 0.11630805467020079, -0.29481633842712446, -0.12144568860180356, 0.2661339516365921, -0.03167003184376705, 0.08072954388735916, 0.12160000484812283, 0.01943927392443662, -0.03852916966312595, -0.28934371966357914, 0.3434359628747227, 0.046861580087332634, 0.314148000141065, 0.011175677470702639, 0.078239991584973, -0.015103067141226542, -0.14627492137413511, -0.03610771194460892, -0.10113392358995356, 0.1824384542953183, 0.24902536638671913, 0.21780764875352704, 0.30781712236824216, -0.41293625479503987, -0.15981498764206967, 0.08148409572920652, 0.11591812251235849, 0.1347681178438467, -0.16379516579270845, -0.29378513087798913, 0.09974970285009632, -0.15584591517765675, -0.02478058456433236, -0.1238799341716453, -0.014298621484989761, 0.0038389932628350473, -0.2607882522817661, -0.01947928995134369, 0.07246201266334341, -0.007046914859724942, -0.06882442447972754, -0.0842035808900912, 0.10430362948306626, 0.11814482210163949, 0.0002292305586599214, 0.05151250600809812, 0.10991317756231173, -0.16487701211102126, -0.22594700934069972, 0.38918779009292204, -0.05629853823883159, -0.17120019639391573, 0.2071920424319243, -0.03488373582161242, -0.22424625207780188, 0.05109745773777206, 0.20960492893092095, 0.20549863324530662, -0.18961549852223647, -0.0036421545076444346, -0.016713584943484235, 0.20432450840630198, -0.004719048237768552, -0.0202725140868576, 0.2625839394336987, 0.2385710098440208, 0.015666736369972588, 0.1794682930734369, -0.13005534449363157, -0.05117678129544822, -0.25605296498848007, -0.16294885019180916, -0.1802994035164355, -0.0035229134867819007, -0.014979627651696954, -0.12541748964295332, 0.39589945159812445, 0.29079843547836104, 0.17896106043049403, 0.037641833702813314, 0.3260626686957254, 0.05178860335620821, 0.09116324340556597, 0.08312612568073335, 0.17936803738997187, -0.04741704782011971, 0.10252941613115611, -0.16796748988300322, 0.071306871395478, 0.08175866432163754] |
1,802.07998 | Robust estimators in a generalized partly linear regression model under
monotony constraints | In this paper, we consider the situation in which the observations follow an
isotonic generalized partly linear model. Under this model, the mean of the
responses is modelled, through a link function, linearly on some covariates and
nonparametrically on an univariate regressor in such a way that the
nonparametric component is assumed to be a monotone function. A class of robust
estimates for the monotone nonparametric component and for the regression
parameter, related to the linear one, is defined. The robust estimators are
based on a spline approach combined with a score function which bounds large
values of the deviance. As an application, we consider the isotonic partly
linear log--Gamma regression model. Through a Monte Carlo study, we investigate
the performance of the proposed estimators under a partly linear log-Gamma
regression model with increasing nonparametric component.
| math.ST stat.TH | in this paper we consider the situation in which the observations follow an isotonic generalized partly linear model under this model the mean of the responses is modelled through a link function linearly on some covariates and nonparametrically on an univariate regressor in such a way that the nonparametric component is assumed to be a monotone function a class of robust estimates for the monotone nonparametric component and for the regression parameter related to the linear one is defined the robust estimators are based on a spline approach combined with a score function which bounds large values of the deviance as an application we consider the isotonic partly linear loggamma regression model through a monte carlo study we investigate the performance of the proposed estimators under a partly linear loggamma regression model with increasing nonparametric component | [['in', 'this', 'paper', 'we', 'consider', 'the', 'situation', 'in', 'which', 'the', 'observations', 'follow', 'an', 'isotonic', 'generalized', 'partly', 'linear', 'model', 'under', 'this', 'model', 'the', 'mean', 'of', 'the', 'responses', 'is', 'modelled', 'through', 'a', 'link', 'function', 'linearly', 'on', 'some', 'covariates', 'and', 'nonparametrically', 'on', 'an', 'univariate', 'regressor', 'in', 'such', 'a', 'way', 'that', 'the', 'nonparametric', 'component', 'is', 'assumed', 'to', 'be', 'a', 'monotone', 'function', 'a', 'class', 'of', 'robust', 'estimates', 'for', 'the', 'monotone', 'nonparametric', 'component', 'and', 'for', 'the', 'regression', 'parameter', 'related', 'to', 'the', 'linear', 'one', 'is', 'defined', 'the', 'robust', 'estimators', 'are', 'based', 'on', 'a', 'spline', 'approach', 'combined', 'with', 'a', 'score', 'function', 'which', 'bounds', 'large', 'values', 'of', 'the', 'deviance', 'as', 'an', 'application', 'we', 'consider', 'the', 'isotonic', 'partly', 'linear', 'loggamma', 'regression', 'model', 'through', 'a', 'monte', 'carlo', 'study', 'we', 'investigate', 'the', 'performance', 'of', 'the', 'proposed', 'estimators', 'under', 'a', 'partly', 'linear', 'loggamma', 'regression', 'model', 'with', 'increasing', 'nonparametric', 'component']] | [-0.030145595534978545, 0.02904781502077051, -0.1072391329182531, 0.08435042552489047, -0.060406316129956394, -0.16110826936303912, 0.021092835961847894, 0.3945562263183734, -0.3003880753291442, -0.2236655544017113, 0.1380818738038857, -0.26432208958602343, -0.1720930555546896, 0.17813005068284624, -0.09073181497617899, 0.10673085087492996, 0.019825671162620625, 0.005618949003024574, -0.08199504560701933, -0.26534322481123074, 0.30016349077991705, 0.06111493287008831, 0.26158560356570354, -0.03965514827594983, 0.13893916498979225, 0.05567879239371156, -0.04981829754337121, 0.019902851555825156, -0.13401119141722387, 0.12375196872744709, 0.24013115732197868, 0.10102842312634867, 0.36248761929763373, -0.345338999389616, -0.2300794276627986, 0.15254818911746362, 0.07670696446439251, 0.04348077212275444, 0.000906261636855026, -0.24017334580147529, 0.013291112534181379, -0.1888876087785534, -0.11039220243829358, -0.04961324586046805, -0.06100008012179066, 0.050424914462971225, -0.3766221432152259, 0.10998928530128016, 0.06891586480881362, 0.06950453229878537, -0.04143448608160457, -0.15104026385404937, 0.023164546798558578, 0.009315260060568964, 0.08110595661170972, 0.03465188729323392, 0.09611751462815686, -0.11751043100272962, -0.08938604921294267, 0.29332173918031484, -0.13293453482637071, -0.3142081636058934, 0.155871627456851, -0.08006006193703369, -0.16044512548935874, 0.05978490838178379, 0.23743558361414163, 0.1266441229621277, -0.1847058453131467, 0.07703493013618487, -0.08962991688510075, 0.16733617403695142, -0.048410265552400446, -0.07968896663891535, 0.17057182900402146, 0.17569787510985727, 0.1081026839417652, 0.17580564124834971, -0.1120834465854226, -0.08823859187952407, -0.3096168029108359, -0.10728397036847823, -0.20121803199735416, -0.03088165045483038, -0.14549530094111962, -0.25427116726110827, 0.42247756849974394, 0.14340338270823635, 0.25333683636477766, 0.15508336671251421, 0.2874458745286307, 0.1862063491194824, 0.04346407775986282, 0.058590234127169585, 0.184455142415733, 0.16978973533567862, -0.026545117242836997, -0.1782275003805647, 0.16314871698234448, 0.04605965399840737] |
1,802.07999 | Differential technique for the covariant orbital angular momentum
operators | The orbital angular momentum operator expansion turns to be a powerful tool
to construct the fully covariant partial wave amplitudes of hadron decay
reactions and hadron photo- and electroproduction processes. In this paper we
consider a useful development of the orbital angular momentum operator
expansion method. We present the differential technique allowing the direct
calculation of convolutions of two orbital angular momentum operators with an
arbitrary number of open Lorentz indices. This differential technique greatly
simplifies calculations when the reaction subject to the partial wave analysis
involves high spin particles in the initial and/or final states. We also
present a useful generalization of the orbital angular momentum operators.
| hep-ph | the orbital angular momentum operator expansion turns to be a powerful tool to construct the fully covariant partial wave amplitudes of hadron decay reactions and hadron photo and electroproduction processes in this paper we consider a useful development of the orbital angular momentum operator expansion method we present the differential technique allowing the direct calculation of convolutions of two orbital angular momentum operators with an arbitrary number of open lorentz indices this differential technique greatly simplifies calculations when the reaction subject to the partial wave analysis involves high spin particles in the initial andor final states we also present a useful generalization of the orbital angular momentum operators | [['the', 'orbital', 'angular', 'momentum', 'operator', 'expansion', 'turns', 'to', 'be', 'a', 'powerful', 'tool', 'to', 'construct', 'the', 'fully', 'covariant', 'partial', 'wave', 'amplitudes', 'of', 'hadron', 'decay', 'reactions', 'and', 'hadron', 'photo', 'and', 'electroproduction', 'processes', 'in', 'this', 'paper', 'we', 'consider', 'a', 'useful', 'development', 'of', 'the', 'orbital', 'angular', 'momentum', 'operator', 'expansion', 'method', 'we', 'present', 'the', 'differential', 'technique', 'allowing', 'the', 'direct', 'calculation', 'of', 'convolutions', 'of', 'two', 'orbital', 'angular', 'momentum', 'operators', 'with', 'an', 'arbitrary', 'number', 'of', 'open', 'lorentz', 'indices', 'this', 'differential', 'technique', 'greatly', 'simplifies', 'calculations', 'when', 'the', 'reaction', 'subject', 'to', 'the', 'partial', 'wave', 'analysis', 'involves', 'high', 'spin', 'particles', 'in', 'the', 'initial', 'andor', 'final', 'states', 'we', 'also', 'present', 'a', 'useful', 'generalization', 'of', 'the', 'orbital', 'angular', 'momentum', 'operators']] | [-0.15749069395544077, 0.18276221007316187, -0.12349779188392589, 0.09065930987923855, -0.10975425639103546, -0.05808005854918587, 0.011844068348485356, 0.31139728743410494, -0.24973653164623236, -0.25035341309935405, 0.012034622215044996, -0.25122743233158773, -0.06435593964825212, 0.16758138037241427, 0.049777653546900384, 0.13041812941621714, 0.12203221180027833, -0.027250516262871248, -0.09306228329013619, -0.14868271970233224, 0.3752635532744332, 0.08692915687613466, 0.19554812380078215, 0.0891940791711763, 0.13990413119447315, 0.10303408515001475, -0.10591185859542478, -0.0435957357554731, -0.12316579021043489, 0.13019701992150792, 0.2559812183974794, 0.06937766619699283, 0.19638120664145658, -0.4252724326733086, -0.1317863049916923, 0.0590819138429921, 0.17733092708685608, 0.15098594375713556, -0.02679544748496954, -0.2474056161871111, -0.015239563561475801, -0.24758394228087532, -0.20672355002413192, -0.16492443630057904, 0.044481192962309624, -0.01116571912576479, -0.30793185621775965, 0.09418694340624993, 0.051162662625925066, 0.017111252184972895, -0.05839453297408505, -0.1400010495239662, -0.06353249835471313, 0.03891460433159308, 0.055795071391104206, 0.061981791911993815, 0.1153232407954487, -0.08846979267050133, -0.11932486250858616, 0.33951928752638333, -0.036548524788856784, -0.28006796034363407, 0.10988152150012967, -0.2324971367639524, -0.12845957550841072, 0.15898584119147724, 0.20842192252382152, 0.17391137310941876, -0.186717715863105, 0.07413927026209421, 0.015656532961454812, 0.14589928003799826, 0.07641265204141813, 0.12117958542054381, 0.19274826796673653, 0.11754775355802849, 0.04994343151769566, 0.11028793228130478, -0.0999490884391384, -0.09498153068125248, -0.28994407368547936, -0.18316206375688868, -0.11943160387885722, 0.08170584352828208, -0.08156328632483362, -0.12505230016109567, 0.40432947430397487, 0.10924859644189754, 0.23143764675801826, -0.0104846917523968, 0.33887142881199167, 0.17521709427065044, 0.06907807294003389, 0.04430372358641493, 0.20561741201069067, 0.21664950811666334, 0.1899014569989285, -0.2842664003471361, 0.007607737698385285, 0.10563017933681193] |
1,802.08 | Gravitational decoupled anisotropies in compact stars | Simple generic extensions of isotropic Durgapal--Fuloria stars to the
anisotropic domain are presented. These anisotropic solutions are obtained by
guided minimal deformations over a self gravitating isotropic system. When the
isotropic and the anisotropic sector interacts in a purely gravitational
manner, the conditions to decouple both sectors by means of the minimal
geometric deformation approach are satisfied. Hence the anisotropic field
equations are isolated resulting a more treatable set. The simplicity of the
equations allows one to manipulate the anisotropies that can be implemented in
a systematic way to obtain different realistic models for anisotropic
configurations. Later on, observational effects of such anisotropies when
measuring the redshift are discussed. To conclude, the application of the
method over anisotropic solutions is generalized. In this manner, different
anisotropic sectors can be isolated of each other and modeled in a simple and
systematic way. Besides, a generic property of the minimal geometric
deformation approach, its noncommutativity, is discussed. This property
duplicates the solutions obtained through this approach; anisotropies applied
in the reversed order give different physically acceptable configurations.
| gr-qc hep-th | simple generic extensions of isotropic durgapalfuloria stars to the anisotropic domain are presented these anisotropic solutions are obtained by guided minimal deformations over a self gravitating isotropic system when the isotropic and the anisotropic sector interacts in a purely gravitational manner the conditions to decouple both sectors by means of the minimal geometric deformation approach are satisfied hence the anisotropic field equations are isolated resulting a more treatable set the simplicity of the equations allows one to manipulate the anisotropies that can be implemented in a systematic way to obtain different realistic models for anisotropic configurations later on observational effects of such anisotropies when measuring the redshift are discussed to conclude the application of the method over anisotropic solutions is generalized in this manner different anisotropic sectors can be isolated of each other and modeled in a simple and systematic way besides a generic property of the minimal geometric deformation approach its noncommutativity is discussed this property duplicates the solutions obtained through this approach anisotropies applied in the reversed order give different physically acceptable configurations | [['simple', 'generic', 'extensions', 'of', 'isotropic', 'durgapalfuloria', 'stars', 'to', 'the', 'anisotropic', 'domain', 'are', 'presented', 'these', 'anisotropic', 'solutions', 'are', 'obtained', 'by', 'guided', 'minimal', 'deformations', 'over', 'a', 'self', 'gravitating', 'isotropic', 'system', 'when', 'the', 'isotropic', 'and', 'the', 'anisotropic', 'sector', 'interacts', 'in', 'a', 'purely', 'gravitational', 'manner', 'the', 'conditions', 'to', 'decouple', 'both', 'sectors', 'by', 'means', 'of', 'the', 'minimal', 'geometric', 'deformation', 'approach', 'are', 'satisfied', 'hence', 'the', 'anisotropic', 'field', 'equations', 'are', 'isolated', 'resulting', 'a', 'more', 'treatable', 'set', 'the', 'simplicity', 'of', 'the', 'equations', 'allows', 'one', 'to', 'manipulate', 'the', 'anisotropies', 'that', 'can', 'be', 'implemented', 'in', 'a', 'systematic', 'way', 'to', 'obtain', 'different', 'realistic', 'models', 'for', 'anisotropic', 'configurations', 'later', 'on', 'observational', 'effects', 'of', 'such', 'anisotropies', 'when', 'measuring', 'the', 'redshift', 'are', 'discussed', 'to', 'conclude', 'the', 'application', 'of', 'the', 'method', 'over', 'anisotropic', 'solutions', 'is', 'generalized', 'in', 'this', 'manner', 'different', 'anisotropic', 'sectors', 'can', 'be', 'isolated', 'of', 'each', 'other', 'and', 'modeled', 'in', 'a', 'simple', 'and', 'systematic', 'way', 'besides', 'a', 'generic', 'property', 'of', 'the', 'minimal', 'geometric', 'deformation', 'approach', 'its', 'noncommutativity', 'is', 'discussed', 'this', 'property', 'duplicates', 'the', 'solutions', 'obtained', 'through', 'this', 'approach', 'anisotropies', 'applied', 'in', 'the', 'reversed', 'order', 'give', 'different', 'physically', 'acceptable', 'configurations']] | [-0.1407699870333142, 0.1466561523186309, -0.09852335059217045, 0.09918422438137765, -0.11194317595634078, -0.12078036492424352, -0.05697834008506366, 0.3630336789440896, -0.2789790191767471, -0.2755759669946773, 0.0677398891860087, -0.2504105745961923, -0.12014858068100044, 0.1988971083983779, -0.012571672624243158, 0.017514993691750403, 0.037603686239038196, -0.004883485326011266, -0.08455539136867238, -0.24469361843807358, 0.32490718473281177, 0.030477890448777804, 0.2835348068859561, -4.0775743712271965e-05, 0.09473033100898777, -0.006370983383052849, -0.03222917364261645, 0.09787748306457486, -0.1463869341651194, 0.10918319208747042, 0.22735427856804952, 0.0479620560019144, 0.1774584168248943, -0.41562093858207977, -0.23151396101340652, 0.09791768566306149, 0.13938216752239635, 0.15439614735152904, -0.04470616564196202, -0.28272522555131996, 0.08276473036834171, -0.18357977552472482, -0.19987298718254481, -0.11274726409465075, -0.018276921855285764, -0.000607461870781013, -0.26349161301340374, 0.09379461083627705, 0.0671411531684654, 0.024410151637026242, -0.09444288707837196, -0.06136198394466191, -0.022116084871813654, 0.06956513740554718, 0.044935935150299755, -0.003061670062265226, 0.11664962234773806, -0.11499069238746805, -0.07136118275645588, 0.4048533904126712, -0.04351716188647385, -0.27571410051413947, 0.17603185051253864, -0.08874372630247047, -0.10499179471550243, 0.10166906482540071, 0.1410789811531348, 0.12649063146007913, -0.18921841501474512, 0.11668101979319805, 0.004271737848009382, 0.09507930507218199, 0.05028927640989423, 0.00943364613556436, 0.2427641133711274, 0.0997708500589111, 0.05168037543871573, 0.15704428635970025, -0.001954976436016815, -0.10358460338520152, -0.3275243791937828, -0.09534822798201016, -0.13114422056291786, 0.0468614700237023, -0.1406356546619541, -0.17288382389183554, 0.40575991502297776, 0.1303414636411305, 0.1744594899857683, -0.00421593686831849, 0.2891673760541848, 0.09523316378580472, 0.04988296969926783, 0.042585868558713366, 0.26592941736270276, 0.10639010515330093, 0.07012680381403438, -0.18817050423739212, 0.03359826269160424, 0.0333207168802619] |
1,802.08001 | On the permanent of Sylvester-Hadamard matrices | We prove a conjecture due to Wanless about the permanent of Hadamard matrices
in the particular case of Sylvester-Hadamard matrices. Namely we show that for
all n greater or equal to 2, the dyadic valuation of the permanent of the
Sylvester-Hadamard matrix of order n is equal to the dyadic valuation of n!. As
a consequence, the permanent of the Sylvester-Hadamard matrix of order n
doesn't vanish for n greater or equal to 2.
| math.CO | we prove a conjecture due to wanless about the permanent of hadamard matrices in the particular case of sylvesterhadamard matrices namely we show that for all n greater or equal to 2 the dyadic valuation of the permanent of the sylvesterhadamard matrix of order n is equal to the dyadic valuation of n as a consequence the permanent of the sylvesterhadamard matrix of order n doesnt vanish for n greater or equal to 2 | [['we', 'prove', 'a', 'conjecture', 'due', 'to', 'wanless', 'about', 'the', 'permanent', 'of', 'hadamard', 'matrices', 'in', 'the', 'particular', 'case', 'of', 'sylvesterhadamard', 'matrices', 'namely', 'we', 'show', 'that', 'for', 'all', 'n', 'greater', 'or', 'equal', 'to', '2', 'the', 'dyadic', 'valuation', 'of', 'the', 'permanent', 'of', 'the', 'sylvesterhadamard', 'matrix', 'of', 'order', 'n', 'is', 'equal', 'to', 'the', 'dyadic', 'valuation', 'of', 'n', 'as', 'a', 'consequence', 'the', 'permanent', 'of', 'the', 'sylvesterhadamard', 'matrix', 'of', 'order', 'n', 'doesnt', 'vanish', 'for', 'n', 'greater', 'or', 'equal', 'to', '2']] | [-0.16905645926709514, 0.1493099896942039, 0.020148723235202802, 0.03897097386652604, -0.004467077282685283, -0.12621402263490333, 0.02256728712519681, 0.27888879995491056, -0.22286336400823012, -0.24747719161363468, 0.11786133392455962, -0.2991823971970007, -0.14363931523749252, 0.12180398844459371, -0.04024233919492847, 0.008512509080606539, -0.04476518069419104, 0.1505938912112568, -0.10139392826995636, -0.3161035814838534, 0.3227894191403647, -0.02566428130140176, 0.18432009315772638, 0.08397759138480634, 0.08310818373905243, 0.05733014605435971, 0.0006693920775039776, -0.008493564242648112, -0.07758121652187656, 0.14526284122965424, 0.2107334050375062, 0.1226616403484415, 0.2729386134777923, -0.4534301344254935, -0.07121506395334429, 0.25529186868083636, 0.116474760155118, 0.03968791268463876, 0.07564672836215815, -0.18042658104221462, 0.18699567136984016, -0.18695925785278952, -0.19352819399304083, -0.012721111752545915, 0.11093380375186333, 0.0003256236102331329, -0.35169200931449196, 0.028709473554044962, 0.1532426833149952, 0.054589167539332364, -0.020321865402464126, -0.2191453089660688, 0.03008656536002417, 0.11523951439979814, 0.04236359651691306, -0.0019225926213973278, 0.0264996330857881, -0.08530066056630096, -0.11181888049720107, 0.3815773874772964, -0.0580324631442341, -0.20109550000445262, 0.08445025118369912, -0.23314041829340765, -0.05769562464509461, 0.12143590633530875, 0.1472709817761505, 0.1264937402038659, -0.0007699908990715001, 0.11590514900917942, -0.11421399513209188, 0.17733215739497463, 0.11000865843851824, 0.0025220642029937053, 0.07565042809772028, 0.010150062294702071, 0.15959362866910728, 0.13265314506920609, -0.010623383713332383, -0.05533663599399497, -0.3061320871316098, -0.22214447109758653, -0.2568304672903331, 0.18254813978549195, -0.15232063081694414, -0.1933793202420143, 0.33930765262276336, 0.10612793510773445, 0.17858087185870958, 0.10099246778298875, 0.2163853345036104, 0.08258475368131406, 0.07316274827698598, 0.05255025571740761, 0.10824096499866731, 0.1791415255441255, 0.016684532757043034, -0.16026822782776043, 0.07949775638612541, 0.10205136890195914] |
1,802.08002 | Correlation of tunnel magnetoresistance with the magnetic properties in
perpendicular CoFeB-based junctions with exchange bias | We investigate the dependence of magnetic properties on the post-annealing
temperature/time, the thickness of soft ferromagnetic electrode and Ta dusting
layer in the pinned electrode as well as their correlation with the tunnel
magnetoresistance ratio, in a series of perpendicular magnetic tunnel junctions
of materials sequence
Ta/Pd/IrMn/CoFe/Ta$(\textit{x})$/CoFeB/MgO$(\textit{y})$/CoFeB$(\textit{z})$/Ta/Pd.
We obtain a large perpendicular exchange bias of 79.6$\,$kA/m for $x=0.3\,$nm.
For stacks with $z=1.05\,$nm, the magnetic properties of the soft electrode
resemble the characteristics of superparamagnetism. For stacks with
$x=0.4\,$nm, $y=2\,$nm, and $z=1.20\,$nm, the exchange bias presents a
significant decrease at post annealing temperature
$T_\textrm{ann}=330\,^{\circ}$C for 60 min, while the interlayer exchange
coupling and the saturation magnetization per unit area sharply decay at
$T_\textrm{ann}=340\,^{\circ}$C for 60 min. Simultaneously, the tunnel
magnetoresistance ratio shows a peak of $65.5\%$ after being annealed at
$T_\textrm{ann}=300\,^{\circ}$C for 60 min, with a significant reduction down
to $10\%$ for higher annealing temperatures
($T_\textrm{ann}\geq330\,^{\circ}$C) and down to $14\%$ for longer annealing
times ($T_\textrm{ann}=300\,^{\circ}$C for 90 min). We attribute the large
decrease of tunnel magnetoresistance ratio to the loss of exchange bias in the
pinned electrode.
| cond-mat.mtrl-sci | we investigate the dependence of magnetic properties on the postannealing temperaturetime the thickness of soft ferromagnetic electrode and ta dusting layer in the pinned electrode as well as their correlation with the tunnel magnetoresistance ratio in a series of perpendicular magnetic tunnel junctions of materials sequence tapdirmncofetatextitxcofebmgotextitycofebtextitztapd we obtain a large perpendicular exchange bias of 796kam for x03nm for stacks with z105nm the magnetic properties of the soft electrode resemble the characteristics of superparamagnetism for stacks with x04nm y2nm and z120nm the exchange bias presents a significant decrease at post annealing temperature t_textrmann330circc for 60 min while the interlayer exchange coupling and the saturation magnetization per unit area sharply decay at t_textrmann340circc for 60 min simultaneously the tunnel magnetoresistance ratio shows a peak of 655 after being annealed at t_textrmann300circc for 60 min with a significant reduction down to 10 for higher annealing temperatures t_textrmanngeq330circc and down to 14 for longer annealing times t_textrmann300circc for 90 min we attribute the large decrease of tunnel magnetoresistance ratio to the loss of exchange bias in the pinned electrode | [['we', 'investigate', 'the', 'dependence', 'of', 'magnetic', 'properties', 'on', 'the', 'postannealing', 'temperaturetime', 'the', 'thickness', 'of', 'soft', 'ferromagnetic', 'electrode', 'and', 'ta', 'dusting', 'layer', 'in', 'the', 'pinned', 'electrode', 'as', 'well', 'as', 'their', 'correlation', 'with', 'the', 'tunnel', 'magnetoresistance', 'ratio', 'in', 'a', 'series', 'of', 'perpendicular', 'magnetic', 'tunnel', 'junctions', 'of', 'materials', 'sequence', 'tapdirmncofetatextitxcofebmgotextitycofebtextitztapd', 'we', 'obtain', 'a', 'large', 'perpendicular', 'exchange', 'bias', 'of', '796kam', 'for', 'x03nm', 'for', 'stacks', 'with', 'z105nm', 'the', 'magnetic', 'properties', 'of', 'the', 'soft', 'electrode', 'resemble', 'the', 'characteristics', 'of', 'superparamagnetism', 'for', 'stacks', 'with', 'x04nm', 'y2nm', 'and', 'z120nm', 'the', 'exchange', 'bias', 'presents', 'a', 'significant', 'decrease', 'at', 'post', 'annealing', 'temperature', 't_textrmann330circc', 'for', '60', 'min', 'while', 'the', 'interlayer', 'exchange', 'coupling', 'and', 'the', 'saturation', 'magnetization', 'per', 'unit', 'area', 'sharply', 'decay', 'at', 't_textrmann340circc', 'for', '60', 'min', 'simultaneously', 'the', 'tunnel', 'magnetoresistance', 'ratio', 'shows', 'a', 'peak', 'of', '655', 'after', 'being', 'annealed', 'at', 't_textrmann300circc', 'for', '60', 'min', 'with', 'a', 'significant', 'reduction', 'down', 'to', '10', 'for', 'higher', 'annealing', 'temperatures', 't_textrmanngeq330circc', 'and', 'down', 'to', '14', 'for', 'longer', 'annealing', 'times', 't_textrmann300circc', 'for', '90', 'min', 'we', 'attribute', 'the', 'large', 'decrease', 'of', 'tunnel', 'magnetoresistance', 'ratio', 'to', 'the', 'loss', 'of', 'exchange', 'bias', 'in', 'the', 'pinned', 'electrode']] | [-0.15925953093995682, 0.16485236419851768, 0.0202456482362411, 0.028398280372706856, 0.018749908493014007, -0.15617231922735256, 0.12002753809721936, 0.41375367341154234, -0.2606740196053756, -0.407134786361783, 0.03203932847188808, -0.31858306842651674, -0.010792366186406737, 0.20746668634890783, 0.044564468516377596, -0.01327689292928681, -0.01764744403772056, -0.02230547775021788, -0.0933435106587528, -0.2309465855502001, 0.21449945762003886, 0.06009210937190801, 0.317787088249333, 0.10787737525420309, 0.06977702752493958, 0.025879624876457768, 0.1352039783928265, 0.0423419262401805, -0.12640212661950145, -0.0062991633227594745, 0.1900054953151905, -0.11336927003193102, 0.21715103419179596, -0.43911206570067784, -0.13529886092448312, -0.007002348264838319, 0.10746768902044562, 0.09417670497119926, -0.036808139308804375, -0.18340152800196735, 0.11433625229770636, -0.1157011497395238, -0.07774603909389798, -0.006172610052134387, 0.0456701331749195, 0.020469248923402076, -0.27355094978134376, 0.1495811708226073, 0.044968151406487224, 0.14026062458003985, -0.05682226875796914, -0.1581412070635252, -0.05415645273396655, 0.05995254948907021, 0.06794039597280505, 0.07874197154816967, 0.2046353703722494, -0.11743558078390978, -0.06767555208920739, 0.25653006500712167, -0.10639218005235307, -0.03813756204695759, 0.14465713992192433, -0.18819709652012623, -0.05118563691744717, 0.18759588339002575, 0.13754423829338588, 0.09873157386702099, -0.13955454143877255, 0.02870467886621155, 0.09495788747899053, 0.17984221652845805, 0.11221066708449365, 0.027201808644061135, 0.24152102547118487, 0.2174963197506192, 0.06957573997617768, 0.1816539169933715, -0.1903158305681356, -0.021657107962954152, -0.23534391704015434, -0.18924068403146344, -0.13872524674643943, 0.11856499499436922, -0.13468728057164187, -0.19186851082982995, 0.3953917183084186, 0.1351529112619507, 0.23829235257112374, 0.032672917467496565, 0.2540337813495681, 0.1061311461238713, 0.13867730768425846, 0.04105283020819515, 0.24184326215919744, 0.19768460253935036, 0.18973357835642585, -0.2682305287126815, 0.10409298287591011, -0.07189956962957228] |
1,802.08003 | Strong Valley Zeeman Effect of Dark Excitons in Monolayer Transition
Metal Dichalcogenides in a Tilted Magnetic Field | The dependence of the excitonic photoluminescence (PL) spectrum of monolayer
transition metal dichalcogenides (TMDs) on the tilt angle of an applied
magnetic field is studied. Starting from a four-band Hamiltonian we construct a
theory which quantitatively reproduces the available experimental PL spectra
for perpendicular and in-plane magnetic fields. In the presence of a tilted
magnetic field, we demonstrate that the dark exciton PL peaks brighten due to
the in-plane component of the magnetic field and split for light with different
circular polarization as a consequence of the perpendicular component of the
magnetic field. This splitting is more than twice as large as the splitting of
the bright exciton peaks in tungsten-based TMDs. We propose an experimental
setup that will allow to access the predicted splitting of the dark exciton
peaks in the PL spectrum.
| cond-mat.mes-hall | the dependence of the excitonic photoluminescence pl spectrum of monolayer transition metal dichalcogenides tmds on the tilt angle of an applied magnetic field is studied starting from a fourband hamiltonian we construct a theory which quantitatively reproduces the available experimental pl spectra for perpendicular and inplane magnetic fields in the presence of a tilted magnetic field we demonstrate that the dark exciton pl peaks brighten due to the inplane component of the magnetic field and split for light with different circular polarization as a consequence of the perpendicular component of the magnetic field this splitting is more than twice as large as the splitting of the bright exciton peaks in tungstenbased tmds we propose an experimental setup that will allow to access the predicted splitting of the dark exciton peaks in the pl spectrum | [['the', 'dependence', 'of', 'the', 'excitonic', 'photoluminescence', 'pl', 'spectrum', 'of', 'monolayer', 'transition', 'metal', 'dichalcogenides', 'tmds', 'on', 'the', 'tilt', 'angle', 'of', 'an', 'applied', 'magnetic', 'field', 'is', 'studied', 'starting', 'from', 'a', 'fourband', 'hamiltonian', 'we', 'construct', 'a', 'theory', 'which', 'quantitatively', 'reproduces', 'the', 'available', 'experimental', 'pl', 'spectra', 'for', 'perpendicular', 'and', 'inplane', 'magnetic', 'fields', 'in', 'the', 'presence', 'of', 'a', 'tilted', 'magnetic', 'field', 'we', 'demonstrate', 'that', 'the', 'dark', 'exciton', 'pl', 'peaks', 'brighten', 'due', 'to', 'the', 'inplane', 'component', 'of', 'the', 'magnetic', 'field', 'and', 'split', 'for', 'light', 'with', 'different', 'circular', 'polarization', 'as', 'a', 'consequence', 'of', 'the', 'perpendicular', 'component', 'of', 'the', 'magnetic', 'field', 'this', 'splitting', 'is', 'more', 'than', 'twice', 'as', 'large', 'as', 'the', 'splitting', 'of', 'the', 'bright', 'exciton', 'peaks', 'in', 'tungstenbased', 'tmds', 'we', 'propose', 'an', 'experimental', 'setup', 'that', 'will', 'allow', 'to', 'access', 'the', 'predicted', 'splitting', 'of', 'the', 'dark', 'exciton', 'peaks', 'in', 'the', 'pl', 'spectrum']] | [-0.1447054691944591, 0.16606266956290738, -0.08177102070802184, 0.06186163317457314, -0.05298956692107578, -0.10579912318611767, 0.013190949286174362, 0.46098500394276276, -0.2543677856395049, -0.3084492283358948, -0.05142210635492133, -0.26780289978678545, -0.09204845509227755, 0.20426835045878733, 0.07173017896155813, -0.04029589979179593, -0.026788141953744994, -0.060365728764627966, -0.035860763414443206, -0.15359304415247987, 0.3103945871238221, 0.011237991334342244, 0.32412206521952774, 0.09338067196754378, 0.02827330115042738, 0.02252641537421341, 0.09584204173897073, 0.020752785060165535, -0.12824130039229908, 0.0927654089503435, 0.2016250251986976, -0.0811919910979193, 0.18464238559757706, -0.387703252372457, -0.16633148681122198, 0.027409016514377698, 0.17500673253575702, 0.1588606089935638, -0.09058763716969753, -0.2555247158256929, 0.03351569810965613, -0.10303306843174982, -0.1373450684929336, -0.05383892171779898, 0.003019571825583924, -0.006101205382051307, -0.2573068994166913, 0.08924840940093037, 0.028715260428508547, 0.07954699325083352, -0.11071776067004052, -0.1097262222747711, -0.11622934357555055, 0.052736610702391884, 0.09765007599159631, 0.0773479869978419, 0.18159667906393087, -0.14040120579510815, -0.13265037826269366, 0.39483589106656386, -0.15009861150567522, -0.04147196741107462, 0.09876185213650035, -0.20369219599263882, -0.06466308847389449, 0.16601911868635955, 0.11742187475910716, 0.144728010190206, -0.08394324735376928, 0.0771693867751147, -0.032021195634699136, 0.17909021301233252, 0.04549647485376892, 0.09392323049216239, 0.27568429158722507, 0.1369489315226535, 0.06463344320359488, 0.15123042424292818, -0.181577383160049, -0.033756788192775604, -0.2367530471659196, -0.15236439470396335, -0.20894590534492216, 0.11499441864399879, -0.05550529842882646, -0.20491455670328004, 0.46523043102543077, 0.10355918976450477, 0.23165792580554956, -0.030070427350818055, 0.3070103455293201, 0.1440082991907526, 0.09513431753554476, 0.014594754016499466, 0.3005692486194268, 0.22631094794470205, 0.13437288952643858, -0.2797368763330907, -0.01459074617752722, -0.06501983047407399] |
1,802.08004 | The use of sampling weights in the M-quantile random-effects regression:
an application to PISA mathematics scores | M-quantile random-effects regression represents an interesting approach for
modelling multilevel data when the interest of researchers is focused on the
conditional quantiles. When data are based on complex survey designs, sampling
weights have to be incorporate in the analysis. A pseudo-likelihood approach
for accommodating sampling weights in the M-quantile random-effects regression
is presented. The proposed methodology is applied to the Italian sample of the
"Program for International Student Assessment 2015" survey in order to study
the gender gap in mathematics at various quantiles of the conditional
distribution. Findings offer a possible explanation of the low share of females
in "Science, Technology, Engineering and Mathematics" sectors.
| math.ST stat.TH | mquantile randomeffects regression represents an interesting approach for modelling multilevel data when the interest of researchers is focused on the conditional quantiles when data are based on complex survey designs sampling weights have to be incorporate in the analysis a pseudolikelihood approach for accommodating sampling weights in the mquantile randomeffects regression is presented the proposed methodology is applied to the italian sample of the program for international student assessment 2015 survey in order to study the gender gap in mathematics at various quantiles of the conditional distribution findings offer a possible explanation of the low share of females in science technology engineering and mathematics sectors | [['mquantile', 'randomeffects', 'regression', 'represents', 'an', 'interesting', 'approach', 'for', 'modelling', 'multilevel', 'data', 'when', 'the', 'interest', 'of', 'researchers', 'is', 'focused', 'on', 'the', 'conditional', 'quantiles', 'when', 'data', 'are', 'based', 'on', 'complex', 'survey', 'designs', 'sampling', 'weights', 'have', 'to', 'be', 'incorporate', 'in', 'the', 'analysis', 'a', 'pseudolikelihood', 'approach', 'for', 'accommodating', 'sampling', 'weights', 'in', 'the', 'mquantile', 'randomeffects', 'regression', 'is', 'presented', 'the', 'proposed', 'methodology', 'is', 'applied', 'to', 'the', 'italian', 'sample', 'of', 'the', 'program', 'for', 'international', 'student', 'assessment', '2015', 'survey', 'in', 'order', 'to', 'study', 'the', 'gender', 'gap', 'in', 'mathematics', 'at', 'various', 'quantiles', 'of', 'the', 'conditional', 'distribution', 'findings', 'offer', 'a', 'possible', 'explanation', 'of', 'the', 'low', 'share', 'of', 'females', 'in', 'science', 'technology', 'engineering', 'and', 'mathematics', 'sectors']] | [-0.0025102898478507997, 0.0028345361486398837, -0.1255850650680562, 0.12248642925239567, -0.12979478582163298, -0.1406167761378345, 0.05688279501739003, 0.40913588442795334, -0.2072378838922651, -0.3489950615912676, 0.10673917355348489, -0.28086729512682984, -0.1253277553555866, 0.2148586901436959, -0.12885789338144518, 0.05827514498184125, 0.06558632495857421, -0.03233114409127406, 0.004309730293295746, -0.31035507610511215, 0.2459503038475911, 0.09767127624225048, 0.38073140003141903, -0.018221279535265197, 0.0766031682685328, 0.03201292856552061, -0.10079577527496786, -0.02837649444561629, -0.11080598392124687, 0.18695639691182545, 0.36701978370547295, 0.20736226030581054, 0.4068915784403327, -0.3515851855895432, -0.20082096822027648, 0.07415225995438439, 0.0632350927994897, 0.06363732955817665, -0.013527268009437692, -0.2926503920306762, 0.00744586494263439, -0.17977616129265656, -0.0809569887949952, -0.0783497430359213, -0.008912615105509758, 0.016027840336097315, -0.31177301644125865, 0.06742052215905417, 0.024325790274001304, 0.15519413302785584, -0.026050306998548052, -0.2089180883552347, 0.013592419572662384, 0.09551166823144913, 0.07477872704067046, -0.011215910233468527, 0.08553918234649159, -0.14244409399550587, -0.14888259309033552, 0.3204719981644303, -0.0003582464763894677, -0.1856114119646095, 0.14256501521338663, -0.1415033420104356, -0.19450215303028623, 0.05347363129590771, 0.284625352670749, 0.047049163769753204, -0.17894393773001085, 0.079332604848813, -0.016692491115203927, 0.11997058688208372, 0.010823073127262649, -0.040082440605121, 0.21609607398332584, 0.23621965293284683, 0.058041260917005795, 0.11733485726262664, -0.11758217617226321, -0.1084666346648841, -0.25859396723764283, -0.14165141777623266, -0.2008191121209945, -0.05415015622330386, -0.09156028638092158, -0.16937045875404563, 0.40776492283635196, 0.21494881544439565, 0.13675489631769736, 0.03804614990727887, 0.26065435674529347, 0.09340606197005226, 0.070670728324469, 0.041963048616335506, 0.16795901807379865, 0.12560212039166974, 0.10491190409465205, -0.13618838604805725, 0.1379249144301173, -0.01714434813530672] |
1,802.08005 | Employment of Multiple Algorithms for Optimal Path-based Test Selection
Strategy | Executing various sequences of system functions in a system under test
represents one of the primary techniques in software testing. The natural way
to create effective, consistent and efficient test sequences is to model the
system under test and employ an algorithm to generate the tests that satisfy a
defined test coverage criterion. Several criteria of test set optimality can be
defined. In addition, to optimize the test set from an economic viewpoint, the
priorities of the various parts of the system model under test must be defined.
Using this prioritization, the test cases exercise the high priority parts of
the system under test more intensely than those with low priority. Evidence
from the literature and our observations confirm that finding a universal
algorithm that produces an optimal test set for all test coverage and test set
optimality criteria is a challenging task. Moreover, for different individual
problem instances, different algorithms provide optimal results. In this paper,
we present a path-based strategy to perform optimal test selection. The
strategy first employs a set of current algorithms to generate test sets; then,
it assesses the optimality of each test set by the selected criteria, and
finally, chooses the optimal test set. The experimental results confirm the
validity and usefulness of this strategy. For individual instances of 50 system
under test models, different algorithms provided optimal results; these results
varied by the required test coverage level, the size of the priority parts of
the model, and the selected test set optimality criteria.
| cs.SE | executing various sequences of system functions in a system under test represents one of the primary techniques in software testing the natural way to create effective consistent and efficient test sequences is to model the system under test and employ an algorithm to generate the tests that satisfy a defined test coverage criterion several criteria of test set optimality can be defined in addition to optimize the test set from an economic viewpoint the priorities of the various parts of the system model under test must be defined using this prioritization the test cases exercise the high priority parts of the system under test more intensely than those with low priority evidence from the literature and our observations confirm that finding a universal algorithm that produces an optimal test set for all test coverage and test set optimality criteria is a challenging task moreover for different individual problem instances different algorithms provide optimal results in this paper we present a pathbased strategy to perform optimal test selection the strategy first employs a set of current algorithms to generate test sets then it assesses the optimality of each test set by the selected criteria and finally chooses the optimal test set the experimental results confirm the validity and usefulness of this strategy for individual instances of 50 system under test models different algorithms provided optimal results these results varied by the required test coverage level the size of the priority parts of the model and the selected test set optimality criteria | [['executing', 'various', 'sequences', 'of', 'system', 'functions', 'in', 'a', 'system', 'under', 'test', 'represents', 'one', 'of', 'the', 'primary', 'techniques', 'in', 'software', 'testing', 'the', 'natural', 'way', 'to', 'create', 'effective', 'consistent', 'and', 'efficient', 'test', 'sequences', 'is', 'to', 'model', 'the', 'system', 'under', 'test', 'and', 'employ', 'an', 'algorithm', 'to', 'generate', 'the', 'tests', 'that', 'satisfy', 'a', 'defined', 'test', 'coverage', 'criterion', 'several', 'criteria', 'of', 'test', 'set', 'optimality', 'can', 'be', 'defined', 'in', 'addition', 'to', 'optimize', 'the', 'test', 'set', 'from', 'an', 'economic', 'viewpoint', 'the', 'priorities', 'of', 'the', 'various', 'parts', 'of', 'the', 'system', 'model', 'under', 'test', 'must', 'be', 'defined', 'using', 'this', 'prioritization', 'the', 'test', 'cases', 'exercise', 'the', 'high', 'priority', 'parts', 'of', 'the', 'system', 'under', 'test', 'more', 'intensely', 'than', 'those', 'with', 'low', 'priority', 'evidence', 'from', 'the', 'literature', 'and', 'our', 'observations', 'confirm', 'that', 'finding', 'a', 'universal', 'algorithm', 'that', 'produces', 'an', 'optimal', 'test', 'set', 'for', 'all', 'test', 'coverage', 'and', 'test', 'set', 'optimality', 'criteria', 'is', 'a', 'challenging', 'task', 'moreover', 'for', 'different', 'individual', 'problem', 'instances', 'different', 'algorithms', 'provide', 'optimal', 'results', 'in', 'this', 'paper', 'we', 'present', 'a', 'pathbased', 'strategy', 'to', 'perform', 'optimal', 'test', 'selection', 'the', 'strategy', 'first', 'employs', 'a', 'set', 'of', 'current', 'algorithms', 'to', 'generate', 'test', 'sets', 'then', 'it', 'assesses', 'the', 'optimality', 'of', 'each', 'test', 'set', 'by', 'the', 'selected', 'criteria', 'and', 'finally', 'chooses', 'the', 'optimal', 'test', 'set', 'the', 'experimental', 'results', 'confirm', 'the', 'validity', 'and', 'usefulness', 'of', 'this', 'strategy', 'for', 'individual', 'instances', 'of', '50', 'system', 'under', 'test', 'models', 'different', 'algorithms', 'provided', 'optimal', 'results', 'these', 'results', 'varied', 'by', 'the', 'required', 'test', 'coverage', 'level', 'the', 'size', 'of', 'the', 'priority', 'parts', 'of', 'the', 'model', 'and', 'the', 'selected', 'test', 'set', 'optimality', 'criteria']] | [-0.07807262476719916, -0.017928771533363034, -0.0921202260684222, 0.09238814991852269, -0.04534076674003154, -0.1653191749919206, 0.11713216118188575, 0.3625457699857652, -0.2136843063402921, -0.37092587260343135, 0.11534418028173968, -0.2042876929389313, -0.11541703117266297, 0.24253518035914748, -0.07051883048284799, 0.12162038932181894, 0.09532066841237247, 0.02152221490361262, -0.030880098659545184, -0.3232179801743478, 0.2994976554280147, 0.07225823737494648, 0.3517976622544229, -0.01006017041974701, 0.10944942803491722, -0.027417313562706113, -0.037635648531839254, 0.04885228940803063, -0.12526913500434603, 0.08340898318728432, 0.23409928393336304, 0.24955389337427913, 0.33116617015004157, -0.37493681970238685, -0.1206870883363299, 0.09416252530366183, 0.06483762370236218, 0.07271979516744613, -0.013757071941450703, -0.2664211081983522, 0.13924766002781688, -0.14480906664545182, -0.10842690358124674, -0.0876483331862837, -0.027189672527834774, 0.02754224341129884, -0.3600587885864079, -0.014416931600891985, 0.0280097829811275, 0.04893403979949653, -0.10448868318367749, -0.1105130354911089, 0.030720508567988872, 0.1606632293703733, 0.04756720968428999, 0.0011478665262693538, 0.12475563682056963, -0.09121729976357892, -0.16661591361649333, 0.4023435932211578, -0.009241138046432753, -0.2241992502659559, 0.21799528706632554, -0.08559676899015903, -0.13971980993496255, 0.09355858074361459, 0.20357329552527517, 0.13734188556333538, -0.2022930451259017, 0.004275717481854372, -0.08641469658911229, 0.15694223811267874, 0.06396663246303796, 0.01131219732388854, 0.18352672234922648, 0.19503663074597716, 0.08250198378739879, 0.18743035008106382, -0.07342116820439697, -0.05475130002759397, -0.32841594706010074, -0.12722151103243232, -0.17095178428618238, -0.05323246412631124, -0.10369607851054752, -0.12740669015794992, 0.4111773154474795, 0.2371803320143372, 0.1506561885792762, 0.103752839198336, 0.2897186611965299, 0.08718300402443856, 0.02132391571108019, 0.07123916939250194, 0.19624009441351517, 0.03401556293852627, 0.03161928756628186, -0.19553755940077827, 0.08128263872023672, 0.03210723373200745] |
1,802.08006 | Heat transport in insulators from ab initio Green-Kubo theory | The Green-Kubo theory of thermal transport has long be considered
incompatible with modern simulation methods based on electronic-structure
theory, because it is based on such concepts as energy density and current,
which are ill-defined at the quantum-mechanical level. Besides, experience with
classical simulations indicates that the estimate of heat-transport
coefficients requires analysing molecular trajectories that are more than one
order of magnitude longer than deemed feasible using ab initio molecular
dynamics. In this paper we report on recent theoretical advances that are
allowing one to overcome these two obstacles. First, a general gauge invariance
principle has been established, stating that thermal conductivity is
insensitive to many details of the microscopic expression for the energy
density and current from which it is derived, thus permitting to establish a
rigorous expression for the energy flux from Density-Functional Theory, from
which the conductivity can be computed in practice. Second, a novel data
analysis method based on the statistical theory of time series has been
proposed, which allows one to considerably reduce the simulation time required
to achieve a target accuracy on the computed conductivity. These concepts are
illustrated in detail, starting from a pedagogical introduction to the
Green-Kubo theory of linear response and transport, and demonstrated with a few
applications done with both classical and quantum-mechanical simulation
methods.
| cond-mat.stat-mech physics.comp-ph | the greenkubo theory of thermal transport has long be considered incompatible with modern simulation methods based on electronicstructure theory because it is based on such concepts as energy density and current which are illdefined at the quantummechanical level besides experience with classical simulations indicates that the estimate of heattransport coefficients requires analysing molecular trajectories that are more than one order of magnitude longer than deemed feasible using ab initio molecular dynamics in this paper we report on recent theoretical advances that are allowing one to overcome these two obstacles first a general gauge invariance principle has been established stating that thermal conductivity is insensitive to many details of the microscopic expression for the energy density and current from which it is derived thus permitting to establish a rigorous expression for the energy flux from densityfunctional theory from which the conductivity can be computed in practice second a novel data analysis method based on the statistical theory of time series has been proposed which allows one to considerably reduce the simulation time required to achieve a target accuracy on the computed conductivity these concepts are illustrated in detail starting from a pedagogical introduction to the greenkubo theory of linear response and transport and demonstrated with a few applications done with both classical and quantummechanical simulation methods | [['the', 'greenkubo', 'theory', 'of', 'thermal', 'transport', 'has', 'long', 'be', 'considered', 'incompatible', 'with', 'modern', 'simulation', 'methods', 'based', 'on', 'electronicstructure', 'theory', 'because', 'it', 'is', 'based', 'on', 'such', 'concepts', 'as', 'energy', 'density', 'and', 'current', 'which', 'are', 'illdefined', 'at', 'the', 'quantummechanical', 'level', 'besides', 'experience', 'with', 'classical', 'simulations', 'indicates', 'that', 'the', 'estimate', 'of', 'heattransport', 'coefficients', 'requires', 'analysing', 'molecular', 'trajectories', 'that', 'are', 'more', 'than', 'one', 'order', 'of', 'magnitude', 'longer', 'than', 'deemed', 'feasible', 'using', 'ab', 'initio', 'molecular', 'dynamics', 'in', 'this', 'paper', 'we', 'report', 'on', 'recent', 'theoretical', 'advances', 'that', 'are', 'allowing', 'one', 'to', 'overcome', 'these', 'two', 'obstacles', 'first', 'a', 'general', 'gauge', 'invariance', 'principle', 'has', 'been', 'established', 'stating', 'that', 'thermal', 'conductivity', 'is', 'insensitive', 'to', 'many', 'details', 'of', 'the', 'microscopic', 'expression', 'for', 'the', 'energy', 'density', 'and', 'current', 'from', 'which', 'it', 'is', 'derived', 'thus', 'permitting', 'to', 'establish', 'a', 'rigorous', 'expression', 'for', 'the', 'energy', 'flux', 'from', 'densityfunctional', 'theory', 'from', 'which', 'the', 'conductivity', 'can', 'be', 'computed', 'in', 'practice', 'second', 'a', 'novel', 'data', 'analysis', 'method', 'based', 'on', 'the', 'statistical', 'theory', 'of', 'time', 'series', 'has', 'been', 'proposed', 'which', 'allows', 'one', 'to', 'considerably', 'reduce', 'the', 'simulation', 'time', 'required', 'to', 'achieve', 'a', 'target', 'accuracy', 'on', 'the', 'computed', 'conductivity', 'these', 'concepts', 'are', 'illustrated', 'in', 'detail', 'starting', 'from', 'a', 'pedagogical', 'introduction', 'to', 'the', 'greenkubo', 'theory', 'of', 'linear', 'response', 'and', 'transport', 'and', 'demonstrated', 'with', 'a', 'few', 'applications', 'done', 'with', 'both', 'classical', 'and', 'quantummechanical', 'simulation', 'methods']] | [-0.05716684482677645, 0.07447424515686539, -0.12564888045971476, 0.04711542115546763, -0.05420445688935213, -0.11505278525955238, 0.026548483762023754, 0.3616109132810041, -0.24552431670125835, -0.3130941301064436, 0.09141035738920923, -0.2610805012167264, -0.15238865527221498, 0.2412353354224632, -0.017923917938673567, 0.08618862599914157, 0.06110322875252297, 0.03200622364272212, -0.08253817048389464, -0.21159707586995738, 0.25822678551207795, 0.08223225901195737, 0.299139768552295, 0.07622327456943864, 0.09435676244658764, -0.001221620615268516, -0.04917748278483402, 0.06734302587547275, -0.1283303578910797, 0.15726721449809278, 0.26068087084933594, 0.057420457875745935, 0.26454958183431004, -0.5113912301614534, -0.25913354845739206, 0.030483382355508418, 0.11102825796318262, 0.1515147090976148, -0.04108418728053018, -0.2408084579223637, 0.06966587512992149, -0.15293789667423902, -0.11072678251332756, -0.1346349750168968, 0.0026972843918862733, -0.004559812124238687, -0.24279588232802357, 0.10829307575179481, -0.015406529956259006, 0.06864542498491531, -0.04576856846214532, -0.13982434326425455, 0.004266226159538641, 0.09611056825676716, 0.05791473687669739, 0.03749628957796863, 0.13938324046429507, -0.09436568309076476, -0.11576103648647319, 0.39297872017202684, -0.046116163562252295, -0.1868763290908794, 0.21480696476389502, -0.11909078473528457, -0.131234219422304, 0.13536650163533037, 0.10735411572779074, 0.11983830486315974, -0.1916608388687289, 0.06834386465502469, 0.003902037258714784, 0.17305361433171257, 0.04171086864432234, 0.03367170156981406, 0.19817957584421303, 0.18645505722568825, 0.02376835917983594, 0.08373746611069628, -0.06222807495464939, -0.1472071527709188, -0.2757669342205275, -0.12250443218535809, -0.2238477589909074, 0.07121673190024097, -0.03428349388772784, -0.14523092922673367, 0.37070192460317253, 0.20865907842282552, 0.13784557029085104, 0.0649947211904408, 0.32946478917783256, 0.1673346164408898, 0.05439828152221433, 0.050312907650503655, 0.2521388889442003, 0.14528059871910617, 0.09405044603789615, -0.21057352768920556, 0.06772932069928407, 0.05979887814109409] |
1,802.08007 | Dependence of $T_c$ on the $q-\omega$ structure of the spin-fluctuation
spectrum | A phenomenological spin-fluctuation analysis (Ref. 1), based upon inelastic
neutron scattering (INS) and angular resolved photoemission spectroscopy
(ARPES) data for ${\rm YBCO}_{6.6}(T_c=61K)$, is used to calculate the
functional derivative of the d-wave eigenvalue $\lambda_d$ of the linearized
gap equation with respect to the imaginary part of the spin susceptibility
$\chi''(q,\omega)$ at 70K. For temperatures near $T_c$, the variation of $T_c$
with respect to $\chi''(q,\omega)$ is proportional to this functional
derivative. Based on this, we discuss how different parts of the $q$ and
$\omega$ dependent spin-fluctuation spectrum of YBCO$_{6.6}$ contribute to
$T_c$.
| cond-mat.supr-con | a phenomenological spinfluctuation analysis ref 1 based upon inelastic neutron scattering ins and angular resolved photoemission spectroscopy arpes data for rm ybco_66t_c61k is used to calculate the functional derivative of the dwave eigenvalue lambda_d of the linearized gap equation with respect to the imaginary part of the spin susceptibility chiqomega at 70k for temperatures near t_c the variation of t_c with respect to chiqomega is proportional to this functional derivative based on this we discuss how different parts of the q and omega dependent spinfluctuation spectrum of ybco_66 contribute to t_c | [['a', 'phenomenological', 'spinfluctuation', 'analysis', 'ref', '1', 'based', 'upon', 'inelastic', 'neutron', 'scattering', 'ins', 'and', 'angular', 'resolved', 'photoemission', 'spectroscopy', 'arpes', 'data', 'for', 'rm', 'ybco_66t_c61k', 'is', 'used', 'to', 'calculate', 'the', 'functional', 'derivative', 'of', 'the', 'dwave', 'eigenvalue', 'lambda_d', 'of', 'the', 'linearized', 'gap', 'equation', 'with', 'respect', 'to', 'the', 'imaginary', 'part', 'of', 'the', 'spin', 'susceptibility', 'chiqomega', 'at', '70k', 'for', 'temperatures', 'near', 't_c', 'the', 'variation', 'of', 't_c', 'with', 'respect', 'to', 'chiqomega', 'is', 'proportional', 'to', 'this', 'functional', 'derivative', 'based', 'on', 'this', 'we', 'discuss', 'how', 'different', 'parts', 'of', 'the', 'q', 'and', 'omega', 'dependent', 'spinfluctuation', 'spectrum', 'of', 'ybco_66', 'contribute', 'to', 't_c']] | [-0.1382738880896836, 0.1416551248717195, -0.10483723490896603, 0.05565568692772911, -0.1263680539062519, -0.09425016031652857, 0.0877691971849692, 0.32875270924918104, -0.2577093725584531, -0.2625918593218424, -0.011802238955036895, -0.41160480375663283, -0.0629460048558337, 0.13829427971334585, 0.07648032317670543, 0.0706426535374642, -0.07090147064077888, 0.05757992061867452, -0.14645892728036375, -0.18655605326547925, 0.3826040799907419, 0.04111259500757697, 0.26236248955005004, 0.14702084688783695, 0.033357577718888524, 0.049595832296259953, 0.05136247471320244, -0.0384062822238448, -0.20072330112746928, 0.08633200218901038, 0.3096358325290546, -0.06466935389267092, 0.17162069739522726, -0.38828497748361546, -0.19475645146050144, -0.0021436324217513707, 0.12350475489883946, 0.048527431151086695, 0.04939250732128498, -0.23151713279546815, 0.07079737740071762, -0.14267425930253072, -0.17434685527650493, -0.13335124809776297, 0.01799891238215934, -0.027026825307167313, -0.24265390224859454, 0.1819268510980385, -0.0076957885489872336, 0.06385800888071234, -0.14310208699153212, -0.18646235606538947, -0.010156046261676075, -0.01500168540632729, 0.10508587609798636, 0.11427351319639201, 0.11494276542321183, -0.06856036033962717, -0.08394798613415005, 0.2976281725081453, -0.10823410329817051, -0.1024444026642301, 0.09347748108145394, -0.21333412997675746, -0.1019178665337268, 0.1342739409610045, 0.09224615972803048, 0.12700496274936066, -0.11722788143526303, 0.1128833077264573, 0.03161615507907412, 0.23928464976338187, 0.06453392317706949, 0.04697014028441914, 0.16816273736610507, 0.18574003111623394, 0.014908522634317032, 0.08426251699834057, -0.14404134459013979, -0.031212406954989676, -0.3015525521804694, -0.10796083729149084, -0.22584236300226007, 0.05784340607907539, -0.07215401366990049, -0.1396603136940786, 0.38044911279772103, 0.16583947463254078, 0.21462661608676897, 0.004700520002607549, 0.26792050912725124, 0.20411714932389474, 0.07760717726071899, 0.03949403912980068, 0.21591156659898966, 0.20447348265416837, 0.16899769940005427, -0.40958149050979803, 0.014618782473079274, 0.00025544824141464877] |
1,802.08008 | Sounderfeit: Cloning a Physical Model with Conditional Adversarial
Autoencoders | An adversarial autoencoder conditioned on known parameters of a physical
modeling bowed string synthesizer is evaluated for use in parameter estimation
and resynthesis tasks. Latent dimensions are provided to capture variance not
explained by the conditional parameters. Results are compared with and without
the adversarial training, and a system capable of "copying" a given
parameter-signal bidirectional relationship is examined. A real-time synthesis
system built on a generative, conditioned and regularized neural network is
presented, allowing to construct engaging sound synthesizers based purely on
recorded data.
| cs.SD cs.LG eess.AS | an adversarial autoencoder conditioned on known parameters of a physical modeling bowed string synthesizer is evaluated for use in parameter estimation and resynthesis tasks latent dimensions are provided to capture variance not explained by the conditional parameters results are compared with and without the adversarial training and a system capable of copying a given parametersignal bidirectional relationship is examined a realtime synthesis system built on a generative conditioned and regularized neural network is presented allowing to construct engaging sound synthesizers based purely on recorded data | [['an', 'adversarial', 'autoencoder', 'conditioned', 'on', 'known', 'parameters', 'of', 'a', 'physical', 'modeling', 'bowed', 'string', 'synthesizer', 'is', 'evaluated', 'for', 'use', 'in', 'parameter', 'estimation', 'and', 'resynthesis', 'tasks', 'latent', 'dimensions', 'are', 'provided', 'to', 'capture', 'variance', 'not', 'explained', 'by', 'the', 'conditional', 'parameters', 'results', 'are', 'compared', 'with', 'and', 'without', 'the', 'adversarial', 'training', 'and', 'a', 'system', 'capable', 'of', 'copying', 'a', 'given', 'parametersignal', 'bidirectional', 'relationship', 'is', 'examined', 'a', 'realtime', 'synthesis', 'system', 'built', 'on', 'a', 'generative', 'conditioned', 'and', 'regularized', 'neural', 'network', 'is', 'presented', 'allowing', 'to', 'construct', 'engaging', 'sound', 'synthesizers', 'based', 'purely', 'on', 'recorded', 'data']] | [-0.06671575071578402, 0.07024179150539567, -0.04180326627656108, 0.1116493035778625, -0.13185826350846105, -0.21349811660946302, 0.042522442841713894, 0.4295433160981962, -0.2194218201163624, -0.3109847957578798, 0.08162681519890957, -0.24934806423040018, -0.1741166378460115, 0.22467787599002587, -0.14004377732496887, 0.12049057937803723, 0.09383296973205038, 0.06804632317341332, -0.03950436841253014, -0.24065352081032915, 0.29898011016138343, 0.05230194325780585, 0.33200848569339586, -0.06000082815201798, 0.21952392225336684, -0.011044905659565259, -0.0631813836295069, -0.003961557501627665, -0.061654875121478527, 0.14882362590703582, 0.25911896374254, 0.19755239117824072, 0.2809145737306348, -0.44169084707807216, -0.2733539512070517, 0.06296325441577383, 0.1026482863761928, 0.09899940401581782, -0.02677877020462239, -0.36868038520749125, 0.07113006029144994, -0.16197155008003825, 0.016864189162983427, -0.14762268289424746, -0.03024309903516301, -0.0006390528731225502, -0.3433514642806369, 0.011905822681174391, 0.07012494844717107, 0.09582915199210956, -0.06502868238437388, -0.0833551253363978, -0.039572531052510296, 0.14433000867609821, -0.0024395392226454404, 0.04136022285092622, 0.14031606557823362, -0.15392351664957546, -0.15515466775035575, 0.31738769285203444, -0.06592401754044529, -0.24627083235065497, 0.1610510014357888, 0.009028391430287488, -0.09165150271950379, 0.07735229778059181, 0.2170903851899008, 0.09749965021564137, -0.1925715525257623, 0.017362524386650573, 0.006411611573726293, 0.23222376412845083, 0.03211310500323418, -0.01920136245566287, 0.1617356070893861, 0.2802298201824583, -0.022532579938082824, 0.1689634035297093, -0.10006811546571996, -0.08274717714327078, -0.2557448486775337, -0.03467538779313188, -0.23924394900954904, -0.018596720716838416, -0.07706146409102421, -0.16765371486863365, 0.38817185075909255, 0.19812492705837248, 0.23958661766456707, 0.13880960254686042, 0.331080760939845, 0.08519598710838527, 0.05964505356470389, 0.10146976026728571, 0.15732833610049315, 0.07191294996300712, 0.09671485200635202, -0.15629693583607496, 0.15682242857292295, 0.05726454781861754] |
1,802.08009 | Iterate averaging as regularization for stochastic gradient descent | We propose and analyze a variant of the classic Polyak-Ruppert averaging
scheme, broadly used in stochastic gradient methods. Rather than a uniform
average of the iterates, we consider a weighted average, with weights decaying
in a geometric fashion. In the context of linear least squares regression, we
show that this averaging scheme has a the same regularizing effect, and indeed
is asymptotically equivalent, to ridge regression. In particular, we derive
finite-sample bounds for the proposed approach that match the best known
results for regularized stochastic gradient methods.
| cs.LG stat.ML | we propose and analyze a variant of the classic polyakruppert averaging scheme broadly used in stochastic gradient methods rather than a uniform average of the iterates we consider a weighted average with weights decaying in a geometric fashion in the context of linear least squares regression we show that this averaging scheme has a the same regularizing effect and indeed is asymptotically equivalent to ridge regression in particular we derive finitesample bounds for the proposed approach that match the best known results for regularized stochastic gradient methods | [['we', 'propose', 'and', 'analyze', 'a', 'variant', 'of', 'the', 'classic', 'polyakruppert', 'averaging', 'scheme', 'broadly', 'used', 'in', 'stochastic', 'gradient', 'methods', 'rather', 'than', 'a', 'uniform', 'average', 'of', 'the', 'iterates', 'we', 'consider', 'a', 'weighted', 'average', 'with', 'weights', 'decaying', 'in', 'a', 'geometric', 'fashion', 'in', 'the', 'context', 'of', 'linear', 'least', 'squares', 'regression', 'we', 'show', 'that', 'this', 'averaging', 'scheme', 'has', 'a', 'the', 'same', 'regularizing', 'effect', 'and', 'indeed', 'is', 'asymptotically', 'equivalent', 'to', 'ridge', 'regression', 'in', 'particular', 'we', 'derive', 'finitesample', 'bounds', 'for', 'the', 'proposed', 'approach', 'that', 'match', 'the', 'best', 'known', 'results', 'for', 'regularized', 'stochastic', 'gradient', 'methods']] | [-0.05327546228547634, -0.00808709721220122, -0.14319515089643584, 0.1365948936195466, -0.05475082960857571, -0.15930939234001026, 0.04676912855571029, 0.4182125434557768, -0.2724005037399501, -0.24124744488193986, 0.11290844075178363, -0.2323196818088663, -0.20293775457760382, 0.17711341989376508, -0.11829195219766477, 0.09224362101174366, 0.0600568578557122, 0.03517065352449814, -0.11678575003391196, -0.3100121536201144, 0.2644480205804709, 0.04922611469231632, 0.2926497175947003, -0.04262505742405466, 0.16676332645256062, 0.020916102336312848, -0.03230300653811501, 0.08036689293281786, -0.12577608300071216, 0.14750092404883827, 0.20157246805470566, 0.0995409380558921, 0.36178172909622563, -0.3649729649782523, -0.22505819547289832, 0.14457462839755475, 0.17878464271044145, 0.1052836945558759, -0.031009643477783806, -0.19976503672827592, 0.10292264083989136, -0.14118149884087944, -0.07514724029420779, -0.0811984022442337, -0.07492167425031464, 0.04225100233251679, -0.36247359852081745, 0.1069998936540308, 0.09460685372181322, 0.024945787496693517, -0.05309446491889827, -0.16885072149466135, 0.07233194942618239, 0.027826492423084617, 0.05606538076060771, 0.01227986162806722, 0.07843112632439568, -0.07610440078384147, -0.14982646722988835, 0.3238924639138939, -0.1753874250298604, -0.2348377173632683, 0.14199078482329502, -0.08050572928897608, -0.12809302068005005, 0.0625137500224057, 0.21824600177699294, 0.18430428787123884, -0.14973709031125937, 0.05336473046015177, -0.09351655014458744, 0.12162047880434099, 0.023192217252377807, -0.0070857026710592465, 0.07298753060528944, 0.16263188303972798, 0.17014747753273696, 0.16930876707861564, -0.10974191196648211, -0.12961862838944826, -0.28983168615477867, -0.11573033972279351, -0.15882384292941926, -0.01858229088415017, -0.14805545009259166, -0.18924192568667275, 0.3790898479539841, 0.16949989401531973, 0.2296238724656146, 0.16380345791139395, 0.317926162479167, 0.1547749419857202, 0.03868340274276233, 0.155210023815476, 0.2306599608279936, 0.14034363621546106, 0.041185452689780674, -0.20479145095330373, 0.09676820141980531, 0.14520884512912954] |
1,802.0801 | Towards an Understanding of Entity-Oriented Search Intents | Entity-oriented search deals with a wide variety of information needs, from
displaying direct answers to interacting with services. In this work, we aim to
understand what are prominent entity-oriented search intents and how they can
be fulfilled. We develop a scheme of entity intent categories, and use them to
annotate a sample of queries. Specifically, we annotate unique query refiners
on the level of entity types. We observe that, on average, over half of those
refiners seek to interact with a service, while over a quarter of the refiners
search for information that may be looked up in a knowledge base.
| cs.IR cs.AI cs.CL | entityoriented search deals with a wide variety of information needs from displaying direct answers to interacting with services in this work we aim to understand what are prominent entityoriented search intents and how they can be fulfilled we develop a scheme of entity intent categories and use them to annotate a sample of queries specifically we annotate unique query refiners on the level of entity types we observe that on average over half of those refiners seek to interact with a service while over a quarter of the refiners search for information that may be looked up in a knowledge base | [['entityoriented', 'search', 'deals', 'with', 'a', 'wide', 'variety', 'of', 'information', 'needs', 'from', 'displaying', 'direct', 'answers', 'to', 'interacting', 'with', 'services', 'in', 'this', 'work', 'we', 'aim', 'to', 'understand', 'what', 'are', 'prominent', 'entityoriented', 'search', 'intents', 'and', 'how', 'they', 'can', 'be', 'fulfilled', 'we', 'develop', 'a', 'scheme', 'of', 'entity', 'intent', 'categories', 'and', 'use', 'them', 'to', 'annotate', 'a', 'sample', 'of', 'queries', 'specifically', 'we', 'annotate', 'unique', 'query', 'refiners', 'on', 'the', 'level', 'of', 'entity', 'types', 'we', 'observe', 'that', 'on', 'average', 'over', 'half', 'of', 'those', 'refiners', 'seek', 'to', 'interact', 'with', 'a', 'service', 'while', 'over', 'a', 'quarter', 'of', 'the', 'refiners', 'search', 'for', 'information', 'that', 'may', 'be', 'looked', 'up', 'in', 'a', 'knowledge', 'base']] | [-0.10793930246024439, 0.03459105813543838, -0.07050567975562841, 0.08292277770849996, -0.16170532311229865, -0.16431687148011262, 0.13394136522380212, 0.4263548604627647, -0.2579034509801186, -0.372194565924825, 0.07082753463839596, -0.31876753753807285, -0.09278692028918627, 0.1689603270543278, -0.07981340825041332, -0.0224581272940677, 0.05899176358863121, 0.11259147593069195, -0.041275778841826656, -0.27510174559337075, 0.32755839297234424, 0.03138808548763985, 0.23109064454046807, 0.016867127140412237, 0.05229287322997899, -0.014013041811303632, -0.08302016500475826, 0.016000611444769223, -0.11697622110659722, 0.16885878776930882, 0.3406572795800385, 0.20565100290379165, 0.2997711627642707, -0.3848902448768454, -0.14374259273097437, 0.10059807443585579, 0.1580944707165334, 0.09274582287537551, -0.03536205608997088, -0.30243385069321216, 0.11496248946059495, -0.18042842910099444, -0.06585534881468456, -0.08834831173172092, -0.011027182576864367, 0.03016115221976404, -0.240196330509711, -0.02617340153636466, 0.028204829528890918, 0.05062085768613633, -0.05115411184280926, -0.028189558356004483, 0.038152937613667386, 0.1861044523804126, 0.00418451709884892, 0.021192698174970003, 0.10242130348256023, -0.15234324610722944, -0.16115553380280623, 0.41295138563923905, -0.05547697754982527, -0.17040423225924964, 0.22927504569513374, -0.1135549172413268, -0.140973225285502, 0.12439514017412623, 0.24387502056168447, 0.11676567077341646, -0.1796174918550371, 0.009292346470306932, -0.062176708556195295, 0.21516258009976827, 0.07040141194155163, 0.0389121026999437, 0.24605708326314493, 0.19702028769003874, 0.06311637087549904, 0.1290028352580854, -0.04203108949200619, -0.0758864022722228, -0.22953479189315054, -0.19208641136802806, -0.12278301226168797, 0.06753375943713259, -0.026547434839470738, -0.11665356857702136, 0.39343338194982547, 0.22118666193460687, 0.20495325161402325, 0.057747496029196106, 0.2484575331690583, 0.008599373475085981, 0.10241938814391742, 0.07445631693993317, 0.13671466831283846, -0.00990479272135561, 0.13206073149374806, -0.10131732674804286, 0.08056588641755136, 0.017929846854271864] |
1,802.08011 | Ruijsenaars-Schneider three-body models with N=2 supersymmetry | The Ruijsenaars-Schneider models are conventionally regarded as relativistic
generalizations of the Calogero integrable systems. Surprisingly enough, their
supersymmetric generalizations escaped attention. In this work, N=2
supersymmetric extensions of the rational and hyperbolic Ruijsenaars-Schneider
three-body models are constructed within the framework of the Hamiltonian
formalism. It is also known that the rational model can be described by the
geodesic equations associated with a metric connection. We demonstrate that the
hyperbolic systems are linked to non-metric connections.
| hep-th math-ph math.MP | the ruijsenaarsschneider models are conventionally regarded as relativistic generalizations of the calogero integrable systems surprisingly enough their supersymmetric generalizations escaped attention in this work n2 supersymmetric extensions of the rational and hyperbolic ruijsenaarsschneider threebody models are constructed within the framework of the hamiltonian formalism it is also known that the rational model can be described by the geodesic equations associated with a metric connection we demonstrate that the hyperbolic systems are linked to nonmetric connections | [['the', 'ruijsenaarsschneider', 'models', 'are', 'conventionally', 'regarded', 'as', 'relativistic', 'generalizations', 'of', 'the', 'calogero', 'integrable', 'systems', 'surprisingly', 'enough', 'their', 'supersymmetric', 'generalizations', 'escaped', 'attention', 'in', 'this', 'work', 'n2', 'supersymmetric', 'extensions', 'of', 'the', 'rational', 'and', 'hyperbolic', 'ruijsenaarsschneider', 'threebody', 'models', 'are', 'constructed', 'within', 'the', 'framework', 'of', 'the', 'hamiltonian', 'formalism', 'it', 'is', 'also', 'known', 'that', 'the', 'rational', 'model', 'can', 'be', 'described', 'by', 'the', 'geodesic', 'equations', 'associated', 'with', 'a', 'metric', 'connection', 'we', 'demonstrate', 'that', 'the', 'hyperbolic', 'systems', 'are', 'linked', 'to', 'nonmetric', 'connections']] | [-0.10726088970899582, 0.13200533404635886, -0.05672221451997757, 0.17086364451795816, -0.09737307717402777, -0.2119744261726737, -0.07998012818396091, 0.3096959687769413, -0.25342414891347287, -0.23778351777543624, 0.07899472926898549, -0.3088662748783827, -0.25482951355477174, 0.18201272894628345, -0.0755259852639089, 0.0798436704898874, 0.047734981986383596, 0.06280160481731097, -0.1081527836744984, -0.245659041578571, 0.3192206789413467, 0.011365900250772635, 0.15070622396965822, 0.020617280192576193, 0.10614242933690549, -0.009943445231765508, -0.006748491668452819, 0.025730131914218267, -0.12300230967909252, 0.1364610836158196, 0.24257535048265708, 0.07311767453948657, 0.15918810717140636, -0.3842435642083486, -0.2553976113721728, 0.14772138808077823, 0.19808542569478352, 0.1017251472764959, 0.002380994285146395, -0.305108654871583, 0.0069433268097539745, -0.2425206346809864, -0.23469141734065488, -0.09639024194329977, -0.00151996162875245, 0.03617738331357638, -0.17192260882506769, 0.05106963299486476, 0.10773947967837254, 0.010931775827581683, -0.07035019862776001, -0.05862846148510774, -0.09011893913149834, 0.04577708095933, 0.04061934507451952, 0.01033784843981266, 0.06679840605705976, -0.09612775329810877, -0.17100905240202943, 0.45164866030216216, -0.026955772604172427, -0.3394493391737342, 0.1824006703744332, -0.078317010315756, -0.17643183400854467, 0.09668656144291163, 0.15597175784409045, 0.14238332125668723, -0.1548849416896701, 0.20338879643561086, -0.09401637421300015, 0.06316578611110647, 0.056637622450167936, 0.016868341093262035, 0.23297997797528902, 0.09495697332546114, -0.02160175518443187, 0.12426896737733235, 0.04384787371925389, -0.2363955627133449, -0.3388301466902097, -0.10597334161987722, -0.15648284627745548, 0.08204480157544215, -0.06852647582049637, -0.16213496193289756, 0.36094893713792164, 0.10597841409966349, 0.1583551621933778, 0.11317278642828266, 0.19964852278431255, 0.13218804013604918, 0.0814823896655192, 0.020628384221345185, 0.2589046937351425, 0.2130523360799998, 0.033767667387922605, -0.1888898567801031, -0.04324292614435156, 0.16808313144991796] |
1,802.08012 | Learning Topic Models by Neighborhood Aggregation | Topic models are frequently used in machine learning owing to their high
interpretability and modular structure. However, extending a topic model to
include a supervisory signal, to incorporate pre-trained word embedding vectors
and to include a nonlinear output function is not an easy task because one has
to resort to a highly intricate approximate inference procedure. The present
paper shows that topic modeling with pre-trained word embedding vectors can be
viewed as implementing a neighborhood aggregation algorithm where messages are
passed through a network defined over words. From the network view of topic
models, nodes correspond to words in a document and edges correspond to either
a relationship describing co-occurring words in a document or a relationship
describing the same word in the corpus. The network view allows us to extend
the model to include supervisory signals, incorporate pre-trained word
embedding vectors and include a nonlinear output function in a simple manner.
In experiments, we show that our approach outperforms the state-of-the-art
supervised Latent Dirichlet Allocation implementation in terms of held-out
document classification tasks.
| stat.ML cs.LG | topic models are frequently used in machine learning owing to their high interpretability and modular structure however extending a topic model to include a supervisory signal to incorporate pretrained word embedding vectors and to include a nonlinear output function is not an easy task because one has to resort to a highly intricate approximate inference procedure the present paper shows that topic modeling with pretrained word embedding vectors can be viewed as implementing a neighborhood aggregation algorithm where messages are passed through a network defined over words from the network view of topic models nodes correspond to words in a document and edges correspond to either a relationship describing cooccurring words in a document or a relationship describing the same word in the corpus the network view allows us to extend the model to include supervisory signals incorporate pretrained word embedding vectors and include a nonlinear output function in a simple manner in experiments we show that our approach outperforms the stateoftheart supervised latent dirichlet allocation implementation in terms of heldout document classification tasks | [['topic', 'models', 'are', 'frequently', 'used', 'in', 'machine', 'learning', 'owing', 'to', 'their', 'high', 'interpretability', 'and', 'modular', 'structure', 'however', 'extending', 'a', 'topic', 'model', 'to', 'include', 'a', 'supervisory', 'signal', 'to', 'incorporate', 'pretrained', 'word', 'embedding', 'vectors', 'and', 'to', 'include', 'a', 'nonlinear', 'output', 'function', 'is', 'not', 'an', 'easy', 'task', 'because', 'one', 'has', 'to', 'resort', 'to', 'a', 'highly', 'intricate', 'approximate', 'inference', 'procedure', 'the', 'present', 'paper', 'shows', 'that', 'topic', 'modeling', 'with', 'pretrained', 'word', 'embedding', 'vectors', 'can', 'be', 'viewed', 'as', 'implementing', 'a', 'neighborhood', 'aggregation', 'algorithm', 'where', 'messages', 'are', 'passed', 'through', 'a', 'network', 'defined', 'over', 'words', 'from', 'the', 'network', 'view', 'of', 'topic', 'models', 'nodes', 'correspond', 'to', 'words', 'in', 'a', 'document', 'and', 'edges', 'correspond', 'to', 'either', 'a', 'relationship', 'describing', 'cooccurring', 'words', 'in', 'a', 'document', 'or', 'a', 'relationship', 'describing', 'the', 'same', 'word', 'in', 'the', 'corpus', 'the', 'network', 'view', 'allows', 'us', 'to', 'extend', 'the', 'model', 'to', 'include', 'supervisory', 'signals', 'incorporate', 'pretrained', 'word', 'embedding', 'vectors', 'and', 'include', 'a', 'nonlinear', 'output', 'function', 'in', 'a', 'simple', 'manner', 'in', 'experiments', 'we', 'show', 'that', 'our', 'approach', 'outperforms', 'the', 'stateoftheart', 'supervised', 'latent', 'dirichlet', 'allocation', 'implementation', 'in', 'terms', 'of', 'heldout', 'document', 'classification', 'tasks']] | [-0.03741102097234849, -0.0023686447582741523, -0.06851475957470636, 0.08350397874373706, -0.20449963739495083, -0.1819877305971967, 0.05840373488782702, 0.4372689689498866, -0.33266112610869025, -0.3029795031453986, 0.04327479240166066, -0.29343633228070276, -0.17711092352508515, 0.15548581039852827, -0.11592353638208032, 0.051291096885956226, 0.1378248107202094, 0.10117581975913939, -0.056868446276967424, -0.25722684494578335, 0.29047511832055306, 0.0357040050332488, 0.3346984637927949, -0.04120787873799945, 0.14686764755698414, -0.006322328476288795, -0.07526821640989845, -0.023816968120993168, -0.031058885058506538, 0.16357373418393492, 0.38566230639639537, 0.2000048894718846, 0.32223659551076206, -0.4003561012200669, -0.25742111625363945, 0.10113654046148148, 0.16420850725630406, 0.12609855575893802, 0.019721181448361696, -0.30792424009963015, 0.07078168478301973, -0.20711353676655897, 0.04621753751182522, -0.1228362854376794, -0.031294996140995755, -0.009742853684008292, -0.2929115636068819, 0.033577989572766184, 0.11726966224899836, 0.05167192450988651, -0.050074518255785044, -0.09265202547198739, 0.02548771444306677, 0.13949128981256836, 0.03784333100949211, 0.09192471325413548, 0.1206657563191678, -0.17126948413861937, -0.16627751532192717, 0.3840637762131619, -0.06531874283655793, -0.27795116270453424, 0.18315605683006003, -0.015050283153461099, -0.15015162021489065, 0.06537847853420924, 0.26265541393237574, 0.055023110953384434, -0.16513037495616148, 0.05025192661024898, -0.0613297084239365, 0.22620304258427873, 0.07001827937288574, -0.009874431025665039, 0.2088571908755292, 0.23830205423693204, -0.002039838376208797, 0.15523495903203863, -0.06371134829984432, -0.07206609892128998, -0.21046162522016576, -0.10361191665421872, -0.1831586525371384, -0.03928980873434352, -0.09110605750124548, -0.1920135285940835, 0.43004064629625144, 0.23381476856008088, 0.2575904338690185, 0.10319026054054413, 0.26226279987343426, 0.04243232952644942, 0.10888811658623618, 0.12435615489803972, 0.10058589660744557, 0.07114988628335982, 0.09756113055908795, -0.09644849873656386, 0.10326481859558316, 0.09292174236254831] |
1,802.08013 | Intrinsic Motivation and Mental Replay enable Efficient Online
Adaptation in Stochastic Recurrent Networks | Autonomous robots need to interact with unknown, unstructured and changing
environments, constantly facing novel challenges. Therefore, continuous online
adaptation for lifelong-learning and the need of sample-efficient mechanisms to
adapt to changes in the environment, the constraints, the tasks, or the robot
itself are crucial. In this work, we propose a novel framework for
probabilistic online motion planning with online adaptation based on a
bio-inspired stochastic recurrent neural network. By using learning signals
which mimic the intrinsic motivation signalcognitive dissonance in addition
with a mental replay strategy to intensify experiences, the stochastic
recurrent network can learn from few physical interactions and adapts to novel
environments in seconds. We evaluate our online planning and adaptation
framework on an anthropomorphic KUKA LWR arm. The rapid online adaptation is
shown by learning unknown workspace constraints sample-efficiently from few
physical interactions while following given way points.
| cs.AI cs.LG cs.RO stat.ML | autonomous robots need to interact with unknown unstructured and changing environments constantly facing novel challenges therefore continuous online adaptation for lifelonglearning and the need of sampleefficient mechanisms to adapt to changes in the environment the constraints the tasks or the robot itself are crucial in this work we propose a novel framework for probabilistic online motion planning with online adaptation based on a bioinspired stochastic recurrent neural network by using learning signals which mimic the intrinsic motivation signalcognitive dissonance in addition with a mental replay strategy to intensify experiences the stochastic recurrent network can learn from few physical interactions and adapts to novel environments in seconds we evaluate our online planning and adaptation framework on an anthropomorphic kuka lwr arm the rapid online adaptation is shown by learning unknown workspace constraints sampleefficiently from few physical interactions while following given way points | [['autonomous', 'robots', 'need', 'to', 'interact', 'with', 'unknown', 'unstructured', 'and', 'changing', 'environments', 'constantly', 'facing', 'novel', 'challenges', 'therefore', 'continuous', 'online', 'adaptation', 'for', 'lifelonglearning', 'and', 'the', 'need', 'of', 'sampleefficient', 'mechanisms', 'to', 'adapt', 'to', 'changes', 'in', 'the', 'environment', 'the', 'constraints', 'the', 'tasks', 'or', 'the', 'robot', 'itself', 'are', 'crucial', 'in', 'this', 'work', 'we', 'propose', 'a', 'novel', 'framework', 'for', 'probabilistic', 'online', 'motion', 'planning', 'with', 'online', 'adaptation', 'based', 'on', 'a', 'bioinspired', 'stochastic', 'recurrent', 'neural', 'network', 'by', 'using', 'learning', 'signals', 'which', 'mimic', 'the', 'intrinsic', 'motivation', 'signalcognitive', 'dissonance', 'in', 'addition', 'with', 'a', 'mental', 'replay', 'strategy', 'to', 'intensify', 'experiences', 'the', 'stochastic', 'recurrent', 'network', 'can', 'learn', 'from', 'few', 'physical', 'interactions', 'and', 'adapts', 'to', 'novel', 'environments', 'in', 'seconds', 'we', 'evaluate', 'our', 'online', 'planning', 'and', 'adaptation', 'framework', 'on', 'an', 'anthropomorphic', 'kuka', 'lwr', 'arm', 'the', 'rapid', 'online', 'adaptation', 'is', 'shown', 'by', 'learning', 'unknown', 'workspace', 'constraints', 'sampleefficiently', 'from', 'few', 'physical', 'interactions', 'while', 'following', 'given', 'way', 'points']] | [-0.07003555289533772, 0.07059878425808046, -0.06612558283023132, 0.02879219664770273, -0.18930512550624384, -0.1980124427498305, 0.05839082701498663, 0.4652997371673152, -0.3011769028009334, -0.35376885527933855, 0.08982374020717174, -0.20024547232247458, -0.25930715425351664, 0.1479674988794073, -0.17873266560659892, 0.08278029972174461, 0.08157041134056298, 0.024096948985496292, -0.0021777382218346433, -0.2071469174394303, 0.29352176266695384, 0.03916509876000709, 0.27610188096329785, -0.009953790073505725, 0.17201261150826147, 0.028954594276265067, -0.040142005640149546, -0.04656466121778594, -0.04638577237441812, 0.15537482688665952, 0.32166439560883126, 0.1961097998639056, 0.3766446189576949, -0.49221812570602563, -0.22008760264683244, 0.10452200754788583, 0.1512083881294213, 0.09740981001970425, -0.07109454873547741, -0.3794208347959363, 0.03256335560961262, -0.1769424869031038, -0.049035614768070154, -0.10577453402262452, -0.014865295176961175, 0.023271526354685615, -0.30251749316981214, -0.023071874739548217, 0.03644653153943195, 0.049585936305895986, -0.09338447710067249, -0.04016094256286928, 0.07270490781208365, 0.1970541290415829, 0.028049962401079636, 0.06487958646460396, 0.22770680805357793, -0.15579489742162547, -0.18180387948666685, 0.3669715275502075, -0.014943968848851711, -0.22317164137527562, 0.23735113391328766, 0.00952986913625205, -0.17133899207523876, 0.09545893759291241, 0.3057262185417737, 0.09938017702728942, -0.2387366457639829, 0.0027606500602880683, 0.029947414315994018, 0.15659303186744775, -0.013334317461830442, -0.03811079288657377, 0.1761896649773732, 0.27425372325207875, 0.08826928036422402, 0.11586246199473954, -0.037539098651377834, -0.13151372908412115, -0.20661851192910588, -0.06916971094703869, -0.1411645121541738, -0.015234721622065357, -0.09155566107981122, -0.1091280675266888, 0.3718629806315985, 0.22736166996975848, 0.19563544495031238, 0.10084574374765076, 0.372044302361167, -0.006497447705402485, 0.07673080064410316, 0.14299751137234812, 0.1769072524718164, -0.029385294383931636, 0.20141983591863696, -0.20741915187892923, 0.17082512964818464, 0.012298946213179632] |
1,802.08014 | Finding Top-k Optimal Sequenced Routes -- Full Version | Motivated by many practical applications in logistics and
mobility-as-a-service, we study the top-k optimal sequenced routes (KOSR)
querying on large, general graphs where the edge weights may not satisfy the
triangle inequality, e.g., road network graphs with travel times as edge
weights. The KOSR querying strives to find the top-k optimal routes (i.e., with
the top-k minimal total costs) from a given source to a given destination,
which must visit a number of vertices with specific vertex categories (e.g.,
gas stations, restaurants, and shopping malls) in a particular order (e.g.,
visiting gas stations before restaurants and then shopping malls).
To efficiently find the top-k optimal sequenced routes, we propose two
algorithms PruningKOSR and StarKOSR. In PruningKOSR, we define a dominance
relationship between two partially-explored routes. The partially-explored
routes that can be dominated by other partially-explored routes are postponed
being extended, which leads to a smaller searching space and thus improves
efficiency. In StarKOSR, we further improve the efficiency by extending routes
in an A* manner. With the help of a judiciously designed heuristic estimation
that works for general graphs, the cost of partially explored routes to the
destination can be estimated such that the qualified complete routes can be
found early. In addition, we demonstrate the high extensibility of the proposed
algorithms by incorporating Hop Labeling, an effective label indexing technique
for shortest path queries, to further improve efficiency. Extensive experiments
on multiple real-world graphs demonstrate that the proposed methods
significantly outperform the baseline method. Furthermore, when k=1, StarKOSR
also outperforms the state-of-the-art method for the optimal sequenced route
queries.
| cs.DB cs.DS | motivated by many practical applications in logistics and mobilityasaservice we study the topk optimal sequenced routes kosr querying on large general graphs where the edge weights may not satisfy the triangle inequality eg road network graphs with travel times as edge weights the kosr querying strives to find the topk optimal routes ie with the topk minimal total costs from a given source to a given destination which must visit a number of vertices with specific vertex categories eg gas stations restaurants and shopping malls in a particular order eg visiting gas stations before restaurants and then shopping malls to efficiently find the topk optimal sequenced routes we propose two algorithms pruningkosr and starkosr in pruningkosr we define a dominance relationship between two partiallyexplored routes the partiallyexplored routes that can be dominated by other partiallyexplored routes are postponed being extended which leads to a smaller searching space and thus improves efficiency in starkosr we further improve the efficiency by extending routes in an a manner with the help of a judiciously designed heuristic estimation that works for general graphs the cost of partially explored routes to the destination can be estimated such that the qualified complete routes can be found early in addition we demonstrate the high extensibility of the proposed algorithms by incorporating hop labeling an effective label indexing technique for shortest path queries to further improve efficiency extensive experiments on multiple realworld graphs demonstrate that the proposed methods significantly outperform the baseline method furthermore when k1 starkosr also outperforms the stateoftheart method for the optimal sequenced route queries | [['motivated', 'by', 'many', 'practical', 'applications', 'in', 'logistics', 'and', 'mobilityasaservice', 'we', 'study', 'the', 'topk', 'optimal', 'sequenced', 'routes', 'kosr', 'querying', 'on', 'large', 'general', 'graphs', 'where', 'the', 'edge', 'weights', 'may', 'not', 'satisfy', 'the', 'triangle', 'inequality', 'eg', 'road', 'network', 'graphs', 'with', 'travel', 'times', 'as', 'edge', 'weights', 'the', 'kosr', 'querying', 'strives', 'to', 'find', 'the', 'topk', 'optimal', 'routes', 'ie', 'with', 'the', 'topk', 'minimal', 'total', 'costs', 'from', 'a', 'given', 'source', 'to', 'a', 'given', 'destination', 'which', 'must', 'visit', 'a', 'number', 'of', 'vertices', 'with', 'specific', 'vertex', 'categories', 'eg', 'gas', 'stations', 'restaurants', 'and', 'shopping', 'malls', 'in', 'a', 'particular', 'order', 'eg', 'visiting', 'gas', 'stations', 'before', 'restaurants', 'and', 'then', 'shopping', 'malls', 'to', 'efficiently', 'find', 'the', 'topk', 'optimal', 'sequenced', 'routes', 'we', 'propose', 'two', 'algorithms', 'pruningkosr', 'and', 'starkosr', 'in', 'pruningkosr', 'we', 'define', 'a', 'dominance', 'relationship', 'between', 'two', 'partiallyexplored', 'routes', 'the', 'partiallyexplored', 'routes', 'that', 'can', 'be', 'dominated', 'by', 'other', 'partiallyexplored', 'routes', 'are', 'postponed', 'being', 'extended', 'which', 'leads', 'to', 'a', 'smaller', 'searching', 'space', 'and', 'thus', 'improves', 'efficiency', 'in', 'starkosr', 'we', 'further', 'improve', 'the', 'efficiency', 'by', 'extending', 'routes', 'in', 'an', 'a', 'manner', 'with', 'the', 'help', 'of', 'a', 'judiciously', 'designed', 'heuristic', 'estimation', 'that', 'works', 'for', 'general', 'graphs', 'the', 'cost', 'of', 'partially', 'explored', 'routes', 'to', 'the', 'destination', 'can', 'be', 'estimated', 'such', 'that', 'the', 'qualified', 'complete', 'routes', 'can', 'be', 'found', 'early', 'in', 'addition', 'we', 'demonstrate', 'the', 'high', 'extensibility', 'of', 'the', 'proposed', 'algorithms', 'by', 'incorporating', 'hop', 'labeling', 'an', 'effective', 'label', 'indexing', 'technique', 'for', 'shortest', 'path', 'queries', 'to', 'further', 'improve', 'efficiency', 'extensive', 'experiments', 'on', 'multiple', 'realworld', 'graphs', 'demonstrate', 'that', 'the', 'proposed', 'methods', 'significantly', 'outperform', 'the', 'baseline', 'method', 'furthermore', 'when', 'k1', 'starkosr', 'also', 'outperforms', 'the', 'stateoftheart', 'method', 'for', 'the', 'optimal', 'sequenced', 'route', 'queries']] | [-0.12033098861529473, 0.08956674692944587, -0.02242998529736902, 0.04850567767770925, -0.10463529813340773, -0.18294318891769532, 0.17372972645166823, 0.43838533042729194, -0.2870872838166999, -0.3373479810379007, 0.08322064429886786, -0.30843528053431096, -0.1450710991726202, 0.1769154010587098, -0.10653274362386368, 0.06046361940657245, 0.12173104355312592, 0.03800848687259371, -0.01708455469810824, -0.3041033499298946, 0.24903140341698685, 0.058848162283938306, 0.28838173988841326, 0.07455340507782666, 0.07147969325534159, -0.0029746359049835627, -0.02903884987965427, 0.042636049250209265, -0.11300523209570469, 0.13208865949874926, 0.323890387321658, 0.20042733779432728, 0.2788051093106761, -0.41660488810317187, -0.2033114827799556, 0.13754427777238043, 0.1615504969076331, 0.08175695671188626, -0.019736255129214886, -0.2957700645879788, 0.10560369660721763, -0.16493397626715403, -0.04601942017382266, -0.05361097859602203, 0.0059385642318018515, 0.04355950534763728, -0.29979158143385076, -0.00841591527626174, -0.011465803698143538, -0.010696121247590283, -0.02663634340004886, -0.11352257703284861, -0.0069056376340050326, 0.17449881181964882, 0.017197067196499192, 0.038280113621194864, 0.12121785305093463, -0.10270968149165056, -0.2144475861023381, 0.3905827034922207, 0.004418304865248501, -0.17647605428983476, 0.16650569862046954, -0.037304690038310544, -0.1316631468085974, 0.11613562025732416, 0.19401267760378474, 0.1464319258407854, -0.17390551814043612, -0.01009785481705787, -0.03617132249854359, 0.1097570984428018, 0.11884295768652331, 0.02696927982501174, 0.16408992447954826, 0.1965628751955342, 0.15730521450385304, 0.14489696068328567, -0.058258497589906935, -0.06897364269631605, -0.18153209784547525, -0.13698359803415325, -0.17868447613391075, -0.027776582182702316, -0.1541396801649278, -0.10583797416777588, 0.382696782083561, 0.20144782888973542, 0.18923634800023637, 0.10073257149105855, 0.30647503634750406, 0.02799579499280263, 0.07454122700454557, 0.1654407827941445, 0.13867750133515572, -0.025305712879544088, 0.08864110322468274, -0.18257580391889183, 0.12495366971136308, 0.05514158025183076] |
1,802.08015 | Spanned lines and Langer's inequality | We collect some results in combinatorial geometry that follow from an
inequality of Langer in algebraic geometry. Langer's inequality gives a lower
bound on the number of incidences between a point set and its spanned lines,
and was recently used by Han to improve the constant in the weak Dirac
conjecture. Here we observe that this inequality also leads to improved
constants in Beck's theorem, which states that a finite point set in the real
or complex plane has many points on a line or spans many lines. Most of the
proofs that we use are not original, and the goal of this note is mainly to
carefully record the quantitative results in one place. We also include some
discussion of possible further improvements to these statements.
| math.CO | we collect some results in combinatorial geometry that follow from an inequality of langer in algebraic geometry langers inequality gives a lower bound on the number of incidences between a point set and its spanned lines and was recently used by han to improve the constant in the weak dirac conjecture here we observe that this inequality also leads to improved constants in becks theorem which states that a finite point set in the real or complex plane has many points on a line or spans many lines most of the proofs that we use are not original and the goal of this note is mainly to carefully record the quantitative results in one place we also include some discussion of possible further improvements to these statements | [['we', 'collect', 'some', 'results', 'in', 'combinatorial', 'geometry', 'that', 'follow', 'from', 'an', 'inequality', 'of', 'langer', 'in', 'algebraic', 'geometry', 'langers', 'inequality', 'gives', 'a', 'lower', 'bound', 'on', 'the', 'number', 'of', 'incidences', 'between', 'a', 'point', 'set', 'and', 'its', 'spanned', 'lines', 'and', 'was', 'recently', 'used', 'by', 'han', 'to', 'improve', 'the', 'constant', 'in', 'the', 'weak', 'dirac', 'conjecture', 'here', 'we', 'observe', 'that', 'this', 'inequality', 'also', 'leads', 'to', 'improved', 'constants', 'in', 'becks', 'theorem', 'which', 'states', 'that', 'a', 'finite', 'point', 'set', 'in', 'the', 'real', 'or', 'complex', 'plane', 'has', 'many', 'points', 'on', 'a', 'line', 'or', 'spans', 'many', 'lines', 'most', 'of', 'the', 'proofs', 'that', 'we', 'use', 'are', 'not', 'original', 'and', 'the', 'goal', 'of', 'this', 'note', 'is', 'mainly', 'to', 'carefully', 'record', 'the', 'quantitative', 'results', 'in', 'one', 'place', 'we', 'also', 'include', 'some', 'discussion', 'of', 'possible', 'further', 'improvements', 'to', 'these', 'statements']] | [-0.10883309298303111, 0.05707367349841804, -0.09476631255380398, 0.06420965383734965, -0.09261581694751274, -0.1105317976729079, 0.10653202503637271, 0.3467214243911852, -0.2463388402779462, -0.2885199571908342, 0.09737424076329476, -0.2908042155950528, -0.16712849625701628, 0.256584299702608, -0.10889721036646662, 0.0013203274345898078, 0.034397526849501245, 0.025162096113318533, -0.06114092898522673, -0.3013702143042341, 0.34471705391651064, -0.013799349359405322, 0.24553537109727405, 0.11974096897344186, 0.041694011689552404, -0.005312409281261324, -0.01930733451869075, 0.03011092792199118, -0.159289944404782, 0.16237883695619415, 0.23765566604263258, 0.16050778589702733, 0.2479511133915796, -0.4106415739708294, -0.1503862532435029, 0.12542150840969887, 0.12106202502861457, 0.11882268775008824, -0.034989796536717944, -0.2531658751765398, 0.09630956269908829, -0.09664649925539344, -0.15807632632612242, -0.04879655965464556, 0.017270014588317766, 0.008458546443483022, -0.2177839894911025, 0.017112202732915454, 0.1142412564592568, 0.07534945499533274, -0.0365992483204436, -0.1046099957018196, 0.0017970540436116728, 0.11602733745129676, 0.04307755736788133, 0.04448920856853287, 0.04988644539019254, -0.07856095522572469, -0.12352657840425867, 0.34129966971442455, -0.03517199767841481, -0.20687125722958347, 0.1941995650867191, -0.14656157120438953, -0.18558842804457984, 0.11369016209221262, 0.14568545839815275, 0.10827720792245442, -0.095039935848551, 0.10065050770420449, -0.1229488844873281, 0.1311013082901243, 0.10986289658811031, 0.02813767871680105, 0.12915319161797603, 0.06637208177808922, 0.09809107516111264, 0.13276019926809918, -0.05505940946933674, -0.08636610819563988, -0.3145952895448697, -0.1707392208755757, -0.17983655411636412, 0.07885826887999657, -0.09017263247604448, -0.15726335516830128, 0.3691524054899108, 0.15364575319314802, 0.24057512371030848, 0.022803502869572286, 0.2339803009755968, 0.10076647904343118, 0.03146588866091077, 0.04248265211844421, 0.2428244458915717, 0.15168211351178118, 0.08288354183525198, -0.1251958013112532, 0.031525208180271616, 0.10578510861139832] |
1,802.08016 | Microscopic characterisation of laser-written phenomena for
component-wise testing of photonic integrated circuits | Photonic integrated circuits (PICs) directly written with a femtosecond laser
have shown great potential in many areas such as quantum information processing
(QIP). Many applications, like photon-based quantum computing, demand the
up-scaling of PICs and ever-higher optical performance, such as controllable
polarisation dependence and lower loss. In order to overcome current
limitations in fabrication precision, repeatability and material uniformity, a
solution for non-destructive testing of large-scale PICs in a component-wise
manner is desired to meet those ever-stricter demands. Here we demonstrate a
solution for non-destructive component-wise testing by predicting the
performance of a PIC component based on imaging with an adaptive optical
third-harmonic-generation (THG) three-dimensional (3D) microscope. The 3D THG
imaging can be performed on any component or part of it inside multi-component
PIC. Moreover, through discovering new phenomena we also demonstrated that 3D
THG microscopy provides a new pathway towards studying the fundamentals of
light-matter interaction in transparent materials.
| physics.optics physics.app-ph | photonic integrated circuits pics directly written with a femtosecond laser have shown great potential in many areas such as quantum information processing qip many applications like photonbased quantum computing demand the upscaling of pics and everhigher optical performance such as controllable polarisation dependence and lower loss in order to overcome current limitations in fabrication precision repeatability and material uniformity a solution for nondestructive testing of largescale pics in a componentwise manner is desired to meet those everstricter demands here we demonstrate a solution for nondestructive componentwise testing by predicting the performance of a pic component based on imaging with an adaptive optical thirdharmonicgeneration thg threedimensional 3d microscope the 3d thg imaging can be performed on any component or part of it inside multicomponent pic moreover through discovering new phenomena we also demonstrated that 3d thg microscopy provides a new pathway towards studying the fundamentals of lightmatter interaction in transparent materials | [['photonic', 'integrated', 'circuits', 'pics', 'directly', 'written', 'with', 'a', 'femtosecond', 'laser', 'have', 'shown', 'great', 'potential', 'in', 'many', 'areas', 'such', 'as', 'quantum', 'information', 'processing', 'qip', 'many', 'applications', 'like', 'photonbased', 'quantum', 'computing', 'demand', 'the', 'upscaling', 'of', 'pics', 'and', 'everhigher', 'optical', 'performance', 'such', 'as', 'controllable', 'polarisation', 'dependence', 'and', 'lower', 'loss', 'in', 'order', 'to', 'overcome', 'current', 'limitations', 'in', 'fabrication', 'precision', 'repeatability', 'and', 'material', 'uniformity', 'a', 'solution', 'for', 'nondestructive', 'testing', 'of', 'largescale', 'pics', 'in', 'a', 'componentwise', 'manner', 'is', 'desired', 'to', 'meet', 'those', 'everstricter', 'demands', 'here', 'we', 'demonstrate', 'a', 'solution', 'for', 'nondestructive', 'componentwise', 'testing', 'by', 'predicting', 'the', 'performance', 'of', 'a', 'pic', 'component', 'based', 'on', 'imaging', 'with', 'an', 'adaptive', 'optical', 'thirdharmonicgeneration', 'thg', 'threedimensional', '3d', 'microscope', 'the', '3d', 'thg', 'imaging', 'can', 'be', 'performed', 'on', 'any', 'component', 'or', 'part', 'of', 'it', 'inside', 'multicomponent', 'pic', 'moreover', 'through', 'discovering', 'new', 'phenomena', 'we', 'also', 'demonstrated', 'that', '3d', 'thg', 'microscopy', 'provides', 'a', 'new', 'pathway', 'towards', 'studying', 'the', 'fundamentals', 'of', 'lightmatter', 'interaction', 'in', 'transparent', 'materials']] | [-0.09010420440510544, 0.08227234267139244, -0.044075757985607394, -0.012825229629163153, -0.05305300792364555, -0.18538999203214976, 0.0019695784647263135, 0.4506793515127454, -0.2766965298057609, -0.3036693117228916, 0.08834347384509857, -0.25905605184261976, -0.16821658123139846, 0.2849343545291246, -0.04049107437041941, 0.15125631480288967, 0.06083584405761842, -0.0833345659807123, -0.03535304406682986, -0.18350839121518908, 0.20771662036359712, 0.06949663982330193, 0.3463673144075516, 0.06091127898764318, 0.10322834632195835, 0.017836313412624656, 0.013966780463257188, 0.0017623636929390675, -0.07093152122414156, 0.15580104932667235, 0.28812368901964036, 0.08354947271417021, 0.2855522602016257, -0.4739649282340464, -0.25209034383108186, 0.03995278671169905, 0.16477608435938285, 0.1136166928430415, -0.174119295893753, -0.2738244847923115, 0.04046592666339632, -0.1358250775626181, -0.09591377660792598, -0.12920170385906524, -0.014375107236815352, 0.013986687944427988, -0.2858813873356888, -0.003947062675276381, 0.0030881596235180827, 0.12561271094317497, -0.03218428516993299, -0.04314131056575256, 0.036358523786672065, 0.09946286379252686, -0.09880431773096977, 0.024150521379606042, 0.16501478397765676, -0.19606203993631377, -0.14797130763543317, 0.40295861714293024, -0.05923079403441374, -0.16885284317116178, 0.1855819896634391, -0.12259614343496945, -0.09415709812546501, 0.11327534923219827, 0.18469034545626994, 0.09122750854176293, -0.16441065029514879, 0.036719521204390364, 0.050886311442465394, 0.20394318104513945, 0.0727782553184551, 0.1166438023540871, 0.2181792350618068, 0.24073025513742421, 0.05815437682227836, 0.13229657342496984, -0.12021769386577748, -0.015545591019798775, -0.23414599620800064, -0.25477942660123715, -0.20877197645982173, 0.044786351821007764, -0.06786200111683512, -0.18424733383545647, 0.3853219875411407, 0.1870201687246712, 0.11097172462079372, -0.01701963195149359, 0.367469033402567, 0.09513345533648405, 0.1104867080229687, -0.0015292718748536867, 0.25724326278007514, 0.116704341274296, 0.11986909270273975, -0.19794306341193718, 0.048266431879931807, -0.0011476741134616975] |
1,802.08017 | On the classification of almost contact metric manifolds | On connected manifolds of dimension higher than three, the non-existence of
$132$ Chinea and Gonz\'alez-D\'avila types of almost contact metric structures
is proved. This is a consequence of some interrelations among components of the
intrinsic torsion of an almost contact metric structure. Such interrelations
allow to describe the exterior derivatives of some relevant forms in the
context of almost contact metric geometry.
| math.DG | on connected manifolds of dimension higher than three the nonexistence of 132 chinea and gonzalezdavila types of almost contact metric structures is proved this is a consequence of some interrelations among components of the intrinsic torsion of an almost contact metric structure such interrelations allow to describe the exterior derivatives of some relevant forms in the context of almost contact metric geometry | [['on', 'connected', 'manifolds', 'of', 'dimension', 'higher', 'than', 'three', 'the', 'nonexistence', 'of', '132', 'chinea', 'and', 'gonzalezdavila', 'types', 'of', 'almost', 'contact', 'metric', 'structures', 'is', 'proved', 'this', 'is', 'a', 'consequence', 'of', 'some', 'interrelations', 'among', 'components', 'of', 'the', 'intrinsic', 'torsion', 'of', 'an', 'almost', 'contact', 'metric', 'structure', 'such', 'interrelations', 'allow', 'to', 'describe', 'the', 'exterior', 'derivatives', 'of', 'some', 'relevant', 'forms', 'in', 'the', 'context', 'of', 'almost', 'contact', 'metric', 'geometry']] | [-0.24084250650322828, 0.06395475212012257, -0.06325208975696844, 0.08019470112955533, -0.0862827504923964, -0.09807256167204897, -0.03990760482236987, 0.35089315583959957, -0.25184467312742453, -0.27816121411494543, 0.10388737988513207, -0.3031590215739657, -0.2189646956098617, 0.1966218446060771, -0.05876159221773631, -0.006155415575523846, 0.01188073694309006, 0.12601869367444735, -0.10726650095865374, -0.2730058564720523, 0.46757375558868786, -0.008984188930910141, 0.22619831934571266, 0.08111651608201324, 0.1337892878342603, -0.01791183072615598, -0.05434192746847135, 0.054328994848383744, -0.13667045086316887, 0.16769198584752004, 0.21703659570546913, 0.06123028657032696, 0.1609711600963759, -0.3584120825436882, -0.18452940859877673, 0.09935853031815076, 0.08469005348924243, 0.0020699215533791994, 0.050628293372431125, -0.2726252752463104, 0.08107979047554927, -0.11887974777549017, -0.18693326809061844, -0.0685989100821927, 0.03779591638289514, 0.01791563688120881, -0.1354794941783394, 0.028336834357135365, 0.142336695920676, 0.07703178580545011, -0.1444178877062485, -0.09381804676329503, -0.04086878628576877, 0.1667243031933751, 0.05184482574676637, -0.011618490682029333, 0.0565273986640768, -0.10659345971863167, -0.10559933195959349, 0.37323465218126284, -0.03517425535213332, -0.24150167069718487, 0.22808789968734883, -0.142365640365198, -0.1179218304145043, 0.10073001503364229, 0.13979101010033343, 0.14433322982007607, -0.1366650378799112, 0.11872163683569181, 0.0003916534946345892, 0.11070506838073985, 0.18047290794230753, 0.047307345817690014, 0.14992321897145422, 0.12719560194699492, 0.1485210517983164, 0.11632928862923482, 0.003983464332480655, -0.10974364285738986, -0.33969087367419337, -0.2119720706746715, -0.09561795318789292, 0.1379835239504693, -0.18524410890116638, -0.2177041189393914, 0.38239720327871257, 0.03294842555874684, 0.20915300443794266, 0.03092668474209113, 0.22315700188447096, 0.000972469619734854, 0.06182527409286284, 0.06181072179594489, 0.23147102759589944, 0.24110546909639094, 0.011856622215299333, -0.10751250064092092, 0.055917327567080004, 0.07107433512593146] |
1,802.08018 | Structure and Supersaturation for Intersecting Families | The extremal problems regarding the maximum possible size of intersecting
families of various combinatorial objects have been extensively studied. In
this paper, we investigate supersaturation extensions, which in this context
ask for the minimum number of disjoint pairs that must appear in families
larger than the extremal threshold. We study the minimum number of disjoint
pairs in families of permutations and in $k$-uniform set families, and
determine the structure of the optimal families. Our main tool is a removal
lemma for disjoint pairs. We also determine the typical structure of
$k$-uniform set families without matchings of size $s$ when $n \ge 2sk +
38s^4$, and show that almost all $k$-uniform intersecting families on vertex
set $[n]$ are trivial when $n\ge (2+o(1))k$.
| math.CO | the extremal problems regarding the maximum possible size of intersecting families of various combinatorial objects have been extensively studied in this paper we investigate supersaturation extensions which in this context ask for the minimum number of disjoint pairs that must appear in families larger than the extremal threshold we study the minimum number of disjoint pairs in families of permutations and in kuniform set families and determine the structure of the optimal families our main tool is a removal lemma for disjoint pairs we also determine the typical structure of kuniform set families without matchings of size s when n ge 2sk 38s4 and show that almost all kuniform intersecting families on vertex set n are trivial when nge 2o1k | [['the', 'extremal', 'problems', 'regarding', 'the', 'maximum', 'possible', 'size', 'of', 'intersecting', 'families', 'of', 'various', 'combinatorial', 'objects', 'have', 'been', 'extensively', 'studied', 'in', 'this', 'paper', 'we', 'investigate', 'supersaturation', 'extensions', 'which', 'in', 'this', 'context', 'ask', 'for', 'the', 'minimum', 'number', 'of', 'disjoint', 'pairs', 'that', 'must', 'appear', 'in', 'families', 'larger', 'than', 'the', 'extremal', 'threshold', 'we', 'study', 'the', 'minimum', 'number', 'of', 'disjoint', 'pairs', 'in', 'families', 'of', 'permutations', 'and', 'in', 'kuniform', 'set', 'families', 'and', 'determine', 'the', 'structure', 'of', 'the', 'optimal', 'families', 'our', 'main', 'tool', 'is', 'a', 'removal', 'lemma', 'for', 'disjoint', 'pairs', 'we', 'also', 'determine', 'the', 'typical', 'structure', 'of', 'kuniform', 'set', 'families', 'without', 'matchings', 'of', 'size', 's', 'when', 'n', 'ge', '2sk', '38s4', 'and', 'show', 'that', 'almost', 'all', 'kuniform', 'intersecting', 'families', 'on', 'vertex', 'set', 'n', 'are', 'trivial', 'when', 'nge', '2o1k']] | [-0.18177034008963885, 0.13865282161603287, 0.007579978279201156, 0.07679266836869104, -0.025216614507864846, -0.11941679701272209, 0.03116646005823356, 0.32225077444198147, -0.2643426358245976, -0.3506277664485624, 0.07854459497394924, -0.3303435935611221, -0.09631283431890089, 0.1684367793525364, -0.0914371449705529, 0.05412512698005569, 0.08947046797612082, 0.07326305858885586, 0.004189503137024723, -0.3182504426636654, 0.35710111678325396, -0.08204280648191097, 0.24190792948070725, 0.03501864289864898, 0.013504136858855263, 0.042037557565875475, 0.027957076364654606, 0.06857741935873184, -0.23639179957634474, 0.10788331180810928, 0.25734866640759413, 0.17391655903696318, 0.22454957058258607, -0.3546206696172071, -0.17234680374642297, 0.268328051280104, 0.1613497060054708, 0.08532042315888802, 0.0011355537325301666, -0.14620913586074138, 0.1559072324051127, -0.0932467846925986, -0.1442163986651132, -0.007430961201661977, 0.11842350621995816, 0.03727895376406673, -0.25473959405878877, -0.0492026386094394, 0.12802617837895908, 0.05540473767066911, 0.03813185758683515, -0.2041453086786856, -0.04946934406239129, 0.07907028176863204, -0.023178988225142454, -0.030388013410413542, 0.01332670218070527, -0.07481649133250497, -0.1366764100039599, 0.31001076484256884, 0.017615518468936265, -0.15425600366414352, 0.15717416659186959, -0.1552867094340677, -0.19357162106671702, 0.12047562207947722, 0.16894438286643412, 0.20637326789388466, -0.12177281813539162, 0.12141552766719912, -0.1669892371411167, 0.11085146435110246, 0.21719776655515752, 0.08023529723128778, 0.1959147974690896, 0.10792069107893917, 0.12674690515663223, 0.216352016057314, -0.001972137332767627, -0.04116579379651585, -0.3251289094214217, -0.0906929907752043, -0.16885155572859822, 0.06647981614588712, -0.13984229698566567, -0.20945703513699315, 0.42123828065913105, 0.1137087969977598, 0.2141257254071376, 0.07409325439455304, 0.17191740917831155, -0.0064356677305452544, 0.03148539479963987, 0.14046439321482776, 0.14892828352828275, 0.1548955683217589, -0.11977998810125735, -0.16728556114130544, 0.0418737241860195, 0.13182487257487946] |
1,802.08019 | Neutrinoless double-beta decay with massive scalar emission | Searches for neutrino-less double-beta decay ($0\nu2\beta$) place an
important constraint on models where light fields beyond the Standard Model
participate in the neutrino mass mechanism. While $0\nu2\beta$ experimental
collaborations often consider various massless majoron models, including
various forms of majoron couplings and multi-majoron final-state processes,
none of these searches considered the scenario where the "majoron" $\phi$ is
not massless, $m_\phi\sim$~MeV, of the same order as the $Q$-value of the
$0\nu2\beta$ reaction. We consider this parameter region and estimate
$0\nu2\beta\phi$ constraints for $m_\phi$ of order MeV. The constraints are
affected not only by kinematical phase space suppression but also by a change
in the signal to background ratio characterizing the search. As a result,
$0\nu2\beta\phi$ constraints for $m_\phi>0$ diminish significantly below the
reaction threshold. This has phenomenological implications, which we illustrate
focusing on high-energy neutrino telescopes. Our results motivate a dedicated
analysis by $0\nu2\beta$ collaborations, analogous to the dedicated analyses
targeting massless majoron models.
| hep-ph | searches for neutrinoless doublebeta decay 0nu2beta place an important constraint on models where light fields beyond the standard model participate in the neutrino mass mechanism while 0nu2beta experimental collaborations often consider various massless majoron models including various forms of majoron couplings and multimajoron finalstate processes none of these searches considered the scenario where the majoron phi is not massless m_phisimmev of the same order as the qvalue of the 0nu2beta reaction we consider this parameter region and estimate 0nu2betaphi constraints for m_phi of order mev the constraints are affected not only by kinematical phase space suppression but also by a change in the signal to background ratio characterizing the search as a result 0nu2betaphi constraints for m_phi0 diminish significantly below the reaction threshold this has phenomenological implications which we illustrate focusing on highenergy neutrino telescopes our results motivate a dedicated analysis by 0nu2beta collaborations analogous to the dedicated analyses targeting massless majoron models | [['searches', 'for', 'neutrinoless', 'doublebeta', 'decay', '0nu2beta', 'place', 'an', 'important', 'constraint', 'on', 'models', 'where', 'light', 'fields', 'beyond', 'the', 'standard', 'model', 'participate', 'in', 'the', 'neutrino', 'mass', 'mechanism', 'while', '0nu2beta', 'experimental', 'collaborations', 'often', 'consider', 'various', 'massless', 'majoron', 'models', 'including', 'various', 'forms', 'of', 'majoron', 'couplings', 'and', 'multimajoron', 'finalstate', 'processes', 'none', 'of', 'these', 'searches', 'considered', 'the', 'scenario', 'where', 'the', 'majoron', 'phi', 'is', 'not', 'massless', 'm_phisimmev', 'of', 'the', 'same', 'order', 'as', 'the', 'qvalue', 'of', 'the', '0nu2beta', 'reaction', 'we', 'consider', 'this', 'parameter', 'region', 'and', 'estimate', '0nu2betaphi', 'constraints', 'for', 'm_phi', 'of', 'order', 'mev', 'the', 'constraints', 'are', 'affected', 'not', 'only', 'by', 'kinematical', 'phase', 'space', 'suppression', 'but', 'also', 'by', 'a', 'change', 'in', 'the', 'signal', 'to', 'background', 'ratio', 'characterizing', 'the', 'search', 'as', 'a', 'result', '0nu2betaphi', 'constraints', 'for', 'm_phi0', 'diminish', 'significantly', 'below', 'the', 'reaction', 'threshold', 'this', 'has', 'phenomenological', 'implications', 'which', 'we', 'illustrate', 'focusing', 'on', 'highenergy', 'neutrino', 'telescopes', 'our', 'results', 'motivate', 'a', 'dedicated', 'analysis', 'by', '0nu2beta', 'collaborations', 'analogous', 'to', 'the', 'dedicated', 'analyses', 'targeting', 'massless', 'majoron', 'models']] | [-0.07833997747273302, 0.23815915281753502, -0.016244328228034854, 0.16376861703860254, -0.09372434333445748, -0.15404165723992375, 0.07378208399093991, 0.2811593295531285, -0.18242944640751252, -0.33032600687904246, 0.06923320689301113, -0.28150435257703066, -0.0759000423127604, 0.1893897622092408, 0.09089631057987396, 0.06037316121936044, 0.07236328856213231, 0.017152260938946833, -0.0464469835805963, -0.21225258256480622, 0.2983455626894064, 0.13433574428219322, 0.22008076723002448, 0.09464561482328897, -0.0045567208482265075, 0.009639234258637032, -0.0824256082996726, -0.1195055840495152, -0.15422306555142037, 0.011403444954412896, 0.221101463369371, 0.12200037795337755, 0.14759635206486954, -0.3806165355201436, -0.22275120183675481, 0.21355319998833358, 0.17524751677059086, 0.05176156593702309, -0.09595294366278154, -0.341625760859441, 0.03550789622752459, -0.202298493668337, -0.08650994515233992, -0.04984026140808409, -0.04453380782182185, -0.022535548075461674, -0.3266958306362265, 0.051199981147203054, 0.013703963376312897, -0.038854619494370565, -0.07010542956218374, -0.2016557646046499, 0.018838733394048957, 0.041780196320915584, 0.1581175151306842, 0.011958175697035762, 0.1638860934626486, -0.20074817857973828, -0.1345263670554897, 0.39600188695144334, -0.07481013988019686, -0.17027472257739146, 0.1319630509867464, -0.17276668717972185, -0.19996779662363182, 0.12780117950927242, 0.19602306955337725, 0.1006529338645355, -0.1769089934809896, 0.1664339267147155, -0.00708702379437601, 0.18208231703822045, 0.03649024047807559, 0.058507600389796015, 0.24003552592003205, 0.21680818421566148, 0.052143546160788666, 0.03217088712860624, -0.09334306599847322, -0.08774042661120528, -0.3696631265979185, -0.09186234064525206, -0.0612392865813606, 0.03384627857352544, -0.05154438837780617, -0.07725037981899793, 0.37131470216800705, 0.1356079448389527, 0.20539391674601393, 0.0029519543640828074, 0.29685023577021274, 0.09537359687652838, 0.09072737352322512, -0.03228707771885815, 0.35321820842964735, 0.12073385469869777, 0.09125994295413112, -0.22817198210708398, 0.04640700744665009, 0.024339639928641934] |
1,802.0802 | On Rational Delegations in Liquid Democracy | Liquid democracy is a proxy voting method where proxies are delegable. We
propose and study a game-theoretic model of liquid democracy to address the
following question: when is it rational for a voter to delegate her vote? We
study the existence of pure-strategy Nash equilibria in this model, and how
group accuracy is affected by them. We complement these theoretical results by
means of agent-based simulations to study the effects of delegations on group's
accuracy on variously structured social networks.
| cs.MA cs.GT | liquid democracy is a proxy voting method where proxies are delegable we propose and study a gametheoretic model of liquid democracy to address the following question when is it rational for a voter to delegate her vote we study the existence of purestrategy nash equilibria in this model and how group accuracy is affected by them we complement these theoretical results by means of agentbased simulations to study the effects of delegations on groups accuracy on variously structured social networks | [['liquid', 'democracy', 'is', 'a', 'proxy', 'voting', 'method', 'where', 'proxies', 'are', 'delegable', 'we', 'propose', 'and', 'study', 'a', 'gametheoretic', 'model', 'of', 'liquid', 'democracy', 'to', 'address', 'the', 'following', 'question', 'when', 'is', 'it', 'rational', 'for', 'a', 'voter', 'to', 'delegate', 'her', 'vote', 'we', 'study', 'the', 'existence', 'of', 'purestrategy', 'nash', 'equilibria', 'in', 'this', 'model', 'and', 'how', 'group', 'accuracy', 'is', 'affected', 'by', 'them', 'we', 'complement', 'these', 'theoretical', 'results', 'by', 'means', 'of', 'agentbased', 'simulations', 'to', 'study', 'the', 'effects', 'of', 'delegations', 'on', 'groups', 'accuracy', 'on', 'variously', 'structured', 'social', 'networks']] | [-0.09267200063222844, 0.018986916737048887, -0.11843099674442784, 0.10124501838872675, -0.07416449160664343, -0.18944119852385483, 0.17999702368397266, 0.40767540426459165, -0.2617638284456916, -0.3004849188728258, 0.10397377587651135, -0.31340238829143346, -0.1917860213899985, 0.09375192850711755, -0.13664318417431787, 0.03283066120638978, 0.0363474196754396, 0.0008924458816181868, 0.028352785354945807, -0.3029577417066321, 0.3419384895823896, 0.028407818655250595, 0.2771486954530701, 0.06344593061548949, 0.06776916363160126, -0.0013106899277772754, -0.01874049680773169, 0.05821540247416124, -0.14697043095948176, 0.08598008076078259, 0.2890748956997413, 0.15862652516225353, 0.3536782550625503, -0.40079752469901, -0.17309310869604816, 0.15069286498473958, 0.08265425730278367, 0.07032901517231949, -0.02444594425614923, -0.27981027332134545, 0.09145766774890944, -0.2531056027044542, -0.11662980242399498, -0.12839598327991553, -0.018341240618610755, 0.038435697333625285, -0.2532802942674607, 0.04183897027978674, 0.030933761008782312, 0.09266242035664618, -0.03116102313506417, -0.06036889827810228, -0.0005277685646433383, 0.15207212599962078, 0.0471916171227349, -0.03989444378821645, 0.1523664784792345, -0.1642182407405926, -0.17522549479617738, 0.42233085054904224, -0.027548360713990406, -0.20851467947941274, 0.16819454834912903, -0.090361994470004, -0.15146981047437294, 0.025264952122233807, 0.2192689820745727, 0.13585768135380932, -0.1266714353734642, 0.006989001207693945, -0.181725873821415, 0.1538849858829053, -0.013628614757908507, -0.05594336843932979, 0.2091941811318975, 0.22009773312311154, 0.07186234623659402, 0.0975799302017549, 0.020248367843669256, -0.14305356408622175, -0.19511977933580055, -0.1564427851990331, -0.13863515919074415, 0.0539595709531568, -0.04855989670431882, -0.1253245415078709, 0.3957981344778091, 0.1818674148642458, 0.12006604013731703, 0.07800643850350752, 0.28124631008831785, 0.028086135687772185, -0.03203136622905731, 0.05433741111191921, 0.20437008046428673, 0.06649771251832134, 0.05836341466056183, -0.20784863178269006, 0.14678134990972466, 0.10531026136595756] |
1,802.08021 | SparCML: High-Performance Sparse Communication for Machine Learning | Applying machine learning techniques to the quickly growing data in science
and industry requires highly-scalable algorithms. Large datasets are most
commonly processed "data parallel" distributed across many nodes. Each node's
contribution to the overall gradient is summed using a global allreduce. This
allreduce is the single communication and thus scalability bottleneck for most
machine learning workloads. We observe that frequently, many gradient values
are (close to) zero, leading to sparse of sparsifyable communications. To
exploit this insight, we analyze, design, and implement a set of
communication-efficient protocols for sparse input data, in conjunction with
efficient machine learning algorithms which can leverage these primitives. Our
communication protocols generalize standard collective operations, by allowing
processes to contribute arbitrary sparse input data vectors. Our generic
communication library, SparCML, extends MPI to support additional features,
such as non-blocking (asynchronous) operations and low-precision data
representations. As such, SparCML and its techniques will form the basis of
future highly-scalable machine learning frameworks.
| cs.DC stat.ML | applying machine learning techniques to the quickly growing data in science and industry requires highlyscalable algorithms large datasets are most commonly processed data parallel distributed across many nodes each nodes contribution to the overall gradient is summed using a global allreduce this allreduce is the single communication and thus scalability bottleneck for most machine learning workloads we observe that frequently many gradient values are close to zero leading to sparse of sparsifyable communications to exploit this insight we analyze design and implement a set of communicationefficient protocols for sparse input data in conjunction with efficient machine learning algorithms which can leverage these primitives our communication protocols generalize standard collective operations by allowing processes to contribute arbitrary sparse input data vectors our generic communication library sparcml extends mpi to support additional features such as nonblocking asynchronous operations and lowprecision data representations as such sparcml and its techniques will form the basis of future highlyscalable machine learning frameworks | [['applying', 'machine', 'learning', 'techniques', 'to', 'the', 'quickly', 'growing', 'data', 'in', 'science', 'and', 'industry', 'requires', 'highlyscalable', 'algorithms', 'large', 'datasets', 'are', 'most', 'commonly', 'processed', 'data', 'parallel', 'distributed', 'across', 'many', 'nodes', 'each', 'nodes', 'contribution', 'to', 'the', 'overall', 'gradient', 'is', 'summed', 'using', 'a', 'global', 'allreduce', 'this', 'allreduce', 'is', 'the', 'single', 'communication', 'and', 'thus', 'scalability', 'bottleneck', 'for', 'most', 'machine', 'learning', 'workloads', 'we', 'observe', 'that', 'frequently', 'many', 'gradient', 'values', 'are', 'close', 'to', 'zero', 'leading', 'to', 'sparse', 'of', 'sparsifyable', 'communications', 'to', 'exploit', 'this', 'insight', 'we', 'analyze', 'design', 'and', 'implement', 'a', 'set', 'of', 'communicationefficient', 'protocols', 'for', 'sparse', 'input', 'data', 'in', 'conjunction', 'with', 'efficient', 'machine', 'learning', 'algorithms', 'which', 'can', 'leverage', 'these', 'primitives', 'our', 'communication', 'protocols', 'generalize', 'standard', 'collective', 'operations', 'by', 'allowing', 'processes', 'to', 'contribute', 'arbitrary', 'sparse', 'input', 'data', 'vectors', 'our', 'generic', 'communication', 'library', 'sparcml', 'extends', 'mpi', 'to', 'support', 'additional', 'features', 'such', 'as', 'nonblocking', 'asynchronous', 'operations', 'and', 'lowprecision', 'data', 'representations', 'as', 'such', 'sparcml', 'and', 'its', 'techniques', 'will', 'form', 'the', 'basis', 'of', 'future', 'highlyscalable', 'machine', 'learning', 'frameworks']] | [-0.11983932293586287, 0.03935093693039532, -0.06891990154129422, 0.05376644536177171, -0.1274083121299281, -0.20538600863549505, 0.07171376268196777, 0.4234931489307771, -0.35589409196670196, -0.32652355066738, 0.11196879696959228, -0.24535156263257651, -0.14346693687177464, 0.21131613238842464, -0.11569037158163933, 0.13451191145986444, 0.13750720675273803, 0.008654848301137974, -0.04689249337127347, -0.27519289517677786, 0.24196519948609838, 0.047176828203126304, 0.35125677956091667, -0.03502087624518359, 0.059240926140036704, 0.0116772620993502, -0.04995526657196285, -0.05660180701855935, -0.03308231294543362, 0.19364070514326587, 0.39912122100122954, 0.26101514123976716, 0.3285610665813746, -0.46064675209763783, -0.18267373884936758, 0.12022853433915408, 0.17830699502058278, 0.1314434486280958, -0.02529561988327628, -0.2535699315923053, 0.10334639533710502, -0.16122773846876168, -0.01358062934033037, -0.19606911778157832, -0.03701544461735323, 0.04203017628173423, -0.3174993380222445, -0.03055957452777554, 0.029133600913280367, 0.053820925213859165, 0.012842692266632285, -0.11336896268443929, 0.05080808119793587, 0.1504299370815454, -0.0028265732054422103, 0.059351124586172255, 0.17574932915310748, -0.1259789446352074, -0.20677518903344771, 0.35373527755705164, -0.019638276184160336, -0.1661342927711267, 0.2273075649959151, 0.01946485504885417, -0.20389108623384067, 0.07984774726522124, 0.295455603403788, 0.04396172285991495, -0.1731711146939132, 0.06804351434164857, 0.022405967028093297, 0.1607368293795065, 0.02518311884175085, 0.05163998533271594, 0.12980020594831823, 0.19688299401158016, 0.06405388297790089, 0.11475951425439003, -0.065296888120512, -0.11130748408103934, -0.2025013049711394, -0.1258644954517508, -0.19122139766684496, -0.05249614046058721, -0.13235296960263832, -0.1492890837736233, 0.340726958388414, 0.20914045581289756, 0.18622366895022638, 0.09701689036948807, 0.4124971353783717, 0.031457093178033614, 0.17167485317860554, 0.2074493285256371, 0.15290934802946068, 0.07693415429303119, 0.15976443145351082, -0.13190163472162109, 0.06960083358446319, -0.025712206242400604] |
1,802.08022 | Equalizer 2.0 - Convergence of a Parallel Rendering Framework | Developing complex, real world graphics applications which leverage multiple
GPUs and computers for interactive 3D rendering tasks is a complex task. It
requires expertise in distributed systems and parallel rendering in addition to
the application domain itself. We present a mature parallel rendering framework
which provides a large set of features, algorithms and system integration for a
wide range of real-world research and industry applications. Using the
Equalizer parallel rendering framework, we show how a wide set of generic
algorithms can be integrated in the framework to help application scalability
and development in many different domains, highlighting how concrete
applications benefit from the diverse aspects and use cases of Equalizer. We
present novel parallel rendering algorithms, powerful abstractions for large
visualization setups and virtual reality, as well as new experimental results
for parallel rendering and data distribution.
| cs.GR | developing complex real world graphics applications which leverage multiple gpus and computers for interactive 3d rendering tasks is a complex task it requires expertise in distributed systems and parallel rendering in addition to the application domain itself we present a mature parallel rendering framework which provides a large set of features algorithms and system integration for a wide range of realworld research and industry applications using the equalizer parallel rendering framework we show how a wide set of generic algorithms can be integrated in the framework to help application scalability and development in many different domains highlighting how concrete applications benefit from the diverse aspects and use cases of equalizer we present novel parallel rendering algorithms powerful abstractions for large visualization setups and virtual reality as well as new experimental results for parallel rendering and data distribution | [['developing', 'complex', 'real', 'world', 'graphics', 'applications', 'which', 'leverage', 'multiple', 'gpus', 'and', 'computers', 'for', 'interactive', '3d', 'rendering', 'tasks', 'is', 'a', 'complex', 'task', 'it', 'requires', 'expertise', 'in', 'distributed', 'systems', 'and', 'parallel', 'rendering', 'in', 'addition', 'to', 'the', 'application', 'domain', 'itself', 'we', 'present', 'a', 'mature', 'parallel', 'rendering', 'framework', 'which', 'provides', 'a', 'large', 'set', 'of', 'features', 'algorithms', 'and', 'system', 'integration', 'for', 'a', 'wide', 'range', 'of', 'realworld', 'research', 'and', 'industry', 'applications', 'using', 'the', 'equalizer', 'parallel', 'rendering', 'framework', 'we', 'show', 'how', 'a', 'wide', 'set', 'of', 'generic', 'algorithms', 'can', 'be', 'integrated', 'in', 'the', 'framework', 'to', 'help', 'application', 'scalability', 'and', 'development', 'in', 'many', 'different', 'domains', 'highlighting', 'how', 'concrete', 'applications', 'benefit', 'from', 'the', 'diverse', 'aspects', 'and', 'use', 'cases', 'of', 'equalizer', 'we', 'present', 'novel', 'parallel', 'rendering', 'algorithms', 'powerful', 'abstractions', 'for', 'large', 'visualization', 'setups', 'and', 'virtual', 'reality', 'as', 'well', 'as', 'new', 'experimental', 'results', 'for', 'parallel', 'rendering', 'and', 'data', 'distribution']] | [-0.08108309849783996, 0.013692045907224835, -0.04957929888509051, 0.05270496022931715, -0.14901429450438514, -0.1584072357322341, -0.000289996943171442, 0.4249351502729267, -0.28069822220675594, -0.3777467772962838, 0.12025662081275326, -0.20245402101699236, -0.20951956317821233, 0.3101700270194968, -0.07884938005072466, 0.10637468595421418, 0.14098082340057314, -0.05702465335009144, -0.047957835970514444, -0.22230424236737356, 0.2672527528029737, -0.005973413355485366, 0.34718254169136503, 0.07738570914770321, 0.10500887297450762, 0.02270347299564113, -0.01286422291916734, 0.02467643099495354, -0.030057961752563443, 0.1973160349927081, 0.3554532762266777, 0.23342145961729716, 0.3182225729318431, -0.44320015439314997, -0.18646374527011475, 0.0416461997903394, 0.18202841228866665, 0.11304576314108813, -0.10057065258716934, -0.292849415974406, 0.09403516310793994, -0.1822281813276184, -0.0641947680078175, -0.19028975223157094, -0.0022701727715830735, -0.0029725265845547627, -0.28832956657738146, -0.036356890604688524, 0.007068867984662906, 0.10258836779457918, -0.016000039965580522, -0.09044405768615241, 0.10177178711657596, 0.18874470040841151, -0.019049325340128348, 0.012179193859342078, 0.15825699739851548, -0.15710779415429943, -0.17781011250386708, 0.4152763170312519, -0.0021087472194493036, -0.21146391830048064, 0.27576359901169356, -0.016043405402043874, -0.15429910877039724, 0.07778199224895968, 0.2706093881891048, 0.11451131823289133, -0.13711680100047893, 0.11910632459691516, 0.026326425393948156, 0.15104474538724136, 0.0001319214280178077, 0.02410463191378508, 0.21695629034504077, 0.2347639560916998, 0.04546630757998498, 0.16265058184780154, -0.061790434908747235, -0.14375574553631698, -0.2446246893543675, -0.21130690241001382, -0.1636019315839113, -0.043477839287234483, -0.10605657548111708, -0.19446721673691578, 0.36307958541370006, 0.23136897987760877, 0.17423415906815687, 0.06215763774557705, 0.399314988241361, 0.019956758545149104, 0.10999634297034383, 0.10082285991575854, 0.09315116543927822, 0.027139199608732966, 0.20750629749611346, -0.1004876644438962, 0.0121891389220246, -0.05424654983786227] |
1,802.08023 | The Best of Both Worlds: Asymptotically Efficient Mechanisms with a
Guarantee on the Expected Gains-From-Trade | The seminal impossibility result of Myerson and Satterthwaite (1983) states
that for bilateral trade, there is no mechanism that is individually rational
(IR), incentive compatible (IC), weakly budget balanced, and efficient. This
has led follow-up work on two-sided trade settings to weaken the efficiency
requirement and consider approximately efficient simple mechanisms, while still
demanding the other properties. The current state-of-the-art of such mechanisms
for two-sided markets can be categorized as giving one (but not both) of the
following two types of approximation guarantees on the gains from trade: a
constant ex-ante guarantee, measured with respect to the second-best efficiency
benchmark, or an asymptotically optimal ex-post guarantee, measured with
respect to the first-best efficiency benchmark. Here the second-best efficiency
benchmark refers to the highest gains from trade attainable by any IR, IC and
weakly budget balanced mechanism, while the first-best efficiency benchmark
refers to the maximum gains from trade (attainable by the VCG mechanism, which
is not weakly budget balanced).
In this paper, we construct simple mechanisms for double-auction and matching
markets that simultaneously achieve both types of guarantees: these are ex-post
IR, Bayesian IC, and ex-post weakly budget balanced mechanisms that 1) ex-ante
guarantee a constant fraction of the gains from trade of the second-best, and
2) ex-post guarantee a realization-dependent fraction of the gains from trade
of the first-best, such that this realization-dependent fraction converges to 1
(full efficiency) as the market grows large.
| cs.GT | the seminal impossibility result of myerson and satterthwaite 1983 states that for bilateral trade there is no mechanism that is individually rational ir incentive compatible ic weakly budget balanced and efficient this has led followup work on twosided trade settings to weaken the efficiency requirement and consider approximately efficient simple mechanisms while still demanding the other properties the current stateoftheart of such mechanisms for twosided markets can be categorized as giving one but not both of the following two types of approximation guarantees on the gains from trade a constant exante guarantee measured with respect to the secondbest efficiency benchmark or an asymptotically optimal expost guarantee measured with respect to the firstbest efficiency benchmark here the secondbest efficiency benchmark refers to the highest gains from trade attainable by any ir ic and weakly budget balanced mechanism while the firstbest efficiency benchmark refers to the maximum gains from trade attainable by the vcg mechanism which is not weakly budget balanced in this paper we construct simple mechanisms for doubleauction and matching markets that simultaneously achieve both types of guarantees these are expost ir bayesian ic and expost weakly budget balanced mechanisms that 1 exante guarantee a constant fraction of the gains from trade of the secondbest and 2 expost guarantee a realizationdependent fraction of the gains from trade of the firstbest such that this realizationdependent fraction converges to 1 full efficiency as the market grows large | [['the', 'seminal', 'impossibility', 'result', 'of', 'myerson', 'and', 'satterthwaite', '1983', 'states', 'that', 'for', 'bilateral', 'trade', 'there', 'is', 'no', 'mechanism', 'that', 'is', 'individually', 'rational', 'ir', 'incentive', 'compatible', 'ic', 'weakly', 'budget', 'balanced', 'and', 'efficient', 'this', 'has', 'led', 'followup', 'work', 'on', 'twosided', 'trade', 'settings', 'to', 'weaken', 'the', 'efficiency', 'requirement', 'and', 'consider', 'approximately', 'efficient', 'simple', 'mechanisms', 'while', 'still', 'demanding', 'the', 'other', 'properties', 'the', 'current', 'stateoftheart', 'of', 'such', 'mechanisms', 'for', 'twosided', 'markets', 'can', 'be', 'categorized', 'as', 'giving', 'one', 'but', 'not', 'both', 'of', 'the', 'following', 'two', 'types', 'of', 'approximation', 'guarantees', 'on', 'the', 'gains', 'from', 'trade', 'a', 'constant', 'exante', 'guarantee', 'measured', 'with', 'respect', 'to', 'the', 'secondbest', 'efficiency', 'benchmark', 'or', 'an', 'asymptotically', 'optimal', 'expost', 'guarantee', 'measured', 'with', 'respect', 'to', 'the', 'firstbest', 'efficiency', 'benchmark', 'here', 'the', 'secondbest', 'efficiency', 'benchmark', 'refers', 'to', 'the', 'highest', 'gains', 'from', 'trade', 'attainable', 'by', 'any', 'ir', 'ic', 'and', 'weakly', 'budget', 'balanced', 'mechanism', 'while', 'the', 'firstbest', 'efficiency', 'benchmark', 'refers', 'to', 'the', 'maximum', 'gains', 'from', 'trade', 'attainable', 'by', 'the', 'vcg', 'mechanism', 'which', 'is', 'not', 'weakly', 'budget', 'balanced', 'in', 'this', 'paper', 'we', 'construct', 'simple', 'mechanisms', 'for', 'doubleauction', 'and', 'matching', 'markets', 'that', 'simultaneously', 'achieve', 'both', 'types', 'of', 'guarantees', 'these', 'are', 'expost', 'ir', 'bayesian', 'ic', 'and', 'expost', 'weakly', 'budget', 'balanced', 'mechanisms', 'that', '1', 'exante', 'guarantee', 'a', 'constant', 'fraction', 'of', 'the', 'gains', 'from', 'trade', 'of', 'the', 'secondbest', 'and', '2', 'expost', 'guarantee', 'a', 'realizationdependent', 'fraction', 'of', 'the', 'gains', 'from', 'trade', 'of', 'the', 'firstbest', 'such', 'that', 'this', 'realizationdependent', 'fraction', 'converges', 'to', '1', 'full', 'efficiency', 'as', 'the', 'market', 'grows', 'large']] | [-0.09327834425915152, 0.039165092597064126, -0.03720939845698787, 0.07918551920298883, -0.08447610202859691, -0.17590707093687788, 0.1494493738594564, 0.39985688472998904, -0.2796337652139049, -0.29946386383975204, 0.10157578603929265, -0.28485829184485717, -0.09113880503090455, 0.18649847308827683, -0.10986289591033091, 0.015740744036404377, 0.06770489750667773, -0.0009225003302414367, 0.02960397977737383, -0.31459557392753346, 0.26305630866616486, 0.13736997480464583, 0.3422993733904305, 0.068097187684195, 0.13636229306340536, -0.05210973769030038, -0.02051783509730817, 0.0166021527118109, -0.1097070552307451, 0.11010056279916712, 0.24726846563292945, 0.15953924238206224, 0.307116459056418, -0.3974974448931344, -0.15030051157908872, 0.17246377497733115, 0.09879721469255759, 0.0041333096394156835, -0.03513142473381409, -0.1571906199005056, 0.11104710086724384, -0.2130989316709716, -0.073503115032106, -0.06021376739731653, -0.0233862774307899, 0.03466865894077544, -0.32941589768024837, 0.06431627297338019, 0.07870393586939478, -0.0021745776787320983, -0.061735198439713174, -0.13289614550947668, -0.028273475017557118, 0.12184795337491372, 0.03555343456298826, -0.008269778549908957, 0.10536724462154064, -0.1699318321530727, -0.18918081376047685, 0.38484529298829273, -0.04727349612624087, -0.18216909786805194, 0.1772419211950074, -0.07807614191266847, -0.07170497087880652, 0.13786607808136242, 0.13822610889601106, 0.09884435993797601, -0.1403434108506809, 0.05409966291626915, -0.057489433801396095, 0.17805321445351743, 0.07415195064906506, 0.07172854113085393, 0.1506932807234215, 0.1541155929845619, 0.16235827349839693, 0.10814900441922524, -0.0026940414899999793, -0.14690488514074304, -0.2557321319475453, -0.10319131823811442, -0.12187480013223087, 0.0672136983914707, -0.12247565495094255, -0.10483050861574233, 0.33704190977076265, 0.11321394010347889, 0.16719485173358561, 0.11764864677890263, 0.33437279209177545, 0.09909411385764387, 0.02755176901936214, 0.13742325958458984, 0.2925218989398885, -0.0007465742845484551, 0.06715279037697597, -0.2222722007130134, 0.1490416855278841, -0.006118982955020793] |
1,802.08024 | Chemical Heredity as Group Selection at the Molecular Level | Many examples of cooperation exist in biology. In chemical systems however,
which can sometimes be quite complex, we do not appear to observe intricate
cooperative interactions. A key question for the origin of life, is then how
can molecular cooperation first arise in an abiotic system prior to the
emergence of biological replication. We postulate that selection at the
molecular level is a driving force behind the complexification of chemical
systems, particularly during the origins of life. In the theory of multilevel
selection the two selective forces are: within-group and between-group, where
the former tends to favor "selfish" replication of individuals and the latter
favor cooperation between individuals enhancing the replication of the group as
a whole. These forces can be quantified using the Price equation, which is a
standard tool used in evolutionary biology to quantify evolutionary change. Our
central claim is that replication and heredity in chemical systems are subject
to selection, and quantifiable using the multilevel Price equation. We
demonstrate this using the Graded Autocatalysis Replication Domain computer
model, describing simple protocell composed out of molecules and its
replication, which respectively analogue to the group and the individuals. In
contrast to previous treatments of this model, we treat the lipid molecules
themselves as replicating individuals and the protocells they form as groups of
individuals. Our goal is to demonstrate how evolutionary biology tools and
concepts can be applied in chemistry and we suggest that molecular cooperation
may arise as a result of group selection. Further, the biological relation of
parent-progeny is proposed to be analogue to the reactant-product relation in
chemistry, thus allowing for tools from evolutionary biology to be applied to
chemistry and would deepen the connection between chemistry and biology.
| q-bio.PE | many examples of cooperation exist in biology in chemical systems however which can sometimes be quite complex we do not appear to observe intricate cooperative interactions a key question for the origin of life is then how can molecular cooperation first arise in an abiotic system prior to the emergence of biological replication we postulate that selection at the molecular level is a driving force behind the complexification of chemical systems particularly during the origins of life in the theory of multilevel selection the two selective forces are withingroup and betweengroup where the former tends to favor selfish replication of individuals and the latter favor cooperation between individuals enhancing the replication of the group as a whole these forces can be quantified using the price equation which is a standard tool used in evolutionary biology to quantify evolutionary change our central claim is that replication and heredity in chemical systems are subject to selection and quantifiable using the multilevel price equation we demonstrate this using the graded autocatalysis replication domain computer model describing simple protocell composed out of molecules and its replication which respectively analogue to the group and the individuals in contrast to previous treatments of this model we treat the lipid molecules themselves as replicating individuals and the protocells they form as groups of individuals our goal is to demonstrate how evolutionary biology tools and concepts can be applied in chemistry and we suggest that molecular cooperation may arise as a result of group selection further the biological relation of parentprogeny is proposed to be analogue to the reactantproduct relation in chemistry thus allowing for tools from evolutionary biology to be applied to chemistry and would deepen the connection between chemistry and biology | [['many', 'examples', 'of', 'cooperation', 'exist', 'in', 'biology', 'in', 'chemical', 'systems', 'however', 'which', 'can', 'sometimes', 'be', 'quite', 'complex', 'we', 'do', 'not', 'appear', 'to', 'observe', 'intricate', 'cooperative', 'interactions', 'a', 'key', 'question', 'for', 'the', 'origin', 'of', 'life', 'is', 'then', 'how', 'can', 'molecular', 'cooperation', 'first', 'arise', 'in', 'an', 'abiotic', 'system', 'prior', 'to', 'the', 'emergence', 'of', 'biological', 'replication', 'we', 'postulate', 'that', 'selection', 'at', 'the', 'molecular', 'level', 'is', 'a', 'driving', 'force', 'behind', 'the', 'complexification', 'of', 'chemical', 'systems', 'particularly', 'during', 'the', 'origins', 'of', 'life', 'in', 'the', 'theory', 'of', 'multilevel', 'selection', 'the', 'two', 'selective', 'forces', 'are', 'withingroup', 'and', 'betweengroup', 'where', 'the', 'former', 'tends', 'to', 'favor', 'selfish', 'replication', 'of', 'individuals', 'and', 'the', 'latter', 'favor', 'cooperation', 'between', 'individuals', 'enhancing', 'the', 'replication', 'of', 'the', 'group', 'as', 'a', 'whole', 'these', 'forces', 'can', 'be', 'quantified', 'using', 'the', 'price', 'equation', 'which', 'is', 'a', 'standard', 'tool', 'used', 'in', 'evolutionary', 'biology', 'to', 'quantify', 'evolutionary', 'change', 'our', 'central', 'claim', 'is', 'that', 'replication', 'and', 'heredity', 'in', 'chemical', 'systems', 'are', 'subject', 'to', 'selection', 'and', 'quantifiable', 'using', 'the', 'multilevel', 'price', 'equation', 'we', 'demonstrate', 'this', 'using', 'the', 'graded', 'autocatalysis', 'replication', 'domain', 'computer', 'model', 'describing', 'simple', 'protocell', 'composed', 'out', 'of', 'molecules', 'and', 'its', 'replication', 'which', 'respectively', 'analogue', 'to', 'the', 'group', 'and', 'the', 'individuals', 'in', 'contrast', 'to', 'previous', 'treatments', 'of', 'this', 'model', 'we', 'treat', 'the', 'lipid', 'molecules', 'themselves', 'as', 'replicating', 'individuals', 'and', 'the', 'protocells', 'they', 'form', 'as', 'groups', 'of', 'individuals', 'our', 'goal', 'is', 'to', 'demonstrate', 'how', 'evolutionary', 'biology', 'tools', 'and', 'concepts', 'can', 'be', 'applied', 'in', 'chemistry', 'and', 'we', 'suggest', 'that', 'molecular', 'cooperation', 'may', 'arise', 'as', 'a', 'result', 'of', 'group', 'selection', 'further', 'the', 'biological', 'relation', 'of', 'parentprogeny', 'is', 'proposed', 'to', 'be', 'analogue', 'to', 'the', 'reactantproduct', 'relation', 'in', 'chemistry', 'thus', 'allowing', 'for', 'tools', 'from', 'evolutionary', 'biology', 'to', 'be', 'applied', 'to', 'chemistry', 'and', 'would', 'deepen', 'the', 'connection', 'between', 'chemistry', 'and', 'biology']] | [-0.09764047211501747, 0.10736811700369056, -0.11159689282661495, 0.09196747386742803, -0.08146709460489662, -0.1277286879141146, 0.0913479334767416, 0.36899370000973136, -0.3126780429140101, -0.29839369145379413, 0.06014079281496225, -0.20731483578590126, -0.2160336831715745, 0.14049864599266432, -0.09840641550811559, -0.044534758015570206, 0.0314623400838275, -0.0061070507246358185, 0.05933877984106928, -0.24572940006799682, 0.29190019484852037, 0.055030349101158005, 0.26264251315143144, 0.04493969637395578, 0.044780602629467, -0.03847578713181757, -0.018589814863344784, 0.004181506295858974, -0.11702671443711385, 0.1373546519415112, 0.32839241712501693, 0.164140251133932, 0.31293166356536717, -0.4555354489695648, -0.24186344613226027, 0.1294789518636297, 0.17733153982971742, 0.15822048147715642, -0.03932347240190442, -0.23406513781339244, 0.04790300310078621, -0.16260660427637255, -0.11575920774247235, -0.07088386848147525, -0.01181661342574008, 0.05247942710083804, -0.2382629647405005, 0.06997782127885804, 0.03427010513087866, 0.08890915449827985, -0.06963097791123518, -0.11051707770831187, -0.05280283623142168, 0.19474963818735797, 0.03565947034803685, 0.001264259398404122, 0.19797805486358439, -0.13464419911066267, -0.1456520470715141, 0.4320049950079074, -0.01955927339461173, -0.2018423064342949, 0.280613966854322, -0.10876224507597393, -0.1658121128123857, 0.07920087378924634, 0.1678250687242761, 0.060857657289040655, -0.1739583334157532, 0.017523919264367836, 0.0075862785386459405, 0.16123126624611167, 0.05479449029228139, 0.0016909283389088133, 0.20575780652645437, 0.18999764752003667, 0.025792825246241245, 0.07882301442953922, -0.021399082265085946, -0.17781711124542865, -0.22396523052905226, -0.18169258612873768, -0.14599984617326672, 0.06545372800431157, -0.0652992831616155, -0.12632220056568744, 0.3328999865490248, 0.16454119753899235, 0.14370043125812335, 0.020121139435271378, 0.24344670582762723, 0.05585966461543469, 0.07267801026062726, -0.001048877180232601, 0.1909282702582062, 0.1219463229940181, 0.09653567002994388, -0.25336854925693153, 0.13780758524224207, 0.001441120978405463] |
1,802.08025 | Dynamics of driven translocation of semiflexible polymers | We study translocation of semiflexible polymers driven by force $f_d$ inside
a nanometer-scale pore using our three-dimensional Langevin dynamics model. We
show that the translocation time $\tau$ increases with increasing bending
rigidity $\kappa$. Similarly, the exponent $\beta$ for the scaling of $\tau$
with polymer length $N$, $\tau \sim N^\beta$, increases with increasing
$\kappa$ as well as with increasing $f_d$. By comparing waiting times between
semiflexible and fully flexible polymers we show that for realistic $f_d$
translocation dynamics is to a large extent, but not completely, determined by
the polymer's elastic length measured in number of Kuhn segments $N_{\rm
Kuhn}$. Unlike in driven translocation of flexible polymers, friction related
to the polymer segment on the trans side has a considerable effect on the
resulting dynamics. This friction is intermittently reduced by buckling of the
polymer segment in the vicinity of the pore opening on the trans side. We show
that in the experimentally relevant regime, where viscosity is higher than in
computer simulation models, the probability for this buckling increases with
increasing $f_d$, giving rise to larger contribution to trans side friction at
small $f_d$. Similarly to flexible polymers, we find significant center of mass
diffusion of the cis side polymer segment. This speeds up translocation, which
effect is larger for smaller $f_d$. However, this speed-up is smaller than the
slowing down due to the trans side friction. At large enough $N_{\rm Kuhn}$,
the roles can be seen to be reversed and the dynamics of flexible polymers be
reached. However, for example, polymers used in translocation experiments of
DNA, are elastically so short, that the finite-length dynamics outlined here
applies.
| physics.bio-ph cond-mat.soft | we study translocation of semiflexible polymers driven by force f_d inside a nanometerscale pore using our threedimensional langevin dynamics model we show that the translocation time tau increases with increasing bending rigidity kappa similarly the exponent beta for the scaling of tau with polymer length n tau sim nbeta increases with increasing kappa as well as with increasing f_d by comparing waiting times between semiflexible and fully flexible polymers we show that for realistic f_d translocation dynamics is to a large extent but not completely determined by the polymers elastic length measured in number of kuhn segments n_rm kuhn unlike in driven translocation of flexible polymers friction related to the polymer segment on the trans side has a considerable effect on the resulting dynamics this friction is intermittently reduced by buckling of the polymer segment in the vicinity of the pore opening on the trans side we show that in the experimentally relevant regime where viscosity is higher than in computer simulation models the probability for this buckling increases with increasing f_d giving rise to larger contribution to trans side friction at small f_d similarly to flexible polymers we find significant center of mass diffusion of the cis side polymer segment this speeds up translocation which effect is larger for smaller f_d however this speedup is smaller than the slowing down due to the trans side friction at large enough n_rm kuhn the roles can be seen to be reversed and the dynamics of flexible polymers be reached however for example polymers used in translocation experiments of dna are elastically so short that the finitelength dynamics outlined here applies | [['we', 'study', 'translocation', 'of', 'semiflexible', 'polymers', 'driven', 'by', 'force', 'f_d', 'inside', 'a', 'nanometerscale', 'pore', 'using', 'our', 'threedimensional', 'langevin', 'dynamics', 'model', 'we', 'show', 'that', 'the', 'translocation', 'time', 'tau', 'increases', 'with', 'increasing', 'bending', 'rigidity', 'kappa', 'similarly', 'the', 'exponent', 'beta', 'for', 'the', 'scaling', 'of', 'tau', 'with', 'polymer', 'length', 'n', 'tau', 'sim', 'nbeta', 'increases', 'with', 'increasing', 'kappa', 'as', 'well', 'as', 'with', 'increasing', 'f_d', 'by', 'comparing', 'waiting', 'times', 'between', 'semiflexible', 'and', 'fully', 'flexible', 'polymers', 'we', 'show', 'that', 'for', 'realistic', 'f_d', 'translocation', 'dynamics', 'is', 'to', 'a', 'large', 'extent', 'but', 'not', 'completely', 'determined', 'by', 'the', 'polymers', 'elastic', 'length', 'measured', 'in', 'number', 'of', 'kuhn', 'segments', 'n_rm', 'kuhn', 'unlike', 'in', 'driven', 'translocation', 'of', 'flexible', 'polymers', 'friction', 'related', 'to', 'the', 'polymer', 'segment', 'on', 'the', 'trans', 'side', 'has', 'a', 'considerable', 'effect', 'on', 'the', 'resulting', 'dynamics', 'this', 'friction', 'is', 'intermittently', 'reduced', 'by', 'buckling', 'of', 'the', 'polymer', 'segment', 'in', 'the', 'vicinity', 'of', 'the', 'pore', 'opening', 'on', 'the', 'trans', 'side', 'we', 'show', 'that', 'in', 'the', 'experimentally', 'relevant', 'regime', 'where', 'viscosity', 'is', 'higher', 'than', 'in', 'computer', 'simulation', 'models', 'the', 'probability', 'for', 'this', 'buckling', 'increases', 'with', 'increasing', 'f_d', 'giving', 'rise', 'to', 'larger', 'contribution', 'to', 'trans', 'side', 'friction', 'at', 'small', 'f_d', 'similarly', 'to', 'flexible', 'polymers', 'we', 'find', 'significant', 'center', 'of', 'mass', 'diffusion', 'of', 'the', 'cis', 'side', 'polymer', 'segment', 'this', 'speeds', 'up', 'translocation', 'which', 'effect', 'is', 'larger', 'for', 'smaller', 'f_d', 'however', 'this', 'speedup', 'is', 'smaller', 'than', 'the', 'slowing', 'down', 'due', 'to', 'the', 'trans', 'side', 'friction', 'at', 'large', 'enough', 'n_rm', 'kuhn', 'the', 'roles', 'can', 'be', 'seen', 'to', 'be', 'reversed', 'and', 'the', 'dynamics', 'of', 'flexible', 'polymers', 'be', 'reached', 'however', 'for', 'example', 'polymers', 'used', 'in', 'translocation', 'experiments', 'of', 'dna', 'are', 'elastically', 'so', 'short', 'that', 'the', 'finitelength', 'dynamics', 'outlined', 'here', 'applies']] | [-0.13751826012683652, 0.24530155983403823, -0.04537580630717778, -0.006147681356781616, -0.010903733426516314, -0.20041412752308643, 0.003029230705957486, 0.39516091817595256, -0.2924798209995696, -0.25011777824749926, 0.034690385319978055, -0.25408533405249445, -0.12612739745544815, 0.20540383645007906, -0.013022635687751952, 0.03543473226381778, 0.04762724095342688, -0.01255511400570269, 0.007617264449402523, -0.16166583797201986, 0.15781432210218263, 0.10939137249160212, 0.24842566736284852, 0.11845847509098568, 0.03252029155993827, 0.009184884319435043, 0.029525446612041678, 0.06993177494373463, -0.25614220940053106, 0.07255054514190411, 0.18431467680212338, -0.032946993553574756, 0.24283562466237335, -0.451334281904159, -0.2054401689709327, 0.08615067756568605, 0.20500073586521345, 0.11967016774494561, 0.0341586163536893, -0.23223155998316727, 0.07479765860460781, -0.15411887173155725, -0.11049375781394735, -0.009019978697581362, 0.12676845230231387, 0.07334012758561503, -0.2292017481959733, 0.14355877002164094, 0.012924610538889401, 0.05117324759082723, 0.002834648077400422, -0.11930792121957558, -0.01937520428262928, 0.11646408418567374, 0.12581358188079483, 0.07656725597408597, 0.26321021349560536, -0.1422069203039306, -0.04265501207350078, 0.3796012443126799, -0.054014283470522964, -0.210708260477878, 0.18179014581774938, -0.15104867632892052, -0.11984898410138127, 0.21586826104379941, 0.13865869899702754, 0.07782167736890978, -0.08114247317997164, 0.021621842009576252, -0.016199884372313254, 0.23495063690129378, 0.127495386955401, -0.04860371357127747, 0.1831467626183588, 0.23010263288762337, 0.04710567545069582, 0.17395004313993076, -0.07245701818370354, -0.14317848065220595, -0.22594126641012893, -0.1672735372558236, -0.1806853981255848, 0.09499541077366641, -0.1350080867203387, -0.13873791126326612, 0.3018423490586334, 0.1117719072756811, 0.22975354086863894, 0.14273252685296395, 0.2216678637298011, 0.06888986139088267, 0.08621827758187393, 0.04518477074268748, 0.20388471736956984, 0.11836522451228008, 0.08484535012740406, -0.280443939438339, 0.08828425928552161, 0.029055455557614233] |
1,802.08026 | Complex-valued Neural Networks with Non-parametric Activation Functions | Complex-valued neural networks (CVNNs) are a powerful modeling tool for
domains where data can be naturally interpreted in terms of complex numbers.
However, several analytical properties of the complex domain (e.g.,
holomorphicity) make the design of CVNNs a more challenging task than their
real counterpart. In this paper, we consider the problem of flexible activation
functions (AFs) in the complex domain, i.e., AFs endowed with sufficient
degrees of freedom to adapt their shape given the training data. While this
problem has received considerable attention in the real case, a very limited
literature exists for CVNNs, where most activation functions are generally
developed in a split fashion (i.e., by considering the real and imaginary parts
of the activation separately) or with simple phase-amplitude techniques.
Leveraging over the recently proposed kernel activation functions (KAFs), and
related advances in the design of complex-valued kernels, we propose the first
fully complex, non-parametric activation function for CVNNs, which is based on
a kernel expansion with a fixed dictionary that can be implemented efficiently
on vectorized hardware. Several experiments on common use cases, including
prediction and channel equalization, validate our proposal when compared to
real-valued neural networks and CVNNs with fixed activation functions.
| cs.NE | complexvalued neural networks cvnns are a powerful modeling tool for domains where data can be naturally interpreted in terms of complex numbers however several analytical properties of the complex domain eg holomorphicity make the design of cvnns a more challenging task than their real counterpart in this paper we consider the problem of flexible activation functions afs in the complex domain ie afs endowed with sufficient degrees of freedom to adapt their shape given the training data while this problem has received considerable attention in the real case a very limited literature exists for cvnns where most activation functions are generally developed in a split fashion ie by considering the real and imaginary parts of the activation separately or with simple phaseamplitude techniques leveraging over the recently proposed kernel activation functions kafs and related advances in the design of complexvalued kernels we propose the first fully complex nonparametric activation function for cvnns which is based on a kernel expansion with a fixed dictionary that can be implemented efficiently on vectorized hardware several experiments on common use cases including prediction and channel equalization validate our proposal when compared to realvalued neural networks and cvnns with fixed activation functions | [['complexvalued', 'neural', 'networks', 'cvnns', 'are', 'a', 'powerful', 'modeling', 'tool', 'for', 'domains', 'where', 'data', 'can', 'be', 'naturally', 'interpreted', 'in', 'terms', 'of', 'complex', 'numbers', 'however', 'several', 'analytical', 'properties', 'of', 'the', 'complex', 'domain', 'eg', 'holomorphicity', 'make', 'the', 'design', 'of', 'cvnns', 'a', 'more', 'challenging', 'task', 'than', 'their', 'real', 'counterpart', 'in', 'this', 'paper', 'we', 'consider', 'the', 'problem', 'of', 'flexible', 'activation', 'functions', 'afs', 'in', 'the', 'complex', 'domain', 'ie', 'afs', 'endowed', 'with', 'sufficient', 'degrees', 'of', 'freedom', 'to', 'adapt', 'their', 'shape', 'given', 'the', 'training', 'data', 'while', 'this', 'problem', 'has', 'received', 'considerable', 'attention', 'in', 'the', 'real', 'case', 'a', 'very', 'limited', 'literature', 'exists', 'for', 'cvnns', 'where', 'most', 'activation', 'functions', 'are', 'generally', 'developed', 'in', 'a', 'split', 'fashion', 'ie', 'by', 'considering', 'the', 'real', 'and', 'imaginary', 'parts', 'of', 'the', 'activation', 'separately', 'or', 'with', 'simple', 'phaseamplitude', 'techniques', 'leveraging', 'over', 'the', 'recently', 'proposed', 'kernel', 'activation', 'functions', 'kafs', 'and', 'related', 'advances', 'in', 'the', 'design', 'of', 'complexvalued', 'kernels', 'we', 'propose', 'the', 'first', 'fully', 'complex', 'nonparametric', 'activation', 'function', 'for', 'cvnns', 'which', 'is', 'based', 'on', 'a', 'kernel', 'expansion', 'with', 'a', 'fixed', 'dictionary', 'that', 'can', 'be', 'implemented', 'efficiently', 'on', 'vectorized', 'hardware', 'several', 'experiments', 'on', 'common', 'use', 'cases', 'including', 'prediction', 'and', 'channel', 'equalization', 'validate', 'our', 'proposal', 'when', 'compared', 'to', 'realvalued', 'neural', 'networks', 'and', 'cvnns', 'with', 'fixed', 'activation', 'functions']] | [-0.08131212264306484, 0.03574810541343643, -0.031155784670523542, 0.05203488799282421, -0.11836032606283117, -0.15819744050483867, 0.005963172703901031, 0.4304023820133927, -0.26234182864864863, -0.25774802910967676, 0.11238962887055925, -0.22790919660548042, -0.23462190903690147, 0.22051302677606643, -0.057376790700745084, 0.09846187033395042, 0.07270950719071222, 0.041002911926828665, -0.07614219516381589, -0.23644420618207906, 0.33018438905822634, 0.029853940610466572, 0.2886749695357748, 0.02709405029400578, 0.1151359383203562, 0.011215249407412437, -0.023419779383809056, -0.0020822773498975996, -0.04386185860305789, 0.16766090438048814, 0.29593107342096, 0.13910321836232156, 0.30221499956028564, -0.4555514096258785, -0.27493813805646133, 0.1372661966579933, 0.14437840412024275, 0.0371123519732007, -0.026543354298603286, -0.2680451030296931, 0.09192046099389681, -0.16347283973987334, -0.031539665972388484, -0.12461435570981978, 0.009280166082878403, 0.04066160912501394, -0.301513221492485, 0.04097154112840024, 0.03395097292229878, 0.062183949954543016, -0.05052842672082222, -0.1316636647239592, 0.028762549886404334, 0.10543060808889874, 0.008432324045588295, 0.05520168240158464, 0.08781157934868018, -0.14779211365414527, -0.12264561030403877, 0.35175822533402346, -0.022496086073791735, -0.2866795682738332, 0.1982417912142668, -0.08425008314590769, -0.13558714333590743, 0.10304046113772063, 0.2136415494673857, 0.13973189021347251, -0.1516525117922864, 0.07662266856035795, -0.0036990207709788068, 0.1420656088686449, 0.058129878796230494, 0.0008914959569683837, 0.14509202807971516, 0.18016799366654743, 0.03782426768755493, 0.17965145338785263, -0.05247630771169165, -0.11168513580835258, -0.24735974151225107, -0.09468131131955852, -0.2175950036924285, -0.0018428731095140355, -0.08660988386473406, -0.17362900455198652, 0.41876444909816163, 0.11571703903284869, 0.24540910739593472, 0.10281541096436587, 0.31425046443946303, 0.12011415343453899, 0.11716475473423749, 0.07287901487327914, 0.14064657169117634, 0.09552276594479223, 0.11292851398710288, -0.15027172532733907, 0.09053517395729757, 0.009093981656969199] |
1,802.08027 | MEC-assisted End-to-End Latency Evaluations for C-V2X Communications | The efficient design of fifth generation (5G) mobile networks is driven by
the need to support the dynamic proliferation of several vertical market
segments. Considering the automotive sector, different Cellular
Vehicle-to-Everything (C-V2X) use cases have been identified by the industrial
and research world, referring to infotainment, automated driving and road
safety. A common characteristic of these use cases is the need to exploit
collective awareness of the road environment towards satisfying performance
requirements. One of these requirements is the End-to-End (E2E) latency when,
for instance, Vulnerable Road Users (VRUs) inform vehicles about their status
(e.g., location) and activity, assisted by the cellular network. In this paper,
focusing on a freeway-based VRU scenario, we argue that, in contrast to
conventional, remote cloud-based cellular architecture, the deployment of
Multi-access Edge Computing (MEC) infrastructure can substantially prune the
E2E communication latency. Our argument is supported by an extensive
simulation-based performance comparison between the conventional and the
MEC-assisted network architecture.
| eess.SP | the efficient design of fifth generation 5g mobile networks is driven by the need to support the dynamic proliferation of several vertical market segments considering the automotive sector different cellular vehicletoeverything cv2x use cases have been identified by the industrial and research world referring to infotainment automated driving and road safety a common characteristic of these use cases is the need to exploit collective awareness of the road environment towards satisfying performance requirements one of these requirements is the endtoend e2e latency when for instance vulnerable road users vrus inform vehicles about their status eg location and activity assisted by the cellular network in this paper focusing on a freewaybased vru scenario we argue that in contrast to conventional remote cloudbased cellular architecture the deployment of multiaccess edge computing mec infrastructure can substantially prune the e2e communication latency our argument is supported by an extensive simulationbased performance comparison between the conventional and the mecassisted network architecture | [['the', 'efficient', 'design', 'of', 'fifth', 'generation', '5g', 'mobile', 'networks', 'is', 'driven', 'by', 'the', 'need', 'to', 'support', 'the', 'dynamic', 'proliferation', 'of', 'several', 'vertical', 'market', 'segments', 'considering', 'the', 'automotive', 'sector', 'different', 'cellular', 'vehicletoeverything', 'cv2x', 'use', 'cases', 'have', 'been', 'identified', 'by', 'the', 'industrial', 'and', 'research', 'world', 'referring', 'to', 'infotainment', 'automated', 'driving', 'and', 'road', 'safety', 'a', 'common', 'characteristic', 'of', 'these', 'use', 'cases', 'is', 'the', 'need', 'to', 'exploit', 'collective', 'awareness', 'of', 'the', 'road', 'environment', 'towards', 'satisfying', 'performance', 'requirements', 'one', 'of', 'these', 'requirements', 'is', 'the', 'endtoend', 'e2e', 'latency', 'when', 'for', 'instance', 'vulnerable', 'road', 'users', 'vrus', 'inform', 'vehicles', 'about', 'their', 'status', 'eg', 'location', 'and', 'activity', 'assisted', 'by', 'the', 'cellular', 'network', 'in', 'this', 'paper', 'focusing', 'on', 'a', 'freewaybased', 'vru', 'scenario', 'we', 'argue', 'that', 'in', 'contrast', 'to', 'conventional', 'remote', 'cloudbased', 'cellular', 'architecture', 'the', 'deployment', 'of', 'multiaccess', 'edge', 'computing', 'mec', 'infrastructure', 'can', 'substantially', 'prune', 'the', 'e2e', 'communication', 'latency', 'our', 'argument', 'is', 'supported', 'by', 'an', 'extensive', 'simulationbased', 'performance', 'comparison', 'between', 'the', 'conventional', 'and', 'the', 'mecassisted', 'network', 'architecture']] | [-0.23033431298915877, 0.028903801052459946, 0.030494095796912715, 0.020289847913028843, -0.0911948879422505, -0.1851180756658122, 0.10417729618432992, 0.3950568076416657, -0.22980489794697082, -0.31797081440106617, 0.12070187723434941, -0.2372218123365, -0.210919227599251, 0.19142155012708495, -0.1461869788475966, 0.0960577366686148, 0.08308422653300856, 0.01711217482504737, 0.03995721766199046, -0.24333707137976762, 0.2968168212252052, 0.06872780578114189, 0.4049669922897955, 0.08555778477631219, -0.0034819822365345504, -0.0078119142808763965, -0.05183894765282098, -0.055428379127445256, -0.05157202279805425, 0.19503828730470466, 0.3295792315953544, 0.20920675824692642, 0.33405803081990737, -0.5126672440341541, -0.25916684097187087, 0.09077590694892909, 0.1526619547999021, 0.014422888014852614, -0.013612808736023045, -0.3463663720441135, 0.11239649370454809, -0.2706428055421679, -0.10782300015796556, -0.02990358499296058, -0.018512498427865808, 0.05266096830888131, -0.2573376959008346, -0.043889035262521234, -0.0012825452571420314, 0.08739479569802908, -0.01592449996659726, -0.03951056513862757, -0.009372388546403449, 0.21928993806673075, 0.01788533065625309, 0.020117987164253878, 0.194199695883473, -0.17706774357689678, -0.15249303176049628, 0.3912318718389838, 0.04317966635435723, -0.16974272285043807, 0.20448550143938318, 0.010796488704184046, -0.1463422995399345, 0.083431441406417, 0.23013948176249668, -0.0010404639148649264, -0.2103596620384321, 0.029479233186704094, 0.032780917122500475, 0.12511152612474782, 0.06660702637572131, 0.05141120565474614, 0.21839107191432025, 0.2877711902913795, 0.13470843260164383, 0.0879600705675684, -0.09750592569947582, -0.1308502462970746, -0.19472685015636387, -0.13124710479569804, -0.1572942752633002, 0.00024775984279763004, -0.06331095868961994, -0.07496454391187032, 0.37038893941427015, 0.20844727037051183, 0.09413082213382926, 0.09910123357730737, 0.424734281714667, 0.047732217501177655, 0.10803483651993288, 0.11758467889853523, 0.182647689141321, -0.025597157004416327, 0.22750088274055583, -0.1931891754336123, 0.1153819135015274, -0.0022722641610867017] |
1,802.08028 | Approximate controllabilty from the exterior of space-time fractional
diffusive equations | Let $\Om\subset\RR^N$ a bounded domain with a Lipschitz continuous boundary.
We study the controllability of the space-time fractional diffusion equation
\begin{equation*} \begin{cases} \mathbb D_t^\alpha u+(-\Delta)^su=0\;\;&\mbox{
in }\;(0,T)\times\Omega\\ u=g &\mbox{ in }\;(0,T)\times(\RR^N\setminus\Omega)\\
u(0,\cdot)=u_0&\mbox{ in }\;\Omega, \end{cases} \end{equation*} where
$u=u(t,x)$ is the state to be controlled and $g=g(t,x)$ is the control function
which is localized in a subset $\mathcal O$ of $\Omc$. Here, $0<\alpha\le 1$,
$0<s<1$ and $T>0$ be real numbers. After giving an explicit representation of
solutions, we show that the system is always approximately controllable for
every $T>0$, $u_0\in L^2(\Omega)$ and $g\in \mathcal D((0,T)\times\mathcal O)$
where $\mathcal O\subset(\RR^N\setminus\bOm)$ is any open set. The results
obtained are sharp in the sense that such a system is never null controllable
if $0<\alpha<1$. The proof of our result is based on a new unique continuation
principle for the eigenvalues problem associated with the fractional Laplace
operator subject to the zero exterior boundary condition that we have
established.
| math.AP | let omsubsetrrn a bounded domain with a lipschitz continuous boundary we study the controllability of the spacetime fractional diffusion equation beginequation begincases mathbb d_talpha udeltasu0mbox in 0ttimesomega ug mbox in 0ttimesrrnsetminusomega u0cdotu_0mbox in omega endcases endequation where uutx is the state to be controlled and ggtx is the control function which is localized in a subset mathcal o of omc here 0alphale 1 0s1 and t0 be real numbers after giving an explicit representation of solutions we show that the system is always approximately controllable for every t0 u_0in l2omega and gin mathcal d0ttimesmathcal o where mathcal osubsetrrnsetminusbom is any open set the results obtained are sharp in the sense that such a system is never null controllable if 0alpha1 the proof of our result is based on a new unique continuation principle for the eigenvalues problem associated with the fractional laplace operator subject to the zero exterior boundary condition that we have established | [['let', 'omsubsetrrn', 'a', 'bounded', 'domain', 'with', 'a', 'lipschitz', 'continuous', 'boundary', 'we', 'study', 'the', 'controllability', 'of', 'the', 'spacetime', 'fractional', 'diffusion', 'equation', 'beginequation', 'begincases', 'mathbb', 'd_talpha', 'udeltasu0mbox', 'in', '0ttimesomega', 'ug', 'mbox', 'in', '0ttimesrrnsetminusomega', 'u0cdotu_0mbox', 'in', 'omega', 'endcases', 'endequation', 'where', 'uutx', 'is', 'the', 'state', 'to', 'be', 'controlled', 'and', 'ggtx', 'is', 'the', 'control', 'function', 'which', 'is', 'localized', 'in', 'a', 'subset', 'mathcal', 'o', 'of', 'omc', 'here', '0alphale', '1', '0s1', 'and', 't0', 'be', 'real', 'numbers', 'after', 'giving', 'an', 'explicit', 'representation', 'of', 'solutions', 'we', 'show', 'that', 'the', 'system', 'is', 'always', 'approximately', 'controllable', 'for', 'every', 't0', 'u_0in', 'l2omega', 'and', 'gin', 'mathcal', 'd0ttimesmathcal', 'o', 'where', 'mathcal', 'osubsetrrnsetminusbom', 'is', 'any', 'open', 'set', 'the', 'results', 'obtained', 'are', 'sharp', 'in', 'the', 'sense', 'that', 'such', 'a', 'system', 'is', 'never', 'null', 'controllable', 'if', '0alpha1', 'the', 'proof', 'of', 'our', 'result', 'is', 'based', 'on', 'a', 'new', 'unique', 'continuation', 'principle', 'for', 'the', 'eigenvalues', 'problem', 'associated', 'with', 'the', 'fractional', 'laplace', 'operator', 'subject', 'to', 'the', 'zero', 'exterior', 'boundary', 'condition', 'that', 'we', 'have', 'established']] | [-0.17970335539660043, 0.09019301904669921, -0.0432460485057918, -0.020185940462595395, -0.07440617363614847, -0.17145077662770541, -0.03130349255211297, 0.33441650601369993, -0.31580332105307757, -0.1450327447533202, 0.14963387324970506, -0.33752235609936676, -0.09821633318736896, 0.1759601834659357, -0.09443328823564814, 0.057815212371512034, 0.04504363144095354, 0.08660492089697394, -0.03114937236490992, -0.18178024712306934, 0.34919686636057534, -0.14477839093769387, 0.16623789530887337, 0.060639223457649855, 0.10888934265632107, -0.06033947439642534, 0.0954038059516322, -0.026291612597486497, -0.2352180660101502, 0.03721649296895354, 0.23180265539819944, 0.08834399509744174, 0.3239176558951537, -0.3805611715135307, -0.15103595410188547, 0.1903006983303218, 0.16663954841277126, -0.02737316728465031, -0.01464236444131579, -0.34402898758282363, 0.14453424818712432, -0.07983305512691474, -0.1812635576700931, -0.025338528234334218, 0.11259687428369003, 0.021573466695464994, -0.39489280059379306, 0.10126617052006301, 0.09299374002564166, 0.03916993840806642, -0.1425564594417937, -0.10601871197435017, -0.062850677810584, 0.053694651585680486, -0.03889265912268184, 0.1375695249425298, 0.017617797678206624, -0.06862857278601146, -0.042887178868163046, 0.34584295315047103, -0.07920314748866522, -0.29077453572987294, 0.07975100415448348, -0.2134555908629582, -0.11700903933786717, 0.07537854702028186, 0.08599931549765549, 0.17919319078047463, -0.12561099757527502, 0.227462558419884, -0.09679068400854005, 0.15651963410667796, 0.08370422520896509, 0.007702567271704526, 0.06379750616797784, 0.12167426062190309, 0.15637062592780357, 0.10346086814898212, 0.0052309322854358275, -0.033613018460293, -0.3974150077370154, -0.15714451100449173, -0.19945710512403983, 0.15385609791062924, -0.07806190899955379, -0.16647461339590602, 0.30469204773682923, 0.09310657797709146, 0.17929300003475984, 0.06431015899015248, 0.19204295463669968, 0.21286501505795857, -0.02632779542192006, 0.12508256134551754, 0.1105342208705589, 0.11655854208705325, 0.1011852792996381, -0.2303460651159692, 0.020221866443943307, 0.12835947862304795] |
1,802.08029 | Optical Chirality of Time-Harmonic Wavefields for Classification of
Scatterers | We derive expressions for the scattering, extinction and conversion of the
chirality of monochromatic light scattered by bodies which are characterized by
a T-matrix. In analogy to the conditions obtained from the conservation of
energy, these quantities enable the classification of arbitrary scattering
objects due to their full, i.e. either chiral or achiral, electromagnetic
response. To this end, we put forward and determine the concepts of duality and
breaking of duality symmetry, anti-duality, helicity variation, helicity
annhiliation and the breaking of helicity annihilation. Different classes, such
as chiral and dual scatterers, are illustrated in this analysis with model
examples of spherical and non-spherical shape. As for spheres, these concepts
are analysed by considering non-Rayleigh dipolar dielectric particles of high
refractive index, which, having a strong magnetic response to the incident
wavefield, offer an excellent laboratory to test and interpret such changes in
the chirality of the illumination. In addition, comparisons with existing
experimental data are made.
| physics.optics | we derive expressions for the scattering extinction and conversion of the chirality of monochromatic light scattered by bodies which are characterized by a tmatrix in analogy to the conditions obtained from the conservation of energy these quantities enable the classification of arbitrary scattering objects due to their full ie either chiral or achiral electromagnetic response to this end we put forward and determine the concepts of duality and breaking of duality symmetry antiduality helicity variation helicity annhiliation and the breaking of helicity annihilation different classes such as chiral and dual scatterers are illustrated in this analysis with model examples of spherical and nonspherical shape as for spheres these concepts are analysed by considering nonrayleigh dipolar dielectric particles of high refractive index which having a strong magnetic response to the incident wavefield offer an excellent laboratory to test and interpret such changes in the chirality of the illumination in addition comparisons with existing experimental data are made | [['we', 'derive', 'expressions', 'for', 'the', 'scattering', 'extinction', 'and', 'conversion', 'of', 'the', 'chirality', 'of', 'monochromatic', 'light', 'scattered', 'by', 'bodies', 'which', 'are', 'characterized', 'by', 'a', 'tmatrix', 'in', 'analogy', 'to', 'the', 'conditions', 'obtained', 'from', 'the', 'conservation', 'of', 'energy', 'these', 'quantities', 'enable', 'the', 'classification', 'of', 'arbitrary', 'scattering', 'objects', 'due', 'to', 'their', 'full', 'ie', 'either', 'chiral', 'or', 'achiral', 'electromagnetic', 'response', 'to', 'this', 'end', 'we', 'put', 'forward', 'and', 'determine', 'the', 'concepts', 'of', 'duality', 'and', 'breaking', 'of', 'duality', 'symmetry', 'antiduality', 'helicity', 'variation', 'helicity', 'annhiliation', 'and', 'the', 'breaking', 'of', 'helicity', 'annihilation', 'different', 'classes', 'such', 'as', 'chiral', 'and', 'dual', 'scatterers', 'are', 'illustrated', 'in', 'this', 'analysis', 'with', 'model', 'examples', 'of', 'spherical', 'and', 'nonspherical', 'shape', 'as', 'for', 'spheres', 'these', 'concepts', 'are', 'analysed', 'by', 'considering', 'nonrayleigh', 'dipolar', 'dielectric', 'particles', 'of', 'high', 'refractive', 'index', 'which', 'having', 'a', 'strong', 'magnetic', 'response', 'to', 'the', 'incident', 'wavefield', 'offer', 'an', 'excellent', 'laboratory', 'to', 'test', 'and', 'interpret', 'such', 'changes', 'in', 'the', 'chirality', 'of', 'the', 'illumination', 'in', 'addition', 'comparisons', 'with', 'existing', 'experimental', 'data', 'are', 'made']] | [-0.11240021078454258, 0.18490498513975498, -0.07228679671073211, 0.06968543912411075, -0.07235064371277324, -0.08947271052082735, -0.0030787554357878185, 0.41040348899006457, -0.24090223244615142, -0.34158684416105606, 0.052288951264549195, -0.2719657291392131, -0.12655857540425156, 0.14115432507279874, -0.0023648916987865534, 0.07163393286407574, -0.02053325967077021, -0.013335017718725486, -0.05683040388409266, -0.1589172689997071, 0.3060546129074117, 0.0181463025646381, 0.28462330036337014, 0.07575346269136803, 0.07004187962224756, 0.05170979271128822, -0.048555865622270704, 0.024043968113671457, -0.09267200637070534, 0.13123321334205684, 0.22289217583073134, 0.042386170257451374, 0.1070904279877613, -0.48024248377746576, -0.20220300386351375, 0.06553365483081766, 0.11940576885252369, 0.09728092080671583, -0.07362320246749449, -0.2958047685346433, 0.03173117558229956, -0.14176641462685227, -0.17604622632180425, -0.09186071899187352, 0.02938686698779476, 0.043071030790300724, -0.28039381823460147, 0.05024226228162259, 0.050510954160194896, 0.07937666790124465, -0.08492054515397297, -0.08284030993190872, -0.04925219964405352, 0.11055453348142857, 0.11018708234504712, -0.023070043098036345, 0.12933284761580674, -0.1714448206664922, -0.10920447774697095, 0.4098438644697043, -0.014354782974652307, -0.20310204317823488, 0.19246020781363107, -0.141071549671182, -0.06183981825295207, 0.15818596435168397, 0.18141404074290163, 0.09651947939955907, -0.13054319391141997, 0.0374552692236022, -0.03923763795272, 0.112623602362779, 0.1379223976574548, 0.06986735182415162, 0.24706624202768912, 0.11649985967866182, -0.003981174012138085, 0.14890685549017962, -0.09073237254127085, -0.04651288752891607, -0.3253129420578238, -0.13094707143299475, -0.17293176363681914, 0.05252121671294951, -0.08720084561591411, -0.16058628038265485, 0.3643701173661446, 0.11304881814383454, 0.19332730473781173, 0.02236463177296055, 0.3001625559341114, 0.12365001745147074, 0.06223400964480281, 0.008936947569940481, 0.3005706224433304, 0.1797723525317912, 0.09156936874564786, -0.23856521873922365, 0.003942662580906377, 0.027669213198173743] |
1,802.0803 | Study of the filamentary infrared dark cloud G192.76+00.10 in the
S254-S258 OB complex | We present results of a high resolution study of the filamentary infrared
dark cloud G192.76+00.10 in the S254-S258 OB complex in several molecular
species tracing different physical conditions. These include three
isotopologues of carbon monoxide (CO), ammonia (NH$_3$), carbon monosulfide
(CS). The aim of this work is to study the general structure and kinematics of
the filamentary cloud, its fragmentation and physical parameters. The gas
temperature is derived from the NH$_3 $ $(J,K) = (1,1), (2,2)$ and
$^{12}$CO(2--1) lines and the $^{13}$CO(1--0), $^{13}$CO(2--1) emission is used
to investigate the overall gas distribution and kinematics. Several dense
clumps are identified from the CS(2--1) data. Values of the gas temperature lie
in the ranges $10-35$ K, column density $N(\mathrm{H}_2)$ reaches the value 5.1
10$^{22}$ cm$^{-2}$. The width of the filament is of order 1 pc. The masses of
the dense clumps range from $ \sim 30 $ M$_\odot$ to $ \sim 160 $ M$_\odot$.
They appear to be gravitationally unstable. The molecular emission shows a gas
dynamical coherence along the filament. The velocity pattern may indicate
longitudinal collapse.
| astro-ph.GA | we present results of a high resolution study of the filamentary infrared dark cloud g192760010 in the s254s258 ob complex in several molecular species tracing different physical conditions these include three isotopologues of carbon monoxide co ammonia nh_3 carbon monosulfide cs the aim of this work is to study the general structure and kinematics of the filamentary cloud its fragmentation and physical parameters the gas temperature is derived from the nh_3 jk 11 22 and 12co21 lines and the 13co10 13co21 emission is used to investigate the overall gas distribution and kinematics several dense clumps are identified from the cs21 data values of the gas temperature lie in the ranges 1035 k column density nmathrmh_2 reaches the value 51 1022 cm2 the width of the filament is of order 1 pc the masses of the dense clumps range from sim 30 m_odot to sim 160 m_odot they appear to be gravitationally unstable the molecular emission shows a gas dynamical coherence along the filament the velocity pattern may indicate longitudinal collapse | [['we', 'present', 'results', 'of', 'a', 'high', 'resolution', 'study', 'of', 'the', 'filamentary', 'infrared', 'dark', 'cloud', 'g192760010', 'in', 'the', 's254s258', 'ob', 'complex', 'in', 'several', 'molecular', 'species', 'tracing', 'different', 'physical', 'conditions', 'these', 'include', 'three', 'isotopologues', 'of', 'carbon', 'monoxide', 'co', 'ammonia', 'nh_3', 'carbon', 'monosulfide', 'cs', 'the', 'aim', 'of', 'this', 'work', 'is', 'to', 'study', 'the', 'general', 'structure', 'and', 'kinematics', 'of', 'the', 'filamentary', 'cloud', 'its', 'fragmentation', 'and', 'physical', 'parameters', 'the', 'gas', 'temperature', 'is', 'derived', 'from', 'the', 'nh_3', 'jk', '11', '22', 'and', '12co21', 'lines', 'and', 'the', '13co10', '13co21', 'emission', 'is', 'used', 'to', 'investigate', 'the', 'overall', 'gas', 'distribution', 'and', 'kinematics', 'several', 'dense', 'clumps', 'are', 'identified', 'from', 'the', 'cs21', 'data', 'values', 'of', 'the', 'gas', 'temperature', 'lie', 'in', 'the', 'ranges', '1035', 'k', 'column', 'density', 'nmathrmh_2', 'reaches', 'the', 'value', '51', '1022', 'cm2', 'the', 'width', 'of', 'the', 'filament', 'is', 'of', 'order', '1', 'pc', 'the', 'masses', 'of', 'the', 'dense', 'clumps', 'range', 'from', 'sim', '30', 'm_odot', 'to', 'sim', '160', 'm_odot', 'they', 'appear', 'to', 'be', 'gravitationally', 'unstable', 'the', 'molecular', 'emission', 'shows', 'a', 'gas', 'dynamical', 'coherence', 'along', 'the', 'filament', 'the', 'velocity', 'pattern', 'may', 'indicate', 'longitudinal', 'collapse']] | [-0.09712320768147618, 0.11443245908818565, -0.004717167968360277, 0.0359940738658305, 0.0025252380336706457, -0.0047543685829553465, 0.03406519390030946, 0.4483362789205193, -0.1786702193027726, -0.31580635178668875, 0.06926963340557186, -0.25632864914382614, 0.021188049307148134, 0.0949282090905668, 0.06395436628837381, -0.013399089688897414, 0.013835834657508858, -0.1086003046108068, -0.04892284669789359, -0.19695981284575922, 0.2853346474237255, 0.056836045417416645, 0.18946158310767683, 0.07582790509969156, 0.05952688521283993, -0.20211697959708955, -0.04622883734860893, -0.0707033238368186, -0.1760310976099245, 0.06231096971190408, 0.22087579028758073, 0.11251855257088483, 0.17219158946109395, -0.3708173955829274, -0.21032471246686738, 0.029078088571956744, 0.18570739956925342, 0.046624607239166525, 0.019359742758827306, -0.28923172680881515, 0.05024189500072034, -0.16455884346016544, -0.21266650091085207, 0.06508390999746305, 0.05470116462657702, 0.039636843559503025, -0.20561304227648766, 0.15440530260920127, -0.038139624440713275, 0.09826072908871801, -0.09861186195299933, -0.1826905289867386, -0.09998164358190618, 0.040090624088719044, -0.031204154844445414, 0.07612132643399065, 0.3125154305409265, -0.12508994778590662, 0.03074118950729363, 0.44364172857276785, -0.10017515395729411, 0.006077299754206951, 0.2625282642324097, -0.21204401755474023, -0.21550612068685465, 0.28563951668412196, 0.1063945747763139, 0.09540214455140943, -0.1469826271193317, -0.021150082304657675, -0.08781823208803564, 0.21701392462785693, 0.08897116722004521, 0.051048494596103174, 0.30633956348225916, 0.09592722590527768, 0.012037349992966247, 0.10812960019763614, -0.270698642380227, -0.08547618094357777, -0.20421399084159542, -0.16667600745919364, -0.09997859500560734, 0.08950713865552648, -0.1375838606366054, -0.07043835836236734, 0.2988841779001013, 0.1290363754360119, 0.2779028974583692, 0.0013914926779406839, 0.3028401321340242, 0.06040368240172341, 0.08872289182177398, 0.12447745594596932, 0.23748921186624636, 0.24815321081599012, 0.13018368429658636, -0.24571113800767744, 0.01601400552558597, -0.0226885576762766] |
1,802.08031 | The tangent bundle of a model category | This paper studies the homotopy theory of parameterized spectrum objects in a
model category from a global point of view. More precisely, for a model
category $\mathcal{M}$ satisfying suitable conditions, we construct a relative
model category $\mathcal{TM} \to \mathcal{M}$, called the tangent bundle, whose
fibers are models for spectra in the various over-categories of $\mathcal{M}$,
and which presents the $\infty$-categorical tangent bundle. Moreover, the
tangent bundle $\mathcal{TM}$ inherits an enriched model structure when such a
structure exists on $\mathcal{M}$. This additional structure is used in
subsequent work to identify the tangent bundles of algebras over an operad and
of enriched categories.
| math.AT | this paper studies the homotopy theory of parameterized spectrum objects in a model category from a global point of view more precisely for a model category mathcalm satisfying suitable conditions we construct a relative model category mathcaltm to mathcalm called the tangent bundle whose fibers are models for spectra in the various overcategories of mathcalm and which presents the inftycategorical tangent bundle moreover the tangent bundle mathcaltm inherits an enriched model structure when such a structure exists on mathcalm this additional structure is used in subsequent work to identify the tangent bundles of algebras over an operad and of enriched categories | [['this', 'paper', 'studies', 'the', 'homotopy', 'theory', 'of', 'parameterized', 'spectrum', 'objects', 'in', 'a', 'model', 'category', 'from', 'a', 'global', 'point', 'of', 'view', 'more', 'precisely', 'for', 'a', 'model', 'category', 'mathcalm', 'satisfying', 'suitable', 'conditions', 'we', 'construct', 'a', 'relative', 'model', 'category', 'mathcaltm', 'to', 'mathcalm', 'called', 'the', 'tangent', 'bundle', 'whose', 'fibers', 'are', 'models', 'for', 'spectra', 'in', 'the', 'various', 'overcategories', 'of', 'mathcalm', 'and', 'which', 'presents', 'the', 'inftycategorical', 'tangent', 'bundle', 'moreover', 'the', 'tangent', 'bundle', 'mathcaltm', 'inherits', 'an', 'enriched', 'model', 'structure', 'when', 'such', 'a', 'structure', 'exists', 'on', 'mathcalm', 'this', 'additional', 'structure', 'is', 'used', 'in', 'subsequent', 'work', 'to', 'identify', 'the', 'tangent', 'bundles', 'of', 'algebras', 'over', 'an', 'operad', 'and', 'of', 'enriched', 'categories']] | [-0.1565590498607034, -0.0015527541327894213, -0.0866435678804865, 0.06339921579479545, -0.09984593087401573, -0.12362312283459129, -0.032627849686328356, 0.39813365840749576, -0.3737201396477326, -0.18281803469145946, 0.05435526736730728, -0.21307485076681812, -0.160472701368208, 0.1368858587125888, -0.16154556867601996, -0.04877833524571344, 0.07228584439115654, 0.11589818236205986, -0.10131719005340249, -0.1726912440384028, 0.46782867456002547, 0.048267513100924614, 0.2773114627768994, -0.029321443750569137, 0.15617395835089506, -0.041612697147423085, 0.027266810170955735, 0.03845650186338047, -0.1486039362158534, 0.16349359924471615, 0.2700747082874454, 0.09747494804663676, 0.21296539293293204, -0.38172652241589483, -0.15882950735861656, 0.16103428882537502, 0.09255495917116578, -0.019228745511090984, 0.007646079848740609, -0.28084090374188847, 0.10545741561984662, -0.20527695974169097, -0.12029493209620071, -0.06054793867181138, 0.045431793552113346, -0.03253825365261424, -0.2586230146462365, -0.07775208452430618, 0.0970903904259229, 0.1127054701273394, -0.13630950403870037, -0.030889014718076674, -0.13600038455471877, 0.06820604973155682, -0.025743939897672524, 0.045090396190062165, 0.13614278486330467, -0.11061399939036605, -0.09262630384931765, 0.39428229272218035, -0.07949922554250254, -0.23536001965011663, 0.11594066647685936, -0.09755048820965619, -0.16643454104034913, 0.16164568143592464, 0.09932979040705406, 0.19430626217404953, -0.05141319581644614, 0.1764560445467711, -0.14960350251138801, 0.08538754556084854, 0.03219200136361293, 0.0017516848880170595, 0.18020477128390333, 0.19337023976074513, 0.05156981449408254, 0.10600527002024326, -0.03482210311386273, -0.07569577315324309, -0.3684079889023658, -0.21394697911484112, -0.019525507492667966, 0.127951055638363, -0.06791366288169877, -0.19655526247069166, 0.4054472756175564, 0.12207765313151228, 0.2776224346056876, 0.10790033275745625, 0.2421633173275905, 0.010022722456678011, 0.07309441094166867, 0.021232512779533863, 0.1638103566215475, 0.2273357658748432, -0.0037093568964409506, -0.03869028224628234, -0.013408290282223779, 0.17099131819893523] |
1,802.08032 | QuEST and High Performance Simulation of Quantum Computers | We introduce QuEST, the Quantum Exact Simulation Toolkit, and compare it to
ProjectQ, qHipster and a recent distributed implementation of Quantum++. QuEST
is the first open source, OpenMP and MPI hybridised, GPU accelerated simulator
of universal quantum circuits. Embodied as a C library, it is designed so that
a user's code can be deployed seamlessly to any platform from a laptop to a
supercomputer. QuEST is capable of simulating generic quantum circuits of
general single-qubit gates and multi-qubit controlled gates, on pure and mixed
states, represented as state-vectors and density matrices, and under the
presence of decoherence. Using the ARCUS Phase-B and ARCHER supercomputers, we
benchmark QuEST's simulation of random circuits of up to 38 qubits, distributed
over up to 2048 compute nodes, each with up to 24 cores. We directly compare
QuEST's performance to ProjectQ's on single machines, and discuss the
differences in distribution strategies of QuEST, qHipster and Quantum++. QuEST
shows excellent scaling, both strong and weak, on multicore and distributed
architectures.
| quant-ph | we introduce quest the quantum exact simulation toolkit and compare it to projectq qhipster and a recent distributed implementation of quantum quest is the first open source openmp and mpi hybridised gpu accelerated simulator of universal quantum circuits embodied as a c library it is designed so that a users code can be deployed seamlessly to any platform from a laptop to a supercomputer quest is capable of simulating generic quantum circuits of general singlequbit gates and multiqubit controlled gates on pure and mixed states represented as statevectors and density matrices and under the presence of decoherence using the arcus phaseb and archer supercomputers we benchmark quests simulation of random circuits of up to 38 qubits distributed over up to 2048 compute nodes each with up to 24 cores we directly compare quests performance to projectqs on single machines and discuss the differences in distribution strategies of quest qhipster and quantum quest shows excellent scaling both strong and weak on multicore and distributed architectures | [['we', 'introduce', 'quest', 'the', 'quantum', 'exact', 'simulation', 'toolkit', 'and', 'compare', 'it', 'to', 'projectq', 'qhipster', 'and', 'a', 'recent', 'distributed', 'implementation', 'of', 'quantum', 'quest', 'is', 'the', 'first', 'open', 'source', 'openmp', 'and', 'mpi', 'hybridised', 'gpu', 'accelerated', 'simulator', 'of', 'universal', 'quantum', 'circuits', 'embodied', 'as', 'a', 'c', 'library', 'it', 'is', 'designed', 'so', 'that', 'a', 'users', 'code', 'can', 'be', 'deployed', 'seamlessly', 'to', 'any', 'platform', 'from', 'a', 'laptop', 'to', 'a', 'supercomputer', 'quest', 'is', 'capable', 'of', 'simulating', 'generic', 'quantum', 'circuits', 'of', 'general', 'singlequbit', 'gates', 'and', 'multiqubit', 'controlled', 'gates', 'on', 'pure', 'and', 'mixed', 'states', 'represented', 'as', 'statevectors', 'and', 'density', 'matrices', 'and', 'under', 'the', 'presence', 'of', 'decoherence', 'using', 'the', 'arcus', 'phaseb', 'and', 'archer', 'supercomputers', 'we', 'benchmark', 'quests', 'simulation', 'of', 'random', 'circuits', 'of', 'up', 'to', '38', 'qubits', 'distributed', 'over', 'up', 'to', '2048', 'compute', 'nodes', 'each', 'with', 'up', 'to', '24', 'cores', 'we', 'directly', 'compare', 'quests', 'performance', 'to', 'projectqs', 'on', 'single', 'machines', 'and', 'discuss', 'the', 'differences', 'in', 'distribution', 'strategies', 'of', 'quest', 'qhipster', 'and', 'quantum', 'quest', 'shows', 'excellent', 'scaling', 'both', 'strong', 'and', 'weak', 'on', 'multicore', 'and', 'distributed', 'architectures']] | [-0.13199433410844916, 0.10324449851005166, -0.05836351445364409, 0.006778405492774637, -0.019930578319838754, -0.23038325179080812, 0.06811747879772964, 0.39698323261360696, -0.2375158719189557, -0.3658440166158763, 0.05287047541760667, -0.24247829469472723, -0.10776113444525334, 0.2750729556413896, -0.018019452321351746, 0.14004820515976552, 0.08924219492006541, -0.023081914889683693, -0.056904288409795195, -0.28440003366106087, 0.21900649314076515, 0.08745705384407537, 0.2826523139015024, 0.03563396820049721, 0.10427022780173884, -0.055711256641963566, 0.01795109108584088, -0.03378145810630587, -0.042325822961522784, 0.12883044039380714, 0.2596103795725036, 0.15774552853214613, 0.24850907975327752, -0.4649603778243433, -0.12179568837063363, 0.05901396112519397, 0.12498255558081983, 0.12092634501297855, -0.05171109684728615, -0.3135648393302144, 0.12640460803644893, -0.18800197521376963, -0.08048693485195851, -0.11462569710465124, 0.001055616523242659, 0.008957356838998098, -0.21152773461258614, -0.02511928459905364, 0.007418293904737328, 0.036443890500698746, 0.030731086823643748, -0.09798564646827103, 0.08517669421839125, 0.14133783743894993, -0.12428273367451181, 0.04408352881853963, 0.18745712351260913, -0.1009563009188522, -0.21374738904831495, 0.3873124874173951, -0.047663930174032296, -0.1391416747542673, 0.19767293721196, -0.035437426121652495, -0.11669806531705192, 0.013361435372060464, 0.220141196702492, 0.08311748961101711, -0.14276061900373962, 0.106042548756828, 0.02274344169554864, 0.20198567124460193, 0.02581952976775758, 0.044195665312818835, 0.20380521534775373, 0.1798951884754646, 0.026723978245116332, 0.17155301148563418, -0.05800140166603443, -0.18612954544512855, -0.2692867369580738, -0.21519111919886558, -0.19555222181198015, 0.07372323377920245, -0.06532633419322528, -0.17020184256245646, 0.3652502569214751, 0.18673178615453825, 0.08990858177608455, 0.0797281567564947, 0.31719406226212965, 0.03186866660159725, 0.1435908428486724, 0.1861447714941783, 0.11813241965999757, 0.14481997318468115, 0.09324412103555521, -0.23442438798295448, 0.015906384327581128, -0.040828018066944714] |
1,802.08033 | Approximating the nearest stable discrete-time system | In this paper, we consider the problem of stabilizing discrete-time linear
systems by computing a nearby stable matrix to an unstable one. To do so, we
provide a new characterization for the set of stable matrices. We show that a
matrix $A$ is stable if and only if it can be written as $A=S^{-1}UBS$, where
$S$ is positive definite, $U$ is orthogonal, and $B$ is a positive semidefinite
contraction (that is, the singular values of $B$ are less or equal to 1). This
characterization results in an equivalent non-convex optimization problem with
a feasible set on which it is easy to project. We propose a very efficient fast
projected gradient method to tackle the problem in variables $(S,U,B)$ and
generate locally optimal solutions. We show the effectiveness of the proposed
method compared to other approaches.
| math.OC math.NA | in this paper we consider the problem of stabilizing discretetime linear systems by computing a nearby stable matrix to an unstable one to do so we provide a new characterization for the set of stable matrices we show that a matrix a is stable if and only if it can be written as as1ubs where s is positive definite u is orthogonal and b is a positive semidefinite contraction that is the singular values of b are less or equal to 1 this characterization results in an equivalent nonconvex optimization problem with a feasible set on which it is easy to project we propose a very efficient fast projected gradient method to tackle the problem in variables sub and generate locally optimal solutions we show the effectiveness of the proposed method compared to other approaches | [['in', 'this', 'paper', 'we', 'consider', 'the', 'problem', 'of', 'stabilizing', 'discretetime', 'linear', 'systems', 'by', 'computing', 'a', 'nearby', 'stable', 'matrix', 'to', 'an', 'unstable', 'one', 'to', 'do', 'so', 'we', 'provide', 'a', 'new', 'characterization', 'for', 'the', 'set', 'of', 'stable', 'matrices', 'we', 'show', 'that', 'a', 'matrix', 'a', 'is', 'stable', 'if', 'and', 'only', 'if', 'it', 'can', 'be', 'written', 'as', 'as1ubs', 'where', 's', 'is', 'positive', 'definite', 'u', 'is', 'orthogonal', 'and', 'b', 'is', 'a', 'positive', 'semidefinite', 'contraction', 'that', 'is', 'the', 'singular', 'values', 'of', 'b', 'are', 'less', 'or', 'equal', 'to', '1', 'this', 'characterization', 'results', 'in', 'an', 'equivalent', 'nonconvex', 'optimization', 'problem', 'with', 'a', 'feasible', 'set', 'on', 'which', 'it', 'is', 'easy', 'to', 'project', 'we', 'propose', 'a', 'very', 'efficient', 'fast', 'projected', 'gradient', 'method', 'to', 'tackle', 'the', 'problem', 'in', 'variables', 'sub', 'and', 'generate', 'locally', 'optimal', 'solutions', 'we', 'show', 'the', 'effectiveness', 'of', 'the', 'proposed', 'method', 'compared', 'to', 'other', 'approaches']] | [-0.11988106187877816, 0.07039932523000075, -0.06483831528727133, 0.044696015073176526, -0.08431169734537991, -0.17806083728809521, 0.030936827352305234, 0.39627852150475357, -0.3137287463881631, -0.22081292360854238, 0.15760768103194353, -0.24731502256620286, -0.1740636316344399, 0.19417546375623362, -0.08309175836186466, 0.04692702672590672, 0.07681268562368158, 0.0436769687597129, -0.10591129343887207, -0.2598180701667721, 0.3043294956615723, -0.0032914035550471563, 0.21978934154387064, 0.020899352683588418, 0.1325600683296433, -0.038439324153448216, 0.02070087003139362, 0.06531922046595545, -0.09346375429410742, 0.1330005348522786, 0.267789505408215, 0.17568870779099083, 0.3265598475682869, -0.3668934122534163, -0.13649541658780245, 0.1637621415507938, 0.12874647301844142, 0.10081734391947542, -0.04725983952464877, -0.22323178797751778, 0.184864887112835, -0.14477872979868925, -0.11215417783484975, -0.10983957471534499, 0.04867263856594131, -0.023612233563830187, -0.35527910707421156, 0.0381435235274205, 0.06092570654773362, -0.023533124712976947, -0.06091467055679758, -0.1204914489844397, 0.0329990174183483, 0.07724534007616397, 0.015586584034104789, 0.04815760815217257, 0.06455475626402159, -0.05224834519235153, -0.0896808430482981, 0.3775808529375788, -0.06455558705240932, -0.27147813798831916, 0.18949793963936337, -0.09459237837138822, -0.1122966487353334, 0.12885199017377932, 0.19551171137562104, 0.20355684069722002, -0.13059908353181474, 0.08688908130314493, -0.09250052444247613, 0.16305781108563516, 0.022886452212957525, -0.02596206504003659, 0.1687975556115314, 0.14521498525682003, 0.20388226004824764, 0.1467734644473565, -0.022548894590781583, -0.06419632113330177, -0.26844305893990084, -0.15625198193089063, -0.19924972727443022, 0.06450906797979417, -0.043849714857603445, -0.1917578451953995, 0.3773770509287715, 0.13565442355613766, 0.21412562872908675, 0.06749615397342522, 0.3009935809897064, 0.13729952006368834, 0.03360754219943713, 0.10363085973493533, 0.20079950108401365, 0.1202517565106973, 0.04861068076092694, -0.20009632903123414, 0.04279306618350822, 0.07067679349722257] |
1,802.08034 | Pseudo-Harmonic Maps From Complete Noncompact Pseudo-Hermitian Manifolds
To Regular Balls | In this paper, we give an estimate of sub-Laplacian of Riemannian distance
functions in pseudo-Hermitian geometry which plays a similar role as Laplacian
comparison theorem in Riemannian geometry, and deduce a prior horizontal
gradient estimate of pseudo-harmonic maps from pseudo-Hermitian manifolds to
regular balls of Riemannian manifolds. As an application, Liouville theorem is
established under the conditions of nonnegative pseudo-Hermitian Ricci
curvature and vanishing pseudo-Hermitian torsion. Moreover, we obtain the
existence of pseudo-harmonic maps from complete noncompact pseudo-Hermitian
manifolds to regular balls of Riemannian manifolds.
| math.DG | in this paper we give an estimate of sublaplacian of riemannian distance functions in pseudohermitian geometry which plays a similar role as laplacian comparison theorem in riemannian geometry and deduce a prior horizontal gradient estimate of pseudoharmonic maps from pseudohermitian manifolds to regular balls of riemannian manifolds as an application liouville theorem is established under the conditions of nonnegative pseudohermitian ricci curvature and vanishing pseudohermitian torsion moreover we obtain the existence of pseudoharmonic maps from complete noncompact pseudohermitian manifolds to regular balls of riemannian manifolds | [['in', 'this', 'paper', 'we', 'give', 'an', 'estimate', 'of', 'sublaplacian', 'of', 'riemannian', 'distance', 'functions', 'in', 'pseudohermitian', 'geometry', 'which', 'plays', 'a', 'similar', 'role', 'as', 'laplacian', 'comparison', 'theorem', 'in', 'riemannian', 'geometry', 'and', 'deduce', 'a', 'prior', 'horizontal', 'gradient', 'estimate', 'of', 'pseudoharmonic', 'maps', 'from', 'pseudohermitian', 'manifolds', 'to', 'regular', 'balls', 'of', 'riemannian', 'manifolds', 'as', 'an', 'application', 'liouville', 'theorem', 'is', 'established', 'under', 'the', 'conditions', 'of', 'nonnegative', 'pseudohermitian', 'ricci', 'curvature', 'and', 'vanishing', 'pseudohermitian', 'torsion', 'moreover', 'we', 'obtain', 'the', 'existence', 'of', 'pseudoharmonic', 'maps', 'from', 'complete', 'noncompact', 'pseudohermitian', 'manifolds', 'to', 'regular', 'balls', 'of', 'riemannian', 'manifolds']] | [-0.17905525054563495, 0.0407551492595196, -0.10864324722000782, 0.136484939922743, -0.1398393245824777, -0.19803719432367123, -0.1256931334391565, 0.3537224506411482, -0.21942302733659744, -0.19406438982662033, 0.11271953187362456, -0.2875272240708856, -0.1841075416887179, 0.1631440162877826, -0.20603388888651833, 0.022300529830596025, 0.10571864380994264, 0.09560876106843352, -0.15595948645735488, -0.1752812362029491, 0.5455620731939288, 0.005949057266116142, 0.19225638263365802, 0.15900717468261172, 0.13910354252028115, -0.044173981596524005, 0.02639014738447526, -0.0009544825071797652, -0.2291546886896386, 0.12609016049160238, 0.2397432376356686, 0.025303163028815214, 0.1874625859234263, -0.4057327273356564, -0.21938168038888012, 0.24369266493355526, 0.10622239281039904, -0.022543089525938472, -0.05506806491004467, -0.35192486582433474, 0.01328264376942945, -0.00451299315866302, -0.23938337603296317, -0.1158565165803713, 0.008733511655865348, -0.015378986342864878, -0.21474282651701393, 0.07880565247512149, 0.1815062947845196, 0.10226788615040919, -0.15219512643182978, -0.10768107121043345, -0.07571601815631285, 0.10877331180826706, 0.003373839955448228, 0.08838629966930431, 0.13618534748058986, 0.04018522621789838, -0.08649157636305865, 0.2890863488592646, -0.14934346065034762, -0.35787587209659466, 0.035527878647724935, -0.09582817108534715, -0.16454229101757792, 0.04710776608861873, 0.18967303440303487, 0.20000477689592278, -0.11905772631494876, 0.20303552805254346, -0.05714657598120325, -0.0020227030741379543, 0.1347450105692534, 0.028121243033777266, 0.07969401200740214, 0.07201405415201888, 0.27707513328641653, 0.16189016958917765, 0.025000172234414256, -0.12940850193228792, -0.3615686311879579, -0.24610716264475793, -0.2128696306663401, 0.2841735277681009, -0.24527247461510876, -0.2588344178217299, 0.3524705039775547, -0.05528694587376188, 0.17619114697856061, 0.17287430102690396, 0.2140059076468734, 0.03469050975571222, -0.01790104557705276, 0.11072326757780769, 0.19738537656033742, 0.3847687032950275, 0.09886165543952409, -0.09254208495292593, -0.1624355116256458, 0.21170522703186553] |
1,802.08035 | Horizontal Gradient Estimate of Positive Pseudo-Harmonic Functions on
Complete Noncompact Pseudo-Hermitian Manifolds | In this paper, we will give a horizontal gradient estimate of positive
solutions of $\Delta_b u = - \lambda u$ on complete noncompact pseudo-Hermitian
manifolds. As a consequence, we recapture the Liouville theorem of positive
pseudo-harmonic functions on Sasakian manifolds with nonnegative
pseudo-Hermitian Ricci curvature.
| math.DG | in this paper we will give a horizontal gradient estimate of positive solutions of delta_b u lambda u on complete noncompact pseudohermitian manifolds as a consequence we recapture the liouville theorem of positive pseudoharmonic functions on sasakian manifolds with nonnegative pseudohermitian ricci curvature | [['in', 'this', 'paper', 'we', 'will', 'give', 'a', 'horizontal', 'gradient', 'estimate', 'of', 'positive', 'solutions', 'of', 'delta_b', 'u', 'lambda', 'u', 'on', 'complete', 'noncompact', 'pseudohermitian', 'manifolds', 'as', 'a', 'consequence', 'we', 'recapture', 'the', 'liouville', 'theorem', 'of', 'positive', 'pseudoharmonic', 'functions', 'on', 'sasakian', 'manifolds', 'with', 'nonnegative', 'pseudohermitian', 'ricci', 'curvature']] | [-0.24474840110904256, 0.0594387908227915, -0.047787826562430274, 0.1231039721859879, -0.1536606804056223, -0.2191687463457848, -0.08926354692761548, 0.344519195255152, -0.22537096797726874, -0.126379715452014, 0.07270317687923739, -0.34400265672525693, -0.16509641731444877, 0.1241164158076741, -0.1397931397307751, 0.0036816776751778845, 0.10366180478486904, 0.10349524333033451, -0.13090051385725654, -0.201349459566869, 0.5378105018591118, -0.08860909232739793, 0.10193317623938931, 0.21697857945637647, 0.15157271672560033, -0.08307935136132115, 0.04426871187075279, 0.004502387392486251, -0.2977291489843019, 0.09217808464525787, 0.2218664176762104, 0.037781321010444055, 0.26448305198099725, -0.3699021027531735, -0.18570097454628626, 0.25676606491554615, 0.15125701629535057, -0.0010494360223759053, -0.04896167488660404, -0.34703024182208747, 0.0324312808035418, -0.03911183432264383, -0.23487319048835226, -0.136335781385559, 0.03054847998198035, 0.030198753204976402, -0.2136294921903416, 0.13161656953567683, 0.13624802328711158, 0.06750984585215879, -0.14196249558915233, -0.18402158512279046, -0.09612390170480277, 0.0269585199610785, 0.02490195636312629, 0.11138156988268155, 0.07646151335346837, 0.02120836790066299, -0.05112593309130779, 0.27264219600447387, -0.22603728944912208, -0.38467616882435113, 0.020407465305504236, -0.12165751022308371, -0.1500705034623659, 0.04681633438557646, 0.17920944942594613, 0.21738580573176922, -0.057427820126894256, 0.2150780847404412, -0.0726961231774239, 0.027574409232583155, 0.1255764492765762, 0.0006641995075137116, 0.06897782538692619, 0.049069487684687906, 0.2845829531203869, 0.10999148422418985, 0.06541807157918811, -0.06498440285754759, -0.41973594844687817, -0.2294484345069112, -0.1805018715906975, 0.3239982059701931, -0.18621536822946266, -0.2576450021980807, 0.38318717564174604, -0.07353535172161321, 0.15949320983748103, 0.19470000341209734, 0.21403979319472646, 0.05920796531393344, -0.007312744141144808, 0.0953871917066186, 0.16758648358112158, 0.3369547069765801, 0.16344005685992713, -0.12252360339774641, -0.14370185168200109, 0.19963654169682846] |
1,802.08036 | Synchronizing the Smallest Possible System | We investigate the minimal Hilbert-space dimension for a system to be
synchronized. We first show that qubits cannot be synchronized due to the lack
of a limit cycle. Moving to larger spin values, we demonstrate that a single
spin 1 can be phase-locked to a weak external signal of similar frequency and
exhibits all the standard features of the theory of synchronization. Our
findings rely on the Husimi Q representation based on spin coherent states
which we propose as a tool to obtain a phase portrait.
| quant-ph nlin.AO | we investigate the minimal hilbertspace dimension for a system to be synchronized we first show that qubits cannot be synchronized due to the lack of a limit cycle moving to larger spin values we demonstrate that a single spin 1 can be phaselocked to a weak external signal of similar frequency and exhibits all the standard features of the theory of synchronization our findings rely on the husimi q representation based on spin coherent states which we propose as a tool to obtain a phase portrait | [['we', 'investigate', 'the', 'minimal', 'hilbertspace', 'dimension', 'for', 'a', 'system', 'to', 'be', 'synchronized', 'we', 'first', 'show', 'that', 'qubits', 'can', 'not', 'be', 'synchronized', 'due', 'to', 'the', 'lack', 'of', 'a', 'limit', 'cycle', 'moving', 'to', 'larger', 'spin', 'values', 'we', 'demonstrate', 'that', 'a', 'single', 'spin', '1', 'can', 'be', 'phaselocked', 'to', 'a', 'weak', 'external', 'signal', 'of', 'similar', 'frequency', 'and', 'exhibits', 'all', 'the', 'standard', 'features', 'of', 'the', 'theory', 'of', 'synchronization', 'our', 'findings', 'rely', 'on', 'the', 'husimi', 'q', 'representation', 'based', 'on', 'spin', 'coherent', 'states', 'which', 'we', 'propose', 'as', 'a', 'tool', 'to', 'obtain', 'a', 'phase', 'portrait']] | [-0.16010453363066945, 0.16935709612336994, -0.09530342166879396, 0.04157652777630365, -0.05561270849543742, -0.13619009488872413, 0.06217008494556582, 0.380701403556413, -0.2515149009895736, -0.2574174200216758, 0.09630552704724345, -0.22179464939660554, -0.15866531050046798, 0.2271427759236988, -0.0618876711861498, 0.0071038147101738095, 0.05588648127841538, 0.07608146148455468, -0.07989142944865014, -0.16324382400054527, 0.2957453298510919, -0.03002724912681285, 0.28124376457056094, 0.013925743085899573, 0.11652593812958777, 0.00568839189082641, 0.06700670667763414, 0.017983207543348444, -0.07619799146426696, 0.10758345275140506, 0.21433559195780805, 0.0881607517220037, 0.2261535690176761, -0.42076665294709903, -0.2127529476801383, 0.12553321103426232, 0.14366558477605007, 0.198917869664461, -0.002173278049897702, -0.3072710999865727, 0.12207115287946045, -0.17982922790936012, -0.12461976757294488, -0.1355790232747108, -0.0031386380158792966, 0.01654688161918251, -0.2894192729519958, 0.05771377782241024, 0.09194533740994575, 0.023171275377744573, -0.043756784309215584, -0.03027962952525751, -0.03203059184758378, 0.15106897638848416, -0.020209786182419323, 0.0473046507204658, 0.1189929869229338, -0.0960688647525064, -0.16800888878261222, 0.3495896846302196, -0.11113521341306704, -0.20061612945992027, 0.20240079519210447, -0.16696761711232963, -0.10379014135306251, 0.08167491031104121, 0.17577620525041532, 0.10707053776038275, -0.10749947724344701, 0.01812816380681042, -0.03174297930137522, 0.26423289108721687, 0.032641702906988646, 0.08963315973885293, 0.21642609446941094, 0.17257717303160963, 0.08930005142786379, 0.15610849661030005, -0.11207485707455325, -0.08411089367308151, -0.2684534827525588, -0.13703454268999912, -0.20216542584473673, 0.08330410374505794, -0.0671471475953726, -0.17009436753417911, 0.43231559124636065, 0.17773669566450662, 0.2240301177505104, 0.03200409552430327, 0.2832355010055605, 0.15274940494276668, 0.06363063555173362, 0.049241651909361625, 0.2467174936653297, 0.11890157691106715, 0.051368019714865876, -0.2301765305241677, 0.017119916816959263, 0.055632257148966024] |
1,802.08037 | Are Two (Samples) Really Better Than One? On the Non-Asymptotic
Performance of Empirical Revenue Maximization | The literature on "mechanism design from samples," which has flourished in
recent years at the interface of economics and computer science, offers a
bridge between the classic computer-science approach of worst-case analysis
(corresponding to "no samples") and the classic economic approach of
average-case analysis for a given Bayesian prior (conceptually corresponding to
the number of samples tending to infinity). Nonetheless, the two directions
studied so far are two extreme and almost diametrically opposed directions:
that of asymptotic results where the number of samples grows large, and that
where only a single sample is available. In this paper, we take a first step
toward understanding the middle ground that bridges these two approaches: that
of a fixed number of samples greater than one. In a variety of contexts, we ask
what is possibly the most fundamental question in this direction: "are two
samples really better than one sample?". We present a few surprising negative
results, and complement them with our main result: showing that the worst-case,
over all regular distributions, expected-revenue guarantee of the Empirical
Revenue Maximization algorithm given two samples is greater than that of this
algorithm given one sample. The proof is technically challenging, and provides
the first result that shows that some deterministic mechanism constructed using
two samples can guarantee more than one half of the optimal revenue.
| cs.GT | the literature on mechanism design from samples which has flourished in recent years at the interface of economics and computer science offers a bridge between the classic computerscience approach of worstcase analysis corresponding to no samples and the classic economic approach of averagecase analysis for a given bayesian prior conceptually corresponding to the number of samples tending to infinity nonetheless the two directions studied so far are two extreme and almost diametrically opposed directions that of asymptotic results where the number of samples grows large and that where only a single sample is available in this paper we take a first step toward understanding the middle ground that bridges these two approaches that of a fixed number of samples greater than one in a variety of contexts we ask what is possibly the most fundamental question in this direction are two samples really better than one sample we present a few surprising negative results and complement them with our main result showing that the worstcase over all regular distributions expectedrevenue guarantee of the empirical revenue maximization algorithm given two samples is greater than that of this algorithm given one sample the proof is technically challenging and provides the first result that shows that some deterministic mechanism constructed using two samples can guarantee more than one half of the optimal revenue | [['the', 'literature', 'on', 'mechanism', 'design', 'from', 'samples', 'which', 'has', 'flourished', 'in', 'recent', 'years', 'at', 'the', 'interface', 'of', 'economics', 'and', 'computer', 'science', 'offers', 'a', 'bridge', 'between', 'the', 'classic', 'computerscience', 'approach', 'of', 'worstcase', 'analysis', 'corresponding', 'to', 'no', 'samples', 'and', 'the', 'classic', 'economic', 'approach', 'of', 'averagecase', 'analysis', 'for', 'a', 'given', 'bayesian', 'prior', 'conceptually', 'corresponding', 'to', 'the', 'number', 'of', 'samples', 'tending', 'to', 'infinity', 'nonetheless', 'the', 'two', 'directions', 'studied', 'so', 'far', 'are', 'two', 'extreme', 'and', 'almost', 'diametrically', 'opposed', 'directions', 'that', 'of', 'asymptotic', 'results', 'where', 'the', 'number', 'of', 'samples', 'grows', 'large', 'and', 'that', 'where', 'only', 'a', 'single', 'sample', 'is', 'available', 'in', 'this', 'paper', 'we', 'take', 'a', 'first', 'step', 'toward', 'understanding', 'the', 'middle', 'ground', 'that', 'bridges', 'these', 'two', 'approaches', 'that', 'of', 'a', 'fixed', 'number', 'of', 'samples', 'greater', 'than', 'one', 'in', 'a', 'variety', 'of', 'contexts', 'we', 'ask', 'what', 'is', 'possibly', 'the', 'most', 'fundamental', 'question', 'in', 'this', 'direction', 'are', 'two', 'samples', 'really', 'better', 'than', 'one', 'sample', 'we', 'present', 'a', 'few', 'surprising', 'negative', 'results', 'and', 'complement', 'them', 'with', 'our', 'main', 'result', 'showing', 'that', 'the', 'worstcase', 'over', 'all', 'regular', 'distributions', 'expectedrevenue', 'guarantee', 'of', 'the', 'empirical', 'revenue', 'maximization', 'algorithm', 'given', 'two', 'samples', 'is', 'greater', 'than', 'that', 'of', 'this', 'algorithm', 'given', 'one', 'sample', 'the', 'proof', 'is', 'technically', 'challenging', 'and', 'provides', 'the', 'first', 'result', 'that', 'shows', 'that', 'some', 'deterministic', 'mechanism', 'constructed', 'using', 'two', 'samples', 'can', 'guarantee', 'more', 'than', 'one', 'half', 'of', 'the', 'optimal', 'revenue']] | [-0.08047722051606926, 0.0542732322042102, -0.10147418207850427, 0.06877764685506843, -0.07738505524676718, -0.1435559454552625, 0.09219837912117007, 0.3816797814872031, -0.2391705653512187, -0.3463702959999374, 0.09573585509224773, -0.302126295421247, -0.14378065599200898, 0.22596603085299674, -0.06517945653142314, 0.030172187131701982, 0.059674937726683135, 0.03478115341162573, -0.03137491288867069, -0.28929011465462784, 0.30335264162641, 0.02149643479701829, 0.2981115178349662, -0.011863979383384527, 0.072259001294842, -0.017591794660283287, -0.018792483109351436, 0.03776643114094304, -0.12089858646597607, 0.13504610352694443, 0.2604101036673148, 0.16339059120265248, 0.3534337417605295, -0.3979906154787245, -0.1690708801690404, 0.1314883418136689, 0.1496345826582005, 0.11085269475710838, -0.05621369243430699, -0.19307922882763626, 0.11036294244761902, -0.11873355925244759, -0.0837074067995386, -0.01502308553588666, 0.009828866186198782, -0.03046629862428205, -0.24463532697919704, 0.02445022742153405, 0.09831362252323526, 0.050300635860969216, -0.02537337771766914, -0.1740043753094665, 0.017688025164388155, 0.1336324763351139, 0.10288829480183043, 0.045135956648822244, 0.08383451604824428, -0.11029657060769493, -0.1263771715412367, 0.35287587936610393, -0.02109557541898456, -0.15265804257022736, 0.22423065061783035, -0.1740719593198094, -0.14486258514395586, 0.12358548314008674, 0.15296915765069255, 0.13979579082192622, -0.13329808625762593, 0.018271157059278426, -0.09962546501997603, 0.15501606003615206, 0.06529312970576016, 0.02582526368729039, 0.1421689485246528, 0.191042968140039, 0.1210321449370604, 0.14219890982890715, -0.03712213435117261, -0.11221140409398773, -0.2857110706842653, -0.15054324364234356, -0.21811026517465523, 0.04872213197833769, -0.11126679373593028, -0.13496933891076476, 0.38463233760877014, 0.18217374047277216, 0.2268227791864442, 0.08854555199773276, 0.3273683135859141, 0.062254136532957596, 0.03215487792101353, 0.08281763224090666, 0.23350371135312098, 0.0609292306312143, 0.07346610871800668, -0.11892008825048983, 0.11038239077679796, 0.011527280314702149] |
1,802.08038 | A note on mass-conserving solutions to the coagulation-fragmentation
equation by using non-conservative approximation | In general, the non-conservative approximation of coagulation-fragmentation
equations (CFEs) may lead to the occurrence of gelation phenomenon. In this
article, it is shown that the non-conservative approximation of CFEs can also
provide the existence of mass conserving solutions to CFEs for large classes of
unbounded coagulation and fragmentation kernels.
| math.AP | in general the nonconservative approximation of coagulationfragmentation equations cfes may lead to the occurrence of gelation phenomenon in this article it is shown that the nonconservative approximation of cfes can also provide the existence of mass conserving solutions to cfes for large classes of unbounded coagulation and fragmentation kernels | [['in', 'general', 'the', 'nonconservative', 'approximation', 'of', 'coagulationfragmentation', 'equations', 'cfes', 'may', 'lead', 'to', 'the', 'occurrence', 'of', 'gelation', 'phenomenon', 'in', 'this', 'article', 'it', 'is', 'shown', 'that', 'the', 'nonconservative', 'approximation', 'of', 'cfes', 'can', 'also', 'provide', 'the', 'existence', 'of', 'mass', 'conserving', 'solutions', 'to', 'cfes', 'for', 'large', 'classes', 'of', 'unbounded', 'coagulation', 'and', 'fragmentation', 'kernels']] | [-0.13818346820914243, 0.12338936164480996, -0.11153803281581068, 0.11494854664696115, -0.0625260341912508, -0.06412655172147314, -0.005531695462307151, 0.27514801140190387, -0.2628093429517989, -0.2592984679706243, 0.07342532681472295, -0.1900639527154212, -0.15013792183326216, 0.14401693683953917, -0.06261822271483894, 0.06997755458768533, 0.09514122273848981, -0.048251097797943586, -0.05444722456800542, -0.22765637236666314, 0.35391166091573484, 0.009312170033214842, 0.16185462026267636, 0.147226603711214, 0.07648798939296786, -0.09198564051517419, 0.016672144168797805, 0.014411676827133919, -0.17532018272337452, 0.05560913772265218, 0.24558422995769247, 0.06527636983260816, 0.2633434753028714, -0.4132874403909153, -0.21487425809384, 0.13353590845909655, 0.17914942659589708, 0.14754401873417047, -0.048166317523133995, -0.22286397003929834, 0.07640596023969809, -0.22071924440714777, -0.1983662696783336, -0.11571639152813931, 0.054466319232418826, 0.10232918979410006, -0.31467387781535483, 0.13320787010978127, 0.14274823917456123, -0.04681253361002523, -0.12766646304909063, -0.051186067372921626, -0.013053208950678913, 0.04298876130915418, 0.09377010384270427, -0.03244266684680265, 0.07439028199914159, -0.11248840288525182, -0.07040461164195927, 0.40084173712803395, -0.07474725651649797, -0.26599016131884273, 0.2471475598915499, -0.14176209896270717, -0.1382811471667825, 0.2009646972185191, 0.2218106567707597, 0.14532482750447734, -0.19521443448884754, 0.056555136980023235, -0.04271527908134217, 0.08832007150488849, 0.10909740841586371, 0.012986674302552199, 0.13376568044934953, 0.15737100779934196, 0.06956899472350749, 0.1359010011442386, -0.014559185664568628, -0.20065487615231956, -0.3133706151678854, -0.13352007173686004, -0.1250952278663005, 0.10788550296304178, -0.10992894874741942, -0.2352975099840515, 0.3096715856571587, 0.15483982655533343, 0.13399818401346553, 0.06866597291082144, 0.21070435669805324, 0.18381141667130727, 0.0751321407092013, 0.056764021145217884, 0.24981082040740518, 0.15872414318882688, 0.12701761192281028, -0.24440774442247895, 0.1064560921881728, 0.11721433767554712] |
1,802.08039 | Comparative analysis of SVIT and Skype features in e-Learning process | The article discusses capabilities of the SVIT and Skype programs in terms of
use in e-Learning process. Also various types of connections, image and sound
quality were investigated.
| cs.CY | the article discusses capabilities of the svit and skype programs in terms of use in elearning process also various types of connections image and sound quality were investigated | [['the', 'article', 'discusses', 'capabilities', 'of', 'the', 'svit', 'and', 'skype', 'programs', 'in', 'terms', 'of', 'use', 'in', 'elearning', 'process', 'also', 'various', 'types', 'of', 'connections', 'image', 'and', 'sound', 'quality', 'were', 'investigated']] | [-0.10248453873727056, 0.01799822916035299, -0.007088490115064714, 0.06494579075533019, -0.09261536425738423, -0.05360045694504623, 0.029996352115025122, 0.4283151974280675, -0.25236694335385607, -0.35233699557957826, 0.14124125631146686, -0.2938683267544817, -0.19905729122735835, 0.18782574931780496, -0.13351618677929597, 0.09299219413488, 0.06694624352234381, 0.03827397542557231, -0.04718074137646774, -0.3003405710613286, 0.3509557748782552, 0.048722063225728494, 0.363687410812687, 0.07923946520976541, 0.102895382101889, 0.04127314224563263, -0.1230101570211075, 0.019570089738678048, -0.11742915002698148, 0.17029940054096557, 0.3242907357160692, 0.25420126870826437, 0.29165095723820506, -0.4351280345409005, -0.15868677530023786, 0.002919886675145891, 0.14114113787568552, 0.024748262845807605, -0.05765491453240867, -0.3076468740969344, 0.08405191513399284, -0.2186457764495302, -0.051000567754575364, -0.10552008477626024, -0.013381740276667255, 0.07767371888513919, -0.13909545447677374, -0.027095100058768702, 0.06215613173251903, 0.1587626982342314, -0.03819064388948458, -0.10142905875626537, 0.03484491008351109, 0.1716500417570825, 0.05948417416355504, -0.05425335675546968, 0.12944038129515117, -0.21373398850361505, -0.15639168813962628, 0.384049305761302, -0.04244653259714445, -0.1618261912630664, 0.24463931629779162, -0.033478799310547334, -0.12822240785937067, 0.07428580168979587, 0.2571849809890544, 0.07686625683197269, -0.24193824161947877, 0.0860877938663449, 0.08821929977447898, 0.12065083947446612, 0.12856413951764503, 0.09724519750172342, 0.14954013777551828, 0.18547073130806288, -0.05609098018181545, 0.19005389421902322, -0.0420384748528401, -0.04038200557611331, -0.2614055941640227, -0.2802098701811499, -0.07021087799566211, -0.10610768010115458, -0.03740491300575539, -0.10718510639681308, 0.4487651463046118, 0.21135433645987953, 0.11469946216998829, 0.036133879174788795, 0.3237093547704043, 0.005725145443446106, 0.01847560358820138, 0.01720152148563001, 0.18718186389930822, 0.07539126995295563, 0.20422851735794986, -0.13220936894692756, 0.08984693972807792, 0.013716832734644413] |
1,802.0804 | Inverse analysis of traction-separation relationship based on
sequentially linear approach | Traction-separation relationship is an important material characteristic
describing the fracture behaviour of quasi-brittle solids. A new numerical
scheme for identification of the traction-separation relation by inverse
analysis of data obtained from various types of fracture tests is proposed. Due
to employing the concept of sequentially linear analysis, the method exhibits a
superior numerical stability and versatility. The applicability and
effectiveness of the proposed method is demonstrated on examples involving
identification of the traction-separation relationship using experimental data
from various test configurations.
| cs.CE | tractionseparation relationship is an important material characteristic describing the fracture behaviour of quasibrittle solids a new numerical scheme for identification of the tractionseparation relation by inverse analysis of data obtained from various types of fracture tests is proposed due to employing the concept of sequentially linear analysis the method exhibits a superior numerical stability and versatility the applicability and effectiveness of the proposed method is demonstrated on examples involving identification of the tractionseparation relationship using experimental data from various test configurations | [['tractionseparation', 'relationship', 'is', 'an', 'important', 'material', 'characteristic', 'describing', 'the', 'fracture', 'behaviour', 'of', 'quasibrittle', 'solids', 'a', 'new', 'numerical', 'scheme', 'for', 'identification', 'of', 'the', 'tractionseparation', 'relation', 'by', 'inverse', 'analysis', 'of', 'data', 'obtained', 'from', 'various', 'types', 'of', 'fracture', 'tests', 'is', 'proposed', 'due', 'to', 'employing', 'the', 'concept', 'of', 'sequentially', 'linear', 'analysis', 'the', 'method', 'exhibits', 'a', 'superior', 'numerical', 'stability', 'and', 'versatility', 'the', 'applicability', 'and', 'effectiveness', 'of', 'the', 'proposed', 'method', 'is', 'demonstrated', 'on', 'examples', 'involving', 'identification', 'of', 'the', 'tractionseparation', 'relationship', 'using', 'experimental', 'data', 'from', 'various', 'test', 'configurations']] | [-0.06138601916968638, -0.006498522445506324, -0.10368984392384228, 0.013640289421963655, -0.05902998961140344, -0.11498955883269693, 0.0241390023679461, 0.3287379970015199, -0.2527430311742204, -0.3084759345187599, 0.11773123550746176, -0.26495009904474387, -0.21730861619666772, 0.28525339749952155, -0.014711477011902096, 0.13034314616801745, 0.06879239069458878, -0.033794922989873605, -0.07364901773815538, -0.1806990104759066, 0.31311538431471514, 0.08430680874045249, 0.40182441583386175, 0.061735248653057184, 0.11366052037093466, 0.005019478333171135, -0.06396350658924123, 0.07028084402375015, -0.11498144975386237, 0.14805024686085497, 0.2187543513086613, 0.13383740972566568, 0.2786249008351638, -0.3781578093652188, -0.21655407288100248, 0.023800600452325595, 0.07872093322307423, 0.0640720762082456, -0.08266796205152561, -0.28556019479385863, 0.09152147530313627, -0.14655660008896648, -0.1307022820548787, -0.13542119222894358, 0.0011360692004040805, 0.06305947505443553, -0.27146248945378537, 0.0882885745830006, 0.04523621277630697, 0.11571210419815206, -0.10159798601159344, -0.08918071649738668, 0.0017355649392867898, 0.08804165400610661, 0.07887293226200581, -0.09924273931041912, 0.11338954534450615, -0.10672585987543434, -0.13435255463614507, 0.40606322817872337, 0.005278829993237454, -0.19096363427830332, 0.24729803176941695, -0.057372638586345184, -0.07298911596004518, 0.15820784671921972, 0.1900658489515384, 0.11135515392999407, -0.1437103039826508, 0.04514195990064584, -0.03156420529279628, 0.14423702017944537, 0.04060130080288667, -0.03669264940200029, 0.1339768090107145, 0.273721027797387, -0.03775399669222994, 0.1955952801178267, -0.11627558616771834, -0.10463279585446013, -0.3185554181720004, -0.14500546036863032, -0.21375034317190264, -0.023158359637391972, -0.14010122770775557, -0.12830594461411238, 0.43129143956918403, 0.16788634078370201, 0.15913989267277498, 0.029147650724575844, 0.27168539515983914, 0.07842181270574163, 0.027596282968182624, -0.021777535236820026, 0.2350402293657815, 0.18283699401424347, 0.07098749441520115, -0.2834701738952671, 0.09387771782384795, 0.06818490206367439] |
1,802.08041 | Charged pion masses under strong magnetic fields in the NJL model | The behavior of charged pion masses in the presence of a static uniform
magnetic field is studied in the framework of the two-flavor NJL model, using a
magnetic field-independent regularization scheme. Analytical calculations are
carried out employing the Ritus eigenfunction method, which allows us to
properly take into account the presence of Schwinger phases in the quark
propagators. Numerical results are obtained for definite model parameters,
comparing the predictions of the model with present lattice QCD results.
| hep-ph | the behavior of charged pion masses in the presence of a static uniform magnetic field is studied in the framework of the twoflavor njl model using a magnetic fieldindependent regularization scheme analytical calculations are carried out employing the ritus eigenfunction method which allows us to properly take into account the presence of schwinger phases in the quark propagators numerical results are obtained for definite model parameters comparing the predictions of the model with present lattice qcd results | [['the', 'behavior', 'of', 'charged', 'pion', 'masses', 'in', 'the', 'presence', 'of', 'a', 'static', 'uniform', 'magnetic', 'field', 'is', 'studied', 'in', 'the', 'framework', 'of', 'the', 'twoflavor', 'njl', 'model', 'using', 'a', 'magnetic', 'fieldindependent', 'regularization', 'scheme', 'analytical', 'calculations', 'are', 'carried', 'out', 'employing', 'the', 'ritus', 'eigenfunction', 'method', 'which', 'allows', 'us', 'to', 'properly', 'take', 'into', 'account', 'the', 'presence', 'of', 'schwinger', 'phases', 'in', 'the', 'quark', 'propagators', 'numerical', 'results', 'are', 'obtained', 'for', 'definite', 'model', 'parameters', 'comparing', 'the', 'predictions', 'of', 'the', 'model', 'with', 'present', 'lattice', 'qcd', 'results']] | [-0.11914673790807365, 0.1545038152268374, -0.1290352436677589, 0.08419437370982698, -0.03816972132893158, -0.10318548956813363, 0.07267307425401622, 0.381399556849297, -0.12387598003563169, -0.2501164138008683, 0.006706802817001068, -0.2569114052898072, -0.06276794599199836, 0.1189631490012655, 0.10213553243885179, 0.07649626158322993, 0.047466826473979595, 0.013699952664168237, -0.09747597223220321, -0.22489617774625878, 0.31573636194860394, 0.030009710756070042, 0.26446567157694656, 0.10326818324770633, 0.03762805775146593, 0.013121178718404724, -0.04330813359203083, 0.04613779499739796, -0.11593132471974164, 0.036590030583153875, 0.1455037776893307, -0.01464578305528342, 0.185114903756502, -0.43425974351438607, -0.2477008259232313, 0.05595497615853107, 0.13570287165703712, 0.1467778095899924, -0.041571742746156534, -0.31933410920493016, 0.08507467657871931, -0.19208337551635968, -0.18375938668750325, -0.1879739939997142, -0.10220457075085104, -0.0363276587563337, -0.3662656186414616, 0.1004338962836312, -0.022534228232386825, 0.01987034863066276, -0.12592789669923315, -0.1716744358554579, -0.010358395659691327, 0.10831780787315462, 0.10263109809942786, 0.05605621562133749, 0.11178600053641606, -0.13676249317510367, -0.11549559618987433, 0.41791023750027473, -0.07065540011488385, -0.2141021677457679, 0.07611044387744328, -0.1609048391361615, -0.09995630718525741, 0.13956072417620038, 0.14916283027692276, 0.12421613060204047, -0.19737831902291095, 0.12065332842228765, -0.06166662576354363, 0.12885354640712213, 0.011750206898583413, -0.012517103187546327, 0.23043463541218986, 0.18248792833273675, -0.09092421343175137, 0.15460313955176766, -0.0649794937812953, -0.192962171026058, -0.3375339905259671, -0.06971566073064293, -0.13700262948193334, 0.0025301177550542666, -0.14391454332810524, -0.16364092296352248, 0.41291827046743845, 0.1942631545788064, 0.17220663534501543, 0.002188428076794492, 0.3090716255465885, 0.12965277561845331, 0.07174319897887188, 0.04569117138887961, 0.2554664004400566, 0.22373447102772726, 0.11354711482470686, -0.29582926604969356, -0.04304372326337865, 0.1503466699490106] |
1,802.08042 | 2VRP: a benchmark problem for small but rich VRPs | We consider a 2-vehicle routing problem (2VRP) which can be viewed as a
building block for the variety of vehicle routing problems (VRP). As a
simplified version of the 2VRP, we consider a 2-period balanced travelling
salesman problem (2TSP) and describe a polynomially solvable case of this
NP-hard problem. For the 2VRP with general settings, we suggest a framework
based on the Held and Karp dynamic programming algorithm. Our algorithms based
on this framework show an exceptionally good performance on the published test
data. Our approach can be easily extended to a variety of
constraints/attributes in the VRP, hence the wording "small but rich" in the
title of our paper. We also introduce a new methodological approach: we use
easy solvable special cases for generating test instances and then use these
instances in computational experiments.
| math.OC | we consider a 2vehicle routing problem 2vrp which can be viewed as a building block for the variety of vehicle routing problems vrp as a simplified version of the 2vrp we consider a 2period balanced travelling salesman problem 2tsp and describe a polynomially solvable case of this nphard problem for the 2vrp with general settings we suggest a framework based on the held and karp dynamic programming algorithm our algorithms based on this framework show an exceptionally good performance on the published test data our approach can be easily extended to a variety of constraintsattributes in the vrp hence the wording small but rich in the title of our paper we also introduce a new methodological approach we use easy solvable special cases for generating test instances and then use these instances in computational experiments | [['we', 'consider', 'a', '2vehicle', 'routing', 'problem', '2vrp', 'which', 'can', 'be', 'viewed', 'as', 'a', 'building', 'block', 'for', 'the', 'variety', 'of', 'vehicle', 'routing', 'problems', 'vrp', 'as', 'a', 'simplified', 'version', 'of', 'the', '2vrp', 'we', 'consider', 'a', '2period', 'balanced', 'travelling', 'salesman', 'problem', '2tsp', 'and', 'describe', 'a', 'polynomially', 'solvable', 'case', 'of', 'this', 'nphard', 'problem', 'for', 'the', '2vrp', 'with', 'general', 'settings', 'we', 'suggest', 'a', 'framework', 'based', 'on', 'the', 'held', 'and', 'karp', 'dynamic', 'programming', 'algorithm', 'our', 'algorithms', 'based', 'on', 'this', 'framework', 'show', 'an', 'exceptionally', 'good', 'performance', 'on', 'the', 'published', 'test', 'data', 'our', 'approach', 'can', 'be', 'easily', 'extended', 'to', 'a', 'variety', 'of', 'constraintsattributes', 'in', 'the', 'vrp', 'hence', 'the', 'wording', 'small', 'but', 'rich', 'in', 'the', 'title', 'of', 'our', 'paper', 'we', 'also', 'introduce', 'a', 'new', 'methodological', 'approach', 'we', 'use', 'easy', 'solvable', 'special', 'cases', 'for', 'generating', 'test', 'instances', 'and', 'then', 'use', 'these', 'instances', 'in', 'computational', 'experiments']] | [-0.08879424277097828, -0.019550868255218415, -0.07404791890762578, 0.09971201334925915, -0.12104876855689388, -0.18510428808377424, 0.06935140800826896, 0.3850252722859159, -0.2776755223022704, -0.3150396388430232, 0.13282957292228406, -0.19284122996207298, -0.19885493546752328, 0.2493387260299204, -0.11297477887159116, 0.05868109506449865, 0.11124961876793575, 0.011965142766055757, -0.03384218559271299, -0.2854528343199955, 0.2751210777096002, 0.007997118118674235, 0.2587196065456067, 0.08252723281852957, 0.1105557227256897, 0.03008120003177371, 0.03877902644357287, 0.09616320526247432, -0.11952569072495418, 0.142727080926026, 0.29948793585531247, 0.18619697448916564, 0.29095193342466774, -0.4055504801970227, -0.18409430252780257, 0.1069239597431475, 0.11823303909461133, 0.1563304262279526, -0.06624498114574533, -0.27837793327888993, 0.0665088433652409, -0.19236181491523757, -0.08986273556737635, -0.06169271864053002, -0.022478632159755194, 0.004212501661894017, -0.26476732579136925, 0.001915121618859624, 0.0394314939079148, 0.00432946278705547, -0.04136784154312559, -0.11687747385489397, 0.1061287885479265, 0.06599395146026255, 0.0027389555928363863, 0.014804836383607602, 0.06831071742887336, -0.08603218783575453, -0.18962232142343724, 0.44507441910585965, -0.03127024385770012, -0.2232748821405764, 0.16888789964587728, 0.004830451258563234, -0.20546158298121808, 0.05510758400695132, 0.2599669243244076, 0.19439682693577798, -0.13341539227788834, 0.08641809499796298, -0.14644585215290518, 0.1319222992419132, 0.05047554297624786, -0.045893949709913194, 0.13534942337773964, 0.21663590410244615, 0.09850349602433048, 0.21092595833465738, -0.021145693987565942, -0.08679266119221772, -0.26788481075624776, -0.13490746949214658, -0.1584047102579441, 0.008742900103106535, -0.08353919096090183, -0.17095925285711996, 0.4044683323822972, 0.18016771544331223, 0.16606049759565553, 0.11560668860810731, 0.2861315962312309, 0.07552183159938629, 0.019077150333196596, 0.13170147615771993, 0.14445491889719256, 0.038803395920230035, 0.09506391514183715, -0.1858844009676206, 0.055752133402760716, 0.06179885509865064] |
1,802.08043 | Unrecognized Astrometric Confusion in the Galactic Centre | The Galactic Centre is a highly crowded stellar field and frequent
unrecognized events of source confusion, which involve undetected faint stars,
are expected to introduce astrometric noise on a sub-mas level. This confusion
noise is the main non-instrumental effect limiting the astrometric accuracy and
precision of current near-infrared imaging observations and the long-term
monitoring of individual stellar orbits in the vicinity of the central
supermassive black hole. We self-consistently simulate the motions of the known
and the yet unidentified stars to characterize this noise component and show
that a likely consequence of source confusion is a bias in estimates of the
stellar orbital elements, as well as the inferred mass and distance of the
black hole, in particular if stars are being observed at small projected
separations from it, such as the star S2 during pericentre passage.
Furthermore, we investigate modeling the effect of source confusion as an
additional noise component that is time-correlated, demonstrating a need for
improved noise models to obtain trustworthy estimates of the parameters of
interest (and their uncertainties) in future astrometric studies.
| astro-ph.GA | the galactic centre is a highly crowded stellar field and frequent unrecognized events of source confusion which involve undetected faint stars are expected to introduce astrometric noise on a submas level this confusion noise is the main noninstrumental effect limiting the astrometric accuracy and precision of current nearinfrared imaging observations and the longterm monitoring of individual stellar orbits in the vicinity of the central supermassive black hole we selfconsistently simulate the motions of the known and the yet unidentified stars to characterize this noise component and show that a likely consequence of source confusion is a bias in estimates of the stellar orbital elements as well as the inferred mass and distance of the black hole in particular if stars are being observed at small projected separations from it such as the star s2 during pericentre passage furthermore we investigate modeling the effect of source confusion as an additional noise component that is timecorrelated demonstrating a need for improved noise models to obtain trustworthy estimates of the parameters of interest and their uncertainties in future astrometric studies | [['the', 'galactic', 'centre', 'is', 'a', 'highly', 'crowded', 'stellar', 'field', 'and', 'frequent', 'unrecognized', 'events', 'of', 'source', 'confusion', 'which', 'involve', 'undetected', 'faint', 'stars', 'are', 'expected', 'to', 'introduce', 'astrometric', 'noise', 'on', 'a', 'submas', 'level', 'this', 'confusion', 'noise', 'is', 'the', 'main', 'noninstrumental', 'effect', 'limiting', 'the', 'astrometric', 'accuracy', 'and', 'precision', 'of', 'current', 'nearinfrared', 'imaging', 'observations', 'and', 'the', 'longterm', 'monitoring', 'of', 'individual', 'stellar', 'orbits', 'in', 'the', 'vicinity', 'of', 'the', 'central', 'supermassive', 'black', 'hole', 'we', 'selfconsistently', 'simulate', 'the', 'motions', 'of', 'the', 'known', 'and', 'the', 'yet', 'unidentified', 'stars', 'to', 'characterize', 'this', 'noise', 'component', 'and', 'show', 'that', 'a', 'likely', 'consequence', 'of', 'source', 'confusion', 'is', 'a', 'bias', 'in', 'estimates', 'of', 'the', 'stellar', 'orbital', 'elements', 'as', 'well', 'as', 'the', 'inferred', 'mass', 'and', 'distance', 'of', 'the', 'black', 'hole', 'in', 'particular', 'if', 'stars', 'are', 'being', 'observed', 'at', 'small', 'projected', 'separations', 'from', 'it', 'such', 'as', 'the', 'star', 's2', 'during', 'pericentre', 'passage', 'furthermore', 'we', 'investigate', 'modeling', 'the', 'effect', 'of', 'source', 'confusion', 'as', 'an', 'additional', 'noise', 'component', 'that', 'is', 'timecorrelated', 'demonstrating', 'a', 'need', 'for', 'improved', 'noise', 'models', 'to', 'obtain', 'trustworthy', 'estimates', 'of', 'the', 'parameters', 'of', 'interest', 'and', 'their', 'uncertainties', 'in', 'future', 'astrometric', 'studies']] | [-0.10910229064724118, 0.08726474490764191, -0.046465593371750775, 0.1326759189517253, -0.08851982553694714, -0.04638975961028603, 0.07490516488182511, 0.38529935895891515, -0.22219103571595783, -0.3629883342490947, 0.11788946467104479, -0.29886000114098443, -0.05705968014196108, 0.20000069951480728, -0.12080131907615874, 0.012069490427772204, 0.1176012416533326, 0.012525595893615089, -0.04344565229816626, -0.21463583026602231, 0.29880850267133513, 0.10690755654642053, 0.13946359708778938, -0.016242386994220443, 0.10146775495492469, -0.054694855593586875, -0.09108932830931324, -0.014731913691881182, -0.0909466256737271, 0.052863694974721154, 0.24026372788913727, 0.11306583032664438, 0.2438410272805999, -0.3255138920651654, -0.23993758257283793, 0.07679246071244966, 0.17141619256380577, 0.115247357942527, -0.07817092266704592, -0.31037755072706164, 0.05874939837412761, -0.17862741029847645, -0.1754375629555855, 0.007035437308378138, 0.06783156620672677, 0.054738666667566126, -0.2356726381306847, 0.13604576278564726, 0.0886637550498501, 0.05631619214611707, -0.09393026582938803, -0.10961906366723742, -0.05452760223215077, 0.1680775797231344, 0.06537520334040378, 0.06644577922192296, 0.1777516863582456, -0.15332080311099813, -0.06353478795075315, 0.38475409557248363, -0.07124484659667195, -0.09902572741147951, 0.1911245325342147, -0.21072919468992615, -0.16408603265618452, 0.12402835392556284, 0.19392480600775236, 0.1266871112514561, -0.2005259511929195, 0.003667457889841796, 0.043575764094389936, 0.19952563144132432, 0.05505047384439047, 0.10673648871397232, 0.33999339956264035, 0.13758330427420637, 0.06716186954708254, 0.09561748465386319, -0.2666227081908955, -0.017663635458207906, -0.2522498136938755, -0.07766033397292939, -0.15216257726631555, 0.08706116887719743, -0.1169277434363089, -0.15358683548204727, 0.3307917271332952, 0.1930895353125482, 0.18885710193528293, 0.008786319438657476, 0.33530248560032433, 0.08759664274531148, 0.06880513974202344, 0.08088729395610043, 0.3241088755907607, 0.15801125607390146, 0.04603919262818908, -0.23998965145125564, 0.08334725173611172, -0.025447830542038054] |
1,802.08044 | Random Forest Classification of Stars in the Galactic Centre | Near-infrared high-angular resolution imaging observations of the Milky Way's
nuclear star cluster have revealed all luminous members of the existing stellar
population within the central parsec. Generally, these stars are either evolved
late-type giants or massive young, early-type stars. We revisit the problem of
stellar classification based on intermediate-band photometry in the K-band,
with the primary aim of identifying faint early-type candidate stars in the
extended vicinity of the central massive black hole. A random forest
classifier, trained on a subsample of spectroscopically identified stars,
performs similarly well as competitive methods (F1=0.85), without involving any
model of stellar spectral energy distributions. Advantages of using such a
machine-trained classifier are a minimum of required calibration effort, a
predictive accuracy expected to improve as more training data becomes
available, and the ease of application to future, larger data sets. By applying
this classifier to archive data, we are also able to reproduce the results of
previous studies of the spatial distribution and the K-band luminosity function
of both the early- and late-type stars.
| astro-ph.IM | nearinfrared highangular resolution imaging observations of the milky ways nuclear star cluster have revealed all luminous members of the existing stellar population within the central parsec generally these stars are either evolved latetype giants or massive young earlytype stars we revisit the problem of stellar classification based on intermediateband photometry in the kband with the primary aim of identifying faint earlytype candidate stars in the extended vicinity of the central massive black hole a random forest classifier trained on a subsample of spectroscopically identified stars performs similarly well as competitive methods f1085 without involving any model of stellar spectral energy distributions advantages of using such a machinetrained classifier are a minimum of required calibration effort a predictive accuracy expected to improve as more training data becomes available and the ease of application to future larger data sets by applying this classifier to archive data we are also able to reproduce the results of previous studies of the spatial distribution and the kband luminosity function of both the early and latetype stars | [['nearinfrared', 'highangular', 'resolution', 'imaging', 'observations', 'of', 'the', 'milky', 'ways', 'nuclear', 'star', 'cluster', 'have', 'revealed', 'all', 'luminous', 'members', 'of', 'the', 'existing', 'stellar', 'population', 'within', 'the', 'central', 'parsec', 'generally', 'these', 'stars', 'are', 'either', 'evolved', 'latetype', 'giants', 'or', 'massive', 'young', 'earlytype', 'stars', 'we', 'revisit', 'the', 'problem', 'of', 'stellar', 'classification', 'based', 'on', 'intermediateband', 'photometry', 'in', 'the', 'kband', 'with', 'the', 'primary', 'aim', 'of', 'identifying', 'faint', 'earlytype', 'candidate', 'stars', 'in', 'the', 'extended', 'vicinity', 'of', 'the', 'central', 'massive', 'black', 'hole', 'a', 'random', 'forest', 'classifier', 'trained', 'on', 'a', 'subsample', 'of', 'spectroscopically', 'identified', 'stars', 'performs', 'similarly', 'well', 'as', 'competitive', 'methods', 'f1085', 'without', 'involving', 'any', 'model', 'of', 'stellar', 'spectral', 'energy', 'distributions', 'advantages', 'of', 'using', 'such', 'a', 'machinetrained', 'classifier', 'are', 'a', 'minimum', 'of', 'required', 'calibration', 'effort', 'a', 'predictive', 'accuracy', 'expected', 'to', 'improve', 'as', 'more', 'training', 'data', 'becomes', 'available', 'and', 'the', 'ease', 'of', 'application', 'to', 'future', 'larger', 'data', 'sets', 'by', 'applying', 'this', 'classifier', 'to', 'archive', 'data', 'we', 'are', 'also', 'able', 'to', 'reproduce', 'the', 'results', 'of', 'previous', 'studies', 'of', 'the', 'spatial', 'distribution', 'and', 'the', 'kband', 'luminosity', 'function', 'of', 'both', 'the', 'early', 'and', 'latetype', 'stars']] | [-0.0007214437744486526, 0.04661432737567236, -0.07254850997220307, 0.12225514799342684, -0.1536297056873566, -0.06919881528706329, 0.0794985292909237, 0.4300166823606409, -0.11752936218661317, -0.3848454855112414, 0.06485550660206371, -0.3168820850496021, -0.028536912801783304, 0.20655354350648483, -0.08286539832620535, 0.04139869663066688, 0.15012729948471967, -0.029085154791180727, -0.03869822622585446, -0.3319691335741078, 0.3230856948162942, 0.0721780288655906, 0.17081151003315603, -0.11945920874304056, 0.03896728295973397, -0.08120022256329612, -0.12079174838651567, -0.022292907096269216, -0.11918851378433731, 0.08163818184592204, 0.2924351605735499, 0.19057562173076922, 0.2688966001626435, -0.3381735472416384, -0.2018907216746779, 0.09220765576251512, 0.21592307443449482, 0.04528452161170498, -0.07807466138842083, -0.27129013852916173, 0.08738762300190124, -0.17778839693355136, -0.16463773721311042, 0.01164558161595649, -0.007090771923491941, 0.05935279686092096, -0.24113563687909814, 0.11805181398890642, 0.021462333290121302, 0.1211714192993454, -0.12813515081097918, -0.1397160847820121, -0.08623657580713064, 0.10798409413381001, -0.005408177092346258, 0.08145489048256853, 0.15091169409773494, -0.17656644237415103, -0.05271246031025899, 0.39411519078769275, -0.07372920312119659, -0.03453711304571149, 0.24587147606598053, -0.16344383546873134, -0.17588626920140882, 0.07348416806832397, 0.18998108123850693, 0.16957356562402606, -0.20972687585180153, -0.004449095137172086, -0.011577603076557082, 0.1959587316409018, 0.027281529288022563, 0.07892922559179939, 0.3048626258686879, 0.1863584117302616, 0.013516819409711958, 0.10561855272775704, -0.2562176588421258, -0.02916637474957567, -0.1886297628481889, -0.08417986307951715, -0.1615204743347985, 0.05422432772565865, -0.171497385477466, -0.12537325934242435, 0.353743244078425, 0.12398282617203803, 0.19468381843314722, 0.08105775041880428, 0.33644595759997925, 0.05308288396832109, 0.17054702262476792, 0.11117232429310019, 0.27461418695196776, 0.16631633975576146, 0.07975078694323992, -0.2331528336473757, 0.043728918759510495, -0.01398033605693542] |
1,802.08045 | Spatially Resolved Thermodynamic Integration: An Efficient Method to
Compute Chemical Potentials of Dense Fluids | Many popular methods for the calculation of chemical potentials rely on the
insertion of test particles into the target system. In the case of liquids and
liquid mixtures, this procedure increases in difficulty upon increasing density
or concentration, and the use of sophisticated enhanced sampling techniques
becomes inevitable. In this work we propose an alternative strategy, spatially
resolved thermodynamic integration, or SPARTIAN for short. Here, molecules are
described with atomistic resolution in a simulation subregion, and as ideal gas
particles in a larger reservoir. All molecules are free to diffuse between
subdomains adapting their resolution on the fly. To enforce a uniform density
profile across the simulation box, a single-molecule external potential is
computed, applied, and identified with the difference in chemical potential
between the two resolutions. Since the reservoir is represented as an ideal gas
bath, this difference exactly amounts to the excess chemical potential of the
target system. The present approach surpasses the high density/concentration
limitation of particle insertion methods because the ideal gas molecules
entering the target system region spontaneously adapt to the local environment.
The ideal gas representation contributes negligibly to the computational cost
of the simulation, thus allowing one to make use of large reservoirs at minimal
expenses. The method has been validated by computing excess chemical potentials
for pure Lennard-Jones liquids and mixtures, SPC and SPC/E liquid water, and
aqueous solutions of sodium chloride. The reported results well reproduce
literature data for these systems.
| cond-mat.soft | many popular methods for the calculation of chemical potentials rely on the insertion of test particles into the target system in the case of liquids and liquid mixtures this procedure increases in difficulty upon increasing density or concentration and the use of sophisticated enhanced sampling techniques becomes inevitable in this work we propose an alternative strategy spatially resolved thermodynamic integration or spartian for short here molecules are described with atomistic resolution in a simulation subregion and as ideal gas particles in a larger reservoir all molecules are free to diffuse between subdomains adapting their resolution on the fly to enforce a uniform density profile across the simulation box a singlemolecule external potential is computed applied and identified with the difference in chemical potential between the two resolutions since the reservoir is represented as an ideal gas bath this difference exactly amounts to the excess chemical potential of the target system the present approach surpasses the high densityconcentration limitation of particle insertion methods because the ideal gas molecules entering the target system region spontaneously adapt to the local environment the ideal gas representation contributes negligibly to the computational cost of the simulation thus allowing one to make use of large reservoirs at minimal expenses the method has been validated by computing excess chemical potentials for pure lennardjones liquids and mixtures spc and spce liquid water and aqueous solutions of sodium chloride the reported results well reproduce literature data for these systems | [['many', 'popular', 'methods', 'for', 'the', 'calculation', 'of', 'chemical', 'potentials', 'rely', 'on', 'the', 'insertion', 'of', 'test', 'particles', 'into', 'the', 'target', 'system', 'in', 'the', 'case', 'of', 'liquids', 'and', 'liquid', 'mixtures', 'this', 'procedure', 'increases', 'in', 'difficulty', 'upon', 'increasing', 'density', 'or', 'concentration', 'and', 'the', 'use', 'of', 'sophisticated', 'enhanced', 'sampling', 'techniques', 'becomes', 'inevitable', 'in', 'this', 'work', 'we', 'propose', 'an', 'alternative', 'strategy', 'spatially', 'resolved', 'thermodynamic', 'integration', 'or', 'spartian', 'for', 'short', 'here', 'molecules', 'are', 'described', 'with', 'atomistic', 'resolution', 'in', 'a', 'simulation', 'subregion', 'and', 'as', 'ideal', 'gas', 'particles', 'in', 'a', 'larger', 'reservoir', 'all', 'molecules', 'are', 'free', 'to', 'diffuse', 'between', 'subdomains', 'adapting', 'their', 'resolution', 'on', 'the', 'fly', 'to', 'enforce', 'a', 'uniform', 'density', 'profile', 'across', 'the', 'simulation', 'box', 'a', 'singlemolecule', 'external', 'potential', 'is', 'computed', 'applied', 'and', 'identified', 'with', 'the', 'difference', 'in', 'chemical', 'potential', 'between', 'the', 'two', 'resolutions', 'since', 'the', 'reservoir', 'is', 'represented', 'as', 'an', 'ideal', 'gas', 'bath', 'this', 'difference', 'exactly', 'amounts', 'to', 'the', 'excess', 'chemical', 'potential', 'of', 'the', 'target', 'system', 'the', 'present', 'approach', 'surpasses', 'the', 'high', 'densityconcentration', 'limitation', 'of', 'particle', 'insertion', 'methods', 'because', 'the', 'ideal', 'gas', 'molecules', 'entering', 'the', 'target', 'system', 'region', 'spontaneously', 'adapt', 'to', 'the', 'local', 'environment', 'the', 'ideal', 'gas', 'representation', 'contributes', 'negligibly', 'to', 'the', 'computational', 'cost', 'of', 'the', 'simulation', 'thus', 'allowing', 'one', 'to', 'make', 'use', 'of', 'large', 'reservoirs', 'at', 'minimal', 'expenses', 'the', 'method', 'has', 'been', 'validated', 'by', 'computing', 'excess', 'chemical', 'potentials', 'for', 'pure', 'lennardjones', 'liquids', 'and', 'mixtures', 'spc', 'and', 'spce', 'liquid', 'water', 'and', 'aqueous', 'solutions', 'of', 'sodium', 'chloride', 'the', 'reported', 'results', 'well', 'reproduce', 'literature', 'data', 'for', 'these', 'systems']] | [-0.07010182742614915, 0.10462072450449889, -0.05852454703054722, 0.03180465832348742, 0.01862261622216724, -0.14633296980721308, 0.05795596590924182, 0.3785794660211326, -0.2493911144135142, -0.330231261265242, 0.06613763056356445, -0.2821801034285527, -0.062283533911624285, 0.14556950131196442, -0.020071682174496206, 0.05892557164539182, 0.05024413383667158, -0.035508811963862394, -0.05604173476582736, -0.2205957326284029, 0.274088044026886, 0.08553175861990103, 0.27184416616538143, 0.0747111158871197, 0.11529458885881894, -0.027812879262725864, -0.019815980936069368, 0.007345152757750146, -0.12043007529851159, 0.10691945501077126, 0.23422147184279143, 0.04416901698320418, 0.23904783054251053, -0.47338709869581785, -0.2577370324553961, 0.10373370382237292, 0.14729344496448918, 0.13460607307663025, -0.07641976890758179, -0.2244476467735333, 0.00932951317125908, -0.18367808776572503, -0.1774987589731563, -0.07898588024935135, 0.010513230836774889, 0.045703210711827945, -0.2414907642706418, 0.09871473996101189, 0.006719438186223194, 0.073195623070251, -0.079123070055841, -0.14413037135365134, -0.015169656988443752, 0.12290827856130243, 0.007229637627384653, 0.012455220660584429, 0.2364414025226678, -0.14369538274133836, -0.0370884739178151, 0.38969160483129106, -0.08669269165787924, -0.22212818643676357, 0.28691674307160175, -0.11430407344718234, -0.09778385467315386, 0.1861998713916269, 0.1143394464964951, 0.09422150820446937, -0.17333630626732835, 0.06376185805747353, 0.011491558038645178, 0.17769458801407664, 0.0739478494671941, 0.007995309476705587, 0.23431090648952388, 0.19642435280395726, 0.04930819025546679, 0.15532633601531978, -0.09557165801973241, -0.10978852863867755, -0.22474199644130144, -0.18923431147785202, -0.2161942011083449, -0.020365633598478143, -0.06241239209238793, -0.15485262940248093, 0.31558515249739816, 0.14728760417885922, 0.15278904404974383, 0.024773275413307864, 0.3194949711774277, 0.057087261548312576, 0.07078050774187006, 0.03537516388749883, 0.19651902283329487, 0.11389941693805782, 0.11793121604316344, -0.26687803944021415, 0.061601686491592006, 0.03183178991570321] |
1,802.08046 | Quillen cohomology of $(\infty,2)$-categories | In this paper we study the homotopy theory of parameterized spectrum objects
in the $\infty$-category of $(\infty, 2)$-categories, as well as the Quillen
cohomology of an $(\infty, 2)$-category with coefficients in such a
parameterized spectrum. More precisely, we construct an analogue of the twisted
arrow category for an $(\infty,2)$-category $\mathbb{C}$, which we call its
twisted 2-cell $\infty$-category. We then establish an equivalence between
parameterized spectrum objects over $\mathbb{C}$, and diagrams of spectra
indexed by the twisted 2-cell $\infty$-category of $\mathbb{C}$. Under this
equivalence, the Quillen cohomology of $\mathbb{C}$ with values in such a
diagram of spectra is identified with the two-fold suspension of its inverse
limit spectrum. As an application, we provide an alternative,
obstruction-theoretic proof of the fact that adjunctions between
$(\infty,1)$-categories are uniquely determined at the level of the homotopy
$(3, 2)$-category of $\mathrm{Cat}_{\infty}$.
| math.AT | in this paper we study the homotopy theory of parameterized spectrum objects in the inftycategory of infty 2categories as well as the quillen cohomology of an infty 2category with coefficients in such a parameterized spectrum more precisely we construct an analogue of the twisted arrow category for an infty2category mathbbc which we call its twisted 2cell inftycategory we then establish an equivalence between parameterized spectrum objects over mathbbc and diagrams of spectra indexed by the twisted 2cell inftycategory of mathbbc under this equivalence the quillen cohomology of mathbbc with values in such a diagram of spectra is identified with the twofold suspension of its inverse limit spectrum as an application we provide an alternative obstructiontheoretic proof of the fact that adjunctions between infty1categories are uniquely determined at the level of the homotopy 3 2category of mathrmcat_infty | [['in', 'this', 'paper', 'we', 'study', 'the', 'homotopy', 'theory', 'of', 'parameterized', 'spectrum', 'objects', 'in', 'the', 'inftycategory', 'of', 'infty', '2categories', 'as', 'well', 'as', 'the', 'quillen', 'cohomology', 'of', 'an', 'infty', '2category', 'with', 'coefficients', 'in', 'such', 'a', 'parameterized', 'spectrum', 'more', 'precisely', 'we', 'construct', 'an', 'analogue', 'of', 'the', 'twisted', 'arrow', 'category', 'for', 'an', 'infty2category', 'mathbbc', 'which', 'we', 'call', 'its', 'twisted', '2cell', 'inftycategory', 'we', 'then', 'establish', 'an', 'equivalence', 'between', 'parameterized', 'spectrum', 'objects', 'over', 'mathbbc', 'and', 'diagrams', 'of', 'spectra', 'indexed', 'by', 'the', 'twisted', '2cell', 'inftycategory', 'of', 'mathbbc', 'under', 'this', 'equivalence', 'the', 'quillen', 'cohomology', 'of', 'mathbbc', 'with', 'values', 'in', 'such', 'a', 'diagram', 'of', 'spectra', 'is', 'identified', 'with', 'the', 'twofold', 'suspension', 'of', 'its', 'inverse', 'limit', 'spectrum', 'as', 'an', 'application', 'we', 'provide', 'an', 'alternative', 'obstructiontheoretic', 'proof', 'of', 'the', 'fact', 'that', 'adjunctions', 'between', 'infty1categories', 'are', 'uniquely', 'determined', 'at', 'the', 'level', 'of', 'the', 'homotopy', '3', '2category', 'of', 'mathrmcat_infty']] | [-0.1591304373918791, 0.058645075734454655, -0.0784398426439751, 0.08187671222603293, -0.06587044549760995, -0.08226378059221638, -0.017184011817530348, 0.38823317207947927, -0.39549518994711064, -0.2125163926018609, 0.03662285297695134, -0.21443035643961694, -0.14436665984491506, 0.156896632026743, -0.181606762473368, -0.07026275364947246, 0.014522630610951671, 0.08558501307011789, -0.06557564991526306, -0.19743416795541566, 0.43595990672259144, 0.009704772562340454, 0.19843020352122107, 0.024656549397493815, 0.09349830659727255, 0.00411047079703874, 0.030971839352234923, -0.012592328047483331, -0.1968183420920266, 0.12735971372436594, 0.3067796703290056, 0.06968761510733101, 0.13885981564461772, -0.34788770635646804, -0.07571825894734098, 0.16882641142303192, 0.15189770829553406, -0.016740495301955552, 0.02013287877230646, -0.33102113433458186, 0.11875670660908023, -0.24867601942408968, -0.12536879708576534, -0.06657847763142652, 0.06269432768501618, 0.005958762612081719, -0.2301688699396672, -0.07037272837737368, 0.09336056564503384, 0.16482765752546213, -0.11825509350919337, -0.04299384986774789, -0.08272397285844717, 0.13806989686218676, -0.0018117967665333438, 0.009262846930478527, 0.09604639146752932, -0.12753458656198172, -0.13449346839312326, 0.38510964550077914, -0.10906114227103966, -0.16976777605582524, 0.09384090455455912, -0.11528707484507726, -0.18510603997511443, 0.1336153400854932, -0.02214247337370007, 0.20142804805051398, -0.02444883454720386, 0.20348772065739873, -0.14142305194227783, 0.10324825842485384, 0.11744901040844895, 0.02740416041471892, 0.18230906933097651, 0.12006409849833559, 0.05415147389802668, 0.18595709674129332, 0.009110412032653888, -0.04804868464599605, -0.363629872876185, -0.18792917079602678, -0.08145744329387392, 0.1696272109117773, -0.10757682315856477, -0.22684489578974468, 0.3877212140295241, 0.10890855645002039, 0.21919457005332568, 0.1755974321393296, 0.23807960240411813, 0.09068941520958174, 0.010906669694102472, -0.014272541521737974, 0.13883410040634098, 0.24088802175009968, 0.012171235348580889, -0.0757710659255584, -0.06557465767384403, 0.21980301309032022] |
1,802.08047 | When Renewable Energy Meets Building Thermal Mass: A Real-time Load
Management Scheme | We consider the optimal power management in renewable driven smart building
MicroGrid under noise corrupted conditions as a stochastic optimization
problem. We first propose our user satisfaction and electricity consumption
balanced (USECB) profit model as the objective for optimal power management. We
then cast the problem in noise corrupted conditions into the class of
expectation maximizing in stochastic optimization problem with convex
constraints. For this task, we design a Bregemen projection based mirror decent
algorithm as an approximation solution to our stochastic optimization problem.
Convergence and upper-bound of our algorithm with proof are also provided in
our paper. We then conduct a broad type of experiment in our simulation to test
the justification of our model as well as the effectiveness of our algorithm.
| cs.SY | we consider the optimal power management in renewable driven smart building microgrid under noise corrupted conditions as a stochastic optimization problem we first propose our user satisfaction and electricity consumption balanced usecb profit model as the objective for optimal power management we then cast the problem in noise corrupted conditions into the class of expectation maximizing in stochastic optimization problem with convex constraints for this task we design a bregemen projection based mirror decent algorithm as an approximation solution to our stochastic optimization problem convergence and upperbound of our algorithm with proof are also provided in our paper we then conduct a broad type of experiment in our simulation to test the justification of our model as well as the effectiveness of our algorithm | [['we', 'consider', 'the', 'optimal', 'power', 'management', 'in', 'renewable', 'driven', 'smart', 'building', 'microgrid', 'under', 'noise', 'corrupted', 'conditions', 'as', 'a', 'stochastic', 'optimization', 'problem', 'we', 'first', 'propose', 'our', 'user', 'satisfaction', 'and', 'electricity', 'consumption', 'balanced', 'usecb', 'profit', 'model', 'as', 'the', 'objective', 'for', 'optimal', 'power', 'management', 'we', 'then', 'cast', 'the', 'problem', 'in', 'noise', 'corrupted', 'conditions', 'into', 'the', 'class', 'of', 'expectation', 'maximizing', 'in', 'stochastic', 'optimization', 'problem', 'with', 'convex', 'constraints', 'for', 'this', 'task', 'we', 'design', 'a', 'bregemen', 'projection', 'based', 'mirror', 'decent', 'algorithm', 'as', 'an', 'approximation', 'solution', 'to', 'our', 'stochastic', 'optimization', 'problem', 'convergence', 'and', 'upperbound', 'of', 'our', 'algorithm', 'with', 'proof', 'are', 'also', 'provided', 'in', 'our', 'paper', 'we', 'then', 'conduct', 'a', 'broad', 'type', 'of', 'experiment', 'in', 'our', 'simulation', 'to', 'test', 'the', 'justification', 'of', 'our', 'model', 'as', 'well', 'as', 'the', 'effectiveness', 'of', 'our', 'algorithm']] | [-0.08397846534603932, -0.06782513096073135, -0.059605866689693, 0.04490934304996073, -0.09490361968131705, -0.1525405735640069, 0.1002203306750028, 0.38851956864360904, -0.314890097808589, -0.33946938763876433, 0.13864850329300082, -0.23645044784595975, -0.20591050803233854, 0.2079203058755575, -0.15522889286035396, 0.12760692837144264, 0.06008667022478385, -0.02809894645250723, -0.02762204065888387, -0.29023519995217745, 0.26917535685132576, 0.09259572025144198, 0.299520599655807, 0.031423230813415415, 0.15113734340077634, -0.005543658715962875, 0.02117892889092203, 0.04824626492145548, -0.07654191530214195, 0.11966503743410538, 0.3097580852841989, 0.22496596373403904, 0.371591969713813, -0.42760280337276274, -0.17010580038377007, 0.14034013345562776, 0.099463342104277, 0.06135706086719378, -0.09348964224737442, -0.26619529178304996, 0.08157352313635963, -0.18529461563152613, -0.05471039854264895, -0.06652048226926842, -0.09455129878259584, 0.06269170485864409, -0.38357319826351816, 0.03346204658618128, 0.05881677903177705, 0.0016471216508538507, -0.125649956312626, -0.13185675109385467, 0.04514782579966867, 0.09578073517701848, 0.06762979707211164, -0.020257185977124073, 0.13031531217294273, -0.0909579234850425, -0.153056797783318, 0.3828790290052163, -0.04995592023994102, -0.2535235169419988, 0.07063785604712722, -0.010128434327598966, -0.1773371469366868, 0.09357273553452286, 0.27925677860125164, 0.1497019612321966, -0.17709313394295692, 0.03335080040737101, -0.07800831500685117, 0.1500970524063975, -0.004818355998589245, 0.006864216235909062, 0.12644797597714075, 0.27699738012275615, 0.2043825866631614, 0.21861999075798716, -0.031917960071920985, -0.12980865040549733, -0.3152375184152214, -0.10751989240315361, -0.192771346453333, 0.031332636587932464, -0.09220878515735108, -0.1388017826362467, 0.38092920289481763, 0.2135436255790171, 0.1499966958415557, 0.14387126476981021, 0.3954998859372295, 0.14702026738945517, -0.05514567597677595, 0.11269730515348664, 0.16592359072605117, 0.05110732202425782, 0.14398601104612233, -0.25531514535551186, 0.04824444729277528, 0.06367826760273243] |
1,802.08048 | Yields and production rates of cosmogenic $^9$Li and $^8$He measured
with the Double Chooz near and far detectors | The yields and production rates of the radioisotopes $^9$Li and $^8$He
created by cosmic muon spallation on $^{12}$C, have been measured by the two
detectors of the Double Chooz experiment. The identical detectors are located
at separate sites and depths, which means they are subject to different muon
spectra. The near (far) detector has an overburden of $\sim$120 m.w.e.
($\sim$300 m.w.e.) corresponding to a mean muon energy of
$32.1\pm2.0\,\mathrm{GeV}$ ($63.7\pm5.5\,\mathrm{GeV}$). Comparing the data to
a detailed simulation of the $^9$Li and $^8$He decays, the contribution of the
$^8$He radioisotope at both detectors is found to be compatible with zero. The
observed $^9$Li yields in the near and far detectors are $5.51\pm0.51$ and
$7.90\pm0.51$, respectively, in units of $10^{-8}\mu ^{-1} \mathrm{g^{-1}
cm^{2} }$. The shallow overburdens of the near and far detectors give a unique
insight when combined with measurements by KamLAND and Borexino to give the
first multi--experiment, data driven relationship between the $^9$Li yield and
the mean muon energy according to the power law $Y = Y_0( <E_{\mu} >/
1\,\mathrm{GeV})^{\overline{\alpha}}$, giving $\overline{\alpha}=0.72\pm0.06$
and $Y_0=(0.43\pm0.11)\times 10^{-8}\mu ^{-1} \mathrm{g^{-1} cm^{2}}$. This
relationship gives future liquid scintillator based experiments the ability to
predict their cosmogenic $^9$Li background rates.
| hep-ex physics.ins-det | the yields and production rates of the radioisotopes 9li and 8he created by cosmic muon spallation on 12c have been measured by the two detectors of the double chooz experiment the identical detectors are located at separate sites and depths which means they are subject to different muon spectra the near far detector has an overburden of sim120 mwe sim300 mwe corresponding to a mean muon energy of 321pm20mathrmgev 637pm55mathrmgev comparing the data to a detailed simulation of the 9li and 8he decays the contribution of the 8he radioisotope at both detectors is found to be compatible with zero the observed 9li yields in the near and far detectors are 551pm051 and 790pm051 respectively in units of 108mu 1 mathrmg1 cm2 the shallow overburdens of the near and far detectors give a unique insight when combined with measurements by kamland and borexino to give the first multiexperiment data driven relationship between the 9li yield and the mean muon energy according to the power law y y_0 e_mu 1mathrmgevoverlinealpha giving overlinealpha072pm006 and y_0043pm011times 108mu 1 mathrmg1 cm2 this relationship gives future liquid scintillator based experiments the ability to predict their cosmogenic 9li background rates | [['the', 'yields', 'and', 'production', 'rates', 'of', 'the', 'radioisotopes', '9li', 'and', '8he', 'created', 'by', 'cosmic', 'muon', 'spallation', 'on', '12c', 'have', 'been', 'measured', 'by', 'the', 'two', 'detectors', 'of', 'the', 'double', 'chooz', 'experiment', 'the', 'identical', 'detectors', 'are', 'located', 'at', 'separate', 'sites', 'and', 'depths', 'which', 'means', 'they', 'are', 'subject', 'to', 'different', 'muon', 'spectra', 'the', 'near', 'far', 'detector', 'has', 'an', 'overburden', 'of', 'sim120', 'mwe', 'sim300', 'mwe', 'corresponding', 'to', 'a', 'mean', 'muon', 'energy', 'of', '321pm20mathrmgev', '637pm55mathrmgev', 'comparing', 'the', 'data', 'to', 'a', 'detailed', 'simulation', 'of', 'the', '9li', 'and', '8he', 'decays', 'the', 'contribution', 'of', 'the', '8he', 'radioisotope', 'at', 'both', 'detectors', 'is', 'found', 'to', 'be', 'compatible', 'with', 'zero', 'the', 'observed', '9li', 'yields', 'in', 'the', 'near', 'and', 'far', 'detectors', 'are', '551pm051', 'and', '790pm051', 'respectively', 'in', 'units', 'of', '108mu', '1', 'mathrmg1', 'cm2', 'the', 'shallow', 'overburdens', 'of', 'the', 'near', 'and', 'far', 'detectors', 'give', 'a', 'unique', 'insight', 'when', 'combined', 'with', 'measurements', 'by', 'kamland', 'and', 'borexino', 'to', 'give', 'the', 'first', 'multiexperiment', 'data', 'driven', 'relationship', 'between', 'the', '9li', 'yield', 'and', 'the', 'mean', 'muon', 'energy', 'according', 'to', 'the', 'power', 'law', 'y', 'y_0', 'e_mu', '1mathrmgevoverlinealpha', 'giving', 'overlinealpha072pm006', 'and', 'y_0043pm011times', '108mu', '1', 'mathrmg1', 'cm2', 'this', 'relationship', 'gives', 'future', 'liquid', 'scintillator', 'based', 'experiments', 'the', 'ability', 'to', 'predict', 'their', 'cosmogenic', '9li', 'background', 'rates']] | [-0.017171821593605033, 0.2030328789235452, -0.05103687065970767, 0.10508634385417451, 0.026065205676726752, -0.10866928996855986, 0.025665192974214494, 0.33350796287285756, -0.19664501644937055, -0.35951355251401745, 0.03201387244229369, -0.42622647408887254, 0.041719234722492456, 0.20580007091476735, 0.04251355798863857, 0.03991122609439337, 0.06965840479728745, 0.06396555971446355, -0.07310382551628748, -0.19552184567674175, 0.2321561744416153, 0.1833790752826934, 0.2765403776864552, 0.09167815444243888, 0.12760463435903888, -0.06393116196249049, -0.03597907040742799, -0.062060903270761185, -0.1388324505678611, 0.07045796799790409, 0.2851313452049578, 0.1172886892889657, 0.11659247090958141, -0.4492340903053736, -0.10973839126117937, 0.11648860932097535, 0.09841070025596399, 0.01335762921339515, -0.06683658170168401, -0.3264498510935272, 0.09330559876084757, -0.17082623591113089, -0.11040508599982567, 0.010346954511248271, -0.006125540523738652, 0.04733630901207037, -0.24847975333866018, 0.0548599861155438, -0.02472149782077215, 0.043695366523064834, -0.0976214065372555, -0.22445565771252673, 0.010879910661030438, 0.09605629879365302, 0.0851750510711489, 0.05645573969065611, 0.1821165835046066, -0.08528347226628294, -0.07536594216599242, 0.317478778833462, -0.05125487916102629, -0.10964204520940177, 0.15809472134608038, -0.19185964062369867, -0.06598618099527372, 0.225011322903191, 0.14757196576805315, 0.055627408126123816, -0.1960948568396686, 0.017321936244395778, 0.009848821524448775, 0.17671075639708972, 0.0684374486886804, 0.01068337355960406, 0.23662005159696872, 0.22298453926111336, 0.05622031863210825, 0.06033198264808711, -0.23957062313165006, -0.008359267230524303, -0.296237171998575, -0.12298987360394836, -0.09890795963724236, 0.05971191782545257, -0.00635426710113489, -0.09129376690016015, 0.3630653262537505, 0.05049606041399414, 0.20038506458769298, 0.003980974655900314, 0.28420440238583217, 0.05865125967206301, 0.0609955314385633, 0.017328603175253823, 0.34085317899646994, 0.16504559646089367, 0.1085277514322405, -0.24101729812561073, 0.07867165996595848, -0.0060529174068226265] |
1,802.08049 | Seidel's conjectures in hyperbolic 3-space | We prove, in the case of hyperbolic 3-space, a couple of conjectures raised
by J. J. Seidel in "On the volume of a hyperbolic simplex", Stud. Sci. Math.
Hung. 21, 243-249, 1986. These conjectures concern expressing the volume of an
ideal hyperbolic tetrahedron as a monotonic function of algebraic maps. More
precisely, Seidel's first conjecture states that the volume of an ideal
tetrahedron in hyperbolic 3-space is determined by (the permanent and the
determinant of) the doubly stochastic Gram matrix $G$ of its vertices; Seidel's
fourth conjecture claims that the mentioned volume is a monotonic function of
both the permanent and the determinant of $G$.
| math.DG | we prove in the case of hyperbolic 3space a couple of conjectures raised by j j seidel in on the volume of a hyperbolic simplex stud sci math hung 21 243249 1986 these conjectures concern expressing the volume of an ideal hyperbolic tetrahedron as a monotonic function of algebraic maps more precisely seidels first conjecture states that the volume of an ideal tetrahedron in hyperbolic 3space is determined by the permanent and the determinant of the doubly stochastic gram matrix g of its vertices seidels fourth conjecture claims that the mentioned volume is a monotonic function of both the permanent and the determinant of g | [['we', 'prove', 'in', 'the', 'case', 'of', 'hyperbolic', '3space', 'a', 'couple', 'of', 'conjectures', 'raised', 'by', 'j', 'j', 'seidel', 'in', 'on', 'the', 'volume', 'of', 'a', 'hyperbolic', 'simplex', 'stud', 'sci', 'math', 'hung', '21', '243249', '1986', 'these', 'conjectures', 'concern', 'expressing', 'the', 'volume', 'of', 'an', 'ideal', 'hyperbolic', 'tetrahedron', 'as', 'a', 'monotonic', 'function', 'of', 'algebraic', 'maps', 'more', 'precisely', 'seidels', 'first', 'conjecture', 'states', 'that', 'the', 'volume', 'of', 'an', 'ideal', 'tetrahedron', 'in', 'hyperbolic', '3space', 'is', 'determined', 'by', 'the', 'permanent', 'and', 'the', 'determinant', 'of', 'the', 'doubly', 'stochastic', 'gram', 'matrix', 'g', 'of', 'its', 'vertices', 'seidels', 'fourth', 'conjecture', 'claims', 'that', 'the', 'mentioned', 'volume', 'is', 'a', 'monotonic', 'function', 'of', 'both', 'the', 'permanent', 'and', 'the', 'determinant', 'of', 'g']] | [-0.17983897769478902, 0.08631194439574476, -0.03563357094446054, 0.022970639108769737, -0.047942121172896944, -0.10224246911149329, 0.02326596643587646, 0.2781259008289243, -0.2612991029611574, -0.25440998434518963, 0.11239574734533492, -0.30446937821286085, -0.18945564495292133, 0.1474732778481736, -0.13396430837635237, 0.036964354301744606, 0.021069550062887944, 0.03268097895824422, -0.0941143307270697, -0.32207076157143233, 0.33134433317284745, -0.011160398081231575, 0.19702027381740314, 0.11303354176477744, 0.11659691343083978, 0.02806863305158913, -0.031945528861027785, 0.021326278251273416, -0.17053253801448312, 0.1595190333447625, 0.20722167232396224, 0.11281341899526663, 0.23320366143105695, -0.3828479449318995, -0.12165261631777796, 0.15241021598474339, 0.0623207218058479, 0.015566880109522922, -0.00999060550062635, -0.25562709449709825, 0.04515151972401117, -0.12530992369060046, -0.252413099210781, -0.022848387779399324, 0.12155976236905329, 0.0011079569812864065, -0.20021910990516728, 0.08311427679235259, 0.15891545832318327, 0.10083256275650526, 0.01593141623015981, -0.1480755277253383, -0.0652391826420521, 0.04715092616299024, -0.013449739839415997, 0.050311572128871024, 0.04798089854795343, -0.07220103878241318, -0.13173162969402397, 0.35894901077083957, -0.04578875427922377, -0.1958575537794856, 0.0938168214320635, -0.14221785876613396, -0.1410488665390473, 0.1606894814366779, 0.11669047018333983, 0.14846401881928054, -0.06928150404173021, 0.15967973678422054, -0.17242174467537552, 0.10242447599123877, 0.16061928074878568, -0.10628561571670267, 0.13404833909589797, 0.03885128299365393, 0.09359627690775177, 0.13749870064874323, 0.021232622892757017, -0.05901689662669714, -0.30902653362136334, -0.2553984117000185, -0.2504533399797555, 0.12639650695536359, -0.11444568132971583, -0.2154384333317956, 0.35979028796562207, 0.009541933700137843, 0.13616246456960931, 0.08396225419038764, 0.1758065348974644, 0.08084096550122083, 0.011778864861788372, 0.097046229782371, 0.1827591091680985, 0.2364386445753133, 0.047029233389856435, -0.1941678581150392, -0.010932667901775299, 0.20751774890008023] |
1,802.0805 | Renormalization Group Flow of the Aharonov-Bohm Scattering Amplitude | The Aharonov-Bohm elastic scattering with incident particles described by
plane waves is revisited by using the phase-shifts method. The formal
equivalence between the cylindrical Schr\"odinger equation and the
one-dimensional Calogero problem allows us to show that up to two scattering
phase-shifts modes in the cylindrical waves expansion must be renormalized. The
renormalization procedure introduces new length scales giving rise to
spontaneous breaking of the conformal symmetry. The new renormalized
cross-section has an amazing property of being non-vanishing even for a
quantized magnetic flux, coinciding with the case of Dirac delta function
potential. The knowledge of the exact beta function permits us to describe the
renormalization group flows within the two-parametric family of renormalized
Aharonov-Bohm scattering amplitudes. Our analysis demonstrates that for
quantized magnetic fluxes a BKT-like phase transition at the coupling space
occurs.
| hep-th math-ph math.MP quant-ph | the aharonovbohm elastic scattering with incident particles described by plane waves is revisited by using the phaseshifts method the formal equivalence between the cylindrical schrodinger equation and the onedimensional calogero problem allows us to show that up to two scattering phaseshifts modes in the cylindrical waves expansion must be renormalized the renormalization procedure introduces new length scales giving rise to spontaneous breaking of the conformal symmetry the new renormalized crosssection has an amazing property of being nonvanishing even for a quantized magnetic flux coinciding with the case of dirac delta function potential the knowledge of the exact beta function permits us to describe the renormalization group flows within the twoparametric family of renormalized aharonovbohm scattering amplitudes our analysis demonstrates that for quantized magnetic fluxes a bktlike phase transition at the coupling space occurs | [['the', 'aharonovbohm', 'elastic', 'scattering', 'with', 'incident', 'particles', 'described', 'by', 'plane', 'waves', 'is', 'revisited', 'by', 'using', 'the', 'phaseshifts', 'method', 'the', 'formal', 'equivalence', 'between', 'the', 'cylindrical', 'schrodinger', 'equation', 'and', 'the', 'onedimensional', 'calogero', 'problem', 'allows', 'us', 'to', 'show', 'that', 'up', 'to', 'two', 'scattering', 'phaseshifts', 'modes', 'in', 'the', 'cylindrical', 'waves', 'expansion', 'must', 'be', 'renormalized', 'the', 'renormalization', 'procedure', 'introduces', 'new', 'length', 'scales', 'giving', 'rise', 'to', 'spontaneous', 'breaking', 'of', 'the', 'conformal', 'symmetry', 'the', 'new', 'renormalized', 'crosssection', 'has', 'an', 'amazing', 'property', 'of', 'being', 'nonvanishing', 'even', 'for', 'a', 'quantized', 'magnetic', 'flux', 'coinciding', 'with', 'the', 'case', 'of', 'dirac', 'delta', 'function', 'potential', 'the', 'knowledge', 'of', 'the', 'exact', 'beta', 'function', 'permits', 'us', 'to', 'describe', 'the', 'renormalization', 'group', 'flows', 'within', 'the', 'twoparametric', 'family', 'of', 'renormalized', 'aharonovbohm', 'scattering', 'amplitudes', 'our', 'analysis', 'demonstrates', 'that', 'for', 'quantized', 'magnetic', 'fluxes', 'a', 'bktlike', 'phase', 'transition', 'at', 'the', 'coupling', 'space', 'occurs']] | [-0.2036843652998034, 0.21352175232366558, -0.09021249028707021, 0.06299706117540627, -0.10682600095721059, -0.11470948408630893, 0.005728537987049361, 0.3277831710034743, -0.26236057539008334, -0.2625254091449586, -0.025564495933634277, -0.29244344726152793, -0.13252838586169974, 0.1523457316163563, 0.051188281970098615, 0.06306178464477223, -0.0044077922996217595, 0.01582326726721866, -0.11619381150895995, -0.15187593784071224, 0.33020190579144465, 0.025283707113222295, 0.28632696726380436, 0.07153056035714603, 0.08712881820756045, 0.059313269065959115, 0.017100839591602607, -0.014632769955078812, -0.13931128724981046, 0.06467983047425382, 0.18794896387271023, -0.027451490223603815, 0.1565067612393619, -0.4295902459889202, -0.1992139522497423, 0.06361772576206945, 0.1745570939930534, 0.14514768875687195, -0.011295257085458116, -0.325233847433281, -0.006131390543808614, -0.15175750867342858, -0.23292883103223225, -0.07533973297874506, 0.028612124330987383, -0.03715759965318038, -0.2712248898902558, 0.10611756281451062, 0.014122311572047104, 0.016914416468681248, -0.0659334346467342, -0.04311578454715865, -0.014775220351118622, 0.08314145125336665, 0.09077033902434423, 0.031610749234774506, 0.09285726536965151, -0.09399523381563954, -0.08280776127826255, 0.3734502673872985, -0.077359724002085, -0.196881313654209, 0.10420246224472285, -0.16610044968853654, -0.0713477067691379, 0.21674030802835872, 0.11106896371741716, 0.0862114991392254, -0.13519137871847314, 0.14624666831596392, -0.02620592832834901, 0.12663133845851, 0.10642907303526886, -0.0076352173000350035, 0.20893552184763148, 0.120902667088168, 0.05703726433273545, 0.1312971026067713, -0.07479657953310954, -0.10568875010139343, -0.366829830340873, -0.11898504874294386, -0.17237459401743613, 0.08275386249327935, -0.09865542413844969, -0.20753401483906278, 0.3934750600325826, 0.11872202168248114, 0.1705404642577234, 0.038777761763535944, 0.23497950800351405, 0.18677200900331223, 0.09106299201642773, 0.03773028654207412, 0.2688369483343865, 0.21139081507742657, 0.08493310937577424, -0.30245458136340675, -0.04092931827701824, 0.12754916552720325] |
1,802.08051 | Strategies for Reduced-Order Models for Predicting the Statistical
Responses and Uncertainty Quantification in Complex Turbulent Dynamical
Systems | Turbulent dynamical systems characterized by both a high-dimensional phase
space and a large number of instabilities are ubiquitous among many complex
systems in science and engineering. The existence of a strange attractor in the
turbulent systems containing a large number of positive Lyapunov exponents
results in a rapid growth of small uncertainties, requiring naturally a
probabilistic characterization for the evolution of the turbulent system.
Uncertainty quantification in turbulent dynamical systems is a grand challenge
where the goal is to obtain statistical estimates such as the change in mean
and variance for key physical quantities in their nonlinear responses to
changes in external forcing parameters or uncertain initial data. One central
issue in contemporary research is the development of a systematic methodology
that can recover the crucial features of the natural system in statistical
equilibrium (model fidelity) and improve the imperfect model prediction skill
in response to various external perturbations (model sensitivity). A general
mathematical framework to construct statistically accurate reduced-order models
that have skill in capturing the statistical variability in the principal
directions with largest energy of a general class of damped and forced complex
turbulent dynamical systems is discussed here. The methods are developed under
a universal class of turbulent dynamical systems with quadratic nonlinearity
that is representative in many applications in applied mathematics and
engineering. The validity of general framework of reduced-order models is
demonstrated on instructive stochastic triad models. Recent applications to
two-layer baroclinic turbulence in the atmosphere and ocean with combinations
of turbulent jets and vortices are also surveyed.
| physics.flu-dyn nlin.CD | turbulent dynamical systems characterized by both a highdimensional phase space and a large number of instabilities are ubiquitous among many complex systems in science and engineering the existence of a strange attractor in the turbulent systems containing a large number of positive lyapunov exponents results in a rapid growth of small uncertainties requiring naturally a probabilistic characterization for the evolution of the turbulent system uncertainty quantification in turbulent dynamical systems is a grand challenge where the goal is to obtain statistical estimates such as the change in mean and variance for key physical quantities in their nonlinear responses to changes in external forcing parameters or uncertain initial data one central issue in contemporary research is the development of a systematic methodology that can recover the crucial features of the natural system in statistical equilibrium model fidelity and improve the imperfect model prediction skill in response to various external perturbations model sensitivity a general mathematical framework to construct statistically accurate reducedorder models that have skill in capturing the statistical variability in the principal directions with largest energy of a general class of damped and forced complex turbulent dynamical systems is discussed here the methods are developed under a universal class of turbulent dynamical systems with quadratic nonlinearity that is representative in many applications in applied mathematics and engineering the validity of general framework of reducedorder models is demonstrated on instructive stochastic triad models recent applications to twolayer baroclinic turbulence in the atmosphere and ocean with combinations of turbulent jets and vortices are also surveyed | [['turbulent', 'dynamical', 'systems', 'characterized', 'by', 'both', 'a', 'highdimensional', 'phase', 'space', 'and', 'a', 'large', 'number', 'of', 'instabilities', 'are', 'ubiquitous', 'among', 'many', 'complex', 'systems', 'in', 'science', 'and', 'engineering', 'the', 'existence', 'of', 'a', 'strange', 'attractor', 'in', 'the', 'turbulent', 'systems', 'containing', 'a', 'large', 'number', 'of', 'positive', 'lyapunov', 'exponents', 'results', 'in', 'a', 'rapid', 'growth', 'of', 'small', 'uncertainties', 'requiring', 'naturally', 'a', 'probabilistic', 'characterization', 'for', 'the', 'evolution', 'of', 'the', 'turbulent', 'system', 'uncertainty', 'quantification', 'in', 'turbulent', 'dynamical', 'systems', 'is', 'a', 'grand', 'challenge', 'where', 'the', 'goal', 'is', 'to', 'obtain', 'statistical', 'estimates', 'such', 'as', 'the', 'change', 'in', 'mean', 'and', 'variance', 'for', 'key', 'physical', 'quantities', 'in', 'their', 'nonlinear', 'responses', 'to', 'changes', 'in', 'external', 'forcing', 'parameters', 'or', 'uncertain', 'initial', 'data', 'one', 'central', 'issue', 'in', 'contemporary', 'research', 'is', 'the', 'development', 'of', 'a', 'systematic', 'methodology', 'that', 'can', 'recover', 'the', 'crucial', 'features', 'of', 'the', 'natural', 'system', 'in', 'statistical', 'equilibrium', 'model', 'fidelity', 'and', 'improve', 'the', 'imperfect', 'model', 'prediction', 'skill', 'in', 'response', 'to', 'various', 'external', 'perturbations', 'model', 'sensitivity', 'a', 'general', 'mathematical', 'framework', 'to', 'construct', 'statistically', 'accurate', 'reducedorder', 'models', 'that', 'have', 'skill', 'in', 'capturing', 'the', 'statistical', 'variability', 'in', 'the', 'principal', 'directions', 'with', 'largest', 'energy', 'of', 'a', 'general', 'class', 'of', 'damped', 'and', 'forced', 'complex', 'turbulent', 'dynamical', 'systems', 'is', 'discussed', 'here', 'the', 'methods', 'are', 'developed', 'under', 'a', 'universal', 'class', 'of', 'turbulent', 'dynamical', 'systems', 'with', 'quadratic', 'nonlinearity', 'that', 'is', 'representative', 'in', 'many', 'applications', 'in', 'applied', 'mathematics', 'and', 'engineering', 'the', 'validity', 'of', 'general', 'framework', 'of', 'reducedorder', 'models', 'is', 'demonstrated', 'on', 'instructive', 'stochastic', 'triad', 'models', 'recent', 'applications', 'to', 'twolayer', 'baroclinic', 'turbulence', 'in', 'the', 'atmosphere', 'and', 'ocean', 'with', 'combinations', 'of', 'turbulent', 'jets', 'and', 'vortices', 'are', 'also', 'surveyed']] | [-0.13636640429344, 0.12643436756235338, -0.06383114036636449, 0.09868998706650003, -0.04836887488115888, -0.09490662365746887, -0.01844098665079713, 0.29709710695517616, -0.28052937755869195, -0.3170961381429475, 0.10822162976379877, -0.22978391724715944, -0.16560260189573828, 0.24010740112874054, -0.07328814104026397, 0.12179139683331619, 0.05604407583131444, -0.01657325618535928, -0.030620257260660703, -0.18773131925804107, 0.3110343151065068, 0.04116384705653775, 0.27635872431592684, -0.023300171993339707, 0.08223107409444472, -0.06773762446423263, -0.03381717372722482, 0.037774556698121145, -0.12276470368465647, 0.12014144088265052, 0.27458932842827105, 0.10545430583842541, 0.32912298231936665, -0.4060749577822186, -0.2868705523060451, 0.10637118029794675, 0.12003161085172732, 0.11653345646042185, -0.02728402028973822, -0.24167135148217142, 0.05461772334193185, -0.17205259157850852, -0.13121400231848887, -0.11123848113087798, 0.05544384271863539, 0.037995937841037004, -0.2879002714778569, 0.12022340578740746, 0.06458300421163514, 0.12320799087339887, -0.08098924908558783, -0.07565240574155828, -0.03258383416721649, 0.12706856288682125, 0.04497602451160153, -0.002194833331152414, 0.14870930515347497, -0.17194165023625368, -0.09485689111665009, 0.4019717271274081, -0.05782118163222499, -0.23072957489713142, 0.2260588216448107, -0.1405909490466059, -0.17697192410102827, 0.13104165645165317, 0.2488602275790816, 0.06774523522218932, -0.1571240497324174, 0.050633878323798, -0.015653324219593298, 0.15888859392530302, -0.012374414872790396, 0.021552950073642795, 0.22923511488679724, 0.22011204222180392, 0.04791792798391635, 0.10245739014220162, -0.046913120758962694, -0.15379299056852463, -0.27035713618024887, -0.11370350588236157, -0.1450525128090268, 0.023186298431883835, -0.09394951649847635, -0.19211457737467505, 0.4008294114191453, 0.18091535992670082, 0.15493982928996472, 0.008838034607654092, 0.3045027963449008, 0.09865285117839916, 0.015871646389799567, 0.08157181973466024, 0.2387838369217451, 0.15661962241350338, 0.12400103533288957, -0.19658375419345003, 0.0830202701325775, 0.019316681209774946] |
1,802.08052 | Data Consistency Simulation Tool for NoSQL Database Systems | Various data consistency levels have an important part in the integrity of
data and also affect performance especially the data that is replicated many
times across or over the cluster. Based on BASE and the theorem of CAP
tradeoffs, most systems of NoSQL have more relaxed consistency guarantees than
another kind of databases which implement ACID. Most systems of NoSQL gave
different methods to adjust a required level of consistency to ensure the
minimal numbering of the replicas accepted in each operation. Simulations are
always depending on a simplified model and ignore many details and facts about
the real system. Therefore, a simulation can only work as an estimation or an
explanation vehicle for observed behavior. So to create simulation tool, I have
to characterize a model, identify influence factors and simply implement that
depending on a (modeled) workload. In this paper, I have a model of simulation
to measure the consistency of the data and to detect the data consistency
violations in simulated network partition settings. So workloads are needed
with the set of users who make requests and then put the results for analysis.
| cs.DB | various data consistency levels have an important part in the integrity of data and also affect performance especially the data that is replicated many times across or over the cluster based on base and the theorem of cap tradeoffs most systems of nosql have more relaxed consistency guarantees than another kind of databases which implement acid most systems of nosql gave different methods to adjust a required level of consistency to ensure the minimal numbering of the replicas accepted in each operation simulations are always depending on a simplified model and ignore many details and facts about the real system therefore a simulation can only work as an estimation or an explanation vehicle for observed behavior so to create simulation tool i have to characterize a model identify influence factors and simply implement that depending on a modeled workload in this paper i have a model of simulation to measure the consistency of the data and to detect the data consistency violations in simulated network partition settings so workloads are needed with the set of users who make requests and then put the results for analysis | [['various', 'data', 'consistency', 'levels', 'have', 'an', 'important', 'part', 'in', 'the', 'integrity', 'of', 'data', 'and', 'also', 'affect', 'performance', 'especially', 'the', 'data', 'that', 'is', 'replicated', 'many', 'times', 'across', 'or', 'over', 'the', 'cluster', 'based', 'on', 'base', 'and', 'the', 'theorem', 'of', 'cap', 'tradeoffs', 'most', 'systems', 'of', 'nosql', 'have', 'more', 'relaxed', 'consistency', 'guarantees', 'than', 'another', 'kind', 'of', 'databases', 'which', 'implement', 'acid', 'most', 'systems', 'of', 'nosql', 'gave', 'different', 'methods', 'to', 'adjust', 'a', 'required', 'level', 'of', 'consistency', 'to', 'ensure', 'the', 'minimal', 'numbering', 'of', 'the', 'replicas', 'accepted', 'in', 'each', 'operation', 'simulations', 'are', 'always', 'depending', 'on', 'a', 'simplified', 'model', 'and', 'ignore', 'many', 'details', 'and', 'facts', 'about', 'the', 'real', 'system', 'therefore', 'a', 'simulation', 'can', 'only', 'work', 'as', 'an', 'estimation', 'or', 'an', 'explanation', 'vehicle', 'for', 'observed', 'behavior', 'so', 'to', 'create', 'simulation', 'tool', 'i', 'have', 'to', 'characterize', 'a', 'model', 'identify', 'influence', 'factors', 'and', 'simply', 'implement', 'that', 'depending', 'on', 'a', 'modeled', 'workload', 'in', 'this', 'paper', 'i', 'have', 'a', 'model', 'of', 'simulation', 'to', 'measure', 'the', 'consistency', 'of', 'the', 'data', 'and', 'to', 'detect', 'the', 'data', 'consistency', 'violations', 'in', 'simulated', 'network', 'partition', 'settings', 'so', 'workloads', 'are', 'needed', 'with', 'the', 'set', 'of', 'users', 'who', 'make', 'requests', 'and', 'then', 'put', 'the', 'results', 'for', 'analysis']] | [-0.10367271977915524, 0.012634900058929492, -0.09287729828558382, 0.0745850979915059, -0.06798501786155005, -0.15670101110346527, 0.08278171638570105, 0.3647552015264869, -0.22960278773755435, -0.3593698903687939, 0.14249329833421476, -0.2753672989871433, -0.10605599655912468, 0.2077828324036873, -0.08138326343439359, 0.03785185282424052, 0.0896535705479603, 0.05400203344517297, -0.021056833871019382, -0.27678106711196004, 0.29280331984452745, 0.07565343548213282, 0.30781085236668987, 0.029505433619863564, 0.07209468953328968, -0.019411670949099766, -0.036901933277183545, 0.025249658567425344, -0.10070588505335255, 0.10229302867896535, 0.2569411104615097, 0.20471274833976022, 0.2749280919701422, -0.4734100941668755, -0.18127238116933092, 0.11636238690197809, 0.12767312848710163, 0.0653434069094909, -0.00901760634384431, -0.2524902791746201, 0.12010150238864063, -0.17831373168656262, -0.076716792812447, -0.10662700244355747, 0.0002967341645290294, 0.03406970857584442, -0.28786204063824267, -0.007700252147818294, 0.03412583997906236, 0.07540383256135649, -0.051381290012780294, -0.08642562939372335, -0.018306574117647665, 0.17639157525451493, 0.06740643430603868, -0.012646021147888225, 0.12899099138905845, -0.12275909226868421, -0.13221285655789117, 0.4057449210755607, 0.002667353120091076, -0.21296191304391351, 0.21683092613989907, -0.07616421208536674, -0.18361753959494131, 0.06681546881063892, 0.20154563204876036, 0.08000781874658079, -0.18126897546975942, 0.03914288795704613, -0.042255189069496685, 0.20785017233712458, 0.04570310857267149, 0.048761607598393195, 0.17037922169847955, 0.17391726267473992, 0.05661489107453274, 0.1079624312609354, -0.054061701558830756, -0.0855405922210525, -0.2632712877445644, -0.1374020435908679, -0.15771932130984923, -0.014593160978483377, -0.08197239481774221, -0.16426878188384988, 0.3791292401641527, 0.22808942350468808, 0.1954998315858995, 0.06312147169971653, 0.3164804717726124, 0.055770212237460925, 0.09212193285836087, 0.08588727211369382, 0.1745121700968343, 0.058284219149099564, 0.0902610909267609, -0.16384328451127775, 0.12890994957753368, -0.02206456190462084] |
1,802.08053 | On the Effects of Resistive and Reactive Loads on Signal Amplification | The effects of reactive loads into amplification is studied. A simplified
common emitter circuit configuration was adopted and respective
time-independent and time-dependent voltage and current equations were
obtained. As phasor analysis cannot be used because of the non-linearity, the
voltage at the capacitor was represented in terms of the respective integral,
implying a numerical approach. The effect of purely resistive loads was
investigated first, and it was shown that the fanned structure of the
transistor isolines can severely distort the amplification, especially for
$V_a$ small and $s$ large. The total harmonic distortion was found not to
depend on $V_a$, being determined by $s$ and the load resistance $R$. An
expression was obtained for the current gain in terms of the base current and
it was shown that it decreases in an almost perfectly linearly fashion with
$I_B$. Remarkably, no gain variation, and hence perfectly linear amplification,
is obtained when $R=0$, provided maximum power dissipation limits are not
exceeded. Capacitive loads imply the detachment of the circuit trajectory from
a straight line to an "ellipsoidal"-like loop. This implies a gain asymmetry
along upper or lower arcs of this loop. By using the time-dependent circuit
equations, it was possible to show numerically and by an analytical
approximation that, at least for the adopted circuit and parameter values, the
asymmetry induced by capacitive loads is not substantial. However, capacitive
loads will imply lag between the output voltage and current and, hence,
low-pass filtering. It was shown that smaller $V_a$ and larger $s$ can
substantially reduce the phase lag, but at the cost of severe distortion.
| eess.SP | the effects of reactive loads into amplification is studied a simplified common emitter circuit configuration was adopted and respective timeindependent and timedependent voltage and current equations were obtained as phasor analysis cannot be used because of the nonlinearity the voltage at the capacitor was represented in terms of the respective integral implying a numerical approach the effect of purely resistive loads was investigated first and it was shown that the fanned structure of the transistor isolines can severely distort the amplification especially for v_a small and s large the total harmonic distortion was found not to depend on v_a being determined by s and the load resistance r an expression was obtained for the current gain in terms of the base current and it was shown that it decreases in an almost perfectly linearly fashion with i_b remarkably no gain variation and hence perfectly linear amplification is obtained when r0 provided maximum power dissipation limits are not exceeded capacitive loads imply the detachment of the circuit trajectory from a straight line to an ellipsoidallike loop this implies a gain asymmetry along upper or lower arcs of this loop by using the timedependent circuit equations it was possible to show numerically and by an analytical approximation that at least for the adopted circuit and parameter values the asymmetry induced by capacitive loads is not substantial however capacitive loads will imply lag between the output voltage and current and hence lowpass filtering it was shown that smaller v_a and larger s can substantially reduce the phase lag but at the cost of severe distortion | [['the', 'effects', 'of', 'reactive', 'loads', 'into', 'amplification', 'is', 'studied', 'a', 'simplified', 'common', 'emitter', 'circuit', 'configuration', 'was', 'adopted', 'and', 'respective', 'timeindependent', 'and', 'timedependent', 'voltage', 'and', 'current', 'equations', 'were', 'obtained', 'as', 'phasor', 'analysis', 'can', 'not', 'be', 'used', 'because', 'of', 'the', 'nonlinearity', 'the', 'voltage', 'at', 'the', 'capacitor', 'was', 'represented', 'in', 'terms', 'of', 'the', 'respective', 'integral', 'implying', 'a', 'numerical', 'approach', 'the', 'effect', 'of', 'purely', 'resistive', 'loads', 'was', 'investigated', 'first', 'and', 'it', 'was', 'shown', 'that', 'the', 'fanned', 'structure', 'of', 'the', 'transistor', 'isolines', 'can', 'severely', 'distort', 'the', 'amplification', 'especially', 'for', 'v_a', 'small', 'and', 's', 'large', 'the', 'total', 'harmonic', 'distortion', 'was', 'found', 'not', 'to', 'depend', 'on', 'v_a', 'being', 'determined', 'by', 's', 'and', 'the', 'load', 'resistance', 'r', 'an', 'expression', 'was', 'obtained', 'for', 'the', 'current', 'gain', 'in', 'terms', 'of', 'the', 'base', 'current', 'and', 'it', 'was', 'shown', 'that', 'it', 'decreases', 'in', 'an', 'almost', 'perfectly', 'linearly', 'fashion', 'with', 'i_b', 'remarkably', 'no', 'gain', 'variation', 'and', 'hence', 'perfectly', 'linear', 'amplification', 'is', 'obtained', 'when', 'r0', 'provided', 'maximum', 'power', 'dissipation', 'limits', 'are', 'not', 'exceeded', 'capacitive', 'loads', 'imply', 'the', 'detachment', 'of', 'the', 'circuit', 'trajectory', 'from', 'a', 'straight', 'line', 'to', 'an', 'ellipsoidallike', 'loop', 'this', 'implies', 'a', 'gain', 'asymmetry', 'along', 'upper', 'or', 'lower', 'arcs', 'of', 'this', 'loop', 'by', 'using', 'the', 'timedependent', 'circuit', 'equations', 'it', 'was', 'possible', 'to', 'show', 'numerically', 'and', 'by', 'an', 'analytical', 'approximation', 'that', 'at', 'least', 'for', 'the', 'adopted', 'circuit', 'and', 'parameter', 'values', 'the', 'asymmetry', 'induced', 'by', 'capacitive', 'loads', 'is', 'not', 'substantial', 'however', 'capacitive', 'loads', 'will', 'imply', 'lag', 'between', 'the', 'output', 'voltage', 'and', 'current', 'and', 'hence', 'lowpass', 'filtering', 'it', 'was', 'shown', 'that', 'smaller', 'v_a', 'and', 'larger', 's', 'can', 'substantially', 'reduce', 'the', 'phase', 'lag', 'but', 'at', 'the', 'cost', 'of', 'severe', 'distortion']] | [-0.15729517980076782, 0.13297599907048196, -0.01643514910804908, 0.00935799911921001, -0.04580740786702885, -0.1749517714335608, 0.051517899945810325, 0.3745005589098928, -0.2603623922471623, -0.3090524675108549, 0.09311090075825217, -0.2499012736561124, -0.10845113506437963, 0.25624076207611046, -0.057639691141210925, 0.036923025082763614, 0.017731434294684816, 0.03192112465192539, -0.031009051702675823, -0.21058316992289483, 0.23051353411070874, 0.10444590800880904, 0.32438548430694203, 0.07063482150067169, 0.10321532910647217, -0.045133001840329895, -0.0007136608334523785, 0.09667210239994946, -0.08801285230464784, 0.03735342510190647, 0.20623164416375808, 0.056972956159169794, 0.22728802003904808, -0.45164024512754475, -0.2048965895087228, 0.07853672977628987, 0.12638970125270052, 0.09201697687558234, 0.006478115746719557, -0.23317831928554936, 0.09138179884713582, -0.15675543307790624, -0.08216586671143278, -0.02023055253306071, 0.0595083100767275, 0.04310244189693943, -0.2838442148315409, 0.06390893382477103, 0.05727559898292979, 0.032445251350198115, -0.03368889288923671, -0.11763387098695956, -0.07497541169802385, 0.09772330752800541, 0.028105123995930778, 0.03393856002577358, 0.16692961428576492, -0.09652682854227382, -0.05986165718579162, 0.33356001866209417, -0.060371420899283906, -0.18896469467320876, 0.11285251773408696, -0.1595768041496197, -0.010887227449636949, 0.16688810395671785, 0.11475670863493583, 0.058471411340887666, -0.15091012574042, 0.057448538267912394, 0.029248883326258156, 0.2006655435238083, 0.10995902283694382, -0.0320379333929141, 0.1752728317481795, 0.12376322936640252, 0.09102602195598454, 0.1501116713131831, -0.07669419747458137, -0.049690014909122476, -0.2998952136938053, -0.09377839695485203, -0.17429048889900908, 0.04944321080602302, -0.08337804688132561, -0.1463678326740367, 0.3674655013200703, 0.11197262084883543, 0.17999838371743437, 0.026594468274688483, 0.33713530654887963, 0.2217791610651476, 0.1035588471955503, 0.08470520330061818, 0.29604027175765923, 0.1405288018578373, 0.10999115837468791, -0.2654077953396953, 0.12413377919811543, 0.00914633242916245] |
1,802.08054 | VBALD - Variational Bayesian Approximation of Log Determinants | Evaluating the log determinant of a positive definite matrix is ubiquitous in
machine learning. Applications thereof range from Gaussian processes,
minimum-volume ellipsoids, metric learning, kernel learning, Bayesian neural
networks, Determinental Point Processes, Markov random fields to partition
functions of discrete graphical models. In order to avoid the canonical, yet
prohibitive, Cholesky $\mathcal{O}(n^{3})$ computational cost, we propose a
novel approach, with complexity $\mathcal{O}(n^{2})$, based on a constrained
variational Bayes algorithm. We compare our method to Taylor, Chebyshev and
Lanczos approaches and show state of the art performance on both synthetic and
real-world datasets.
| cs.LG cs.IT math.IT stat.ML | evaluating the log determinant of a positive definite matrix is ubiquitous in machine learning applications thereof range from gaussian processes minimumvolume ellipsoids metric learning kernel learning bayesian neural networks determinental point processes markov random fields to partition functions of discrete graphical models in order to avoid the canonical yet prohibitive cholesky mathcalon3 computational cost we propose a novel approach with complexity mathcalon2 based on a constrained variational bayes algorithm we compare our method to taylor chebyshev and lanczos approaches and show state of the art performance on both synthetic and realworld datasets | [['evaluating', 'the', 'log', 'determinant', 'of', 'a', 'positive', 'definite', 'matrix', 'is', 'ubiquitous', 'in', 'machine', 'learning', 'applications', 'thereof', 'range', 'from', 'gaussian', 'processes', 'minimumvolume', 'ellipsoids', 'metric', 'learning', 'kernel', 'learning', 'bayesian', 'neural', 'networks', 'determinental', 'point', 'processes', 'markov', 'random', 'fields', 'to', 'partition', 'functions', 'of', 'discrete', 'graphical', 'models', 'in', 'order', 'to', 'avoid', 'the', 'canonical', 'yet', 'prohibitive', 'cholesky', 'mathcalon3', 'computational', 'cost', 'we', 'propose', 'a', 'novel', 'approach', 'with', 'complexity', 'mathcalon2', 'based', 'on', 'a', 'constrained', 'variational', 'bayes', 'algorithm', 'we', 'compare', 'our', 'method', 'to', 'taylor', 'chebyshev', 'and', 'lanczos', 'approaches', 'and', 'show', 'state', 'of', 'the', 'art', 'performance', 'on', 'both', 'synthetic', 'and', 'realworld', 'datasets']] | [-0.04349853159637069, -0.008069588286478234, -0.07797290290624875, 0.11117204705015352, -0.1262430871391426, -0.1725927816207885, 0.07845929751688939, 0.4475414991054846, -0.2937832552352515, -0.2794578773091021, 0.08062646567629164, -0.23611624735792208, -0.2296419724032445, 0.16934001911937704, -0.08428398637182039, 0.18210310899935986, 0.11003456499589526, 0.00538295097446636, -0.13827187995459256, -0.2922092649842734, 0.292681046302238, 0.041513906467867935, 0.32203481713077053, -0.004093293961056549, 0.15856221249408048, -0.019943325258993908, -0.017511306267292442, -0.02793572925830908, -0.06161364737857619, 0.15946128378045218, 0.30581919494789356, 0.21933644411720984, 0.36477518489118665, -0.4065995414579368, -0.2164503101806116, 0.16331217404323348, 0.13284915307050812, 0.0684954008486428, -0.002193055300386218, -0.2910697217018384, 0.033116696364310846, -0.1629099094754328, -0.0217707614925609, -0.21536365235426827, -0.0679848532485978, -0.0003583257962220713, -0.32392713204329915, 0.0749686565351389, 0.022012731787981465, 0.06608094789755894, 0.009205464784906286, -0.22470376694716676, 0.07844136564982244, 0.025720304672849244, 0.003801314658789045, 0.026895720657194033, 0.1395615459743725, -0.1419729212420466, -0.2003364872994691, 0.318638609347703, -0.0674829473348876, -0.24151108436205465, 0.1916616489305971, -0.00729805275382798, -0.19243341622084542, 0.12099681300637515, 0.274077337402243, 0.16831228204840876, -0.12491467470586624, 0.13857562977468857, -0.002216905661676403, 0.13830153386104782, 0.012539821828755996, -0.06621530605733152, 0.08735604813251563, 0.19222746421987918, 0.03828567430964145, 0.1445910287970353, -0.06529801862400389, -0.17864263900454438, -0.20087238327276125, -0.13941632145408378, -0.28791919223073387, 0.021677115499345666, -0.2173868947677914, -0.24976269536368226, 0.33229753290019604, 0.1911541070971314, 0.19152750805749194, 0.1953213001884844, 0.3432773465452635, 0.09288131631531185, 0.05108048234377866, 0.14716878237263503, 0.0844291127236236, 0.14568523762990598, 0.08220653255652312, -0.17462330691658123, 0.05552843265468255, 0.11257204577565932] |
1,802.08055 | A Learning Based Approach for Uncertainty Analysis in Numerical Weather
Prediction Models | Complex numerical weather prediction models incorporate a variety of physical
processes, each described by multiple alternative physical schemes with
specific parameters. The selection of the physical schemes and the choice of
the corresponding physical parameters during model configuration can
significantly impact the accuracy of model forecasts. There is no combination
of physical schemes that works best for all times, at all locations, and under
all conditions. It is therefore of considerable interest to understand the
interplay between the choice of physics and the accuracy of the resulting
forecasts under different conditions. This paper demonstrates the use of
machine learning techniques to study the uncertainty in numerical weather
prediction models due to the interaction of multiple physical processes. The
first problem addressed herein is the estimation of systematic model errors in
output quantities of interest at future times, and the use of this information
to improve the model forecasts. The second problem considered is the
identification of those specific physical processes that contribute most to the
forecast uncertainty in the quantity of interest under specified meteorological
conditions.
The discrepancies between model results and observations at past times are
used to learn the relationships between the choice of physical processes and
the resulting forecast errors. Numerical experiments are carried out with the
Weather Research and Forecasting (WRF) model. The output quantity of interest
is the model precipitation, a variable that is both extremely important and
very challenging to forecast. The physical processes under consideration
include various micro-physics schemes, cumulus parameterizations, short wave,
and long wave radiation schemes. The experiments demonstrate the strong
potential of machine learning approaches to aid the study of model errors.
| cs.NA physics.ao-ph | complex numerical weather prediction models incorporate a variety of physical processes each described by multiple alternative physical schemes with specific parameters the selection of the physical schemes and the choice of the corresponding physical parameters during model configuration can significantly impact the accuracy of model forecasts there is no combination of physical schemes that works best for all times at all locations and under all conditions it is therefore of considerable interest to understand the interplay between the choice of physics and the accuracy of the resulting forecasts under different conditions this paper demonstrates the use of machine learning techniques to study the uncertainty in numerical weather prediction models due to the interaction of multiple physical processes the first problem addressed herein is the estimation of systematic model errors in output quantities of interest at future times and the use of this information to improve the model forecasts the second problem considered is the identification of those specific physical processes that contribute most to the forecast uncertainty in the quantity of interest under specified meteorological conditions the discrepancies between model results and observations at past times are used to learn the relationships between the choice of physical processes and the resulting forecast errors numerical experiments are carried out with the weather research and forecasting wrf model the output quantity of interest is the model precipitation a variable that is both extremely important and very challenging to forecast the physical processes under consideration include various microphysics schemes cumulus parameterizations short wave and long wave radiation schemes the experiments demonstrate the strong potential of machine learning approaches to aid the study of model errors | [['complex', 'numerical', 'weather', 'prediction', 'models', 'incorporate', 'a', 'variety', 'of', 'physical', 'processes', 'each', 'described', 'by', 'multiple', 'alternative', 'physical', 'schemes', 'with', 'specific', 'parameters', 'the', 'selection', 'of', 'the', 'physical', 'schemes', 'and', 'the', 'choice', 'of', 'the', 'corresponding', 'physical', 'parameters', 'during', 'model', 'configuration', 'can', 'significantly', 'impact', 'the', 'accuracy', 'of', 'model', 'forecasts', 'there', 'is', 'no', 'combination', 'of', 'physical', 'schemes', 'that', 'works', 'best', 'for', 'all', 'times', 'at', 'all', 'locations', 'and', 'under', 'all', 'conditions', 'it', 'is', 'therefore', 'of', 'considerable', 'interest', 'to', 'understand', 'the', 'interplay', 'between', 'the', 'choice', 'of', 'physics', 'and', 'the', 'accuracy', 'of', 'the', 'resulting', 'forecasts', 'under', 'different', 'conditions', 'this', 'paper', 'demonstrates', 'the', 'use', 'of', 'machine', 'learning', 'techniques', 'to', 'study', 'the', 'uncertainty', 'in', 'numerical', 'weather', 'prediction', 'models', 'due', 'to', 'the', 'interaction', 'of', 'multiple', 'physical', 'processes', 'the', 'first', 'problem', 'addressed', 'herein', 'is', 'the', 'estimation', 'of', 'systematic', 'model', 'errors', 'in', 'output', 'quantities', 'of', 'interest', 'at', 'future', 'times', 'and', 'the', 'use', 'of', 'this', 'information', 'to', 'improve', 'the', 'model', 'forecasts', 'the', 'second', 'problem', 'considered', 'is', 'the', 'identification', 'of', 'those', 'specific', 'physical', 'processes', 'that', 'contribute', 'most', 'to', 'the', 'forecast', 'uncertainty', 'in', 'the', 'quantity', 'of', 'interest', 'under', 'specified', 'meteorological', 'conditions', 'the', 'discrepancies', 'between', 'model', 'results', 'and', 'observations', 'at', 'past', 'times', 'are', 'used', 'to', 'learn', 'the', 'relationships', 'between', 'the', 'choice', 'of', 'physical', 'processes', 'and', 'the', 'resulting', 'forecast', 'errors', 'numerical', 'experiments', 'are', 'carried', 'out', 'with', 'the', 'weather', 'research', 'and', 'forecasting', 'wrf', 'model', 'the', 'output', 'quantity', 'of', 'interest', 'is', 'the', 'model', 'precipitation', 'a', 'variable', 'that', 'is', 'both', 'extremely', 'important', 'and', 'very', 'challenging', 'to', 'forecast', 'the', 'physical', 'processes', 'under', 'consideration', 'include', 'various', 'microphysics', 'schemes', 'cumulus', 'parameterizations', 'short', 'wave', 'and', 'long', 'wave', 'radiation', 'schemes', 'the', 'experiments', 'demonstrate', 'the', 'strong', 'potential', 'of', 'machine', 'learning', 'approaches', 'to', 'aid', 'the', 'study', 'of', 'model', 'errors']] | [-0.08696732675739707, 0.07661725904900403, -0.06761376552201588, 0.09078054230699575, -0.041560447751715614, -0.10617813924224773, 0.056472496508350185, 0.36969590061755087, -0.24975499810748528, -0.3319587912496097, 0.12248051232103642, -0.23084408363491307, -0.13919848614279864, 0.23826586185639506, -0.05134940947926439, 0.09657916589169284, 0.08446450256965096, 0.008421511108548763, -0.07838823129430453, -0.2556142419194015, 0.2918746815660544, 0.12500714812931085, 0.31297225285294084, 0.03844564699187793, 0.11497891347961045, -0.03727908549926189, -0.0829258888569551, -0.028328514704138368, -0.12185161281577701, 0.104119054878966, 0.2661004017313109, 0.15415012581284185, 0.3054812173359096, -0.4285154488761156, -0.30139573931656366, 0.10522421758693834, 0.05689844672194928, 0.07643067790537744, 0.018587906627919225, -0.2574779712321127, 0.019180243970314384, -0.16309070254186842, -0.09092909906073199, -0.07692016767139327, 0.0005354372329106007, 0.03270121951594346, -0.3156311287791194, 0.06033296729155529, 0.017996186441878843, 0.049275701144806054, -0.07428114661203888, -0.11187727331793319, -0.016831894011856467, 0.17749801264076, 0.10633476617187947, -0.01148290488473482, 0.13065349402484785, -0.15298155488220372, -0.11570640427217928, 0.42894586368792637, -0.026646370096440317, -0.22542171922567136, 0.2169062415153295, -0.10820277283303714, -0.14576064010821832, 0.09740734726758948, 0.21470459558836677, 0.07740124489646405, -0.17245134038453483, 0.026337206136652053, -0.0036237747246880593, 0.1428621655008208, 0.011800233909846558, 0.03252370760096442, 0.20796912091763636, 0.20008778593824794, 0.016452687004964578, 0.0672327093394843, -0.10213234453005819, -0.13349149880934205, -0.30460901802914175, -0.07918864211259301, -0.1248375856268788, -0.01796332212485568, -0.12031612818608504, -0.11972745428246366, 0.40600861047791753, 0.2707134976227441, 0.18691477868774467, -0.0008121149799348239, 0.31953751675866765, 0.08972239422762547, 0.03431951194686596, 0.032947396054891324, 0.22349064433750326, 0.09113671085480532, 0.09535788339631193, -0.21029430316208592, 0.1365547917820924, 0.0056558210370199315] |
1,802.08056 | Cyclic variations with twice the accretion disk precession period in the
old nova V603 Aquilae | A dense series of long and high time resolution light curves of the old nova
V603 Aql, covering 22 nights (19 of which are consecutive), are analyzed in
order to identify and characterize variations on the time scale of hours and
days. The well known 3.5 hour modulation, observed many times in the past and
considered to be due to a long lasting, albeit not entirely stable superhump,
is recovered at a period of 0.1453 days and an amplitude of 0.062 mag. Most
interesting, however, is the detection of highly significant brightness
variations with an amplitude of 0.050 mag and a period of 5.85 days which is to
a very high precision equal to twice the beat period between the orbital and
the superhump period. The latter is generally interpreted as the precession
period of an eccentric accretion disk. The origin of these long term variations
remains unknown.
| astro-ph.SR | a dense series of long and high time resolution light curves of the old nova v603 aql covering 22 nights 19 of which are consecutive are analyzed in order to identify and characterize variations on the time scale of hours and days the well known 35 hour modulation observed many times in the past and considered to be due to a long lasting albeit not entirely stable superhump is recovered at a period of 01453 days and an amplitude of 0062 mag most interesting however is the detection of highly significant brightness variations with an amplitude of 0050 mag and a period of 585 days which is to a very high precision equal to twice the beat period between the orbital and the superhump period the latter is generally interpreted as the precession period of an eccentric accretion disk the origin of these long term variations remains unknown | [['a', 'dense', 'series', 'of', 'long', 'and', 'high', 'time', 'resolution', 'light', 'curves', 'of', 'the', 'old', 'nova', 'v603', 'aql', 'covering', '22', 'nights', '19', 'of', 'which', 'are', 'consecutive', 'are', 'analyzed', 'in', 'order', 'to', 'identify', 'and', 'characterize', 'variations', 'on', 'the', 'time', 'scale', 'of', 'hours', 'and', 'days', 'the', 'well', 'known', '35', 'hour', 'modulation', 'observed', 'many', 'times', 'in', 'the', 'past', 'and', 'considered', 'to', 'be', 'due', 'to', 'a', 'long', 'lasting', 'albeit', 'not', 'entirely', 'stable', 'superhump', 'is', 'recovered', 'at', 'a', 'period', 'of', '01453', 'days', 'and', 'an', 'amplitude', 'of', '0062', 'mag', 'most', 'interesting', 'however', 'is', 'the', 'detection', 'of', 'highly', 'significant', 'brightness', 'variations', 'with', 'an', 'amplitude', 'of', '0050', 'mag', 'and', 'a', 'period', 'of', '585', 'days', 'which', 'is', 'to', 'a', 'very', 'high', 'precision', 'equal', 'to', 'twice', 'the', 'beat', 'period', 'between', 'the', 'orbital', 'and', 'the', 'superhump', 'period', 'the', 'latter', 'is', 'generally', 'interpreted', 'as', 'the', 'precession', 'period', 'of', 'an', 'eccentric', 'accretion', 'disk', 'the', 'origin', 'of', 'these', 'long', 'term', 'variations', 'remains', 'unknown']] | [-0.16254507536131915, 0.1655024611861342, -0.09236425901984885, 0.07093295236720012, -0.04464369245367695, -0.11181866269096175, 0.06224314882388326, 0.39618674886165833, -0.24770173267698942, -0.3686253860415447, 0.18831171931502516, -0.24116423098310244, -0.06700429099859023, 0.2291061886250466, -0.13479895067724343, 0.002158234468471183, 0.09563534893095493, 0.020306988574919246, -0.07193547281829425, -0.3073495630916132, 0.1504985696895897, 0.04250324549166118, 0.13490383970063358, -0.022431876428019838, 0.08718390503366079, -0.02555022648611695, -0.05713154502125096, -0.0863047909865878, -0.0803626601071078, 0.022286739662847145, 0.22271872893273578, 0.04679067888088068, 0.20568628254707674, -0.35155072456010344, -0.18379776979017318, 0.07235917298291132, 0.127894752573374, 0.01797044413563396, 0.053978022687662976, -0.23838518872907777, 0.07598518454596451, -0.16438444969909533, -0.16554356897946726, 0.039182959244820945, 0.20616229452813664, -0.015629966652217213, -0.22254248336036722, 0.15648617621647434, 0.022972695295838324, 0.139808727751429, -0.11440731460691056, -0.09365686671618297, -0.005645366336478769, 0.08951293039420734, 0.12864411882042479, 0.1249820515164966, 0.042443438990637156, -0.07278599377030975, -0.0822712771680054, 0.387163617008296, -0.1276503797378201, 0.021443925332278013, 0.20031066515109167, -0.19384025525757853, -0.07120118572750464, 0.2173156332459022, 0.14917759442239442, 0.12781120319597322, -0.13170867350877447, -0.04670016342404989, 0.029383912517413572, 0.29977986789910366, 0.14157002167000124, 0.08038948951162347, 0.3023942434830832, 0.15277280576121646, 0.023295625834804993, 0.02854786917716138, -0.2395116958345863, -0.07786280900037208, -0.2396232060150427, -0.06627092282956966, -0.12996418205831123, 0.09475500853013542, -0.10468673814322917, -0.14457864801203008, 0.4398164125856291, 0.05645570899898402, 0.2527103672440791, 0.029385896080464987, 0.25314990111759733, 0.13824261569015708, 0.08280188751378854, 0.0929515060151414, 0.30365898161429633, 0.1334808242386904, 0.12948670332972595, -0.20105856908707037, 0.10368649963112105, -0.041919879938418766] |
1,802.08057 | MagnifyMe: Aiding Cross Resolution Face Recognition via Identity Aware
Synthesis | Enhancing low resolution images via super-resolution or image synthesis for
cross-resolution face recognition has been well studied. Several image
processing and machine learning paradigms have been explored for addressing the
same. In this research, we propose Synthesis via Deep Sparse Representation
algorithm for synthesizing a high resolution face image from a low resolution
input image. The proposed algorithm learns multi-level sparse representation
for both high and low resolution gallery images, along with an identity aware
dictionary and a transformation function between the two representations for
face identification scenarios. With low resolution test data as input, the high
resolution test image is synthesized using the identity aware dictionary and
transformation which is then used for face recognition. The performance of the
proposed SDSR algorithm is evaluated on four databases, including one real
world dataset. Experimental results and comparison with existing seven
algorithms demonstrate the efficacy of the proposed algorithm in terms of both
face identification and image quality measures.
| cs.CV | enhancing low resolution images via superresolution or image synthesis for crossresolution face recognition has been well studied several image processing and machine learning paradigms have been explored for addressing the same in this research we propose synthesis via deep sparse representation algorithm for synthesizing a high resolution face image from a low resolution input image the proposed algorithm learns multilevel sparse representation for both high and low resolution gallery images along with an identity aware dictionary and a transformation function between the two representations for face identification scenarios with low resolution test data as input the high resolution test image is synthesized using the identity aware dictionary and transformation which is then used for face recognition the performance of the proposed sdsr algorithm is evaluated on four databases including one real world dataset experimental results and comparison with existing seven algorithms demonstrate the efficacy of the proposed algorithm in terms of both face identification and image quality measures | [['enhancing', 'low', 'resolution', 'images', 'via', 'superresolution', 'or', 'image', 'synthesis', 'for', 'crossresolution', 'face', 'recognition', 'has', 'been', 'well', 'studied', 'several', 'image', 'processing', 'and', 'machine', 'learning', 'paradigms', 'have', 'been', 'explored', 'for', 'addressing', 'the', 'same', 'in', 'this', 'research', 'we', 'propose', 'synthesis', 'via', 'deep', 'sparse', 'representation', 'algorithm', 'for', 'synthesizing', 'a', 'high', 'resolution', 'face', 'image', 'from', 'a', 'low', 'resolution', 'input', 'image', 'the', 'proposed', 'algorithm', 'learns', 'multilevel', 'sparse', 'representation', 'for', 'both', 'high', 'and', 'low', 'resolution', 'gallery', 'images', 'along', 'with', 'an', 'identity', 'aware', 'dictionary', 'and', 'a', 'transformation', 'function', 'between', 'the', 'two', 'representations', 'for', 'face', 'identification', 'scenarios', 'with', 'low', 'resolution', 'test', 'data', 'as', 'input', 'the', 'high', 'resolution', 'test', 'image', 'is', 'synthesized', 'using', 'the', 'identity', 'aware', 'dictionary', 'and', 'transformation', 'which', 'is', 'then', 'used', 'for', 'face', 'recognition', 'the', 'performance', 'of', 'the', 'proposed', 'sdsr', 'algorithm', 'is', 'evaluated', 'on', 'four', 'databases', 'including', 'one', 'real', 'world', 'dataset', 'experimental', 'results', 'and', 'comparison', 'with', 'existing', 'seven', 'algorithms', 'demonstrate', 'the', 'efficacy', 'of', 'the', 'proposed', 'algorithm', 'in', 'terms', 'of', 'both', 'face', 'identification', 'and', 'image', 'quality', 'measures']] | [-0.015294143264420712, -0.06565458409535588, -0.05430442628223831, 0.02499599612873191, -0.06446549286230062, -0.19138000301646593, -0.04544053122234077, 0.4883951129964911, -0.25874775420062435, -0.36948486464695096, 0.15822152931464073, -0.2556307806442372, -0.15664680706462464, 0.18385338751473823, -0.14003863797570842, 0.1392648421520463, 0.13559035961337101, 0.041349235763892725, -0.07990460110028298, -0.2622843222903052, 0.24992144871831465, 0.050339444974573176, 0.40838090150664824, 0.013067827467472317, 0.19796731461582778, -0.003385150512958017, -0.04270714186714031, -0.021600531593251687, -0.012235510745085776, 0.17244818439342988, 0.3300563921026575, 0.2606728113799666, 0.2720097200004742, -0.3771040071494495, -0.2061388884874013, 0.04848489248886322, 0.1585231239680583, 0.0958642177843453, -0.14752298206738673, -0.3381219236180186, 0.1323048029481493, -0.1307427372219256, 0.041514770190518066, -0.1482134604205688, -0.03155583520987047, -0.04445158345371079, -0.2833328610405517, 0.015988834574436155, 0.025664195314628813, 0.13464182614683148, -0.10572234152529675, -0.13907642148059005, 0.0724925700118407, 0.17824028820271054, -0.009224249896271011, 0.047822381662300385, 0.11725619579784763, -0.23075848242464977, -0.1542450210575062, 0.40093833948366153, -0.05120934879120726, -0.21734639811807144, 0.22836820737649807, -0.07491651004275833, -0.156755096031329, 0.14572770356869277, 0.19847533226204225, 0.11103956437466714, -0.12374193399834137, 0.03264087240975828, -0.032468727604748726, 0.17989931755194752, 0.1153583728756087, 0.014329446843849162, 0.1659176476457968, 0.24899594636726527, 0.0052656802447297825, 0.15602136287354648, -0.19816649926509947, 0.003757279987136523, -0.15784975371729487, -0.11293357542047325, -0.23315056096254969, -0.08006885019728006, -0.13052075277086353, -0.11526017839041276, 0.4081836395108929, 0.19593411715677342, 0.23787023337223592, 0.07103897583482859, 0.39986699240473217, 0.04753337699404279, 0.10947813528577964, 0.01824671074222678, 0.1389694705975648, 0.029516689498753596, 0.10937097715069309, -0.1831069020061897, 0.05613033123350201, 0.07998257271108929] |
1,802.08058 | Short time-scale optical variability properties of the largest AGN
sample observed with Kepler/K2 | We present the first short time-scale ($\sim$hours to days) optical
variability study of a large sample of Active Galactic Nuclei (AGN) observed
with the Kepler/K2 mission. The sample contains 252 AGN observed over four
campaigns with $\sim 30$ minute cadence selected from the Million Quasar
Catalogue with R magnitude $< 19$. We performed time series analysis to
determine their variability properties by means of the power spectral densities
(PSDs) and applied Monte Carlo techniques to find the best model parameters
that fit the observed power spectra. A power-law model is sufficient to
describe all the PSDs of our sample. A variety of power-law slopes were found
indicating that there is not a universal slope for all AGN. We find that the
rest-frame amplitude variability in the frequency range of
$6\times10^{-6}-10^{-4}$ Hz varies from $1-10$ % with an average of 1.7 %. We
explore correlations between the variability amplitude and key parameters of
the AGN, finding a significant correlation of rest-frame short-term variability
amplitude with redshift. We attribute this effect to the known "bluer when
brighter" variability of quasars combined with the fixed bandpass of Kepler
data. This study also enables us to distinguish between Seyferts and Blazars
and confirm AGN candidates. For our study we have compared results obtained
from light curves extracted using different aperture sizes and with and without
de-trending. We find that limited de-trending of the optimal photometric
precision light curve is the best approach, although some systematic effects
still remain present.
| astro-ph.HE astro-ph.GA | we present the first short timescale simhours to days optical variability study of a large sample of active galactic nuclei agn observed with the keplerk2 mission the sample contains 252 agn observed over four campaigns with sim 30 minute cadence selected from the million quasar catalogue with r magnitude 19 we performed time series analysis to determine their variability properties by means of the power spectral densities psds and applied monte carlo techniques to find the best model parameters that fit the observed power spectra a powerlaw model is sufficient to describe all the psds of our sample a variety of powerlaw slopes were found indicating that there is not a universal slope for all agn we find that the restframe amplitude variability in the frequency range of 6times106104 hz varies from 110 with an average of 17 we explore correlations between the variability amplitude and key parameters of the agn finding a significant correlation of restframe shortterm variability amplitude with redshift we attribute this effect to the known bluer when brighter variability of quasars combined with the fixed bandpass of kepler data this study also enables us to distinguish between seyferts and blazars and confirm agn candidates for our study we have compared results obtained from light curves extracted using different aperture sizes and with and without detrending we find that limited detrending of the optimal photometric precision light curve is the best approach although some systematic effects still remain present | [['we', 'present', 'the', 'first', 'short', 'timescale', 'simhours', 'to', 'days', 'optical', 'variability', 'study', 'of', 'a', 'large', 'sample', 'of', 'active', 'galactic', 'nuclei', 'agn', 'observed', 'with', 'the', 'keplerk2', 'mission', 'the', 'sample', 'contains', '252', 'agn', 'observed', 'over', 'four', 'campaigns', 'with', 'sim', '30', 'minute', 'cadence', 'selected', 'from', 'the', 'million', 'quasar', 'catalogue', 'with', 'r', 'magnitude', '19', 'we', 'performed', 'time', 'series', 'analysis', 'to', 'determine', 'their', 'variability', 'properties', 'by', 'means', 'of', 'the', 'power', 'spectral', 'densities', 'psds', 'and', 'applied', 'monte', 'carlo', 'techniques', 'to', 'find', 'the', 'best', 'model', 'parameters', 'that', 'fit', 'the', 'observed', 'power', 'spectra', 'a', 'powerlaw', 'model', 'is', 'sufficient', 'to', 'describe', 'all', 'the', 'psds', 'of', 'our', 'sample', 'a', 'variety', 'of', 'powerlaw', 'slopes', 'were', 'found', 'indicating', 'that', 'there', 'is', 'not', 'a', 'universal', 'slope', 'for', 'all', 'agn', 'we', 'find', 'that', 'the', 'restframe', 'amplitude', 'variability', 'in', 'the', 'frequency', 'range', 'of', '6times106104', 'hz', 'varies', 'from', '110', 'with', 'an', 'average', 'of', '17', 'we', 'explore', 'correlations', 'between', 'the', 'variability', 'amplitude', 'and', 'key', 'parameters', 'of', 'the', 'agn', 'finding', 'a', 'significant', 'correlation', 'of', 'restframe', 'shortterm', 'variability', 'amplitude', 'with', 'redshift', 'we', 'attribute', 'this', 'effect', 'to', 'the', 'known', 'bluer', 'when', 'brighter', 'variability', 'of', 'quasars', 'combined', 'with', 'the', 'fixed', 'bandpass', 'of', 'kepler', 'data', 'this', 'study', 'also', 'enables', 'us', 'to', 'distinguish', 'between', 'seyferts', 'and', 'blazars', 'and', 'confirm', 'agn', 'candidates', 'for', 'our', 'study', 'we', 'have', 'compared', 'results', 'obtained', 'from', 'light', 'curves', 'extracted', 'using', 'different', 'aperture', 'sizes', 'and', 'with', 'and', 'without', 'detrending', 'we', 'find', 'that', 'limited', 'detrending', 'of', 'the', 'optimal', 'photometric', 'precision', 'light', 'curve', 'is', 'the', 'best', 'approach', 'although', 'some', 'systematic', 'effects', 'still', 'remain', 'present']] | [-0.04814616604089679, 0.08749197525448835, -0.09562056712456979, 0.09775716802541864, -0.08222639238423048, -0.10181666608550585, 0.09581353964167647, 0.47475926377034433, -0.17497251040379827, -0.388501913632111, 0.05801196322766676, -0.3176537941287582, -0.05868744834442623, 0.2505132647774493, -0.0426108660409227, 0.019183096428848027, 0.04713804224447813, -0.09527369421363498, -0.04580890028876941, -0.2692570846503562, 0.2462331527841646, 0.061082346019490315, 0.2207076077659925, -0.0590664238591368, 0.08159377919752539, -0.036090494306214776, -0.12856001783608614, 0.0005755799977729718, -0.14706000650633844, 0.0512043972084939, 0.2383694011582217, 0.10875965158920735, 0.21807483197189867, -0.3020270454576348, -0.2291923584358301, 0.12976226736257862, 0.14995684396611372, 0.036275458478485234, -0.008065847664450605, -0.21816961196794485, 0.06592778454069048, -0.16300521563195314, -0.13664133782149293, -0.016043371606065192, 0.06756085765664466, 0.053471083000962004, -0.2160442026812234, 0.12884610437795346, -0.0038603535717508445, 0.14307593240325028, -0.1148740859508204, -0.10875202255216815, -0.0329884275100388, 0.09996147935999034, 0.0773609091716935, 0.0466796383310187, 0.11381863197554291, -0.09787627764926583, -0.08198373506675125, 0.37267910616938027, -0.06740867446739382, 0.005317896362006043, 0.16055715541976193, -0.21232757138592812, -0.13956467553216498, 0.17021072737600965, 0.18849014037671927, 0.10554815440264065, -0.14661148330178547, -0.029048798527704398, -0.0010932805358606855, 0.3113109762314707, -0.0012396040421056873, 0.07353659273358062, 0.22737354040921975, 0.12177597402672594, 0.006146232187165879, 0.13242751334085673, -0.2445602686998124, -0.006814986859293034, -0.2698714837572576, -0.022360107589823503, -0.12667751747236858, 0.08876574752848683, -0.14958812517106707, -0.11979193363610345, 0.44005754914833234, 0.165402337705018, 0.2303713335141462, 0.11464709590751833, 0.27336542071425357, 0.09110780258949186, 0.09225842795567588, 0.11294558893229502, 0.3166545800798, 0.09808567992101112, 0.07471300469042035, -0.23476346587946562, 0.04076296567412404, -0.032084382471900125] |
1,802.08059 | Cooper-pair splitting in two parallel InAs nanowires | We report on the fabrication and electrical characterization of an InAs
double - nanowire (NW) device consisting of two closely placed parallel NWs
coupled to a common superconducting electrode on one side and individual normal
metal leads on the other. In this new type of device we detect Cooper-pair
splitting (CPS) with a sizeable efficiency of correlated currents in both NWs.
In contrast to earlier experiments, where CPS was realized in a single NW,
demonstrating an intrawire electron pairing mediated by the superconductor
(SC), our experiment demonstrates an inter- wire interaction mediated by the
common SC. The latter is the key for the realization of zero-magnetic field
Majorana bound states, or Parafermions; in NWs and therefore constitutes a
milestone towards topological superconductivity. In addition, we observe
transport resonances that occur only in the superconducting state, which we
tentatively attribute to Andreev Bound states and/or Yu-Shiba resonances that
form in the proximitized section of one NW.
| cond-mat.mes-hall | we report on the fabrication and electrical characterization of an inas double nanowire nw device consisting of two closely placed parallel nws coupled to a common superconducting electrode on one side and individual normal metal leads on the other in this new type of device we detect cooperpair splitting cps with a sizeable efficiency of correlated currents in both nws in contrast to earlier experiments where cps was realized in a single nw demonstrating an intrawire electron pairing mediated by the superconductor sc our experiment demonstrates an inter wire interaction mediated by the common sc the latter is the key for the realization of zeromagnetic field majorana bound states or parafermions in nws and therefore constitutes a milestone towards topological superconductivity in addition we observe transport resonances that occur only in the superconducting state which we tentatively attribute to andreev bound states andor yushiba resonances that form in the proximitized section of one nw | [['we', 'report', 'on', 'the', 'fabrication', 'and', 'electrical', 'characterization', 'of', 'an', 'inas', 'double', 'nanowire', 'nw', 'device', 'consisting', 'of', 'two', 'closely', 'placed', 'parallel', 'nws', 'coupled', 'to', 'a', 'common', 'superconducting', 'electrode', 'on', 'one', 'side', 'and', 'individual', 'normal', 'metal', 'leads', 'on', 'the', 'other', 'in', 'this', 'new', 'type', 'of', 'device', 'we', 'detect', 'cooperpair', 'splitting', 'cps', 'with', 'a', 'sizeable', 'efficiency', 'of', 'correlated', 'currents', 'in', 'both', 'nws', 'in', 'contrast', 'to', 'earlier', 'experiments', 'where', 'cps', 'was', 'realized', 'in', 'a', 'single', 'nw', 'demonstrating', 'an', 'intrawire', 'electron', 'pairing', 'mediated', 'by', 'the', 'superconductor', 'sc', 'our', 'experiment', 'demonstrates', 'an', 'inter', 'wire', 'interaction', 'mediated', 'by', 'the', 'common', 'sc', 'the', 'latter', 'is', 'the', 'key', 'for', 'the', 'realization', 'of', 'zeromagnetic', 'field', 'majorana', 'bound', 'states', 'or', 'parafermions', 'in', 'nws', 'and', 'therefore', 'constitutes', 'a', 'milestone', 'towards', 'topological', 'superconductivity', 'in', 'addition', 'we', 'observe', 'transport', 'resonances', 'that', 'occur', 'only', 'in', 'the', 'superconducting', 'state', 'which', 'we', 'tentatively', 'attribute', 'to', 'andreev', 'bound', 'states', 'andor', 'yushiba', 'resonances', 'that', 'form', 'in', 'the', 'proximitized', 'section', 'of', 'one', 'nw']] | [-0.21683908975702174, 0.16601303837281497, -0.00821390424866847, -0.015598618881959542, -0.01794092767123206, -0.22305444102685631, 0.09256081961877523, 0.3779215761612541, -0.2002925231742362, -0.2948188035828031, -0.0433732848431842, -0.30596121779210816, -0.10410834175650201, 0.2033725054523743, 0.0007756420086628531, -0.011080397719066907, -3.687130877735958e-05, -0.014749694171245971, -0.05739624473248042, -0.19731160255492927, 0.311420024190025, 0.00943696029557317, 0.35162275773320906, 0.10986407187895156, 0.009968140987326311, -0.014040791864805167, 0.09477975836261084, -0.029030865161783166, -0.10719987059826583, 0.09840022441185402, 0.26571422361873787, -0.0939054585037619, 0.18113193405926034, -0.4877114514485488, -0.15796004272495195, -0.006924847031340879, 0.18357869628451617, 0.12107145310808703, -0.09014747899369599, -0.30348399907861856, 0.050968493939091274, -0.15408608367289203, -0.09733729236424456, 0.020874062257824965, -0.03272661161258987, -0.04368854393220805, -0.22744666783175632, 0.05634854174693864, 0.07842301710027885, 0.015270387668625202, -0.014667820929567896, -0.10468903780166133, -0.027988947451638144, 0.0229510639845911, -0.03452564182606057, 0.021239554908223986, 0.17299877470598884, -0.12327473766696974, -0.16907146553283717, 0.2909715186368546, -0.07960783002374608, -0.11416630474911406, 0.17096918555025278, -0.1542934284429827, -0.06553734983834955, 0.11820335752860296, 0.12541124548495206, 0.08517339712562758, -0.13568946588906197, 0.04106467561031619, -0.012488993481288548, 0.17420757249046384, 0.05066963376970414, 0.10676452880907877, 0.2518921099493609, 0.24794368451351628, 0.060960556402516373, 0.155668787737727, -0.14014263821954479, -0.04454857115085949, -0.27364629992813455, -0.24106033467702884, -0.18968540236499964, 0.061407236288396, -0.0036391854599868464, -0.20034427629187215, 0.4144439893071631, 0.11549192537352734, 0.19029674538733815, -0.09484539666057874, 0.2568971971689048, 0.09902257925231205, 0.11780120990866053, 0.00819767240033138, 0.2510192835217667, 0.1731032250674283, 0.047692164450007325, -0.29960539857887364, 0.0753864665383327, -0.03533421748080382] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.