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.0846 | The envelope of the power spectra of over a thousand \delta Scuti stars.
The $\bar{T}_{eff}$-$\nu_{max}$ scaling relation | CoRoT and Kepler high-precision photometric data allowed the detection and
characterization of the oscillation parameters in stars other than the Sun.
Moreover, thanks to the scaling relations, it is possible to estimate masses
and radii for thousands of solar-type oscillating stars. Recently, a \Delta\nu
- \rho relation has been found for \delta Scuti stars. Now, analyzing several
hundreds of this kind of stars observed with CoRoT and Kepler, we present an
empiric relation between their frequency at maximum power of their oscillation
spectra and their effective temperature. Such a relation can be explained with
the help of the \kappa-mechanism and the observed dispersion of the residuals
is compatible with they being caused by the gravity-darkening effect.
| astro-ph.SR | corot and kepler highprecision photometric data allowed the detection and characterization of the oscillation parameters in stars other than the sun moreover thanks to the scaling relations it is possible to estimate masses and radii for thousands of solartype oscillating stars recently a deltanu rho relation has been found for delta scuti stars now analyzing several hundreds of this kind of stars observed with corot and kepler we present an empiric relation between their frequency at maximum power of their oscillation spectra and their effective temperature such a relation can be explained with the help of the kappamechanism and the observed dispersion of the residuals is compatible with they being caused by the gravitydarkening effect | [['corot', 'and', 'kepler', 'highprecision', 'photometric', 'data', 'allowed', 'the', 'detection', 'and', 'characterization', 'of', 'the', 'oscillation', 'parameters', 'in', 'stars', 'other', 'than', 'the', 'sun', 'moreover', 'thanks', 'to', 'the', 'scaling', 'relations', 'it', 'is', 'possible', 'to', 'estimate', 'masses', 'and', 'radii', 'for', 'thousands', 'of', 'solartype', 'oscillating', 'stars', 'recently', 'a', 'deltanu', 'rho', 'relation', 'has', 'been', 'found', 'for', 'delta', 'scuti', 'stars', 'now', 'analyzing', 'several', 'hundreds', 'of', 'this', 'kind', 'of', 'stars', 'observed', 'with', 'corot', 'and', 'kepler', 'we', 'present', 'an', 'empiric', 'relation', 'between', 'their', 'frequency', 'at', 'maximum', 'power', 'of', 'their', 'oscillation', 'spectra', 'and', 'their', 'effective', 'temperature', 'such', 'a', 'relation', 'can', 'be', 'explained', 'with', 'the', 'help', 'of', 'the', 'kappamechanism', 'and', 'the', 'observed', 'dispersion', 'of', 'the', 'residuals', 'is', 'compatible', 'with', 'they', 'being', 'caused', 'by', 'the', 'gravitydarkening', 'effect']] | [-0.09942071518010419, 0.20360344336684488, -0.0894125677034026, 0.09350189064356053, -0.15951052538078764, -0.06352332879829665, 0.10936200724226301, 0.3478947276978389, -0.22042957981238548, -0.4029621920345918, 0.07119507868470543, -0.33084561253047506, -0.06665390859530104, 0.2828301690518856, -0.05146757281668808, 0.07388892121127118, 0.09074342353269457, 0.04047316285255163, -0.04379649422809725, -0.22167362571167556, 0.2709914882869824, 0.046498733329708164, 0.14974856015861682, -0.06600063477602341, 0.01219171658664456, -0.10841315428361945, -0.08185561155222114, -0.0041664338346732695, -0.15674576109842114, 0.06421314016713396, 0.20625310889843843, 0.132028626308412, 0.19607813949494257, -0.31397911895714375, -0.22424368655875973, 0.11008476673463441, 0.18595761818021697, 0.03743558994939794, -0.03499512985024763, -0.2847079431233199, 0.07391059506259373, -0.16329283347839246, -0.18807514828994223, -0.056293953040047834, 0.09937259877181571, 0.06469937752446403, -0.24235906640634589, 0.10433600154862253, 0.020171022156010503, 0.148372982725825, -0.10991915802916755, -0.1264711875549477, -0.05897635811858851, 0.12736959526234348, 0.0647639719242959, 0.023874947635213965, 0.03297642395305245, -0.09309572658258612, -0.015374609904930643, 0.39658726599553357, -0.08734598463950376, -0.058292504181356536, 0.17310157978107504, -0.20793968153631556, -0.11973454900409865, 0.058672720693942644, 0.12407072933147782, 0.11547937647884955, -0.19046396371280855, -0.0029564247335023856, 0.044344304996016236, 0.1886870621551719, 0.11891137425504301, 0.07291752353472554, 0.3107538016593975, 0.1562250056627976, 0.0022446407086175423, 0.050220434348929026, -0.22710186955316558, -0.015292332382649994, -0.21202869539189598, -0.07397590938186192, -0.13327792695440027, 0.009569948806386928, -0.11866902821499895, -0.10348284986356031, 0.3943325080058497, 0.10823929211448716, 0.20492426420197538, 0.04711250167582994, 0.28986936629466387, 0.1582537942768439, 0.14868023669468644, 0.0669947542331141, 0.34700152107069027, 0.2194985854095253, 0.10747211499382621, -0.28867180714302737, 0.06734648519803, -0.0329339056842677] |
1,802.08461 | A projector-based convergence proof of the Ginelli algorithm for
covariant Lyapunov vectors | Linear perturbations of solutions of dynamical systems exhibit different
asymptotic growth rates, which are naturally characterized by so-called
covariant Lyapunov vectors (CLVs). Due to an increased interest of CLVs in
applications, several algorithms were developed to compute them. The Ginelli
algorithm is among the most commonly used. Although several properties of the
algorithm have been analyzed, there exists no mathematically rigorous
convergence proof yet. In this article we extend existing approaches in order
to construct a projector-based convergence proof of Ginelli's algorithm. One of
the main ingredients will be an asymptotic characterization of CLVs via the
Multiplicative Ergodic Theorem. In the proof, we keep a rather general setting
allowing even for degenerate Lyapunov spectra.
| math.DS | linear perturbations of solutions of dynamical systems exhibit different asymptotic growth rates which are naturally characterized by socalled covariant lyapunov vectors clvs due to an increased interest of clvs in applications several algorithms were developed to compute them the ginelli algorithm is among the most commonly used although several properties of the algorithm have been analyzed there exists no mathematically rigorous convergence proof yet in this article we extend existing approaches in order to construct a projectorbased convergence proof of ginellis algorithm one of the main ingredients will be an asymptotic characterization of clvs via the multiplicative ergodic theorem in the proof we keep a rather general setting allowing even for degenerate lyapunov spectra | [['linear', 'perturbations', 'of', 'solutions', 'of', 'dynamical', 'systems', 'exhibit', 'different', 'asymptotic', 'growth', 'rates', 'which', 'are', 'naturally', 'characterized', 'by', 'socalled', 'covariant', 'lyapunov', 'vectors', 'clvs', 'due', 'to', 'an', 'increased', 'interest', 'of', 'clvs', 'in', 'applications', 'several', 'algorithms', 'were', 'developed', 'to', 'compute', 'them', 'the', 'ginelli', 'algorithm', 'is', 'among', 'the', 'most', 'commonly', 'used', 'although', 'several', 'properties', 'of', 'the', 'algorithm', 'have', 'been', 'analyzed', 'there', 'exists', 'no', 'mathematically', 'rigorous', 'convergence', 'proof', 'yet', 'in', 'this', 'article', 'we', 'extend', 'existing', 'approaches', 'in', 'order', 'to', 'construct', 'a', 'projectorbased', 'convergence', 'proof', 'of', 'ginellis', 'algorithm', 'one', 'of', 'the', 'main', 'ingredients', 'will', 'be', 'an', 'asymptotic', 'characterization', 'of', 'clvs', 'via', 'the', 'multiplicative', 'ergodic', 'theorem', 'in', 'the', 'proof', 'we', 'keep', 'a', 'rather', 'general', 'setting', 'allowing', 'even', 'for', 'degenerate', 'lyapunov', 'spectra']] | [-0.13431809664151706, 0.06460453109816747, -0.14223804405016774, 0.11168681516773603, -0.05130804325165474, -0.1417206146530766, 0.009275052269953675, 0.3265578876583285, -0.2557767257887656, -0.23020359316626482, 0.14160865517250731, -0.22066156565318856, -0.1971224574784262, 0.24212339360563628, -0.0964301154511956, 0.09998334974433765, 0.01404022584067641, 0.018631600000096105, -0.0700632407911023, -0.2739753715850545, 0.2955688316214302, 0.016470302244549435, 0.26166159452755106, 0.010743876272169627, 0.08349384165954142, -0.03319633879031228, -0.06661176727260504, 0.01651168184404352, -0.17641250813890874, 0.12368887273462868, 0.2927511257898069, 0.12197921261092466, 0.32313330718769434, -0.3839889203849356, -0.15841386624636639, 0.1507346309882185, 0.18845795101972412, 0.13088439552801603, -0.04312875343948207, -0.23769573421646073, 0.12434226875317043, -0.16248894106201103, -0.16944180558790015, -0.151789030937923, -0.004683601414471601, 0.036860327527392656, -0.25447412185469825, 0.06198834388854757, 0.11615533262271789, 0.07152404500979238, -0.05076030714528025, -0.0880884291033417, 0.017245890696294012, 0.10068471327555918, 0.09726963784603353, -0.025147712777113227, 0.0849558509478296, -0.03415253186656113, -0.14917325273782542, 0.33230095792693637, -0.0367132446839911, -0.2106546679330347, 0.22240990623254822, -0.09138680920334516, -0.1776918299244799, 0.16077593129655693, 0.16494488049776548, 0.14415180121457813, -0.18690698110061674, 0.10388852410694271, -0.027382092624573053, 0.12649696223866358, 0.09449208180411858, 0.08347622256219156, 0.11611152301023228, 0.11649901129972948, 0.1138582635048645, 0.12158315095420004, 0.02841649692174896, -0.14163610587242695, -0.25479921157084473, -0.12758252904874035, -0.17409043255534057, 0.031235763174687736, -0.09435194188860797, -0.19107025736464864, 0.39417663028678007, 0.14199915262705654, 0.16137697296299502, 0.0979821934267895, 0.2834421303566232, 0.1428739819552057, 0.039209791545681986, 0.10286213818265834, 0.2651229215213056, 0.19791675518489385, 0.07528815061097091, -0.1469500550744742, 0.09185318145035576, 0.1490388526375183] |
1,802.08462 | Group-velocity-controlled and gate-tunable directional excitation of
polaritons in graphene-boron nitride heterostructures | A fundamental building block in nano-photonics is the ability to
directionally excite highly squeezed optical mode dynamically, particularly
with an electrical bias. Such capabilities would enable the active manipulation
of light propagation for information processing and transfer. However, when the
optical source is built-in, it remains challenging to steer the excitation
directionality in a flexible way. Here, we reveal a novel mechanism for tunable
directional excitation of highly squeezed polaritons in graphene-hexagonal
boron nitride (hBN) heterostructures. The effect relies on controlling the sign
of the group velocity of the coupled plasmon-phonon polaritons, which can be
flipped by simply tuning the chemical potential of graphene (through
electrostatic gating) in the heterostructures. Graphene-hBN heterostructure
thus present a promising platform toward nano-photonic circuits and
nano-devices with electrically reconfigurable functionalities.
| physics.optics | a fundamental building block in nanophotonics is the ability to directionally excite highly squeezed optical mode dynamically particularly with an electrical bias such capabilities would enable the active manipulation of light propagation for information processing and transfer however when the optical source is builtin it remains challenging to steer the excitation directionality in a flexible way here we reveal a novel mechanism for tunable directional excitation of highly squeezed polaritons in graphenehexagonal boron nitride hbn heterostructures the effect relies on controlling the sign of the group velocity of the coupled plasmonphonon polaritons which can be flipped by simply tuning the chemical potential of graphene through electrostatic gating in the heterostructures graphenehbn heterostructure thus present a promising platform toward nanophotonic circuits and nanodevices with electrically reconfigurable functionalities | [['a', 'fundamental', 'building', 'block', 'in', 'nanophotonics', 'is', 'the', 'ability', 'to', 'directionally', 'excite', 'highly', 'squeezed', 'optical', 'mode', 'dynamically', 'particularly', 'with', 'an', 'electrical', 'bias', 'such', 'capabilities', 'would', 'enable', 'the', 'active', 'manipulation', 'of', 'light', 'propagation', 'for', 'information', 'processing', 'and', 'transfer', 'however', 'when', 'the', 'optical', 'source', 'is', 'builtin', 'it', 'remains', 'challenging', 'to', 'steer', 'the', 'excitation', 'directionality', 'in', 'a', 'flexible', 'way', 'here', 'we', 'reveal', 'a', 'novel', 'mechanism', 'for', 'tunable', 'directional', 'excitation', 'of', 'highly', 'squeezed', 'polaritons', 'in', 'graphenehexagonal', 'boron', 'nitride', 'hbn', 'heterostructures', 'the', 'effect', 'relies', 'on', 'controlling', 'the', 'sign', 'of', 'the', 'group', 'velocity', 'of', 'the', 'coupled', 'plasmonphonon', 'polaritons', 'which', 'can', 'be', 'flipped', 'by', 'simply', 'tuning', 'the', 'chemical', 'potential', 'of', 'graphene', 'through', 'electrostatic', 'gating', 'in', 'the', 'heterostructures', 'graphenehbn', 'heterostructure', 'thus', 'present', 'a', 'promising', 'platform', 'toward', 'nanophotonic', 'circuits', 'and', 'nanodevices', 'with', 'electrically', 'reconfigurable', 'functionalities']] | [-0.17409712790385895, 0.18983366827968792, -0.0427652353509551, -0.07271065359005689, -0.11342871407904322, -0.24263726679667358, 0.06329184137691285, 0.5043825410557763, -0.29907643011519836, -0.296908813321756, -0.012352410596721465, -0.24369405310911438, -0.1938978908140035, 0.2711428812453671, 0.014374689723823279, 0.06279672619827564, 0.0071504756305662415, -0.142682462197078, 0.03722217133534806, -0.12259927878842554, 0.22108480968468247, 0.0661200143522509, 0.3876798083074391, 0.11088942462534067, 0.09195262122721899, 0.012290163967196666, 0.10063573470087869, -0.08249814506058419, -0.061329607000862735, 0.1747550149596045, 0.26183120341646293, -0.06997714348928263, 0.28038327303522875, -0.48313761351718787, -0.24353762119749767, 0.011837909426835795, 0.18855127645656466, 0.19465272896461158, -0.16313363552658952, -0.2912766467336388, 0.0329361685416809, -0.12185286067699688, -0.12756560227301503, -0.10177448825792425, -0.013605481261269205, 0.018339665350689007, -0.21518425229522917, 0.006873907954690771, 0.01951600487587885, 0.010922610018742345, -0.018852492881244017, -0.04849097824522427, -0.07535850985847886, 0.07204710447995384, -0.08581529894385427, 0.0053056449257946085, 0.2559651420377786, -0.16039079307423285, -0.12192588418884764, 0.37729681634329376, -0.05884248742072414, -0.18776069426288208, 0.16491166876614213, -0.09192931704063316, -0.030501423893304215, 0.09417990210007816, 0.19339285518914934, 0.11459920838076089, -0.17938717827812994, 0.037409884902271665, 0.05186257133304718, 0.20682815387512424, 0.08092789791731371, 0.1698674733735739, 0.34591368519301924, 0.24389174873460204, 0.08329842687355325, 0.1549675372634305, -0.06961078922696677, 0.02149126612551747, -0.18448998522944748, -0.18617803552594508, -0.20866959606041385, 0.07835916131697891, -0.06573427079540183, -0.21166490390527223, 0.43428054448985864, 0.14743061688551234, 0.10997078406609713, -0.06292248528489071, 0.33407611433520085, 0.07230129820989474, 0.13892047755449774, 0.0031278856072781813, 0.29085194864975555, 0.16928186313441348, 0.10348036098811361, -0.2598333364936508, 0.06048132326765289, -0.07376387285526902] |
1,802.08463 | Multi-RATs Support to Improve V2X Communication | As the next generation of wireless system targets at providing a wider range
of services with divergent QoS requirements, new applications will be enabled
by the fifth generation (5G) network. Among the emerging applications,
vehicle-to-everything (V2X) communication is an important use case targeted by
5G to enable an improved traffic safety and traffic efficiency. Since the V2X
communication requires a low end-to-end (E2E) latency and an ultra-high
reliability, the legacy cellular networks can not meet the service requirement.
In this work, we inspect on the system performance of applying the LTE-Uu and
PC5 interfaces to enable the V2X communication. With the LTE-Uu interface, one
V2X data packet is transmitted through the cellular network infrastructure,
while the PC5 interface facilitates the direct V2X communication without
involving the network infrastructure in user-plane. In addition, due to the
high reliability requirement, the application of a single V2X transmission
technology can not meet the targets in some scenarios. Therefore, we also
propose a multi-radio access technologies (multi-RATs) scheme where the data
packet travels through both the LTE-Uu and PC5 interfaces to obtain a diversity
gain. Last but not least, in order to derive the system performance, a system
level simulator is implemented in this work. The numerical results provide us
insights on how the different technologies will perform in different scenarios
and also validate the proposed multi-RATs scheme.
| cs.NI | as the next generation of wireless system targets at providing a wider range of services with divergent qos requirements new applications will be enabled by the fifth generation 5g network among the emerging applications vehicletoeverything v2x communication is an important use case targeted by 5g to enable an improved traffic safety and traffic efficiency since the v2x communication requires a low endtoend e2e latency and an ultrahigh reliability the legacy cellular networks can not meet the service requirement in this work we inspect on the system performance of applying the lteuu and pc5 interfaces to enable the v2x communication with the lteuu interface one v2x data packet is transmitted through the cellular network infrastructure while the pc5 interface facilitates the direct v2x communication without involving the network infrastructure in userplane in addition due to the high reliability requirement the application of a single v2x transmission technology can not meet the targets in some scenarios therefore we also propose a multiradio access technologies multirats scheme where the data packet travels through both the lteuu and pc5 interfaces to obtain a diversity gain last but not least in order to derive the system performance a system level simulator is implemented in this work the numerical results provide us insights on how the different technologies will perform in different scenarios and also validate the proposed multirats scheme | [['as', 'the', 'next', 'generation', 'of', 'wireless', 'system', 'targets', 'at', 'providing', 'a', 'wider', 'range', 'of', 'services', 'with', 'divergent', 'qos', 'requirements', 'new', 'applications', 'will', 'be', 'enabled', 'by', 'the', 'fifth', 'generation', '5g', 'network', 'among', 'the', 'emerging', 'applications', 'vehicletoeverything', 'v2x', 'communication', 'is', 'an', 'important', 'use', 'case', 'targeted', 'by', '5g', 'to', 'enable', 'an', 'improved', 'traffic', 'safety', 'and', 'traffic', 'efficiency', 'since', 'the', 'v2x', 'communication', 'requires', 'a', 'low', 'endtoend', 'e2e', 'latency', 'and', 'an', 'ultrahigh', 'reliability', 'the', 'legacy', 'cellular', 'networks', 'can', 'not', 'meet', 'the', 'service', 'requirement', 'in', 'this', 'work', 'we', 'inspect', 'on', 'the', 'system', 'performance', 'of', 'applying', 'the', 'lteuu', 'and', 'pc5', 'interfaces', 'to', 'enable', 'the', 'v2x', 'communication', 'with', 'the', 'lteuu', 'interface', 'one', 'v2x', 'data', 'packet', 'is', 'transmitted', 'through', 'the', 'cellular', 'network', 'infrastructure', 'while', 'the', 'pc5', 'interface', 'facilitates', 'the', 'direct', 'v2x', 'communication', 'without', 'involving', 'the', 'network', 'infrastructure', 'in', 'userplane', 'in', 'addition', 'due', 'to', 'the', 'high', 'reliability', 'requirement', 'the', 'application', 'of', 'a', 'single', 'v2x', 'transmission', 'technology', 'can', 'not', 'meet', 'the', 'targets', 'in', 'some', 'scenarios', 'therefore', 'we', 'also', 'propose', 'a', 'multiradio', 'access', 'technologies', 'multirats', 'scheme', 'where', 'the', 'data', 'packet', 'travels', 'through', 'both', 'the', 'lteuu', 'and', 'pc5', 'interfaces', 'to', 'obtain', 'a', 'diversity', 'gain', 'last', 'but', 'not', 'least', 'in', 'order', 'to', 'derive', 'the', 'system', 'performance', 'a', 'system', 'level', 'simulator', 'is', 'implemented', 'in', 'this', 'work', 'the', 'numerical', 'results', 'provide', 'us', 'insights', 'on', 'how', 'the', 'different', 'technologies', 'will', 'perform', 'in', 'different', 'scenarios', 'and', 'also', 'validate', 'the', 'proposed', 'multirats', 'scheme']] | [-0.24276792535228411, 0.019685541624879368, -0.003967759109649289, 0.001034062836557259, -0.06605855048416942, -0.19634526496494165, 0.10255467538845062, 0.3620143991648616, -0.24633636741873896, -0.3003027325938769, 0.11905134036759073, -0.2396315493508171, -0.17016080430199312, 0.22537114784735435, -0.10205744302543424, 0.09082340136287324, 0.07422598572594068, -0.0018069854144773325, 0.006633431089372737, -0.256267293106823, 0.26326280407766256, 0.12320966540205171, 0.39001392678361835, 0.13697594816424788, 0.04333170024665582, 0.008387267176111985, -0.009863731673722377, -0.08821781347098556, -0.08341697147512817, 0.14499650163066494, 0.32573571903088167, 0.20609687705578558, 0.3039374246926051, -0.48545422444262043, -0.2826139008983418, 0.0660136278693652, 0.18329447103589105, 0.049443549619603386, -0.04947364938339937, -0.2902262912626742, 0.1141468779692393, -0.26669263943294774, -0.10212959012960506, -0.027515342486228778, -0.07696014142808225, 0.05846595769980922, -0.2887860121927955, -0.05822761871746528, -0.053204740662829354, 0.03314530529131937, -0.023325267245245453, -0.0016204503264628987, -0.008114209393406863, 0.2112282555625511, -0.01897563271312202, 0.007231594102625263, 0.10372183448896062, -0.15286071622126104, -0.12200747419048452, 0.4220850569083284, 0.000466168345987897, -0.1842912609246246, 0.20930459578584196, -0.04815505708216986, -0.1250625104098393, 0.12671433047980338, 0.25870388366215163, 0.023348188884932165, -0.22091154549939082, 0.029176424400366198, 0.06274161745497597, 0.1757535075313608, 0.04301283201683029, 0.1123177414267186, 0.18353259711601508, 0.25513091720557135, 0.14067023560705474, 0.09994016354329333, -0.09475536707939054, -0.06586916119929387, -0.21587014983871727, -0.17731549655768034, -0.1686422642687912, -0.010818909539231893, -0.06244131646046233, -0.06561906877571023, 0.3662046707004469, 0.20306167576875486, 0.098922006366148, 0.08194943206100787, 0.4070929986980197, 0.07438698506991341, 0.12063998869524208, 0.11139710239581596, 0.19887755446529096, 0.027742879517426537, 0.24231518774644176, -0.15230010349654297, 0.07846623200520188, -0.02326605386296997] |
1,802.08464 | The geometry of off-the-grid compressed sensing | This paper presents a sharp geometric analysis of the recovery performance of
sparse regularization. More specifically, we analyze the BLASSO method which
estimates a sparse measure (sum of Dirac masses) from randomized sub-sampled
measurements. This is a "continuous", often called off-the-grid, extension of
the compressed sensing problem, where the $\ell^1$ norm is replaced by the
total variation of measures. This extension is appealing from a numerical
perspective because it avoids to discretize the the space by some grid. But
more importantly, it makes explicit the geometry of the problem since the
positions of the Diracs can now freely move over the parameter space. On a
methodological level, our contribution is to propose the Fisher geodesic
distance on this parameter space as the canonical metric to analyze
super-resolution in a way which is invariant to reparameterization of this
space. Switching to the Fisher metric allows us to take into account
measurement operators which are not translation invariant, which is crucial for
applications such as Laplace inversion in imaging, Gaussian mixtures estimation
and training of multilayer perceptrons with one hidden layer. On a theoretical
level, our main contribution shows that if the Fisher distance between spikes
is larger than a Rayleigh separation constant, then the BLASSO recovers in a
stable way a stream of Diracs, provided that the number of measurements is
proportional (up to log factors) to the number of Diracs. We measure the
stability using an optimal transport distance constructed on top of the Fisher
geodesic distance. Our result is (up to log factor) sharp and does not require
any randomness assumption on the amplitudes of the underlying measure. Our
proof technique relies on an infinite-dimensional extension of the so-called
"golfing scheme" which operates over the space of measures and is of general
interest.
| cs.IT math.IT | this paper presents a sharp geometric analysis of the recovery performance of sparse regularization more specifically we analyze the blasso method which estimates a sparse measure sum of dirac masses from randomized subsampled measurements this is a continuous often called offthegrid extension of the compressed sensing problem where the ell1 norm is replaced by the total variation of measures this extension is appealing from a numerical perspective because it avoids to discretize the the space by some grid but more importantly it makes explicit the geometry of the problem since the positions of the diracs can now freely move over the parameter space on a methodological level our contribution is to propose the fisher geodesic distance on this parameter space as the canonical metric to analyze superresolution in a way which is invariant to reparameterization of this space switching to the fisher metric allows us to take into account measurement operators which are not translation invariant which is crucial for applications such as laplace inversion in imaging gaussian mixtures estimation and training of multilayer perceptrons with one hidden layer on a theoretical level our main contribution shows that if the fisher distance between spikes is larger than a rayleigh separation constant then the blasso recovers in a stable way a stream of diracs provided that the number of measurements is proportional up to log factors to the number of diracs we measure the stability using an optimal transport distance constructed on top of the fisher geodesic distance our result is up to log factor sharp and does not require any randomness assumption on the amplitudes of the underlying measure our proof technique relies on an infinitedimensional extension of the socalled golfing scheme which operates over the space of measures and is of general interest | [['this', 'paper', 'presents', 'a', 'sharp', 'geometric', 'analysis', 'of', 'the', 'recovery', 'performance', 'of', 'sparse', 'regularization', 'more', 'specifically', 'we', 'analyze', 'the', 'blasso', 'method', 'which', 'estimates', 'a', 'sparse', 'measure', 'sum', 'of', 'dirac', 'masses', 'from', 'randomized', 'subsampled', 'measurements', 'this', 'is', 'a', 'continuous', 'often', 'called', 'offthegrid', 'extension', 'of', 'the', 'compressed', 'sensing', 'problem', 'where', 'the', 'ell1', 'norm', 'is', 'replaced', 'by', 'the', 'total', 'variation', 'of', 'measures', 'this', 'extension', 'is', 'appealing', 'from', 'a', 'numerical', 'perspective', 'because', 'it', 'avoids', 'to', 'discretize', 'the', 'the', 'space', 'by', 'some', 'grid', 'but', 'more', 'importantly', 'it', 'makes', 'explicit', 'the', 'geometry', 'of', 'the', 'problem', 'since', 'the', 'positions', 'of', 'the', 'diracs', 'can', 'now', 'freely', 'move', 'over', 'the', 'parameter', 'space', 'on', 'a', 'methodological', 'level', 'our', 'contribution', 'is', 'to', 'propose', 'the', 'fisher', 'geodesic', 'distance', 'on', 'this', 'parameter', 'space', 'as', 'the', 'canonical', 'metric', 'to', 'analyze', 'superresolution', 'in', 'a', 'way', 'which', 'is', 'invariant', 'to', 'reparameterization', 'of', 'this', 'space', 'switching', 'to', 'the', 'fisher', 'metric', 'allows', 'us', 'to', 'take', 'into', 'account', 'measurement', 'operators', 'which', 'are', 'not', 'translation', 'invariant', 'which', 'is', 'crucial', 'for', 'applications', 'such', 'as', 'laplace', 'inversion', 'in', 'imaging', 'gaussian', 'mixtures', 'estimation', 'and', 'training', 'of', 'multilayer', 'perceptrons', 'with', 'one', 'hidden', 'layer', 'on', 'a', 'theoretical', 'level', 'our', 'main', 'contribution', 'shows', 'that', 'if', 'the', 'fisher', 'distance', 'between', 'spikes', 'is', 'larger', 'than', 'a', 'rayleigh', 'separation', 'constant', 'then', 'the', 'blasso', 'recovers', 'in', 'a', 'stable', 'way', 'a', 'stream', 'of', 'diracs', 'provided', 'that', 'the', 'number', 'of', 'measurements', 'is', 'proportional', 'up', 'to', 'log', 'factors', 'to', 'the', 'number', 'of', 'diracs', 'we', 'measure', 'the', 'stability', 'using', 'an', 'optimal', 'transport', 'distance', 'constructed', 'on', 'top', 'of', 'the', 'fisher', 'geodesic', 'distance', 'our', 'result', 'is', 'up', 'to', 'log', 'factor', 'sharp', 'and', 'does', 'not', 'require', 'any', 'randomness', 'assumption', 'on', 'the', 'amplitudes', 'of', 'the', 'underlying', 'measure', 'our', 'proof', 'technique', 'relies', 'on', 'an', 'infinitedimensional', 'extension', 'of', 'the', 'socalled', 'golfing', 'scheme', 'which', 'operates', 'over', 'the', 'space', 'of', 'measures', 'and', 'is', 'of', 'general', 'interest']] | [-0.09219958496903015, 0.08149640485670166, -0.11952654182691995, 0.060161902968145574, -0.0986482282129431, -0.11278545330262682, 0.06470457048182385, 0.34459980775891413, -0.3037547500718245, -0.28037039762992194, 0.105387043259933, -0.26069526095742895, -0.16163554528422985, 0.18647850084348197, -0.10771709342595227, 0.05328310990416836, 0.04059453920616988, 0.06654329507678441, -0.10438832630992965, -0.23068801211606418, 0.3265075704572347, 0.06721756362543782, 0.2836923209724649, 0.014390472892064715, 0.13159052764125956, 0.036420112881021184, -0.039709886655198735, -0.001163116804146885, -0.10649047751932639, 0.163764546607834, 0.20411624780175858, 0.1377117528314718, 0.2833304797385028, -0.3510403985113109, -0.22130985839813694, 0.12420180786274684, 0.13025038541650635, 0.08511298948401465, -0.017332544399019323, -0.27383456668107686, 0.07009156991137826, -0.10376726354094089, -0.08739189585708972, -0.0947277557276469, 0.00028080553763606443, -0.0327128007238788, -0.29919312504194073, 0.06611130772628933, 0.07140051631682867, 0.014516509594173256, -0.032170928175340216, -0.0942071995009754, 0.020856306583019856, 0.09361561503874793, 0.04688286497623186, 0.0637713380584274, 0.10768597890661057, -0.06725172163781935, -0.06954227832309685, 0.3757289967208834, -0.06932631660589142, -0.24303432952003942, 0.14633920164810615, -0.11709471177722966, -0.1152407780819876, 0.1115587357695472, 0.1766959914775508, 0.13162408017874425, -0.14062676713213884, 0.10356761479242498, -0.06831994813822413, 0.18437368202431656, 0.0648428779580144, 0.025288393774424257, 0.13771991889507418, 0.16001632634976262, 0.15240517328970082, 0.12234438589929822, -0.10788210406073023, -0.10820421763638562, -0.3196858259143607, -0.16323083447735065, -0.23078029081161824, 0.05447666113530667, -0.1175692787254567, -0.1839800541489401, 0.38208593794747575, 0.15327139271728363, 0.22443765789864795, 0.07546948976679657, 0.33444831631807515, 0.11778244245026591, 0.07775541668346171, 0.08284245914963961, 0.20902631620595585, 0.14876073833917342, 0.05339241928163496, -0.17577297849927906, 0.06186227555269115, 0.08922124097803957] |
1,802.08465 | AEkNN: An AutoEncoder kNN-based classifier with built-in dimensionality
reduction | High dimensionality, i.e. data having a large number of variables, tends to
be a challenge for most machine learning tasks, including classification. A
classifier usually builds a model representing how a set of inputs explain the
outputs. The larger is the set of inputs and/or outputs, the more complex would
be that model. There is a family of classification algorithms, known as lazy
learning methods, which does not build a model. One of the best known members
of this family is the kNN algorithm. Its strategy relies on searching a set of
nearest neighbors, using the input variables as position vectors and computing
distances among them. These distances loss significance in high-dimensional
spaces. Therefore kNN, as many other classifiers, tends to worse its
performance as the number of input variables grows.
In this work AEkNN, a new kNN-based algorithm with built-in dimensionality
reduction, is presented. Aiming to obtain a new representation of the data,
having a lower dimensionality but with more informational features, AEkNN
internally uses autoencoders. From this new feature vectors the computed
distances should be more significant, thus providing a way to choose better
neighbors. A experimental evaluation of the new proposal is conducted,
analyzing several configurations and comparing them against the classical kNN
algorithm. The obtained conclusions demonstrate that AEkNN offers better
results in predictive and runtime performance.
| cs.LG cs.NE | high dimensionality ie data having a large number of variables tends to be a challenge for most machine learning tasks including classification a classifier usually builds a model representing how a set of inputs explain the outputs the larger is the set of inputs andor outputs the more complex would be that model there is a family of classification algorithms known as lazy learning methods which does not build a model one of the best known members of this family is the knn algorithm its strategy relies on searching a set of nearest neighbors using the input variables as position vectors and computing distances among them these distances loss significance in highdimensional spaces therefore knn as many other classifiers tends to worse its performance as the number of input variables grows in this work aeknn a new knnbased algorithm with builtin dimensionality reduction is presented aiming to obtain a new representation of the data having a lower dimensionality but with more informational features aeknn internally uses autoencoders from this new feature vectors the computed distances should be more significant thus providing a way to choose better neighbors a experimental evaluation of the new proposal is conducted analyzing several configurations and comparing them against the classical knn algorithm the obtained conclusions demonstrate that aeknn offers better results in predictive and runtime performance | [['high', 'dimensionality', 'ie', 'data', 'having', 'a', 'large', 'number', 'of', 'variables', 'tends', 'to', 'be', 'a', 'challenge', 'for', 'most', 'machine', 'learning', 'tasks', 'including', 'classification', 'a', 'classifier', 'usually', 'builds', 'a', 'model', 'representing', 'how', 'a', 'set', 'of', 'inputs', 'explain', 'the', 'outputs', 'the', 'larger', 'is', 'the', 'set', 'of', 'inputs', 'andor', 'outputs', 'the', 'more', 'complex', 'would', 'be', 'that', 'model', 'there', 'is', 'a', 'family', 'of', 'classification', 'algorithms', 'known', 'as', 'lazy', 'learning', 'methods', 'which', 'does', 'not', 'build', 'a', 'model', 'one', 'of', 'the', 'best', 'known', 'members', 'of', 'this', 'family', 'is', 'the', 'knn', 'algorithm', 'its', 'strategy', 'relies', 'on', 'searching', 'a', 'set', 'of', 'nearest', 'neighbors', 'using', 'the', 'input', 'variables', 'as', 'position', 'vectors', 'and', 'computing', 'distances', 'among', 'them', 'these', 'distances', 'loss', 'significance', 'in', 'highdimensional', 'spaces', 'therefore', 'knn', 'as', 'many', 'other', 'classifiers', 'tends', 'to', 'worse', 'its', 'performance', 'as', 'the', 'number', 'of', 'input', 'variables', 'grows', 'in', 'this', 'work', 'aeknn', 'a', 'new', 'knnbased', 'algorithm', 'with', 'builtin', 'dimensionality', 'reduction', 'is', 'presented', 'aiming', 'to', 'obtain', 'a', 'new', 'representation', 'of', 'the', 'data', 'having', 'a', 'lower', 'dimensionality', 'but', 'with', 'more', 'informational', 'features', 'aeknn', 'internally', 'uses', 'autoencoders', 'from', 'this', 'new', 'feature', 'vectors', 'the', 'computed', 'distances', 'should', 'be', 'more', 'significant', 'thus', 'providing', 'a', 'way', 'to', 'choose', 'better', 'neighbors', 'a', 'experimental', 'evaluation', 'of', 'the', 'new', 'proposal', 'is', 'conducted', 'analyzing', 'several', 'configurations', 'and', 'comparing', 'them', 'against', 'the', 'classical', 'knn', 'algorithm', 'the', 'obtained', 'conclusions', 'demonstrate', 'that', 'aeknn', 'offers', 'better', 'results', 'in', 'predictive', 'and', 'runtime', 'performance']] | [-0.07666953019660842, 0.029005891784637895, -0.09862758892765311, 0.07070855094789953, -0.12517810600695972, -0.1922906405356717, 0.10049563892527033, 0.3762232726481975, -0.26552825883858966, -0.34027065218076513, 0.08124062226279544, -0.28642856788808874, -0.14906877138845756, 0.20338174898557448, -0.08606046926371365, 0.06719387712260515, 0.09461796554005641, 0.07961135122469917, -0.06632644439177225, -0.31223328855379623, 0.26763125955932077, 0.07016547610435415, 0.28446890123592, -0.050851722989058566, 0.09190251562023763, -0.009771739044205635, -0.037962459780516024, 0.04038458390422671, -0.03245882196932646, 0.17833067360018037, 0.2774983589765005, 0.21606099562365477, 0.335740592747893, -0.33608352184733925, -0.20267485134404709, 0.13484644661952502, 0.12948161516574577, 0.13245546315191944, -0.012767396548515865, -0.2755396192876529, 0.07947650337191425, -0.14665594359973605, -0.08086280859964667, -0.1489950584619605, 0.009199363633577304, -5.049348916285313e-05, -0.2977089920224479, 0.013111516034727858, 0.07413131793817648, 0.049712190336054736, -0.02745719311855801, -0.16662271319555616, 0.0005086568759425598, 0.12920742922797546, 0.028773745595123534, 0.0861724524524872, 0.10995199303121655, -0.14497642892695187, -0.1655175037370211, 0.3768093357999426, -0.024952856166397825, -0.21517517150203777, 0.24229928177393703, -0.05040704064930861, -0.12840663063301963, 0.09947427419515756, 0.21625294571329431, 0.10713052555573135, -0.15473196562801012, 0.02311119143440224, -0.04106580908726311, 0.18914570144327078, 0.030406153214067155, 0.04378072186099256, 0.16019386818055148, 0.23878924933612997, 0.07136340484700515, 0.13541780270154619, -0.10240023353003277, -0.06600168201944905, -0.23877485412725025, -0.1259421056718039, -0.22336551493531034, -0.001556425497535831, -0.15326858723170822, -0.16956705065250263, 0.3708245990001407, 0.18934132567079046, 0.26581859995707935, 0.1109137216586055, 0.3324353122995214, 0.043393792859181164, 0.1105305575070338, 0.11537262684416986, 0.18388503396196704, 0.07382338968151969, 0.043888433525081705, -0.13144504763101694, 0.11218893390920064, 0.056875514363811025] |
1,802.08466 | Non-adiabatic effects in periodically driven-dissipative open quantum
systems | We present a general method to calculate the quasi-stationary state of a
driven-dissipative system coupled to a transmission line (and more generally,
to a reservoir) under periodic modulation of its parameters. Using Floquet's
theorem, we formulate the differential equation for the system's density
operator which has to be solved for a single period of modulation. On this
basis we also provide systematic expansions in both the adiabatic and
high-frequency regime. Applying our method to three different systems -- two-
and three-level models as well as the driven nonlinear cavity -- we propose
periodic modulation protocols of parameters leading to a temporary suppression
of effective dissipation rates, and study the arising non-adiabatic features in
the response of these systems.
| quant-ph | we present a general method to calculate the quasistationary state of a drivendissipative system coupled to a transmission line and more generally to a reservoir under periodic modulation of its parameters using floquets theorem we formulate the differential equation for the systems density operator which has to be solved for a single period of modulation on this basis we also provide systematic expansions in both the adiabatic and highfrequency regime applying our method to three different systems two and threelevel models as well as the driven nonlinear cavity we propose periodic modulation protocols of parameters leading to a temporary suppression of effective dissipation rates and study the arising nonadiabatic features in the response of these systems | [['we', 'present', 'a', 'general', 'method', 'to', 'calculate', 'the', 'quasistationary', 'state', 'of', 'a', 'drivendissipative', 'system', 'coupled', 'to', 'a', 'transmission', 'line', 'and', 'more', 'generally', 'to', 'a', 'reservoir', 'under', 'periodic', 'modulation', 'of', 'its', 'parameters', 'using', 'floquets', 'theorem', 'we', 'formulate', 'the', 'differential', 'equation', 'for', 'the', 'systems', 'density', 'operator', 'which', 'has', 'to', 'be', 'solved', 'for', 'a', 'single', 'period', 'of', 'modulation', 'on', 'this', 'basis', 'we', 'also', 'provide', 'systematic', 'expansions', 'in', 'both', 'the', 'adiabatic', 'and', 'highfrequency', 'regime', 'applying', 'our', 'method', 'to', 'three', 'different', 'systems', 'two', 'and', 'threelevel', 'models', 'as', 'well', 'as', 'the', 'driven', 'nonlinear', 'cavity', 'we', 'propose', 'periodic', 'modulation', 'protocols', 'of', 'parameters', 'leading', 'to', 'a', 'temporary', 'suppression', 'of', 'effective', 'dissipation', 'rates', 'and', 'study', 'the', 'arising', 'nonadiabatic', 'features', 'in', 'the', 'response', 'of', 'these', 'systems']] | [-0.1851788383360615, 0.08961568763158445, -0.09419084954123687, 0.043730090614127255, -0.013451673283145345, -0.1446419399400274, 0.06309237712813573, 0.3520111330335253, -0.2899606406351487, -0.25870695182700354, 0.11302474505822013, -0.21592057328510644, -0.15651843582023064, 0.24519512580370467, -0.020859491675168852, 0.083178582857664, 0.029351390312136762, -0.010302611925500717, -0.0665757868936735, -0.17989967607668247, 0.3336918812148787, 0.0387822991570233, 0.2577964350328267, 0.008028085846835266, 0.09765289744546894, 0.0034695804612871646, 0.029464801459057367, -0.007849119555462023, -0.11899878857416454, 0.11303732028343426, 0.22174893382973473, 0.04542159904517105, 0.25142421526665015, -0.4410167759733981, -0.25028220479023355, 0.07720880823787944, 0.1374870047117744, 0.17624204245632805, -0.035550413311660846, -0.25222066815757865, 0.031219937300694913, -0.20977223905381456, -0.1506215641194762, -0.11697151019400516, 0.020705302278029507, 0.0431945409117957, -0.3131464762544934, 0.1008338444060365, 0.05601559716160409, 0.039404495707552493, -0.08977448157986209, -0.036803806869008034, 0.018956122323790372, 0.09554487025236776, -0.007028225456075421, -0.02262241900336511, 0.11372513252165939, -0.0989133263877914, -0.11144371141262095, 0.3728739851202559, -0.13833678033451774, -0.20076679750666793, 0.19086034301315144, -0.1047922214111795, -0.09049817701753486, 0.10948023028222137, 0.21820961347588436, 0.12912144494224903, -0.1731087881590015, 0.010869865145148903, 0.01213662999838687, 0.18417837744546606, 0.03840839279944013, 0.0671471767273033, 0.17837627078727658, 0.16132017086131561, 0.047893277483847765, 0.17028156712406378, -0.09511174397454758, -0.130555051294605, -0.271881731435785, -0.10210937267000755, -0.12202063164721917, 0.045938558023471125, -0.047986332495227164, -0.19003832323982478, 0.44463284483885973, 0.15079300215162722, 0.18396236533138516, 0.004936212130846327, 0.30147594190202653, 0.23601384554359386, 0.02460427444936519, 0.04556223715591277, 0.23947311091991463, 0.16422475021380675, 0.10227134008490449, -0.2736508989513948, -0.0047801050943611515, 0.045256054721339124] |
1,802.08467 | Community Paper on Radio Astronomy Infrastructures | Radio astronomy has experienced phenomenal progress in recent years due to
advances in digital technologies and processing speed, the development of new
technologies, and the prospect for new powerful facilities A new generation of
radio interferometers is opening new windows to the Universe. LOFAR, the world
largest telescope, extended the classical radio window at low frequencies. ALMA
started a new era at millimetre wavelengths and the planned SKA will
revolutionize the sciences of the Universe, well beyond the traditional limits
of astronomy. Radio astronomy research is making leaps with enhancements in
resolution, sensitivity, and image fidelity. In Germany, the community has
access to excellent facilities and training opportunities. The Effelsberg
telescope remains the flagship of radio astronomical research at centimeter
wavelengths and serves as a test bed for new technologies, LOFAR has notably
expanded the German community and now includes six German stations and a LOFAR
long term archive coordinated by the GLOW consortium. The SKA will be a
transformational astronomical facility in the coming decade(s), and the German
community is looking forward to broadly participate in SKA-enabled research.
| astro-ph.IM | radio astronomy has experienced phenomenal progress in recent years due to advances in digital technologies and processing speed the development of new technologies and the prospect for new powerful facilities a new generation of radio interferometers is opening new windows to the universe lofar the world largest telescope extended the classical radio window at low frequencies alma started a new era at millimetre wavelengths and the planned ska will revolutionize the sciences of the universe well beyond the traditional limits of astronomy radio astronomy research is making leaps with enhancements in resolution sensitivity and image fidelity in germany the community has access to excellent facilities and training opportunities the effelsberg telescope remains the flagship of radio astronomical research at centimeter wavelengths and serves as a test bed for new technologies lofar has notably expanded the german community and now includes six german stations and a lofar long term archive coordinated by the glow consortium the ska will be a transformational astronomical facility in the coming decades and the german community is looking forward to broadly participate in skaenabled research | [['radio', 'astronomy', 'has', 'experienced', 'phenomenal', 'progress', 'in', 'recent', 'years', 'due', 'to', 'advances', 'in', 'digital', 'technologies', 'and', 'processing', 'speed', 'the', 'development', 'of', 'new', 'technologies', 'and', 'the', 'prospect', 'for', 'new', 'powerful', 'facilities', 'a', 'new', 'generation', 'of', 'radio', 'interferometers', 'is', 'opening', 'new', 'windows', 'to', 'the', 'universe', 'lofar', 'the', 'world', 'largest', 'telescope', 'extended', 'the', 'classical', 'radio', 'window', 'at', 'low', 'frequencies', 'alma', 'started', 'a', 'new', 'era', 'at', 'millimetre', 'wavelengths', 'and', 'the', 'planned', 'ska', 'will', 'revolutionize', 'the', 'sciences', 'of', 'the', 'universe', 'well', 'beyond', 'the', 'traditional', 'limits', 'of', 'astronomy', 'radio', 'astronomy', 'research', 'is', 'making', 'leaps', 'with', 'enhancements', 'in', 'resolution', 'sensitivity', 'and', 'image', 'fidelity', 'in', 'germany', 'the', 'community', 'has', 'access', 'to', 'excellent', 'facilities', 'and', 'training', 'opportunities', 'the', 'effelsberg', 'telescope', 'remains', 'the', 'flagship', 'of', 'radio', 'astronomical', 'research', 'at', 'centimeter', 'wavelengths', 'and', 'serves', 'as', 'a', 'test', 'bed', 'for', 'new', 'technologies', 'lofar', 'has', 'notably', 'expanded', 'the', 'german', 'community', 'and', 'now', 'includes', 'six', 'german', 'stations', 'and', 'a', 'lofar', 'long', 'term', 'archive', 'coordinated', 'by', 'the', 'glow', 'consortium', 'the', 'ska', 'will', 'be', 'a', 'transformational', 'astronomical', 'facility', 'in', 'the', 'coming', 'decades', 'and', 'the', 'german', 'community', 'is', 'looking', 'forward', 'to', 'broadly', 'participate', 'in', 'skaenabled', 'research']] | [-0.09428173284768389, 0.1398894678581548, -0.03487198895335281, 0.04952195263467729, -0.17659184670342615, -0.10239258737583237, 0.037059415919245796, 0.4037235157166639, -0.21920639387949298, -0.3194784697699831, 0.1770738188976558, -0.29230937129409795, -0.08423924981093223, 0.2822058676961767, -0.0227301381894628, 0.023767218068539653, 0.11388943498441426, -0.11226179214780417, 0.0069494421444728635, -0.23232499907431559, 0.16467386610764131, 0.25075439986867015, 0.3565339448945492, 0.04460485327810316, 0.09628985648493418, -0.09665233334310594, -0.14044834537630418, -0.058773967100626504, -0.05940814492269157, 0.1178472904616632, 0.3865207729683247, 0.25125890256564937, 0.33821664486090874, -0.42325656364012637, -0.2095303278968387, 0.05976235197747147, 0.10661443586597281, 0.04236490876424346, -0.04106322562667342, -0.3374900766072816, -0.013411013917013836, -0.23041320503480062, -0.21465405691519715, 0.04401091163326578, 0.04473988112360448, 0.026585813796179098, -0.17242994413178434, -0.05295836320604731, -0.11425408139351358, 0.0920880253196516, -0.03990051535211943, -0.13735535888398967, 0.11010891394598117, 0.19890753310919332, -0.005404986958464168, 0.10062865897479435, 0.0881109716697057, -0.18184282768549126, -0.14963347940925467, 0.4073306802175272, -0.0758476539729477, 0.0533759316188817, 0.19909295540324576, -0.2339433694737074, -0.23444823007716725, 0.09774986933916807, 0.21099003059449448, 0.006489515668199806, -0.16514939499307382, 0.11465996838017142, 0.0584511398429344, 0.1690032978468899, 0.12373448259411694, 0.09426727010593802, 0.3630294000070668, 0.23887911221938563, 0.09568404682762816, 0.10575363708573676, -0.19522303285134768, -0.023207192293504316, -0.20863497201444875, -0.125442789821085, -0.16486064798795105, 0.04662032972686411, 0.0026540945662908893, -0.06661747442231399, 0.39813018575038633, 0.13112897526968553, 0.01255492402252161, 0.0028425126108916456, 0.37020965758972707, -0.034219580504316, 0.16439138948551138, 0.04785282196466591, 0.2802901012100949, 0.06327751639503149, 0.278294861811119, -0.0902653889353858, 0.0009393956482127895, -0.05537539976469131] |
1,802.08468 | Translating solitons of the mean curvature flow asymptotic to
hyperplanes in $\mathbb{R}^{n+1}$ | A translating soliton is a hypersurface $M$ in $\mathbb{R}^{n+1}$ such that
the family $M_t= M- t \,\mathbf{e}_{n+1}$ is a mean curvature flow, i.e., such
that normal component of the velocity at each point is equal to the mean
curvature at that point $\mathbf{H}=\mathbf{e}_{n+1}^{\perp}.$ In this paper we
obtain a characterization of hyperplanes which are parallel to
$\mathbf{e}_{n+1}$ and the family of tilted grim reaper cylinders as the only
translating solitons in $\mathbb{R}^{n+1}$ which are $C^1$-asymptotic to two
half-hyperplanes outside a non-vertical cylinder. This result was proven for
translators in $\mathbb{R}^3$ by the second author, Perez-Garcia, Savas-Halilaj
and Smoczyk under the additional hypotheses that the genus of the surface was
locally bounded and the cylinder was perpendicular to the translating velocity.
| math.DG | a translating soliton is a hypersurface m in mathbbrn1 such that the family m_t m t mathbfe_n1 is a mean curvature flow ie such that normal component of the velocity at each point is equal to the mean curvature at that point mathbfhmathbfe_n1perp in this paper we obtain a characterization of hyperplanes which are parallel to mathbfe_n1 and the family of tilted grim reaper cylinders as the only translating solitons in mathbbrn1 which are c1asymptotic to two halfhyperplanes outside a nonvertical cylinder this result was proven for translators in mathbbr3 by the second author perezgarcia savashalilaj and smoczyk under the additional hypotheses that the genus of the surface was locally bounded and the cylinder was perpendicular to the translating velocity | [['a', 'translating', 'soliton', 'is', 'a', 'hypersurface', 'm', 'in', 'mathbbrn1', 'such', 'that', 'the', 'family', 'm_t', 'm', 't', 'mathbfe_n1', 'is', 'a', 'mean', 'curvature', 'flow', 'ie', 'such', 'that', 'normal', 'component', 'of', 'the', 'velocity', 'at', 'each', 'point', 'is', 'equal', 'to', 'the', 'mean', 'curvature', 'at', 'that', 'point', 'mathbfhmathbfe_n1perp', 'in', 'this', 'paper', 'we', 'obtain', 'a', 'characterization', 'of', 'hyperplanes', 'which', 'are', 'parallel', 'to', 'mathbfe_n1', 'and', 'the', 'family', 'of', 'tilted', 'grim', 'reaper', 'cylinders', 'as', 'the', 'only', 'translating', 'solitons', 'in', 'mathbbrn1', 'which', 'are', 'c1asymptotic', 'to', 'two', 'halfhyperplanes', 'outside', 'a', 'nonvertical', 'cylinder', 'this', 'result', 'was', 'proven', 'for', 'translators', 'in', 'mathbbr3', 'by', 'the', 'second', 'author', 'perezgarcia', 'savashalilaj', 'and', 'smoczyk', 'under', 'the', 'additional', 'hypotheses', 'that', 'the', 'genus', 'of', 'the', 'surface', 'was', 'locally', 'bounded', 'and', 'the', 'cylinder', 'was', 'perpendicular', 'to', 'the', 'translating', 'velocity']] | [-0.1933770526929394, 0.12909373470744037, -0.09099581501568141, 0.007667210417718667, -0.07775964321082701, -0.12548560615547974, -0.04301403199585722, 0.3735626572581089, -0.262464062642792, -0.2239295461255571, 0.12373370092524134, -0.302033479479344, -0.07928748411004959, 0.18641575786851994, -0.0954084046660801, 0.03643054013828868, 0.024069496462850466, 0.09678080854532511, -0.0545275716111064, -0.23908354303516124, 0.35462069007284613, -0.06689281575381756, 0.23015375977948957, 0.057816397817299255, 0.10608752601699013, -0.03905038337587662, 0.06745519816227581, 0.055599142732503624, -0.18385525530168745, 0.12131345971770909, 0.19173449920490385, 0.03513197383600409, 0.24551890277830155, -0.34037182264677857, -0.19679492808110965, 0.12395745221444446, 0.14353870638119787, 0.05168306210240268, -0.010141396060909915, -0.2684044703193333, 0.14465660814641287, -0.06254445045184263, -0.19448899376084622, 0.020021682410784388, 0.05429394603706896, 0.013847039477980655, -0.23144420468774826, 0.0539478189230937, 0.167684411905382, 0.08313989985896193, -0.05733847041391646, -0.08393289908442808, -0.09345771687753175, 0.08121515717357397, 0.06807430268103337, 0.1314229503881348, 0.0805032753433688, -0.07419534358398422, -0.032351188394038576, 0.35325089968720697, -0.11430312233936528, -0.2460351808887461, 0.11886942708439639, -0.14317782314737207, -0.05154081397568402, 0.13604739718949016, 0.1768518322430875, 0.14677634939713322, -0.11659642126330215, 0.09958623813556346, -0.10272651015902343, 0.10699465557345715, 0.17315172234793072, -0.0891509763855973, 0.19732502581470687, 0.09185633771931348, 0.13703576635630071, 0.1358276058798251, -0.09167719234752914, -0.06512397560999607, -0.357726776032992, -0.22920890091311025, -0.16937883642259174, 0.0617806006891086, -0.07924231640227726, -0.1811011203362242, 0.361606856216879, 0.016946178083510503, 0.21063569744481989, 0.08494054384570082, 0.28049438958582673, 0.06354216357753814, 0.05054127285864366, 0.16289080388277122, 0.21225948233724287, 0.13938041025691705, 0.06455960494020711, -0.13332670006480918, -0.0038698677580965603, 0.1066375795593637] |
1,802.08469 | Parameterized verification of synchronization in constrained
reconfigurable broadcast networks | Reconfigurable broadcast networks provide a convenient formalism for
modelling and reasoning about networks of mobile agents broadcasting messages
to other agents following some (evolving) communication topology. The
parameterized verification of such models aims at checking whether a given
property holds irrespective of the initial configuration (number of agents,
initial states and initial communication topology). We focus here on the
synchronization property, asking whether all agents converge to a set of target
states after some execution. This problem is known to be decidable in
polynomial time when no constraints are imposed on the evolution of the
communication topology (while it is undecidable for static broadcast networks).
In this paper we investigate how various constraints on reconfigurations
affect the decidability and complexity of the synchronization problem. In
particular, we show that when bounding the number of reconfigured links between
two communications steps by a constant, synchronization becomes undecidable; on
the other hand, synchronization remains decidable in PTIME when the bound grows
with the number of agents.
| cs.LO cs.DC cs.FL | reconfigurable broadcast networks provide a convenient formalism for modelling and reasoning about networks of mobile agents broadcasting messages to other agents following some evolving communication topology the parameterized verification of such models aims at checking whether a given property holds irrespective of the initial configuration number of agents initial states and initial communication topology we focus here on the synchronization property asking whether all agents converge to a set of target states after some execution this problem is known to be decidable in polynomial time when no constraints are imposed on the evolution of the communication topology while it is undecidable for static broadcast networks in this paper we investigate how various constraints on reconfigurations affect the decidability and complexity of the synchronization problem in particular we show that when bounding the number of reconfigured links between two communications steps by a constant synchronization becomes undecidable on the other hand synchronization remains decidable in ptime when the bound grows with the number of agents | [['reconfigurable', 'broadcast', 'networks', 'provide', 'a', 'convenient', 'formalism', 'for', 'modelling', 'and', 'reasoning', 'about', 'networks', 'of', 'mobile', 'agents', 'broadcasting', 'messages', 'to', 'other', 'agents', 'following', 'some', 'evolving', 'communication', 'topology', 'the', 'parameterized', 'verification', 'of', 'such', 'models', 'aims', 'at', 'checking', 'whether', 'a', 'given', 'property', 'holds', 'irrespective', 'of', 'the', 'initial', 'configuration', 'number', 'of', 'agents', 'initial', 'states', 'and', 'initial', 'communication', 'topology', 'we', 'focus', 'here', 'on', 'the', 'synchronization', 'property', 'asking', 'whether', 'all', 'agents', 'converge', 'to', 'a', 'set', 'of', 'target', 'states', 'after', 'some', 'execution', 'this', 'problem', 'is', 'known', 'to', 'be', 'decidable', 'in', 'polynomial', 'time', 'when', 'no', 'constraints', 'are', 'imposed', 'on', 'the', 'evolution', 'of', 'the', 'communication', 'topology', 'while', 'it', 'is', 'undecidable', 'for', 'static', 'broadcast', 'networks', 'in', 'this', 'paper', 'we', 'investigate', 'how', 'various', 'constraints', 'on', 'reconfigurations', 'affect', 'the', 'decidability', 'and', 'complexity', 'of', 'the', 'synchronization', 'problem', 'in', 'particular', 'we', 'show', 'that', 'when', 'bounding', 'the', 'number', 'of', 'reconfigured', 'links', 'between', 'two', 'communications', 'steps', 'by', 'a', 'constant', 'synchronization', 'becomes', 'undecidable', 'on', 'the', 'other', 'hand', 'synchronization', 'remains', 'decidable', 'in', 'ptime', 'when', 'the', 'bound', 'grows', 'with', 'the', 'number', 'of', 'agents']] | [-0.239313128245313, 0.11092317364428465, -0.022841157752270923, 0.07354821576935626, -0.09398440644428951, -0.21912641563770793, 0.1073201546898373, 0.37676628470625273, -0.3150374075147982, -0.31246455729564243, 0.11075172582698031, -0.2231291293552736, -0.14115302798852167, 0.14558557908493663, -0.09548889186301428, 0.06566649363603352, 0.08985835366609801, 0.09980048017633834, -0.004630022868230121, -0.309259131503229, 0.32667390447643746, 0.0004982202464328488, 0.24511889360629294, 0.042870479979461466, 0.0474918464045381, 0.0279000077152443, 0.02493979349567714, 0.026856920193517354, -0.10913784548565894, 0.06963860656655814, 0.2997908438083181, 0.2378826963235397, 0.3155561314566379, -0.4727056712003016, -0.16875374715536742, 0.16478941904625105, 0.1430548731459123, 0.11036703580984755, 0.009699311246527585, -0.28963481244154093, 0.09158016791249193, -0.1394965024721786, -0.06265941458731526, -0.010694872735567936, 0.039796512446184526, 0.039609402880603564, -0.23528106140452665, -0.039669494241158045, 0.09142204872602257, 0.06357390296832863, -0.07926785788873619, -0.015464838120018745, 0.004768203368279856, 0.165810181581658, 0.009991213040449089, -0.011656752409890475, 0.10012515214351346, -0.1632228092795874, -0.1357701217838018, 0.3807689199882855, 0.0269489248280368, -0.2225573287038814, 0.19974915270421018, -0.070468424446029, -0.21228819457166714, 0.05906577940558924, 0.18375360424965392, 0.10093725231339837, -0.12137734629460482, 0.09475845352231195, -0.05230524764600687, 0.22264037598151623, 0.1141517711945287, 0.07408114071728139, 0.13622775056865066, 0.21654150323238133, 0.16011898317402684, 0.14542958392227842, 0.03270110324956477, -0.13600157367678858, -0.25692610028086277, -0.10694221379652867, -0.17979791726442848, 0.029775408010009857, -0.09153292071695011, -0.1448416851983383, 0.3750485090890945, 0.1758621381325988, 0.14468448961766936, 0.16888545624338228, 0.32889990714128786, 0.05644840334491341, 0.0010703697860263651, 0.1417388168501486, 0.17843616624517514, 0.1022802075362628, 0.09244975986466004, -0.2199268070569194, 0.17114859258631107, 0.027225977525387596] |
1,802.0847 | On degrees of birational mappings | We prove that the degrees of the iterates ${\rm deg}(f^n)$ of a birational
map satisfy $\liminf({\rm deg}(f^n))<+\infty$ if and only if the sequence ${\rm
deg}(f^n)$ is bounded, and that the growth of ${\rm deg}(f^n)$ can not be
arbitrarily slow, unless ${\rm deg}(f^n)$ is bounded.
| math.AG math.DS | we prove that the degrees of the iterates rm degfn of a birational map satisfy liminfrm degfninfty if and only if the sequence rm degfn is bounded and that the growth of rm degfn can not be arbitrarily slow unless rm degfn is bounded | [['we', 'prove', 'that', 'the', 'degrees', 'of', 'the', 'iterates', 'rm', 'degfn', 'of', 'a', 'birational', 'map', 'satisfy', 'liminfrm', 'degfninfty', 'if', 'and', 'only', 'if', 'the', 'sequence', 'rm', 'degfn', 'is', 'bounded', 'and', 'that', 'the', 'growth', 'of', 'rm', 'degfn', 'can', 'not', 'be', 'arbitrarily', 'slow', 'unless', 'rm', 'degfn', 'is', 'bounded']] | [-0.17079800234309264, 0.19163043426704549, -0.05646906886249781, 0.03888763481241074, -0.03390862956820499, -0.12277241165394939, -0.0604646129151141, 0.33754464778827414, -0.38259164128629936, -0.1735938127108273, 0.18213293877696352, -0.2398453029316096, -0.0681014729752427, 0.21106491947457903, -0.09659894459487293, -0.04329393560987055, 0.04505515830325229, 0.07296620548835822, -0.0934248628383059, -0.2799639605163109, 0.30183767278989154, -0.08859218426403545, 0.1474283158424355, 0.08924799301617202, 0.18518818586709954, -0.08175514275873345, 0.1172963006510621, -0.007953542905549208, -0.16625972290785285, 0.07042230765468308, 0.22026233924996286, 0.17282399323968484, 0.21358203768197978, -0.3472677399847834, -0.09912200409564234, 0.2779509988391683, 0.19259167518023224, 0.012613988148846797, -0.0018774511214966576, -0.21306648910311715, 0.25065955898857545, -0.11006870310077266, -0.10730002514485802, -0.03654740386021634, 0.05633845774545556, 0.08146480595765059, -0.3108739396224597, 0.06531001897972255, 0.1710307183675468, 0.05675862328193727, 0.018734268755430265, -0.013669702579222974, -0.15737594391352364, 0.062362242090914934, 0.019348242508602283, 0.13752259535803682, 0.10277557822077402, -0.07730799061634268, 0.024233688910802204, 0.36063921491482426, -0.10765548857549827, -0.219417672959112, 0.12183558969436922, -0.2121783378977506, -0.15472436719574034, 0.15554223289447172, 0.09163577094053228, 0.16042018508804695, -0.03501651307479257, 0.21843157016528061, -0.11591232355151858, 0.25811638226289124, 0.09058598821450557, 0.010912009470519565, 0.1095637141150378, 0.023618871523510842, 0.15491475111671857, 0.041433376900386065, -0.032739874363566436, 0.02263593026215122, -0.3489465130759137, -0.14153133432791082, -0.1545374113456568, 0.16260702629231327, -0.11419789783498605, -0.08774472914990925, 0.2580932262907958, 0.049165985048083324, 0.2287124072955478, 0.15362115991523578, 0.1760935849687528, 0.13287869749945544, 0.050639178626061904, 0.1476152928413025, 0.19503378619750342, 0.14635182890508855, -0.055803675359735884, -0.19596446767848516, 0.09047658254747235, 0.0965776684870001] |
1,802.08471 | Optimized Algorithms to Sample Determinantal Point Processes | In this technical report, we discuss several sampling algorithms for
Determinantal Point Processes (DPP). DPPs have recently gained a broad interest
in the machine learning and statistics literature as random point processes
with negative correlation, i.e., ones that can generate a "diverse" sample from
a set of items. They are parametrized by a matrix $\mathbf{L}$, called
$L$-ensemble, that encodes the correlations between items. The standard
sampling algorithm is separated in three phases: 1/~eigendecomposition of
$\mathbf{L}$, 2/~an eigenvector sampling phase where $\mathbf{L}$'s
eigenvectors are sampled independently via a Bernoulli variable parametrized by
their associated eigenvalue, 3/~a Gram-Schmidt-type orthogonalisation procedure
of the sampled eigenvectors.
In a naive implementation, the computational cost of the third step is on
average $\mathcal{O}(N\mu^3)$ where $\mu$ is the average number of samples of
the DPP. We give an algorithm which runs in $\mathcal{O}(N\mu^2)$ and is
extremely simple to implement. If memory is a constraint, we also describe a
dual variant with reduced memory costs. In addition, we discuss implementation
details often missing in the literature.
| stat.CO cs.LG stat.ML | in this technical report we discuss several sampling algorithms for determinantal point processes dpp dpps have recently gained a broad interest in the machine learning and statistics literature as random point processes with negative correlation ie ones that can generate a diverse sample from a set of items they are parametrized by a matrix mathbfl called lensemble that encodes the correlations between items the standard sampling algorithm is separated in three phases 1eigendecomposition of mathbfl 2an eigenvector sampling phase where mathbfls eigenvectors are sampled independently via a bernoulli variable parametrized by their associated eigenvalue 3a gramschmidttype orthogonalisation procedure of the sampled eigenvectors in a naive implementation the computational cost of the third step is on average mathcalonmu3 where mu is the average number of samples of the dpp we give an algorithm which runs in mathcalonmu2 and is extremely simple to implement if memory is a constraint we also describe a dual variant with reduced memory costs in addition we discuss implementation details often missing in the literature | [['in', 'this', 'technical', 'report', 'we', 'discuss', 'several', 'sampling', 'algorithms', 'for', 'determinantal', 'point', 'processes', 'dpp', 'dpps', 'have', 'recently', 'gained', 'a', 'broad', 'interest', 'in', 'the', 'machine', 'learning', 'and', 'statistics', 'literature', 'as', 'random', 'point', 'processes', 'with', 'negative', 'correlation', 'ie', 'ones', 'that', 'can', 'generate', 'a', 'diverse', 'sample', 'from', 'a', 'set', 'of', 'items', 'they', 'are', 'parametrized', 'by', 'a', 'matrix', 'mathbfl', 'called', 'lensemble', 'that', 'encodes', 'the', 'correlations', 'between', 'items', 'the', 'standard', 'sampling', 'algorithm', 'is', 'separated', 'in', 'three', 'phases', '1eigendecomposition', 'of', 'mathbfl', '2an', 'eigenvector', 'sampling', 'phase', 'where', 'mathbfls', 'eigenvectors', 'are', 'sampled', 'independently', 'via', 'a', 'bernoulli', 'variable', 'parametrized', 'by', 'their', 'associated', 'eigenvalue', '3a', 'gramschmidttype', 'orthogonalisation', 'procedure', 'of', 'the', 'sampled', 'eigenvectors', 'in', 'a', 'naive', 'implementation', 'the', 'computational', 'cost', 'of', 'the', 'third', 'step', 'is', 'on', 'average', 'mathcalonmu3', 'where', 'mu', 'is', 'the', 'average', 'number', 'of', 'samples', 'of', 'the', 'dpp', 'we', 'give', 'an', 'algorithm', 'which', 'runs', 'in', 'mathcalonmu2', 'and', 'is', 'extremely', 'simple', 'to', 'implement', 'if', 'memory', 'is', 'a', 'constraint', 'we', 'also', 'describe', 'a', 'dual', 'variant', 'with', 'reduced', 'memory', 'costs', 'in', 'addition', 'we', 'discuss', 'implementation', 'details', 'often', 'missing', 'in', 'the', 'literature']] | [-0.10409812788633298, 0.1179746570376475, -0.08497830630320073, 0.07074434365334412, -0.07300272491400593, -0.14427495514795446, 0.0819313473816664, 0.4189770192342119, -0.29588687208486847, -0.2814606237182382, 0.10633955468306536, -0.27541009164158187, -0.1535941466840521, 0.1569438227038099, -0.06866452618904892, 0.038018700455321124, 0.07418549160292355, 0.02803140195326571, -0.08035200484992616, -0.25501570928316175, 0.29386452618097897, 0.04860120559785446, 0.24538988074961982, -0.03224206843807653, 0.13334892722749453, 0.008082350240334685, -0.05503273354214759, 0.008919392001780858, -0.07723701169756826, 0.10091858186496228, 0.2691000465109396, 0.15677112190087147, 0.3169714345888126, -0.36012778607277635, -0.14486626259542637, 0.14817881687012918, 0.13057428905797516, 0.0895855691108247, -0.05524211402831062, -0.24148481657465726, 0.08527626517083084, -0.14943023691056695, -0.05749989237259228, -0.09273291371928448, 0.010351201470804178, 0.033312306685975214, -0.32101084639324, 0.05332334333744351, 0.05021082122733051, 0.036885379057983225, 0.02457649521586811, -0.1807102541284967, 0.023213748550156784, 0.07373636337054287, 0.01925047555441277, 0.020700959734435826, 0.11911127398053378, -0.09766509340457516, -0.16052456992496936, 0.35313953715233715, -0.01421973334505377, -0.22472893642045577, 0.14936600127285976, -0.09759169861403268, -0.17878509953080968, 0.14750688993286318, 0.19900542487957418, 0.11096878880292085, -0.15870097694358576, 0.11068523153476989, -0.05666504752896498, 0.12399787178864428, 0.03327031830822809, 0.029301667591682606, 0.14008962254445612, 0.15795970473872736, 0.06624765238907486, 0.16051641379717302, -0.07584234442957534, -0.13461601706307405, -0.2788947118457658, -0.1405461506255291, -0.2676252382693161, 0.027897253364004605, -0.133239207449162, -0.17393171548110611, 0.38072904422550685, 0.16225679272405827, 0.24782650563844474, 0.08401618383616277, 0.268013099854115, 0.11484267995730285, 0.043771002940159356, 0.09109917967837372, 0.14237902277046416, 0.09825186456833607, 0.08029664533235635, -0.1436038549612362, 0.09634893928923033, 0.07579467411383707] |
1,802.08472 | Random triangles in random graphs | In a recent paper, Oliver Riordan shows that for $r \ge 4$ and $p$ up to and
slightly larger than the threshold for a $K_r$-factor, the hypergraph formed by
the copies of $K_r$ in $G(n,p)$ contains a copy of the binomial random
hypergraph $H=H_r(n,\pi)$ with $\pi \sim p^{r \choose 2}$. For $r=3$, he gives
a slightly weaker result where the density in the random hypergraph is reduced
by a constant factor. Recently, Jeff Kahn announced an asymptotically sharp
bound for the threshold in Shamir's hypergraph matching problem for all $r \ge
3$. With Riordan's result, this immediately implies an asymptotically sharp
bound for the threshold of a $K_r$-factor in $G(n,p)$ for $r \ge 4$. In this
note, we resolve the missing case $r=3$ by modifying Riordan's argument. This
means that Kahn's result also implies a sharp bound for triangle factors in
$G(n,p)$.
| math.CO | in a recent paper oliver riordan shows that for r ge 4 and p up to and slightly larger than the threshold for a k_rfactor the hypergraph formed by the copies of k_r in gnp contains a copy of the binomial random hypergraph hh_rnpi with pi sim pr choose 2 for r3 he gives a slightly weaker result where the density in the random hypergraph is reduced by a constant factor recently jeff kahn announced an asymptotically sharp bound for the threshold in shamirs hypergraph matching problem for all r ge 3 with riordans result this immediately implies an asymptotically sharp bound for the threshold of a k_rfactor in gnp for r ge 4 in this note we resolve the missing case r3 by modifying riordans argument this means that kahns result also implies a sharp bound for triangle factors in gnp | [['in', 'a', 'recent', 'paper', 'oliver', 'riordan', 'shows', 'that', 'for', 'r', 'ge', '4', 'and', 'p', 'up', 'to', 'and', 'slightly', 'larger', 'than', 'the', 'threshold', 'for', 'a', 'k_rfactor', 'the', 'hypergraph', 'formed', 'by', 'the', 'copies', 'of', 'k_r', 'in', 'gnp', 'contains', 'a', 'copy', 'of', 'the', 'binomial', 'random', 'hypergraph', 'hh_rnpi', 'with', 'pi', 'sim', 'pr', 'choose', '2', 'for', 'r3', 'he', 'gives', 'a', 'slightly', 'weaker', 'result', 'where', 'the', 'density', 'in', 'the', 'random', 'hypergraph', 'is', 'reduced', 'by', 'a', 'constant', 'factor', 'recently', 'jeff', 'kahn', 'announced', 'an', 'asymptotically', 'sharp', 'bound', 'for', 'the', 'threshold', 'in', 'shamirs', 'hypergraph', 'matching', 'problem', 'for', 'all', 'r', 'ge', '3', 'with', 'riordans', 'result', 'this', 'immediately', 'implies', 'an', 'asymptotically', 'sharp', 'bound', 'for', 'the', 'threshold', 'of', 'a', 'k_rfactor', 'in', 'gnp', 'for', 'r', 'ge', '4', 'in', 'this', 'note', 'we', 'resolve', 'the', 'missing', 'case', 'r3', 'by', 'modifying', 'riordans', 'argument', 'this', 'means', 'that', 'kahns', 'result', 'also', 'implies', 'a', 'sharp', 'bound', 'for', 'triangle', 'factors', 'in', 'gnp']] | [-0.13468166934561598, 0.15112520336542537, -0.04745914822061222, 0.03472305503872005, 0.014080447917605968, -0.19692241811153896, 0.07345764222142043, 0.2855098563253034, -0.21232660877657064, -0.3299738782068305, 0.037392358943747345, -0.30529958110117744, -0.12024586051966704, 0.12123113816788962, -0.11039672501992884, 0.017394341779410415, 0.045823101535545176, 0.08529603732287461, 0.02333775492622814, -0.2742117027626604, 0.29205162319889727, 0.01742611252141337, 0.1847507265307247, 0.08688131157731545, -0.020670312020848406, 0.06500301386910022, 0.0319736507813717, 0.04536670112176567, -0.25441861621168993, 0.0922630319680609, 0.21976572502873415, 0.10521532998070227, 0.26821725301655897, -0.35499359671924763, -0.14421191053953789, 0.12821584472974354, 0.15515226404288296, 0.06708554274911153, -0.050979177681365916, -0.23124481109837863, 0.1778290455843857, -0.15064250650082497, -0.1554661375662008, 0.05343427510060211, 0.10795366045431043, -0.04971316489820362, -0.36342713818720257, 0.04640320793321812, 0.19032512614437452, 0.03073255231286934, 0.05638299679469502, -0.19205683957395667, 0.03792028967951629, 0.016865970914463468, -0.02703708856274103, 0.10635182457308925, 0.016472771962780956, -0.11176286999062728, -0.09760000971178953, 0.30263201488142316, -0.09712954080081132, -0.1132889667340944, 0.0744320263273697, -0.15830303425074999, -0.20615868773377427, 0.15127389629681906, 0.04799892043642013, 0.13334864778246017, -0.06429024819112944, 0.15794424195394105, -0.12824068491013577, 0.15988554522817863, 0.18734721249590316, -0.004202692372644327, 0.054866899707328186, 0.0936013777172259, 0.17542001461537543, 0.15520002192269403, -0.0013901407150089318, 0.0220689990521402, -0.29568019609713386, -0.16017917462695613, -0.23514038834189138, 0.11672208236830957, -0.1828211197546594, -0.14851620628214474, 0.33999035496872365, 0.05042551500154725, 0.22686928919523108, 0.10629835496953827, 0.2065963843401442, 0.09022193294388393, 0.0022353622088116323, 0.1638430321410774, 0.17887004855186314, 0.16998387272932058, 0.016915322014325503, -0.08317323761384485, 0.05482730616613932, 0.11354882600849349] |
1,802.08473 | Hexagonal Ti2B2 monolayer: A Promising Anode Material Offering High Rate
Capability for Li-Ion and Na-Ion Batteries | Combining first-principles density functional method and crystal structure
prediction techniques, we report a series of hexagonal two-dimensional (2D)
transition metal borides (TMBs) including Sc2B2, Ti2B2, V2B2, Cr2B2, Y2B2,
Zr2B2, and Mo2B2. Their dynamic and thermal stabilities are testified by phonon
and molecular dynamics simulations. We investigate the potential of 2D Ti2B2
monolayer as the anode material for Li-ion batteries (LIBs) and Na-ion
batteries (NIBs). The Ti2B2 monolayer possesses high theoretical specific
capacities of 456 and 1027 mAhg-1 for Li and Na, respectively. The very high
Li/Na diffusivity with ultralow energy barrier of 0.017/0.008 eV indicates an
excellent charge-discharge capability. In addition, the good electronic
conductivity during the whole lithiation process is found by electronic
structure calculations. The very small change in volume after the adsorption of
one, two, and three layers of Li and Na ions indicates that the Ti2B2 monolayer
is robust. These results highlight the suitability of Ti2B2 monolayer as well
as the other 2D TMBs as excellent anode materials for both LIBs and NIBs.
| cond-mat.mtrl-sci | combining firstprinciples density functional method and crystal structure prediction techniques we report a series of hexagonal twodimensional 2d transition metal borides tmbs including sc2b2 ti2b2 v2b2 cr2b2 y2b2 zr2b2 and mo2b2 their dynamic and thermal stabilities are testified by phonon and molecular dynamics simulations we investigate the potential of 2d ti2b2 monolayer as the anode material for liion batteries libs and naion batteries nibs the ti2b2 monolayer possesses high theoretical specific capacities of 456 and 1027 mahg1 for li and na respectively the very high lina diffusivity with ultralow energy barrier of 00170008 ev indicates an excellent chargedischarge capability in addition the good electronic conductivity during the whole lithiation process is found by electronic structure calculations the very small change in volume after the adsorption of one two and three layers of li and na ions indicates that the ti2b2 monolayer is robust these results highlight the suitability of ti2b2 monolayer as well as the other 2d tmbs as excellent anode materials for both libs and nibs | [['combining', 'firstprinciples', 'density', 'functional', 'method', 'and', 'crystal', 'structure', 'prediction', 'techniques', 'we', 'report', 'a', 'series', 'of', 'hexagonal', 'twodimensional', '2d', 'transition', 'metal', 'borides', 'tmbs', 'including', 'sc2b2', 'ti2b2', 'v2b2', 'cr2b2', 'y2b2', 'zr2b2', 'and', 'mo2b2', 'their', 'dynamic', 'and', 'thermal', 'stabilities', 'are', 'testified', 'by', 'phonon', 'and', 'molecular', 'dynamics', 'simulations', 'we', 'investigate', 'the', 'potential', 'of', '2d', 'ti2b2', 'monolayer', 'as', 'the', 'anode', 'material', 'for', 'liion', 'batteries', 'libs', 'and', 'naion', 'batteries', 'nibs', 'the', 'ti2b2', 'monolayer', 'possesses', 'high', 'theoretical', 'specific', 'capacities', 'of', '456', 'and', '1027', 'mahg1', 'for', 'li', 'and', 'na', 'respectively', 'the', 'very', 'high', 'lina', 'diffusivity', 'with', 'ultralow', 'energy', 'barrier', 'of', '00170008', 'ev', 'indicates', 'an', 'excellent', 'chargedischarge', 'capability', 'in', 'addition', 'the', 'good', 'electronic', 'conductivity', 'during', 'the', 'whole', 'lithiation', 'process', 'is', 'found', 'by', 'electronic', 'structure', 'calculations', 'the', 'very', 'small', 'change', 'in', 'volume', 'after', 'the', 'adsorption', 'of', 'one', 'two', 'and', 'three', 'layers', 'of', 'li', 'and', 'na', 'ions', 'indicates', 'that', 'the', 'ti2b2', 'monolayer', 'is', 'robust', 'these', 'results', 'highlight', 'the', 'suitability', 'of', 'ti2b2', 'monolayer', 'as', 'well', 'as', 'the', 'other', '2d', 'tmbs', 'as', 'excellent', 'anode', 'materials', 'for', 'both', 'libs', 'and', 'nibs']] | [-0.07994229347095824, 0.10816714782640702, 0.03146285264519975, -0.034359940830779576, 0.050516750972019506, -0.17592836102994625, 0.10408458118618, 0.4427503202110529, -0.21745829515857623, -0.3137372064695228, 0.02519475102890283, -0.3320508770062588, -0.13242213529956642, 0.18597552505525528, 0.009475353249581531, 0.07389900953567122, 0.028032816281483974, -0.09198608972365037, -0.07898101384489564, -0.17102901569305687, 0.18537097743246705, 0.13216459300019778, 0.34877514706458895, 0.1416964604315581, 0.045220412450726145, -0.05715802744962275, 0.08851438921847148, 0.029228932588011958, -0.17676373188610342, 0.1026365508325398, 0.2512183286016807, -0.08497066318523139, 0.21125817628126242, -0.4822542806854472, -0.25133969039889054, -0.04292852573562413, 0.09289619609335205, 0.1046819184353808, -0.13497551394975743, -0.20726833139779047, 0.09887933829741087, -0.16014724758279045, -0.09536196766421198, -0.10725072568311589, 0.0025838477158686146, 0.08278899496071972, -0.21147554655763087, 0.10854404485144187, -0.004733152448170586, 0.08206045940492004, -0.14961291949730365, -0.20545732529571978, -0.10789393858722178, 0.06797373412191518, 0.007510433249808557, -0.01988155840735999, 0.20380648256395945, -0.10919943205408345, -0.06356628930079751, 0.4332510617823573, -0.0718778303838917, -0.044958061416400595, 0.1970785696990788, -0.13536287364404415, -0.06877024995046668, 0.16226612812606617, 0.0761307468488667, 0.10097914567159023, -0.13002294158686709, 0.0598366849058948, 0.03879480548766878, 0.1442463893137756, 0.06549174678802956, 0.06815901301815756, 0.20610133267982747, 0.24790878939384128, -0.0041347931051859636, 0.08740591491723534, -0.1378389606892597, -0.004723781930806581, -0.14641381270485, -0.2698431746859569, -0.18703591940866318, 0.050009114771091843, -0.11908220320383407, -0.1872226561419666, 0.37548277762252835, 0.08681732888662737, 0.15429442225431558, -0.060667492065113036, 0.23810386358818506, 0.05165385970758507, 0.013419073761906476, 0.016898795875385987, 0.2445950374334643, 0.1663508429803187, 0.15099258004047442, -0.26774296458388563, 0.09980771059344988, -0.0008745768878725358] |
1,802.08474 | IPA: Invariant-preserving Applications for Weakly-consistent Replicated
Databases | Storage systems based on Weak Consistency provide better availability and
lower latency than systems that use Strong Consistency, especially in
geo-replicated settings. However, under Weak Consistency, it is harder to
ensure the correctness of applications, as the execution of uncoordinated
operations may lead to invalid states.
In this paper we show how to modify an application to make it run correctly
under Weak Consistency. We developed an analysis that detects which operations
need to be corrected, and proposes possible modifications to operations to
prevent inconsistencies. This analysis allows the programmer to choose the
preferred semantics for each problematic execution, while preserving the
original semantics of operations when no conflicts occur. The modified
application runs with small overhead when compared with its Weak Consistency
counterpart, which cannot preserve application correctness.
| cs.DC | storage systems based on weak consistency provide better availability and lower latency than systems that use strong consistency especially in georeplicated settings however under weak consistency it is harder to ensure the correctness of applications as the execution of uncoordinated operations may lead to invalid states in this paper we show how to modify an application to make it run correctly under weak consistency we developed an analysis that detects which operations need to be corrected and proposes possible modifications to operations to prevent inconsistencies this analysis allows the programmer to choose the preferred semantics for each problematic execution while preserving the original semantics of operations when no conflicts occur the modified application runs with small overhead when compared with its weak consistency counterpart which cannot preserve application correctness | [['storage', 'systems', 'based', 'on', 'weak', 'consistency', 'provide', 'better', 'availability', 'and', 'lower', 'latency', 'than', 'systems', 'that', 'use', 'strong', 'consistency', 'especially', 'in', 'georeplicated', 'settings', 'however', 'under', 'weak', 'consistency', 'it', 'is', 'harder', 'to', 'ensure', 'the', 'correctness', 'of', 'applications', 'as', 'the', 'execution', 'of', 'uncoordinated', 'operations', 'may', 'lead', 'to', 'invalid', 'states', 'in', 'this', 'paper', 'we', 'show', 'how', 'to', 'modify', 'an', 'application', 'to', 'make', 'it', 'run', 'correctly', 'under', 'weak', 'consistency', 'we', 'developed', 'an', 'analysis', 'that', 'detects', 'which', 'operations', 'need', 'to', 'be', 'corrected', 'and', 'proposes', 'possible', 'modifications', 'to', 'operations', 'to', 'prevent', 'inconsistencies', 'this', 'analysis', 'allows', 'the', 'programmer', 'to', 'choose', 'the', 'preferred', 'semantics', 'for', 'each', 'problematic', 'execution', 'while', 'preserving', 'the', 'original', 'semantics', 'of', 'operations', 'when', 'no', 'conflicts', 'occur', 'the', 'modified', 'application', 'runs', 'with', 'small', 'overhead', 'when', 'compared', 'with', 'its', 'weak', 'consistency', 'counterpart', 'which', 'can', 'not', 'preserve', 'application', 'correctness']] | [-0.12249548069846172, 0.006049377476805463, -0.07953537744022189, 0.13113063708073103, -0.12453252300082777, -0.18695342311134133, 0.10035593692804329, 0.379585045714003, -0.26118597361044243, -0.347630829965839, 0.13082505855530213, -0.19849502748212006, -0.09967054664694633, 0.16740791528270796, -0.161430692128264, 0.07068270175458076, 0.1123281728476286, 0.017619614964216733, -0.08500908613966134, -0.30529774111301566, 0.25476465792251896, 0.12991400855557564, 0.3204180215145103, 0.0378975450195587, 0.03759823388312585, 0.05119170526114221, 0.022196411629780553, 0.04160644327684377, -0.04934387149954161, 0.09834967834579472, 0.2673202501860662, 0.20498043678772565, 0.2852970000105695, -0.5032375236686606, -0.1349908964851728, 0.11821200492648551, 0.10239565727265122, 0.10017934887168499, -0.001688028160088624, -0.2688889748685492, 0.15524714290536046, -0.1873358375146591, -0.09225930926913861, -0.1816450369759248, -0.003988983965693758, -0.012966632890031459, -0.2835766155989124, 0.00890058373960738, 0.08327998670171767, 0.03169378649013547, 0.0030706735314407316, -0.007939451605153199, -0.011029623941375086, 0.1563237342038729, 0.08420591674422702, -0.005818488248265707, 0.13044622196600988, -0.09362526933949154, -0.12114226304245396, 0.40106036591415223, -0.047003604420304046, -0.19553930828920923, 0.257306011125911, -0.031700861378787804, -0.20761525314301252, 0.10460529065189453, 0.1223833492025733, 0.0651862108721756, -0.1386256444171662, 0.06856543395507078, 0.04284755988046527, 0.24380190435062665, 0.09721228192345455, 0.1038461608839078, 0.1426171564300043, 0.1320531039118158, 0.12841067877956308, 0.15968262509424955, -0.019109213708613355, -0.08361684080759565, -0.3153887939496109, -0.14326097506026808, -0.10414728626895409, -0.009283431465267384, -0.04959022003167775, -0.15026559353304597, 0.32561195730948106, 0.2892815184430219, 0.16138704267437928, 0.0991320470473371, 0.35761969671942867, 0.09101393478832996, 0.12531115481531463, 0.1220759444977515, 0.20297865191152176, 0.06559550141951499, 0.1241325441810589, -0.19050151157694367, 0.14932625448832718, -0.002428613631771161] |
1,802.08475 | Diagonal entropy in many-body systems: Volume effect and quantum phase
transitions | We investigate the diagonal entropy(DE) of the ground state for quantum
many-body systems, including the XY model and the Ising model with next nearest
neighbour interactions. We focus on the DE of a subsystem of L continuous
spins. We show that the DE in many-body systems, regardless of integrability,
can be represented as a volume term plus a logarithmic correction and a
constant offset. Quantum phase transition points can be explicitly identified
by the three coefficients thereof. Besides, by combining entanglement entropy
and the relative entropy of quantum coherence, as two celebrated
representatives of quantumness, we simply obtain the DE, which naturally has
the potential to reveal the information of quantumness. More importantly, the
DE is concerning only the diagonal form of the ground state reduced density
matrix, making it feasible to measure in real experiments, and therefore it has
immediate applications in demonstrating quantum supremacy on state-of-the-art
quantum simulators.
| quant-ph | we investigate the diagonal entropyde of the ground state for quantum manybody systems including the xy model and the ising model with next nearest neighbour interactions we focus on the de of a subsystem of l continuous spins we show that the de in manybody systems regardless of integrability can be represented as a volume term plus a logarithmic correction and a constant offset quantum phase transition points can be explicitly identified by the three coefficients thereof besides by combining entanglement entropy and the relative entropy of quantum coherence as two celebrated representatives of quantumness we simply obtain the de which naturally has the potential to reveal the information of quantumness more importantly the de is concerning only the diagonal form of the ground state reduced density matrix making it feasible to measure in real experiments and therefore it has immediate applications in demonstrating quantum supremacy on stateoftheart quantum simulators | [['we', 'investigate', 'the', 'diagonal', 'entropyde', 'of', 'the', 'ground', 'state', 'for', 'quantum', 'manybody', 'systems', 'including', 'the', 'xy', 'model', 'and', 'the', 'ising', 'model', 'with', 'next', 'nearest', 'neighbour', 'interactions', 'we', 'focus', 'on', 'the', 'de', 'of', 'a', 'subsystem', 'of', 'l', 'continuous', 'spins', 'we', 'show', 'that', 'the', 'de', 'in', 'manybody', 'systems', 'regardless', 'of', 'integrability', 'can', 'be', 'represented', 'as', 'a', 'volume', 'term', 'plus', 'a', 'logarithmic', 'correction', 'and', 'a', 'constant', 'offset', 'quantum', 'phase', 'transition', 'points', 'can', 'be', 'explicitly', 'identified', 'by', 'the', 'three', 'coefficients', 'thereof', 'besides', 'by', 'combining', 'entanglement', 'entropy', 'and', 'the', 'relative', 'entropy', 'of', 'quantum', 'coherence', 'as', 'two', 'celebrated', 'representatives', 'of', 'quantumness', 'we', 'simply', 'obtain', 'the', 'de', 'which', 'naturally', 'has', 'the', 'potential', 'to', 'reveal', 'the', 'information', 'of', 'quantumness', 'more', 'importantly', 'the', 'de', 'is', 'concerning', 'only', 'the', 'diagonal', 'form', 'of', 'the', 'ground', 'state', 'reduced', 'density', 'matrix', 'making', 'it', 'feasible', 'to', 'measure', 'in', 'real', 'experiments', 'and', 'therefore', 'it', 'has', 'immediate', 'applications', 'in', 'demonstrating', 'quantum', 'supremacy', 'on', 'stateoftheart', 'quantum', 'simulators']] | [-0.1550596879831134, 0.13863569506187767, -0.07251664624125978, 0.0836769327897916, -0.001383940207978223, -0.165776811927657, 0.04275599039794921, 0.3098689410663616, -0.25678276815982976, -0.2594568350339846, 0.09443822050320247, -0.3026708617506411, -0.14106624438146118, 0.18248502401660052, -0.009558891577508626, 0.07353145005993995, 0.03476611205264176, 0.08603151139940741, -0.10416137205043045, -0.2539549817960774, 0.3254570943511821, 0.03563446695244427, 0.2553088455179694, 0.052677221840009995, 0.11851638920555178, 0.029385479096004478, 0.041144800225535294, 0.02998613060964584, -0.10697084426710533, 0.0969777498613018, 0.24294622128379326, 0.10406831262520695, 0.23701605727058528, -0.3880801075731948, -0.2205222146179302, 0.1194925342105179, 0.11017940479686997, 0.1709167802754802, -0.0017435167445965273, -0.3397631786557402, 0.031397014383596586, -0.2008415800988074, -0.11823580287796939, -0.12041995537095397, 0.004645891415717818, -0.005474578836095213, -0.21457608372298062, 0.10402198899818597, 0.06911097865907402, 0.0315837364756321, -0.01963971874320367, -0.08208633076099542, -0.017766860735621427, 0.13183774952089178, -0.03416859335109791, 0.030248202704636993, 0.11606449322875013, -0.12471578803363463, -0.15612861673517978, 0.37021875499291407, -0.08718166300158123, -0.18714151068921858, 0.18553818174756614, -0.11749765631624016, -0.10633242100589728, 0.04991486899542229, 0.11471822546582494, 0.0727426603423969, -0.0999940085246684, 0.1347927180597021, 0.00917749859520778, 0.17952513221601313, 0.02307264363524448, 0.08492997819057747, 0.2113020115800752, 0.09348177408796404, 0.08429752037729193, 0.16591804056239295, -0.05829587490641631, -0.1992874086987627, -0.2812039863097778, -0.22941679344043736, -0.2641159706630263, 0.08293696620420321, -0.09559430612912151, -0.1690427486178459, 0.3872660266582373, 0.1370085655592832, 0.19912788630369427, 0.003766876279732725, 0.2491263444660444, 0.11337912919456077, 0.05420939700487351, 0.039197607095597074, 0.23757094771432496, 0.14010826182932962, 0.050638994077008045, -0.25850616244211694, 0.05176205526812364, 0.08685677737816418] |
1,802.08476 | The asymptotic behaviour of convex combinations of firmly nonexpansive
mappings | We show that in the framework of CAT(0) spaces, any convex combination of two
mappings which are firmly nonexpansive -- or which satisfy the more general
property $(P_2)$ -- is asymptotically regular, conditional on its fixed point
set being nonempty, and, in addition, also $\Delta$-convergent to such a fixed
point. These results are established by the construction and study of a convex
combination metric on the Cartesian square of a CAT(0) space. We also derive a
uniform rate of asymptotic regularity in the sense of proof mining. All these
results are then interpreted in the special case of the mappings being
projections onto closed, convex sets.
| math.OC math.FA math.LO | we show that in the framework of cat0 spaces any convex combination of two mappings which are firmly nonexpansive or which satisfy the more general property p_2 is asymptotically regular conditional on its fixed point set being nonempty and in addition also deltaconvergent to such a fixed point these results are established by the construction and study of a convex combination metric on the cartesian square of a cat0 space we also derive a uniform rate of asymptotic regularity in the sense of proof mining all these results are then interpreted in the special case of the mappings being projections onto closed convex sets | [['we', 'show', 'that', 'in', 'the', 'framework', 'of', 'cat0', 'spaces', 'any', 'convex', 'combination', 'of', 'two', 'mappings', 'which', 'are', 'firmly', 'nonexpansive', 'or', 'which', 'satisfy', 'the', 'more', 'general', 'property', 'p_2', 'is', 'asymptotically', 'regular', 'conditional', 'on', 'its', 'fixed', 'point', 'set', 'being', 'nonempty', 'and', 'in', 'addition', 'also', 'deltaconvergent', 'to', 'such', 'a', 'fixed', 'point', 'these', 'results', 'are', 'established', 'by', 'the', 'construction', 'and', 'study', 'of', 'a', 'convex', 'combination', 'metric', 'on', 'the', 'cartesian', 'square', 'of', 'a', 'cat0', 'space', 'we', 'also', 'derive', 'a', 'uniform', 'rate', 'of', 'asymptotic', 'regularity', 'in', 'the', 'sense', 'of', 'proof', 'mining', 'all', 'these', 'results', 'are', 'then', 'interpreted', 'in', 'the', 'special', 'case', 'of', 'the', 'mappings', 'being', 'projections', 'onto', 'closed', 'convex', 'sets']] | [-0.11968043418058637, 0.07905355804527486, -0.07263989219423926, 0.09164147806530186, -0.06469576415217039, -0.0994317987074768, 0.058748953537201706, 0.39833365402464727, -0.2955716047051715, -0.16148296465816936, 0.1751011748915737, -0.2868558408317238, -0.1474889567533273, 0.20608446014213186, -0.12136518437578117, 0.041480512127112956, 0.05655524842169823, 0.06293270346319792, -0.11035802215111704, -0.2773911827922012, 0.3882234293099457, -0.060350051430026884, 0.24196264506950613, 0.043274852128482415, 0.11708703735680545, 0.012778071392761561, -0.02549017449158235, 0.06699151097705307, -0.1533028572615947, 0.13069739638888775, 0.2502176701588538, 0.15564288443985205, 0.28678404617584446, -0.36812656285078493, -0.17108652169914526, 0.1636464186012745, 0.09939066283585667, -0.0004489350345130395, -0.05607661810204572, -0.2650563785403931, 0.11595650701286289, -0.08651670736703769, -0.13459418981236596, -0.09917305915806333, -0.02216327304327951, 0.06669509316595651, -0.2929207764168098, -0.023117932297167305, 0.15361144362035598, 0.08983112817395081, -0.09275260503128062, -0.08867745462113322, -0.059540686828256084, 0.08184881249071976, 0.03227788487277491, 0.08800787578373062, 0.07014211326909875, -0.012570302508482076, -0.09793899863623806, 0.3548638340067661, -0.02090949972060699, -0.29604900494507214, 0.20580764808827667, -0.1905581777490386, -0.15849533458737639, 0.08595042510830697, 0.1597393746623426, 0.1887089703774568, -0.1483125943799042, 0.15017938255716695, -0.13203874873268662, 0.061157982638761293, 0.11935186831425261, 0.051020440331872696, 0.1629130844551238, 0.10699700174437275, 0.15880698373414648, 0.1592434499168642, -0.005434817747547499, -0.11155300220933481, -0.3805665770134192, -0.13726187899095024, -0.19308023640628252, 0.04918213130779637, -0.17085549739857422, -0.21963679586600476, 0.3231160442742691, 0.05371193451246301, 0.18422635047904495, 0.12728508567500824, 0.23726801465726594, 0.08066590664610471, 0.024721105022410168, 0.10757670744358408, 0.1902388481115832, 0.12536369603425626, -0.03805900290291937, -0.10780948944823834, 0.029511685722769753, 0.1813953789583977] |
1,802.08477 | The nonlinear states of viscous capillary jets confined in the axial
direction | We report an experimental and theoretical study of the global stability and
nonlinear dynamics of vertical jets of viscous liquid confined in the axial
direction due to their impact on a bath of the same liquid. Previous works
demonstrated that in the absence of axial confinement the steady liquid thread
becomes unstable due to an axisymmetric global mode for values of the flow
rate, $Q$, below a certain critical value, $Q_c$, giving rise to oscillations
of increasing amplitude that finally lead to a dripping regime (Sauter &
Buggisch, J. Fluid Mech., 2005; Rubio-Rubio et al., J. Fluid Mech., 2013). Here
we focus on the effect of the jet length, $L$, on the transitions that take
place for decreasing values of $Q$. The linear stability analysis shows good
agreement with our experiments, revealing that $Q_c$ increases monotonically
with $L$, reaching the semi-infinite jet asymptote for large values of $L$.
Moreover, as $L$ decreases a quasi-static limit is reached, whereby $Q_c \to 0$
and the neutral conditions are given by a critical length determined by
hydrostatics. Our experiments have also revealed the existence of a new regime
intermediate between steady jetting and dripping, in which the thread reaches a
limit-cycle state without breakup. We thus show that there exist three possible
states depending on the values of the control parameters, namely steady
jetting, oscillatory jetting and dripping. For two different combinations of
liquid viscosity, and injector radius, $R$, the boundaries separating these
regimes have been determined in the $Q-L$ parameter plane, showing that steady
jetting exists for small enough values of $L$ or large enough values of $Q$,
dripping prevails for small enough values of $Q$ or sufficiently large values
of $L$, and oscillatory jetting takes place in an intermediate region whose
size increases with the liquid viscosity and decreases with $R$.
| physics.flu-dyn | we report an experimental and theoretical study of the global stability and nonlinear dynamics of vertical jets of viscous liquid confined in the axial direction due to their impact on a bath of the same liquid previous works demonstrated that in the absence of axial confinement the steady liquid thread becomes unstable due to an axisymmetric global mode for values of the flow rate q below a certain critical value q_c giving rise to oscillations of increasing amplitude that finally lead to a dripping regime sauter buggisch j fluid mech 2005 rubiorubio et al j fluid mech 2013 here we focus on the effect of the jet length l on the transitions that take place for decreasing values of q the linear stability analysis shows good agreement with our experiments revealing that q_c increases monotonically with l reaching the semiinfinite jet asymptote for large values of l moreover as l decreases a quasistatic limit is reached whereby q_c to 0 and the neutral conditions are given by a critical length determined by hydrostatics our experiments have also revealed the existence of a new regime intermediate between steady jetting and dripping in which the thread reaches a limitcycle state without breakup we thus show that there exist three possible states depending on the values of the control parameters namely steady jetting oscillatory jetting and dripping for two different combinations of liquid viscosity and injector radius r the boundaries separating these regimes have been determined in the ql parameter plane showing that steady jetting exists for small enough values of l or large enough values of q dripping prevails for small enough values of q or sufficiently large values of l and oscillatory jetting takes place in an intermediate region whose size increases with the liquid viscosity and decreases with r | [['we', 'report', 'an', 'experimental', 'and', 'theoretical', 'study', 'of', 'the', 'global', 'stability', 'and', 'nonlinear', 'dynamics', 'of', 'vertical', 'jets', 'of', 'viscous', 'liquid', 'confined', 'in', 'the', 'axial', 'direction', 'due', 'to', 'their', 'impact', 'on', 'a', 'bath', 'of', 'the', 'same', 'liquid', 'previous', 'works', 'demonstrated', 'that', 'in', 'the', 'absence', 'of', 'axial', 'confinement', 'the', 'steady', 'liquid', 'thread', 'becomes', 'unstable', 'due', 'to', 'an', 'axisymmetric', 'global', 'mode', 'for', 'values', 'of', 'the', 'flow', 'rate', 'q', 'below', 'a', 'certain', 'critical', 'value', 'q_c', 'giving', 'rise', 'to', 'oscillations', 'of', 'increasing', 'amplitude', 'that', 'finally', 'lead', 'to', 'a', 'dripping', 'regime', 'sauter', 'buggisch', 'j', 'fluid', 'mech', '2005', 'rubiorubio', 'et', 'al', 'j', 'fluid', 'mech', '2013', 'here', 'we', 'focus', 'on', 'the', 'effect', 'of', 'the', 'jet', 'length', 'l', 'on', 'the', 'transitions', 'that', 'take', 'place', 'for', 'decreasing', 'values', 'of', 'q', 'the', 'linear', 'stability', 'analysis', 'shows', 'good', 'agreement', 'with', 'our', 'experiments', 'revealing', 'that', 'q_c', 'increases', 'monotonically', 'with', 'l', 'reaching', 'the', 'semiinfinite', 'jet', 'asymptote', 'for', 'large', 'values', 'of', 'l', 'moreover', 'as', 'l', 'decreases', 'a', 'quasistatic', 'limit', 'is', 'reached', 'whereby', 'q_c', 'to', '0', 'and', 'the', 'neutral', 'conditions', 'are', 'given', 'by', 'a', 'critical', 'length', 'determined', 'by', 'hydrostatics', 'our', 'experiments', 'have', 'also', 'revealed', 'the', 'existence', 'of', 'a', 'new', 'regime', 'intermediate', 'between', 'steady', 'jetting', 'and', 'dripping', 'in', 'which', 'the', 'thread', 'reaches', 'a', 'limitcycle', 'state', 'without', 'breakup', 'we', 'thus', 'show', 'that', 'there', 'exist', 'three', 'possible', 'states', 'depending', 'on', 'the', 'values', 'of', 'the', 'control', 'parameters', 'namely', 'steady', 'jetting', 'oscillatory', 'jetting', 'and', 'dripping', 'for', 'two', 'different', 'combinations', 'of', 'liquid', 'viscosity', 'and', 'injector', 'radius', 'r', 'the', 'boundaries', 'separating', 'these', 'regimes', 'have', 'been', 'determined', 'in', 'the', 'ql', 'parameter', 'plane', 'showing', 'that', 'steady', 'jetting', 'exists', 'for', 'small', 'enough', 'values', 'of', 'l', 'or', 'large', 'enough', 'values', 'of', 'q', 'dripping', 'prevails', 'for', 'small', 'enough', 'values', 'of', 'q', 'or', 'sufficiently', 'large', 'values', 'of', 'l', 'and', 'oscillatory', 'jetting', 'takes', 'place', 'in', 'an', 'intermediate', 'region', 'whose', 'size', 'increases', 'with', 'the', 'liquid', 'viscosity', 'and', 'decreases', 'with', 'r']] | [-0.18208811328172533, 0.21124005439174431, -0.06210329089476806, -0.01901356674149093, -0.01355890900575515, -0.1686199814698938, 0.056886129141220765, 0.3070692755187852, -0.24494892440466617, -0.27596711627509907, 0.07442481417063097, -0.24498793152349088, -0.06627610850113409, 0.1938710802991997, 0.007865815169333953, 0.03603275228638252, 0.03773853246762295, -0.0038302855625723547, -0.056429214934114465, -0.1729672874617218, 0.27594357239112244, 0.04495392391702743, 0.28812288977178313, 0.06509299375436674, 0.10149378897873089, -0.03127654490412849, 0.02596533644681025, 0.07221171716917996, -0.23281654273277394, -0.02416821458296198, 0.21583344082595773, -0.003353336088277826, 0.26990755762518204, -0.4055557056684486, -0.18699816487234097, 0.08134668851537812, 0.156760269503175, 0.10332467580043243, 0.005299121714788975, -0.22338141582558177, 0.07601198300982666, -0.16512967757657265, -0.15915880927985365, -0.05861481219555192, 0.13191744811152445, 0.03563476764698519, -0.2904537630232948, 0.12282197910150504, 0.0983047138371188, 0.06384229793892202, -0.07392594669422257, -0.1337005412433397, -0.07412584455564668, 0.10333223113482849, 0.10474972285546663, 0.044194813034581865, 0.15411533154892149, -0.17004743442727216, -0.04015593050104199, 0.31825069981542503, -0.06918456939324229, -0.1531977355815329, 0.22237277923697474, -0.1778415539137304, -0.055556828901054095, 0.18774204012727747, 0.14690946192427315, 0.0954401091592518, -0.005412351278124082, 0.06177736552250305, -0.05306832301461762, 0.18474249356749284, 0.10585788462345523, -0.020882400324449973, 0.21208406526357035, 0.16977094603398257, 0.0462843705329696, 0.13309083232555777, -0.10850368126383504, -0.1142596051583744, -0.3186894355103474, -0.10520843861888003, -0.14024155939035887, 0.04961522589696364, -0.09416172701374687, -0.16014071715437503, 0.3401694555503476, 0.10884904001152726, 0.25921666643641866, 0.0365764794683849, 0.2296043322574479, 0.10532895797551593, 0.016088871674938283, 0.11476172889215928, 0.30673631816876656, 0.12383439623035791, 0.12828995919275263, -0.273358207387083, 0.060400108005600646, 0.0344508757331857] |
1,802.08478 | Coloring black boxes: visualization of neural network decisions | Neural networks are commonly regarded as black boxes performing
incomprehensible functions. For classification problems networks provide maps
from high dimensional feature space to K-dimensional image space. Images of
training vector are projected on polygon vertices, providing visualization of
network function. Such visualization may show the dynamics of learning, allow
for comparison of different networks, display training vectors around which
potential problems may arise, show differences due to regularization and
optimization procedures, investigate stability of network classification under
perturbation of original vectors, and place new data sample in relation to
training data, allowing for estimation of confidence in classification of a
given sample. An illustrative example for the three-class Wine data and
five-class Satimage data is described. The visualization method proposed here
is applicable to any black box system that provides continuous outputs.
| cs.NE cs.AI cs.LG | neural networks are commonly regarded as black boxes performing incomprehensible functions for classification problems networks provide maps from high dimensional feature space to kdimensional image space images of training vector are projected on polygon vertices providing visualization of network function such visualization may show the dynamics of learning allow for comparison of different networks display training vectors around which potential problems may arise show differences due to regularization and optimization procedures investigate stability of network classification under perturbation of original vectors and place new data sample in relation to training data allowing for estimation of confidence in classification of a given sample an illustrative example for the threeclass wine data and fiveclass satimage data is described the visualization method proposed here is applicable to any black box system that provides continuous outputs | [['neural', 'networks', 'are', 'commonly', 'regarded', 'as', 'black', 'boxes', 'performing', 'incomprehensible', 'functions', 'for', 'classification', 'problems', 'networks', 'provide', 'maps', 'from', 'high', 'dimensional', 'feature', 'space', 'to', 'kdimensional', 'image', 'space', 'images', 'of', 'training', 'vector', 'are', 'projected', 'on', 'polygon', 'vertices', 'providing', 'visualization', 'of', 'network', 'function', 'such', 'visualization', 'may', 'show', 'the', 'dynamics', 'of', 'learning', 'allow', 'for', 'comparison', 'of', 'different', 'networks', 'display', 'training', 'vectors', 'around', 'which', 'potential', 'problems', 'may', 'arise', 'show', 'differences', 'due', 'to', 'regularization', 'and', 'optimization', 'procedures', 'investigate', 'stability', 'of', 'network', 'classification', 'under', 'perturbation', 'of', 'original', 'vectors', 'and', 'place', 'new', 'data', 'sample', 'in', 'relation', 'to', 'training', 'data', 'allowing', 'for', 'estimation', 'of', 'confidence', 'in', 'classification', 'of', 'a', 'given', 'sample', 'an', 'illustrative', 'example', 'for', 'the', 'threeclass', 'wine', 'data', 'and', 'fiveclass', 'satimage', 'data', 'is', 'described', 'the', 'visualization', 'method', 'proposed', 'here', 'is', 'applicable', 'to', 'any', 'black', 'box', 'system', 'that', 'provides', 'continuous', 'outputs']] | [-0.0748459363768574, -0.020172365780147538, -0.04760933359231771, 0.10296115345403353, -0.08780991256180155, -0.17999357867093743, 0.019206231147164608, 0.4101617664297801, -0.26049258080106724, -0.32214012450559903, 0.11733175221766623, -0.2841150012606655, -0.16105150291340725, 0.2202412587171065, -0.11462643807000776, 0.09786616573607876, 0.1410085345469131, 0.017306344546528733, -0.07069014842117219, -0.274581064556313, 0.33577526368570465, 0.024264264432357924, 0.32208990036573915, -0.027273474547759635, 0.13422528046755589, 0.009500471615136551, -0.04012192747349502, 0.017320648011243157, -0.06554463948150928, 0.12370206802045457, 0.3196372500094692, 0.22934115648568246, 0.28231258372925505, -0.4007997872828433, -0.24569156470900502, 0.12705525104667395, 0.17069885569788118, 0.11412250160556002, -0.03753154817702007, -0.3119273390336574, 0.06346184562781527, -0.10898485329119446, -0.04642851808186592, -0.18902614646065155, 0.005391440932809567, -0.0050003338953522785, -0.32252892261932653, 0.07318657747770212, 0.04627684017515365, 0.07583806593369209, -0.08671350352055543, -0.10730000987972439, -0.03729180293157697, 0.1431501688549423, 0.010182934255118816, 0.06871552928528599, 0.12712842133962585, -0.13370119498489214, -0.15077374367761417, 0.37057239592843155, -0.0030797157891606555, -0.23192487071083417, 0.2016387423891432, -0.07147845672887843, -0.12759781713092713, 0.10013575246202126, 0.27955406263669713, 0.09169479373323497, -0.13976814467033358, 0.018991327143013423, -0.026274938628660472, 0.14442811838799077, 0.05184606949706341, 0.001714328207957153, 0.19647330581654887, 0.23253202037699164, 0.053606604458764195, 0.17799571909380096, -0.12254927797022609, -0.05298909351037716, -0.25613709591784095, -0.11313311543799083, -0.21818954171968324, -0.015809249879351554, -0.16733243382139973, -0.19881602384164246, 0.35813566258902313, 0.16101460179219818, 0.24022082420677401, 0.08872013471626058, 0.275446756664692, 0.053651795991810164, 0.09797848932549912, 0.0687442978360612, 0.16826315101890163, 0.06938492091735185, 0.08258481112216379, -0.09989288701668723, 0.038001602113900974, 0.0798454457335885] |
1,802.08479 | Pure spin currents in magnetically ordered insulator/normal metal
heterostructures | Pure spin currents, i.e. the transport of angular momentum without an
accompanying charge current, represent a new, promising avenue in modern
spintronics from both a fundamental and an application point of view. Such pure
spin currents can not only flow in electrical conductors via mobile charge
carriers, but also in magnetically ordered electrical insulators as a flow of
spin excitation quanta. Over the course of the last years remarkable results
have been obtained in heterostructures consisting of magnetically ordered
insulators interfaced with a normal metal, where a pure spin current flows
across the interface. This topical review article deals with the fundamental
principles, experimental findings and recent developments in the field of pure
spin currents in magnetically ordered insulators. We here put our focus onto
four different manifestations of pure spin currents in such heterostructures:
The spin pumping effect, the longitudinal spin Seebeck effect, the spin Hall
magnetoresistance and the all-electrical detection of magnon transport in
non-local device concepts. In this article, we utilize a common theoretical
framework to explain all four effects and explain important material systems
(especially rare-earth iron garnets) used in the experiments. For each effect
we introduce basic measurement techniques and detection schemes and discuss
their application in the experiment. We account for the remarkable progress
achieved in each field by reporting the recent progress in each field and by
discussing research highlights obtained in our group. Finally, we conclude the
review article with an outlook on future challenges and obstacles in the field
of pure spin currents in magnetically ordered insulator / normal metal
heterostructures.
| cond-mat.mes-hall | pure spin currents ie the transport of angular momentum without an accompanying charge current represent a new promising avenue in modern spintronics from both a fundamental and an application point of view such pure spin currents can not only flow in electrical conductors via mobile charge carriers but also in magnetically ordered electrical insulators as a flow of spin excitation quanta over the course of the last years remarkable results have been obtained in heterostructures consisting of magnetically ordered insulators interfaced with a normal metal where a pure spin current flows across the interface this topical review article deals with the fundamental principles experimental findings and recent developments in the field of pure spin currents in magnetically ordered insulators we here put our focus onto four different manifestations of pure spin currents in such heterostructures the spin pumping effect the longitudinal spin seebeck effect the spin hall magnetoresistance and the allelectrical detection of magnon transport in nonlocal device concepts in this article we utilize a common theoretical framework to explain all four effects and explain important material systems especially rareearth iron garnets used in the experiments for each effect we introduce basic measurement techniques and detection schemes and discuss their application in the experiment we account for the remarkable progress achieved in each field by reporting the recent progress in each field and by discussing research highlights obtained in our group finally we conclude the review article with an outlook on future challenges and obstacles in the field of pure spin currents in magnetically ordered insulator normal metal heterostructures | [['pure', 'spin', 'currents', 'ie', 'the', 'transport', 'of', 'angular', 'momentum', 'without', 'an', 'accompanying', 'charge', 'current', 'represent', 'a', 'new', 'promising', 'avenue', 'in', 'modern', 'spintronics', 'from', 'both', 'a', 'fundamental', 'and', 'an', 'application', 'point', 'of', 'view', 'such', 'pure', 'spin', 'currents', 'can', 'not', 'only', 'flow', 'in', 'electrical', 'conductors', 'via', 'mobile', 'charge', 'carriers', 'but', 'also', 'in', 'magnetically', 'ordered', 'electrical', 'insulators', 'as', 'a', 'flow', 'of', 'spin', 'excitation', 'quanta', 'over', 'the', 'course', 'of', 'the', 'last', 'years', 'remarkable', 'results', 'have', 'been', 'obtained', 'in', 'heterostructures', 'consisting', 'of', 'magnetically', 'ordered', 'insulators', 'interfaced', 'with', 'a', 'normal', 'metal', 'where', 'a', 'pure', 'spin', 'current', 'flows', 'across', 'the', 'interface', 'this', 'topical', 'review', 'article', 'deals', 'with', 'the', 'fundamental', 'principles', 'experimental', 'findings', 'and', 'recent', 'developments', 'in', 'the', 'field', 'of', 'pure', 'spin', 'currents', 'in', 'magnetically', 'ordered', 'insulators', 'we', 'here', 'put', 'our', 'focus', 'onto', 'four', 'different', 'manifestations', 'of', 'pure', 'spin', 'currents', 'in', 'such', 'heterostructures', 'the', 'spin', 'pumping', 'effect', 'the', 'longitudinal', 'spin', 'seebeck', 'effect', 'the', 'spin', 'hall', 'magnetoresistance', 'and', 'the', 'allelectrical', 'detection', 'of', 'magnon', 'transport', 'in', 'nonlocal', 'device', 'concepts', 'in', 'this', 'article', 'we', 'utilize', 'a', 'common', 'theoretical', 'framework', 'to', 'explain', 'all', 'four', 'effects', 'and', 'explain', 'important', 'material', 'systems', 'especially', 'rareearth', 'iron', 'garnets', 'used', 'in', 'the', 'experiments', 'for', 'each', 'effect', 'we', 'introduce', 'basic', 'measurement', 'techniques', 'and', 'detection', 'schemes', 'and', 'discuss', 'their', 'application', 'in', 'the', 'experiment', 'we', 'account', 'for', 'the', 'remarkable', 'progress', 'achieved', 'in', 'each', 'field', 'by', 'reporting', 'the', 'recent', 'progress', 'in', 'each', 'field', 'and', 'by', 'discussing', 'research', 'highlights', 'obtained', 'in', 'our', 'group', 'finally', 'we', 'conclude', 'the', 'review', 'article', 'with', 'an', 'outlook', 'on', 'future', 'challenges', 'and', 'obstacles', 'in', 'the', 'field', 'of', 'pure', 'spin', 'currents', 'in', 'magnetically', 'ordered', 'insulator', 'normal', 'metal', 'heterostructures']] | [-0.15995240112691111, 0.19671657832282546, -0.007226436081590512, -0.005386429145962763, -0.04508250690079708, -0.12272845611738538, 0.034837195394438435, 0.3887845029313707, -0.25294076257410486, -0.26929312791049653, 0.05268009392001655, -0.2942718164168269, -0.14474579749959718, 0.2332704103440334, -0.006645247570785575, 0.018219226405598064, -0.014649817379349735, -0.04261466971702845, -0.11163323120174491, -0.1982698034437582, 0.28983220351593836, -0.022394030122985367, 0.34193803138606627, 0.09880259870749297, 0.06742226201481308, 0.029763129327633205, 0.009596669767771104, 0.054491364153490394, -0.13653975979568397, 0.10682715516731603, 0.2985479315081216, -0.04273324406482855, 0.2043776672196837, -0.515142666456437, -0.21285770299150447, 0.004559218092429592, 0.10638534821368553, 0.17399574069505824, -0.14251945694795232, -0.27601790003852494, 0.017536740189348077, -0.21730717717090975, -0.11525892090282949, -0.09515179331642737, 0.011392143783995588, -0.01352101461903433, -0.1959998352510646, 0.0605854262330643, 0.09627376805854293, 0.10255093321889193, -0.06685337902794675, -0.15768596687098843, -0.022073849068386445, 0.08723377681635752, 0.06257325754784997, 0.0478372086670149, 0.16097827815935267, -0.17641684603176178, -0.22891600258849762, 0.3289115635973031, -0.06997339722802, -0.14176653233683995, 0.17238388978426694, -0.19446670345990813, -0.11774072002369594, 0.08363617379146424, 0.15852355261505888, 0.12426101529393632, -0.15348152934778553, 0.06392937949876586, -0.016487047453788487, 0.09834104431957154, -0.015254096422905396, 0.09459740732720978, 0.3371141399113051, 0.21561578595579303, 0.035365022351231755, 0.1247520916780608, -0.09146333902419822, -0.05829091945080568, -0.2427822079978754, -0.22037782952095952, -0.1751966590504971, 0.08968362763339094, -0.010953000010868614, -0.1257990226257434, 0.4360198073743566, 0.2095387110932567, 0.1477361446260888, -0.10026746288197687, 0.3043081110746071, 0.0649850363955513, 0.05148172879710247, 0.03654633025174896, 0.24591830839235768, 0.19035911922699064, 0.15421605409477193, -0.24428381619868894, 0.0524215853934196, -0.00849988785753041] |
1,802.0848 | Local geometric control of a certain mechanism with the growth vector
(4,7) | We study local control of the mechanism with the growth vector (4,7). We
study controllability and extremal trajectories on the nilpotent approximation
as an example of the control theory on Lie group. We give solutions of the
system an show examples of local extremal trajectories.
| math.DG | we study local control of the mechanism with the growth vector 47 we study controllability and extremal trajectories on the nilpotent approximation as an example of the control theory on lie group we give solutions of the system an show examples of local extremal trajectories | [['we', 'study', 'local', 'control', 'of', 'the', 'mechanism', 'with', 'the', 'growth', 'vector', '47', 'we', 'study', 'controllability', 'and', 'extremal', 'trajectories', 'on', 'the', 'nilpotent', 'approximation', 'as', 'an', 'example', 'of', 'the', 'control', 'theory', 'on', 'lie', 'group', 'we', 'give', 'solutions', 'of', 'the', 'system', 'an', 'show', 'examples', 'of', 'local', 'extremal', 'trajectories']] | [-0.19336228030216362, 0.027413247779865438, -0.0850137383159664, 0.037128499812550016, -0.03190372958779335, -0.07031096890568733, 0.022872540052048862, 0.33441458215109177, -0.28799486094050936, -0.27642163071367476, 0.1383421642602318, -0.29608370278858476, -0.1963183751122819, 0.18920229193237093, -0.05859223397241698, 0.04095045295026567, 0.021063599756194484, 0.1272271935375304, -0.05563341228084432, -0.2493821629219585, 0.3551652650762763, 0.007891674029330413, 0.26771155839992894, 0.004822683148086071, 0.14083615615963935, 0.05924582054528097, 0.030012563719517656, -0.002510620653629303, -0.19925542482071454, 0.13400362303687466, 0.17989348462886282, 0.12350889082170195, 0.26542476266622544, -0.415807968378067, -0.1501994542674058, 0.12113599013537169, 0.1448643617849383, 0.1260694707226422, -0.11744976229448285, -0.2722959860538443, 0.09052924596601063, -0.13529692474338745, -0.2059629597597652, -0.1147759245087703, 0.0024765811964041658, 0.05207858644037818, -0.216028706698368, 0.031431639649801786, 0.0897747150932749, 0.10467570488237672, -0.19628071435209776, -0.005944277709932067, -0.020106819768746693, 0.09761822575496303, 0.022950944056113563, -0.04428312283837133, 0.14465370408983694, -0.1085379232859446, -0.1872186430212524, 0.34152435859044394, -0.04909663808325099, -0.22683841748577024, 0.1845136355401741, -0.1638239691654841, -0.10174534918947352, 0.05298722990685039, 0.23149901408081253, 0.220980031374428, -0.12053405897070964, 0.14316285268998602, -0.09364397186372016, 0.08426828570663929, 0.008915931814246707, 0.01480365213420656, 0.13453444433915945, 0.1682161015147964, 0.149870660673413, 0.13339739924089777, -0.013301706583135658, -0.10217255767848757, -0.38286398119396636, -0.15139542677336268, -0.08571315258741379, 0.10899206532372369, -0.13748217335766336, -0.2047716837790277, 0.4525514072428147, 0.12117612912423081, 0.22337185376220278, 0.07235011655009455, 0.19438061093290646, 0.14911106429321486, -0.008771133464243677, 0.0773621337281333, 0.22529809441831378, 0.18059216294851568, -0.013780006621446874, -0.2604312933360537, -0.0017562513136201434, 0.13503196727898387] |
1,802.08481 | A femtoscopic Correlation Analysis Tool using the Schr\"odinger equation
(CATS) | We present a new analysis framework called "Correlation Analysis Tool using
the Schr\"odinger equation" (CATS) which computes the two-particle femtoscopy
correlation function $C(k)$, with $k$ being the relative momentum for the
particle pair. Any local interaction potential and emission source function can
be used as an input and the wave function is evaluated exactly. In this paper
we present a study on the sensitivity of $C(k)$ to the interaction potential
for different particle pairs: p-p, p-$\mathrm{\Lambda}$, $\mathrm{K^-}$-p,
$\mathrm{K^+}$-p, p-$\mathrm{\Xi}^-$ and $\mathrm{\Lambda}$-$\mathrm{\Lambda}$.
For the p-p Argonne $v_{18}$ and Reid Soft-Core potentials have been tested.
For the other pair systems we present results based on strong potentials
obtained from effective Lagrangians such as $\chi$EFT for p-$\mathrm{\Lambda}$,
J\"ulich models for $\mathrm{K(\bar{K})}$-N and Nijmegen models for
$\mathrm{\Lambda}$-$\mathrm{\Lambda}$. For the p-$\mathrm{\Xi}^-$ pairs we
employ the latest lattice results from the HAL QCD collaboration. Our detailed
study of different interacting particle pairs as a function of the source size
and different potentials shows that femtoscopic measurements can be exploited
in order to constrain the final state interactions among hadrons. In
particular, small collision systems of the order of 1~fm, as produced in pp
collisions at the LHC, seem to provide a suitable environment for quantitative
studies of this kind.
| hep-ph hep-ex nucl-ex nucl-th | we present a new analysis framework called correlation analysis tool using the schrodinger equation cats which computes the twoparticle femtoscopy correlation function ck with k being the relative momentum for the particle pair any local interaction potential and emission source function can be used as an input and the wave function is evaluated exactly in this paper we present a study on the sensitivity of ck to the interaction potential for different particle pairs pp pmathrmlambda mathrmkp mathrmkp pmathrmxi and mathrmlambdamathrmlambda for the pp argonne v_18 and reid softcore potentials have been tested for the other pair systems we present results based on strong potentials obtained from effective lagrangians such as chieft for pmathrmlambda julich models for mathrmkbarkn and nijmegen models for mathrmlambdamathrmlambda for the pmathrmxi pairs we employ the latest lattice results from the hal qcd collaboration our detailed study of different interacting particle pairs as a function of the source size and different potentials shows that femtoscopic measurements can be exploited in order to constrain the final state interactions among hadrons in particular small collision systems of the order of 1fm as produced in pp collisions at the lhc seem to provide a suitable environment for quantitative studies of this kind | [['we', 'present', 'a', 'new', 'analysis', 'framework', 'called', 'correlation', 'analysis', 'tool', 'using', 'the', 'schrodinger', 'equation', 'cats', 'which', 'computes', 'the', 'twoparticle', 'femtoscopy', 'correlation', 'function', 'ck', 'with', 'k', 'being', 'the', 'relative', 'momentum', 'for', 'the', 'particle', 'pair', 'any', 'local', 'interaction', 'potential', 'and', 'emission', 'source', 'function', 'can', 'be', 'used', 'as', 'an', 'input', 'and', 'the', 'wave', 'function', 'is', 'evaluated', 'exactly', 'in', 'this', 'paper', 'we', 'present', 'a', 'study', 'on', 'the', 'sensitivity', 'of', 'ck', 'to', 'the', 'interaction', 'potential', 'for', 'different', 'particle', 'pairs', 'pp', 'pmathrmlambda', 'mathrmkp', 'mathrmkp', 'pmathrmxi', 'and', 'mathrmlambdamathrmlambda', 'for', 'the', 'pp', 'argonne', 'v_18', 'and', 'reid', 'softcore', 'potentials', 'have', 'been', 'tested', 'for', 'the', 'other', 'pair', 'systems', 'we', 'present', 'results', 'based', 'on', 'strong', 'potentials', 'obtained', 'from', 'effective', 'lagrangians', 'such', 'as', 'chieft', 'for', 'pmathrmlambda', 'julich', 'models', 'for', 'mathrmkbarkn', 'and', 'nijmegen', 'models', 'for', 'mathrmlambdamathrmlambda', 'for', 'the', 'pmathrmxi', 'pairs', 'we', 'employ', 'the', 'latest', 'lattice', 'results', 'from', 'the', 'hal', 'qcd', 'collaboration', 'our', 'detailed', 'study', 'of', 'different', 'interacting', 'particle', 'pairs', 'as', 'a', 'function', 'of', 'the', 'source', 'size', 'and', 'different', 'potentials', 'shows', 'that', 'femtoscopic', 'measurements', 'can', 'be', 'exploited', 'in', 'order', 'to', 'constrain', 'the', 'final', 'state', 'interactions', 'among', 'hadrons', 'in', 'particular', 'small', 'collision', 'systems', 'of', 'the', 'order', 'of', '1fm', 'as', 'produced', 'in', 'pp', 'collisions', 'at', 'the', 'lhc', 'seem', 'to', 'provide', 'a', 'suitable', 'environment', 'for', 'quantitative', 'studies', 'of', 'this', 'kind']] | [-0.07870094063549246, 0.09413119632941112, -0.12957258292441778, 0.10958744814187023, -0.008819071758937622, -0.11670128166038847, -0.040201188970894114, 0.3556362966999735, -0.20356391192584924, -0.2952417389641763, -0.00013117098287508195, -0.33080546420343143, -0.07323891750527356, 0.18303315875260634, 0.08872728161686053, 0.08644530723080496, 0.10316364939338812, 0.02874400898026022, -0.047747587061686705, -0.1841872606927776, 0.3476029787894471, 0.04950814220427098, 0.21268837206699406, 0.12929314473757939, 0.07692407159614661, 0.07796268215003822, -0.021194810283249148, 0.003000029948378476, -0.11308073462837177, 0.09639614384650486, 0.22243691403621466, 0.09354778535412245, 0.18882025342330108, -0.3844558945203637, -0.19195863094634605, 0.12497905901234065, 0.1388189950265936, 0.12498712458835477, -0.07897257357978318, -0.3178867698012737, 0.07465550047211819, -0.2110177071822085, -0.13501716233143696, -0.08877814274604376, 0.03114375501321106, 0.07450482913302447, -0.32499472486159325, 0.06904272685389923, -0.017471997472521438, 0.06854877323957578, -0.06597387037781656, -0.16124726946902823, -0.002740953669987847, 0.10460887067210005, -0.00017643802709003189, 0.09863771695040205, 0.10317532964970214, -0.13340541024927563, -0.12961649357718985, 0.40245904345825617, -0.0823743422681998, -0.1859883921213771, 0.23592680642810146, -0.11414779692042466, -0.1358568832059676, 0.07110128571737881, 0.2352112804026324, 0.10468960480707488, -0.20991959890863876, 0.06677395203780402, -0.01728925443403197, 0.16845507067996457, 0.03875323852562174, 0.03439428091550493, 0.1630451707739611, 0.14968697313927304, 0.00029232693783824845, 0.13131843186702286, -0.08258851241481928, -0.07969604511994735, -0.34488694741787407, -0.10997953867226155, -0.17911074577464856, 0.0021424858877049256, -0.05664226470936246, -0.10296001934626957, 0.3933583629240813, 0.12936294947427754, 0.21758383758157035, 0.02116487574305062, 0.2612937583483528, 0.11407995252033734, 0.06307074768891634, 0.03486216353722943, 0.2629599046931431, 0.09241520207760172, 0.12260972782826926, -0.2172438284424989, 0.00670727443102063, 0.07361335149129891] |
1,802.08482 | The electric quadrupole channel of the 7.8 eV $~^{229}\mathrm{Th}$
transition | The unique isomeric transition at 7.8 eV in $~^{229}\mathrm{Th}$ has a
magnetic dipole ($M1$) and an electric quadrupole ($E2$) multipole mixing. So
far, the $E2$ component has been widely disregarded. Here, we investigate the
nuclear physics nature and the impact of the $E2$ decay channel for the nuclear
coupling to the atomic shell based on the newest theoretical predictions for
the corresponding reduced nuclear transition probabilities. Our results show
that the contribution of the $E2$ channel is dominant or at least of the same
order of magnitude for internal conversion or electronic bridge transitions
involving the atomic orbitals $7p$, $6d$ and $5f$. Notable exceptions are the
internal conversion of the $7s$ electron and the electronic bridge between the
electronic states $7s$ and $7p$, for which the $M1$ component dominates by two
to three orders of magnitude. Caution is therefore advised when considering
isomeric excitation or decay via nuclear coupling to the atomic shell, as the
involved orbitals determine which multipole transition component dominates.
| nucl-th physics.atom-ph | the unique isomeric transition at 78 ev in 229mathrmth has a magnetic dipole m1 and an electric quadrupole e2 multipole mixing so far the e2 component has been widely disregarded here we investigate the nuclear physics nature and the impact of the e2 decay channel for the nuclear coupling to the atomic shell based on the newest theoretical predictions for the corresponding reduced nuclear transition probabilities our results show that the contribution of the e2 channel is dominant or at least of the same order of magnitude for internal conversion or electronic bridge transitions involving the atomic orbitals 7p 6d and 5f notable exceptions are the internal conversion of the 7s electron and the electronic bridge between the electronic states 7s and 7p for which the m1 component dominates by two to three orders of magnitude caution is therefore advised when considering isomeric excitation or decay via nuclear coupling to the atomic shell as the involved orbitals determine which multipole transition component dominates | [['the', 'unique', 'isomeric', 'transition', 'at', '78', 'ev', 'in', '229mathrmth', 'has', 'a', 'magnetic', 'dipole', 'm1', 'and', 'an', 'electric', 'quadrupole', 'e2', 'multipole', 'mixing', 'so', 'far', 'the', 'e2', 'component', 'has', 'been', 'widely', 'disregarded', 'here', 'we', 'investigate', 'the', 'nuclear', 'physics', 'nature', 'and', 'the', 'impact', 'of', 'the', 'e2', 'decay', 'channel', 'for', 'the', 'nuclear', 'coupling', 'to', 'the', 'atomic', 'shell', 'based', 'on', 'the', 'newest', 'theoretical', 'predictions', 'for', 'the', 'corresponding', 'reduced', 'nuclear', 'transition', 'probabilities', 'our', 'results', 'show', 'that', 'the', 'contribution', 'of', 'the', 'e2', 'channel', 'is', 'dominant', 'or', 'at', 'least', 'of', 'the', 'same', 'order', 'of', 'magnitude', 'for', 'internal', 'conversion', 'or', 'electronic', 'bridge', 'transitions', 'involving', 'the', 'atomic', 'orbitals', '7p', '6d', 'and', '5f', 'notable', 'exceptions', 'are', 'the', 'internal', 'conversion', 'of', 'the', '7s', 'electron', 'and', 'the', 'electronic', 'bridge', 'between', 'the', 'electronic', 'states', '7s', 'and', '7p', 'for', 'which', 'the', 'm1', 'component', 'dominates', 'by', 'two', 'to', 'three', 'orders', 'of', 'magnitude', 'caution', 'is', 'therefore', 'advised', 'when', 'considering', 'isomeric', 'excitation', 'or', 'decay', 'via', 'nuclear', 'coupling', 'to', 'the', 'atomic', 'shell', 'as', 'the', 'involved', 'orbitals', 'determine', 'which', 'multipole', 'transition', 'component', 'dominates']] | [-0.09609100594541725, 0.20295388915406806, 0.02384849433660691, 0.08499991137931054, 0.002736094157659897, -0.07966646329890707, 0.0563953555315549, 0.35548376548391436, -0.213240027749612, -0.3073479961258946, 0.005471489319281745, -0.321340579505044, -0.033079023714418766, 0.10287941199940066, 0.12641192655607966, -0.03173726749962863, -0.014467409044435178, 0.0411706593313059, -0.09094859399102674, -0.10255097080974977, 0.3010950272925842, 0.06218964058077998, 0.2558120779583897, 0.09313258773181587, 0.029042722973512645, -0.04683308273030698, 0.0557728824723098, -0.08415271113856615, -0.10300905714092674, 0.10656258472590707, 0.25632368315177984, 0.010391075636927084, 0.19402719550639574, -0.45881400832239494, -0.1378833976528251, 0.05483911482668999, 0.16420772970858155, 0.1229224440725779, -0.028593309508941286, -0.2804751152943038, 0.023706029098837372, -0.19224402612581112, -0.09316512969334001, -0.1035368768527046, 0.07419251305242298, 0.0028728945267007307, -0.28617228224965524, 0.0844270679129598, 0.04339980993155436, 0.051425232787697034, -0.09930950985577555, -0.22637068575972485, -0.04102755269972769, 0.12128162783097021, 0.08502538880709858, 0.04787068922837253, 0.16186335316663722, -0.113415887510335, -0.10929781765918489, 0.42127328247613743, -0.034501678113794, -0.08927577037226271, 0.1464483158146951, -0.1885170354974962, -0.12461950580293404, 0.20332170883049888, 0.08480032152829715, 0.08281468915074695, -0.08877589562694027, 0.07769701559560799, 0.06056621462612608, 0.18819259670074384, 0.058199828419472195, 0.07863629817456742, 0.18286880942199518, 0.13254890240654119, 0.03314615924624197, 0.07144306245817585, -0.16735341403069964, -0.08957330268422532, -0.2671027049295788, -0.13057546984306595, -0.18954082025950889, 0.07565940493706291, -0.03536406925397589, -0.12941200582793466, 0.4194971965568393, 0.05528810884470097, 0.1466866936304687, -0.08863889626773465, 0.2964637527949418, 0.13942292767517947, 0.047450622670168495, 0.04082432355053355, 0.3543298862138648, 0.1865844027912474, 0.022839718024004942, -0.32199193675783866, 0.06269039686792242, 0.021349120928250528] |
1,802.08483 | GPU Implementation and Optimization of a Flexible MAP Decoder for
Synchronization Correction | In this paper we present an optimized parallel implementation of a flexible
MAP decoder for synchronization error correcting codes, supporting a very wide
range of code sizes and channel conditions. On mid-range GPUs we demonstrate
decoding speedups of more than two orders of magnitude over a CPU
implementation of the same optimized algorithm, and more than an order of
magnitude over our earlier GPU implementation. The prominent challenge is to
maintain high parallelization efficiency over a wide range of code sizes and
channel conditions, and different execution hardware. We ensure this with a
dynamic strategy for choosing parallel execution parameters at run-time. We
also present a variant that trades off some decoding speed for significantly
reduced memory requirement, with no loss to the decoder's error correction
performance. The increased throughput of our implementation and its ability to
work with less memory allow us to analyse larger codes and poorer channel
conditions, and makes practical use of such codes more feasible.
| cs.DC cs.IT math.IT | in this paper we present an optimized parallel implementation of a flexible map decoder for synchronization error correcting codes supporting a very wide range of code sizes and channel conditions on midrange gpus we demonstrate decoding speedups of more than two orders of magnitude over a cpu implementation of the same optimized algorithm and more than an order of magnitude over our earlier gpu implementation the prominent challenge is to maintain high parallelization efficiency over a wide range of code sizes and channel conditions and different execution hardware we ensure this with a dynamic strategy for choosing parallel execution parameters at runtime we also present a variant that trades off some decoding speed for significantly reduced memory requirement with no loss to the decoders error correction performance the increased throughput of our implementation and its ability to work with less memory allow us to analyse larger codes and poorer channel conditions and makes practical use of such codes more feasible | [['in', 'this', 'paper', 'we', 'present', 'an', 'optimized', 'parallel', 'implementation', 'of', 'a', 'flexible', 'map', 'decoder', 'for', 'synchronization', 'error', 'correcting', 'codes', 'supporting', 'a', 'very', 'wide', 'range', 'of', 'code', 'sizes', 'and', 'channel', 'conditions', 'on', 'midrange', 'gpus', 'we', 'demonstrate', 'decoding', 'speedups', 'of', 'more', 'than', 'two', 'orders', 'of', 'magnitude', 'over', 'a', 'cpu', 'implementation', 'of', 'the', 'same', 'optimized', 'algorithm', 'and', 'more', 'than', 'an', 'order', 'of', 'magnitude', 'over', 'our', 'earlier', 'gpu', 'implementation', 'the', 'prominent', 'challenge', 'is', 'to', 'maintain', 'high', 'parallelization', 'efficiency', 'over', 'a', 'wide', 'range', 'of', 'code', 'sizes', 'and', 'channel', 'conditions', 'and', 'different', 'execution', 'hardware', 'we', 'ensure', 'this', 'with', 'a', 'dynamic', 'strategy', 'for', 'choosing', 'parallel', 'execution', 'parameters', 'at', 'runtime', 'we', 'also', 'present', 'a', 'variant', 'that', 'trades', 'off', 'some', 'decoding', 'speed', 'for', 'significantly', 'reduced', 'memory', 'requirement', 'with', 'no', 'loss', 'to', 'the', 'decoders', 'error', 'correction', 'performance', 'the', 'increased', 'throughput', 'of', 'our', 'implementation', 'and', 'its', 'ability', 'to', 'work', 'with', 'less', 'memory', 'allow', 'us', 'to', 'analyse', 'larger', 'codes', 'and', 'poorer', 'channel', 'conditions', 'and', 'makes', 'practical', 'use', 'of', 'such', 'codes', 'more', 'feasible']] | [-0.17371927079584565, 0.00994105268491694, -0.049296465402585456, 0.04583623010767042, -0.0664660272115725, -0.20722338733321521, 0.08742374585781362, 0.4699669576017186, -0.2459539021976525, -0.37175479938741773, 0.10796287415651022, -0.16302106526272836, -0.08739862745569553, 0.2676176882057916, -0.1010299382294761, 0.09244083992634841, 0.13612371273338794, -0.019995283785101493, -0.16476788984728047, -0.3378479943028651, 0.1999924402072793, 0.17695335778553273, 0.27947689200082093, 0.032376311620464546, 0.09534406972088619, -0.01674813748395536, 0.00031233578702085654, -0.03117944259720389, -0.10421938814565693, 0.12256024729867931, 0.23797846722154645, 0.15783969093172345, 0.2942821953911334, -0.4142417609982658, -0.17440451447764643, 0.06589060739497654, 0.14337939647375605, 0.12966124061204026, -0.025926084185539367, -0.19455492234556004, 0.1513464782605297, -0.23788440540665762, -0.027393148897681387, -0.07776128168043214, -0.00278272032555833, -0.009744435430911835, -0.2998199165042024, -0.011469394173946056, 0.029691667783481535, 0.07387591417063959, -0.00456184212162043, -0.14324197174864822, 0.06488411780592288, 0.10360992254281882, -0.005116605119837914, 0.03867946067330195, 0.1125682283542119, -0.11225155521242414, -0.11592707174131647, 0.37186401495710014, -0.02343472409138485, -0.1971671546657717, 0.2032087692332425, -0.05349156171505456, -0.09200279102078639, 0.16954449021141044, 0.24596668552258052, 0.08676482407317962, -0.1135376875732618, -0.0011516068767377873, 0.05940460833953694, 0.2450845784478588, 0.09088883101430838, 0.11580848825324211, 0.1095048018862144, 0.23496036354918032, 0.10366083441185765, 0.18487743870937265, -0.08841735047608382, -0.11436735753813991, -0.25098369689658284, -0.16423471300076925, -0.13741832733358023, -0.023993933340534568, -0.15700130235354665, -0.14060681667469907, 0.4023667113273405, 0.24336575019242446, 0.12942093215533532, 0.1733405657345429, 0.36613922074902805, 0.02907668650150299, 0.15357518703385722, 0.20500130178406833, 0.13113003368871431, 0.06452588447718881, 0.0944157971367531, -0.22647872964007548, 0.07137186613981612, -0.03959443782223389] |
1,802.08484 | Business Rules in e-Government Applications | The introduction of Information and Communication Technologies (ICT) into
public administrations has been radically changing the way organizations
cooperate and, more generally, the way to think about business processes over
organizational boundaries. In this paper we describe our approach to combining
business processes with business rules in order to integrate effectively single
units in an inter- or intra-organizational cooperation. Business rules
represent the knowledge that an administration has about its business; with
regard to this, they can express strategies, contracts and can influence not
only staff relations, but, finally, citizen relations, as well. In other words,
business rules are the core of an administration and affect either the business
processes or the behaviours of the system participants. They are typically
expressed implicitly in business contracts and they are embedded within the
source code of many application modules. So a concise and declarative statement
of business behaviour is converted into a set of programming instructions,
which are spread widely throughout the whole information system. In this way,
business rules are difficult to change and keep consistent over the time. For
this reason, it is necessary to reengineer the system in order to logically and
perhaps physically externalize rules from the application code. In our proposed
approach, we describe a cooperation as a collection of tasks combined in
certain ways according to the organization logic specified by business rules.
Our rule-driven methodology has the goal to make the business process design
more adaptable to the changes of internal or external environment.
| cs.SE | the introduction of information and communication technologies ict into public administrations has been radically changing the way organizations cooperate and more generally the way to think about business processes over organizational boundaries in this paper we describe our approach to combining business processes with business rules in order to integrate effectively single units in an inter or intraorganizational cooperation business rules represent the knowledge that an administration has about its business with regard to this they can express strategies contracts and can influence not only staff relations but finally citizen relations as well in other words business rules are the core of an administration and affect either the business processes or the behaviours of the system participants they are typically expressed implicitly in business contracts and they are embedded within the source code of many application modules so a concise and declarative statement of business behaviour is converted into a set of programming instructions which are spread widely throughout the whole information system in this way business rules are difficult to change and keep consistent over the time for this reason it is necessary to reengineer the system in order to logically and perhaps physically externalize rules from the application code in our proposed approach we describe a cooperation as a collection of tasks combined in certain ways according to the organization logic specified by business rules our ruledriven methodology has the goal to make the business process design more adaptable to the changes of internal or external environment | [['the', 'introduction', 'of', 'information', 'and', 'communication', 'technologies', 'ict', 'into', 'public', 'administrations', 'has', 'been', 'radically', 'changing', 'the', 'way', 'organizations', 'cooperate', 'and', 'more', 'generally', 'the', 'way', 'to', 'think', 'about', 'business', 'processes', 'over', 'organizational', 'boundaries', 'in', 'this', 'paper', 'we', 'describe', 'our', 'approach', 'to', 'combining', 'business', 'processes', 'with', 'business', 'rules', 'in', 'order', 'to', 'integrate', 'effectively', 'single', 'units', 'in', 'an', 'inter', 'or', 'intraorganizational', 'cooperation', 'business', 'rules', 'represent', 'the', 'knowledge', 'that', 'an', 'administration', 'has', 'about', 'its', 'business', 'with', 'regard', 'to', 'this', 'they', 'can', 'express', 'strategies', 'contracts', 'and', 'can', 'influence', 'not', 'only', 'staff', 'relations', 'but', 'finally', 'citizen', 'relations', 'as', 'well', 'in', 'other', 'words', 'business', 'rules', 'are', 'the', 'core', 'of', 'an', 'administration', 'and', 'affect', 'either', 'the', 'business', 'processes', 'or', 'the', 'behaviours', 'of', 'the', 'system', 'participants', 'they', 'are', 'typically', 'expressed', 'implicitly', 'in', 'business', 'contracts', 'and', 'they', 'are', 'embedded', 'within', 'the', 'source', 'code', 'of', 'many', 'application', 'modules', 'so', 'a', 'concise', 'and', 'declarative', 'statement', 'of', 'business', 'behaviour', 'is', 'converted', 'into', 'a', 'set', 'of', 'programming', 'instructions', 'which', 'are', 'spread', 'widely', 'throughout', 'the', 'whole', 'information', 'system', 'in', 'this', 'way', 'business', 'rules', 'are', 'difficult', 'to', 'change', 'and', 'keep', 'consistent', 'over', 'the', 'time', 'for', 'this', 'reason', 'it', 'is', 'necessary', 'to', 'reengineer', 'the', 'system', 'in', 'order', 'to', 'logically', 'and', 'perhaps', 'physically', 'externalize', 'rules', 'from', 'the', 'application', 'code', 'in', 'our', 'proposed', 'approach', 'we', 'describe', 'a', 'cooperation', 'as', 'a', 'collection', 'of', 'tasks', 'combined', 'in', 'certain', 'ways', 'according', 'to', 'the', 'organization', 'logic', 'specified', 'by', 'business', 'rules', 'our', 'ruledriven', 'methodology', 'has', 'the', 'goal', 'to', 'make', 'the', 'business', 'process', 'design', 'more', 'adaptable', 'to', 'the', 'changes', 'of', 'internal', 'or', 'external', 'environment']] | [-0.09370664496490934, 0.06890241245908174, -0.0857273429514369, 0.08753887574770867, -0.14875372368692752, -0.12394144191373005, 0.10554646346091581, 0.41562474040262193, -0.30122032061772774, -0.33690679780802274, 0.11405737867838811, -0.2538542691094569, -0.14457536110000865, 0.15567423437743533, -0.12023557433634098, 0.005101964885441878, 0.0323107271421566, 0.052577113604591975, 0.017472485977554148, -0.275300680475504, 0.29172835369542033, 0.02906030573205177, 0.29752492288737203, 0.04112378934241203, 0.04674723385515282, -0.005634090915064226, -0.060052472073210766, -0.0329668095841058, -0.06137103225440783, 0.15308637163173675, 0.3614012881941405, 0.24443105502656276, 0.32555910066073107, -0.45643544005581654, -0.15498103507715894, 0.07222864243863936, 0.15224874069788924, 0.07210390020421814, 0.05385238992180731, -0.2853918641124923, 0.05695315463953263, -0.2422730513945611, -0.10729357912523081, -0.12359710292512903, 0.005305787279124719, 0.011571531832249963, -0.25029115935686574, -0.05944121245249926, 0.08063903174608063, 0.0774280808596726, -0.044507001867133515, -0.07726404095586599, -0.04256037066608338, 0.21119197137582763, 0.05042056221995095, -0.0027684610080811753, 0.18091993471027826, -0.1357591299818881, -0.14978579749319568, 0.41062161386065393, 0.024268714438733012, -0.20516603567214856, 0.20415611602609088, -0.0780552958108365, -0.1444586137913721, 0.07969422951288312, 0.1964093876692156, 0.04890376401328329, -0.245318640262846, 0.03156480937892287, 0.04411854685740508, 0.1868015740994349, 0.06770564894749218, 0.025649966786140538, 0.2457617783178407, 0.1891763723272097, 0.0647886255323554, 0.08706482769907396, 0.056778695182799994, -0.16696858325090455, -0.254332238788638, -0.15978644047321444, -0.08135603277861743, 0.013314863896975948, -0.06641813083065591, -0.14687629811181482, 0.355432635179747, 0.19488913284794215, 0.11875360666603096, 0.029838057444804913, 0.3128239438124749, 0.06557300246053471, 0.15031503655935588, 0.07330545162348204, 0.1526595460836323, 0.025334188232131034, 0.19325636212347472, -0.1320224215003501, 0.1652480300691682, -0.025897277035679383] |
1,802.08485 | Subgroups of elliptic elements of the Cremona group | The Cremona group is the group of birational transformations of the complex
projective plane. In this paper we classify its subgroups that consist only of
elliptic elements using elementary model theory. This yields in particular a
description of the structure of torsion subgroups. As an appliction, we prove
the Tits alternative for arbitrary subgroups of the Cremona group, generalizing
a result of Cantat. We also describe solvable subgroups of the Cremona group
and their derived length, refining results from D\'eserti.
| math.AG math.GR | the cremona group is the group of birational transformations of the complex projective plane in this paper we classify its subgroups that consist only of elliptic elements using elementary model theory this yields in particular a description of the structure of torsion subgroups as an appliction we prove the tits alternative for arbitrary subgroups of the cremona group generalizing a result of cantat we also describe solvable subgroups of the cremona group and their derived length refining results from deserti | [['the', 'cremona', 'group', 'is', 'the', 'group', 'of', 'birational', 'transformations', 'of', 'the', 'complex', 'projective', 'plane', 'in', 'this', 'paper', 'we', 'classify', 'its', 'subgroups', 'that', 'consist', 'only', 'of', 'elliptic', 'elements', 'using', 'elementary', 'model', 'theory', 'this', 'yields', 'in', 'particular', 'a', 'description', 'of', 'the', 'structure', 'of', 'torsion', 'subgroups', 'as', 'an', 'appliction', 'we', 'prove', 'the', 'tits', 'alternative', 'for', 'arbitrary', 'subgroups', 'of', 'the', 'cremona', 'group', 'generalizing', 'a', 'result', 'of', 'cantat', 'we', 'also', 'describe', 'solvable', 'subgroups', 'of', 'the', 'cremona', 'group', 'and', 'their', 'derived', 'length', 'refining', 'results', 'from', 'deserti']] | [-0.1810983126409925, 0.049911167486220036, -0.14499914629432636, 0.025911326202241562, -0.11445494031963441, -0.06923728871445817, -0.00016985821107832284, 0.3547364115380706, -0.33309735324926293, -0.22863976443664003, 0.0712294314468566, -0.26090782571536225, -0.1405251614983755, 0.22517505795276987, -0.1544147154961068, -0.054816163766633674, 0.001980694207864312, 0.09250691083546442, -0.12305447850555468, -0.2973204435368713, 0.3929024336184972, -0.03821808080642651, 0.23460181766392615, -0.0277805302101068, 0.10972941374609199, 0.05914581848236804, -0.05666423165119994, -0.024641455276511036, -0.1164491722597748, 0.14991021684060493, 0.3004380226797926, 0.06134252580634963, 0.12898729879182214, -0.36322616883672965, -0.1741686278882508, 0.18516629113433644, 0.13304540283309343, 0.06800293087816009, -0.06011571467985423, -0.28013311423218024, 0.06972785043315245, -0.19875508160233343, -0.20640895638662654, -0.0612689541049827, 0.05850986694582762, 0.012699214708752548, -0.16690156470688705, -0.0021737808072849964, 0.12717972783586726, 0.19513539534497026, -0.05844559210191409, -0.06560108223810601, -0.02771163109737711, 0.12601516622667894, 0.019758995767169368, 0.003991775107211792, 0.09022482366969761, -0.06686616034652942, -0.10983238356092419, 0.4749254235424675, -0.011029749989318542, -0.19426814768797693, 0.1250481644543843, -0.13538259758542365, -0.21196182045894554, 0.10607978772634688, 0.14420830256616077, 0.15174697573559406, -0.04173113173545481, 0.19583361963547455, -0.18414583621928707, 0.08126747641616906, 0.06452376876348773, -0.07121003352669784, 0.04747465054671734, 0.09815481366315044, 0.03946383869370971, 0.13864593651109877, 0.08681741300134514, 0.040571962286216706, -0.3790712642650574, -0.22710467300688228, -0.06864881158346692, 0.0999056137381838, -0.11455696998503602, -0.1662281917121548, 0.47601009554301316, 0.09724515905747047, 0.13379521773029596, 0.11360708129210159, 0.18520089017394453, -0.0065599448683385094, 0.0263437510211355, 0.061799114504351445, 0.13548945266908655, 0.2374557165790182, -0.1414224780194509, -0.17381803252889463, -0.03697236821664354, 0.22616445688674083] |
1,802.08486 | Non-classicality of coherent state mixtures | Mixtures of coherent states are commonly regarded as classical. Here we show
that there is a quantum advantage in discriminating between coherent states in
a mixture, implying the presence of quantum properties in the mixture, which
are however not captured by commonly used non-classicality measures. We
identify a set of desired properties for any non-classicality measure that aims
to capture these quantum features, and define the discord potential CD, which
we show to satisfy all those properties. We compare the discord potential with
recently proposed coherence monotones, and prove that the coherence monotones
diverge for classically distinguishable states, thus indicating their failure
to quantify non-classicality in this limit. On the technical side, we provide a
simple method of calculating the discord as well as other information-theoretic
quantities for the (non-Gaussian) output of any input state with positive
P-function.
| quant-ph | mixtures of coherent states are commonly regarded as classical here we show that there is a quantum advantage in discriminating between coherent states in a mixture implying the presence of quantum properties in the mixture which are however not captured by commonly used nonclassicality measures we identify a set of desired properties for any nonclassicality measure that aims to capture these quantum features and define the discord potential cd which we show to satisfy all those properties we compare the discord potential with recently proposed coherence monotones and prove that the coherence monotones diverge for classically distinguishable states thus indicating their failure to quantify nonclassicality in this limit on the technical side we provide a simple method of calculating the discord as well as other informationtheoretic quantities for the nongaussian output of any input state with positive pfunction | [['mixtures', 'of', 'coherent', 'states', 'are', 'commonly', 'regarded', 'as', 'classical', 'here', 'we', 'show', 'that', 'there', 'is', 'a', 'quantum', 'advantage', 'in', 'discriminating', 'between', 'coherent', 'states', 'in', 'a', 'mixture', 'implying', 'the', 'presence', 'of', 'quantum', 'properties', 'in', 'the', 'mixture', 'which', 'are', 'however', 'not', 'captured', 'by', 'commonly', 'used', 'nonclassicality', 'measures', 'we', 'identify', 'a', 'set', 'of', 'desired', 'properties', 'for', 'any', 'nonclassicality', 'measure', 'that', 'aims', 'to', 'capture', 'these', 'quantum', 'features', 'and', 'define', 'the', 'discord', 'potential', 'cd', 'which', 'we', 'show', 'to', 'satisfy', 'all', 'those', 'properties', 'we', 'compare', 'the', 'discord', 'potential', 'with', 'recently', 'proposed', 'coherence', 'monotones', 'and', 'prove', 'that', 'the', 'coherence', 'monotones', 'diverge', 'for', 'classically', 'distinguishable', 'states', 'thus', 'indicating', 'their', 'failure', 'to', 'quantify', 'nonclassicality', 'in', 'this', 'limit', 'on', 'the', 'technical', 'side', 'we', 'provide', 'a', 'simple', 'method', 'of', 'calculating', 'the', 'discord', 'as', 'well', 'as', 'other', 'informationtheoretic', 'quantities', 'for', 'the', 'nongaussian', 'output', 'of', 'any', 'input', 'state', 'with', 'positive', 'pfunction']] | [-0.08737471927146333, 0.15119795368957348, -0.13515500508356784, 0.11979228309085728, 0.03234560085474041, -0.18592752836833615, 0.025231376600762207, 0.3585764279697036, -0.267864971705105, -0.2471473441540223, 0.036796677041886564, -0.26894672097557265, -0.15490619571832265, 0.1954450935456038, -0.07727184819489502, 0.11524884188817679, 0.021751152958882893, 0.06450466337749579, -0.05801190525813001, -0.2190414998018979, 0.33452230280238215, 0.0031063860709158084, 0.2903797677346924, 0.05094173975774775, 0.0908201703130254, -0.022298978066828568, 0.03987499935876416, 0.037051028875715056, -0.1168042973747989, 0.09014306861976418, 0.28355576751240785, 0.1850488666880309, 0.24750233243179062, -0.3776205627625619, -0.24080131892654774, 0.16506608527497915, 0.09146704230553714, 0.14666307841231913, -0.015258186831277377, -0.3413675156003539, 0.04850860620997306, -0.144190326645174, -0.09735011730167636, -0.16563515111582988, 0.011853676356807135, 0.015116566197400021, -0.2446106686088108, 0.11080507053386258, 0.0754026775071195, 0.057098056935448796, -0.01971270796248986, -0.09750802938461951, -0.0006929097521672214, 0.14444278526133386, -0.03626834790064595, -0.03994013046916655, 0.1384171193458842, -0.12393742881249636, -0.16241300325044364, 0.3453455346474505, -0.07440594745044044, -0.22629340003123102, 0.21339124307522309, -0.12976728959103534, -0.1226062380803236, 0.039154084483701466, 0.11072017656693207, 0.07844989005125304, -0.13237591455623077, -0.004643414379603675, -0.03904251782797223, 0.17123517444006342, 0.07329195338314858, 0.20538564085406993, 0.21179668486550235, 0.05157149409996751, 0.06705931680061031, 0.21759729979574963, -0.06347553084407886, -0.13508658146104385, -0.3165432350453583, -0.21846034911636641, -0.24110885755668487, 0.05331753343657972, -0.037971617393929555, -0.1736472820242246, 0.38900020536359237, 0.17900324552918892, 0.20320123652050245, 0.06184320386829854, 0.2787479232504046, 0.11813313134220864, 0.0549081240728349, 0.058754604694474, 0.2583114240601983, 0.15858218883859346, -0.004937812419392277, -0.21952389528725189, 0.1247866206643833, 0.01817233567935941] |
1,802.08487 | Graph polynomials and symmetries | In a recent paper, we studied the interaction between the automorphism group
of a graph and its Tutte polynomial. More precisely, we proved that certain
symmetries of graphs are clearly reflected by their Tutte polynomials. The
purpose of this paper is to extend this study to other graph polynomials. In
particular, we prove that if a graph $G$ has a symmetry of prime order $p$,
then its characteristic polynomial, with coefficients in the finite filed
$\mathbb{F}_p$, is determined by the characteristic polynomial of its quotient
graph $\overline G$. Similar results are also proved for some generalization of
the Tutte polynomial.
| math.CO | in a recent paper we studied the interaction between the automorphism group of a graph and its tutte polynomial more precisely we proved that certain symmetries of graphs are clearly reflected by their tutte polynomials the purpose of this paper is to extend this study to other graph polynomials in particular we prove that if a graph g has a symmetry of prime order p then its characteristic polynomial with coefficients in the finite filed mathbbf_p is determined by the characteristic polynomial of its quotient graph overline g similar results are also proved for some generalization of the tutte polynomial | [['in', 'a', 'recent', 'paper', 'we', 'studied', 'the', 'interaction', 'between', 'the', 'automorphism', 'group', 'of', 'a', 'graph', 'and', 'its', 'tutte', 'polynomial', 'more', 'precisely', 'we', 'proved', 'that', 'certain', 'symmetries', 'of', 'graphs', 'are', 'clearly', 'reflected', 'by', 'their', 'tutte', 'polynomials', 'the', 'purpose', 'of', 'this', 'paper', 'is', 'to', 'extend', 'this', 'study', 'to', 'other', 'graph', 'polynomials', 'in', 'particular', 'we', 'prove', 'that', 'if', 'a', 'graph', 'g', 'has', 'a', 'symmetry', 'of', 'prime', 'order', 'p', 'then', 'its', 'characteristic', 'polynomial', 'with', 'coefficients', 'in', 'the', 'finite', 'filed', 'mathbbf_p', 'is', 'determined', 'by', 'the', 'characteristic', 'polynomial', 'of', 'its', 'quotient', 'graph', 'overline', 'g', 'similar', 'results', 'are', 'also', 'proved', 'for', 'some', 'generalization', 'of', 'the', 'tutte', 'polynomial']] | [-0.19842398162349129, 0.0875951441260986, -0.13523715194314717, 0.03186766612809151, -0.13246901119768154, -0.10203927757684142, -0.03339262072695419, 0.3580295190960169, -0.37462104674428703, -0.24412246135994792, 0.06436199140385725, -0.24053770176135003, -0.214768133610487, 0.17510181813500822, -0.1119389789737761, 0.037157258601509965, 0.053536282237619165, 0.1341427573002875, -0.07052899470087141, -0.3383613650931511, 0.33880065725184977, -0.023506748504005373, 0.14583783495007083, 0.09470169174019247, 0.06717713040765375, -0.011589185716584325, -0.032178917778655884, 0.031589693939313296, -0.17463307795653235, 0.08473613102105446, 0.30145425245689694, 0.09091281234053895, 0.22652236938942225, -0.3735887026414275, -0.12337153959088028, 0.2544888669066131, 0.14881798702292146, 0.006779224018100649, -0.012412307612394216, -0.244300676882267, 0.16479519327171147, -0.15869508002884686, -0.14422219228930772, -0.04273922869004309, 0.10448143428191542, 0.03237561213551089, -0.2497237236611545, -0.029692739288148005, 0.1313954433519393, 0.15059034634454294, 0.06006898676394485, -0.12069722513202578, -0.021238435483537613, 0.045065452135168015, -0.006389265754260123, 0.07492501055123285, 0.02385775187634863, -0.11772786918561906, -0.136790211959742, 0.39527474343776703, -0.045654119873652234, -0.1887816122508957, 0.10672716857865452, -0.2135992769873701, -0.20921723997220398, 0.09131979399360717, 0.11015696102753282, 0.15296116592828185, -0.07651056331582368, 0.17984076088236178, -0.1588758867047727, 0.06429510166868567, 0.1181976794078946, -0.02267086684703827, 0.07021398859098554, 0.05537802428239957, 0.07263470182195306, 0.20309752302535344, 0.0556419335398823, 5.361984483897686e-05, -0.29427860014140605, -0.15150909701827914, -0.22465552465058863, 0.04874979181680828, -0.1763627717642521, -0.13317179782316088, 0.4656715787574649, 0.10893030701205135, 0.14530952256172897, 0.15232701889239253, 0.2026058132853359, 0.1073120866343379, 0.024262164331739767, 0.0997188344411552, 0.12745745670661562, 0.24706253627780825, 0.009625924061983824, -0.17750576175400057, 0.08539801159058698, 0.18060422354377806] |
1,802.08488 | Uncertainty relation based on Wigner-Yanase-Dyson skew information with
quantum memory | We present uncertainty relations based on Wigner--Yanase--Dyson skew
information with quantum memory. Uncertainty inequalities both in product and
summation forms are derived. \mbox{It is} shown that the lower bounds contain
two terms: one characterizes the degree of compatibility of two measurements,
and the other is the quantum correlation between the measured system and the
quantum memory. Detailed examples are given for product, separable and
entangled states.
| quant-ph | we present uncertainty relations based on wigneryanasedyson skew information with quantum memory uncertainty inequalities both in product and summation forms are derived mboxit is shown that the lower bounds contain two terms one characterizes the degree of compatibility of two measurements and the other is the quantum correlation between the measured system and the quantum memory detailed examples are given for product separable and entangled states | [['we', 'present', 'uncertainty', 'relations', 'based', 'on', 'wigneryanasedyson', 'skew', 'information', 'with', 'quantum', 'memory', 'uncertainty', 'inequalities', 'both', 'in', 'product', 'and', 'summation', 'forms', 'are', 'derived', 'mboxit', 'is', 'shown', 'that', 'the', 'lower', 'bounds', 'contain', 'two', 'terms', 'one', 'characterizes', 'the', 'degree', 'of', 'compatibility', 'of', 'two', 'measurements', 'and', 'the', 'other', 'is', 'the', 'quantum', 'correlation', 'between', 'the', 'measured', 'system', 'and', 'the', 'quantum', 'memory', 'detailed', 'examples', 'are', 'given', 'for', 'product', 'separable', 'and', 'entangled', 'states']] | [-0.16979571403756452, 0.15378705427910272, -0.05873566810041666, 0.09577414681776784, -0.025759910992704905, -0.15800778854351777, 0.0024106589002678026, 0.3422923508171852, -0.2775906966282771, -0.3050354173550239, 0.1072541668276804, -0.3385118287056684, -0.11887440503789828, 0.2583518689068464, -0.028388718243401785, 0.06755923895308605, 0.06312827782060665, 0.09456896843173757, -0.12926188472013633, -0.2527339412042728, 0.36756547013154395, -0.016591091839095146, 0.28773821075805106, 0.07357829862918991, 0.12183733289667334, 0.010644366466798462, -0.06613108770778546, 0.001373754692478822, -0.14394898053959387, 0.1876575866096223, 0.21399746376734513, 0.15352456054578606, 0.19303176676711212, -0.41326340597409467, -0.14240108481966532, 0.09668062115804507, 0.05216207868204667, 0.06504609819071797, -0.0033822988321144994, -0.28893944709919966, 0.008623503650037142, -0.19469132292142605, -0.019214769467138328, -0.11156209568278147, 0.01132117284891697, 0.011864592600613833, -0.26432298633914725, 0.12082178122363985, 0.070287531041182, 0.0446024539683444, -0.029114523780747102, -0.13034145111898676, 0.004381203937989015, 0.1630079481105965, -0.0607755594027157, -0.057760999962472574, 0.09306852947204158, -0.09134374027355359, -0.17013024812331423, 0.32660609068205726, -0.02971923748890941, -0.25304236804636626, 0.14516892173828988, -0.15618793518783955, -0.12266534739532149, 0.02328939623414324, 0.11488182571931527, 0.0529876810283615, -0.1404079552166737, 0.06766523323738231, -0.03391442414946281, 0.1537399277664148, 0.06226543086366011, 0.18364775889338208, 0.135913569938678, 0.05252236716556721, 0.054502904407966596, 0.19925152165009283, -0.05548037056667873, -0.18148713312469997, -0.3327119496006232, -0.19159341319822348, -0.20691977345313017, 0.04528638333655321, -0.13604697753370812, -0.12407080625640586, 0.3498952942398878, 0.07566523899395879, 0.1541550445370376, 0.08070200895890593, 0.26851864617604476, 0.15384653029927553, 0.07410954878880427, 0.07764412353101831, 0.22249274974545608, 0.21643920999306898, 0.004382088372054008, -0.18343650029542355, 0.12999366177245975, 0.05899824410175475] |
1,802.08489 | Loss revives bistable state near the exceptional point in a
non-Hermitian microwave photonic meta-molecule | By exploring the extraordinary property of exceptional points (EPs) in
non-Hermitian systems, we here demonstrate that losses can play constructive
roles in controlling bistable states. We experimentally realize the EP in a
non-Hermitian meta-molecule of coupled resonators in microwave regime. By
increasing the loss, we first observe the bistable state suppression at the
weak-dissipative regime, but then the bistable state recovery in
strong-dissipative regime. Both the experimental and theoretical analysis
demonstrate that the revival of bistable states results from the revival of the
field intensity after the system encounters EPs, in spite of the increasing
loss. Our results provide an alternative way to controlling and manifesting
bistable systems, so as to achieve flexible photonic devices, not limited to
the microwave regime.
| cond-mat.mes-hall physics.optics | by exploring the extraordinary property of exceptional points eps in nonhermitian systems we here demonstrate that losses can play constructive roles in controlling bistable states we experimentally realize the ep in a nonhermitian metamolecule of coupled resonators in microwave regime by increasing the loss we first observe the bistable state suppression at the weakdissipative regime but then the bistable state recovery in strongdissipative regime both the experimental and theoretical analysis demonstrate that the revival of bistable states results from the revival of the field intensity after the system encounters eps in spite of the increasing loss our results provide an alternative way to controlling and manifesting bistable systems so as to achieve flexible photonic devices not limited to the microwave regime | [['by', 'exploring', 'the', 'extraordinary', 'property', 'of', 'exceptional', 'points', 'eps', 'in', 'nonhermitian', 'systems', 'we', 'here', 'demonstrate', 'that', 'losses', 'can', 'play', 'constructive', 'roles', 'in', 'controlling', 'bistable', 'states', 'we', 'experimentally', 'realize', 'the', 'ep', 'in', 'a', 'nonhermitian', 'metamolecule', 'of', 'coupled', 'resonators', 'in', 'microwave', 'regime', 'by', 'increasing', 'the', 'loss', 'we', 'first', 'observe', 'the', 'bistable', 'state', 'suppression', 'at', 'the', 'weakdissipative', 'regime', 'but', 'then', 'the', 'bistable', 'state', 'recovery', 'in', 'strongdissipative', 'regime', 'both', 'the', 'experimental', 'and', 'theoretical', 'analysis', 'demonstrate', 'that', 'the', 'revival', 'of', 'bistable', 'states', 'results', 'from', 'the', 'revival', 'of', 'the', 'field', 'intensity', 'after', 'the', 'system', 'encounters', 'eps', 'in', 'spite', 'of', 'the', 'increasing', 'loss', 'our', 'results', 'provide', 'an', 'alternative', 'way', 'to', 'controlling', 'and', 'manifesting', 'bistable', 'systems', 'so', 'as', 'to', 'achieve', 'flexible', 'photonic', 'devices', 'not', 'limited', 'to', 'the', 'microwave', 'regime']] | [-0.16704144873343282, 0.1622988073862825, -0.03799236685178485, -0.00110974331081164, 0.0073546101505469, -0.15626190284642727, 0.08462184659907782, 0.3729965555943361, -0.2592205011105838, -0.2623794059496091, 0.021661200366929926, -0.2795135474317715, -0.21514967453329503, 0.23078792558654265, -0.02105260479553532, 0.06517847876275788, 0.06256999002237405, -0.04087682728466828, -0.004926197735608376, -0.1716692386891599, 0.28968480475513, 0.04576180682775854, 0.31534100796229075, 0.04952658658080241, 0.09702398398687609, -0.04102573700507461, 0.1104817896721368, -0.034756380923781076, -0.0882601822153401, 0.05419013083877214, 0.2764671597034991, 0.047253761792696324, 0.28936918023504127, -0.4799155129291931, -0.2461218036742521, 0.10134696715487902, 0.21034255320159326, 0.17316451006639405, -0.07879073245591726, -0.28632989910845996, 0.015921840099852626, -0.14332513547181583, -0.16656507283804778, -0.10572818095772331, 0.004699917604066744, 0.011213470704290046, -0.25162129532721894, 0.03507756102343967, 0.08669028024995278, 0.049387960397333154, -0.05155209143327631, -0.022203057420346103, -0.011041156589562277, 0.07893860549861643, -0.02692842322593445, -0.02917176008834934, 0.11975491986054332, -0.16349775115118026, -0.15003438347250128, 0.32755017655455515, -0.07117549687850938, -0.1313794986384005, 0.1838534578814038, -0.18007329863910915, -0.05972357752083355, 0.1195589271413178, 0.1938591428573572, 0.04878656326855744, -0.08750097735338852, 0.06297473375345071, 0.022875947911026224, 0.17103844648618408, 0.06787591355563212, 0.13322511655982866, 0.18182728355828703, 0.20232535800857454, 0.05324770695678577, 0.16585258948577553, -0.045115938124505164, -0.11664560248394411, -0.2833899528242084, -0.10357403262917485, -0.20751876117145063, 0.04691503487247093, -0.07426616733384069, -0.15444955229759216, 0.41166882409455896, 0.18490728462983644, 0.215464076708157, -0.024632175046042735, 0.2574420606408331, 0.15302501918704978, 0.03019676767602688, 0.028868684304502457, 0.3506476196749997, 0.13708770510294482, 0.11425861329262872, -0.3030436702733938, 0.05054033164349737, -0.05972154653717239] |
1,802.0849 | Generic steady state bifurcations in monoid equivariant dynamics with
applications in homogeneous coupled cell systems | We prove that steady state bifurcations in finite-dimensional dynamical
systems that are symmetric with respect to a monoid representation generically
occur along an absolutely indecomposable subrepresentation. This is stated as a
conjecture in B. Rink and J. Sanders, "Coupled cell networks and their hidden
symmetries", SIAM J. Math. Anal., 46 (2014). It is a generalization of the
well-known fact that generic steady state bifurcations in equivariant dynamical
systems occur along an absolutely irreducible subrepresentation if the
symmetries form a group - finite or compact Lie. Our generalization also
includes non-compact symmetry groups. The result has applications in
bifurcation theory of homogeneous coupled cell networks as they can be embedded
(under mild additional assumptions) into monoid equivariant systems.
| math.DS | we prove that steady state bifurcations in finitedimensional dynamical systems that are symmetric with respect to a monoid representation generically occur along an absolutely indecomposable subrepresentation this is stated as a conjecture in b rink and j sanders coupled cell networks and their hidden symmetries siam j math anal 46 2014 it is a generalization of the wellknown fact that generic steady state bifurcations in equivariant dynamical systems occur along an absolutely irreducible subrepresentation if the symmetries form a group finite or compact lie our generalization also includes noncompact symmetry groups the result has applications in bifurcation theory of homogeneous coupled cell networks as they can be embedded under mild additional assumptions into monoid equivariant systems | [['we', 'prove', 'that', 'steady', 'state', 'bifurcations', 'in', 'finitedimensional', 'dynamical', 'systems', 'that', 'are', 'symmetric', 'with', 'respect', 'to', 'a', 'monoid', 'representation', 'generically', 'occur', 'along', 'an', 'absolutely', 'indecomposable', 'subrepresentation', 'this', 'is', 'stated', 'as', 'a', 'conjecture', 'in', 'b', 'rink', 'and', 'j', 'sanders', 'coupled', 'cell', 'networks', 'and', 'their', 'hidden', 'symmetries', 'siam', 'j', 'math', 'anal', '46', '2014', 'it', 'is', 'a', 'generalization', 'of', 'the', 'wellknown', 'fact', 'that', 'generic', 'steady', 'state', 'bifurcations', 'in', 'equivariant', 'dynamical', 'systems', 'occur', 'along', 'an', 'absolutely', 'irreducible', 'subrepresentation', 'if', 'the', 'symmetries', 'form', 'a', 'group', 'finite', 'or', 'compact', 'lie', 'our', 'generalization', 'also', 'includes', 'noncompact', 'symmetry', 'groups', 'the', 'result', 'has', 'applications', 'in', 'bifurcation', 'theory', 'of', 'homogeneous', 'coupled', 'cell', 'networks', 'as', 'they', 'can', 'be', 'embedded', 'under', 'mild', 'additional', 'assumptions', 'into', 'monoid', 'equivariant', 'systems']] | [-0.186533069916487, 0.12164644498989219, -0.10008872777287817, 0.03384254120214007, -0.08213962067785704, -0.1758956438319854, -0.009371899450719678, 0.35529530457028285, -0.30993196633162684, -0.18846302585333088, 0.13049679080823212, -0.23981090989726564, -0.19616872587307468, 0.1449344941467079, -0.14934542048561933, -0.01515299712853699, 0.08162641221585137, 0.05674564481536248, -0.06477043279225873, -0.24998554836402664, 0.33099778294001286, -0.06271405339016226, 0.25934554185519587, -0.003010270376950663, 0.09801379578380749, -0.007887660224665085, 0.01838659770096299, -0.03064836211329936, -0.0995581485240109, 0.04240822056629535, 0.3127449538101089, 0.044203535201036016, 0.21269245214704102, -0.3723743225142745, -0.203118164375312, 0.20653647213275061, 0.14207318499844906, 0.06276103748201296, -0.0037987200635613808, -0.3295685847386204, 0.07749633290774816, -0.212919840767803, -0.20209057001268554, -0.11302915246001091, 0.09041870455257595, -0.010040879193372253, -0.25322695786197635, 0.10198216614537223, 0.1671478430081183, 0.12331196822447839, -0.09237012161335362, -0.06267419879641865, -0.14551282175696165, 0.0633171768899172, -0.026377771704072326, 0.044311377227884426, 0.10350123005377225, -0.0701676870451373, -0.16345339091414393, 0.3611736401337488, -0.027065526377931557, -0.2506423093165785, 0.22736585455753938, -0.07921229932328751, -0.22611292087521148, 0.15488251520657975, 0.13202815471570298, 0.10748848769560873, -0.0803663417263406, 0.1715377444584035, -0.14669355512436094, 0.0932466028577343, 0.10021760615375663, -0.00288850671595669, 0.14997753252652635, 0.09125411239500832, 0.0915059869996561, 0.09860108798702955, 0.0773197652547267, -0.11475661116379217, -0.3260939409504725, -0.14315930489001089, -0.12223582950035303, 0.16306473234475688, -0.04702968119843341, -0.16443938826379398, 0.36723396331995145, 0.06714550654227235, 0.1544216772429003, 0.06213141968754794, 0.16388893939940066, 0.10528100674704986, 0.025030272004093197, 0.11513240082221556, 0.15740011306479573, 0.26127470347323806, 0.024391982054080944, -0.14153701833906937, -0.04197312158267495, 0.14619467543149045] |
1,802.08491 | New exact results on density matrix for XXX spin chain | Using the fermionic basis we obtain the expectation values of all
$\slt$-invariant and $C$-invariant local operators on 10 sites for the
anisotropic six-vertex model on a cylinder with generic Matsubara data. This is
equivalent to the generalised Gibbs ensemble for the XXX spin chain. In the
case when the $\slt$ and $C$ symmetries are not broken this computation is
equivalent to finding the entire density matrix up to 10 sites. As application,
we compute the entanglement entropy without and with temperature, and compare
the results with CFT predictions.
| math-ph cond-mat.other hep-th math.MP | using the fermionic basis we obtain the expectation values of all sltinvariant and cinvariant local operators on 10 sites for the anisotropic sixvertex model on a cylinder with generic matsubara data this is equivalent to the generalised gibbs ensemble for the xxx spin chain in the case when the slt and c symmetries are not broken this computation is equivalent to finding the entire density matrix up to 10 sites as application we compute the entanglement entropy without and with temperature and compare the results with cft predictions | [['using', 'the', 'fermionic', 'basis', 'we', 'obtain', 'the', 'expectation', 'values', 'of', 'all', 'sltinvariant', 'and', 'cinvariant', 'local', 'operators', 'on', '10', 'sites', 'for', 'the', 'anisotropic', 'sixvertex', 'model', 'on', 'a', 'cylinder', 'with', 'generic', 'matsubara', 'data', 'this', 'is', 'equivalent', 'to', 'the', 'generalised', 'gibbs', 'ensemble', 'for', 'the', 'xxx', 'spin', 'chain', 'in', 'the', 'case', 'when', 'the', 'slt', 'and', 'c', 'symmetries', 'are', 'not', 'broken', 'this', 'computation', 'is', 'equivalent', 'to', 'finding', 'the', 'entire', 'density', 'matrix', 'up', 'to', '10', 'sites', 'as', 'application', 'we', 'compute', 'the', 'entanglement', 'entropy', 'without', 'and', 'with', 'temperature', 'and', 'compare', 'the', 'results', 'with', 'cft', 'predictions']] | [-0.06472933709878347, 0.14873193779788996, -0.013358418109837449, 0.07064285325207587, -0.0187598695288059, -0.1376043900408536, 0.032435205829297674, 0.3722471573079626, -0.21392346390298214, -0.25916660156357907, 0.12532979965440116, -0.31174276406266566, -0.05548202209495779, 0.151638319210053, 0.025924789425234535, 0.05476860552587969, 0.03562843895399536, 0.07578754960291686, -0.14441375470795165, -0.23623717079827583, 0.30000710032676914, 0.04951476661124449, 0.30814855330591573, 0.04925819026070765, 0.08449304119373362, 0.03429080724138124, 0.03492112401551727, -0.005622070591800429, -0.14996853623346523, 0.122854061241077, 0.21432270785932825, 0.06133113776858168, 0.15036697298202706, -0.4031428252828532, -0.1601646366133087, 0.1308611474032032, 0.10617899385698397, 0.16155381483593206, 0.031325165251933636, -0.25262454371824433, 0.04738086543377788, -0.18232286910943943, -0.17023254021060194, -0.0982961317861517, 0.010157266342691306, -0.013356165698162097, -0.28797250694391885, 0.10403870947487738, 0.02682432141583199, 0.06545467851362352, -0.07225620740390351, -0.11197954166851852, -0.041367778554558754, 0.09021981882537587, 0.04194865851454308, 0.051683050906151835, 0.1200380239785574, -0.0905496702079886, -0.10181007801351705, 0.34583647701161346, -0.1056351846287391, -0.2391982228500533, 0.16744787575163203, -0.14218874954372301, -0.12446890040514884, 0.06955252280030613, 0.07234581222693467, 0.08998836270244472, -0.13697825337779554, 0.13982477437051805, -0.050822226757494114, 0.13979480991503973, 0.030534364834385014, -0.016744757852592003, 0.18954207039780743, 0.06941857023817626, 0.05930699954002068, 0.1867149790090605, -0.05930680033868586, -0.1586044717729948, -0.30915941208087167, -0.18212128316598206, -0.21345350794338933, 0.0716672781187487, -0.12560197520912786, -0.17407218162933813, 0.41597412056664285, 0.16655700825170547, 0.2207672050244164, 0.11747635340039757, 0.21813771295650253, 0.14263661370489575, 0.0865940038588476, 0.10640387984271023, 0.1599287142035091, 0.1518020926153116, 0.06226752867558222, -0.23164542674504476, -0.007896631340571177, 0.10495893673532396] |
1,802.08492 | Stateful Behavioral Types for ABS | It is notoriously hard to correctly implement a multiparty protocol which
involves asynchronous/concurrent interactions and the constraints on states of
multiple participants. To assist developers in implementing such protocols, we
propose a novel specification language to specify interactions within multiple
object-oriented actors and the side-effects on heap memory of those actors; a
behavioral-type-based analysis is presented for type checking. Our
specification language formalizes a protocol as a global type, which describes
the procedure of asynchronous method calls, the usage of futures, and the heap
side-effects with a first-order logic. To characterize runs of instances of
types, we give a model-theoretic semantics for types and translate them into
logical constraints over traces. We prove protocol adherence: If a program is
well-typed w.r.t. a protocol, then every trace of the program adheres to the
protocol, i.e., every trace is a model for the formula of its type.
| cs.PL | it is notoriously hard to correctly implement a multiparty protocol which involves asynchronousconcurrent interactions and the constraints on states of multiple participants to assist developers in implementing such protocols we propose a novel specification language to specify interactions within multiple objectoriented actors and the sideeffects on heap memory of those actors a behavioraltypebased analysis is presented for type checking our specification language formalizes a protocol as a global type which describes the procedure of asynchronous method calls the usage of futures and the heap sideeffects with a firstorder logic to characterize runs of instances of types we give a modeltheoretic semantics for types and translate them into logical constraints over traces we prove protocol adherence if a program is welltyped wrt a protocol then every trace of the program adheres to the protocol ie every trace is a model for the formula of its type | [['it', 'is', 'notoriously', 'hard', 'to', 'correctly', 'implement', 'a', 'multiparty', 'protocol', 'which', 'involves', 'asynchronousconcurrent', 'interactions', 'and', 'the', 'constraints', 'on', 'states', 'of', 'multiple', 'participants', 'to', 'assist', 'developers', 'in', 'implementing', 'such', 'protocols', 'we', 'propose', 'a', 'novel', 'specification', 'language', 'to', 'specify', 'interactions', 'within', 'multiple', 'objectoriented', 'actors', 'and', 'the', 'sideeffects', 'on', 'heap', 'memory', 'of', 'those', 'actors', 'a', 'behavioraltypebased', 'analysis', 'is', 'presented', 'for', 'type', 'checking', 'our', 'specification', 'language', 'formalizes', 'a', 'protocol', 'as', 'a', 'global', 'type', 'which', 'describes', 'the', 'procedure', 'of', 'asynchronous', 'method', 'calls', 'the', 'usage', 'of', 'futures', 'and', 'the', 'heap', 'sideeffects', 'with', 'a', 'firstorder', 'logic', 'to', 'characterize', 'runs', 'of', 'instances', 'of', 'types', 'we', 'give', 'a', 'modeltheoretic', 'semantics', 'for', 'types', 'and', 'translate', 'them', 'into', 'logical', 'constraints', 'over', 'traces', 'we', 'prove', 'protocol', 'adherence', 'if', 'a', 'program', 'is', 'welltyped', 'wrt', 'a', 'protocol', 'then', 'every', 'trace', 'of', 'the', 'program', 'adheres', 'to', 'the', 'protocol', 'ie', 'every', 'trace', 'is', 'a', 'model', 'for', 'the', 'formula', 'of', 'its', 'type']] | [-0.15742617929631103, 0.006066711129412264, -0.11806406117601229, 0.10576068134196884, -0.11771993018634669, -0.21905469736475106, 0.12762110462612505, 0.3604517252790136, -0.3043245126304406, -0.32077776017383886, 0.06356259245528038, -0.2128358507704745, -0.09578309850311363, 0.1687598972975348, -0.11531732119115108, 0.04779310287359021, 0.0657405419864568, 0.0408080603937143, -0.0358133886002942, -0.23147008186401605, 0.30366349604202214, -0.023965397115366962, 0.2448457045288483, 0.038405096604508325, 0.10521456185676209, 0.07182039107176495, -0.019563490738180447, -0.006276881348315652, -0.0713424930101508, 0.1177268122983087, 0.3060978466215042, 0.27280303255094773, 0.31268767819420756, -0.43779064035425747, -0.11636522354011039, 0.07167636398942424, 0.04743459524147797, 0.1249880329689493, 0.028388661322659336, -0.3002862852926438, 0.09746984215583522, -0.23261494367298755, -0.05077626455210514, -0.10507024395755017, 0.015569044177752588, 0.015251883707771247, -0.30089369474688765, -0.05188800743618212, 0.12202070613059547, 0.049954359501053196, -0.03425318708438166, 0.01111017871026106, -0.00022960015754964385, 0.13523882937656675, -0.007996145304507362, -0.015846558072330704, 0.13386037906915133, -0.07720016871116586, -0.19913964887585986, 0.39569143569292303, 0.008123018427172325, -0.17697660897539316, 0.18212321292693642, 0.0038433739202344544, -0.19974370281882844, 0.055574051973937486, 0.15380833839177044, 0.11366612935712288, -0.18015661194816335, 0.08646551814822519, -0.05098582289044882, 0.23650140029710384, 0.043341147011614865, 0.03121803605105155, 0.18171016248659447, 0.19855268523618058, 0.06879330104073653, 0.17931021936889086, 0.014625991847068136, -0.10858370874962815, -0.33091561984143814, -0.22069922003608483, -0.09345247483180537, -0.027217813271099466, -0.06408178685778439, -0.20167916719931978, 0.40076580109608756, 0.17279927844793855, 0.12426956347027025, 0.15255223917839983, 0.3452719477741243, 0.052770225399571075, 0.11884670474703286, 0.10024196524791733, 0.09397029797253492, 0.06899970393445524, 0.13972984326610968, -0.1744674397575493, 0.19341539574780509, 0.08174614156527164] |
1,802.08493 | Complex Octahedral Tilt Phases in the Ferroelectric Perovskite System
Li$_x$Na$_{1-x}$NbO$_3$ | High-temperature phase behavior in the system LixNa1-xNbO3 has been studied
by using high-resolution powder neutron diffraction. Each of the three
compositions studied in the Na-rich part of the phase diagram (x = 0.03, 0.08
and 0.12) shows evidence for distinct and complex structural modulations based
on different tilting schemes of NbO6 octahedral units. Whilst octahedral
tilting is prevalent in the structural chemistry of perovskites the nature of
complexity of the phases observed here is unprecedented. Neither of the
long-range tilt phases observed in NaNbO3 itself occurs here; instead a novel
phase with a well-defined 4-fold superlattice is observed for the composition
Li0.12Na0.88NbO3, and yet more complex phases with modulations based on 20-fold
and 30-fold repeats are observed for Li0.03Na0.97NbO3 and Li0.08Na0.92NbO3,
respectively. This peculiar structural behavior makes the system LixNa1-xNbO3
the most structurally complex 'simple' perovskite known.
| cond-mat.mtrl-sci | hightemperature phase behavior in the system lixna1xnbo3 has been studied by using highresolution powder neutron diffraction each of the three compositions studied in the narich part of the phase diagram x 003 008 and 012 shows evidence for distinct and complex structural modulations based on different tilting schemes of nbo6 octahedral units whilst octahedral tilting is prevalent in the structural chemistry of perovskites the nature of complexity of the phases observed here is unprecedented neither of the longrange tilt phases observed in nanbo3 itself occurs here instead a novel phase with a welldefined 4fold superlattice is observed for the composition li012na088nbo3 and yet more complex phases with modulations based on 20fold and 30fold repeats are observed for li003na097nbo3 and li008na092nbo3 respectively this peculiar structural behavior makes the system lixna1xnbo3 the most structurally complex simple perovskite known | [['hightemperature', 'phase', 'behavior', 'in', 'the', 'system', 'lixna1xnbo3', 'has', 'been', 'studied', 'by', 'using', 'highresolution', 'powder', 'neutron', 'diffraction', 'each', 'of', 'the', 'three', 'compositions', 'studied', 'in', 'the', 'narich', 'part', 'of', 'the', 'phase', 'diagram', 'x', '003', '008', 'and', '012', 'shows', 'evidence', 'for', 'distinct', 'and', 'complex', 'structural', 'modulations', 'based', 'on', 'different', 'tilting', 'schemes', 'of', 'nbo6', 'octahedral', 'units', 'whilst', 'octahedral', 'tilting', 'is', 'prevalent', 'in', 'the', 'structural', 'chemistry', 'of', 'perovskites', 'the', 'nature', 'of', 'complexity', 'of', 'the', 'phases', 'observed', 'here', 'is', 'unprecedented', 'neither', 'of', 'the', 'longrange', 'tilt', 'phases', 'observed', 'in', 'nanbo3', 'itself', 'occurs', 'here', 'instead', 'a', 'novel', 'phase', 'with', 'a', 'welldefined', '4fold', 'superlattice', 'is', 'observed', 'for', 'the', 'composition', 'li012na088nbo3', 'and', 'yet', 'more', 'complex', 'phases', 'with', 'modulations', 'based', 'on', '20fold', 'and', '30fold', 'repeats', 'are', 'observed', 'for', 'li003na097nbo3', 'and', 'li008na092nbo3', 'respectively', 'this', 'peculiar', 'structural', 'behavior', 'makes', 'the', 'system', 'lixna1xnbo3', 'the', 'most', 'structurally', 'complex', 'simple', 'perovskite', 'known']] | [-0.1844070606779209, 0.1888495987505281, -0.06864576480050284, 0.010234397105589033, -0.03903480186792357, -0.11171621771151186, 0.0836649120687262, 0.43116768231069236, -0.26454746009540375, -0.2804808206156008, 0.05825018803273937, -0.2742882607840842, -0.18128107659714787, 0.151730542225217, -0.030325339385833507, -0.004061695539280492, -0.03407422732561827, -0.021818228780214947, -0.12846515784775348, -0.19344429296521903, 0.2606152285002452, -4.6242182528165944e-05, 0.304916040688277, -0.014050067566979425, 0.06156596981157038, -0.024260082705772686, 0.06179909679086361, 0.01949909990443323, -0.14624864860486828, 0.049309356407703536, 0.22308734126732147, 0.0056989518557920265, 0.13568682548470964, -0.40044498788122845, -0.2119814233348488, 0.040488884452541354, 0.14661886274229904, 0.05234469976136111, -0.10322618798610554, -0.2309571123625943, 0.0765813864295763, -0.10924603022403903, -0.10540252977008827, -0.08457796765085225, 0.03926038082787081, 0.011915165710410005, -0.21658597879910044, 0.11765762688101906, 0.05022654594167283, 0.16453701342610097, -0.1163122936684106, -0.14782280938986941, -0.07414451418654587, 0.07436833002681571, 0.014767253187597078, 0.03520068540272856, 0.07418053625221539, -0.07916742500225853, -0.0980295946863585, 0.42661044584181074, 0.011604547813093584, -0.03618193409209581, 0.1986046467305518, -0.21894722159361532, -0.16035097377738894, 0.20862904556193634, 0.06445395592530083, 0.1291190863401398, -0.14061187442980314, 0.03988407021939853, 0.023183778509553662, 0.2501308279518122, 0.04888028452957147, 0.06737449989282995, 0.22579496159547366, 0.23858783651349885, -0.009758855286229374, 0.13043779636824265, -0.12813207015311573, -0.08808939915878657, -0.16399802540996133, -0.14344137332829318, -0.1424248980557812, -0.00791769278020409, -0.11023172468839378, -0.19579465409081703, 0.3820747971023552, 0.0676943184641589, 0.18876561413946233, -0.0705455170906695, 0.2362361562839198, 0.04452299358519284, 0.07659550779324054, -0.03094924146421534, 0.24007262782494826, 0.1604371120981676, 0.10574178332883052, -0.23686773328397676, 0.15478130094216844, 0.014444072030596715] |
1,802.08494 | Tracing the atomic nitrogen abundance in star-forming regions with
ammonia deuteration | Partitioning of elemental nitrogen in star-forming regions is not well
constrained. Most nitrogen is expected to be partitioned among atomic nitrogen,
molecular nitrogen (N2), and icy N-bearing molecules, such as ammonia (NH3) and
N2. Atomic nitrogen is not directly observable in the cold gas. In this paper,
we propose an indirect way to constrain the amount of atomic nitrogen in the
cold gas of star-forming clouds, via deuteration in ammonia ice, the
[ND2H/NH2D]/[NH2D/NH3] ratio. Using gas-ice astrochemical simulations, we show
that if atomic nitrogen remains as the primary reservoir of nitrogen during
cold ice formation stages, the [ND2H/NH2D]/[NH2D/NH3] ratio is close to the
statistical value of 1/3 and lower than unity, whereas if atomic nitrogen is
largely converted into N-bearing molecules, the ratio should be larger than
unity. Observability of ammonia isotopologues in the inner hot regions around
low-mass protostars, where ammonia ice has sublimated, is also discussed. We
conclude that the [ND2H/NH2D]/[NH2D/NH3] ratio can be quantified using a
combination of VLA and ALMA observations with reasonable integration times, at
least toward IRAS 16293-2422 where high molecular column densities are
expected.
| astro-ph.GA | partitioning of elemental nitrogen in starforming regions is not well constrained most nitrogen is expected to be partitioned among atomic nitrogen molecular nitrogen n2 and icy nbearing molecules such as ammonia nh3 and n2 atomic nitrogen is not directly observable in the cold gas in this paper we propose an indirect way to constrain the amount of atomic nitrogen in the cold gas of starforming clouds via deuteration in ammonia ice the nd2hnh2dnh2dnh3 ratio using gasice astrochemical simulations we show that if atomic nitrogen remains as the primary reservoir of nitrogen during cold ice formation stages the nd2hnh2dnh2dnh3 ratio is close to the statistical value of 13 and lower than unity whereas if atomic nitrogen is largely converted into nbearing molecules the ratio should be larger than unity observability of ammonia isotopologues in the inner hot regions around lowmass protostars where ammonia ice has sublimated is also discussed we conclude that the nd2hnh2dnh2dnh3 ratio can be quantified using a combination of vla and alma observations with reasonable integration times at least toward iras 162932422 where high molecular column densities are expected | [['partitioning', 'of', 'elemental', 'nitrogen', 'in', 'starforming', 'regions', 'is', 'not', 'well', 'constrained', 'most', 'nitrogen', 'is', 'expected', 'to', 'be', 'partitioned', 'among', 'atomic', 'nitrogen', 'molecular', 'nitrogen', 'n2', 'and', 'icy', 'nbearing', 'molecules', 'such', 'as', 'ammonia', 'nh3', 'and', 'n2', 'atomic', 'nitrogen', 'is', 'not', 'directly', 'observable', 'in', 'the', 'cold', 'gas', 'in', 'this', 'paper', 'we', 'propose', 'an', 'indirect', 'way', 'to', 'constrain', 'the', 'amount', 'of', 'atomic', 'nitrogen', 'in', 'the', 'cold', 'gas', 'of', 'starforming', 'clouds', 'via', 'deuteration', 'in', 'ammonia', 'ice', 'the', 'nd2hnh2dnh2dnh3', 'ratio', 'using', 'gasice', 'astrochemical', 'simulations', 'we', 'show', 'that', 'if', 'atomic', 'nitrogen', 'remains', 'as', 'the', 'primary', 'reservoir', 'of', 'nitrogen', 'during', 'cold', 'ice', 'formation', 'stages', 'the', 'nd2hnh2dnh2dnh3', 'ratio', 'is', 'close', 'to', 'the', 'statistical', 'value', 'of', '13', 'and', 'lower', 'than', 'unity', 'whereas', 'if', 'atomic', 'nitrogen', 'is', 'largely', 'converted', 'into', 'nbearing', 'molecules', 'the', 'ratio', 'should', 'be', 'larger', 'than', 'unity', 'observability', 'of', 'ammonia', 'isotopologues', 'in', 'the', 'inner', 'hot', 'regions', 'around', 'lowmass', 'protostars', 'where', 'ammonia', 'ice', 'has', 'sublimated', 'is', 'also', 'discussed', 'we', 'conclude', 'that', 'the', 'nd2hnh2dnh2dnh3', 'ratio', 'can', 'be', 'quantified', 'using', 'a', 'combination', 'of', 'vla', 'and', 'alma', 'observations', 'with', 'reasonable', 'integration', 'times', 'at', 'least', 'toward', 'iras', '162932422', 'where', 'high', 'molecular', 'column', 'densities', 'are', 'expected']] | [-0.010963576239628913, 0.19873150376912055, 0.02570803871105595, 0.012051519440636245, 0.05891235378051166, -0.07400017289588876, 0.05635865128699443, 0.4284964244226148, -0.1990368525730446, -0.3140827901970122, 0.06565234334547669, -0.2606078350237308, 0.012532910862062846, 0.07432631089336635, 0.0063317210917767566, -0.051779240232799714, 0.030524349071822537, -0.12390856988964737, -0.014491677847665153, -0.2468255460789705, 0.2253471509095549, 0.1295719301220009, 0.14115840070369623, 0.07748231524987485, 0.030056568770798035, -0.20245052993462231, 0.010937408086180028, -0.048434476818354256, -0.14475464471012872, 0.08430001757156556, 0.3373069927644355, 0.10323447588501879, 0.1717398146483198, -0.4577639241862363, -0.2050188729868821, 0.11245840948328469, 0.19885073803900355, 0.09089250261355089, -0.03225401833200652, -0.21348198254731643, 0.015859593673144823, -0.1474796588653544, -0.15419902156997287, 0.03375299052220836, 0.04942179330526877, 0.003039438828687024, -0.2335626009551973, 0.12144729335652793, -0.03805282885576624, 0.10120714078683056, -0.11492854990811185, -0.2327710628169923, -0.12280647892335131, 0.03165035776778521, -0.057929652559092444, 0.05028659006380039, 0.3190290675580872, -0.10270808404954716, 0.0248112781970242, 0.4516056923733417, -0.15061078541246448, -0.0630248948797913, 0.2737823445915929, -0.21559377774102254, -0.25777867505100466, 0.22426385379998395, 0.0650370486777852, 0.1271514617554967, -0.12879789114842263, -0.04244704906653757, -0.10382957425796895, 0.24450469498898195, 0.11425893492636513, 0.06958107439831969, 0.32934640984189856, 0.1576201608533153, 0.07889363922574943, 0.1604132611357262, -0.18637474080115474, -0.09657080461578546, -0.13828895427286625, -0.22269925076349828, -0.1587199920258428, 0.073296018958623, -0.09571692151968104, -0.043942512670346635, 0.20091501156701733, 0.08625268322050325, 0.2138767670119665, -0.05611849893193219, 0.3597469006495252, 0.08313740278306052, 0.07630786858756322, 0.08530462384789936, 0.25064161028815896, 0.16735717388080917, 0.06293879822925638, -0.26062872379282437, 0.16395586166654338, 0.010520949631733872] |
1,802.08495 | Electronic entropy in Green's-function calculations at finite
temperatures | We revise critically existing approaches to evaluation of thermodynamic
potentials within the Green's function calculations at finite electronic
temperatures. We focus on the entropy and show that usual technical problems
related to the multivalued nature of the complex logarithm can be overcome.
This results in a simple expression for the electronic entropy, which does not
require any contour integration in the complex energy plane. Properties of the
developed formalism are discussed and its illustrating applications to selected
model systems and to bcc iron with disordered local magnetic moments are
presented as well.
| cond-mat.mtrl-sci | we revise critically existing approaches to evaluation of thermodynamic potentials within the greens function calculations at finite electronic temperatures we focus on the entropy and show that usual technical problems related to the multivalued nature of the complex logarithm can be overcome this results in a simple expression for the electronic entropy which does not require any contour integration in the complex energy plane properties of the developed formalism are discussed and its illustrating applications to selected model systems and to bcc iron with disordered local magnetic moments are presented as well | [['we', 'revise', 'critically', 'existing', 'approaches', 'to', 'evaluation', 'of', 'thermodynamic', 'potentials', 'within', 'the', 'greens', 'function', 'calculations', 'at', 'finite', 'electronic', 'temperatures', 'we', 'focus', 'on', 'the', 'entropy', 'and', 'show', 'that', 'usual', 'technical', 'problems', 'related', 'to', 'the', 'multivalued', 'nature', 'of', 'the', 'complex', 'logarithm', 'can', 'be', 'overcome', 'this', 'results', 'in', 'a', 'simple', 'expression', 'for', 'the', 'electronic', 'entropy', 'which', 'does', 'not', 'require', 'any', 'contour', 'integration', 'in', 'the', 'complex', 'energy', 'plane', 'properties', 'of', 'the', 'developed', 'formalism', 'are', 'discussed', 'and', 'its', 'illustrating', 'applications', 'to', 'selected', 'model', 'systems', 'and', 'to', 'bcc', 'iron', 'with', 'disordered', 'local', 'magnetic', 'moments', 'are', 'presented', 'as', 'well']] | [-0.10188539693658442, 0.07619170072670702, -0.05625971703304221, 0.08183369840591458, -0.06821860315571741, -0.08614384775991431, 0.04707567857922581, 0.3877258652659214, -0.24734588872398372, -0.26863902247429866, 0.0711249663955127, -0.2901007942956589, -0.15132055731247301, 0.20805186582425528, -0.02761684906537361, 0.07061341341076237, 0.009909656404963007, 0.03675316483650417, -0.13050572755088544, -0.21823815444646322, 0.3028744259019099, 0.03196066343124308, 0.28657188374073367, 0.13492015897772153, 0.04090342259176238, 0.021118472024049286, 0.013231179585842334, 0.05172891134355703, -0.1552651115600937, 0.11419949375862337, 0.26991146848456044, 0.06965719123431684, 0.22387117401534773, -0.4490989392380352, -0.2307134680956116, 0.07307557388127822, 0.11845823329412783, 0.11567132892314871, -0.01764838522902447, -0.24202587941418524, 0.0758030062602104, -0.13700935037290354, -0.16750430444802117, -0.1550984203653491, -0.023323138244450092, 0.07409380703314167, -0.21291089501819047, 0.08351911589219842, 0.046817197382156533, 0.05537579992320072, -0.10179572902827362, -0.13866110990309846, -0.020669621276244034, 0.086489496433743, 0.0274691979385629, 0.003187152231871353, 0.1723589708056787, -0.10089995639725163, -0.10808770569248895, 0.390669089337082, -0.01251439814982207, -0.21771602518097294, 0.21721322321252007, -0.11666663399006685, -0.15751061977251715, 0.09900655726897126, 0.14180020487907788, 0.12433284022035482, -0.17302076106526607, 0.09804857035139677, 0.04314540970422651, 0.15560438313885874, 0.002873874413679637, 0.048234311382934124, 0.17098824266830218, 0.11398577291275495, 0.005559299981383526, 0.14102286207312514, -0.042052602033515504, -0.15494605931250946, -0.2957953383498218, -0.14906210331825961, -0.210801252797904, 0.024484455982968466, -0.0664463500973437, -0.23392489560596322, 0.3829334668977105, 0.18560728054675882, 0.18968303704067416, 0.02035493947155571, 0.30267150455113984, 0.15828888362106544, 0.07540743824337488, 0.05160462549816736, 0.21166426045617656, 0.14649493323446697, 0.11008396382575207, -0.22413415833295364, 0.05743775211284747, 0.08178417812577328] |
1,802.08496 | Benchmarking Distributed Stream Data Processing Systems | The need for scalable and efficient stream analysis has led to the
development of many open-source streaming data processing systems (SDPSs) with
highly diverging capabilities and performance characteristics. While first
initiatives try to compare the systems for simple workloads, there is a clear
gap of detailed analyses of the systems' performance characteristics. In this
paper, we propose a framework for benchmarking distributed stream processing
engines. We use our suite to evaluate the performance of three widely used
SDPSs in detail, namely Apache Storm, Apache Spark, and Apache Flink. Our
evaluation focuses in particular on measuring the throughput and latency of
windowed operations, which are the basic type of operations in stream
analytics. For this benchmark, we design workloads based on real-life,
industrial use-cases inspired by the online gaming industry. The contribution
of our work is threefold. First, we give a definition of latency and throughput
for stateful operators. Second, we carefully separate the system under test and
driver, in order to correctly represent the open world model of typical stream
processing deployments and can, therefore, measure system performance under
realistic conditions. Third, we build the first benchmarking framework to
define and test the sustainable performance of streaming systems.
Our detailed evaluation highlights the individual characteristics and
use-cases of each system.
| cs.DB | the need for scalable and efficient stream analysis has led to the development of many opensource streaming data processing systems sdpss with highly diverging capabilities and performance characteristics while first initiatives try to compare the systems for simple workloads there is a clear gap of detailed analyses of the systems performance characteristics in this paper we propose a framework for benchmarking distributed stream processing engines we use our suite to evaluate the performance of three widely used sdpss in detail namely apache storm apache spark and apache flink our evaluation focuses in particular on measuring the throughput and latency of windowed operations which are the basic type of operations in stream analytics for this benchmark we design workloads based on reallife industrial usecases inspired by the online gaming industry the contribution of our work is threefold first we give a definition of latency and throughput for stateful operators second we carefully separate the system under test and driver in order to correctly represent the open world model of typical stream processing deployments and can therefore measure system performance under realistic conditions third we build the first benchmarking framework to define and test the sustainable performance of streaming systems our detailed evaluation highlights the individual characteristics and usecases of each system | [['the', 'need', 'for', 'scalable', 'and', 'efficient', 'stream', 'analysis', 'has', 'led', 'to', 'the', 'development', 'of', 'many', 'opensource', 'streaming', 'data', 'processing', 'systems', 'sdpss', 'with', 'highly', 'diverging', 'capabilities', 'and', 'performance', 'characteristics', 'while', 'first', 'initiatives', 'try', 'to', 'compare', 'the', 'systems', 'for', 'simple', 'workloads', 'there', 'is', 'a', 'clear', 'gap', 'of', 'detailed', 'analyses', 'of', 'the', 'systems', 'performance', 'characteristics', 'in', 'this', 'paper', 'we', 'propose', 'a', 'framework', 'for', 'benchmarking', 'distributed', 'stream', 'processing', 'engines', 'we', 'use', 'our', 'suite', 'to', 'evaluate', 'the', 'performance', 'of', 'three', 'widely', 'used', 'sdpss', 'in', 'detail', 'namely', 'apache', 'storm', 'apache', 'spark', 'and', 'apache', 'flink', 'our', 'evaluation', 'focuses', 'in', 'particular', 'on', 'measuring', 'the', 'throughput', 'and', 'latency', 'of', 'windowed', 'operations', 'which', 'are', 'the', 'basic', 'type', 'of', 'operations', 'in', 'stream', 'analytics', 'for', 'this', 'benchmark', 'we', 'design', 'workloads', 'based', 'on', 'reallife', 'industrial', 'usecases', 'inspired', 'by', 'the', 'online', 'gaming', 'industry', 'the', 'contribution', 'of', 'our', 'work', 'is', 'threefold', 'first', 'we', 'give', 'a', 'definition', 'of', 'latency', 'and', 'throughput', 'for', 'stateful', 'operators', 'second', 'we', 'carefully', 'separate', 'the', 'system', 'under', 'test', 'and', 'driver', 'in', 'order', 'to', 'correctly', 'represent', 'the', 'open', 'world', 'model', 'of', 'typical', 'stream', 'processing', 'deployments', 'and', 'can', 'therefore', 'measure', 'system', 'performance', 'under', 'realistic', 'conditions', 'third', 'we', 'build', 'the', 'first', 'benchmarking', 'framework', 'to', 'define', 'and', 'test', 'the', 'sustainable', 'performance', 'of', 'streaming', 'systems', 'our', 'detailed', 'evaluation', 'highlights', 'the', 'individual', 'characteristics', 'and', 'usecases', 'of', 'each', 'system']] | [-0.15414243179839104, -0.03729614035546547, -0.08549733296184478, 0.033556443374926366, -0.057957476679943144, -0.126722204716106, 0.056864646356888655, 0.4063165098688422, -0.2388583265384603, -0.34226537875544566, 0.10927568227131045, -0.27453655773737967, -0.16166572179169564, 0.2711523393014571, -0.10660943419833739, 0.11225470610840532, 0.11936865293123097, -0.008046187985410843, -0.04753353174487529, -0.2836952071083243, 0.2886249588264036, 0.08414517074617414, 0.3527087359062324, 0.04789601971480387, 0.04646796960766481, -0.030887942266417667, -0.05712737884459784, -0.02642812457858012, -0.08578934189930666, 0.14253788968982498, 0.27298424751139605, 0.23371391180150497, 0.3038417960633524, -0.4381775843301931, -0.16936454862633793, 0.04518314016212781, 0.12434482772816689, 0.025782579877229112, -0.09915416846790602, -0.27090826765365467, 0.12040285925076415, -0.20722597415666455, -0.06695090875683281, -0.11444947181735188, 0.015100675633780506, 0.0404516231677777, -0.26040823416909775, -0.016028283715758544, 0.020869230888470505, 0.08529975583839516, -0.030091154326398212, -0.07904303313485937, 0.06503157686137666, 0.1904865746104266, -0.0004276113457028539, -0.015434657151462697, 0.17415203396544363, -0.10195900883847851, -0.1568736842846892, 0.4289477402254796, -0.05097224119135017, -0.13468351719851712, 0.21195099558938707, -0.036285811944533355, -0.19910533796736182, 0.031670731903152324, 0.2800120169972965, 0.07552007824863093, -0.23039336728666407, 0.04751660588926125, 0.015584914294707302, 0.18260942505450936, 0.02731685472155312, 0.026432814622799363, 0.17615535205718166, 0.2817912999856232, 0.049457863201286485, 0.1718827200238593, -0.07787924983411078, -0.11771485983067229, -0.2580166536656459, -0.17693773045231445, -0.11357350011194985, -0.02792344564323475, -0.07316629742119683, -0.1638460071699228, 0.41259784678158423, 0.2596731418251203, 0.132990021668285, 0.06052826353082379, 0.4071180471252704, 0.03460377616479841, 0.08775048842485725, 0.13867573160790087, 0.14227346326067794, -0.001822060984872783, 0.18857702972533075, -0.17254424397064072, 0.050372053329528384, -0.012017592624313412] |
1,802.08497 | Spherical harmonics and rigged Hilbert spaces | This paper is devoted to study discrete and continuous bases for spaces
supporting representations of SO(3) and SO(3,2) where the spherical harmonics
are involved. We show how discrete and continuous bases coexist on appropriate
choices of rigged Hilbert spaces. We prove the continuity of relevant operators
and the operators in the algebras spanned by them using appropriate topologies
on our spaces. Finally, we discuss the properties of the functionals that form
the continuous basis.
| math-ph math.MP | this paper is devoted to study discrete and continuous bases for spaces supporting representations of so3 and so32 where the spherical harmonics are involved we show how discrete and continuous bases coexist on appropriate choices of rigged hilbert spaces we prove the continuity of relevant operators and the operators in the algebras spanned by them using appropriate topologies on our spaces finally we discuss the properties of the functionals that form the continuous basis | [['this', 'paper', 'is', 'devoted', 'to', 'study', 'discrete', 'and', 'continuous', 'bases', 'for', 'spaces', 'supporting', 'representations', 'of', 'so3', 'and', 'so32', 'where', 'the', 'spherical', 'harmonics', 'are', 'involved', 'we', 'show', 'how', 'discrete', 'and', 'continuous', 'bases', 'coexist', 'on', 'appropriate', 'choices', 'of', 'rigged', 'hilbert', 'spaces', 'we', 'prove', 'the', 'continuity', 'of', 'relevant', 'operators', 'and', 'the', 'operators', 'in', 'the', 'algebras', 'spanned', 'by', 'them', 'using', 'appropriate', 'topologies', 'on', 'our', 'spaces', 'finally', 'we', 'discuss', 'the', 'properties', 'of', 'the', 'functionals', 'that', 'form', 'the', 'continuous', 'basis']] | [-0.10815598209061332, 0.13610137712109732, -0.05845609755960066, 0.11209128924167237, -0.06747771157706911, -0.0136652263290425, 0.0054829314341642765, 0.42440280786438567, -0.2809479056756843, -0.14778586806779778, 0.15241164711423572, -0.21883280151146087, -0.1906153490653614, 0.18315242303887735, -0.06572856465622003, 0.046626875567174444, 0.02361954210917591, 0.035050824822581095, -0.1759292365498589, -0.24623928994343086, 0.4839541372415182, -0.03837164822726737, 0.2726936649304588, -0.025526856600835517, 0.12890100593653483, 0.044300980721222794, -0.07747659208001317, -0.04679033636568567, -0.15584346558633214, 0.22440939234267618, 0.2638745455769822, 0.09098585928173585, 0.257244191028656, -0.4366742446263497, -0.1571362952330477, 0.1680775470402394, 0.11916790913312218, 0.015598914982448961, -0.002127290829210668, -0.317199710290879, 0.02063180538951545, -0.14495250254215017, -0.11970011519293326, -0.1864680769425389, 0.01781366125057527, 0.06739955958973214, -0.2937296686845051, 0.020475433849905793, 0.07377806104518272, 0.07281016821444437, -0.16624177736859466, -0.09141075540321401, -0.0704572167895684, 0.11277271951926318, -0.0010126769146252726, -0.008177851244958269, 0.081205740212337, -0.0455515306487025, -0.14263233310870221, 0.3736054855524688, -0.0011210765695904156, -0.3029775498938319, 0.1765313913882081, -0.16156784543213812, -0.17326329907125518, 0.016028179311998993, 0.15133190697461768, 0.15939339189916044, -0.0631793107761926, 0.1948972137399471, -0.0650859158706373, 0.09302887544067376, 0.07869768997880856, 0.0984365037403296, 0.10499590219980157, 0.10579476015944336, 0.07230898586252855, 0.15953742093532472, 0.04715899707131226, -0.10642657104983448, -0.3750295533320388, -0.18354340483956794, -0.1488552381932685, 0.01957976394584654, -0.0953918868806402, -0.15380364872917934, 0.42638969379382813, 0.11926656481935768, 0.18882181892498723, 0.06149418983683997, 0.19816526901480314, 0.09414593406128571, 0.033154880300768325, 0.03510968659601703, 0.17854299584527128, 0.14701215536774112, 0.036431549570044956, -0.14884290701357294, -0.04090608481468784, 0.18114977546438976] |
1,802.08498 | Holomorphic Curves into Algebraic Varieties Intersecting Divisors in
Subgeneral Position | Recently, there are many developments on the second main theorem for
holomorphic curves into algebraic varieties intersecting divisors in general
position or subgeneral position. In this paper, we refine the concept of
subgeneral position by introducing the notion of the index of subgeneral
position. With this new notion we give some surprising improvement of the
previous known second main theorem type results. Moreover, via the analogue
between Nevanlinna theory and Diophantine approximation, the corresponding
Schmidt's subspace type theorems are also established in the final section.
| math.CV | recently there are many developments on the second main theorem for holomorphic curves into algebraic varieties intersecting divisors in general position or subgeneral position in this paper we refine the concept of subgeneral position by introducing the notion of the index of subgeneral position with this new notion we give some surprising improvement of the previous known second main theorem type results moreover via the analogue between nevanlinna theory and diophantine approximation the corresponding schmidts subspace type theorems are also established in the final section | [['recently', 'there', 'are', 'many', 'developments', 'on', 'the', 'second', 'main', 'theorem', 'for', 'holomorphic', 'curves', 'into', 'algebraic', 'varieties', 'intersecting', 'divisors', 'in', 'general', 'position', 'or', 'subgeneral', 'position', 'in', 'this', 'paper', 'we', 'refine', 'the', 'concept', 'of', 'subgeneral', 'position', 'by', 'introducing', 'the', 'notion', 'of', 'the', 'index', 'of', 'subgeneral', 'position', 'with', 'this', 'new', 'notion', 'we', 'give', 'some', 'surprising', 'improvement', 'of', 'the', 'previous', 'known', 'second', 'main', 'theorem', 'type', 'results', 'moreover', 'via', 'the', 'analogue', 'between', 'nevanlinna', 'theory', 'and', 'diophantine', 'approximation', 'the', 'corresponding', 'schmidts', 'subspace', 'type', 'theorems', 'are', 'also', 'established', 'in', 'the', 'final', 'section']] | [-0.13957787356065476, 0.0379626527086229, -0.10845676838036845, 0.07332713123794427, -0.08879119118346887, -0.12079800017835463, 0.04984705378301442, 0.2940150554127553, -0.27878247560823666, -0.2508765734732151, 0.08491057850667001, -0.2380473130766083, -0.16861662433811409, 0.2059372159460669, -0.20634044062565354, 0.008603930254192912, 0.028845804050455198, 0.048736681068754374, -0.10581340738298262, -0.28217959102681456, 0.42983604468514813, -0.034252934190718565, 0.22822207171908196, 0.0834082691491965, 0.06445365434183795, 0.09369224074351437, -0.060763159251826654, -0.02053957345402416, -0.18295517196769223, 0.2005195260321831, 0.26515923429499655, 0.11324259311727741, 0.2563163741327384, -0.35130233008633643, -0.12371009324732073, 0.15243763084495987, 0.10611451620455174, 0.07678122727255172, -0.02468611731823972, -0.276904544267146, 0.07398365800515475, -0.11007544166024993, -0.26279417371158215, -0.033859319131657045, 0.01221466634203406, 0.07207770752994454, -0.15791941487011227, 0.033449865754022645, 0.16887690521338405, 0.10665519954088856, -0.05764234295005308, -0.13956133453449343, 0.00853228616692564, 0.0471320616766153, 0.0379925762905794, 0.06730537010247216, 0.04316185595577254, -0.038696147254942095, -0.15137198370717028, 0.3071049705476445, -0.035219618042602256, -0.21254744608612622, 0.1057559691807803, -0.1533121966976015, -0.21102819050497867, 0.09664320656481912, 0.12306116577237844, 0.14381842354367322, -0.07389443357858588, 0.1278584021739388, -0.11926707606762647, 0.07869496865964988, 0.16455476903082694, 0.05381638492690399, 0.1325163629563416, 0.08588580602013013, 0.07206829757744665, 0.14048646430293207, -0.03347486590363962, -0.09938872563926612, -0.39425889483707793, -0.1545851612737512, -0.1244015508769628, 0.0722734367064036, -0.1199503751579494, -0.15672135322409517, 0.39970950714367276, 0.09064816350993865, 0.1907969713320627, 0.08706927994156585, 0.285829986270298, 0.109986170863404, -0.007550502376740469, 0.034825485451694796, 0.2335095652998836, 0.22669276173555236, 0.059307404010392285, -0.08976043019621797, 0.022447718964780077, 0.24442044745802002] |
1,802.08499 | Note on the reflectance of mirrors exposed to a strontium beam | The high chemical reactivity of strontium, which can opacify a viewport
exposed to a strontium atomic source, is a concern for some atomic physics
experiments where it is sometimes necessary to send a laser beam
counter-propagating relative to the atomic beam. While a number of experiments
use heated sapphire windows to reduce strontium deposition and increase the
viewport lifetime, here we study another possibility, consisting of sending the
laser beam into the atomic flux by reflecting it off a mirror at 45$^{\circ}$
exposed to the strontium flux. We present our attempt to find a substrate that
can be exposed to strontium and maintain high reflectivity. We first present
the formation of a strontium metallic mirror under high flux ($> 10^{13}$
at/s/cm$^2$) on a sapphire substrate, and measure its reflectivity at
45$^\circ$ to be 0.65 (S) and 0.51 (P). On two other substrates, initially
reflective metallic mirrors, we show for slightly lower fluxes (i.e., a factor
of 3) that some reaction - most probably oxidation - is able to prevent the
formation of the metallic layer even in high vacuum conditions. Instead, we
observe the growth of a dielectric transparent medium. Despite the continuous
deposition of strontium, the back surface reflectivity continues to dominate.
We show the unusual evolution of reflectivity on these substrates, and
emphasize two observations: i) a sharp threshold in the strontium flux
separating transparent material growth from lossy material growth; ii)
strontium's highly efficient capture of oxygen, even from rarefied sources:
here mostly the residual high vacuum pressure (10$^{-7}$mbar full pressure) and
possibly a protective SiO$_2$ surface on one of the substrates.
| physics.atom-ph cond-mat.quant-gas | the high chemical reactivity of strontium which can opacify a viewport exposed to a strontium atomic source is a concern for some atomic physics experiments where it is sometimes necessary to send a laser beam counterpropagating relative to the atomic beam while a number of experiments use heated sapphire windows to reduce strontium deposition and increase the viewport lifetime here we study another possibility consisting of sending the laser beam into the atomic flux by reflecting it off a mirror at 45circ exposed to the strontium flux we present our attempt to find a substrate that can be exposed to strontium and maintain high reflectivity we first present the formation of a strontium metallic mirror under high flux 1013 atscm2 on a sapphire substrate and measure its reflectivity at 45circ to be 065 s and 051 p on two other substrates initially reflective metallic mirrors we show for slightly lower fluxes ie a factor of 3 that some reaction most probably oxidation is able to prevent the formation of the metallic layer even in high vacuum conditions instead we observe the growth of a dielectric transparent medium despite the continuous deposition of strontium the back surface reflectivity continues to dominate we show the unusual evolution of reflectivity on these substrates and emphasize two observations i a sharp threshold in the strontium flux separating transparent material growth from lossy material growth ii strontiums highly efficient capture of oxygen even from rarefied sources here mostly the residual high vacuum pressure 107mbar full pressure and possibly a protective sio_2 surface on one of the substrates | [['the', 'high', 'chemical', 'reactivity', 'of', 'strontium', 'which', 'can', 'opacify', 'a', 'viewport', 'exposed', 'to', 'a', 'strontium', 'atomic', 'source', 'is', 'a', 'concern', 'for', 'some', 'atomic', 'physics', 'experiments', 'where', 'it', 'is', 'sometimes', 'necessary', 'to', 'send', 'a', 'laser', 'beam', 'counterpropagating', 'relative', 'to', 'the', 'atomic', 'beam', 'while', 'a', 'number', 'of', 'experiments', 'use', 'heated', 'sapphire', 'windows', 'to', 'reduce', 'strontium', 'deposition', 'and', 'increase', 'the', 'viewport', 'lifetime', 'here', 'we', 'study', 'another', 'possibility', 'consisting', 'of', 'sending', 'the', 'laser', 'beam', 'into', 'the', 'atomic', 'flux', 'by', 'reflecting', 'it', 'off', 'a', 'mirror', 'at', '45circ', 'exposed', 'to', 'the', 'strontium', 'flux', 'we', 'present', 'our', 'attempt', 'to', 'find', 'a', 'substrate', 'that', 'can', 'be', 'exposed', 'to', 'strontium', 'and', 'maintain', 'high', 'reflectivity', 'we', 'first', 'present', 'the', 'formation', 'of', 'a', 'strontium', 'metallic', 'mirror', 'under', 'high', 'flux', '1013', 'atscm2', 'on', 'a', 'sapphire', 'substrate', 'and', 'measure', 'its', 'reflectivity', 'at', '45circ', 'to', 'be', '065', 's', 'and', '051', 'p', 'on', 'two', 'other', 'substrates', 'initially', 'reflective', 'metallic', 'mirrors', 'we', 'show', 'for', 'slightly', 'lower', 'fluxes', 'ie', 'a', 'factor', 'of', '3', 'that', 'some', 'reaction', 'most', 'probably', 'oxidation', 'is', 'able', 'to', 'prevent', 'the', 'formation', 'of', 'the', 'metallic', 'layer', 'even', 'in', 'high', 'vacuum', 'conditions', 'instead', 'we', 'observe', 'the', 'growth', 'of', 'a', 'dielectric', 'transparent', 'medium', 'despite', 'the', 'continuous', 'deposition', 'of', 'strontium', 'the', 'back', 'surface', 'reflectivity', 'continues', 'to', 'dominate', 'we', 'show', 'the', 'unusual', 'evolution', 'of', 'reflectivity', 'on', 'these', 'substrates', 'and', 'emphasize', 'two', 'observations', 'i', 'a', 'sharp', 'threshold', 'in', 'the', 'strontium', 'flux', 'separating', 'transparent', 'material', 'growth', 'from', 'lossy', 'material', 'growth', 'ii', 'strontiums', 'highly', 'efficient', 'capture', 'of', 'oxygen', 'even', 'from', 'rarefied', 'sources', 'here', 'mostly', 'the', 'residual', 'high', 'vacuum', 'pressure', '107mbar', 'full', 'pressure', 'and', 'possibly', 'a', 'protective', 'sio_2', 'surface', 'on', 'one', 'of', 'the', 'substrates']] | [-0.08331443780632473, 0.21897901058947855, -0.053789425257872246, -0.013610044159915645, -0.0046681762707253644, -0.1666253823119165, 0.1062012630670021, 0.4544127211931284, -0.24975619339357066, -0.2984550054358362, 0.07599423058933845, -0.29400579525201126, -0.050871219877659, 0.19715961406563315, -0.052314404837242076, 0.008896026335260244, -0.013515907846474226, -0.07162322451237792, -0.07383373794741495, -0.21281464000290273, 0.2761184701943308, 0.0866394951513629, 0.30307833612950646, 0.08917145197195823, 0.07387983485471544, -0.07111362583191647, 0.07288788044969588, -0.0457533682523252, -0.12903008541813554, 0.0751858912245912, 0.20309648504336328, -0.020705522356605402, 0.22942396926209907, -0.4928210828482181, -0.21158126346377093, 0.0358301313880961, 0.08003933665292091, 0.1164586241388614, -0.12539496012221546, -0.21915666036697667, 0.024182692045605806, -0.11421955034476092, -0.1537162499856962, -0.015209119903219706, -0.016869222189393615, 0.002277862403790878, -0.24601642416551883, 0.001560285399566845, 0.030024385927277734, 0.053390722775059324, -0.09815711427846374, -0.08798274397037836, -0.07659441704930406, 0.04106678489492773, 0.010488685351334397, 0.04002344944207954, 0.22187427593063014, -0.10881624102719713, 0.011069124507674472, 0.394238158796062, -0.08780233931227753, -0.0847847061448319, 0.21588160422275948, -0.19742663125525584, -0.05051971225576952, 0.21260983734427727, 0.15775922580817064, 0.11675324449189325, -0.12224434116357115, -0.0065827652367099025, 0.01335823626163625, 0.2308428276117256, 0.16320049622846955, 0.044532171169443906, 0.23413464697840436, 0.20566100832219272, 0.062386172260482646, 0.1575133302508467, -0.12724687653961916, 0.03951672314261916, -0.24430570863512194, -0.17427054268119374, -0.14555215377039313, 0.08543319077151575, -0.050581567920406, -0.1756692675856942, 0.33916503955906097, 0.1048041645567431, 0.1952022822364414, -0.05886384612761524, 0.30748776772398817, 0.0499837930497439, 0.046262924379376735, 0.011051079973961089, 0.2720200418823583, 0.14443715735403603, 0.0982557967667966, -0.24350718906069854, 0.09252497933483719, -0.032530392104102836] |
1,802.085 | Definable isomorphism problem | We investigate the isomorphism problem in the setting of definable sets
(equivalent to sets with atoms): given two definable relational structures, are
they related by a definable isomorphism? Under mild assumptions on the
underlying structure of atoms, we prove decidability of the problem. The core
result is parameter-elimination: existence of an isomorphism definable with
parameters implies existence of an isomorphism definable without parameters.
| cs.LO | we investigate the isomorphism problem in the setting of definable sets equivalent to sets with atoms given two definable relational structures are they related by a definable isomorphism under mild assumptions on the underlying structure of atoms we prove decidability of the problem the core result is parameterelimination existence of an isomorphism definable with parameters implies existence of an isomorphism definable without parameters | [['we', 'investigate', 'the', 'isomorphism', 'problem', 'in', 'the', 'setting', 'of', 'definable', 'sets', 'equivalent', 'to', 'sets', 'with', 'atoms', 'given', 'two', 'definable', 'relational', 'structures', 'are', 'they', 'related', 'by', 'a', 'definable', 'isomorphism', 'under', 'mild', 'assumptions', 'on', 'the', 'underlying', 'structure', 'of', 'atoms', 'we', 'prove', 'decidability', 'of', 'the', 'problem', 'the', 'core', 'result', 'is', 'parameterelimination', 'existence', 'of', 'an', 'isomorphism', 'definable', 'with', 'parameters', 'implies', 'existence', 'of', 'an', 'isomorphism', 'definable', 'without', 'parameters']] | [-0.19401736488385546, 0.07391981071944634, -0.02495768633220465, 0.1262887516303078, -0.11198624854366626, -0.07518970438339297, 0.03881483419888442, 0.38278269905957485, -0.41076947018624316, -0.26049854482464013, 0.06938359398777867, -0.2227330833162752, -0.032125368774417906, 0.15176577244945352, -0.11473666187075357, 0.04359995710453199, 0.07112228506875615, 0.08329082670200977, -0.07545292976259764, -0.30931103803337584, 0.4666624683285913, -0.11307214111870816, 0.23191252196087472, 0.0499587720964149, 0.10641950305791632, -0.019111037637377457, 0.0551658948102305, 0.04972607385547411, -0.18538713262927148, 0.13042582948917464, 0.3134730799844669, 0.19094869373140916, 0.253003564682008, -0.4379007268036085, -0.09263570968722624, 0.20904795049629624, 0.0520742769323049, 0.011340908841380188, -0.02948983388975443, -0.3108593767448779, 0.11965741736874465, -0.0698352800456867, -0.13902632362629858, -0.08664418753957556, 0.036697653122246265, 0.035566555486331065, -0.2567463270059952, -0.017398895245165594, 0.19289668733554502, 0.1250247012583479, -0.14401699093756296, 0.009285944204631021, 0.012495537498785604, 0.0567674003015723, -0.01005148866979946, -0.003019424613505121, 0.10253348835413495, -0.07775858977449036, -0.16307593487022864, 0.4215771346202781, -0.06892432401617689, -0.15387703574472858, 0.17834775683079515, -0.07891327646681137, -0.22007363260303053, 0.08242638275447872, -0.0018089523148392477, 0.11615905108591242, -0.07723618234271154, 0.25029316712771693, -0.20546372677950608, 0.2242586625920188, 0.17375682015723037, 0.030945779485327583, 0.08347713646869506, 0.1501512023274817, 0.11446537468732605, 0.22800467058175033, 0.11373792570309653, -0.04221102453377699, -0.31822133451820384, -0.05445496621541679, -0.066955138057951, 0.07903402432378742, -0.1405473698095809, -0.2486858720996327, 0.34357213975501155, 0.14686832978059688, 0.179692909602196, 0.12077206544457905, 0.18566540271163948, 0.06530512696612746, 0.03200867681974365, 0.06391526043655411, 0.15790262728208496, 0.2443784304421335, -0.11312020467894693, -0.15721622906294802, 0.10928948559317618, 0.15339226151005395] |
1,802.08501 | Central Limit theorem for toric \kahler manifolds | Associated to the Bergman kernels of a polarized toric \kahler manifold $(M,
\omega, L, h)$ are sequences of measures $\{\mu_k^z\}_{k=1}^{\infty}$
parametrized by the points $z \in M$. For each $z$ in the open orbit, we prove
a central limit theorem for $\mu_k^z$. The center of mass of $\mu_k^z$ is the
image of $z$ under the moment map; after re-centering at $0$ and dilating by
$\sqrt{k}$, the re-normalized measure tends to a centered Gaussian whose
variance is the Hessian of the \kahler potential at $z$. We further give a
remainder estimate of Berry-Esseen type. The sequence $\{\mu_k^z\}$ is
generally not a sequence of convolution powers and the proofs only involve
\kahler analysis.
| math.PR math.CV | associated to the bergman kernels of a polarized toric kahler manifold m omega l h are sequences of measures mu_kz_k1infty parametrized by the points z in m for each z in the open orbit we prove a central limit theorem for mu_kz the center of mass of mu_kz is the image of z under the moment map after recentering at 0 and dilating by sqrtk the renormalized measure tends to a centered gaussian whose variance is the hessian of the kahler potential at z we further give a remainder estimate of berryesseen type the sequence mu_kz is generally not a sequence of convolution powers and the proofs only involve kahler analysis | [['associated', 'to', 'the', 'bergman', 'kernels', 'of', 'a', 'polarized', 'toric', 'kahler', 'manifold', 'm', 'omega', 'l', 'h', 'are', 'sequences', 'of', 'measures', 'mu_kz_k1infty', 'parametrized', 'by', 'the', 'points', 'z', 'in', 'm', 'for', 'each', 'z', 'in', 'the', 'open', 'orbit', 'we', 'prove', 'a', 'central', 'limit', 'theorem', 'for', 'mu_kz', 'the', 'center', 'of', 'mass', 'of', 'mu_kz', 'is', 'the', 'image', 'of', 'z', 'under', 'the', 'moment', 'map', 'after', 'recentering', 'at', '0', 'and', 'dilating', 'by', 'sqrtk', 'the', 'renormalized', 'measure', 'tends', 'to', 'a', 'centered', 'gaussian', 'whose', 'variance', 'is', 'the', 'hessian', 'of', 'the', 'kahler', 'potential', 'at', 'z', 'we', 'further', 'give', 'a', 'remainder', 'estimate', 'of', 'berryesseen', 'type', 'the', 'sequence', 'mu_kz', 'is', 'generally', 'not', 'a', 'sequence', 'of', 'convolution', 'powers', 'and', 'the', 'proofs', 'only', 'involve', 'kahler', 'analysis']] | [-0.15105181362384676, 0.07779866889415478, -0.08179811986840584, 0.09010961870133707, -0.02929777043278922, -0.14085748314180158, 0.07034751532906243, 0.35800760864195497, -0.2663836557418108, -0.19036884795535694, 0.12135816951366989, -0.2641132181002335, -0.05778964183938859, 0.1738865932227451, -0.07356995494443584, 0.008355378492904658, 0.048741172258318824, 0.07474041968922723, -0.09074159472154199, -0.25686079148541796, 0.395924429073189, 0.006256904567337849, 0.16957905390299857, 0.025559391840678555, 0.1062753831290386, 0.004257743824696676, -0.042136616310612725, -0.06862975995225662, -0.14907609805972738, 0.10566647037313405, 0.20369309427385981, 0.06471891847481444, 0.2715044880243526, -0.28695527045056224, -0.12523531835229898, 0.1801348990379748, 0.12555157925764268, 0.00428159251301126, 0.0009335679192603989, -0.2820880562405695, 0.13342342600226403, -0.07293064063203267, -0.1940045806240629, -0.038767120233652266, 0.0577003056215207, 0.0659912855099802, -0.29720265197842805, 0.06824544354299591, 0.13213247876952994, 0.03895421094176444, -0.02394600668498738, -0.1476639314766296, -0.06271424171599475, 0.07789891953580082, 0.03505288121417503, 0.14184593662873587, 0.12399454468183897, -0.0950601619668305, -0.05057043543254787, 0.3238475190306252, -0.12706208846489475, -0.21590960478748789, 0.09314264993775975, -0.20248656512068755, -0.13865169083953582, 0.1590841266707602, 0.12850210040342064, 0.14868011517788876, -0.09594264774244618, 0.21406394677469506, -0.038617889303714036, 0.1165669019027105, 0.10673142452724278, 0.00048454130407084116, 0.17402019015598028, 0.08822167617671023, 0.12603053837929937, 0.10477611189284786, -0.09788459985654548, -0.024333419295197185, -0.3539923033253713, -0.16866563118740238, -0.20563281898979435, 0.16334506057279544, -0.16791855239875572, -0.16790738407183778, 0.3499677721749653, 0.017669223845851692, 0.2505299385552379, 0.11190231467851183, 0.20584125324067745, 0.10814991026497657, 0.061609346459789036, 0.07459902321861592, 0.1490338007707826, 0.20902827638201416, 0.04857610784132372, -0.14462574802508407, -0.03886519587514076, 0.16528547413816505] |
1,802.08502 | Market Impact: A Systematic Study of Limit Orders | This paper is devoted to the important yet little explored subject of the
market impact of limit orders. Our analysis is based on a proprietary database
of metaorders - large orders that are split into smaller pieces before being
sent to the market. We first address the case of aggressive limit orders and
then, that of passive limit orders. In both cases, we provide empirical
evidence of a power law behaviour for the temporary market impact. The
relaxation of the price following the end of the metaorder is also studied, and
the long-term impact is shown to stabilize at a level of approximately
two-thirds of the maximum impact. Finally, a fair pricing condition during the
life cycle of the metaorders is empirically validated.
| q-fin.TR q-fin.ST | this paper is devoted to the important yet little explored subject of the market impact of limit orders our analysis is based on a proprietary database of metaorders large orders that are split into smaller pieces before being sent to the market we first address the case of aggressive limit orders and then that of passive limit orders in both cases we provide empirical evidence of a power law behaviour for the temporary market impact the relaxation of the price following the end of the metaorder is also studied and the longterm impact is shown to stabilize at a level of approximately twothirds of the maximum impact finally a fair pricing condition during the life cycle of the metaorders is empirically validated | [['this', 'paper', 'is', 'devoted', 'to', 'the', 'important', 'yet', 'little', 'explored', 'subject', 'of', 'the', 'market', 'impact', 'of', 'limit', 'orders', 'our', 'analysis', 'is', 'based', 'on', 'a', 'proprietary', 'database', 'of', 'metaorders', 'large', 'orders', 'that', 'are', 'split', 'into', 'smaller', 'pieces', 'before', 'being', 'sent', 'to', 'the', 'market', 'we', 'first', 'address', 'the', 'case', 'of', 'aggressive', 'limit', 'orders', 'and', 'then', 'that', 'of', 'passive', 'limit', 'orders', 'in', 'both', 'cases', 'we', 'provide', 'empirical', 'evidence', 'of', 'a', 'power', 'law', 'behaviour', 'for', 'the', 'temporary', 'market', 'impact', 'the', 'relaxation', 'of', 'the', 'price', 'following', 'the', 'end', 'of', 'the', 'metaorder', 'is', 'also', 'studied', 'and', 'the', 'longterm', 'impact', 'is', 'shown', 'to', 'stabilize', 'at', 'a', 'level', 'of', 'approximately', 'twothirds', 'of', 'the', 'maximum', 'impact', 'finally', 'a', 'fair', 'pricing', 'condition', 'during', 'the', 'life', 'cycle', 'of', 'the', 'metaorders', 'is', 'empirically', 'validated']] | [-0.1274348313907795, 0.07296996628941937, -0.10553296273679198, 0.08094476247359006, -0.04546839198418206, -0.060104073626447284, 0.12006622176621201, 0.35369941723517706, -0.23875166621196586, -0.28261849023859764, 0.1805969121375457, -0.27754606092043344, -0.12225027556424259, 0.20211278010526154, -0.06440102193527474, 0.0088484216663704, 0.0441622835980942, 0.04057191167676585, 0.009995647969457214, -0.33091044281685694, 0.2920851075266045, 0.08896713037059077, 0.28938048292470514, 0.07937076125965743, 0.10016324702310606, -0.0386987318414584, -0.05151618319825025, 0.04883030411458064, -0.13681151393906416, 0.11403796384416398, 0.2028291623001216, 0.09200735789051921, 0.3433491439543298, -0.44130569893378213, -0.14733462772793976, 0.1343904920762069, 0.10825559830380847, 0.04343236489679481, -0.0005464038752462165, -0.1982003586103407, 0.10131429769022421, -0.22679043150522182, -0.11940098932532013, -0.04093420612396764, 0.06536486773889084, -0.0015529256665193644, -0.2682995388711818, 0.05063622556488434, 0.0676950265302277, 0.06010924626263927, -0.044365893236407244, -0.1178279904492169, -0.013879211877136812, 0.1730283200931659, 0.13137137498821086, -0.06120869826948171, 0.1185127168237308, -0.12152371637820893, -0.11562020674044435, 0.39556053557173637, -0.050863222778702276, -0.09961001071162888, 0.1324022909584379, -0.16156593516285792, -0.11161381663891991, 0.13197397809765746, 0.1868821986031062, 0.0880128101412456, -0.14866706452591985, 0.03543628656522936, -0.025441853145374078, 0.21971233325750858, 0.060612068218121797, 0.014859147446199518, 0.1912273711479101, 0.2371356694111753, 0.09803933712375182, 0.17894558140580527, -0.05927956675286176, -0.14319411748862773, -0.269583159542383, -0.11245659329512415, -0.14615735167935184, 0.04729810694984511, -0.07500515654124892, -0.12065821995297409, 0.4205961561853402, 0.15718567514502, 0.1534745440680961, 0.06916452544840572, 0.3291039195094929, 0.13680349318329704, 0.0462428396157386, 0.07299826255633084, 0.2601612340926086, 0.03747398613906298, 0.11157515479755573, -0.20355940894767657, 0.13498632415945902, 0.00844720423557475] |
1,802.08503 | The Durham Adaptive Optics Simulation Platform (DASP): Current status | The Durham Adaptive Optics Simulation Platform (DASP) is a Monte-Carlo
modelling tool used for the simulation of astronomical and solar adaptive
optics systems. In recent years, this tool has been used to predict the
expected performance of the forthcoming extremely large telescope adaptive
optics systems, and has seen the addition of several modules with new features,
including Fresnel optics propagation and extended object wavefront sensing.
Here, we provide an overview of the features of DASP and the situations in
which it can be used. Additionally, the user tools for configuration and
control are described.
| astro-ph.IM physics.ins-det | the durham adaptive optics simulation platform dasp is a montecarlo modelling tool used for the simulation of astronomical and solar adaptive optics systems in recent years this tool has been used to predict the expected performance of the forthcoming extremely large telescope adaptive optics systems and has seen the addition of several modules with new features including fresnel optics propagation and extended object wavefront sensing here we provide an overview of the features of dasp and the situations in which it can be used additionally the user tools for configuration and control are described | [['the', 'durham', 'adaptive', 'optics', 'simulation', 'platform', 'dasp', 'is', 'a', 'montecarlo', 'modelling', 'tool', 'used', 'for', 'the', 'simulation', 'of', 'astronomical', 'and', 'solar', 'adaptive', 'optics', 'systems', 'in', 'recent', 'years', 'this', 'tool', 'has', 'been', 'used', 'to', 'predict', 'the', 'expected', 'performance', 'of', 'the', 'forthcoming', 'extremely', 'large', 'telescope', 'adaptive', 'optics', 'systems', 'and', 'has', 'seen', 'the', 'addition', 'of', 'several', 'modules', 'with', 'new', 'features', 'including', 'fresnel', 'optics', 'propagation', 'and', 'extended', 'object', 'wavefront', 'sensing', 'here', 'we', 'provide', 'an', 'overview', 'of', 'the', 'features', 'of', 'dasp', 'and', 'the', 'situations', 'in', 'which', 'it', 'can', 'be', 'used', 'additionally', 'the', 'user', 'tools', 'for', 'configuration', 'and', 'control', 'are', 'described']] | [-0.07019021297666303, 0.046126737850229006, -0.1591272495211439, 0.05978827407469656, -0.07353169618650003, -0.15444653670977246, -0.07233300174715275, 0.4137980428702654, -0.259024900963847, -0.3443471015173387, 0.16243363598094104, -0.2286981078845627, -0.20615417591514104, 0.30220337321565666, -0.07829446524401452, 0.14606736442866794, 0.09651812260098597, -0.03357153232525192, -0.020048400595848587, -0.2212050873464211, 0.23274294395455497, 0.17834589438156245, 0.25059547724123016, -0.02611026681583137, 0.12369768538492475, 0.039634104832967226, -0.08447251152841652, 0.015827616320011464, -0.11744654578889938, 0.14706596471072036, 0.3266794623093719, 0.1400437450625914, 0.27150500026789115, -0.41908596386697067, -0.24206278948707782, 0.02840316219582282, 0.14958344753138086, 0.09065221327213333, -0.12227603284879884, -0.30174138987476523, 0.011650586996148241, -0.1946335441849016, -0.15805802422952145, -0.07057467032783724, -0.03791642326742728, 0.04895297671232293, -0.28143889126070637, -0.05549093096596288, -0.015276836186766308, 0.10199723000132895, -0.01672688348991598, -0.09565665001332006, 0.05274885610870502, 0.16141222973671207, -0.06759538755385562, 0.004432625380007827, 0.10843485992084792, -0.1366750832146747, -0.13670784457923568, 0.4019669185248897, -0.021683476350091872, -0.13148449920117855, 0.2328491521642563, -0.10085138254594603, -0.12443575521118622, 0.11194819069289147, 0.22817983505058478, 0.11541893452584268, -0.15445034966823903, 0.06462384835871722, 0.0038942633731726636, 0.1638679540260358, -0.004619768132118785, 0.08569260249211591, 0.21436708558974985, 0.22839181006767173, 0.01761989903814615, 0.11612101196326276, -0.1874310372823334, -0.06872692535770067, -0.24834480432625067, -0.16456912518999084, -0.14310558051604064, -0.029540608696481015, -0.054174510904982875, -0.12117146163624018, 0.35440082473561485, 0.21692673071347018, 0.08130736293350445, -0.02791721005354354, 0.3119154270327194, 0.09020142739594102, 0.10929763875901699, 0.03506892031316269, 0.2865892888326693, 0.12066965484793515, 0.1881293828817124, -0.18669139686971903, 0.045330925409909975, 0.011767463050188219] |
1,802.08504 | Interpretable Charge Predictions for Criminal Cases: Learning to
Generate Court Views from Fact Descriptions | In this paper, we propose to study the problem of COURT VIEW GENeration from
the fact description in a criminal case. The task aims to improve the
interpretability of charge prediction systems and help automatic legal document
generation. We formulate this task as a text-to-text natural language
generation (NLG) problem. Sequenceto-sequence model has achieved cutting-edge
performances in many NLG tasks. However, due to the non-distinctions of fact
descriptions, it is hard for Seq2Seq model to generate charge-discriminative
court views. In this work, we explore charge labels to tackle this issue. We
propose a label-conditioned Seq2Seq model with attention for this problem, to
decode court views conditioned on encoded charge labels. Experimental results
show the effectiveness of our method.
| cs.CL | in this paper we propose to study the problem of court view generation from the fact description in a criminal case the task aims to improve the interpretability of charge prediction systems and help automatic legal document generation we formulate this task as a texttotext natural language generation nlg problem sequencetosequence model has achieved cuttingedge performances in many nlg tasks however due to the nondistinctions of fact descriptions it is hard for seq2seq model to generate chargediscriminative court views in this work we explore charge labels to tackle this issue we propose a labelconditioned seq2seq model with attention for this problem to decode court views conditioned on encoded charge labels experimental results show the effectiveness of our method | [['in', 'this', 'paper', 'we', 'propose', 'to', 'study', 'the', 'problem', 'of', 'court', 'view', 'generation', 'from', 'the', 'fact', 'description', 'in', 'a', 'criminal', 'case', 'the', 'task', 'aims', 'to', 'improve', 'the', 'interpretability', 'of', 'charge', 'prediction', 'systems', 'and', 'help', 'automatic', 'legal', 'document', 'generation', 'we', 'formulate', 'this', 'task', 'as', 'a', 'texttotext', 'natural', 'language', 'generation', 'nlg', 'problem', 'sequencetosequence', 'model', 'has', 'achieved', 'cuttingedge', 'performances', 'in', 'many', 'nlg', 'tasks', 'however', 'due', 'to', 'the', 'nondistinctions', 'of', 'fact', 'descriptions', 'it', 'is', 'hard', 'for', 'seq2seq', 'model', 'to', 'generate', 'chargediscriminative', 'court', 'views', 'in', 'this', 'work', 'we', 'explore', 'charge', 'labels', 'to', 'tackle', 'this', 'issue', 'we', 'propose', 'a', 'labelconditioned', 'seq2seq', 'model', 'with', 'attention', 'for', 'this', 'problem', 'to', 'decode', 'court', 'views', 'conditioned', 'on', 'encoded', 'charge', 'labels', 'experimental', 'results', 'show', 'the', 'effectiveness', 'of', 'our', 'method']] | [-0.03624258919659516, 0.0002813231888348642, -0.024550590471809974, 0.10310745920742984, -0.14710098453190015, -0.1498121220820948, 0.08522046764846891, 0.4076483711600304, -0.2719328257376733, -0.3422238920369874, 0.030540405331260484, -0.27958001428000306, -0.1880757382342025, 0.1432307291229296, -0.20936106658014267, 0.07783247460408703, 0.12874917639014513, 0.045905694312861435, -0.008233737212646267, -0.2903725100964632, 0.28593195961869283, 0.031989345999191635, 0.3690019510767382, 0.07869333358805465, 0.11718186508135303, -0.007658727681669204, -0.029153789474588375, -0.06124056089206335, -0.07279459848068655, 0.18819319591756262, 0.3676244094967842, 0.20150298260395294, 0.3498201153484052, -0.40647084201159683, -0.22074272058418262, 0.10514457920647186, 0.11861068351275247, 0.16124214931269704, -0.04626060057451706, -0.3041424296371153, 0.0950344724783107, -0.22224340018532845, -0.018643637455028037, -0.11441174112260341, -0.021920083714244157, -0.08197691189884411, -0.27189022493244996, 0.009275475800361322, 0.1122719663772327, 0.03173045533375167, -0.05724701009609777, -0.04832549946301657, 0.06737001519346529, 0.180021432256731, 0.11210509548672354, 0.089734749024248, 0.06763144224406341, -0.20341445055294216, -0.19972705570575983, 0.4227569070928123, -0.011209137065579062, -0.2419687120972768, 0.175557158757811, -0.07004021922855273, -0.2154875810743998, 0.014023263460916022, 0.22895944724871736, 0.1278914049713184, -0.16739851954271612, 0.020562105277128033, -0.08320833655863838, 0.20724999196017566, 0.05604066418726807, 0.010414393372712253, 0.23782697648781798, 0.2645228426741517, -0.010402695624582955, 0.17470654877834021, -0.05040440244154762, -0.06633078642189502, -0.1857156699867514, -0.11583462838569412, -0.1754707044314431, 0.001425953928138251, -3.080626775044948e-05, -0.1316127932023095, 0.43339639453460344, 0.33167939227398324, 0.18872236828117267, 0.09061331372991528, 0.34141128280240557, 0.04373253767338136, 0.04268097804616327, 0.023890734790905338, 0.1453717012707468, 0.0013186807784697284, 0.17464672198478617, -0.16608694692385262, 0.08523508599027992, 0.11069456740565922] |
1,802.08505 | The Laplacian spectrum of power graphs of some finite abelian p-groups | The power graph $\mathcal{G}(G)$ of a group $G$ is a simple graph whose
vertices are the elements of $G$ and two distinct vertices are adjacent if one
is a power of other. In this paper, we investigate the Laplacian spectrum of
the power graph $\mathcal{G}(\mathbb{Z}_{p^m}^n)$ of finite abelian $p$-group
$\mathbb{Z}_{p^m}^n$. In particular, we prove that the spectrum of group
$\mathbb{Z}_{p^m}^n$ is contained in the Laplacian spectrum of graph
$\mathcal{G}(\mathbb{Z}_{p^m}^n)$. For a finite abelian group $G$ whose power
graph $\mathcal{G}(G)$ is planar, we also prove that the spectrum of group $G$
is contained in the Laplacian spectrum of graph $\mathcal{G}(G)$.
| math.CO | the power graph mathcalgg of a group g is a simple graph whose vertices are the elements of g and two distinct vertices are adjacent if one is a power of other in this paper we investigate the laplacian spectrum of the power graph mathcalgmathbbz_pmn of finite abelian pgroup mathbbz_pmn in particular we prove that the spectrum of group mathbbz_pmn is contained in the laplacian spectrum of graph mathcalgmathbbz_pmn for a finite abelian group g whose power graph mathcalgg is planar we also prove that the spectrum of group g is contained in the laplacian spectrum of graph mathcalgg | [['the', 'power', 'graph', 'mathcalgg', 'of', 'a', 'group', 'g', 'is', 'a', 'simple', 'graph', 'whose', 'vertices', 'are', 'the', 'elements', 'of', 'g', 'and', 'two', 'distinct', 'vertices', 'are', 'adjacent', 'if', 'one', 'is', 'a', 'power', 'of', 'other', 'in', 'this', 'paper', 'we', 'investigate', 'the', 'laplacian', 'spectrum', 'of', 'the', 'power', 'graph', 'mathcalgmathbbz_pmn', 'of', 'finite', 'abelian', 'pgroup', 'mathbbz_pmn', 'in', 'particular', 'we', 'prove', 'that', 'the', 'spectrum', 'of', 'group', 'mathbbz_pmn', 'is', 'contained', 'in', 'the', 'laplacian', 'spectrum', 'of', 'graph', 'mathcalgmathbbz_pmn', 'for', 'a', 'finite', 'abelian', 'group', 'g', 'whose', 'power', 'graph', 'mathcalgg', 'is', 'planar', 'we', 'also', 'prove', 'that', 'the', 'spectrum', 'of', 'group', 'g', 'is', 'contained', 'in', 'the', 'laplacian', 'spectrum', 'of', 'graph', 'mathcalgg']] | [-0.21120815850598249, 0.12348006485814327, -0.1045068061273349, -0.024123445579684093, -0.1447275334675061, -0.08930079465437876, -0.03353246934344306, 0.39504970719939786, -0.2925108209252357, -0.2578419997405849, 0.08333729795719448, -0.3393844556455549, -0.14109433528624082, 0.10960533894402416, -0.10641637771929566, -0.04536560371910271, 0.08600156745432239, 0.19799213374131605, 0.04097436609628954, -0.18237056418407807, 0.3811462324700857, -0.059300962639482396, 0.201829153407169, 0.07289072506521878, 0.05424303852609898, -0.019935425616016512, -0.021794774461733668, 0.07073743812935918, -0.10848992963545147, 0.11218729188273611, 0.2660336331807469, 0.0773193895767786, 0.2248770313827615, -0.3771036131013381, -0.21446639172928897, 0.2690215749077891, 0.10299947805898754, -0.030687102087234196, -0.022518310730198495, -0.17535800855410727, 0.20309636864419045, -0.18472929855710582, -0.07941395597238289, 0.044807511303377776, 0.1029172945767641, 0.0014666880529962088, -0.2647682176706822, 0.011955649922540607, 0.10007091917489705, 0.06745469941708603, 0.07171542657735316, -0.10438236632923546, -0.07721652543466342, 0.12588429902925302, -0.0712405195484232, 0.00435014129861405, 0.05828953922088993, -0.10511860257063649, -0.120491042399877, 0.42937001934961266, -0.06877856960422114, -0.13393499352233976, 0.05452732671248285, -0.20299421736088238, -0.1835150674181549, 0.08639192938020354, 0.13290765258532605, 0.15450297462704934, -0.06187056026568538, 0.21310967736277042, -0.13990327830573446, 0.12129475453770475, 0.036239939281030704, 0.010185745701585945, 0.0851089964669786, 0.12580285602445274, 0.15688755870061485, 0.1646610944979138, 0.03186806747689843, 0.0780132591185209, -0.33126101866364477, -0.10875099559412583, -0.27988659059628845, 0.07245930634242924, -0.16973338799633844, -0.21558611077305517, 0.5359978961317162, 0.041976103794417886, 0.1620668309887773, 0.08398464226016873, 0.24339364198477645, 0.1316214371962767, 0.020356595026035058, 0.16676024436754616, 0.11127760443640383, 0.22229700513968342, -0.09468065461045817, -0.2005077379559608, -0.06200262681630097, 0.16812059802836493] |
1,802.08506 | Silicon-plasmonic integrated circuits for terahertz signal generation
and coherent detection | Optoelectronic signal processing offers great potential for generation and
detection of ultra-broadband waveforms in the THz range, so-called T-waves.
However, fabrication of the underlying high-speed photodiodes and
photoconductors still relies on complex processes using dedicated III-V
semiconductor substrates. This severely limits the application potential of
current T-wave transmitters and receivers, in particular when it comes to
highly integrated systems that combine photonic signal processing with
optoelectronic conversion to THz frequencies. In this paper, we demonstrate
that these limitations can be overcome by plasmonic internal photoemission
detectors (PIPED). PIPED can be realized on the silicon photonic platform and
hence allow to leverage the enormous opportunities of the associated device
portfolio. In our experiments, we demonstrate both T-wave signal generation and
coherent detection at frequencies of up to 1 THz. To proof the viability of our
concept, we monolithically integrate a PIPED transmitter and a PIPED receiver
on a common silicon photonic chip and use them for measuring the complex
transfer impedance of an integrated T-wave device.
| physics.optics | optoelectronic signal processing offers great potential for generation and detection of ultrabroadband waveforms in the thz range socalled twaves however fabrication of the underlying highspeed photodiodes and photoconductors still relies on complex processes using dedicated iiiv semiconductor substrates this severely limits the application potential of current twave transmitters and receivers in particular when it comes to highly integrated systems that combine photonic signal processing with optoelectronic conversion to thz frequencies in this paper we demonstrate that these limitations can be overcome by plasmonic internal photoemission detectors piped piped can be realized on the silicon photonic platform and hence allow to leverage the enormous opportunities of the associated device portfolio in our experiments we demonstrate both twave signal generation and coherent detection at frequencies of up to 1 thz to proof the viability of our concept we monolithically integrate a piped transmitter and a piped receiver on a common silicon photonic chip and use them for measuring the complex transfer impedance of an integrated twave device | [['optoelectronic', 'signal', 'processing', 'offers', 'great', 'potential', 'for', 'generation', 'and', 'detection', 'of', 'ultrabroadband', 'waveforms', 'in', 'the', 'thz', 'range', 'socalled', 'twaves', 'however', 'fabrication', 'of', 'the', 'underlying', 'highspeed', 'photodiodes', 'and', 'photoconductors', 'still', 'relies', 'on', 'complex', 'processes', 'using', 'dedicated', 'iiiv', 'semiconductor', 'substrates', 'this', 'severely', 'limits', 'the', 'application', 'potential', 'of', 'current', 'twave', 'transmitters', 'and', 'receivers', 'in', 'particular', 'when', 'it', 'comes', 'to', 'highly', 'integrated', 'systems', 'that', 'combine', 'photonic', 'signal', 'processing', 'with', 'optoelectronic', 'conversion', 'to', 'thz', 'frequencies', 'in', 'this', 'paper', 'we', 'demonstrate', 'that', 'these', 'limitations', 'can', 'be', 'overcome', 'by', 'plasmonic', 'internal', 'photoemission', 'detectors', 'piped', 'piped', 'can', 'be', 'realized', 'on', 'the', 'silicon', 'photonic', 'platform', 'and', 'hence', 'allow', 'to', 'leverage', 'the', 'enormous', 'opportunities', 'of', 'the', 'associated', 'device', 'portfolio', 'in', 'our', 'experiments', 'we', 'demonstrate', 'both', 'twave', 'signal', 'generation', 'and', 'coherent', 'detection', 'at', 'frequencies', 'of', 'up', 'to', '1', 'thz', 'to', 'proof', 'the', 'viability', 'of', 'our', 'concept', 'we', 'monolithically', 'integrate', 'a', 'piped', 'transmitter', 'and', 'a', 'piped', 'receiver', 'on', 'a', 'common', 'silicon', 'photonic', 'chip', 'and', 'use', 'them', 'for', 'measuring', 'the', 'complex', 'transfer', 'impedance', 'of', 'an', 'integrated', 'twave', 'device']] | [-0.1276263131706112, 0.08324040136118661, -0.007631919165028304, -0.052615992130041575, -0.08982815515113676, -0.19076412746671406, 0.059829043641135594, 0.48408002558550456, -0.265888648536397, -0.29428773456843704, 0.10568602264600752, -0.28516799341546506, -0.16175049848758002, 0.29651221571626457, -0.059286687599790354, 0.09368190477693045, 0.04635096312977555, -0.1061769187742867, -0.008043583627313194, -0.15028678761545297, 0.22540729088572467, 0.08884809158810573, 0.3604665661185253, 0.08494313976091401, 0.14748333755698873, -0.013929004134275245, 0.023614129352542323, -0.11350535882477898, -0.05833962122761011, 0.1691163601087571, 0.34107748803926813, 0.07794865618584813, 0.23668051236763415, -0.47518297716430047, -0.23581968103649048, 0.0716545173739333, 0.13044332991806343, 0.09453140382041655, -0.1204792728282727, -0.29633506742112975, 0.09284072201386685, -0.16139093826229617, -0.05434244341023902, -0.055382874268305876, -0.04349157782612232, 0.022492497224536747, -0.21648675234840684, -0.03108830270272248, 0.0038278276986646945, 0.00739114783227262, -0.02332637177797307, -0.07076342296133545, 0.015863577811126937, 0.08554202024544527, -0.09339575750594277, -0.04105573545334997, 0.196216643233528, -0.12510711361835825, -0.16869801710496043, 0.35779190415419954, -0.04254644349353706, -0.14595476643142585, 0.18467736730901113, -0.1467189464871431, -0.04364414875418311, 0.11591934736196247, 0.22999634728703092, 0.06262126645192549, -0.1702110672802785, 0.04836480752827611, 0.10324329663090771, 0.2231883250528992, 0.11174608412817712, 0.1537197530042471, 0.2480638378751237, 0.25110979035295117, 0.05300690612483134, 0.12469776656277046, -0.13075145902506094, 0.01237902307326383, -0.23656362792897243, -0.1845321649605289, -0.22031824060761165, 0.06630894437108598, -0.06326264316131285, -0.13093976821983233, 0.4060275491217731, 0.2168140813748057, 0.09678506926440339, 0.002320671764897359, 0.36512025079985216, 0.11299377582291505, 0.12320488009306534, -0.021718062733004733, 0.26634259952413963, 0.12711380219040688, 0.14030142003250104, -0.19483836352109637, 0.01640647960537136, -0.1075044210472076] |
1,802.08507 | On the classification of rational four-dimensional unital division
algebras | In a paper by E. Dieterich 2017, the category $\mathscr{C}(k)$ of
four-dimensional unital division algebras, whose right nucleus is non-trivial
and whose automorphism group contains Klein's four group $V$, is studied over a
general ground field $k$ with $\mathrm{char}\,k\neq 2$. In particular, the
objects in $\mathscr{C}(k)$ are exhaustively constructed from parameters in
$k^3$ and explicit isomorphism conditions for the constructed objects are found
in terms of these parameters.
In this paper, we specialize to the case $k=\mathbb{Q}$ and present results
towards a classification of $\mathscr{C}(\mathbb{Q})$. In particular, for each
field $\ell$ with $[\ell:k]=2$ we present explicity a two-parameter family of
pairwise non-isomorphic non-associative objects in $\mathscr{C}(\mathbb{Q})$
that admit $\ell$ as a subfield and we provide a method for classifying the
full subcategory of central skew fields admitting $\ell$ as a subfield and
$kV$-submodule. We also classify the subcategory of $\mathscr{C}(\mathbb{Q})$
of all four-dimensional Galois extensions of $\mathbb{Q}$ with Galois group $V$
that admit $\ell$ as a subfield.
| math.RA | in a paper by e dieterich 2017 the category mathscrck of fourdimensional unital division algebras whose right nucleus is nontrivial and whose automorphism group contains kleins four group v is studied over a general ground field k with mathrmcharkneq 2 in particular the objects in mathscrck are exhaustively constructed from parameters in k3 and explicit isomorphism conditions for the constructed objects are found in terms of these parameters in this paper we specialize to the case kmathbbq and present results towards a classification of mathscrcmathbbq in particular for each field ell with ellk2 we present explicity a twoparameter family of pairwise nonisomorphic nonassociative objects in mathscrcmathbbq that admit ell as a subfield and we provide a method for classifying the full subcategory of central skew fields admitting ell as a subfield and kvsubmodule we also classify the subcategory of mathscrcmathbbq of all fourdimensional galois extensions of mathbbq with galois group v that admit ell as a subfield | [['in', 'a', 'paper', 'by', 'e', 'dieterich', '2017', 'the', 'category', 'mathscrck', 'of', 'fourdimensional', 'unital', 'division', 'algebras', 'whose', 'right', 'nucleus', 'is', 'nontrivial', 'and', 'whose', 'automorphism', 'group', 'contains', 'kleins', 'four', 'group', 'v', 'is', 'studied', 'over', 'a', 'general', 'ground', 'field', 'k', 'with', 'mathrmcharkneq', '2', 'in', 'particular', 'the', 'objects', 'in', 'mathscrck', 'are', 'exhaustively', 'constructed', 'from', 'parameters', 'in', 'k3', 'and', 'explicit', 'isomorphism', 'conditions', 'for', 'the', 'constructed', 'objects', 'are', 'found', 'in', 'terms', 'of', 'these', 'parameters', 'in', 'this', 'paper', 'we', 'specialize', 'to', 'the', 'case', 'kmathbbq', 'and', 'present', 'results', 'towards', 'a', 'classification', 'of', 'mathscrcmathbbq', 'in', 'particular', 'for', 'each', 'field', 'ell', 'with', 'ellk2', 'we', 'present', 'explicity', 'a', 'twoparameter', 'family', 'of', 'pairwise', 'nonisomorphic', 'nonassociative', 'objects', 'in', 'mathscrcmathbbq', 'that', 'admit', 'ell', 'as', 'a', 'subfield', 'and', 'we', 'provide', 'a', 'method', 'for', 'classifying', 'the', 'full', 'subcategory', 'of', 'central', 'skew', 'fields', 'admitting', 'ell', 'as', 'a', 'subfield', 'and', 'kvsubmodule', 'we', 'also', 'classify', 'the', 'subcategory', 'of', 'mathscrcmathbbq', 'of', 'all', 'fourdimensional', 'galois', 'extensions', 'of', 'mathbbq', 'with', 'galois', 'group', 'v', 'that', 'admit', 'ell', 'as', 'a', 'subfield']] | [-0.17175596446180955, 0.06964678437716196, -0.05692293879408867, 0.023278313734455224, -0.09020604432309763, -0.13534320105846304, -0.03159148332876308, 0.3600897286564876, -0.2876350817700418, -0.24517146479457808, 0.07856807688203378, -0.2452059111539991, -0.13099393832276407, 0.2104432352979739, -0.127807423340656, -0.04795094061260804, 0.017352650210691187, 0.15038392403127943, -0.06280993750521865, -0.2755480134047759, 0.3892682093368748, -0.04707113699241278, 0.1534826010465622, -0.03073448168918101, 0.12201045014752218, 0.02008768000142971, -0.015392584068020089, 0.023977113066790387, -0.16567211485893588, 0.09558357378372397, 0.34330063097131175, 0.09015191102233262, 0.18251850179214485, -0.31258573504284215, -0.12868101691277936, 0.2201840105908326, 0.1628112381276412, 0.05147716234653042, -0.050158876269005045, -0.24997735703931165, 0.11228335505494705, -0.20826735110499728, -0.10484081746425289, -0.0873490575259217, 0.14040105258195232, -0.008414009108375281, -0.2611099421733226, 0.01070505835377844, 0.08918119623483971, 0.17315845838628519, -0.07520879103611104, -0.13913276769856636, -0.03523586294315278, 0.0965824858375037, -0.03460107340465467, 0.05747970016091131, 0.06611380171633731, -0.1262202735048889, -0.15048668379966282, 0.3928565182555198, -0.05968514885395192, -0.19874114952742672, 0.1075089750214456, -0.15942894274858424, -0.1574223622267779, 0.12952069186259252, 0.1174223428317465, 0.17175841875350437, -0.06001601307742441, 0.21143167789015047, -0.15658696582193862, 0.06811052664684561, 0.07885855508562273, 0.018785130303093374, 0.160844214206848, 0.08040678896642743, 0.04269105930908177, 0.14091670918517196, -0.009315688061551789, -0.005412504939625087, -0.37439455865667415, -0.1540335097726291, -0.05873167320626239, 0.10325434309206918, -0.05967419349261222, -0.15052525976147407, 0.4223441582125349, 0.08948963644424787, 0.1841863201220687, 0.10900990287989724, 0.1731422747282359, -0.00845732436237785, 0.08284641552167252, 0.09187940131344546, 0.13140534934623596, 0.19653084754305056, -0.05799287869609916, -0.1234476018737321, -0.07885726220989361, 0.14511834058719567] |
1,802.08508 | Exponential-constructible functions in $P$-minimal structures | Exponential-constructible functions are an extension of the class of
constructible functions. This extension was formulated by Cluckers-Loeser in
the context of semi-algebraic and sub-analytic structures, when they studied
stability under integration. In this paper we will present a natural refinement
of their definition that allows for stability results to hold within the wider
class of P-minimal structures. One of the main technical improvements is that
we remove the requirement of definable Skolem functions from the proofs. As a
result, we obtain stability in particular for all intermediate structures
between the semi-algebraic and the sub-analytic languages.
| math.LO math.NT | exponentialconstructible functions are an extension of the class of constructible functions this extension was formulated by cluckersloeser in the context of semialgebraic and subanalytic structures when they studied stability under integration in this paper we will present a natural refinement of their definition that allows for stability results to hold within the wider class of pminimal structures one of the main technical improvements is that we remove the requirement of definable skolem functions from the proofs as a result we obtain stability in particular for all intermediate structures between the semialgebraic and the subanalytic languages | [['exponentialconstructible', 'functions', 'are', 'an', 'extension', 'of', 'the', 'class', 'of', 'constructible', 'functions', 'this', 'extension', 'was', 'formulated', 'by', 'cluckersloeser', 'in', 'the', 'context', 'of', 'semialgebraic', 'and', 'subanalytic', 'structures', 'when', 'they', 'studied', 'stability', 'under', 'integration', 'in', 'this', 'paper', 'we', 'will', 'present', 'a', 'natural', 'refinement', 'of', 'their', 'definition', 'that', 'allows', 'for', 'stability', 'results', 'to', 'hold', 'within', 'the', 'wider', 'class', 'of', 'pminimal', 'structures', 'one', 'of', 'the', 'main', 'technical', 'improvements', 'is', 'that', 'we', 'remove', 'the', 'requirement', 'of', 'definable', 'skolem', 'functions', 'from', 'the', 'proofs', 'as', 'a', 'result', 'we', 'obtain', 'stability', 'in', 'particular', 'for', 'all', 'intermediate', 'structures', 'between', 'the', 'semialgebraic', 'and', 'the', 'subanalytic', 'languages']] | [-0.13874851636764435, 0.03723697629004861, -0.09217999787862471, 0.12777033214769426, -0.07016920404845571, -0.027389959263754017, 0.015416785900015384, 0.3475444978697503, -0.3007955933386024, -0.2473922754994574, 0.11486622470336907, -0.18718968133427863, -0.15594663427389682, 0.2263498348084853, -0.10624846081655631, 0.03626215365403233, 0.030098199581806647, -0.01356461704609559, -0.09139927575349847, -0.26294977824263116, 0.39671008915026135, -0.02848208362751819, 0.2347915193977508, 0.07697637616644336, 0.05961183470951274, 0.01177842138295478, 0.0007392861025824033, 0.04216252504154406, -0.16093404865108474, 0.16868555654296058, 0.3005604391442017, 0.18214661178198902, 0.29852911951812977, -0.39313710615672964, -0.14841977707073192, 0.10973823105203027, 0.09094182963661374, 0.060489909302324375, -0.03332238445216988, -0.2525868125339138, 0.14593809077199152, -0.13289061853008227, -0.1581121025250313, -0.0961334121381329, 0.013123731242809841, 0.08324493959229043, -0.2551657476838916, 0.006673082813343152, 0.15105108869202594, 0.08100693566883181, -0.11270968703753712, -0.0787831743723376, -0.006318254123857998, 0.11115379513524958, -0.005267510896528813, 0.030291371513158083, 0.06399370612641003, -0.0979133512913943, -0.12072602149218004, 0.3723005667586434, -0.07383083323749931, -0.24201157787180644, 0.20557485754475335, -0.14498896450126306, -0.21831666431488825, 0.07435768562309603, 0.11117898293354726, 0.16958637398350587, -0.11049952378643285, 0.16228395729558542, -0.09427732534389546, 0.12873589186037473, 0.13815565510192251, 0.06272069926551999, 0.12709008864662114, 0.15824570337389696, 0.09155835739356723, 0.20398986886721104, 0.025554689430096682, -0.08544539310969412, -0.3720131547764895, -0.16166113491883463, -0.09910830978720271, 0.029361464880763532, -0.06343112963200993, -0.2007044866641468, 0.40352272410738343, 0.1296161611445565, 0.15981780706924645, 0.1358799491538369, 0.24682692501773226, 0.06388026019162003, 0.09412417321297478, 0.040508155938872, 0.17850952640552312, 0.13349178745758106, 0.058449367442703314, -0.09340854045845806, 0.07441826226645486, 0.11300317951022311] |
1,802.08509 | Graph Similarity and Approximate Isomorphism | The graph similarity problem, also known as approximate graph isomorphism or
graph matching problem, has been extensively studied in the machine learning
community, but has not received much attention in the algorithms community:
Given two graphs $G,H$ of the same order $n$ with adjacency matrices $A_G,A_H$,
a well-studied measure of similarity is the Frobenius distance \[
\mathrm{dist}(G,H):=\min_{\pi}\|A_G^\pi-A_H\|_F, \] where $\pi$ ranges over all
permutations of the vertex set of $G$, where $A_G^\pi$ denotes the matrix
obtained from $A_G$ by permuting rows and columns according to $\pi$, and where
$\|M\|_F$ is the Frobenius norm of a matrix $M$. The (weighted) graph
similarity problem, denoted by SIM (WSIM), is the problem of computing this
distance for two graphs of same order. This problem is closely related to the
notoriously hard quadratic assignment problem (QAP), which is known to be
NP-hard even for severely restricted cases.
It is known that SIM (WSIM) is NP-hard; we strengthen this hardness result by
showing that the problem remains NP-hard even for the class of trees.
Identifying the boundary of tractability for WSIM is best done in the framework
of linear algebra. We show that WSIM is NP-hard as long as one of the matrices
has unbounded rank or negative eigenvalues: hence, the realm of tractability is
restricted to positive semi-definite matrices of bounded rank. Our main result
is a polynomial time algorithm for the special case where one of the matrices
has a bounded clustering number, a parameter arising from spectral graph
drawing techniques.
| cs.DS cs.CC cs.DM | the graph similarity problem also known as approximate graph isomorphism or graph matching problem has been extensively studied in the machine learning community but has not received much attention in the algorithms community given two graphs gh of the same order n with adjacency matrices a_ga_h a wellstudied measure of similarity is the frobenius distance mathrmdistghmin_pia_gpia_h_f where pi ranges over all permutations of the vertex set of g where a_gpi denotes the matrix obtained from a_g by permuting rows and columns according to pi and where m_f is the frobenius norm of a matrix m the weighted graph similarity problem denoted by sim wsim is the problem of computing this distance for two graphs of same order this problem is closely related to the notoriously hard quadratic assignment problem qap which is known to be nphard even for severely restricted cases it is known that sim wsim is nphard we strengthen this hardness result by showing that the problem remains nphard even for the class of trees identifying the boundary of tractability for wsim is best done in the framework of linear algebra we show that wsim is nphard as long as one of the matrices has unbounded rank or negative eigenvalues hence the realm of tractability is restricted to positive semidefinite matrices of bounded rank our main result is a polynomial time algorithm for the special case where one of the matrices has a bounded clustering number a parameter arising from spectral graph drawing techniques | [['the', 'graph', 'similarity', 'problem', 'also', 'known', 'as', 'approximate', 'graph', 'isomorphism', 'or', 'graph', 'matching', 'problem', 'has', 'been', 'extensively', 'studied', 'in', 'the', 'machine', 'learning', 'community', 'but', 'has', 'not', 'received', 'much', 'attention', 'in', 'the', 'algorithms', 'community', 'given', 'two', 'graphs', 'gh', 'of', 'the', 'same', 'order', 'n', 'with', 'adjacency', 'matrices', 'a_ga_h', 'a', 'wellstudied', 'measure', 'of', 'similarity', 'is', 'the', 'frobenius', 'distance', 'mathrmdistghmin_pia_gpia_h_f', 'where', 'pi', 'ranges', 'over', 'all', 'permutations', 'of', 'the', 'vertex', 'set', 'of', 'g', 'where', 'a_gpi', 'denotes', 'the', 'matrix', 'obtained', 'from', 'a_g', 'by', 'permuting', 'rows', 'and', 'columns', 'according', 'to', 'pi', 'and', 'where', 'm_f', 'is', 'the', 'frobenius', 'norm', 'of', 'a', 'matrix', 'm', 'the', 'weighted', 'graph', 'similarity', 'problem', 'denoted', 'by', 'sim', 'wsim', 'is', 'the', 'problem', 'of', 'computing', 'this', 'distance', 'for', 'two', 'graphs', 'of', 'same', 'order', 'this', 'problem', 'is', 'closely', 'related', 'to', 'the', 'notoriously', 'hard', 'quadratic', 'assignment', 'problem', 'qap', 'which', 'is', 'known', 'to', 'be', 'nphard', 'even', 'for', 'severely', 'restricted', 'cases', 'it', 'is', 'known', 'that', 'sim', 'wsim', 'is', 'nphard', 'we', 'strengthen', 'this', 'hardness', 'result', 'by', 'showing', 'that', 'the', 'problem', 'remains', 'nphard', 'even', 'for', 'the', 'class', 'of', 'trees', 'identifying', 'the', 'boundary', 'of', 'tractability', 'for', 'wsim', 'is', 'best', 'done', 'in', 'the', 'framework', 'of', 'linear', 'algebra', 'we', 'show', 'that', 'wsim', 'is', 'nphard', 'as', 'long', 'as', 'one', 'of', 'the', 'matrices', 'has', 'unbounded', 'rank', 'or', 'negative', 'eigenvalues', 'hence', 'the', 'realm', 'of', 'tractability', 'is', 'restricted', 'to', 'positive', 'semidefinite', 'matrices', 'of', 'bounded', 'rank', 'our', 'main', 'result', 'is', 'a', 'polynomial', 'time', 'algorithm', 'for', 'the', 'special', 'case', 'where', 'one', 'of', 'the', 'matrices', 'has', 'a', 'bounded', 'clustering', 'number', 'a', 'parameter', 'arising', 'from', 'spectral', 'graph', 'drawing', 'techniques']] | [-0.1249858952336274, 0.06908656370446638, -0.01080435188445253, 0.0755858804748888, -0.11676769807106918, -0.16172185076166848, 0.037312324003626905, 0.3767557564984869, -0.34533333716484804, -0.30958854785158374, 0.12412774985523918, -0.27047213812458326, -0.1640869036293876, 0.1328540989188209, -0.0864742454792921, 0.09792630123012841, 0.07581974137018707, 0.11699258507355864, -0.06722138326906373, -0.27107147935985343, 0.34256352912902893, 0.0066080510236874775, 0.19507686002659055, 0.06341447477210256, 0.07291128181128038, 0.011326636864186682, -0.0036328061552787267, 0.05266634290757508, -0.09549936912713718, 0.08906327099913018, 0.3205393451331145, 0.1807142162912069, 0.28698731501172453, -0.33478978453702274, -0.14789287025423206, 0.23856612961737386, 0.14306576655595085, 0.03852819609062923, 0.015988553027189316, -0.22708403621800244, 0.13489931484506132, -0.12164300858568201, -0.058077817939896394, 0.01472495132079923, 0.08311302514474671, -0.04721064977117895, -0.28925544550496735, 0.03858331346215101, 0.08453093184380497, 0.009055356211469743, 0.003504666926170634, -0.19193054905828136, 0.04199534681062272, 0.0949276799044798, 0.031325331968140364, 0.07364148370070774, 0.04836130142211914, -0.10039028457419587, -0.13852068777445228, 0.41677588937275206, 0.020934804326398566, -0.19124294669413364, 0.12258807495006441, -0.11409576961276248, -0.16392018705263442, 0.11751298394883933, 0.12978329934915642, 0.16287989818242882, -0.09001076017954836, 0.17731400932723831, -0.14898015546072044, 0.14347419497813768, 0.10106197693059413, -0.018581147094874226, 0.08747678466856004, 0.13839679531352556, 0.15725878304409038, 0.17872092715721316, 0.007271489690904939, -0.047987102099728805, -0.21822045729572237, -0.07742401393256898, -0.2832354249882056, 0.04314015328616082, -0.15598543001319198, -0.18187088187814618, 0.399784352599716, 0.0866366609396344, 0.21907393939107073, 0.12591636321917482, 0.2603166303434505, 0.1194281250458434, 0.05653022963854527, 0.12127682294863287, 0.167808383475671, 0.21802794355649976, 0.021834529815107553, -0.17412180709892142, 0.09323430631152611, 0.12503870784958016] |
1,802.0851 | Programmable interference between two microwave quantum memories | Interference experiments provide a simple yet powerful tool to unravel
fundamental features of quantum physics. Here we engineer an RF-driven,
time-dependent bilinear coupling that can be tuned to implement a robust 50:50
beamsplitter between stationary states stored in two superconducting cavities
in a three-dimensional architecture. With this, we realize high contrast
Hong-Ou- Mandel (HOM) interference between two spectrally-detuned stationary
modes. We demonstrate that this coupling provides an efficient method for
measuring the quantum state overlap between arbitrary states of the two
cavities. Finally, we showcase concatenated beamsplitters and differential
phase shifters to implement cascaded Mach-Zehnder interferometers, which can
control the signature of the two-photon interference on-demand. Our results
pave the way toward implementation of scalable boson sampling, the application
of linear optical quantum computing (LOQC) protocols in the microwave domain,
and quantum algorithms between long-lived bosonic memories.
| quant-ph | interference experiments provide a simple yet powerful tool to unravel fundamental features of quantum physics here we engineer an rfdriven timedependent bilinear coupling that can be tuned to implement a robust 5050 beamsplitter between stationary states stored in two superconducting cavities in a threedimensional architecture with this we realize high contrast hongou mandel hom interference between two spectrallydetuned stationary modes we demonstrate that this coupling provides an efficient method for measuring the quantum state overlap between arbitrary states of the two cavities finally we showcase concatenated beamsplitters and differential phase shifters to implement cascaded machzehnder interferometers which can control the signature of the twophoton interference ondemand our results pave the way toward implementation of scalable boson sampling the application of linear optical quantum computing loqc protocols in the microwave domain and quantum algorithms between longlived bosonic memories | [['interference', 'experiments', 'provide', 'a', 'simple', 'yet', 'powerful', 'tool', 'to', 'unravel', 'fundamental', 'features', 'of', 'quantum', 'physics', 'here', 'we', 'engineer', 'an', 'rfdriven', 'timedependent', 'bilinear', 'coupling', 'that', 'can', 'be', 'tuned', 'to', 'implement', 'a', 'robust', '5050', 'beamsplitter', 'between', 'stationary', 'states', 'stored', 'in', 'two', 'superconducting', 'cavities', 'in', 'a', 'threedimensional', 'architecture', 'with', 'this', 'we', 'realize', 'high', 'contrast', 'hongou', 'mandel', 'hom', 'interference', 'between', 'two', 'spectrallydetuned', 'stationary', 'modes', 'we', 'demonstrate', 'that', 'this', 'coupling', 'provides', 'an', 'efficient', 'method', 'for', 'measuring', 'the', 'quantum', 'state', 'overlap', 'between', 'arbitrary', 'states', 'of', 'the', 'two', 'cavities', 'finally', 'we', 'showcase', 'concatenated', 'beamsplitters', 'and', 'differential', 'phase', 'shifters', 'to', 'implement', 'cascaded', 'machzehnder', 'interferometers', 'which', 'can', 'control', 'the', 'signature', 'of', 'the', 'twophoton', 'interference', 'ondemand', 'our', 'results', 'pave', 'the', 'way', 'toward', 'implementation', 'of', 'scalable', 'boson', 'sampling', 'the', 'application', 'of', 'linear', 'optical', 'quantum', 'computing', 'loqc', 'protocols', 'in', 'the', 'microwave', 'domain', 'and', 'quantum', 'algorithms', 'between', 'longlived', 'bosonic', 'memories']] | [-0.19086903580361703, 0.19064616615158977, -0.09358371494539931, 0.032208358257776126, -0.04272666384520776, -0.2585611311506535, 0.05785377092851216, 0.44791852630784407, -0.25678948218838366, -0.2839119453633697, -0.022956505827845402, -0.21203914741465055, -0.16850537419967998, 0.23531522822347195, -0.0012208740004365716, 0.09820907962977585, 0.03630645873507841, -0.09393318955292618, -0.06833111621980446, -0.16854886065394728, 0.26173657072393003, 0.03432409282558022, 0.359110769466497, 0.015063926180386367, 0.11327217166955747, -0.020701533842571628, 0.03917471081299214, -0.08644364931559026, -0.08048995480214002, 0.11272689237461343, 0.30336033077979024, 0.06380387026515297, 0.24754242220660672, -0.46539290239760545, -0.15102109829347363, 0.08859534784535165, 0.1688507426845129, 0.19409487519656335, -0.08529203420638463, -0.33935739123262465, -0.006718134356881766, -0.18678641412064761, -0.10009576254935168, -0.15164618610116817, -0.059892313815105486, -0.03963013151866, -0.2767963368455907, 0.011341476866030408, 0.007009613709455794, -0.0024473880938089944, 0.048956383567522556, -0.003011999828124638, 0.05257950313149623, 0.09175639643731034, -0.1690692273379468, -0.012943300784921603, 0.1196265496135525, -0.10923183854987763, -0.23825947759221033, 0.3109198466614437, -0.06866152532037471, -0.18158431012895615, 0.15781084156033637, -0.07967711147948113, -0.07392360779340379, 0.06846136626486174, 0.18468296554569594, 0.06259973633431774, -0.12764325551003874, 0.004191812130396583, 0.022406432633836043, 0.20318577508442104, 0.09008045405875344, 0.18540435918154852, 0.22439912819176885, 0.17613103645956418, 0.06153314858880442, 0.21755147450826104, -0.09022323484361336, -0.11309456367727012, -0.2935658535536598, -0.1883081894604188, -0.2098736942982, 0.03684945876011625, -0.06555026276649134, -0.1508358093646273, 0.3892998724203447, 0.16896045698976034, 0.14998186192721785, -0.03044947143729694, 0.3873456437140703, 0.10022220980488997, 0.05196721012779402, 0.04881844517898143, 0.2788558911672547, 0.183072803014725, 0.06402408277876127, -0.2797243584166555, -0.013848403657046968, -0.0160958119929145] |
1,802.08511 | Practical aspects of X-ray imaging polarimetry of supernova remnants and
other extended sources | The new generation of X-ray polarisation detectors, gas pixel detectors,
which will be employed by the future space missions IXPE and eXTP, allows for
spatially resolved X-ray polarisation studies. This will be of particular
interest for X-ray synchrotron emission from extended sources like young
supernova remnants and pulsar wind nebulae. Here we report on employing a
polarisation statistic that can be used to makes maps in the Stokes I, Q, and U
parameters, a method that we expand by correcting for the energy-dependent
instrumental modulation factor, using optimal weighting of the signal. In order
to explore the types of Stokes maps that can be obtained, we present a Monte
Carlo simulation program called xpolim, with which different polarisation
weighting schemes are explored. We illustrate its use with simulations of
polarisation maps of young supernova remnants, after having described the
general science case for polarisation studies of supernova remnants, and its
connection to magnetic-field turbulence. We use xpolim simulations to show that
in general deep, ~2 Ms observations are needed to recover polarisation signals,
in particular for Cas A, for which in the polarisation fraction may be as low
as 5%.
| astro-ph.HE | the new generation of xray polarisation detectors gas pixel detectors which will be employed by the future space missions ixpe and extp allows for spatially resolved xray polarisation studies this will be of particular interest for xray synchrotron emission from extended sources like young supernova remnants and pulsar wind nebulae here we report on employing a polarisation statistic that can be used to makes maps in the stokes i q and u parameters a method that we expand by correcting for the energydependent instrumental modulation factor using optimal weighting of the signal in order to explore the types of stokes maps that can be obtained we present a monte carlo simulation program called xpolim with which different polarisation weighting schemes are explored we illustrate its use with simulations of polarisation maps of young supernova remnants after having described the general science case for polarisation studies of supernova remnants and its connection to magneticfield turbulence we use xpolim simulations to show that in general deep 2 ms observations are needed to recover polarisation signals in particular for cas a for which in the polarisation fraction may be as low as 5 | [['the', 'new', 'generation', 'of', 'xray', 'polarisation', 'detectors', 'gas', 'pixel', 'detectors', 'which', 'will', 'be', 'employed', 'by', 'the', 'future', 'space', 'missions', 'ixpe', 'and', 'extp', 'allows', 'for', 'spatially', 'resolved', 'xray', 'polarisation', 'studies', 'this', 'will', 'be', 'of', 'particular', 'interest', 'for', 'xray', 'synchrotron', 'emission', 'from', 'extended', 'sources', 'like', 'young', 'supernova', 'remnants', 'and', 'pulsar', 'wind', 'nebulae', 'here', 'we', 'report', 'on', 'employing', 'a', 'polarisation', 'statistic', 'that', 'can', 'be', 'used', 'to', 'makes', 'maps', 'in', 'the', 'stokes', 'i', 'q', 'and', 'u', 'parameters', 'a', 'method', 'that', 'we', 'expand', 'by', 'correcting', 'for', 'the', 'energydependent', 'instrumental', 'modulation', 'factor', 'using', 'optimal', 'weighting', 'of', 'the', 'signal', 'in', 'order', 'to', 'explore', 'the', 'types', 'of', 'stokes', 'maps', 'that', 'can', 'be', 'obtained', 'we', 'present', 'a', 'monte', 'carlo', 'simulation', 'program', 'called', 'xpolim', 'with', 'which', 'different', 'polarisation', 'weighting', 'schemes', 'are', 'explored', 'we', 'illustrate', 'its', 'use', 'with', 'simulations', 'of', 'polarisation', 'maps', 'of', 'young', 'supernova', 'remnants', 'after', 'having', 'described', 'the', 'general', 'science', 'case', 'for', 'polarisation', 'studies', 'of', 'supernova', 'remnants', 'and', 'its', 'connection', 'to', 'magneticfield', 'turbulence', 'we', 'use', 'xpolim', 'simulations', 'to', 'show', 'that', 'in', 'general', 'deep', '2', 'ms', 'observations', 'are', 'needed', 'to', 'recover', 'polarisation', 'signals', 'in', 'particular', 'for', 'cas', 'a', 'for', 'which', 'in', 'the', 'polarisation', 'fraction', 'may', 'be', 'as', 'low', 'as', '5']] | [-0.047184045042934275, 0.11914875576807622, -0.06147522017473672, 0.09736569400844561, -0.09526989271646326, -0.10193997146710357, 0.02639490205353681, 0.45099285013101836, -0.24844522498785815, -0.30567780915558573, 0.11742110893890717, -0.262502001069732, -0.07532302997114652, 0.2591825884044235, -0.022844446067539777, 0.00802266716330431, 0.08713015314548257, -0.112367542818476, -0.07457828170501013, -0.2199945346478768, 0.2968605828813297, 0.12455550259573044, 0.1725318047089225, -0.025166366412799727, 0.12007674727925753, -0.02731592111051717, -0.08242271766636243, 0.037123319303878195, -0.11259756447590065, 0.07359061003514031, 0.25931059611158414, 0.1746669511503956, 0.16321556268388682, -0.3879547407850623, -0.25411742017109024, 0.10384471506682878, 0.17194865502298196, 0.08359782837896033, -0.05993989499365079, -0.2636625946467207, 0.044677253674772724, -0.19193710463537655, -0.1555297754849233, -0.05335977506833745, -0.0035776837649656103, 0.08056342574777677, -0.26622706783769473, 0.06159047632815039, -0.02851360994440682, 0.034344781055164704, -0.06880025918245009, -0.10878387147053256, 0.00900437455052173, 0.07251370523714441, -0.011608037464147274, 0.05390450580624871, 0.10241307598319489, -0.13007821996592261, -0.1271773390917781, 0.38104837527498603, -0.0641594630910054, -0.12495183893553714, 0.16216484275448353, -0.22581673046930673, -0.17983375240781127, 0.14009904258567443, 0.20056605615970144, 0.1020405507049563, -0.13225430535571153, 0.014657718625033902, -0.010387016423145665, 0.180317057351126, 0.04536602990466487, 0.04601082895746042, 0.2663749018832645, 0.13435903651252182, 0.019226533705071408, 0.15746194975354036, -0.24037084639805587, 0.016445536069829573, -0.28870875081586145, -0.11390004274522034, -0.14723866340268324, 0.07979482451349774, -0.08653114698523844, -0.11135068326226208, 0.37681625591234325, 0.1831975342053177, 0.12103813272365864, -0.004795162259239426, 0.30756924525299606, 0.10599026888512332, 0.05989110902536343, 0.07335152194780753, 0.28793232437183564, 0.14977839939603385, 0.11659414145756176, -0.19928185958192346, 0.059156981629983306, 0.0027768627017181603] |
1,802.08512 | Extended Homotopy Quantum Field Theories and their Orbifoldization | We present a precise definition of extended homotopy quantum field theories
and develop an orbifold construction for these theories when the target space
is the classifying space of a finite group $G$, i.e. for $G$-equivariant
topological field theories. More precisely, we use a bicategorical version of
the parallel section functor to associate to an extended equivariant
topological field theory an ordinary extended topological field theory.
Thereby, we give a unification, geometric underpinning and vast generalization
of algebraic concepts of orbifoldization. In the special case of
3-2-1-dimensional equivariant topological field theories, we investigate the
equivariant modular structure on the categories that such theories yield upon
evaluation on the circle. By means of our orbifold construction this
equivariant modular structure will be related to the modular structure on the
orbifold category. We also generalize our orbifold construction to a
pushforward operation along an arbitrary morphism of finite groups and hence
provide a valuable tool for the construction of extended homotopy quantum field
theories.
| math.QA math-ph math.MP | we present a precise definition of extended homotopy quantum field theories and develop an orbifold construction for these theories when the target space is the classifying space of a finite group g ie for gequivariant topological field theories more precisely we use a bicategorical version of the parallel section functor to associate to an extended equivariant topological field theory an ordinary extended topological field theory thereby we give a unification geometric underpinning and vast generalization of algebraic concepts of orbifoldization in the special case of 321dimensional equivariant topological field theories we investigate the equivariant modular structure on the categories that such theories yield upon evaluation on the circle by means of our orbifold construction this equivariant modular structure will be related to the modular structure on the orbifold category we also generalize our orbifold construction to a pushforward operation along an arbitrary morphism of finite groups and hence provide a valuable tool for the construction of extended homotopy quantum field theories | [['we', 'present', 'a', 'precise', 'definition', 'of', 'extended', 'homotopy', 'quantum', 'field', 'theories', 'and', 'develop', 'an', 'orbifold', 'construction', 'for', 'these', 'theories', 'when', 'the', 'target', 'space', 'is', 'the', 'classifying', 'space', 'of', 'a', 'finite', 'group', 'g', 'ie', 'for', 'gequivariant', 'topological', 'field', 'theories', 'more', 'precisely', 'we', 'use', 'a', 'bicategorical', 'version', 'of', 'the', 'parallel', 'section', 'functor', 'to', 'associate', 'to', 'an', 'extended', 'equivariant', 'topological', 'field', 'theory', 'an', 'ordinary', 'extended', 'topological', 'field', 'theory', 'thereby', 'we', 'give', 'a', 'unification', 'geometric', 'underpinning', 'and', 'vast', 'generalization', 'of', 'algebraic', 'concepts', 'of', 'orbifoldization', 'in', 'the', 'special', 'case', 'of', '321dimensional', 'equivariant', 'topological', 'field', 'theories', 'we', 'investigate', 'the', 'equivariant', 'modular', 'structure', 'on', 'the', 'categories', 'that', 'such', 'theories', 'yield', 'upon', 'evaluation', 'on', 'the', 'circle', 'by', 'means', 'of', 'our', 'orbifold', 'construction', 'this', 'equivariant', 'modular', 'structure', 'will', 'be', 'related', 'to', 'the', 'modular', 'structure', 'on', 'the', 'orbifold', 'category', 'we', 'also', 'generalize', 'our', 'orbifold', 'construction', 'to', 'a', 'pushforward', 'operation', 'along', 'an', 'arbitrary', 'morphism', 'of', 'finite', 'groups', 'and', 'hence', 'provide', 'a', 'valuable', 'tool', 'for', 'the', 'construction', 'of', 'extended', 'homotopy', 'quantum', 'field', 'theories']] | [-0.1639459836836977, 0.07713270960703085, -0.14613162713940256, 0.12679089236771687, -0.1255173715413548, -0.1327242663654033, -0.008100949454819784, 0.32789172681223133, -0.3027988838817691, -0.23716898573111395, 0.0730038977919321, -0.15970744783007831, -0.18779377683822532, 0.19155655680224298, -0.1502779576308967, -0.03142157271577162, -0.003263887533103116, 0.07829961869447288, -0.10936330296535743, -0.2561479592848627, 0.4353149910108186, 0.013626891776220873, 0.2776428888630562, 0.03566374853180605, 0.08811301948444453, 0.03779663883615285, -0.015633973086369223, 0.020251219480633152, -0.14772447466771155, 0.19744540100800806, 0.3047756527563251, 0.06705923150584567, 0.14925023866162518, -0.4134279432997573, -0.18405697251655512, 0.10511908156695426, 0.10643698997737375, 0.08425962432374945, -0.034572087904689394, -0.32433191450982124, 0.08687739366141614, -0.21070157344220206, -0.15076971328962827, -0.13519088429166004, 0.021674153990170454, -0.06265178106259554, -0.19252839237124136, -0.10336025499727838, 0.05306076628039591, 0.1465590124663322, -0.07127732310425472, -0.016577419765962987, -0.016896444268058985, 0.09041505698642141, -0.014186433224676876, 0.08812722036673222, 0.13304227851040196, -0.1380658228721586, -0.1715221862337785, 0.3718712327303365, -0.06721325111720944, -0.20949302316876128, 0.145168531750096, -0.087874335134984, -0.22635693187621655, 0.11644714384819962, 0.07814884876133874, 0.16862204856151947, -0.005525614883026719, 0.19908910464328072, -0.08816630258806982, 0.10764224355225452, 0.0295162811758928, 0.025407359076780267, 0.2123594030563254, 0.10347121986269485, 0.09240393876680172, 0.15679733756333009, 0.02018056569067994, -0.10611498115176801, -0.3923589373240247, -0.22751211398353915, -0.06665067814610666, 0.15562255878176073, -0.1182892520931091, -0.21591572977049509, 0.4296956599166151, 0.13358038887381554, 0.15403156128304546, 0.13240075925714337, 0.22993364500580354, 0.07085632532980526, 0.06023305943526793, -0.018747642741072924, 0.1391212346847169, 0.2421857830588124, -0.010664628076483496, -0.1301310820192157, -0.08810903454723303, 0.2315908967750147] |
1,802.08513 | Fast and Sample Near-Optimal Algorithms for Learning Multidimensional
Histograms | We study the problem of robustly learning multi-dimensional histograms. A
$d$-dimensional function $h: D \rightarrow \mathbb{R}$ is called a
$k$-histogram if there exists a partition of the domain $D \subseteq
\mathbb{R}^d$ into $k$ axis-aligned rectangles such that $h$ is constant within
each such rectangle. Let $f: D \rightarrow \mathbb{R}$ be a $d$-dimensional
probability density function and suppose that $f$ is $\mathrm{OPT}$-close, in
$L_1$-distance, to an unknown $k$-histogram (with unknown partition). Our goal
is to output a hypothesis that is $O(\mathrm{OPT}) + \epsilon$ close to $f$, in
$L_1$-distance. We give an algorithm for this learning problem that uses $n =
\tilde{O}_d(k/\epsilon^2)$ samples and runs in time $\tilde{O}_d(n)$. For any
fixed dimension, our algorithm has optimal sample complexity, up to logarithmic
factors, and runs in near-linear time. Prior to our work, the time complexity
of the $d=1$ case was well-understood, but significant gaps in our
understanding remained even for $d=2$.
| cs.LG cs.DS math.ST stat.TH | we study the problem of robustly learning multidimensional histograms a ddimensional function h d rightarrow mathbbr is called a khistogram if there exists a partition of the domain d subseteq mathbbrd into k axisaligned rectangles such that h is constant within each such rectangle let f d rightarrow mathbbr be a ddimensional probability density function and suppose that f is mathrmoptclose in l_1distance to an unknown khistogram with unknown partition our goal is to output a hypothesis that is omathrmopt epsilon close to f in l_1distance we give an algorithm for this learning problem that uses n tildeo_dkepsilon2 samples and runs in time tildeo_dn for any fixed dimension our algorithm has optimal sample complexity up to logarithmic factors and runs in nearlinear time prior to our work the time complexity of the d1 case was wellunderstood but significant gaps in our understanding remained even for d2 | [['we', 'study', 'the', 'problem', 'of', 'robustly', 'learning', 'multidimensional', 'histograms', 'a', 'ddimensional', 'function', 'h', 'd', 'rightarrow', 'mathbbr', 'is', 'called', 'a', 'khistogram', 'if', 'there', 'exists', 'a', 'partition', 'of', 'the', 'domain', 'd', 'subseteq', 'mathbbrd', 'into', 'k', 'axisaligned', 'rectangles', 'such', 'that', 'h', 'is', 'constant', 'within', 'each', 'such', 'rectangle', 'let', 'f', 'd', 'rightarrow', 'mathbbr', 'be', 'a', 'ddimensional', 'probability', 'density', 'function', 'and', 'suppose', 'that', 'f', 'is', 'mathrmoptclose', 'in', 'l_1distance', 'to', 'an', 'unknown', 'khistogram', 'with', 'unknown', 'partition', 'our', 'goal', 'is', 'to', 'output', 'a', 'hypothesis', 'that', 'is', 'omathrmopt', 'epsilon', 'close', 'to', 'f', 'in', 'l_1distance', 'we', 'give', 'an', 'algorithm', 'for', 'this', 'learning', 'problem', 'that', 'uses', 'n', 'tildeo_dkepsilon2', 'samples', 'and', 'runs', 'in', 'time', 'tildeo_dn', 'for', 'any', 'fixed', 'dimension', 'our', 'algorithm', 'has', 'optimal', 'sample', 'complexity', 'up', 'to', 'logarithmic', 'factors', 'and', 'runs', 'in', 'nearlinear', 'time', 'prior', 'to', 'our', 'work', 'the', 'time', 'complexity', 'of', 'the', 'd1', 'case', 'was', 'wellunderstood', 'but', 'significant', 'gaps', 'in', 'our', 'understanding', 'remained', 'even', 'for', 'd2']] | [-0.1265587891865207, 0.09213122110637594, -0.053123340607476484, 0.00849882238396955, -0.037135190168120176, -0.1714170730613749, 0.0701950689866683, 0.40627864386860124, -0.27091292151853336, -0.24869857378907398, 0.040600887161161434, -0.28497956367209554, -0.11447718032655424, 0.1250282011558892, -0.07763185636894646, 0.08744741510599852, 0.03195353782027435, 0.0754645723377315, -0.034818629596487315, -0.2965766895877224, 0.2669357515668208, -0.03009414671867771, 0.1935479209797693, 0.02286327998547382, 0.09357920345115725, 0.0029864022639435783, 0.03229373190338841, 0.015188722581025476, -0.19603148644931884, 0.027858265339475597, 0.28905877344061054, 0.18987957934002903, 0.32980341906331373, -0.34558534738910013, -0.16710528300773406, 0.23548638907877703, 0.17332149298392682, 0.018913756882194693, -0.005903927813461182, -0.2200034368819308, 0.11462338741632624, -0.05696290105164812, -0.10783839899010327, -0.01985562348108686, 0.16131922976822186, -0.06359871515748419, -0.3816736537674573, 0.01232814004736572, 0.11495319757492505, 0.01141704358226082, -0.016983644507208864, -0.15374927324059248, 0.031998548427150705, 0.09143852882831632, -0.00034134961094077623, 0.2071540652902167, 0.06008259041077444, -0.06865212172564959, -0.11227299448784808, 0.34808022710888215, -0.07937549680314014, -0.2474256565820583, 0.14516703092532468, -0.17713169078670546, -0.1552576592592129, 0.14342798181796368, 0.17205486215755972, 0.15522735257974077, -0.06259519564197727, 0.22009572265284386, -0.13001315920485812, 0.21083327880273509, 0.07099516321347475, -0.031491198467130076, 0.10430848982978717, 0.14683532031436622, 0.11843337298987407, 0.15335638662980555, -0.04837160136589197, -0.023557988299601252, -0.31460926231180486, -0.15883842276566676, -0.249345593429892, 0.10499571101628506, -0.13491419849650438, -0.1674934325241287, 0.3016102083263473, 0.1019031103621696, 0.2526662891310915, 0.1407849044394745, 0.25678816618328965, 0.10822754364106542, 0.020761463031972904, 0.14764772867455975, 0.07573654438355859, 0.06654858744447448, -0.02158791521682181, -0.1758772614772733, 0.08227256494967765, 0.0781408448090357] |
1,802.08514 | Silicon Vibrating Wires at Low Temperatures | Nowadays microfabrication techniques originating from micro-electronics
enable to create mechanical objects of micron-size. The field of
Micro-Electro-Mechanical devices (MEMS) is continuously expanding, with an
amazingly broad range of applications at room temperature. Vibrating objects
(torsional oscillators, vibrating wires) widely used at low temperatures to
study quantum fluids, can be replaced advantageously by Silicon MEMS. In this
letter we report on the study of Silicon vibrating wire devices. A goal-post
structure covered with a metal layer is driven at resonance by the Laplace
force acting on a current in a magnetic field, while the induced voltage
arising from the cut magnetic flux allows to detect the motion. The
characteristics of the resonance have been studied from 10 mK to 30 K, in
vacuum and in $^4$He gas. In this article, we focus on the results obtained
above 1.5 K, in vacuum and gas, and introduce some features observed at lower
temperatures. The resonant properties can be quantitatively understood by means
of simple models, from the linear regime to a highly non-linear response at
strong drives. We demonstrate that the non-linearity is mostly due to the
geometry of the vibrators. We also show that in our device the friction
mechanisms originate in the metallic layers, and can be fully characterized.
The interaction with $^4$He gas is fit to theory without adjustable parameters.
| cond-mat.mes-hall | nowadays microfabrication techniques originating from microelectronics enable to create mechanical objects of micronsize the field of microelectromechanical devices mems is continuously expanding with an amazingly broad range of applications at room temperature vibrating objects torsional oscillators vibrating wires widely used at low temperatures to study quantum fluids can be replaced advantageously by silicon mems in this letter we report on the study of silicon vibrating wire devices a goalpost structure covered with a metal layer is driven at resonance by the laplace force acting on a current in a magnetic field while the induced voltage arising from the cut magnetic flux allows to detect the motion the characteristics of the resonance have been studied from 10 mk to 30 k in vacuum and in 4he gas in this article we focus on the results obtained above 15 k in vacuum and gas and introduce some features observed at lower temperatures the resonant properties can be quantitatively understood by means of simple models from the linear regime to a highly nonlinear response at strong drives we demonstrate that the nonlinearity is mostly due to the geometry of the vibrators we also show that in our device the friction mechanisms originate in the metallic layers and can be fully characterized the interaction with 4he gas is fit to theory without adjustable parameters | [['nowadays', 'microfabrication', 'techniques', 'originating', 'from', 'microelectronics', 'enable', 'to', 'create', 'mechanical', 'objects', 'of', 'micronsize', 'the', 'field', 'of', 'microelectromechanical', 'devices', 'mems', 'is', 'continuously', 'expanding', 'with', 'an', 'amazingly', 'broad', 'range', 'of', 'applications', 'at', 'room', 'temperature', 'vibrating', 'objects', 'torsional', 'oscillators', 'vibrating', 'wires', 'widely', 'used', 'at', 'low', 'temperatures', 'to', 'study', 'quantum', 'fluids', 'can', 'be', 'replaced', 'advantageously', 'by', 'silicon', 'mems', 'in', 'this', 'letter', 'we', 'report', 'on', 'the', 'study', 'of', 'silicon', 'vibrating', 'wire', 'devices', 'a', 'goalpost', 'structure', 'covered', 'with', 'a', 'metal', 'layer', 'is', 'driven', 'at', 'resonance', 'by', 'the', 'laplace', 'force', 'acting', 'on', 'a', 'current', 'in', 'a', 'magnetic', 'field', 'while', 'the', 'induced', 'voltage', 'arising', 'from', 'the', 'cut', 'magnetic', 'flux', 'allows', 'to', 'detect', 'the', 'motion', 'the', 'characteristics', 'of', 'the', 'resonance', 'have', 'been', 'studied', 'from', '10', 'mk', 'to', '30', 'k', 'in', 'vacuum', 'and', 'in', '4he', 'gas', 'in', 'this', 'article', 'we', 'focus', 'on', 'the', 'results', 'obtained', 'above', '15', 'k', 'in', 'vacuum', 'and', 'gas', 'and', 'introduce', 'some', 'features', 'observed', 'at', 'lower', 'temperatures', 'the', 'resonant', 'properties', 'can', 'be', 'quantitatively', 'understood', 'by', 'means', 'of', 'simple', 'models', 'from', 'the', 'linear', 'regime', 'to', 'a', 'highly', 'nonlinear', 'response', 'at', 'strong', 'drives', 'we', 'demonstrate', 'that', 'the', 'nonlinearity', 'is', 'mostly', 'due', 'to', 'the', 'geometry', 'of', 'the', 'vibrators', 'we', 'also', 'show', 'that', 'in', 'our', 'device', 'the', 'friction', 'mechanisms', 'originate', 'in', 'the', 'metallic', 'layers', 'and', 'can', 'be', 'fully', 'characterized', 'the', 'interaction', 'with', '4he', 'gas', 'is', 'fit', 'to', 'theory', 'without', 'adjustable', 'parameters']] | [-0.10510228870129636, 0.18514465317189618, -0.04026091218904846, -0.035755960799923, -0.03663750808918849, -0.1453235013262284, 0.02047267449564639, 0.40117112500593066, -0.27376831813969393, -0.33211026226847684, 0.05816053914710541, -0.28673305735104476, -0.1068064268112225, 0.24648301490683067, -0.0363227600295266, 0.019512106881335388, 0.004345799799458208, -0.008060954342363402, -0.034603160799650305, -0.15355635597370565, 0.29098317058524115, 0.0410046222423923, 0.28062239975922487, 0.07312499644150111, 0.08853862761541016, -0.05909410738597878, 0.06033116885545579, 0.052507276168431746, -0.13993337750679613, 0.07484284612477164, 0.2475955307440844, -0.046144305446068755, 0.22924422329435237, -0.49040895410898055, -0.2317567992516243, 0.0404963557650097, 0.11735978388566184, 0.13092173589267822, -0.0605484057048505, -0.2662254029630937, 0.06482924424133009, -0.13825549250891941, -0.14276859393562932, -0.05124184727478264, -0.014103564699392088, 0.01355751331932631, -0.21843579281888775, 0.04829208887253613, 0.041580283370884985, 0.07701458890210647, -0.06028357709702422, -0.08001786177046596, 0.004027358833065426, 0.06302793343056692, -0.0058920807501470504, 0.014284838683141227, 0.22624433276624503, -0.1378874772947959, -0.06843977599108422, 0.35842637947432443, -0.09282454808496617, -0.13253581792708824, 0.21759666748217898, -0.17432451549340675, -0.05009768248895522, 0.15852287620602346, 0.18455692331137305, 0.0921980632966469, -0.1814569204201689, 0.07080705396696099, 0.019146992285757072, 0.18505843899805438, 0.08485850680365481, 0.03360834480686621, 0.25121726056730204, 0.19533908856048418, -0.0027033911605196244, 0.16567929884450594, -0.10741728642103474, -0.03241834056733007, -0.23698941948876548, -0.11835316147216045, -0.17493961784798143, 0.05904855805089359, -0.025005158311316996, -0.15903838286176325, 0.3630220891293985, 0.1437159768369218, 0.20053313470026213, -0.04313504315214232, 0.30141881041398105, 0.1122581901986533, 0.10962953678099438, 0.043707777042783905, 0.30178125202867456, 0.17731215729356997, 0.13349740539825605, -0.23191149317691187, 0.02998914279213006, -0.012446397457494061] |
1,802.08515 | Closed-form solution to cooperative visual-inertial structure from
motion | This paper considers the problem of visual-inertial sensor fusion in the
cooperative case and it provides new theoretical contributions, which regard
its observability and its resolvability in closed form. The case of two agents
is investigated. Each agent is equipped with inertial sensors (accelerometer
and gyroscope) and with a monocular camera. By using the monocular camera, each
agent can observe the other agent. No additional camera observations (e.g., of
external point features in the environment) are considered. All the inertial
sensors are assumed to be affected by a bias. First, the entire observable
state is analytically derived. This state includes the absolute scale, the
relative velocity between the two agents, the three Euler angles that express
the rotation between the two agent frames and all the accelerometer and
gyroscope biases. Second, the paper provides the extension of the closed-form
solution given in [19] (which holds for a single agent) to the aforementioned
cooperative case. The impact of the presence of the bias on the performance of
this closed-form solution is investigated. As in the case of a single agent,
this performance is significantly sensitive to the presence of a bias on the
gyroscope, while, the presence of a bias on the accelerometer is negligible.
Finally, a simple and effective method to obtain the gyroscope bias is
proposed. Extensive simulations clearly show that the proposed method is
successful. It is amazing that, it is possible to automatically retrieve the
absolute scale and simultaneously calibrate the gyroscopes not only without any
prior knowledge (as in [13]), but also without external point features in the
environment.
| cs.RO cs.CV | this paper considers the problem of visualinertial sensor fusion in the cooperative case and it provides new theoretical contributions which regard its observability and its resolvability in closed form the case of two agents is investigated each agent is equipped with inertial sensors accelerometer and gyroscope and with a monocular camera by using the monocular camera each agent can observe the other agent no additional camera observations eg of external point features in the environment are considered all the inertial sensors are assumed to be affected by a bias first the entire observable state is analytically derived this state includes the absolute scale the relative velocity between the two agents the three euler angles that express the rotation between the two agent frames and all the accelerometer and gyroscope biases second the paper provides the extension of the closedform solution given in 19 which holds for a single agent to the aforementioned cooperative case the impact of the presence of the bias on the performance of this closedform solution is investigated as in the case of a single agent this performance is significantly sensitive to the presence of a bias on the gyroscope while the presence of a bias on the accelerometer is negligible finally a simple and effective method to obtain the gyroscope bias is proposed extensive simulations clearly show that the proposed method is successful it is amazing that it is possible to automatically retrieve the absolute scale and simultaneously calibrate the gyroscopes not only without any prior knowledge as in 13 but also without external point features in the environment | [['this', 'paper', 'considers', 'the', 'problem', 'of', 'visualinertial', 'sensor', 'fusion', 'in', 'the', 'cooperative', 'case', 'and', 'it', 'provides', 'new', 'theoretical', 'contributions', 'which', 'regard', 'its', 'observability', 'and', 'its', 'resolvability', 'in', 'closed', 'form', 'the', 'case', 'of', 'two', 'agents', 'is', 'investigated', 'each', 'agent', 'is', 'equipped', 'with', 'inertial', 'sensors', 'accelerometer', 'and', 'gyroscope', 'and', 'with', 'a', 'monocular', 'camera', 'by', 'using', 'the', 'monocular', 'camera', 'each', 'agent', 'can', 'observe', 'the', 'other', 'agent', 'no', 'additional', 'camera', 'observations', 'eg', 'of', 'external', 'point', 'features', 'in', 'the', 'environment', 'are', 'considered', 'all', 'the', 'inertial', 'sensors', 'are', 'assumed', 'to', 'be', 'affected', 'by', 'a', 'bias', 'first', 'the', 'entire', 'observable', 'state', 'is', 'analytically', 'derived', 'this', 'state', 'includes', 'the', 'absolute', 'scale', 'the', 'relative', 'velocity', 'between', 'the', 'two', 'agents', 'the', 'three', 'euler', 'angles', 'that', 'express', 'the', 'rotation', 'between', 'the', 'two', 'agent', 'frames', 'and', 'all', 'the', 'accelerometer', 'and', 'gyroscope', 'biases', 'second', 'the', 'paper', 'provides', 'the', 'extension', 'of', 'the', 'closedform', 'solution', 'given', 'in', '19', 'which', 'holds', 'for', 'a', 'single', 'agent', 'to', 'the', 'aforementioned', 'cooperative', 'case', 'the', 'impact', 'of', 'the', 'presence', 'of', 'the', 'bias', 'on', 'the', 'performance', 'of', 'this', 'closedform', 'solution', 'is', 'investigated', 'as', 'in', 'the', 'case', 'of', 'a', 'single', 'agent', 'this', 'performance', 'is', 'significantly', 'sensitive', 'to', 'the', 'presence', 'of', 'a', 'bias', 'on', 'the', 'gyroscope', 'while', 'the', 'presence', 'of', 'a', 'bias', 'on', 'the', 'accelerometer', 'is', 'negligible', 'finally', 'a', 'simple', 'and', 'effective', 'method', 'to', 'obtain', 'the', 'gyroscope', 'bias', 'is', 'proposed', 'extensive', 'simulations', 'clearly', 'show', 'that', 'the', 'proposed', 'method', 'is', 'successful', 'it', 'is', 'amazing', 'that', 'it', 'is', 'possible', 'to', 'automatically', 'retrieve', 'the', 'absolute', 'scale', 'and', 'simultaneously', 'calibrate', 'the', 'gyroscopes', 'not', 'only', 'without', 'any', 'prior', 'knowledge', 'as', 'in', '13', 'but', 'also', 'without', 'external', 'point', 'features', 'in', 'the', 'environment']] | [-0.13625542865269338, 0.06445788684037262, -0.06644209587907582, 0.010790269821882248, -0.08494424350389736, -0.16675046102954746, 0.030067697168281834, 0.39846799723421555, -0.26433888340312206, -0.32578342893787665, 0.0879164242434418, -0.2727274459971738, -0.1432168768867567, 0.17999438080270935, -0.10173229142109874, 0.022761978095259247, 0.07394127524900515, 0.11234143183490496, -0.008533004475022692, -0.2280433118669139, 0.2981638599367734, 0.06525958653011787, 0.2754233156281307, 0.0016242073505351978, 0.176468450608048, 0.015307030384694385, -0.01558480833164866, 0.03466506721274821, -0.0696064806653675, 0.09185811710750202, 0.22708647518893244, 0.09592302183942876, 0.27043508628149565, -0.3779137397659482, -0.19218122703820015, 0.08868481187829783, 0.10276583894243342, 0.11264882849869336, -0.050886854365159946, -0.3181859874396723, 0.08902571551650479, -0.17962055278679945, -0.09903954384855558, -0.023864803088566876, 0.005824535143182758, 0.02528724658011703, -0.2925709532153308, 0.03999258954358595, 0.05493400971411958, 0.05626982612227278, -0.10836913392563906, -0.07298869446199742, 0.014515400491477815, 0.19069979751363977, 0.04333003790665517, 0.024932466183537654, 0.16935601506467216, -0.1329383622193638, -0.07686668414597757, 0.3903401284035961, -0.05269326297712367, -0.24420459990605656, 0.17921814867720262, -0.12763036247130355, -0.07849122074471623, 0.09337104443007435, 0.14351614966577791, 0.11471368471692146, -0.18507076022941124, 0.058180329363311536, -0.03183047622269614, 0.17929528900130012, 0.03804377246711814, 0.014217048916636396, 0.17984076740464527, 0.15311128142583733, 0.10948263953117647, 0.12499023708510443, -0.14524787399800984, -0.07801837822933196, -0.30330491470024273, -0.14217241288839128, -0.19037955966707276, 0.00023926270178637818, -0.09010415743220201, -0.10315935292631784, 0.3861571036964414, 0.21913353435716418, 0.1852214813140352, 0.03524609646111897, 0.3974335353446154, 0.08779218645692013, 0.0666749438823346, 0.05152111284632546, 0.28508252909711557, 0.04665044138824192, 0.0964773075625003, -0.22911032570799114, 0.1165802561750586, 0.021033608296199102] |
1,802.08516 | 6D Pose Estimation using an Improved Method based on Point Pair Features | The Point Pair Feature (Drost et al. 2010) has been one of the most
successful 6D pose estimation method among model-based approaches as an
efficient, integrated and compromise alternative to the traditional local and
global pipelines. During the last years, several variations of the algorithm
have been proposed. Among these extensions, the solution introduced by
Hinterstoisser et al. (2016) is a major contribution. This work presents a
variation of this PPF method applied to the SIXD Challenge datasets presented
at the 3rd International Workshop on Recovering 6D Object Pose held at the ICCV
2017. We report an average recall of 0.77 for all datasets and overall recall
of 0.82, 0.67, 0.85, 0.37, 0.97 and 0.96 for hinterstoisser, tless, tudlight,
rutgers, tejani and doumanoglou datasets, respectively.
| cs.CV | the point pair feature drost et al 2010 has been one of the most successful 6d pose estimation method among modelbased approaches as an efficient integrated and compromise alternative to the traditional local and global pipelines during the last years several variations of the algorithm have been proposed among these extensions the solution introduced by hinterstoisser et al 2016 is a major contribution this work presents a variation of this ppf method applied to the sixd challenge datasets presented at the 3rd international workshop on recovering 6d object pose held at the iccv 2017 we report an average recall of 077 for all datasets and overall recall of 082 067 085 037 097 and 096 for hinterstoisser tless tudlight rutgers tejani and doumanoglou datasets respectively | [['the', 'point', 'pair', 'feature', 'drost', 'et', 'al', '2010', 'has', 'been', 'one', 'of', 'the', 'most', 'successful', '6d', 'pose', 'estimation', 'method', 'among', 'modelbased', 'approaches', 'as', 'an', 'efficient', 'integrated', 'and', 'compromise', 'alternative', 'to', 'the', 'traditional', 'local', 'and', 'global', 'pipelines', 'during', 'the', 'last', 'years', 'several', 'variations', 'of', 'the', 'algorithm', 'have', 'been', 'proposed', 'among', 'these', 'extensions', 'the', 'solution', 'introduced', 'by', 'hinterstoisser', 'et', 'al', '2016', 'is', 'a', 'major', 'contribution', 'this', 'work', 'presents', 'a', 'variation', 'of', 'this', 'ppf', 'method', 'applied', 'to', 'the', 'sixd', 'challenge', 'datasets', 'presented', 'at', 'the', '3rd', 'international', 'workshop', 'on', 'recovering', '6d', 'object', 'pose', 'held', 'at', 'the', 'iccv', '2017', 'we', 'report', 'an', 'average', 'recall', 'of', '077', 'for', 'all', 'datasets', 'and', 'overall', 'recall', 'of', '082', '067', '085', '037', '097', 'and', '096', 'for', 'hinterstoisser', 'tless', 'tudlight', 'rutgers', 'tejani', 'and', 'doumanoglou', 'datasets', 'respectively']] | [-0.036947959153991884, -0.02202262574194149, -0.05473583967472285, -0.027637574041333303, -0.026323438598379746, -0.12029640391563713, 0.01703493226856246, 0.34879376044717886, -0.17997421694907628, -0.45132153459145863, 0.11018357905204076, -0.31452999851997876, -0.14835509262047708, 0.20124448559610014, -0.15321378438275748, 0.09908280219247376, 0.07723136005875797, -0.02033783945302337, -0.059339626814570216, -0.3453897147171073, 0.22109767282282997, 0.1051641334700635, 0.34255862376510593, 0.047002319948968745, 0.1659958836212123, -0.012756721207366909, -0.0864175873279761, -0.02157638619369748, -0.10362096914579555, 0.14851998643539213, 0.2577766060150402, 0.1525101564919292, 0.28383823750951026, -0.32408961585833357, -0.17351315201307504, 0.07803671134998864, 0.07950322834332868, 0.07278111905204349, -0.04705873163223614, -0.31305886723764115, 0.06987399565178301, -0.20966423215281407, -0.05125544102215287, -0.03959295883778704, 0.09956505678503348, -0.06341352924641411, -0.2576613027081525, 0.14538505420846454, 0.02828081891777278, 0.09219919899439091, -0.05165639892516468, -0.1944078604248747, 0.02452702815170889, 0.12530325746155216, 0.018237914288242868, 0.12393592807397215, 0.07714459595815042, -0.10195813102695017, -0.16890161753616342, 0.3523719721963092, -0.06259430177762347, -0.0845442019783797, 0.18744965005760728, -0.037352434947486905, -0.1916390324358718, 0.09764984053149188, 0.1960477308662198, 0.11947344672980607, -0.13538167398359816, 0.06584260483041517, -0.0075162897691509484, 0.19833650638993586, 0.07755810380676541, -0.05326148428681891, 0.2185773659434359, 0.19721770505973343, 0.01887769082569028, 0.04216092326915113, -0.18514284184962213, -0.05250591966639257, -0.2269564331509173, -0.12539657046308078, -0.12832653006021785, -0.06118199154261058, -0.05962950144674909, -0.09650807349421715, 0.4060818280756347, 0.2029166635820421, 0.21490436768695964, 0.026264561454655003, 0.26831536337346534, 0.05292149279730284, 0.02393094589539125, 0.10564283747620629, 0.30969930710902405, 0.06300097907167244, 0.14514487816841673, -0.15854287850354815, 0.0420816903322209, 0.08206398192580032] |
1,802.08517 | Exclusive vector meson photoproduction with proton dissociation in
photon-hadron interactions at the LHC | At forward rapidities and high energies we expect to probe the non-linear
regime of Quantum Chromodynamics (QCD). One of the most promising observables
to constrain the QCD dynamics in this regime is exclusive vector meson
photoproduction (EVMP). We study the EVMP in association with a leading baryon
(product of the proton dissociation) in photon-hadron interactions that take
place in $pp$ and $p$Pb collisions at large impact parameters. We present the
rapidity distributions for $\rho$ and $J/\psi$ photoproduction in association
with a leading baryon (neutron and delta states) at LHC run 2 energies. Our
results show that the $V + \Delta$ cross section is almost 30 % of the $V + n$
one. Our results also show that a future experimental analysis of these
processes is, in principle, feasible and can be useful to study the leading
particle production.
| hep-ph hep-ex | at forward rapidities and high energies we expect to probe the nonlinear regime of quantum chromodynamics qcd one of the most promising observables to constrain the qcd dynamics in this regime is exclusive vector meson photoproduction evmp we study the evmp in association with a leading baryon product of the proton dissociation in photonhadron interactions that take place in pp and ppb collisions at large impact parameters we present the rapidity distributions for rho and jpsi photoproduction in association with a leading baryon neutron and delta states at lhc run 2 energies our results show that the v delta cross section is almost 30 of the v n one our results also show that a future experimental analysis of these processes is in principle feasible and can be useful to study the leading particle production | [['at', 'forward', 'rapidities', 'and', 'high', 'energies', 'we', 'expect', 'to', 'probe', 'the', 'nonlinear', 'regime', 'of', 'quantum', 'chromodynamics', 'qcd', 'one', 'of', 'the', 'most', 'promising', 'observables', 'to', 'constrain', 'the', 'qcd', 'dynamics', 'in', 'this', 'regime', 'is', 'exclusive', 'vector', 'meson', 'photoproduction', 'evmp', 'we', 'study', 'the', 'evmp', 'in', 'association', 'with', 'a', 'leading', 'baryon', 'product', 'of', 'the', 'proton', 'dissociation', 'in', 'photonhadron', 'interactions', 'that', 'take', 'place', 'in', 'pp', 'and', 'ppb', 'collisions', 'at', 'large', 'impact', 'parameters', 'we', 'present', 'the', 'rapidity', 'distributions', 'for', 'rho', 'and', 'jpsi', 'photoproduction', 'in', 'association', 'with', 'a', 'leading', 'baryon', 'neutron', 'and', 'delta', 'states', 'at', 'lhc', 'run', '2', 'energies', 'our', 'results', 'show', 'that', 'the', 'v', 'delta', 'cross', 'section', 'is', 'almost', '30', 'of', 'the', 'v', 'n', 'one', 'our', 'results', 'also', 'show', 'that', 'a', 'future', 'experimental', 'analysis', 'of', 'these', 'processes', 'is', 'in', 'principle', 'feasible', 'and', 'can', 'be', 'useful', 'to', 'study', 'the', 'leading', 'particle', 'production']] | [-0.07006518445667569, 0.21333737083952184, -0.144212504602641, 0.12186186587981258, -0.008120362962492638, -0.09841918936128624, 0.03155658395133085, 0.32980070578244824, -0.20731708755526967, -0.21573452476619018, -0.04672199678952219, -0.35766691887509766, 0.0224519863276294, 0.14048493603606604, 0.10789110460491091, 0.07657334099920397, 0.13303781106585152, 0.03657241069401304, -0.0019927928758854117, -0.21224933880364039, 0.311624622579526, 0.05525226051729448, 0.21938959473261127, 0.19720342286896927, 0.046428527019021136, 0.04097059622958854, -0.015631230576912424, -0.026400874927639963, -0.1312610438228822, 0.06756560707926164, 0.31362259109608004, 0.062296759942546485, 0.1698884200270253, -0.37119382322869365, -0.1285227302185915, 0.1373450768697593, 0.14967658045805163, 0.10985489664426833, -0.056509219220391024, -0.251233059078179, 0.1146217921336992, -0.20807739803222594, -0.13760100675539838, -0.0907161736515937, 0.035838179131624875, -0.012176656498815174, -0.3349188274583193, 0.08483796467879545, -0.06594444882788661, -0.0021245587358458174, -0.0013808876034562235, -0.17985861477338605, -0.02667716657742858, 0.029596942192357447, 0.0625142492785084, 0.1164392070810276, 0.13858247162360285, -0.1758579612291349, -0.1905265877954662, 0.40316181638864457, -0.03050809147319308, -0.13763902591610397, 0.16506317934642237, -0.26624794574109495, -0.18371523651984278, 0.12550063404013162, 0.2525563053648781, 0.09783695761364436, -0.15928965523425076, 0.06719088365487685, -0.0006817746838485753, 0.15717813275168063, 0.08261665151523495, 0.08556854336229325, 0.15516083945209783, 0.22431814085554194, -0.013734236811460169, 0.05444228061975014, -0.13091192866365114, -0.07476935227987942, -0.4121825671108026, -0.12684722449630498, -0.0726584650921049, 0.06990218314393941, -0.09388678890288618, -0.03915915554044423, 0.34043834538854384, 0.12752951156106537, 0.2921802296406693, -0.002136976887575454, 0.2968074517841968, 0.11913434469348026, 0.038053004164248706, 0.0883595587996145, 0.3133493716380111, 0.16637964648781, 0.17075511099149784, -0.25059279170991094, 0.02157646519028478, 0.013586409679717488] |
1,802.08518 | Hardy spaces for the Dunkl harmonic oscillator | Let $\Delta$ and $L=\Delta -\|\mathbf x\|^2$ be the Dunkl Laplacian and the
Dunkl harmonic oscillator respectively. We define the Hardy space $\mathcal
H^1$ associated with the Dunkl harmonic oscillator by means of the
nontangential maximal function with respect to the semigroup $e^{tL}$. We prove
that the space $\mathcal H^1$ admits characterizations by relevant Riesz
transforms and atomic decompositions. The atoms which occur in the atomic
decompositions are of local type.
| math.FA | let delta and ldelta mathbf x2 be the dunkl laplacian and the dunkl harmonic oscillator respectively we define the hardy space mathcal h1 associated with the dunkl harmonic oscillator by means of the nontangential maximal function with respect to the semigroup etl we prove that the space mathcal h1 admits characterizations by relevant riesz transforms and atomic decompositions the atoms which occur in the atomic decompositions are of local type | [['let', 'delta', 'and', 'ldelta', 'mathbf', 'x2', 'be', 'the', 'dunkl', 'laplacian', 'and', 'the', 'dunkl', 'harmonic', 'oscillator', 'respectively', 'we', 'define', 'the', 'hardy', 'space', 'mathcal', 'h1', 'associated', 'with', 'the', 'dunkl', 'harmonic', 'oscillator', 'by', 'means', 'of', 'the', 'nontangential', 'maximal', 'function', 'with', 'respect', 'to', 'the', 'semigroup', 'etl', 'we', 'prove', 'that', 'the', 'space', 'mathcal', 'h1', 'admits', 'characterizations', 'by', 'relevant', 'riesz', 'transforms', 'and', 'atomic', 'decompositions', 'the', 'atoms', 'which', 'occur', 'in', 'the', 'atomic', 'decompositions', 'are', 'of', 'local', 'type']] | [-0.09147882429492062, 0.15057481470118675, 0.014332930911664984, 0.0305247356316873, -0.06195515246529664, -0.09430673431405531, -0.03934747652549829, 0.3907821213560445, -0.35998929387756756, -0.07710186088474334, 0.09493828735680186, -0.34200304017535277, -0.09418776479682751, 0.17426901049911975, -0.04000344412135226, 0.068149032403848, 0.01776442106014916, 0.08964080600334065, -0.13941081643570213, -0.1793799877166748, 0.3656933987646231, -0.0453266579657793, 0.1457230827638081, -0.03393170971955572, 0.08693986131942698, -0.012016690196469426, -0.010430810251273214, -0.12118929385490317, -0.2412522831970169, 0.18840309457653867, 0.22460521529428662, 0.052065639294284795, 0.2987944655652557, -0.40225962779617735, -0.10784314214917166, 0.2633045864158443, 0.16196633519471756, -0.11973967841726595, 0.02405108802153596, -0.3571570766956678, -0.007277456963700908, -0.09909324685909919, -0.1798934457557542, -0.1532136552834085, 0.07290568214708142, 0.1340968230365044, -0.3357699276347246, 0.10801170329962458, 0.12326092525784459, 0.070070633638118, -0.12471947993284889, -0.11751717907110495, -0.10432804724467652, -0.00670247059315443, -0.0893768158076065, 0.10650125040805765, 0.10843253824194628, 0.02546621910961611, -0.09932454712023693, 0.3704237506325756, -0.11115412581712007, -0.27364135480685425, 0.07236676743486896, -0.2716420440003276, -0.10074702017674489, 0.04402908167269613, 0.04820944561756083, 0.08907670149845737, -0.054691667123032466, 0.23826613489821155, -0.07632694016210735, 0.07446817401131349, 0.15788402301259338, 0.08010653572023979, 0.016505558609164188, 0.05071430304752929, 0.15326214259091234, 0.15989177567451926, 0.00029400472599913234, -0.028064122636403357, -0.363696324346321, -0.18248721693775483, -0.1879357208364776, 0.11560242998280695, -0.14582961605899203, -0.14011164721367614, 0.3501811989450029, 0.007120909821242094, 0.19053880794007064, 0.06399267908085936, 0.15483807346317918, 0.20556788556942981, 0.07175051999012275, 0.034151023200580055, 0.12672519982526345, 0.2599921744815739, 0.0451432524914188, -0.23293832392830935, -0.08527428034160818, 0.26630342795646617] |
1,802.08519 | Simple advecting structures and the edge of chaos in subcritical tokamak
plasmas | In tokamak plasmas, sheared flows perpendicular to the driving temperature
gradients can strongly stabilize linear modes. While the system is linearly
stable, regimes with persistent nonlinear turbulence may develop, i.e. the
system is subcritical. A perturbation with small but finite amplitude may be
sufficient to push the plasma into a regime where nonlinear effects are
dominant and thus allow sustained turbulence. The minimum threshold for
nonlinear instability to be triggered provides a criterion for assessing
whether a tokamak is likely to stay in the quiescent (laminar) regime. At the
critical amplitude, instead of transitioning to the turbulent regime or
decaying to a laminar state, the trajectory will map out the edge of chaos.
Surprisingly, a quasi-traveling-wave solution is found as an attractor on this
edge manifold. This simple advecting solution is qualitatively similar to, but
simpler than, the avalanche-like bursts seen in earlier turbulent simulations
and provides an insight into how turbulence is sustained in subcritical plasma
systems. For large flow shearing rate, the system is only convectively
unstable, and given a localised initial perturbation, will eventually return to
a laminar state at a fixed spatial location.
| physics.plasm-ph | in tokamak plasmas sheared flows perpendicular to the driving temperature gradients can strongly stabilize linear modes while the system is linearly stable regimes with persistent nonlinear turbulence may develop ie the system is subcritical a perturbation with small but finite amplitude may be sufficient to push the plasma into a regime where nonlinear effects are dominant and thus allow sustained turbulence the minimum threshold for nonlinear instability to be triggered provides a criterion for assessing whether a tokamak is likely to stay in the quiescent laminar regime at the critical amplitude instead of transitioning to the turbulent regime or decaying to a laminar state the trajectory will map out the edge of chaos surprisingly a quasitravelingwave solution is found as an attractor on this edge manifold this simple advecting solution is qualitatively similar to but simpler than the avalanchelike bursts seen in earlier turbulent simulations and provides an insight into how turbulence is sustained in subcritical plasma systems for large flow shearing rate the system is only convectively unstable and given a localised initial perturbation will eventually return to a laminar state at a fixed spatial location | [['in', 'tokamak', 'plasmas', 'sheared', 'flows', 'perpendicular', 'to', 'the', 'driving', 'temperature', 'gradients', 'can', 'strongly', 'stabilize', 'linear', 'modes', 'while', 'the', 'system', 'is', 'linearly', 'stable', 'regimes', 'with', 'persistent', 'nonlinear', 'turbulence', 'may', 'develop', 'ie', 'the', 'system', 'is', 'subcritical', 'a', 'perturbation', 'with', 'small', 'but', 'finite', 'amplitude', 'may', 'be', 'sufficient', 'to', 'push', 'the', 'plasma', 'into', 'a', 'regime', 'where', 'nonlinear', 'effects', 'are', 'dominant', 'and', 'thus', 'allow', 'sustained', 'turbulence', 'the', 'minimum', 'threshold', 'for', 'nonlinear', 'instability', 'to', 'be', 'triggered', 'provides', 'a', 'criterion', 'for', 'assessing', 'whether', 'a', 'tokamak', 'is', 'likely', 'to', 'stay', 'in', 'the', 'quiescent', 'laminar', 'regime', 'at', 'the', 'critical', 'amplitude', 'instead', 'of', 'transitioning', 'to', 'the', 'turbulent', 'regime', 'or', 'decaying', 'to', 'a', 'laminar', 'state', 'the', 'trajectory', 'will', 'map', 'out', 'the', 'edge', 'of', 'chaos', 'surprisingly', 'a', 'quasitravelingwave', 'solution', 'is', 'found', 'as', 'an', 'attractor', 'on', 'this', 'edge', 'manifold', 'this', 'simple', 'advecting', 'solution', 'is', 'qualitatively', 'similar', 'to', 'but', 'simpler', 'than', 'the', 'avalanchelike', 'bursts', 'seen', 'in', 'earlier', 'turbulent', 'simulations', 'and', 'provides', 'an', 'insight', 'into', 'how', 'turbulence', 'is', 'sustained', 'in', 'subcritical', 'plasma', 'systems', 'for', 'large', 'flow', 'shearing', 'rate', 'the', 'system', 'is', 'only', 'convectively', 'unstable', 'and', 'given', 'a', 'localised', 'initial', 'perturbation', 'will', 'eventually', 'return', 'to', 'a', 'laminar', 'state', 'at', 'a', 'fixed', 'spatial', 'location']] | [-0.18506409959386913, 0.234593516837972, -0.11589453310044782, 0.07625509713343294, -0.05145801819225032, -0.1652152081676108, -0.0008176127861764642, 0.3005456845404365, -0.29111040274422334, -0.218964019738343, 0.12391601057512866, -0.2284108804994493, -0.08290826452780835, 0.20701475964073013, -0.02152485244404224, 0.047656639242827675, 0.05994926359734788, -0.0002245165918382906, 0.01583091980246927, -0.16445757275176864, 0.29470141498016456, 0.10347175639202838, 0.284259506086919, 0.006013508706468768, 0.0537253734830536, -0.128787433141492, 0.03642620018593246, 0.05604280833835884, -0.14999244079886942, -0.02492903232304079, 0.23023149737542475, 0.023286026891856704, 0.31965525147895657, -0.45762251977438245, -0.2513426750527835, 0.06961450273902105, 0.22537160994233413, 0.14158122197058934, -0.008410693901266792, -0.2381750483902031, 0.09964794572192415, -0.14120801078388467, -0.16734012170264156, -0.055769691038476205, 0.06879352895863435, 0.002208389527720189, -0.3501777712616228, 0.11117776743917455, 0.08951870353281578, 0.021448060379473752, -0.0747591322525755, 0.007950343536488432, -0.08169635107380248, 0.08888796226544586, 0.04186862552981643, 0.08967395721664352, 0.19676272148236393, -0.1734865832728364, -0.01559826913001817, 0.3606200188082913, -0.05110358328283348, -0.18115277314979222, 0.24636432636273844, -0.19826561396300632, -0.05989685823505003, 0.21192090990402365, 0.19524182355211628, 0.06382379717674226, -0.0776796196624937, -0.008709124925043133, -0.02749875073962074, 0.1746345570583838, 0.04541026644398689, -0.0329173762646694, 0.26684598004825977, 0.1910447403813602, 0.13624744857060572, 0.14854544840167247, -0.07468159488146944, -0.11438115583657618, -0.27289161941672485, -0.06792866800641341, -0.11733982672724592, 0.04531070130679416, -0.05504870558164135, -0.2058152886500622, 0.38075072475663957, 0.11117939147171915, 0.17797139133026282, 0.004493679358093168, 0.29374466068361715, 0.16522834850356274, -0.0030423889928046736, 0.1580783082022061, 0.2948394466281658, 0.1397903846271376, 0.14299836182861678, -0.2180945961266726, 0.07321450983734942, 0.059709272159624] |
1,802.0852 | Non-Uniqueness of Stationary Solutions in Extremum Seeking Control | Extremum seeking control (ESC) is a classical adaptive control method for
steady-state optimization, purely based on output feedback. It is well known
that the extremum seeking control loop, under certain mild conditions on the
controller, has a stable stationary periodic solution in the vicinity of an
extremum point of the steady-state input-output map of the plant. However, this
is a local result only and this paper investigates whether this solution is
necessarily unique given that the underlying optimization problem is convex. We
first derive a necessary condition that any stationary solution of the ESC loop
must satisfy. For plants in which the extremum point is due to a purely static
nonlinearity, such as in Hammerstein or Wiener plants, the condition involves
the steady-state gradient. However, for more general plants the necessary
condition involves the phase lag of the locally linearized plant, indicating
the possible existence of solutions without any relationship to optimality.
Combining the derived necessary condition with the existence of a local
solution close to the optimum, we employ bifurcation theory to trace out
branches of stationary solutions. We derive conditions on when these branches
bifurcate, resulting in multiple stationary solutions. The results show that
cyclic fold bifurcations may exist, resulting in the existence of multiple
stationary period one solutions, of which only one is related to the optimality
conditions. We illustrate the results through an example in which the
conversion in a chemical reactor is optimized using ESC. We show that at least
five stationary solutions may exist simultaneously for realistic control
parameters, and that several of these solutions are stable. One consequence of
the non-uniqueness is that one in general needs to start close to the optimum
to ensure convergence to the near-optimal solution.
| math.OC | extremum seeking control esc is a classical adaptive control method for steadystate optimization purely based on output feedback it is well known that the extremum seeking control loop under certain mild conditions on the controller has a stable stationary periodic solution in the vicinity of an extremum point of the steadystate inputoutput map of the plant however this is a local result only and this paper investigates whether this solution is necessarily unique given that the underlying optimization problem is convex we first derive a necessary condition that any stationary solution of the esc loop must satisfy for plants in which the extremum point is due to a purely static nonlinearity such as in hammerstein or wiener plants the condition involves the steadystate gradient however for more general plants the necessary condition involves the phase lag of the locally linearized plant indicating the possible existence of solutions without any relationship to optimality combining the derived necessary condition with the existence of a local solution close to the optimum we employ bifurcation theory to trace out branches of stationary solutions we derive conditions on when these branches bifurcate resulting in multiple stationary solutions the results show that cyclic fold bifurcations may exist resulting in the existence of multiple stationary period one solutions of which only one is related to the optimality conditions we illustrate the results through an example in which the conversion in a chemical reactor is optimized using esc we show that at least five stationary solutions may exist simultaneously for realistic control parameters and that several of these solutions are stable one consequence of the nonuniqueness is that one in general needs to start close to the optimum to ensure convergence to the nearoptimal solution | [['extremum', 'seeking', 'control', 'esc', 'is', 'a', 'classical', 'adaptive', 'control', 'method', 'for', 'steadystate', 'optimization', 'purely', 'based', 'on', 'output', 'feedback', 'it', 'is', 'well', 'known', 'that', 'the', 'extremum', 'seeking', 'control', 'loop', 'under', 'certain', 'mild', 'conditions', 'on', 'the', 'controller', 'has', 'a', 'stable', 'stationary', 'periodic', 'solution', 'in', 'the', 'vicinity', 'of', 'an', 'extremum', 'point', 'of', 'the', 'steadystate', 'inputoutput', 'map', 'of', 'the', 'plant', 'however', 'this', 'is', 'a', 'local', 'result', 'only', 'and', 'this', 'paper', 'investigates', 'whether', 'this', 'solution', 'is', 'necessarily', 'unique', 'given', 'that', 'the', 'underlying', 'optimization', 'problem', 'is', 'convex', 'we', 'first', 'derive', 'a', 'necessary', 'condition', 'that', 'any', 'stationary', 'solution', 'of', 'the', 'esc', 'loop', 'must', 'satisfy', 'for', 'plants', 'in', 'which', 'the', 'extremum', 'point', 'is', 'due', 'to', 'a', 'purely', 'static', 'nonlinearity', 'such', 'as', 'in', 'hammerstein', 'or', 'wiener', 'plants', 'the', 'condition', 'involves', 'the', 'steadystate', 'gradient', 'however', 'for', 'more', 'general', 'plants', 'the', 'necessary', 'condition', 'involves', 'the', 'phase', 'lag', 'of', 'the', 'locally', 'linearized', 'plant', 'indicating', 'the', 'possible', 'existence', 'of', 'solutions', 'without', 'any', 'relationship', 'to', 'optimality', 'combining', 'the', 'derived', 'necessary', 'condition', 'with', 'the', 'existence', 'of', 'a', 'local', 'solution', 'close', 'to', 'the', 'optimum', 'we', 'employ', 'bifurcation', 'theory', 'to', 'trace', 'out', 'branches', 'of', 'stationary', 'solutions', 'we', 'derive', 'conditions', 'on', 'when', 'these', 'branches', 'bifurcate', 'resulting', 'in', 'multiple', 'stationary', 'solutions', 'the', 'results', 'show', 'that', 'cyclic', 'fold', 'bifurcations', 'may', 'exist', 'resulting', 'in', 'the', 'existence', 'of', 'multiple', 'stationary', 'period', 'one', 'solutions', 'of', 'which', 'only', 'one', 'is', 'related', 'to', 'the', 'optimality', 'conditions', 'we', 'illustrate', 'the', 'results', 'through', 'an', 'example', 'in', 'which', 'the', 'conversion', 'in', 'a', 'chemical', 'reactor', 'is', 'optimized', 'using', 'esc', 'we', 'show', 'that', 'at', 'least', 'five', 'stationary', 'solutions', 'may', 'exist', 'simultaneously', 'for', 'realistic', 'control', 'parameters', 'and', 'that', 'several', 'of', 'these', 'solutions', 'are', 'stable', 'one', 'consequence', 'of', 'the', 'nonuniqueness', 'is', 'that', 'one', 'in', 'general', 'needs', 'to', 'start', 'close', 'to', 'the', 'optimum', 'to', 'ensure', 'convergence', 'to', 'the', 'nearoptimal', 'solution']] | [-0.15672562521183053, 0.04670637251676599, -0.10046884452417908, 0.06180191432930633, -0.0765229131976136, -0.169301209453727, 0.05329132801122989, 0.3193344885730006, -0.2865813813847246, -0.24816298349160143, 0.17857568820744577, -0.2336670754165859, -0.18751502232966807, 0.18672080966157234, -0.08168872169183262, 0.09033694500444321, 0.04772349956156589, 0.07085936689888896, -0.0507309427787063, -0.20763963452485173, 0.3314017131778603, 0.011290305732175033, 0.27620759804957007, 0.011351064654539311, 0.13713265284944573, -0.048743436940481645, 0.05205762115879494, 0.01913722993967039, -0.14899227798490794, 0.0608296615322273, 0.24346974624470136, 0.15517484239920754, 0.30071619860600773, -0.4195602546520661, -0.19163936401233855, 0.15694458203313982, 0.13046527065609287, 0.12409390328583415, -0.06328492832333799, -0.20622050669125383, 0.1335296068723453, -0.0810725084596836, -0.18112781196216102, -0.07394793885861416, -0.009859873604139749, 0.0514021505550202, -0.33219037837436494, 0.06465827416424162, 0.06945696842121707, 0.011919655233543717, -0.14489471319112082, -0.05005487209942049, -0.04626764911502756, 0.1409603783651701, 0.04209050691916968, -0.0071518511141452435, 0.10280443090423844, -0.11565322185645872, -0.08628753850476667, 0.3476242479731942, -0.03716731811662688, -0.2357439323326813, 0.20694317658211167, -0.11503546309125211, -0.12254033994760351, 0.1609167895749948, 0.13582863153578253, 0.1362367248826235, -0.18560482923352956, 0.060712648956397164, -0.04578973636848897, 0.15360891009873195, 0.0946483981482464, -0.007096132435121992, 0.18078618557581788, 0.13094309498296355, 0.20128223206604529, 0.15332500998479173, -0.02534429504581117, -0.15819854301604108, -0.33356046720808663, -0.09822568825189712, -0.1305364008476951, 0.0619740877689904, -0.09679175470053147, -0.18736399378049923, 0.3963691734348648, 0.12916054829078133, 0.15567813076740877, 0.045958637924725355, 0.27788072879481346, 0.1697892897891348, 0.0080291833572892, 0.09731794317587171, 0.2732071885879667, 0.10152440711544365, 0.08533815810463362, -0.25490659570040747, 0.07972984655536322, 0.0767678061122146] |
1,802.08521 | Topological and metric spaces are full subcategories of the category of
simplicial objects of the category of filters | We observe that the category of topological space, uniform spaces, and
simplicial sets are all, in a natural way, full subcategories of the same
larger category, namely the simplicial category of filters; this is, moreover,
implicit in the definitions of a topological and uniform space.
We use these embeddings to rewrite the notions of completeness,
precompactness, compactness, Cauchy sequence, and equicontinuity in the
language of category theory, which we hope might be of use in formalisation of
mathematics and tame topology. We formulate some arising open questions.
| math.CT | we observe that the category of topological space uniform spaces and simplicial sets are all in a natural way full subcategories of the same larger category namely the simplicial category of filters this is moreover implicit in the definitions of a topological and uniform space we use these embeddings to rewrite the notions of completeness precompactness compactness cauchy sequence and equicontinuity in the language of category theory which we hope might be of use in formalisation of mathematics and tame topology we formulate some arising open questions | [['we', 'observe', 'that', 'the', 'category', 'of', 'topological', 'space', 'uniform', 'spaces', 'and', 'simplicial', 'sets', 'are', 'all', 'in', 'a', 'natural', 'way', 'full', 'subcategories', 'of', 'the', 'same', 'larger', 'category', 'namely', 'the', 'simplicial', 'category', 'of', 'filters', 'this', 'is', 'moreover', 'implicit', 'in', 'the', 'definitions', 'of', 'a', 'topological', 'and', 'uniform', 'space', 'we', 'use', 'these', 'embeddings', 'to', 'rewrite', 'the', 'notions', 'of', 'completeness', 'precompactness', 'compactness', 'cauchy', 'sequence', 'and', 'equicontinuity', 'in', 'the', 'language', 'of', 'category', 'theory', 'which', 'we', 'hope', 'might', 'be', 'of', 'use', 'in', 'formalisation', 'of', 'mathematics', 'and', 'tame', 'topology', 'we', 'formulate', 'some', 'arising', 'open', 'questions']] | [-0.11420390767248711, 0.05534368225683769, -0.08920363677215987, 0.1745822625234723, -0.13424012659588594, -0.04816344922579739, 0.014312850597753436, 0.38179746726206665, -0.4001662604425145, -0.23173371736688175, 0.09477077134959828, -0.22687076040725598, -0.12657444213313618, 0.1412545484544217, -0.20561414433578992, -0.033215202930404794, 0.06860247854245077, 0.046953832184703184, -0.10127485603169036, -0.2771754350898595, 0.4665658066809263, -0.07968194585764544, 0.2662057425805378, 0.0430349579626887, 0.08508531923737676, -0.004182890384061925, -0.02774389254614368, 0.07069192756564174, -0.18441544354121514, 0.20539365298831944, 0.3179169724850605, 0.16054084459480283, 0.26657346263837306, -0.38272091926439483, -0.13674959983012971, 0.1250301753866604, 0.10568361306006367, 0.08229405614253048, -0.001339504281165956, -0.32572245917914583, 0.12906682825829277, -0.15778527407098733, -0.07207695295333048, -0.0977036314748827, 0.038622946440959455, 0.04098530839486369, -0.20053269439938895, -0.04141275547230723, 0.1449977670389431, 0.1130104507480202, -0.12120835682719774, -0.040071295799109445, -0.052328256595794154, 0.1311677596852954, -0.02815444994685722, 0.014338806624813327, 0.0806470360210829, -0.127801029371558, -0.14079239468047416, 0.3729160961363165, -0.04759972714872538, -0.23877650477934156, 0.2098688024856236, -0.1432258078143343, -0.18731083131084839, 0.07379585039673438, 0.08319938067218353, 0.12310034746368384, -0.07337420723326075, 0.18616542459636842, -0.12155997183644908, 0.10259641022769328, 0.12290143609667818, 0.1283577859238454, 0.1596703251888012, 0.17280600095253396, 0.08441751440665846, 0.17445179782192297, -0.009605570728408879, -0.08105638849846056, -0.3583360319614582, -0.21374634087042904, -0.08217182895837716, 0.07837152968417725, -0.10770322498530899, -0.22303891916299004, 0.3695986433511322, 0.1908314790919252, 0.14866741091794408, 0.13293608769522872, 0.2235945960233823, 0.025164559108858137, 0.030956070120821053, 0.03255636260534326, 0.12378708846584743, 0.19397162887984995, 0.04504713239067973, -0.05272874090520815, -0.004978138586805983, 0.19345417187345781] |
1,802.08522 | SimCommSys: Taking the errors out of error-correcting code simulations | In this paper we present SimCommSys, a Simulator of Communication Systems
that we are releasing under an open source license. The core of the project is
a set of C++ libraries defining communication system components and a
distributed Monte Carlo simulator. Of principal interest is the error-control
coding component, where various kinds of binary and non-binary codes are
implemented, including turbo, LDPC, repeat-accumulate, and Reed-Solomon. The
project also contains a number of ready-to-build binaries implementing various
stages of the communication system (such as the encoder and decoder), a
complete simulator, and a system benchmark. Finally, SimCommSys also provides a
number of shell and python scripts to encapsulate routine use cases. As long as
the required components are already available in SimCommSys, the user may
simulate complete communication systems of their own design without any
additional programming. The strict separation of development (needed only to
implement new components) and use (to simulate specific constructions)
encourages reproducibility of experimental work and reduces the likelihood of
error. Following an overview of the framework, we provide some examples of how
to use the framework, including the implementation of a simple codec, the
specification of communication systems and their simulation.
| cs.IT math.IT | in this paper we present simcommsys a simulator of communication systems that we are releasing under an open source license the core of the project is a set of c libraries defining communication system components and a distributed monte carlo simulator of principal interest is the errorcontrol coding component where various kinds of binary and nonbinary codes are implemented including turbo ldpc repeataccumulate and reedsolomon the project also contains a number of readytobuild binaries implementing various stages of the communication system such as the encoder and decoder a complete simulator and a system benchmark finally simcommsys also provides a number of shell and python scripts to encapsulate routine use cases as long as the required components are already available in simcommsys the user may simulate complete communication systems of their own design without any additional programming the strict separation of development needed only to implement new components and use to simulate specific constructions encourages reproducibility of experimental work and reduces the likelihood of error following an overview of the framework we provide some examples of how to use the framework including the implementation of a simple codec the specification of communication systems and their simulation | [['in', 'this', 'paper', 'we', 'present', 'simcommsys', 'a', 'simulator', 'of', 'communication', 'systems', 'that', 'we', 'are', 'releasing', 'under', 'an', 'open', 'source', 'license', 'the', 'core', 'of', 'the', 'project', 'is', 'a', 'set', 'of', 'c', 'libraries', 'defining', 'communication', 'system', 'components', 'and', 'a', 'distributed', 'monte', 'carlo', 'simulator', 'of', 'principal', 'interest', 'is', 'the', 'errorcontrol', 'coding', 'component', 'where', 'various', 'kinds', 'of', 'binary', 'and', 'nonbinary', 'codes', 'are', 'implemented', 'including', 'turbo', 'ldpc', 'repeataccumulate', 'and', 'reedsolomon', 'the', 'project', 'also', 'contains', 'a', 'number', 'of', 'readytobuild', 'binaries', 'implementing', 'various', 'stages', 'of', 'the', 'communication', 'system', 'such', 'as', 'the', 'encoder', 'and', 'decoder', 'a', 'complete', 'simulator', 'and', 'a', 'system', 'benchmark', 'finally', 'simcommsys', 'also', 'provides', 'a', 'number', 'of', 'shell', 'and', 'python', 'scripts', 'to', 'encapsulate', 'routine', 'use', 'cases', 'as', 'long', 'as', 'the', 'required', 'components', 'are', 'already', 'available', 'in', 'simcommsys', 'the', 'user', 'may', 'simulate', 'complete', 'communication', 'systems', 'of', 'their', 'own', 'design', 'without', 'any', 'additional', 'programming', 'the', 'strict', 'separation', 'of', 'development', 'needed', 'only', 'to', 'implement', 'new', 'components', 'and', 'use', 'to', 'simulate', 'specific', 'constructions', 'encourages', 'reproducibility', 'of', 'experimental', 'work', 'and', 'reduces', 'the', 'likelihood', 'of', 'error', 'following', 'an', 'overview', 'of', 'the', 'framework', 'we', 'provide', 'some', 'examples', 'of', 'how', 'to', 'use', 'the', 'framework', 'including', 'the', 'implementation', 'of', 'a', 'simple', 'codec', 'the', 'specification', 'of', 'communication', 'systems', 'and', 'their', 'simulation']] | [-0.17864622687200835, 0.009386861189022497, -0.06456541460722723, 0.0452261445929834, -0.062191895926947294, -0.200820311793539, 0.038450026491623296, 0.38832220644450066, -0.2563675811619872, -0.3217586576938629, 0.14744729199266715, -0.23473448873516747, -0.1373708482487271, 0.23380303952708534, -0.07797969650529978, 0.0865146608101492, 0.11083024377876427, 0.007440951972216915, -0.07577144737747263, -0.2668158642386, 0.28092437837880163, 0.11636150284363053, 0.2355933914911578, 0.015298447039724836, 0.08184381384047267, 0.014960324641355533, -0.03458088850626511, -0.05000373984010779, -0.09280283822932013, 0.13184635378972426, 0.2610498370132265, 0.2535310611432972, 0.2660263886617631, -0.4089188900171328, -0.1927480999279537, 0.049383896942185625, 0.141973754275859, 0.14025433208750196, -0.05594826558816064, -0.24031983912003121, 0.08079129020616259, -0.26038249727991436, -0.06526080187837373, -0.06034356412794633, -0.018718870495897287, 0.05958840685426114, -0.26615736311896865, -0.03989154617056087, 0.05972326981844669, 0.0921634141158927, -0.016985138871025332, -0.11047946629486498, 0.014341679123259083, 0.1726658076129508, -0.031017848734561468, 0.025103455995684778, 0.10807064227452598, -0.09193952900964224, -0.12987928608067564, 0.38400358053346734, 0.0016701162391289416, -0.16943828478340328, 0.21154695899782644, -0.015795237749584558, -0.14766276538007192, 0.0844623518474016, 0.2525126933535446, 0.09019394883809169, -0.18708236477176957, 0.07081858916661207, -0.004319066925876841, 0.20538957239327876, 0.01984287370068319, 0.07048196549114492, 0.18226348221081204, 0.19375566499711006, 0.007780187650046314, 0.2094650598214075, -0.0742986898967689, -0.09639137562786795, -0.32681063098410507, -0.17715232582767637, -0.16073714883892423, -0.02656374221725255, -0.05734309478782624, -0.18720744651041388, 0.3911403297955535, 0.18919253927007731, 0.10203870844105546, 0.08935295347215551, 0.34793832069070835, 0.0022851318774592447, 0.08507802791607845, 0.13898745083643757, 0.13540961190451478, 0.11689817451676306, 0.0749999529144429, -0.18136208200918452, 0.06072046741070322, 0.002140499665083834] |
1,802.08523 | Orienting lipid-coated graphitic micro-particles in solution using AC
electric fields: A new theoretical dual-ellipsoid Laplace model for
electro-orientation | Graphitic micro-particles coated with thin layers in solution are
technologically interesting as they can be manipulated with electric fields.
Modeling the electrical manipulation of submerged layered micro-particles
analytically or numerically is not straight forward. In particular, the
generation of reliable quantitative torque predictions for electro-orientation
experiments has been elusive. The traditional Laplace model approximates the
coated particle by an ellipsoid with a confocal ellipsoidal layer and solves
Laplace's equation to produce convenient analytical predictions. However, due
to the non-uniformity of the layer thickness around the ellipsoid, this method
can lead to incorrect torque predictions. Here we present a new theoretical
dual-ellipsoid Laplace model that corrects the effect of the non-uniform layer
thickness by calculating two layered ellipsoids, each accounting for the
correct layer thickness along each relevant direction for the torque. Our model
describes the electro-orientation of submerged lipid-coated graphitic
micro-particles in the presence of an alternating current (AC) electric field
and is valid for ellipsoids with moderate aspect ratios and coated with thin
shells. It is one of the first models to generate correct quantitative electric
torque predictions. We present model results for the torque versus frequency
and compare them to our measurements for lipid-coated highly ordered pyrolytic
graphite (HOPG) micro-flakes in aqueous NaCl solution at MHz frequencies. The
results show how the lipid shell changes the overall electrical properties of
the micro-flakes so that the torque is low at low frequencies and increases at
higher frequencies into the MHz regime. The torque depends critically on the
lipid-shell thickness, the solution conductivity and the shape of the particle,
all of which can be used as handles to control the response of the particles.
| cond-mat.soft | graphitic microparticles coated with thin layers in solution are technologically interesting as they can be manipulated with electric fields modeling the electrical manipulation of submerged layered microparticles analytically or numerically is not straight forward in particular the generation of reliable quantitative torque predictions for electroorientation experiments has been elusive the traditional laplace model approximates the coated particle by an ellipsoid with a confocal ellipsoidal layer and solves laplaces equation to produce convenient analytical predictions however due to the nonuniformity of the layer thickness around the ellipsoid this method can lead to incorrect torque predictions here we present a new theoretical dualellipsoid laplace model that corrects the effect of the nonuniform layer thickness by calculating two layered ellipsoids each accounting for the correct layer thickness along each relevant direction for the torque our model describes the electroorientation of submerged lipidcoated graphitic microparticles in the presence of an alternating current ac electric field and is valid for ellipsoids with moderate aspect ratios and coated with thin shells it is one of the first models to generate correct quantitative electric torque predictions we present model results for the torque versus frequency and compare them to our measurements for lipidcoated highly ordered pyrolytic graphite hopg microflakes in aqueous nacl solution at mhz frequencies the results show how the lipid shell changes the overall electrical properties of the microflakes so that the torque is low at low frequencies and increases at higher frequencies into the mhz regime the torque depends critically on the lipidshell thickness the solution conductivity and the shape of the particle all of which can be used as handles to control the response of the particles | [['graphitic', 'microparticles', 'coated', 'with', 'thin', 'layers', 'in', 'solution', 'are', 'technologically', 'interesting', 'as', 'they', 'can', 'be', 'manipulated', 'with', 'electric', 'fields', 'modeling', 'the', 'electrical', 'manipulation', 'of', 'submerged', 'layered', 'microparticles', 'analytically', 'or', 'numerically', 'is', 'not', 'straight', 'forward', 'in', 'particular', 'the', 'generation', 'of', 'reliable', 'quantitative', 'torque', 'predictions', 'for', 'electroorientation', 'experiments', 'has', 'been', 'elusive', 'the', 'traditional', 'laplace', 'model', 'approximates', 'the', 'coated', 'particle', 'by', 'an', 'ellipsoid', 'with', 'a', 'confocal', 'ellipsoidal', 'layer', 'and', 'solves', 'laplaces', 'equation', 'to', 'produce', 'convenient', 'analytical', 'predictions', 'however', 'due', 'to', 'the', 'nonuniformity', 'of', 'the', 'layer', 'thickness', 'around', 'the', 'ellipsoid', 'this', 'method', 'can', 'lead', 'to', 'incorrect', 'torque', 'predictions', 'here', 'we', 'present', 'a', 'new', 'theoretical', 'dualellipsoid', 'laplace', 'model', 'that', 'corrects', 'the', 'effect', 'of', 'the', 'nonuniform', 'layer', 'thickness', 'by', 'calculating', 'two', 'layered', 'ellipsoids', 'each', 'accounting', 'for', 'the', 'correct', 'layer', 'thickness', 'along', 'each', 'relevant', 'direction', 'for', 'the', 'torque', 'our', 'model', 'describes', 'the', 'electroorientation', 'of', 'submerged', 'lipidcoated', 'graphitic', 'microparticles', 'in', 'the', 'presence', 'of', 'an', 'alternating', 'current', 'ac', 'electric', 'field', 'and', 'is', 'valid', 'for', 'ellipsoids', 'with', 'moderate', 'aspect', 'ratios', 'and', 'coated', 'with', 'thin', 'shells', 'it', 'is', 'one', 'of', 'the', 'first', 'models', 'to', 'generate', 'correct', 'quantitative', 'electric', 'torque', 'predictions', 'we', 'present', 'model', 'results', 'for', 'the', 'torque', 'versus', 'frequency', 'and', 'compare', 'them', 'to', 'our', 'measurements', 'for', 'lipidcoated', 'highly', 'ordered', 'pyrolytic', 'graphite', 'hopg', 'microflakes', 'in', 'aqueous', 'nacl', 'solution', 'at', 'mhz', 'frequencies', 'the', 'results', 'show', 'how', 'the', 'lipid', 'shell', 'changes', 'the', 'overall', 'electrical', 'properties', 'of', 'the', 'microflakes', 'so', 'that', 'the', 'torque', 'is', 'low', 'at', 'low', 'frequencies', 'and', 'increases', 'at', 'higher', 'frequencies', 'into', 'the', 'mhz', 'regime', 'the', 'torque', 'depends', 'critically', 'on', 'the', 'lipidshell', 'thickness', 'the', 'solution', 'conductivity', 'and', 'the', 'shape', 'of', 'the', 'particle', 'all', 'of', 'which', 'can', 'be', 'used', 'as', 'handles', 'to', 'control', 'the', 'response', 'of', 'the', 'particles']] | [-0.10840189492122995, 0.13557535275155075, -0.03438700410640902, -0.028467669895487942, -0.07572596426794512, -0.13994436158315726, 0.016570914997201827, 0.42201925391952194, -0.25198599870696115, -0.31635800721123813, 0.048789297459060674, -0.2877348401613913, -0.11386518532634471, 0.21907252352857204, -0.03298772415318699, 0.050642232163981706, 0.022177701869427607, -0.05141356232860643, -0.0362009698822577, -0.15943992846921362, 0.23461782206496637, 0.06502670491010779, 0.31546520213596524, 0.07945904531861069, 0.08915887566076384, -0.015040372891558542, 0.06874031984523214, 0.042818037875824506, -0.15179559886051316, 0.0874798939408383, 0.22172878425924325, -0.05637348824939518, 0.19517353314354463, -0.5134194725296564, -0.19692510651722034, -0.0038432957294086616, 0.1246220600019485, 0.13929279106970946, -0.07196600635199704, -0.23241434051068843, 0.07688244916584895, -0.13234034100012784, -0.1642361175113668, -0.08330694988231968, 0.029469294759393153, 0.037805562073373475, -0.2620697260157343, 0.09494888903185104, 0.07598568584394848, 0.03958220746695857, -0.13076201117752742, -0.13303002834458041, -0.04109090227909662, 0.11258024266938231, 0.06412651760516315, 0.024938581687294775, 0.21669326438374506, -0.1389631132299891, -0.054677303125047025, 0.3560362542013603, -0.0663732189836015, -0.22153415978989668, 0.15640081629174313, -0.16137064484258493, -0.02797570298479749, 0.15728336384140507, 0.15447761266992463, 0.13411895175360972, -0.13567929183444466, 0.02484507394363862, -0.036414230473477534, 0.20749104482087272, 0.09929927908384276, -0.04282292463057847, 0.2571789278217626, 0.19613635116170539, 0.005996378224894956, 0.17038245684105074, -0.13551372500250755, -0.04530085030063573, -0.22447088773629661, -0.1562806746767213, -0.16698499642769565, 0.007338501938189707, -0.1153578713274328, -0.1946175553801435, 0.37481948692627526, 0.15428137650618468, 0.1662245817969691, 0.013082291245788198, 0.3381046408106125, 0.11146414460122792, 0.06731492152922093, 0.036810224570540916, 0.2968382081810247, 0.15513610713511566, 0.11281417988044537, -0.23549832980993582, 0.11737618894592204, 0.001244864284267856] |
1,802.08524 | The Cram\'er conjecture holds with a positive probability | We prove that a positive proportion of the intervals of any fixed scalar
multiple of $\log(X)$ in the dyadic interval $[X,2X]$ contain a prime number.
We also show that a positive proportion of the congruence classes modulo $q$
contain a prime number smaller than any fixed scalar multiple of
$\varphi(q)\log(q).$
| math.NT | we prove that a positive proportion of the intervals of any fixed scalar multiple of logx in the dyadic interval x2x contain a prime number we also show that a positive proportion of the congruence classes modulo q contain a prime number smaller than any fixed scalar multiple of varphiqlogq | [['we', 'prove', 'that', 'a', 'positive', 'proportion', 'of', 'the', 'intervals', 'of', 'any', 'fixed', 'scalar', 'multiple', 'of', 'logx', 'in', 'the', 'dyadic', 'interval', 'x2x', 'contain', 'a', 'prime', 'number', 'we', 'also', 'show', 'that', 'a', 'positive', 'proportion', 'of', 'the', 'congruence', 'classes', 'modulo', 'q', 'contain', 'a', 'prime', 'number', 'smaller', 'than', 'any', 'fixed', 'scalar', 'multiple', 'of', 'varphiqlogq']] | [-0.27639834921122813, 0.17100503915749796, -0.057657812182715505, 0.08246834317640382, -0.0702958138450524, -0.16087464213713396, 0.03107349386400714, 0.27472400832541133, -0.2213865352832541, -0.27295850274362127, 0.013075495906155176, -0.3063062023447484, -0.09607900100836188, 0.21578115574559387, -0.019789045391490265, 0.0004312000807602795, 0.044705887762259464, 0.18339376242793337, -0.002875168076051133, -0.3234955081526114, 0.37323178624620246, -0.11973932495682824, 0.1243407490226079, 0.008565041027507004, 0.08943248768717203, 0.05079525415500512, -0.011506246592925519, 0.070789688209794, -0.09886781522696506, 0.09192105473912492, 0.22378696850976165, 0.12812099120655687, 0.3863486705005777, -0.3281045343194689, -0.1560395695815547, 0.31176959077010347, 0.1404199780402135, -0.0004260265553484158, -0.03605494840659809, -0.14659028736000157, 0.2388436296308527, -0.16285000859322596, -0.10656784820769515, -0.019394109272683153, 0.06511547583706524, 0.05094234655820289, -0.3359100759333494, 0.01572130346250226, 0.11228921891627264, 0.13517114622708487, -0.04901565332440849, -0.2059687503366446, 0.0036098630148537307, 0.10561789587444188, 0.06536963080265085, 0.0025692104542513893, 0.03747569072079294, -0.08057968976090149, -0.08316619622483089, 0.3140925985513901, -0.06295004194009603, -0.2626873319018252, 0.09250341878481666, -0.23138795336898493, -0.18037494716747682, 0.18267527638877534, 0.13205670776102235, 0.1591628722618429, 0.01926868656003962, 0.1197621799549278, -0.17811887323552247, 0.23148505058975852, 0.19152539654881978, 0.02253738391612257, 0.20216952880122224, 0.0036532077178054925, 0.09936633255636813, 0.1416354888327876, -0.027124726783712298, 0.037406982720962594, -0.4070007069516281, -0.19548916299732363, -0.1929213703248878, 0.13381817207044486, -0.19560056803177814, -0.2503002833917129, 0.35001891509306676, 0.09789149821925984, 0.21806101236796502, 0.18145978705463361, 0.19397666968158161, 0.07888293270097703, 0.09007267266207812, 0.0884369111106712, 0.06423233510280142, 0.06765686348318217, -0.0399811148491441, -0.14998772232888305, -0.001902714134098924, 0.08063282075395085] |
1,802.08525 | Wormhole Potentials and Throats from Quasi-Normal Modes | Exotic compact objects refer to a wide class of black hole alternatives or
effective models to describe phenomenologically quantum gravitational effects
on the horizon scale. In this work we show how the knowledge of the
quasi-normal mode spectrum of non-rotating wormhole models can be used to
reconstruct the effective potential that appears in the perturbation equations.
From this it is further possible to obtain the parameters that characterize the
specific wormhole model, which in this paper was chosen to be the one by Damour
and Solodukhin. We also address the question whether one can distinguish such
type of wormholes from ultra compact stars, if only the quasi-normal mode
spectrum is known. We have proven that this is not possible by using the
trapped modes only, but requires additional information.
The here presented inverse method is an extension of work that has previously
been developed and applied to the oscillation spectra of ultra compact stars
and gravastars. However, it is not limited to the study of exotic compact
objects, but applicable to symmetric double barrier potentials that appear in
one-dimensional wave equations. Therefore we think it can be of interest for
other fields too.
| gr-qc | exotic compact objects refer to a wide class of black hole alternatives or effective models to describe phenomenologically quantum gravitational effects on the horizon scale in this work we show how the knowledge of the quasinormal mode spectrum of nonrotating wormhole models can be used to reconstruct the effective potential that appears in the perturbation equations from this it is further possible to obtain the parameters that characterize the specific wormhole model which in this paper was chosen to be the one by damour and solodukhin we also address the question whether one can distinguish such type of wormholes from ultra compact stars if only the quasinormal mode spectrum is known we have proven that this is not possible by using the trapped modes only but requires additional information the here presented inverse method is an extension of work that has previously been developed and applied to the oscillation spectra of ultra compact stars and gravastars however it is not limited to the study of exotic compact objects but applicable to symmetric double barrier potentials that appear in onedimensional wave equations therefore we think it can be of interest for other fields too | [['exotic', 'compact', 'objects', 'refer', 'to', 'a', 'wide', 'class', 'of', 'black', 'hole', 'alternatives', 'or', 'effective', 'models', 'to', 'describe', 'phenomenologically', 'quantum', 'gravitational', 'effects', 'on', 'the', 'horizon', 'scale', 'in', 'this', 'work', 'we', 'show', 'how', 'the', 'knowledge', 'of', 'the', 'quasinormal', 'mode', 'spectrum', 'of', 'nonrotating', 'wormhole', 'models', 'can', 'be', 'used', 'to', 'reconstruct', 'the', 'effective', 'potential', 'that', 'appears', 'in', 'the', 'perturbation', 'equations', 'from', 'this', 'it', 'is', 'further', 'possible', 'to', 'obtain', 'the', 'parameters', 'that', 'characterize', 'the', 'specific', 'wormhole', 'model', 'which', 'in', 'this', 'paper', 'was', 'chosen', 'to', 'be', 'the', 'one', 'by', 'damour', 'and', 'solodukhin', 'we', 'also', 'address', 'the', 'question', 'whether', 'one', 'can', 'distinguish', 'such', 'type', 'of', 'wormholes', 'from', 'ultra', 'compact', 'stars', 'if', 'only', 'the', 'quasinormal', 'mode', 'spectrum', 'is', 'known', 'we', 'have', 'proven', 'that', 'this', 'is', 'not', 'possible', 'by', 'using', 'the', 'trapped', 'modes', 'only', 'but', 'requires', 'additional', 'information', 'the', 'here', 'presented', 'inverse', 'method', 'is', 'an', 'extension', 'of', 'work', 'that', 'has', 'previously', 'been', 'developed', 'and', 'applied', 'to', 'the', 'oscillation', 'spectra', 'of', 'ultra', 'compact', 'stars', 'and', 'gravastars', 'however', 'it', 'is', 'not', 'limited', 'to', 'the', 'study', 'of', 'exotic', 'compact', 'objects', 'but', 'applicable', 'to', 'symmetric', 'double', 'barrier', 'potentials', 'that', 'appear', 'in', 'onedimensional', 'wave', 'equations', 'therefore', 'we', 'think', 'it', 'can', 'be', 'of', 'interest', 'for', 'other', 'fields', 'too']] | [-0.0824148045114478, 0.12943623751624175, -0.11743534933486133, 0.1216602709869386, -0.14319503955407928, -0.15235225010272405, 0.01045598258768628, 0.3565380266177531, -0.22489014731652532, -0.2934609184553123, 0.11119343429789372, -0.24102154818069133, -0.14636404562012867, 0.20707705268670124, -0.07024523132984946, 0.023782330845033877, 0.028681992871657864, 0.059631355063401045, -0.024152574939484386, -0.23161262489971102, 0.3728505068958057, 0.04710105549811912, 0.22808304679739275, 0.024638937569073753, 0.059870862732569016, -0.06047283272003186, 0.00976535445561758, 0.04305149956456738, -0.13260504998809716, 0.06912588267201085, 0.26067890219651724, 0.12524458586595413, 0.2095432427610449, -0.401352016231132, -0.2591210976966845, 0.126582244334506, 0.18767516799705403, 0.1579618291643453, -0.0638130041668095, -0.26400152844355146, 0.11196523474847869, -0.19873868451101484, -0.17166748207419572, -0.10006078704445166, 0.05935235953783626, -0.018725598758747658, -0.23027658264678685, 0.045916654383842084, 0.07311774405633906, -0.05301963690899969, -0.07452406098829689, -0.04416749499728565, 0.004547887937759334, 0.09449726787463332, 0.07359434967351489, 0.01965426436958381, 0.11527227336622851, -0.10779604129161482, -0.09203000898699763, 0.39028335715899815, -0.0708804941323581, -0.22175380369223693, 0.20912786110888182, -0.1651902341457576, -0.11181211767843659, 0.10238646064677463, 0.15610108354431698, 0.19350833685011867, -0.17977578806271052, 0.1139084070192896, -0.01930163933892814, 0.17044514113204154, 0.07570084346907088, 0.04581603809583141, 0.26625330685131215, 0.12785176842936696, 0.02878351658799835, 0.12382688033219591, -0.0770446241994924, -0.04189521063980526, -0.288545855243782, -0.1309754852244119, -0.18830882773313604, 0.060210335936166294, -0.01599355376606935, -0.16960266565450424, 0.3842213523521093, 0.15518327738368615, 0.16385334794086265, -0.01793345724476183, 0.26211704482979487, 0.10599115412317969, 0.1084149811136985, 0.0779168676546355, 0.3130701208641569, 0.12551844457931663, 0.07530686854194232, -0.18536724491947248, 4.514489881453041e-05, 0.009492782354740898] |
1,802.08526 | The Weighted Kendall and High-order Kernels for Permutations | We propose new positive definite kernels for permutations. First we introduce
a weighted version of the Kendall kernel, which allows to weight unequally the
contributions of different item pairs in the permutations depending on their
ranks. Like the Kendall kernel, we show that the weighted version is invariant
to relabeling of items and can be computed efficiently in $O(n \ln(n))$
operations, where $n$ is the number of items in the permutation. Second, we
propose a supervised approach to learn the weights by jointly optimizing them
with the function estimated by a kernel machine. Third, while the Kendall
kernel considers pairwise comparison between items, we extend it by considering
higher-order comparisons among tuples of items and show that the supervised
approach of learning the weights can be systematically generalized to
higher-order permutation kernels.
| stat.ML cs.LG | we propose new positive definite kernels for permutations first we introduce a weighted version of the kendall kernel which allows to weight unequally the contributions of different item pairs in the permutations depending on their ranks like the kendall kernel we show that the weighted version is invariant to relabeling of items and can be computed efficiently in on lnn operations where n is the number of items in the permutation second we propose a supervised approach to learn the weights by jointly optimizing them with the function estimated by a kernel machine third while the kendall kernel considers pairwise comparison between items we extend it by considering higherorder comparisons among tuples of items and show that the supervised approach of learning the weights can be systematically generalized to higherorder permutation kernels | [['we', 'propose', 'new', 'positive', 'definite', 'kernels', 'for', 'permutations', 'first', 'we', 'introduce', 'a', 'weighted', 'version', 'of', 'the', 'kendall', 'kernel', 'which', 'allows', 'to', 'weight', 'unequally', 'the', 'contributions', 'of', 'different', 'item', 'pairs', 'in', 'the', 'permutations', 'depending', 'on', 'their', 'ranks', 'like', 'the', 'kendall', 'kernel', 'we', 'show', 'that', 'the', 'weighted', 'version', 'is', 'invariant', 'to', 'relabeling', 'of', 'items', 'and', 'can', 'be', 'computed', 'efficiently', 'in', 'on', 'lnn', 'operations', 'where', 'n', 'is', 'the', 'number', 'of', 'items', 'in', 'the', 'permutation', 'second', 'we', 'propose', 'a', 'supervised', 'approach', 'to', 'learn', 'the', 'weights', 'by', 'jointly', 'optimizing', 'them', 'with', 'the', 'function', 'estimated', 'by', 'a', 'kernel', 'machine', 'third', 'while', 'the', 'kendall', 'kernel', 'considers', 'pairwise', 'comparison', 'between', 'items', 'we', 'extend', 'it', 'by', 'considering', 'higherorder', 'comparisons', 'among', 'tuples', 'of', 'items', 'and', 'show', 'that', 'the', 'supervised', 'approach', 'of', 'learning', 'the', 'weights', 'can', 'be', 'systematically', 'generalized', 'to', 'higherorder', 'permutation', 'kernels']] | [-0.060342242027576445, 0.09905108541363117, -0.05610846249989911, 0.11021221876250241, -0.11622705568460691, -0.16828143547613625, 0.08922969151965597, 0.4228272129513436, -0.32891079588708555, -0.297156971455975, 0.017511855177789668, -0.300578138870509, -0.1566629971035361, 0.11866637055451672, -0.08970176434906368, 0.07007909786647581, 0.07795127395498143, 0.06924976095924097, -0.10959068291721809, -0.3308728454761546, 0.38540030660277064, 0.037090541522378444, 0.23927607378837737, 0.005080800182468286, 0.10479843265431665, 0.055282732849953005, -0.10751680813193547, 0.008442941520391314, -0.06872832357134251, 0.17304879242455531, 0.27710328694912745, 0.16908656136894767, 0.3251150624163336, -0.35342471380576945, -0.12413170068722332, 0.17751247673930431, 0.09623165940160328, 0.04279740528595126, 0.04859085826055062, -0.2829574894470473, 0.11523355486905061, -0.17973048975126762, 0.014406303940411432, -0.12774987009382158, -0.001107267472296812, 0.045812241492747104, -0.3381640128791332, 0.0334495276404072, 0.07283533058326805, -0.006661639781668782, -0.011294579483078312, -0.15163612584265965, 0.07019693386091878, 0.09325732335194269, 0.03272466301903919, -0.004010173821095095, 0.07818888299957369, -0.08743413998463163, -0.16008723991443263, 0.34811431327552506, -0.06681071116701898, -0.27646729396656156, 0.12471013299231841, -0.09498727117016008, -0.14546521710739893, 0.034353813198487675, 0.20074400024587344, 0.1343389851674808, -0.14301947779445487, 0.047297867176398126, -0.10429423720801645, 0.1433432744692475, 0.08726489185496714, -0.03126101766423689, 0.1170151755072628, 0.11299602376917998, 0.07578676109992419, 0.20001938224198634, -0.056030186847651334, -0.06413443022139484, -0.25360136905995506, -0.1580257514618676, -0.237917883011202, -0.012149252794739423, -0.15972956000085548, -0.15600551961302478, 0.42442670931588067, 0.14049270857393628, 0.26446021550377324, 0.15535044042255983, 0.26002346038479696, 0.11715086809161937, 0.11807932078690184, 0.12612652605766375, 0.0998225259933282, 0.08612205845896494, 0.03463954368789652, -0.17713426275969885, 0.1034586172452581, 0.16381510498467833] |
1,802.08527 | Reductions of points on algebraic groups, II | Let $A$ be the product of an abelian variety and a torus over a number field
$K$, and let $m$ be a positive integer. If $\alpha \in A(K)$ is a point of
infinite order, we consider the set of primes $\mathfrak p$ of $K$ such that
the reduction $(\alpha \bmod \mathfrak p)$ is well defined and has order
coprime to $m$. This set admits a natural density, which we are able to express
as a finite sum of products of $\ell$-adic integrals, where $\ell$ varies in
the set of prime divisors of $m$. We deduce that the density is a rational
number, whose denominator is bounded (up to powers of $m$) in a very strong
sense. This extends the results of the paper "Reductions of points on algebraic
groups" by Davide Lombardo and the second author, where the case $m$ prime is
established.
| math.NT | let a be the product of an abelian variety and a torus over a number field k and let m be a positive integer if alpha in ak is a point of infinite order we consider the set of primes mathfrak p of k such that the reduction alpha bmod mathfrak p is well defined and has order coprime to m this set admits a natural density which we are able to express as a finite sum of products of elladic integrals where ell varies in the set of prime divisors of m we deduce that the density is a rational number whose denominator is bounded up to powers of m in a very strong sense this extends the results of the paper reductions of points on algebraic groups by davide lombardo and the second author where the case m prime is established | [['let', 'a', 'be', 'the', 'product', 'of', 'an', 'abelian', 'variety', 'and', 'a', 'torus', 'over', 'a', 'number', 'field', 'k', 'and', 'let', 'm', 'be', 'a', 'positive', 'integer', 'if', 'alpha', 'in', 'ak', 'is', 'a', 'point', 'of', 'infinite', 'order', 'we', 'consider', 'the', 'set', 'of', 'primes', 'mathfrak', 'p', 'of', 'k', 'such', 'that', 'the', 'reduction', 'alpha', 'bmod', 'mathfrak', 'p', 'is', 'well', 'defined', 'and', 'has', 'order', 'coprime', 'to', 'm', 'this', 'set', 'admits', 'a', 'natural', 'density', 'which', 'we', 'are', 'able', 'to', 'express', 'as', 'a', 'finite', 'sum', 'of', 'products', 'of', 'elladic', 'integrals', 'where', 'ell', 'varies', 'in', 'the', 'set', 'of', 'prime', 'divisors', 'of', 'm', 'we', 'deduce', 'that', 'the', 'density', 'is', 'a', 'rational', 'number', 'whose', 'denominator', 'is', 'bounded', 'up', 'to', 'powers', 'of', 'm', 'in', 'a', 'very', 'strong', 'sense', 'this', 'extends', 'the', 'results', 'of', 'the', 'paper', 'reductions', 'of', 'points', 'on', 'algebraic', 'groups', 'by', 'davide', 'lombardo', 'and', 'the', 'second', 'author', 'where', 'the', 'case', 'm', 'prime', 'is', 'established']] | [-0.23774458455586142, 0.11690949028696933, -0.07661566374028896, -0.011299827000145781, -0.07482312282977197, -0.11802638425993231, 0.03281707050102939, 0.2749231733525029, -0.3009498960540428, -0.26609790039255277, 0.06530333662786605, -0.28264106686676405, -0.09503318639016235, 0.18577498420128613, -0.08289647928843685, -0.030149781780148096, -0.015396110470068048, 0.15119674413992495, -0.06161553944929965, -0.30555218170963594, 0.3600685089579099, -0.059431381295663076, 0.1443398164038162, 0.022013432958482446, 0.11425671687388754, -0.0058250635686506345, 0.006833796627116162, 0.028735238944759944, -0.14997520189379404, 0.10904134362545255, 0.3200135259022871, 0.07917485503688246, 0.2822809648810775, -0.3238546874738865, -0.1282090557139966, 0.2290710766597853, 0.14076978352142278, -0.055768682990203634, 0.02372165095900394, -0.19502839244009887, 0.18426934304204282, -0.17633107817777388, -0.1387277870973038, -0.0713734563531263, 0.1321381117726865, 0.040806532619273535, -0.3473731179402529, -0.0376739998476684, 0.09616521699109824, 0.11326044883214302, -0.010957987244742421, -0.16808382928342122, -0.01425059224719872, 0.07554035545880353, 0.015506622154376358, 0.09563125851498983, 0.04589048760024818, -0.07841596357407166, -0.0885959083509104, 0.39253585861826484, -0.08748328706519874, -0.19262830534025088, 0.11963110921865368, -0.20446787297829883, -0.11261236569941878, 0.14430428236410334, 0.10870512276627384, 0.1749990205964321, -0.00012723353228994184, 0.2171294252743124, -0.16715898175424265, 0.12289077085153838, 0.10445054998569242, -0.02040173151282841, 0.14378599407984974, 0.08746774596898081, 0.09197159204306407, 0.12082000093052646, -0.026466653599254004, 0.038344438386416727, -0.36341743582494923, -0.18705398804618867, -0.19625296757615113, 0.178153006667662, -0.0866247215857762, -0.1595638814444126, 0.35495149001309817, 0.05377963683535378, 0.21799211428416046, 0.10700064572775118, 0.213573032631897, 0.12549353010943926, 0.0358532873548932, 0.07381875058180178, 0.05788347507188735, 0.1929957086067334, -0.038964395900582566, -0.15325096605685085, -0.011528850168354445, 0.1368244246165944] |
1,802.08528 | Sinking during earthquakes: Critical acceleration criteria control
drained soil liquefaction | This article focuses on liquefaction of saturated granular soils, triggered
by earthquakes. Liquefaction is definedhere as the transition from a rigid
state, in which the granular soil layer supports structures placed on its
surface, toa fluidlike state, in which structures placed initially on the
surface sink to their isostatic depth within the granularlayer.We suggest a
simple theoretical model for soil liquefaction and show that buoyancy caused by
the presence ofwater inside a granular medium has a dramatic influence on the
stability of an intruder resting at the surface of themedium.We confirm this
hypothesis by comparison with laboratory experiments and discrete-element
numericalsimulations. The external excitation representing ground motion during
earthquakes is simulated via horizontalsinusoidal oscillations of controlled
frequency and amplitude. In the experiments, we use particles only
slightlydenser than water, which as predicted theoretically increases the
effect of liquefaction and allows clear depth-of-sinkingmeasurements. In the
simulations, a micromechanical model simulates grains using molecular
dynamicswith friction between neighbors. The effect of the fluid is captured by
taking into account buoyancy effects onthe grains when they are immersed. We
show that the motion of an intruder inside a granular medium is mainlydependent
on the peak acceleration of the ground motion and establish a phase diagram for
the conditions underwhich liquefaction happens, depending on the soil bulk
density, friction properties, presence of water, and peak acceleration of the
imposed large-scale soil vibrations.We establish that in liquefaction
conditions, most cases relaxtoward an equilibrium position following an
exponential in time.We also show that the equilibrium position itself,for most
liquefaction regimes, corresponds to the isostatic equilibrium of the intruder
inside a medium of effectivedensity. The characteristic time to relaxation is
shown to be essentially a function of the peak ground velocity.
| physics.geo-ph cond-mat.soft | this article focuses on liquefaction of saturated granular soils triggered by earthquakes liquefaction is definedhere as the transition from a rigid state in which the granular soil layer supports structures placed on its surface toa fluidlike state in which structures placed initially on the surface sink to their isostatic depth within the granularlayerwe suggest a simple theoretical model for soil liquefaction and show that buoyancy caused by the presence ofwater inside a granular medium has a dramatic influence on the stability of an intruder resting at the surface of themediumwe confirm this hypothesis by comparison with laboratory experiments and discreteelement numericalsimulations the external excitation representing ground motion during earthquakes is simulated via horizontalsinusoidal oscillations of controlled frequency and amplitude in the experiments we use particles only slightlydenser than water which as predicted theoretically increases the effect of liquefaction and allows clear depthofsinkingmeasurements in the simulations a micromechanical model simulates grains using molecular dynamicswith friction between neighbors the effect of the fluid is captured by taking into account buoyancy effects onthe grains when they are immersed we show that the motion of an intruder inside a granular medium is mainlydependent on the peak acceleration of the ground motion and establish a phase diagram for the conditions underwhich liquefaction happens depending on the soil bulk density friction properties presence of water and peak acceleration of the imposed largescale soil vibrationswe establish that in liquefaction conditions most cases relaxtoward an equilibrium position following an exponential in timewe also show that the equilibrium position itselffor most liquefaction regimes corresponds to the isostatic equilibrium of the intruder inside a medium of effectivedensity the characteristic time to relaxation is shown to be essentially a function of the peak ground velocity | [['this', 'article', 'focuses', 'on', 'liquefaction', 'of', 'saturated', 'granular', 'soils', 'triggered', 'by', 'earthquakes', 'liquefaction', 'is', 'definedhere', 'as', 'the', 'transition', 'from', 'a', 'rigid', 'state', 'in', 'which', 'the', 'granular', 'soil', 'layer', 'supports', 'structures', 'placed', 'on', 'its', 'surface', 'toa', 'fluidlike', 'state', 'in', 'which', 'structures', 'placed', 'initially', 'on', 'the', 'surface', 'sink', 'to', 'their', 'isostatic', 'depth', 'within', 'the', 'granularlayerwe', 'suggest', 'a', 'simple', 'theoretical', 'model', 'for', 'soil', 'liquefaction', 'and', 'show', 'that', 'buoyancy', 'caused', 'by', 'the', 'presence', 'ofwater', 'inside', 'a', 'granular', 'medium', 'has', 'a', 'dramatic', 'influence', 'on', 'the', 'stability', 'of', 'an', 'intruder', 'resting', 'at', 'the', 'surface', 'of', 'themediumwe', 'confirm', 'this', 'hypothesis', 'by', 'comparison', 'with', 'laboratory', 'experiments', 'and', 'discreteelement', 'numericalsimulations', 'the', 'external', 'excitation', 'representing', 'ground', 'motion', 'during', 'earthquakes', 'is', 'simulated', 'via', 'horizontalsinusoidal', 'oscillations', 'of', 'controlled', 'frequency', 'and', 'amplitude', 'in', 'the', 'experiments', 'we', 'use', 'particles', 'only', 'slightlydenser', 'than', 'water', 'which', 'as', 'predicted', 'theoretically', 'increases', 'the', 'effect', 'of', 'liquefaction', 'and', 'allows', 'clear', 'depthofsinkingmeasurements', 'in', 'the', 'simulations', 'a', 'micromechanical', 'model', 'simulates', 'grains', 'using', 'molecular', 'dynamicswith', 'friction', 'between', 'neighbors', 'the', 'effect', 'of', 'the', 'fluid', 'is', 'captured', 'by', 'taking', 'into', 'account', 'buoyancy', 'effects', 'onthe', 'grains', 'when', 'they', 'are', 'immersed', 'we', 'show', 'that', 'the', 'motion', 'of', 'an', 'intruder', 'inside', 'a', 'granular', 'medium', 'is', 'mainlydependent', 'on', 'the', 'peak', 'acceleration', 'of', 'the', 'ground', 'motion', 'and', 'establish', 'a', 'phase', 'diagram', 'for', 'the', 'conditions', 'underwhich', 'liquefaction', 'happens', 'depending', 'on', 'the', 'soil', 'bulk', 'density', 'friction', 'properties', 'presence', 'of', 'water', 'and', 'peak', 'acceleration', 'of', 'the', 'imposed', 'largescale', 'soil', 'vibrationswe', 'establish', 'that', 'in', 'liquefaction', 'conditions', 'most', 'cases', 'relaxtoward', 'an', 'equilibrium', 'position', 'following', 'an', 'exponential', 'in', 'timewe', 'also', 'show', 'that', 'the', 'equilibrium', 'position', 'itselffor', 'most', 'liquefaction', 'regimes', 'corresponds', 'to', 'the', 'isostatic', 'equilibrium', 'of', 'the', 'intruder', 'inside', 'a', 'medium', 'of', 'effectivedensity', 'the', 'characteristic', 'time', 'to', 'relaxation', 'is', 'shown', 'to', 'be', 'essentially', 'a', 'function', 'of', 'the', 'peak', 'ground', 'velocity']] | [-0.1354127008754407, 0.21171393005314135, -0.11258873826180166, 0.010196616716914877, -0.019972443593610563, -0.0732245924345955, 0.06122737600499258, 0.342834574198108, -0.25016587948048796, -0.28985852574701093, 0.08877954826877213, -0.25967661537677716, -0.12988968286230523, 0.15655517225849638, -0.021782696936937348, 0.022478861187898023, 0.038904285889298944, 0.03274566772286555, -0.0027432127783878196, -0.16942707768409448, 0.277571999774311, 0.07352767208051006, 0.30567384132211783, 0.07310183484585035, 0.10549461089773969, -0.02782749172302697, 0.047339163288702586, 0.06611278374618339, -0.14309054059010012, 0.020153651731504216, 0.16956063330980178, 0.011248426369934941, 0.23493037142247294, -0.5052090420640424, -0.2627229153271245, 0.07018137190812943, 0.09473895226937605, 0.09980176479969395, -0.034138806007601684, -0.2882720242188655, 0.025479895122683362, -0.1333833895710238, -0.14089322387375852, -0.005791919912665141, 0.05169196198971381, 0.03989292902450258, -0.24406152770103243, 0.11639174444223996, 0.07031295037063247, 0.08814080206756947, -0.13173404077676446, -0.06410828251807109, -0.06416130943923191, 0.09374837652829018, 0.048825235219761474, -0.01743260414606189, 0.24266236398774146, -0.16161226350675617, 0.013667083378244177, 0.4298648552382261, -0.07025966835910408, -0.1588411842616531, 0.22796742745491652, -0.14437943956032256, -0.045691003362655976, 0.1675653951156012, 0.185672049354381, 0.06560028438390575, -0.12063749509736538, -0.0009319041920548865, -0.05085007610884893, 0.1861070283129465, 0.09143699686299164, -0.06031433453668276, 0.2418538950380201, 0.23541741833682814, 0.05931558824693057, 0.17316888959612697, -0.1363920837235689, -0.09557865847760749, -0.27713107526281566, -0.14425310057148227, -0.17697747923359344, -0.00260627443891808, -0.07056113544015861, -0.17434319028954132, 0.3362307927647405, 0.12975998077416953, 0.18711341499458292, 0.006461643345124299, 0.29313354109687434, 0.07039143722313958, 0.02891883497181795, 0.08535380156300802, 0.2898100289519613, 0.12643253696488638, 0.09367641809631873, -0.261816538695928, 0.14074116208777523, 0.04712893503811556] |
1,802.08529 | A $q$-analogue for Euler's $\zeta(6)=\pi^6/945$ | We give a $q$-analogue of $\zeta(6)=\pi^6/945$. Our main results are stated
in Theorems 2.1 and 2.2 below.
| math.NT | we give a qanalogue of zeta6pi6945 our main results are stated in theorems 21 and 22 below | [['we', 'give', 'a', 'qanalogue', 'of', 'zeta6pi6945', 'our', 'main', 'results', 'are', 'stated', 'in', 'theorems', '21', 'and', '22', 'below']] | [-0.11308271565940231, 0.05174458012334071, -0.05886505881790072, 0.0902158203534782, 0.01716251706238836, -0.07199644294450991, 0.07272593141533434, 0.259656659909524, -0.12723453622311354, -0.35304684995207936, 0.1482612191393855, -0.28664338996168226, -0.17298643465619534, 0.2953508825157769, -0.18443460174603388, -0.025551366969011724, 0.0034315611119382083, 0.012012039835099131, -0.10837634565541521, -0.3241902261506766, 0.3120490914443508, -0.07514770282432437, 0.16798339481465518, 0.1954802150139585, 0.04320525369257666, -0.033135345904156566, -0.10598723031580448, -0.06847052345983684, -0.19596328772604465, 0.10050289263017476, 0.28775068698450923, 0.10903864845749922, 0.21772403409704566, -0.28643144865054637, -0.05526684594224207, 0.04811816752771847, 0.11704387492500246, 0.11101477779448032, -0.020245697582140565, -0.2636857444886118, 0.17834322876296937, -0.09944128402275965, -0.19881032319972292, -0.030130601255223155, -0.03191868856083602, 0.09884108451660722, -0.23172097117640078, 0.1600314254174009, 0.23875657925964333, 0.116689957852941, -0.12596954189939424, -0.28360554086975753, 0.07152188789041247, 0.07315301428025123, 0.016275529167614877, 0.04122949845623225, 0.04302054797881283, -0.031044215837027878, -0.21247655036859214, 0.37053249729797244, -0.09799950092565268, -0.11472561373375356, 0.16957928525516763, -0.1758894738741219, -0.2712209415331017, 0.1084495450486429, 0.10722365096444264, 0.09926401602569968, -0.08261237462284043, 0.019951487654907396, -0.13769440655596554, 0.1208638078533113, 0.1510065206384752, 0.0037946132651995867, 0.1320383477723226, 0.1065105899469927, -0.0019438856979832053, 0.19633788226929028, -0.017561188782565296, -0.043276676908135414, -0.4160935084801167, -0.1212177538254764, -0.1368420934304595, 0.1309706858592108, -0.11993118582086026, -0.07392402947880328, 0.35531053540762514, 0.17959431372582912, 0.2116330862045288, 0.1443508883821778, 0.1747088037081994, 0.13592031089501688, -0.011810925148893148, 0.051695487229153514, 0.2417263271054253, 0.2998610391514376, 0.13336457672994584, -0.002553547907155007, -0.13162210982409306, 0.16875407501356676] |
1,802.0853 | Training wide residual networks for deployment using a single bit for
each weight | For fast and energy-efficient deployment of trained deep neural networks on
resource-constrained embedded hardware, each learned weight parameter should
ideally be represented and stored using a single bit. Error-rates usually
increase when this requirement is imposed. Here, we report large improvements
in error rates on multiple datasets, for deep convolutional neural networks
deployed with 1-bit-per-weight. Using wide residual networks as our main
baseline, our approach simplifies existing methods that binarize weights by
applying the sign function in training; we apply scaling factors for each layer
with constant unlearned values equal to the layer-specific standard deviations
used for initialization. For CIFAR-10, CIFAR-100 and ImageNet, and models with
1-bit-per-weight requiring less than 10 MB of parameter memory, we achieve
error rates of 3.9%, 18.5% and 26.0% / 8.5% (Top-1 / Top-5) respectively. We
also considered MNIST, SVHN and ImageNet32, achieving 1-bit-per-weight test
results of 0.27%, 1.9%, and 41.3% / 19.1% respectively. For CIFAR, our error
rates halve previously reported values, and are within about 1% of our
error-rates for the same network with full-precision weights. For networks that
overfit, we also show significant improvements in error rate by not learning
batch normalization scale and offset parameters. This applies to both full
precision and 1-bit-per-weight networks. Using a warm-restart learning-rate
schedule, we found that training for 1-bit-per-weight is just as fast as
full-precision networks, with better accuracy than standard schedules, and
achieved about 98%-99% of peak performance in just 62 training epochs for
CIFAR-10/100. For full training code and trained models in MATLAB, Keras and
PyTorch see https://github.com/McDonnell-Lab/1-bit-per-weight/ .
| cs.LG cs.CV cs.NE stat.ML | for fast and energyefficient deployment of trained deep neural networks on resourceconstrained embedded hardware each learned weight parameter should ideally be represented and stored using a single bit errorrates usually increase when this requirement is imposed here we report large improvements in error rates on multiple datasets for deep convolutional neural networks deployed with 1bitperweight using wide residual networks as our main baseline our approach simplifies existing methods that binarize weights by applying the sign function in training we apply scaling factors for each layer with constant unlearned values equal to the layerspecific standard deviations used for initialization for cifar10 cifar100 and imagenet and models with 1bitperweight requiring less than 10 mb of parameter memory we achieve error rates of 39 185 and 260 85 top1 top5 respectively we also considered mnist svhn and imagenet32 achieving 1bitperweight test results of 027 19 and 413 191 respectively for cifar our error rates halve previously reported values and are within about 1 of our errorrates for the same network with fullprecision weights for networks that overfit we also show significant improvements in error rate by not learning batch normalization scale and offset parameters this applies to both full precision and 1bitperweight networks using a warmrestart learningrate schedule we found that training for 1bitperweight is just as fast as fullprecision networks with better accuracy than standard schedules and achieved about 9899 of peak performance in just 62 training epochs for cifar10100 for full training code and trained models in matlab keras and pytorch see httpsgithubcommcdonnelllab1bitperweight | [['for', 'fast', 'and', 'energyefficient', 'deployment', 'of', 'trained', 'deep', 'neural', 'networks', 'on', 'resourceconstrained', 'embedded', 'hardware', 'each', 'learned', 'weight', 'parameter', 'should', 'ideally', 'be', 'represented', 'and', 'stored', 'using', 'a', 'single', 'bit', 'errorrates', 'usually', 'increase', 'when', 'this', 'requirement', 'is', 'imposed', 'here', 'we', 'report', 'large', 'improvements', 'in', 'error', 'rates', 'on', 'multiple', 'datasets', 'for', 'deep', 'convolutional', 'neural', 'networks', 'deployed', 'with', '1bitperweight', 'using', 'wide', 'residual', 'networks', 'as', 'our', 'main', 'baseline', 'our', 'approach', 'simplifies', 'existing', 'methods', 'that', 'binarize', 'weights', 'by', 'applying', 'the', 'sign', 'function', 'in', 'training', 'we', 'apply', 'scaling', 'factors', 'for', 'each', 'layer', 'with', 'constant', 'unlearned', 'values', 'equal', 'to', 'the', 'layerspecific', 'standard', 'deviations', 'used', 'for', 'initialization', 'for', 'cifar10', 'cifar100', 'and', 'imagenet', 'and', 'models', 'with', '1bitperweight', 'requiring', 'less', 'than', '10', 'mb', 'of', 'parameter', 'memory', 'we', 'achieve', 'error', 'rates', 'of', '39', '185', 'and', '260', '85', 'top1', 'top5', 'respectively', 'we', 'also', 'considered', 'mnist', 'svhn', 'and', 'imagenet32', 'achieving', '1bitperweight', 'test', 'results', 'of', '027', '19', 'and', '413', '191', 'respectively', 'for', 'cifar', 'our', 'error', 'rates', 'halve', 'previously', 'reported', 'values', 'and', 'are', 'within', 'about', '1', 'of', 'our', 'errorrates', 'for', 'the', 'same', 'network', 'with', 'fullprecision', 'weights', 'for', 'networks', 'that', 'overfit', 'we', 'also', 'show', 'significant', 'improvements', 'in', 'error', 'rate', 'by', 'not', 'learning', 'batch', 'normalization', 'scale', 'and', 'offset', 'parameters', 'this', 'applies', 'to', 'both', 'full', 'precision', 'and', '1bitperweight', 'networks', 'using', 'a', 'warmrestart', 'learningrate', 'schedule', 'we', 'found', 'that', 'training', 'for', '1bitperweight', 'is', 'just', 'as', 'fast', 'as', 'fullprecision', 'networks', 'with', 'better', 'accuracy', 'than', 'standard', 'schedules', 'and', 'achieved', 'about', '9899', 'of', 'peak', 'performance', 'in', 'just', '62', 'training', 'epochs', 'for', 'cifar10100', 'for', 'full', 'training', 'code', 'and', 'trained', 'models', 'in', 'matlab', 'keras', 'and', 'pytorch', 'see', 'httpsgithubcommcdonnelllab1bitperweight']] | [-0.04003104292245275, 0.020743863008417053, 0.026495889461333733, 0.05918127767417681, -0.04182389133420949, -0.2173671221788823, 0.09936040929092252, 0.45886262918024856, -0.2032661121413411, -0.38087483071516376, 0.10269499962436911, -0.23776357677993346, -0.12224382757916148, 0.2652579926115173, -0.12173507967496283, 0.11218283162276957, 0.1740668002346785, 0.02287059461129418, -0.11041284546005468, -0.3580047982542899, 0.22468702344038716, 0.09623238625146083, 0.3262700145020632, 0.008959224129686633, 0.12157839288103794, -0.0629266767844887, 0.02488684196008302, -0.04650851599470035, -0.06110078211469706, 0.10723206872703979, 0.2530718254911992, 0.13293128730504808, 0.28424122130608626, -0.3823322561837407, -0.18921710575190204, 0.09613324960798444, 0.13673132820425174, 0.07995816713333902, 0.005135690384305056, -0.29821803733420343, 0.16144605232758005, -0.19163146926871832, 0.02424690203299843, -0.1200641330376447, 0.002419912049330137, 0.02877706468063706, -0.32787177612374807, 0.10753989152130615, 0.04220457455839019, 0.09054420695052927, -0.050637358404980244, -0.22509662998395122, 0.014620905197842652, 0.14053101322731007, -0.012255548725809797, 0.09743355492730232, 0.14323151094561262, -0.16068531126606775, -0.13589263206392707, 0.3274106667096536, -0.10729951026485242, -0.18226052448153496, 0.14898141779110255, -0.027542563748590827, -0.12578622197515396, 0.0987855106111556, 0.22692556554137402, 0.07880362301099911, -0.11383422373179916, -0.02202078097440998, 0.025637941844536955, 0.24596841174765044, 0.08963693021544177, 0.011981444806421557, 0.08778625251126876, 0.2571758649052012, 0.008451841992277458, 0.10550677142083555, -0.18025481398871923, -0.06611302723532102, -0.22930634429797073, -0.07987932450732732, -0.18003391407815417, 0.030026054703436483, -0.15937468059234514, -0.08120688710204628, 0.3619041378950199, 0.20126282303485585, 0.22246079565022125, 0.20404355725774684, 0.2999768822293085, 0.014296270178978792, 0.1708049096782359, 0.1778904072755441, 0.2414528664470796, 0.021901040112629652, 0.11689807092453013, -0.12948838290646222, 0.05732867958916662, -0.01274971679894695] |
1,802.08531 | Soft gluon evolution and non-global logarithms | We consider soft-gluon evolution at the amplitude level. Our evolution
includes Coulomb exchanges and applies to generic hard-scattering processes
involving any number of coloured partons. We emphasise the special role played
by a Lorentz-invariant evolution variable, which coincides with the transverse
momentum of the latest emission in a suitably defined dipole zero-momentum
frame. We also relate the evolution algorithm, which was used originally in the
derivation of super-leading logarithms, to renormalization group evolution
equations that have been encountered recently. Handling large colour matrices
presents the most significant challenge to numerical implementations and we
present a means to expand systematically about the leading colour
approximation.
| hep-ph | we consider softgluon evolution at the amplitude level our evolution includes coulomb exchanges and applies to generic hardscattering processes involving any number of coloured partons we emphasise the special role played by a lorentzinvariant evolution variable which coincides with the transverse momentum of the latest emission in a suitably defined dipole zeromomentum frame we also relate the evolution algorithm which was used originally in the derivation of superleading logarithms to renormalization group evolution equations that have been encountered recently handling large colour matrices presents the most significant challenge to numerical implementations and we present a means to expand systematically about the leading colour approximation | [['we', 'consider', 'softgluon', 'evolution', 'at', 'the', 'amplitude', 'level', 'our', 'evolution', 'includes', 'coulomb', 'exchanges', 'and', 'applies', 'to', 'generic', 'hardscattering', 'processes', 'involving', 'any', 'number', 'of', 'coloured', 'partons', 'we', 'emphasise', 'the', 'special', 'role', 'played', 'by', 'a', 'lorentzinvariant', 'evolution', 'variable', 'which', 'coincides', 'with', 'the', 'transverse', 'momentum', 'of', 'the', 'latest', 'emission', 'in', 'a', 'suitably', 'defined', 'dipole', 'zeromomentum', 'frame', 'we', 'also', 'relate', 'the', 'evolution', 'algorithm', 'which', 'was', 'used', 'originally', 'in', 'the', 'derivation', 'of', 'superleading', 'logarithms', 'to', 'renormalization', 'group', 'evolution', 'equations', 'that', 'have', 'been', 'encountered', 'recently', 'handling', 'large', 'colour', 'matrices', 'presents', 'the', 'most', 'significant', 'challenge', 'to', 'numerical', 'implementations', 'and', 'we', 'present', 'a', 'means', 'to', 'expand', 'systematically', 'about', 'the', 'leading', 'colour', 'approximation']] | [-0.12700896693058894, 0.13338484577476406, -0.12482743486124001, 0.1137310430371704, -0.08194950039391048, -0.04771563459563857, -0.015453026112831699, 0.3686256441914548, -0.1994838955456194, -0.286430348673513, 0.022962788780345224, -0.2677505125197618, -0.11892888959174833, 0.11963239596941723, -0.01892043401144642, 0.06183744186217574, 0.053432063781656325, -0.025842858670959964, -0.07368605756738152, -0.23383575232135348, 0.36125520104542375, 0.0548223150589575, 0.22070378278238842, 0.07162285355242112, 0.10644300130661577, 0.07742735167714553, -0.11645417152724874, -0.0022580508196439883, -0.09568305702046367, 0.052921965172012836, 0.23400346980018255, 0.06254270897345403, 0.2423363276399099, -0.3950906607026879, -0.17808827676232725, 0.08678675086524051, 0.18099142684905717, 0.14330272354821388, -0.05606951685135405, -0.2188472834487374, 0.02354144186560566, -0.21879709841092476, -0.18353463811889434, -0.08486000264439589, 0.021061200550040945, -0.005058288583173775, -0.2685807564457019, 0.06571041341941544, 0.0186753522631569, 0.018028983767950334, -0.0047326278357874025, -0.13308755884645507, -0.012475530269931858, 0.1055075727456894, 0.046542629582780555, 0.04917692745136894, 0.11098195680041009, -0.13574339264932161, -0.13827515006190738, 0.3945945134529701, -0.06744176725624129, -0.1671812696899556, 0.13682977524317372, -0.17066469631390646, -0.1867760727987983, 0.14357260023266114, 0.17799188445608777, 0.11928792907397459, -0.1665667319970313, 0.10769497060391586, 0.018711512971024673, 0.12304936314019589, 0.0860758492938028, 0.04928745105280541, 0.17820797311231637, 0.14116876154170874, -0.03061303902695027, 0.13286997276680687, -0.05845962847188975, -0.1756818087037223, -0.361861876059825, -0.08823121589823411, -0.1161777849550932, 0.05445323386811651, -0.08340984353064694, -0.1571066825865553, 0.3773457348660696, 0.16682884629923278, 0.209388164810102, 0.02819626360388401, 0.26392727710593206, 0.16020912311796565, 0.1295217950593304, 0.1087042365263467, 0.2386159396219927, 0.17926684402762197, 0.10962048413393159, -0.2577055916369248, 0.036290413910487235, 0.12335613584862305] |
1,802.08532 | ZpL: a p-adic precision package | We present a new package ZpL for the mathematical software system SM. It
implements a sharp tracking of precision on p-adic numbers, following the
theory of ultrametric precision introduced in [4]. The underlying algorithms
are mostly based on automatic dierentiation techniques. We introduce them,
study their complexity and discuss our design choices. We illustrate the
bene-ts of our package (in comparison with previous implementations) with a
large sample of examples coming from linear algebra, com-mutative algebra and
dierential equations.
| math.NT cs.NA cs.SC | we present a new package zpl for the mathematical software system sm it implements a sharp tracking of precision on padic numbers following the theory of ultrametric precision introduced in 4 the underlying algorithms are mostly based on automatic dierentiation techniques we introduce them study their complexity and discuss our design choices we illustrate the benets of our package in comparison with previous implementations with a large sample of examples coming from linear algebra commutative algebra and dierential equations | [['we', 'present', 'a', 'new', 'package', 'zpl', 'for', 'the', 'mathematical', 'software', 'system', 'sm', 'it', 'implements', 'a', 'sharp', 'tracking', 'of', 'precision', 'on', 'padic', 'numbers', 'following', 'the', 'theory', 'of', 'ultrametric', 'precision', 'introduced', 'in', '4', 'the', 'underlying', 'algorithms', 'are', 'mostly', 'based', 'on', 'automatic', 'dierentiation', 'techniques', 'we', 'introduce', 'them', 'study', 'their', 'complexity', 'and', 'discuss', 'our', 'design', 'choices', 'we', 'illustrate', 'the', 'benets', 'of', 'our', 'package', 'in', 'comparison', 'with', 'previous', 'implementations', 'with', 'a', 'large', 'sample', 'of', 'examples', 'coming', 'from', 'linear', 'algebra', 'commutative', 'algebra', 'and', 'dierential', 'equations']] | [-0.09741512038624035, 0.013430573460464548, -0.07515959380581588, 0.045987157344624593, -0.08708401520240616, -0.15291197022858571, 0.011437072311286125, 0.37348804350748854, -0.27851458536098145, -0.30749483370258435, 0.11800902479860399, -0.24549624516156973, -0.1679111909024514, 0.2437470954232063, -0.10737714388516623, 0.06723528135229241, 0.08689501851966436, 0.0223561635984761, -0.09302219238688612, -0.2534029955473765, 0.3265109401311145, 0.051315570443675115, 0.23728395630635757, -0.010257085857840327, 0.10014912992860976, 0.030398025241674394, -0.11204707742874305, 0.0005934413026582885, -0.17748002520484196, 0.17009829781804378, 0.2681384883917771, 0.16957049687429296, 0.26550994702167324, -0.3778357556109224, -0.118289850730836, 0.05591243291394664, 0.10362419403194413, 0.11098243189709527, -0.08127121392988249, -0.2842914233250277, 0.06213605423101115, -0.19720553176163078, -0.10298424345054119, -0.1190487885146172, -0.03554164702919396, 0.02592467078515752, -0.23987300610532622, 0.005030711505761636, 0.023104150841532688, 0.15402333246689145, -0.02327832411793242, -0.1584259190599664, 0.030775781816125593, 0.06957971167980463, -0.01057231450731588, -0.0019658991670864936, 0.12410285040832959, -0.05863992958148191, -0.18573517940164386, 0.33767998530589916, -0.035836794749265176, -0.1874451848448484, 0.19693368162004302, -0.11817475643565321, -0.2120895951503643, 0.08649029916563591, 0.19988367113575048, 0.10883828467846692, -0.11150852034424806, 0.177006866376206, -0.030467608242065874, 0.16997603273817471, 0.005620564687876152, 0.018033406304122954, 0.1256743521163506, 0.1874472979311045, 0.002543015659532764, 0.13911458658804368, -0.009049919739670979, -0.08525169739959301, -0.33417160111493066, -0.1519830937545698, -0.10227503989182123, 0.026173146381103372, -0.10384856576255716, -0.17422005964757561, 0.4188294524157589, 0.20738456493195195, 0.143004573065207, 0.1098367664721105, 0.3123226325457021, 0.06314672761016174, 0.0756806796567829, 0.07427570563680552, 0.16753508954750398, 0.1540928961854283, 0.08922466513543546, -0.17713038189874888, -0.01721513116514528, 0.10943970317021012] |
1,802.08533 | On Emergent Gravity, Black Hole Entropy and Galactic Rotation Curves | In this work we derive a generalized Newtonian gravitational force and show
that it can account for the anomalous galactic rotation curves. We derive the
entropy-area relationship applying the Feynman-Hibbs procedure to the
supersymmetric Wheeler-DeWitt equation of the Schwarzschild black hole. We
obtain the modifications to the Newtonian gravitational force from the entropic
formulation of gravity.
| gr-qc hep-th | in this work we derive a generalized newtonian gravitational force and show that it can account for the anomalous galactic rotation curves we derive the entropyarea relationship applying the feynmanhibbs procedure to the supersymmetric wheelerdewitt equation of the schwarzschild black hole we obtain the modifications to the newtonian gravitational force from the entropic formulation of gravity | [['in', 'this', 'work', 'we', 'derive', 'a', 'generalized', 'newtonian', 'gravitational', 'force', 'and', 'show', 'that', 'it', 'can', 'account', 'for', 'the', 'anomalous', 'galactic', 'rotation', 'curves', 'we', 'derive', 'the', 'entropyarea', 'relationship', 'applying', 'the', 'feynmanhibbs', 'procedure', 'to', 'the', 'supersymmetric', 'wheelerdewitt', 'equation', 'of', 'the', 'schwarzschild', 'black', 'hole', 'we', 'obtain', 'the', 'modifications', 'to', 'the', 'newtonian', 'gravitational', 'force', 'from', 'the', 'entropic', 'formulation', 'of', 'gravity']] | [-0.11659884236619941, 0.04815906460446838, -0.19923450255633465, 0.17559730460093956, -0.1469685373428677, -0.13446994833481898, -0.003946147535836124, 0.23557517511237944, -0.23605486695721214, -0.3041285309009254, -0.019869328815340332, -0.25863994353650405, -0.19042114580848388, 0.18980381891430756, -0.0833845462350707, 0.04590107487248523, -0.02734630518326802, 0.007940034602402843, -0.12283997352850358, -0.21375473331344047, 0.33911899723378675, 0.05910324377431867, 0.18263975510905897, 0.020873769681202248, 0.14222396579238453, -0.008498479447942893, -0.002949947025626898, 0.059786683172985376, -0.2437695073776922, 0.07360375870484859, 0.13389267414043257, 0.09279476046296102, 0.17113660462200642, -0.42433736386841964, -0.2617886707552576, 0.09234480107469219, 0.11783086137646544, 0.2527129164497767, -0.05791937819282923, -0.3000970356390878, -0.0023684174817130304, -0.21968860468561097, -0.18813307728019676, -0.05799785033533616, 0.04339637796926711, -0.0359188533537755, -0.2060327366925776, 0.15608546225952782, 0.0642481553950347, -0.07539122147552137, -0.1605471945201446, -0.013733625657291018, 0.013871765495943171, 0.0579935812441233, 0.14405146779193143, 0.054817957134218886, 0.20622818733681925, -0.08282599316693709, -0.06540520119181435, 0.4299599972852905, -0.09902481437062047, -0.23280757223255932, 0.08373761627756592, -0.2106081740598061, -0.13042437595348538, 0.04888964684713366, 0.15124315096597588, 0.12469861250636834, -0.20773627996511226, 0.1405080251684662, 0.0194693431923432, 0.10133325387141667, 0.1356549867029701, -0.021685737576003054, 0.308433039546279, 0.050709481384339075, 0.013553877344488032, 0.1714178222152571, -0.11798710611349504, -0.09624397654884628, -0.3769967320258729, -0.15487564664051337, -0.1184164924280984, 0.11952253296372614, -0.20177447511455934, -0.14165658560315414, 0.28701641796422855, 0.1597662701720505, 0.0927422968171803, 0.11732455680612475, 0.2996420308149287, 0.15115617862985736, 0.028436021505123272, 0.08365173576333161, 0.42036193921895965, 0.16912795626558363, 0.1180913310340007, -0.32493652364688125, -0.09128828318456986, 0.18556434276979417] |
1,802.08534 | Weighted Double Deep Multiagent Reinforcement Learning in Stochastic
Cooperative Environments | Recently, multiagent deep reinforcement learning (DRL) has received
increasingly wide attention. Existing multiagent DRL algorithms are inefficient
when facing with the non-stationarity due to agents update their policies
simultaneously in stochastic cooperative environments. This paper extends the
recently proposed weighted double estimator to the multiagent domain and
propose a multiagent DRL framework, named weighted double deep Q-network
(WDDQN). By utilizing the weighted double estimator and the deep neural
network, WDDQN can not only reduce the bias effectively but also be extended to
scenarios with raw visual inputs. To achieve efficient cooperation in the
multiagent domain, we introduce the lenient reward network and the scheduled
replay strategy. Experiments show that the WDDQN outperforms the existing DRL
and multiaent DRL algorithms, i.e., double DQN and lenient Q-learning, in terms
of the average reward and the convergence rate in stochastic cooperative
environments.
| cs.MA cs.AI cs.LG | recently multiagent deep reinforcement learning drl has received increasingly wide attention existing multiagent drl algorithms are inefficient when facing with the nonstationarity due to agents update their policies simultaneously in stochastic cooperative environments this paper extends the recently proposed weighted double estimator to the multiagent domain and propose a multiagent drl framework named weighted double deep qnetwork wddqn by utilizing the weighted double estimator and the deep neural network wddqn can not only reduce the bias effectively but also be extended to scenarios with raw visual inputs to achieve efficient cooperation in the multiagent domain we introduce the lenient reward network and the scheduled replay strategy experiments show that the wddqn outperforms the existing drl and multiaent drl algorithms ie double dqn and lenient qlearning in terms of the average reward and the convergence rate in stochastic cooperative environments | [['recently', 'multiagent', 'deep', 'reinforcement', 'learning', 'drl', 'has', 'received', 'increasingly', 'wide', 'attention', 'existing', 'multiagent', 'drl', 'algorithms', 'are', 'inefficient', 'when', 'facing', 'with', 'the', 'nonstationarity', 'due', 'to', 'agents', 'update', 'their', 'policies', 'simultaneously', 'in', 'stochastic', 'cooperative', 'environments', 'this', 'paper', 'extends', 'the', 'recently', 'proposed', 'weighted', 'double', 'estimator', 'to', 'the', 'multiagent', 'domain', 'and', 'propose', 'a', 'multiagent', 'drl', 'framework', 'named', 'weighted', 'double', 'deep', 'qnetwork', 'wddqn', 'by', 'utilizing', 'the', 'weighted', 'double', 'estimator', 'and', 'the', 'deep', 'neural', 'network', 'wddqn', 'can', 'not', 'only', 'reduce', 'the', 'bias', 'effectively', 'but', 'also', 'be', 'extended', 'to', 'scenarios', 'with', 'raw', 'visual', 'inputs', 'to', 'achieve', 'efficient', 'cooperation', 'in', 'the', 'multiagent', 'domain', 'we', 'introduce', 'the', 'lenient', 'reward', 'network', 'and', 'the', 'scheduled', 'replay', 'strategy', 'experiments', 'show', 'that', 'the', 'wddqn', 'outperforms', 'the', 'existing', 'drl', 'and', 'multiaent', 'drl', 'algorithms', 'ie', 'double', 'dqn', 'and', 'lenient', 'qlearning', 'in', 'terms', 'of', 'the', 'average', 'reward', 'and', 'the', 'convergence', 'rate', 'in', 'stochastic', 'cooperative', 'environments']] | [-0.07611247828479964, -0.01039129674124221, -0.060233276364380035, 0.06901817472796698, -0.14252269007535517, -0.2197498206447378, 0.06994765374111012, 0.500535552430412, -0.32421065198824456, -0.3000890474928462, 0.05784129475553831, -0.19077152425450258, -0.24127868388145082, 0.11309051137093616, -0.19043638417412917, 0.09189713005637885, 0.09411379959150824, 0.02225342965549857, -0.009911522135961855, -0.3399090014239503, 0.28760354602169513, 0.05969064017741745, 0.33784669526642613, -0.0370334991480838, 0.1709030839898016, 0.026473154868944075, 0.014408936400972037, -0.00710965278794638, -0.044161022102818366, 0.13936488603012284, 0.3775765283127734, 0.20919407567049822, 0.4265708828722869, -0.4139992315052212, -0.23608737716289319, 0.17936561371375254, 0.1679982960496631, 0.06739034807896646, -0.023513483906002795, -0.36892082335670356, 0.08103739625801319, -0.24510319213099455, 0.029469119558664228, -0.11637781835937251, -0.08677529876349845, 0.07377935356150071, -0.33551100423168123, -0.028060888449966813, 0.08505504702865753, -0.012606784701347351, -0.04482840832518549, -0.11902085387492148, 0.0735764322647204, 0.1033704923223316, 0.013992272732455445, 0.06648694323223975, 0.1752337841215827, -0.17598093326871647, -0.2177746575595676, 0.2945376937884999, -0.04632347335944465, -0.16082366859621328, 0.1564201506772551, -0.016798001358477886, -0.15238749497381132, 0.10331456780946557, 0.28073524689787754, 0.15573295268257134, -0.18285502585722893, 0.06230818836669694, -0.025932065298969763, 0.13070101370576068, -0.01977153340914705, 0.018312849512701665, 0.10382639001413801, 0.2732974825868977, 0.139949414173843, 0.09913955584077326, -0.08237494451695702, -0.22075566709500508, -0.12675524736498145, -0.03608098914053804, -0.11686919097775135, -0.06602809284769413, -0.11480839261586906, -0.09353619689067853, 0.33026497457446397, 0.1836164585361932, 0.15771282284075153, 0.20107564614221884, 0.3868090087662626, 0.08015842683591368, 0.12018775914802446, 0.13664927311660047, 0.2438879587140906, 0.024004760328207867, 0.19460171446933047, -0.2334445524400613, 0.1528933085197502, 0.020583546555101657] |
1,802.08535 | Can Neural Networks Understand Logical Entailment? | We introduce a new dataset of logical entailments for the purpose of
measuring models' ability to capture and exploit the structure of logical
expressions against an entailment prediction task. We use this task to compare
a series of architectures which are ubiquitous in the sequence-processing
literature, in addition to a new model class---PossibleWorldNets---which
computes entailment as a "convolution over possible worlds". Results show that
convolutional networks present the wrong inductive bias for this class of
problems relative to LSTM RNNs, tree-structured neural networks outperform LSTM
RNNs due to their enhanced ability to exploit the syntax of logic, and
PossibleWorldNets outperform all benchmarks.
| cs.NE cs.AI | we introduce a new dataset of logical entailments for the purpose of measuring models ability to capture and exploit the structure of logical expressions against an entailment prediction task we use this task to compare a series of architectures which are ubiquitous in the sequenceprocessing literature in addition to a new model classpossibleworldnetswhich computes entailment as a convolution over possible worlds results show that convolutional networks present the wrong inductive bias for this class of problems relative to lstm rnns treestructured neural networks outperform lstm rnns due to their enhanced ability to exploit the syntax of logic and possibleworldnets outperform all benchmarks | [['we', 'introduce', 'a', 'new', 'dataset', 'of', 'logical', 'entailments', 'for', 'the', 'purpose', 'of', 'measuring', 'models', 'ability', 'to', 'capture', 'and', 'exploit', 'the', 'structure', 'of', 'logical', 'expressions', 'against', 'an', 'entailment', 'prediction', 'task', 'we', 'use', 'this', 'task', 'to', 'compare', 'a', 'series', 'of', 'architectures', 'which', 'are', 'ubiquitous', 'in', 'the', 'sequenceprocessing', 'literature', 'in', 'addition', 'to', 'a', 'new', 'model', 'classpossibleworldnetswhich', 'computes', 'entailment', 'as', 'a', 'convolution', 'over', 'possible', 'worlds', 'results', 'show', 'that', 'convolutional', 'networks', 'present', 'the', 'wrong', 'inductive', 'bias', 'for', 'this', 'class', 'of', 'problems', 'relative', 'to', 'lstm', 'rnns', 'treestructured', 'neural', 'networks', 'outperform', 'lstm', 'rnns', 'due', 'to', 'their', 'enhanced', 'ability', 'to', 'exploit', 'the', 'syntax', 'of', 'logic', 'and', 'possibleworldnets', 'outperform', 'all', 'benchmarks']] | [-0.04982600056312301, -0.041959821339314474, -0.02807635301488894, 0.14298676264547563, -0.15294443433539887, -0.1805370089344003, 0.06358788856493328, 0.45551197294785517, -0.31737008479169826, -0.3117353930655453, 0.020457916831917534, -0.23783800425478305, -0.21209879130162676, 0.21818627748459654, -0.1462709354330795, 0.08244190066864696, 0.12755021249706094, 0.04430249213203411, -0.08087855976161952, -0.26919169437064966, 0.29334708772637325, 0.03600353467268775, 0.31971724962608683, 0.012537597057720026, 0.13741062418792885, -0.06815103132447059, -0.021455316108209315, -0.016801670466483842, -0.04398681655459428, 0.22436790716495703, 0.31382957537532247, 0.18623163542978352, 0.3029836555119754, -0.44039918982771914, -0.19595926270039396, 0.10263150478148776, 0.10801413372826922, 0.13240188565881303, 0.06288205379751896, -0.31595458867348203, 0.12192350678672695, -0.24543240870527847, 0.040983824292197824, -0.20129317219717183, 0.02728204210900297, -0.009572706025357198, -0.26701761426397064, 0.018780262312955327, 0.15096737795094595, 0.029253292443099047, -0.03597452786911016, -0.09597359907183081, 0.04795739282454091, 0.16620118070318543, 0.0030099538441822685, 0.013116790405051275, 0.08249023097162747, -0.19013033818213665, -0.23568606913334342, 0.33234852654012764, -0.09516512293067544, -0.2214705315465578, 0.18858385571476186, -0.0025402940880281458, -0.17263481069375017, 0.03533474136275625, 0.24205654576383154, 0.11092490887720928, -0.15919437689408, 0.017972295288927853, -0.04015639989937872, 0.19319149816992007, 0.08400837030506345, 0.05095437067005821, 0.19294740018820522, 0.2837075923776461, -0.017008862524020552, 0.17081359715313849, -0.10060387409075794, -0.08799185221509143, -0.2181269811710926, -0.10965881148597809, -0.1324900280827694, -0.0342916472052986, -0.0717599748188719, -0.1976806151802943, 0.4237732736751287, 0.3108735623195617, 0.19087309621726023, 0.21676644247443877, 0.3168686452237042, 0.014325038970899626, 0.16822285362933245, 0.07253437634025973, 0.154838503573579, 0.11394640208795817, 0.13079790739375496, -0.16799221216051868, 0.12778700798787554, 0.058910979346061744] |
1,802.08536 | Continuous-time Markov games with asymmetric information | We study a two-player zero-sum stochastic differential game with asymmetric
information where the payoff depends on a controlled continuous-time Markov
chain X with finite state space which is only observed by player 1. This model
was already studied in Cardaliaguet et al. (2015) through an approximating
sequence of discrete-time games. Our first contribution is the proof of the
existence of the value in the continuous-time model based on duality
techniques. This value is shown to be the unique solution of the same
Hamilton-Jacobi equation with convexity constraints which characterized the
limit value obtained in Cardaliaguet et al. (2015). Our second main
contribution is to provide a simpler equivalent formulation for this
Hamilton-Jacobi equation using directional derivatives and exposed points,
which we think is interesting for its own sake as the associated comparison
principle has a very simple proof which avoids all the technical machinery of
viscosity solutions.
| math.OC | we study a twoplayer zerosum stochastic differential game with asymmetric information where the payoff depends on a controlled continuoustime markov chain x with finite state space which is only observed by player 1 this model was already studied in cardaliaguet et al 2015 through an approximating sequence of discretetime games our first contribution is the proof of the existence of the value in the continuoustime model based on duality techniques this value is shown to be the unique solution of the same hamiltonjacobi equation with convexity constraints which characterized the limit value obtained in cardaliaguet et al 2015 our second main contribution is to provide a simpler equivalent formulation for this hamiltonjacobi equation using directional derivatives and exposed points which we think is interesting for its own sake as the associated comparison principle has a very simple proof which avoids all the technical machinery of viscosity solutions | [['we', 'study', 'a', 'twoplayer', 'zerosum', 'stochastic', 'differential', 'game', 'with', 'asymmetric', 'information', 'where', 'the', 'payoff', 'depends', 'on', 'a', 'controlled', 'continuoustime', 'markov', 'chain', 'x', 'with', 'finite', 'state', 'space', 'which', 'is', 'only', 'observed', 'by', 'player', '1', 'this', 'model', 'was', 'already', 'studied', 'in', 'cardaliaguet', 'et', 'al', '2015', 'through', 'an', 'approximating', 'sequence', 'of', 'discretetime', 'games', 'our', 'first', 'contribution', 'is', 'the', 'proof', 'of', 'the', 'existence', 'of', 'the', 'value', 'in', 'the', 'continuoustime', 'model', 'based', 'on', 'duality', 'techniques', 'this', 'value', 'is', 'shown', 'to', 'be', 'the', 'unique', 'solution', 'of', 'the', 'same', 'hamiltonjacobi', 'equation', 'with', 'convexity', 'constraints', 'which', 'characterized', 'the', 'limit', 'value', 'obtained', 'in', 'cardaliaguet', 'et', 'al', '2015', 'our', 'second', 'main', 'contribution', 'is', 'to', 'provide', 'a', 'simpler', 'equivalent', 'formulation', 'for', 'this', 'hamiltonjacobi', 'equation', 'using', 'directional', 'derivatives', 'and', 'exposed', 'points', 'which', 'we', 'think', 'is', 'interesting', 'for', 'its', 'own', 'sake', 'as', 'the', 'associated', 'comparison', 'principle', 'has', 'a', 'very', 'simple', 'proof', 'which', 'avoids', 'all', 'the', 'technical', 'machinery', 'of', 'viscosity', 'solutions']] | [-0.0855674491680487, 0.028195440149204772, -0.1204739873278506, 0.04603102178722965, -0.10669740392877182, -0.15438508603810555, 0.053266623980432214, 0.31897564828522557, -0.28582040656383345, -0.2821001095101744, 0.12646168678385986, -0.25972790423729997, -0.16016693154134515, 0.1458899986385336, -0.12458132087493784, 0.03208602322495169, 0.05538371522423057, 0.020112816173287085, -0.014303357600152087, -0.2628010545705198, 0.30683388131778355, 0.03832178222028171, 0.22880584518045036, 0.023276156232673293, 0.16768960943952405, 0.028222734690247876, -0.008730760813519662, 0.036006353253642806, -0.17736459167699525, 0.07698428712557165, 0.23060183253354666, 0.09650029094000212, 0.3175588311519803, -0.3686845461476822, -0.17753026899121396, 0.12664838648736984, 0.07212235267194096, 0.1121359681868989, -0.04475355714236443, -0.31095574768085893, 0.06443506930115298, -0.14918069563707856, -0.1277795790276509, -0.023196015408782123, 0.03355855443736627, 0.026797112585900694, -0.29984106058191484, 0.04208542977271247, 0.08686088957684432, 0.02843040729030257, -0.05813815535543499, -0.12739508586371837, -0.024288931788661244, 0.05784012013286048, 0.03339570588717351, 0.03561387531424486, 0.07061833406792206, -0.0774254865079586, -0.15974495301758046, 0.33151165866704824, -0.08221247151880494, -0.20075194989996298, 0.15502566566570428, -0.08883447575439908, -0.1624633902620499, 0.12084745766347921, 0.11487310969897983, 0.19134598405284137, -0.18913667425386557, 0.13573851864301872, -0.096223336600122, 0.17506720095423056, 0.05247024207242897, 0.001457684305908323, 0.1263043874824027, 0.18571144566027017, 0.1135002878893699, 0.12916791888601686, 0.025510876043145322, -0.19388103710731402, -0.30876598857520593, -0.15061849515986483, -0.196115784110267, 0.07696608020480544, -0.06997820085576231, -0.14494874757983037, 0.3509870955156682, 0.14366208241843653, 0.16199550870489202, 0.0910420828913877, 0.26651866679542324, 0.2002583126518495, -0.03476810590269006, 0.07131743960187067, 0.23482241905310197, 0.16476216001220706, 0.13215773002098816, -0.19404522731340312, 0.10997423996553332, 0.14085236700017284] |
1,802.08537 | On the images of Galois representations attached to low weight Siegel
modular forms | Let $\pi$ be a cuspidal automorphic representation of
$\mathrm{GSp}_4(\mathbf{A_Q})$, whose archimedean component is a holomorphic
discrete series or limit of discrete series representation. If $\pi$ is not CAP
or endoscopic, then we show that its associated $\ell$-adic Galois
representations are irreducible and crystalline for $100\%$ of primes $\ell$.
If, moreover, $\pi$ is neither an automorphic induction nor a symmetric cube
lift, then we show that, for $100\%$ of primes $\ell$, the image of its mod
$\ell$ Galois representation contains $\mathrm{Sp}_4(\mathbf{F}_{\ell})$.
| math.NT | let pi be a cuspidal automorphic representation of mathrmgsp_4mathbfa_q whose archimedean component is a holomorphic discrete series or limit of discrete series representation if pi is not cap or endoscopic then we show that its associated elladic galois representations are irreducible and crystalline for 100 of primes ell if moreover pi is neither an automorphic induction nor a symmetric cube lift then we show that for 100 of primes ell the image of its mod ell galois representation contains mathrmsp_4mathbff_ell | [['let', 'pi', 'be', 'a', 'cuspidal', 'automorphic', 'representation', 'of', 'mathrmgsp_4mathbfa_q', 'whose', 'archimedean', 'component', 'is', 'a', 'holomorphic', 'discrete', 'series', 'or', 'limit', 'of', 'discrete', 'series', 'representation', 'if', 'pi', 'is', 'not', 'cap', 'or', 'endoscopic', 'then', 'we', 'show', 'that', 'its', 'associated', 'elladic', 'galois', 'representations', 'are', 'irreducible', 'and', 'crystalline', 'for', '100', 'of', 'primes', 'ell', 'if', 'moreover', 'pi', 'is', 'neither', 'an', 'automorphic', 'induction', 'nor', 'a', 'symmetric', 'cube', 'lift', 'then', 'we', 'show', 'that', 'for', '100', 'of', 'primes', 'ell', 'the', 'image', 'of', 'its', 'mod', 'ell', 'galois', 'representation', 'contains', 'mathrmsp_4mathbff_ell']] | [-0.2059461646952117, 0.13321365226893717, -0.2233843481502472, 0.03636488767239289, -0.1563886267443498, -0.12349612422836706, -0.04412427818766819, 0.32821937877899754, -0.4019063775164959, -0.14627974386064288, 0.0727599944250706, -0.2874065004408551, -0.13683346613572958, 0.1866568497662695, -0.0910264003651742, -0.02451973155481168, 0.06338131876113132, 0.2175680961077794, -0.053983196538562574, -0.25257954513654113, 0.32763542072513163, -0.120296559523409, 0.17352366344167444, 0.006102892868698408, 0.10960678409379071, 0.03196071558154355, 0.017693586546020247, -0.16637155552430508, -0.06760054017892496, 0.12006711789096396, 0.3736362707777283, 0.040972061114958845, 0.20192617109009567, -0.4047495097351762, -0.05389820792688391, 0.31651864394258994, 0.17557447112929553, -0.07754620398657444, 0.03924204752995418, -0.25620061575841063, 0.22961222151748073, -0.17028123371971723, -0.0905692295726532, -0.13325858099433857, 0.14337255645734379, -0.019119594174508866, -0.3273832453116297, 0.01999323213329682, 0.16409138132794163, 0.2364176907696021, -0.09092624523999313, -0.1592114759453883, -0.03484657575161411, 0.04354185960852565, 0.003844709186337124, 0.09596929168000291, 0.10415166045109239, -0.13105179584034396, -0.11054972421903259, 0.3643267307466326, -0.04360619157504959, -0.21960192050737065, 0.07364647673108639, -0.20316062084375283, -0.14985871482759905, 0.19623353341833139, 0.07027617178093164, 0.10933910713841517, 0.04868941822160895, 0.22053723435965367, -0.18400410812300366, 0.16193736318009308, 0.1329570434665164, -0.06648521015766817, 0.1659935545653869, 0.021093715322562136, 0.05635223100081277, 0.09491451735196349, -0.07585360892251349, 0.06961513506487393, -0.3845597634253164, -0.19209011720541197, -0.1653087210142985, 0.1467613576342746, -0.053059177556581114, -0.16291080847478065, 0.4006784606533937, 0.01635571353089733, 0.18920176695936766, 0.17575849843426392, 0.22104123526085645, 0.08569010451006201, 0.05229564692275838, 0.09623962536287041, 0.04195030680738199, 0.19652681001342642, -0.1413045306570637, -0.12384881929924282, -0.04815173488504325, 0.1577592644159897] |
1,802.08538 | Thermal algebraic-decay charge liquid driven by competing short-range
Coulomb repulsion | We explore the possibility of a Berezinskii-Kosterlitz-Thouless-like critical
phase for the charge degrees of freedom in the intermediate-temperature regime
between the charge-ordered and disordered phases in two-dimensional systems
with competing short-range Coulomb repulsion. As the simplest example, we
investigate the extended Hubbard model with on-site and nearest-neighbor
Coulomb interactions on a triangular lattice at half filling in the atomic
limit by using a classical Monte Carlo method, and find a critical phase,
characterized by algebraic decay of the charge correlation function, belonging
to the universality class of the two-dimensional XY model with a $\mathbb{Z}_6$
anisotropy. Based on the results, we discuss possible conditions for the
critical phase in materials.
| cond-mat.str-el cond-mat.mtrl-sci cond-mat.stat-mech | we explore the possibility of a berezinskiikosterlitzthoulesslike critical phase for the charge degrees of freedom in the intermediatetemperature regime between the chargeordered and disordered phases in twodimensional systems with competing shortrange coulomb repulsion as the simplest example we investigate the extended hubbard model with onsite and nearestneighbor coulomb interactions on a triangular lattice at half filling in the atomic limit by using a classical monte carlo method and find a critical phase characterized by algebraic decay of the charge correlation function belonging to the universality class of the twodimensional xy model with a mathbbz_6 anisotropy based on the results we discuss possible conditions for the critical phase in materials | [['we', 'explore', 'the', 'possibility', 'of', 'a', 'berezinskiikosterlitzthoulesslike', 'critical', 'phase', 'for', 'the', 'charge', 'degrees', 'of', 'freedom', 'in', 'the', 'intermediatetemperature', 'regime', 'between', 'the', 'chargeordered', 'and', 'disordered', 'phases', 'in', 'twodimensional', 'systems', 'with', 'competing', 'shortrange', 'coulomb', 'repulsion', 'as', 'the', 'simplest', 'example', 'we', 'investigate', 'the', 'extended', 'hubbard', 'model', 'with', 'onsite', 'and', 'nearestneighbor', 'coulomb', 'interactions', 'on', 'a', 'triangular', 'lattice', 'at', 'half', 'filling', 'in', 'the', 'atomic', 'limit', 'by', 'using', 'a', 'classical', 'monte', 'carlo', 'method', 'and', 'find', 'a', 'critical', 'phase', 'characterized', 'by', 'algebraic', 'decay', 'of', 'the', 'charge', 'correlation', 'function', 'belonging', 'to', 'the', 'universality', 'class', 'of', 'the', 'twodimensional', 'xy', 'model', 'with', 'a', 'mathbbz_6', 'anisotropy', 'based', 'on', 'the', 'results', 'we', 'discuss', 'possible', 'conditions', 'for', 'the', 'critical', 'phase', 'in', 'materials']] | [-0.1637082965190121, 0.20843834728600646, -0.02203147528092847, 0.07579816238305301, 0.04521756325506631, -0.15385168598144564, 0.0979413854656741, 0.34035048900394266, -0.24611143552091555, -0.2515115500726831, 0.033174523285914796, -0.3141432718348202, -0.14733234427254135, 0.1223280783101848, 0.11721297055285279, 0.01989739768446312, -0.04021569204713227, -0.02274727168569871, -0.15845459166096112, -0.20112302026993364, 0.33334537740762626, -0.013266030536674031, 0.2663006520565223, 0.0827265715892982, 0.05638546785425155, 0.06864682613624208, 0.10360223023272162, 0.026743609445391718, -0.19063166108990617, 0.037908899315863574, 0.1763376883816384, -0.10645441005621618, 0.19728038628337854, -0.4130062952620584, -0.21956351143948802, 0.09829521963133588, 0.13650426342058072, 0.13900877203826512, -0.05354826539058512, -0.3065367796706087, -0.0152035867806696, -0.19452565921889192, -0.17601325721779001, -0.07155485492233836, -0.01369197778574644, 0.057629554182154326, -0.2770713349342893, 0.12063073444633035, 0.04340795380567465, 0.09422024197816643, -0.05225850800650382, -0.10436514002770834, -0.03327728328166889, 0.0665318986546214, 0.01278338023064094, 0.044797272970387284, 0.07460122546522853, -0.16896775367439065, -0.12386523985246264, 0.3991155025950812, -0.03914192164265508, -0.16365605214858478, 0.21324716631639237, -0.16701138672996163, -0.11292300710386229, 0.14216288358881993, 0.12616488424454467, 0.055650103196433376, -0.11821028315932106, 0.12941651347407285, -0.005158117177699684, 0.1644638526518274, -0.05290202605922561, 0.04295562082205241, 0.24345508651004746, 0.20964197227047807, 0.05520703116380567, 0.21939611859799046, -0.11698350974213366, -0.17929192145468256, -0.2638159898032836, -0.13863979929677903, -0.2313008771337774, 0.0245143879854351, -0.12126030719482848, -0.18518224913934503, 0.4160896438508243, 0.1713919027472436, 0.18074624279701929, -0.02325136000675004, 0.19457047877388947, 0.08571338491971442, 0.040660731690944335, 0.021513460678210774, 0.24090920083669073, 0.13103706104928678, 0.07276881159787331, -0.26406615121939453, 0.01090536066630018, 0.13439451234517705] |
1,802.08539 | Computation of optimal transport and related hedging problems via
penalization and neural networks | This paper presents a widely applicable approach to solving (multi-marginal,
martingale) optimal transport and related problems via neural networks. The
core idea is to penalize the optimization problem in its dual formulation and
reduce it to a finite dimensional one which corresponds to optimizing a neural
network with smooth objective function. We present numerical examples from
optimal transport, martingale optimal transport, portfolio optimization under
uncertainty and generative adversarial networks that showcase the generality
and effectiveness of the approach.
| math.OC q-fin.MF stat.ML | this paper presents a widely applicable approach to solving multimarginal martingale optimal transport and related problems via neural networks the core idea is to penalize the optimization problem in its dual formulation and reduce it to a finite dimensional one which corresponds to optimizing a neural network with smooth objective function we present numerical examples from optimal transport martingale optimal transport portfolio optimization under uncertainty and generative adversarial networks that showcase the generality and effectiveness of the approach | [['this', 'paper', 'presents', 'a', 'widely', 'applicable', 'approach', 'to', 'solving', 'multimarginal', 'martingale', 'optimal', 'transport', 'and', 'related', 'problems', 'via', 'neural', 'networks', 'the', 'core', 'idea', 'is', 'to', 'penalize', 'the', 'optimization', 'problem', 'in', 'its', 'dual', 'formulation', 'and', 'reduce', 'it', 'to', 'a', 'finite', 'dimensional', 'one', 'which', 'corresponds', 'to', 'optimizing', 'a', 'neural', 'network', 'with', 'smooth', 'objective', 'function', 'we', 'present', 'numerical', 'examples', 'from', 'optimal', 'transport', 'martingale', 'optimal', 'transport', 'portfolio', 'optimization', 'under', 'uncertainty', 'and', 'generative', 'adversarial', 'networks', 'that', 'showcase', 'the', 'generality', 'and', 'effectiveness', 'of', 'the', 'approach']] | [-0.04098831359834339, -0.06075129112921273, -0.07278068707539485, 0.097066117122244, -0.11979211195825766, -0.1857920547421926, 0.056735473074532375, 0.4104826226711082, -0.37444221428953683, -0.26187074284714, 0.11161620883742729, -0.21913857352084073, -0.26876009551760477, 0.17853038066711563, -0.16881488532257768, 0.17240036318887575, 0.09004246404107946, -0.06239627436316835, -0.04993411910254508, -0.27945023534509045, 0.32613486470654607, 0.029585971305958737, 0.35882657105162835, 0.057114630444303684, 0.1988828526257585, -0.00546996500223684, 0.034536550800578714, 0.0388665887249562, -0.11404801563269128, 0.20862125974142542, 0.3402366689286935, 0.1447831500106706, 0.39654666697606444, -0.4097324415611533, -0.2355985549541238, 0.1394893781711849, 0.10547932895282522, 0.08872951836271498, -0.02426523533769143, -0.2341260167841728, 0.07807130770733914, -0.15082346624097762, -0.04488985211206361, -0.10346797877588333, -0.06746740138623863, 0.013386281601224955, -0.33779155668348837, 0.06158490508842545, 0.0272025514800006, -0.026300562435211852, -0.07114020274886383, -0.11650199215047252, 0.020490733357385185, 0.06798921812636156, 0.07923139040418065, 0.057124453680350996, 0.13176196406428248, -0.1029325204955314, -0.18174951547422472, 0.3573444065852807, -0.022813867550725356, -0.27912581842900136, 0.15801070345183596, 0.0073298749048262835, -0.1082451921971276, 0.11304591760600512, 0.252944059514751, 0.1711984836281492, -0.20963359793098882, 0.06464425208441053, -0.05700121478488048, 0.10754170189969815, 0.0013021474035504537, -0.014595016234148389, 0.12029398600302207, 0.2599506928251149, 0.17528712467696422, 0.21476196121567717, -0.03316042259431038, -0.1811826838992345, -0.26772629864848196, -0.10454047501955827, -0.207035190354173, 0.05579339186899746, -0.1151854454663594, -0.14695857510639307, 0.407089685734648, 0.23262536909822254, 0.1352736265398562, 0.14603163447762385, 0.3091261071176865, 0.131516742406604, 0.023737999795673367, 0.12833160045332848, 0.1698214457824062, 0.14031256280708101, 0.1327284493794044, -0.2612218395896399, 0.08354783053987493, 0.12063192589901006] |
1,802.0854 | Optimal Stochastic Delivery Planning in Full-Truckload and
Less-Than-Truckload Delivery | With an increasing demand from emerging logistics businesses, Vehicle Routing
Problem with Private fleet and common Carrier (VRPPC) has been introduced to
manage package delivery services from a supplier to customers. However, almost
all of existing studies focus on the deterministic problem that assumes all
parameters are known perfectly at the time when the planning and routing
decisions are made. In reality, some parameters are random and unknown.
Therefore, in this paper, we consider VRPPC with hard time windows and random
demand, called Optimal Delivery Planning (ODP). The proposed ODP aims to
minimize the total package delivery cost while meeting the customer time window
constraints. We use stochastic integer programming to formulate the
optimization problem incorporating the customer demand uncertainty. Moreover,
we evaluate the performance of the ODP using test data from benchmark dataset
and from actual Singapore road map.
| cs.AI | with an increasing demand from emerging logistics businesses vehicle routing problem with private fleet and common carrier vrppc has been introduced to manage package delivery services from a supplier to customers however almost all of existing studies focus on the deterministic problem that assumes all parameters are known perfectly at the time when the planning and routing decisions are made in reality some parameters are random and unknown therefore in this paper we consider vrppc with hard time windows and random demand called optimal delivery planning odp the proposed odp aims to minimize the total package delivery cost while meeting the customer time window constraints we use stochastic integer programming to formulate the optimization problem incorporating the customer demand uncertainty moreover we evaluate the performance of the odp using test data from benchmark dataset and from actual singapore road map | [['with', 'an', 'increasing', 'demand', 'from', 'emerging', 'logistics', 'businesses', 'vehicle', 'routing', 'problem', 'with', 'private', 'fleet', 'and', 'common', 'carrier', 'vrppc', 'has', 'been', 'introduced', 'to', 'manage', 'package', 'delivery', 'services', 'from', 'a', 'supplier', 'to', 'customers', 'however', 'almost', 'all', 'of', 'existing', 'studies', 'focus', 'on', 'the', 'deterministic', 'problem', 'that', 'assumes', 'all', 'parameters', 'are', 'known', 'perfectly', 'at', 'the', 'time', 'when', 'the', 'planning', 'and', 'routing', 'decisions', 'are', 'made', 'in', 'reality', 'some', 'parameters', 'are', 'random', 'and', 'unknown', 'therefore', 'in', 'this', 'paper', 'we', 'consider', 'vrppc', 'with', 'hard', 'time', 'windows', 'and', 'random', 'demand', 'called', 'optimal', 'delivery', 'planning', 'odp', 'the', 'proposed', 'odp', 'aims', 'to', 'minimize', 'the', 'total', 'package', 'delivery', 'cost', 'while', 'meeting', 'the', 'customer', 'time', 'window', 'constraints', 'we', 'use', 'stochastic', 'integer', 'programming', 'to', 'formulate', 'the', 'optimization', 'problem', 'incorporating', 'the', 'customer', 'demand', 'uncertainty', 'moreover', 'we', 'evaluate', 'the', 'performance', 'of', 'the', 'odp', 'using', 'test', 'data', 'from', 'benchmark', 'dataset', 'and', 'from', 'actual', 'singapore', 'road', 'map']] | [-0.13526645552899155, 0.03702009423130741, -0.03731977534979316, 0.027802064725463944, -0.12863700494968466, -0.18513858645954834, 0.10940673796742756, 0.4199681098705956, -0.2941536505993489, -0.35412896643392744, 0.14410376491557275, -0.30449793067361625, -0.11173976380378008, 0.16944682098525976, -0.16861124837970629, 0.1542952137467052, 0.08075914405136635, 0.028830986829208476, 0.015685803442777667, -0.30153537229135896, 0.2646951325878035, 0.05869372402251299, 0.3155289132347597, 0.06730505090256754, 0.11473194556393927, 0.051193257366373604, -0.06056328994122201, -0.011151948998615678, -0.11985446124230553, 0.11745322184620559, 0.3543489594195437, 0.23974581584168067, 0.3349526129929083, -0.45292364915117755, -0.18705806390249302, 0.11303535748156719, 0.07432512270731552, 0.03012474717272978, -0.012649267721488805, -0.25820526664278337, 0.05844296660839713, -0.2000640697178564, -0.06143706463792894, -0.01073050975766299, 0.007901276860918318, 0.04744441651148788, -0.2897404478131128, -0.04702229531249032, -0.05814307750801423, 0.028657882886805704, -0.09724944058606134, -0.1274436349514872, 0.002021927329977708, 0.20671472405353727, 0.09331298826478555, 0.014899361742261264, 0.13630738320228244, -0.09915627254392478, -0.15094069653922426, 0.4406063342932612, 0.006592966093947845, -0.1706770416814834, 0.10975994965992868, -0.03414292231069079, -0.14876287576875516, 0.10401842401229909, 0.27595708952285347, 0.07846917883226914, -0.24190312508778464, 0.04826274604461755, -0.01694331632794014, 0.15468950097316078, 0.059907557624059596, 0.004746800852340779, 0.16499933208272394, 0.22375583961838857, 0.15995021607606238, 0.1254831613008199, -0.05008969221006347, -0.12933871186604456, -0.19733695685780342, -0.1138442770178829, -0.17117646558243516, -0.00926109694576423, -0.08715395655630605, -0.1237483335858477, 0.3525965907960199, 0.22010298378632537, 0.11741017341347677, 0.12785907286867898, 0.39053112186790845, 0.07301743680478207, 0.02415009463106149, 0.17410878296941518, 0.12770018972743336, -0.05620755447224448, 0.17751741657266393, -0.18731132923359317, 0.14722642729591046, 0.0025721305964647658] |
1,802.08541 | Chaos, decoherence and emergent extradimensions in D-brane dynamics with
fluctuations | We study, by using tools of the dynamical system theory, a fermionic string
streched from a non-commutative D2-brane (stack of D0-branes in the BFSS model)
to a probe D0-brane as a quantum system driven by a chaotic system, the
(classical and quantum) chaos being induced in the D2-brane dynamics by quantum
fluctuations. We show that this dynamics with fluctuations induces a
decoherence phenomenon on the reduced density matrix of the fermionic string
which is characteristic of the chaotic behaviour since it presents an horizon
of coherence. Moreover we show that this dynamics is associated with an
invariant torus which involves extradimensions emerging from the fluctuations
for the viewpoint of the fermionic string, extending a three dimensional space
by six compact dimensions. The situation studied can be considered as a model
of qubit (supported by the fermionic string) in interaction with a quantum
black hole (modelized by the non-commutative D2-brane).
| hep-th | we study by using tools of the dynamical system theory a fermionic string streched from a noncommutative d2brane stack of d0branes in the bfss model to a probe d0brane as a quantum system driven by a chaotic system the classical and quantum chaos being induced in the d2brane dynamics by quantum fluctuations we show that this dynamics with fluctuations induces a decoherence phenomenon on the reduced density matrix of the fermionic string which is characteristic of the chaotic behaviour since it presents an horizon of coherence moreover we show that this dynamics is associated with an invariant torus which involves extradimensions emerging from the fluctuations for the viewpoint of the fermionic string extending a three dimensional space by six compact dimensions the situation studied can be considered as a model of qubit supported by the fermionic string in interaction with a quantum black hole modelized by the noncommutative d2brane | [['we', 'study', 'by', 'using', 'tools', 'of', 'the', 'dynamical', 'system', 'theory', 'a', 'fermionic', 'string', 'streched', 'from', 'a', 'noncommutative', 'd2brane', 'stack', 'of', 'd0branes', 'in', 'the', 'bfss', 'model', 'to', 'a', 'probe', 'd0brane', 'as', 'a', 'quantum', 'system', 'driven', 'by', 'a', 'chaotic', 'system', 'the', 'classical', 'and', 'quantum', 'chaos', 'being', 'induced', 'in', 'the', 'd2brane', 'dynamics', 'by', 'quantum', 'fluctuations', 'we', 'show', 'that', 'this', 'dynamics', 'with', 'fluctuations', 'induces', 'a', 'decoherence', 'phenomenon', 'on', 'the', 'reduced', 'density', 'matrix', 'of', 'the', 'fermionic', 'string', 'which', 'is', 'characteristic', 'of', 'the', 'chaotic', 'behaviour', 'since', 'it', 'presents', 'an', 'horizon', 'of', 'coherence', 'moreover', 'we', 'show', 'that', 'this', 'dynamics', 'is', 'associated', 'with', 'an', 'invariant', 'torus', 'which', 'involves', 'extradimensions', 'emerging', 'from', 'the', 'fluctuations', 'for', 'the', 'viewpoint', 'of', 'the', 'fermionic', 'string', 'extending', 'a', 'three', 'dimensional', 'space', 'by', 'six', 'compact', 'dimensions', 'the', 'situation', 'studied', 'can', 'be', 'considered', 'as', 'a', 'model', 'of', 'qubit', 'supported', 'by', 'the', 'fermionic', 'string', 'in', 'interaction', 'with', 'a', 'quantum', 'black', 'hole', 'modelized', 'by', 'the', 'noncommutative', 'd2brane']] | [-0.17803032929702794, 0.21918843851769312, -0.11648008843646354, 0.08644249702760037, 0.017047298265833583, -0.14744975610445535, -0.006379677305441825, 0.250020012909534, -0.2503922897384771, -0.22799130183200808, 0.09209360814990863, -0.25653239597422667, -0.18747333267503638, 0.17541551550900275, -0.051831696938798334, 0.026156614834580247, -0.00552045377971442, 0.0660528738142285, -0.08117666367469543, -0.22812775851246095, 0.3888732156303755, 0.04476459533067564, 0.24183124931522915, -0.011208007740319376, 0.11956907058722221, 0.023099465716017672, 0.028763804981256868, 0.05248388024840048, -0.11461306440274016, 0.11348690438371827, 0.19940010040581238, 0.06788338329674264, 0.17934085961256252, -0.433476342150829, -0.2628993652573468, 0.04607323625034359, 0.1486427771090061, 0.1659900766387957, -0.035489083318533565, -0.3306668893927896, 0.02482825489527227, -0.21049923098164816, -0.1599502458499632, -0.051923450638833864, 0.025526340244550434, -0.05587315825814219, -0.2089711907913521, 0.059833417987238444, 0.07083157823954696, 0.043429807397293164, -0.01119194373382168, 0.02719420868037706, -0.02410501626713964, 0.07531191636034719, 0.041087132142606696, 0.04063063924319592, 0.1690575400611148, -0.14958927353232476, -0.16854667169473214, 0.36553752498588704, -0.10862128655723102, -0.22478075867044917, 0.15901153722790465, -0.1321939339723763, -0.1008222803439095, 0.11961756546625354, 0.09037662814090015, 0.11011992987001552, -0.13566650582114922, 0.19596147667515035, -0.04072128304502233, 0.1718505543794158, 0.0378588852378846, 0.07493087015546009, 0.30146895509038196, 0.15753233881242223, 0.049997893812122364, 0.20667660116583683, -0.04889835221513218, -0.20223332482902645, -0.3302071202365094, -0.12402227917223568, -0.1838406092493526, 0.15582541151178514, -0.08733685635920574, -0.1890807721401321, 0.378627164298731, 0.1058736618994204, 0.2086738924177101, -0.015861764075367355, 0.23738095520107988, 0.12345656264423324, 0.038977955771147606, 0.039473191872489134, 0.20034186393272557, 0.1505462636564852, 0.07973166006998528, -0.2843744282059109, -0.07804306274930002, 0.13265178756219578] |
1,802.08542 | Nanocircuits in loop structures: continuous waves preclude gauge
invariant wavelengths | Tunnel junctions for quantum computing require discrete spectra from
continuous waves on a doubly connected coordinate or loop. For an electron on a
metal ring discrete spectra follow from discontinuous Bloch waves. Can both
propositions be true? We find using a gauge function originating in the
Lagrangian that continuity on a ring or loop violates gauge invariance of the
de Broglie wavelength. This same gauge function shows that Lagrangians for the
electron on a ring and the charge on a junction are mutual transforms. Thus
persistent current on a metal ring and the Coulomb blockade on a tunnel
junction seem to be the same dynamical theory based on discontinuous Bloch
waves on the compact perimeter of a circle
| physics.gen-ph | tunnel junctions for quantum computing require discrete spectra from continuous waves on a doubly connected coordinate or loop for an electron on a metal ring discrete spectra follow from discontinuous bloch waves can both propositions be true we find using a gauge function originating in the lagrangian that continuity on a ring or loop violates gauge invariance of the de broglie wavelength this same gauge function shows that lagrangians for the electron on a ring and the charge on a junction are mutual transforms thus persistent current on a metal ring and the coulomb blockade on a tunnel junction seem to be the same dynamical theory based on discontinuous bloch waves on the compact perimeter of a circle | [['tunnel', 'junctions', 'for', 'quantum', 'computing', 'require', 'discrete', 'spectra', 'from', 'continuous', 'waves', 'on', 'a', 'doubly', 'connected', 'coordinate', 'or', 'loop', 'for', 'an', 'electron', 'on', 'a', 'metal', 'ring', 'discrete', 'spectra', 'follow', 'from', 'discontinuous', 'bloch', 'waves', 'can', 'both', 'propositions', 'be', 'true', 'we', 'find', 'using', 'a', 'gauge', 'function', 'originating', 'in', 'the', 'lagrangian', 'that', 'continuity', 'on', 'a', 'ring', 'or', 'loop', 'violates', 'gauge', 'invariance', 'of', 'the', 'de', 'broglie', 'wavelength', 'this', 'same', 'gauge', 'function', 'shows', 'that', 'lagrangians', 'for', 'the', 'electron', 'on', 'a', 'ring', 'and', 'the', 'charge', 'on', 'a', 'junction', 'are', 'mutual', 'transforms', 'thus', 'persistent', 'current', 'on', 'a', 'metal', 'ring', 'and', 'the', 'coulomb', 'blockade', 'on', 'a', 'tunnel', 'junction', 'seem', 'to', 'be', 'the', 'same', 'dynamical', 'theory', 'based', 'on', 'discontinuous', 'bloch', 'waves', 'on', 'the', 'compact', 'perimeter', 'of', 'a', 'circle']] | [-0.209011337542275, 0.1460170351350887, -0.1121700099014314, 0.07650001998102861, -0.07713643398325322, -0.15277681045995836, 0.026588568674061067, 0.35681580608489655, -0.22875537548087915, -0.1939264635034537, 0.03220961710055343, -0.2683275177033018, -0.09143401931387261, 0.20748360296000995, -0.03007738117791586, 0.0007174083710474483, 0.0018084341289191428, 0.03314285265119999, -0.07748275909620195, -0.13673049129419407, 0.3302552949487216, -0.007112497275387395, 0.2853219006999822, 0.053814341172070825, 0.1140214697402602, 0.032936529757581275, 0.05482403535427431, 0.036456647936759866, -0.10186467081433166, 0.06904377075409422, 0.18486691330228064, -0.024084199863186075, 0.17439850905941703, -0.5007038469094847, -0.20252339588478208, 0.039936532712367884, 0.13029705387909138, 0.1204432546816198, -0.036720217747211265, -0.3249655563179088, 0.03369146368418962, -0.14115531762896139, -0.11159968226891548, -0.028835697494194668, 0.009920931137087991, 0.05043526484741498, -0.24503011106892283, 0.054990706499665976, 0.030955085242551878, 0.060139238410155775, -0.029664476484975826, -0.043432583226388224, -0.05773565986872477, 0.022013969968025713, -0.0232766785785177, 0.04123225670221056, 0.1785891091498404, -0.09170996316242963, -0.12425977396541986, 0.3626367479239164, -0.09174843222767083, -0.21469272917010268, 0.1818851515733621, -0.17258032775973364, -0.08939832225106499, 0.14573516234976508, 0.13223727464170779, 0.1367371601103884, -0.10341590300391791, 0.14465071917491792, -0.06382975202266884, 0.16521344532779716, 0.11646200039806792, 0.0451139424260611, 0.29673575223581394, 0.0798731157398325, 0.11112085417390533, 0.06355220999892296, -0.07746296912684279, -0.12067438578588288, -0.3387570882973782, -0.1738279534413053, -0.22441292990796205, 0.127691379373388, -0.06752194825266843, -0.23669577709998998, 0.4219498271894566, 0.07005465106044154, 0.1722236459115836, 0.030037570579009035, 0.26522293556639454, 0.16197940755154053, 0.10052215857273442, 0.0183059644127675, 0.21253374114956203, 0.16166546690214614, 0.08046238269199128, -0.26233240552404424, -0.01650265668581982, 0.1205874214272441] |
1,802.08543 | Large-$N$ $\mathbb{CP}^{N-1}$ sigma model on a finite interval: general
Dirichlet boundary conditions | This is the third of the series of articles on the large-$N$ two-dimensional
$\mathbb{CP}^{N-1}$ sigma model, defined on a finite space interval $L$ with
Dirichlet boundary conditions. Here the cases of the general Dirichlet boundary
conditions are studied, where the relative $\mathbb{CP}^{N-1}$ orientations at
the two boundaries are generic, and numerical solutions are presented.
Distinctive features of the $\mathbb{CP}^{N-1}$ sigma model, as compared e.g.,
to an $O(N)$ model, which were not entirely evident in the basic properties
studied in the first two articles in the large $N$ limit, manifest themselves
here. It is found that the total energy is minimized when the fields are
aligned in the same direction at the two boundaries.
| hep-th hep-lat | this is the third of the series of articles on the largen twodimensional mathbbcpn1 sigma model defined on a finite space interval l with dirichlet boundary conditions here the cases of the general dirichlet boundary conditions are studied where the relative mathbbcpn1 orientations at the two boundaries are generic and numerical solutions are presented distinctive features of the mathbbcpn1 sigma model as compared eg to an on model which were not entirely evident in the basic properties studied in the first two articles in the large n limit manifest themselves here it is found that the total energy is minimized when the fields are aligned in the same direction at the two boundaries | [['this', 'is', 'the', 'third', 'of', 'the', 'series', 'of', 'articles', 'on', 'the', 'largen', 'twodimensional', 'mathbbcpn1', 'sigma', 'model', 'defined', 'on', 'a', 'finite', 'space', 'interval', 'l', 'with', 'dirichlet', 'boundary', 'conditions', 'here', 'the', 'cases', 'of', 'the', 'general', 'dirichlet', 'boundary', 'conditions', 'are', 'studied', 'where', 'the', 'relative', 'mathbbcpn1', 'orientations', 'at', 'the', 'two', 'boundaries', 'are', 'generic', 'and', 'numerical', 'solutions', 'are', 'presented', 'distinctive', 'features', 'of', 'the', 'mathbbcpn1', 'sigma', 'model', 'as', 'compared', 'eg', 'to', 'an', 'on', 'model', 'which', 'were', 'not', 'entirely', 'evident', 'in', 'the', 'basic', 'properties', 'studied', 'in', 'the', 'first', 'two', 'articles', 'in', 'the', 'large', 'n', 'limit', 'manifest', 'themselves', 'here', 'it', 'is', 'found', 'that', 'the', 'total', 'energy', 'is', 'minimized', 'when', 'the', 'fields', 'are', 'aligned', 'in', 'the', 'same', 'direction', 'at', 'the', 'two', 'boundaries']] | [-0.14853610862376151, 0.13072155572309682, -0.035018963941199854, 0.06743848521006912, -0.029689168483348547, -0.10410977904561215, -0.0397681464663649, 0.36689413751813427, -0.26345272286819804, -0.25929776638482527, 0.1291401772595019, -0.29630512456549746, -0.10831494112004551, 0.16425212929478591, -0.02113862123867843, 0.03666505107112163, 0.031222543740991208, 0.09775064614873412, -0.07963396111643353, -0.2619308993401649, 0.34150631649963625, -0.015631589923152882, 0.292385488806243, 0.027864896263762387, 0.055061687352712704, -0.047597260094882375, -0.02980652553713427, 0.044858849923541964, -0.15041021361311668, 0.08389976877818066, 0.20864949174291264, 0.0036375438670866785, 0.22026135937302513, -0.416006634275602, -0.1989937744503099, 0.06650318826787767, 0.12062178761736939, 0.058639440590472464, 0.029171291393623483, -0.2704539730716332, 0.08848078289291764, -0.0833442883598989, -0.1201669311447613, -0.006842568821677592, 0.028968426870775565, 0.02363237845958664, -0.24167774316022353, 0.06760693475010648, 0.06227558643890151, 0.06245691357468939, -0.09331555506296918, -0.12858560120798154, -0.07433720364078747, 0.10663011737205953, 0.0656359634821641, 0.017057365008456782, 0.06812934113864218, -0.12976853674137553, -0.07703550666595389, 0.3924407690631605, -0.05187013754270872, -0.26547814737510894, 0.20673318194489168, -0.1664288734375351, -0.15430034920408398, 0.09622101112582053, 0.13430861897552304, 0.15284107777339498, -0.1483227890712442, 0.13647965176919047, -0.08238647274664743, 0.11382656650353981, 0.0759027840619066, -0.018650055730579405, 0.19637256056334065, 0.12706101938064285, 0.03664086987697149, 0.13613477052576775, -0.07538781151694732, -0.13032306715087816, -0.3788711324795685, -0.13657585387241788, -0.19153840610740985, -0.006614713305148988, -0.09048482064820673, -0.1847522277879504, 0.38353942653197237, 0.11267630348756777, 0.2341316712492731, 0.02136800557774681, 0.24613813267592177, 0.13707774773598608, 0.041366175698441976, 0.06549272470308089, 0.20672344444608068, 0.10731607523697338, 0.06919529074308488, -0.1897269294028525, 0.03158951636436766, 0.054748742330192994] |
1,802.08544 | Geometrical Equivalence and Action Type Geometrical Equivalence of Group
Representations | In this paper we present the example which proves that we can not conclude
the geometrical equivalence of group representations from the corresponding
action-type geometrical equivalence and group geometrical equivalence.
| math.RT | in this paper we present the example which proves that we can not conclude the geometrical equivalence of group representations from the corresponding actiontype geometrical equivalence and group geometrical equivalence | [['in', 'this', 'paper', 'we', 'present', 'the', 'example', 'which', 'proves', 'that', 'we', 'can', 'not', 'conclude', 'the', 'geometrical', 'equivalence', 'of', 'group', 'representations', 'from', 'the', 'corresponding', 'actiontype', 'geometrical', 'equivalence', 'and', 'group', 'geometrical', 'equivalence']] | [-0.13807520139962434, 0.08448608639882878, -0.16007180009037256, 0.08640065936294074, -0.12791904023227593, -0.0726607914082706, 0.023691789615744103, 0.3849792854239543, -0.34066888044277827, -0.30528808807333313, 0.07115230763253445, -0.17788328727086386, -0.22510077382127444, 0.14435066133737565, -0.13539127899954717, -0.03811146284764012, 0.045191392038638395, 0.052536979659150045, -0.16162121397598336, -0.16178904601062338, 0.4161412778000037, 0.014678325938681762, 0.2748484091522793, 0.04496554207677642, 0.14242365127429366, 0.008864373729253808, -0.011451185308396816, 0.07153950586604575, -0.1481113995204699, 0.16460486624079446, 0.248084082826972, 0.12121572399822374, 0.14191871106158943, -0.35373295918107034, -0.11221238505095243, 0.12177615414063135, 0.15698652276769282, 0.098338913556654, -0.05021351727967461, -0.31905095459272464, 0.06906361868605018, -0.18348834247638782, -0.09131206280241409, -0.09127082258152465, 0.013128682288030784, -0.019623054936528207, -0.1722047334071249, 0.012751742421338955, 0.12606909888175627, 0.11011707459886869, -0.08624885956911992, -0.01784458151087165, 0.025791240731875102, 0.10245745728413264, 0.03018962879044314, -0.048225330825274186, 0.07396517729697129, -0.05034236420566837, -0.08332460296029846, 0.4379141579071681, -0.006769168935716152, -0.20101986434310676, 0.20884720790199934, -0.14338643555529415, -0.21842868686653674, 0.046397610443333785, 0.100646121862034, 0.0780226390187939, -0.12165084748218456, 0.12250181531029132, -0.1515958234667778, 0.1384949232257592, 0.028512654732912777, 0.008931749577944478, 0.13747999247473974, 0.05090910575818271, 0.02074457990626494, 0.2052127451946338, 0.011772486319144567, -0.028329845642050107, -0.4153947616772105, -0.18949398292849462, -0.08417900067288428, 0.11742723200053054, -0.11460714180284412, -0.0854204329662025, 0.39734556960562867, 0.21629377182107418, 0.15851825959980487, 0.11270175939813877, 0.19454996871451538, 0.07149984101609637, 0.04259514883160591, 0.031933144604166346, 0.26507273490230243, 0.1347939781534175, -0.06227505144973596, -0.18279854607923576, 0.03022175724618137, 0.19821992147093018] |
1,802.08545 | Unsupervised Grammar Induction with Depth-bounded PCFG | There has been recent interest in applying cognitively or empirically
motivated bounds on recursion depth to limit the search space of grammar
induction models (Ponvert et al., 2011; Noji and Johnson, 2016; Shain et al.,
2016). This work extends this depth-bounding approach to probabilistic
context-free grammar induction (DB-PCFG), which has a smaller parameter space
than hierarchical sequence models, and therefore more fully exploits the space
reductions of depth-bounding. Results for this model on grammar acquisition
from transcribed child-directed speech and newswire text exceed or are
competitive with those of other models when evaluated on parse accuracy.
Moreover, gram- mars acquired from this model demonstrate a consistent use of
category labels, something which has not been demonstrated by other acquisition
models.
| cs.CL cs.AI | there has been recent interest in applying cognitively or empirically motivated bounds on recursion depth to limit the search space of grammar induction models ponvert et al 2011 noji and johnson 2016 shain et al 2016 this work extends this depthbounding approach to probabilistic contextfree grammar induction dbpcfg which has a smaller parameter space than hierarchical sequence models and therefore more fully exploits the space reductions of depthbounding results for this model on grammar acquisition from transcribed childdirected speech and newswire text exceed or are competitive with those of other models when evaluated on parse accuracy moreover gram mars acquired from this model demonstrate a consistent use of category labels something which has not been demonstrated by other acquisition models | [['there', 'has', 'been', 'recent', 'interest', 'in', 'applying', 'cognitively', 'or', 'empirically', 'motivated', 'bounds', 'on', 'recursion', 'depth', 'to', 'limit', 'the', 'search', 'space', 'of', 'grammar', 'induction', 'models', 'ponvert', 'et', 'al', '2011', 'noji', 'and', 'johnson', '2016', 'shain', 'et', 'al', '2016', 'this', 'work', 'extends', 'this', 'depthbounding', 'approach', 'to', 'probabilistic', 'contextfree', 'grammar', 'induction', 'dbpcfg', 'which', 'has', 'a', 'smaller', 'parameter', 'space', 'than', 'hierarchical', 'sequence', 'models', 'and', 'therefore', 'more', 'fully', 'exploits', 'the', 'space', 'reductions', 'of', 'depthbounding', 'results', 'for', 'this', 'model', 'on', 'grammar', 'acquisition', 'from', 'transcribed', 'childdirected', 'speech', 'and', 'newswire', 'text', 'exceed', 'or', 'are', 'competitive', 'with', 'those', 'of', 'other', 'models', 'when', 'evaluated', 'on', 'parse', 'accuracy', 'moreover', 'gram', 'mars', 'acquired', 'from', 'this', 'model', 'demonstrate', 'a', 'consistent', 'use', 'of', 'category', 'labels', 'something', 'which', 'has', 'not', 'been', 'demonstrated', 'by', 'other', 'acquisition', 'models']] | [0.018147791154754893, 0.050960007559203, -0.05404623889300073, 0.04815548423131735, -0.16223416140238786, -0.12360965295750968, 0.06761338860539173, 0.3798748678046054, -0.24741915499004696, -0.38530818920367765, 0.07460203947667995, -0.2622976614852789, -0.15739922388858194, 0.224673731114057, -0.16924241053919983, 0.05546579734800616, 0.13223181457001845, 0.029988900991156697, -0.022470091915175575, -0.30026993929440604, 0.266120336259362, 0.06745302698831877, 0.3102821888450276, -0.0469478312157223, 0.11302353257056454, -0.03367835762990831, -0.07290256920206392, -0.002876007701380676, -0.1124282774690073, 0.14627749617372093, 0.269508069611565, 0.20082260437454258, 0.22793294603089354, -0.39963072040599995, -0.26040293526301833, 0.0996670499283435, 0.12646847092225377, 0.11179434652199391, -0.023864844084967224, -0.3608244301767313, 0.07647628409402638, -0.21016468938163096, 0.06350502316791821, -0.09305820033829339, 0.09352334438329402, -0.03920472121861731, -0.27968330789309254, 0.0407335639224741, 0.13308660624044996, 0.08426581880334637, -0.04207429497358229, -0.15799541753949597, -0.007850102104792565, 0.0743522040281497, 0.0020778413866004296, 0.08428491599825692, 0.07152860877425249, -0.10917225094704792, -0.17127896177759072, 0.3281793472967271, -0.0441668387930208, -0.18471164736647866, 0.21762661354070337, -0.07656998678255056, -0.16018741551770604, 0.09835889567781625, 0.15998134498709235, 0.12173515667633057, -0.15515857225884624, 0.1484441599986267, -0.08742742356844246, 0.21572176248621966, 0.12077562134022471, -0.048354660626500845, 0.15145261380078817, 0.22055633012646939, -0.031817776054657736, 0.0783028871469312, -0.03519635394883968, -0.05384407565499463, -0.18988547378203607, -0.09680594219075986, -0.16605267423437908, -0.0399533005767243, -0.03387248531299551, -0.12573579541339283, 0.34101577641458475, 0.22995149788992672, 0.20136677760406044, 0.1182424538419582, 0.2806361501169359, 0.08204467717461802, 0.09509551446033834, 0.10249379274017852, 0.19115034179161866, 0.0548236407640647, 0.10289855669493433, -0.1056934090457648, 0.12616354320298656, 0.11210356364508384] |
1,802.08546 | Acceleration of particles to high energy via gravitational repulsion in
the Schwarzschild field | Gravitational repulsion is an inherent aspect of the Schwarzschild solution
of the Einstein-Hilbert field equations of general relativity. We show that
this circumstance means that it is possible to gravitationally accelerate
particles to the highest cosmic ray energies.
| astro-ph.HE gr-qc | gravitational repulsion is an inherent aspect of the schwarzschild solution of the einsteinhilbert field equations of general relativity we show that this circumstance means that it is possible to gravitationally accelerate particles to the highest cosmic ray energies | [['gravitational', 'repulsion', 'is', 'an', 'inherent', 'aspect', 'of', 'the', 'schwarzschild', 'solution', 'of', 'the', 'einsteinhilbert', 'field', 'equations', 'of', 'general', 'relativity', 'we', 'show', 'that', 'this', 'circumstance', 'means', 'that', 'it', 'is', 'possible', 'to', 'gravitationally', 'accelerate', 'particles', 'to', 'the', 'highest', 'cosmic', 'ray', 'energies']] | [-0.169164544287732, 0.13893956751417136, -0.0911241703985357, 0.1469816773743859, -0.12288186169768635, -0.05720368223754983, -0.07883010946802403, 0.30203000175472544, -0.2820162120348725, -0.2900603746407126, -0.06916342397514534, -0.28175110889500693, -0.12125858125325881, 0.14393102475687078, -0.030325641022308877, -0.005378600896189087, 0.06690278374835064, 0.03446092378152044, -0.024952178902152043, -0.27496650437579345, 0.3569860304338171, 0.21989867958779397, 0.1986171081662178, 0.058327515306269846, 0.163060266107909, -0.052603698972808685, 0.05497425118167149, 0.05953561368790504, -0.13653903828488087, 0.05189420934153819, 0.20258840606057724, 0.1331986900124895, 0.23989388944679185, -0.41382212995698575, -0.2320855850059735, 0.10866407206968258, 0.14421033035767705, 0.18524566106498241, -0.05462732612106361, -0.2814316637814045, 0.07696361565276195, -0.18246526349531977, -0.21717537294975237, -0.01781464279874375, 0.03829784251712753, -0.01896432622973072, -0.21009073220193386, 0.09126394798390959, 0.05554444634502655, -0.07847796020245082, -0.1168792886616613, -0.01694073694096388, 0.03116162597986036, 0.026012734975665808, 0.19822628431536846, 0.0800685204908644, 0.1701394950505346, -0.1340439670755969, -0.04582373318752568, 0.4704143173600498, -0.06725176264482893, -0.21134608665383176, 0.17771620009290545, -0.21477417976252342, -0.13182997867759122, 0.21664622327999064, 0.10798399537605674, 0.14884418214818365, -0.18795111742311796, 0.1518407940472427, 0.015938448229510533, 0.17036119294597915, 0.11517481523026761, -0.008716759472582979, 0.2814259423727268, 0.115744566324314, 0.10191142073783435, 0.06553521142096112, -0.039731151620416266, -0.06320705392404068, -0.3302682485235365, -0.21136336787726337, -0.19162989103872524, 0.08720751709647868, -0.14497040426297308, -0.18064447836705336, 0.30744530128217057, 0.1858135308384111, 0.06307850618797697, 0.03136948829418734, 0.28134173277373375, 0.10988498550508857, 0.03287904084611096, 0.08069133996277263, 0.39689845268271473, 0.15087806614189359, 0.1004101796945753, -0.2429453310017523, -0.0596258380131698, 0.09099901153853066] |
1,802.08547 | SmartUnit: Empirical Evaluations for Automated Unit Testing of Embedded
Software in Industry | In this paper, we aim at the automated unit coverage-based testing for
embedded software. To achieve the goal, by analyzing the industrial
requirements and our previous work on automated unit testing tool CAUT, we
rebuild a new tool, SmartUnit, to solve the engineering requirements that take
place in our partner companies. SmartUnit is a dynamic symbolic execution
implementation, which supports statement, branch, boundary value and MC/DC
coverage. SmartUnit has been used to test more than one million lines of code
in real projects. For confidentiality motives, we select three in-house real
projects for the empirical evaluations. We also carry out our evaluations on
two open source database projects, SQLite and PostgreSQL, to test the
scalability of our tool since the scale of the embedded software project is
mostly not large, 5K-50K lines of code on average. From our experimental
results, in general, more than 90% of functions in commercial embedded software
achieve 100% statement, branch, MC/DC coverage, more than 80% of functions in
SQLite achieve 100% MC/DC coverage, and more than 60% of functions in
PostgreSQL achieve 100% MC/DC coverage. Moreover, SmartUnit is able to find the
runtime exceptions at the unit testing level. We also have reported exceptions
like array index out of bounds and divided-by-zero in SQLite. Furthermore, we
analyze the reasons of low coverage in automated unit testing in our setting
and give a survey on the situation of manual unit testing with respect to
automated unit testing in industry.
| cs.SE | in this paper we aim at the automated unit coveragebased testing for embedded software to achieve the goal by analyzing the industrial requirements and our previous work on automated unit testing tool caut we rebuild a new tool smartunit to solve the engineering requirements that take place in our partner companies smartunit is a dynamic symbolic execution implementation which supports statement branch boundary value and mcdc coverage smartunit has been used to test more than one million lines of code in real projects for confidentiality motives we select three inhouse real projects for the empirical evaluations we also carry out our evaluations on two open source database projects sqlite and postgresql to test the scalability of our tool since the scale of the embedded software project is mostly not large 5k50k lines of code on average from our experimental results in general more than 90 of functions in commercial embedded software achieve 100 statement branch mcdc coverage more than 80 of functions in sqlite achieve 100 mcdc coverage and more than 60 of functions in postgresql achieve 100 mcdc coverage moreover smartunit is able to find the runtime exceptions at the unit testing level we also have reported exceptions like array index out of bounds and dividedbyzero in sqlite furthermore we analyze the reasons of low coverage in automated unit testing in our setting and give a survey on the situation of manual unit testing with respect to automated unit testing in industry | [['in', 'this', 'paper', 'we', 'aim', 'at', 'the', 'automated', 'unit', 'coveragebased', 'testing', 'for', 'embedded', 'software', 'to', 'achieve', 'the', 'goal', 'by', 'analyzing', 'the', 'industrial', 'requirements', 'and', 'our', 'previous', 'work', 'on', 'automated', 'unit', 'testing', 'tool', 'caut', 'we', 'rebuild', 'a', 'new', 'tool', 'smartunit', 'to', 'solve', 'the', 'engineering', 'requirements', 'that', 'take', 'place', 'in', 'our', 'partner', 'companies', 'smartunit', 'is', 'a', 'dynamic', 'symbolic', 'execution', 'implementation', 'which', 'supports', 'statement', 'branch', 'boundary', 'value', 'and', 'mcdc', 'coverage', 'smartunit', 'has', 'been', 'used', 'to', 'test', 'more', 'than', 'one', 'million', 'lines', 'of', 'code', 'in', 'real', 'projects', 'for', 'confidentiality', 'motives', 'we', 'select', 'three', 'inhouse', 'real', 'projects', 'for', 'the', 'empirical', 'evaluations', 'we', 'also', 'carry', 'out', 'our', 'evaluations', 'on', 'two', 'open', 'source', 'database', 'projects', 'sqlite', 'and', 'postgresql', 'to', 'test', 'the', 'scalability', 'of', 'our', 'tool', 'since', 'the', 'scale', 'of', 'the', 'embedded', 'software', 'project', 'is', 'mostly', 'not', 'large', '5k50k', 'lines', 'of', 'code', 'on', 'average', 'from', 'our', 'experimental', 'results', 'in', 'general', 'more', 'than', '90', 'of', 'functions', 'in', 'commercial', 'embedded', 'software', 'achieve', '100', 'statement', 'branch', 'mcdc', 'coverage', 'more', 'than', '80', 'of', 'functions', 'in', 'sqlite', 'achieve', '100', 'mcdc', 'coverage', 'and', 'more', 'than', '60', 'of', 'functions', 'in', 'postgresql', 'achieve', '100', 'mcdc', 'coverage', 'moreover', 'smartunit', 'is', 'able', 'to', 'find', 'the', 'runtime', 'exceptions', 'at', 'the', 'unit', 'testing', 'level', 'we', 'also', 'have', 'reported', 'exceptions', 'like', 'array', 'index', 'out', 'of', 'bounds', 'and', 'dividedbyzero', 'in', 'sqlite', 'furthermore', 'we', 'analyze', 'the', 'reasons', 'of', 'low', 'coverage', 'in', 'automated', 'unit', 'testing', 'in', 'our', 'setting', 'and', 'give', 'a', 'survey', 'on', 'the', 'situation', 'of', 'manual', 'unit', 'testing', 'with', 'respect', 'to', 'automated', 'unit', 'testing', 'in', 'industry']] | [-0.08052902794249045, -0.01880158283553707, -0.047080501011320545, 0.06688754098431673, -0.06272400753902427, -0.14596687372444042, 0.09889766560178638, 0.41433713613078, -0.1699169485126428, -0.3761386787201142, 0.14861035869738165, -0.2835545864489783, -0.06817937684851737, 0.2643114267773247, -0.08105260671194021, 0.06308940942399203, 0.09656722755704929, -0.014000710563656564, -0.025270840045413932, -0.3158380634946904, 0.2528607442283677, 0.07849959173278573, 0.30719295303570104, 0.061563533742446455, 0.024797401163959877, -0.02352373431979989, -0.061017060107163464, -0.02458347390408259, -0.09174610560988489, 0.1597565063838071, 0.3025512305243562, 0.20890575060911942, 0.3066939586686203, -0.4019264970057217, -0.12780131669618033, 0.057309821903860816, 0.13074288547456187, 0.018435770034072145, -0.030280760636136012, -0.24456569481796275, 0.13142503789858892, -0.18625724268204066, -0.11391009802852446, -0.07166476206863687, 0.007848162186564877, -0.02929754607806293, -0.24211815466793876, -0.03415832146408017, 0.018178103014846177, 0.13703897539138174, -0.04222099844288702, -0.11814751410420285, 0.018181179871317, 0.15922496750523957, 0.006972293498499009, 0.06635862277629107, 0.136402443163873, -0.09630587324985147, -0.11881007735719322, 0.37458945125108584, -0.04576942296819955, -0.18671272875120243, 0.1982626566294736, -0.11528492099993552, -0.1881018581528527, 0.1040621756115191, 0.2229664409455533, 0.11136167781290472, -0.1581832945657273, 0.05635422201363933, 0.0030944530177900256, 0.22199979461195957, 0.07512784169836474, -0.009100459476515728, 0.16659730755879235, 0.21369067847457093, 0.05912413320717557, 0.1722530259823543, -0.07799423383451844, -0.09247955270499612, -0.25994633217245183, -0.1818078410520684, -0.12943933116621337, 0.012862225724347809, -0.06504808045344058, -0.15113879585745357, 0.38381011520201963, 0.2091759448929224, 0.10753486110770609, 0.10063614378886995, 0.32448495433782226, 0.018744857601025917, 0.1448395034368635, 0.1041428324591834, 0.20136118101023992, 0.009163922818455223, 0.11446781800671792, -0.12308558618242386, 0.05501098923850804, -0.02804096748586744] |
1,802.08548 | On VOAs Associated to Jordan Algebras of Type $C$ | In this article, we construct certain universal VOAs whose Greiss algebras
are type C Jordan algebras. We also prove the corresponding simplicity result.
| math.QA | in this article we construct certain universal voas whose greiss algebras are type c jordan algebras we also prove the corresponding simplicity result | [['in', 'this', 'article', 'we', 'construct', 'certain', 'universal', 'voas', 'whose', 'greiss', 'algebras', 'are', 'type', 'c', 'jordan', 'algebras', 'we', 'also', 'prove', 'the', 'corresponding', 'simplicity', 'result']] | [-0.13610276952385902, 0.04429712103497561, -0.04072989184287903, 0.0784246880793944, -0.14409468871662798, -0.19860451429596412, -0.061929703381357955, 0.35304578782423685, -0.3767588067718822, -0.14804247774831628, 0.1263079854366167, -0.17031282056932864, -0.2407668286367603, 0.1734419649304903, -0.2162046072113773, -0.07490750361719857, 0.0651185275460391, 0.12558971110569395, -0.1652416703088776, -0.31272215635070333, 0.4290352823293727, -0.07934338399006621, 0.21750455463062163, 0.05496722419300805, 0.06728664101303919, -0.017861131436960852, -0.040461024755369064, -0.01803532018042777, -0.29253777003158693, 0.1403512141323122, 0.30063229394347774, 0.09979381089341706, 0.1904466066347516, -0.29334125019933865, -0.016517687143514984, 0.23283405883399688, 0.1571974789156862, 0.08845761240176532, -0.022452808400292113, -0.22039920034939828, 0.10112080436058181, -0.2736645218632791, -0.19843606254004914, -0.06728980605207059, 0.07977491754876531, 0.02927121503845505, -0.1894960267793225, 0.033273341892155535, 0.17315762919252334, 0.12723593851146492, -0.12967517816097193, -0.06728137648947861, -0.07264584011357764, 0.005222930410957854, -0.1216711099057094, -0.017219028010478487, 0.07568836738557919, 0.0051470671517207574, -0.14676144792009954, 0.3010893157966759, 0.03298283680139676, -0.22358794502266074, 0.15775992271854825, -0.1575192201619401, -0.24864354816710818, -0.019674732835720413, 0.04057890835785023, 0.11982809546948968, -0.10880129768148712, 0.2533494412656064, -0.1625479678420917, -0.039556658745783825, 0.14542257249274332, 0.05406189398111209, 0.10695210321927848, 0.02466711691459236, -0.02880568375163104, 0.176820184448329, 0.11484488304299505, -0.00205881851117896, -0.46161922294160596, -0.18707363736694274, -0.056665626395007836, 0.15219959325116614, -0.11674940812846889, -0.21936894191995912, 0.4177408694573071, 0.14748380276495995, 0.19233992404263953, 0.2068493480834624, 0.11204935432128284, 0.10993875178467968, 0.10690085373758136, 0.09628580721176189, 0.1675946006308431, 0.23883565717741198, 0.04520493300388689, -0.08764847756727882, -0.09061192964082179, 0.2511119752636422] |
1,802.08549 | DeePCG: constructing coarse-grained models via deep neural networks | We introduce a general framework for constructing coarse-grained potential
models without ad hoc approximations such as limiting the potential to two-
and/or three-body contributions. The scheme, called Deep Coarse-Grained
Potential (abbreviated DeePCG), exploits a carefully crafted neural network to
construct a many-body coarse-grained potential. The network is trained with
full atomistic data in a way that preserves the natural symmetries of the
system. The resulting model is very accurate and can be used to sample the
configurations of the coarse-grained variables in a much faster way than with
the original atomistic model. As an application we consider liquid water and
use the oxygen coordinates as the coarse-grained variables, starting from a
full atomistic simulation of this system at the ab-initio molecular dynamics
level. We found that the two-body, three-body and higher order oxygen
correlation functions produced by the coarse-grained and full atomistic models
agree very well with each other, illustrating the effectiveness of the DeePCG
model on a rather challenging task.
| physics.chem-ph physics.comp-ph | we introduce a general framework for constructing coarsegrained potential models without ad hoc approximations such as limiting the potential to two andor threebody contributions the scheme called deep coarsegrained potential abbreviated deepcg exploits a carefully crafted neural network to construct a manybody coarsegrained potential the network is trained with full atomistic data in a way that preserves the natural symmetries of the system the resulting model is very accurate and can be used to sample the configurations of the coarsegrained variables in a much faster way than with the original atomistic model as an application we consider liquid water and use the oxygen coordinates as the coarsegrained variables starting from a full atomistic simulation of this system at the abinitio molecular dynamics level we found that the twobody threebody and higher order oxygen correlation functions produced by the coarsegrained and full atomistic models agree very well with each other illustrating the effectiveness of the deepcg model on a rather challenging task | [['we', 'introduce', 'a', 'general', 'framework', 'for', 'constructing', 'coarsegrained', 'potential', 'models', 'without', 'ad', 'hoc', 'approximations', 'such', 'as', 'limiting', 'the', 'potential', 'to', 'two', 'andor', 'threebody', 'contributions', 'the', 'scheme', 'called', 'deep', 'coarsegrained', 'potential', 'abbreviated', 'deepcg', 'exploits', 'a', 'carefully', 'crafted', 'neural', 'network', 'to', 'construct', 'a', 'manybody', 'coarsegrained', 'potential', 'the', 'network', 'is', 'trained', 'with', 'full', 'atomistic', 'data', 'in', 'a', 'way', 'that', 'preserves', 'the', 'natural', 'symmetries', 'of', 'the', 'system', 'the', 'resulting', 'model', 'is', 'very', 'accurate', 'and', 'can', 'be', 'used', 'to', 'sample', 'the', 'configurations', 'of', 'the', 'coarsegrained', 'variables', 'in', 'a', 'much', 'faster', 'way', 'than', 'with', 'the', 'original', 'atomistic', 'model', 'as', 'an', 'application', 'we', 'consider', 'liquid', 'water', 'and', 'use', 'the', 'oxygen', 'coordinates', 'as', 'the', 'coarsegrained', 'variables', 'starting', 'from', 'a', 'full', 'atomistic', 'simulation', 'of', 'this', 'system', 'at', 'the', 'abinitio', 'molecular', 'dynamics', 'level', 'we', 'found', 'that', 'the', 'twobody', 'threebody', 'and', 'higher', 'order', 'oxygen', 'correlation', 'functions', 'produced', 'by', 'the', 'coarsegrained', 'and', 'full', 'atomistic', 'models', 'agree', 'very', 'well', 'with', 'each', 'other', 'illustrating', 'the', 'effectiveness', 'of', 'the', 'deepcg', 'model', 'on', 'a', 'rather', 'challenging', 'task']] | [-0.06946808610216908, 0.04231731326887809, -0.08493060168353314, 0.0985398522216487, -0.03480611441645232, -0.13506473275194378, 0.04360061456923777, 0.384186655622702, -0.2670676897531785, -0.30744086648776847, 0.03067128404933936, -0.2584084079618443, -0.17682469658899186, 0.1365538062776714, 0.019384960397937388, 0.08775468144870405, 0.09895325148823736, 0.00672335990077857, -0.08297692398017081, -0.1914956564004621, 0.28072704023494144, 0.09112470050370935, 0.235264169110817, 0.019647549140800094, 0.12931479521332975, -0.005368612902883276, 0.01550819905351777, 0.02316614986491044, -0.12618187974610165, 0.13985331472940743, 0.2189413844599076, 0.0733695544607047, 0.2705535805848597, -0.4945050427430136, -0.24872017200192753, 0.06307051743127394, 0.14242184056414278, 0.19846384828096056, -0.015441686627396482, -0.27796226778542094, 0.055927997681974144, -0.20823425974743734, -0.11689163051998103, -0.14614006660076198, -0.022726228914616054, 0.016529505281473376, -0.27162082370886076, 0.07438865582657826, 0.007204814438793059, 0.06797297957862886, -0.06854251986691647, -0.11179066856857389, -0.058902938308416856, 0.12126024638788786, -0.010293056579224719, 0.05919553831592349, 0.16898932864409197, -0.14044534126970237, -0.0814959660941975, 0.44273438101411805, -0.07379443614801126, -0.254700873369269, 0.2317908925718903, -0.05970927202816373, -0.1313907652917617, 0.11555118278348409, 0.14785957805601493, 0.12262364458193879, -0.2101290851550282, 0.061430894059521506, -0.021722861488039296, 0.18298267676793742, 0.001394862355957241, 0.0036758933785230904, 0.17473558743217807, 0.22992012688689484, 0.015856441447171587, 0.1396107052115331, -0.10042288949941548, -0.15011745775645635, -0.27078477235850673, -0.10481809386930431, -0.20138606673938297, 0.03436109408481433, -0.093945743688514, -0.15273783139082012, 0.399378250715532, 0.16538996917910218, 0.1852357647082997, 0.09492038545907482, 0.30883867791473113, 0.07277549164583497, 0.08412055940910552, 0.029322013882378338, 0.18099428490302144, 0.06903384378291198, 0.08151364962295073, -0.2135949160408744, 0.06734182686492238, 0.06126165225129551] |
1,802.0855 | Morrey spaces related to certain nonnegative potentials and fractional
integrals on the Heisenberg groups | Let $\mathcal L=-\Delta_{\mathbb H^n}+V$ be a Schr\"odinger operator on the
Heisenberg group $\mathbb H^n$, where $\Delta_{\mathbb H^n}$ is the
sub-Laplacian on $\mathbb H^n$ and the nonnegative potential $V$ belongs to the
reverse H\"older class $RH_s$ with $s\geq Q/2$. Here $Q=2n+2$ is the
homogeneous dimension of $\mathbb H^n$. For given $\alpha\in(0,Q)$, the
fractional integrals associated to the Schr\"odinger operator $\mathcal L$ is
defined by $\mathcal I_{\alpha}={\mathcal L}^{-{\alpha}/2}$. In this article,
we first introduce the Morrey space $L^{p,\kappa}_{\rho,\infty}(\mathbb H^n)$
and weak Morrey space $WL^{p,\kappa}_{\rho,\infty}(\mathbb H^n)$ related to the
nonnegative potential $V$. Then we establish the boundedness of fractional
integrals ${\mathcal L}^{-{\alpha}/2}$ on these new spaces. Furthermore, in
order to deal with certain extreme cases, we also introduce the spaces
$\mathrm{BMO}_{\rho,\infty}(\mathbb H^n)$ and
$\mathcal{C}^{\beta}_{\rho,\infty}(\mathbb H^n)$ with exponent $\beta\in(0,1]$.
| math.CA | let mathcal ldelta_mathbb hnv be a schrodinger operator on the heisenberg group mathbb hn where delta_mathbb hn is the sublaplacian on mathbb hn and the nonnegative potential v belongs to the reverse holder class rh_s with sgeq q2 here q2n2 is the homogeneous dimension of mathbb hn for given alphain0q the fractional integrals associated to the schrodinger operator mathcal l is defined by mathcal i_alphamathcal lalpha2 in this article we first introduce the morrey space lpkappa_rhoinftymathbb hn and weak morrey space wlpkappa_rhoinftymathbb hn related to the nonnegative potential v then we establish the boundedness of fractional integrals mathcal lalpha2 on these new spaces furthermore in order to deal with certain extreme cases we also introduce the spaces mathrmbmo_rhoinftymathbb hn and mathcalcbeta_rhoinftymathbb hn with exponent betain01 | [['let', 'mathcal', 'ldelta_mathbb', 'hnv', 'be', 'a', 'schrodinger', 'operator', 'on', 'the', 'heisenberg', 'group', 'mathbb', 'hn', 'where', 'delta_mathbb', 'hn', 'is', 'the', 'sublaplacian', 'on', 'mathbb', 'hn', 'and', 'the', 'nonnegative', 'potential', 'v', 'belongs', 'to', 'the', 'reverse', 'holder', 'class', 'rh_s', 'with', 'sgeq', 'q2', 'here', 'q2n2', 'is', 'the', 'homogeneous', 'dimension', 'of', 'mathbb', 'hn', 'for', 'given', 'alphain0q', 'the', 'fractional', 'integrals', 'associated', 'to', 'the', 'schrodinger', 'operator', 'mathcal', 'l', 'is', 'defined', 'by', 'mathcal', 'i_alphamathcal', 'lalpha2', 'in', 'this', 'article', 'we', 'first', 'introduce', 'the', 'morrey', 'space', 'lpkappa_rhoinftymathbb', 'hn', 'and', 'weak', 'morrey', 'space', 'wlpkappa_rhoinftymathbb', 'hn', 'related', 'to', 'the', 'nonnegative', 'potential', 'v', 'then', 'we', 'establish', 'the', 'boundedness', 'of', 'fractional', 'integrals', 'mathcal', 'lalpha2', 'on', 'these', 'new', 'spaces', 'furthermore', 'in', 'order', 'to', 'deal', 'with', 'certain', 'extreme', 'cases', 'we', 'also', 'introduce', 'the', 'spaces', 'mathrmbmo_rhoinftymathbb', 'hn', 'and', 'mathcalcbeta_rhoinftymathbb', 'hn', 'with', 'exponent', 'betain01']] | [-0.16012607869079226, 0.0945109990465208, 0.01637214337252717, 0.05590052748473091, -0.12222129285870852, -0.15376286587924656, -0.04353946624084925, 0.3599046163706698, -0.3554776685399951, -0.09224441005951828, 0.13248458073442626, -0.33267436307082826, -0.08873504527613647, 0.158282822678582, -0.10834869074149646, 0.013207199139536446, 0.0019922845352154514, 0.11285547090248547, -0.13171640649023983, -0.25564535689325285, 0.41592040102387595, -0.1012552599940035, 0.11774264643382695, 0.028519704587196406, 0.06662111190489979, -0.015124354404039107, 0.025631372804920644, -0.03487947143346699, -0.29409252593500745, 0.13409732608920616, 0.19210820840910459, 0.007977079900586579, 0.2968523988309197, -0.3424933435092879, -0.18037357140515542, 0.27561764603353334, 0.1580440013581871, -0.1545102455907971, 0.00646054029213981, -0.3790012378261512, 0.054774499434627526, -0.10419736799393964, -0.18810208385778415, -0.07984595731274885, 0.13582418082106826, 0.04271936467968118, -0.3527263043543849, 0.0837634576295013, 0.07551266808604074, 0.021152846089317504, -0.11454968544073467, -0.135715889171339, -0.06603775141585587, 0.019029295061014466, -0.03847882573285864, 0.15707361961229363, -0.03239550586773926, 0.011150476938654851, -0.07903287433581348, 0.4017820160032019, -0.08184291509827837, -0.2659048928568761, 0.06238500949425193, -0.2660652713697905, -0.1533414552656886, 0.035168873922278486, 0.1408841461301423, 0.19651384130577979, -0.02707438911191928, 0.2852645508022621, -0.06237550543792323, 0.04797127811063049, 0.03114255941194347, 0.04857238815126256, -0.038213160326783985, 0.06798229811406639, 0.1449901151787251, 0.1507356080821612, -0.03313824467800765, -0.014096728923061911, -0.39883801946018493, -0.2176510912658991, -0.19028553581581667, 0.19960003851666155, -0.17947451868176592, -0.14137020618774188, 0.31069015395533073, 0.056333042382716365, 0.14617954929255778, 0.1355901685360278, 0.13448604239294162, 0.1568502253239863, 0.029574241194651168, 0.0874487235943158, 0.07224693740956867, 0.19168055364981484, 0.08410749550407323, -0.1700556411718329, -0.03278618632680458, 0.2753352219772199] |
1,802.08551 | On the Chow groups of some hyperkaehler fourfolds with a non-symplectic
involution II | This article is about hyperk\"ahler fourfolds $X$ admitting a non-symplectic
involution $\iota$. The Bloch-Beilinson conjectures predict the way $\iota$
should act on certain pieces of the Chow groups of $X$. The main result is a
verification of this prediction for Fano varieties of lines on certain cubic
fourfolds. This has some interesting consequences for the Chow ring of the
quotient $X/\iota$.
| math.AG | this article is about hyperkahler fourfolds x admitting a nonsymplectic involution iota the blochbeilinson conjectures predict the way iota should act on certain pieces of the chow groups of x the main result is a verification of this prediction for fano varieties of lines on certain cubic fourfolds this has some interesting consequences for the chow ring of the quotient xiota | [['this', 'article', 'is', 'about', 'hyperkahler', 'fourfolds', 'x', 'admitting', 'a', 'nonsymplectic', 'involution', 'iota', 'the', 'blochbeilinson', 'conjectures', 'predict', 'the', 'way', 'iota', 'should', 'act', 'on', 'certain', 'pieces', 'of', 'the', 'chow', 'groups', 'of', 'x', 'the', 'main', 'result', 'is', 'a', 'verification', 'of', 'this', 'prediction', 'for', 'fano', 'varieties', 'of', 'lines', 'on', 'certain', 'cubic', 'fourfolds', 'this', 'has', 'some', 'interesting', 'consequences', 'for', 'the', 'chow', 'ring', 'of', 'the', 'quotient', 'xiota']] | [-0.2687655140752675, -0.04161636105387426, -0.14487921551144758, 0.07581357672222752, -0.1369350294384067, -0.18178286313338846, -0.013783675603202133, 0.3285646597381498, -0.2831223233312857, -0.20848822483762366, 0.10541955367127648, -0.24066686908119037, -0.16757664623380195, 0.21760128626264022, -0.23711534574261453, -0.05536040970597599, 0.020041571517826103, 0.08576445308987235, -0.09801612635616397, -0.4164391698040923, 0.4450237577414659, -0.006333096502501456, 0.19120311585529784, 0.06615433002226666, 0.11591726211739369, -0.04059533579427688, 0.03454494645025154, -0.09693712808313917, -0.1534194903234478, 0.14277206938408438, 0.3504142177703439, 0.017974996527076743, 0.15597327302408512, -0.3265656150388913, -0.1372526491244064, 0.19480529853684797, 0.080560314469278, 0.03615897711458021, -0.007007411593327024, -0.2461772246103062, 0.08284104313151758, -0.1587574921975859, -0.21678610808658796, -0.07634363024205458, 0.051076039893277844, 0.040302543274936126, -0.1545680359379984, -0.10626546614879712, 0.13470174366089163, 0.19654788006646712, -0.028410953286363453, -0.13428869630691032, -0.10518164602948017, 0.04958140052335917, 0.046066170917121604, 0.0672239186089547, 0.10265007289889895, -0.08442813906146855, -0.11018684857570735, 0.4123098726888172, -0.032619496963948745, -0.16144579868824754, 0.09049296687494536, -0.168777651000829, -0.24868737588651846, 0.14731037433518737, 0.07041912967125412, 0.19119226517247373, 0.04731649512302925, 0.1565460732367012, -0.2041679891284372, 0.10046028133603882, 0.14522227122769005, -0.03132546458347533, 0.18168687209731244, 0.1304589132472995, 0.06796594942036299, 0.07994032295928413, -0.00390925712608656, 0.028141610545762738, -0.40035354187254046, -0.2123240503314577, -0.019976003171845537, 0.23430711620670483, -0.12723382177655815, -0.12625914730024754, 0.4101585318319133, 0.00935692291279308, 0.17716732709744915, 0.043187145082677, 0.22149919339867888, -0.013644862691032105, 0.053669257120030824, -0.055400456840050266, 0.12499882226865204, 0.25060671500739506, -0.06521884994734017, -0.14774997002582568, 0.007468839259970872, 0.20054138891521048] |
1,802.08552 | Hadron Spectroscopy and Dynamics from Light-Front Holography and
Superconformal Algebra | QCD is not supersymmetrical in the traditional sense -- the QCD Lagrangian is
based on quark and gluonic fields, not squarks nor gluinos. However, its
hadronic eigensolutions conform to a representation of superconformal algebra,
reflecting the underlying conformal symmetry of chiral QCD and its Pauli matrix
representation. The eigensolutions of superconformal algebra provide a unified
Regge spectroscopy of meson, baryon, and tetraquarks in the same 4-plet
representation with a universal Regge slope. The pion $q \bar q$ eigenstate has
zero mass for $m_q=0.$ The superconformal relations also can be extended to
heavy-light quark mesons and baryons. The combined approach of light-front
holography and superconformal algebra also provides insight into the origin of
the QCD mass scale and color confinement. A key observation is the remarkable
dAFF principle which shows how a mass scale can appear in the Hamiltonian and
the equations of motion while retaining the conformal symmetry of the action.
When one applies the dAFF procedure to chiral QCD, a mass scale $\kappa$
appears which determines universal Regge slopes, hadron masses in the absence
of the Higgs coupling, and the mass parameter underlying the form of the
nonperturbative QCD running coupling: $\alpha_s(Q^2) \propto \exp{-{Q^2/4
\kappa^2}}$, in agreement with the effective charge determined from
measurements of the Bjorken sum rule. The mass scale $\kappa$ underlying hadron
masses can be connected to the parameter $\Lambda_{\overline {MS}}$ in the QCD
running coupling by matching its predicted nonperturbative form to the
perturbative QCD regime. One also obtains predictions for spacelike and
timelike hadronic form factors, structure functions, distribution amplitudes,
and transverse momentum distributions.
| hep-ph hep-th | qcd is not supersymmetrical in the traditional sense the qcd lagrangian is based on quark and gluonic fields not squarks nor gluinos however its hadronic eigensolutions conform to a representation of superconformal algebra reflecting the underlying conformal symmetry of chiral qcd and its pauli matrix representation the eigensolutions of superconformal algebra provide a unified regge spectroscopy of meson baryon and tetraquarks in the same 4plet representation with a universal regge slope the pion q bar q eigenstate has zero mass for m_q0 the superconformal relations also can be extended to heavylight quark mesons and baryons the combined approach of lightfront holography and superconformal algebra also provides insight into the origin of the qcd mass scale and color confinement a key observation is the remarkable daff principle which shows how a mass scale can appear in the hamiltonian and the equations of motion while retaining the conformal symmetry of the action when one applies the daff procedure to chiral qcd a mass scale kappa appears which determines universal regge slopes hadron masses in the absence of the higgs coupling and the mass parameter underlying the form of the nonperturbative qcd running coupling alpha_sq2 propto expq24 kappa2 in agreement with the effective charge determined from measurements of the bjorken sum rule the mass scale kappa underlying hadron masses can be connected to the parameter lambda_overline ms in the qcd running coupling by matching its predicted nonperturbative form to the perturbative qcd regime one also obtains predictions for spacelike and timelike hadronic form factors structure functions distribution amplitudes and transverse momentum distributions | [['qcd', 'is', 'not', 'supersymmetrical', 'in', 'the', 'traditional', 'sense', 'the', 'qcd', 'lagrangian', 'is', 'based', 'on', 'quark', 'and', 'gluonic', 'fields', 'not', 'squarks', 'nor', 'gluinos', 'however', 'its', 'hadronic', 'eigensolutions', 'conform', 'to', 'a', 'representation', 'of', 'superconformal', 'algebra', 'reflecting', 'the', 'underlying', 'conformal', 'symmetry', 'of', 'chiral', 'qcd', 'and', 'its', 'pauli', 'matrix', 'representation', 'the', 'eigensolutions', 'of', 'superconformal', 'algebra', 'provide', 'a', 'unified', 'regge', 'spectroscopy', 'of', 'meson', 'baryon', 'and', 'tetraquarks', 'in', 'the', 'same', '4plet', 'representation', 'with', 'a', 'universal', 'regge', 'slope', 'the', 'pion', 'q', 'bar', 'q', 'eigenstate', 'has', 'zero', 'mass', 'for', 'm_q0', 'the', 'superconformal', 'relations', 'also', 'can', 'be', 'extended', 'to', 'heavylight', 'quark', 'mesons', 'and', 'baryons', 'the', 'combined', 'approach', 'of', 'lightfront', 'holography', 'and', 'superconformal', 'algebra', 'also', 'provides', 'insight', 'into', 'the', 'origin', 'of', 'the', 'qcd', 'mass', 'scale', 'and', 'color', 'confinement', 'a', 'key', 'observation', 'is', 'the', 'remarkable', 'daff', 'principle', 'which', 'shows', 'how', 'a', 'mass', 'scale', 'can', 'appear', 'in', 'the', 'hamiltonian', 'and', 'the', 'equations', 'of', 'motion', 'while', 'retaining', 'the', 'conformal', 'symmetry', 'of', 'the', 'action', 'when', 'one', 'applies', 'the', 'daff', 'procedure', 'to', 'chiral', 'qcd', 'a', 'mass', 'scale', 'kappa', 'appears', 'which', 'determines', 'universal', 'regge', 'slopes', 'hadron', 'masses', 'in', 'the', 'absence', 'of', 'the', 'higgs', 'coupling', 'and', 'the', 'mass', 'parameter', 'underlying', 'the', 'form', 'of', 'the', 'nonperturbative', 'qcd', 'running', 'coupling', 'alpha_sq2', 'propto', 'expq24', 'kappa2', 'in', 'agreement', 'with', 'the', 'effective', 'charge', 'determined', 'from', 'measurements', 'of', 'the', 'bjorken', 'sum', 'rule', 'the', 'mass', 'scale', 'kappa', 'underlying', 'hadron', 'masses', 'can', 'be', 'connected', 'to', 'the', 'parameter', 'lambda_overline', 'ms', 'in', 'the', 'qcd', 'running', 'coupling', 'by', 'matching', 'its', 'predicted', 'nonperturbative', 'form', 'to', 'the', 'perturbative', 'qcd', 'regime', 'one', 'also', 'obtains', 'predictions', 'for', 'spacelike', 'and', 'timelike', 'hadronic', 'form', 'factors', 'structure', 'functions', 'distribution', 'amplitudes', 'and', 'transverse', 'momentum', 'distributions']] | [-0.11583152798448282, 0.25436286906551686, -0.1633403300329519, 0.12024293281820064, -0.12391054234285548, -0.11613019884043752, 0.02628822812175713, 0.3135728272754932, -0.18091868245574005, -0.21812847201363184, -0.016049533683144546, -0.2638349003937037, -0.03092407418989751, 0.0653227416696609, 0.047819766299653566, 0.11325196064512966, 0.02102507845575019, 0.0694035092338936, -0.11909627033583092, -0.16950319568695704, 0.3346810683392505, -0.018658910086742253, 0.23321108291474957, 0.14897662537623546, 0.07938258818649047, 0.015494806341393996, -0.006628776229263167, -0.05233762639727502, -0.10330057284227223, 0.06274007661431824, 0.21987679886228761, 0.027318807420215308, 0.10291998347611298, -0.3379666392793297, -0.147667363349683, 0.07442404762332444, 0.20486521442126104, 0.09697966696694493, 0.012091074616819242, -0.2680580595520041, 0.0672238856113836, -0.19205939059247612, -0.19839409991254797, -0.12418915712879652, -0.019875874545505212, -0.11418976379604828, -0.321488188045123, 0.11728324531577528, -0.025615381449370034, 0.012927533198308083, -0.02879984916353351, -0.16974070502146787, -0.08734584869398532, 0.05151665810137729, 0.11595215132911108, 0.11629970342801244, 0.16844979637926372, -0.22689614885985065, -0.13625343962530678, 0.44654734891173575, -0.030918453617232444, -0.19620367947061368, 0.0918913452196648, -0.19558583176149114, -0.15158763593535696, 0.10520363713931147, 0.14283163255095133, 0.07607620285762096, -0.14843446814080608, 0.19725272705954922, -0.047782215557163, 0.1734412810037611, 0.09085398255137989, 0.08060552850926683, 0.254992245346898, 0.14880973692834232, -0.03881465865015343, 0.02844409890622046, -0.008602910329500446, -0.13458609984445502, -0.40158685706410324, -0.08634559700885802, -0.15878950220485422, 0.09811932258264733, -0.19293655467060944, -0.1327510660448752, 0.3894042543379328, 0.09289914821363254, 0.24043555215939705, 0.0785498844452377, 0.2805713569650834, 0.13401841666154723, 0.141662854459355, 0.08944436515412235, 0.2831246761688817, 0.23177713647692144, 0.12477791358651302, -0.3097073584331156, -0.07484035575294001, 0.16674627980864898] |
1,802.08553 | Dark Energy Accretion onto Van der Waal's Black Hole | We consider the most general static spherically symmetric black hole metric.
The accretion of the fluid flow around the Van der Waal's black hole is
investigated and we calculate the fluid's four-velocity, the critical point and
the speed of sound during the accretion process. We also analyze the nature of
the universe's density and the mass of the black hole during accretion of the
fluid flow. The density of the fluid flow is also taken into account. We
observe that the mass is related to redshift. We compare the accreting power of
the Van der Waal's black hole with Schwarzschild black hole for different
accreting fluid.
| gr-qc | we consider the most general static spherically symmetric black hole metric the accretion of the fluid flow around the van der waals black hole is investigated and we calculate the fluids fourvelocity the critical point and the speed of sound during the accretion process we also analyze the nature of the universes density and the mass of the black hole during accretion of the fluid flow the density of the fluid flow is also taken into account we observe that the mass is related to redshift we compare the accreting power of the van der waals black hole with schwarzschild black hole for different accreting fluid | [['we', 'consider', 'the', 'most', 'general', 'static', 'spherically', 'symmetric', 'black', 'hole', 'metric', 'the', 'accretion', 'of', 'the', 'fluid', 'flow', 'around', 'the', 'van', 'der', 'waals', 'black', 'hole', 'is', 'investigated', 'and', 'we', 'calculate', 'the', 'fluids', 'fourvelocity', 'the', 'critical', 'point', 'and', 'the', 'speed', 'of', 'sound', 'during', 'the', 'accretion', 'process', 'we', 'also', 'analyze', 'the', 'nature', 'of', 'the', 'universes', 'density', 'and', 'the', 'mass', 'of', 'the', 'black', 'hole', 'during', 'accretion', 'of', 'the', 'fluid', 'flow', 'the', 'density', 'of', 'the', 'fluid', 'flow', 'is', 'also', 'taken', 'into', 'account', 'we', 'observe', 'that', 'the', 'mass', 'is', 'related', 'to', 'redshift', 'we', 'compare', 'the', 'accreting', 'power', 'of', 'the', 'van', 'der', 'waals', 'black', 'hole', 'with', 'schwarzschild', 'black', 'hole', 'for', 'different', 'accreting', 'fluid']] | [-0.15979479327095006, 0.10096046574334702, -0.08273214422921948, 0.083408730132657, -0.058870314523788554, -0.11967024076202849, -0.029401641147966794, 0.27441864353516754, -0.17928073496913607, -0.27465439761795524, 0.034201446424220815, -0.34528935124289317, -0.061745935396449465, 0.18538724084578032, -0.02283105528298414, 0.061025711678117864, -0.04027303319670401, -0.0023348295867864815, -0.10134303085338478, -0.22072563362351777, 0.43531856611854275, 0.09401469804205985, 0.21370097499270485, 0.03279961542147299, 0.11059336062028723, -0.009298301644552991, 0.008194676336814772, 0.07984946645743582, -0.2863247623991244, 0.023602389546005794, 0.19506506554624242, 0.06453731482989102, 0.22692790851084832, -0.42702188088013876, -0.2456203403988115, 0.021814369763476105, 0.11098594326670896, 0.1705308990061002, -0.10685826343361218, -0.23761379024681617, 0.060264971153371316, -0.29642711775728836, -0.10054543199685384, 0.004591452643134684, 0.06886473802392776, 0.03613822336993971, -0.1467972094772981, 0.19863160657817233, 0.10056499419909604, -0.12918489754094548, -0.19095400391137754, -0.004362180129457968, -0.09498887337230251, 0.1004081674113448, 0.13151757702432387, -0.012427159580665658, 0.26689928435975296, -0.14421335170331043, -0.0005321578201749977, 0.4197431345522966, -0.06043618147806177, -0.0994547033190446, 0.1955999900709908, -0.24036797180877262, -0.0428155062210588, 0.09762964698811115, 0.1941964310585117, 0.15298966469489178, -0.12828867389592077, 0.09138151666617354, 0.011810222493467044, 0.1820585452471003, 0.15158673282712698, -0.03425973183464452, 0.4245171263497674, 0.11454185579885852, -0.0070135054301540805, 0.16757242026615818, -0.11733676295920785, -0.10733264359592828, -0.23843116582951174, -0.19794086985210976, -0.18145963741589408, 0.10683118087845801, -0.21795373006665064, -0.22161826083243316, 0.32727435041429864, 0.10001259948179689, 0.1662831071210709, -0.01666634116005504, 0.2677182632296364, 0.1022600430011187, -0.04867226927418192, 0.18778989821197992, 0.3827348223729235, 0.14825074947526995, 0.17335993546623527, -0.2876390243033694, -0.03437815352896545, 0.12398820330459133] |
1,802.08554 | Semantic Vector Spaces for Broadening Consideration of Consequences | Reasoning systems with too simple a model of the world and human intent are
unable to consider potential negative side effects of their actions and modify
their plans to avoid them (e.g., avoiding potential errors). However,
hand-encoding the enormous and subtle body of facts that constitutes common
sense into a knowledge base has proved too difficult despite decades of work.
Distributed semantic vector spaces learned from large text corpora, on the
other hand, can learn representations that capture shades of meaning of
common-sense concepts and perform analogical and associational reasoning in
ways that knowledge bases are too rigid to perform, by encoding concepts and
the relations between them as geometric structures. These have, however, the
disadvantage of being unreliable, poorly understood, and biased in their view
of the world by the source material. This chapter will discuss how these
approaches may be combined in a way that combines the best properties of each
for understanding the world and human intentions in a richer way.
| cs.AI | reasoning systems with too simple a model of the world and human intent are unable to consider potential negative side effects of their actions and modify their plans to avoid them eg avoiding potential errors however handencoding the enormous and subtle body of facts that constitutes common sense into a knowledge base has proved too difficult despite decades of work distributed semantic vector spaces learned from large text corpora on the other hand can learn representations that capture shades of meaning of commonsense concepts and perform analogical and associational reasoning in ways that knowledge bases are too rigid to perform by encoding concepts and the relations between them as geometric structures these have however the disadvantage of being unreliable poorly understood and biased in their view of the world by the source material this chapter will discuss how these approaches may be combined in a way that combines the best properties of each for understanding the world and human intentions in a richer way | [['reasoning', 'systems', 'with', 'too', 'simple', 'a', 'model', 'of', 'the', 'world', 'and', 'human', 'intent', 'are', 'unable', 'to', 'consider', 'potential', 'negative', 'side', 'effects', 'of', 'their', 'actions', 'and', 'modify', 'their', 'plans', 'to', 'avoid', 'them', 'eg', 'avoiding', 'potential', 'errors', 'however', 'handencoding', 'the', 'enormous', 'and', 'subtle', 'body', 'of', 'facts', 'that', 'constitutes', 'common', 'sense', 'into', 'a', 'knowledge', 'base', 'has', 'proved', 'too', 'difficult', 'despite', 'decades', 'of', 'work', 'distributed', 'semantic', 'vector', 'spaces', 'learned', 'from', 'large', 'text', 'corpora', 'on', 'the', 'other', 'hand', 'can', 'learn', 'representations', 'that', 'capture', 'shades', 'of', 'meaning', 'of', 'commonsense', 'concepts', 'and', 'perform', 'analogical', 'and', 'associational', 'reasoning', 'in', 'ways', 'that', 'knowledge', 'bases', 'are', 'too', 'rigid', 'to', 'perform', 'by', 'encoding', 'concepts', 'and', 'the', 'relations', 'between', 'them', 'as', 'geometric', 'structures', 'these', 'have', 'however', 'the', 'disadvantage', 'of', 'being', 'unreliable', 'poorly', 'understood', 'and', 'biased', 'in', 'their', 'view', 'of', 'the', 'world', 'by', 'the', 'source', 'material', 'this', 'chapter', 'will', 'discuss', 'how', 'these', 'approaches', 'may', 'be', 'combined', 'in', 'a', 'way', 'that', 'combines', 'the', 'best', 'properties', 'of', 'each', 'for', 'understanding', 'the', 'world', 'and', 'human', 'intentions', 'in', 'a', 'richer', 'way']] | [-0.059282241501999684, 0.07434059477816879, -0.09292803159086434, 0.11746729170100798, -0.17869900035574757, -0.14474450550013523, 0.07032316369775889, 0.42133403112369083, -0.27766163967995466, -0.3536882668015286, 0.08363283055611641, -0.2684257281515633, -0.18773407621617696, 0.1787249798457241, -0.13966715726087248, 0.017584000816968686, 0.08598577296875555, 0.061058406032439026, -0.06229325277056614, -0.23292063938902313, 0.34308693379230165, 0.030167978005540882, 0.2635274386187684, 0.012796165933689685, 0.0973457047984324, -0.023642498397045523, -0.08549789802786933, 0.013589126370030175, -0.05466842540415529, 0.21157668510943287, 0.3392921340897497, 0.1940851796566983, 0.30865911395357565, -0.47386636286174044, -0.20922353106088068, 0.08295309662881759, 0.14540405204100748, 0.09853719749082268, -0.0022321835658770123, -0.3124312878432084, 0.07873450872556884, -0.15339610015150684, -0.08610932499547404, -0.14689347254786572, 0.03697605618487106, 0.0021431002536634316, -0.17615915592931256, 0.01820550433022936, 0.13579302755658704, 0.07050570773112193, -0.023804222085038945, -0.10349126516675657, 0.006734910619622268, 0.2233274756170855, 0.07296272805189154, 0.009250080281514332, 0.1455830424414102, -0.18562633267952347, -0.15224714264876432, 0.41952205413918187, 0.012207834350025178, -0.21863701618905038, 0.23749265471256217, -0.09242440756707469, -0.11223861887662506, 0.06925381381104649, 0.18033813964361267, 0.09576819506845226, -0.1758516070167277, 0.061646760434220814, -0.010156361506166268, 0.17287374902916558, 0.06729478628140377, 0.05872917843502632, 0.26475161629117616, 0.15481730918200012, 0.008902116097292743, 0.06684578528043535, -0.02247219576044694, -0.10769414245343818, -0.23773817947717166, -0.1056752041595748, -0.14355215197786164, 0.010654989969231005, -0.06120002549070225, -0.13309492420041263, 0.33383747792530105, 0.22788211858497098, 0.21962093870424054, 0.05604010350585121, 0.3259154897228889, -0.011031905152732106, 0.0981081329326094, 0.031849094712249705, 0.19645275706939536, 0.0685386824681555, 0.12745689606705418, -0.12717875762716896, 0.13780402965226604, -0.006025088679593948] |
1,802.08555 | Phase Transition In $SU(N)\times U(1)$ Gauge Theory With Many
Fundamental Bosons | Here we study the Renormalization group flow of $SU(N)\times U(1)$ gauge
theory with $M$-fundamental bosons in $4-\epsilon$ dimension by calculating the
beta functions. We found a new stable fixed point in the zero mass plane for
$M>M_\text{crit}$ by expanding upto $O(\epsilon)$. This indicates a second
order phase transition. We also calculated the critical exponents in both
$\epsilon$ expansion and also in the large-$M$ expansion.
| cond-mat.stat-mech hep-th | here we study the renormalization group flow of suntimes u1 gauge theory with mfundamental bosons in 4epsilon dimension by calculating the beta functions we found a new stable fixed point in the zero mass plane for mm_textcrit by expanding upto oepsilon this indicates a second order phase transition we also calculated the critical exponents in both epsilon expansion and also in the largem expansion | [['here', 'we', 'study', 'the', 'renormalization', 'group', 'flow', 'of', 'suntimes', 'u1', 'gauge', 'theory', 'with', 'mfundamental', 'bosons', 'in', '4epsilon', 'dimension', 'by', 'calculating', 'the', 'beta', 'functions', 'we', 'found', 'a', 'new', 'stable', 'fixed', 'point', 'in', 'the', 'zero', 'mass', 'plane', 'for', 'mm_textcrit', 'by', 'expanding', 'upto', 'oepsilon', 'this', 'indicates', 'a', 'second', 'order', 'phase', 'transition', 'we', 'also', 'calculated', 'the', 'critical', 'exponents', 'in', 'both', 'epsilon', 'expansion', 'and', 'also', 'in', 'the', 'largem', 'expansion']] | [-0.17783679439866495, 0.22796711525053628, -0.07835699026022226, 0.0480982351713934, 0.027917971688082382, -0.10317111118215948, 0.08610482919668298, 0.3346621837380582, -0.21055574468787638, -0.20558596838025317, 0.07495766684352871, -0.29071457077178264, -0.15970295463358203, 0.09901363760112755, 0.05540925328199181, 0.05832031378973155, -0.07758004506749491, 0.06748712998664667, -0.15069846765348507, -0.22690630832596892, 0.33277744803607706, 0.005204593943011376, 0.23006649765246098, 0.06333084884400089, 0.05158936772345295, -0.019654791809678558, -0.004639155043649578, 0.026240085709779974, -0.22032531383897988, 0.045348339684067235, 0.20052107503908057, -0.02510946818942865, 0.2020644100698372, -0.311537285110042, -0.19349136232067982, 0.08655635949089041, 0.2026590724295426, 0.09110281956236577, -0.0689606893236839, -0.2554306591740779, 0.09307208125603446, -0.19717570766806602, -0.21608627606521272, -0.1079553386286622, 0.013712255291700844, -0.06371718688282155, -0.2884522479538235, 0.10657398253885819, -0.014955677798077945, 0.07897279653397779, -0.061357015225615714, -0.07157942027721044, -0.012250476704549885, 0.08676492240873256, 0.09935483876465549, 0.09168843150274048, 0.08415003187744127, -0.16383169382254803, -0.08798591135400197, 0.3867225633077924, -0.1406446099675621, -0.17419350351537427, 0.1087931304890287, -0.2467649332069296, -0.18280013021261943, 0.1463054819633403, 0.1385248323091336, 0.13877857583875378, -0.10078370257190639, 0.17740519947068195, 0.003878638403670442, 0.1580662016832878, 0.07313118978673892, -0.046780575562508836, 0.13338144096515833, 0.08072189188321992, 0.05751629462165217, 0.13847009466600516, -0.03648944607665462, -0.14048978464016992, -0.3881665342938035, -0.16014203424715706, -0.1578399539237932, 0.05837076282008521, -0.20435939524900132, -0.15813754857405118, 0.36892603231113286, 0.14975260704335186, 0.20725746628557962, 0.05505472558340238, 0.22780903189202711, 0.17502127008159615, 0.04629059101364786, 0.11900729936878046, 0.25569649993051446, 0.12600704899147874, 0.05500500370568085, -0.23855596564892273, -0.0687357455326785, 0.1970499062144588] |
1,802.08556 | Complexity of finding near-stationary points of convex functions
stochastically | In a recent paper, we showed that the stochastic subgradient method applied
to a weakly convex problem, drives the gradient of the Moreau envelope to zero
at the rate $O(k^{-1/4})$. In this supplementary note, we present a stochastic
subgradient method for minimizing a convex function, with the improved rate
$\widetilde O(k^{-1/2})$.
| math.OC | in a recent paper we showed that the stochastic subgradient method applied to a weakly convex problem drives the gradient of the moreau envelope to zero at the rate ok14 in this supplementary note we present a stochastic subgradient method for minimizing a convex function with the improved rate widetilde ok12 | [['in', 'a', 'recent', 'paper', 'we', 'showed', 'that', 'the', 'stochastic', 'subgradient', 'method', 'applied', 'to', 'a', 'weakly', 'convex', 'problem', 'drives', 'the', 'gradient', 'of', 'the', 'moreau', 'envelope', 'to', 'zero', 'at', 'the', 'rate', 'ok14', 'in', 'this', 'supplementary', 'note', 'we', 'present', 'a', 'stochastic', 'subgradient', 'method', 'for', 'minimizing', 'a', 'convex', 'function', 'with', 'the', 'improved', 'rate', 'widetilde', 'ok12']] | [-0.12167036832839835, -0.0016532386584645685, -0.10821226761475497, 0.028862727995432328, -0.056984239330917015, -0.10472184852423037, 0.09080225996006572, 0.3871869753096618, -0.36240484536278483, -0.18684473743333535, 0.11418438859411753, -0.2197941255700939, -0.18455310604151556, 0.19191820930470438, -0.1420000054617869, 0.08736378995372969, 0.08227656365317457, 0.005742299498296252, -0.13510357525984884, -0.2892137082549287, 0.26908669598838864, 0.028006142425332583, 0.20852645822599822, 0.06587266515684771, 0.1821080499748681, -0.007990013689314034, 0.016350953127531445, 0.018018006146246313, -0.14510245304443423, 0.14370127715964748, 0.23180864572378934, 0.16863006364335031, 0.3971119825454319, -0.392196251955979, -0.1789220090540053, 0.15139656107617067, 0.13677418166109562, 0.10679919539275122, -0.11269306292182163, -0.19323453531764886, 0.08792986206746861, -0.13773322005884028, -0.11554961728260797, -0.0034425081685185432, -0.05927871268553039, 0.06136769569460668, -0.3464843360889776, 0.11905180195382997, 0.08040328964810162, 0.009071551518989545, -0.07483215723186731, -0.14540353309655307, 0.05027808586829433, -0.024139825583380813, 0.07975738477327075, 0.19013054135675525, 0.1221493202279888, -0.05119429376688512, -0.046936289452965935, 0.270251978900941, -0.17797528605396842, -0.25467601999202194, 0.1693374133833191, -0.09885984695717401, -0.16109238354963998, 0.13561056270811925, 0.23341358746128046, 0.25894637909882207, -0.186570016922904, 0.08553015228872206, -0.03983594458002378, 0.10552027438055067, -0.0036121360848055165, -0.0336919896596787, 0.09085300855119438, 0.15259308742322758, 0.20985296474514054, 0.20790811043743992, -0.048259561406631096, -0.10436567622659199, -0.2902832023945509, -0.14416070149152302, -0.17423875291156127, 0.01294631821413835, -0.07289492272242319, -0.15442497252176204, 0.3737189349736653, 0.11662604858843136, 0.19542837047985956, 0.15064220024528457, 0.3125036381477234, 0.14674219447096773, -0.0007500853024277033, 0.1370322380178407, 0.23260153136124798, 0.13170102131370381, 0.1237805771696217, -0.2805124183788019, 0.06164188068770968, 0.17395764669659092] |
1,802.08557 | Simultaneous Solving of Batched Linear Programs on a GPU | Linear Programs (LPs) appear in a large number of applications and offloading
them to a GPU is viable to gain performance. Existing work on offloading and
solving an LP on a GPU suggests that there is performance gain generally on
large sized LPs (typically 500 constraints, 500 variables and above). In order
to gain performance from a GPU, for applications involving small to medium
sized LPs, we propose batched solving of a large number of LPs in parallel. In
this paper, we present the design and implementation of a batched LP solver in
CUDA, keeping memory coalescent access, low CPU-GPU memory transfer latency and
load balancing as the goals. The performance of the batched LP solver is
compared against sequential solving in the CPU using the open source solver
GLPK (GNU Linear Programming Kit) and the CPLEX solver from IBM. The evaluation
on selected LP benchmarks from the Netlib repository displays a maximum
speed-up of 95x and 5x with respect to CPLEX and GLPK solver respectively, for
a batch of 1e5 LPs. We demonstrate the application of our batched LP solver to
enhance performance in the domain of state-space exploration of mathematical
models of control systems design.
| cs.DC | linear programs lps appear in a large number of applications and offloading them to a gpu is viable to gain performance existing work on offloading and solving an lp on a gpu suggests that there is performance gain generally on large sized lps typically 500 constraints 500 variables and above in order to gain performance from a gpu for applications involving small to medium sized lps we propose batched solving of a large number of lps in parallel in this paper we present the design and implementation of a batched lp solver in cuda keeping memory coalescent access low cpugpu memory transfer latency and load balancing as the goals the performance of the batched lp solver is compared against sequential solving in the cpu using the open source solver glpk gnu linear programming kit and the cplex solver from ibm the evaluation on selected lp benchmarks from the netlib repository displays a maximum speedup of 95x and 5x with respect to cplex and glpk solver respectively for a batch of 1e5 lps we demonstrate the application of our batched lp solver to enhance performance in the domain of statespace exploration of mathematical models of control systems design | [['linear', 'programs', 'lps', 'appear', 'in', 'a', 'large', 'number', 'of', 'applications', 'and', 'offloading', 'them', 'to', 'a', 'gpu', 'is', 'viable', 'to', 'gain', 'performance', 'existing', 'work', 'on', 'offloading', 'and', 'solving', 'an', 'lp', 'on', 'a', 'gpu', 'suggests', 'that', 'there', 'is', 'performance', 'gain', 'generally', 'on', 'large', 'sized', 'lps', 'typically', '500', 'constraints', '500', 'variables', 'and', 'above', 'in', 'order', 'to', 'gain', 'performance', 'from', 'a', 'gpu', 'for', 'applications', 'involving', 'small', 'to', 'medium', 'sized', 'lps', 'we', 'propose', 'batched', 'solving', 'of', 'a', 'large', 'number', 'of', 'lps', 'in', 'parallel', 'in', 'this', 'paper', 'we', 'present', 'the', 'design', 'and', 'implementation', 'of', 'a', 'batched', 'lp', 'solver', 'in', 'cuda', 'keeping', 'memory', 'coalescent', 'access', 'low', 'cpugpu', 'memory', 'transfer', 'latency', 'and', 'load', 'balancing', 'as', 'the', 'goals', 'the', 'performance', 'of', 'the', 'batched', 'lp', 'solver', 'is', 'compared', 'against', 'sequential', 'solving', 'in', 'the', 'cpu', 'using', 'the', 'open', 'source', 'solver', 'glpk', 'gnu', 'linear', 'programming', 'kit', 'and', 'the', 'cplex', 'solver', 'from', 'ibm', 'the', 'evaluation', 'on', 'selected', 'lp', 'benchmarks', 'from', 'the', 'netlib', 'repository', 'displays', 'a', 'maximum', 'speedup', 'of', '95x', 'and', '5x', 'with', 'respect', 'to', 'cplex', 'and', 'glpk', 'solver', 'respectively', 'for', 'a', 'batch', 'of', '1e5', 'lps', 'we', 'demonstrate', 'the', 'application', 'of', 'our', 'batched', 'lp', 'solver', 'to', 'enhance', 'performance', 'in', 'the', 'domain', 'of', 'statespace', 'exploration', 'of', 'mathematical', 'models', 'of', 'control', 'systems', 'design']] | [-0.12625894814772237, -0.047114469730197735, -0.05195991104932001, 0.027048576317094078, -0.11307601115032842, -0.18007326556303477, 0.09340791821628715, 0.4094510986020571, -0.2993921788130428, -0.3978846179227449, 0.1502785114482811, -0.258925733936544, -0.05775138043661408, 0.2664162964692462, -0.06347912424220349, 0.12023903536823044, 0.1338287810109518, -0.04413875155292716, -0.11170733488060837, -0.3123540001718072, 0.19476982414944635, 0.0851029160238689, 0.2447234084451486, 0.0357284593752817, 0.08513948880372389, -0.035050519205497455, 0.026956203093440247, 0.0032203730815066603, -0.024300847360505286, 0.1290738896495157, 0.29120028299258605, 0.18481267397741075, 0.33209815483332283, -0.44366537592359606, -0.10459306274261798, 0.007928473208345435, 0.10534432915046452, 0.04001992073874486, -0.07462840834407958, -0.21428212703815497, 0.11928908771783264, -0.167264880787411, -0.007552405204718488, -0.06251403288431182, -0.03288375337367055, 0.03508602707767339, -0.3155864949342866, -0.00020668735233641367, 0.03245688768500831, 0.016802494324327726, -0.04675528228632765, -0.2055885005307379, 0.07743301344113566, 0.03184812418291544, -0.006183430111640828, 0.05254462297691439, 0.13058898929709825, -0.12950593567226404, -0.17361484307720124, 0.4121473949534941, -0.06662235502449106, -0.19472242903725484, 0.197084014037468, -0.004941983919042318, -0.11699054970850384, 0.12655133232096125, 0.30260596461215905, 0.1459508970625661, -0.1338208388811365, 0.10670224491044109, -0.006267246454575945, 0.2277986423300371, 0.06355358738461651, 0.013377463697990033, 0.11812835712361665, 0.2817219708488337, 0.09948354583767806, 0.20084876817802375, -0.05157867579990974, -0.1471742301857865, -0.2062645937164839, -0.17016032074346457, -0.17638296453367333, -0.010966151383372147, -0.13150601258896158, -0.15634068692112482, 0.3606102212195091, 0.20003408580536242, 0.09146974074564458, 0.1547009975325581, 0.36557002039389863, 0.0857649589345086, 0.15424690249040346, 0.20192512040863259, 0.1241277762792702, 0.04802761261521597, 0.1621326141314685, -0.25890848852887866, 0.01690051987085274, 0.01847034116478892] |
1,802.08558 | Moore: Interval Arithmetic in C++20 | This article presents the Moore library for interval arithmetic in C++20. It
gives examples of how the library can be used, and explains the basic
principles underlying its design.
| cs.MS cs.NA | this article presents the moore library for interval arithmetic in c20 it gives examples of how the library can be used and explains the basic principles underlying its design | [['this', 'article', 'presents', 'the', 'moore', 'library', 'for', 'interval', 'arithmetic', 'in', 'c20', 'it', 'gives', 'examples', 'of', 'how', 'the', 'library', 'can', 'be', 'used', 'and', 'explains', 'the', 'basic', 'principles', 'underlying', 'its', 'design']] | [-0.07298033340866196, 0.03834461969933633, -0.1384463387718103, 0.10920475594747554, -0.12191784067143654, -0.12797198654955316, 0.04027198701454648, 0.37073725500497323, -0.32567039979942913, -0.32842010542236527, 0.09806422986780647, -0.18102923382459016, -0.2226677106629158, 0.2548837503739472, -0.13921890703254733, 0.025702010533081944, 0.03562979329505871, 0.022342555995645195, -0.005225935758187853, -0.2483417528906259, 0.27302501517637023, 0.08806374502079241, 0.21240923853173596, 0.08925122880087845, 0.06755828847787504, 0.0005282755812694287, -0.03308727068762327, -0.03952350091702979, -0.17863809108605672, 0.21071300501453466, 0.3076025427415453, 0.24606758336825618, 0.23588839064127412, -0.40911965496067343, -0.14107347639470263, 0.03272833851776246, 0.11200157562591906, 0.0882444547134018, -0.010378788931873339, -0.16946220073592047, 0.10305868339692724, -0.1754613195963461, -0.17787289320780286, -0.10786435897622643, -0.010035005430209226, 0.03975125318714257, -0.15958898993016318, -0.035193179477134656, 0.10452932568973508, 0.09961803912602622, 0.022089983308527232, -0.14924899572185402, 0.04465314148571985, 0.15279937798863855, -0.018601409577090163, 0.02556718270904545, 0.11624654090224669, 0.02382710714551524, -0.11415873352309754, 0.42362830119914024, -0.01155150264244655, -0.16232373868516678, 0.13979930186579967, -0.0518811472434679, -0.157752836187338, 0.07021011065306335, 0.14622869525618595, 0.0611398928509704, -0.12186001144863408, 0.20489582056300074, -0.03807179006780016, 0.1664031240446814, 0.015517044226349941, -0.01821601131513458, 0.15555943934054212, 0.1873689575024463, -0.03782342849620458, 0.18173099479011806, -0.005056045788886218, -0.09577068940190406, -0.3779002710663039, -0.18562440635186844, -0.15630581287731385, 0.027441632387966944, -0.03409848615862349, -0.18732605283630305, 0.4929811116950265, 0.16364752082154155, 0.10053858759909354, 0.06424274501101725, 0.26774230381024294, 0.09053025441244245, 0.04789026047841742, 0.09358080181068387, 0.16097742781556887, 0.1613249236653591, 0.16062757931649685, -0.13680690260411338, 0.09603023337971034, 0.09392164200985932] |
1,802.08559 | Profinite commensurability of S-arithmetic groups | Given an S-arithmetic group, we ask how much information on the ambient
algebraic group, number field of definition, and set of places S is encoded in
the commensurability class of the profinite completion. As a first step, we
show that the profinite commensurability class of a higher rank S-arithmetic
group determines the number field up to arithmetical equivalence and the places
in S above unramified primes. We include applications to profiniteness
questions of group invariants.
| math.GR math.NT | given an sarithmetic group we ask how much information on the ambient algebraic group number field of definition and set of places s is encoded in the commensurability class of the profinite completion as a first step we show that the profinite commensurability class of a higher rank sarithmetic group determines the number field up to arithmetical equivalence and the places in s above unramified primes we include applications to profiniteness questions of group invariants | [['given', 'an', 'sarithmetic', 'group', 'we', 'ask', 'how', 'much', 'information', 'on', 'the', 'ambient', 'algebraic', 'group', 'number', 'field', 'of', 'definition', 'and', 'set', 'of', 'places', 's', 'is', 'encoded', 'in', 'the', 'commensurability', 'class', 'of', 'the', 'profinite', 'completion', 'as', 'a', 'first', 'step', 'we', 'show', 'that', 'the', 'profinite', 'commensurability', 'class', 'of', 'a', 'higher', 'rank', 'sarithmetic', 'group', 'determines', 'the', 'number', 'field', 'up', 'to', 'arithmetical', 'equivalence', 'and', 'the', 'places', 'in', 's', 'above', 'unramified', 'primes', 'we', 'include', 'applications', 'to', 'profiniteness', 'questions', 'of', 'group', 'invariants']] | [-0.23334561206400395, 0.10670047646563034, -0.09817940559238196, 0.08517170216422527, -0.13878562688206633, -0.09162935302903255, 0.07619757653524478, 0.32339564939339954, -0.34253783702850343, -0.3121061211824417, 0.08648107372534772, -0.2363470821082592, -0.10750389539947112, 0.2273039560392499, -0.15201364893466235, -0.03903823429097732, -0.009801730662584305, 0.18737196893741687, -0.0794726180129995, -0.33555346347391607, 0.39667351335287093, -0.04137225444118182, 0.21608847742279372, 0.04619525209690134, 0.08174763921648263, 0.010222190537800392, -0.0078082875410715735, 0.008959442625443141, -0.13954410873712428, 0.11608440688500801, 0.3294960627052933, 0.10381157231206695, 0.2525205738035341, -0.3687358340869347, -0.15566789266342917, 0.1881907734150688, 0.08419742453843355, 0.02349621566788604, -0.016385285651000836, -0.2702227402975162, 0.13159168839454652, -0.18185694554820656, -0.11320088831707835, -0.046535322127553326, 0.08869103684245298, -0.03380853955944379, -0.18758999668061732, -0.04017478878299395, 0.08397054186711708, 0.1694294388840596, -0.03554222603638967, -0.09743791114383688, 0.004745083212231597, 0.12587994693468013, 0.043843422677988804, 0.03271720020566136, 0.1608046800705294, -0.12637936644256115, -0.0832770612090826, 0.43690161749720574, -0.059681883736823996, -0.11705859122176965, 0.1693622805799047, -0.19587899271398782, -0.20323780129353206, 0.13141223107775052, 0.1467415602132678, 0.1340990909130778, 0.006837055583794912, 0.17565307389789572, -0.1707520913456877, 0.13976940403381982, 0.07546546721210082, 0.03204943415398399, 0.10573637455701829, 0.09491813464090228, 0.12721699701622127, 0.12852507524192333, 0.04428053244017065, 0.044630582245687646, -0.3784309283395608, -0.19723835694914063, -0.13482284106314182, 0.12258673629413049, -0.07337627725016015, -0.15132518373429776, 0.4504057139158249, 0.1483976456957559, 0.146546265364935, 0.13072904511044423, 0.14645185239613057, 0.054575437574530955, 0.044469593291481334, 0.08316919185842077, 0.06103636886924505, 0.2204672294606765, -0.10402127208188176, -0.15268516388721765, -0.03553332253669699, 0.21774033741404614] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.