id
float64 706
1.8k
| title
stringlengths 1
343
| abstract
stringlengths 6
6.09k
| categories
stringlengths 5
125
| processed_abstract
stringlengths 2
5.96k
| tokenized_abstract
stringlengths 8
8.74k
| centroid
stringlengths 2.1k
2.17k
|
|---|---|---|---|---|---|---|
1,803.04167
|
Methods for Classically Simulating Noisy Networked Quantum Architectures
|
As research on building scalable quantum computers advances, it is important
to be able to certify their correctness. Due to the exponential hardness of
classically simulating quantum computation, straight-forward verification
through classical simulation fails. However, we can classically simulate small
scale quantum computations and hence we are able to test that devices behave as
expected in this domain. This constitutes the first step towards obtaining
confidence in the anticipated quantum-advantage when we extend to scales which
can no longer be simulated.
Realistic devices have restrictions due to their architecture and limitations
due to physical imperfections and noise. Here we extend the usual ideal
simulations by considering those effects. We provide a general methodology for
constructing realistic simulations emulating the physical system which will
both provide a benchmark for realistic devices, and guide experimental research
in the quest for quantum-advantage.
We exemplify our methodology by simulating a networked architecture and
corresponding noise-model; in particular that of the device developed in the
Networked Quantum Information Technologies Hub (NQIT). For our simulations we
use, with suitable modification, the classical simulator of of Bravyi and
Gosset. The specific problems considered belong to the class of Instantaneous
Quantum Polynomial-time (IQP) problems, a class believed to be hard for
classical computing devices, and to be a promising candidate for the first
demonstration of quantum-advantage. We first consider a subclass of IQP,
defined by Bermejo-Vega et al, involving two-dimensional dynamical quantum
simulators, before moving to more general instances of IQP, but which are still
restricted to the architecture of NQIT.
|
quant-ph
|
as research on building scalable quantum computers advances it is important to be able to certify their correctness due to the exponential hardness of classically simulating quantum computation straightforward verification through classical simulation fails however we can classically simulate small scale quantum computations and hence we are able to test that devices behave as expected in this domain this constitutes the first step towards obtaining confidence in the anticipated quantumadvantage when we extend to scales which can no longer be simulated realistic devices have restrictions due to their architecture and limitations due to physical imperfections and noise here we extend the usual ideal simulations by considering those effects we provide a general methodology for constructing realistic simulations emulating the physical system which will both provide a benchmark for realistic devices and guide experimental research in the quest for quantumadvantage we exemplify our methodology by simulating a networked architecture and corresponding noisemodel in particular that of the device developed in the networked quantum information technologies hub nqit for our simulations we use with suitable modification the classical simulator of of bravyi and gosset the specific problems considered belong to the class of instantaneous quantum polynomialtime iqp problems a class believed to be hard for classical computing devices and to be a promising candidate for the first demonstration of quantumadvantage we first consider a subclass of iqp defined by bermejovega et al involving twodimensional dynamical quantum simulators before moving to more general instances of iqp but which are still restricted to the architecture of nqit
|
[['as', 'research', 'on', 'building', 'scalable', 'quantum', 'computers', 'advances', 'it', 'is', 'important', 'to', 'be', 'able', 'to', 'certify', 'their', 'correctness', 'due', 'to', 'the', 'exponential', 'hardness', 'of', 'classically', 'simulating', 'quantum', 'computation', 'straightforward', 'verification', 'through', 'classical', 'simulation', 'fails', 'however', 'we', 'can', 'classically', 'simulate', 'small', 'scale', 'quantum', 'computations', 'and', 'hence', 'we', 'are', 'able', 'to', 'test', 'that', 'devices', 'behave', 'as', 'expected', 'in', 'this', 'domain', 'this', 'constitutes', 'the', 'first', 'step', 'towards', 'obtaining', 'confidence', 'in', 'the', 'anticipated', 'quantumadvantage', 'when', 'we', 'extend', 'to', 'scales', 'which', 'can', 'no', 'longer', 'be', 'simulated', 'realistic', 'devices', 'have', 'restrictions', 'due', 'to', 'their', 'architecture', 'and', 'limitations', 'due', 'to', 'physical', 'imperfections', 'and', 'noise', 'here', 'we', 'extend', 'the', 'usual', 'ideal', 'simulations', 'by', 'considering', 'those', 'effects', 'we', 'provide', 'a', 'general', 'methodology', 'for', 'constructing', 'realistic', 'simulations', 'emulating', 'the', 'physical', 'system', 'which', 'will', 'both', 'provide', 'a', 'benchmark', 'for', 'realistic', 'devices', 'and', 'guide', 'experimental', 'research', 'in', 'the', 'quest', 'for', 'quantumadvantage', 'we', 'exemplify', 'our', 'methodology', 'by', 'simulating', 'a', 'networked', 'architecture', 'and', 'corresponding', 'noisemodel', 'in', 'particular', 'that', 'of', 'the', 'device', 'developed', 'in', 'the', 'networked', 'quantum', 'information', 'technologies', 'hub', 'nqit', 'for', 'our', 'simulations', 'we', 'use', 'with', 'suitable', 'modification', 'the', 'classical', 'simulator', 'of', 'of', 'bravyi', 'and', 'gosset', 'the', 'specific', 'problems', 'considered', 'belong', 'to', 'the', 'class', 'of', 'instantaneous', 'quantum', 'polynomialtime', 'iqp', 'problems', 'a', 'class', 'believed', 'to', 'be', 'hard', 'for', 'classical', 'computing', 'devices', 'and', 'to', 'be', 'a', 'promising', 'candidate', 'for', 'the', 'first', 'demonstration', 'of', 'quantumadvantage', 'we', 'first', 'consider', 'a', 'subclass', 'of', 'iqp', 'defined', 'by', 'bermejovega', 'et', 'al', 'involving', 'twodimensional', 'dynamical', 'quantum', 'simulators', 'before', 'moving', 'to', 'more', 'general', 'instances', 'of', 'iqp', 'but', 'which', 'are', 'still', 'restricted', 'to', 'the', 'architecture', 'of', 'nqit']]
|
[-0.09343598854314746, 0.0782888031178472, -0.06421074633725946, 0.07769017327173863, -0.08349705576320669, -0.19410310435926084, 0.03727795973821753, 0.36118486247223663, -0.25296254048729877, -0.34386420964326964, 0.11226218498319418, -0.19577120897550898, -0.17302782918082504, 0.2813136740456743, -0.07513674517240836, 0.12635497261964562, 0.05576646962225527, -0.032715696150233155, -0.05298687063202442, -0.2583662869855687, 0.26517814182373417, 0.0857588480783993, 0.26067938705547206, 0.03311200151556587, 0.05342291982752836, -0.016161329158765066, 0.003454583812033735, 0.02596325508176712, -0.10827570459339067, 0.1283952447571268, 0.28289792334369146, 0.11601780754435494, 0.2910785836160153, -0.47317286618203525, -0.21316903817044744, 0.11712129758231446, 0.1249318676669923, 0.1690498414822484, -0.05858055080866196, -0.29009978413342474, 0.11512633354167442, -0.1729189682112311, -0.13383067696215958, -0.11275063514761836, 0.020516573933016764, -0.0012226240138100632, -0.2489204357100471, 0.02806426789686383, 0.05398844230962622, -0.00029664330537913433, -0.003958530918307917, -0.06157246456868632, 0.06335838068740435, 0.13937584620942062, -0.06339072932241542, -0.0012935729385035704, 0.13233664124478478, -0.11721054682261255, -0.17747093982111858, 0.422993966965491, 0.009464188468133858, -0.20275093166972977, 0.21278568527971706, -0.07081832687920296, -0.16059713694547495, 0.05996546464977808, 0.19009092935626526, 0.11848400246462294, -0.15170550310123296, 0.06806351300296243, -0.017044889696697933, 0.13481047939430607, 0.00015591890233228485, 0.06518940073269677, 0.20342885136317246, 0.18358515316141716, 0.03665046515148956, 0.17931084014030255, -0.04827204824286891, -0.1654103266135565, -0.2881833613976351, -0.16820935737042422, -0.1951559872766695, 0.06815526209398542, -0.027888965215611114, -0.15417406454413052, 0.35033132864843053, 0.23414425759972027, 0.14152226040661559, 0.07676016375558997, 0.3183595923609643, 0.09035635995211072, 0.08547559820899149, 0.08593904714148101, 0.22280311881635623, 0.09927161935769231, 0.09142652138072743, -0.18219240014366506, 0.06584318048118737, -0.0036216976929196046]
|
1,803.04168
|
Entanglement-assisted quantum MDS codes from constacyclic codes with
large minimum distance
|
The entanglement-assisted (EA) formalism allows arbitrary classical linear
codes to transform into entanglement-assisted quantum error correcting codes
(EAQECCs) by using pre-shared entanglement between the sender and the receiver.
In this work, we propose a decomposition of the defining set of constacyclic
codes. Using this method, we construct four classes of $q$-ary
entanglement-assisted quantum MDS (EAQMDS) codes based on classical
constacyclic MDS codes by exploiting less pre-shared maximally entangled
states. We show that a class of $q$-ary EAQMDS have minimum distance upper
limit greater than $3q-1$. Some of them have much larger minimum distance than
the known quantum MDS (QMDS) codes of the same length. Most of these $q$-ary
EAQMDS codes are new in the sense that their parameters are not covered by the
codes available in the literature.
|
cs.IT math.IT
|
the entanglementassisted ea formalism allows arbitrary classical linear codes to transform into entanglementassisted quantum error correcting codes eaqeccs by using preshared entanglement between the sender and the receiver in this work we propose a decomposition of the defining set of constacyclic codes using this method we construct four classes of qary entanglementassisted quantum mds eaqmds codes based on classical constacyclic mds codes by exploiting less preshared maximally entangled states we show that a class of qary eaqmds have minimum distance upper limit greater than 3q1 some of them have much larger minimum distance than the known quantum mds qmds codes of the same length most of these qary eaqmds codes are new in the sense that their parameters are not covered by the codes available in the literature
|
[['the', 'entanglementassisted', 'ea', 'formalism', 'allows', 'arbitrary', 'classical', 'linear', 'codes', 'to', 'transform', 'into', 'entanglementassisted', 'quantum', 'error', 'correcting', 'codes', 'eaqeccs', 'by', 'using', 'preshared', 'entanglement', 'between', 'the', 'sender', 'and', 'the', 'receiver', 'in', 'this', 'work', 'we', 'propose', 'a', 'decomposition', 'of', 'the', 'defining', 'set', 'of', 'constacyclic', 'codes', 'using', 'this', 'method', 'we', 'construct', 'four', 'classes', 'of', 'qary', 'entanglementassisted', 'quantum', 'mds', 'eaqmds', 'codes', 'based', 'on', 'classical', 'constacyclic', 'mds', 'codes', 'by', 'exploiting', 'less', 'preshared', 'maximally', 'entangled', 'states', 'we', 'show', 'that', 'a', 'class', 'of', 'qary', 'eaqmds', 'have', 'minimum', 'distance', 'upper', 'limit', 'greater', 'than', '3q1', 'some', 'of', 'them', 'have', 'much', 'larger', 'minimum', 'distance', 'than', 'the', 'known', 'quantum', 'mds', 'qmds', 'codes', 'of', 'the', 'same', 'length', 'most', 'of', 'these', 'qary', 'eaqmds', 'codes', 'are', 'new', 'in', 'the', 'sense', 'that', 'their', 'parameters', 'are', 'not', 'covered', 'by', 'the', 'codes', 'available', 'in', 'the', 'literature']]
|
[-0.20771418061485747, 0.12429761401290307, -0.08125022299100237, 0.12401862654041906, 0.041752664190426, -0.3076097542143543, 0.0394936038992455, 0.35088539467324154, -0.3021846748506505, -0.25168470610515215, 0.1018810932228007, -0.2794815204998713, -0.1268495369131415, 0.2309009672171669, -0.12183909280065564, 0.14983824815590197, 0.07143137831008062, 0.0164033221808495, -0.1842939473244769, -0.3473868234286783, 0.33709527325845556, 0.15032990254348988, 0.2558677175838966, -0.040142885816749185, 0.06644248117663665, 0.026404328287753742, -0.03002383579587331, -0.04165437718620524, -0.23517193942518588, 0.14689510861853705, 0.2839492067705578, 0.22374757294528536, 0.20595581216184655, -0.3409270272095455, -0.2504107357272005, 0.13322850070926506, 0.13683527649118332, 0.24893663683178602, -0.015688706243054185, -0.2093629433948081, 0.12319940777524607, -0.22493470938206883, 0.032852078968062415, 0.026918985560769215, -0.0011277833618805744, -0.003906794439899386, -0.2226167281078233, -0.013832402633852325, 0.06348787817114498, 0.09616742218872787, 0.012445872305306693, -0.18721715634819702, 0.0823742551056057, 0.13135924455491477, -0.09843461837226641, 0.04500957866184763, 0.0257171564426244, -0.031696634276158875, -0.16520790141748876, 0.2950452671138919, -0.004695520755603866, -0.20962447944111773, 0.09250944655104831, -0.083566897916171, -0.06304525984523934, 0.09612418601136596, 0.18176330816640984, 0.13425051792000886, -0.12063306181880762, 0.09282459337873661, -0.10039680633781245, 0.20044593399870791, 0.11402035143692046, 0.243189985765639, 0.1504834119041334, 0.0024914511559472885, 0.06604616158801946, 0.24573112397229124, -0.050387482348241974, -0.10710499848937616, -0.2884999949601479, -0.13899439647119038, -0.23510238925518934, 0.07959241835681041, -0.14746561988056328, -0.1490767584182322, 0.35355481490842067, 0.13325646148837222, 0.06163443511468358, 0.16011926048668101, 0.24241438707940688, -0.02819644989438075, 0.17049566505556868, 0.26628412076752284, 0.2017703460089706, 0.21307600732234278, -0.07319526865103398, -0.19774643446908158, 0.04845856533574988, 0.14068632735961728]
|
1,803.04169
|
Numerical study of the relativistic three-body quantization condition in
the isotropic approximation
|
We present numerical results showing how our recently proposed relativistic
three-particle quantization condition can be used in practice. Using the
isotropic (generalized $s$-wave) approximation, and keeping only the leading
terms in the effective range expansion, we show how the quantization condition
can be solved numerically in a straightforward manner. In addition, we show how
the integral equations that relate the intermediate three-particle
infinite-volume scattering quantity, $\mathcal K_{\text{df},3}$, to the
physical scattering amplitude can be solved at and below threshold. We test our
methods by reproducing known analytic results for the $1/L$ expansion of the
threshold state, the volume dependence of three-particle bound-state energies,
and the Bethe-Salpeter wavefunctions for these bound states. We also find that
certain values of $\mathcal K_{\text{df},3}$ lead to unphysical finite-volume
energies, and give a preliminary analysis of these artifacts.
|
hep-lat
|
we present numerical results showing how our recently proposed relativistic threeparticle quantization condition can be used in practice using the isotropic generalized swave approximation and keeping only the leading terms in the effective range expansion we show how the quantization condition can be solved numerically in a straightforward manner in addition we show how the integral equations that relate the intermediate threeparticle infinitevolume scattering quantity mathcal k_textdf3 to the physical scattering amplitude can be solved at and below threshold we test our methods by reproducing known analytic results for the 1l expansion of the threshold state the volume dependence of threeparticle boundstate energies and the bethesalpeter wavefunctions for these bound states we also find that certain values of mathcal k_textdf3 lead to unphysical finitevolume energies and give a preliminary analysis of these artifacts
|
[['we', 'present', 'numerical', 'results', 'showing', 'how', 'our', 'recently', 'proposed', 'relativistic', 'threeparticle', 'quantization', 'condition', 'can', 'be', 'used', 'in', 'practice', 'using', 'the', 'isotropic', 'generalized', 'swave', 'approximation', 'and', 'keeping', 'only', 'the', 'leading', 'terms', 'in', 'the', 'effective', 'range', 'expansion', 'we', 'show', 'how', 'the', 'quantization', 'condition', 'can', 'be', 'solved', 'numerically', 'in', 'a', 'straightforward', 'manner', 'in', 'addition', 'we', 'show', 'how', 'the', 'integral', 'equations', 'that', 'relate', 'the', 'intermediate', 'threeparticle', 'infinitevolume', 'scattering', 'quantity', 'mathcal', 'k_textdf3', 'to', 'the', 'physical', 'scattering', 'amplitude', 'can', 'be', 'solved', 'at', 'and', 'below', 'threshold', 'we', 'test', 'our', 'methods', 'by', 'reproducing', 'known', 'analytic', 'results', 'for', 'the', '1l', 'expansion', 'of', 'the', 'threshold', 'state', 'the', 'volume', 'dependence', 'of', 'threeparticle', 'boundstate', 'energies', 'and', 'the', 'bethesalpeter', 'wavefunctions', 'for', 'these', 'bound', 'states', 'we', 'also', 'find', 'that', 'certain', 'values', 'of', 'mathcal', 'k_textdf3', 'lead', 'to', 'unphysical', 'finitevolume', 'energies', 'and', 'give', 'a', 'preliminary', 'analysis', 'of', 'these', 'artifacts']]
|
[-0.09539411767236604, 0.15361677847432953, -0.13968003611969015, 0.1293156796298523, -0.038697053905832404, -0.09074447303299459, 0.03506412890291851, 0.35610193830296283, -0.2185923425793534, -0.2711865594397292, 0.047730096942880225, -0.24589676285546472, -0.1576846024974157, 0.17488694081850747, 0.011718407600321843, 0.09097786212816766, 0.09397542198501413, 0.025633285717882273, -0.11570074436617375, -0.2385728551600953, 0.33606990281748406, 0.03988103176029897, 0.24698109701560197, 0.15752889727818148, 0.05650584635019075, 0.002334079765608065, 0.025305811197360095, 0.009353818105292002, -0.17043660509007724, 0.07163039251996688, 0.27356307337039243, 0.05425252403552068, 0.17707400794588882, -0.4167028461504756, -0.17780009315541115, 0.07770317603517608, 0.21115893629941207, 0.15177057674225733, -0.013101509807787778, -0.2696204757076183, 0.06445695470506681, -0.17261411977633265, -0.18361258708235617, -0.17431508539731522, -0.0324262497584044, -0.012229931363053904, -0.283341851952763, 0.1242698589415389, 0.024616840787814887, -0.0390031817475803, -0.082007322247133, -0.15168793799839062, 0.011248903192636621, 0.08211566517769381, 0.011040170781868901, 0.01806261276076228, 0.0894645968288137, -0.10680234664695636, -0.08308037276600154, 0.357715432667209, -0.05956809096863024, -0.24584938012035065, 0.1348169240318523, -0.1520659740026045, -0.11150737785030412, 0.13093223689721173, 0.1393342412624309, 0.11551648438046153, -0.14015694726827263, 0.1044853274863327, -0.042586345659241874, 0.13824192642852778, 0.10174645595110328, 0.05400359627918717, 0.10716065023634724, 0.07860160073023716, -0.0018532218710156797, 0.14833139465768103, -0.06112310013428103, -0.10216190082995036, -0.38214190284373195, -0.08174505000018678, -0.17015466169731422, 0.05949909697048622, -0.10025295007303854, -0.1416885681727631, 0.3606642751549264, 0.17050239425650193, 0.1961295675745817, 0.07168344096884928, 0.26537979818802354, 0.22143367790432206, 0.05324729249051964, 0.08891052898830017, 0.27443955872805065, 0.1169410395446653, 0.058678156148841365, -0.28190647275720276, 0.00738030903837608, 0.10935348462853722]
|
1,803.0417
|
Holonomic Gradient Method for Two Way Contingency Tables
|
The holonomic gradient method gives an algorithm to efficiently and
accurately evaluate normalizing constants and their derivatives. We apply the
holonomic gradient method in the case of the conditional Poisson or multinomial
distribution on two way contingency tables. We utilize the modular method in
computer algebra for an efficient and exact evaluation, and we discuss on
complexities of these algorithms and their implementation. We also discuss on a
theoretical aspect of the distribution from the viewpoint of the conditional
maximum likelihood estimation.
|
math.CA
|
the holonomic gradient method gives an algorithm to efficiently and accurately evaluate normalizing constants and their derivatives we apply the holonomic gradient method in the case of the conditional poisson or multinomial distribution on two way contingency tables we utilize the modular method in computer algebra for an efficient and exact evaluation and we discuss on complexities of these algorithms and their implementation we also discuss on a theoretical aspect of the distribution from the viewpoint of the conditional maximum likelihood estimation
|
[['the', 'holonomic', 'gradient', 'method', 'gives', 'an', 'algorithm', 'to', 'efficiently', 'and', 'accurately', 'evaluate', 'normalizing', 'constants', 'and', 'their', 'derivatives', 'we', 'apply', 'the', 'holonomic', 'gradient', 'method', 'in', 'the', 'case', 'of', 'the', 'conditional', 'poisson', 'or', 'multinomial', 'distribution', 'on', 'two', 'way', 'contingency', 'tables', 'we', 'utilize', 'the', 'modular', 'method', 'in', 'computer', 'algebra', 'for', 'an', 'efficient', 'and', 'exact', 'evaluation', 'and', 'we', 'discuss', 'on', 'complexities', 'of', 'these', 'algorithms', 'and', 'their', 'implementation', 'we', 'also', 'discuss', 'on', 'a', 'theoretical', 'aspect', 'of', 'the', 'distribution', 'from', 'the', 'viewpoint', 'of', 'the', 'conditional', 'maximum', 'likelihood', 'estimation']]
|
[-0.07271666459671063, -0.01386967284864712, -0.11258718124931542, 0.10382334605035395, -0.09089799262810408, -0.0919827908879464, 0.08048832568726162, 0.4452472464976514, -0.3064693457151695, -0.31158467076105495, 0.10970189675075434, -0.20867865470311855, -0.19550111992341443, 0.23186642034036084, -0.10530020137851286, 0.11077969382721477, 0.05329111630733057, 0.0471843385432915, -0.11174433463730099, -0.287206142913641, 0.32028545586892015, 0.0391326106448726, 0.3000935105402477, 0.024383560104136604, 0.14499255580112066, 0.03307672175465197, -0.05080681040360615, -0.036678309461510766, -0.13433715218405534, 0.20793062121402928, 0.17525044458395825, 0.20296971564090288, 0.2516200327791455, -0.42067578982947984, -0.0991820280934207, 0.10093735779703754, 0.13157357779053244, 0.13134894583646844, -0.012529562174899095, -0.2522103690865972, 0.05532132516751384, -0.20269309786125655, -0.07515607577771312, -0.1559969315010055, -0.017993120811652483, 0.05731597241786558, -0.2781347100816031, 0.06945636960153934, 0.02659427192879886, 0.056783318769459315, -0.06033774879874616, -0.16215435139516868, 0.06631804251952506, 0.08020317129415983, 0.010073377614522852, -0.027001752881560384, 0.13095287581417347, -0.11550680927784258, -0.1266478663991864, 0.33455062454293777, -0.040376706122670594, -0.2676673388653776, 0.12751323965991415, -0.06800005688309306, -0.17283873934094318, 0.04761564858270548, 0.21515808934800146, 0.15309458371342682, -0.08913691563917915, 0.08906689315974689, 0.004939662201738939, 0.09557494354042474, 0.009745887071802848, -0.04447313926818713, 0.15024175171217904, 0.10472258940770678, 0.07728093502497892, 0.16078528371162532, -0.10885898348954846, -0.1348457734282242, -0.29568985204507664, -0.20775500090264648, -0.19466436201161363, -0.017078303686547572, -0.15160795144375452, -0.19969068955993508, 0.41573680501158644, 0.23259050548985238, 0.2128784390302693, 0.14024224905751465, 0.34389894019539763, 0.13714729077977741, -0.006867427941093721, 0.09740879404835584, 0.15356353662692282, 0.1636578130263199, 0.0418461187311062, -0.22241307770912877, 0.10880177817875292, 0.09049885468159961]
|
1,803.04171
|
Performance Loss Analysis and Design Space Optimization of Perovskite
Solar Cells
|
While the performance enhancement witnessed in the field of perovskite solar
cells over the recent years has been impressive, it is now evident that further
optimization beyond the existing literature would require detailed analysis of
various loss mechanisms. Here we address the same through detailed numerical
simulations of optical and electrical characteristics. We quantify the various
losses like optical losses (5-6%), recombination losses (3-4%), and resistive
losses against the Auger limited practical efficiency limits. Moreover, we
illustrate the schemes that result in reduction of these losses and eventual
increase in efficiency. In addition, we extend the analyses to identify the
optimum thickness of perovskite and the factors affecting the optimum thickness
have been discussed in detail.
|
physics.app-ph
|
while the performance enhancement witnessed in the field of perovskite solar cells over the recent years has been impressive it is now evident that further optimization beyond the existing literature would require detailed analysis of various loss mechanisms here we address the same through detailed numerical simulations of optical and electrical characteristics we quantify the various losses like optical losses 56 recombination losses 34 and resistive losses against the auger limited practical efficiency limits moreover we illustrate the schemes that result in reduction of these losses and eventual increase in efficiency in addition we extend the analyses to identify the optimum thickness of perovskite and the factors affecting the optimum thickness have been discussed in detail
|
[['while', 'the', 'performance', 'enhancement', 'witnessed', 'in', 'the', 'field', 'of', 'perovskite', 'solar', 'cells', 'over', 'the', 'recent', 'years', 'has', 'been', 'impressive', 'it', 'is', 'now', 'evident', 'that', 'further', 'optimization', 'beyond', 'the', 'existing', 'literature', 'would', 'require', 'detailed', 'analysis', 'of', 'various', 'loss', 'mechanisms', 'here', 'we', 'address', 'the', 'same', 'through', 'detailed', 'numerical', 'simulations', 'of', 'optical', 'and', 'electrical', 'characteristics', 'we', 'quantify', 'the', 'various', 'losses', 'like', 'optical', 'losses', '56', 'recombination', 'losses', '34', 'and', 'resistive', 'losses', 'against', 'the', 'auger', 'limited', 'practical', 'efficiency', 'limits', 'moreover', 'we', 'illustrate', 'the', 'schemes', 'that', 'result', 'in', 'reduction', 'of', 'these', 'losses', 'and', 'eventual', 'increase', 'in', 'efficiency', 'in', 'addition', 'we', 'extend', 'the', 'analyses', 'to', 'identify', 'the', 'optimum', 'thickness', 'of', 'perovskite', 'and', 'the', 'factors', 'affecting', 'the', 'optimum', 'thickness', 'have', 'been', 'discussed', 'in', 'detail']]
|
[-0.08436873002009916, 0.04620996853015546, 0.0018122904283668973, 0.05775449496135918, -0.019758007854448055, -0.06984069500246952, 0.09800876735645378, 0.44421060222747, -0.23626639339109434, -0.3309785845079299, 0.1171319865579476, -0.28987018238142903, -0.16528083800723584, 0.24881321368819295, -0.08817196980616528, 0.0982377221165546, 0.07588324417231669, -0.07225794258431115, -0.09047218235129298, -0.2699226742321304, 0.22993711631239294, 0.12868460049403124, 0.35089745545551054, 0.13338085412095976, 0.04839037844493728, -0.05544385846286755, -0.043248575461771466, 0.03175401888739575, -0.1352711214312876, 0.09113446302342645, 0.22463091610577599, 0.08977445861693986, 0.2884234646576104, -0.47550101931897343, -0.2817778306981099, 0.07798310182185779, 0.1799631577149708, 0.09731913121730282, -0.07324200809897116, -0.1769652436888809, 0.0863498939965964, -0.19213233707103364, -0.10234037180158213, -0.07259001818200542, 0.00044148233478310807, 0.05299442687326769, -0.2196079436448756, 0.045765810874933054, 0.05031166660824213, 0.07730992684333489, -0.06751928226379998, -0.15154391948278223, 0.002233175169435683, 0.1368387529379608, 0.08074456850891724, -0.05669855568076259, 0.16522460815432513, -0.13561737204195354, -0.1465935976613827, 0.33628297303321547, -0.03401983748511251, -0.10861122272587542, 0.19870280814035957, -0.1705461772046341, -0.08047744349159043, 0.18070029646583735, 0.1916433423551819, 0.06815663475647633, -0.13475735292565238, 0.06469043759942247, 0.01649689255282283, 0.15053860599311583, 0.07303145111755244, 0.1081554566526079, 0.13226422264565843, 0.23037028924064262, 0.003751468200413189, 0.13611494833683788, -0.11065874789873588, -0.07824112873540484, -0.23036645717340812, -0.14758394997775684, -0.08903967460681653, 0.054267721317893154, -0.07249492934276751, -0.098705412900268, 0.40401590874033244, 0.20758260609903212, 0.15423522543579596, -0.045248753840810264, 0.34331804519551323, 0.09737699831723524, 0.10665243340591932, 0.03343517396695398, 0.3677006510632305, 0.11957028043528634, 0.12223234063853382, -0.26925202130323983, 0.10211059201914206, -0.04894142286201682]
|
1,803.04172
|
Giant graviton interactions and M2-branes ending on multiple M5-branes
|
We study splitting and joining interactions of giant gravitons with angular
momenta $N^{1/2}\ll J\ll N$ in the type IIB string theory on $AdS_5 \times S^5$
by describing them as instantons in the tiny graviton matrix model introduced
by Sheikh-Jabbari. At large $J$ the instanton equation can be mapped to the
four-dimensional Laplace equation and the Coulomb potential for $m$ point
charges in an $n$-sheeted Riemann space corresponds to the $m$-to-$n$
interaction process of giant gravitons. These instantons provide the
holographic dual of correlators of all semi-heavy operators and the instanton
amplitudes exactly agree with the pp-wave limit of Schur polynomial correlators
in ${\cal N}=4$ SYM computed by Corley, Jevicki and Ramgoolam.
By making a slight change of variables the same instanton equation is
mathematically transformed into the Basu-Harvey equation which describes the
system of M$2$-branes ending on M$5$-branes. As it turns out, the solutions to
the sourceless Laplace equation on an $n$-sheeted Riemann space correspond to
$n$ M5-branes connected by M2-branes and we find general solutions representing
M2-branes ending on multiple M5-branes. Among other solutions, the $n=3$ case
describes an M2-branes junction ending on three M5-branes. The effective theory
on the moduli space of our solutions might shed light on the low energy
effective theory of multiple M5-branes.
|
hep-th
|
we study splitting and joining interactions of giant gravitons with angular momenta n12ll jll n in the type iib string theory on ads_5 times s5 by describing them as instantons in the tiny graviton matrix model introduced by sheikhjabbari at large j the instanton equation can be mapped to the fourdimensional laplace equation and the coulomb potential for m point charges in an nsheeted riemann space corresponds to the mton interaction process of giant gravitons these instantons provide the holographic dual of correlators of all semiheavy operators and the instanton amplitudes exactly agree with the ppwave limit of schur polynomial correlators in cal n4 sym computed by corley jevicki and ramgoolam by making a slight change of variables the same instanton equation is mathematically transformed into the basuharvey equation which describes the system of m2branes ending on m5branes as it turns out the solutions to the sourceless laplace equation on an nsheeted riemann space correspond to n m5branes connected by m2branes and we find general solutions representing m2branes ending on multiple m5branes among other solutions the n3 case describes an m2branes junction ending on three m5branes the effective theory on the moduli space of our solutions might shed light on the low energy effective theory of multiple m5branes
|
[['we', 'study', 'splitting', 'and', 'joining', 'interactions', 'of', 'giant', 'gravitons', 'with', 'angular', 'momenta', 'n12ll', 'jll', 'n', 'in', 'the', 'type', 'iib', 'string', 'theory', 'on', 'ads_5', 'times', 's5', 'by', 'describing', 'them', 'as', 'instantons', 'in', 'the', 'tiny', 'graviton', 'matrix', 'model', 'introduced', 'by', 'sheikhjabbari', 'at', 'large', 'j', 'the', 'instanton', 'equation', 'can', 'be', 'mapped', 'to', 'the', 'fourdimensional', 'laplace', 'equation', 'and', 'the', 'coulomb', 'potential', 'for', 'm', 'point', 'charges', 'in', 'an', 'nsheeted', 'riemann', 'space', 'corresponds', 'to', 'the', 'mton', 'interaction', 'process', 'of', 'giant', 'gravitons', 'these', 'instantons', 'provide', 'the', 'holographic', 'dual', 'of', 'correlators', 'of', 'all', 'semiheavy', 'operators', 'and', 'the', 'instanton', 'amplitudes', 'exactly', 'agree', 'with', 'the', 'ppwave', 'limit', 'of', 'schur', 'polynomial', 'correlators', 'in', 'cal', 'n4', 'sym', 'computed', 'by', 'corley', 'jevicki', 'and', 'ramgoolam', 'by', 'making', 'a', 'slight', 'change', 'of', 'variables', 'the', 'same', 'instanton', 'equation', 'is', 'mathematically', 'transformed', 'into', 'the', 'basuharvey', 'equation', 'which', 'describes', 'the', 'system', 'of', 'm2branes', 'ending', 'on', 'm5branes', 'as', 'it', 'turns', 'out', 'the', 'solutions', 'to', 'the', 'sourceless', 'laplace', 'equation', 'on', 'an', 'nsheeted', 'riemann', 'space', 'correspond', 'to', 'n', 'm5branes', 'connected', 'by', 'm2branes', 'and', 'we', 'find', 'general', 'solutions', 'representing', 'm2branes', 'ending', 'on', 'multiple', 'm5branes', 'among', 'other', 'solutions', 'the', 'n3', 'case', 'describes', 'an', 'm2branes', 'junction', 'ending', 'on', 'three', 'm5branes', 'the', 'effective', 'theory', 'on', 'the', 'moduli', 'space', 'of', 'our', 'solutions', 'might', 'shed', 'light', 'on', 'the', 'low', 'energy', 'effective', 'theory', 'of', 'multiple', 'm5branes']]
|
[-0.1935868557417629, 0.15428575016522678, -0.08988313352513104, 0.09418485042864987, -0.07053410092527729, -0.15066056681070022, -0.009882852405014379, 0.25650352252329267, -0.1519882865011601, -0.2480766608470642, 0.06228376566091689, -0.32151556918624696, -0.15252301841860683, 0.10018215668501287, -0.04724817242609655, 0.014781242727143009, 0.018323498620742524, 0.027336358954908508, -0.07721480358755443, -0.2810382342198864, 0.36334473444148896, -0.025717910701726996, 0.25024111921879144, 0.043287558601487704, 0.141810524853219, 0.030097796149600137, -4.4792012890755406e-05, -0.031164115733643086, -0.13010272184232813, 0.0809056029995767, 0.24795152252432096, 0.05190960573963821, 0.06312305101409282, -0.5179655565630372, -0.1924732410507958, 0.06919967939668312, 0.24049676235356346, 0.094064493460876, 0.08174401981722018, -0.30001376632305726, 0.0037497784147357068, -0.1178776295140113, -0.19906273122036422, -0.039353279470148064, 0.06126389276220679, -0.03339132218303659, -0.1851485097440096, 0.02050990878984832, -0.029222529589357536, -0.027863928649103177, -0.06168217460693019, -0.11229418452925662, -0.07485238901884636, 0.06098020578075836, 0.1273661384681274, 0.09347064773688411, 0.09425243147217283, -0.15800616303231657, -0.11384380516346271, 0.3258096705338486, -0.09129555541226958, -0.25233390483573626, 0.10932100825125306, -0.11780552555602498, -0.13345856368087414, 0.14076441669859355, 0.09435298280597369, 0.21130918347753766, -0.12151362396685815, 0.23569213112563508, -0.0109330400233952, 0.09840062558835531, 0.16426551476030088, 0.011599736593709123, 0.2930697153254253, 0.11019499152046969, 0.029752997923415243, 0.12963124382303937, -0.037265321389891255, -0.13482346897490505, -0.39459607075593184, -0.13227983402860602, -0.1379398084330804, 0.1881943295425849, -0.20826192208780145, -0.19659841240542691, 0.3166022465650912, 0.0356558850852818, 0.19651552200340097, 0.06383146229824732, 0.1706914699261599, 0.12681731769940022, 0.051606842527938325, 0.04987155455647309, 0.18982727790660248, 0.1554072328513806, 0.09206996754538722, -0.25647841495711626, -0.1577610311961574, 0.22371650035833804]
|
1,803.04173
|
Adversarial Malware Binaries: Evading Deep Learning for Malware
Detection in Executables
|
Machine-learning methods have already been exploited as useful tools for
detecting malicious executable files. They leverage data retrieved from malware
samples, such as header fields, instruction sequences, or even raw bytes, to
learn models that discriminate between benign and malicious software. However,
it has also been shown that machine learning and deep neural networks can be
fooled by evasion attacks (also referred to as adversarial examples), i.e.,
small changes to the input data that cause misclassification at test time. In
this work, we investigate the vulnerability of malware detection methods that
use deep networks to learn from raw bytes. We propose a gradient-based attack
that is capable of evading a recently-proposed deep network suited to this
purpose by only changing few specific bytes at the end of each malware sample,
while preserving its intrusive functionality. Promising results show that our
adversarial malware binaries evade the targeted network with high probability,
even though less than 1% of their bytes are modified.
|
cs.CR
|
machinelearning methods have already been exploited as useful tools for detecting malicious executable files they leverage data retrieved from malware samples such as header fields instruction sequences or even raw bytes to learn models that discriminate between benign and malicious software however it has also been shown that machine learning and deep neural networks can be fooled by evasion attacks also referred to as adversarial examples ie small changes to the input data that cause misclassification at test time in this work we investigate the vulnerability of malware detection methods that use deep networks to learn from raw bytes we propose a gradientbased attack that is capable of evading a recentlyproposed deep network suited to this purpose by only changing few specific bytes at the end of each malware sample while preserving its intrusive functionality promising results show that our adversarial malware binaries evade the targeted network with high probability even though less than 1 of their bytes are modified
|
[['machinelearning', 'methods', 'have', 'already', 'been', 'exploited', 'as', 'useful', 'tools', 'for', 'detecting', 'malicious', 'executable', 'files', 'they', 'leverage', 'data', 'retrieved', 'from', 'malware', 'samples', 'such', 'as', 'header', 'fields', 'instruction', 'sequences', 'or', 'even', 'raw', 'bytes', 'to', 'learn', 'models', 'that', 'discriminate', 'between', 'benign', 'and', 'malicious', 'software', 'however', 'it', 'has', 'also', 'been', 'shown', 'that', 'machine', 'learning', 'and', 'deep', 'neural', 'networks', 'can', 'be', 'fooled', 'by', 'evasion', 'attacks', 'also', 'referred', 'to', 'as', 'adversarial', 'examples', 'ie', 'small', 'changes', 'to', 'the', 'input', 'data', 'that', 'cause', 'misclassification', 'at', 'test', 'time', 'in', 'this', 'work', 'we', 'investigate', 'the', 'vulnerability', 'of', 'malware', 'detection', 'methods', 'that', 'use', 'deep', 'networks', 'to', 'learn', 'from', 'raw', 'bytes', 'we', 'propose', 'a', 'gradientbased', 'attack', 'that', 'is', 'capable', 'of', 'evading', 'a', 'recentlyproposed', 'deep', 'network', 'suited', 'to', 'this', 'purpose', 'by', 'only', 'changing', 'few', 'specific', 'bytes', 'at', 'the', 'end', 'of', 'each', 'malware', 'sample', 'while', 'preserving', 'its', 'intrusive', 'functionality', 'promising', 'results', 'show', 'that', 'our', 'adversarial', 'malware', 'binaries', 'evade', 'the', 'targeted', 'network', 'with', 'high', 'probability', 'even', 'though', 'less', 'than', '1', 'of', 'their', 'bytes', 'are', 'modified']]
|
[-0.05423396298938314, 0.032914089065161536, -0.04316859150858363, 0.14081573312614637, -0.11647298093885183, -0.28077812878182157, 0.07650166844932756, 0.4054493458912475, -0.2715290262596682, -0.36733854918857106, 0.10225388118633419, -0.3039533503149869, -0.18603580168710324, 0.21171694754884812, -0.15767198221219586, 0.11454866472013236, 0.09203353411867284, 0.04406807750929147, -0.029692296320718015, -0.3314711876213551, 0.30896864508395083, 0.0612879849746605, 0.29785279046118374, -0.024882933970366138, 0.08763595619384432, -0.03126421799242962, -0.008873734850203619, -0.03206042910460383, -0.01340244274606448, 0.09197276692980268, 0.3821786451047274, 0.25548439629542374, 0.32838191077753437, -0.4492618611254784, -0.23553861470427365, 0.14169678315520287, 0.1568684579608089, 0.1781953116209479, -0.05583544900509878, -0.3533950332850509, 0.19142619328194996, -0.2185463803325547, -0.01875348172034137, -0.184318871339201, -0.02463614313164726, 0.019333010090122116, -0.21208359283045866, -0.025015077075295267, 0.07267564239336935, 0.05429589149425738, 0.031330796126712815, -0.08658733445918187, -0.021077949389291462, 0.1658956184561248, 0.07298783665610245, 0.04353331614111085, 0.19487943001440727, -0.14867681483228806, -0.14073609956540167, 0.3221057465096237, -0.04189027692673335, -0.1521519295827602, 0.19598955808905885, 0.02761767231131671, -0.1820895381446462, 0.13651222253101877, 0.2706397380621638, 0.13175634226063265, -0.18345714558381587, -0.0356891819894372, 0.015909290872514248, 0.23291902569762896, 0.09400603028771001, 0.019870839765644632, 0.18531814773450606, 0.1991695309523493, 0.025421486400591674, 0.1420819426573871, -0.14666211178991945, 0.007615379762137308, -0.1781500012613833, -0.08236414576385868, -0.21920184369982962, 0.004309312941040843, -0.08439602765993186, -0.13322667711472605, 0.37540695709176364, 0.26028402334350176, 0.17036694320413517, 0.13036810324992984, 0.3800891085760668, -0.025075668147474063, 0.1875987169209111, 0.14235648603062145, 0.19075402425369248, -0.02411305675341282, 0.11985036164551274, -0.10415828743716701, 0.16952944613585713, -0.05189604784318362]
|
1,803.04174
|
Positivity properties of the matrix $\left[(i+j)^{i+j}\right]$
|
Let $p_1<p_2<\cdots<p_n$ be positive real numbers. It is shown that the
matrix whose $i,j$ entry is $(p_i+p_j)^{p_i+p_j}$ is infinitely divisible,
nonsingular and totally positive.
|
math.FA math.CA
|
let p_1p_2cdotsp_n be positive real numbers it is shown that the matrix whose ij entry is p_ip_jp_ip_j is infinitely divisible nonsingular and totally positive
|
[['let', 'p_1p_2cdotsp_n', 'be', 'positive', 'real', 'numbers', 'it', 'is', 'shown', 'that', 'the', 'matrix', 'whose', 'ij', 'entry', 'is', 'p_ip_jp_ip_j', 'is', 'infinitely', 'divisible', 'nonsingular', 'and', 'totally', 'positive']]
|
[-0.1990025887551548, 0.28118842145936057, -0.08391987540843812, -0.021497868684078145, -0.06364167642525652, -0.2891488095576113, -0.1591031466324983, 0.3188779073005373, -0.3065391419963403, -0.11291049878028306, 0.12391324620693922, -0.3736213276332075, -0.2203906293619763, 0.13401456143368373, -0.04938201597807082, -0.08172392879020084, 0.0010180960367010398, 0.17353374722667717, 0.04336746025364846, -0.38133754437281325, 0.3270630246366967, -0.10446127732707695, 0.15938411799090152, 0.12814688824371182, 0.16815819451585412, -0.05748266835673183, -0.01240687927400524, 0.019718363658863713, -0.054975807509684026, 0.024560991304249248, 0.34124482541599055, 0.14984029057351025, 0.259378979998556, -0.3027449372986501, -0.08513959958641366, 0.4128368326293474, 0.16876613884232938, -0.10620598156343806, -0.045038192151961004, -0.24554051314903932, 0.2413864525204355, -0.14790345762263646, -0.17275665992532263, -0.09265257639344782, 0.23072873055934906, -0.013529064811088821, -0.43549150063402275, -0.02369490557942878, 0.08961383727463809, 0.0623642363246869, 0.024110045643862, -0.22323249581015922, -0.04509211433204738, 0.06330915912985802, 0.0383031155850569, -0.00024353682105852798, 0.03954247080466964, 0.0651079894636165, -0.06040987838059664, 0.3348653604361144, 0.0121829832311381, -0.33704167570580135, 0.0825665547427806, -0.21658039215782826, 0.008283411406657913, 0.2218754802915183, 0.045246497727930546, 0.125437335873192, 0.0021158427592705598, 0.2508113669967067, -0.20339992236007343, 0.12445717918771235, 0.11840605066919868, -0.16851221649399536, 0.2727117484266108, -0.037750403227453884, 0.12912186741066928, 0.07092565799195488, 0.07823707315732133, -0.06639892341230404, -0.33744689178737725, -0.16521323353729464, -0.37931691186333244, 0.2717332555912435, -0.11723627622003815, -0.24493880053871014, 0.327331205829978, 0.021118838488208978, 0.17445942188020458, 0.111863763240928, 0.24252844381738792, 0.16742501983588393, 0.009149693883955479, 0.07668712167915973, -0.04955078525976701, 0.20961695748635314, -0.03609756100922823, -0.07730696441351691, 0.1317100850018588, 0.0787291713482277]
|
1,803.04175
|
Energy Observable for a Quantum System with a Dynamical Hilbert Space
and a Global Geometric Extension of Quantum Theory
|
A non-Hermitian operator may serve as the Hamiltonian for a unitary quantum
system, if we can modify the Hilbert space of state vectors of the system so
that it turns into a Hermitian operator. If this operator is time-dependent,
the modified Hilbert space is generally time-dependent. This in turn leads to a
generic conflict between the condition that the Hamiltonian is an observable of
the system and that it generates a unitary time-evolution via the standard
Schr\"odinger equation. We propose a geometric framework for addressing this
problem. In particular we show that the Hamiltonian operator consists of a
geometric part, which is determined by a metric-compatible connection on an
underlying Hermitian vector bundle, and a non-geometric part which we identify
with the energy observable. The same quantum system can be locally described
using a time-dependent Hamiltonian that acts in a time-independent state space
and is the sum of a geometric part and the energy operator. The full global
description of the system is achieved within the framework of a moderate
geometric extension of quantum mechanics where the role of the Hilbert space of
state vectors is played by a Hermitian vector bundle $\mathcal{E}$ endowed with
a metric compatible connection, and observables are given by global sections of
a real vector bundle that is determined by $\mathcal{E}$. We examine the
utility of our proposal to describe a class of two-level systems where
$\mathcal{E}$ is a Hermitian vector bundle over a two-dimensional sphere.
|
quant-ph gr-qc hep-th math-ph math.MP
|
a nonhermitian operator may serve as the hamiltonian for a unitary quantum system if we can modify the hilbert space of state vectors of the system so that it turns into a hermitian operator if this operator is timedependent the modified hilbert space is generally timedependent this in turn leads to a generic conflict between the condition that the hamiltonian is an observable of the system and that it generates a unitary timeevolution via the standard schrodinger equation we propose a geometric framework for addressing this problem in particular we show that the hamiltonian operator consists of a geometric part which is determined by a metriccompatible connection on an underlying hermitian vector bundle and a nongeometric part which we identify with the energy observable the same quantum system can be locally described using a timedependent hamiltonian that acts in a timeindependent state space and is the sum of a geometric part and the energy operator the full global description of the system is achieved within the framework of a moderate geometric extension of quantum mechanics where the role of the hilbert space of state vectors is played by a hermitian vector bundle mathcale endowed with a metric compatible connection and observables are given by global sections of a real vector bundle that is determined by mathcale we examine the utility of our proposal to describe a class of twolevel systems where mathcale is a hermitian vector bundle over a twodimensional sphere
|
[['a', 'nonhermitian', 'operator', 'may', 'serve', 'as', 'the', 'hamiltonian', 'for', 'a', 'unitary', 'quantum', 'system', 'if', 'we', 'can', 'modify', 'the', 'hilbert', 'space', 'of', 'state', 'vectors', 'of', 'the', 'system', 'so', 'that', 'it', 'turns', 'into', 'a', 'hermitian', 'operator', 'if', 'this', 'operator', 'is', 'timedependent', 'the', 'modified', 'hilbert', 'space', 'is', 'generally', 'timedependent', 'this', 'in', 'turn', 'leads', 'to', 'a', 'generic', 'conflict', 'between', 'the', 'condition', 'that', 'the', 'hamiltonian', 'is', 'an', 'observable', 'of', 'the', 'system', 'and', 'that', 'it', 'generates', 'a', 'unitary', 'timeevolution', 'via', 'the', 'standard', 'schrodinger', 'equation', 'we', 'propose', 'a', 'geometric', 'framework', 'for', 'addressing', 'this', 'problem', 'in', 'particular', 'we', 'show', 'that', 'the', 'hamiltonian', 'operator', 'consists', 'of', 'a', 'geometric', 'part', 'which', 'is', 'determined', 'by', 'a', 'metriccompatible', 'connection', 'on', 'an', 'underlying', 'hermitian', 'vector', 'bundle', 'and', 'a', 'nongeometric', 'part', 'which', 'we', 'identify', 'with', 'the', 'energy', 'observable', 'the', 'same', 'quantum', 'system', 'can', 'be', 'locally', 'described', 'using', 'a', 'timedependent', 'hamiltonian', 'that', 'acts', 'in', 'a', 'timeindependent', 'state', 'space', 'and', 'is', 'the', 'sum', 'of', 'a', 'geometric', 'part', 'and', 'the', 'energy', 'operator', 'the', 'full', 'global', 'description', 'of', 'the', 'system', 'is', 'achieved', 'within', 'the', 'framework', 'of', 'a', 'moderate', 'geometric', 'extension', 'of', 'quantum', 'mechanics', 'where', 'the', 'role', 'of', 'the', 'hilbert', 'space', 'of', 'state', 'vectors', 'is', 'played', 'by', 'a', 'hermitian', 'vector', 'bundle', 'mathcale', 'endowed', 'with', 'a', 'metric', 'compatible', 'connection', 'and', 'observables', 'are', 'given', 'by', 'global', 'sections', 'of', 'a', 'real', 'vector', 'bundle', 'that', 'is', 'determined', 'by', 'mathcale', 'we', 'examine', 'the', 'utility', 'of', 'our', 'proposal', 'to', 'describe', 'a', 'class', 'of', 'twolevel', 'systems', 'where', 'mathcale', 'is', 'a', 'hermitian', 'vector', 'bundle', 'over', 'a', 'twodimensional', 'sphere']]
|
[-0.17531380510919908, 0.12964694815046826, -0.09454359694217869, 0.04572638304019153, -0.07102400712143336, -0.12442703926752233, -0.015178438854264675, 0.33671084088485886, -0.2910502501145098, -0.20357705052571054, 0.07188893183515141, -0.23730409485133389, -0.18455198510932538, 0.1599845815647038, -0.058764908206745736, 0.03589733014234894, 0.09049548076357522, 0.10181781896042225, -0.11577411119428103, -0.19083358234430264, 0.4181038247908299, 0.052418479993958725, 0.22127703569937668, 0.0221896338492972, 0.16601695213563494, 0.048430087780038905, 0.03625410749998206, 0.02452485427923145, -0.07034988441939043, 0.11454383836898767, 0.22999335121734385, 0.11169006523803741, 0.2582256519467535, -0.396074875122655, -0.20725661537443824, 0.16356146684944384, 0.09829868677292498, 0.06491401704333537, 0.00048707642919032285, -0.3088093508340233, 0.05121035231045482, -0.16570649443279287, -0.14231425796971653, -0.1038233116887417, 0.030794775175293946, -0.04764586730514309, -0.2864667499105589, 0.01293229713603174, 0.08109388712608097, 0.020567692588257344, -0.09279551123040902, -0.017860783924371838, -0.04773445054792115, 0.06708101331955788, -0.04509977084445416, 0.07747806200208876, 0.11700336095254822, -0.07539080728436685, -0.10263138238622718, 0.41176530170057324, -0.09855209475144536, -0.2816734059578043, 0.09232489598617422, -0.09555676168510599, -0.08509652502641576, 0.08288179307546142, 0.1311344757397887, 0.13115723148428862, -0.11970287212895238, 0.1743440183323793, -0.11439422041919717, 0.1278792309219257, -0.0318782397167162, 0.03446227193837097, 0.1833432542384289, 0.1291436056705014, 0.10409543210354584, 0.1292935191722262, -0.009903821289921913, -0.1680984203916244, -0.3767439166926373, -0.212090529159921, -0.20480512157353067, 0.1215752902367303, -0.07371840762964467, -0.1677016412135971, 0.4393654098170056, 0.07831976032034296, 0.25070049183025833, 0.02144845039293912, 0.24866532706327088, 0.17976231040363974, 0.0506649182706538, 0.0638249193325917, 0.21326391186847263, 0.16330455056163656, 0.0463606571306231, -0.20617790594919203, -0.0017711682712728799, 0.1263015063216763]
|
1,803.04176
|
Geometric mass acquisition via quantum metric: an effective band mass
theorem for the helicity bands
|
By taking the virtual inter-band transitions along with the intra-band ones
into full account, here we first propose an effective band mass theorem that is
suitable for a wide-class of single-particle Hamiltonians exhibiting multiple
energy bands. Then, for the special case of two-band systems, we show that the
inter-band contribution to the effective band mass of a particle at a given
quantum state is directly controlled by the quantum metric of the corresponding
state. As an illustration, we consider a spin-orbit coupled spin-$1/2$ particle
and calculate its effective band mass at the band minimum of the lower helicity
band. Independent of the coupling strength, we find that the bare mass $m_0$ of
the particle jumps to $2m_0$ for the Rashba and to $3m_0$ for the Weyl
coupling. This geometric mass enhancement is a non-perturbative effect,
uncovering the mystery behind the effective mass of the two-body bound states
in the non-interacting limit. As a further illustration, we show that a
massless Dirac particle acquires a linearly dispersing band mass (equivalent to
the effective cyclotron one up to a prefactor) with its momentum through the
same mechanism.
|
cond-mat.quant-gas cond-mat.mes-hall cond-mat.str-el quant-ph
|
by taking the virtual interband transitions along with the intraband ones into full account here we first propose an effective band mass theorem that is suitable for a wideclass of singleparticle hamiltonians exhibiting multiple energy bands then for the special case of twoband systems we show that the interband contribution to the effective band mass of a particle at a given quantum state is directly controlled by the quantum metric of the corresponding state as an illustration we consider a spinorbit coupled spin12 particle and calculate its effective band mass at the band minimum of the lower helicity band independent of the coupling strength we find that the bare mass m_0 of the particle jumps to 2m_0 for the rashba and to 3m_0 for the weyl coupling this geometric mass enhancement is a nonperturbative effect uncovering the mystery behind the effective mass of the twobody bound states in the noninteracting limit as a further illustration we show that a massless dirac particle acquires a linearly dispersing band mass equivalent to the effective cyclotron one up to a prefactor with its momentum through the same mechanism
|
[['by', 'taking', 'the', 'virtual', 'interband', 'transitions', 'along', 'with', 'the', 'intraband', 'ones', 'into', 'full', 'account', 'here', 'we', 'first', 'propose', 'an', 'effective', 'band', 'mass', 'theorem', 'that', 'is', 'suitable', 'for', 'a', 'wideclass', 'of', 'singleparticle', 'hamiltonians', 'exhibiting', 'multiple', 'energy', 'bands', 'then', 'for', 'the', 'special', 'case', 'of', 'twoband', 'systems', 'we', 'show', 'that', 'the', 'interband', 'contribution', 'to', 'the', 'effective', 'band', 'mass', 'of', 'a', 'particle', 'at', 'a', 'given', 'quantum', 'state', 'is', 'directly', 'controlled', 'by', 'the', 'quantum', 'metric', 'of', 'the', 'corresponding', 'state', 'as', 'an', 'illustration', 'we', 'consider', 'a', 'spinorbit', 'coupled', 'spin12', 'particle', 'and', 'calculate', 'its', 'effective', 'band', 'mass', 'at', 'the', 'band', 'minimum', 'of', 'the', 'lower', 'helicity', 'band', 'independent', 'of', 'the', 'coupling', 'strength', 'we', 'find', 'that', 'the', 'bare', 'mass', 'm_0', 'of', 'the', 'particle', 'jumps', 'to', '2m_0', 'for', 'the', 'rashba', 'and', 'to', '3m_0', 'for', 'the', 'weyl', 'coupling', 'this', 'geometric', 'mass', 'enhancement', 'is', 'a', 'nonperturbative', 'effect', 'uncovering', 'the', 'mystery', 'behind', 'the', 'effective', 'mass', 'of', 'the', 'twobody', 'bound', 'states', 'in', 'the', 'noninteracting', 'limit', 'as', 'a', 'further', 'illustration', 'we', 'show', 'that', 'a', 'massless', 'dirac', 'particle', 'acquires', 'a', 'linearly', 'dispersing', 'band', 'mass', 'equivalent', 'to', 'the', 'effective', 'cyclotron', 'one', 'up', 'to', 'a', 'prefactor', 'with', 'its', 'momentum', 'through', 'the', 'same', 'mechanism']]
|
[-0.14758537615568418, 0.21015929583091233, -0.0486343896861755, 0.08854114946671357, -0.04604818248291216, -0.13439022323228014, 0.07989772304933032, 0.33852815075205517, -0.246306634675104, -0.3054192383892571, -0.012594532042503883, -0.2769686802120819, -0.1070672762580216, 0.159355023903671, 0.042921532437385, 0.004642774231995091, 0.01856563090721307, 0.029063365103312484, -0.10579380068583819, -0.15393076357482324, 0.37044667871668935, 0.04653529518501549, 0.22981324684856783, 0.1291314644034213, 0.10039700812194496, 0.04412144863580698, 0.07825540824104911, -0.02486791494606144, -0.12994531143672444, 0.057323704416415676, 0.1974213184768577, -0.05320862677482459, 0.22571327436067487, -0.3627900419859266, -0.17139947189507834, 0.05725348969344455, 0.1592823482857531, 0.1539462446791889, -0.04648451640209912, -0.2787618567754575, 0.014931555545089119, -0.1877328718622701, -0.17116226656261183, -0.044055478975817255, 0.027374727170630966, -0.07355831492168363, -0.2677198282402495, 0.08648579027968757, 0.03720062093318278, -0.009522231447550914, -0.09434837071951377, -0.10929010450364211, -0.08739635705031738, 0.0910028184133926, 0.0766779449799999, 0.01567418997127907, 0.14167972103282606, -0.12324073034434822, -0.09536665239062606, 0.4119323334130256, -0.1038532516989938, -0.17057007487417888, 0.1510058515730476, -0.1259423409608881, -0.08025836498152626, 0.1586498709151309, 0.14096252728157435, 0.08052737051975387, -0.14816871299863915, 0.11892831754179813, -0.04799851200938144, 0.14337455374618951, -0.0063508261658210795, 0.0904038449668366, 0.25230630297522544, 0.15310474707739954, 0.07371431941409474, 0.11508466495686899, -0.11848596156999955, -0.07085263658613573, -0.29377206714359444, -0.1750647744893681, -0.24388658865759877, 0.06940675284915968, -0.08910012544931858, -0.177175502495906, 0.4431692252907416, 0.12308098781732438, 0.20692302123263842, 0.06028537644812351, 0.2717853485778703, 0.20323733473924221, 0.07099428189521069, 0.06479428273514318, 0.2954681351699907, 0.14759457537793028, 0.05921996201378415, -0.30498618890440254, -0.04782806888080971, 0.05239842613430127]
|
1,803.04177
|
A Virgo Environmental Survey Tracing Ionised Gas Emission (VESTIGE).III.
Star formation in the stripped gas of NGC 4254
|
During pilot observations of the Virgo Environmental Survey Tracing Galaxy
Evolution (VESTIGE), a blind narrow-band Halpha+[NII] imaging survey of the
Virgo cluster carried out with MegaCam at the CFHT, we have observed the spiral
galaxy NGC 4254 (M99). Deep Halpha+[NII] narrow-band and GALEX UV images
revealed the presence of 60 compact (70-500 pc radius) star forming regions up
to ~ 20 kpc outside the optical disc of the galaxy. These regions are located
along a tail of HI gas stripped from the disc of the galaxy after a rapid
gravitational encounter with another Virgo cluster member that simulations
indicate occurred 280-750 Myr ago. We have combined the VESTIGE data with
multifrequency data from the UV to the far-infrared to characterise the stellar
populations of these regions and study the star formation process in an extreme
environment such as the tails of stripped gas embedded in the hot intracluster
medium. The colour, spectral energy distribution (SED), and linear size
consistently indicate that these regions are coeval and have been formed after
a single burst of star formation that occurred ~< 100 Myr ago. These regions
might become free floating objects within the cluster potential well, and be
the local analogues of compact sources produced after the interaction of
gas-rich systems that occurred during the early formation of clusters.
|
astro-ph.GA
|
during pilot observations of the virgo environmental survey tracing galaxy evolution vestige a blind narrowband halphanii imaging survey of the virgo cluster carried out with megacam at the cfht we have observed the spiral galaxy ngc 4254 m99 deep halphanii narrowband and galex uv images revealed the presence of 60 compact 70500 pc radius star forming regions up to 20 kpc outside the optical disc of the galaxy these regions are located along a tail of hi gas stripped from the disc of the galaxy after a rapid gravitational encounter with another virgo cluster member that simulations indicate occurred 280750 myr ago we have combined the vestige data with multifrequency data from the uv to the farinfrared to characterise the stellar populations of these regions and study the star formation process in an extreme environment such as the tails of stripped gas embedded in the hot intracluster medium the colour spectral energy distribution sed and linear size consistently indicate that these regions are coeval and have been formed after a single burst of star formation that occurred 100 myr ago these regions might become free floating objects within the cluster potential well and be the local analogues of compact sources produced after the interaction of gasrich systems that occurred during the early formation of clusters
|
[['during', 'pilot', 'observations', 'of', 'the', 'virgo', 'environmental', 'survey', 'tracing', 'galaxy', 'evolution', 'vestige', 'a', 'blind', 'narrowband', 'halphanii', 'imaging', 'survey', 'of', 'the', 'virgo', 'cluster', 'carried', 'out', 'with', 'megacam', 'at', 'the', 'cfht', 'we', 'have', 'observed', 'the', 'spiral', 'galaxy', 'ngc', '4254', 'm99', 'deep', 'halphanii', 'narrowband', 'and', 'galex', 'uv', 'images', 'revealed', 'the', 'presence', 'of', '60', 'compact', '70500', 'pc', 'radius', 'star', 'forming', 'regions', 'up', 'to', '20', 'kpc', 'outside', 'the', 'optical', 'disc', 'of', 'the', 'galaxy', 'these', 'regions', 'are', 'located', 'along', 'a', 'tail', 'of', 'hi', 'gas', 'stripped', 'from', 'the', 'disc', 'of', 'the', 'galaxy', 'after', 'a', 'rapid', 'gravitational', 'encounter', 'with', 'another', 'virgo', 'cluster', 'member', 'that', 'simulations', 'indicate', 'occurred', '280750', 'myr', 'ago', 'we', 'have', 'combined', 'the', 'vestige', 'data', 'with', 'multifrequency', 'data', 'from', 'the', 'uv', 'to', 'the', 'farinfrared', 'to', 'characterise', 'the', 'stellar', 'populations', 'of', 'these', 'regions', 'and', 'study', 'the', 'star', 'formation', 'process', 'in', 'an', 'extreme', 'environment', 'such', 'as', 'the', 'tails', 'of', 'stripped', 'gas', 'embedded', 'in', 'the', 'hot', 'intracluster', 'medium', 'the', 'colour', 'spectral', 'energy', 'distribution', 'sed', 'and', 'linear', 'size', 'consistently', 'indicate', 'that', 'these', 'regions', 'are', 'coeval', 'and', 'have', 'been', 'formed', 'after', 'a', 'single', 'burst', 'of', 'star', 'formation', 'that', 'occurred', '100', 'myr', 'ago', 'these', 'regions', 'might', 'become', 'free', 'floating', 'objects', 'within', 'the', 'cluster', 'potential', 'well', 'and', 'be', 'the', 'local', 'analogues', 'of', 'compact', 'sources', 'produced', 'after', 'the', 'interaction', 'of', 'gasrich', 'systems', 'that', 'occurred', 'during', 'the', 'early', 'formation', 'of', 'clusters']]
|
[-0.05963611433056192, 0.08081342665992391, -0.11140407386418676, 0.08425356320269678, -0.07086657484118591, -0.000262847028522552, 0.021965347870174692, 0.4786153577755545, -0.17005324949484282, -0.3327793268852423, 0.07204900486568842, -0.28873140472379105, -0.027216621891108003, 0.16841328585526916, 0.010285257204070199, -0.05996981983031712, 0.10763276071765321, -0.10903527431960314, -0.023258128819256044, -0.3174065832760202, 0.2984821146156064, 0.08578564305982887, 0.12630700929717065, -0.08428255032539089, 0.048993112054810134, -0.0912276813901839, -0.11428889650938527, -0.05791407247469978, -0.14448336470900996, -0.002931971622741929, 0.22752991710407616, 0.1386184889864542, 0.2787648388500125, -0.414010219513134, -0.23977975299251136, 0.05469087768176344, 0.22673433037065666, 0.006369837294289163, -0.10740926118119333, -0.3446529205142146, 0.0683506255834494, -0.20426848332917702, -0.2113859885106751, 0.14421210071141613, 0.034838537662181236, 0.038337540711606985, -0.18342814134884294, 0.18048233267085226, -0.014525417667415393, 0.09361336455750062, -0.12505914448764802, -0.0635500154349187, -0.07595584940961693, 0.10184078239977237, -0.03707844276314658, 0.1008822604737497, 0.25777759877627576, -0.1543377436693131, 0.016070972340916954, 0.3526547588854071, -0.038127772652748894, 0.11852642591655359, 0.2726136953102111, -0.23787545107487834, -0.1937172980968205, 0.16238203637898144, 0.1567363579677, 0.08781963479857474, -0.17505527565160017, 0.004628643387804574, -0.029837882746267787, 0.19974509373586843, 0.08446164708693346, 0.0937589390497659, 0.3642746495674843, 0.09177290643869995, 0.03010444832415207, 0.12302513336534307, -0.29143948836478395, -0.060673489511691936, -0.2088947558947447, -0.05707167684226776, -0.11228510536575498, 0.05300895999257549, -0.12701992003026008, -0.12129414803919679, 0.31805035207751337, 0.07465870757630774, 0.2053279053989937, -0.005551983796007862, 0.2739379550896098, 0.017087264393377946, 0.18373040915749722, 0.12683680380703272, 0.3028935661243501, 0.1755118346087652, 0.06577818649690424, -0.22624968832182463, 0.04235360416731684, -0.03681811612484559]
|
1,803.04178
|
Understanding the mechanical properties of reduced activation steels
|
Reduced activation ferritic/martensitic (RAFM) steels are structural
materials with potential application in Generation-IV fission and fusion
reactors. We use density-functional theory to scrutinize the micro-mechanical
properties of the main alloy phases of three RAFM steels based on the
body-centered cubic FeCrWVMn solid solution. We assess the lattice parameters
and elastic properties of ferromagnetic $\alpha$-Fe and Fe$_{91}$Cr$_{9}$,
which are the main building blocks of the RAFM steels, and present a detailed
analysis of the calculated alloying effects of V, Cr, Mn, and W on the
mechanical properties of Fe$_{91}$Cr$_{9}$. The composition dependence of the
elastic parameters is decomposed into electronic and volumetric contributions
and studied for alloying levels that cover the typical intervals in RAFM
steels. A linear superposition of the individual solute effects on the
properties of Fe$_{91}$Cr$_{9}$ is shown to provide an excellent approximation
for the \emph{ab initio} values obtained for the RAFM steels. The intrinsic
ductility is evaluated through Rice's phenomenological theory using the surface
and unstable stacking fault energies, and the predictions are contrasted with
those obtained by empirical criteria. Alloying with V or W is found to enhance
the ductility, whereas additional Cr or Mn turns the RAFM base alloys more
brittle.
|
cond-mat.mtrl-sci
|
reduced activation ferriticmartensitic rafm steels are structural materials with potential application in generationiv fission and fusion reactors we use densityfunctional theory to scrutinize the micromechanical properties of the main alloy phases of three rafm steels based on the bodycentered cubic fecrwvmn solid solution we assess the lattice parameters and elastic properties of ferromagnetic alphafe and fe_91cr_9 which are the main building blocks of the rafm steels and present a detailed analysis of the calculated alloying effects of v cr mn and w on the mechanical properties of fe_91cr_9 the composition dependence of the elastic parameters is decomposed into electronic and volumetric contributions and studied for alloying levels that cover the typical intervals in rafm steels a linear superposition of the individual solute effects on the properties of fe_91cr_9 is shown to provide an excellent approximation for the emphab initio values obtained for the rafm steels the intrinsic ductility is evaluated through rices phenomenological theory using the surface and unstable stacking fault energies and the predictions are contrasted with those obtained by empirical criteria alloying with v or w is found to enhance the ductility whereas additional cr or mn turns the rafm base alloys more brittle
|
[['reduced', 'activation', 'ferriticmartensitic', 'rafm', 'steels', 'are', 'structural', 'materials', 'with', 'potential', 'application', 'in', 'generationiv', 'fission', 'and', 'fusion', 'reactors', 'we', 'use', 'densityfunctional', 'theory', 'to', 'scrutinize', 'the', 'micromechanical', 'properties', 'of', 'the', 'main', 'alloy', 'phases', 'of', 'three', 'rafm', 'steels', 'based', 'on', 'the', 'bodycentered', 'cubic', 'fecrwvmn', 'solid', 'solution', 'we', 'assess', 'the', 'lattice', 'parameters', 'and', 'elastic', 'properties', 'of', 'ferromagnetic', 'alphafe', 'and', 'fe_91cr_9', 'which', 'are', 'the', 'main', 'building', 'blocks', 'of', 'the', 'rafm', 'steels', 'and', 'present', 'a', 'detailed', 'analysis', 'of', 'the', 'calculated', 'alloying', 'effects', 'of', 'v', 'cr', 'mn', 'and', 'w', 'on', 'the', 'mechanical', 'properties', 'of', 'fe_91cr_9', 'the', 'composition', 'dependence', 'of', 'the', 'elastic', 'parameters', 'is', 'decomposed', 'into', 'electronic', 'and', 'volumetric', 'contributions', 'and', 'studied', 'for', 'alloying', 'levels', 'that', 'cover', 'the', 'typical', 'intervals', 'in', 'rafm', 'steels', 'a', 'linear', 'superposition', 'of', 'the', 'individual', 'solute', 'effects', 'on', 'the', 'properties', 'of', 'fe_91cr_9', 'is', 'shown', 'to', 'provide', 'an', 'excellent', 'approximation', 'for', 'the', 'emphab', 'initio', 'values', 'obtained', 'for', 'the', 'rafm', 'steels', 'the', 'intrinsic', 'ductility', 'is', 'evaluated', 'through', 'rices', 'phenomenological', 'theory', 'using', 'the', 'surface', 'and', 'unstable', 'stacking', 'fault', 'energies', 'and', 'the', 'predictions', 'are', 'contrasted', 'with', 'those', 'obtained', 'by', 'empirical', 'criteria', 'alloying', 'with', 'v', 'or', 'w', 'is', 'found', 'to', 'enhance', 'the', 'ductility', 'whereas', 'additional', 'cr', 'or', 'mn', 'turns', 'the', 'rafm', 'base', 'alloys', 'more', 'brittle']]
|
[-0.06895692206885588, 0.13709778634577177, -0.056304760239466296, 0.014250384439647044, -0.0017348478773858437, -0.10779088210871386, 0.06088450265155395, 0.39354533583079415, -0.241680064543448, -0.2632246699241787, 0.023666078847660154, -0.3188361079796918, -0.122886511926256, 0.15985329744955717, 0.026510190218687057, 0.05128225654589562, 0.04024306124671226, -0.032624143762507996, -0.12527981162258453, -0.2302144792569398, 0.2599557290614592, 0.08154869312660519, 0.31123674036118865, 0.07157570015418238, 0.03589526502674772, 0.007934958626007297, 0.04108615600763215, 0.04384212190592565, -0.17677560667634118, 0.13641283874035112, 0.2340876222816152, -0.021059229032654968, 0.16578463327917317, -0.4692973717471066, -0.24093114968254856, 0.0071973853826177185, 0.056924051041090766, 0.06209381068900669, -0.04583120952561658, -0.23007672968963833, 0.10895120431116984, -0.12734410593756618, -0.09915651796450455, -0.08502334276617494, 0.0008939486188986866, 0.07431116283957645, -0.2525745858390307, 0.06871611150413674, 0.056913072341445776, 0.0960038873119779, -0.1664080375195817, -0.23882035073372967, -0.1013426147713374, 0.05336069578986576, 0.049172155759489335, -0.018035195592656424, 0.194254846216093, -0.06491866614909593, -0.06500509486428087, 0.4458337788825336, -0.00020841114011775587, -0.11479754371750985, 0.1790632055940337, -0.08832769189877543, -0.1099459543528957, 0.1354799042455852, 0.13348935780861923, 0.06610910739697463, -0.15661126458249294, 0.07860092674688071, 0.08385653019829932, 0.16865649453745962, 0.053749739161222096, 0.0034447441639057024, 0.1530272096825149, 0.22386138826205404, -0.02520743021069421, 0.12109314635175175, -0.06088762022626884, -0.029153654299023533, -0.24102269427505196, -0.16896833320023472, -0.15522614046787248, 0.03931097304220455, -0.13150581107263334, -0.20928725012690286, 0.3637463380486618, 0.07178689730887723, 0.16073645521243363, -0.020671768070164992, 0.21114669066131325, 0.05558688052901134, 0.05256507569155821, -0.025794478370952084, 0.26263858575351984, 0.1995521559243177, 0.0685212861688942, -0.26133280062145486, 0.12079005449357413, 0.07011446407059994]
|
1,803.04179
|
Interactions mediated by a public good transiently increase
cooperativity in growing Pseudomonas putida metapopulations
|
Bacterial communities have rich social lives. A well-established interaction
involves the exchange of a public good in Pseudomonas populations, where the
iron-scavenging compound pyoverdine, synthesized by some cells, is shared with
the rest. Pyoverdine thus mediates interactions between producers and
non-producers and can constitute a public good. This interaction is often used
to test game theoretical predictions on the "social dilemma" of producers. Such
an approach, however, underestimates the impact of specific properties of the
public good, for example consequences of its accumulation in the environment.
Here, we experimentally quantify costs and benefits of pyoverdine production in
a specific environment, and build a model of population dynamics that
explicitly accounts for the changing significance of accumulating pyoverdine as
chemical mediator of social interactions. The model predicts that, in an
ensemble of growing populations (metapopulation) with different initial
producer fractions (and consequently pyoverdine contents), the global producer
fraction initially increases. Because the benefit of pyoverdine declines at
saturating concentrations, the increase need only be transient. Confirmed by
experiments on metapopulations, our results show how a changing benefit of a
public good can shape social interactions in a bacterial population.
|
q-bio.PE
|
bacterial communities have rich social lives a wellestablished interaction involves the exchange of a public good in pseudomonas populations where the ironscavenging compound pyoverdine synthesized by some cells is shared with the rest pyoverdine thus mediates interactions between producers and nonproducers and can constitute a public good this interaction is often used to test game theoretical predictions on the social dilemma of producers such an approach however underestimates the impact of specific properties of the public good for example consequences of its accumulation in the environment here we experimentally quantify costs and benefits of pyoverdine production in a specific environment and build a model of population dynamics that explicitly accounts for the changing significance of accumulating pyoverdine as chemical mediator of social interactions the model predicts that in an ensemble of growing populations metapopulation with different initial producer fractions and consequently pyoverdine contents the global producer fraction initially increases because the benefit of pyoverdine declines at saturating concentrations the increase need only be transient confirmed by experiments on metapopulations our results show how a changing benefit of a public good can shape social interactions in a bacterial population
|
[['bacterial', 'communities', 'have', 'rich', 'social', 'lives', 'a', 'wellestablished', 'interaction', 'involves', 'the', 'exchange', 'of', 'a', 'public', 'good', 'in', 'pseudomonas', 'populations', 'where', 'the', 'ironscavenging', 'compound', 'pyoverdine', 'synthesized', 'by', 'some', 'cells', 'is', 'shared', 'with', 'the', 'rest', 'pyoverdine', 'thus', 'mediates', 'interactions', 'between', 'producers', 'and', 'nonproducers', 'and', 'can', 'constitute', 'a', 'public', 'good', 'this', 'interaction', 'is', 'often', 'used', 'to', 'test', 'game', 'theoretical', 'predictions', 'on', 'the', 'social', 'dilemma', 'of', 'producers', 'such', 'an', 'approach', 'however', 'underestimates', 'the', 'impact', 'of', 'specific', 'properties', 'of', 'the', 'public', 'good', 'for', 'example', 'consequences', 'of', 'its', 'accumulation', 'in', 'the', 'environment', 'here', 'we', 'experimentally', 'quantify', 'costs', 'and', 'benefits', 'of', 'pyoverdine', 'production', 'in', 'a', 'specific', 'environment', 'and', 'build', 'a', 'model', 'of', 'population', 'dynamics', 'that', 'explicitly', 'accounts', 'for', 'the', 'changing', 'significance', 'of', 'accumulating', 'pyoverdine', 'as', 'chemical', 'mediator', 'of', 'social', 'interactions', 'the', 'model', 'predicts', 'that', 'in', 'an', 'ensemble', 'of', 'growing', 'populations', 'metapopulation', 'with', 'different', 'initial', 'producer', 'fractions', 'and', 'consequently', 'pyoverdine', 'contents', 'the', 'global', 'producer', 'fraction', 'initially', 'increases', 'because', 'the', 'benefit', 'of', 'pyoverdine', 'declines', 'at', 'saturating', 'concentrations', 'the', 'increase', 'need', 'only', 'be', 'transient', 'confirmed', 'by', 'experiments', 'on', 'metapopulations', 'our', 'results', 'show', 'how', 'a', 'changing', 'benefit', 'of', 'a', 'public', 'good', 'can', 'shape', 'social', 'interactions', 'in', 'a', 'bacterial', 'population']]
|
[-0.09853987481798678, 0.13722465958858387, -0.06911324225534202, 0.10050742466308993, -0.045555370354297804, -0.12838765468165456, 0.10922890899822435, 0.3619412353950525, -0.24834634418434956, -0.3264690868090838, 0.034971183552506335, -0.31770521692961534, -0.15368444367715303, 0.14524648856386582, -0.037880147700222896, -0.05579439841769885, 0.08971640066975817, 0.00972110655826123, 0.05032456234622906, -0.2642978962988936, 0.2789197439517089, 0.0767493280507425, 0.3040984535856262, 0.07678298710940037, 0.09568096760510689, -0.006819978410522528, -0.017740326028075667, 0.021091992372303286, -0.08390119059528361, 0.11445943030272238, 0.2360731389300081, 0.1605489329101249, 0.330739100174829, -0.4422317562415638, -0.21158148937069257, 0.1263600074745874, 0.1630189829446216, 0.11145900374148937, -0.1201696885023814, -0.2636589813432133, 0.03402539131226626, -0.22947324542602635, -0.1282094848805411, -0.04759529669754167, 0.0282335224870174, 0.06347234309763015, -0.2785165581334243, 0.10361595964681776, -0.026944795337052428, 0.0949972773526103, -0.0649677494828425, -0.1001718683332643, -0.10457006493897082, 0.22968908710365388, 0.06527825074835636, -0.023122566037457735, 0.19449671657188214, -0.19757944423790005, -0.0982069913624726, 0.38171050340350576, -0.06810140962846936, -0.15202613213512908, 0.22628268757324546, -0.10801042577209459, -0.11272790693422097, 0.09769384265892248, 0.20971862230522129, 0.056105361880366016, -0.17640584765530046, 0.02545419365589701, -0.043761938406941404, 0.20672156449462123, 0.013831336580386216, 0.011438955062313036, 0.21489536310521198, 0.23854442446786453, 0.016788914053885138, 0.10284605201515544, -0.013781607308223306, -0.14318377418657716, -0.19833883525801196, -0.13082206093352586, -0.1390731974183034, 0.044301260554077314, -0.11623718572821266, -0.1163987707779967, 0.3605438507470815, 0.1381308459030915, 0.1772449846746136, 0.031357578395362844, 0.25413343822832574, -0.003996082589672729, 0.07078805677144524, 0.023886759901160303, 0.2260652116238685, 0.04838955725224459, 0.11005734446966513, -0.23214103231383337, 0.18328212591057474, -0.06455281894980247]
|
1,803.0418
|
The organizing vision of integrated health information systems
|
The notion of integration in the context of health information systems is
ill-defined yet in wide-spread use. We identify a variety of meanings spanning
from purely technical integration of information systems to integration of
services. This ambiguity (or interpretative flexibility), we argue, is inherent
rather accidental: it a necessary prerequisite for mobilising political and
ideological support among stakeholders for integrated health information
systems. Building on this, our aim is to trace out the career dynamics of the
vision of integration/ integrated. The career dynamics is the transformation of
both the imagery and material (technological) realisations of the unfolding
implementation of the vision of integrated care. Empirically we draw on a
large, ongoing project at the University hospital of North Norway (UNN) to
establish an integrated health information system
|
cs.CY
|
the notion of integration in the context of health information systems is illdefined yet in widespread use we identify a variety of meanings spanning from purely technical integration of information systems to integration of services this ambiguity or interpretative flexibility we argue is inherent rather accidental it a necessary prerequisite for mobilising political and ideological support among stakeholders for integrated health information systems building on this our aim is to trace out the career dynamics of the vision of integration integrated the career dynamics is the transformation of both the imagery and material technological realisations of the unfolding implementation of the vision of integrated care empirically we draw on a large ongoing project at the university hospital of north norway unn to establish an integrated health information system
|
[['the', 'notion', 'of', 'integration', 'in', 'the', 'context', 'of', 'health', 'information', 'systems', 'is', 'illdefined', 'yet', 'in', 'widespread', 'use', 'we', 'identify', 'a', 'variety', 'of', 'meanings', 'spanning', 'from', 'purely', 'technical', 'integration', 'of', 'information', 'systems', 'to', 'integration', 'of', 'services', 'this', 'ambiguity', 'or', 'interpretative', 'flexibility', 'we', 'argue', 'is', 'inherent', 'rather', 'accidental', 'it', 'a', 'necessary', 'prerequisite', 'for', 'mobilising', 'political', 'and', 'ideological', 'support', 'among', 'stakeholders', 'for', 'integrated', 'health', 'information', 'systems', 'building', 'on', 'this', 'our', 'aim', 'is', 'to', 'trace', 'out', 'the', 'career', 'dynamics', 'of', 'the', 'vision', 'of', 'integration', 'integrated', 'the', 'career', 'dynamics', 'is', 'the', 'transformation', 'of', 'both', 'the', 'imagery', 'and', 'material', 'technological', 'realisations', 'of', 'the', 'unfolding', 'implementation', 'of', 'the', 'vision', 'of', 'integrated', 'care', 'empirically', 'we', 'draw', 'on', 'a', 'large', 'ongoing', 'project', 'at', 'the', 'university', 'hospital', 'of', 'north', 'norway', 'unn', 'to', 'establish', 'an', 'integrated', 'health', 'information', 'system']]
|
[-0.12644606253029558, 0.005718519725203404, -0.12049606830013666, 0.07687061074864501, -0.12616722367146588, -0.06365862053885, 0.038900613533626276, 0.3901404928210683, -0.2528801944297482, -0.3195020775127364, 0.16187781592149023, -0.2860896599838349, -0.15344002087807693, 0.18761117085924475, -0.12629426357255677, 0.019924019643024902, 0.07908186627236584, 0.020253285199154432, -0.03315793106508419, -0.24641060711097296, 0.3014873348205812, 0.05817270412670786, 0.34116893353336675, 0.06364054848828654, 0.1278014498502456, 0.021163946581366434, -0.08792467902260502, -0.054386888931351386, -0.08762932309099862, 0.20392952321141256, 0.3636266920334241, 0.21898640943764466, 0.3685159444456964, -0.3992200439546521, -0.17351359834410543, 0.07650218181326751, 0.11677715336852597, 0.07746404038712852, -0.031199149741593192, -0.3147775672456822, -0.0031257444684665036, -0.20014885617108413, -0.14422053272476582, -0.06885295007817858, 0.037250251804412465, -0.03938914355125249, -0.20433460246390245, 0.018376158817214515, -0.000834968117043728, 0.17736120399282, -0.05345116140995556, -0.09237792190644656, -0.03415991825200104, 0.21209834682329845, 0.01193720490605695, 0.0001894868360319006, 0.18080371089176986, -0.1669119254201944, -0.1338696103308379, 0.38754122613976877, 0.03921949682852591, -0.1387885747822075, 0.1931290493372417, -0.09497783214997822, -0.17892843161115612, 0.07089353154787398, 0.23108045950414627, 0.024604115400492677, -0.2157785352759474, 0.04249336133015756, 0.0447480978604483, 0.15782931539428047, 0.027551994871670805, 0.03928237040270501, 0.2584466901571145, 0.23125502426089264, 0.058487404807008744, 0.09567541368012353, -0.02188025099247342, -0.13481576519277622, -0.2672683317580913, -0.19796901923699642, -0.14738680038410495, 0.06213096787925722, -0.061777359622440804, -0.1576665408293328, 0.36564409998648867, 0.23738377908332728, 0.10878315195807908, 0.0065227486321511935, 0.30554327430518885, 0.0392292174006497, 0.11465163505452824, 0.02574447614294807, 0.16813361100251162, 0.05436785358708264, 0.18161133663567502, -0.18872757335780116, 0.08922841773537082, -0.03125871954977102]
|
1,803.04181
|
A note on Liouville type equations on graphs
|
In this note, we study the Liouville equation $\Delta u = -e^u$ on a graph G
satisfying certain isoperimetric inequality. Following the idea of W. Ding, we
prove that there exists a uniform lower bound for the energy, $\Sigma_G e^u$ of
any solution $u$, to the equation. In particular, for the 2-dimensional lattice
graph $Z^2$; the lower bound is given by 4.
|
math.AP
|
in this note we study the liouville equation delta u eu on a graph g satisfying certain isoperimetric inequality following the idea of w ding we prove that there exists a uniform lower bound for the energy sigma_g eu of any solution u to the equation in particular for the 2dimensional lattice graph z2 the lower bound is given by 4
|
[['in', 'this', 'note', 'we', 'study', 'the', 'liouville', 'equation', 'delta', 'u', 'eu', 'on', 'a', 'graph', 'g', 'satisfying', 'certain', 'isoperimetric', 'inequality', 'following', 'the', 'idea', 'of', 'w', 'ding', 'we', 'prove', 'that', 'there', 'exists', 'a', 'uniform', 'lower', 'bound', 'for', 'the', 'energy', 'sigma_g', 'eu', 'of', 'any', 'solution', 'u', 'to', 'the', 'equation', 'in', 'particular', 'for', 'the', '2dimensional', 'lattice', 'graph', 'z2', 'the', 'lower', 'bound', 'is', 'given', 'by', '4']]
|
[-0.19184009314010866, 0.10993624750341548, -0.05578343465649446, 0.0678827233734678, -0.0466289956153172, -0.16809454506843305, 0.10087134861616326, 0.3020374078731068, -0.2695148457299735, -0.271451211736736, 0.05104512195713574, -0.32021566520093897, -0.10882844818664379, 0.13827795364710763, -0.0652487263633091, 0.013657712927240818, 0.05133084329913874, 0.09180233007693878, -0.0904630520762723, -0.2645301309721468, 0.36288657679879033, -0.0985800416636296, 0.2246824932402977, 0.1142731741925732, 0.07747577296447802, -0.02076723994152834, 0.052137192178395436, 0.006054695344484243, -0.31059525269295996, 0.1350329524119858, 0.1985852403535706, 0.11748143530939324, 0.2805108399909051, -0.36924030341696545, -0.1686613846142761, 0.19214870789866956, 0.09485549200326204, 0.037860126891097086, -0.06879829135761581, -0.23055866320968652, 0.12722895963148015, -0.10185169086593096, -0.17726143268624045, 0.04286325313761586, 0.08858602318424182, 0.015840059814241823, -0.26579351775103904, 0.08605422856683126, 0.14840107025257998, 0.009067847653002035, -0.08244796275909318, -0.1277049550801882, -0.07099540986609264, 0.015837982938182157, -0.01000905338079348, 0.15642605262014586, -0.0133616478930487, -0.09947609884252191, -0.051460416437905346, 0.35212478859991325, -0.1336194639720145, -0.20550108566635944, 0.0739408484259315, -0.20468067483915414, -0.19814746179541604, 0.04818675100620164, 0.09338413061455778, 0.11766032022653056, -0.10201988686028807, 0.24989873270091953, -0.1412555287271494, 0.14176367880532242, 0.10114419680149829, 0.00023355053310267261, 0.044631200392165636, 0.11522268948954392, 0.2128933247285666, 0.1182858232775184, 0.014737149948620649, -0.0032966594349165433, -0.35430211134132794, -0.18188430539324696, -0.2072251610396827, 0.15485621727697674, -0.16529614176051538, -0.163074354549534, 0.3310095409282529, 0.04990312297920101, 0.15807076998543543, 0.0768368865103751, 0.17471998480156248, 0.18081469827743826, -0.03416300121481057, 0.14623099391455532, 0.14017989062017105, 0.17688055548694778, 0.04589531247763604, -0.18829469774376417, 0.011506149033847892, 0.18357945099228717]
|
1,803.04182
|
$H^2$-scattering for systems of weakly coupled fourth-order NLS
equations in low space dimensions
|
We prove large-data scattering and existence of wave operators in the energy
space for the systems of $N$ defocusing fourth-order Schr\"odinger equations
with mass-supercritical and energy-subcritical power-type nonlinearity. In
addition, new nonlinear interaction Morawetz identities and inequalities are
given, suitable to shed lights on the decay of the solution with respect some
Lebesgue norms when the space dimensions are $d=3,4$.
|
math.AP
|
we prove largedata scattering and existence of wave operators in the energy space for the systems of n defocusing fourthorder schrodinger equations with masssupercritical and energysubcritical powertype nonlinearity in addition new nonlinear interaction morawetz identities and inequalities are given suitable to shed lights on the decay of the solution with respect some lebesgue norms when the space dimensions are d34
|
[['we', 'prove', 'largedata', 'scattering', 'and', 'existence', 'of', 'wave', 'operators', 'in', 'the', 'energy', 'space', 'for', 'the', 'systems', 'of', 'n', 'defocusing', 'fourthorder', 'schrodinger', 'equations', 'with', 'masssupercritical', 'and', 'energysubcritical', 'powertype', 'nonlinearity', 'in', 'addition', 'new', 'nonlinear', 'interaction', 'morawetz', 'identities', 'and', 'inequalities', 'are', 'given', 'suitable', 'to', 'shed', 'lights', 'on', 'the', 'decay', 'of', 'the', 'solution', 'with', 'respect', 'some', 'lebesgue', 'norms', 'when', 'the', 'space', 'dimensions', 'are', 'd34']]
|
[-0.1678376512757192, 0.09571681419232239, -0.02774017273914069, 0.11103034923241163, -0.0979452054675979, -0.18132988804330427, -0.07762208729206274, 0.2957178158122891, -0.2487608413832883, -0.18726562810770703, 0.14442242824006826, -0.3846426954182486, -0.1372034022109195, 0.1940756099841868, 0.008667383529245853, 0.14568947316147388, 0.02309886224102229, -0.009115491372843584, -0.07973492098972201, -0.2678335186094046, 0.4571397140622139, -0.09629874804522842, 0.2040579385201757, 0.0640926821778218, 0.07746085970041652, 0.021239903192811955, 0.017809053898478547, -0.06693614064812815, -0.15515550185615817, 0.13419733348612983, 0.17227264765436606, 0.035021645610686394, 0.2692511452672382, -0.4541111882776022, -0.22161873179720715, 0.15108709384027558, 0.1392238665993015, 0.06935115926899016, -0.0460351658189514, -0.3728965324970583, -0.017005902466674647, -0.03964718218582372, -0.24291156205969552, -0.12395116760550688, 0.05117527584855755, 0.1500247078947723, -0.3421828096732497, 0.12944917512747148, 0.046779091543673226, -0.01922315268893726, -0.1880668381229043, -0.07527587129734456, -0.016583355236798526, 0.00017151608917629347, 0.05587811483613526, -0.008823466995575775, -0.03519829703339686, -0.12708994864175718, -0.07526310990409305, 0.3623478832344214, -0.07418580200367918, -0.3001324395959576, 0.12867657324920098, -0.2018996686208993, -0.10109841952410838, 0.10032935977602998, 0.21854584796043733, 0.12174085075190912, -0.10573758194732363, 0.19310831958136987, -0.012717197361780563, 0.143214403030773, 0.15038213214526575, 0.13166209183012445, 0.026527706688890856, 0.11534603754601752, 0.1643537537427619, 0.08912391302098209, 0.0156450079404749, -0.08457084700154761, -0.3566651557572186, -0.14599483789255221, -0.13344399879376093, 0.09122366210673742, -0.17612793813386815, -0.12827275776459526, 0.3387257469041894, 0.0992584615945816, 0.10651344439635674, 0.09826434404822067, 0.19092982394601374, 0.21639217109574627, 0.007086829259060323, 0.06282940783227484, 0.2486892773405998, 0.177572055591736, 0.1702109547254319, -0.23906296899852653, -0.0443128406147783, 0.16240161458263175]
|
1,803.04183
|
Cross-contextual use of integrated information systems
|
Large-scale organizations are increasingly promoting more collaborative and
collective work practices across organizational boarders. A predominant way to
achieve better collaboration in large- scale heterogeneous contexts is to
establish an integrated and standardized technological infrastructure.
Ethnographically inspired studies, on the other hand, have challenged such
perspective and illustrated that generic technology does not fit in local
contexts and needs to be worked-around. Similarly, this paper empirically
exemplifies local workarounds and illustrates ongoing and persistently
imperfect integration of a collaborative infrastructure in a global oil and gas
company. More importantly, however, our analysis focuses on how integrated
technology is used across contexts. We illustrate how local workarounds, as a
result of tight technological integration, shape use patterns across contexts.
Integrated systems establish interdependencies across contexts, thus, the use
implies cross-contextual rather than local enactment. Since the trajectory of
enactment is influenced by cross-contextual constrains, our study is addressing
the existing overemphasis on studying/analysing the use of technology in
isolated local contexts. Practically, our study suggests considering
workarounds as an intrinsic part of every day work, which should be calculated
as additional costs of making the generic technology to work in practice.
|
cs.CY
|
largescale organizations are increasingly promoting more collaborative and collective work practices across organizational boarders a predominant way to achieve better collaboration in large scale heterogeneous contexts is to establish an integrated and standardized technological infrastructure ethnographically inspired studies on the other hand have challenged such perspective and illustrated that generic technology does not fit in local contexts and needs to be workedaround similarly this paper empirically exemplifies local workarounds and illustrates ongoing and persistently imperfect integration of a collaborative infrastructure in a global oil and gas company more importantly however our analysis focuses on how integrated technology is used across contexts we illustrate how local workarounds as a result of tight technological integration shape use patterns across contexts integrated systems establish interdependencies across contexts thus the use implies crosscontextual rather than local enactment since the trajectory of enactment is influenced by crosscontextual constrains our study is addressing the existing overemphasis on studyinganalysing the use of technology in isolated local contexts practically our study suggests considering workarounds as an intrinsic part of every day work which should be calculated as additional costs of making the generic technology to work in practice
|
[['largescale', 'organizations', 'are', 'increasingly', 'promoting', 'more', 'collaborative', 'and', 'collective', 'work', 'practices', 'across', 'organizational', 'boarders', 'a', 'predominant', 'way', 'to', 'achieve', 'better', 'collaboration', 'in', 'large', 'scale', 'heterogeneous', 'contexts', 'is', 'to', 'establish', 'an', 'integrated', 'and', 'standardized', 'technological', 'infrastructure', 'ethnographically', 'inspired', 'studies', 'on', 'the', 'other', 'hand', 'have', 'challenged', 'such', 'perspective', 'and', 'illustrated', 'that', 'generic', 'technology', 'does', 'not', 'fit', 'in', 'local', 'contexts', 'and', 'needs', 'to', 'be', 'workedaround', 'similarly', 'this', 'paper', 'empirically', 'exemplifies', 'local', 'workarounds', 'and', 'illustrates', 'ongoing', 'and', 'persistently', 'imperfect', 'integration', 'of', 'a', 'collaborative', 'infrastructure', 'in', 'a', 'global', 'oil', 'and', 'gas', 'company', 'more', 'importantly', 'however', 'our', 'analysis', 'focuses', 'on', 'how', 'integrated', 'technology', 'is', 'used', 'across', 'contexts', 'we', 'illustrate', 'how', 'local', 'workarounds', 'as', 'a', 'result', 'of', 'tight', 'technological', 'integration', 'shape', 'use', 'patterns', 'across', 'contexts', 'integrated', 'systems', 'establish', 'interdependencies', 'across', 'contexts', 'thus', 'the', 'use', 'implies', 'crosscontextual', 'rather', 'than', 'local', 'enactment', 'since', 'the', 'trajectory', 'of', 'enactment', 'is', 'influenced', 'by', 'crosscontextual', 'constrains', 'our', 'study', 'is', 'addressing', 'the', 'existing', 'overemphasis', 'on', 'studyinganalysing', 'the', 'use', 'of', 'technology', 'in', 'isolated', 'local', 'contexts', 'practically', 'our', 'study', 'suggests', 'considering', 'workarounds', 'as', 'an', 'intrinsic', 'part', 'of', 'every', 'day', 'work', 'which', 'should', 'be', 'calculated', 'as', 'additional', 'costs', 'of', 'making', 'the', 'generic', 'technology', 'to', 'work', 'in', 'practice']]
|
[-0.08478195981430897, 0.02746911896156726, -0.08244569708995923, 0.08386808988650808, -0.10188949121338492, -0.12552406999811128, 0.04194398312892362, 0.39479900174648375, -0.25492898347107945, -0.33389474665997804, 0.1157609380636918, -0.2314349885762518, -0.18237622342343016, 0.23577211011843, -0.12128374890952899, 0.002486947297143775, 0.04638846151631426, -0.027293770936493936, -0.0411636343490131, -0.250296251561392, 0.30423163194209335, 0.08611431592018218, 0.36334488697199, 0.07674136144184583, 0.04626119051166382, 0.007223869958338705, -0.11225487024498147, 0.00709438336056632, -0.08100675030228387, 0.1797439463990363, 0.3415584201156791, 0.16741911289911415, 0.34201207932185484, -0.4654243482344444, -0.21750175162797442, 0.09532543661299388, 0.17418383850992933, 0.07400131721137646, -0.02527516967934758, -0.28211847583108857, 0.057853988756903924, -0.20154575205005304, -0.13566024982294925, -0.10643611391754569, 0.010057437613707136, 0.001839106560785424, -0.2407156975713332, 0.02974658411348591, 0.04128102512929488, 0.10475223507430102, -0.03292441206128412, -0.08913902773244961, -0.000943800072009499, 0.16556735083058075, 0.05494756018742919, 0.017225392225097766, 0.20920295976468117, -0.13365615971159894, -0.14191496141563245, 0.3738090371713042, -0.01038435615411947, -0.1481318112324319, 0.22161571512508482, -0.07398638182659507, -0.16477210751004717, 0.011735055220275613, 0.20570895611623152, 0.06022555096376989, -0.19582092026500283, 0.057725643908063805, 0.004176076082512736, 0.19353015540620766, 0.033783151166563906, 0.047728748102294834, 0.22632827164756286, 0.23341230847746938, 0.11851497000913966, 0.08688067401746741, 0.014422145026194787, -0.1464683945454355, -0.21695378301602258, -0.14227125930876747, -0.14432729889538037, 0.017023547562043738, -0.04982898641020576, -0.11394840198241778, 0.3493661534796293, 0.2044295698026749, 0.1602473072987679, -0.00017718686722218991, 0.3257186259822668, 0.026776950043544325, 0.1077081845374778, 0.0683412143041858, 0.205427164977064, 0.019107110331439085, 0.17194215561942877, -0.14164911602195857, 0.14613188701379742, -0.039603319834615736]
|
1,803.04184
|
On the first-passage area of a L$\acute{\text{e}}$vy process
|
Let be $X(t)= x - \mu t + \sigma B_t - N_t$ a L$\acute{\text{e}}$vy process
starting from $x >0,$ where $ \mu \ge 0, \ \sigma \ge 0, \ B_t$ is a standard
BM, and $N_t$ is a homogeneous Poisson process with intensity $ \theta >0,$
starting from zero. We study the joint distribution of the first-passage time
below zero, $\tau (x),$ and the first-passage area, $A(x),$ swept out by $X$
till the time $\tau (x).$ In particular, we establish differential-difference
equations with outer conditions for the Laplace transforms of $\tau(x)$ and
$A(x),$ and for their joint moments. In a special case $(\mu = \sigma =0),$ we
show an algorithm to find recursively the moments $E[\tau(x)^m A(x)^n],$ for
any integers $m$ and $n;$ moreover, we obtain the expected value of the time
average of $X$ till the time $\tau(x).$
|
math.PR
|
let be xt x mu t sigma b_t n_t a lacutetextevy process starting from x 0 where mu ge 0 sigma ge 0 b_t is a standard bm and n_t is a homogeneous poisson process with intensity theta 0 starting from zero we study the joint distribution of the firstpassage time below zero tau x and the firstpassage area ax swept out by x till the time tau x in particular we establish differentialdifference equations with outer conditions for the laplace transforms of taux and ax and for their joint moments in a special case mu sigma 0 we show an algorithm to find recursively the moments etauxm axn for any integers m and n moreover we obtain the expected value of the time average of x till the time taux
|
[['let', 'be', 'xt', 'x', 'mu', 't', 'sigma', 'b_t', 'n_t', 'a', 'lacutetextevy', 'process', 'starting', 'from', 'x', '0', 'where', 'mu', 'ge', '0', 'sigma', 'ge', '0', 'b_t', 'is', 'a', 'standard', 'bm', 'and', 'n_t', 'is', 'a', 'homogeneous', 'poisson', 'process', 'with', 'intensity', 'theta', '0', 'starting', 'from', 'zero', 'we', 'study', 'the', 'joint', 'distribution', 'of', 'the', 'firstpassage', 'time', 'below', 'zero', 'tau', 'x', 'and', 'the', 'firstpassage', 'area', 'ax', 'swept', 'out', 'by', 'x', 'till', 'the', 'time', 'tau', 'x', 'in', 'particular', 'we', 'establish', 'differentialdifference', 'equations', 'with', 'outer', 'conditions', 'for', 'the', 'laplace', 'transforms', 'of', 'taux', 'and', 'ax', 'and', 'for', 'their', 'joint', 'moments', 'in', 'a', 'special', 'case', 'mu', 'sigma', '0', 'we', 'show', 'an', 'algorithm', 'to', 'find', 'recursively', 'the', 'moments', 'etauxm', 'axn', 'for', 'any', 'integers', 'm', 'and', 'n', 'moreover', 'we', 'obtain', 'the', 'expected', 'value', 'of', 'the', 'time', 'average', 'of', 'x', 'till', 'the', 'time', 'taux']]
|
[-0.1632778551934879, 0.165766331415137, -0.04139246253383368, 0.0001132211950754245, -0.011020594617611793, -0.1549042406268129, 0.10773944458382767, 0.3662351751339066, -0.3407955132858005, -0.19063143522836007, 0.08297315289179773, -0.29934114118308813, -0.04725244829914886, 0.10769561367549811, 0.02688979942264945, 0.031131591947474915, -0.01635656612853036, 0.11647472570671938, -0.12664114054321318, -0.2225731864802597, 0.24542245860825213, -0.04038138770635507, 0.15552512032896743, -0.04555384666738353, 0.12929381276733537, -0.002911122678237599, 0.002304622961222663, -0.05513811300783021, -0.24537689784585043, -0.04585900648619778, 0.21151610390218192, 0.07289048411356386, 0.2297790433070803, -0.3317027337300454, -0.1392167259744087, 0.19457774350506274, 0.12692265975642805, -0.08085709608831378, 0.04384103858511346, -0.29227425456732914, 0.13672330982752087, -0.055917123063691246, -0.16965284109000087, 0.0051007212803865125, 0.17426365047202322, 0.046134356525726616, -0.3847802021908899, 0.08668728315726269, 0.09328539136349577, 0.023435053177351176, -0.013536015547118908, -0.24354858536186608, -0.045015252271104, 0.08047557705941126, 0.047029629603746646, 0.14229969037949403, 0.07928941796476006, -0.05355185693826584, -0.04242014747055233, 0.3367749384871518, -0.13545622598639753, -0.21229502079329748, 0.04172436175182057, -0.2679866458246008, -0.16036772161953208, 0.1614546381675299, 0.1300827120972234, 0.18263536366063726, -0.08055382881804492, 0.2643199211122764, -0.03798363979386036, 0.15575802422944426, 0.0759476849939241, -0.04242150246909307, 0.14698472671759452, 0.12719061123676484, 0.09392887802186328, 0.07944040472146355, -0.1339391825085347, -0.014796108148663572, -0.3741803681838882, -0.19060875851545453, -0.1995559881491832, 0.22530125991744532, -0.13934465590808018, -0.09042744215058032, 0.2791641778781895, 0.07986432216816054, 0.24710363806983413, 0.15963492613256902, 0.17158443480730057, 0.18778860218716467, -0.07479712832177621, 0.08345818314917905, 0.03747697466399607, 0.15590614691383906, 0.12096619654750061, -0.17597001509798704, 0.005020067030780537, 0.06080531753426374]
|
1,803.04185
|
Living with technology
|
Our use of IT has, broadly speaking, until recently evolved around
work-oriented tasks. This is or, indeed, has been changing. IT has moved beyond
the workplace and into leisure, entertainment, games and our homes. It has in
short moved into our everyday life. My retired father and oldest daughter use
it. Use is no longer delineated but seeps into and get intervowen with a number
of my activities: while paying for my groceries, planning this summer vacation
and so forth.
|
cs.CY
|
our use of it has broadly speaking until recently evolved around workoriented tasks this is or indeed has been changing it has moved beyond the workplace and into leisure entertainment games and our homes it has in short moved into our everyday life my retired father and oldest daughter use it use is no longer delineated but seeps into and get intervowen with a number of my activities while paying for my groceries planning this summer vacation and so forth
|
[['our', 'use', 'of', 'it', 'has', 'broadly', 'speaking', 'until', 'recently', 'evolved', 'around', 'workoriented', 'tasks', 'this', 'is', 'or', 'indeed', 'has', 'been', 'changing', 'it', 'has', 'moved', 'beyond', 'the', 'workplace', 'and', 'into', 'leisure', 'entertainment', 'games', 'and', 'our', 'homes', 'it', 'has', 'in', 'short', 'moved', 'into', 'our', 'everyday', 'life', 'my', 'retired', 'father', 'and', 'oldest', 'daughter', 'use', 'it', 'use', 'is', 'no', 'longer', 'delineated', 'but', 'seeps', 'into', 'and', 'get', 'intervowen', 'with', 'a', 'number', 'of', 'my', 'activities', 'while', 'paying', 'for', 'my', 'groceries', 'planning', 'this', 'summer', 'vacation', 'and', 'so', 'forth']]
|
[-0.005409654082121471, 0.16046315731289676, -0.17846553339264715, 0.058811248548758716, -0.13773249247923303, -0.17095481586427644, 0.07145664585419954, 0.38644846982489794, -0.1867679639791067, -0.3337405037899048, 0.13806426241092432, -0.31366024629618877, -0.12603247282393754, 0.18571010447787836, -0.16071297654595512, -0.07019594166829335, 0.06798391263836469, 0.09282123464016387, 0.04837351744899001, -0.32618833610262626, 0.2132991608650161, 0.03816390184697528, 0.24391103646932885, 0.04845757753504679, 0.08266958916106094, 0.0011758396091560523, -0.04167194935517051, -0.026025401953703318, -0.06206022787433213, 0.09224730774234885, 0.30078726247526133, 0.22410513731376389, 0.4189781973329492, -0.4531978954298374, -0.20982352527640522, 0.08002018716890746, 0.18444957302357906, 0.06252975498911184, -0.06555661015684167, -0.34670198128487056, 0.049934564367271006, -0.21256260144022796, -0.08305410251248246, -0.0075535448865057565, 0.14357918802983102, -0.026208257160107724, -0.10395819152920292, -0.03659983037505299, 0.06288051170863931, 0.09354941825119731, -0.0052069608713142, -0.15186360710037825, -0.030209347871370997, 0.22755393590957212, 0.12465684914600271, 0.07488941699147034, 0.1403115957450026, -0.07338681649297285, -0.06345555274627912, 0.43600609731406736, 0.04913576844578179, -0.07632461415890318, 0.19511695543172744, -0.14567447749253076, -0.1727483617977645, 0.09389701508319913, 0.1436823641952987, 0.0914258308416137, -0.1411104663872184, 0.04249455083313828, -0.02757504840608304, 0.1392995719678509, 0.08614452190410632, -0.03576641483978631, 0.2758888501363496, 0.22346795398073319, 0.053201211283568486, 0.08320052818490718, -0.004722716606174333, -0.16324265766888857, -0.17558528436944845, -0.17596884747931305, -0.13594419047093162, 0.053542726959746614, 0.07388253311140804, -0.09210865668809184, 0.3578710864441326, 0.15065321422074562, 0.10665373619383153, 0.043679979850705236, 0.31033751315986496, 0.0640555040907855, 0.1742311090302582, 0.11760930338156565, 0.23696343447917548, 0.016148504538413804, 0.24584191291628835, -0.06460513295128177, 0.12421694837319545, -0.022681313519103404]
|
1,803.04186
|
R3Net: Random Weights, Rectifier Linear Units and Robustness for
Artificial Neural Network
|
We consider a neural network architecture with randomized features, a
sign-splitter, followed by rectified linear units (ReLU). We prove that our
architecture exhibits robustness to the input perturbation: the output feature
of the neural network exhibits a Lipschitz continuity in terms of the input
perturbation. We further show that the network output exhibits a discrimination
ability that inputs that are not arbitrarily close generate output vectors
which maintain distance between each other obeying a certain lower bound. This
ensures that two different inputs remain discriminable while contracting the
distance in the output feature space.
|
stat.ML cs.LG
|
we consider a neural network architecture with randomized features a signsplitter followed by rectified linear units relu we prove that our architecture exhibits robustness to the input perturbation the output feature of the neural network exhibits a lipschitz continuity in terms of the input perturbation we further show that the network output exhibits a discrimination ability that inputs that are not arbitrarily close generate output vectors which maintain distance between each other obeying a certain lower bound this ensures that two different inputs remain discriminable while contracting the distance in the output feature space
|
[['we', 'consider', 'a', 'neural', 'network', 'architecture', 'with', 'randomized', 'features', 'a', 'signsplitter', 'followed', 'by', 'rectified', 'linear', 'units', 'relu', 'we', 'prove', 'that', 'our', 'architecture', 'exhibits', 'robustness', 'to', 'the', 'input', 'perturbation', 'the', 'output', 'feature', 'of', 'the', 'neural', 'network', 'exhibits', 'a', 'lipschitz', 'continuity', 'in', 'terms', 'of', 'the', 'input', 'perturbation', 'we', 'further', 'show', 'that', 'the', 'network', 'output', 'exhibits', 'a', 'discrimination', 'ability', 'that', 'inputs', 'that', 'are', 'not', 'arbitrarily', 'close', 'generate', 'output', 'vectors', 'which', 'maintain', 'distance', 'between', 'each', 'other', 'obeying', 'a', 'certain', 'lower', 'bound', 'this', 'ensures', 'that', 'two', 'different', 'inputs', 'remain', 'discriminable', 'while', 'contracting', 'the', 'distance', 'in', 'the', 'output', 'feature', 'space']]
|
[-0.14356146845966578, 0.093395317263741, -0.0725534173149255, 0.03743096883784259, -0.04987833085620115, -0.22452621169010256, 0.026005268101930937, 0.4158527479376844, -0.347309221904124, -0.259190914992203, 0.03518262372592524, -0.2514390686166383, -0.23908783625611055, 0.13967170959128247, -0.08503965137749209, 0.09209947383171448, 0.10160540104393036, 0.08243136666715145, -0.08452248959601806, -0.2533185504482038, 0.3096816855012089, 0.01167012023850925, 0.31650782425785234, -0.054938450816177556, 0.16604374468787222, -0.07079696079455716, 0.03810431974469333, 0.0010154768333254603, -0.027119945218459257, 0.13977914671563813, 0.23944822021870202, 0.16667732360812845, 0.3330120555856215, -0.41156015998774, -0.2274052739664111, 0.11552635826087827, 0.0966357931004016, 0.09212001717664421, -0.010760777522259022, -0.2592213438543421, 0.10545081083702865, -0.12605551906651066, -0.024227201953650482, -0.10242048593898935, -0.02918957677038927, 0.03419387564238321, -0.3280824845686795, 0.03744650883499973, 0.12499122523892951, -0.02115102612002883, -0.05075908707134345, -0.07001350583228212, -0.07213836877046012, 0.14228090132656757, -0.035888648878592715, 0.08655982274782434, 0.14301536058486308, -0.145724315802762, -0.09510057628084655, 0.2873420113277051, -0.10183758433577755, -0.2451345083774418, 0.15450114817784158, -0.09095416652158864, -0.12519577147829677, 0.08617957177702137, 0.20326067744604043, 0.023265709259336995, -0.11241673083815684, 0.017571002475276428, -0.05966558176473344, 0.23801329095912996, 0.10802049651711938, 0.09020688812378594, 0.16648965246815195, 0.18529411419845557, 0.09197618003549074, 0.22040122865150952, -0.09010586655142927, -0.07431040846952988, -0.29984909168855156, -0.06969700724459804, -0.20440505240212686, -0.0014643881303165608, -0.1493542851699937, -0.19160492697189893, 0.42825493922892716, 0.17684557388025907, 0.306201363963786, 0.19790080294979395, 0.31297194156094743, 0.08714518446590432, 0.108266417217511, 0.1543945736772511, 0.23657437139541232, 0.0704500549047264, 0.07451605977320302, -0.1785596513179361, 0.11622385569517651, 0.08828148099103121]
|
1,803.04187
|
All-optical attoclock for imaging tunnelling wavepackets
|
Recent experiments on measuring time-delays during tunnelling of cold atoms
through an optically created potential barrier are reinvigorating the
controversial debate regarding possible time-delays during light-induced
tunnelling of an electron from an atom. Compelling theoretical and experimental
arguments have been put forward to advocate opposite views, confirming or
refuting the existence of finite tunnelling time delays. Yet, such a delay,
whether present or not, is but a single quantity characterizing the tunnelling
wavepacket; the underlying dynamics are richer. Here we propose to augment
photo-electron detection in laser-induced tunnelling with detection of light
emitted by the tunnelling electron -- the so-called Brunel radiation. Using a
combination of single-color and two-color driving fields, we identify the
all-optical signatures of the re-shaping of the tunnelling wavepacket as it
emerges from the tunnelling barrier and moves away from the core. This
reshaping includes not only an effective time-delay but also time-reversal
asymmetry of the ionization process, which we describe theoretically and
observe experimentally. We show how both delay and reshaping are mapped on the
polarization properties of the Brunel radiation, with different harmonics
behaving as different hands of a clock moving at different speeds. The
all-optical detection paves the way to time-resolving optical tunnelling in
condensed matter systems, e.g. tunnelling across bandgaps in solids, on the
attosecond time-scale.
|
physics.optics
|
recent experiments on measuring timedelays during tunnelling of cold atoms through an optically created potential barrier are reinvigorating the controversial debate regarding possible timedelays during lightinduced tunnelling of an electron from an atom compelling theoretical and experimental arguments have been put forward to advocate opposite views confirming or refuting the existence of finite tunnelling time delays yet such a delay whether present or not is but a single quantity characterizing the tunnelling wavepacket the underlying dynamics are richer here we propose to augment photoelectron detection in laserinduced tunnelling with detection of light emitted by the tunnelling electron the socalled brunel radiation using a combination of singlecolor and twocolor driving fields we identify the alloptical signatures of the reshaping of the tunnelling wavepacket as it emerges from the tunnelling barrier and moves away from the core this reshaping includes not only an effective timedelay but also timereversal asymmetry of the ionization process which we describe theoretically and observe experimentally we show how both delay and reshaping are mapped on the polarization properties of the brunel radiation with different harmonics behaving as different hands of a clock moving at different speeds the alloptical detection paves the way to timeresolving optical tunnelling in condensed matter systems eg tunnelling across bandgaps in solids on the attosecond timescale
|
[['recent', 'experiments', 'on', 'measuring', 'timedelays', 'during', 'tunnelling', 'of', 'cold', 'atoms', 'through', 'an', 'optically', 'created', 'potential', 'barrier', 'are', 'reinvigorating', 'the', 'controversial', 'debate', 'regarding', 'possible', 'timedelays', 'during', 'lightinduced', 'tunnelling', 'of', 'an', 'electron', 'from', 'an', 'atom', 'compelling', 'theoretical', 'and', 'experimental', 'arguments', 'have', 'been', 'put', 'forward', 'to', 'advocate', 'opposite', 'views', 'confirming', 'or', 'refuting', 'the', 'existence', 'of', 'finite', 'tunnelling', 'time', 'delays', 'yet', 'such', 'a', 'delay', 'whether', 'present', 'or', 'not', 'is', 'but', 'a', 'single', 'quantity', 'characterizing', 'the', 'tunnelling', 'wavepacket', 'the', 'underlying', 'dynamics', 'are', 'richer', 'here', 'we', 'propose', 'to', 'augment', 'photoelectron', 'detection', 'in', 'laserinduced', 'tunnelling', 'with', 'detection', 'of', 'light', 'emitted', 'by', 'the', 'tunnelling', 'electron', 'the', 'socalled', 'brunel', 'radiation', 'using', 'a', 'combination', 'of', 'singlecolor', 'and', 'twocolor', 'driving', 'fields', 'we', 'identify', 'the', 'alloptical', 'signatures', 'of', 'the', 'reshaping', 'of', 'the', 'tunnelling', 'wavepacket', 'as', 'it', 'emerges', 'from', 'the', 'tunnelling', 'barrier', 'and', 'moves', 'away', 'from', 'the', 'core', 'this', 'reshaping', 'includes', 'not', 'only', 'an', 'effective', 'timedelay', 'but', 'also', 'timereversal', 'asymmetry', 'of', 'the', 'ionization', 'process', 'which', 'we', 'describe', 'theoretically', 'and', 'observe', 'experimentally', 'we', 'show', 'how', 'both', 'delay', 'and', 'reshaping', 'are', 'mapped', 'on', 'the', 'polarization', 'properties', 'of', 'the', 'brunel', 'radiation', 'with', 'different', 'harmonics', 'behaving', 'as', 'different', 'hands', 'of', 'a', 'clock', 'moving', 'at', 'different', 'speeds', 'the', 'alloptical', 'detection', 'paves', 'the', 'way', 'to', 'timeresolving', 'optical', 'tunnelling', 'in', 'condensed', 'matter', 'systems', 'eg', 'tunnelling', 'across', 'bandgaps', 'in', 'solids', 'on', 'the', 'attosecond', 'timescale']]
|
[-0.12492328838973508, 0.19831161381141943, -0.09459614983698318, 0.053094369159611715, -0.04190226083946467, -0.15024583057922153, 0.07042611186117492, 0.43392080232887614, -0.26877173921312997, -0.29869478042588904, -0.0033011519616988117, -0.28436025225047795, -0.11099316896914663, 0.20379970721979537, -0.004217716793854773, 0.02937607844975197, 0.006694096177904251, -0.03373636522567568, -0.018070107002200048, -0.16193943316521087, 0.29641969628711146, 0.06513034402862859, 0.27137827244806895, 0.09348131729759944, 0.10161051697774245, 0.052997242699485414, -0.0009250370560451147, -0.027392504608284962, -0.09935942688355011, 0.053020492761685814, 0.2013115641816941, 0.06054432330903474, 0.23551978182293615, -0.5069025833915286, -0.24503447262368183, 0.06797511624238226, 0.166888090119824, 0.18288077864266564, -0.12707787126021017, -0.3184778680915083, -0.04651971856343015, -0.12666464051042842, -0.12249369125259724, -0.07770568101649296, 0.03545631013617341, 0.019013587851077318, -0.1949852576450761, 0.06462460299344286, 0.006071608654719795, 0.045913416560616274, -0.06306004233384847, 0.000600323221593533, -0.01631734261447388, 0.07240737518537263, 0.021220408152554947, 0.003949839399934237, 0.1850493655535656, -0.12476155507808798, -0.16781756309638643, 0.3836069441189603, -0.0662229989736587, -0.0953550492984436, 0.19281180452430216, -0.17930047964251092, -0.05363837530274155, 0.14230372259373567, 0.11411967495717723, 0.14864399732652842, -0.13210744597676718, 0.004579916082839877, -0.006346720551966496, 0.1551732945987375, 0.14867521044446752, 0.08989460406745872, 0.27377352947896383, 0.18826780825049422, 0.014846287834686491, 0.10538222115346284, -0.15939119827187412, -0.08923680926283233, -0.25994216001214776, -0.1228740731317919, -0.19056608631244842, 0.08754511934362971, -0.011476040360578752, -0.15122455779017846, 0.38894427172347623, 0.17945723091076426, 0.18790278056491483, -0.030004037992906855, 0.3467401774415641, 0.1345694606414258, 0.0360986371239085, -0.006168182704401124, 0.29543387752799494, 0.10288529545354289, 0.1041965427729389, -0.28249435921151295, 0.08349606155073007, -0.031955151085056505]
|
1,803.04188
|
Social shaping of information infrastructure: on being specific about
the technology
|
We are in this paper discussing conceptualisations of the relationship
between IT and organisational issues. To move beyond an IT enables/ constrains
position, we argue that it is necessary to take the specifics of an information
system (IS) more serious. A theoretical framework called actor network theory
from social studies of science and technology is presented as promising in this
regard. With respect to new organisational forms, the class of ISs which need
closer scrutiny is information infrastructures (INIs). They have
characteristics which distinguish them from other ISs, namely the role and
pattern of diffusion of standards. These standards are neither ready-made nor
neutral: they inscribe organisational behaviour deeply within their technical
details. Diffusion and adoption of standards depart from other kinds of ISs by
requiring the coordination of the surrounding actors, institutional
arrangements and work practices.
|
cs.CY
|
we are in this paper discussing conceptualisations of the relationship between it and organisational issues to move beyond an it enables constrains position we argue that it is necessary to take the specifics of an information system is more serious a theoretical framework called actor network theory from social studies of science and technology is presented as promising in this regard with respect to new organisational forms the class of iss which need closer scrutiny is information infrastructures inis they have characteristics which distinguish them from other iss namely the role and pattern of diffusion of standards these standards are neither readymade nor neutral they inscribe organisational behaviour deeply within their technical details diffusion and adoption of standards depart from other kinds of iss by requiring the coordination of the surrounding actors institutional arrangements and work practices
|
[['we', 'are', 'in', 'this', 'paper', 'discussing', 'conceptualisations', 'of', 'the', 'relationship', 'between', 'it', 'and', 'organisational', 'issues', 'to', 'move', 'beyond', 'an', 'it', 'enables', 'constrains', 'position', 'we', 'argue', 'that', 'it', 'is', 'necessary', 'to', 'take', 'the', 'specifics', 'of', 'an', 'information', 'system', 'is', 'more', 'serious', 'a', 'theoretical', 'framework', 'called', 'actor', 'network', 'theory', 'from', 'social', 'studies', 'of', 'science', 'and', 'technology', 'is', 'presented', 'as', 'promising', 'in', 'this', 'regard', 'with', 'respect', 'to', 'new', 'organisational', 'forms', 'the', 'class', 'of', 'iss', 'which', 'need', 'closer', 'scrutiny', 'is', 'information', 'infrastructures', 'inis', 'they', 'have', 'characteristics', 'which', 'distinguish', 'them', 'from', 'other', 'iss', 'namely', 'the', 'role', 'and', 'pattern', 'of', 'diffusion', 'of', 'standards', 'these', 'standards', 'are', 'neither', 'readymade', 'nor', 'neutral', 'they', 'inscribe', 'organisational', 'behaviour', 'deeply', 'within', 'their', 'technical', 'details', 'diffusion', 'and', 'adoption', 'of', 'standards', 'depart', 'from', 'other', 'kinds', 'of', 'iss', 'by', 'requiring', 'the', 'coordination', 'of', 'the', 'surrounding', 'actors', 'institutional', 'arrangements', 'and', 'work', 'practices']]
|
[-0.10668415128962164, 0.0926900631031244, -0.07967123706989429, 0.06727040926746079, -0.12205162905978367, -0.14925893837618573, 0.056806134951972016, 0.40044006898396595, -0.28330347553128377, -0.3211662848330247, 0.10486764235504191, -0.27007790633497814, -0.1800376678858062, 0.1615018160527517, -0.11617729607592885, -0.005503429524490938, 0.02683855291466256, 0.007790040455909227, -0.02753296514000634, -0.21681502576821537, 0.3540177633266841, 0.08487794366117347, 0.32585901382844895, 0.06678290809984044, 0.013093221097198479, -0.015011152737048072, -0.07239602526362218, -0.01930994810348185, -0.1003502286880843, 0.1885454131235533, 0.2947893340195365, 0.20898246059454428, 0.32406595473944705, -0.46041579402106647, -0.1814355095369084, 0.06662961155148771, 0.10733818260076292, 0.06784207312054658, -0.008608495962642551, -0.29881256375365944, 0.0500836397314903, -0.196534487656797, -0.14623463369378656, -0.0543962843469618, 0.009448302639237441, 0.03820717771108829, -0.19268907605232122, -0.008877854574273121, 0.059997885048848246, 0.09240208846527179, -0.05122350720921531, -0.08801906201252303, -0.023410733484471327, 0.21188124384635182, 0.07444915743690217, -0.013299188304432285, 0.16085771890014738, -0.15239415713243515, -0.10443108456264086, 0.4105837641913882, 0.031861757359686584, -0.17151670158936588, 0.23444185806832085, -0.09727776011191856, -0.1760434920742067, 0.08088476333411082, 0.16455768965362735, 0.03224125361713745, -0.19799661010876982, 0.047895366676504424, 0.01027026291087489, 0.15702803730827702, 0.043881904775523305, 0.08429409586032681, 0.22846926329657435, 0.19049929169705138, 0.08230851101346642, 0.06411146520595674, -0.018765562568553246, -0.14794581758050138, -0.2811369158615194, -0.1502077153794851, -0.09696730391314144, 0.009712343499118373, -0.027142471862723196, -0.1254339758961578, 0.34150317086673837, 0.19491934997495264, 0.11876957034966086, -0.012483686184757115, 0.28141113226849807, 0.02395221389580162, 0.09988860273562536, 0.05349190662587609, 0.24904585285934017, 0.06637322038295679, 0.17002039258231355, -0.1369674136803951, 0.13590447873438655, -0.01362694036010105]
|
1,803.04189
|
Noise2Noise: Learning Image Restoration without Clean Data
|
We apply basic statistical reasoning to signal reconstruction by machine
learning -- learning to map corrupted observations to clean signals -- with a
simple and powerful conclusion: it is possible to learn to restore images by
only looking at corrupted examples, at performance at and sometimes exceeding
training using clean data, without explicit image priors or likelihood models
of the corruption. In practice, we show that a single model learns photographic
noise removal, denoising synthetic Monte Carlo images, and reconstruction of
undersampled MRI scans -- all corrupted by different processes -- based on
noisy data only.
|
cs.CV cs.LG stat.ML
|
we apply basic statistical reasoning to signal reconstruction by machine learning learning to map corrupted observations to clean signals with a simple and powerful conclusion it is possible to learn to restore images by only looking at corrupted examples at performance at and sometimes exceeding training using clean data without explicit image priors or likelihood models of the corruption in practice we show that a single model learns photographic noise removal denoising synthetic monte carlo images and reconstruction of undersampled mri scans all corrupted by different processes based on noisy data only
|
[['we', 'apply', 'basic', 'statistical', 'reasoning', 'to', 'signal', 'reconstruction', 'by', 'machine', 'learning', 'learning', 'to', 'map', 'corrupted', 'observations', 'to', 'clean', 'signals', 'with', 'a', 'simple', 'and', 'powerful', 'conclusion', 'it', 'is', 'possible', 'to', 'learn', 'to', 'restore', 'images', 'by', 'only', 'looking', 'at', 'corrupted', 'examples', 'at', 'performance', 'at', 'and', 'sometimes', 'exceeding', 'training', 'using', 'clean', 'data', 'without', 'explicit', 'image', 'priors', 'or', 'likelihood', 'models', 'of', 'the', 'corruption', 'in', 'practice', 'we', 'show', 'that', 'a', 'single', 'model', 'learns', 'photographic', 'noise', 'removal', 'denoising', 'synthetic', 'monte', 'carlo', 'images', 'and', 'reconstruction', 'of', 'undersampled', 'mri', 'scans', 'all', 'corrupted', 'by', 'different', 'processes', 'based', 'on', 'noisy', 'data', 'only']]
|
[0.02744777241288988, -0.00014015655640674674, -0.06213780434336513, 0.10704937776798666, -0.12463591561106074, -0.23319214235221886, 0.06023547484833018, 0.47170537400423834, -0.32866920372876135, -0.3551118898903951, 0.12373726984926338, -0.3161440648533323, -0.14559465125658672, 0.1988479633899102, -0.16567043780916088, 0.09241758124983829, 0.17275111593872958, 0.004755770301689272, -0.09767896588195783, -0.28639313704384817, 0.2699777382810641, 0.09034152081965105, 0.28795297444879037, -0.11505498011778716, 0.16812140591007294, 0.03506949533829871, -0.06393459808326873, -0.036127479271153395, -0.03415410733016514, 0.07697388968612674, 0.33423567952958483, 0.2154680516902337, 0.2633510219570978, -0.43748548932616477, -0.2320567892520162, 0.12892167849223252, 0.11211054966501567, 0.1428197122026493, -0.06745303910271183, -0.3812319768957146, 0.09057573374087477, -0.05355841166380307, 0.06138892930871605, -0.1925656230026937, -0.07214078010798877, -0.07367863439266449, -0.37039404081651417, 0.09893855255137643, 0.04247173077791282, 0.10651211667320003, -0.02390875871060416, -0.09568819141460826, 0.004707560950444768, 0.1291856015703398, 0.012523296830730269, 0.05591114632198182, 0.18503015874075177, -0.18674973162579472, -0.10327868708459985, 0.2952219688019756, -0.06417990825898216, -0.2060412643679782, 0.21722535193017076, -0.10264508110855747, -0.14588259557343047, 0.2098234226906915, 0.2298328421463299, 0.07172209806942745, -0.18399741531997596, -0.0006753269844921306, -0.013968107572746585, 0.18659558415453395, 0.06166964517805078, -0.05206812338893423, 0.14194517366780454, 0.17711432181987102, -0.01990835197047209, 0.12361726583659892, -0.20951374847715235, 0.015492422611872747, -0.22657735650010064, -0.023388219058371917, -0.28557335027447983, 0.001432500982090183, -0.09881025468174535, -0.1558727876445514, 0.3537223231599099, 0.29076012196626677, 0.24364461016881725, 0.08389332162155567, 0.4464755588130135, 0.014122332223569569, 0.07286747714059184, 0.05675939398402672, 0.1579303771469985, 0.06943543588378183, 0.05999178342703406, -0.10078803592604464, 0.08833113127469044, -0.034536733403396996]
|
1,803.0419
|
Counting of Shortest Paths in Cubic Grid
|
The enumeration of shortest paths in cubic grid is presented herein, which
could have importance in image processing and also in the network sciences. The
cubic grid considers three neighborhoods - namely, 6-, 18- and 26-neighborhood
related to face connectivity, edge connectivity and vertex connectivity,
respectively. The formulation for distance metrics is given. L1, D18, and
L_$\infty$ are the three metrics for 6-neighborhood, 18-neighborhood and
26-neighborhood. The task is to count the number of minimal paths, based on
given neighborhood relations, from any given point to any other, in the
three-dimensional cubic grid. Based on the coordinate triplets describing the
grid, the formulations for the three neighborhoods are presented in this work.
The problem both of theoretical importance and has several practical aspects.
|
cs.DM cs.CG
|
the enumeration of shortest paths in cubic grid is presented herein which could have importance in image processing and also in the network sciences the cubic grid considers three neighborhoods namely 6 18 and 26neighborhood related to face connectivity edge connectivity and vertex connectivity respectively the formulation for distance metrics is given l1 d18 and l_infty are the three metrics for 6neighborhood 18neighborhood and 26neighborhood the task is to count the number of minimal paths based on given neighborhood relations from any given point to any other in the threedimensional cubic grid based on the coordinate triplets describing the grid the formulations for the three neighborhoods are presented in this work the problem both of theoretical importance and has several practical aspects
|
[['the', 'enumeration', 'of', 'shortest', 'paths', 'in', 'cubic', 'grid', 'is', 'presented', 'herein', 'which', 'could', 'have', 'importance', 'in', 'image', 'processing', 'and', 'also', 'in', 'the', 'network', 'sciences', 'the', 'cubic', 'grid', 'considers', 'three', 'neighborhoods', 'namely', '6', '18', 'and', '26neighborhood', 'related', 'to', 'face', 'connectivity', 'edge', 'connectivity', 'and', 'vertex', 'connectivity', 'respectively', 'the', 'formulation', 'for', 'distance', 'metrics', 'is', 'given', 'l1', 'd18', 'and', 'l_infty', 'are', 'the', 'three', 'metrics', 'for', '6neighborhood', '18neighborhood', 'and', '26neighborhood', 'the', 'task', 'is', 'to', 'count', 'the', 'number', 'of', 'minimal', 'paths', 'based', 'on', 'given', 'neighborhood', 'relations', 'from', 'any', 'given', 'point', 'to', 'any', 'other', 'in', 'the', 'threedimensional', 'cubic', 'grid', 'based', 'on', 'the', 'coordinate', 'triplets', 'describing', 'the', 'grid', 'the', 'formulations', 'for', 'the', 'three', 'neighborhoods', 'are', 'presented', 'in', 'this', 'work', 'the', 'problem', 'both', 'of', 'theoretical', 'importance', 'and', 'has', 'several', 'practical', 'aspects']]
|
[-0.14601376422254717, 0.037023044791135745, -0.007778067852102093, 0.035566992305961075, -0.06513241788182976, -0.10671833176481521, 0.04072188563841953, 0.40149550920083993, -0.2607810816104066, -0.3260552343928208, 0.13651551055165512, -0.31759422924369574, -0.16866507558783483, 0.17789759033288555, -0.09787621467287447, 0.055509441879467436, 0.06459281678702208, 0.07352197782523236, -0.04720535883443209, -0.27568424210717934, 0.32725227664245027, 0.002125223064637285, 0.2801809086093395, 0.06927008150190794, 0.07809243874300777, 0.019588759989809183, -0.04650435560398688, 0.05995085086353849, -0.12146163629012782, 0.1677772302044382, 0.23632301107617254, 0.16687641588781596, 0.24069333864549586, -0.41917024292367494, -0.21110434339271258, 0.12441799848466732, 0.11182418171221674, 0.06822574074218302, -0.018268946047193545, -0.20376378617454635, 0.1130685233866196, -0.0758246367173743, -0.05782144845826393, -0.015586747805157803, 0.04592518900300108, 0.042349473494341816, -0.23479888913363722, -0.0058845094490453005, 0.030404734729110438, 0.07191266369551097, -0.03717009893073937, -0.1474761437877255, -0.03560786050255016, 0.1594698098054061, -0.010643355431966484, 0.03501197792613342, 0.04939591716304106, -0.10935760060644914, -0.15430217028706003, 0.4290432832440582, 0.043224933052088244, -0.2481219543428239, 0.18567107931584498, -0.08930307115286083, -0.15796821045499862, 0.07950050929182415, 0.16921589272964935, 0.08962281795723712, -0.1667573098537228, 0.09302571977555783, -0.014410788161774813, 0.09641052728989438, 0.07681904610056998, 0.01210312548851184, 0.14976114831801693, 0.17433269086720074, 0.1104486479001688, 0.10702925800568804, -0.12053512252662014, -0.1252304784937809, -0.276657000476084, -0.11376806217151046, -0.20613192102745553, -0.027230415272258095, -0.1734128114799436, -0.17395424278516133, 0.4480148369083339, 0.14289956388332076, 0.19773916309794126, 0.06586983288594885, 0.2626261152642763, 0.06792415972893774, 0.04829924124277244, 0.09927519162578145, 0.17648856904973292, 0.10146520486480351, 0.06743726118120476, -0.17528752476111117, 0.03561689058255594, 0.14539710341526543]
|
1,803.04191
|
Modal analysis for determining the size-and temperature-dependent
bending rigidity of graphene
|
The bending rigidity of two-dimensional (2D) materials is a key parameter for
understanding the mechanics of 2D NEMS devices. The apparent bending rigidity
of graphene membranes at macroscopic scale differs from theoretical predictions
at micro-scale. This difference is believed to originate from thermally induced
dynamic ripples in the atomically thin membrane. In this paper, we perform
modal analysis to estimate the effective macroscopic bending rigidity of
graphene membranes from the frequency spectrum of their Brownian motion. Our
method is based on fitting the resonance frequencies obtained from the Brownian
motion in molecular dynamics simulations, to those obtained from a continuum
mechanics model, with bending rigidity and pretension as the fit parameters. In
this way, the effective bending rigidity of the membrane and its temperature
and size dependence, are extracted, while including the effects of dynamic
ripples and thermal fluctuations. The proposed method provides a framework for
estimating the macroscopic mechanical properties at high frequencies in other
two-dimensional nano-structures at finite temperatures.
|
physics.app-ph cond-mat.mes-hall
|
the bending rigidity of twodimensional 2d materials is a key parameter for understanding the mechanics of 2d nems devices the apparent bending rigidity of graphene membranes at macroscopic scale differs from theoretical predictions at microscale this difference is believed to originate from thermally induced dynamic ripples in the atomically thin membrane in this paper we perform modal analysis to estimate the effective macroscopic bending rigidity of graphene membranes from the frequency spectrum of their brownian motion our method is based on fitting the resonance frequencies obtained from the brownian motion in molecular dynamics simulations to those obtained from a continuum mechanics model with bending rigidity and pretension as the fit parameters in this way the effective bending rigidity of the membrane and its temperature and size dependence are extracted while including the effects of dynamic ripples and thermal fluctuations the proposed method provides a framework for estimating the macroscopic mechanical properties at high frequencies in other twodimensional nanostructures at finite temperatures
|
[['the', 'bending', 'rigidity', 'of', 'twodimensional', '2d', 'materials', 'is', 'a', 'key', 'parameter', 'for', 'understanding', 'the', 'mechanics', 'of', '2d', 'nems', 'devices', 'the', 'apparent', 'bending', 'rigidity', 'of', 'graphene', 'membranes', 'at', 'macroscopic', 'scale', 'differs', 'from', 'theoretical', 'predictions', 'at', 'microscale', 'this', 'difference', 'is', 'believed', 'to', 'originate', 'from', 'thermally', 'induced', 'dynamic', 'ripples', 'in', 'the', 'atomically', 'thin', 'membrane', 'in', 'this', 'paper', 'we', 'perform', 'modal', 'analysis', 'to', 'estimate', 'the', 'effective', 'macroscopic', 'bending', 'rigidity', 'of', 'graphene', 'membranes', 'from', 'the', 'frequency', 'spectrum', 'of', 'their', 'brownian', 'motion', 'our', 'method', 'is', 'based', 'on', 'fitting', 'the', 'resonance', 'frequencies', 'obtained', 'from', 'the', 'brownian', 'motion', 'in', 'molecular', 'dynamics', 'simulations', 'to', 'those', 'obtained', 'from', 'a', 'continuum', 'mechanics', 'model', 'with', 'bending', 'rigidity', 'and', 'pretension', 'as', 'the', 'fit', 'parameters', 'in', 'this', 'way', 'the', 'effective', 'bending', 'rigidity', 'of', 'the', 'membrane', 'and', 'its', 'temperature', 'and', 'size', 'dependence', 'are', 'extracted', 'while', 'including', 'the', 'effects', 'of', 'dynamic', 'ripples', 'and', 'thermal', 'fluctuations', 'the', 'proposed', 'method', 'provides', 'a', 'framework', 'for', 'estimating', 'the', 'macroscopic', 'mechanical', 'properties', 'at', 'high', 'frequencies', 'in', 'other', 'twodimensional', 'nanostructures', 'at', 'finite', 'temperatures']]
|
[-0.08451923997262897, 0.16885042906108294, -0.1030590074796299, -0.013405873220390784, -0.0398717263817602, -0.12275769071138655, 0.0022533623717135246, 0.369515696135552, -0.29929241942970647, -0.2979564464055233, 0.026695122493297925, -0.27725988193501877, -0.1618579293965284, 0.1994627482989537, -0.02787296209044708, 0.08719786292163262, 0.014283360184534737, -0.05817345947624468, -0.02086687075937317, -0.05639687676332683, 0.23048776436903692, 0.07473298275600308, 0.32882427458466257, 0.07204233859347538, 0.06839934629474922, -0.01084281114415954, 0.04125627557029774, 0.06083397190693928, -0.20596023590552695, 0.14468557772267124, 0.21019567371785686, -0.07573017292303143, 0.21803091408002265, -0.4560817204783121, -0.27746310758188236, -0.0016950492990081725, 0.10542642980704073, 0.16943642922159377, -0.01019649168039724, -0.2568811522464135, 0.0478931654487615, -0.08204812697360511, -0.16589033582617646, -0.04821123123409007, 0.02006056787075926, 0.018443685059322867, -0.19338619984543207, 0.15980930842845326, 0.05522421598492294, 0.07940695232058072, -0.12314236816208628, -0.10609451285997255, -0.05003114467376832, 0.13136210883837424, 0.07487773578339227, -0.02570289595526938, 0.26580703464735833, -0.12457127025732713, -0.07926511144994394, 0.4329658690492929, -0.05645126852160609, -0.17585585258253242, 0.20278918748918157, -0.1670347774713676, -0.08838988727780048, 0.18379343303950121, 0.16554946112244026, 0.09014122126485158, -0.16270432709962107, 0.06166124065487605, 0.033420158272481855, 0.15483282429385953, 0.09174463802786625, 0.03194476336946491, 0.25888265017998513, 0.2291518639287223, 0.009093727686540773, 0.13560198232971177, -0.10747253065726356, -0.05107686574345235, -0.2809154014826191, -0.10997233780170357, -0.21240941444968642, 0.0811067949929882, -0.1398823508376007, -0.2007024684712661, 0.39841099555447973, 0.1471659191739485, 0.17993438310389007, 0.07719120253398089, 0.2922674992370494, 0.06087339673804478, 0.0604702232836497, 0.006545924584479621, 0.30485084506550003, 0.16647315144492603, 0.11326129272045432, -0.25384154161062344, 0.019875471118652486, 0.04086419134171208]
|
1,803.04192
|
The family resemblance of technologically mediated work practices
|
Practice-based perspectives in information systems have established how, in
every instance of use i.e., work practices, the user exercises considerable
discretion in their appropriation of the technology with local workarounds and
situated improvisations. We analyse the relationship between technologically
mediated work practices separated in time and space. Specifically, we analyse
how similarity in work practices is achieved. Achieving absolutely similar or
best practices is unattainable. Drawing on a longitudinal 2007 to 2011 case of
ambulatory maintenance work in the oil and gas sector, we identify and discuss
three constituting strategies called differentiation, assembling and
punctuation through which a family resemblance of similar but not the same work
practices is crafted. We discuss how, in the absence of an essentialist
criterion, similarity is subject to pragmatic but also political negotiations.
|
cs.CY
|
practicebased perspectives in information systems have established how in every instance of use ie work practices the user exercises considerable discretion in their appropriation of the technology with local workarounds and situated improvisations we analyse the relationship between technologically mediated work practices separated in time and space specifically we analyse how similarity in work practices is achieved achieving absolutely similar or best practices is unattainable drawing on a longitudinal 2007 to 2011 case of ambulatory maintenance work in the oil and gas sector we identify and discuss three constituting strategies called differentiation assembling and punctuation through which a family resemblance of similar but not the same work practices is crafted we discuss how in the absence of an essentialist criterion similarity is subject to pragmatic but also political negotiations
|
[['practicebased', 'perspectives', 'in', 'information', 'systems', 'have', 'established', 'how', 'in', 'every', 'instance', 'of', 'use', 'ie', 'work', 'practices', 'the', 'user', 'exercises', 'considerable', 'discretion', 'in', 'their', 'appropriation', 'of', 'the', 'technology', 'with', 'local', 'workarounds', 'and', 'situated', 'improvisations', 'we', 'analyse', 'the', 'relationship', 'between', 'technologically', 'mediated', 'work', 'practices', 'separated', 'in', 'time', 'and', 'space', 'specifically', 'we', 'analyse', 'how', 'similarity', 'in', 'work', 'practices', 'is', 'achieved', 'achieving', 'absolutely', 'similar', 'or', 'best', 'practices', 'is', 'unattainable', 'drawing', 'on', 'a', 'longitudinal', '2007', 'to', '2011', 'case', 'of', 'ambulatory', 'maintenance', 'work', 'in', 'the', 'oil', 'and', 'gas', 'sector', 'we', 'identify', 'and', 'discuss', 'three', 'constituting', 'strategies', 'called', 'differentiation', 'assembling', 'and', 'punctuation', 'through', 'which', 'a', 'family', 'resemblance', 'of', 'similar', 'but', 'not', 'the', 'same', 'work', 'practices', 'is', 'crafted', 'we', 'discuss', 'how', 'in', 'the', 'absence', 'of', 'an', 'essentialist', 'criterion', 'similarity', 'is', 'subject', 'to', 'pragmatic', 'but', 'also', 'political', 'negotiations']]
|
[-0.09544180152670378, 0.06549176519467892, -0.06934912515498581, 0.06817692228287342, -0.11794737389573129, -0.15192328184639337, 0.09653444548530388, 0.4312082519172691, -0.2275592969635909, -0.3214038275909843, 0.08659083405382262, -0.2787061549570353, -0.19669811377571023, 0.174399376663132, -0.1283315019818474, -0.0011697920544975204, 0.025912823741236934, 0.005085868964670226, -0.045289976196727366, -0.2810418564968131, 0.3195727929196437, 0.0553437510097865, 0.32938806876336457, 0.06159784525880241, 0.04876017662166987, -0.017475757958891336, -0.07228988684437354, -0.021612298169429778, -0.14141849682573593, 0.15092756900412496, 0.3134438650449738, 0.19425790543391486, 0.34220630391064333, -0.424254552427783, -0.15937565017520683, 0.10315787386934971, 0.11660716347250855, 0.05682873016939993, -0.052964806195632264, -0.2739759675878304, 0.023863649334089132, -0.18194708582450403, -0.10578247859109524, -0.0975512347795302, 0.005986165189824533, -0.020236192576703615, -0.20663275767219602, 0.03164982626708479, 0.08338976250070118, 0.12911489698308287, -0.060790766409809294, -0.0788884009452886, -0.0020426266310096253, 0.19347015880521212, 0.06934019922846346, 0.015983120697455888, 0.12444182333365461, -0.1420010648907919, -0.15434006062514527, 0.3980108094269781, -0.017273512090469012, -0.16524723762813665, 0.21278638686635531, -0.09587886454391992, -0.1475294041374582, 0.010373978364441427, 0.1905604075291194, 0.06364892601050087, -0.18515311196824769, 0.047109148426443426, -0.009762032155776978, 0.15165511713712476, 0.11050124223947932, 0.03362629962430219, 0.1964593181327814, 0.19531891249789624, 0.04779988889822562, 0.10368846662458964, -0.006760578069588519, -0.10899201875372455, -0.24265544714580756, -0.17216435212878878, -0.1189172249432886, -0.007083836111519304, -0.0022161379796443725, -0.13612446311162785, 0.3759154858744296, 0.1706446575815903, 0.15217542042955756, -0.0036785028723897994, 0.2696375210216502, 0.013256244965305086, 0.03879236586544721, 0.07215796840046096, 0.2207257434129133, 0.025897831248585135, 0.15077024822312524, -0.15202281638630666, 0.13219119764653442, 0.00048383831841647407]
|
1,803.04193
|
Extreme Learning Machine for Graph Signal Processing
|
In this article, we improve extreme learning machines for regression tasks
using a graph signal processing based regularization. We assume that the target
signal for prediction or regression is a graph signal. With this assumption, we
use the regularization to enforce that the output of an extreme learning
machine is smooth over a given graph. Simulation results with real data confirm
that such regularization helps significantly when the available training data
is limited in size and corrupted by noise.
|
stat.ML cs.LG eess.SP
|
in this article we improve extreme learning machines for regression tasks using a graph signal processing based regularization we assume that the target signal for prediction or regression is a graph signal with this assumption we use the regularization to enforce that the output of an extreme learning machine is smooth over a given graph simulation results with real data confirm that such regularization helps significantly when the available training data is limited in size and corrupted by noise
|
[['in', 'this', 'article', 'we', 'improve', 'extreme', 'learning', 'machines', 'for', 'regression', 'tasks', 'using', 'a', 'graph', 'signal', 'processing', 'based', 'regularization', 'we', 'assume', 'that', 'the', 'target', 'signal', 'for', 'prediction', 'or', 'regression', 'is', 'a', 'graph', 'signal', 'with', 'this', 'assumption', 'we', 'use', 'the', 'regularization', 'to', 'enforce', 'that', 'the', 'output', 'of', 'an', 'extreme', 'learning', 'machine', 'is', 'smooth', 'over', 'a', 'given', 'graph', 'simulation', 'results', 'with', 'real', 'data', 'confirm', 'that', 'such', 'regularization', 'helps', 'significantly', 'when', 'the', 'available', 'training', 'data', 'is', 'limited', 'in', 'size', 'and', 'corrupted', 'by', 'noise']]
|
[-0.0414333835220601, 0.007720657908895548, -0.09172241366763093, 0.05182949559250257, -0.15728417335997655, -0.16898186778932622, 0.044849505765905864, 0.4460746649699875, -0.2913359284778185, -0.3049137760425293, 0.14547769608907402, -0.27182066013824335, -0.1860125661515218, 0.16433227328801692, -0.1762819907958089, 0.12489106336349173, 0.16368745618700226, 0.0787518799210651, -0.04543401426753572, -0.2986175603099916, 0.35207644472771055, 0.04721638897457455, 0.2989937500155802, -0.004567447147933366, 0.14447982432733325, 0.056236393136691445, -0.03620613570902732, -0.004256984873238621, -0.05678168998261592, 0.12067030104985342, 0.3269165041414384, 0.21850872636312926, 0.343651886192398, -0.3916155603961854, -0.255109714992533, 0.18597867447128402, 0.125656101675822, 0.08094338057680597, -0.054044056842928824, -0.2598681573702989, 0.10154127473707157, -0.10767157419431436, 0.03734129362539211, -0.10716827737191055, -0.0441915525677555, -0.0002233213450335249, -0.39838617089900036, 0.03707083906459657, 0.060314941125674336, 0.08759094613215214, -0.03760428852814285, -0.09479150939968568, 0.051251301365091075, 0.09640946614893471, 0.03985849327018744, 0.08566256866589943, 0.13879009926267252, -0.16063115417462173, -0.13791608364804636, 0.33649843702493587, -0.08939909402729024, -0.24800977299485025, 0.17481839835136845, -0.07698625948315463, -0.1824885156046882, 0.10347908128147261, 0.23222054987246926, 0.05521860474107575, -0.13148818259761827, 0.0468504945209686, -0.026411323183322254, 0.1962957074512032, 0.02008346567826369, -0.03770592478634436, 0.0895177758994359, 0.25167297237977104, 0.054865620965491746, 0.1489725116304346, -0.13275221909088367, 0.006312608897179082, -0.26907344579790965, -0.08044040923101144, -0.28963369930375227, -0.024093701645637615, -0.15219645857014488, -0.1578180061158123, 0.3502769764347733, 0.2489217629632618, 0.2451980642950799, 0.11571642273706914, 0.38174325164077405, 0.09748120835829008, 0.0922616092794681, 0.14401775195935293, 0.17897354113527492, 0.06915815530898922, 0.08263748843382007, -0.16787236006753636, 0.0826408520836053, -0.04176416318816475]
|
1,803.04194
|
Standardization of work: co-constructed practice
|
There is strong pressure to achieve greater uniformity, standardisation and
application of best practices in the service professions, a sector which is
growing in presence and importance. At the same time, there is a conflicting
demand for the delivery of high quality or highly priced or knowledge intensive
specialised or localised services. Our paper analyses information systems
embedded efforts of standardising service work through an indepth
interpretative study of an ongoing standardisation initiative within the field
of nursing. Nursing provides a graphic illustration of the dilemmas involved in
the standardisation of service work. In nursing, standardisation is commonly a
feature of projects to improve both efficiency and quality in health care. In
contrast to the dominant conception of standardisation as a largely topdown,
imposed process, we offer a view of standardisation as incomplete,
co-constructed with users and with significant unintended consequences. The
paper contributes by developing a theoretical perspective for the
standardisation of information-system-embedded service work and operational and
practical implications for system design and health care management.
|
cs.CY
|
there is strong pressure to achieve greater uniformity standardisation and application of best practices in the service professions a sector which is growing in presence and importance at the same time there is a conflicting demand for the delivery of high quality or highly priced or knowledge intensive specialised or localised services our paper analyses information systems embedded efforts of standardising service work through an indepth interpretative study of an ongoing standardisation initiative within the field of nursing nursing provides a graphic illustration of the dilemmas involved in the standardisation of service work in nursing standardisation is commonly a feature of projects to improve both efficiency and quality in health care in contrast to the dominant conception of standardisation as a largely topdown imposed process we offer a view of standardisation as incomplete coconstructed with users and with significant unintended consequences the paper contributes by developing a theoretical perspective for the standardisation of informationsystemembedded service work and operational and practical implications for system design and health care management
|
[['there', 'is', 'strong', 'pressure', 'to', 'achieve', 'greater', 'uniformity', 'standardisation', 'and', 'application', 'of', 'best', 'practices', 'in', 'the', 'service', 'professions', 'a', 'sector', 'which', 'is', 'growing', 'in', 'presence', 'and', 'importance', 'at', 'the', 'same', 'time', 'there', 'is', 'a', 'conflicting', 'demand', 'for', 'the', 'delivery', 'of', 'high', 'quality', 'or', 'highly', 'priced', 'or', 'knowledge', 'intensive', 'specialised', 'or', 'localised', 'services', 'our', 'paper', 'analyses', 'information', 'systems', 'embedded', 'efforts', 'of', 'standardising', 'service', 'work', 'through', 'an', 'indepth', 'interpretative', 'study', 'of', 'an', 'ongoing', 'standardisation', 'initiative', 'within', 'the', 'field', 'of', 'nursing', 'nursing', 'provides', 'a', 'graphic', 'illustration', 'of', 'the', 'dilemmas', 'involved', 'in', 'the', 'standardisation', 'of', 'service', 'work', 'in', 'nursing', 'standardisation', 'is', 'commonly', 'a', 'feature', 'of', 'projects', 'to', 'improve', 'both', 'efficiency', 'and', 'quality', 'in', 'health', 'care', 'in', 'contrast', 'to', 'the', 'dominant', 'conception', 'of', 'standardisation', 'as', 'a', 'largely', 'topdown', 'imposed', 'process', 'we', 'offer', 'a', 'view', 'of', 'standardisation', 'as', 'incomplete', 'coconstructed', 'with', 'users', 'and', 'with', 'significant', 'unintended', 'consequences', 'the', 'paper', 'contributes', 'by', 'developing', 'a', 'theoretical', 'perspective', 'for', 'the', 'standardisation', 'of', 'informationsystemembedded', 'service', 'work', 'and', 'operational', 'and', 'practical', 'implications', 'for', 'system', 'design', 'and', 'health', 'care', 'management']]
|
[-0.12546651695254651, 0.030619760208197937, -0.04818434307508799, 0.04245841948507525, -0.11248861842912185, -0.10729514254840562, 0.10859342383540584, 0.38317477170792436, -0.18993403641114304, -0.34194750824651443, 0.14899175288716712, -0.27303027480010345, -0.13385314408953425, 0.18585099147896406, -0.15067598150891579, 0.03732624717887087, 0.057835781530909104, 0.00886793654125902, -0.01356282739490495, -0.25989984556140533, 0.2893151487476271, 0.12659264033862266, 0.3598180519562798, 0.11066110336491053, 0.030861406463635974, 0.019767898395769746, -0.07073236417294626, -0.010732833357774708, -0.09012886364271033, 0.18620564513110432, 0.33617751679035374, 0.22353233395884914, 0.38747472830638513, -0.4395113392362753, -0.19505751662584672, 0.07896650022636335, 0.13536219918786221, 0.03186489277202299, -0.09761856997901776, -0.2690483778883445, 0.036115324055966756, -0.22449894633469542, -0.13028546603374094, -0.047828420626381075, 0.0015670270459159806, -0.017384643224629025, -0.2713164438897497, 0.009247471560185483, 0.029320709536368228, 0.1454022884598922, -0.06369067005692498, -0.11555736041164968, 0.007132316776481177, 0.20882254044934884, 0.10374810364071409, 0.05662355044399422, 0.12184194520295384, -0.17994018413297586, -0.14126984368314047, 0.4313247412378642, -0.0027625260437019617, -0.14104322058496527, 0.18107636948396644, -0.06259822232244783, -0.17754448734852205, 0.07097822475858616, 0.22471805559106575, 0.041523553526410496, -0.21036381505118368, 0.036504502376823414, 0.04725741982145841, 0.15188144045287227, 0.03892753779444933, 0.07131509220014405, 0.21536198470612472, 0.2745100633852767, 0.07819949276184282, 0.1027389098104673, 0.007795674869431609, -0.07555680088025618, -0.24788564808122499, -0.1799534177211259, -0.11282335086557341, 0.03304016440461603, -0.05630012657516145, -0.1475643090965473, 0.37578339002330796, 0.19501011012716735, 0.10141213331652064, 0.014937263233895716, 0.3643510865990117, 0.053409350510681027, 0.06885397904384208, 0.02785697373483016, 0.17541686782097243, -0.007389766303682138, 0.17408105962438486, -0.162353397257267, 0.155288783810943, -0.06618588372324426]
|
1,803.04195
|
Wireless Energy Transfer to a Pair of Energy Receivers using Signal
Strength Feedback
|
This paper focuses on wireless energy transfer (WET) to a pair of low complex
energy receivers (ER), by only utilizing received signal strength indicator
(RSSI) values that are fed back from the ERs to the energy transmitter (ET).
Selecting the beamformer that maximizes the total average energy transfer
between the ET and the ERs, while satisfying a minimum harvested energy
criterion at each ER, is studied. This is a nonconvex constrained optimization
problem which is difficult to solve analytically. Also, any analytical solution
to the problem should only consists of parameters that the ET knows, or the ET
can estimate, as utilizing only RSSI feedback values for channel estimation
prohibits estimating some channel parameters. Thus, the paper focuses on
obtaining a suboptimal solution analytically. It is proven that if the channels
between the ET and the ERs satisfy a certain sufficient condition, this
solution is in fact optimal. Simulations show that the optimality gap is
negligibly small as well. Insights into a system with more than two ERs are
also presented. To this end, it is highlighted that if the number of ERs is
large enough, it is possible to always find a pair of ERs satisfying the
sufficient condition, and hence, a pairwise scheduling policy that does not
violate optimality can be used for the WET.
|
cs.IT math.IT
|
this paper focuses on wireless energy transfer wet to a pair of low complex energy receivers er by only utilizing received signal strength indicator rssi values that are fed back from the ers to the energy transmitter et selecting the beamformer that maximizes the total average energy transfer between the et and the ers while satisfying a minimum harvested energy criterion at each er is studied this is a nonconvex constrained optimization problem which is difficult to solve analytically also any analytical solution to the problem should only consists of parameters that the et knows or the et can estimate as utilizing only rssi feedback values for channel estimation prohibits estimating some channel parameters thus the paper focuses on obtaining a suboptimal solution analytically it is proven that if the channels between the et and the ers satisfy a certain sufficient condition this solution is in fact optimal simulations show that the optimality gap is negligibly small as well insights into a system with more than two ers are also presented to this end it is highlighted that if the number of ers is large enough it is possible to always find a pair of ers satisfying the sufficient condition and hence a pairwise scheduling policy that does not violate optimality can be used for the wet
|
[['this', 'paper', 'focuses', 'on', 'wireless', 'energy', 'transfer', 'wet', 'to', 'a', 'pair', 'of', 'low', 'complex', 'energy', 'receivers', 'er', 'by', 'only', 'utilizing', 'received', 'signal', 'strength', 'indicator', 'rssi', 'values', 'that', 'are', 'fed', 'back', 'from', 'the', 'ers', 'to', 'the', 'energy', 'transmitter', 'et', 'selecting', 'the', 'beamformer', 'that', 'maximizes', 'the', 'total', 'average', 'energy', 'transfer', 'between', 'the', 'et', 'and', 'the', 'ers', 'while', 'satisfying', 'a', 'minimum', 'harvested', 'energy', 'criterion', 'at', 'each', 'er', 'is', 'studied', 'this', 'is', 'a', 'nonconvex', 'constrained', 'optimization', 'problem', 'which', 'is', 'difficult', 'to', 'solve', 'analytically', 'also', 'any', 'analytical', 'solution', 'to', 'the', 'problem', 'should', 'only', 'consists', 'of', 'parameters', 'that', 'the', 'et', 'knows', 'or', 'the', 'et', 'can', 'estimate', 'as', 'utilizing', 'only', 'rssi', 'feedback', 'values', 'for', 'channel', 'estimation', 'prohibits', 'estimating', 'some', 'channel', 'parameters', 'thus', 'the', 'paper', 'focuses', 'on', 'obtaining', 'a', 'suboptimal', 'solution', 'analytically', 'it', 'is', 'proven', 'that', 'if', 'the', 'channels', 'between', 'the', 'et', 'and', 'the', 'ers', 'satisfy', 'a', 'certain', 'sufficient', 'condition', 'this', 'solution', 'is', 'in', 'fact', 'optimal', 'simulations', 'show', 'that', 'the', 'optimality', 'gap', 'is', 'negligibly', 'small', 'as', 'well', 'insights', 'into', 'a', 'system', 'with', 'more', 'than', 'two', 'ers', 'are', 'also', 'presented', 'to', 'this', 'end', 'it', 'is', 'highlighted', 'that', 'if', 'the', 'number', 'of', 'ers', 'is', 'large', 'enough', 'it', 'is', 'possible', 'to', 'always', 'find', 'a', 'pair', 'of', 'ers', 'satisfying', 'the', 'sufficient', 'condition', 'and', 'hence', 'a', 'pairwise', 'scheduling', 'policy', 'that', 'does', 'not', 'violate', 'optimality', 'can', 'be', 'used', 'for', 'the', 'wet']]
|
[-0.16751185122154189, 0.0664500931931299, -0.06291046107514045, 0.07402914377092491, -0.11687358157936707, -0.19157543895156703, 0.08015884162347403, 0.3520239887980118, -0.2599738328824944, -0.33579347874488563, 0.09896966846915142, -0.24701325808574492, -0.15690033014864802, 0.17317427499842086, -0.09163688046402783, 0.0263283998210011, 0.07744648787815313, 0.04004397248196918, -0.03537961300585874, -0.2645834768282181, 0.2852550351016936, 0.12286698979149628, 0.31698146110512143, 0.06326797828593288, 0.12814521854782926, 0.020689315514527434, 0.013690003545843236, 0.016329712755892272, -0.1361190995748607, 0.05452055865920188, 0.28096300459677176, 0.16364444746992074, 0.3113241390419549, -0.38090173266119914, -0.21187038806777808, 0.1661224948770199, 0.13965448357909488, 0.09097109329275152, -0.025879837326667366, -0.20719293986708956, 0.14711177987068, -0.1366844111570685, -0.016985134116464084, -0.00758377215202709, -0.0028299532191235622, 0.03706464889064633, -0.3734083932348042, 0.048483804335832714, 0.018465065097432017, -0.032141345636790386, -0.09388558805624049, -0.10567786828947387, -0.057516312339313085, 0.1275118176207324, 0.020564184969494685, 0.027492119336269005, 0.08361349216434881, -0.10636795949714456, -0.018738311342573144, 0.3470681974361758, 0.018523758862793664, -0.22659460095525613, 0.15263509064159583, -0.0796231307016368, -0.0897859163423528, 0.1489143033730819, 0.15939934637981212, 0.10027474589422689, -0.18484551571137894, 0.05217082139084755, -0.05826226619291141, 0.18740030367802915, 0.07255425292801129, 0.05240995417379083, 0.16876842559761612, 0.10816002820408152, 0.14579396330524014, 0.13605820627031154, -0.08121190405470075, -0.08555572529024046, -0.2833942954540081, -0.12141207995511213, -0.2614730379130039, 0.03400512277541633, -0.021518474893039843, -0.06863541395751081, 0.35276237122976317, 0.1256160301473936, 0.19089756554533396, 0.08117845705399196, 0.35897822602553303, 0.15108949803556251, 0.04237562249128145, 0.14016022185434499, 0.2836601038616041, 0.1004169155480898, 0.10866655509442537, -0.2022380079282233, 0.11315210631776017, 0.020199421034645167]
|
1,803.04196
|
Multi-kernel Regression For Graph Signal Processing
|
We develop a multi-kernel based regression method for graph signal processing
where the target signal is assumed to be smooth over a graph. In multi-kernel
regression, an effective kernel function is expressed as a linear combination
of many basis kernel functions. We estimate the linear weights to learn the
effective kernel function by appropriate regularization based on graph
smoothness. We show that the resulting optimization problem is shown to be
convex and pro- pose an accelerated projected gradient descent based solution.
Simulation results using real-world graph signals show efficiency of the
multi-kernel based approach over a standard kernel based approach.
|
stat.ML cs.LG
|
we develop a multikernel based regression method for graph signal processing where the target signal is assumed to be smooth over a graph in multikernel regression an effective kernel function is expressed as a linear combination of many basis kernel functions we estimate the linear weights to learn the effective kernel function by appropriate regularization based on graph smoothness we show that the resulting optimization problem is shown to be convex and pro pose an accelerated projected gradient descent based solution simulation results using realworld graph signals show efficiency of the multikernel based approach over a standard kernel based approach
|
[['we', 'develop', 'a', 'multikernel', 'based', 'regression', 'method', 'for', 'graph', 'signal', 'processing', 'where', 'the', 'target', 'signal', 'is', 'assumed', 'to', 'be', 'smooth', 'over', 'a', 'graph', 'in', 'multikernel', 'regression', 'an', 'effective', 'kernel', 'function', 'is', 'expressed', 'as', 'a', 'linear', 'combination', 'of', 'many', 'basis', 'kernel', 'functions', 'we', 'estimate', 'the', 'linear', 'weights', 'to', 'learn', 'the', 'effective', 'kernel', 'function', 'by', 'appropriate', 'regularization', 'based', 'on', 'graph', 'smoothness', 'we', 'show', 'that', 'the', 'resulting', 'optimization', 'problem', 'is', 'shown', 'to', 'be', 'convex', 'and', 'pro', 'pose', 'an', 'accelerated', 'projected', 'gradient', 'descent', 'based', 'solution', 'simulation', 'results', 'using', 'realworld', 'graph', 'signals', 'show', 'efficiency', 'of', 'the', 'multikernel', 'based', 'approach', 'over', 'a', 'standard', 'kernel', 'based', 'approach']]
|
[-0.03217868362960871, -0.06487069964612602, -0.15220506943762302, 0.06752403805847279, -0.1494853821909055, -0.1452330144494772, -0.01637271952815354, 0.46364596765488386, -0.3463925552368164, -0.25287900134921076, 0.12474121810751967, -0.21404975900426507, -0.24576729517255444, 0.1971967925876379, -0.09392988761886954, 0.13793258954770862, 0.1134601990506053, 0.041376826260238884, -0.09669303473550826, -0.2581654266512487, 0.29864671647548674, 0.049954970530234274, 0.27718671740964057, 0.025082931593060492, 0.21419323422916933, 0.05823540153447539, -0.02116151690017432, 0.024320196602493526, -0.047657976034461175, 0.1536935077130329, 0.281158534612041, 0.20029337655287235, 0.347209564447403, -0.4041872789338231, -0.24305563524365426, 0.145580759877339, 0.11643402796238661, 0.044761667330749336, -0.04867897071526386, -0.2625494884932414, 0.09979833871126174, -0.15729384900070728, -0.0009273803886026144, -0.10099005767144263, -0.04821214766707271, 0.03571367871016264, -0.3995445572957397, 0.053615941905300134, 0.030502205193042756, 0.03517195409163833, -0.047131068082526324, -0.1582544845715165, 0.06839078193064779, 0.019513644366525112, -0.01655656166141853, 0.11072261126711964, 0.16534669778542593, -0.09577300153207034, -0.13385913731530308, 0.31102122345007954, -0.13900875205174087, -0.29058608930557966, 0.13304762689163907, -0.023559565542964265, -0.09561553002567962, 0.09790441339835525, 0.23887508337385951, 0.16095813613384963, -0.17038923531770706, 0.09545874173694756, -0.041370099345222115, 0.17406984028057196, 0.00025985806249082086, -0.04713601829018444, 0.0987837066524662, 0.18931065685348586, 0.15138860404433216, 0.1612027769163251, -0.09268562197685241, -0.06308261841535569, -0.2591696811764268, -0.10359414637088776, -0.27838786496780815, -0.037063189344480635, -0.17844757941536954, -0.20495153560579638, 0.4119996595662087, 0.1497570022637956, 0.2547398189082742, 0.1160138456709683, 0.305524938153103, 0.1796499962627422, 0.07967078460380435, 0.1374493842246011, 0.1485454951832071, 0.1209677783632651, 0.0021574183355551214, -0.19243497734656556, 0.06476742747006937, 0.14764550074003638]
|
1,803.04197
|
Degeneracies between Modified Gravity and Baryonic Physics
|
In order to determine the observable signatures of modified gravity theories,
it is important to consider the effect of baryonic physics. We use a modified
version of the ISIS code to run cosmological hydrodynamic simulations to study
degeneracies between modified gravity and radiative hydrodynamical processes.
Of these, one was the standard $\Lambda$CDM model and four were variations of
the Symmetron model. For each model we ran three variations of baryonic
processes: non-radiative hydrodynamics; cooling and star formation; and
cooling, star formation, and supernova feedback. We construct stacked gas
density, temperature, and dark matter density profiles of the halos in the
simulations, and study the differences between them. We find that both
radiative variations of the models show degeneracies between their processes
and at least two of the three parameters defining the Symmetron model.
|
astro-ph.CO astro-ph.GA
|
in order to determine the observable signatures of modified gravity theories it is important to consider the effect of baryonic physics we use a modified version of the isis code to run cosmological hydrodynamic simulations to study degeneracies between modified gravity and radiative hydrodynamical processes of these one was the standard lambdacdm model and four were variations of the symmetron model for each model we ran three variations of baryonic processes nonradiative hydrodynamics cooling and star formation and cooling star formation and supernova feedback we construct stacked gas density temperature and dark matter density profiles of the halos in the simulations and study the differences between them we find that both radiative variations of the models show degeneracies between their processes and at least two of the three parameters defining the symmetron model
|
[['in', 'order', 'to', 'determine', 'the', 'observable', 'signatures', 'of', 'modified', 'gravity', 'theories', 'it', 'is', 'important', 'to', 'consider', 'the', 'effect', 'of', 'baryonic', 'physics', 'we', 'use', 'a', 'modified', 'version', 'of', 'the', 'isis', 'code', 'to', 'run', 'cosmological', 'hydrodynamic', 'simulations', 'to', 'study', 'degeneracies', 'between', 'modified', 'gravity', 'and', 'radiative', 'hydrodynamical', 'processes', 'of', 'these', 'one', 'was', 'the', 'standard', 'lambdacdm', 'model', 'and', 'four', 'were', 'variations', 'of', 'the', 'symmetron', 'model', 'for', 'each', 'model', 'we', 'ran', 'three', 'variations', 'of', 'baryonic', 'processes', 'nonradiative', 'hydrodynamics', 'cooling', 'and', 'star', 'formation', 'and', 'cooling', 'star', 'formation', 'and', 'supernova', 'feedback', 'we', 'construct', 'stacked', 'gas', 'density', 'temperature', 'and', 'dark', 'matter', 'density', 'profiles', 'of', 'the', 'halos', 'in', 'the', 'simulations', 'and', 'study', 'the', 'differences', 'between', 'them', 'we', 'find', 'that', 'both', 'radiative', 'variations', 'of', 'the', 'models', 'show', 'degeneracies', 'between', 'their', 'processes', 'and', 'at', 'least', 'two', 'of', 'the', 'three', 'parameters', 'defining', 'the', 'symmetron', 'model']]
|
[-0.08417215126547332, 0.10346276914924943, -0.0950623192523319, 0.16144142835313469, -0.06223105619612493, -0.11285982286221438, -0.030601915586967357, 0.3465788014359156, -0.23147002568370417, -0.38859544352705316, 0.03789170840720093, -0.2690177655085585, -0.07147580466436264, 0.14059475711345518, 0.07522666685395223, 0.001987781722266647, 0.014533917199036009, -0.07490604921398138, -0.08610989829644393, -0.2610029020448236, 0.3480660095740866, 0.09575430473270721, 0.1869500869030791, 0.012998301665389672, 0.0773999802917032, -0.11132198348781444, -0.09367410623629514, -0.010704406417199039, -0.2262201917183667, 0.010536125911000584, 0.13712136523321178, 0.11500026826235585, 0.20380258309668897, -0.4447018976106231, -0.28710020572311223, 0.10743423750540032, 0.12394586357435114, 0.15056176712785505, -0.055630469782263936, -0.20872747881295986, 0.015851555954090747, -0.2163150891656392, -0.09307927592820313, -4.046567526638956e-05, -0.011271162413732898, 0.007396225535394068, -0.2631426766633819, 0.12696614963898814, -0.0025673756109816687, -0.02005821267577042, -0.07459085917142325, -0.0665531562592246, -0.07838677946842254, 0.09651077966751966, 0.045481832634090426, -0.034689264175923246, 0.18694959171956643, -0.17785678484610148, -0.09176987058770164, 0.44976292970709336, -0.11601190638808968, -0.12062694406297926, 0.24326621484767674, -0.181746322920728, -0.15110346680170947, 0.05352635177454554, 0.17958978144802096, 0.07962712003408294, -0.13280360970499092, 0.04304091739153167, 0.014855995849545178, 0.15478612556248286, 0.035115009446845466, -0.003394338681484674, 0.3157736763911308, 0.14552204151238715, -0.04894802698347354, 0.08721353428760417, -0.14241708491257518, -0.09818456363969279, -0.29747918155744557, -0.11271533430939105, -0.08276420640339024, 0.0014464064725303561, -0.1156651227992322, -0.13145153228669687, 0.36939847022925215, 0.1787828276199954, 0.16582173068090378, 0.05462054646384895, 0.3095567246156752, 0.07189797945110533, 0.05087018004422517, 0.07820286406064056, 0.26044088368885276, 0.18043254576868525, 0.05717607836512135, -0.3474050213834901, -0.010808658005347601, 0.04082681165826052]
|
1,803.04198
|
Social software and strategy
|
Aligning interests, motivating contributions to knowledge work, and giving
direction to multiple business units and market initiatives represent daily
challenges facing the strategist in most companies. The diversity of contexts
within an organization has thus led critical management thinkers to suggest
that in the presence of multiple initiatives and discourses, the introduction
of a new technology has multiple unintended consequences for organization. New
technology is regularly subject to power struggles, conflicting goals, and
discrepant events (Markus, 1983; Barley, 1986; Orlikowski, 1992; Ciborra, 1996;
Leonardi, 2008) which impact on how strategies are shaped within organizations.
|
cs.CY
|
aligning interests motivating contributions to knowledge work and giving direction to multiple business units and market initiatives represent daily challenges facing the strategist in most companies the diversity of contexts within an organization has thus led critical management thinkers to suggest that in the presence of multiple initiatives and discourses the introduction of a new technology has multiple unintended consequences for organization new technology is regularly subject to power struggles conflicting goals and discrepant events markus 1983 barley 1986 orlikowski 1992 ciborra 1996 leonardi 2008 which impact on how strategies are shaped within organizations
|
[['aligning', 'interests', 'motivating', 'contributions', 'to', 'knowledge', 'work', 'and', 'giving', 'direction', 'to', 'multiple', 'business', 'units', 'and', 'market', 'initiatives', 'represent', 'daily', 'challenges', 'facing', 'the', 'strategist', 'in', 'most', 'companies', 'the', 'diversity', 'of', 'contexts', 'within', 'an', 'organization', 'has', 'thus', 'led', 'critical', 'management', 'thinkers', 'to', 'suggest', 'that', 'in', 'the', 'presence', 'of', 'multiple', 'initiatives', 'and', 'discourses', 'the', 'introduction', 'of', 'a', 'new', 'technology', 'has', 'multiple', 'unintended', 'consequences', 'for', 'organization', 'new', 'technology', 'is', 'regularly', 'subject', 'to', 'power', 'struggles', 'conflicting', 'goals', 'and', 'discrepant', 'events', 'markus', '1983', 'barley', '1986', 'orlikowski', '1992', 'ciborra', '1996', 'leonardi', '2008', 'which', 'impact', 'on', 'how', 'strategies', 'are', 'shaped', 'within', 'organizations']]
|
[-0.10238107148578147, 0.07780497410330219, -0.06259044189937413, 0.04286045036607665, -0.16201305673862604, -0.11828098184449355, 0.07083201369412405, 0.35816356709793856, -0.2508134586222814, -0.35808835844711767, 0.08079950123488822, -0.30684606664125685, -0.16249974284121138, 0.18189294926402078, -0.20025193172446248, -0.009440483959422083, 0.033230630336101574, -0.06179056914887675, 0.07327779531023344, -0.31945889552488277, 0.25980257111318084, 0.10644000472561659, 0.3418629327485257, 0.07757960328751284, 0.046928656672168036, -0.00899601988899319, -0.09226818625693736, -0.051645990415557244, -0.08905182404574273, 0.1859812011749929, 0.3603199044060286, 0.18986248126273733, 0.41742488830957725, -0.4549116178658669, -0.19880749223185654, 0.055352594883120415, 0.09891450187980967, 0.00801939547249197, -0.026956517569487914, -0.3108409883191242, 0.017137859843585276, -0.2253309930491251, -0.1389838890425618, -0.049641353564093944, 0.0660681122453357, -0.004288036158591833, -0.23190273674528883, -0.011009825808603478, 0.020597733000455344, 0.09854586484194126, -0.035435832372889345, -0.15588876131906823, 0.017183083706818845, 0.22501435000753112, 0.13411290303591397, -0.0006213160453151669, 0.13355323425797827, -0.13013093372928383, -0.22864722036351653, 0.3473525817085908, 0.055308564946956365, -0.07922150260444892, 0.19490694420908214, -0.07749923006833895, -0.21890809994099825, 0.0807671163879011, 0.22639641439056266, -0.022399550185819742, -0.20073816226795316, 0.043922715321810836, 0.02203944092363362, 0.14238130668198448, 0.13378498456238405, -0.010314942838664612, 0.28460230561398453, 0.16311979638007673, 0.06146949560017041, 0.044710968914644225, -0.014858998704964863, -0.17290643657527296, -0.16838806216369645, -0.1037594796684773, -0.085041061352493, 0.026577136442622006, -0.01735887555443459, -0.10502327477518955, 0.3694136476184687, 0.1700943009522946, 0.12810343680046019, -0.04809383253197429, 0.261667560947978, -0.03199932479259113, 0.08594899935554207, 0.06795265269971898, 0.1595282766869312, 0.038193281719704035, 0.2226055684833504, -0.10487781041909171, 0.162346115674945, -0.03650906908771266]
|
1,803.04199
|
Hadamard type fuzzy inequality for (s,m)-convex function in second sense
|
In this paper we prove a Hadamard type fuzzy inequality for (s,m)-convex
function in second sense and some exam- ples are given.
|
math.CA
|
in this paper we prove a hadamard type fuzzy inequality for smconvex function in second sense and some exam ples are given
|
[['in', 'this', 'paper', 'we', 'prove', 'a', 'hadamard', 'type', 'fuzzy', 'inequality', 'for', 'smconvex', 'function', 'in', 'second', 'sense', 'and', 'some', 'exam', 'ples', 'are', 'given']]
|
[-0.08186024859208953, 0.038967852015048265, -0.05569284324618903, 0.1304639184752225, -0.07707793079316616, -0.17900926583785226, 0.027732774366582322, 0.35417734827338293, -0.26480991359461437, -0.23349761971357194, 0.14417800917925144, -0.26965025456791575, -0.23792195591059598, 0.17672368291426788, -0.21023656626824627, 0.04986741177907044, 0.06233727902343327, 0.07153386207805439, -0.11370572969529101, -0.3157586471431635, 0.39457934214310214, -0.1292712561447512, 0.1911929897032678, 0.05989705079065805, 0.10633189015259797, 0.02027691231871193, -0.04473808488215913, 0.004033681513233619, -0.17496582607484676, 0.11604377895127982, 0.295814528087662, 0.1613459367283874, 0.3892371485179121, -0.33745911450717936, -0.06581020156260241, 0.1595408711159094, 0.10656788337721744, 0.023797873068939556, -0.07066089398523961, -0.2716472958299247, 0.11092360406606035, -0.14114479953423142, -0.13358955153010107, -0.04308199584060772, -0.018844640517438, 0.049269537780095234, -0.3129265136508779, 0.09428963530808687, 0.1006863002919338, 0.06954136698252776, -0.08662446969273416, -0.07919989627870647, 0.09963061326098713, 0.025080703283575447, -0.03268729480491443, 0.0334073546003889, 0.016407998723231933, -0.06693469270513477, -0.11229489490241659, 0.24848289906301282, 0.018094460014253855, -0.28203201260079036, 0.04590850010175596, -0.16724556328898127, -0.21586963566104797, -0.0598956059071828, 0.14340117053044113, 0.13854332954030146, -0.14233500328422946, 0.08900260192670183, -0.11308397598225962, 0.15200545367869464, 0.1590614676771855, 0.07451611740345304, 0.04661544358929281, 0.09520057487216863, 0.11992944008670747, 0.18893108453432267, 0.010448643345047127, -0.06786538186398419, -0.3763025571507486, -0.26967809146100824, -0.1738379324087873, 0.07768997727808627, -0.05626064513489837, -0.2244279838421128, 0.34449975057081744, 0.09164477393708446, 0.1307714143767953, 0.1249798578210175, 0.18838761382820932, 0.12342388699339195, -0.05009632475081493, 0.06953989752483639, 0.18713563031501093, 0.11638699485708705, 0.13979400834068656, -0.033550311061183245, 0.06426511076278985, 0.20526014293797992]
|
1,803.042
|
Automated detection and segmentation of non-mass enhancing breast tumors
with dynamic contrast-enhanced magnetic resonance imaging
|
Non-mass enhancing lesions (NME) constitute a diagnostic challenge in dynamic
contrast enhanced magnetic resonance imaging (DCE-MRI) of the breast. Computer
Aided Diagnosis (CAD) systems provide physicians with advanced tools for
analysis, assessment and evaluation that have a significant impact on the
diagnostic performance. Here, we propose a new approach to address the
challenge of NME detection and segmentation, taking advantage of independent
component analysis (ICA) to extract data-driven dynamic lesion
characterizations. A set of independent sources was obtained from DCE-MRI
dataset of breast patients, and the dynamic behavior of the different tissues
was described by multiple dynamic curves, together with a set of eigenimages
describing the scores for each voxel. A new test image is projected onto the
independent source space using the unmixing matrix, and each voxel is
classified by a support vector machine (SVM) that has already been trained with
manually delineated data. A solution to the high false positive rate problem is
proposed by controlling the SVM hyperplane location, outperforming previously
published approaches.
|
eess.IV cs.CV
|
nonmass enhancing lesions nme constitute a diagnostic challenge in dynamic contrast enhanced magnetic resonance imaging dcemri of the breast computer aided diagnosis cad systems provide physicians with advanced tools for analysis assessment and evaluation that have a significant impact on the diagnostic performance here we propose a new approach to address the challenge of nme detection and segmentation taking advantage of independent component analysis ica to extract datadriven dynamic lesion characterizations a set of independent sources was obtained from dcemri dataset of breast patients and the dynamic behavior of the different tissues was described by multiple dynamic curves together with a set of eigenimages describing the scores for each voxel a new test image is projected onto the independent source space using the unmixing matrix and each voxel is classified by a support vector machine svm that has already been trained with manually delineated data a solution to the high false positive rate problem is proposed by controlling the svm hyperplane location outperforming previously published approaches
|
[['nonmass', 'enhancing', 'lesions', 'nme', 'constitute', 'a', 'diagnostic', 'challenge', 'in', 'dynamic', 'contrast', 'enhanced', 'magnetic', 'resonance', 'imaging', 'dcemri', 'of', 'the', 'breast', 'computer', 'aided', 'diagnosis', 'cad', 'systems', 'provide', 'physicians', 'with', 'advanced', 'tools', 'for', 'analysis', 'assessment', 'and', 'evaluation', 'that', 'have', 'a', 'significant', 'impact', 'on', 'the', 'diagnostic', 'performance', 'here', 'we', 'propose', 'a', 'new', 'approach', 'to', 'address', 'the', 'challenge', 'of', 'nme', 'detection', 'and', 'segmentation', 'taking', 'advantage', 'of', 'independent', 'component', 'analysis', 'ica', 'to', 'extract', 'datadriven', 'dynamic', 'lesion', 'characterizations', 'a', 'set', 'of', 'independent', 'sources', 'was', 'obtained', 'from', 'dcemri', 'dataset', 'of', 'breast', 'patients', 'and', 'the', 'dynamic', 'behavior', 'of', 'the', 'different', 'tissues', 'was', 'described', 'by', 'multiple', 'dynamic', 'curves', 'together', 'with', 'a', 'set', 'of', 'eigenimages', 'describing', 'the', 'scores', 'for', 'each', 'voxel', 'a', 'new', 'test', 'image', 'is', 'projected', 'onto', 'the', 'independent', 'source', 'space', 'using', 'the', 'unmixing', 'matrix', 'and', 'each', 'voxel', 'is', 'classified', 'by', 'a', 'support', 'vector', 'machine', 'svm', 'that', 'has', 'already', 'been', 'trained', 'with', 'manually', 'delineated', 'data', 'a', 'solution', 'to', 'the', 'high', 'false', 'positive', 'rate', 'problem', 'is', 'proposed', 'by', 'controlling', 'the', 'svm', 'hyperplane', 'location', 'outperforming', 'previously', 'published', 'approaches']]
|
[-0.033486773675105656, -1.3195492989237769e-05, -0.0620036574967026, 0.03842836907708524, -0.0990342061436477, -0.18651043541774334, 0.036191826840548454, 0.3653097663815302, -0.18987716280810354, -0.3144023286582655, 0.12334590896063607, -0.2878648147873401, -0.13914681092549483, 0.2196219706604908, -0.09731292469337223, 0.1088885815985254, 0.13336384874566581, 0.02020617546559261, -0.018928997148479145, -0.2433454122686063, 0.2833826587541051, 0.038912553540767586, 0.3480855902539095, 0.014919362075806382, 0.12816431399235637, 0.007488916340530906, -0.08228761721851237, 0.02365727911416458, -0.06200289667953235, 0.1648595449507674, 0.3528107576316267, 0.22750704003924346, 0.3304048491535282, -0.365064559312585, -0.24944950373147626, 0.09211872326327959, 0.15504080079375285, 0.06585067330266305, -0.04799320377025147, -0.34777069961405305, 0.10565242096248745, -0.12364060064098877, -0.05283938419685351, -0.10528170300159513, -0.008649395148309105, -0.03146214597908982, -0.3029487221137093, 0.09024767969813512, 0.0017846118243613157, 0.14090140593004644, -0.12511061464649548, -0.1569210110380909, 0.04542454984109198, 0.1627488974481821, 0.012227454830062049, 0.08915584843748821, 0.18564307647027883, -0.15507744966041162, -0.14990469018356448, 0.3183178757597883, -0.011268587963212371, -0.19874740164749413, 0.16736485107790633, -0.06403728704464745, -0.12961920408296387, 0.16318129303483628, 0.21452180174437452, 0.08683627443907065, -0.19950702042509633, -0.014892480214060136, -0.003545485739876707, 0.18687454974054393, 0.05256802489537835, -0.06672836872131889, 0.18526496086760524, 0.2527299029135471, -0.032542822425638, 0.14297839806272075, -0.17701598603687957, -0.008556034800271133, -0.20008230684865097, -0.1457729281700519, -0.18125519139063825, -0.03067732801666506, -0.1230741809567588, -0.19264608544279282, 0.4206979963900409, 0.16226669920311051, 0.17151139252286135, 0.015562916767828346, 0.3353214884423707, 0.05513038232530529, 0.1105763175684667, 0.011139628694796688, 0.20426663409649248, 0.08287892187805285, 0.0902271296089818, -0.2007232267305771, 0.10807534891141421, 0.06917589493600809]
|
1,803.04201
|
Bounds for a spectral exponential sum
|
We prove new upper bounds for a spectral exponential sum by refining the
process by which one evaluates mean values of $L$-functions multiplied by an
oscillating function. In particular, we introduce a method which is capable of
taking into consideration the oscillatory behaviour of the function. This gives
an improvement of the result of Luo and Sarnak when $T\geq X^{1/6+2\theta/3}$.
Furthermore, this proves the conjecture of Petridis and Risager in some ranges.
Finally, this allows obtaining a new proof of the Soundararajan-Young error
estimate in the prime geodesic theorem.
|
math.NT math.SP
|
we prove new upper bounds for a spectral exponential sum by refining the process by which one evaluates mean values of lfunctions multiplied by an oscillating function in particular we introduce a method which is capable of taking into consideration the oscillatory behaviour of the function this gives an improvement of the result of luo and sarnak when tgeq x162theta3 furthermore this proves the conjecture of petridis and risager in some ranges finally this allows obtaining a new proof of the soundararajanyoung error estimate in the prime geodesic theorem
|
[['we', 'prove', 'new', 'upper', 'bounds', 'for', 'a', 'spectral', 'exponential', 'sum', 'by', 'refining', 'the', 'process', 'by', 'which', 'one', 'evaluates', 'mean', 'values', 'of', 'lfunctions', 'multiplied', 'by', 'an', 'oscillating', 'function', 'in', 'particular', 'we', 'introduce', 'a', 'method', 'which', 'is', 'capable', 'of', 'taking', 'into', 'consideration', 'the', 'oscillatory', 'behaviour', 'of', 'the', 'function', 'this', 'gives', 'an', 'improvement', 'of', 'the', 'result', 'of', 'luo', 'and', 'sarnak', 'when', 'tgeq', 'x162theta3', 'furthermore', 'this', 'proves', 'the', 'conjecture', 'of', 'petridis', 'and', 'risager', 'in', 'some', 'ranges', 'finally', 'this', 'allows', 'obtaining', 'a', 'new', 'proof', 'of', 'the', 'soundararajanyoung', 'error', 'estimate', 'in', 'the', 'prime', 'geodesic', 'theorem']]
|
[-0.15599361591940297, 0.07544896158894214, -0.14661639083669276, 0.055386649445472884, -0.03314476458077458, -0.10425252037593859, 0.06967280063264329, 0.2549482565908425, -0.24474703332130937, -0.29117354059099465, 0.05979062340773599, -0.21332610900304413, -0.14376562288708064, 0.25333025449908325, -0.10727828390221915, 0.03677224559089217, 0.03980254162445493, 0.039469552900770616, -0.07044880805622744, -0.2700366862894346, 0.3359973604694523, 0.020837795995604032, 0.2140558184306512, 0.11208438001012419, 0.10396710805723379, 0.05962528919415741, -0.035137166065731265, -0.05227305313562921, -0.19645547635596375, 0.1634957890358122, 0.19398818297804088, 0.10382353292574742, 0.31608495602234343, -0.3347936014527048, -0.1554547815192919, 0.14002271383551174, 0.1537083199611683, 0.05388395644017849, -0.018651279452224744, -0.2754783012807883, 0.12165873444066437, -0.14995102066246943, -0.17743790671282886, -0.06905412849509852, 0.03262213690356276, 0.040739170539235675, -0.3320108113767601, 0.06715935868500121, 0.16974004244581722, 0.06770815946738472, -0.0686787225542879, -0.15112563432729537, 0.07529832840222737, 0.0970628599026749, 0.07740882275614021, 0.03233896887957536, 0.03228908666441667, -0.10576857775503277, -0.08257053862593469, 0.2994021453048991, -0.10943424708983358, -0.1901544293859738, 0.04754051139000161, -0.15364465865188803, -0.1425618213031377, 0.13195379835288523, 0.11306918487380976, 0.1337932674588914, -0.12006569135450389, 0.11674672327587787, -0.08795647961810103, 0.09992903294362898, 0.10367007036532822, -0.009266683296568093, 0.13289966143068227, 0.12414790843024678, 0.11112927466673755, 0.21835469813139616, -0.05870213186175659, -0.03204842147834856, -0.34172064490380816, -0.1996863773199676, -0.1913666458875369, 0.08568228875158419, -0.14822706958545298, -0.15962149487171406, 0.4045933898880906, 0.11755951943314881, 0.21384037552058868, 0.1464984714262316, 0.26248139678232973, 0.19276744095158987, 0.013560169938437897, 0.07745322010681586, 0.19512828179245717, 0.15003472176814003, 0.034343380216059496, -0.1655328864199591, 0.06346305464554963, 0.15131169306007267]
|
1,803.04202
|
BFC-theorems for higher commutator subgroups
|
A BFC-group is a group in which all conjugacy classes are finite with bounded
size. In 1954 B. H. Neumann discovered that if G is a BFC-group then the
derived group G' is finite. Let w=w(x_1,\dots,x_n) be a multilinear commutator.
We study groups in which the conjugacy classes containing w-values are finite
of bounded order. Let G be a group and let w(G) be the verbal subgroup of G
generated by all w-values. We prove that if x^G has size at most m for every
w-value x, then the derived subgroup of w(G) is finite of order bounded by a
function of m and n. If x^{w(G)} has size at most m for every w-value x, then
[w(w(G)),w(G)] is finite of order bounded by a function of m and n.
|
math.GR
|
a bfcgroup is a group in which all conjugacy classes are finite with bounded size in 1954 b h neumann discovered that if g is a bfcgroup then the derived group g is finite let wwx_1dotsx_n be a multilinear commutator we study groups in which the conjugacy classes containing wvalues are finite of bounded order let g be a group and let wg be the verbal subgroup of g generated by all wvalues we prove that if xg has size at most m for every wvalue x then the derived subgroup of wg is finite of order bounded by a function of m and n if xwg has size at most m for every wvalue x then wwgwg is finite of order bounded by a function of m and n
|
[['a', 'bfcgroup', 'is', 'a', 'group', 'in', 'which', 'all', 'conjugacy', 'classes', 'are', 'finite', 'with', 'bounded', 'size', 'in', '1954', 'b', 'h', 'neumann', 'discovered', 'that', 'if', 'g', 'is', 'a', 'bfcgroup', 'then', 'the', 'derived', 'group', 'g', 'is', 'finite', 'let', 'wwx_1dotsx_n', 'be', 'a', 'multilinear', 'commutator', 'we', 'study', 'groups', 'in', 'which', 'the', 'conjugacy', 'classes', 'containing', 'wvalues', 'are', 'finite', 'of', 'bounded', 'order', 'let', 'g', 'be', 'a', 'group', 'and', 'let', 'wg', 'be', 'the', 'verbal', 'subgroup', 'of', 'g', 'generated', 'by', 'all', 'wvalues', 'we', 'prove', 'that', 'if', 'xg', 'has', 'size', 'at', 'most', 'm', 'for', 'every', 'wvalue', 'x', 'then', 'the', 'derived', 'subgroup', 'of', 'wg', 'is', 'finite', 'of', 'order', 'bounded', 'by', 'a', 'function', 'of', 'm', 'and', 'n', 'if', 'xwg', 'has', 'size', 'at', 'most', 'm', 'for', 'every', 'wvalue', 'x', 'then', 'wwgwg', 'is', 'finite', 'of', 'order', 'bounded', 'by', 'a', 'function', 'of', 'm', 'and', 'n']]
|
[-0.1762151546701789, 0.20199515935778617, -0.08142416843026877, -0.06287925204541535, -0.08618237485922874, -0.14661191755905748, 0.007468619376420974, 0.3506694746296853, -0.3201402655933052, -0.23012602517753838, 0.12062076439429074, -0.30151953718066216, -0.043504008932039144, 0.18931836769729854, -0.08652761869877577, -0.053654170418158176, 0.03755952861532569, 0.18057024194300175, -0.0699310652911663, -0.29224871086329224, 0.3364804975558072, -0.14224747900664805, 0.15694417867064475, 0.014685001209378242, 0.11286305509507656, -0.03617141748033464, 0.007650159984827041, 0.08261782923527063, -0.13074779990001115, 0.06801954733580351, 0.3062436666339636, 0.07795033651310951, 0.3303476366251707, -0.2928452796614729, -0.17963006798177958, 0.2604744525346905, 0.13173981585353614, -0.07394995448179544, -0.02701731568388641, -0.26493407888524234, 0.2776307246312499, -0.16960720360092818, -0.10610781209915876, 0.017425054803490637, 0.20661066862940788, 0.005382738335058093, -0.30564188900589945, -0.028303815795108676, 0.06859656608104706, 0.09307082232832908, 0.03131232745945454, -0.12100290526449681, -0.09537898350507021, 0.11463980099931359, -0.05950399389304221, 0.09972899777023121, 0.03512382630165666, -0.028219358779489993, -0.06302762537449598, 0.43347791892290116, -0.12314610209967941, -0.20197350026667119, 0.10228251587226987, -0.24251917937770487, -0.11391154033690691, 0.10668746483325958, 0.09539088914357126, 0.18345731097459794, -0.05156989947706461, 0.2620360933528282, -0.1669944710955024, 0.1410015835352242, 0.06089877135306597, -0.04083503168821335, 0.07476308052241802, 0.10468055552616716, 0.1260176251232624, 0.11903208353091031, 0.03579836690425873, 0.16404445410519838, -0.3844111421480775, -0.13710335244238375, -0.21055427497066556, 0.12794327706098557, -0.10464489401469473, -0.1464562005046755, 0.3606907959282398, 0.03501361270993948, 0.15592106775939465, 0.11939142017252743, 0.15683935931324958, 0.11402837209403514, 0.05991693443292752, 0.18014398297294976, 0.03309611716121435, 0.22459114527143537, -0.13623779164254665, -0.18547524327784776, 0.0416141006089747, 0.2108818888454698]
|
1,803.04203
|
Radiative rates for E1, E2, M1, and M2 transitions in Ne-like Cu XX, Zn
XXI and Ga XXII
|
Energy levels, radiative rates and lifetimes are reported for the lowest 139
levels of three Ne-like ions, namely Cu~XX, Zn~XXI and Ga~XXII. These levels
mostly belong to the 2s$^2$2p$^6$, 2s$^2$2p$^5$3$\ell$, 2s2p$^6$3$\ell$,
2s$^2$2p$^5$4$\ell$, 2s2p$^6$4$\ell$, and 2s$^2$2p$^5$5$\ell$ configurations.
For the calculations the general-purpose relativistic atomic structure package
(GRASP) has been adopted. Comparisons are made with earlier available
theoretical and experimental results, particularly among the lowest 27 levels
of the 2s$^2$2p$^6$ and 2s$^2$2p$^5$3$\ell$ configurations. Due to paucity of
similar data for higher lying levels, analogous calculations have also been
performed with the flexible atomic code (FAC). These calculations help in
assessing the accuracy of our calculated results, especially for the energy
levels.
|
physics.atom-ph
|
energy levels radiative rates and lifetimes are reported for the lowest 139 levels of three nelike ions namely cuxx znxxi and gaxxii these levels mostly belong to the 2s22p6 2s22p53ell 2s2p63ell 2s22p54ell 2s2p64ell and 2s22p55ell configurations for the calculations the generalpurpose relativistic atomic structure package grasp has been adopted comparisons are made with earlier available theoretical and experimental results particularly among the lowest 27 levels of the 2s22p6 and 2s22p53ell configurations due to paucity of similar data for higher lying levels analogous calculations have also been performed with the flexible atomic code fac these calculations help in assessing the accuracy of our calculated results especially for the energy levels
|
[['energy', 'levels', 'radiative', 'rates', 'and', 'lifetimes', 'are', 'reported', 'for', 'the', 'lowest', '139', 'levels', 'of', 'three', 'nelike', 'ions', 'namely', 'cuxx', 'znxxi', 'and', 'gaxxii', 'these', 'levels', 'mostly', 'belong', 'to', 'the', '2s22p6', '2s22p53ell', '2s2p63ell', '2s22p54ell', '2s2p64ell', 'and', '2s22p55ell', 'configurations', 'for', 'the', 'calculations', 'the', 'generalpurpose', 'relativistic', 'atomic', 'structure', 'package', 'grasp', 'has', 'been', 'adopted', 'comparisons', 'are', 'made', 'with', 'earlier', 'available', 'theoretical', 'and', 'experimental', 'results', 'particularly', 'among', 'the', 'lowest', '27', 'levels', 'of', 'the', '2s22p6', 'and', '2s22p53ell', 'configurations', 'due', 'to', 'paucity', 'of', 'similar', 'data', 'for', 'higher', 'lying', 'levels', 'analogous', 'calculations', 'have', 'also', 'been', 'performed', 'with', 'the', 'flexible', 'atomic', 'code', 'fac', 'these', 'calculations', 'help', 'in', 'assessing', 'the', 'accuracy', 'of', 'our', 'calculated', 'results', 'especially', 'for', 'the', 'energy', 'levels']]
|
[-0.0613597311494945, 0.10925886696934992, 0.00787913544085242, 0.11144427500446052, 0.04311189009561477, -0.11899069323222719, 0.04543090389365805, 0.4190508314572713, -0.1317197571545109, -0.40262927841760365, 0.03957928102075433, -0.27996860849488453, -0.0018348876551231917, 0.19333364265541747, 0.055206616956959755, 0.08240854106934778, 0.09640807904503948, -0.00555674216650682, -0.06630139177044232, -0.20900473325723307, 0.2867614107421033, 0.16237476224298864, 0.30862091470728903, 0.08225222952052147, 0.016429846098546086, -0.09137066666438591, -0.026027693253412258, -0.00602778265544889, -0.1399807665050806, 0.16986547302233293, 0.2782776823778655, 0.04090422296476569, 0.23137779290303953, -0.44896833025211214, -0.17674820698048993, 0.019282834102198772, 0.0961786134113722, 0.146792233259618, -0.054426444738911575, -0.2461863901105472, 0.08952406927139736, -0.18689821361947587, -0.09632375877488669, -0.1227603887353896, 0.01618142478343775, 0.05691944284583716, -0.23044602337176912, 0.0465972133585156, -0.02540684144432638, 0.1136495529303205, -0.1400758277113531, -0.26794729548889923, -0.06443759587401633, 0.14977162717567646, 0.025998589632959635, 0.0047306230876083466, 0.07910575003673632, -0.07498935342528949, -0.1295471027294886, 0.4169072483702764, -0.007882428757261997, -0.16405252512891358, 0.25686749660720426, -0.1441136938611082, -0.18012667378848968, 0.16865642147561577, 0.11804135594352641, 0.09945809441691666, -0.10116557092189003, 0.06048585225853101, 0.0388780622651764, 0.15654263925492107, 0.060162282347971316, 0.057018649467614056, 0.14799630043425543, 0.10682285647364516, -0.08605280182296958, 0.0628574051455978, -0.14859780464230068, -0.11498985573302443, -0.19849937293203732, -0.1003893958906844, -0.10372726182343767, -0.030203823363134527, -0.016511777424288904, -0.10124790056736446, 0.3733867797270125, 0.14478992730123447, 0.16135665847390307, -0.0026201428023769576, 0.26394128792133986, 0.10527140588394604, 0.08353636064338406, 0.07668105604620103, 0.2806765983867295, 0.12165147355100249, 0.04908871680484427, -0.22030961124555154, 0.05741375167945437, -0.00714813243122954]
|
1,803.04204
|
Semiparametric Contextual Bandits
|
This paper studies semiparametric contextual bandits, a generalization of the
linear stochastic bandit problem where the reward for an action is modeled as a
linear function of known action features confounded by an non-linear
action-independent term. We design new algorithms that achieve
$\tilde{O}(d\sqrt{T})$ regret over $T$ rounds, when the linear function is
$d$-dimensional, which matches the best known bounds for the simpler
unconfounded case and improves on a recent result of Greenewald et al. (2017).
Via an empirical evaluation, we show that our algorithms outperform prior
approaches when there are non-linear confounding effects on the rewards.
Technically, our algorithms use a new reward estimator inspired by
doubly-robust approaches and our proofs require new concentration inequalities
for self-normalized martingales.
|
stat.ML cs.LG
|
this paper studies semiparametric contextual bandits a generalization of the linear stochastic bandit problem where the reward for an action is modeled as a linear function of known action features confounded by an nonlinear actionindependent term we design new algorithms that achieve tildeodsqrtt regret over t rounds when the linear function is ddimensional which matches the best known bounds for the simpler unconfounded case and improves on a recent result of greenewald et al 2017 via an empirical evaluation we show that our algorithms outperform prior approaches when there are nonlinear confounding effects on the rewards technically our algorithms use a new reward estimator inspired by doublyrobust approaches and our proofs require new concentration inequalities for selfnormalized martingales
|
[['this', 'paper', 'studies', 'semiparametric', 'contextual', 'bandits', 'a', 'generalization', 'of', 'the', 'linear', 'stochastic', 'bandit', 'problem', 'where', 'the', 'reward', 'for', 'an', 'action', 'is', 'modeled', 'as', 'a', 'linear', 'function', 'of', 'known', 'action', 'features', 'confounded', 'by', 'an', 'nonlinear', 'actionindependent', 'term', 'we', 'design', 'new', 'algorithms', 'that', 'achieve', 'tildeodsqrtt', 'regret', 'over', 't', 'rounds', 'when', 'the', 'linear', 'function', 'is', 'ddimensional', 'which', 'matches', 'the', 'best', 'known', 'bounds', 'for', 'the', 'simpler', 'unconfounded', 'case', 'and', 'improves', 'on', 'a', 'recent', 'result', 'of', 'greenewald', 'et', 'al', '2017', 'via', 'an', 'empirical', 'evaluation', 'we', 'show', 'that', 'our', 'algorithms', 'outperform', 'prior', 'approaches', 'when', 'there', 'are', 'nonlinear', 'confounding', 'effects', 'on', 'the', 'rewards', 'technically', 'our', 'algorithms', 'use', 'a', 'new', 'reward', 'estimator', 'inspired', 'by', 'doublyrobust', 'approaches', 'and', 'our', 'proofs', 'require', 'new', 'concentration', 'inequalities', 'for', 'selfnormalized', 'martingales']]
|
[-0.02331051186466554, -0.0072673179759985326, -0.06448351691271793, 0.07770810747554652, -0.14463862283471024, -0.1723927294843341, 0.07672543815037204, 0.373626709083032, -0.24815956529987565, -0.2876042857355738, 0.0871278017254199, -0.255989624645119, -0.2523949619706215, 0.24004239181719594, -0.1866328513123474, 0.09673951534649074, 0.05359278816603503, -0.007324924763544636, -0.030043327304757457, -0.34913422904466673, 0.279647346222931, 0.0723148179398376, 0.2523050892948157, -0.016122692744089763, 0.1418718143683953, 0.047643907522088136, -0.0315950783403685, 0.024477605092323433, -0.1546333380053619, 0.08008633205031787, 0.2780733767549618, 0.1762373802031122, 0.3823145387646884, -0.3683740048969196, -0.21565311188193953, 0.11370554697991869, 0.0982983511587964, 0.09157191724733497, -0.04403536282361375, -0.3214604310134931, -0.0052001971861947395, -0.14933241603864453, -0.0071554049549592755, -0.10196019977457442, -0.022894514227380692, 0.01235676899584902, -0.4204512803136545, 0.0931294338059438, 0.1327503697070593, 0.023274480824588634, -0.030031509957891906, -0.17897081594929984, 0.09946132297982793, 0.045916107410695246, 0.0637008548216989, 0.05359189592743829, 0.10057037831599808, -0.1304325629050362, -0.24598076128621854, 0.2671018181273998, -0.08683295254358801, -0.21682509542561246, 0.1511535793740176, -0.03583514641465272, -0.17403927254214316, 0.06679294410287955, 0.21441560928409886, 0.19460438969308289, -0.14597639398993648, 0.12377064830477555, -0.12769824826805773, 0.16909053473401878, 0.040393127734236166, 0.025419438397906467, 0.05993295900555233, 0.18209664740252418, 0.1543225517922665, 0.1057528348213409, 0.005855427180827296, -0.11593564969371073, -0.28758504639490173, -0.09288054965120757, -0.20447281748056412, -0.005673176656335087, -0.14437546882106553, -0.1441659047337391, 0.3216350805645777, 0.14973408984557046, 0.1852358610258769, 0.19950556781210038, 0.3131732257454009, 0.12420781994025397, 0.032608263541833826, 0.14299768243395425, 0.20230839451798632, 0.08519790356315798, 0.05530205754054142, -0.19365529009334395, 0.1599069923267037, 0.07838699854989299]
|
1,803.04205
|
Modeling of the equilibrium component of the stress tensor of filled
elastomeric materials with taking into account the Mullins softening effect
|
Elastomers are viscoelastic materials and their properties significantly
depend on the loading rate. The actual stress experienced by these materials is
the sum of equilibrium and dissipative (inelastic) terms. At very low loading
rates we can eliminate the significant influence of time effects and model the
material as hyperelastic. In this paper, the features of the experimental
determination and subsequent mathematical description of equilibrium stresses
are considered. Verification of the proposed equations has been carried out for
a series of experiments - cyclic uniaxial tests of samples of materials on the
basis of the same matrix, but with different filler contents and under
different maximum degrees of deformation.
|
cond-mat.soft cond-mat.mtrl-sci
|
elastomers are viscoelastic materials and their properties significantly depend on the loading rate the actual stress experienced by these materials is the sum of equilibrium and dissipative inelastic terms at very low loading rates we can eliminate the significant influence of time effects and model the material as hyperelastic in this paper the features of the experimental determination and subsequent mathematical description of equilibrium stresses are considered verification of the proposed equations has been carried out for a series of experiments cyclic uniaxial tests of samples of materials on the basis of the same matrix but with different filler contents and under different maximum degrees of deformation
|
[['elastomers', 'are', 'viscoelastic', 'materials', 'and', 'their', 'properties', 'significantly', 'depend', 'on', 'the', 'loading', 'rate', 'the', 'actual', 'stress', 'experienced', 'by', 'these', 'materials', 'is', 'the', 'sum', 'of', 'equilibrium', 'and', 'dissipative', 'inelastic', 'terms', 'at', 'very', 'low', 'loading', 'rates', 'we', 'can', 'eliminate', 'the', 'significant', 'influence', 'of', 'time', 'effects', 'and', 'model', 'the', 'material', 'as', 'hyperelastic', 'in', 'this', 'paper', 'the', 'features', 'of', 'the', 'experimental', 'determination', 'and', 'subsequent', 'mathematical', 'description', 'of', 'equilibrium', 'stresses', 'are', 'considered', 'verification', 'of', 'the', 'proposed', 'equations', 'has', 'been', 'carried', 'out', 'for', 'a', 'series', 'of', 'experiments', 'cyclic', 'uniaxial', 'tests', 'of', 'samples', 'of', 'materials', 'on', 'the', 'basis', 'of', 'the', 'same', 'matrix', 'but', 'with', 'different', 'filler', 'contents', 'and', 'under', 'different', 'maximum', 'degrees', 'of', 'deformation']]
|
[-0.13458410547132316, 0.15068568389375356, -0.09543917002156377, -0.038418228311516416, -0.03333021641195377, -0.092381397884548, 0.029082486189457926, 0.3593524937892211, -0.2682831892700187, -0.30083107269395176, 0.11433677838693121, -0.2704172403569046, -0.12799796048621429, 0.17260349275779294, -0.003898694188656094, 0.09870946825107682, 0.04778898311082587, -0.01755664548096813, -0.11215837379900094, -0.259423028834373, 0.2723277359178168, 0.10581132084583846, 0.3537945611767958, 0.07643017140336805, 0.1087834262419666, -0.02298116146491092, -0.02163438592976499, 0.05287944092023596, -0.14623403891694742, 0.06367663576302475, 0.23189236463056268, 0.03965321088549202, 0.23192036395596566, -0.4972619875638841, -0.23805584726750711, 0.07482223160604068, 0.07833627057501123, 0.10667637088031412, -0.02639468971021891, -0.21089758133628866, 0.06309678104366655, -0.16195026039642013, -0.08931828008216118, -0.10544876619155093, 0.02286644287790372, 0.08134456541580713, -0.24031194735962513, 0.10637308252218101, 0.050107327115800335, 0.10119825461552974, -0.13637586310941063, -0.16971935609477423, -0.025264050611338327, 0.10667948607816666, 0.11751030971378819, -0.06345674550491516, 0.1969214430923147, -0.16933697192041883, -0.03404904461561519, 0.4403936942064456, -0.022466225160620933, -0.19280365433230578, 0.21178938375098336, -0.11922414801039985, -0.07940047637724848, 0.14253316510895214, 0.2183292739389238, 0.11229680875472933, -0.16102695590859958, 0.016343472333718526, -0.016252643707269265, 0.13356864302654134, 0.06571850281374128, 0.021150845769905946, 0.1996997743496828, 0.16719202565412236, -0.03777538747287346, 0.15309799561346663, -0.0558328466341944, -0.063063379324903, -0.298410827137321, -0.15328360063667956, -0.17706247760313693, 0.02551504468466982, -0.1170373911762373, -0.15975931083357015, 0.4062163844164983, 0.11925315224591677, 0.14922468357710778, 0.009837144833475909, 0.24395159565817529, 0.08307369135072123, 0.07448219084703128, -0.00627761493463104, 0.2992297708226594, 0.12534802923388083, 0.07394801555027332, -0.2574970838722608, 0.15230510176690382, 0.023600871300446653]
|
1,803.04206
|
Sums of Kloosterman sums in the prime geodesic theorem
|
We develop a new method for studying sums of Kloosterman sums related to the
spectral exponential sum. As a corollary, we obtain a new proof of the estimate
of Soundararajan and Young for the error term in the prime geodesic theorem.
|
math.NT math.SP
|
we develop a new method for studying sums of kloosterman sums related to the spectral exponential sum as a corollary we obtain a new proof of the estimate of soundararajan and young for the error term in the prime geodesic theorem
|
[['we', 'develop', 'a', 'new', 'method', 'for', 'studying', 'sums', 'of', 'kloosterman', 'sums', 'related', 'to', 'the', 'spectral', 'exponential', 'sum', 'as', 'a', 'corollary', 'we', 'obtain', 'a', 'new', 'proof', 'of', 'the', 'estimate', 'of', 'soundararajan', 'and', 'young', 'for', 'the', 'error', 'term', 'in', 'the', 'prime', 'geodesic', 'theorem']]
|
[-0.1472606581249615, 0.008358672897263272, -0.16617320968610486, 0.15716367823685087, -0.0849188987347411, -0.0935239810155841, 0.11471851047401022, 0.24354030114666717, -0.29732602689324356, -0.2706491030389216, 0.09805583243723959, -0.22898728164230905, -0.13599022643260159, 0.2675844812992869, -0.11462296511432747, 0.033185283227528374, 0.04634477552480814, 0.033632434495702024, -0.07253555419979753, -0.2544262692241407, 0.32036676012524745, -0.014732932740050117, 0.16070516591482772, 0.11110896662604518, 0.10190727143752866, 0.04990040297370132, -0.09902989237410266, -0.07949104423566562, -0.20051533358580456, 0.19870778086890534, 0.21168083661213155, 0.08428315384449755, 0.29567951611356763, -0.3226746136731491, -0.12412095163017511, 0.16254147760024884, 0.18833420957188782, 0.04382182248845333, -0.036669081576713704, -0.2392336595888681, 0.1089951113638718, -0.19252795639743164, -0.19415404715734283, -0.12331544930433355, -0.006352433435073713, 0.10290313457570426, -0.3397734633521972, 0.11120473071024185, 0.15442543572223769, 0.09218087898022155, -0.062475032553576476, -0.203083970175102, 0.1450023993668033, 0.10247145021879454, 0.0986061873959332, 0.03181679717196924, -0.004057200352956609, -0.07406327114781229, -0.1328060730564885, 0.3289178087853077, -0.13086424118884635, -0.1696489823913974, 0.06393565671382154, -0.13308736959063425, -0.17201949058600316, 0.10472109264171706, 0.18105665841934884, 0.183509226615836, -0.09595011376843947, 0.06160259833871728, -0.1304742891977473, 0.06922908463492626, 0.13171225838454031, 0.054261179481882874, 0.1547321605427963, 0.07849994818566412, 0.11054419921483935, 0.21609872679521397, -0.06928990718840462, -0.0025618184448742286, -0.36610548520778735, -0.2540781252404175, -0.23219221347102487, 0.14442320554176483, -0.16437017155503117, -0.24832511509246216, 0.38838527442478554, 0.04622231434076661, 0.12760037439307426, 0.20990791308080278, 0.23892569480600154, 0.17051419422382535, 0.051360906044975285, 0.03966317573195272, 0.13632422547628423, 0.26735889221109993, 0.017239155168304356, -0.12113586731436776, -0.008384546344509212, 0.2467433293236465]
|
1,803.04207
|
A.s. convergence for infinite colour P\'olya urns associated with random
walks
|
We consider P\'olya urns with infinitely many colours that are of a random
walk type, in two related version. We show that the colour distribution a.s.,
after rescaling, converges to a normal distribution, assuming only second
moments on the offset distribution. This improves results by Bandyopadhyay and
Thacker (2014--2017; convergence in probability), and Mailler and Marckert
(2017; a.s. convergence assuming exponential moment).
|
math.PR
|
we consider polya urns with infinitely many colours that are of a random walk type in two related version we show that the colour distribution as after rescaling converges to a normal distribution assuming only second moments on the offset distribution this improves results by bandyopadhyay and thacker 20142017 convergence in probability and mailler and marckert 2017 as convergence assuming exponential moment
|
[['we', 'consider', 'polya', 'urns', 'with', 'infinitely', 'many', 'colours', 'that', 'are', 'of', 'a', 'random', 'walk', 'type', 'in', 'two', 'related', 'version', 'we', 'show', 'that', 'the', 'colour', 'distribution', 'as', 'after', 'rescaling', 'converges', 'to', 'a', 'normal', 'distribution', 'assuming', 'only', 'second', 'moments', 'on', 'the', 'offset', 'distribution', 'this', 'improves', 'results', 'by', 'bandyopadhyay', 'and', 'thacker', '20142017', 'convergence', 'in', 'probability', 'and', 'mailler', 'and', 'marckert', '2017', 'as', 'convergence', 'assuming', 'exponential', 'moment']]
|
[-0.03983978383895773, 0.13303216318523542, -0.12203064254011775, 0.08074119863230124, -0.00924758500129473, -0.11168234462498641, 0.07331822747383725, 0.41631146995198043, -0.20318989006451285, -0.2668592000502299, 0.10017861791916924, -0.2953325119785598, -0.1126802577713474, 0.12579152598732807, -0.13365194606060377, 0.03674142330610117, 0.052168572279548305, 0.006225060549427251, -0.028828308818342745, -0.30499593678816056, 0.2816434413209924, -0.02788179696033724, 0.2654567667804124, -0.019198983953502335, 0.09817888796879132, 0.05190053731622938, -0.006379207524616027, -0.0009307273526172169, -0.11576237814757614, 0.03280764975829325, 0.10460171315696884, 0.09817117624381771, 0.2915674236709954, -0.3168203107722592, -0.14704586197545783, 0.14806647752946028, 0.16977636793200843, 0.04743659445924348, -0.06473478854473558, -0.2619429690702284, 0.105295560540265, -0.15445481155250892, -0.1635367800786969, -0.03718406531471209, 0.04772631546146557, 0.15873398471596942, -0.3255373043347852, 0.11601617287264251, 0.1475071042440221, 0.004884859562644422, -0.004998697494691024, -0.15300581475994626, 0.011634890554991902, 0.06697522101496331, 0.06164787131644114, 0.029038795010476817, 0.07704015503795894, -0.09557739463653873, -0.12442340426238589, 0.3194023104457063, -0.1408251262208844, -0.17416053821073205, 0.12055976917112216, -0.18122782801720697, -0.2012291176962193, 0.07219190600893048, 0.12767925191304233, 0.10590320317166262, -0.1317139635717527, 0.09720988487385855, -0.07327833709108536, 0.1207800183767743, 0.13450448023399614, -0.017713720879715976, 0.10493009690897631, 0.08935753494256833, 0.12136572127547268, 0.1424492036229091, -0.08491288913703966, -0.15481218103258337, -0.3120791463822615, -0.12261270762222712, -0.2494750891728174, 0.1106802346032174, -0.1339789441260452, -0.1667188465930178, 0.35558272855066253, 0.12854351841493464, 0.26159993485837685, 0.15741222669355204, 0.21208065033691828, 0.13315318660337294, -0.041872501182446224, 0.14869608729922681, 0.13756033516351562, 0.15567955628541283, 0.04759281668735699, -0.15012081454128226, 0.11727609298359908, 0.1378050869727721]
|
1,803.04208
|
Direct sampling method for retrieving small perfectly conducting cracks
|
In this paper, direct sampling method is considered for determining the
location of a set of small, linear perfectly conducting cracks from the
collected far-field data corresponding to an incident field. To show the
feasibility of the direct sampling method, this study proves that the indicator
function of the direct sampling method can be represented by the Bessel
function of order zero and the crack lengths. The results of the numerical
simulations are shown to support the fact that the imaging performance is
highly dependent on the crack lengths. To explain the fact that the imaging
performance is highly dependent on the rotation of the cracks, the direct
sampling method is further analyzed by establishing a representation using
Bessel functions of orders zero and one. Based on the derived representation of
indicator function, we design improved direct sampling methods by applying
incident fields with multiple directions and multiple frequencies.
Corresponding analysis of indicator functions and simulation results are shown
for demonstrating the effectiveness and improvements.
|
math.NA
|
in this paper direct sampling method is considered for determining the location of a set of small linear perfectly conducting cracks from the collected farfield data corresponding to an incident field to show the feasibility of the direct sampling method this study proves that the indicator function of the direct sampling method can be represented by the bessel function of order zero and the crack lengths the results of the numerical simulations are shown to support the fact that the imaging performance is highly dependent on the crack lengths to explain the fact that the imaging performance is highly dependent on the rotation of the cracks the direct sampling method is further analyzed by establishing a representation using bessel functions of orders zero and one based on the derived representation of indicator function we design improved direct sampling methods by applying incident fields with multiple directions and multiple frequencies corresponding analysis of indicator functions and simulation results are shown for demonstrating the effectiveness and improvements
|
[['in', 'this', 'paper', 'direct', 'sampling', 'method', 'is', 'considered', 'for', 'determining', 'the', 'location', 'of', 'a', 'set', 'of', 'small', 'linear', 'perfectly', 'conducting', 'cracks', 'from', 'the', 'collected', 'farfield', 'data', 'corresponding', 'to', 'an', 'incident', 'field', 'to', 'show', 'the', 'feasibility', 'of', 'the', 'direct', 'sampling', 'method', 'this', 'study', 'proves', 'that', 'the', 'indicator', 'function', 'of', 'the', 'direct', 'sampling', 'method', 'can', 'be', 'represented', 'by', 'the', 'bessel', 'function', 'of', 'order', 'zero', 'and', 'the', 'crack', 'lengths', 'the', 'results', 'of', 'the', 'numerical', 'simulations', 'are', 'shown', 'to', 'support', 'the', 'fact', 'that', 'the', 'imaging', 'performance', 'is', 'highly', 'dependent', 'on', 'the', 'crack', 'lengths', 'to', 'explain', 'the', 'fact', 'that', 'the', 'imaging', 'performance', 'is', 'highly', 'dependent', 'on', 'the', 'rotation', 'of', 'the', 'cracks', 'the', 'direct', 'sampling', 'method', 'is', 'further', 'analyzed', 'by', 'establishing', 'a', 'representation', 'using', 'bessel', 'functions', 'of', 'orders', 'zero', 'and', 'one', 'based', 'on', 'the', 'derived', 'representation', 'of', 'indicator', 'function', 'we', 'design', 'improved', 'direct', 'sampling', 'methods', 'by', 'applying', 'incident', 'fields', 'with', 'multiple', 'directions', 'and', 'multiple', 'frequencies', 'corresponding', 'analysis', 'of', 'indicator', 'functions', 'and', 'simulation', 'results', 'are', 'shown', 'for', 'demonstrating', 'the', 'effectiveness', 'and', 'improvements']]
|
[-0.10935235830080328, 0.0727187191638002, -0.10250884450576973, 0.033754334030814015, -0.05932006662090619, -0.04343287165304928, 0.033970489891274186, 0.41184997779853416, -0.2924819836618774, -0.2805082197442199, 0.11036067745210885, -0.23232915936545892, -0.1730791788886894, 0.26351933752497037, -0.010841667892016245, 0.07141028130709222, 0.10206207782116095, -0.0025922407424359612, -0.06540678148157894, -0.23689320777458223, 0.2945999352317868, 0.0660744208560297, 0.3392878248836055, 0.05862405047272191, 0.09270717420996251, 0.040994264287027446, -0.08923715290359475, 0.032575461746786126, -0.12518353703441487, 0.13253042933559328, 0.23198194317942994, 0.11677410753838943, 0.2723046341515852, -0.3845577486762495, -0.19045876407374937, 0.06350610261557228, 0.13550331253473732, 0.08338852101146724, -0.04868236584236112, -0.29463046525012365, 0.11153413961980153, -0.11467451168308881, -0.12976361868451491, -0.06295921009767688, -0.03908248684778245, 0.07217729686138531, -0.32096652556775196, 0.055565436267660875, 0.01949400263203477, 0.056060231025471835, -0.05523239906990167, -0.1221117415324305, -0.0026030333134148156, 0.10753293391599349, 0.06870486598010316, 0.023219513764717814, 0.10904674738871328, -0.12016393944451755, -0.12526111794974315, 0.3476089172065258, -0.04541700184133581, -0.23730778475715356, 0.19148891655671776, -0.15385816595940427, -0.031214225457303905, 0.16151330703587244, 0.15993130967924088, 0.13094808001522765, -0.128469184215999, 0.013449740179489847, -0.02935118657452139, 0.1454888521319707, 0.08001249885101887, -0.01377727251048341, 0.16667844537137586, 0.18106622056979121, 0.06962680081752214, 0.14686725525340685, -0.11086051589668248, -0.054418874754937306, -0.3001352101317466, -0.14793111658231778, -0.254328085563964, -0.02165982716956712, -0.10498386230399112, -0.17128367305020661, 0.39010387422714493, 0.16330387982765607, 0.18022947103123774, 0.057141468589278786, 0.3230879316191104, 0.16391201397398783, 0.06448607324537906, 0.0217417900902078, 0.2320325401357629, 0.14324675451569033, 0.05291126627531467, -0.2301332725804638, 0.0734261771198362, 0.05101171170615337]
|
1,803.04209
|
High Throughput Synchronous Distributed Stochastic Gradient Descent
|
We introduce a new, high-throughput, synchronous, distributed, data-parallel,
stochastic-gradient-descent learning algorithm. This algorithm uses amortized
inference in a compute-cluster-specific, deep, generative, dynamical model to
perform joint posterior predictive inference of the mini-batch gradient
computation times of all worker-nodes in a parallel computing cluster. We show
that a synchronous parameter server can, by utilizing such a model, choose an
optimal cutoff time beyond which mini-batch gradient messages from slow workers
are ignored that maximizes overall mini-batch gradient computations per second.
In keeping with earlier findings we observe that, under realistic conditions,
eagerly discarding the mini-batch gradient computations of stragglers not only
increases throughput but actually increases the overall rate of convergence as
a function of wall-clock time by virtue of eliminating idleness. The principal
novel contribution and finding of this work goes beyond this by demonstrating
that using the predicted run-times from a generative model of cluster worker
performance to dynamically adjust the cutoff improves substantially over the
static-cutoff prior art, leading to, among other things, significantly reduced
deep neural net training times on large computer clusters.
|
cs.DC cs.LG stat.ML
|
we introduce a new highthroughput synchronous distributed dataparallel stochasticgradientdescent learning algorithm this algorithm uses amortized inference in a computeclusterspecific deep generative dynamical model to perform joint posterior predictive inference of the minibatch gradient computation times of all workernodes in a parallel computing cluster we show that a synchronous parameter server can by utilizing such a model choose an optimal cutoff time beyond which minibatch gradient messages from slow workers are ignored that maximizes overall minibatch gradient computations per second in keeping with earlier findings we observe that under realistic conditions eagerly discarding the minibatch gradient computations of stragglers not only increases throughput but actually increases the overall rate of convergence as a function of wallclock time by virtue of eliminating idleness the principal novel contribution and finding of this work goes beyond this by demonstrating that using the predicted runtimes from a generative model of cluster worker performance to dynamically adjust the cutoff improves substantially over the staticcutoff prior art leading to among other things significantly reduced deep neural net training times on large computer clusters
|
[['we', 'introduce', 'a', 'new', 'highthroughput', 'synchronous', 'distributed', 'dataparallel', 'stochasticgradientdescent', 'learning', 'algorithm', 'this', 'algorithm', 'uses', 'amortized', 'inference', 'in', 'a', 'computeclusterspecific', 'deep', 'generative', 'dynamical', 'model', 'to', 'perform', 'joint', 'posterior', 'predictive', 'inference', 'of', 'the', 'minibatch', 'gradient', 'computation', 'times', 'of', 'all', 'workernodes', 'in', 'a', 'parallel', 'computing', 'cluster', 'we', 'show', 'that', 'a', 'synchronous', 'parameter', 'server', 'can', 'by', 'utilizing', 'such', 'a', 'model', 'choose', 'an', 'optimal', 'cutoff', 'time', 'beyond', 'which', 'minibatch', 'gradient', 'messages', 'from', 'slow', 'workers', 'are', 'ignored', 'that', 'maximizes', 'overall', 'minibatch', 'gradient', 'computations', 'per', 'second', 'in', 'keeping', 'with', 'earlier', 'findings', 'we', 'observe', 'that', 'under', 'realistic', 'conditions', 'eagerly', 'discarding', 'the', 'minibatch', 'gradient', 'computations', 'of', 'stragglers', 'not', 'only', 'increases', 'throughput', 'but', 'actually', 'increases', 'the', 'overall', 'rate', 'of', 'convergence', 'as', 'a', 'function', 'of', 'wallclock', 'time', 'by', 'virtue', 'of', 'eliminating', 'idleness', 'the', 'principal', 'novel', 'contribution', 'and', 'finding', 'of', 'this', 'work', 'goes', 'beyond', 'this', 'by', 'demonstrating', 'that', 'using', 'the', 'predicted', 'runtimes', 'from', 'a', 'generative', 'model', 'of', 'cluster', 'worker', 'performance', 'to', 'dynamically', 'adjust', 'the', 'cutoff', 'improves', 'substantially', 'over', 'the', 'staticcutoff', 'prior', 'art', 'leading', 'to', 'among', 'other', 'things', 'significantly', 'reduced', 'deep', 'neural', 'net', 'training', 'times', 'on', 'large', 'computer', 'clusters']]
|
[-0.0955659648756136, 0.06275767832531828, -0.0752428948658524, 0.03142603080399399, -0.08782360673144546, -0.16850706060737305, 0.15139361061128878, 0.41264270074299475, -0.3022075522922496, -0.36313205973562823, 0.04010736751560232, -0.21210039650881393, -0.12914071322655618, 0.16966428882119414, -0.13341018395492338, 0.06126965636204433, 0.12274785662296019, 0.018951477317376373, -0.07982104387392715, -0.3386332590141027, 0.20982933818763713, 0.10068302776770817, 0.30502449111700747, -0.05818289526734189, 0.11195734799489637, 9.520934367110964e-05, -0.029317387137454368, -0.0034618205750883272, -0.06904744205951309, 0.12099041618747271, 0.23939136601849917, 0.19575371527829008, 0.3810995829673861, -0.44582810980736176, -0.20068249619711256, 0.10844771315833565, 0.21233218253154112, 0.13918061088366876, -0.020466000431841724, -0.22641215636529502, 0.10676429052218106, -0.2011950629187285, -0.03366979298106465, -0.10666323813873564, -0.04254187700053343, 0.03158999107962453, -0.2938730683557237, 0.08925451912965647, 0.05337380595431889, 0.02259065678095542, -0.01847235007195416, -0.13222990067126605, 0.027939192945342188, 0.10674065553362487, 0.07369880342573086, 0.08220460646209775, 0.19256191728690455, -0.1519497106910947, -0.12288599213143822, 0.2968217445607432, -0.0740722861979426, -0.15252022526490722, 0.14246243166042805, -0.04571899502185534, -0.17692629471750973, 0.11770299562613744, 0.22200797202140954, 0.12878763595713044, -0.1481720196739959, 0.05833662021602369, -0.0029095305308882644, 0.20045396694482837, 0.04628141778063653, -0.00475826483176795, 0.11554904883011444, 0.22576413701309936, 0.11926604536324309, 0.13662070071229152, -0.06793936325716275, -0.1485001284836366, -0.23823025872704784, -0.12504437335462693, -0.20740690130290892, 0.001270555809084353, -0.1803928788917407, -0.13748577732937356, 0.37135595818604694, 0.21480917477592654, 0.22617018923454116, 0.18644070380404013, 0.3575517168037077, 0.08027822999424984, 0.14487708794125329, 0.19174189134662423, 0.19474047975819234, 0.032286299920151, 0.12397684766224591, -0.22745113315567445, 0.1258197806634593, 0.03204947742825304]
|
1,803.0421
|
The degeneration formula for stable log maps
|
We give a short direct proof for the degeneration formula of Gromov-Witten
invariants including its cycle version for degenerations with smooth singular
locus in the setting of minimal/basic stable log maps of Abramovich-Chen, Chen,
Gross-Siebert.
|
math.AG math.SG
|
we give a short direct proof for the degeneration formula of gromovwitten invariants including its cycle version for degenerations with smooth singular locus in the setting of minimalbasic stable log maps of abramovichchen chen grosssiebert
|
[['we', 'give', 'a', 'short', 'direct', 'proof', 'for', 'the', 'degeneration', 'formula', 'of', 'gromovwitten', 'invariants', 'including', 'its', 'cycle', 'version', 'for', 'degenerations', 'with', 'smooth', 'singular', 'locus', 'in', 'the', 'setting', 'of', 'minimalbasic', 'stable', 'log', 'maps', 'of', 'abramovichchen', 'chen', 'grosssiebert']]
|
[-0.21212691937883696, -0.06109987698834051, -0.1310515452853658, 0.11200945542165727, -0.046961686771475906, -0.18205988737331194, 0.047526157715103844, 0.24022470736368137, -0.28670424022570706, -0.2034984491765499, 0.12458770163004484, -0.21336384151469578, -0.18175465588203885, 0.27825608076245495, -0.24261981421009157, -0.013807127761979107, 0.08422115441609287, -0.02373299939614354, -0.14193643076401768, -0.3185281913487636, 0.40483679509524145, -0.05418514677633842, 0.15707045398426778, 0.11338619306457765, 0.1220368268532735, 0.06526625475310015, -0.010652810225799454, -0.08564385458488356, -0.1882615024717807, 0.1432118993675844, 0.3058356341313232, 0.09695714119483125, 0.1046704938917449, -0.35755986810633633, -0.10039332397564342, 0.2040940939138333, 0.08440577934467883, 0.11331406105874163, 0.026506280357187443, -0.22162116031077775, 0.10714940582296219, -0.12101411034889294, -0.25831556009044027, -0.11931252245311484, 0.07444052645146396, 0.05631310441954569, -0.18475612377127013, 0.032500227743929085, 0.08824116128468604, 0.1753190869860577, -0.0338390602229276, -0.09053751408602252, -0.10599607234877167, 0.026665739192994253, 0.008280677071800737, 0.08747851332141594, 0.05952615630954052, -0.130059582153053, -0.11122493389429468, 0.2953996491604344, -0.11070166799155148, -0.1716980261050842, 0.11324489489197731, -0.07132256817016186, -0.2024547258730639, 0.1422204258181437, 0.05344303425006343, 0.2423983416802278, 0.017693093780315285, 0.1767833378504623, -0.04711550355634906, 0.003992366181178527, 0.1497941937466914, -0.02872806843934637, 0.13469151794120218, 0.1012269299420895, 0.10417306634851477, 0.1376844747274211, -0.029307280568349543, -0.10753795165907253, -0.4053305116566745, -0.23568808211183007, -0.0601159121107423, 0.1902949996010372, -0.16479255619836322, -0.24265732458143524, 0.45571154971240146, -0.01805135204146306, 0.2539395584978841, 0.2255945366835504, 0.2784200571477413, 0.0793662452788064, -0.042060487561464084, 0.017212578645822676, 0.10652923513429635, 0.23266593632147167, 0.01864774790451382, -0.10582993049738985, 0.004928870535822529, 0.3379926248876886]
|
1,803.04211
|
Increasing the Degree of Parallelism Using Speculative Execution in
Task-based Runtime Systems
|
Task-based programming models have demonstrated their efficiency in the
development of scientific applications on modern high-performance platforms.
They allow delegation of the management of parallelization to the runtime
system (RS), which is in charge of the data coherency, the scheduling, and the
assignment of the work to the computational units. However, some applications
have a limited degree of parallelism such that no matter how efficient the RS
implementation, they may not scale on modern multicore CPUs. In this paper, we
propose using speculation to unleash the parallelism when it is uncertain if
some tasks will modify data, and we formalize a new methodology to enable
speculative execution in a graph of tasks. This description is partially
implemented in our new C++ RS called SPETABARU, which is capable of executing
tasks in advance if some others are not certain to modify the data. We study
the behavior of our approach to compute Monte Carlo and replica exchange Monte
Carlo simulations.
|
cs.DC
|
taskbased programming models have demonstrated their efficiency in the development of scientific applications on modern highperformance platforms they allow delegation of the management of parallelization to the runtime system rs which is in charge of the data coherency the scheduling and the assignment of the work to the computational units however some applications have a limited degree of parallelism such that no matter how efficient the rs implementation they may not scale on modern multicore cpus in this paper we propose using speculation to unleash the parallelism when it is uncertain if some tasks will modify data and we formalize a new methodology to enable speculative execution in a graph of tasks this description is partially implemented in our new c rs called spetabaru which is capable of executing tasks in advance if some others are not certain to modify the data we study the behavior of our approach to compute monte carlo and replica exchange monte carlo simulations
|
[['taskbased', 'programming', 'models', 'have', 'demonstrated', 'their', 'efficiency', 'in', 'the', 'development', 'of', 'scientific', 'applications', 'on', 'modern', 'highperformance', 'platforms', 'they', 'allow', 'delegation', 'of', 'the', 'management', 'of', 'parallelization', 'to', 'the', 'runtime', 'system', 'rs', 'which', 'is', 'in', 'charge', 'of', 'the', 'data', 'coherency', 'the', 'scheduling', 'and', 'the', 'assignment', 'of', 'the', 'work', 'to', 'the', 'computational', 'units', 'however', 'some', 'applications', 'have', 'a', 'limited', 'degree', 'of', 'parallelism', 'such', 'that', 'no', 'matter', 'how', 'efficient', 'the', 'rs', 'implementation', 'they', 'may', 'not', 'scale', 'on', 'modern', 'multicore', 'cpus', 'in', 'this', 'paper', 'we', 'propose', 'using', 'speculation', 'to', 'unleash', 'the', 'parallelism', 'when', 'it', 'is', 'uncertain', 'if', 'some', 'tasks', 'will', 'modify', 'data', 'and', 'we', 'formalize', 'a', 'new', 'methodology', 'to', 'enable', 'speculative', 'execution', 'in', 'a', 'graph', 'of', 'tasks', 'this', 'description', 'is', 'partially', 'implemented', 'in', 'our', 'new', 'c', 'rs', 'called', 'spetabaru', 'which', 'is', 'capable', 'of', 'executing', 'tasks', 'in', 'advance', 'if', 'some', 'others', 'are', 'not', 'certain', 'to', 'modify', 'the', 'data', 'we', 'study', 'the', 'behavior', 'of', 'our', 'approach', 'to', 'compute', 'monte', 'carlo', 'and', 'replica', 'exchange', 'monte', 'carlo', 'simulations']]
|
[-0.1426085374447741, 0.056914297297974176, -0.10995603069556947, 0.06590662860087579, -0.13707144444666897, -0.1473420231022483, 0.06047282897339709, 0.42004501116992554, -0.29411963141476144, -0.35713003080668326, 0.1224608979072964, -0.2227731927303904, -0.1472962739010919, 0.21503834141701272, -0.09798353293002877, 0.06579952315527568, 0.10795388779532211, 0.0016544895582608406, -0.0647293341022259, -0.2912365489595502, 0.24388167995788582, 0.0997850168570051, 0.27510316006226254, 0.07108915644355968, 0.06524843705082725, 0.005774121591526591, -0.01613282815765448, -0.022673528468312956, -0.08510964479662303, 0.15969397367384944, 0.29849745054343657, 0.20837029642602312, 0.31961339850957166, -0.46124216334163387, -0.18874753645585873, 0.09445628112836305, 0.14511798279171315, 0.09389070371796578, -0.05170714999902758, -0.20985415460589, 0.11978166154291056, -0.19814898507734777, -0.0662189551181148, -0.13383987644699083, -0.02733681073317988, 0.017275978763192847, -0.21935071106823278, -0.02411560909940472, 0.028165010888463984, 0.05398314677273171, 0.026175710882496418, -0.08262311873288496, 0.025505007459793852, 0.10829325155609235, 0.02427150919308438, -0.0020451388672536497, 0.1335579747086556, -0.12460369419577662, -0.19053411041681148, 0.3983591922405588, 0.010056938819846586, -0.2125210456809477, 0.21052923837464443, -0.0672409052082302, -0.22016741062184395, 0.07114454376352125, 0.21513101444071264, 0.11408521011589637, -0.1695878233019553, 0.09994080808799112, 0.021082082179764025, 0.1826968499392277, 0.0006889262843782766, 0.02840426128543324, 0.1713948918423981, 0.2211945235178087, 0.021917290794014742, 0.1215140334296606, -0.04963115878149726, -0.12863283755870747, -0.24985447659487306, -0.18620504806690577, -0.19191582548090175, -0.004442274287347446, -0.0772609227846997, -0.17111727772457408, 0.3591775699559882, 0.26091093183760355, 0.12896246146528592, 0.07447873137978235, 0.3611762316402378, 0.05370439953742478, 0.1382102144821665, 0.15083278575322673, 0.1701335317609593, 0.038201147640312585, 0.1674842345580802, -0.22795517273435864, 0.07783758803123396, -0.023039301141176985]
|
1,803.04212
|
On some Hamiltonian properties of the isomonodromic tau functions
|
We discuss some new aspects of the theory of the Jimbo-Miwa-Ueno tau function
which have come to light within the recent developments in the global
asymptotic analysis of the tau functions related to the Painlev\'e equations.
Specifically, we show that up to the total differentials the logarithmic
derivatives of the Painlev\'e tau functions coincide with the corresponding
classical action differential. This fact simplifies considerably the evaluation
of the constant factors in the asymptotics of tau-functions, which has been a
long-standing problem of the asymptotic theory of Painlev\'e equations.
Furthermore, we believe that this observation is yet another manifestation of
L. D. Faddeev's emphasis of the key role which the Hamiltonian aspects play in
the theory of integrable system.
This article will appear in the WSPC memorial volume dedicated to Ludwig
Faddeev.
|
math-ph math.MP nlin.SI
|
we discuss some new aspects of the theory of the jimbomiwaueno tau function which have come to light within the recent developments in the global asymptotic analysis of the tau functions related to the painleve equations specifically we show that up to the total differentials the logarithmic derivatives of the painleve tau functions coincide with the corresponding classical action differential this fact simplifies considerably the evaluation of the constant factors in the asymptotics of taufunctions which has been a longstanding problem of the asymptotic theory of painleve equations furthermore we believe that this observation is yet another manifestation of l d faddeevs emphasis of the key role which the hamiltonian aspects play in the theory of integrable system this article will appear in the wspc memorial volume dedicated to ludwig faddeev
|
[['we', 'discuss', 'some', 'new', 'aspects', 'of', 'the', 'theory', 'of', 'the', 'jimbomiwaueno', 'tau', 'function', 'which', 'have', 'come', 'to', 'light', 'within', 'the', 'recent', 'developments', 'in', 'the', 'global', 'asymptotic', 'analysis', 'of', 'the', 'tau', 'functions', 'related', 'to', 'the', 'painleve', 'equations', 'specifically', 'we', 'show', 'that', 'up', 'to', 'the', 'total', 'differentials', 'the', 'logarithmic', 'derivatives', 'of', 'the', 'painleve', 'tau', 'functions', 'coincide', 'with', 'the', 'corresponding', 'classical', 'action', 'differential', 'this', 'fact', 'simplifies', 'considerably', 'the', 'evaluation', 'of', 'the', 'constant', 'factors', 'in', 'the', 'asymptotics', 'of', 'taufunctions', 'which', 'has', 'been', 'a', 'longstanding', 'problem', 'of', 'the', 'asymptotic', 'theory', 'of', 'painleve', 'equations', 'furthermore', 'we', 'believe', 'that', 'this', 'observation', 'is', 'yet', 'another', 'manifestation', 'of', 'l', 'd', 'faddeevs', 'emphasis', 'of', 'the', 'key', 'role', 'which', 'the', 'hamiltonian', 'aspects', 'play', 'in', 'the', 'theory', 'of', 'integrable', 'system', 'this', 'article', 'will', 'appear', 'in', 'the', 'wspc', 'memorial', 'volume', 'dedicated', 'to', 'ludwig', 'faddeev']]
|
[-0.14848361443728209, 0.057036014004216457, -0.132357469940773, 0.0648656222736463, -0.07971990564838052, -0.09020914046022181, 0.0050511345287444645, 0.24333094062211996, -0.2841072723520203, -0.25318144706722634, 0.08266662483622965, -0.2768798807420983, -0.20280588221951173, 0.16242256039180436, -0.05980537173588975, 0.06975971610070421, 0.04510464624573405, 0.06205187476992321, -0.12253407488147226, -0.2835080800945154, 0.3520721312854081, 0.038941139108143175, 0.2250646896767788, 0.07931492085783527, 0.0910261281264516, -0.015152795226094895, -0.07677714800318847, -0.052449540676584895, -0.15478126829581854, 0.13364558615990413, 0.2448691383854916, 0.08964566014653358, 0.25675545018524504, -0.39957877057962693, -0.16198651879990045, 0.09005246916069434, 0.15320644503136954, 0.06986811089132411, 0.023069895402743266, -0.2754702056041704, 0.039325327404703084, -0.1588838817229351, -0.21551619501999364, -0.04791253749281168, 0.05407069988118914, 0.03656187601781522, -0.1929035209549161, 0.06195860596445318, 0.0846658548967053, 0.02147506420285656, -0.03889238792919339, -0.13489687670864023, 0.01339776418171823, 0.10290820170552112, 0.11799347313443342, 0.05358045624900394, 0.036732054136406914, -0.1480947570105155, -0.10254240816978451, 0.3715778943222876, -0.0647783342963801, -0.21579152738962035, 0.12589191725620857, -0.1801550960741364, -0.21046823967033282, 0.10636108620808675, 0.15786141440845453, 0.13627800681771568, -0.14079177320863193, 0.16190960684504646, -0.06935553937577284, 0.11479645608207928, 0.05914930679226438, 0.06459656020339866, 0.14498864262221525, 0.11833432818530128, 0.005601280488861868, 0.119863241297963, -0.011466387788711402, -0.14511997694722734, -0.38566087275170363, -0.19372149738707006, -0.10920525279182654, 0.08345464961715221, -0.06541189052737677, -0.15569110266291178, 0.409327101521194, 0.13336028753949974, 0.16209985159624082, 0.04814450448611751, 0.20357942779620106, 0.1869999682960602, 0.06937677760859234, 0.01395317340524903, 0.2457054362679348, 0.17585883877344224, 0.13298613055824088, -0.26173501003605243, 0.021105888948435538, 0.16071251245000615]
|
1,803.04213
|
Robust utility maximization in markets with transaction costs
|
We consider a continuous-time market with proportional transaction costs.
Under appropriate assumptions we prove the existence of optimal strategies for
investors who maximize their worst-case utility over a class of possible
models. We consider utility functions defined either on the positive axis or on
the whole real line.
|
q-fin.MF
|
we consider a continuoustime market with proportional transaction costs under appropriate assumptions we prove the existence of optimal strategies for investors who maximize their worstcase utility over a class of possible models we consider utility functions defined either on the positive axis or on the whole real line
|
[['we', 'consider', 'a', 'continuoustime', 'market', 'with', 'proportional', 'transaction', 'costs', 'under', 'appropriate', 'assumptions', 'we', 'prove', 'the', 'existence', 'of', 'optimal', 'strategies', 'for', 'investors', 'who', 'maximize', 'their', 'worstcase', 'utility', 'over', 'a', 'class', 'of', 'possible', 'models', 'we', 'consider', 'utility', 'functions', 'defined', 'either', 'on', 'the', 'positive', 'axis', 'or', 'on', 'the', 'whole', 'real', 'line']]
|
[-0.15824743129390603, -0.002892707154387608, -0.00697905625080845, 0.10609367773092042, -0.09859390657705565, -0.18002943145984318, 0.16271470102947205, 0.45574656505292904, -0.2656305053581794, -0.202250880926537, 0.1726967361222099, -0.2762476266361773, -0.14889125691358154, 0.15641665383979367, -0.13651684807458273, 0.06174183737797042, 0.015198104025330395, 0.04041299275316609, -0.012775615043210564, -0.36478598102500354, 0.36260040927057463, 0.011195783988417437, 0.27098709331282106, 0.026985466794333963, 0.14308557232531408, 0.07874775296659209, -0.021170159520503756, 0.02792473843631645, -0.20080997315623486, 0.08797218347899616, 0.24054974775791985, 0.16605026817705948, 0.40346260423151153, -0.4193736541395386, -0.12658438672466824, 0.23737671666701013, 0.0022210722090676427, -0.0073717010382097214, 0.027034813091934968, -0.23610730197591087, 0.0626158963132184, -0.18538716692031207, -0.13067037503545484, -0.02223686877793322, -0.018533317216982443, 0.07740195980295539, -0.3482954187008242, -0.0016018500900827348, 0.005813294633602102, 0.054990418822853826, -0.12393615616989943, -0.11612102331127971, -0.02145465188853753, 0.11567296957461319, 0.11572397932468448, -0.0901126294071825, 0.17416644685242014, -0.08990037580952048, -0.21920364326797426, 0.36575173212137696, -0.08883351788002376, -0.2670409332495183, 0.1143266864431401, -0.09366683291834003, -0.09461462499651437, 0.0912121259898413, 0.24856549673131667, 0.12632622038169453, -0.1028072966534334, 0.12341551583085675, -0.09846931742504239, 0.136189293358863, 0.05623807020795842, 0.04008697947332015, 0.2007317253931736, 0.09661327736102976, 0.20008962673212713, 0.16369208479106115, 0.02880941140271413, -0.18443898386249202, -0.2747063065180555, -0.13031300882964084, -0.17417137707040334, 0.1262933851297324, -0.125705870964642, -0.16802033378432193, 0.3769984731916338, 0.12925519798106203, 0.14948194810737428, 0.21721768107575676, 0.27452439182282734, 0.14570010356449833, -8.033729197146991e-06, 0.10603354135916258, 0.1421474067416663, -0.026713469328872936, 0.09074907721515046, -0.2022974761785008, 0.18939390528248623, -0.002331782792073985]
|
1,803.04214
|
Schr\"odinger equations with singular potentials: linear and nonlinear
boundary value problems
|
Let $\Omega \subset {\mathbb R}^N$ ($N \geq 3$) be a $C^2$ bounded domain and
$F \subset \partial \Omega$ be a $C^2$ submanifold of dimension $0 \leq k \leq
N-2$. Put $\delta_F(x)=dist(x,F)$, $V=\delta_F^{-2}$ in $\Omega$ and $L_{\gamma
V}=\Delta + \gamma V$. Denote by $C_H(V)$ the Hardy constant relative to $V$ in
$\Omega$. We study positive solutions of equations (LE) $-L_{\gamma V} u = 0$
and (NE) $-L_{\gamma V} u+ f(u) = 0$ in $\Omega$ when $\gamma < C_H(V)$ and $f
\in C({\mathbb R})$ is an odd, monotone increasing function. We establish the
existence of a normalized boundary trace for positive solutions of (LE) - first
studied by Marcus and Nguyen for the case $F=\partial \Omega$ - and employ it
to investigate the behavior of subsolutions and super solutions of (LE) at the
boundary. Using these results we study boundary value problems for (NE) and
derive a-priori estimates. Finally we discuss subcriticality of (NE) at
boundary points of $\Omega$ and establish existence and stability results when
the data is concentrated on the set of subcritical points.
|
math.AP
|
let omega subset mathbb rn n geq 3 be a c2 bounded domain and f subset partial omega be a c2 submanifold of dimension 0 leq k leq n2 put delta_fxdistxf vdelta_f2 in omega and l_gamma vdelta gamma v denote by c_hv the hardy constant relative to v in omega we study positive solutions of equations le l_gamma v u 0 and ne l_gamma v u fu 0 in omega when gamma c_hv and f in cmathbb r is an odd monotone increasing function we establish the existence of a normalized boundary trace for positive solutions of le first studied by marcus and nguyen for the case fpartial omega and employ it to investigate the behavior of subsolutions and super solutions of le at the boundary using these results we study boundary value problems for ne and derive apriori estimates finally we discuss subcriticality of ne at boundary points of omega and establish existence and stability results when the data is concentrated on the set of subcritical points
|
[['let', 'omega', 'subset', 'mathbb', 'rn', 'n', 'geq', '3', 'be', 'a', 'c2', 'bounded', 'domain', 'and', 'f', 'subset', 'partial', 'omega', 'be', 'a', 'c2', 'submanifold', 'of', 'dimension', '0', 'leq', 'k', 'leq', 'n2', 'put', 'delta_fxdistxf', 'vdelta_f2', 'in', 'omega', 'and', 'l_gamma', 'vdelta', 'gamma', 'v', 'denote', 'by', 'c_hv', 'the', 'hardy', 'constant', 'relative', 'to', 'v', 'in', 'omega', 'we', 'study', 'positive', 'solutions', 'of', 'equations', 'le', 'l_gamma', 'v', 'u', '0', 'and', 'ne', 'l_gamma', 'v', 'u', 'fu', '0', 'in', 'omega', 'when', 'gamma', 'c_hv', 'and', 'f', 'in', 'cmathbb', 'r', 'is', 'an', 'odd', 'monotone', 'increasing', 'function', 'we', 'establish', 'the', 'existence', 'of', 'a', 'normalized', 'boundary', 'trace', 'for', 'positive', 'solutions', 'of', 'le', 'first', 'studied', 'by', 'marcus', 'and', 'nguyen', 'for', 'the', 'case', 'fpartial', 'omega', 'and', 'employ', 'it', 'to', 'investigate', 'the', 'behavior', 'of', 'subsolutions', 'and', 'super', 'solutions', 'of', 'le', 'at', 'the', 'boundary', 'using', 'these', 'results', 'we', 'study', 'boundary', 'value', 'problems', 'for', 'ne', 'and', 'derive', 'apriori', 'estimates', 'finally', 'we', 'discuss', 'subcriticality', 'of', 'ne', 'at', 'boundary', 'points', 'of', 'omega', 'and', 'establish', 'existence', 'and', 'stability', 'results', 'when', 'the', 'data', 'is', 'concentrated', 'on', 'the', 'set', 'of', 'subcritical', 'points']]
|
[-0.20570834534781346, 0.07587737498178318, 0.003601046123384801, -0.00375691963589739, -0.039808035340070366, -0.18395710018384887, 0.052714536390099, 0.3257449023560228, -0.29426983916004334, -0.19103094200317536, 0.09974073970421071, -0.3575441349600722, -0.043458849260392764, 0.1341770081970201, -0.036175391632581065, 0.00434000534285982, 0.0023816835222182325, 0.07381518126790781, -0.07902334884919944, -0.1920735472757145, 0.3540629500253911, -0.152790512076119, 0.13028342390421732, 0.07694539888299082, 0.06138396884866286, -0.043121640761214566, 0.04806974592775735, -0.010168386247368103, -0.3170630423778511, 0.043514093299991036, 0.2369848823172029, 0.11521474311425609, 0.292660409696849, -0.3285594371663608, -0.16854734625106296, 0.19919160185157356, 0.15644427681768155, -0.12412452364497516, 0.021037075818650962, -0.2950689837726461, 0.16901038657503584, -0.051637141795615744, -0.20356340963303685, -0.011734282053692872, 0.18168571942025818, 0.06437503950002726, -0.3704644119793392, 0.09341870296286442, 0.09279259242116879, 0.0523247146005574, -0.11269279067819736, -0.20090414731656706, -0.06137557051857058, 0.039488750726969196, -0.004063411838801421, 0.15737730901020702, 0.016739822887669665, -0.10116435430315604, -0.01480751980589815, 0.3115119832842779, -0.13062524354731922, -0.2287955245519259, 0.11888677361056613, -0.24584933833979317, -0.12559488763000412, 0.09226862968966724, 0.1289503862632506, 0.22520281935071415, -0.030595650387463633, 0.27920639966207794, -0.0611101819478615, 0.13543824948011393, 0.13288918139513986, -0.028253153862757046, 0.04638514777993312, 0.05743636234371687, 0.14182434574012218, 0.09635660557443815, -0.04658572463147238, 0.047043411425842216, -0.40342321208711845, -0.14439466333417195, -0.15350499793505631, 0.16000275727339, -0.12507103131214403, -0.09733985796997166, 0.2543450396813744, 0.04762407553842269, 0.21577503302496442, 0.07913086016056498, 0.13438587680638556, 0.15135438193741368, -0.08530377906423514, 0.14260604738921254, 0.10215298262851155, 0.16693121819134174, 0.07312637514221561, -0.2277868711726224, -0.018226936400632363, 0.12654722276372002]
|
1,803.04215
|
Systems, environments, and soliton rate equations (II): Toward realistic
modeling
|
In order to solve a system of nonlinear rate equations one can try to use
some soliton methods. The procedure involves three steps: (1) Find a `Lax
representation' where all the kinetic variables are combined into a single
matrix $\rho$, all the kinetic constants are encoded in a matrix $H$; (2) find
a Darboux-Backund dressing transformation for the Lax representation $i\dot
\rho=[H,f(\rho)]$, where $f$ models a time-dependent environment; (3) find a
class of seed solutions $\rho=\rho[0]$ that lead, via a nontrivial chain of
dressings $\rho[0]\to \rho[1]\to \rho[2]\to\dots$ to new solutions, difficult
to find by other methods. The latter step is not a trivial one since a
non-soliton method has to be employed to find an appropriate initial $\rho[0]$.
Procedures that lead to a correct $\rho[0]$ have been discussed in the
literature only for a limited class of $H$ and $f$. Here, we develop a
formalism that works for practically any $H$, and any explicitly time-dependent
$f$. As a result, we are able to find exact solutions to a system of equations
describing an arbitrary number of species interacting through (auto)catalytic
feedbacks, with general time dependent parameters characterizing the
nonlinearity. Explicit examples involve up to 42 interacting species.
|
q-bio.PE
|
in order to solve a system of nonlinear rate equations one can try to use some soliton methods the procedure involves three steps 1 find a lax representation where all the kinetic variables are combined into a single matrix rho all the kinetic constants are encoded in a matrix h 2 find a darbouxbackund dressing transformation for the lax representation idot rhohfrho where f models a timedependent environment 3 find a class of seed solutions rhorho0 that lead via a nontrivial chain of dressings rho0to rho1to rho2todots to new solutions difficult to find by other methods the latter step is not a trivial one since a nonsoliton method has to be employed to find an appropriate initial rho0 procedures that lead to a correct rho0 have been discussed in the literature only for a limited class of h and f here we develop a formalism that works for practically any h and any explicitly timedependent f as a result we are able to find exact solutions to a system of equations describing an arbitrary number of species interacting through autocatalytic feedbacks with general time dependent parameters characterizing the nonlinearity explicit examples involve up to 42 interacting species
|
[['in', 'order', 'to', 'solve', 'a', 'system', 'of', 'nonlinear', 'rate', 'equations', 'one', 'can', 'try', 'to', 'use', 'some', 'soliton', 'methods', 'the', 'procedure', 'involves', 'three', 'steps', '1', 'find', 'a', 'lax', 'representation', 'where', 'all', 'the', 'kinetic', 'variables', 'are', 'combined', 'into', 'a', 'single', 'matrix', 'rho', 'all', 'the', 'kinetic', 'constants', 'are', 'encoded', 'in', 'a', 'matrix', 'h', '2', 'find', 'a', 'darbouxbackund', 'dressing', 'transformation', 'for', 'the', 'lax', 'representation', 'idot', 'rhohfrho', 'where', 'f', 'models', 'a', 'timedependent', 'environment', '3', 'find', 'a', 'class', 'of', 'seed', 'solutions', 'rhorho0', 'that', 'lead', 'via', 'a', 'nontrivial', 'chain', 'of', 'dressings', 'rho0to', 'rho1to', 'rho2todots', 'to', 'new', 'solutions', 'difficult', 'to', 'find', 'by', 'other', 'methods', 'the', 'latter', 'step', 'is', 'not', 'a', 'trivial', 'one', 'since', 'a', 'nonsoliton', 'method', 'has', 'to', 'be', 'employed', 'to', 'find', 'an', 'appropriate', 'initial', 'rho0', 'procedures', 'that', 'lead', 'to', 'a', 'correct', 'rho0', 'have', 'been', 'discussed', 'in', 'the', 'literature', 'only', 'for', 'a', 'limited', 'class', 'of', 'h', 'and', 'f', 'here', 'we', 'develop', 'a', 'formalism', 'that', 'works', 'for', 'practically', 'any', 'h', 'and', 'any', 'explicitly', 'timedependent', 'f', 'as', 'a', 'result', 'we', 'are', 'able', 'to', 'find', 'exact', 'solutions', 'to', 'a', 'system', 'of', 'equations', 'describing', 'an', 'arbitrary', 'number', 'of', 'species', 'interacting', 'through', 'autocatalytic', 'feedbacks', 'with', 'general', 'time', 'dependent', 'parameters', 'characterizing', 'the', 'nonlinearity', 'explicit', 'examples', 'involve', 'up', 'to', '42', 'interacting', 'species']]
|
[-0.11366644144760377, 0.11102042547734918, -0.06568216041939733, 0.06585105561105174, -0.07965807495663109, -0.18506173795961936, 0.025280605460375704, 0.3483680292186254, -0.2530216293419219, -0.27508112288894454, 0.07444166282681915, -0.2503661155208204, -0.1405971220369007, 0.17834572904592097, 0.013115459697135769, 0.03919270555415625, 0.06741791577090592, 0.06827217617245264, -0.07683211037065073, -0.2347080953350944, 0.3150332439264175, -0.028113054028707337, 0.20779767802414237, 0.0018867132527002801, 0.1350796227392141, -0.029823771571248027, -0.0052308809970315374, 0.012656163117063295, -0.13995453298114896, 0.07355941802992227, 0.2610563752518186, 0.10391081089314795, 0.28261594565009884, -0.42223866606687066, -0.21934357190660703, 0.1249354199716012, 0.1561464173743667, 0.1652087059666778, -0.038021709916245254, -0.23174999017239162, 0.06618604124450558, -0.1700594878331295, -0.14371854262133935, -0.10838273127992389, 0.06475210410703695, 0.029586381768973553, -0.3396419215574373, 0.04575480018743221, 0.05064927353840614, -0.01691226614715351, -0.0564027823683323, -0.0887685324199783, -0.020903043068594335, 0.0982975171685721, 0.021599217914093617, 0.03136034492319157, 0.0912784819268129, -0.12433788123057853, -0.08328414004794639, 0.3689147977533882, -0.0763834197523989, -0.2646521840595606, 0.184172114747435, -0.07391519586589793, -0.15996783735908335, 0.17092646768131337, 0.14995062125435937, 0.15520188345754254, -0.18457892583926935, 0.10775371941648157, -0.031846985496405064, 0.18368906248482772, 0.048271567631434864, -0.01251394116759778, 0.14051580463818894, 0.09402702037849664, 0.06586460214405666, 0.11729122826028664, -0.0028509365355703217, -0.0787956451299888, -0.3091462032957227, -0.15099526830406507, -0.1333863291882115, 0.07196272116683787, -0.0690349224997204, -0.16606446913887224, 0.3724689606287034, 0.13285364670279004, 0.22088400187112234, 0.03584379319550167, 0.232731939269064, 0.15827448718695955, 0.06156315835874225, 0.05578102596855054, 0.20003518285501032, 0.13962349173349586, 0.06910688896219767, -0.19798880779240474, 0.03429161967631644, 0.09325919859720813]
|
1,803.04216
|
Hybrid interconnection of iterative bidding and power network dynamics
for frequency regulation and optimal dispatch
|
This paper considers a real-time electricity market involving an independent
system operator (ISO) and a group of strategic generators. The ISO operates a
market where generators bid prices at which there are willing to provide power.
The ISO makes power generation assignments with the goal of solving the
economic dispatch problem and regulating the network frequency. We propose a
multi-rate hybrid algorithm for bidding and market clearing that combines the
discrete nature of iterative bidding with the continuous nature of the
frequency evolution in the power network. We establish sufficient upper bounds
on the inter-event times that guarantee that the proposed algorithm
asymptotically converges to an equilibrium corresponding to an efficient Nash
equilibrium and zero frequency deviation. Our technical analysis builds on the
characterization of the robustness properties of the continuous-time version of
the bidding update process interconnected with the power network dynamics via
the identification of a novel LISS-Lyapunov function. Simulations on the IEEE
14-bus system illustrate our results.
|
math.OC
|
this paper considers a realtime electricity market involving an independent system operator iso and a group of strategic generators the iso operates a market where generators bid prices at which there are willing to provide power the iso makes power generation assignments with the goal of solving the economic dispatch problem and regulating the network frequency we propose a multirate hybrid algorithm for bidding and market clearing that combines the discrete nature of iterative bidding with the continuous nature of the frequency evolution in the power network we establish sufficient upper bounds on the interevent times that guarantee that the proposed algorithm asymptotically converges to an equilibrium corresponding to an efficient nash equilibrium and zero frequency deviation our technical analysis builds on the characterization of the robustness properties of the continuoustime version of the bidding update process interconnected with the power network dynamics via the identification of a novel lisslyapunov function simulations on the ieee 14bus system illustrate our results
|
[['this', 'paper', 'considers', 'a', 'realtime', 'electricity', 'market', 'involving', 'an', 'independent', 'system', 'operator', 'iso', 'and', 'a', 'group', 'of', 'strategic', 'generators', 'the', 'iso', 'operates', 'a', 'market', 'where', 'generators', 'bid', 'prices', 'at', 'which', 'there', 'are', 'willing', 'to', 'provide', 'power', 'the', 'iso', 'makes', 'power', 'generation', 'assignments', 'with', 'the', 'goal', 'of', 'solving', 'the', 'economic', 'dispatch', 'problem', 'and', 'regulating', 'the', 'network', 'frequency', 'we', 'propose', 'a', 'multirate', 'hybrid', 'algorithm', 'for', 'bidding', 'and', 'market', 'clearing', 'that', 'combines', 'the', 'discrete', 'nature', 'of', 'iterative', 'bidding', 'with', 'the', 'continuous', 'nature', 'of', 'the', 'frequency', 'evolution', 'in', 'the', 'power', 'network', 'we', 'establish', 'sufficient', 'upper', 'bounds', 'on', 'the', 'interevent', 'times', 'that', 'guarantee', 'that', 'the', 'proposed', 'algorithm', 'asymptotically', 'converges', 'to', 'an', 'equilibrium', 'corresponding', 'to', 'an', 'efficient', 'nash', 'equilibrium', 'and', 'zero', 'frequency', 'deviation', 'our', 'technical', 'analysis', 'builds', 'on', 'the', 'characterization', 'of', 'the', 'robustness', 'properties', 'of', 'the', 'continuoustime', 'version', 'of', 'the', 'bidding', 'update', 'process', 'interconnected', 'with', 'the', 'power', 'network', 'dynamics', 'via', 'the', 'identification', 'of', 'a', 'novel', 'lisslyapunov', 'function', 'simulations', 'on', 'the', 'ieee', '14bus', 'system', 'illustrate', 'our', 'results']]
|
[-0.15965115239129127, -0.0047910873959926045, -0.09623209763327087, 0.030903622904028132, -0.07403572461913405, -0.130997506974839, 0.1201604992047292, 0.36932400130204057, -0.26665283338922374, -0.2776445341911518, 0.1356676550334577, -0.2654675483680184, -0.15016938893874204, 0.1735444162450965, -0.09701665797499272, 0.07027608240843287, 0.0368699084853156, -0.005007034042995107, 0.019908491801763385, -0.23604298436446056, 0.26985692001480915, 0.12303110625032547, 0.32450271023542815, -0.004057944239755659, 0.13185512610131278, 0.007494199318143557, -0.023316170351064338, -0.04200043232559443, -0.12175140848873679, 0.14543693164676874, 0.255476976328957, 0.15468715981952078, 0.3626196660839443, -0.4259605790318558, -0.13027091026774743, 0.1401617813843695, 0.05884171733208024, -0.004727403923968709, -0.028579832376098062, -0.23216516187754255, 0.06950571111538126, -0.22557985097310454, -0.08696504547582858, -0.08180411431774404, -0.04212928903377, 0.06114282584514867, -0.3710564248287265, 0.014947261603083462, 0.04869991587182074, 0.025042587700673326, -0.08889365640509897, -0.07763763664015012, -0.03994704663472356, 0.1198722518511547, 0.030414017560011736, -0.05920810699931481, 0.16420502449150062, -0.1017061438244539, -0.18796444946970298, 0.38574042667359487, -0.046062649615729846, -0.1664770142476912, 0.13823964630851066, -0.06039842888244293, -0.14332738498433745, 0.10436113157350593, 0.20748954649601695, 0.08292474168493359, -0.1729507562682419, 0.07060715434457755, -0.06180423209970852, 0.21419645550092622, 0.0068958397755551635, 0.024133146933789523, 0.15704446677821424, 0.2135138029712926, 0.17176196728569437, 0.13688338968065222, -0.01718691264574984, -0.18273432012764537, -0.2812716175023021, -0.11138877882944338, -0.17545518472222552, 0.04810416431872045, -0.12349740218967141, -0.1618349538821692, 0.4293748118604223, 0.18731389314803126, 0.11988439641119737, 0.15538087097851783, 0.34491035421876787, 0.16763463403711845, -0.023721449340711225, 0.15998421134368615, 0.1858565967483153, 0.022563311243546928, 0.16369450844402583, -0.24884029619876039, 0.10760123386639375, 0.0752220406173582]
|
1,803.04217
|
Information-thermodynamic characterization of stochastic Boolean
networks
|
Recent progress in experimental techniques has enabled us to quantitatively
study stochastic and flexible behavior of biological systems. For example, gene
regulatory networks perform stochastic information processing and their
functionalities have been extensively studied. In gene regulatory networks,
there are specific subgraphs called network motifs that occur at frequencies
much higher than those found in randomized networks. Further understanding of
the designing principle of such networks is highly desirable. In a different
context, information thermodynamics has been developed as a theoretical
framework that generalizes non-equilibrium thermodynamics to stochastically
fluctuating systems with information. Here we systematically characterize gene
regulatory networks on the basis of information thermodynamics. We model
three-node gene regulatory patterns by a stochastic Boolean model, which
receive one or two input signals that carry external information. For the case
of a single input, we found that all the three-node patterns are classified
into four types by using information-thermodynamic quantities such as
dissipation and mutual information, and reveal to which type each network motif
belongs. Next, we consider the case where there are two inputs, and evaluate
the capacity of logical operation of the three-node patterns by using
tripartite mutual information, and argue the reason why patterns with fewer
edges are preferred in natural selection. This result might also explain the
difference of the occurrence frequencies among different types of
feedforward-loop network motifs.
|
cond-mat.stat-mech physics.bio-ph q-bio.MN
|
recent progress in experimental techniques has enabled us to quantitatively study stochastic and flexible behavior of biological systems for example gene regulatory networks perform stochastic information processing and their functionalities have been extensively studied in gene regulatory networks there are specific subgraphs called network motifs that occur at frequencies much higher than those found in randomized networks further understanding of the designing principle of such networks is highly desirable in a different context information thermodynamics has been developed as a theoretical framework that generalizes nonequilibrium thermodynamics to stochastically fluctuating systems with information here we systematically characterize gene regulatory networks on the basis of information thermodynamics we model threenode gene regulatory patterns by a stochastic boolean model which receive one or two input signals that carry external information for the case of a single input we found that all the threenode patterns are classified into four types by using informationthermodynamic quantities such as dissipation and mutual information and reveal to which type each network motif belongs next we consider the case where there are two inputs and evaluate the capacity of logical operation of the threenode patterns by using tripartite mutual information and argue the reason why patterns with fewer edges are preferred in natural selection this result might also explain the difference of the occurrence frequencies among different types of feedforwardloop network motifs
|
[['recent', 'progress', 'in', 'experimental', 'techniques', 'has', 'enabled', 'us', 'to', 'quantitatively', 'study', 'stochastic', 'and', 'flexible', 'behavior', 'of', 'biological', 'systems', 'for', 'example', 'gene', 'regulatory', 'networks', 'perform', 'stochastic', 'information', 'processing', 'and', 'their', 'functionalities', 'have', 'been', 'extensively', 'studied', 'in', 'gene', 'regulatory', 'networks', 'there', 'are', 'specific', 'subgraphs', 'called', 'network', 'motifs', 'that', 'occur', 'at', 'frequencies', 'much', 'higher', 'than', 'those', 'found', 'in', 'randomized', 'networks', 'further', 'understanding', 'of', 'the', 'designing', 'principle', 'of', 'such', 'networks', 'is', 'highly', 'desirable', 'in', 'a', 'different', 'context', 'information', 'thermodynamics', 'has', 'been', 'developed', 'as', 'a', 'theoretical', 'framework', 'that', 'generalizes', 'nonequilibrium', 'thermodynamics', 'to', 'stochastically', 'fluctuating', 'systems', 'with', 'information', 'here', 'we', 'systematically', 'characterize', 'gene', 'regulatory', 'networks', 'on', 'the', 'basis', 'of', 'information', 'thermodynamics', 'we', 'model', 'threenode', 'gene', 'regulatory', 'patterns', 'by', 'a', 'stochastic', 'boolean', 'model', 'which', 'receive', 'one', 'or', 'two', 'input', 'signals', 'that', 'carry', 'external', 'information', 'for', 'the', 'case', 'of', 'a', 'single', 'input', 'we', 'found', 'that', 'all', 'the', 'threenode', 'patterns', 'are', 'classified', 'into', 'four', 'types', 'by', 'using', 'informationthermodynamic', 'quantities', 'such', 'as', 'dissipation', 'and', 'mutual', 'information', 'and', 'reveal', 'to', 'which', 'type', 'each', 'network', 'motif', 'belongs', 'next', 'we', 'consider', 'the', 'case', 'where', 'there', 'are', 'two', 'inputs', 'and', 'evaluate', 'the', 'capacity', 'of', 'logical', 'operation', 'of', 'the', 'threenode', 'patterns', 'by', 'using', 'tripartite', 'mutual', 'information', 'and', 'argue', 'the', 'reason', 'why', 'patterns', 'with', 'fewer', 'edges', 'are', 'preferred', 'in', 'natural', 'selection', 'this', 'result', 'might', 'also', 'explain', 'the', 'difference', 'of', 'the', 'occurrence', 'frequencies', 'among', 'different', 'types', 'of', 'feedforwardloop', 'network', 'motifs']]
|
[-0.13948150660196604, 0.0848915632646363, -0.015935751936725667, 0.1048201929131808, -0.06577015311985805, -0.18008677608560067, 0.06016011786571628, 0.39043531216144023, -0.27064404020564176, -0.28814591509331994, 0.06286746849513587, -0.28025667814680516, -0.2592703030499219, 0.17347460575003243, -0.04642400117632975, 0.04452739691840032, 0.05828394383445869, 0.07234957958005268, 0.026085187024478842, -0.21382845568570685, 0.3124087081051658, 0.03086459684512905, 0.32783345096974803, 0.0015203831297857268, 0.08042240815304287, -0.034109461125456264, -0.04087759851507406, 0.04564131616073585, -0.12864936766414461, 0.13735685771727632, 0.31563222714959904, 0.19677831846297728, 0.300722442810667, -0.485036204090795, -0.29282618131119387, 0.13700595601547827, 0.12090349735271055, 0.15445467098595086, -0.016616582755116863, -0.2431164140894858, 0.0832272716420325, -0.17308496355159347, -0.03191095418800172, -0.11615258203148171, 0.010237615412889837, 0.04119479631887631, -0.24994267207499057, 0.058817871964116045, 0.0701520046070302, 0.07191402102015107, -0.008476742268498014, -0.11143853285702297, -0.050994855423063576, 0.1841109023809114, 0.004478937572367523, -0.029768553468595922, 0.14940825134708738, -0.09586993686779195, -0.19549220498978487, 0.32863567257719534, 0.015849490502840305, -0.22549490124587104, 0.19173490894572423, -0.0999368770897015, -0.21447225947033716, 0.09202086258058746, 0.18521896081028488, 0.07401430257805833, -0.2499063889944909, -0.008040387714638267, -0.006134096799189695, 0.16609981724402975, 0.09627078323801225, 0.10177532584628778, 0.2061267834018312, 0.20513895430669254, 0.025663736684306583, 0.1663860301696905, -0.0627658979826699, -0.14199840098720146, -0.18744758318198282, -0.08221192272098919, -0.1520066530541265, 0.021200938809973497, -0.10023075768890316, -0.12646584464488803, 0.39621631883143504, 0.142648410999181, 0.1809211103476349, 0.05092217092221888, 0.27574061723174276, 0.04763230792276125, 0.09611050345460875, 0.05390293412497855, 0.19091142214853568, 0.11772396882706498, 0.12697449941733466, -0.18043405937842671, 0.14040369647940482, 0.020907678073985286]
|
1,803.04218
|
Compressed Sensing for Analog Signals
|
In this paper we develop a general theory of compressed sensing for analog
signals, in close similarity to prior results for vectors in finite dimensional
spaces that are sparse in a given orthonormal basis. The signals are modeled by
functions in a reproducing kernel Hilbert space. Sparsity is defined as the
minimal number of terms in expansions based on the kernel functions. Minimizing
this number is under certain conditions equivalent to minimizing an atomic
norm, the pre-dual of the supremum norm for functions in the Hilbert space. The
norm minimizer is shown to exist based on a compactness argument. Recovery
based on minimizing the atomic norm is robust and stable, so it provides
controllable accuracy for recovery when the signal is only approximately sparse
and the measurement is corrupted by noise.
As applications of the theory, we include results on the recovery of sparse
bandlimited functions and functions that have a sparse inverse short-time
Fourier transform.
|
math.FA
|
in this paper we develop a general theory of compressed sensing for analog signals in close similarity to prior results for vectors in finite dimensional spaces that are sparse in a given orthonormal basis the signals are modeled by functions in a reproducing kernel hilbert space sparsity is defined as the minimal number of terms in expansions based on the kernel functions minimizing this number is under certain conditions equivalent to minimizing an atomic norm the predual of the supremum norm for functions in the hilbert space the norm minimizer is shown to exist based on a compactness argument recovery based on minimizing the atomic norm is robust and stable so it provides controllable accuracy for recovery when the signal is only approximately sparse and the measurement is corrupted by noise as applications of the theory we include results on the recovery of sparse bandlimited functions and functions that have a sparse inverse shorttime fourier transform
|
[['in', 'this', 'paper', 'we', 'develop', 'a', 'general', 'theory', 'of', 'compressed', 'sensing', 'for', 'analog', 'signals', 'in', 'close', 'similarity', 'to', 'prior', 'results', 'for', 'vectors', 'in', 'finite', 'dimensional', 'spaces', 'that', 'are', 'sparse', 'in', 'a', 'given', 'orthonormal', 'basis', 'the', 'signals', 'are', 'modeled', 'by', 'functions', 'in', 'a', 'reproducing', 'kernel', 'hilbert', 'space', 'sparsity', 'is', 'defined', 'as', 'the', 'minimal', 'number', 'of', 'terms', 'in', 'expansions', 'based', 'on', 'the', 'kernel', 'functions', 'minimizing', 'this', 'number', 'is', 'under', 'certain', 'conditions', 'equivalent', 'to', 'minimizing', 'an', 'atomic', 'norm', 'the', 'predual', 'of', 'the', 'supremum', 'norm', 'for', 'functions', 'in', 'the', 'hilbert', 'space', 'the', 'norm', 'minimizer', 'is', 'shown', 'to', 'exist', 'based', 'on', 'a', 'compactness', 'argument', 'recovery', 'based', 'on', 'minimizing', 'the', 'atomic', 'norm', 'is', 'robust', 'and', 'stable', 'so', 'it', 'provides', 'controllable', 'accuracy', 'for', 'recovery', 'when', 'the', 'signal', 'is', 'only', 'approximately', 'sparse', 'and', 'the', 'measurement', 'is', 'corrupted', 'by', 'noise', 'as', 'applications', 'of', 'the', 'theory', 'we', 'include', 'results', 'on', 'the', 'recovery', 'of', 'sparse', 'bandlimited', 'functions', 'and', 'functions', 'that', 'have', 'a', 'sparse', 'inverse', 'shorttime', 'fourier', 'transform']]
|
[-0.08821322475612248, 0.08419111702161712, -0.08037060534489007, 0.08849271977445684, -0.041874379521080606, -0.0746850517868715, -0.0024606064417196484, 0.40486250422709885, -0.3082274509092363, -0.18926868424452364, 0.1662935949600815, -0.2509731641934755, -0.18689665908758074, 0.19335795869940342, -0.12784382841215494, 0.12797679728231368, 0.05172438731787201, 0.07518117237561502, -0.1475639657001011, -0.24712204048410058, 0.3266427496340699, 0.05336893381527028, 0.265816304516286, -0.006353901912986588, 0.12387439594245873, 0.04257385430481428, -0.019837051203163963, -0.03407055242860224, -0.07364728219423948, 0.15823907930499467, 0.28403865337037504, 0.16594848200344506, 0.3301514972072954, -0.41341658017765254, -0.2103173723205542, 0.177943693426175, 0.08515163304475255, 0.026349042548248783, -0.046820024837357685, -0.27876978164288, 0.09793941993624546, -0.08278211554846703, -0.053138263296718016, -0.14022360888954538, 0.0021208524375628582, 0.035833479036600925, -0.3636426045917548, 0.1005990971148444, 0.05110846383150858, 0.04438820745175084, -0.12772118780785838, -0.11072329701243852, 0.0665107134771414, 0.0673956976308359, 0.002337978445351697, 0.059744798336536266, 0.10011816596763823, -0.08062299614152252, -0.06099124216677573, 0.34480477036693347, -0.08411412447085007, -0.2996353144542529, 0.14911643704936767, -0.1426122062555992, -0.11089184956822115, 0.127245943632144, 0.17650716678979686, 0.10585308699116397, -0.11329341504190382, 0.1527342483545325, -0.09473600430796161, 0.15246566395776776, 0.0844386985573249, 0.10042442793499691, 0.07999934096975873, 0.14105500246827993, 0.1617282441479918, 0.14126616379228205, -0.04753047951985186, -0.055456844443165794, -0.31552033081205966, -0.12122314838835827, -0.3070270143873178, 0.0008569036025362901, -0.12130974133124721, -0.19864821741234315, 0.39167037334006566, 0.08347148107154331, 0.21901927289600748, 0.0814699309770591, 0.31392542909209925, 0.1587015084716348, 0.04919344078128537, 0.07243912742556766, 0.1925353734031654, 0.17393503601674754, 0.008019381889309257, -0.15655205177571566, 0.05685061761715378, 0.14985262812115252]
|
1,803.04219
|
Data Science Methodology for Cybersecurity Projects
|
Cyber-security solutions are traditionally static and signature-based. The
traditional solutions along with the use of analytic models, machine learning
and big data could be improved by automatically trigger mitigation or provide
relevant awareness to control or limit consequences of threats. This kind of
intelligent solutions is covered in the context of Data Science for
Cyber-security. Data Science provides a significant role in cyber-security by
utilising the power of data (and big data), high-performance computing and data
mining (and machine learning) to protect users against cyber-crimes. For this
purpose, a successful data science project requires an effective methodology to
cover all issues and provide adequate resources. In this paper, we are
introducing popular data science methodologies and will compare them in
accordance with cyber-security challenges. A comparison discussion has also
delivered to explain methodologies strengths and weaknesses in case of
cyber-security projects.
|
cs.CY cs.CR
|
cybersecurity solutions are traditionally static and signaturebased the traditional solutions along with the use of analytic models machine learning and big data could be improved by automatically trigger mitigation or provide relevant awareness to control or limit consequences of threats this kind of intelligent solutions is covered in the context of data science for cybersecurity data science provides a significant role in cybersecurity by utilising the power of data and big data highperformance computing and data mining and machine learning to protect users against cybercrimes for this purpose a successful data science project requires an effective methodology to cover all issues and provide adequate resources in this paper we are introducing popular data science methodologies and will compare them in accordance with cybersecurity challenges a comparison discussion has also delivered to explain methodologies strengths and weaknesses in case of cybersecurity projects
|
[['cybersecurity', 'solutions', 'are', 'traditionally', 'static', 'and', 'signaturebased', 'the', 'traditional', 'solutions', 'along', 'with', 'the', 'use', 'of', 'analytic', 'models', 'machine', 'learning', 'and', 'big', 'data', 'could', 'be', 'improved', 'by', 'automatically', 'trigger', 'mitigation', 'or', 'provide', 'relevant', 'awareness', 'to', 'control', 'or', 'limit', 'consequences', 'of', 'threats', 'this', 'kind', 'of', 'intelligent', 'solutions', 'is', 'covered', 'in', 'the', 'context', 'of', 'data', 'science', 'for', 'cybersecurity', 'data', 'science', 'provides', 'a', 'significant', 'role', 'in', 'cybersecurity', 'by', 'utilising', 'the', 'power', 'of', 'data', 'and', 'big', 'data', 'highperformance', 'computing', 'and', 'data', 'mining', 'and', 'machine', 'learning', 'to', 'protect', 'users', 'against', 'cybercrimes', 'for', 'this', 'purpose', 'a', 'successful', 'data', 'science', 'project', 'requires', 'an', 'effective', 'methodology', 'to', 'cover', 'all', 'issues', 'and', 'provide', 'adequate', 'resources', 'in', 'this', 'paper', 'we', 'are', 'introducing', 'popular', 'data', 'science', 'methodologies', 'and', 'will', 'compare', 'them', 'in', 'accordance', 'with', 'cybersecurity', 'challenges', 'a', 'comparison', 'discussion', 'has', 'also', 'delivered', 'to', 'explain', 'methodologies', 'strengths', 'and', 'weaknesses', 'in', 'case', 'of', 'cybersecurity', 'projects']]
|
[-0.07259426473355884, 0.004776364605290095, -0.06283596590993569, 0.0798845147063414, -0.15619888159624756, -0.162167509162389, 0.044733860520051516, 0.33870910777601393, -0.23964156735529926, -0.3748725339875999, 0.17594371027237213, -0.32532293999778994, -0.12218269347815926, 0.22369641926575531, -0.148751632597773, 0.09021686408866911, 0.08985311592060491, -0.015761996434047052, -0.005353807932400006, -0.2765503538052505, 0.3279306776524383, 0.08756474977530909, 0.3576242790114901, 0.054162841924327486, 0.018005936646040163, -0.017192011931498292, -0.1028782568660611, -0.015217464886183012, -0.12228206745910307, 0.1867875875475823, 0.42705762316423806, 0.2830871029737148, 0.3671229525389982, -0.46078961851167766, -0.1927086129150492, 0.10180571265122358, 0.1526007148542884, 0.0979855083497175, -0.10085087474963977, -0.3084125587475612, 0.07307356276965522, -0.20118475332856178, -0.13820094246985326, -0.16299595261085117, 0.014809566173464694, 0.032491437296535, -0.24849456443669313, -0.03257135285728393, 0.012834636725696688, 0.13800079010076927, -0.05311514838129705, -0.09636980862561481, 0.05218098225924087, 0.16500829610022458, 0.07967282352301933, 0.021143128989753148, 0.12466041832594267, -0.1671668103952225, -0.17909723347224665, 0.3829992064506027, -0.002284752442798716, -0.14454886446713555, 0.1779764665252321, 0.01569728639326884, -0.19474172309463753, 0.05567265462942739, 0.23181998970957987, 0.021941325290406002, -0.19694913885100407, 0.07776527543525799, 0.10412826665994177, 0.14210702866936722, 0.004903301649482538, 0.0040070973997209085, 0.2248310574944666, 0.2327796641327705, 0.050338708009597256, 0.09577379186707054, -0.06202230854674097, -0.10293029737823926, -0.24081093142657864, -0.11969635215528468, -0.1198831459429736, -0.021145024934638264, -0.03619704413614137, -0.10083494901802417, 0.3619804694350307, 0.2265735229193266, 0.11781880131374436, -0.015335709171977343, 0.37475141914931276, 0.031330963355614576, 0.10252022794745069, 0.09055776146722706, 0.20876703712864653, 0.015501169590213408, 0.20486266020659014, -0.1174827568226408, 0.07862130601408211, -0.05501575480175621]
|
1,803.0422
|
A space-based method for the generation of a Schwartz function with
infinitely many generalized vanishing moments with applications in image
processing
|
In this article we construct a function with infinitely many vanishing
(generalized) moments. This is motivated by an application to the Taylorlet
transform which is based on the continuous shearlet transform. It can detect
curvature and other higher order geometric information of singularities in
addition to their position and the direction. For a robust detection of these
features a function with higher order vanishing moments, $\int_\mathbb{R}
g(x^k)x^m dx = 0$, is needed. We show that the presented construction produces
an explicit formula of a function with infinitely many vanishing moments of
arbitrary order and thus allows for a robust detection of certain geometric
features. The construction has an inherent connection to q-calculus, the Euler
function and the partition function.
|
math.NA
|
in this article we construct a function with infinitely many vanishing generalized moments this is motivated by an application to the taylorlet transform which is based on the continuous shearlet transform it can detect curvature and other higher order geometric information of singularities in addition to their position and the direction for a robust detection of these features a function with higher order vanishing moments int_mathbbr gxkxm dx 0 is needed we show that the presented construction produces an explicit formula of a function with infinitely many vanishing moments of arbitrary order and thus allows for a robust detection of certain geometric features the construction has an inherent connection to qcalculus the euler function and the partition function
|
[['in', 'this', 'article', 'we', 'construct', 'a', 'function', 'with', 'infinitely', 'many', 'vanishing', 'generalized', 'moments', 'this', 'is', 'motivated', 'by', 'an', 'application', 'to', 'the', 'taylorlet', 'transform', 'which', 'is', 'based', 'on', 'the', 'continuous', 'shearlet', 'transform', 'it', 'can', 'detect', 'curvature', 'and', 'other', 'higher', 'order', 'geometric', 'information', 'of', 'singularities', 'in', 'addition', 'to', 'their', 'position', 'and', 'the', 'direction', 'for', 'a', 'robust', 'detection', 'of', 'these', 'features', 'a', 'function', 'with', 'higher', 'order', 'vanishing', 'moments', 'int_mathbbr', 'gxkxm', 'dx', '0', 'is', 'needed', 'we', 'show', 'that', 'the', 'presented', 'construction', 'produces', 'an', 'explicit', 'formula', 'of', 'a', 'function', 'with', 'infinitely', 'many', 'vanishing', 'moments', 'of', 'arbitrary', 'order', 'and', 'thus', 'allows', 'for', 'a', 'robust', 'detection', 'of', 'certain', 'geometric', 'features', 'the', 'construction', 'has', 'an', 'inherent', 'connection', 'to', 'qcalculus', 'the', 'euler', 'function', 'and', 'the', 'partition', 'function']]
|
[-0.13337707664229526, 0.07528754083863082, -0.11441154612236235, 0.0756586081891631, -0.10935200016117758, -0.09290315315493533, -0.03441262606563222, 0.3424978642764255, -0.2819810282582274, -0.26067407658466923, 0.11064636900535442, -0.2709607737116231, -0.19270145184256965, 0.16501372040480247, -0.07331026011966488, 0.07262052064681919, -0.02319112393217018, 0.07731001301565105, -0.12153801013432984, -0.22273307052862823, 0.32159831304835457, 0.02591887904772869, 0.2649006287877758, 0.08193925271232605, 0.15416802094978654, 0.02979076695509064, -0.015022626210354332, -0.01758589142631007, -0.1390760005434948, 0.15590799844258615, 0.23476029878370783, 0.07694594556083664, 0.25776253291206735, -0.38060120943710846, -0.17433533861658052, 0.15599526764235944, 0.1264267618704237, 0.08244762788865015, -0.056296033535001434, -0.2653674262249444, 0.11735808992615113, -0.16305056775315133, -0.1796017951873314, -0.1342045177036944, 0.029531424566625785, 0.05189211931652748, -0.29524549517907905, 0.0367643608011178, 0.11243109677273494, 0.027137309161580015, -0.0477492894910666, -0.08902646358021432, 0.012039426379860977, 0.10075073800264643, 0.043886767063512765, 0.07657172063536719, 0.04854456916387774, -0.13248994020480487, -0.08917937780786146, 0.3254642369241541, -0.08172038892427316, -0.2708456660183067, 0.17044290057463077, -0.13086373115786248, -0.14109376900128892, 0.12942412968438405, 0.10963346376919593, 0.17113664232863066, -0.10828329926121853, 0.08373525455936344, -0.012466961462209877, 0.14646192675090244, 0.06177549260771937, 0.03565371463584722, 0.16246854417766324, 0.06415581696022016, 0.1240614942368518, 0.1718999545640137, -0.0960859220303818, -0.0747011666580175, -0.34103065620884937, -0.19638282564940313, -0.20353221240588742, 0.062491396147534885, -0.10619415351713045, -0.20480634467915082, 0.41387735409104925, 0.13119862291914147, 0.22654893483297947, 0.09709421370644122, 0.29105497884731263, 0.1927426765855943, 0.06227808127589683, 0.015826141447799966, 0.14244424668737712, 0.133666483227673, 0.03750710957285622, -0.15964473185376224, 0.07206995304053028, 0.11263039684257446]
|
1,803.04221
|
Extremal dependence of random scale constructions
|
A bivariate random vector can exhibit either asymptotic independence or
dependence between the largest values of its components. When used as a
statistical model for risk assessment in fields such as finance, insurance or
meteorology, it is crucial to understand which of the two asymptotic regimes
occurs. Motivated by their ubiquity and flexibility, we consider the extremal
dependence properties of vectors with a random scale construction
$(X_1,X_2)=R(W_1,W_2)$, with non-degenerate $R>0$ independent of $(W_1,W_2)$.
Focusing on the presence and strength of asymptotic tail dependence, as
expressed through commonly-used summary parameters, broad factors that affect
the results are: the heaviness of the tails of $R$ and $(W_1,W_2)$, the shape
of the support of $(W_1,W_2)$, and dependence between $(W_1,W_2)$. When $R$ is
distinctly lighter tailed than $(W_1,W_2)$, the extremal dependence of
$(X_1,X_2)$ is typically the same as that of $(W_1,W_2)$, whereas similar or
heavier tails for $R$ compared to $(W_1,W_2)$ typically result in increased
extremal dependence. Similar tail heavinesses represent the most interesting
and technical cases, and we find both asymptotic independence and dependence of
$(X_1,X_2)$ possible in such cases when $(W_1,W_2)$ exhibit asymptotic
independence. The bivariate case often directly extends to higher-dimensional
vectors and spatial processes, where the dependence is mainly analyzed in terms
of summaries of bivariate sub-vectors. The results unify and extend many
existing examples, and we use them to propose new models that encompass both
dependence classes.
|
math.PR math.ST stat.TH
|
a bivariate random vector can exhibit either asymptotic independence or dependence between the largest values of its components when used as a statistical model for risk assessment in fields such as finance insurance or meteorology it is crucial to understand which of the two asymptotic regimes occurs motivated by their ubiquity and flexibility we consider the extremal dependence properties of vectors with a random scale construction x_1x_2rw_1w_2 with nondegenerate r0 independent of w_1w_2 focusing on the presence and strength of asymptotic tail dependence as expressed through commonlyused summary parameters broad factors that affect the results are the heaviness of the tails of r and w_1w_2 the shape of the support of w_1w_2 and dependence between w_1w_2 when r is distinctly lighter tailed than w_1w_2 the extremal dependence of x_1x_2 is typically the same as that of w_1w_2 whereas similar or heavier tails for r compared to w_1w_2 typically result in increased extremal dependence similar tail heavinesses represent the most interesting and technical cases and we find both asymptotic independence and dependence of x_1x_2 possible in such cases when w_1w_2 exhibit asymptotic independence the bivariate case often directly extends to higherdimensional vectors and spatial processes where the dependence is mainly analyzed in terms of summaries of bivariate subvectors the results unify and extend many existing examples and we use them to propose new models that encompass both dependence classes
|
[['a', 'bivariate', 'random', 'vector', 'can', 'exhibit', 'either', 'asymptotic', 'independence', 'or', 'dependence', 'between', 'the', 'largest', 'values', 'of', 'its', 'components', 'when', 'used', 'as', 'a', 'statistical', 'model', 'for', 'risk', 'assessment', 'in', 'fields', 'such', 'as', 'finance', 'insurance', 'or', 'meteorology', 'it', 'is', 'crucial', 'to', 'understand', 'which', 'of', 'the', 'two', 'asymptotic', 'regimes', 'occurs', 'motivated', 'by', 'their', 'ubiquity', 'and', 'flexibility', 'we', 'consider', 'the', 'extremal', 'dependence', 'properties', 'of', 'vectors', 'with', 'a', 'random', 'scale', 'construction', 'x_1x_2rw_1w_2', 'with', 'nondegenerate', 'r0', 'independent', 'of', 'w_1w_2', 'focusing', 'on', 'the', 'presence', 'and', 'strength', 'of', 'asymptotic', 'tail', 'dependence', 'as', 'expressed', 'through', 'commonlyused', 'summary', 'parameters', 'broad', 'factors', 'that', 'affect', 'the', 'results', 'are', 'the', 'heaviness', 'of', 'the', 'tails', 'of', 'r', 'and', 'w_1w_2', 'the', 'shape', 'of', 'the', 'support', 'of', 'w_1w_2', 'and', 'dependence', 'between', 'w_1w_2', 'when', 'r', 'is', 'distinctly', 'lighter', 'tailed', 'than', 'w_1w_2', 'the', 'extremal', 'dependence', 'of', 'x_1x_2', 'is', 'typically', 'the', 'same', 'as', 'that', 'of', 'w_1w_2', 'whereas', 'similar', 'or', 'heavier', 'tails', 'for', 'r', 'compared', 'to', 'w_1w_2', 'typically', 'result', 'in', 'increased', 'extremal', 'dependence', 'similar', 'tail', 'heavinesses', 'represent', 'the', 'most', 'interesting', 'and', 'technical', 'cases', 'and', 'we', 'find', 'both', 'asymptotic', 'independence', 'and', 'dependence', 'of', 'x_1x_2', 'possible', 'in', 'such', 'cases', 'when', 'w_1w_2', 'exhibit', 'asymptotic', 'independence', 'the', 'bivariate', 'case', 'often', 'directly', 'extends', 'to', 'higherdimensional', 'vectors', 'and', 'spatial', 'processes', 'where', 'the', 'dependence', 'is', 'mainly', 'analyzed', 'in', 'terms', 'of', 'summaries', 'of', 'bivariate', 'subvectors', 'the', 'results', 'unify', 'and', 'extend', 'many', 'existing', 'examples', 'and', 'we', 'use', 'them', 'to', 'propose', 'new', 'models', 'that', 'encompass', 'both', 'dependence', 'classes']]
|
[-0.0721251362701878, 0.10452068646941169, -0.08875704200349056, 0.11588897636011902, -0.06837402032925212, -0.148085416283817, 0.008035659699121787, 0.3533521978745023, -0.24676914158971586, -0.2787631972594005, 0.11109762563394894, -0.29403412043512595, -0.1350237023099779, 0.17985358801711582, -0.05026137671228375, 0.02482306026012443, -0.01720543980981693, 0.049659583600139064, -0.06616231801314898, -0.2294635206370293, 0.3199375112952079, 0.030001933702918808, 0.2876798274475603, 0.015969394898841537, 0.06931653928085832, 0.04374468778424888, -0.04209689681822088, 0.014396487438619992, -0.1310624070171629, 0.09150433295562996, 0.230806240787943, 0.1051056440947647, 0.26398300137412034, -0.3590404136823408, -0.18921143877146399, 0.15905732600084316, 0.17263088912797878, 0.01287840078203667, -0.0014271348497451209, -0.22936689463728396, 0.06982960861559495, -0.16932382510018956, -0.13210866046993194, -0.06584228936941322, 0.06225185055054922, 0.1007216366443709, -0.3186814839896577, 0.10905147591436826, 0.11247034842587299, 0.07191194844456901, 0.0021103969038530064, -0.18109036765506376, -0.030943172592340053, 0.12575810024526643, 0.15401425402775298, -0.043857855802665636, 0.1132123503685657, -0.13535188756619407, -0.0822224126823774, 0.3343008841177762, -0.08343853700868177, -0.19648097105225368, 0.22161134378778527, -0.18565561013930865, -0.13829210015895685, 0.06862480498631938, 0.17336800761018112, 0.10961462063426398, -0.10924597537608362, 0.10692895998080071, -0.034578350665196114, 0.12363581030641937, 0.10290999018249258, 0.10506146361812356, 0.16715755608536517, 0.09789083320214784, 0.01858399841525315, 0.16015830903882738, -0.05339337059668063, -0.11013076342544437, -0.3108337558847151, -0.10649315094852416, -0.16572450238189337, 0.029739178531696046, -0.17482130402692417, -0.19615721943133008, 0.3823942096421775, 0.1451709120311832, 0.25437668348102116, 0.06160592906376908, 0.2336131782988004, 0.10318514587464783, 0.029388888431012433, 0.08952836607751824, 0.16838083897750264, 0.13412681742019095, 0.040245925327680544, -0.15006046172383908, 0.15050801197355365, 0.0005468825255397014]
|
1,803.04222
|
Electromagnetic models for multilayer superconducting transmission lines
|
Thin-film superconducting transmission lines play important roles in many
signal transmission and detection systems, including qubit coupling and
read-out schemes, electron spin resonance systems, parametric amplifiers, and
various ultra high sensitivity detectors. Here we present a rigorous method for
computing the electromagnetic behaviour of superconducting microstrip
transmission lines and coplanar waveguides. Our method is based on conformal
mapping, and is suitable for both homogeneous superconductors and
proximity-coupled multilayers. We also present an effective conductivity
approximation of multilayers, thereby allowing the multilayers to be analysed
using existing electromagnetic design software. We compute the numerical
results for Al-Ti bilayers and discuss the validity of our full computation and
homogeneous approximation.
|
cond-mat.supr-con
|
thinfilm superconducting transmission lines play important roles in many signal transmission and detection systems including qubit coupling and readout schemes electron spin resonance systems parametric amplifiers and various ultra high sensitivity detectors here we present a rigorous method for computing the electromagnetic behaviour of superconducting microstrip transmission lines and coplanar waveguides our method is based on conformal mapping and is suitable for both homogeneous superconductors and proximitycoupled multilayers we also present an effective conductivity approximation of multilayers thereby allowing the multilayers to be analysed using existing electromagnetic design software we compute the numerical results for alti bilayers and discuss the validity of our full computation and homogeneous approximation
|
[['thinfilm', 'superconducting', 'transmission', 'lines', 'play', 'important', 'roles', 'in', 'many', 'signal', 'transmission', 'and', 'detection', 'systems', 'including', 'qubit', 'coupling', 'and', 'readout', 'schemes', 'electron', 'spin', 'resonance', 'systems', 'parametric', 'amplifiers', 'and', 'various', 'ultra', 'high', 'sensitivity', 'detectors', 'here', 'we', 'present', 'a', 'rigorous', 'method', 'for', 'computing', 'the', 'electromagnetic', 'behaviour', 'of', 'superconducting', 'microstrip', 'transmission', 'lines', 'and', 'coplanar', 'waveguides', 'our', 'method', 'is', 'based', 'on', 'conformal', 'mapping', 'and', 'is', 'suitable', 'for', 'both', 'homogeneous', 'superconductors', 'and', 'proximitycoupled', 'multilayers', 'we', 'also', 'present', 'an', 'effective', 'conductivity', 'approximation', 'of', 'multilayers', 'thereby', 'allowing', 'the', 'multilayers', 'to', 'be', 'analysed', 'using', 'existing', 'electromagnetic', 'design', 'software', 'we', 'compute', 'the', 'numerical', 'results', 'for', 'alti', 'bilayers', 'and', 'discuss', 'the', 'validity', 'of', 'our', 'full', 'computation', 'and', 'homogeneous', 'approximation']]
|
[-0.18656784621675293, 0.07483179490548166, 0.004450948382900269, -0.0043157449884650605, -0.055382910368886464, -0.19794406498247688, 0.03189626194243492, 0.45797708153690175, -0.15291124204156437, -0.277207997282622, 0.06165515735240964, -0.28477314935083053, -0.14026811626670813, 0.2655200290028006, 0.06266255923832499, 0.135465820475171, 0.009594865169169174, -0.11165639771045083, -0.07125324605752852, -0.2039051753505461, 0.28927911045374693, 0.05064928692041172, 0.371901050425583, 0.0747863362905466, 0.08008877172660842, 0.03012278145265386, 0.04588230854521195, -0.02103883279832425, -0.15104160446854722, 0.10452922057636359, 0.3094063442161617, -0.0014801072646622305, 0.17867015322014965, -0.4861571019239448, -0.2115687020295472, 0.016673184448370227, 0.1812139066751115, 0.1322976425807509, -0.06835534988527393, -0.270801320352971, 0.05954219411661917, -0.15936622422843896, -0.09329070681619837, -0.13773295304013622, -0.05366472303177471, 0.014932824915309471, -0.2671757747108738, 0.013328677545898783, 0.044120664389252114, 0.08870288044110769, -0.06317227610809452, -0.0832102118163473, 0.05500460957517606, 0.059198062711705766, -0.05806668859872001, -0.04878230863121442, 0.17228184674469824, -0.11130025076110744, -0.11958608795517918, 0.31335541845624837, -0.05757128973319023, -0.16016394344236082, 0.16761887406917392, -0.11085142346995848, -0.06105506759895771, 0.12002971297112743, 0.17404644360067323, 0.11289825888471333, -0.16559002644175458, 0.07348865744899269, 0.04919142206199467, 0.16417587593335797, 0.07095506489147535, 0.10864534005695195, 0.21663340664882627, 0.2139703786837075, 0.037477038537165046, 0.13075920419133683, -0.13354978962430591, -0.008506531577074417, -0.26161110271803206, -0.18052673302763314, -0.15924029191955924, 0.02652925828550468, -0.0779147013960971, -0.2059270388024204, 0.4088824591771872, 0.18092453275110326, 0.0980626629531832, -0.02374297753838753, 0.3533131839293573, 0.1365249347592773, 0.05742816335556132, 0.03150462098333433, 0.26938427409105414, 0.22542724915331713, 0.11712081095578873, -0.2808050351752037, 0.009692200179280783, -0.012331011058348749]
|
1,803.04223
|
Leveraging Crowdsourcing Data For Deep Active Learning - An Application:
Learning Intents in Alexa
|
This paper presents a generic Bayesian framework that enables any deep
learning model to actively learn from targeted crowds. Our framework inherits
from recent advances in Bayesian deep learning, and extends existing work by
considering the targeted crowdsourcing approach, where multiple annotators with
unknown expertise contribute an uncontrolled amount (often limited) of
annotations. Our framework leverages the low-rank structure in annotations to
learn individual annotator expertise, which then helps to infer the true labels
from noisy and sparse annotations. It provides a unified Bayesian model to
simultaneously infer the true labels and train the deep learning model in order
to reach an optimal learning efficacy. Finally, our framework exploits the
uncertainty of the deep learning model during prediction as well as the
annotators' estimated expertise to minimize the number of required annotations
and annotators for optimally training the deep learning model.
We evaluate the effectiveness of our framework for intent classification in
Alexa (Amazon's personal assistant), using both synthetic and real-world
datasets. Experiments show that our framework can accurately learn annotator
expertise, infer true labels, and effectively reduce the amount of annotations
in model training as compared to state-of-the-art approaches. We further
discuss the potential of our proposed framework in bridging machine learning
and crowdsourcing towards improved human-in-the-loop systems.
|
cs.LG cs.SI stat.ML
|
this paper presents a generic bayesian framework that enables any deep learning model to actively learn from targeted crowds our framework inherits from recent advances in bayesian deep learning and extends existing work by considering the targeted crowdsourcing approach where multiple annotators with unknown expertise contribute an uncontrolled amount often limited of annotations our framework leverages the lowrank structure in annotations to learn individual annotator expertise which then helps to infer the true labels from noisy and sparse annotations it provides a unified bayesian model to simultaneously infer the true labels and train the deep learning model in order to reach an optimal learning efficacy finally our framework exploits the uncertainty of the deep learning model during prediction as well as the annotators estimated expertise to minimize the number of required annotations and annotators for optimally training the deep learning model we evaluate the effectiveness of our framework for intent classification in alexa amazons personal assistant using both synthetic and realworld datasets experiments show that our framework can accurately learn annotator expertise infer true labels and effectively reduce the amount of annotations in model training as compared to stateoftheart approaches we further discuss the potential of our proposed framework in bridging machine learning and crowdsourcing towards improved humanintheloop systems
|
[['this', 'paper', 'presents', 'a', 'generic', 'bayesian', 'framework', 'that', 'enables', 'any', 'deep', 'learning', 'model', 'to', 'actively', 'learn', 'from', 'targeted', 'crowds', 'our', 'framework', 'inherits', 'from', 'recent', 'advances', 'in', 'bayesian', 'deep', 'learning', 'and', 'extends', 'existing', 'work', 'by', 'considering', 'the', 'targeted', 'crowdsourcing', 'approach', 'where', 'multiple', 'annotators', 'with', 'unknown', 'expertise', 'contribute', 'an', 'uncontrolled', 'amount', 'often', 'limited', 'of', 'annotations', 'our', 'framework', 'leverages', 'the', 'lowrank', 'structure', 'in', 'annotations', 'to', 'learn', 'individual', 'annotator', 'expertise', 'which', 'then', 'helps', 'to', 'infer', 'the', 'true', 'labels', 'from', 'noisy', 'and', 'sparse', 'annotations', 'it', 'provides', 'a', 'unified', 'bayesian', 'model', 'to', 'simultaneously', 'infer', 'the', 'true', 'labels', 'and', 'train', 'the', 'deep', 'learning', 'model', 'in', 'order', 'to', 'reach', 'an', 'optimal', 'learning', 'efficacy', 'finally', 'our', 'framework', 'exploits', 'the', 'uncertainty', 'of', 'the', 'deep', 'learning', 'model', 'during', 'prediction', 'as', 'well', 'as', 'the', 'annotators', 'estimated', 'expertise', 'to', 'minimize', 'the', 'number', 'of', 'required', 'annotations', 'and', 'annotators', 'for', 'optimally', 'training', 'the', 'deep', 'learning', 'model', 'we', 'evaluate', 'the', 'effectiveness', 'of', 'our', 'framework', 'for', 'intent', 'classification', 'in', 'alexa', 'amazons', 'personal', 'assistant', 'using', 'both', 'synthetic', 'and', 'realworld', 'datasets', 'experiments', 'show', 'that', 'our', 'framework', 'can', 'accurately', 'learn', 'annotator', 'expertise', 'infer', 'true', 'labels', 'and', 'effectively', 'reduce', 'the', 'amount', 'of', 'annotations', 'in', 'model', 'training', 'as', 'compared', 'to', 'stateoftheart', 'approaches', 'we', 'further', 'discuss', 'the', 'potential', 'of', 'our', 'proposed', 'framework', 'in', 'bridging', 'machine', 'learning', 'and', 'crowdsourcing', 'towards', 'improved', 'humanintheloop', 'systems']]
|
[0.04683528120437878, -0.04451823250363296, -0.04082910523696415, 0.07707274256833344, -0.17548943602181435, -0.1770783810069758, 0.09914591880437236, 0.44418000874140756, -0.28615359312957195, -0.4245191628122301, 0.00909125489020123, -0.26907362956018965, -0.19776167401945904, 0.14248890923247026, -0.16972554128911882, 0.0898442083555296, 0.15213068251600534, 0.04564731064699278, -0.01782051141654547, -0.28851970110832753, 0.2905296280313925, 0.04975990114472339, 0.36912202161767976, 0.010999452736023724, 0.13638389224418257, -0.010178155453461245, -0.05357978283316253, -0.035385110142025826, -0.0476623042824296, 0.23757044332765898, 0.3856419188329175, 0.26782116140617707, 0.40932813754782044, -0.41113570302782765, -0.23828731100498277, 0.07167505924188884, 0.14739805207315956, 0.13741082934063634, -0.01703697276350699, -0.40690909388461755, 0.07156826989919073, -0.2077209597907996, 0.017298355776567065, -0.19494353523745278, -0.07542905879639196, -0.03607181187843877, -0.34304687235550063, 0.01916415079354206, 0.04893949556049699, 0.0601807064755539, -0.08481566668332122, -0.0991411742377741, 0.043009544788463194, 0.2186655180337148, 0.061405205225759145, 0.05620104243809527, 0.1521869898586017, -0.21331652308644758, -0.15952649476389852, 0.32585880656740024, -0.03313978006990858, -0.1877133007346247, 0.19635347373400364, -0.0016586633408041092, -0.1555129670672805, 0.0843275038817336, 0.2825550116622558, 0.12815591539467938, -0.1842319061960156, 0.016776779192248046, -0.048390368097706846, 0.20678101501173593, -0.027661574611765594, -0.06362101535923316, 0.18346704751850243, 0.28145394277754443, -0.022671089602331298, 0.12563213610990445, -0.11583287022232511, -0.07316334342860291, -0.22187344234188325, -0.08133112238363573, -0.21485723889071903, -0.041594343095055324, -0.10245635146092742, -0.11133230632692119, 0.35486500531559784, 0.32127637847250945, 0.20159894542358636, 0.15391873725763472, 0.371339612969634, -0.028965775658260657, 0.1050044181845797, 0.10655572201887314, 0.18684652136442692, -0.006859677459411858, 0.12140758813833138, -0.17932244796421754, 0.12281480937768398, 0.005432035038737874]
|
1,803.04224
|
Calder\'on's Inverse Problem with a Finite Number of Measurements
|
We prove that an $L^\infty$ potential in the Schr\"odinger equation in three
and higher dimensions can be uniquely determined from a finite number of
boundary measurements, provided it belongs to a known finite dimensional
subspace $\mathcal W$. As a corollary, we obtain a similar result for
Calder\'on's inverse conductivity problem. Lipschitz stability estimates and a
globally convergent nonlinear reconstruction algorithm for both inverse
problems are also presented. These are the first results on global uniqueness,
stability and reconstruction for nonlinear inverse boundary value problems with
finitely many measurements. We also discuss a few relevant examples of finite
dimensional subspaces $\mathcal W$, including bandlimited and piecewise
constant potentials, and explicitly compute the number of required measurements
as a function of $\dim \mathcal W$.
|
math.AP
|
we prove that an linfty potential in the schrodinger equation in three and higher dimensions can be uniquely determined from a finite number of boundary measurements provided it belongs to a known finite dimensional subspace mathcal w as a corollary we obtain a similar result for calderons inverse conductivity problem lipschitz stability estimates and a globally convergent nonlinear reconstruction algorithm for both inverse problems are also presented these are the first results on global uniqueness stability and reconstruction for nonlinear inverse boundary value problems with finitely many measurements we also discuss a few relevant examples of finite dimensional subspaces mathcal w including bandlimited and piecewise constant potentials and explicitly compute the number of required measurements as a function of dim mathcal w
|
[['we', 'prove', 'that', 'an', 'linfty', 'potential', 'in', 'the', 'schrodinger', 'equation', 'in', 'three', 'and', 'higher', 'dimensions', 'can', 'be', 'uniquely', 'determined', 'from', 'a', 'finite', 'number', 'of', 'boundary', 'measurements', 'provided', 'it', 'belongs', 'to', 'a', 'known', 'finite', 'dimensional', 'subspace', 'mathcal', 'w', 'as', 'a', 'corollary', 'we', 'obtain', 'a', 'similar', 'result', 'for', 'calderons', 'inverse', 'conductivity', 'problem', 'lipschitz', 'stability', 'estimates', 'and', 'a', 'globally', 'convergent', 'nonlinear', 'reconstruction', 'algorithm', 'for', 'both', 'inverse', 'problems', 'are', 'also', 'presented', 'these', 'are', 'the', 'first', 'results', 'on', 'global', 'uniqueness', 'stability', 'and', 'reconstruction', 'for', 'nonlinear', 'inverse', 'boundary', 'value', 'problems', 'with', 'finitely', 'many', 'measurements', 'we', 'also', 'discuss', 'a', 'few', 'relevant', 'examples', 'of', 'finite', 'dimensional', 'subspaces', 'mathcal', 'w', 'including', 'bandlimited', 'and', 'piecewise', 'constant', 'potentials', 'and', 'explicitly', 'compute', 'the', 'number', 'of', 'required', 'measurements', 'as', 'a', 'function', 'of', 'dim', 'mathcal', 'w']]
|
[-0.09329612823355882, 0.09726561094573642, -0.022554779444347885, 0.057517102625617975, -0.07046896214673265, -0.15997771118370602, -0.02145827566888985, 0.3557490832439517, -0.34947185320627006, -0.21956534309648587, 0.17435060819080406, -0.28536996717915913, -0.13704194170690034, 0.24306425338488866, -0.05897705769929729, 0.13895969228727406, 0.07298964455334439, 0.06076521471860345, -0.11723276667896139, -0.2501485761508849, 0.3205200186777921, -0.06022038000070902, 0.21288957055963453, 0.05780154482659991, 0.12438999395435829, -0.013483352748272543, -0.016162162493975438, 0.054553903000940734, -0.17620764091091096, 0.07277431491510485, 0.26878747038283674, 0.07700860548619425, 0.27507348277712945, -0.35614304485746096, -0.20190381900727994, 0.164239559060184, 0.14659126193003089, 0.07232820750290497, -0.07478345779331828, -0.2515608731458788, 0.114562835242813, -0.11631417419707983, -0.15710783158963332, -0.11138639432668197, 0.04544144988701236, 0.01574949298786824, -0.33887219293134624, 0.10141849593349091, 0.05757524397941764, 0.023585837899295033, -0.15995279420167208, -0.11258951745942601, -0.037977196341075124, 0.0694005999095799, -0.0009488486837534631, 0.027839581512647572, 0.04650795983043728, -0.10021491005377878, -0.10648318722349835, 0.3450131879462937, -0.0781436685613952, -0.27469450881638846, 0.18275324259808318, -0.14248674692439114, -0.13059842304067046, 0.11344226730651542, 0.17297257489303403, 0.18304812704732062, -0.09605550969050067, 0.1789234654847189, -0.08318916119856486, 0.12096739572198054, 0.07427805185043176, 0.027687518120758602, 0.06641716566547508, 0.10527380126085682, 0.14884923000535621, 0.13891114032594487, -0.012353104011052609, 0.0052703964623210375, -0.39015452508799364, -0.1305950519334922, -0.19174121858429957, 0.09857738158115964, -0.13883325724696005, -0.1950114167707621, 0.3722476100579637, 0.09584104092925268, 0.21880394266154923, 0.08230776234804729, 0.24625075764221246, 0.16783423944601605, -0.012301276290987725, 0.0816852996721253, 0.16838481328373806, 0.19535974543121812, 0.043393585414885257, -0.18704609213526682, -0.015100524641027614, 0.1652728305350928]
|
1,803.04225
|
Analyzing the network structure and gender differences among the members
of the Networked Knowledge Organization Systems (NKOS) community
|
In this paper, we analyze a major part of the research output of the
Networked Knowledge Organization Systems (NKOS) community in the period 2000 to
2016 from a network analytical perspective. We focus on the papers presented at
the European and U.S. NKOS workshops and in addition four special issues on
NKOS in the last 16 years. For this purpose, we have generated an open dataset,
the "NKOS bibliography" which covers the bibliographic information of the
research output. We analyze the co-authorship network of this community which
results in 123 papers with a sum of 256 distinct authors. We use standard
network analytic measures such as degree, betweenness and closeness centrality
to describe the co-authorship network of the NKOS dataset. First, we
investigate global properties of the network over time. Second, we analyze the
centrality of the authors in the NKOS network. Lastly, we investigate gender
differences in collaboration behavior in this community. Our results show that
apart from differences in centrality measures of the scholars, they have higher
tendency to collaborate with those in the same institution or the same
geographic proximity. We also find that homophily is higher among women in this
community. Apart from small differences in closeness and clustering among men
and women, we do not find any significant dissimilarities with respect to other
centralities.
|
cs.SI cs.DL
|
in this paper we analyze a major part of the research output of the networked knowledge organization systems nkos community in the period 2000 to 2016 from a network analytical perspective we focus on the papers presented at the european and us nkos workshops and in addition four special issues on nkos in the last 16 years for this purpose we have generated an open dataset the nkos bibliography which covers the bibliographic information of the research output we analyze the coauthorship network of this community which results in 123 papers with a sum of 256 distinct authors we use standard network analytic measures such as degree betweenness and closeness centrality to describe the coauthorship network of the nkos dataset first we investigate global properties of the network over time second we analyze the centrality of the authors in the nkos network lastly we investigate gender differences in collaboration behavior in this community our results show that apart from differences in centrality measures of the scholars they have higher tendency to collaborate with those in the same institution or the same geographic proximity we also find that homophily is higher among women in this community apart from small differences in closeness and clustering among men and women we do not find any significant dissimilarities with respect to other centralities
|
[['in', 'this', 'paper', 'we', 'analyze', 'a', 'major', 'part', 'of', 'the', 'research', 'output', 'of', 'the', 'networked', 'knowledge', 'organization', 'systems', 'nkos', 'community', 'in', 'the', 'period', '2000', 'to', '2016', 'from', 'a', 'network', 'analytical', 'perspective', 'we', 'focus', 'on', 'the', 'papers', 'presented', 'at', 'the', 'european', 'and', 'us', 'nkos', 'workshops', 'and', 'in', 'addition', 'four', 'special', 'issues', 'on', 'nkos', 'in', 'the', 'last', '16', 'years', 'for', 'this', 'purpose', 'we', 'have', 'generated', 'an', 'open', 'dataset', 'the', 'nkos', 'bibliography', 'which', 'covers', 'the', 'bibliographic', 'information', 'of', 'the', 'research', 'output', 'we', 'analyze', 'the', 'coauthorship', 'network', 'of', 'this', 'community', 'which', 'results', 'in', '123', 'papers', 'with', 'a', 'sum', 'of', '256', 'distinct', 'authors', 'we', 'use', 'standard', 'network', 'analytic', 'measures', 'such', 'as', 'degree', 'betweenness', 'and', 'closeness', 'centrality', 'to', 'describe', 'the', 'coauthorship', 'network', 'of', 'the', 'nkos', 'dataset', 'first', 'we', 'investigate', 'global', 'properties', 'of', 'the', 'network', 'over', 'time', 'second', 'we', 'analyze', 'the', 'centrality', 'of', 'the', 'authors', 'in', 'the', 'nkos', 'network', 'lastly', 'we', 'investigate', 'gender', 'differences', 'in', 'collaboration', 'behavior', 'in', 'this', 'community', 'our', 'results', 'show', 'that', 'apart', 'from', 'differences', 'in', 'centrality', 'measures', 'of', 'the', 'scholars', 'they', 'have', 'higher', 'tendency', 'to', 'collaborate', 'with', 'those', 'in', 'the', 'same', 'institution', 'or', 'the', 'same', 'geographic', 'proximity', 'we', 'also', 'find', 'that', 'homophily', 'is', 'higher', 'among', 'women', 'in', 'this', 'community', 'apart', 'from', 'small', 'differences', 'in', 'closeness', 'and', 'clustering', 'among', 'men', 'and', 'women', 'we', 'do', 'not', 'find', 'any', 'significant', 'dissimilarities', 'with', 'respect', 'to', 'other', 'centralities']]
|
[-0.10338966279571289, 0.031787813388698384, -0.06706584929637441, 0.08020000207582362, -0.07464867505376742, -0.059150793781019236, 0.06445469115977707, 0.4063390679104619, -0.22864670049373623, -0.344176570178152, 0.041127097226262566, -0.34677547521008917, -0.18352519708991766, 0.13221438638770264, -0.09686551873729518, -0.009015471323661199, 0.09180105081068343, 0.08864283563194958, -0.042521568049770274, -0.3018580264811612, 0.34932142355772733, 0.0644397891119131, 0.3025563405592794, 0.07693823921328334, 0.038201802878504505, -0.021192728220719045, -0.10693400252472766, 0.05171045768882688, -0.1511473963465717, 0.16411909444648856, 0.3124347699840115, 0.181604738863925, 0.3417086066873787, -0.37277332752875, -0.1540968377700237, 0.115201790485378, 0.09630266020869725, 0.09905619490583381, 0.016509694649017158, -0.2968732396323557, 0.0789261911628921, -0.23202541575254926, -0.068232165100946, -0.024568326093498873, 0.03789409435222342, 0.04842369402035833, -0.16876511415646073, 0.05722265487595793, 0.020727968828425185, 0.13845215246004805, -0.028217119403974446, -0.1508408769599447, -0.0029912646445254347, 0.2099178622776566, 0.07748625560910292, 0.008480906732631294, 0.08063885738932822, -0.120744776984328, -0.17393979542892954, 0.35800089762911846, -0.036924846639397414, -0.13362535446048734, 0.1931875097008792, -0.16116629336263186, -0.2247342759356345, 0.015220134032647801, 0.26189774824689105, 0.06585351334561564, -0.16845462255639165, -0.00912747502068619, -0.07556963554842899, 0.16334833675670143, 0.09462410050707967, 0.004668462205014817, 0.14272341995444743, 0.17100606233170723, 0.06221662271665792, 0.12086490901653786, -0.06893383524248793, -0.10303443656770776, -0.23770132092716487, -0.1361088336096677, -0.15234665897649344, -0.008021625978210366, -0.0891480243022072, -0.11122660497926413, 0.48402696684615254, 0.18898165797108793, 0.17721468441775196, 0.04113364904974354, 0.2256013451295067, 0.0040233780345007705, 0.0852582887106508, 0.11209792994307227, 0.2288982667949595, 0.05688341141074522, 0.18946073299271723, -0.1353870868412023, 0.07659062072124383, 0.011786480060008835]
|
1,803.04226
|
Qualitative properties of positive singular solutions to nonlinear
elliptic systems with critical exponent
|
We studied the asymptotic behavior of local solutions for strongly coupled
critical elliptic systems near an isolated singularity. For the dimension less
than or equal to five we prove that any singular solution is asymptotic to a
rotationally symmetric Fowler type solution. This result generalizes the
celebrated work due to Caffarelli, Gidas, and Spruck [1] who studied asymptotic
proprieties to the classic Yamabe equation. In addition, we generalize similar
results by Marques [11] for inhomogeneous context, that is, when the metric is
not necessarily conformally flat.
|
math.AP
|
we studied the asymptotic behavior of local solutions for strongly coupled critical elliptic systems near an isolated singularity for the dimension less than or equal to five we prove that any singular solution is asymptotic to a rotationally symmetric fowler type solution this result generalizes the celebrated work due to caffarelli gidas and spruck 1 who studied asymptotic proprieties to the classic yamabe equation in addition we generalize similar results by marques 11 for inhomogeneous context that is when the metric is not necessarily conformally flat
|
[['we', 'studied', 'the', 'asymptotic', 'behavior', 'of', 'local', 'solutions', 'for', 'strongly', 'coupled', 'critical', 'elliptic', 'systems', 'near', 'an', 'isolated', 'singularity', 'for', 'the', 'dimension', 'less', 'than', 'or', 'equal', 'to', 'five', 'we', 'prove', 'that', 'any', 'singular', 'solution', 'is', 'asymptotic', 'to', 'a', 'rotationally', 'symmetric', 'fowler', 'type', 'solution', 'this', 'result', 'generalizes', 'the', 'celebrated', 'work', 'due', 'to', 'caffarelli', 'gidas', 'and', 'spruck', '1', 'who', 'studied', 'asymptotic', 'proprieties', 'to', 'the', 'classic', 'yamabe', 'equation', 'in', 'addition', 'we', 'generalize', 'similar', 'results', 'by', 'marques', '11', 'for', 'inhomogeneous', 'context', 'that', 'is', 'when', 'the', 'metric', 'is', 'not', 'necessarily', 'conformally', 'flat']]
|
[-0.1271791152417833, 0.035635695889014156, -0.09316156357310193, 0.08678751457536724, -0.09696306287700873, -0.1936190445679998, -0.047288407311709815, 0.27189977990252207, -0.1975493420153683, -0.21592785520235422, 0.1365162009078208, -0.3275447589193666, -0.1739732175009585, 0.16621487465589632, -0.14659990381102922, 0.04269017387982891, 0.0087436179814557, 0.044982660431848016, -0.07829285670764917, -0.27108585619540926, 0.39943187399009283, 0.006842428634246421, 0.2641176929004317, 0.05192564028521003, 0.025006555692227775, 0.007500000704800017, 0.00973412645764129, 0.04379777948718604, -0.21744057949348813, 0.06969399934602079, 0.23320684885216314, 0.013204266146626757, 0.24219942017090182, -0.35373696850526126, -0.2116984255492774, 0.16701859952665346, 0.17879208585593936, 0.09607620543914003, -0.020638232762373032, -0.2799815745471955, 0.1668459715938932, -0.12009175752051347, -0.2668551676419325, -0.04140821308558157, 0.02867789194529313, -0.01266865958838702, -0.24565853016602612, 0.10630834278065798, 0.16903160475627627, 0.011476460833449003, -0.133574110553275, -0.06882685471087867, 0.00037351704397520355, 0.020149830263446432, 0.06485043534722049, 0.048039181282483905, 0.03542348784719442, -0.08648262019973076, -0.09905911281943149, 0.3130861713610546, -0.09152628602490484, -0.23927042178733837, 0.1875572191594645, -0.13506053546226995, -0.12648905014489278, 0.10557527983084668, 0.10408920046960025, 0.21393778727952997, -0.14177664970457257, 0.13494006926830057, -0.058977809063223904, 0.10974866421324699, 0.15316911017912072, -0.027905696938030942, 0.07091688418890847, 0.06826503338633365, 0.12539330506047539, 0.12177423192025703, 0.038849278526423975, -0.1391497975117852, -0.26800587660698005, -0.1700209496004052, -0.1692618538712173, 0.1758451613972876, -0.0971910078293403, -0.16412165833550485, 0.3458449798477083, 0.07352906226202152, 0.14737381947465067, 0.08799890801039806, 0.2180597343871933, 0.1144420096953941, -0.013143638506271812, 0.15839731122020545, 0.23772558617015738, 0.16063250936730222, 0.12074030067251865, -0.18465737093694853, 0.0012295748334551274, 0.1654235978264275]
|
1,803.04227
|
Flavor SU(3) Topological Diagram and Irreducible Representation
Amplitudes for Heavy Meson Charmless Hadronic Decays: Mismatch and
Equivalence
|
Flavor SU(3) analysis of heavy meson ($B$ and $D$) hadronic charmless decays
can be formulated in two different ways. One is to construct the SU(3)
irreducible representation amplitude (IRA) by decomposing effective Hamiltonian
according to the SU(3) transformation properties. The other is to use the
topological diagrams (TDA). These two methods should give equivalent physical
results in the SU(3) limit. Using $B \to PP$ decays as an example, we point out
that previous analyses in the literature using these two methods do not match
consistently in several ways, in particular a few SU(3) independent amplitudes
have been overlooked in the TDA approach. Taking these new amplitudes into
account, we find a consistent description in both schemes. These new amplitudes
can affect direct CP asymmetries in some channels significantly. A consequence
is that for any charmless hadronic decay of heavy meson, the direct CP symmetry
cannot be identically zero.
|
hep-ph hep-ex
|
flavor su3 analysis of heavy meson b and d hadronic charmless decays can be formulated in two different ways one is to construct the su3 irreducible representation amplitude ira by decomposing effective hamiltonian according to the su3 transformation properties the other is to use the topological diagrams tda these two methods should give equivalent physical results in the su3 limit using b to pp decays as an example we point out that previous analyses in the literature using these two methods do not match consistently in several ways in particular a few su3 independent amplitudes have been overlooked in the tda approach taking these new amplitudes into account we find a consistent description in both schemes these new amplitudes can affect direct cp asymmetries in some channels significantly a consequence is that for any charmless hadronic decay of heavy meson the direct cp symmetry cannot be identically zero
|
[['flavor', 'su3', 'analysis', 'of', 'heavy', 'meson', 'b', 'and', 'd', 'hadronic', 'charmless', 'decays', 'can', 'be', 'formulated', 'in', 'two', 'different', 'ways', 'one', 'is', 'to', 'construct', 'the', 'su3', 'irreducible', 'representation', 'amplitude', 'ira', 'by', 'decomposing', 'effective', 'hamiltonian', 'according', 'to', 'the', 'su3', 'transformation', 'properties', 'the', 'other', 'is', 'to', 'use', 'the', 'topological', 'diagrams', 'tda', 'these', 'two', 'methods', 'should', 'give', 'equivalent', 'physical', 'results', 'in', 'the', 'su3', 'limit', 'using', 'b', 'to', 'pp', 'decays', 'as', 'an', 'example', 'we', 'point', 'out', 'that', 'previous', 'analyses', 'in', 'the', 'literature', 'using', 'these', 'two', 'methods', 'do', 'not', 'match', 'consistently', 'in', 'several', 'ways', 'in', 'particular', 'a', 'few', 'su3', 'independent', 'amplitudes', 'have', 'been', 'overlooked', 'in', 'the', 'tda', 'approach', 'taking', 'these', 'new', 'amplitudes', 'into', 'account', 'we', 'find', 'a', 'consistent', 'description', 'in', 'both', 'schemes', 'these', 'new', 'amplitudes', 'can', 'affect', 'direct', 'cp', 'asymmetries', 'in', 'some', 'channels', 'significantly', 'a', 'consequence', 'is', 'that', 'for', 'any', 'charmless', 'hadronic', 'decay', 'of', 'heavy', 'meson', 'the', 'direct', 'cp', 'symmetry', 'can', 'not', 'be', 'identically', 'zero']]
|
[-0.09991255546951254, 0.20407723286745824, -0.14675489955600476, 0.12047109071824749, -0.08393333566018799, -0.1326063851350856, 0.05476065965888134, 0.3695913444651328, -0.21655953815831935, -0.21714098375578156, 0.030963055766031346, -0.26307037080819373, -0.08999982146208718, 0.13778639001531165, 0.032040900097622366, 0.05805339045422589, 0.06473937256796122, 0.01461094775980951, -0.1097194041350494, -0.2416961945205827, 0.27480018378904203, -0.08774830894107187, 0.25646225568032105, 0.07933264947340092, -0.040912345992463746, 0.010237258002662019, -0.08722192540314773, 0.009604974622842497, -0.09179994505535165, 0.05210068229360868, 0.25024791256893403, 0.1025441848202089, 0.12614440613882555, -0.40685675433218077, -0.17609334414849845, 0.14714184097458152, 0.2348160764746268, 0.15854863584941667, 0.0011356848935852916, -0.3059176863014898, 0.10955678339697571, -0.20451167687748703, -0.09263487888075062, -0.16077490525332674, -0.007674405185643258, -0.07282123468416249, -0.28313164363596466, 0.04516931736420183, -0.001496152708544427, 0.0322000021802499, -0.018811854055688887, -0.2330586252964161, -0.002440508058132141, 0.1094453359028987, 0.1061399445694015, 0.053879200705895886, 0.09853000874199823, -0.10631441937809523, -0.17599982588595692, 0.4186304531157042, -0.0607757386470201, -0.22568499186895039, 0.18051087882075983, -0.12208345453348636, -0.22314304969079743, 0.1399816366650114, 0.16627746673875907, 0.05398831514004093, -0.20654028060302237, 0.11547097766220307, -0.05316204078895534, 0.13437792226369805, 0.050952260795005616, 0.07973618499212742, 0.20812468224473848, 0.1062304947772157, -0.01447430157083893, 0.07609552596015981, -0.03143920613477794, -0.09842280961023081, -0.36518584760906014, -0.11198133752437546, -0.09538400325699141, 0.06870321937365576, -0.08838625075778027, -0.0907527082849719, 0.3827201381463232, 0.10307043283590234, 0.22610308061218695, -0.018710224639199323, 0.3127979237098722, 0.11159836362669207, 0.06721093999487567, 0.048772670850532766, 0.28391318864305504, 0.1821002858775299, 0.08383131945730755, -0.2437836488571343, 0.02150755772842157, 0.11225654128876408]
|
1,803.04228
|
Omnidirectional CNN for Visual Place Recognition and Navigation
|
$ $Visual place recognition is challenging, especially when only a few place
exemplars are given. To mitigate the challenge, we consider place recognition
method using omnidirectional cameras and propose a novel Omnidirectional
Convolutional Neural Network (O-CNN) to handle severe camera pose variation.
Given a visual input, the task of the O-CNN is not to retrieve the matched
place exemplar, but to retrieve the closest place exemplar and estimate the
relative distance between the input and the closest place. With the ability to
estimate relative distance, a heuristic policy is proposed to navigate a robot
to the retrieved closest place. Note that the network is designed to take
advantage of the omnidirectional view by incorporating circular padding and
rotation invariance. To train a powerful O-CNN, we build a virtual world for
training on a large scale. We also propose a continuous lifted structured
feature embedding loss to learn the concept of distance efficiently. Finally,
our experimental results confirm that our method achieves state-of-the-art
accuracy and speed with both the virtual world and real-world datasets.
|
cs.CV eess.IV
|
visual place recognition is challenging especially when only a few place exemplars are given to mitigate the challenge we consider place recognition method using omnidirectional cameras and propose a novel omnidirectional convolutional neural network ocnn to handle severe camera pose variation given a visual input the task of the ocnn is not to retrieve the matched place exemplar but to retrieve the closest place exemplar and estimate the relative distance between the input and the closest place with the ability to estimate relative distance a heuristic policy is proposed to navigate a robot to the retrieved closest place note that the network is designed to take advantage of the omnidirectional view by incorporating circular padding and rotation invariance to train a powerful ocnn we build a virtual world for training on a large scale we also propose a continuous lifted structured feature embedding loss to learn the concept of distance efficiently finally our experimental results confirm that our method achieves stateoftheart accuracy and speed with both the virtual world and realworld datasets
|
[['visual', 'place', 'recognition', 'is', 'challenging', 'especially', 'when', 'only', 'a', 'few', 'place', 'exemplars', 'are', 'given', 'to', 'mitigate', 'the', 'challenge', 'we', 'consider', 'place', 'recognition', 'method', 'using', 'omnidirectional', 'cameras', 'and', 'propose', 'a', 'novel', 'omnidirectional', 'convolutional', 'neural', 'network', 'ocnn', 'to', 'handle', 'severe', 'camera', 'pose', 'variation', 'given', 'a', 'visual', 'input', 'the', 'task', 'of', 'the', 'ocnn', 'is', 'not', 'to', 'retrieve', 'the', 'matched', 'place', 'exemplar', 'but', 'to', 'retrieve', 'the', 'closest', 'place', 'exemplar', 'and', 'estimate', 'the', 'relative', 'distance', 'between', 'the', 'input', 'and', 'the', 'closest', 'place', 'with', 'the', 'ability', 'to', 'estimate', 'relative', 'distance', 'a', 'heuristic', 'policy', 'is', 'proposed', 'to', 'navigate', 'a', 'robot', 'to', 'the', 'retrieved', 'closest', 'place', 'note', 'that', 'the', 'network', 'is', 'designed', 'to', 'take', 'advantage', 'of', 'the', 'omnidirectional', 'view', 'by', 'incorporating', 'circular', 'padding', 'and', 'rotation', 'invariance', 'to', 'train', 'a', 'powerful', 'ocnn', 'we', 'build', 'a', 'virtual', 'world', 'for', 'training', 'on', 'a', 'large', 'scale', 'we', 'also', 'propose', 'a', 'continuous', 'lifted', 'structured', 'feature', 'embedding', 'loss', 'to', 'learn', 'the', 'concept', 'of', 'distance', 'efficiently', 'finally', 'our', 'experimental', 'results', 'confirm', 'that', 'our', 'method', 'achieves', 'stateoftheart', 'accuracy', 'and', 'speed', 'with', 'both', 'the', 'virtual', 'world', 'and', 'realworld', 'datasets']]
|
[-0.06527204170747292, -0.010279107370500475, -0.07854076341974961, 0.07494984557148242, -0.16943002828846274, -0.17996505772942667, 0.0534623421696123, 0.4583572993098303, -0.27836358456244303, -0.3673487576212041, 0.060866976728078066, -0.23732654995496147, -0.18056681854880502, 0.17680347817110678, -0.15638996717698742, 0.05372712236347197, 0.13066414298847057, 0.07669785822914957, -0.05780328746728036, -0.2603869644971023, 0.26433076062320926, 0.03396127481814907, 0.32154664354463824, 0.02899082198056804, 0.1913458032636405, -0.012318282772591987, -0.018966500143802096, -0.012134584331909346, -0.03576713526964277, 0.1891440822862002, 0.26833316314895095, 0.17657791312816445, 0.2863358447848018, -0.4020349730325993, -0.2092908958073294, 0.08359647228458333, 0.10032904743613556, 0.11025724182425535, -0.039476532480262526, -0.36860619523822397, 0.09257456108380846, -0.13918727943890316, -0.036842101421592985, -0.09053972185126419, 0.01062341231235498, -0.04342039554856371, -0.3002927500462203, -0.023419983361659538, 0.036299675134931784, 0.01573069674385235, -0.05397077648207372, -0.04822469221530915, 0.029433974933940486, 0.22193527990240783, 0.0060483339468699465, 0.1051121323131198, 0.14964417061432764, -0.12968864942207758, -0.09501881639711386, 0.4175511390663857, -0.03547755819048223, -0.19828137274030164, 0.20843059741783626, -0.07261779936582803, -0.11089314598871698, 0.11834673541273143, 0.29313219262444046, 0.10601898935504345, -0.1358038351406935, -0.008535453073712888, -0.054215491781834255, 0.2156448979039005, 0.07610677957377765, -0.013133399252225455, 0.1813503591706543, 0.22998323736490336, 0.05894484520966978, 0.15663637965511487, -0.20588660991593632, -0.07999597232501823, -0.20306504097074096, -0.082865149789858, -0.22279855099284676, -0.027445103197414725, -0.10922482936743912, -0.13529779507650325, 0.35782938526921665, 0.2732578879141054, 0.2660981953593491, 0.13565870694447915, 0.3800913761369884, 0.0303044467798954, 0.12230451078544002, 0.08706475991916811, 0.22034084513041646, 0.00029999699015820095, 0.11544404706280126, -0.16921911967192713, 0.07665545143306168, 0.07130900514312088]
|
1,803.04229
|
Asymptotic theory of gravity modes in rotating stars II. Impact of
general differential rotation
|
Context. Differential rotation has a strong influence on stellar internal
dynamics and evolution, notably by triggering hydrodynamical instabilities, by
interacting with the magnetic field, and more generally by inducing transport
of angular momentum and chemical elements. Moreover, it modifies the way waves
propagate in stellar interiors and thus the frequency spectrum of these waves,
the regions they probe, and the transport they generate.
Aims. We investigate the impact of a general differential rotation (both in
radius and latitude) on the propagation of axisymmetric gravito-inertial waves.
Methods. We use a small-wavelength approximation to obtain a local dispersion
relation for these waves. We then describe the propagation of waves thanks to a
ray model that follows a Hamiltonian formalism. Finally, we numerically probe
the properties of these gravito-inertial rays for different regimes of radial
and latitudinal differential rotation.
Results. We derive a local dispersion relation that includes the effect of a
general differential rotation. Subsequently, considering a polytropic stellar
model, we observe that differential rotation allows for a large variety of
resonant cavities that can be probed by gravito-inertial waves. We identify
that for some regimes of frequency and differential rotation, the properties of
gravito-inertial rays are similar to those found in the uniformly rotating
case. Furthermore, we also find new regimes specific to differential rotation,
where the dynamics of rays is chaotic.
Conclusions. As a consequence, we expect modes to follow the same trend. Some
parts of oscillation spectra corresponding to regimes similar to those of the
uniformly rotating case would exhibit regular patterns, while parts
corresponding to the new regimes would be mostly constituted of chaotic modes
with a spectrum rather characterised by a generic statistical distribution.
|
astro-ph.SR
|
context differential rotation has a strong influence on stellar internal dynamics and evolution notably by triggering hydrodynamical instabilities by interacting with the magnetic field and more generally by inducing transport of angular momentum and chemical elements moreover it modifies the way waves propagate in stellar interiors and thus the frequency spectrum of these waves the regions they probe and the transport they generate aims we investigate the impact of a general differential rotation both in radius and latitude on the propagation of axisymmetric gravitoinertial waves methods we use a smallwavelength approximation to obtain a local dispersion relation for these waves we then describe the propagation of waves thanks to a ray model that follows a hamiltonian formalism finally we numerically probe the properties of these gravitoinertial rays for different regimes of radial and latitudinal differential rotation results we derive a local dispersion relation that includes the effect of a general differential rotation subsequently considering a polytropic stellar model we observe that differential rotation allows for a large variety of resonant cavities that can be probed by gravitoinertial waves we identify that for some regimes of frequency and differential rotation the properties of gravitoinertial rays are similar to those found in the uniformly rotating case furthermore we also find new regimes specific to differential rotation where the dynamics of rays is chaotic conclusions as a consequence we expect modes to follow the same trend some parts of oscillation spectra corresponding to regimes similar to those of the uniformly rotating case would exhibit regular patterns while parts corresponding to the new regimes would be mostly constituted of chaotic modes with a spectrum rather characterised by a generic statistical distribution
|
[['context', 'differential', 'rotation', 'has', 'a', 'strong', 'influence', 'on', 'stellar', 'internal', 'dynamics', 'and', 'evolution', 'notably', 'by', 'triggering', 'hydrodynamical', 'instabilities', 'by', 'interacting', 'with', 'the', 'magnetic', 'field', 'and', 'more', 'generally', 'by', 'inducing', 'transport', 'of', 'angular', 'momentum', 'and', 'chemical', 'elements', 'moreover', 'it', 'modifies', 'the', 'way', 'waves', 'propagate', 'in', 'stellar', 'interiors', 'and', 'thus', 'the', 'frequency', 'spectrum', 'of', 'these', 'waves', 'the', 'regions', 'they', 'probe', 'and', 'the', 'transport', 'they', 'generate', 'aims', 'we', 'investigate', 'the', 'impact', 'of', 'a', 'general', 'differential', 'rotation', 'both', 'in', 'radius', 'and', 'latitude', 'on', 'the', 'propagation', 'of', 'axisymmetric', 'gravitoinertial', 'waves', 'methods', 'we', 'use', 'a', 'smallwavelength', 'approximation', 'to', 'obtain', 'a', 'local', 'dispersion', 'relation', 'for', 'these', 'waves', 'we', 'then', 'describe', 'the', 'propagation', 'of', 'waves', 'thanks', 'to', 'a', 'ray', 'model', 'that', 'follows', 'a', 'hamiltonian', 'formalism', 'finally', 'we', 'numerically', 'probe', 'the', 'properties', 'of', 'these', 'gravitoinertial', 'rays', 'for', 'different', 'regimes', 'of', 'radial', 'and', 'latitudinal', 'differential', 'rotation', 'results', 'we', 'derive', 'a', 'local', 'dispersion', 'relation', 'that', 'includes', 'the', 'effect', 'of', 'a', 'general', 'differential', 'rotation', 'subsequently', 'considering', 'a', 'polytropic', 'stellar', 'model', 'we', 'observe', 'that', 'differential', 'rotation', 'allows', 'for', 'a', 'large', 'variety', 'of', 'resonant', 'cavities', 'that', 'can', 'be', 'probed', 'by', 'gravitoinertial', 'waves', 'we', 'identify', 'that', 'for', 'some', 'regimes', 'of', 'frequency', 'and', 'differential', 'rotation', 'the', 'properties', 'of', 'gravitoinertial', 'rays', 'are', 'similar', 'to', 'those', 'found', 'in', 'the', 'uniformly', 'rotating', 'case', 'furthermore', 'we', 'also', 'find', 'new', 'regimes', 'specific', 'to', 'differential', 'rotation', 'where', 'the', 'dynamics', 'of', 'rays', 'is', 'chaotic', 'conclusions', 'as', 'a', 'consequence', 'we', 'expect', 'modes', 'to', 'follow', 'the', 'same', 'trend', 'some', 'parts', 'of', 'oscillation', 'spectra', 'corresponding', 'to', 'regimes', 'similar', 'to', 'those', 'of', 'the', 'uniformly', 'rotating', 'case', 'would', 'exhibit', 'regular', 'patterns', 'while', 'parts', 'corresponding', 'to', 'the', 'new', 'regimes', 'would', 'be', 'mostly', 'constituted', 'of', 'chaotic', 'modes', 'with', 'a', 'spectrum', 'rather', 'characterised', 'by', 'a', 'generic', 'statistical', 'distribution']]
|
[-0.14952579669323196, 0.17578258887454465, -0.11640969463556816, 0.10223516640345826, -0.09491908197738365, -0.06525912854504445, 0.004102975660884612, 0.34866420856411384, -0.2827816637500193, -0.29458954785059505, 0.05098107775937201, -0.25743553396874397, -0.12698960517254063, 0.2378426063965522, 0.0005202117486981278, 0.01835816065252957, 0.0277753002741559, -0.019633872948909708, -0.05282271597922119, -0.1525222367526365, 0.3454222674565625, 0.047349374624480245, 0.22945922549935024, -0.04592411294041558, 0.08182535926888727, -0.04564311685728158, -0.031357128524460195, 0.047453824933349334, -0.17770133218087616, 0.06116269835496207, 0.19779841914026586, 0.06995945029374252, 0.19457125191371685, -0.433816589004888, -0.24082727279070268, 0.05450090689547629, 0.18285551909458175, 0.1429313314155699, -0.07203612566047427, -0.24823686149684102, 0.043059232022734324, -0.13849061008606658, -0.19072154182470016, -0.07425767635012093, 0.042618151739431336, 0.06958643659034791, -0.25422832029552234, 0.08973074121985312, 0.08117467307381412, 0.04871663229711461, -0.07861032213033127, -0.027920431910513056, -0.07611385632864459, 0.09697324912558017, 0.058241052050412453, -0.021433326274926508, 0.13264692501275924, -0.11675220685914353, -0.055400459887627984, 0.38640802418972814, -0.11402676711619633, -0.20182482016504832, 0.21712104296513465, -0.2285386048051838, -0.10042068091076581, 0.12433856559181014, 0.21495150882979377, 0.13134454001776794, -0.13994045650573037, 0.02865264949217331, -0.024224010820455163, 0.14557938015219563, 0.09921751382158875, 0.03913512427590128, 0.26489579184350664, 0.10379393203419361, 0.04636867863835518, 0.09625750793722401, -0.12691461400293647, -0.07385650181231704, -0.2637930987940745, -0.09994400675409436, -0.07024665135597737, 0.04434469213208271, -0.07590185067429803, -0.1428527937864125, 0.4281680471573146, 0.11493455079332245, 0.2016926921655286, 0.03554040751258577, 0.27690024265434443, 0.14533867909520906, 0.037315207235985824, 0.10647380586952267, 0.3135877912605622, 0.18750866931621052, 0.09616121376481324, -0.2540618405368058, 0.0374711303801918, 0.018452129162014178]
|
1,803.0423
|
Activation of quantum capacity of Gaussian channels
|
Quantum channels can be activated by a kind of channels whose quantum
capacity is zero. This activation effect might be useful to overcome noise of
channels by attaching other channels which can enhance the capacity of a given
channel. In this work, we show that such an activation is possible by specific
positive-partial-transpose channels for Gaussian lossy channels whose quantum
capacities are known. We also test more general case involving Gaussian thermal
attenuator whose the exact value of quantum capacity has been unknown so far.
For a recently suggested narrow upper bound on quantum capacity of the thermal
attenuator, we confirm the fact that an activation of quantum capacity occurs
as well. This result is applicable for realistic situations in which Gaussian
channels describe the noises of communication systems.
|
quant-ph
|
quantum channels can be activated by a kind of channels whose quantum capacity is zero this activation effect might be useful to overcome noise of channels by attaching other channels which can enhance the capacity of a given channel in this work we show that such an activation is possible by specific positivepartialtranspose channels for gaussian lossy channels whose quantum capacities are known we also test more general case involving gaussian thermal attenuator whose the exact value of quantum capacity has been unknown so far for a recently suggested narrow upper bound on quantum capacity of the thermal attenuator we confirm the fact that an activation of quantum capacity occurs as well this result is applicable for realistic situations in which gaussian channels describe the noises of communication systems
|
[['quantum', 'channels', 'can', 'be', 'activated', 'by', 'a', 'kind', 'of', 'channels', 'whose', 'quantum', 'capacity', 'is', 'zero', 'this', 'activation', 'effect', 'might', 'be', 'useful', 'to', 'overcome', 'noise', 'of', 'channels', 'by', 'attaching', 'other', 'channels', 'which', 'can', 'enhance', 'the', 'capacity', 'of', 'a', 'given', 'channel', 'in', 'this', 'work', 'we', 'show', 'that', 'such', 'an', 'activation', 'is', 'possible', 'by', 'specific', 'positivepartialtranspose', 'channels', 'for', 'gaussian', 'lossy', 'channels', 'whose', 'quantum', 'capacities', 'are', 'known', 'we', 'also', 'test', 'more', 'general', 'case', 'involving', 'gaussian', 'thermal', 'attenuator', 'whose', 'the', 'exact', 'value', 'of', 'quantum', 'capacity', 'has', 'been', 'unknown', 'so', 'far', 'for', 'a', 'recently', 'suggested', 'narrow', 'upper', 'bound', 'on', 'quantum', 'capacity', 'of', 'the', 'thermal', 'attenuator', 'we', 'confirm', 'the', 'fact', 'that', 'an', 'activation', 'of', 'quantum', 'capacity', 'occurs', 'as', 'well', 'this', 'result', 'is', 'applicable', 'for', 'realistic', 'situations', 'in', 'which', 'gaussian', 'channels', 'describe', 'the', 'noises', 'of', 'communication', 'systems']]
|
[-0.14860084609132146, 0.1880415374931587, -0.03873196257595984, 0.03475227809056293, -0.03457102203712791, -0.24624942767599872, 0.10567092134476487, 0.3474156221865799, -0.2858452650342974, -0.23618340453984896, 0.10157891960143177, -0.24251119832890902, -0.17786064225812118, 0.23785510291652248, -0.09032667736169095, 0.11703452117048031, 0.025606600449478267, 0.10059022229135961, 0.0031947226023532507, -0.23884045718916397, 0.31355989958311237, 0.10436888930185648, 0.27738295376387445, 0.09071857596534601, 0.04611860110980365, -0.026695105279687534, 0.020713672965996025, -0.013756515758740174, -0.12837331631645477, 0.04909289246713815, 0.2771674031319544, 0.07882424920992276, 0.2111812809900951, -0.4034610884336307, -0.3382874073157477, 0.12340942688751966, 0.1565986803025296, 0.1334335263728258, -0.03435712792089862, -0.2772462917401549, 0.0807705973338177, -0.1717136759227936, -0.06962561347095887, -0.054072533568093016, -0.006589978581381052, -0.011121610013493734, -0.31468244304144105, 0.08255546871196413, 0.1037058577942301, 0.004902753874058511, 0.003909068183915675, -0.13449318549873726, 0.0694978709978795, 0.14949577024509741, -0.05088403355330229, -0.03620014349431839, 0.13422419570112068, -0.1501460188928338, -0.14717316978372808, 0.3035726948792851, -0.05310621476089654, -0.2259619057669427, 0.17190158351499574, -0.07898596875990431, -0.06932771163667704, 0.15104621347733016, 0.1667119559088303, 0.09420069064872787, -0.2184872105067899, 0.06476394078051743, -0.04209632005600273, 0.12990925585952148, 0.07567831189660428, 0.14134519000568377, 0.17441128439075032, 0.1118996415193402, 0.07762345804493556, 0.24787802792329328, -0.09909388634318471, -0.15023048270120135, -0.2985888819910528, -0.1815412591022887, -0.24368229262032653, 0.109096366709979, -0.027164270260277415, -0.1204725533954857, 0.3220679263707048, 0.11650253374451255, 0.17914023788198252, 0.04023152427718967, 0.31523594457309606, 0.16944465787301577, 0.08169282137510157, 0.0945304984176286, 0.23104253258238466, 0.17960712178465874, 0.04532477452759017, -0.18317115043701473, 0.0973851203579138, -0.07183577461067096]
|
1,803.04231
|
The Tjon Band in Nuclear Lattice Effective Field Theory
|
We explore the lattice spacing dependence in Nuclear Lattice Effective Field
Theory for few-body systems up to next-to-next-to leading order in chiral
effective field theory including all isospin breaking and electromagnetic
effects, the complete two-pion-exchange potential and the three-nucleon forces.
We calculate phase shifts in the neutron-proton system and proton-proton
systems as well as the scattering length in the neutron-neutron system. We then
perform a full next-to-next-to-leading order calculation with two-nucleon and
three-nucleon forces for the triton and helium-4 and analyse their binding
energy correlation. We show how the Tjon band is reached by decreasing the
lattice spacing and confirm the continuum observation that a four-body force is
not necessary to describe light nuclei.
|
nucl-th hep-lat hep-ph
|
we explore the lattice spacing dependence in nuclear lattice effective field theory for fewbody systems up to nexttonextto leading order in chiral effective field theory including all isospin breaking and electromagnetic effects the complete twopionexchange potential and the threenucleon forces we calculate phase shifts in the neutronproton system and protonproton systems as well as the scattering length in the neutronneutron system we then perform a full nexttonexttoleading order calculation with twonucleon and threenucleon forces for the triton and helium4 and analyse their binding energy correlation we show how the tjon band is reached by decreasing the lattice spacing and confirm the continuum observation that a fourbody force is not necessary to describe light nuclei
|
[['we', 'explore', 'the', 'lattice', 'spacing', 'dependence', 'in', 'nuclear', 'lattice', 'effective', 'field', 'theory', 'for', 'fewbody', 'systems', 'up', 'to', 'nexttonextto', 'leading', 'order', 'in', 'chiral', 'effective', 'field', 'theory', 'including', 'all', 'isospin', 'breaking', 'and', 'electromagnetic', 'effects', 'the', 'complete', 'twopionexchange', 'potential', 'and', 'the', 'threenucleon', 'forces', 'we', 'calculate', 'phase', 'shifts', 'in', 'the', 'neutronproton', 'system', 'and', 'protonproton', 'systems', 'as', 'well', 'as', 'the', 'scattering', 'length', 'in', 'the', 'neutronneutron', 'system', 'we', 'then', 'perform', 'a', 'full', 'nexttonexttoleading', 'order', 'calculation', 'with', 'twonucleon', 'and', 'threenucleon', 'forces', 'for', 'the', 'triton', 'and', 'helium4', 'and', 'analyse', 'their', 'binding', 'energy', 'correlation', 'we', 'show', 'how', 'the', 'tjon', 'band', 'is', 'reached', 'by', 'decreasing', 'the', 'lattice', 'spacing', 'and', 'confirm', 'the', 'continuum', 'observation', 'that', 'a', 'fourbody', 'force', 'is', 'not', 'necessary', 'to', 'describe', 'light', 'nuclei']]
|
[-0.12220964297701262, 0.20964469241076394, -0.10263306813788388, 0.13283442111743057, 0.0018272888233983203, -0.07652901216785897, 0.028383529455025206, 0.3726102943581186, -0.20422860264386, -0.2656398484674323, -0.023513927042745707, -0.3292825411547694, -0.10631435548809047, 0.0644721252059466, 0.11290926579385996, 0.08482975812971984, 0.027760132113798408, 0.03769503320207852, -0.08629950375925227, -0.188350172959505, 0.32814802586309316, 0.05188596791898211, 0.18680974107497095, 0.21300757472125584, 0.034389178681170994, 0.08639490146695032, 0.017306712733810407, -0.029916974356430665, -0.15560451996127977, 0.05905820713623574, 0.22322074066349223, -0.0651000509346966, 0.13842647521054013, -0.44103034307951466, -0.15946723828745776, 0.09459725219200839, 0.1459649099719204, 0.22964955101671972, 0.007496776002083431, -0.2780737167453034, 0.02117168625587957, -0.2545563033046691, -0.19956623620186165, -0.18362904351057582, 0.06017244640092382, 0.04038976654900532, -0.28015473931455953, 0.07072822861689992, -0.031427719907042684, 0.09207803244588145, -0.11362013093955618, -0.16662479974452013, -0.00012796695891506316, 0.11912623468557731, 0.07359420932551618, 0.07648661382814967, 0.16130493158523582, -0.13415449914081315, -0.11470589669688866, 0.4689318402180154, -0.03346420840662496, -0.12335874503805187, 0.13407113773160076, -0.15341976099533208, -0.09960796444660477, 0.1428995434554261, 0.19620374611194916, 0.0435409836155534, -0.16740575313094286, 0.09687291314925492, 0.046524679933658296, 0.2331310260801968, 0.054581471937381776, 0.05504852528540875, 0.16360944975065395, 0.16592894004363762, 0.02059214019723106, 0.07240748666880424, -0.10176138594958997, -0.1269275158227078, -0.34819689400396064, -0.0470023628251766, -0.1543378391734063, 0.033297827551187334, -0.05304051142823147, -0.12043907241732404, 0.3399374538934545, 0.12301003643344238, 0.17815980557025524, 0.029143934142203967, 0.2901298460068606, 0.11616365449184454, 0.0958475303088658, 0.025096859897307137, 0.31951373132566613, 0.20551781021283222, 0.07510225055739284, -0.3693891117112352, -0.06434239990388353, 0.09982349020796583]
|
1,803.04232
|
Variational Inference for Gaussian Process with Panel Count Data
|
We present the first framework for Gaussian-process-modulated Poisson
processes when the temporal data appear in the form of panel counts. Panel
count data frequently arise when experimental subjects are observed only at
discrete time points and only the numbers of occurrences of the events between
subsequent observation times are available. The exact occurrence timestamps of
the events are unknown. The method of conducting the efficient variational
inference is presented, based on the assumption of a Gaussian-process-modulated
intensity function. We derive a tractable lower bound to alleviate the problems
of the intractable evidence lower bound inherent in the variational inference
framework. Our algorithm outperforms classical methods on both synthetic and
three real panel count sets.
|
stat.ML
|
we present the first framework for gaussianprocessmodulated poisson processes when the temporal data appear in the form of panel counts panel count data frequently arise when experimental subjects are observed only at discrete time points and only the numbers of occurrences of the events between subsequent observation times are available the exact occurrence timestamps of the events are unknown the method of conducting the efficient variational inference is presented based on the assumption of a gaussianprocessmodulated intensity function we derive a tractable lower bound to alleviate the problems of the intractable evidence lower bound inherent in the variational inference framework our algorithm outperforms classical methods on both synthetic and three real panel count sets
|
[['we', 'present', 'the', 'first', 'framework', 'for', 'gaussianprocessmodulated', 'poisson', 'processes', 'when', 'the', 'temporal', 'data', 'appear', 'in', 'the', 'form', 'of', 'panel', 'counts', 'panel', 'count', 'data', 'frequently', 'arise', 'when', 'experimental', 'subjects', 'are', 'observed', 'only', 'at', 'discrete', 'time', 'points', 'and', 'only', 'the', 'numbers', 'of', 'occurrences', 'of', 'the', 'events', 'between', 'subsequent', 'observation', 'times', 'are', 'available', 'the', 'exact', 'occurrence', 'timestamps', 'of', 'the', 'events', 'are', 'unknown', 'the', 'method', 'of', 'conducting', 'the', 'efficient', 'variational', 'inference', 'is', 'presented', 'based', 'on', 'the', 'assumption', 'of', 'a', 'gaussianprocessmodulated', 'intensity', 'function', 'we', 'derive', 'a', 'tractable', 'lower', 'bound', 'to', 'alleviate', 'the', 'problems', 'of', 'the', 'intractable', 'evidence', 'lower', 'bound', 'inherent', 'in', 'the', 'variational', 'inference', 'framework', 'our', 'algorithm', 'outperforms', 'classical', 'methods', 'on', 'both', 'synthetic', 'and', 'three', 'real', 'panel', 'count', 'sets']]
|
[-0.10263294774401736, 0.058177321315988115, -0.0501282286642348, 0.1364959604076208, -0.0832609886756951, -0.1129109607110813, 0.09629198005872272, 0.3774810291238521, -0.23855098884904005, -0.3639771964752295, 0.11736930936080682, -0.2707410201332287, -0.14887073368095516, 0.2219229041325059, -0.048971404346000204, 0.0739950773208157, 0.10009595653932672, 0.04869432824157309, -0.04337087609159777, -0.2748553834185658, 0.2668165616484833, 0.022527988697810655, 0.32997978794829624, -0.010535852362712225, 0.10998119877267368, -0.0012376311708960617, -0.07976541325772639, -0.02134540833924946, -0.10997793463205821, 0.1410039198062007, 0.24793036155435338, 0.17713441707402175, 0.2781870830232245, -0.45100185681918736, -0.1889499159725873, 0.10988819189042899, 0.09462895687963617, 0.10240857676080052, -0.008629411507986094, -0.28334309590424883, 0.04203633163042628, -0.09760624585313755, -0.05903136671373719, -0.046120160829128794, -0.008072253181844166, 0.04375709379663724, -0.2969413128632464, 0.15189013756370465, 0.027853542338370493, 0.047862971650861334, -0.06116079337274035, -0.143293850460874, 0.018886749526453122, 0.09563609185115957, 0.0673603799496369, -0.03580211438524553, 0.08714432023432955, -0.09553318422567508, -0.14916438031778262, 0.31788575083115383, -0.01076409366521004, -0.1882203096409508, 0.1709052912845979, -0.13106953691723838, -0.1849902444805035, 0.15733685541342488, 0.21832476826711444, 0.13811588937849656, -0.13875495229583243, 0.06759537823330775, -0.05415705036322929, 0.1543515395902081, 0.05606091544113792, -0.016216604647700462, 0.13927662356658593, 0.17826642956699065, 0.035726597560202016, 0.12021447047836294, -0.15563721948389062, -0.11467809243160382, -0.32163141820612445, -0.09729264412951459, -0.19758190285300084, -0.03554415385434894, -0.10523870049770553, -0.1942417789904172, 0.34617349607338965, 0.17444097714063614, 0.21278897167199798, 0.09165820850492373, 0.3223483093050227, 0.13734462597967012, 0.01054442982728544, 0.08610486726505323, 0.153576958242379, 0.082525074443159, 0.04284510317078808, -0.15891880399073688, 0.12261424575505468, 0.027572760944614153]
|
1,803.04233
|
Gradient and Hessian Estimates for Dirichlet and Neumann Eigenfunctions
|
We establish integral formulas and sharp two-sided bounds for the Ricci
curvature, mean curvature and second fundamental form on a Riemannian manifold
with boundary. As applications, sharp gradient and Hessian estimates are
derived for the Dirichlet and Neumann eigenfunctions.
|
math.DG
|
we establish integral formulas and sharp twosided bounds for the ricci curvature mean curvature and second fundamental form on a riemannian manifold with boundary as applications sharp gradient and hessian estimates are derived for the dirichlet and neumann eigenfunctions
|
[['we', 'establish', 'integral', 'formulas', 'and', 'sharp', 'twosided', 'bounds', 'for', 'the', 'ricci', 'curvature', 'mean', 'curvature', 'and', 'second', 'fundamental', 'form', 'on', 'a', 'riemannian', 'manifold', 'with', 'boundary', 'as', 'applications', 'sharp', 'gradient', 'and', 'hessian', 'estimates', 'are', 'derived', 'for', 'the', 'dirichlet', 'and', 'neumann', 'eigenfunctions']]
|
[-0.12194991479508388, 0.026265388856140468, -0.06874908545078376, 0.13092450986210352, -0.19001117138526377, -0.19237015390386566, -0.06542338853558669, 0.3599230968214285, -0.2586225499040805, -0.20028659648811206, 0.22953863077773115, -0.30035575383748764, -0.13475201121913508, 0.22546546943246937, -0.12311327979020859, 0.12052102589932008, 0.08631018816660611, 0.1681222569746658, -0.12865946886058038, -0.1539321704648244, 0.42069984124734616, -0.04445644422696951, 0.21447627792039362, 0.16708409063553867, 0.09511732061704, -0.09314087150284113, 0.03503646921270933, -0.017159356114765007, -0.32335574941661877, 0.21410121160965317, 0.18307355311341011, -0.013662917837978173, 0.266698076771811, -0.450428201793096, -0.21833068423737317, 0.1573678447315708, 0.12121112251845308, -0.024273915120806448, -0.06512658058319432, -0.339459576858924, 0.054631171664461874, 0.024026707387887515, -0.14666096346590143, -0.13028583386674142, -0.03922862516572842, 0.027655933267222002, -0.31999480495086086, 0.20048610067878586, 0.08785190781912743, 0.0704120372971281, -0.1945384889602279, -0.19383479261961886, -0.002699416465102098, 0.08902809189823575, 0.02632259040211256, -0.030957313439546105, 0.07186847028489678, -0.07977647405977432, -0.03139502464387661, 0.2349158789102848, -0.17213305156343642, -0.2891546895202154, 0.05584467488388794, -0.13816606033688936, -0.10073817007912275, 0.03274044442253235, 0.16749025066980186, 0.16664125182880804, -0.10109218420723501, 0.1520949398728613, 0.022440411750442132, 0.006680455822975208, 0.14545249469721547, -0.018168540337146856, 0.06000859252153299, -0.022710601966350507, 0.26340066655897176, 0.14087146822697458, -0.04875237543661243, -0.12495377058020005, -0.432763519959572, -0.2592946069124035, -0.2530066904444725, 0.11104555466236213, -0.2602381546465226, -0.2512746041563029, 0.31832237619882786, -0.05171473159526403, 0.2128252076008954, 0.21646507003177434, 0.2602756128240472, 0.18245540606753471, -0.006203908950854571, 0.2002214615782484, 0.16986231763775533, 0.3096536925205818, 0.10834052828021157, -0.13711134120538376, -0.011469496903606715, 0.23912674838151687]
|
1,803.04234
|
Green functions and self-consistency: insights from the spherium model
|
We report an exhaustive study of the performance of different variants of
Green function methods for the spherium model in which two electrons are
confined to the surface of a sphere and interact via a genuine long-range
Coulomb operator. We show that the spherium model provides a unique paradigm to
study electronic correlation effects from the weakly correlated regime to the
strongly correlated regime, since the mathematics are simple while the physics
is rich. We compare perturbative GW, partially self-consistent GW and
second-order Green function (GF2) methods for the computation of ionization
potentials, electron affinities, energy gaps, correlation energies as well as
singlet and triplet neutral excitations by solving the Bethe-Salpeter equation
(BSE). We discuss the problem of self-screening in GW and show that it can be
partially solved with a second-order screened exchange correction (SOSEX). We
find that, in general, self-consistency deteriorates the results with respect
to those obtained within perturbative approaches with a Hartree-Fock starting
point. Finally, we unveil an important problem of partial self-consistency in
GW: in the weakly correlated regime, it can produce artificial discontinuities
in the self-energy caused by satellite resonances with large weights.
|
physics.chem-ph cond-mat.other cond-mat.str-el physics.comp-ph
|
we report an exhaustive study of the performance of different variants of green function methods for the spherium model in which two electrons are confined to the surface of a sphere and interact via a genuine longrange coulomb operator we show that the spherium model provides a unique paradigm to study electronic correlation effects from the weakly correlated regime to the strongly correlated regime since the mathematics are simple while the physics is rich we compare perturbative gw partially selfconsistent gw and secondorder green function gf2 methods for the computation of ionization potentials electron affinities energy gaps correlation energies as well as singlet and triplet neutral excitations by solving the bethesalpeter equation bse we discuss the problem of selfscreening in gw and show that it can be partially solved with a secondorder screened exchange correction sosex we find that in general selfconsistency deteriorates the results with respect to those obtained within perturbative approaches with a hartreefock starting point finally we unveil an important problem of partial selfconsistency in gw in the weakly correlated regime it can produce artificial discontinuities in the selfenergy caused by satellite resonances with large weights
|
[['we', 'report', 'an', 'exhaustive', 'study', 'of', 'the', 'performance', 'of', 'different', 'variants', 'of', 'green', 'function', 'methods', 'for', 'the', 'spherium', 'model', 'in', 'which', 'two', 'electrons', 'are', 'confined', 'to', 'the', 'surface', 'of', 'a', 'sphere', 'and', 'interact', 'via', 'a', 'genuine', 'longrange', 'coulomb', 'operator', 'we', 'show', 'that', 'the', 'spherium', 'model', 'provides', 'a', 'unique', 'paradigm', 'to', 'study', 'electronic', 'correlation', 'effects', 'from', 'the', 'weakly', 'correlated', 'regime', 'to', 'the', 'strongly', 'correlated', 'regime', 'since', 'the', 'mathematics', 'are', 'simple', 'while', 'the', 'physics', 'is', 'rich', 'we', 'compare', 'perturbative', 'gw', 'partially', 'selfconsistent', 'gw', 'and', 'secondorder', 'green', 'function', 'gf2', 'methods', 'for', 'the', 'computation', 'of', 'ionization', 'potentials', 'electron', 'affinities', 'energy', 'gaps', 'correlation', 'energies', 'as', 'well', 'as', 'singlet', 'and', 'triplet', 'neutral', 'excitations', 'by', 'solving', 'the', 'bethesalpeter', 'equation', 'bse', 'we', 'discuss', 'the', 'problem', 'of', 'selfscreening', 'in', 'gw', 'and', 'show', 'that', 'it', 'can', 'be', 'partially', 'solved', 'with', 'a', 'secondorder', 'screened', 'exchange', 'correction', 'sosex', 'we', 'find', 'that', 'in', 'general', 'selfconsistency', 'deteriorates', 'the', 'results', 'with', 'respect', 'to', 'those', 'obtained', 'within', 'perturbative', 'approaches', 'with', 'a', 'hartreefock', 'starting', 'point', 'finally', 'we', 'unveil', 'an', 'important', 'problem', 'of', 'partial', 'selfconsistency', 'in', 'gw', 'in', 'the', 'weakly', 'correlated', 'regime', 'it', 'can', 'produce', 'artificial', 'discontinuities', 'in', 'the', 'selfenergy', 'caused', 'by', 'satellite', 'resonances', 'with', 'large', 'weights']]
|
[-0.10517583963973694, 0.11395266829886987, -0.0642458163669934, 0.13445514072996698, -0.015496303970437674, -0.12683334778846492, 0.04002865366810174, 0.3734207700829578, -0.26941147411646194, -0.2820351376686684, -0.004730944465365379, -0.32855802424074637, -0.15516182449128893, 0.15856454090003377, 0.04054579030116897, 0.020713561014937504, 0.06715056569827967, -0.016884409896438083, -0.11563656597876201, -0.20877617132288243, 0.3175141682463979, 0.04971022673306011, 0.22144093667526568, 0.10458422477588689, 0.04790393806357681, 0.04447637392065079, 0.010251164356266301, 0.0353214755412881, -0.07291903288935024, 0.07040114107630438, 0.2570172202682231, 0.030521293582207468, 0.2685774607588808, -0.44180457285363917, -0.21411400309039486, 0.04004455267614315, 0.13327738250699386, 0.15172030227616054, -0.05050793417763931, -0.2942531043318687, 0.03076652334460979, -0.18775090774787323, -0.13710344499519106, -0.10557133677075543, -0.024096609412929012, 0.03837203127874071, -0.27185469384862004, 0.12341630930652615, -0.004874309487320562, -0.02946461164996166, -0.08165621620442141, -0.11224265850737947, -0.010479643454321872, 0.08387417788986885, 0.022956761702767045, 0.04722097949321978, 0.09719697615407684, -0.15812163471728416, -0.10720927220160664, 0.3827554121337555, -0.10669628203699917, -0.179697993965376, 0.19952140403566537, -0.1550346116890155, -0.10838589173490329, 0.15597639200844304, 0.14076711545807985, 0.1296292423469596, -0.17913218028597022, 0.11399412086410891, 0.00043713601636232206, 0.16308918348208645, 0.01601145998697984, 0.05764477974618169, 0.20651136395008987, 0.12924189907720401, 0.046425216789382, 0.11742716046387734, -0.07251380488626652, -0.12169560845436223, -0.27567841695552625, -0.09966503402646927, -0.17924865582100455, 0.01804246248864623, -0.04032753309818285, -0.20178880886219086, 0.40773529700997097, 0.15330795619529597, 0.15876862763614447, 0.020032877050754096, 0.272713022984111, 0.17465732094003922, 0.03426385084758439, 0.06283243760594694, 0.2729788393166567, 0.12875995558080455, 0.03968577588004154, -0.2618741653058875, 0.006768104069614931, 0.06823784175511233]
|
1,803.04235
|
Approximate Bayesian Computation in controlled branching processes: the
role of summary statistics
|
Controlled branching processes are stochastic growth population models in
which the number of individuals with reproductive capacity in each generation
is controlled by a random control function. The purpose of this work is to
examine the Approximate Bayesian Computation (ABC) methods and to propose
appropriate summary statistics for them in the context of these processes. This
methodology enables to approximate the posterior distribution of the parameters
of interest satisfactorily without explicit likelihood calculations and under a
minimal set of assumptions. In particular, the tolerance rejection algorithm,
the sequential Monte Carlo ABC algorithm, and a post-sampling correction method
based on local-linear regression are provided. The accuracy of the proposed
methods are illustrated and compared with a "likelihood free" Markov chain
Monte Carlo technique by the way of a simulated example developed with the
statistical software R.
|
stat.ME
|
controlled branching processes are stochastic growth population models in which the number of individuals with reproductive capacity in each generation is controlled by a random control function the purpose of this work is to examine the approximate bayesian computation abc methods and to propose appropriate summary statistics for them in the context of these processes this methodology enables to approximate the posterior distribution of the parameters of interest satisfactorily without explicit likelihood calculations and under a minimal set of assumptions in particular the tolerance rejection algorithm the sequential monte carlo abc algorithm and a postsampling correction method based on locallinear regression are provided the accuracy of the proposed methods are illustrated and compared with a likelihood free markov chain monte carlo technique by the way of a simulated example developed with the statistical software r
|
[['controlled', 'branching', 'processes', 'are', 'stochastic', 'growth', 'population', 'models', 'in', 'which', 'the', 'number', 'of', 'individuals', 'with', 'reproductive', 'capacity', 'in', 'each', 'generation', 'is', 'controlled', 'by', 'a', 'random', 'control', 'function', 'the', 'purpose', 'of', 'this', 'work', 'is', 'to', 'examine', 'the', 'approximate', 'bayesian', 'computation', 'abc', 'methods', 'and', 'to', 'propose', 'appropriate', 'summary', 'statistics', 'for', 'them', 'in', 'the', 'context', 'of', 'these', 'processes', 'this', 'methodology', 'enables', 'to', 'approximate', 'the', 'posterior', 'distribution', 'of', 'the', 'parameters', 'of', 'interest', 'satisfactorily', 'without', 'explicit', 'likelihood', 'calculations', 'and', 'under', 'a', 'minimal', 'set', 'of', 'assumptions', 'in', 'particular', 'the', 'tolerance', 'rejection', 'algorithm', 'the', 'sequential', 'monte', 'carlo', 'abc', 'algorithm', 'and', 'a', 'postsampling', 'correction', 'method', 'based', 'on', 'locallinear', 'regression', 'are', 'provided', 'the', 'accuracy', 'of', 'the', 'proposed', 'methods', 'are', 'illustrated', 'and', 'compared', 'with', 'a', 'likelihood', 'free', 'markov', 'chain', 'monte', 'carlo', 'technique', 'by', 'the', 'way', 'of', 'a', 'simulated', 'example', 'developed', 'with', 'the', 'statistical', 'software', 'r']]
|
[-0.05345407525753366, 0.0458729515380379, -0.08706642198376358, 0.09863527411761791, -0.038408858235925436, -0.14340534546662734, 0.0948539991453012, 0.4132955080843461, -0.2642324063892184, -0.3452002603505085, 0.10438088294285447, -0.21856969781567467, -0.13371474470130043, 0.2071508840682096, -0.04647628927178535, 0.1504611311195446, 0.09102610274871338, -0.003077506098145647, -0.039998316609147766, -0.26141537632966944, 0.2535216613193112, 0.11058654538147263, 0.29864897834720894, -0.04696085851912303, 0.11406421397270551, 0.04063654218369456, -0.06379342576099643, 0.00014017530762131756, -0.16809405879909867, 0.16930628643690873, 0.22259835486853372, 0.16471210257289237, 0.3242762879148793, -0.383850400676645, -0.19894918253464597, 0.12409890297133086, 0.13655475334854233, 0.12244221105139508, -0.04586095263253647, -0.25778812827514624, 0.07174716075993519, -0.1956906729575886, -0.09088056433403781, -0.09262425198442122, -0.07149932860160496, 0.06996441950001615, -0.33834915643266, 0.06496013210975189, 0.007965982915944796, 0.07988259648862286, 0.026063803112509647, -0.1312248108408122, -0.001239554534332632, 0.06915473665889185, 0.05057996157478583, -0.01565846878646025, 0.14377014205136002, -0.10188304046655434, -0.16747326566142712, 0.3124264987366302, -0.03357336636799485, -0.26039204406382604, 0.15003915800219542, -0.08767334900539257, -0.15581786318042717, 0.13761586242758517, 0.17510335706521882, 0.14443553266907805, -0.21250158587276047, 0.10741279852653006, 0.024710752218509956, 0.1238032389439142, -0.03733606762669758, -0.07065378549272444, 0.14149599208899621, 0.20320814950634905, 0.03526870196393288, 0.1488901044401938, -0.10054631103477406, -0.16283285649104126, -0.2855253360692912, -0.15392292756934775, -0.2005075969239836, -0.003578195508235871, -0.13356877881434134, -0.2068004241810917, 0.38212304593606006, 0.22446049427429246, 0.16237240699606378, 0.11655330630940204, 0.32567074931045964, 0.11735029546676444, 0.01112002433875381, 0.06182965580130747, 0.14844197977973678, 0.13650721457001488, 0.024315231879339066, -0.20997844015963987, 0.15633456559101147, 0.06039354989805551]
|
1,803.04236
|
System Identification of a Multi-timescale Adaptive Threshold Neuronal
Model
|
In this paper, the parameter estimation problem for a multi-timescale
adaptive threshold (MAT) neuronal model is investigated. By manipulating the
system dynamics, which comprise of a non-resetting leaky integrator coupled
with an adaptive threshold, the threshold voltage can be obtained as a
realizable model that is linear in the unknown parameters. This linearly
parametrized realizable model is then utilized inside a prediction error based
framework to identify the threshold parameters with the purpose of predicting
single neuron precise firing times. The iterative linear least squares
estimation scheme is evaluated using both synthetic data obtained from an exact
model as well as experimental data obtained from in vitro rat somatosensory
cortical neurons. Results show the ability of this approach to fit the MAT
model to different types of fluctuating reference data. The performance of the
proposed approach is seen to be superior when comparing with existing
identification approaches used by the neuronal community.
|
q-bio.NC cs.SY
|
in this paper the parameter estimation problem for a multitimescale adaptive threshold mat neuronal model is investigated by manipulating the system dynamics which comprise of a nonresetting leaky integrator coupled with an adaptive threshold the threshold voltage can be obtained as a realizable model that is linear in the unknown parameters this linearly parametrized realizable model is then utilized inside a prediction error based framework to identify the threshold parameters with the purpose of predicting single neuron precise firing times the iterative linear least squares estimation scheme is evaluated using both synthetic data obtained from an exact model as well as experimental data obtained from in vitro rat somatosensory cortical neurons results show the ability of this approach to fit the mat model to different types of fluctuating reference data the performance of the proposed approach is seen to be superior when comparing with existing identification approaches used by the neuronal community
|
[['in', 'this', 'paper', 'the', 'parameter', 'estimation', 'problem', 'for', 'a', 'multitimescale', 'adaptive', 'threshold', 'mat', 'neuronal', 'model', 'is', 'investigated', 'by', 'manipulating', 'the', 'system', 'dynamics', 'which', 'comprise', 'of', 'a', 'nonresetting', 'leaky', 'integrator', 'coupled', 'with', 'an', 'adaptive', 'threshold', 'the', 'threshold', 'voltage', 'can', 'be', 'obtained', 'as', 'a', 'realizable', 'model', 'that', 'is', 'linear', 'in', 'the', 'unknown', 'parameters', 'this', 'linearly', 'parametrized', 'realizable', 'model', 'is', 'then', 'utilized', 'inside', 'a', 'prediction', 'error', 'based', 'framework', 'to', 'identify', 'the', 'threshold', 'parameters', 'with', 'the', 'purpose', 'of', 'predicting', 'single', 'neuron', 'precise', 'firing', 'times', 'the', 'iterative', 'linear', 'least', 'squares', 'estimation', 'scheme', 'is', 'evaluated', 'using', 'both', 'synthetic', 'data', 'obtained', 'from', 'an', 'exact', 'model', 'as', 'well', 'as', 'experimental', 'data', 'obtained', 'from', 'in', 'vitro', 'rat', 'somatosensory', 'cortical', 'neurons', 'results', 'show', 'the', 'ability', 'of', 'this', 'approach', 'to', 'fit', 'the', 'mat', 'model', 'to', 'different', 'types', 'of', 'fluctuating', 'reference', 'data', 'the', 'performance', 'of', 'the', 'proposed', 'approach', 'is', 'seen', 'to', 'be', 'superior', 'when', 'comparing', 'with', 'existing', 'identification', 'approaches', 'used', 'by', 'the', 'neuronal', 'community']]
|
[-0.04197113976092232, 0.0538055888388309, -0.041207491008515486, 0.0312765645146962, -0.041151334392832015, -0.20638177454446918, 0.02839485526513555, 0.3850281583268615, -0.2618061858352693, -0.3255447934259081, 0.08569171107358713, -0.2219008638319985, -0.23137989467540324, 0.21697242927601845, -0.07822096724655257, 0.11642645178856142, 0.07712106287960481, 0.058902356497610345, -0.010312902462045779, -0.22718750926610454, 0.22551189040123726, 0.09585739930610586, 0.3201681458520771, -0.042227190176012695, 0.14618978476913536, -0.016912306231810458, -0.004761545810947157, 0.026875120852858026, -0.11418980378866703, 0.12116132717076936, 0.2838045871546353, 0.12615209002902003, 0.27152365584555543, -0.4218898160284422, -0.2532758930488335, 0.08448763761595385, 0.1282941636765092, 0.12418783556851898, -0.007460682368405558, -0.30296121888627475, 0.08947455810247273, -0.15787170526096658, -0.09457994296542363, -0.06414077863010843, -0.0490193032992646, 0.05035779211941539, -0.35344115808754173, 0.08620635870326039, 0.02412831776587305, 0.06308418201492322, -0.0793091549186517, -0.09319301074700714, -0.007822588704440076, 0.1322934910071403, 0.006133183642654427, 0.049782083227934426, 0.1564727209058177, -0.11235563572193959, -0.14251918463801214, 0.32674438394729466, -0.07205393084090524, -0.23117357593018945, 0.14890434337773711, -0.04907557098595857, -0.08089516101411193, 0.12075761855512068, 0.19598536958782287, 0.093782039849544, -0.19594021815552595, 0.02307888438511911, -0.038548059218766674, 0.2119389305273626, 0.017207300444657833, -0.04115481085964287, 0.13288978253651584, 0.25470243473321397, 0.004607794466559522, 0.14428353654405732, -0.11265265842936686, -0.08099627123208136, -0.26431529949086147, -0.04186496386899681, -0.19689123073457093, -0.014388014115269809, -0.08482476011757424, -0.13523851871330117, 0.4250398754807517, 0.1727712039345419, 0.21780219044696714, 0.08109608628796351, 0.32511588813319175, 0.1192120218577036, 0.06059523352995416, 0.05071869197406417, 0.22155039455427092, 0.09338465826092474, 0.045868436886084, -0.2432465908882387, 0.08871005287309892, 0.030093366634840798]
|
1,803.04237
|
Causal Consistency and Latency Optimality: Friend or Foe?
|
Causal consistency is an attractive consistency model for replicated data
stores. It is provably the strongest model that tolerates partitions, it avoids
the long latencies associated with strong consistency, and, especially when
using read-only transactions, it prevents many of the anomalies of weaker
consistency models. Recent work has shown that causal consistency allows
"latency-optimal" read-only transactions, that are nonblocking, single-version
and single-round in terms of communication. On the surface, this latency
optimality is very appealing, as the vast majority of applications are assumed
to have read-dominated workloads.
In this paper, we show that such "latency-optimal" read-only transactions
induce an extra overhead on writes, the extra overhead is so high that
performance is actually jeopardized, even in read-dominated workloads. We show
this result from a practical and a theoretical angle.
First, we present a protocol that implements "almost laten- cy-optimal" ROTs
but does not impose on the writes any of the overhead of latency-optimal
protocols. In this protocol, ROTs are nonblocking, one version and can be
configured to use either two or one and a half rounds of client-server
communication. We experimentally show that this protocol not only provides
better throughput, as expected, but also surprisingly better latencies for all
but the lowest loads and most read-heavy workloads.
Then, we prove that the extra overhead imposed on writes by latency-optimal
read-only transactions is inherent, i.e., it is not an artifact of the design
we consider, and cannot be avoided by any implementation of latency-optimal
read-only transactions. We show in particular that this overhead grows linearly
with the number of clients.
|
cs.DC cs.DB
|
causal consistency is an attractive consistency model for replicated data stores it is provably the strongest model that tolerates partitions it avoids the long latencies associated with strong consistency and especially when using readonly transactions it prevents many of the anomalies of weaker consistency models recent work has shown that causal consistency allows latencyoptimal readonly transactions that are nonblocking singleversion and singleround in terms of communication on the surface this latency optimality is very appealing as the vast majority of applications are assumed to have readdominated workloads in this paper we show that such latencyoptimal readonly transactions induce an extra overhead on writes the extra overhead is so high that performance is actually jeopardized even in readdominated workloads we show this result from a practical and a theoretical angle first we present a protocol that implements almost laten cyoptimal rots but does not impose on the writes any of the overhead of latencyoptimal protocols in this protocol rots are nonblocking one version and can be configured to use either two or one and a half rounds of clientserver communication we experimentally show that this protocol not only provides better throughput as expected but also surprisingly better latencies for all but the lowest loads and most readheavy workloads then we prove that the extra overhead imposed on writes by latencyoptimal readonly transactions is inherent ie it is not an artifact of the design we consider and cannot be avoided by any implementation of latencyoptimal readonly transactions we show in particular that this overhead grows linearly with the number of clients
|
[['causal', 'consistency', 'is', 'an', 'attractive', 'consistency', 'model', 'for', 'replicated', 'data', 'stores', 'it', 'is', 'provably', 'the', 'strongest', 'model', 'that', 'tolerates', 'partitions', 'it', 'avoids', 'the', 'long', 'latencies', 'associated', 'with', 'strong', 'consistency', 'and', 'especially', 'when', 'using', 'readonly', 'transactions', 'it', 'prevents', 'many', 'of', 'the', 'anomalies', 'of', 'weaker', 'consistency', 'models', 'recent', 'work', 'has', 'shown', 'that', 'causal', 'consistency', 'allows', 'latencyoptimal', 'readonly', 'transactions', 'that', 'are', 'nonblocking', 'singleversion', 'and', 'singleround', 'in', 'terms', 'of', 'communication', 'on', 'the', 'surface', 'this', 'latency', 'optimality', 'is', 'very', 'appealing', 'as', 'the', 'vast', 'majority', 'of', 'applications', 'are', 'assumed', 'to', 'have', 'readdominated', 'workloads', 'in', 'this', 'paper', 'we', 'show', 'that', 'such', 'latencyoptimal', 'readonly', 'transactions', 'induce', 'an', 'extra', 'overhead', 'on', 'writes', 'the', 'extra', 'overhead', 'is', 'so', 'high', 'that', 'performance', 'is', 'actually', 'jeopardized', 'even', 'in', 'readdominated', 'workloads', 'we', 'show', 'this', 'result', 'from', 'a', 'practical', 'and', 'a', 'theoretical', 'angle', 'first', 'we', 'present', 'a', 'protocol', 'that', 'implements', 'almost', 'laten', 'cyoptimal', 'rots', 'but', 'does', 'not', 'impose', 'on', 'the', 'writes', 'any', 'of', 'the', 'overhead', 'of', 'latencyoptimal', 'protocols', 'in', 'this', 'protocol', 'rots', 'are', 'nonblocking', 'one', 'version', 'and', 'can', 'be', 'configured', 'to', 'use', 'either', 'two', 'or', 'one', 'and', 'a', 'half', 'rounds', 'of', 'clientserver', 'communication', 'we', 'experimentally', 'show', 'that', 'this', 'protocol', 'not', 'only', 'provides', 'better', 'throughput', 'as', 'expected', 'but', 'also', 'surprisingly', 'better', 'latencies', 'for', 'all', 'but', 'the', 'lowest', 'loads', 'and', 'most', 'readheavy', 'workloads', 'then', 'we', 'prove', 'that', 'the', 'extra', 'overhead', 'imposed', 'on', 'writes', 'by', 'latencyoptimal', 'readonly', 'transactions', 'is', 'inherent', 'ie', 'it', 'is', 'not', 'an', 'artifact', 'of', 'the', 'design', 'we', 'consider', 'and', 'can', 'not', 'be', 'avoided', 'by', 'any', 'implementation', 'of', 'latencyoptimal', 'readonly', 'transactions', 'we', 'show', 'in', 'particular', 'that', 'this', 'overhead', 'grows', 'linearly', 'with', 'the', 'number', 'of', 'clients']]
|
[-0.2267010031496319, 0.07147374570832449, -0.04393166791135084, 0.06084583847929702, -0.08619247900877985, -0.21062676763060942, 0.11680571215774127, 0.39983224972555514, -0.2543316432983297, -0.3219042587465816, 0.13709970747342679, -0.2331485653796631, -0.15162657110053007, 0.16370551169456465, -0.1623869415191219, 0.041833356803900365, 0.1012048552087111, 0.03849372325479522, -0.0007142848001302097, -0.32829389832877776, 0.2411031525567636, 0.07258997449395066, 0.2901196899939357, 0.07064121498188451, 0.06963218535096276, 0.008155125722130256, 0.019563984569855208, 0.009861903129751945, -0.03687616265422323, 0.052495368393571225, 0.23750776428226014, 0.20107501012033083, 0.2758659075209221, -0.4741491959303935, -0.16251111685933703, 0.11093527450796592, 0.1373706931724798, 0.10694446070516814, -0.023641872513486983, -0.21488882673817666, 0.1413190320735191, -0.20287650900391155, -0.037352733754542976, -0.11374232360493941, -0.012591895222746905, -0.007025484584069761, -0.28532361029105824, 0.016840589287679085, 0.0714666886108949, 0.01533521921644637, 0.010811605194516754, -0.055732507520362504, -0.012066867915451411, 0.10094635437078893, 0.0463265337951503, 0.010166874608880471, 0.08585483432465861, -0.08643822080763454, -0.1391070129245144, 0.3859505509856597, -0.015888001915525876, -0.19552213763601559, 0.19026814328863956, -0.06225205779747041, -0.18381896922400928, 0.09510661955957135, 0.12674675058382165, 0.05958806651025332, -0.14972468183806587, 0.10546799073408199, -0.05872546387439261, 0.2514988227671575, 0.09755331253752025, 0.10505304039029996, 0.11676914603792334, 0.15818213109583992, 0.11620549204494883, 0.1348377240863683, -0.029862005242133918, -0.08939779626183905, -0.2928999724270877, -0.16352880051198898, -0.19447498372349845, 0.010493577549280509, -0.10179612363555311, -0.14460235153622258, 0.30937143518632754, 0.21128634961191997, 0.16825093006464298, 0.12315126146774652, 0.38966347064909546, 0.05221210888139326, 0.14612982643167163, 0.18161894691126176, 0.17263713552501023, -0.0020187251240939134, 0.10966559658332388, -0.16319458832866837, 0.16369938437489417, -0.029012426502944888]
|
1,803.04238
|
A mass-lumped mixed finite element method for acoustic wave propagation
|
We consider the numerical approximation of acoustic wave propagation in the
time domain by a mixed finite element method based on the BDM1-P0 spaces. A
mass-lumping strategy for the BDM1 element, originally proposed by Wheeler and
Yotov in the context of subsurface flow problems, is utilized to enable an
efficient integration in time. By this mass-lumping strategy, the accuracy of
the mixed method is formally reduced to first order. We will show, however,
that the numerical approximation still carries global second order information,
which is expressed as super-convergence of the numerical approximation to
certain projections of the true solution. Based on this fact, we propose
post-processing strategies for both variables, the pressure and the velocity,
which yield piecewise linear approximations of second order accuracy. A
complete convergence analysis is provided for the semi-discrete and
corresponding fully-discrete approximations, which result from time
discretization by the leapfrog method. In addition, some numerical tests are
presented to illustrate the efficiency of the proposed approach.
|
math.NA
|
we consider the numerical approximation of acoustic wave propagation in the time domain by a mixed finite element method based on the bdm1p0 spaces a masslumping strategy for the bdm1 element originally proposed by wheeler and yotov in the context of subsurface flow problems is utilized to enable an efficient integration in time by this masslumping strategy the accuracy of the mixed method is formally reduced to first order we will show however that the numerical approximation still carries global second order information which is expressed as superconvergence of the numerical approximation to certain projections of the true solution based on this fact we propose postprocessing strategies for both variables the pressure and the velocity which yield piecewise linear approximations of second order accuracy a complete convergence analysis is provided for the semidiscrete and corresponding fullydiscrete approximations which result from time discretization by the leapfrog method in addition some numerical tests are presented to illustrate the efficiency of the proposed approach
|
[['we', 'consider', 'the', 'numerical', 'approximation', 'of', 'acoustic', 'wave', 'propagation', 'in', 'the', 'time', 'domain', 'by', 'a', 'mixed', 'finite', 'element', 'method', 'based', 'on', 'the', 'bdm1p0', 'spaces', 'a', 'masslumping', 'strategy', 'for', 'the', 'bdm1', 'element', 'originally', 'proposed', 'by', 'wheeler', 'and', 'yotov', 'in', 'the', 'context', 'of', 'subsurface', 'flow', 'problems', 'is', 'utilized', 'to', 'enable', 'an', 'efficient', 'integration', 'in', 'time', 'by', 'this', 'masslumping', 'strategy', 'the', 'accuracy', 'of', 'the', 'mixed', 'method', 'is', 'formally', 'reduced', 'to', 'first', 'order', 'we', 'will', 'show', 'however', 'that', 'the', 'numerical', 'approximation', 'still', 'carries', 'global', 'second', 'order', 'information', 'which', 'is', 'expressed', 'as', 'superconvergence', 'of', 'the', 'numerical', 'approximation', 'to', 'certain', 'projections', 'of', 'the', 'true', 'solution', 'based', 'on', 'this', 'fact', 'we', 'propose', 'postprocessing', 'strategies', 'for', 'both', 'variables', 'the', 'pressure', 'and', 'the', 'velocity', 'which', 'yield', 'piecewise', 'linear', 'approximations', 'of', 'second', 'order', 'accuracy', 'a', 'complete', 'convergence', 'analysis', 'is', 'provided', 'for', 'the', 'semidiscrete', 'and', 'corresponding', 'fullydiscrete', 'approximations', 'which', 'result', 'from', 'time', 'discretization', 'by', 'the', 'leapfrog', 'method', 'in', 'addition', 'some', 'numerical', 'tests', 'are', 'presented', 'to', 'illustrate', 'the', 'efficiency', 'of', 'the', 'proposed', 'approach']]
|
[-0.07545739093418175, 0.01635869444486806, -0.11324466696551329, 0.04137352031590771, -0.04606703445727972, -0.061331910832749706, 0.04826205382212006, 0.36612532057952657, -0.29117948317876724, -0.27542259452180773, 0.15819871037774072, -0.21314416975490277, -0.1441971440652173, 0.1972211618595344, -0.049942239376280124, 0.11527938846663772, 0.0738790507481398, 0.019023103114877697, -0.0962536804882008, -0.27158789375437353, 0.30006238076057806, 0.04853756009023401, 0.28462350330185854, 0.034202231978408146, 0.13551227379696373, -0.03047155581791944, -0.06250893912879349, 0.04137729310439428, -0.1144340726316415, 0.13659848013334272, 0.2452902718582721, 0.09980312126461723, 0.31877494499653203, -0.4172765422801051, -0.22581646036168065, 0.06719682637758294, 0.1299452820403761, 0.11989808948548464, -0.0688190693833314, -0.2711381140751528, 0.11033450894770978, -0.1458451929973745, -0.12822062170274462, -0.13347807764134642, -0.04511462104848669, 0.041373828021497056, -0.31514640241460523, 0.09649234091792303, 0.06317883501524883, 0.009606294557923757, -0.06254424181578186, -0.09113416139366506, 0.016279292154373435, 0.08721561072677185, 0.025351803840426845, 0.001735841512792048, 0.018394393469148045, -0.05421895532915958, -0.11119857687898027, 0.4082010903548968, -0.08929243128668647, -0.2714234197724469, 0.14769511968722637, -0.10387638662930702, -0.06965505063925764, 0.14735479190167558, 0.19715879040569823, 0.17272340538145242, -0.1193459220053746, 0.07405059313868714, -0.010860358341210198, 0.16646634012790798, 0.05506704170389478, -0.030532219827387342, 0.07681270691719425, 0.1894461445280504, 0.1068349318443267, 0.10325224951640526, -0.07334155658343984, -0.11631282321965805, -0.3471189319639455, -0.17424322646759638, -0.19432451511155577, -0.039362546259591125, -0.10880507572962611, -0.16074775917974266, 0.39241796722517736, 0.17628983945786197, 0.11631052056622185, 0.0727948188270395, 0.34570645572782693, 0.16860012125291662, 0.013093833133719767, 0.08886370844431693, 0.2236918032376016, 0.1345828282808932, 0.10031049066117104, -0.2514126006225743, 0.06858755446546062, 0.17927349659119132]
|
1,803.04239
|
FeTa: A DCA Pruning Algorithm with Generalization Error Guarantees
|
Recent DNN pruning algorithms have succeeded in reducing the number of
parameters in fully connected layers, often with little or no drop in
classification accuracy. However, most of the existing pruning schemes either
have to be applied during training or require a costly retraining procedure
after pruning to regain classification accuracy. We start by proposing a cheap
pruning algorithm for fully connected DNN layers based on difference of convex
functions (DC) optimisation, that requires little or no retraining. We then
provide a theoretical analysis for the growth in the Generalization Error (GE)
of a DNN for the case of bounded perturbations to the hidden layers, of which
weight pruning is a special case. Our pruning method is orders of magnitude
faster than competing approaches, while our theoretical analysis sheds light to
previously observed problems in DNN pruning. Experiments on commnon feedforward
neural networks validate our results.
|
cs.LG cs.NE stat.ML
|
recent dnn pruning algorithms have succeeded in reducing the number of parameters in fully connected layers often with little or no drop in classification accuracy however most of the existing pruning schemes either have to be applied during training or require a costly retraining procedure after pruning to regain classification accuracy we start by proposing a cheap pruning algorithm for fully connected dnn layers based on difference of convex functions dc optimisation that requires little or no retraining we then provide a theoretical analysis for the growth in the generalization error ge of a dnn for the case of bounded perturbations to the hidden layers of which weight pruning is a special case our pruning method is orders of magnitude faster than competing approaches while our theoretical analysis sheds light to previously observed problems in dnn pruning experiments on commnon feedforward neural networks validate our results
|
[['recent', 'dnn', 'pruning', 'algorithms', 'have', 'succeeded', 'in', 'reducing', 'the', 'number', 'of', 'parameters', 'in', 'fully', 'connected', 'layers', 'often', 'with', 'little', 'or', 'no', 'drop', 'in', 'classification', 'accuracy', 'however', 'most', 'of', 'the', 'existing', 'pruning', 'schemes', 'either', 'have', 'to', 'be', 'applied', 'during', 'training', 'or', 'require', 'a', 'costly', 'retraining', 'procedure', 'after', 'pruning', 'to', 'regain', 'classification', 'accuracy', 'we', 'start', 'by', 'proposing', 'a', 'cheap', 'pruning', 'algorithm', 'for', 'fully', 'connected', 'dnn', 'layers', 'based', 'on', 'difference', 'of', 'convex', 'functions', 'dc', 'optimisation', 'that', 'requires', 'little', 'or', 'no', 'retraining', 'we', 'then', 'provide', 'a', 'theoretical', 'analysis', 'for', 'the', 'growth', 'in', 'the', 'generalization', 'error', 'ge', 'of', 'a', 'dnn', 'for', 'the', 'case', 'of', 'bounded', 'perturbations', 'to', 'the', 'hidden', 'layers', 'of', 'which', 'weight', 'pruning', 'is', 'a', 'special', 'case', 'our', 'pruning', 'method', 'is', 'orders', 'of', 'magnitude', 'faster', 'than', 'competing', 'approaches', 'while', 'our', 'theoretical', 'analysis', 'sheds', 'light', 'to', 'previously', 'observed', 'problems', 'in', 'dnn', 'pruning', 'experiments', 'on', 'commnon', 'feedforward', 'neural', 'networks', 'validate', 'our', 'results']]
|
[-0.050907700065651845, 0.044473513127465183, -0.03862637384184476, 0.028625935330537373, -0.11492437414568046, -0.18433243242766836, 0.13086709230495938, 0.449281306895588, -0.22369120921452876, -0.31920425174436695, 0.10716951394630275, -0.23997956391199138, -0.1915226376856324, 0.2039279415818124, -0.09823624685663601, 0.10738260202703934, 0.14525026761051588, 0.02648974456523288, -0.10329970309775773, -0.3677819504177776, 0.2864552373668693, 0.05271868381071194, 0.2865129357203841, 0.013022723553124173, 0.0882330177672978, -0.03885538749846405, -0.036990871585520176, -0.0016011409814758548, -0.050830639817135745, 0.11957737724617894, 0.258896732391641, 0.1312888569937184, 0.3342387485992292, -0.48625380297287785, -0.2725408553306399, 0.1483283513996365, 0.16268865154606515, 0.11789945676232334, -0.028228239315272918, -0.2485896617591638, 0.13173175375298438, -0.13860580718851295, -0.006327588429096444, -0.14807875576140037, -0.042050016661784775, -0.02262373136533103, -0.2849571001178039, 0.04863069500485114, 0.10694197277891739, 0.045517952183506384, -0.004154140988750191, -0.16204629635422266, -0.0015644289472879008, 0.06633377359569843, 0.03777162705965597, 0.06683671413117956, 0.11416710738076603, -0.18385564471948249, -0.16630456147972367, 0.28523876975322593, -0.022724030846589374, -0.2304634051638302, 0.1994424528153292, 0.0007348700683435489, -0.15790552311930164, 0.14754972590278062, 0.2110500340398144, 0.1329565021177304, -0.10226124038855577, 0.013775151682182633, 0.01273143500860395, 0.2048798024012097, 0.08927017840765546, -0.025208797130797957, 0.09300020908101879, 0.3073865464406795, 0.09381900467299696, 0.14881489124743202, -0.07344875486952991, -0.06141623730032608, -0.2205182832609541, -0.08117195271790542, -0.1843558381729085, -0.01328611741372352, -0.12953186039973436, -0.162353314073949, 0.41272689730956635, 0.1780940844516816, 0.22318070123999798, 0.14508550046894955, 0.3672255039600463, 0.05379797268963965, 0.15577380683208847, 0.12219874932237997, 0.26040661678777943, 0.06873153727341058, 0.08319055740079233, -0.157604475997003, 0.12655668935180514, 0.08689908469447079]
|
1,803.0424
|
Discovering demographic data of users from the evolution of their
spatio-temporal entropy
|
Inferring information related to users enables to highly improve the quality
of many mobile services. For example, knowing the demographic characteristics
of a user allows a service to display more accurate information. According to
the literature, various works present models to detect them but, to the best of
our knowledge, no one is based on the use of the spatio-temporal entropy and
introduces Generalized Additive models (GAMs) in this context to reach this
goal. In this preliminary work, we present a new approach including these two
key elements. The spatio-temporal entropy enables to capture the regularity of
the mobility behavior of a user, while GAMs help to predict her demographic
data based on several co-variables including the spatio-temporal entropy. The
preliminary results are very encouraging to do future work since we obtain a
prediction accuracy of 87% about the prediction of the working profile of
users.
|
cs.SI
|
inferring information related to users enables to highly improve the quality of many mobile services for example knowing the demographic characteristics of a user allows a service to display more accurate information according to the literature various works present models to detect them but to the best of our knowledge no one is based on the use of the spatiotemporal entropy and introduces generalized additive models gams in this context to reach this goal in this preliminary work we present a new approach including these two key elements the spatiotemporal entropy enables to capture the regularity of the mobility behavior of a user while gams help to predict her demographic data based on several covariables including the spatiotemporal entropy the preliminary results are very encouraging to do future work since we obtain a prediction accuracy of 87 about the prediction of the working profile of users
|
[['inferring', 'information', 'related', 'to', 'users', 'enables', 'to', 'highly', 'improve', 'the', 'quality', 'of', 'many', 'mobile', 'services', 'for', 'example', 'knowing', 'the', 'demographic', 'characteristics', 'of', 'a', 'user', 'allows', 'a', 'service', 'to', 'display', 'more', 'accurate', 'information', 'according', 'to', 'the', 'literature', 'various', 'works', 'present', 'models', 'to', 'detect', 'them', 'but', 'to', 'the', 'best', 'of', 'our', 'knowledge', 'no', 'one', 'is', 'based', 'on', 'the', 'use', 'of', 'the', 'spatiotemporal', 'entropy', 'and', 'introduces', 'generalized', 'additive', 'models', 'gams', 'in', 'this', 'context', 'to', 'reach', 'this', 'goal', 'in', 'this', 'preliminary', 'work', 'we', 'present', 'a', 'new', 'approach', 'including', 'these', 'two', 'key', 'elements', 'the', 'spatiotemporal', 'entropy', 'enables', 'to', 'capture', 'the', 'regularity', 'of', 'the', 'mobility', 'behavior', 'of', 'a', 'user', 'while', 'gams', 'help', 'to', 'predict', 'her', 'demographic', 'data', 'based', 'on', 'several', 'covariables', 'including', 'the', 'spatiotemporal', 'entropy', 'the', 'preliminary', 'results', 'are', 'very', 'encouraging', 'to', 'do', 'future', 'work', 'since', 'we', 'obtain', 'a', 'prediction', 'accuracy', 'of', '87', 'about', 'the', 'prediction', 'of', 'the', 'working', 'profile', 'of', 'users']]
|
[-0.0809621169697892, 0.005981274430754862, -0.09267151379026473, 0.07611869068294827, -0.14951811577767543, -0.13878276570036702, 0.09003440752842348, 0.3685609372970584, -0.21862218862643454, -0.34822300839084774, 0.08408082283280585, -0.2957867589422975, -0.1430831910429956, 0.2078026601740108, -0.12862560554012442, 0.07742202493094213, 0.05480154320495586, 0.09390580159777852, -0.05281597545150387, -0.25826527110192515, 0.3074194225865378, 0.091439793518687, 0.32333016748961113, 0.07257716546843007, 0.0724863991059988, -0.004145652476749192, -0.10348646619599568, -0.01566426657752831, -0.12631850389182434, 0.21866551312707264, 0.28595331140495045, 0.1746867945647403, 0.30616245319913715, -0.4215746502940581, -0.2405151262279753, 0.06477367935529973, 0.11031889191219481, 0.12780270321224496, -0.031220751202666066, -0.2898736220070046, 0.09909018537959352, -0.18305528407584723, -0.10388609421980083, -0.10972976926779965, -0.045225475618156465, 0.027937239346537763, -0.28775258739765935, 0.02768687552561958, 0.05122049250274184, 0.04381820023672221, -0.05176425155783263, -0.0803034603954548, 0.01850897706455028, 0.22675032279620025, 0.07327955234508757, -0.014621206850279123, 0.12249003166064926, -0.14396310978958204, -0.1175030100491051, 0.3807993656253978, -0.050480969706295085, -0.19842166439406828, 0.22346206041601524, -0.1121614059363173, -0.162244312659748, 0.09008943762196457, 0.23366888754120838, 0.09341841851271791, -0.18918757425774246, -0.02398024007641353, -0.010320094922774357, 0.1944623307886291, 0.02860444006254922, 0.05147157563135819, 0.18581792756226168, 0.2041425556327178, 0.054575479954197266, 0.09830165583455348, -0.08406771897288097, -0.09813025434284586, -0.22659141981132228, -0.15248544626836968, -0.13493209844136178, 0.009692693052634802, -0.07271903308659827, -0.14400657922131557, 0.44795134016759186, 0.25685568488751576, 0.21184716976490126, 0.06807114835928213, 0.2986947257089276, 0.049896496316985776, 0.04150229320886915, 0.06765943033818461, 0.1808886253466345, 0.05312618291107555, 0.16433504334338367, -0.19226799719673518, 0.13037425377613496, 0.0018699754552583988]
|
1,803.04241
|
A Review of Mixed-Effect Modeling in the Longitudinal Studies Using
Medical Images of Patients
|
In this review paper, some applications of the mixed effect modeling in
medial image processing and longitudinal analysis is studied. For this purpose,
a general structure is extracted from some of the researches in the literature.
This structure includes a number of essential elements, each of which having a
few design choices, namely 1) tracked features, 2) models mathematical
expression and random effects and finally 3) response prediction. Two research
study examples in Alzheimers disease and prostate tomography are also briefly
introduced to further discuss the above design choices.
|
physics.med-ph stat.AP
|
in this review paper some applications of the mixed effect modeling in medial image processing and longitudinal analysis is studied for this purpose a general structure is extracted from some of the researches in the literature this structure includes a number of essential elements each of which having a few design choices namely 1 tracked features 2 models mathematical expression and random effects and finally 3 response prediction two research study examples in alzheimers disease and prostate tomography are also briefly introduced to further discuss the above design choices
|
[['in', 'this', 'review', 'paper', 'some', 'applications', 'of', 'the', 'mixed', 'effect', 'modeling', 'in', 'medial', 'image', 'processing', 'and', 'longitudinal', 'analysis', 'is', 'studied', 'for', 'this', 'purpose', 'a', 'general', 'structure', 'is', 'extracted', 'from', 'some', 'of', 'the', 'researches', 'in', 'the', 'literature', 'this', 'structure', 'includes', 'a', 'number', 'of', 'essential', 'elements', 'each', 'of', 'which', 'having', 'a', 'few', 'design', 'choices', 'namely', '1', 'tracked', 'features', '2', 'models', 'mathematical', 'expression', 'and', 'random', 'effects', 'and', 'finally', '3', 'response', 'prediction', 'two', 'research', 'study', 'examples', 'in', 'alzheimers', 'disease', 'and', 'prostate', 'tomography', 'are', 'also', 'briefly', 'introduced', 'to', 'further', 'discuss', 'the', 'above', 'design', 'choices']]
|
[-0.06518987861325902, 0.07739862470019064, -0.03175423266052195, 0.07096192999769085, -0.06957991609580061, -0.13476873935838596, -0.028708311194145863, 0.3880777669275242, -0.2442458611442132, -0.28380606558927324, 0.15965189643497213, -0.27154660884688575, -0.25876397866588297, 0.19184707810453486, -0.08029584763728584, 0.025139252091444023, 0.06266787768540423, 0.047271351722393475, -0.08055221225825672, -0.21468692820707566, 0.29553207289689126, 0.02683509021267894, 0.3046055619050278, 0.05739875528647491, 0.06435136420631342, 0.011529358156192838, -0.10479174353695067, 0.01577913999724924, -0.15426526993010822, 0.15930572928588713, 0.2965158566934651, 0.1697468487022633, 0.3324116848911462, -0.39334420527048997, -0.2396361844920229, 0.06828544178998537, 0.12262971428735706, 0.12078003794493761, -0.07768322981035944, -0.24045694098818335, 0.07932451646775007, -0.15720099643961097, -0.0956962885167659, -0.05160861077268472, 0.04067981581653604, -0.0007661452668645744, -0.24421925250090282, 0.016363047196443475, 0.053585579289186204, 0.131345869136158, -0.091400614132571, -0.15959464705920662, 0.056163699455098824, 0.15310139130549819, 0.05818738344156842, -0.0013122187817490168, 0.13290505980277498, -0.16676394587246637, -0.1338947501891617, 0.3764926318204805, 0.024615160542085054, -0.22313033735505147, 0.14907254693234076, -0.11065240311724123, -0.20216303566742813, 0.07111671965652971, 0.20366737836699808, 0.09452377309567515, -0.18780776767421178, 0.02656919136905017, -0.001061206484694829, 0.13004442863166332, 0.06390135414804217, 0.009831419351296186, 0.13936863354082857, 0.22197459310586198, -0.034397160231522964, 0.15609173820448224, -0.11280425399374426, -0.055182847592016956, -0.3258620585743966, -0.13975686859249548, -0.10923296633291613, 0.021140124037956003, -0.06090713332059239, -0.14389706010605846, 0.4693203694448712, 0.19778006518721708, 0.18894132956197968, -0.002416571914846224, 0.3141518879414986, 0.029344251473549375, 0.02924355373978144, 0.022395271023086617, 0.15005333963690032, 0.12738801619421242, 0.09768050809631522, -0.1699212156419297, 0.07911890149744374, 0.016434863816653746]
|
1,803.04242
|
Video Object Segmentation with Joint Re-identification and
Attention-Aware Mask Propagation
|
The problem of video object segmentation can become extremely challenging
when multiple instances co-exist. While each instance may exhibit large scale
and pose variations, the problem is compounded when instances occlude each
other causing failures in tracking. In this study, we formulate a deep
recurrent network that is capable of segmenting and tracking objects in video
simultaneously by their temporal continuity, yet able to re-identify them when
they re-appear after a prolonged occlusion. We combine both temporal
propagation and re-identification functionalities into a single framework that
can be trained end-to-end. In particular, we present a re-identification module
with template expansion to retrieve missing objects despite their large
appearance changes. In addition, we contribute a new attention-based recurrent
mask propagation approach that is robust to distractors not belonging to the
target segment. Our approach achieves a new state-of-the-art global mean
(Region Jaccard and Boundary F measure) of 68.2 on the challenging DAVIS 2017
benchmark (test-dev set), outperforming the winning solution which achieves a
global mean of 66.1 on the same partition.
|
cs.CV
|
the problem of video object segmentation can become extremely challenging when multiple instances coexist while each instance may exhibit large scale and pose variations the problem is compounded when instances occlude each other causing failures in tracking in this study we formulate a deep recurrent network that is capable of segmenting and tracking objects in video simultaneously by their temporal continuity yet able to reidentify them when they reappear after a prolonged occlusion we combine both temporal propagation and reidentification functionalities into a single framework that can be trained endtoend in particular we present a reidentification module with template expansion to retrieve missing objects despite their large appearance changes in addition we contribute a new attentionbased recurrent mask propagation approach that is robust to distractors not belonging to the target segment our approach achieves a new stateoftheart global mean region jaccard and boundary f measure of 682 on the challenging davis 2017 benchmark testdev set outperforming the winning solution which achieves a global mean of 661 on the same partition
|
[['the', 'problem', 'of', 'video', 'object', 'segmentation', 'can', 'become', 'extremely', 'challenging', 'when', 'multiple', 'instances', 'coexist', 'while', 'each', 'instance', 'may', 'exhibit', 'large', 'scale', 'and', 'pose', 'variations', 'the', 'problem', 'is', 'compounded', 'when', 'instances', 'occlude', 'each', 'other', 'causing', 'failures', 'in', 'tracking', 'in', 'this', 'study', 'we', 'formulate', 'a', 'deep', 'recurrent', 'network', 'that', 'is', 'capable', 'of', 'segmenting', 'and', 'tracking', 'objects', 'in', 'video', 'simultaneously', 'by', 'their', 'temporal', 'continuity', 'yet', 'able', 'to', 'reidentify', 'them', 'when', 'they', 'reappear', 'after', 'a', 'prolonged', 'occlusion', 'we', 'combine', 'both', 'temporal', 'propagation', 'and', 'reidentification', 'functionalities', 'into', 'a', 'single', 'framework', 'that', 'can', 'be', 'trained', 'endtoend', 'in', 'particular', 'we', 'present', 'a', 'reidentification', 'module', 'with', 'template', 'expansion', 'to', 'retrieve', 'missing', 'objects', 'despite', 'their', 'large', 'appearance', 'changes', 'in', 'addition', 'we', 'contribute', 'a', 'new', 'attentionbased', 'recurrent', 'mask', 'propagation', 'approach', 'that', 'is', 'robust', 'to', 'distractors', 'not', 'belonging', 'to', 'the', 'target', 'segment', 'our', 'approach', 'achieves', 'a', 'new', 'stateoftheart', 'global', 'mean', 'region', 'jaccard', 'and', 'boundary', 'f', 'measure', 'of', '682', 'on', 'the', 'challenging', 'davis', '2017', 'benchmark', 'testdev', 'set', 'outperforming', 'the', 'winning', 'solution', 'which', 'achieves', 'a', 'global', 'mean', 'of', '661', 'on', 'the', 'same', 'partition']]
|
[-0.09419298776398029, 0.02043700624284718, -0.06960280415491445, 0.07151320616591393, -0.09558746964287232, -0.2009765595512684, 0.025652040352853126, 0.4498871489921037, -0.2681176315719152, -0.3511084084672963, 0.08262053739813649, -0.2650550755316063, -0.15288292506627518, 0.15000815112417673, -0.1926482639318291, 0.06001745071262121, 0.15760687481105218, 0.05265516414416625, -0.03001635136863436, -0.2725853415479993, 0.2643726684331127, 0.00831131696656538, 0.3006128273575622, 0.024609115241807613, 0.1490060694543097, -0.021857043899431387, -0.02312268646680476, 0.029729345270350357, -0.01609586893425919, 0.1437085513227965, 0.28243563486372725, 0.16219158002718093, 0.30619259580750674, -0.3895243239972521, -0.21564003587289549, 0.10847290554220843, 0.15138820124351804, 0.09876191867036088, -0.02106838724918335, -0.35939253209610744, 0.13165039192707115, -0.13688442748423446, -0.023366724124506993, -0.09737493711085442, 0.02282955162364113, -0.031178217007682713, -0.276562343925402, 0.059357206994558084, 0.05457850176402751, 0.015561702920069151, -0.09892329242190018, -0.05991933630258941, 0.022697044122854577, 0.21234117264376598, 0.027950365989989436, 0.07663488095379709, 0.12985544503556892, -0.2054661087869831, -0.10076161291833748, 0.38308069031028186, -0.07604391348329098, -0.20233756625915275, 0.2057379698545179, -0.07469152110621936, -0.15738624002757098, 0.15484905734740417, 0.2244854523197693, 0.16104608656674185, -0.16112383472560288, -0.01138985425042098, -0.08073217960362158, 0.19199779432212166, 0.09814633571214097, 0.009622896662639345, 0.2235615995596163, 0.23486059419262936, 0.07723502219990169, 0.13956944605657448, -0.18165967857057694, -0.04914098239832503, -0.21301408762091717, -0.07534441835733185, -0.13998648238861386, -0.02394432989967754, -0.09554858823984806, -0.17384981167749228, 0.40744209819788335, 0.22846757390823982, 0.23580588907660807, 0.10556007949703866, 0.31816536477109525, 0.01729830717402579, 0.10515122672830544, 0.10848331516814035, 0.17947742970769895, -0.02651286803336595, 0.11378193467184354, -0.18062214034417753, 0.10717961662175024, 0.06569747517351061]
|
1,803.04243
|
Universal $\alpha$-elasticity of generalized Moufang loops
|
In this study we introduce $\alpha$-elasticity property for generalized
Moufang loops. Necessary and sufficient conditions for $\alpha$-elasticity of
generalized Moufang loops to be universal are given. Using the universal
conditions, and in some cases, with the newly introduced right and left
$\alpha$-alternative laws for generalized Moufang loops, some properties of
generalized Moufang loops are studied. Condition under which the generalized
Moufang loop is an abelian group is stated.
|
math.GR
|
in this study we introduce alphaelasticity property for generalized moufang loops necessary and sufficient conditions for alphaelasticity of generalized moufang loops to be universal are given using the universal conditions and in some cases with the newly introduced right and left alphaalternative laws for generalized moufang loops some properties of generalized moufang loops are studied condition under which the generalized moufang loop is an abelian group is stated
|
[['in', 'this', 'study', 'we', 'introduce', 'alphaelasticity', 'property', 'for', 'generalized', 'moufang', 'loops', 'necessary', 'and', 'sufficient', 'conditions', 'for', 'alphaelasticity', 'of', 'generalized', 'moufang', 'loops', 'to', 'be', 'universal', 'are', 'given', 'using', 'the', 'universal', 'conditions', 'and', 'in', 'some', 'cases', 'with', 'the', 'newly', 'introduced', 'right', 'and', 'left', 'alphaalternative', 'laws', 'for', 'generalized', 'moufang', 'loops', 'some', 'properties', 'of', 'generalized', 'moufang', 'loops', 'are', 'studied', 'condition', 'under', 'which', 'the', 'generalized', 'moufang', 'loop', 'is', 'an', 'abelian', 'group', 'is', 'stated']]
|
[-0.15977360945768082, 0.1692829548544698, -0.03273439969007785, 0.168593239520963, -0.11871654264485607, -0.18057487071133577, -0.006976408178273302, 0.37036307242054206, -0.2697434595642755, -0.17653625942766665, 0.16896677862924453, -0.1766091534294761, -0.15942863002419472, 0.22517170147397197, -0.13137558366243657, 0.057681263925937504, -0.013801791848471532, 0.11055584972581038, -0.07095761020811131, -0.2676051002676384, 0.3914174477641399, -0.01028998858259561, 0.24879180896454134, 0.0822388756259058, 0.12432670958626729, -0.07781857348835239, 0.013928657315241602, 0.0656942402354896, -0.16533200137961943, 0.025282741565472232, 0.20899897412253687, 0.07463068555180843, 0.15328755693940016, -0.42697876789248906, -0.15419223321458467, 0.11837778900964901, 0.10411638844794092, -0.03623285706047542, -0.024045437216185607, -0.2430489789479627, 0.1945891187239725, -0.14090626976237847, -0.21670127785048232, -0.10222012240153093, 0.01318638648551244, -0.008788238956521336, -0.33350411285288056, 0.05196573631121562, 0.13039136743889404, 0.13213754300601208, -0.03658797832635733, -0.06075600696584353, 0.03057313601558025, 0.1443229272710876, -0.04984449578735691, -0.07340935178172703, 0.026084572728723287, -0.07021247967719459, -0.14837632655846672, 0.36255100386647077, 0.06142968389277275, -0.18985101592082243, 0.07511407458581604, -0.14429020105073084, -0.2530876198067115, 0.053376972431746814, 0.055203811946110085, 0.10338288110036116, -0.20418379706545517, 0.14338900544053804, -0.14580680968669746, 0.002392242762904901, 0.14693116789253857, -0.012979787093802141, 0.1177758170864903, 0.03499839440561258, 0.017092537677560287, 0.22210957042407245, 0.08000233385425348, -0.08238904135158429, -0.44325970023010786, -0.12033236198700391, 1.577677635046152e-05, 0.031663968116985276, -0.06908175571252986, -0.24271166615474682, 0.403924737784725, 0.08277835569416102, 0.14956678140621918, 0.06346289134548547, 0.1910030788419625, 0.10723442052258178, 0.15685315009636375, 0.1213326888732039, 0.10629701120510268, 0.27239553802288496, 0.007849252510529299, -0.1536284770243443, -0.024916304934483307, 0.24298032939863892]
|
1,803.04244
|
The generalized stochastic preference choice model
|
We propose a new discrete choice model, called the generalized stochastic preference (GSP) model, that incorporates non-rationality into the stochastic preference (SP) choice model, also known as the rank-based model. Our model can capture several context-dependent choice behaviors that cannot be represented by any SP model, such as the well-documented compromise and attraction effects, while still including the SP model as a special case. The GSP model is defined as a distribution over consumer types, where each type extends the choice behavior of rational types in the SP model. We build on existing methods for estimating the SP model and propose an iterative estimation algorithm for the GSP model that finds new types by solving an integer linear program in each iteration. We further show that our proposed notion of non-rationality can be incorporated into other choice models, like the random utility maximization (RUM) model class as well as any of its subclasses. As a concrete example, we introduce the non-rational extension of the classical MNL model, which we term the generalized MNL (GMNL) model and present an efficient expectation-maximization (EM) algorithm for estimating it. \av{For the GSP model, we demonstrate that the worst-case performance guarantee of revenue-ordered assortments is significantly worse than for the SP model. For the GMNL model, we establish that assortment optimization with totally unimodular constraints is NP-hard to approximate to within a factor of $O(n^{1-\epsilon})$ for any $\epsilon > 0$, where $n$ is the number of products.} Finally, numerical evaluation on synthetic and real choice data shows that the GMNL and GSP models can outperform their rational counterparts in out-of-sample prediction accuracy.
|
cs.GT
|
we propose a new discrete choice model called the generalized stochastic preference gsp model that incorporates nonrationality into the stochastic preference sp choice model also known as the rankbased model our model can capture several contextdependent choice behaviors that cannot be represented by any sp model such as the welldocumented compromise and attraction effects while still including the sp model as a special case the gsp model is defined as a distribution over consumer types where each type extends the choice behavior of rational types in the sp model we build on existing methods for estimating the sp model and propose an iterative estimation algorithm for the gsp model that finds new types by solving an integer linear program in each iteration we further show that our proposed notion of nonrationality can be incorporated into other choice models like the random utility maximization rum model class as well as any of its subclasses as a concrete example we introduce the nonrational extension of the classical mnl model which we term the generalized mnl gmnl model and present an efficient expectationmaximization em algorithm for estimating it avfor the gsp model we demonstrate that the worstcase performance guarantee of revenueordered assortments is significantly worse than for the sp model for the gmnl model we establish that assortment optimization with totally unimodular constraints is nphard to approximate to within a factor of on1epsilon for any epsilon 0 where n is the number of products finally numerical evaluation on synthetic and real choice data shows that the gmnl and gsp models can outperform their rational counterparts in outofsample prediction accuracy
|
[['we', 'propose', 'a', 'new', 'discrete', 'choice', 'model', 'called', 'the', 'generalized', 'stochastic', 'preference', 'gsp', 'model', 'that', 'incorporates', 'nonrationality', 'into', 'the', 'stochastic', 'preference', 'sp', 'choice', 'model', 'also', 'known', 'as', 'the', 'rankbased', 'model', 'our', 'model', 'can', 'capture', 'several', 'contextdependent', 'choice', 'behaviors', 'that', 'can', 'not', 'be', 'represented', 'by', 'any', 'sp', 'model', 'such', 'as', 'the', 'welldocumented', 'compromise', 'and', 'attraction', 'effects', 'while', 'still', 'including', 'the', 'sp', 'model', 'as', 'a', 'special', 'case', 'the', 'gsp', 'model', 'is', 'defined', 'as', 'a', 'distribution', 'over', 'consumer', 'types', 'where', 'each', 'type', 'extends', 'the', 'choice', 'behavior', 'of', 'rational', 'types', 'in', 'the', 'sp', 'model', 'we', 'build', 'on', 'existing', 'methods', 'for', 'estimating', 'the', 'sp', 'model', 'and', 'propose', 'an', 'iterative', 'estimation', 'algorithm', 'for', 'the', 'gsp', 'model', 'that', 'finds', 'new', 'types', 'by', 'solving', 'an', 'integer', 'linear', 'program', 'in', 'each', 'iteration', 'we', 'further', 'show', 'that', 'our', 'proposed', 'notion', 'of', 'nonrationality', 'can', 'be', 'incorporated', 'into', 'other', 'choice', 'models', 'like', 'the', 'random', 'utility', 'maximization', 'rum', 'model', 'class', 'as', 'well', 'as', 'any', 'of', 'its', 'subclasses', 'as', 'a', 'concrete', 'example', 'we', 'introduce', 'the', 'nonrational', 'extension', 'of', 'the', 'classical', 'mnl', 'model', 'which', 'we', 'term', 'the', 'generalized', 'mnl', 'gmnl', 'model', 'and', 'present', 'an', 'efficient', 'expectationmaximization', 'em', 'algorithm', 'for', 'estimating', 'it', 'avfor', 'the', 'gsp', 'model', 'we', 'demonstrate', 'that', 'the', 'worstcase', 'performance', 'guarantee', 'of', 'revenueordered', 'assortments', 'is', 'significantly', 'worse', 'than', 'for', 'the', 'sp', 'model', 'for', 'the', 'gmnl', 'model', 'we', 'establish', 'that', 'assortment', 'optimization', 'with', 'totally', 'unimodular', 'constraints', 'is', 'nphard', 'to', 'approximate', 'to', 'within', 'a', 'factor', 'of', 'on1epsilon', 'for', 'any', 'epsilon', '0', 'where', 'n', 'is', 'the', 'number', 'of', 'products', 'finally', 'numerical', 'evaluation', 'on', 'synthetic', 'and', 'real', 'choice', 'data', 'shows', 'that', 'the', 'gmnl', 'and', 'gsp', 'models', 'can', 'outperform', 'their', 'rational', 'counterparts', 'in', 'outofsample', 'prediction', 'accuracy']]
|
[-0.05457329153454393, 0.00810065056183997, -0.08166338752603326, 0.10450200254712044, -0.10156557045498849, -0.21325711685905052, 0.05102414056515195, 0.3907238656192794, -0.30807723786289753, -0.3124221527941973, 0.08446835469160426, -0.23860088672184324, -0.21817001719745507, 0.18400293044112204, -0.06264607250932044, 0.022582078163286223, 0.03431286004501486, 0.045576664039697075, -0.036577285325182674, -0.24811881968070565, 0.25835028290398476, 0.04139224741576394, 0.28393673089147314, -0.0012880043814630998, 0.11047044947184972, 0.04911111582497737, 0.018802782786743983, 0.04178372848077845, -0.08976827822091155, 0.1146261490458234, 0.2202151208652126, 0.19256911558253145, 0.29982224371655375, -0.37406190231099334, -0.23898196579972492, 0.1651231770056188, 0.1177718623064693, 0.0638741510880838, -0.023295246622231053, -0.24299669056637144, 0.08596249671540875, -0.20101264378850706, -0.07889114656394586, -0.1081532025342121, -0.032468525930027706, 0.014961717530158944, -0.34504992285344216, 0.02744790725311513, 0.08408901807099328, 0.004188831387913989, -0.08426046980714734, -0.16015159452764696, -0.001542801173978058, 0.06562473310842144, 0.03785034763826761, -0.0025296991768019987, 0.07256042307043183, -0.11504350806244201, -0.1829712222263749, 0.4104181687396608, -0.0898783923890678, -0.25119351954514485, 0.13969700228461393, -0.028569784796187526, -0.13793240784390837, 0.06163901218435359, 0.1899510481451941, 0.13045281417846427, -0.10783053628218017, 0.09813725284394402, -0.1098040725630568, 0.156991663793298, -0.0005110694608420022, -0.014051837920162239, 0.13588681597003532, 0.19493443137419908, 0.0827070403479992, 0.13791355445628278, -0.05461667499660788, -0.14433255734419295, -0.30071524240573716, -0.1298886016221311, -0.15157918002599977, 0.003581409548337946, -0.15332197073357542, -0.17991989325586255, 0.40973177499705016, 0.1758966111563605, 0.16926403581409863, 0.1257162096536424, 0.2972919398365556, 0.12552461554221914, 0.03057327648691301, 0.07936897967360858, 0.1716568038187907, 0.025441964156925678, 0.017232623415617484, -0.17418841630941664, 0.12989648544803767, 0.08006018582342851]
|
1,803.04245
|
Listen Before Receive for Coexistence in Unlicensed mmWave Bands
|
Listen-Before-Talk (LBT) has been adopted as the spectrum sharing technique
that guarantees a fair LTE/Wi-Fi coexistence in the unlicensed spectrum at the
5 GHz band. Differently, at mmWave bands, where beamforming is a must to
overcome propagation limits, LBT scope becomes limited because the interference
layout changes due to the directionality of transmissions. In this regard, this
paper proposes a Listen-Before-Receive (LBR) technique for shared spectrum
access and analyzes its potentials to promote a fair coexistence of multiple
Radio Access Technologies (RATs) in unlicensed mmWave bands, as, e.g., 5G New
Radio (NR) access technology and Wireless Gigabit (WiGig) devices using IEEE
802.11ad/ay standard. Since the less likely but still harmful interference
situations with directional transmissions can no longer be detected easily at
the transmitter, we believe that the receiver has useful information to be
used. The main idea of LBR is that we provide to the receiver a say when it
comes to allowing/preventing the access to the channel. In this line, we
propose potential implementations of LBR, in conjunction with LBT and the
self-contained slot, for NR-based access to unlicensed mmWave bands.
|
cs.NI
|
listenbeforetalk lbt has been adopted as the spectrum sharing technique that guarantees a fair ltewifi coexistence in the unlicensed spectrum at the 5 ghz band differently at mmwave bands where beamforming is a must to overcome propagation limits lbt scope becomes limited because the interference layout changes due to the directionality of transmissions in this regard this paper proposes a listenbeforereceive lbr technique for shared spectrum access and analyzes its potentials to promote a fair coexistence of multiple radio access technologies rats in unlicensed mmwave bands as eg 5g new radio nr access technology and wireless gigabit wigig devices using ieee 80211aday standard since the less likely but still harmful interference situations with directional transmissions can no longer be detected easily at the transmitter we believe that the receiver has useful information to be used the main idea of lbr is that we provide to the receiver a say when it comes to allowingpreventing the access to the channel in this line we propose potential implementations of lbr in conjunction with lbt and the selfcontained slot for nrbased access to unlicensed mmwave bands
|
[['listenbeforetalk', 'lbt', 'has', 'been', 'adopted', 'as', 'the', 'spectrum', 'sharing', 'technique', 'that', 'guarantees', 'a', 'fair', 'ltewifi', 'coexistence', 'in', 'the', 'unlicensed', 'spectrum', 'at', 'the', '5', 'ghz', 'band', 'differently', 'at', 'mmwave', 'bands', 'where', 'beamforming', 'is', 'a', 'must', 'to', 'overcome', 'propagation', 'limits', 'lbt', 'scope', 'becomes', 'limited', 'because', 'the', 'interference', 'layout', 'changes', 'due', 'to', 'the', 'directionality', 'of', 'transmissions', 'in', 'this', 'regard', 'this', 'paper', 'proposes', 'a', 'listenbeforereceive', 'lbr', 'technique', 'for', 'shared', 'spectrum', 'access', 'and', 'analyzes', 'its', 'potentials', 'to', 'promote', 'a', 'fair', 'coexistence', 'of', 'multiple', 'radio', 'access', 'technologies', 'rats', 'in', 'unlicensed', 'mmwave', 'bands', 'as', 'eg', '5g', 'new', 'radio', 'nr', 'access', 'technology', 'and', 'wireless', 'gigabit', 'wigig', 'devices', 'using', 'ieee', '80211aday', 'standard', 'since', 'the', 'less', 'likely', 'but', 'still', 'harmful', 'interference', 'situations', 'with', 'directional', 'transmissions', 'can', 'no', 'longer', 'be', 'detected', 'easily', 'at', 'the', 'transmitter', 'we', 'believe', 'that', 'the', 'receiver', 'has', 'useful', 'information', 'to', 'be', 'used', 'the', 'main', 'idea', 'of', 'lbr', 'is', 'that', 'we', 'provide', 'to', 'the', 'receiver', 'a', 'say', 'when', 'it', 'comes', 'to', 'allowingpreventing', 'the', 'access', 'to', 'the', 'channel', 'in', 'this', 'line', 'we', 'propose', 'potential', 'implementations', 'of', 'lbr', 'in', 'conjunction', 'with', 'lbt', 'and', 'the', 'selfcontained', 'slot', 'for', 'nrbased', 'access', 'to', 'unlicensed', 'mmwave', 'bands']]
|
[-0.2309812259937947, 0.030223550611925828, -0.03469445521995011, 0.016598970033616448, -0.11878358806586928, -0.2622775162363218, 0.11548884238517429, 0.43608856693738035, -0.26332783627375544, -0.2569409550120731, 0.08300112846126366, -0.24831108347150602, -0.14232656705620078, 0.11996470332766572, -0.11377474640289115, -0.012229930957740482, 0.046910029645207234, -0.03578171521641909, 0.02094817033794243, -0.17941772510271725, 0.2374312046359086, 0.15206772666683213, 0.38260656469630905, 0.07845279364070544, 0.015319085095284714, 0.006864839906079901, -0.02443381448586782, -0.08906738528360923, -0.053273009120109946, 0.08278469433494642, 0.38133963423444783, 0.14099676055807828, 0.2800549339865231, -0.4237962846851183, -0.2783058745967638, 0.07867145419845151, 0.17887542747735602, 0.05348828159621917, -0.009955677901032484, -0.2755296747614112, 0.1548680688927157, -0.24726941181450254, -0.09648833898689999, 0.056748195848033194, -0.0708030012235718, 0.009420085656974051, -0.3101497805470394, -0.03352174311876297, -0.04852069376469848, 0.03762880169467987, -0.021131961945745084, -0.07507781892135325, 0.030259136364070904, 0.174188486742302, 0.003013638439329548, 0.0062960391071909625, 0.05439335615632849, -0.07361510421485744, -0.1143724184049966, 0.434445600647531, 0.0064239539154287845, -0.15765673231023053, 0.19669155998368903, -0.12531810940046045, -0.1274627167214122, 0.14825620632489314, 0.21820144604199515, 0.00966203923518252, -0.19259567797974644, 0.031018976927670236, 0.05107093248904372, 0.18368675468696488, 0.11349564771581855, 0.17756475144415163, 0.19714245374004047, 0.16844082581681302, 0.151775797844554, 0.085067501236012, -0.14666960324264236, -0.04825622288949995, -0.20186628266787415, -0.10094840154827883, -0.23995813677449607, 0.030480084371649556, -0.005354710709475007, -0.08209874568791646, 0.39767846980960003, 0.16240536008392356, 0.08920732723393789, 0.06183241251338687, 0.42361721493717697, 0.06727967270223113, 0.1389162592848556, 0.1427077639977344, 0.22552421239929066, 0.061959644488524646, 0.22821935553414127, -0.14679753349110897, 0.04011690552449888, -0.09187456836872217]
|
1,803.04246
|
Bayesian inference for a partially observed birth-death process using
data on proportions
|
Stochastic kinetic models are often used to describe complex biological
processes. Typically these models are analytically intractable and have unknown
parameters which need to be estimated from observed data. Ideally we would have
measurements on all interacting chemical species in the process, observed
continuously in time. However, in practice, measurements are taken only at a
relatively few time-points. In some situations, only very limited observation
of the process is available, such as when experimenters can only observe noisy
observations on the proportion of cells that are alive. This makes the
inference task even more problematic. We consider a range of data-poor
scenarios and investigate the performance of various computationally intensive
Bayesian algorithms in determining the posterior distribution using data on
proportions from a simple birth-death process.
|
stat.CO
|
stochastic kinetic models are often used to describe complex biological processes typically these models are analytically intractable and have unknown parameters which need to be estimated from observed data ideally we would have measurements on all interacting chemical species in the process observed continuously in time however in practice measurements are taken only at a relatively few timepoints in some situations only very limited observation of the process is available such as when experimenters can only observe noisy observations on the proportion of cells that are alive this makes the inference task even more problematic we consider a range of datapoor scenarios and investigate the performance of various computationally intensive bayesian algorithms in determining the posterior distribution using data on proportions from a simple birthdeath process
|
[['stochastic', 'kinetic', 'models', 'are', 'often', 'used', 'to', 'describe', 'complex', 'biological', 'processes', 'typically', 'these', 'models', 'are', 'analytically', 'intractable', 'and', 'have', 'unknown', 'parameters', 'which', 'need', 'to', 'be', 'estimated', 'from', 'observed', 'data', 'ideally', 'we', 'would', 'have', 'measurements', 'on', 'all', 'interacting', 'chemical', 'species', 'in', 'the', 'process', 'observed', 'continuously', 'in', 'time', 'however', 'in', 'practice', 'measurements', 'are', 'taken', 'only', 'at', 'a', 'relatively', 'few', 'timepoints', 'in', 'some', 'situations', 'only', 'very', 'limited', 'observation', 'of', 'the', 'process', 'is', 'available', 'such', 'as', 'when', 'experimenters', 'can', 'only', 'observe', 'noisy', 'observations', 'on', 'the', 'proportion', 'of', 'cells', 'that', 'are', 'alive', 'this', 'makes', 'the', 'inference', 'task', 'even', 'more', 'problematic', 'we', 'consider', 'a', 'range', 'of', 'datapoor', 'scenarios', 'and', 'investigate', 'the', 'performance', 'of', 'various', 'computationally', 'intensive', 'bayesian', 'algorithms', 'in', 'determining', 'the', 'posterior', 'distribution', 'using', 'data', 'on', 'proportions', 'from', 'a', 'simple', 'birthdeath', 'process']]
|
[-0.06939335873568549, 0.1314739454389801, -0.04053638038402867, 0.11493662798693549, -0.07812307347425275, -0.16891735364749497, 0.07667011222321658, 0.45357528213588966, -0.2588105005699964, -0.34506708323689445, 0.15231707805143077, -0.2409014548720156, -0.11521574641607465, 0.21632632553126543, -0.06979974622409495, 0.06316811806108388, 0.1289156304280787, 0.02717165065012754, -0.0007761222359332595, -0.2482843824665964, 0.26150266335822553, 0.046469105947171414, 0.24384774520461047, -0.04011421325424361, 0.08395475080229402, -0.0397977550210993, -0.049387752252172616, -0.0024741986278621923, -0.09436833709026807, 0.06610087182609335, 0.31699594212327536, 0.15884905869034044, 0.30095090955081916, -0.4684418859551587, -0.2521254641950012, 0.16071169759841666, 0.16319089285481447, 0.12251607540325957, -0.012387470779815755, -0.22866771648090983, 0.03803561533646961, -0.12671503274967627, -0.04450491011338604, -0.1116227383821434, -0.003417944653876244, 0.021125509201305077, -0.27779891721106004, 0.08719718618510616, -0.017648248817995264, 0.05812972801042691, -0.018959720583913462, -0.13913155014678422, -0.0016554791363887489, 0.13489414134274408, 0.06691763028515746, -0.0507709596542612, 0.15415720374412126, -0.15026902317878835, -0.07119315671217111, 0.37451857006886885, -0.011518887909395354, -0.21653249972714259, 0.2562172120346481, -0.15331430341457092, -0.18734903197499023, 0.140469326212677, 0.208721760109285, 0.15069045958900085, -0.22550776955500218, 0.056260784791361186, -0.009143677947577089, 0.1462333086159243, 0.02118606731436023, -0.0006761420319514674, 0.1948760170323242, 0.17447474737659038, -0.009193255891284299, 0.08075590123743973, -0.08899018302049842, -0.11463693440300486, -0.24145897213805703, -0.08495813387396213, -0.21954698230801445, 0.039625726982078974, -0.0724242046668974, -0.14939045274837148, 0.3240995126192473, 0.21962317343226576, 0.2445599175139611, 0.05351416897749351, 0.29141252480506424, 0.09276447309336315, 0.06528212951259717, 0.040570271101185225, 0.21218549775718232, 0.06298502955986704, 0.09127693456996765, -0.13463947841054982, 0.1890556688535042, -0.07998138434061455]
|
1,803.04247
|
Magnitude homology of metric spaces and order complexes
|
Hepworth, Willerton, Leinster and Shulman introduced the magnitude homology
groups for enriched categories, in particular, for metric spaces. The purpose
of this paper is to describe the magnitude homology group of a metric space in
terms of order complexes of posets.
In a metric space, an interval (the set of points between two chosen points)
has a natural poset structure, which is called the interval poset. Under
additional assumptions on sizes of $4$-cuts, we show that the magnitude chain
complex can be constructed using tensor products, direct sums and degree shifts
from order complexes of interval posets.
We give several applications. First, we show the vanishing of higher
magnitude homology groups for convex subsets of the Euclidean space. Second,
magnitude homology groups carry the information about the diameter of a hole.
Third, we construct a finite graph whose $3$rd magnitude homology group has
torsion.
|
math.AT math.CO math.CT math.GT math.MG
|
hepworth willerton leinster and shulman introduced the magnitude homology groups for enriched categories in particular for metric spaces the purpose of this paper is to describe the magnitude homology group of a metric space in terms of order complexes of posets in a metric space an interval the set of points between two chosen points has a natural poset structure which is called the interval poset under additional assumptions on sizes of 4cuts we show that the magnitude chain complex can be constructed using tensor products direct sums and degree shifts from order complexes of interval posets we give several applications first we show the vanishing of higher magnitude homology groups for convex subsets of the euclidean space second magnitude homology groups carry the information about the diameter of a hole third we construct a finite graph whose 3rd magnitude homology group has torsion
|
[['hepworth', 'willerton', 'leinster', 'and', 'shulman', 'introduced', 'the', 'magnitude', 'homology', 'groups', 'for', 'enriched', 'categories', 'in', 'particular', 'for', 'metric', 'spaces', 'the', 'purpose', 'of', 'this', 'paper', 'is', 'to', 'describe', 'the', 'magnitude', 'homology', 'group', 'of', 'a', 'metric', 'space', 'in', 'terms', 'of', 'order', 'complexes', 'of', 'posets', 'in', 'a', 'metric', 'space', 'an', 'interval', 'the', 'set', 'of', 'points', 'between', 'two', 'chosen', 'points', 'has', 'a', 'natural', 'poset', 'structure', 'which', 'is', 'called', 'the', 'interval', 'poset', 'under', 'additional', 'assumptions', 'on', 'sizes', 'of', '4cuts', 'we', 'show', 'that', 'the', 'magnitude', 'chain', 'complex', 'can', 'be', 'constructed', 'using', 'tensor', 'products', 'direct', 'sums', 'and', 'degree', 'shifts', 'from', 'order', 'complexes', 'of', 'interval', 'posets', 'we', 'give', 'several', 'applications', 'first', 'we', 'show', 'the', 'vanishing', 'of', 'higher', 'magnitude', 'homology', 'groups', 'for', 'convex', 'subsets', 'of', 'the', 'euclidean', 'space', 'second', 'magnitude', 'homology', 'groups', 'carry', 'the', 'information', 'about', 'the', 'diameter', 'of', 'a', 'hole', 'third', 'we', 'construct', 'a', 'finite', 'graph', 'whose', '3rd', 'magnitude', 'homology', 'group', 'has', 'torsion']]
|
[-0.20084243728225673, 0.08574683891889766, -0.06832347303414, 0.09211337131731394, -0.09239351314368781, -0.025510417040229053, 0.014546420182576859, 0.3867013646367859, -0.3199749310090617, -0.2646711351857944, 0.10922027212955136, -0.25488191171568797, -0.1245528491461402, 0.15418315934785803, -0.12686144501309504, -0.055909256851365725, 0.04441863807061544, 0.11521165143255588, -0.1048235941427545, -0.31154475425849537, 0.42026298151879043, -0.024134582729189547, 0.2063795166493921, 0.028812480630260286, 0.13104386779421068, 0.0021308449803610573, -0.03721990424592595, 0.05917258410314847, -0.19345781963728279, 0.15472274578430437, 0.2667238122370042, 0.02696960777943055, 0.21659291242705203, -0.3358964059840549, -0.15059578085482656, 0.21064978857342337, 0.0884868566441786, 0.032047645578818666, 0.009772297827741848, -0.2875955418025801, 0.1124234768379662, -0.20991944025648787, -0.09486186233759447, -0.07374146350877607, 0.06833153085170926, 0.009084149055391342, -0.2219199807488138, -0.02412379286382217, 0.05257801280415558, 0.11459376033675577, -0.04384009427736168, -0.11762127620851869, -0.0333899633708195, 0.13596807507198902, -0.0032267731425541265, 0.03859536427193667, 0.09255229841943804, -0.03432653930813231, -0.18217187941764723, 0.3839297045439065, -0.053659384436026164, -0.20425922980440872, 0.10635333749875947, -0.1856055341370345, -0.17882536538270907, 0.15643677925951519, 0.09874663169827912, 0.15649593968296072, -0.05718236976063817, 0.1399688728314896, -0.06535334626564404, 0.14490556526746784, 0.12525014945800853, 0.027086268470563984, 0.12770567330616442, 0.14257521116357114, 0.14288929239293183, 0.17701681419943258, -0.011745209074611743, -0.0560932293272955, -0.292980943331039, -0.20230673417657405, -0.14687814435374538, 0.054339572232073315, -0.17974588352335305, -0.19321446389552543, 0.4066050978787764, 0.0950408010665062, 0.16793991778073572, 0.10840874862241709, 0.2416231234255084, 0.03523206672318999, 0.08637203921814664, 0.017519423207333247, 0.13827990277481456, 0.1925004752470063, -0.016565079055075253, -0.09346206173348774, 0.02903208833259459, 0.24380517056068549]
|
1,803.04248
|
On Quaternion Shearlet Transforms
|
In this paper, we introduce the notion of quaternion shearlet transform-
which is an extension of the ordinary shearlet transform. Firstly, we study the
fundamental properties of quaternion shearlet transforms and then establish
some basic results including Moyal's and inversion formulae. Finally, we derive
the associated Heisenberg's uncertainty inequality and the corresponding
logarithmic version for quaternion shearlet transforms.
|
math.FA
|
in this paper we introduce the notion of quaternion shearlet transform which is an extension of the ordinary shearlet transform firstly we study the fundamental properties of quaternion shearlet transforms and then establish some basic results including moyals and inversion formulae finally we derive the associated heisenbergs uncertainty inequality and the corresponding logarithmic version for quaternion shearlet transforms
|
[['in', 'this', 'paper', 'we', 'introduce', 'the', 'notion', 'of', 'quaternion', 'shearlet', 'transform', 'which', 'is', 'an', 'extension', 'of', 'the', 'ordinary', 'shearlet', 'transform', 'firstly', 'we', 'study', 'the', 'fundamental', 'properties', 'of', 'quaternion', 'shearlet', 'transforms', 'and', 'then', 'establish', 'some', 'basic', 'results', 'including', 'moyals', 'and', 'inversion', 'formulae', 'finally', 'we', 'derive', 'the', 'associated', 'heisenbergs', 'uncertainty', 'inequality', 'and', 'the', 'corresponding', 'logarithmic', 'version', 'for', 'quaternion', 'shearlet', 'transforms']]
|
[-0.05497175503265241, 0.043966279745353824, -0.1435420555223165, 0.12377431709319353, -0.16590180584422215, -0.07629369846384587, -0.0595241940624466, 0.38062727798161833, -0.36505990108908637, -0.18605910185403352, 0.15194439949620323, -0.2327857742664115, -0.2897689321303162, 0.18403461447451264, -0.16700960408318147, 0.10782111979266308, -0.03041836249256699, 0.058636036364297414, -0.2197620968759895, -0.21796188137196967, 0.33420072431708203, -0.025630518055424607, 0.26090022426997794, -0.022756966264468843, 0.13291211100295186, 0.047549083499751725, -0.11044531362131238, -0.10850368437742622, -0.19186878759124926, 0.18727729593178835, 0.22138632702287928, 0.13680461351759732, 0.2602330019119485, -0.40713021925104587, -0.10474033406453914, 0.12811701007765428, 0.11873112572357059, 0.023304404975376735, -0.10980862595847454, -0.3432511850420771, 0.05848533326181872, -0.140100519606394, -0.14242312036342278, -0.15065275778158985, -0.004998059140454079, 0.04248640780610129, -0.24196331776228958, 0.1017347439834527, 0.17116266859149368, 0.07957206831859617, -0.16726263058632773, -0.07044890518541094, 0.11347025775366687, 0.009082547790402996, 0.00598815071862191, -0.04892297170590609, 0.04394395922406994, -0.017417641481031376, -0.08454243047965755, 0.41374860292878646, 0.006134200932514244, -0.30008983942840634, 0.0741380972402363, -0.1317401624140169, -0.20397629017203017, 0.03014287177236462, 0.17358488647331452, 0.06460693237725003, -0.15247835607492718, 0.14686240273194612, -0.12735297795834727, 0.12143705517117834, 0.07921495486115074, 0.10990548666951985, 0.0428325605321804, 0.034224045254161645, 0.06302934925168238, 0.23411214775967829, -0.06781575022815277, -0.08886547434818128, -0.38700941127949745, -0.28334993065399083, -0.17381352848967474, 0.030149401117373128, -0.09741455538962077, -0.15231174119780289, 0.41548035117187376, 0.12413014143962285, 0.11138026583698932, 0.1544571956278403, 0.2703033834053525, 0.2148278640775845, 0.06139011594370521, 0.002406037420612471, 0.10900052623464003, 0.2854130715934624, 0.005921026550038669, -0.15274856816013826, -0.07431886292961908, 0.20811968054301266]
|
1,803.04249
|
SO-Net: Self-Organizing Network for Point Cloud Analysis
|
This paper presents SO-Net, a permutation invariant architecture for deep
learning with orderless point clouds. The SO-Net models the spatial
distribution of point cloud by building a Self-Organizing Map (SOM). Based on
the SOM, SO-Net performs hierarchical feature extraction on individual points
and SOM nodes, and ultimately represents the input point cloud by a single
feature vector. The receptive field of the network can be systematically
adjusted by conducting point-to-node k nearest neighbor search. In recognition
tasks such as point cloud reconstruction, classification, object part
segmentation and shape retrieval, our proposed network demonstrates performance
that is similar with or better than state-of-the-art approaches. In addition,
the training speed is significantly faster than existing point cloud
recognition networks because of the parallelizability and simplicity of the
proposed architecture. Our code is available at the project website.
https://github.com/lijx10/SO-Net
|
cs.CV
|
this paper presents sonet a permutation invariant architecture for deep learning with orderless point clouds the sonet models the spatial distribution of point cloud by building a selforganizing map som based on the som sonet performs hierarchical feature extraction on individual points and som nodes and ultimately represents the input point cloud by a single feature vector the receptive field of the network can be systematically adjusted by conducting pointtonode k nearest neighbor search in recognition tasks such as point cloud reconstruction classification object part segmentation and shape retrieval our proposed network demonstrates performance that is similar with or better than stateoftheart approaches in addition the training speed is significantly faster than existing point cloud recognition networks because of the parallelizability and simplicity of the proposed architecture our code is available at the project website httpsgithubcomlijx10sonet
|
[['this', 'paper', 'presents', 'sonet', 'a', 'permutation', 'invariant', 'architecture', 'for', 'deep', 'learning', 'with', 'orderless', 'point', 'clouds', 'the', 'sonet', 'models', 'the', 'spatial', 'distribution', 'of', 'point', 'cloud', 'by', 'building', 'a', 'selforganizing', 'map', 'som', 'based', 'on', 'the', 'som', 'sonet', 'performs', 'hierarchical', 'feature', 'extraction', 'on', 'individual', 'points', 'and', 'som', 'nodes', 'and', 'ultimately', 'represents', 'the', 'input', 'point', 'cloud', 'by', 'a', 'single', 'feature', 'vector', 'the', 'receptive', 'field', 'of', 'the', 'network', 'can', 'be', 'systematically', 'adjusted', 'by', 'conducting', 'pointtonode', 'k', 'nearest', 'neighbor', 'search', 'in', 'recognition', 'tasks', 'such', 'as', 'point', 'cloud', 'reconstruction', 'classification', 'object', 'part', 'segmentation', 'and', 'shape', 'retrieval', 'our', 'proposed', 'network', 'demonstrates', 'performance', 'that', 'is', 'similar', 'with', 'or', 'better', 'than', 'stateoftheart', 'approaches', 'in', 'addition', 'the', 'training', 'speed', 'is', 'significantly', 'faster', 'than', 'existing', 'point', 'cloud', 'recognition', 'networks', 'because', 'of', 'the', 'parallelizability', 'and', 'simplicity', 'of', 'the', 'proposed', 'architecture', 'our', 'code', 'is', 'available', 'at', 'the', 'project', 'website', 'httpsgithubcomlijx10sonet']]
|
[-0.08095107257449582, -0.04109367901292532, -0.06702843414438861, 0.013404213033665194, -0.0700852236573223, -0.1753161845291329, 0.0587834449243426, 0.44123132415671845, -0.27464654434944935, -0.3178369856870441, 0.05645397359613023, -0.2617728203159771, -0.17965583340134542, 0.1477208734966064, -0.08015711396696296, 0.07281474021842022, 0.12456618601442385, 0.07079837338498501, -0.060199169670544395, -0.28723053546594596, 0.31357157196842633, 0.11561473817786083, 0.3785282083710572, -0.02467344374979721, 0.11024557252122617, -0.035194302950777225, -0.043299627605019445, -0.04230435604903736, -0.0033846085923380713, 0.17706303778729998, 0.271286372874987, 0.1924188003185511, 0.25341827508562537, -0.35078186648828324, -0.25486563019621283, 0.08333425669680669, 0.18631516307342186, 0.07612799243556696, -0.03568427516329936, -0.3485475632904181, 0.10668735175372672, -0.14330714166949768, -0.03481131204431737, -0.1131735451201519, -0.005727907016338196, 0.00856266857329895, -0.2615464479287169, 0.0059996932717179185, 0.08437339104051743, 0.10764561860245277, -0.026443964819104146, -0.15255119891163074, -0.005517992194491758, 0.1405299948893293, -0.04074502974720811, 0.1455754901928855, 0.21199251633526675, -0.19228244078199644, -0.1025506024207197, 0.3967882325844978, -0.04965352104154047, -0.1802109844918335, 0.2184247374621484, -0.014032628209983458, -0.1449843124528207, 0.11211898333545942, 0.21217051839348233, 0.09288665857305055, -0.16662971391134077, 0.024893044797293564, -0.033870726226092274, 0.17737823450844908, 0.021261630840460535, -0.034449409413735255, 0.23601260650103717, 0.28534848315279876, 0.08455337127522955, 0.15638580170300193, -0.1854981118813157, -0.1125527535384493, -0.16330161063111762, -0.11827752123927392, -0.2188377892077247, -0.039706746237908506, -0.15594124567734927, -0.12734267088834808, 0.4048943400605401, 0.21312873150611214, 0.22620235787315376, 0.09633707786812934, 0.37599721910960193, 0.014788406564847135, 0.16469292835429755, 0.14347355831900974, 0.15709735630531865, -0.03203683134008532, 0.1246532764539484, -0.15759301490372798, 0.07845835147404683, 0.11722979234156213]
|
1,803.0425
|
Effects of dark energy on $P-V$ criticality and efficiency of charged
Rotational black hole
|
In this paper, we study $P-V$ criticality of Kerr-Newman $AdS$ black hole
with a quintessence field. We calculate critical quantities and show that for
the equation state parameter $\omega= -\frac{1}{3}$, the obtained universal
ratio ($\frac{P_{c}\upsilon_{c}}{T_{c}}$) is quite same as Kerr-Newman $AdS$
black hole without dark energy parameter. We investigate the influence of
quintessence field $\alpha$, equation state parameter $\omega$ and angular
momentum $J$ on the efficiency $\eta$. We find that $\eta$ is increased by
increasing $J$ and $\alpha$ and decreasing charge $Q$ of black hole. We show
when $\omega$ increases from $-1$ to $-\frac{1}{3}$ the efficiency decreases.
Also we study ratio $\frac{\eta}{\eta_{C}}$ (which $\eta_{C}$ is the Carnot
efficiency) and see that the second law of the thermodynamics is satisfied by
special values of $J$ and $\alpha$ and holds for any value of $Q$. We notice
that in this case by increasing $\omega$ from $-1$ to $-\frac{1}{3}$ the range
of $J$ and $\alpha$ increases.
|
hep-th gr-qc
|
in this paper we study pv criticality of kerrnewman ads black hole with a quintessence field we calculate critical quantities and show that for the equation state parameter omega frac13 the obtained universal ratio fracp_cupsilon_ct_c is quite same as kerrnewman ads black hole without dark energy parameter we investigate the influence of quintessence field alpha equation state parameter omega and angular momentum j on the efficiency eta we find that eta is increased by increasing j and alpha and decreasing charge q of black hole we show when omega increases from 1 to frac13 the efficiency decreases also we study ratio fracetaeta_c which eta_c is the carnot efficiency and see that the second law of the thermodynamics is satisfied by special values of j and alpha and holds for any value of q we notice that in this case by increasing omega from 1 to frac13 the range of j and alpha increases
|
[['in', 'this', 'paper', 'we', 'study', 'pv', 'criticality', 'of', 'kerrnewman', 'ads', 'black', 'hole', 'with', 'a', 'quintessence', 'field', 'we', 'calculate', 'critical', 'quantities', 'and', 'show', 'that', 'for', 'the', 'equation', 'state', 'parameter', 'omega', 'frac13', 'the', 'obtained', 'universal', 'ratio', 'fracp_cupsilon_ct_c', 'is', 'quite', 'same', 'as', 'kerrnewman', 'ads', 'black', 'hole', 'without', 'dark', 'energy', 'parameter', 'we', 'investigate', 'the', 'influence', 'of', 'quintessence', 'field', 'alpha', 'equation', 'state', 'parameter', 'omega', 'and', 'angular', 'momentum', 'j', 'on', 'the', 'efficiency', 'eta', 'we', 'find', 'that', 'eta', 'is', 'increased', 'by', 'increasing', 'j', 'and', 'alpha', 'and', 'decreasing', 'charge', 'q', 'of', 'black', 'hole', 'we', 'show', 'when', 'omega', 'increases', 'from', '1', 'to', 'frac13', 'the', 'efficiency', 'decreases', 'also', 'we', 'study', 'ratio', 'fracetaeta_c', 'which', 'eta_c', 'is', 'the', 'carnot', 'efficiency', 'and', 'see', 'that', 'the', 'second', 'law', 'of', 'the', 'thermodynamics', 'is', 'satisfied', 'by', 'special', 'values', 'of', 'j', 'and', 'alpha', 'and', 'holds', 'for', 'any', 'value', 'of', 'q', 'we', 'notice', 'that', 'in', 'this', 'case', 'by', 'increasing', 'omega', 'from', '1', 'to', 'frac13', 'the', 'range', 'of', 'j', 'and', 'alpha', 'increases']]
|
[-0.17860705208724106, 0.15931823577682505, -0.00672022814843927, 0.04696488379352782, -0.04592271287931709, -0.16649433662374782, 0.07759401048703231, 0.2898517269209422, -0.19176448472090904, -0.2984837302876427, 0.02431103478136491, -0.3381488286467602, -0.06777185536088384, 0.19011655860327628, -0.029337086326239124, 0.02298598400625903, -0.018913286892290146, 0.061751421207919814, -0.06130691643940001, -0.18506569073794546, 0.38495058783434877, 0.05504600134437645, 0.23489135652795953, 0.06522022192952352, 0.07053714669278718, 0.004689909509983143, 0.04483507643299584, 0.046533147233926896, -0.27888530598038236, 0.011004204876082549, 0.19849112756328274, 0.09921011379580723, 0.23326606357473817, -0.2791936748741281, -0.19737099672957564, 0.13631931280051143, 0.16282009060143043, 0.045763519601063764, -0.02840081204287091, -0.2170180007059818, 0.13562280541310542, -0.21448050336511373, -0.15885465134194257, -0.0588931369669242, 0.1347867065982042, 0.025371472409846173, -0.2805850916906007, 0.1500029694179107, 0.09169064590164663, -0.039920057799198376, -0.11872211862540502, -0.13751724753405478, -0.04773841679731495, 0.07144173589902807, 0.13283712971980208, 0.09549766659292559, 0.15950733200579092, -0.17235705795519005, -0.055734353744431045, 0.32131584173389127, -0.07746886886002509, -0.1889792735632879, 0.09478282846744783, -0.26604595036239714, -0.10005475412506845, 0.0783637606235073, 0.10413047122855405, 0.1709105630927285, -0.03755337070098952, 0.18443133626503266, 0.017720436754432932, 0.22684283275773984, 0.09797654225065416, 0.008284122729365597, 0.18472993499691912, 0.08128866261420216, 0.056707294130488146, 0.16568732086495058, -0.05863360200071128, -0.07678823851801406, -0.3059895278034818, -0.19994462976565228, -0.18530089694803076, 0.1231340074183925, -0.1744712107430909, -0.07964173272646816, 0.2863034757643642, 0.12311239187476157, 0.2275136830994477, 0.03067417440408631, 0.21047778253671745, 0.1850862756536484, -0.03728178943760249, 0.11914235832854267, 0.29586625000653133, 0.0967197309214227, 0.16312546359794522, -0.27429866788786256, -0.050112000715900336, 0.04976090643283547]
|
1,803.04251
|
Octet baryon magnetic moments at next-to-next-to-leading order in
covariant chiral perturbation theory
|
We calculate the octet baryon magnetic moments in covariant baryon chiral
perturbation theory with the extended-on-mass-shell renormalization scheme up
to next-to-next-to-leading order. At this order, there are nine low-energy
constants, which cannot be uniquely determined by the seven experimental data
alone. We propose two strategies to circumvent this problem. First, we assume
that chiral perturbation theory has a certain convergence rate and use this as
one additional constraint to fix the low-energy constants by fitting to the
experimental data. Second, we fit to lattice QCD simulations to determine the
low-energy constants. We then compare the resulting predictions of the light
and strange quark mass dependence of the octet baryon magnetic moments by the
three mostly studied formulations of baryon chiral perturbation theory, namely,
the extended-on-mass-shell, the infrared, and the heavy baryon approach. It is
shown that once more precise lattice data become available, one will learn more
about the convergence pattern of baryon chiral perturbation theory.
|
hep-ph hep-lat
|
we calculate the octet baryon magnetic moments in covariant baryon chiral perturbation theory with the extendedonmassshell renormalization scheme up to nexttonexttoleading order at this order there are nine lowenergy constants which cannot be uniquely determined by the seven experimental data alone we propose two strategies to circumvent this problem first we assume that chiral perturbation theory has a certain convergence rate and use this as one additional constraint to fix the lowenergy constants by fitting to the experimental data second we fit to lattice qcd simulations to determine the lowenergy constants we then compare the resulting predictions of the light and strange quark mass dependence of the octet baryon magnetic moments by the three mostly studied formulations of baryon chiral perturbation theory namely the extendedonmassshell the infrared and the heavy baryon approach it is shown that once more precise lattice data become available one will learn more about the convergence pattern of baryon chiral perturbation theory
|
[['we', 'calculate', 'the', 'octet', 'baryon', 'magnetic', 'moments', 'in', 'covariant', 'baryon', 'chiral', 'perturbation', 'theory', 'with', 'the', 'extendedonmassshell', 'renormalization', 'scheme', 'up', 'to', 'nexttonexttoleading', 'order', 'at', 'this', 'order', 'there', 'are', 'nine', 'lowenergy', 'constants', 'which', 'can', 'not', 'be', 'uniquely', 'determined', 'by', 'the', 'seven', 'experimental', 'data', 'alone', 'we', 'propose', 'two', 'strategies', 'to', 'circumvent', 'this', 'problem', 'first', 'we', 'assume', 'that', 'chiral', 'perturbation', 'theory', 'has', 'a', 'certain', 'convergence', 'rate', 'and', 'use', 'this', 'as', 'one', 'additional', 'constraint', 'to', 'fix', 'the', 'lowenergy', 'constants', 'by', 'fitting', 'to', 'the', 'experimental', 'data', 'second', 'we', 'fit', 'to', 'lattice', 'qcd', 'simulations', 'to', 'determine', 'the', 'lowenergy', 'constants', 'we', 'then', 'compare', 'the', 'resulting', 'predictions', 'of', 'the', 'light', 'and', 'strange', 'quark', 'mass', 'dependence', 'of', 'the', 'octet', 'baryon', 'magnetic', 'moments', 'by', 'the', 'three', 'mostly', 'studied', 'formulations', 'of', 'baryon', 'chiral', 'perturbation', 'theory', 'namely', 'the', 'extendedonmassshell', 'the', 'infrared', 'and', 'the', 'heavy', 'baryon', 'approach', 'it', 'is', 'shown', 'that', 'once', 'more', 'precise', 'lattice', 'data', 'become', 'available', 'one', 'will', 'learn', 'more', 'about', 'the', 'convergence', 'pattern', 'of', 'baryon', 'chiral', 'perturbation', 'theory']]
|
[-0.09505397066026096, 0.19929586127578358, -0.10181754490858905, 0.11213215804884245, -0.10772600755759865, -0.0842363670035295, 0.06990221557563325, 0.3365850177813013, -0.23115130282262233, -0.2781438902850933, 0.047583729532179514, -0.3189980399077106, -0.07237032522109284, 0.069766026950118, 0.051341642649357866, 0.07092438797187653, -0.01998904213949943, 0.07286168207639863, -0.07639948912795372, -0.27470042035102277, 0.3202011130489172, -0.005943488454220781, 0.2590978335245115, 0.09944264167492652, 0.04096569175087509, -0.018280252482101415, -0.04885227573667742, -0.012877551512496107, -0.18036460996485704, 0.11219197393700504, 0.21486352648453305, 0.04187405021018853, 0.17813676667984005, -0.4220450714491545, -0.18873388590558082, 0.09366129511065639, 0.14642474399938896, 0.2202280176681864, -0.03832163408811643, -0.23849879213828284, 0.13314662835187024, -0.1872235086693126, -0.1920614253668779, -0.21455522350207634, -0.05376655244487961, -0.04548173943522629, -0.3180963229417659, 0.09633186772008942, -0.06974530227150127, 0.03068716837698297, -0.04680098612217387, -0.138970772421379, -0.04222896877100846, 0.07440897436874806, 0.12265605403994252, 0.08090133349274754, 0.11601212107024755, -0.11845739905879638, -0.11796693023068795, 0.43444479848881057, -0.07896529973460847, -0.13834475273630512, 0.0744081676795272, -0.16801266532070983, -0.18546223906491688, 0.10480343539172866, 0.1376510665390142, 0.1008304857061642, -0.21244620736451095, 0.08844437349215446, -0.02253365641382707, 0.18256037635728717, 0.08042889306392924, 0.03259419850637294, 0.18720351279992017, 0.12697174098894332, 0.018182469827751777, 0.021417512290719542, -0.052704015183173546, -0.08467540397029963, -0.3521857750928326, -0.007005493048353085, -0.17805035306425515, 0.029365840247942723, -0.10508472172835928, -0.12952949487703191, 0.3860896584292335, 0.1691477986803029, 0.20656025380631732, 0.014885828144415312, 0.34014577235860427, 0.12237644872915854, 0.09417632563858275, 0.055472536908260955, 0.2840108600842535, 0.2182575551315454, 0.0960581592324184, -0.2987520465477901, -0.06288048633000558, 0.1161465899035213]
|
1,803.04252
|
Programmable Metasurfaces: State of the Art and Prospects
|
Metasurfaces, ultrathin and planar electromagnetic devices with
sub-wavelength unit cells, have recently attracted enormous attention for their
powerful control over electromagnetic waves, from microwave to visible range.
With tunability added to the unit cells, the programmable metasurfaces enable
us to benefit from multiple unique functionalities controlled by external
stimuli. In this review paper, we will discuss the recent progress in the field
of programmable metasurfaces and elaborate on different approaches to realize
them, with the tunability from global aspects, to local aspects, and to
software-defined metasurfaces.
|
physics.app-ph
|
metasurfaces ultrathin and planar electromagnetic devices with subwavelength unit cells have recently attracted enormous attention for their powerful control over electromagnetic waves from microwave to visible range with tunability added to the unit cells the programmable metasurfaces enable us to benefit from multiple unique functionalities controlled by external stimuli in this review paper we will discuss the recent progress in the field of programmable metasurfaces and elaborate on different approaches to realize them with the tunability from global aspects to local aspects and to softwaredefined metasurfaces
|
[['metasurfaces', 'ultrathin', 'and', 'planar', 'electromagnetic', 'devices', 'with', 'subwavelength', 'unit', 'cells', 'have', 'recently', 'attracted', 'enormous', 'attention', 'for', 'their', 'powerful', 'control', 'over', 'electromagnetic', 'waves', 'from', 'microwave', 'to', 'visible', 'range', 'with', 'tunability', 'added', 'to', 'the', 'unit', 'cells', 'the', 'programmable', 'metasurfaces', 'enable', 'us', 'to', 'benefit', 'from', 'multiple', 'unique', 'functionalities', 'controlled', 'by', 'external', 'stimuli', 'in', 'this', 'review', 'paper', 'we', 'will', 'discuss', 'the', 'recent', 'progress', 'in', 'the', 'field', 'of', 'programmable', 'metasurfaces', 'and', 'elaborate', 'on', 'different', 'approaches', 'to', 'realize', 'them', 'with', 'the', 'tunability', 'from', 'global', 'aspects', 'to', 'local', 'aspects', 'and', 'to', 'softwaredefined', 'metasurfaces']]
|
[-0.12584633807933263, 0.12134510342324109, 0.008821063924061005, -0.09894252084547567, -0.1769715158193004, -0.16730441111898006, 0.0459181796881197, 0.5170157577322666, -0.2519089066271865, -0.32017005152653816, 0.023376165268547442, -0.2623845609392278, -0.2342013265872591, 0.25555070184257833, -0.09204842124220937, 0.10050946267235071, -0.033562247132405985, -0.10362516306503135, -0.030572535811252025, -0.1770916487777952, 0.24708135273892345, 0.04387892223894596, 0.355978709439812, 0.06130088770458864, 0.13526651003062293, 0.0148806877652194, -0.005988150596791922, -0.02320532982513785, -0.11334634639274026, 0.23040650521816555, 0.28100784483831376, 0.05852859225773881, 0.28260535610363235, -0.5699770234005396, -0.2895576248790116, 0.0472362638711063, 0.14514222435739843, 0.12165395966406133, -0.10861990501059132, -0.31980258633577546, 0.09983429427496916, -0.15757124349041735, -0.135186501721639, -0.10279182186566813, -0.0031892306450212937, 0.056502202325392256, -0.18829417798321607, -0.11597471458967341, -0.002832716249665895, 0.050483043489674494, -0.04165495356472431, -0.038786308428402555, 0.04287896266337051, 0.12466159997897786, 0.011351947423590476, 0.018328494294871423, 0.1736004256675843, -0.1552968849076045, -0.1744286421426507, 0.3444807739971682, 0.011876033007188938, -0.1598356334806615, 0.19926568420419774, -0.15541803584972852, -0.04779190318334068, 0.12760446327034558, 0.25707144077953903, 0.06031615176606317, -0.15524861505688275, 0.0957946034539545, 0.050993837600270674, 0.15256671848446998, 0.10873301510163888, 0.1789485732375016, 0.3143631830205058, 0.17554535958807654, 0.05633419013289778, 0.13549819877262897, -0.014754896107343632, -0.01139359047289851, -0.18577759439561536, -0.103644669619064, -0.15314672001215174, 0.052579827032723396, -0.05395361491080325, -0.16813223717495973, 0.4505507895062396, 0.20013074926642138, 0.12106698103855516, -0.005507166326847361, 0.34484313038545983, 0.021941106333289037, 0.18967601180152405, -0.02081433678219138, 0.2895851969302004, 0.1727348912566857, 0.23243526611774942, -0.17036360515508975, -0.031257574041753056, -0.06002781726419926]
|
1,803.04253
|
Neutrinos propagating in curved spacetimes
|
In the Dirac-Weyl equation that describes massless neutrino propagation in
the minimal Standard Model, the ($2\times 2$ equivalence of the) gamma matrices
convert Weyl spinors into spacetime tensors, and vice versa. They can thus be
regarded as amalgamations of three different types of mappings, one that
connects particle spinors directly forming representations to internal gauge
symmetries to their spacetime counterparts that are embodied by null flags,
another that translates the spacetime spinors into their corresponding tensors
expressed in an orthonormal tetrad, and finally a purely tensorial
transformation into the coordinate tetrad. The splitting of spinors into
particle and spacetime varieties is not usually practised, but we advocate its
adoption for better physical clarity, in terms of distinguishing internal and
spacetime transformations, and also for understanding the scattering of
neutrinos by spacetime curvature. We construct the basic infrastructure
required for this task, and provide a worked example for the Schwarzschild
spacetime. Our investigation also uncovers a possible under-determinacy in the
flavoured Dirac-Weyl equation, which could serve as a new incision point for
introducing flavour oscillation mechanisms.
|
physics.gen-ph hep-th
|
in the diracweyl equation that describes massless neutrino propagation in the minimal standard model the 2times 2 equivalence of the gamma matrices convert weyl spinors into spacetime tensors and vice versa they can thus be regarded as amalgamations of three different types of mappings one that connects particle spinors directly forming representations to internal gauge symmetries to their spacetime counterparts that are embodied by null flags another that translates the spacetime spinors into their corresponding tensors expressed in an orthonormal tetrad and finally a purely tensorial transformation into the coordinate tetrad the splitting of spinors into particle and spacetime varieties is not usually practised but we advocate its adoption for better physical clarity in terms of distinguishing internal and spacetime transformations and also for understanding the scattering of neutrinos by spacetime curvature we construct the basic infrastructure required for this task and provide a worked example for the schwarzschild spacetime our investigation also uncovers a possible underdeterminacy in the flavoured diracweyl equation which could serve as a new incision point for introducing flavour oscillation mechanisms
|
[['in', 'the', 'diracweyl', 'equation', 'that', 'describes', 'massless', 'neutrino', 'propagation', 'in', 'the', 'minimal', 'standard', 'model', 'the', '2times', '2', 'equivalence', 'of', 'the', 'gamma', 'matrices', 'convert', 'weyl', 'spinors', 'into', 'spacetime', 'tensors', 'and', 'vice', 'versa', 'they', 'can', 'thus', 'be', 'regarded', 'as', 'amalgamations', 'of', 'three', 'different', 'types', 'of', 'mappings', 'one', 'that', 'connects', 'particle', 'spinors', 'directly', 'forming', 'representations', 'to', 'internal', 'gauge', 'symmetries', 'to', 'their', 'spacetime', 'counterparts', 'that', 'are', 'embodied', 'by', 'null', 'flags', 'another', 'that', 'translates', 'the', 'spacetime', 'spinors', 'into', 'their', 'corresponding', 'tensors', 'expressed', 'in', 'an', 'orthonormal', 'tetrad', 'and', 'finally', 'a', 'purely', 'tensorial', 'transformation', 'into', 'the', 'coordinate', 'tetrad', 'the', 'splitting', 'of', 'spinors', 'into', 'particle', 'and', 'spacetime', 'varieties', 'is', 'not', 'usually', 'practised', 'but', 'we', 'advocate', 'its', 'adoption', 'for', 'better', 'physical', 'clarity', 'in', 'terms', 'of', 'distinguishing', 'internal', 'and', 'spacetime', 'transformations', 'and', 'also', 'for', 'understanding', 'the', 'scattering', 'of', 'neutrinos', 'by', 'spacetime', 'curvature', 'we', 'construct', 'the', 'basic', 'infrastructure', 'required', 'for', 'this', 'task', 'and', 'provide', 'a', 'worked', 'example', 'for', 'the', 'schwarzschild', 'spacetime', 'our', 'investigation', 'also', 'uncovers', 'a', 'possible', 'underdeterminacy', 'in', 'the', 'flavoured', 'diracweyl', 'equation', 'which', 'could', 'serve', 'as', 'a', 'new', 'incision', 'point', 'for', 'introducing', 'flavour', 'oscillation', 'mechanisms']]
|
[-0.1435760477138683, 0.17979488815921027, -0.07858362827183944, 0.11207525978995753, -0.1468521134102983, -0.16173945671479617, -0.011083002407769008, 0.3284584716840514, -0.2360338252463511, -0.2610265448430021, 0.045400599548593164, -0.24238029838406613, -0.14844029359652527, 0.12342269085347653, -0.017300343184864946, -0.019228188097809573, 0.0017547835848693337, 0.029595345305445206, -0.12986804881499017, -0.20731184452173432, 0.3586325426426317, 0.04655519605614245, 0.25890717111660966, 0.0011503024332757507, 0.15264678785577415, 0.006207851784835969, -0.03375963762136442, -0.022496503839003187, -0.055090719478238105, 0.08421969392203858, 0.24883051070251636, 0.1548106699170811, 0.15550253536419145, -0.4446032065046685, -0.2154792669681566, 0.10317806887839522, 0.20426169112723852, 0.09170802138729155, -0.025855742309442056, -0.33893703251012736, 0.021285139749358806, -0.1455581890166338, -0.16663241554384253, -0.1290159350101437, -0.005886888940752085, -0.0762871245068631, -0.20042640794334668, 0.05903776007278273, 0.10016222144876208, 0.022247060053050518, -0.09635439604188183, -0.11534448048232922, -0.05932839150274438, 0.09257631859342967, 0.08401797221241784, -0.010783966001389282, 0.10933597950131765, -0.10278156359413905, -0.12936143242620995, 0.444659110459366, -0.024118593656956882, -0.3359843662594046, 0.14660280884908777, -0.11437794472473407, -0.11320392507261463, 0.06949141991191676, 0.16611680567530648, 0.08277182192275567, -0.17687710308070695, 0.11369655221501099, -0.0411646782101265, 0.08054304190262752, 0.10715703047545892, 0.045079215594700406, 0.25724031870652525, 0.08559551465325058, 0.04089384241561805, 0.09782821379535432, 0.01561360233330301, -0.08154730619031138, -0.389993134321911, -0.2276568716218961, -0.12424860968886475, 0.10930401818702064, -0.15411310773559048, -0.1500987619387784, 0.4180325542709657, 0.10563941115280613, 0.15001650333936725, 0.011155182367323765, 0.24312094836362771, 0.09666211568683918, 0.07112050158237772, 0.07239727118950604, 0.23941574194867696, 0.15355050135403872, 0.08125108095418129, -0.16830876167597517, -0.053631106146744316, 0.12360699256349887]
|
1,803.04254
|
Efficient construction of Bayes optimal designs for stochastic process
models
|
Stochastic process models are now commonly used to analyse complex
biological, ecological and industrial systems. Increasingly there is a need to
deliver accurate estimates of model parameters and assess model fit by
optimizing the timing of measurement of these processes. Standard methods to
construct Bayes optimal designs, such as the well known \Muller algorithm, are
computationally intensive even for relatively simple models. A key issue is
that, in determining the merit of a design, the utility function typically
requires summaries of many parameter posterior distributions, each determined
via a computer-intensive scheme such as MCMC. This paper describes a fast and
computationally efficient scheme to determine optimal designs for stochastic
process models. The algorithm compares favourably with other methods for
determining optimal designs and can require up to an order of magnitude fewer
utility function evaluations for the same accuracy in the optimal design
solution. It benefits from being embarrassingly parallel and is ideal for
running on multi-core computers. The method is illustrated by determining
different sized optimal designs for three problems of increasing complexity.
|
stat.CO
|
stochastic process models are now commonly used to analyse complex biological ecological and industrial systems increasingly there is a need to deliver accurate estimates of model parameters and assess model fit by optimizing the timing of measurement of these processes standard methods to construct bayes optimal designs such as the well known muller algorithm are computationally intensive even for relatively simple models a key issue is that in determining the merit of a design the utility function typically requires summaries of many parameter posterior distributions each determined via a computerintensive scheme such as mcmc this paper describes a fast and computationally efficient scheme to determine optimal designs for stochastic process models the algorithm compares favourably with other methods for determining optimal designs and can require up to an order of magnitude fewer utility function evaluations for the same accuracy in the optimal design solution it benefits from being embarrassingly parallel and is ideal for running on multicore computers the method is illustrated by determining different sized optimal designs for three problems of increasing complexity
|
[['stochastic', 'process', 'models', 'are', 'now', 'commonly', 'used', 'to', 'analyse', 'complex', 'biological', 'ecological', 'and', 'industrial', 'systems', 'increasingly', 'there', 'is', 'a', 'need', 'to', 'deliver', 'accurate', 'estimates', 'of', 'model', 'parameters', 'and', 'assess', 'model', 'fit', 'by', 'optimizing', 'the', 'timing', 'of', 'measurement', 'of', 'these', 'processes', 'standard', 'methods', 'to', 'construct', 'bayes', 'optimal', 'designs', 'such', 'as', 'the', 'well', 'known', 'muller', 'algorithm', 'are', 'computationally', 'intensive', 'even', 'for', 'relatively', 'simple', 'models', 'a', 'key', 'issue', 'is', 'that', 'in', 'determining', 'the', 'merit', 'of', 'a', 'design', 'the', 'utility', 'function', 'typically', 'requires', 'summaries', 'of', 'many', 'parameter', 'posterior', 'distributions', 'each', 'determined', 'via', 'a', 'computerintensive', 'scheme', 'such', 'as', 'mcmc', 'this', 'paper', 'describes', 'a', 'fast', 'and', 'computationally', 'efficient', 'scheme', 'to', 'determine', 'optimal', 'designs', 'for', 'stochastic', 'process', 'models', 'the', 'algorithm', 'compares', 'favourably', 'with', 'other', 'methods', 'for', 'determining', 'optimal', 'designs', 'and', 'can', 'require', 'up', 'to', 'an', 'order', 'of', 'magnitude', 'fewer', 'utility', 'function', 'evaluations', 'for', 'the', 'same', 'accuracy', 'in', 'the', 'optimal', 'design', 'solution', 'it', 'benefits', 'from', 'being', 'embarrassingly', 'parallel', 'and', 'is', 'ideal', 'for', 'running', 'on', 'multicore', 'computers', 'the', 'method', 'is', 'illustrated', 'by', 'determining', 'different', 'sized', 'optimal', 'designs', 'for', 'three', 'problems', 'of', 'increasing', 'complexity']]
|
[-0.062072588445286896, 0.025194561620856416, -0.0397619513511101, 0.11012812566033303, -0.08140708903257532, -0.18314589985817586, 0.04509417554323465, 0.4328122230610628, -0.2645880838791872, -0.36526969236846285, 0.1444470356472757, -0.22597468359631367, -0.1596460134840046, 0.28456816456719547, -0.07064462101472349, 0.14881608980084265, 0.0797217233203214, -0.035255402901969934, -0.059586530551314354, -0.26952100445612753, 0.23884493813982083, 0.10544069175041099, 0.30750836697460593, -0.03761332027410724, 0.1318617671936879, -0.008429037142095381, -0.04740542505269645, 0.005093885940514992, -0.12377874748454323, 0.1346824767025209, 0.30197176880662074, 0.1816463077082245, 0.3319875676580972, -0.38563352808270646, -0.18884102297390157, 0.12534754848624205, 0.15742073974527965, 0.09769225290885473, -0.016205424174596823, -0.1793261489305035, 0.07990231912702873, -0.16456490789871964, -0.11099213723698095, -0.14058927565360785, -0.012194809933385715, 0.05904269926838748, -0.3457932107367328, 0.030651368377409106, -0.01084776995529624, 0.02984915398617928, -0.010688989526249639, -0.1649172921830938, 0.05282400697255614, 0.13153027339260384, 0.02750931424189134, 0.009305102270278523, 0.1350622171022255, -0.12353481397088938, -0.15927539492325707, 0.38094411470295714, -0.008981103415402916, -0.23561151369375138, 0.18644456558488845, -0.029745127368804025, -0.12132933776793552, 0.13325754777747795, 0.19764121998658127, 0.13260406504609976, -0.18062843632316966, 0.05342465808886724, 0.017099740919683814, 0.1636170485109123, 0.00669607382010797, -0.003074081509237595, 0.14496835750987988, 0.23346159788084098, 0.10479912534857908, 0.12480020860842986, -0.015172044780030418, -0.13074334122069264, -0.22770784767384739, -0.14132028840133992, -0.19347170965703225, -0.005859154276549816, -0.12998732506528687, -0.18004257463710918, 0.3564197840437948, 0.207243154059571, 0.15976003082683202, 0.07908860973922814, 0.3700169996604666, 0.10182332830341671, 0.05817879355330577, 0.08796725019641306, 0.18990954047272346, 0.06319300639148716, 0.04508114122550121, -0.19173470892991615, 0.1383878721336395, 0.024310947481500006]
|
1,803.04255
|
Hydrogenation driven formation of local magnetic moments in FeO$_2$H$_x$
|
The electronic and magnetic properties of recently discovered new important
constituent of the Earth's lower mantle FeO2H were investigated by means of the
density functional theory combined with the dynamical mean field theory
(DFT+DMFT). Addition of the hydrogen to the parent FeO2 compound, which is an
uncorrelated bad metal, destroys the most important ingredient of its
electronic structure - O-O molecular orbitals. In effect physical properties of
FeO2 and FeO2H turn to be completely different, FeO2H is a correlated metal
with a mass renormalization, m*/m ~ 2, and magnetic moments on Fe ions become
well localized with the Curie-Weiss type of uniform magnetic susceptibility.
|
cond-mat.str-el
|
the electronic and magnetic properties of recently discovered new important constituent of the earths lower mantle feo2h were investigated by means of the density functional theory combined with the dynamical mean field theory dftdmft addition of the hydrogen to the parent feo2 compound which is an uncorrelated bad metal destroys the most important ingredient of its electronic structure oo molecular orbitals in effect physical properties of feo2 and feo2h turn to be completely different feo2h is a correlated metal with a mass renormalization mm 2 and magnetic moments on fe ions become well localized with the curieweiss type of uniform magnetic susceptibility
|
[['the', 'electronic', 'and', 'magnetic', 'properties', 'of', 'recently', 'discovered', 'new', 'important', 'constituent', 'of', 'the', 'earths', 'lower', 'mantle', 'feo2h', 'were', 'investigated', 'by', 'means', 'of', 'the', 'density', 'functional', 'theory', 'combined', 'with', 'the', 'dynamical', 'mean', 'field', 'theory', 'dftdmft', 'addition', 'of', 'the', 'hydrogen', 'to', 'the', 'parent', 'feo2', 'compound', 'which', 'is', 'an', 'uncorrelated', 'bad', 'metal', 'destroys', 'the', 'most', 'important', 'ingredient', 'of', 'its', 'electronic', 'structure', 'oo', 'molecular', 'orbitals', 'in', 'effect', 'physical', 'properties', 'of', 'feo2', 'and', 'feo2h', 'turn', 'to', 'be', 'completely', 'different', 'feo2h', 'is', 'a', 'correlated', 'metal', 'with', 'a', 'mass', 'renormalization', 'mm', '2', 'and', 'magnetic', 'moments', 'on', 'fe', 'ions', 'become', 'well', 'localized', 'with', 'the', 'curieweiss', 'type', 'of', 'uniform', 'magnetic', 'susceptibility']]
|
[-0.10366166386594676, 0.2088349818620961, -0.03896634284333855, 0.0631162589164816, -0.02260506921904344, -0.08836494865667477, 0.05574916086762267, 0.34433221154134064, -0.2566052572858776, -0.2998370636898257, 0.009778658780680202, -0.29940866933925553, -0.1250863552970045, 0.11100729094366268, 0.06812501508815616, -0.0010805810275533255, -0.04979906892221348, 0.01707888039869859, -0.11053765929468415, -0.20202910943714647, 0.29311562845410377, 0.08437375950754858, 0.26070555724322286, 0.07725170664101218, 0.020720017902717432, -0.013257434710348938, 0.06364032390353945, 0.05054322728777633, -0.11252791488397063, 0.12912390404609123, 0.19722923143839866, -0.02691563225679976, 0.22648555977388704, -0.4684586075006747, -0.22532007183055577, -0.02024988026424384, 0.0955402754594152, 0.09841657908720092, -0.07642096029160836, -0.27633668464042394, 0.05458344416875465, -0.1415947051718831, -0.18254717074645063, -0.08208866393440128, -0.0037486086560723684, 0.037538133840094884, -0.24766415378418935, 0.1127967649349468, 0.05456633609691041, 0.13902765923344038, -0.1161150187082753, -0.1840503519473999, -0.10204325268711603, 0.0869335848198948, 0.06190551951180632, 0.06685694575528889, 0.18759178451613942, -0.09320152311200075, -0.03748288041656362, 0.3818428428054961, -0.0482115272259084, -0.07347633201154131, 0.2053921042083233, -0.17174460363857375, -0.14143201418896661, 0.1778794566361124, 0.09850359971032423, 0.10173317547613646, -0.17172633032268828, 0.08283812503213994, -0.015185065417979643, 0.19427187403426596, -0.00145342249386743, 0.11088257341864793, 0.2407697253933578, 0.15752113328370101, 0.008741458816289464, 0.11086359139253367, -0.11269704610629774, -0.09638201315229868, -0.1712330515067294, -0.18255694540144474, -0.18486021943481676, 0.07669564248884425, -0.09599101882928403, -0.233841558384216, 0.3751248641706565, 0.10941737303145084, 0.14602646076430878, -0.09878599341369837, 0.2249162307502154, 0.09685970923187685, 0.06529872628001898, 0.041419302083679714, 0.2281584668101049, 0.2654203518759459, 0.06962265153004624, -0.25841998803548005, 0.13593614374415255, 0.06210597237234241]
|
1,803.04256
|
Evolving topologically deformed wormholes supported in the dark matter
halo
|
In this paper, we construct an evolving wormhole in the dark matter halo.
This work is relevant since matter has two components: (i) cosmological part
(only time-dependent) and (ii) wormhole part (only space-dependent). In order
to implement this, we use the Chaplygin gas as an equation of state for the
cosmic part and Navarro-Frenk-White dark matter density profile as well as
Thomas-Fermi (TF) profile in order to form a dark wormhole. The flare-out
condition of wormhole is also satisfied by violating the null energy condition
(NEC) for some specific values of quantities. Furthermore, we reveal more
interesting results regarding how an topologically deformation parameter
$\alpha$ affects the evolving wormhole sourced with some dark matter models
based on the physically motivated shape function.
|
physics.gen-ph
|
in this paper we construct an evolving wormhole in the dark matter halo this work is relevant since matter has two components i cosmological part only timedependent and ii wormhole part only spacedependent in order to implement this we use the chaplygin gas as an equation of state for the cosmic part and navarrofrenkwhite dark matter density profile as well as thomasfermi tf profile in order to form a dark wormhole the flareout condition of wormhole is also satisfied by violating the null energy condition nec for some specific values of quantities furthermore we reveal more interesting results regarding how an topologically deformation parameter alpha affects the evolving wormhole sourced with some dark matter models based on the physically motivated shape function
|
[['in', 'this', 'paper', 'we', 'construct', 'an', 'evolving', 'wormhole', 'in', 'the', 'dark', 'matter', 'halo', 'this', 'work', 'is', 'relevant', 'since', 'matter', 'has', 'two', 'components', 'i', 'cosmological', 'part', 'only', 'timedependent', 'and', 'ii', 'wormhole', 'part', 'only', 'spacedependent', 'in', 'order', 'to', 'implement', 'this', 'we', 'use', 'the', 'chaplygin', 'gas', 'as', 'an', 'equation', 'of', 'state', 'for', 'the', 'cosmic', 'part', 'and', 'navarrofrenkwhite', 'dark', 'matter', 'density', 'profile', 'as', 'well', 'as', 'thomasfermi', 'tf', 'profile', 'in', 'order', 'to', 'form', 'a', 'dark', 'wormhole', 'the', 'flareout', 'condition', 'of', 'wormhole', 'is', 'also', 'satisfied', 'by', 'violating', 'the', 'null', 'energy', 'condition', 'nec', 'for', 'some', 'specific', 'values', 'of', 'quantities', 'furthermore', 'we', 'reveal', 'more', 'interesting', 'results', 'regarding', 'how', 'an', 'topologically', 'deformation', 'parameter', 'alpha', 'affects', 'the', 'evolving', 'wormhole', 'sourced', 'with', 'some', 'dark', 'matter', 'models', 'based', 'on', 'the', 'physically', 'motivated', 'shape', 'function']]
|
[-0.15032502824057, 0.09518357889560246, -0.12976728954932606, 0.12217439106783876, -0.14186494855485002, -0.15268036702907353, -0.05894383357467557, 0.30309472211682403, -0.18973500768226556, -0.3387426656716671, 0.04182599887221319, -0.25374607298309443, -0.09817141960336842, 0.13707875458859517, -0.010767649607274865, 0.0325029406012618, -0.06709472663112778, 0.02646289440826131, -0.05398107919895441, -0.25097908112181105, 0.41096380732969773, 0.07630552731112761, 0.21227346058003604, 0.046612946415839136, 0.07118393196800693, -0.055826705244949974, -0.01202479943434601, 0.019777265980412236, -0.23830676949812007, 0.01095048528828765, 0.17787014174821514, 0.13525896808361543, 0.20552250136407552, -0.44803056685773074, -0.2504856239195119, 0.15824926617082025, 0.189771558474902, 0.12753999040755024, -0.09740309574468095, -0.3157015085281407, 0.026433889944961327, -0.24191660433244266, -0.17985584209749444, -0.0583499928432532, 0.03427449776409346, 0.001450192057298588, -0.20261181648209936, 0.141282191852892, -0.008281934446250623, -0.07942407938544868, -0.1342739382964849, -0.06383632826542512, -0.01091385106212597, -0.0035430235925634377, 0.11178867240650121, -0.01141254980399533, 0.2112400573563808, -0.2154174347076046, 0.02403595458838295, 0.38246797289332896, -0.10750767769727124, -0.23981495222198915, 0.1179530139817841, -0.11653175085905146, -0.15781118101669384, 0.05966948222017801, 0.0814544195614633, 0.09914742689198036, -0.1526088687805001, 0.12244620664545228, -0.03829635065297031, 0.19069488749259197, 0.09034264501810196, 0.007515914715276879, 0.3020392905340576, 0.12048577653152533, 0.09416524740454854, 0.11552620647269012, -0.041501298392206794, -0.08078993226737395, -0.4096431030174259, -0.16794469640361237, -0.18024017068282625, 0.008841017131373042, -0.09982636745911298, -0.1660709343392585, 0.36865608764194013, 0.0895261171940174, 0.18773586036194664, 0.009595651507805118, 0.2971700148153134, 0.08491917825628408, -0.02432053009063372, 0.10374564250747932, 0.25632066745549575, 0.13469119190207882, 0.13747614000343764, -0.2040896805568186, 0.008155357405604398, 0.004697285732588364]
|
1,803.04257
|
The Classical-Quantum Duality of Nature. New Variables for Quantum
Gravity
|
The classical-quantum duality at the basis of quantum theory is here extended
to the Planck scale domain. The classical/semiclassical gravity (G) domain is
dual (in the precise sense of the classical-quantum duality) to the quantum (Q)
elementary particle domain through the Planck scale. This duality is universal.
From the gravity and quantum variables (G, Q), we define new (QG) quantum
gravity variables QG = (1/2) (G + Q) which include all (classical,
semiclassical and quantum gravity) domains and the elementary particle domain
passing by the Planck scale. Two values of G or Q variables are necessary for
each variable QG. The complete analytic extension of the QG variables is
performed. This allows us to reveal the classical-quantum duality of the
Schwarzschild-Kruskal space-time: The exterior regions are
classical/semiclassical while the interior is totally quantum, its boundaries
being the Planck scale. Exterior and interior lose their difference near the
horizon which turns to be quantum dressed, " l'horizon habille' ". QG variables
are naturally invariant under G --> Q and conversely. Space-time reflections,
antipodal symmetry and PT or CPT symmetry are contained in the QG symmetry,
which also shed insight into the global properties of the Kruskal manifold and
its present renewed interest...(Abridged)
|
physics.gen-ph gr-qc
|
the classicalquantum duality at the basis of quantum theory is here extended to the planck scale domain the classicalsemiclassical gravity g domain is dual in the precise sense of the classicalquantum duality to the quantum q elementary particle domain through the planck scale this duality is universal from the gravity and quantum variables g q we define new qg quantum gravity variables qg 12 g q which include all classical semiclassical and quantum gravity domains and the elementary particle domain passing by the planck scale two values of g or q variables are necessary for each variable qg the complete analytic extension of the qg variables is performed this allows us to reveal the classicalquantum duality of the schwarzschildkruskal spacetime the exterior regions are classicalsemiclassical while the interior is totally quantum its boundaries being the planck scale exterior and interior lose their difference near the horizon which turns to be quantum dressed lhorizon habille qg variables are naturally invariant under g q and conversely spacetime reflections antipodal symmetry and pt or cpt symmetry are contained in the qg symmetry which also shed insight into the global properties of the kruskal manifold and its present renewed interestabridged
|
[['the', 'classicalquantum', 'duality', 'at', 'the', 'basis', 'of', 'quantum', 'theory', 'is', 'here', 'extended', 'to', 'the', 'planck', 'scale', 'domain', 'the', 'classicalsemiclassical', 'gravity', 'g', 'domain', 'is', 'dual', 'in', 'the', 'precise', 'sense', 'of', 'the', 'classicalquantum', 'duality', 'to', 'the', 'quantum', 'q', 'elementary', 'particle', 'domain', 'through', 'the', 'planck', 'scale', 'this', 'duality', 'is', 'universal', 'from', 'the', 'gravity', 'and', 'quantum', 'variables', 'g', 'q', 'we', 'define', 'new', 'qg', 'quantum', 'gravity', 'variables', 'qg', '12', 'g', 'q', 'which', 'include', 'all', 'classical', 'semiclassical', 'and', 'quantum', 'gravity', 'domains', 'and', 'the', 'elementary', 'particle', 'domain', 'passing', 'by', 'the', 'planck', 'scale', 'two', 'values', 'of', 'g', 'or', 'q', 'variables', 'are', 'necessary', 'for', 'each', 'variable', 'qg', 'the', 'complete', 'analytic', 'extension', 'of', 'the', 'qg', 'variables', 'is', 'performed', 'this', 'allows', 'us', 'to', 'reveal', 'the', 'classicalquantum', 'duality', 'of', 'the', 'schwarzschildkruskal', 'spacetime', 'the', 'exterior', 'regions', 'are', 'classicalsemiclassical', 'while', 'the', 'interior', 'is', 'totally', 'quantum', 'its', 'boundaries', 'being', 'the', 'planck', 'scale', 'exterior', 'and', 'interior', 'lose', 'their', 'difference', 'near', 'the', 'horizon', 'which', 'turns', 'to', 'be', 'quantum', 'dressed', 'lhorizon', 'habille', 'qg', 'variables', 'are', 'naturally', 'invariant', 'under', 'g', 'q', 'and', 'conversely', 'spacetime', 'reflections', 'antipodal', 'symmetry', 'and', 'pt', 'or', 'cpt', 'symmetry', 'are', 'contained', 'in', 'the', 'qg', 'symmetry', 'which', 'also', 'shed', 'insight', 'into', 'the', 'global', 'properties', 'of', 'the', 'kruskal', 'manifold', 'and', 'its', 'present', 'renewed', 'interestabridged']]
|
[-0.15079243964433592, 0.18863191706649574, -0.14945814242692654, 0.10381097985380884, -0.14129558404656659, -0.14115037696696625, 0.005820990096743899, 0.2812215886163221, -0.2977573629046448, -0.25931061211601864, 0.08980252444346006, -0.2421715439266647, -0.08692216474401229, 0.13303467563903587, -0.05196746856751104, 0.05951797720559069, -0.0074722048479079275, 0.0815453648535834, -0.06897306683777296, -0.22407660568494156, 0.3618334802476824, 0.017330652151083082, 0.23177525493282575, 0.036075561091127695, 0.08135108771333423, -0.004828325093969935, -0.01220953903900498, 0.003175926142627943, -0.1599296843464163, 0.09380975895479245, 0.22294434273016514, 0.09811243126554887, 0.1875146781625178, -0.4031915361836186, -0.22912018597240613, 0.08936545055798722, 0.10438113050882758, 0.0763757208433398, 0.001188336344377905, -0.3062036981338085, 0.07594701687568906, -0.11554986073688599, -0.11992592654803796, -0.04030357640890472, 0.04721247543788327, -0.08847892163303281, -0.25637213995323127, 0.07112454723701281, 0.09544889092894146, 0.041396589066659537, 0.004107145965039016, -0.08403319769196328, -0.025555715932380506, 0.09538312714759241, 0.023119445838615627, 0.07328055624263795, 0.12983809620651074, -0.0997825183838104, -0.11558178928137848, 0.3978295289607323, -0.004972864912311339, -0.2160100851429945, 0.16665216486592213, -0.20568310008311905, -0.09129914360777161, 0.0659084616523294, 0.10789394488894752, 0.13030819170456862, -0.09977397563447452, 0.23859297034935062, -0.032953424832827066, 0.1231363252175663, 0.10417801041850927, 0.08351097385268755, 0.2693181090983393, 0.05542800979148307, 0.07585924019758986, 0.12844381637695135, -0.04923862769477156, -0.1477297903762387, -0.40879146249993786, -0.1652884451917329, -0.18314281195568624, 0.07940165285947563, -0.15604486542705923, -0.13083486690142535, 0.3399123520496268, 0.08858211212664834, 0.15062720695790385, 0.020089801207276475, 0.2204094372865855, 0.11124331771680805, 0.06670723702768201, 0.10317931884243467, 0.22832056926080832, 0.20231107683548308, 0.03524439535682799, -0.2615990301731665, -0.07629436663704214, 0.10256028850683509]
|
1,803.04258
|
Development of a complex function theory upon a new concept of
polar-analytic functions; Extended version
|
The present article is an extended version of [6] containing new results and
an updated list of references. We review the notion of polar analyticity
introduced in a previous paper and succesfully applied in Mellin analysis and
quadrature formulae for functions defined on the positive real axis. This
appears as a simple way to describe functions which are analytic on a part of
the Riemann surface of the logarithm. In this paper we launch a proposal to
develop a complete complex function theory, independent of classical function
theory, which is built upon the new concept of polar analyticity.
|
math.CV
|
the present article is an extended version of 6 containing new results and an updated list of references we review the notion of polar analyticity introduced in a previous paper and succesfully applied in mellin analysis and quadrature formulae for functions defined on the positive real axis this appears as a simple way to describe functions which are analytic on a part of the riemann surface of the logarithm in this paper we launch a proposal to develop a complete complex function theory independent of classical function theory which is built upon the new concept of polar analyticity
|
[['the', 'present', 'article', 'is', 'an', 'extended', 'version', 'of', '6', 'containing', 'new', 'results', 'and', 'an', 'updated', 'list', 'of', 'references', 'we', 'review', 'the', 'notion', 'of', 'polar', 'analyticity', 'introduced', 'in', 'a', 'previous', 'paper', 'and', 'succesfully', 'applied', 'in', 'mellin', 'analysis', 'and', 'quadrature', 'formulae', 'for', 'functions', 'defined', 'on', 'the', 'positive', 'real', 'axis', 'this', 'appears', 'as', 'a', 'simple', 'way', 'to', 'describe', 'functions', 'which', 'are', 'analytic', 'on', 'a', 'part', 'of', 'the', 'riemann', 'surface', 'of', 'the', 'logarithm', 'in', 'this', 'paper', 'we', 'launch', 'a', 'proposal', 'to', 'develop', 'a', 'complete', 'complex', 'function', 'theory', 'independent', 'of', 'classical', 'function', 'theory', 'which', 'is', 'built', 'upon', 'the', 'new', 'concept', 'of', 'polar', 'analyticity']]
|
[-0.12170312059948182, 0.06114675198648688, -0.11820737404834326, 0.05461058759472656, -0.11343247282119202, -0.05329461284551998, 0.03278189590343331, 0.3155437804834575, -0.2349326481938134, -0.25836266790117535, 0.10284373130677837, -0.2159859937596686, -0.20594800239885036, 0.20944407603190263, -0.0795107516079989, 0.03983826038061774, 0.0008752152694351211, 0.02249591957245554, -0.11639966721627482, -0.2482081106768883, 0.3336401945645256, 0.03899492679772024, 0.23071661931747683, 0.07442997395992279, 0.08847201860756898, 0.061046160529462656, -0.08687760016633844, -0.01258389060670624, -0.16591352041886778, 0.16982534756807952, 0.2136590107800249, 0.13842076838914275, 0.24707072125557733, -0.39374874855334663, -0.16496749286663395, 0.04605462081369241, 0.12379909124776568, 0.08405513948124206, -0.03622267865908465, -0.25358792721431667, 0.07532561048675253, -0.19772892511136145, -0.2069674164094791, -0.08147027641514017, 0.025076963663177222, 0.003568237021384875, -0.23443803207340594, 0.005561833003801959, 0.07505600932719451, 0.08578293301089078, -0.06110362256687058, -0.10672806191011047, 0.05593108216405143, 0.06194221002657955, 0.026689401956047028, 0.11263799282831463, 0.07980831027297038, -0.05697576293712292, -0.10619881725870073, 0.3396648296858279, -0.07087701816605974, -0.23155739299990996, 0.14829189854921127, -0.11688191770594947, -0.16764249176034057, 0.08463298290853902, 0.20090570383496126, 0.17053884600659794, -0.14999685774804378, 0.10413697418312504, -0.08134808722997502, 0.12916062990849725, 0.056100080305311294, -0.00452314630835032, 0.16586923789308997, 0.09887109998653985, 0.04510907293772515, 0.1953008345076434, -0.043654411251903794, -0.10614928120880254, -0.3938224368671678, -0.1805513399945363, -0.18529918235821688, 0.03853767348230075, -0.05092518960974507, -0.23550576055232358, 0.43094391136297155, 0.10017333384211251, 0.20295937896269012, 0.07115582626892672, 0.288319587486568, 0.1428283115323842, 0.055231096529477865, 0.02891400271114342, 0.17058506902611378, 0.15609297468517053, 0.09128515984627242, -0.12258718002644577, 0.02881422264938604, 0.13098223017034483]
|
1,803.04259
|
Syzygies of secant ideals of Pl\"ucker-embedded Grassmannians are
generated in bounded degree
|
Over a field of characteristic $0$, we prove that for each $r \geq 0$ there
exists a constant $C(r)$ so that the prime ideal of the $r$th secant variety of
any Pl\"ucker-embedded Grassmannian ${\bf Gr}(d,n)$ is generated by polynomials
of degree at most $C(r)$, where $C(r)$ is independent of $d$ and $n$. This
bounded generation ultimately reduces to proving a poset is noetherian, we
develop a new method to do this. We then translate the structure we develop to
the language of functor categories to prove the $i$th syzygy module of the
coordinate ring of the $r$th secant variety of any Pl\"ucker-embedded
Grassmannian ${\bf Gr}(d,n)$ is concentrated in degrees bounded by a constant
$C(i,r)$, which is again independent of $d$ and $n$.
|
math.AC math.AG math.RA
|
over a field of characteristic 0 we prove that for each r geq 0 there exists a constant cr so that the prime ideal of the rth secant variety of any pluckerembedded grassmannian bf grdn is generated by polynomials of degree at most cr where cr is independent of d and n this bounded generation ultimately reduces to proving a poset is noetherian we develop a new method to do this we then translate the structure we develop to the language of functor categories to prove the ith syzygy module of the coordinate ring of the rth secant variety of any pluckerembedded grassmannian bf grdn is concentrated in degrees bounded by a constant cir which is again independent of d and n
|
[['over', 'a', 'field', 'of', 'characteristic', '0', 'we', 'prove', 'that', 'for', 'each', 'r', 'geq', '0', 'there', 'exists', 'a', 'constant', 'cr', 'so', 'that', 'the', 'prime', 'ideal', 'of', 'the', 'rth', 'secant', 'variety', 'of', 'any', 'pluckerembedded', 'grassmannian', 'bf', 'grdn', 'is', 'generated', 'by', 'polynomials', 'of', 'degree', 'at', 'most', 'cr', 'where', 'cr', 'is', 'independent', 'of', 'd', 'and', 'n', 'this', 'bounded', 'generation', 'ultimately', 'reduces', 'to', 'proving', 'a', 'poset', 'is', 'noetherian', 'we', 'develop', 'a', 'new', 'method', 'to', 'do', 'this', 'we', 'then', 'translate', 'the', 'structure', 'we', 'develop', 'to', 'the', 'language', 'of', 'functor', 'categories', 'to', 'prove', 'the', 'ith', 'syzygy', 'module', 'of', 'the', 'coordinate', 'ring', 'of', 'the', 'rth', 'secant', 'variety', 'of', 'any', 'pluckerembedded', 'grassmannian', 'bf', 'grdn', 'is', 'concentrated', 'in', 'degrees', 'bounded', 'by', 'a', 'constant', 'cir', 'which', 'is', 'again', 'independent', 'of', 'd', 'and', 'n']]
|
[-0.2241320496073878, 0.06586245641486384, -0.03002441232856058, -0.0322125068241654, -0.08297480994331666, -0.17601909584553768, -0.026221451955011542, 0.3127148167428667, -0.3778537046593675, -0.16632749668520982, 0.03236010012915358, -0.22041197645250846, -0.11086807896566318, 0.1555551819238033, -0.08134491488215376, -0.059475390783503466, -0.014661869667775806, 0.11121595403767329, -0.06359018639997259, -0.30159312149044126, 0.3745715511871166, -0.02505201199015633, 0.19970245360106717, 0.03208202177078509, 0.15762244047383306, -0.0002588343989775806, 0.016164936522235634, 0.009459160802672143, -0.16699301303027017, 0.13460291403757987, 0.28745109585617656, 0.16576643358449905, 0.23809505859199057, -0.3352973651690561, -0.1237818752644492, 0.21216265932794232, 0.1620851022069205, 0.02599249724355969, 0.026427389072926074, -0.19007407371565455, 0.20742795401878777, -0.145291319486354, -0.15593822105772426, -0.03765948353426867, 0.13142018057272356, 0.043460354766213016, -0.3279758281256721, -0.02073246263898909, 0.1359305787129236, 0.13584656326565892, -0.006924218816881175, -0.13843548908585407, -0.04196743710638314, 0.045966831890896696, -0.03217217140090575, 0.1095494437871165, 0.08029134288672587, -0.08416064745425934, -0.08344001960787983, 0.36750425527551683, -0.08077082595955885, -0.2229514859662559, 0.0938904444080182, -0.20908591239026092, -0.14091142422336414, 0.1472589051289881, 0.10712674326935141, 0.16512699592400526, -0.012177614633043557, 0.20911441638313813, -0.1303720702340857, 0.13234040482717827, 0.09692376021478998, -0.019517170048708128, 0.1362290720104194, 0.07085760327086585, 0.10216691003197262, 0.10560629541268114, -0.05830458980282677, 0.01398978041881909, -0.35088294607083326, -0.22561988378035241, -0.1944467979025279, 0.1581682976510387, -0.1202909058572049, -0.14816943525535162, 0.37683080498617694, 0.10615360066218332, 0.18760082992099103, 0.08572145818339538, 0.22744881794845198, 0.06839383448489376, 0.027275571679757513, 0.11175437173119089, 0.11750487524435901, 0.1812388624072258, 0.003978601045196601, -0.1335339207644956, 0.024700582586610537, 0.13903490049439124]
|
1,803.0426
|
Single time dynamical model for equations of motion of relativistic
retarded systems
|
We present a procedure to build a single time model for the equations of
motion of relativistic retarded systems composed of several particles; at any
desired level of accuracy. We treat the especial case of a binary system.
We apply this model to the classical electromagnetic binary particle system.
We mentioned some differences with previous approaches and discussed the
implications for linear gravitational models.
|
gr-qc
|
we present a procedure to build a single time model for the equations of motion of relativistic retarded systems composed of several particles at any desired level of accuracy we treat the especial case of a binary system we apply this model to the classical electromagnetic binary particle system we mentioned some differences with previous approaches and discussed the implications for linear gravitational models
|
[['we', 'present', 'a', 'procedure', 'to', 'build', 'a', 'single', 'time', 'model', 'for', 'the', 'equations', 'of', 'motion', 'of', 'relativistic', 'retarded', 'systems', 'composed', 'of', 'several', 'particles', 'at', 'any', 'desired', 'level', 'of', 'accuracy', 'we', 'treat', 'the', 'especial', 'case', 'of', 'a', 'binary', 'system', 'we', 'apply', 'this', 'model', 'to', 'the', 'classical', 'electromagnetic', 'binary', 'particle', 'system', 'we', 'mentioned', 'some', 'differences', 'with', 'previous', 'approaches', 'and', 'discussed', 'the', 'implications', 'for', 'linear', 'gravitational', 'models']]
|
[-0.13730658905114979, 0.06314875927637331, -0.06429739919985877, 0.07953954469667224, -0.04666285091661848, -0.13308424110437045, 0.029977871945447987, 0.3420102681266144, -0.23606823898444418, -0.28802044445910724, 0.04995862006217067, -0.2672275680815801, -0.14895977143896744, 0.21085764153576747, -0.00033915664243977517, 0.11724782796227373, 0.0845648584945593, 0.0684643988715834, -0.10624465739238076, -0.23697596054989845, 0.3342609696483123, 0.06200001802062616, 0.17226746230153367, -0.012854859785875306, 0.16481508433389536, 0.04606237287839576, -0.0012754327326547354, 0.033384768321411684, -0.101245862468204, 0.10009765523136593, 0.1911089563535029, 0.10144744864737731, 0.2557770067942329, -0.4263219424756244, -0.25215306655081804, 0.10182816790620564, 0.09714061941485852, 0.1943181601818651, -0.05238632774853613, -0.268860530180973, 0.049833564427899546, -0.21873699641764688, -0.17666589230066165, -0.03150967248075176, 0.00422208227973897, 0.04599518032773631, -0.24087427768972702, 0.07504404983774293, 0.09574558705207892, -0.004455422269529663, -0.13595194165827706, -0.11004649710594094, 0.06605245700484375, 0.11269248502503615, 0.025673096963146236, 0.001117655471261969, 0.12367452495527687, -0.13293254014206468, -0.1444055062602274, 0.4323405738687143, -0.07203459918673616, -0.2625823284906801, 0.24079241973231547, -0.13235104689374566, -0.1669207626800926, 0.08544417816483474, 0.2316149123798823, 0.14915121675585397, -0.1688363615758135, 0.059430729109408276, 0.0011546630994416773, 0.18214502508635633, 0.019325949731864966, 0.014383358582563233, 0.23035132852965035, 0.19157601933693513, -0.03697428973100614, 0.16627576360770036, -0.0769311240001116, -0.09481567003240343, -0.32741480917320587, -0.14330949819486705, -0.10490089656377677, -0.0033211819500138517, -0.05408761425633202, -0.16271401874837466, 0.39749010145897046, 0.21793122517101438, 0.16261872317409143, 0.07573225284795626, 0.2747913780331146, 0.14244604550367512, -0.0017301188563578762, 0.04667116000200622, 0.26806786332099364, 0.10823085191077553, 0.12022401468129829, -0.21187243243912235, -0.015314562140702037, 0.08258027134797885]
|
1,803.04261
|
Tensor-Based Parameter Estimation of Double Directional Massive MIMO
Channel with Dual-Polarized Antennas
|
The 3GPP suggests to combine dual polarized (DP) antenna arrays with the
double directional (DD) channel model for downlink channel estimation. This
combination strikes a good balance between high-capacity communications and
parsimonious channel modeling, and also brings limited feedback schemes for
downlink channel estimation within reach. However, most existing channel
estimation work under the DD model has not considered DP arrays, perhaps
because of the complex array manifold and the resulting difficulty in algorithm
design. In this paper, we first reveal that the DD channel with DP arrays at
the transmitter and receiver can be naturally modeled as a low-rank four-way
tensor, and thus the parameters can be effectively estimated via tensor
decomposition algorithms. To reduce computational complexity, we show that the
problem can be recast as a four-snapshot three-dimensional harmonic retrieval
problem, which can be solved using computationally efficient subspace methods.
On the theory side, we show that the DD channel with DP arrays is identifiable
under very mild conditions, leveraging identifiability of low-rank tensors.
Numerical simulations are employed to showcase the effectiveness of our
methods.
|
eess.SP
|
the 3gpp suggests to combine dual polarized dp antenna arrays with the double directional dd channel model for downlink channel estimation this combination strikes a good balance between highcapacity communications and parsimonious channel modeling and also brings limited feedback schemes for downlink channel estimation within reach however most existing channel estimation work under the dd model has not considered dp arrays perhaps because of the complex array manifold and the resulting difficulty in algorithm design in this paper we first reveal that the dd channel with dp arrays at the transmitter and receiver can be naturally modeled as a lowrank fourway tensor and thus the parameters can be effectively estimated via tensor decomposition algorithms to reduce computational complexity we show that the problem can be recast as a foursnapshot threedimensional harmonic retrieval problem which can be solved using computationally efficient subspace methods on the theory side we show that the dd channel with dp arrays is identifiable under very mild conditions leveraging identifiability of lowrank tensors numerical simulations are employed to showcase the effectiveness of our methods
|
[['the', '3gpp', 'suggests', 'to', 'combine', 'dual', 'polarized', 'dp', 'antenna', 'arrays', 'with', 'the', 'double', 'directional', 'dd', 'channel', 'model', 'for', 'downlink', 'channel', 'estimation', 'this', 'combination', 'strikes', 'a', 'good', 'balance', 'between', 'highcapacity', 'communications', 'and', 'parsimonious', 'channel', 'modeling', 'and', 'also', 'brings', 'limited', 'feedback', 'schemes', 'for', 'downlink', 'channel', 'estimation', 'within', 'reach', 'however', 'most', 'existing', 'channel', 'estimation', 'work', 'under', 'the', 'dd', 'model', 'has', 'not', 'considered', 'dp', 'arrays', 'perhaps', 'because', 'of', 'the', 'complex', 'array', 'manifold', 'and', 'the', 'resulting', 'difficulty', 'in', 'algorithm', 'design', 'in', 'this', 'paper', 'we', 'first', 'reveal', 'that', 'the', 'dd', 'channel', 'with', 'dp', 'arrays', 'at', 'the', 'transmitter', 'and', 'receiver', 'can', 'be', 'naturally', 'modeled', 'as', 'a', 'lowrank', 'fourway', 'tensor', 'and', 'thus', 'the', 'parameters', 'can', 'be', 'effectively', 'estimated', 'via', 'tensor', 'decomposition', 'algorithms', 'to', 'reduce', 'computational', 'complexity', 'we', 'show', 'that', 'the', 'problem', 'can', 'be', 'recast', 'as', 'a', 'foursnapshot', 'threedimensional', 'harmonic', 'retrieval', 'problem', 'which', 'can', 'be', 'solved', 'using', 'computationally', 'efficient', 'subspace', 'methods', 'on', 'the', 'theory', 'side', 'we', 'show', 'that', 'the', 'dd', 'channel', 'with', 'dp', 'arrays', 'is', 'identifiable', 'under', 'very', 'mild', 'conditions', 'leveraging', 'identifiability', 'of', 'lowrank', 'tensors', 'numerical', 'simulations', 'are', 'employed', 'to', 'showcase', 'the', 'effectiveness', 'of', 'our', 'methods']]
|
[-0.14176724731706516, 0.020920435520979067, -0.052601034940876576, 0.049932216619543564, -0.0774712571536921, -0.23667508687834593, 0.045300308490616524, 0.41910389686580113, -0.32489019187381596, -0.2667471793353219, 0.1206659051385941, -0.1919053193837912, -0.19188901957849422, 0.15831905790731648, -0.06144592464525803, 0.06176739911461482, 0.12041812189537185, -0.03225824666680472, -0.08438358231730737, -0.22184475749777863, 0.26903192804919934, 0.10081943834930743, 0.31759168610336597, 0.019961415950753937, 0.10038288064904256, 0.024516417511304924, -0.016374660502399573, 0.0010016606068926524, -0.08168809920206596, 0.10570077347801998, 0.32826600287675817, 0.16919324450216003, 0.2078030022834851, -0.4461965226589448, -0.2726485848278654, 0.10892098525337959, 0.1758853807835046, 0.11393288074429041, -0.02750485155014427, -0.27060057005887345, 0.12015202098832974, -0.1883031283730154, -0.02349439536655237, -0.0681781062462092, -0.08728822396898811, 0.006607096540857459, -0.3626861184576145, 0.05376681056391548, 0.02846255259249698, -0.03056307452789042, -0.02743543870350219, -0.16678790450731124, 0.03160618388871874, 0.09264577595868931, 0.01637949449997739, -0.0021855815456629816, 0.07750989335843107, -0.09371786403988319, -0.12135897062729452, 0.361228158897244, -0.033006033055822954, -0.2815713754177771, 0.17424094381137614, -0.07379694662416693, -0.10692739532202143, 0.14364810904556757, 0.23838007836953198, 0.08661249199014326, -0.1673453871626407, 0.076841163108673, -0.02657532124960033, 0.20136682903235356, 0.05295943428328345, 0.06463536601884036, 0.1572735802513886, 0.20367747337943662, 0.10181727242624303, 0.1458474335694601, -0.11687541985222859, -0.09833740609809122, -0.22012246708089317, -0.10961883785355232, -0.2142562561811329, -0.0021239721270996433, -0.09765343956438631, -0.08584227065809748, 0.3250665399510498, 0.13332497798546683, 0.1419910902100541, 0.06774071636358382, 0.3652761084356991, 0.10312740962399403, 0.04546836176781322, 0.08998117477908223, 0.22108939812460449, 0.15507130890248597, 0.07767607203393047, -0.23058409317772285, 0.07129094194136666, 0.01488045713499146]
|
1,803.04262
|
On the Properties of MVR Chain Graphs
|
Depending on the interpretation of the type of edges, a chain graph can
represent different relations between variables and thereby independence
models. Three interpretations, known by the acronyms LWF, MVR, and AMP, are
prevalent. Multivariate regression chain graphs (MVR CGs) were introduced by
Cox and Wermuth in 1993. We review Markov properties for MVR chain graphs and
propose an alternative global and local Markov property for them. Except for
pairwise Markov properties, we show that for MVR chain graphs all Markov
properties in the literature are equivalent for semi-graphoids. We derive a new
factorization formula for MVR chain graphs which is more explicit than and
different from the proposed factorizations for MVR chain graphs in the
literature. Finally, we provide a summary table comparing different features of
LWF, AMP, and MVR chain graphs.
|
stat.ME cs.LG
|
depending on the interpretation of the type of edges a chain graph can represent different relations between variables and thereby independence models three interpretations known by the acronyms lwf mvr and amp are prevalent multivariate regression chain graphs mvr cgs were introduced by cox and wermuth in 1993 we review markov properties for mvr chain graphs and propose an alternative global and local markov property for them except for pairwise markov properties we show that for mvr chain graphs all markov properties in the literature are equivalent for semigraphoids we derive a new factorization formula for mvr chain graphs which is more explicit than and different from the proposed factorizations for mvr chain graphs in the literature finally we provide a summary table comparing different features of lwf amp and mvr chain graphs
|
[['depending', 'on', 'the', 'interpretation', 'of', 'the', 'type', 'of', 'edges', 'a', 'chain', 'graph', 'can', 'represent', 'different', 'relations', 'between', 'variables', 'and', 'thereby', 'independence', 'models', 'three', 'interpretations', 'known', 'by', 'the', 'acronyms', 'lwf', 'mvr', 'and', 'amp', 'are', 'prevalent', 'multivariate', 'regression', 'chain', 'graphs', 'mvr', 'cgs', 'were', 'introduced', 'by', 'cox', 'and', 'wermuth', 'in', '1993', 'we', 'review', 'markov', 'properties', 'for', 'mvr', 'chain', 'graphs', 'and', 'propose', 'an', 'alternative', 'global', 'and', 'local', 'markov', 'property', 'for', 'them', 'except', 'for', 'pairwise', 'markov', 'properties', 'we', 'show', 'that', 'for', 'mvr', 'chain', 'graphs', 'all', 'markov', 'properties', 'in', 'the', 'literature', 'are', 'equivalent', 'for', 'semigraphoids', 'we', 'derive', 'a', 'new', 'factorization', 'formula', 'for', 'mvr', 'chain', 'graphs', 'which', 'is', 'more', 'explicit', 'than', 'and', 'different', 'from', 'the', 'proposed', 'factorizations', 'for', 'mvr', 'chain', 'graphs', 'in', 'the', 'literature', 'finally', 'we', 'provide', 'a', 'summary', 'table', 'comparing', 'different', 'features', 'of', 'lwf', 'amp', 'and', 'mvr', 'chain', 'graphs']]
|
[-0.07975019917112629, 0.07508093538561475, -0.04858628490281509, 0.13144990394707712, -0.10481579692599266, -0.16019509486587985, 0.021551576916117893, 0.4606519522131386, -0.276289821789719, -0.2760941975862068, 0.14283777510176615, -0.2555201931478442, -0.1297220007684502, 0.17042402452719224, -0.04740899662781311, 0.04276115744185627, 0.07885851917431262, 0.028889552674552118, -0.04522598663601443, -0.20942552160595096, 0.2559005806049248, 0.030168855835900718, 0.2576350795273158, -0.016185170739777106, 0.11568453245887295, 0.06833592152461074, -0.033437409074066726, 0.023878196268377446, -0.1852429001857426, 0.12509159471916692, 0.2478591085851065, 0.16561726478971822, 0.1837608951189436, -0.41203034662158416, -0.19427081184195621, 0.17291528139617013, 0.11995290419002785, 0.09100849767429124, 0.031392129794917685, -0.26909248944007813, 0.08828356726308655, -0.1768524335641274, -0.022520053382486777, -0.08405963754407446, 0.026999144348371914, 0.0845494635431166, -0.26973850728901927, 0.04225489804591227, 0.12865519087719626, 0.10482530653672784, 0.04057575825818891, -0.20742636266045442, 0.011392488224866023, 0.08024625665389169, 0.007683286263477898, -0.07727728387396923, 0.05445277766863767, -0.07011748613663633, -0.18123845853125045, 0.286886895068438, -0.02037588465721189, -0.16984909302091114, 0.1825747650249728, -0.022679063967688193, -0.2593091660550326, 0.07460268618209862, 0.11150198543262213, 0.13117456352128123, -0.19829094959282897, 0.09445401433289849, -0.08257808194922886, 0.09169126444853339, 0.057581659392418716, -0.010891147416040803, 0.14082411133957312, 0.09694952846861872, 0.05461918272903448, 0.19925408309703707, -0.02287929264642123, -0.13669149561512067, -0.23825934278267555, -0.16559525849223242, -0.1632221128968382, -0.004637697112879583, -0.18380502185924766, -0.20932270175798384, 0.4007015844064772, 0.15195206189432234, 0.19657139638368798, 0.15005257572800174, 0.19533244451276846, 0.05366938563651944, 0.005381921922465912, 0.1337310539775605, 0.08288077359556928, 0.20070584889158213, -0.00995616325618405, -0.10747184658850215, 0.15952614603977286, 0.15450572643667124]
|
1,803.04263
|
The Challenge of Crafting Intelligible Intelligence
|
Since Artificial Intelligence (AI) software uses techniques like deep
lookahead search and stochastic optimization of huge neural networks to fit
mammoth datasets, it often results in complex behavior that is difficult for
people to understand. Yet organizations are deploying AI algorithms in many
mission-critical settings. To trust their behavior, we must make AI
intelligible, either by using inherently interpretable models or by developing
new methods for explaining and controlling otherwise overwhelmingly complex
decisions using local approximation, vocabulary alignment, and interactive
explanation. This paper argues that intelligibility is essential, surveys
recent work on building such systems, and highlights key directions for
research.
|
cs.AI
|
since artificial intelligence ai software uses techniques like deep lookahead search and stochastic optimization of huge neural networks to fit mammoth datasets it often results in complex behavior that is difficult for people to understand yet organizations are deploying ai algorithms in many missioncritical settings to trust their behavior we must make ai intelligible either by using inherently interpretable models or by developing new methods for explaining and controlling otherwise overwhelmingly complex decisions using local approximation vocabulary alignment and interactive explanation this paper argues that intelligibility is essential surveys recent work on building such systems and highlights key directions for research
|
[['since', 'artificial', 'intelligence', 'ai', 'software', 'uses', 'techniques', 'like', 'deep', 'lookahead', 'search', 'and', 'stochastic', 'optimization', 'of', 'huge', 'neural', 'networks', 'to', 'fit', 'mammoth', 'datasets', 'it', 'often', 'results', 'in', 'complex', 'behavior', 'that', 'is', 'difficult', 'for', 'people', 'to', 'understand', 'yet', 'organizations', 'are', 'deploying', 'ai', 'algorithms', 'in', 'many', 'missioncritical', 'settings', 'to', 'trust', 'their', 'behavior', 'we', 'must', 'make', 'ai', 'intelligible', 'either', 'by', 'using', 'inherently', 'interpretable', 'models', 'or', 'by', 'developing', 'new', 'methods', 'for', 'explaining', 'and', 'controlling', 'otherwise', 'overwhelmingly', 'complex', 'decisions', 'using', 'local', 'approximation', 'vocabulary', 'alignment', 'and', 'interactive', 'explanation', 'this', 'paper', 'argues', 'that', 'intelligibility', 'is', 'essential', 'surveys', 'recent', 'work', 'on', 'building', 'such', 'systems', 'and', 'highlights', 'key', 'directions', 'for', 'research']]
|
[-0.08282890240431275, 0.033480767483389615, -0.07594782549260866, 0.1246221883759585, -0.17291048965370742, -0.230267379045634, 0.025509484553718847, 0.44337241945437866, -0.24728149906841643, -0.35051717720049813, 0.11278827079009301, -0.26106174236698315, -0.27079872778296415, 0.2226679065578276, -0.14874831337647715, 0.08911245836332293, 0.08954411246214468, -0.05391221460286934, 0.040591997080620855, -0.2826026054006992, 0.29531640183217456, 0.06395324903493056, 0.32046890497152314, 0.006276853922016845, 0.04876809322856145, -0.006170710797725928, -0.059671230360607404, 0.0033596965973034945, -0.062420934623846146, 0.19944820707055308, 0.4100636496561384, 0.24949468408093448, 0.38925808987183735, -0.45284169241970423, -0.20668162505193105, 0.1372214609959928, 0.218503429457294, 0.1017865522058351, -0.028634840768927913, -0.32073779164416955, 0.0615372166341853, -0.1492102337392545, -0.058390725459350215, -0.21447018877888965, 0.02488399921434627, -0.001550508268283551, -0.24396287422571886, -0.046483911029846954, 0.07154511552451566, 0.1345019538213711, -0.02385298861421202, -0.12614250537192467, 0.09141993116919357, 0.14714798417246652, 0.0737119218954669, 0.03597315703979739, 0.16348718657241304, -0.2190516913415735, -0.18499552908510264, 0.37893528812611016, 0.021661314486276985, -0.1705852625407463, 0.2477013394513195, -0.002669060802188619, -0.20982541130523724, 0.052910397670665146, 0.2449294753271238, 0.06261699131948154, -0.19736305399253817, 0.03733144033963027, 0.0422040704720755, 0.16891026476139923, 0.019321675542603698, -0.006648932500640944, 0.2423669386143326, 0.2552189215980839, 0.0608248266104452, 0.008203070511635725, 0.019154453931357895, -0.1383483517490844, -0.1335487439582991, -0.10793546789169016, -0.14404449865480165, 0.0330642162877513, -0.03933116670013267, -0.15490975678612542, 0.3113915134961302, 0.2424359620723984, 0.1369612600647448, 0.051901948414650734, 0.38310647575129375, 0.0055871130270413166, 0.12488564612611316, 0.09193026727425063, 0.1814104907046358, 0.002549845379509843, 0.17724801132934961, -0.11040091568299819, 0.1757966288293961, -0.009292695984834492]
|
1,803.04264
|
Scanamorphos for the APEX-ArT\'eMiS 350-450 $\mu$m camera : description
and user guide
|
Scanamorphos is public software initially developed to post-process scan
observations performed with the Herschel photometer arrays. This
post-processing mainly consists in subtracting the total low-frequency noise
(both its thermal and non-thermal components), masking cosmic ray hits, and
projecting the data onto a map. Building upon the results obtained for
P-ArT\'eMiS (the prototype of ArT\'eMiS), Herschel and then NIKA2 (a resident
camera of the IRAM 30-m telescope operating at 1.25 and 2 mm), it has now been
tailored to the ArT\'eMiS camera, an ESO and OSO P.I. instrument installed at
the APEX 12-m telescope, demonstrating our initial claim that the software
principles were directly transposable to scan observations made with other
instruments, including from the ground, provided they entail sufficient
redundancy. This document explains how the algorithm was modified to cope with
the specificities of ArT\'eMiS observations and with the atmospheric emission
at 350 and 450 $\mu$m, far dominating the instrumental drifts that were the
only low-frequency noise component in Herschel data. Like in the original
software, this was accomplished without assuming any noise model and without
applying any Fourier-space filtering, by exploiting the redundancy built in the
observations - taking advantage of the fact that each portion of the sky is
sampled at multiple times by multiple bolometers. It remains an interactive
software in the sense that the user is allowed to optionally visualize and
control results at each intermediate step, but the processing is fully
automated. It has been grafted onto the ArT\'eMiS pipeline, in charge of the
formatting, calibration and projection of the data, that is described
elsewhere.
|
astro-ph.IM
|
scanamorphos is public software initially developed to postprocess scan observations performed with the herschel photometer arrays this postprocessing mainly consists in subtracting the total lowfrequency noise both its thermal and nonthermal components masking cosmic ray hits and projecting the data onto a map building upon the results obtained for partemis the prototype of artemis herschel and then nika2 a resident camera of the iram 30m telescope operating at 125 and 2 mm it has now been tailored to the artemis camera an eso and oso pi instrument installed at the apex 12m telescope demonstrating our initial claim that the software principles were directly transposable to scan observations made with other instruments including from the ground provided they entail sufficient redundancy this document explains how the algorithm was modified to cope with the specificities of artemis observations and with the atmospheric emission at 350 and 450 mum far dominating the instrumental drifts that were the only lowfrequency noise component in herschel data like in the original software this was accomplished without assuming any noise model and without applying any fourierspace filtering by exploiting the redundancy built in the observations taking advantage of the fact that each portion of the sky is sampled at multiple times by multiple bolometers it remains an interactive software in the sense that the user is allowed to optionally visualize and control results at each intermediate step but the processing is fully automated it has been grafted onto the artemis pipeline in charge of the formatting calibration and projection of the data that is described elsewhere
|
[['scanamorphos', 'is', 'public', 'software', 'initially', 'developed', 'to', 'postprocess', 'scan', 'observations', 'performed', 'with', 'the', 'herschel', 'photometer', 'arrays', 'this', 'postprocessing', 'mainly', 'consists', 'in', 'subtracting', 'the', 'total', 'lowfrequency', 'noise', 'both', 'its', 'thermal', 'and', 'nonthermal', 'components', 'masking', 'cosmic', 'ray', 'hits', 'and', 'projecting', 'the', 'data', 'onto', 'a', 'map', 'building', 'upon', 'the', 'results', 'obtained', 'for', 'partemis', 'the', 'prototype', 'of', 'artemis', 'herschel', 'and', 'then', 'nika2', 'a', 'resident', 'camera', 'of', 'the', 'iram', '30m', 'telescope', 'operating', 'at', '125', 'and', '2', 'mm', 'it', 'has', 'now', 'been', 'tailored', 'to', 'the', 'artemis', 'camera', 'an', 'eso', 'and', 'oso', 'pi', 'instrument', 'installed', 'at', 'the', 'apex', '12m', 'telescope', 'demonstrating', 'our', 'initial', 'claim', 'that', 'the', 'software', 'principles', 'were', 'directly', 'transposable', 'to', 'scan', 'observations', 'made', 'with', 'other', 'instruments', 'including', 'from', 'the', 'ground', 'provided', 'they', 'entail', 'sufficient', 'redundancy', 'this', 'document', 'explains', 'how', 'the', 'algorithm', 'was', 'modified', 'to', 'cope', 'with', 'the', 'specificities', 'of', 'artemis', 'observations', 'and', 'with', 'the', 'atmospheric', 'emission', 'at', '350', 'and', '450', 'mum', 'far', 'dominating', 'the', 'instrumental', 'drifts', 'that', 'were', 'the', 'only', 'lowfrequency', 'noise', 'component', 'in', 'herschel', 'data', 'like', 'in', 'the', 'original', 'software', 'this', 'was', 'accomplished', 'without', 'assuming', 'any', 'noise', 'model', 'and', 'without', 'applying', 'any', 'fourierspace', 'filtering', 'by', 'exploiting', 'the', 'redundancy', 'built', 'in', 'the', 'observations', 'taking', 'advantage', 'of', 'the', 'fact', 'that', 'each', 'portion', 'of', 'the', 'sky', 'is', 'sampled', 'at', 'multiple', 'times', 'by', 'multiple', 'bolometers', 'it', 'remains', 'an', 'interactive', 'software', 'in', 'the', 'sense', 'that', 'the', 'user', 'is', 'allowed', 'to', 'optionally', 'visualize', 'and', 'control', 'results', 'at', 'each', 'intermediate', 'step', 'but', 'the', 'processing', 'is', 'fully', 'automated', 'it', 'has', 'been', 'grafted', 'onto', 'the', 'artemis', 'pipeline', 'in', 'charge', 'of', 'the', 'formatting', 'calibration', 'and', 'projection', 'of', 'the', 'data', 'that', 'is', 'described', 'elsewhere']]
|
[-0.058697145742375015, 0.09968700673041009, -0.09312498183115511, 0.018127828231440952, -0.08471600134213343, -0.13443718515300554, 0.004776899528336391, 0.41585611538515643, -0.23243871924528514, -0.35304497105418253, 0.1558517037071, -0.2966682555794026, -0.06418967830164639, 0.19757008916000804, -0.042494800302261146, 0.030124300493028115, 0.11304315582680081, -0.07421804471732509, -0.010485561006760015, -0.244324409355262, 0.24279476938594824, 0.16561420092495827, 0.26210526643684096, -0.03244857940351785, 0.15438864280471515, -0.017914981007734206, -0.1176467113949785, -0.016529654601721892, -0.08324790935050161, 0.05950888942182783, 0.28378044218939646, 0.164729742130128, 0.23316366114369574, -0.412410615161277, -0.18051188513924257, 0.04740190692605544, 0.08872865358705571, 0.04310059661951822, -0.009633903272097578, -0.332583187192024, 0.07710105230407897, -0.12055548797194121, -0.13223849119021625, 0.012433056198204347, -0.03234285262905953, 0.005850034631504659, -0.23254539292309304, -0.04682774265417218, -0.0027458865503856055, 0.07187535404497362, -0.07413045256704265, -0.12226705776858342, -0.04731546890109231, 0.1529875807014643, -0.03016865352468932, 0.09222135343178738, 0.1536965905054936, -0.09273240003918215, -0.061823575115136975, 0.3278733784661891, -0.07565122152342457, -0.10785210385386433, 0.16998683271613188, -0.15990096574710344, -0.18917291965803068, 0.18953360383251402, 0.10944278004244833, 0.0437409509805797, -0.20239582212918714, 0.08296044720348594, 0.02953156369511743, 0.23961029870122758, 0.0891657028433554, 0.012910409568014293, 0.22659496456370276, 0.1663400611566455, 0.04742563927622443, 0.15119502738744747, -0.24348598246329597, -0.02793641105019146, -0.25735736830909756, -0.12579583700721128, -0.20857147265110582, 0.0100153412694169, -0.05016282449049864, -0.09569469309127872, 0.36153457402278627, 0.16345989533689262, 0.14872202620046882, 0.03772028542256781, 0.39079330081990327, 0.03295655837790451, 0.14096214871967758, 0.059349138818727984, 0.23633238144351967, 0.0518849177744948, 0.1698257332113949, -0.19359177484313694, 0.05774847506167921, -0.0075373694408077275]
|
1,803.04265
|
Comparison of Limited Feedback Schemes for NOMA Transmission in mmWave
Drone Networks
|
Introducing non-orthogonal multiple access (NOMA) transmission to an unmanned
aerial vehicle (UAV) based communication network is a promising solution to
enhance its spectral efficiency. However, for realistic deployment of such a
network, identifying a practical user feedback scheme for NOMA is essential. In
this paper, considering two practical feedback schemes we introduce NOMA
transmission to UAVs acting as aerial base stations (BS) to provide coverage at
a large stadium. In particular, a UAV-BS generates directional beams, and
multiple users are served simultaneously within the same beam employing NOMA
transmission. Each user is considered to have a target rate based on its
quality of service (QoS) requirements. In order to relieve the burden of
tracking and feeding back full channel state information, we consider two
limited feedback schemes as practical alternatives: 1) user distance, and 2)
user angle with respect to beamforming direction under different user region
geometries. Our evaluation results show that NOMA with limited feedback can
provide better sum rates compared to its orthogonal counterpart. Further, based
on the geometry of user region we identify that there is an optimal feedback
scheme and user ordering criteria for NOMA transmission which can maximize sum
rates.
|
cs.IT math.IT
|
introducing nonorthogonal multiple access noma transmission to an unmanned aerial vehicle uav based communication network is a promising solution to enhance its spectral efficiency however for realistic deployment of such a network identifying a practical user feedback scheme for noma is essential in this paper considering two practical feedback schemes we introduce noma transmission to uavs acting as aerial base stations bs to provide coverage at a large stadium in particular a uavbs generates directional beams and multiple users are served simultaneously within the same beam employing noma transmission each user is considered to have a target rate based on its quality of service qos requirements in order to relieve the burden of tracking and feeding back full channel state information we consider two limited feedback schemes as practical alternatives 1 user distance and 2 user angle with respect to beamforming direction under different user region geometries our evaluation results show that noma with limited feedback can provide better sum rates compared to its orthogonal counterpart further based on the geometry of user region we identify that there is an optimal feedback scheme and user ordering criteria for noma transmission which can maximize sum rates
|
[['introducing', 'nonorthogonal', 'multiple', 'access', 'noma', 'transmission', 'to', 'an', 'unmanned', 'aerial', 'vehicle', 'uav', 'based', 'communication', 'network', 'is', 'a', 'promising', 'solution', 'to', 'enhance', 'its', 'spectral', 'efficiency', 'however', 'for', 'realistic', 'deployment', 'of', 'such', 'a', 'network', 'identifying', 'a', 'practical', 'user', 'feedback', 'scheme', 'for', 'noma', 'is', 'essential', 'in', 'this', 'paper', 'considering', 'two', 'practical', 'feedback', 'schemes', 'we', 'introduce', 'noma', 'transmission', 'to', 'uavs', 'acting', 'as', 'aerial', 'base', 'stations', 'bs', 'to', 'provide', 'coverage', 'at', 'a', 'large', 'stadium', 'in', 'particular', 'a', 'uavbs', 'generates', 'directional', 'beams', 'and', 'multiple', 'users', 'are', 'served', 'simultaneously', 'within', 'the', 'same', 'beam', 'employing', 'noma', 'transmission', 'each', 'user', 'is', 'considered', 'to', 'have', 'a', 'target', 'rate', 'based', 'on', 'its', 'quality', 'of', 'service', 'qos', 'requirements', 'in', 'order', 'to', 'relieve', 'the', 'burden', 'of', 'tracking', 'and', 'feeding', 'back', 'full', 'channel', 'state', 'information', 'we', 'consider', 'two', 'limited', 'feedback', 'schemes', 'as', 'practical', 'alternatives', '1', 'user', 'distance', 'and', '2', 'user', 'angle', 'with', 'respect', 'to', 'beamforming', 'direction', 'under', 'different', 'user', 'region', 'geometries', 'our', 'evaluation', 'results', 'show', 'that', 'noma', 'with', 'limited', 'feedback', 'can', 'provide', 'better', 'sum', 'rates', 'compared', 'to', 'its', 'orthogonal', 'counterpart', 'further', 'based', 'on', 'the', 'geometry', 'of', 'user', 'region', 'we', 'identify', 'that', 'there', 'is', 'an', 'optimal', 'feedback', 'scheme', 'and', 'user', 'ordering', 'criteria', 'for', 'noma', 'transmission', 'which', 'can', 'maximize', 'sum', 'rates']]
|
[-0.25329861819075467, -0.019763016554926977, -0.00032017393371997735, 0.011893943711840667, -0.131269725278402, -0.2689205641237398, 0.1506325449896021, 0.4559266643312115, -0.2478548044864184, -0.2672384838445279, 0.06159591529076584, -0.23728472731816463, -0.13660610672564077, 0.15910214494722777, -0.12698592046687665, 0.05159967764644907, 0.05914071006222795, 0.047176770602340976, -0.023864510750923402, -0.266573901880437, 0.2875754432287067, 0.15354013579587142, 0.3912751012016088, 0.046486532875300884, 0.10245833633204875, 0.01674195557402877, -0.008738182397344365, -0.03802072544379208, -0.09562444351650834, 0.09034966028367097, 0.3720253430880033, 0.22167535381009562, 0.31457268288120244, -0.41633582658683643, -0.2709592148142222, 0.043879771316185215, 0.20282089062847006, 0.03708285882603377, -0.08232872155614389, -0.29607031513005494, 0.13827278463122172, -0.2746151322701898, -0.04363942879061095, -0.004568589579027432, -0.10344787996429472, 0.07746964292153932, -0.39668312676919576, -0.056203985510346215, -0.07106530935121462, 0.03554459161196764, -0.07051710079197222, -0.08644946443561752, 0.033131247330218175, 0.22419472175101057, 0.0399921764076377, -0.008081084300572864, 0.1232079565190734, -0.09292987319402014, -0.14638315599578886, 0.4087905477159298, 0.05651551404944024, -0.26412333786869663, 0.1746321721518866, -0.08835238084400025, -0.054459815908175634, 0.16744076314334494, 0.25487580922587466, 0.078752040096487, -0.16359550629993183, -0.041108542698650406, -0.02246155195797865, 0.15182199282810474, 0.1042844474208183, 0.12329390094293138, 0.16557568004116033, 0.20810281725910804, 0.20618524410857414, 0.09543817628963062, -0.11829155726501575, -0.10818046777962874, -0.19710211934915817, -0.11598870826837344, -0.18752461542876867, 0.021453288417214004, -0.08829688844599355, -0.04343183931285659, 0.36286900744736883, 0.1267693892527276, 0.11827851517949826, 0.07613475653760804, 0.4282734624169862, 0.09557639215654956, 0.053097965937680174, 0.0947851661592722, 0.15949215290654534, 0.04500591634975699, 0.14238226152956485, -0.2232224581703448, 0.049820036670336354, -0.00011018326458258506]
|
1,803.04266
|
Exploiting Friction in Torque Controlled Humanoid Robots
|
A common architecture for torque controlled humanoid robots consists in two
nested loops. The outer loop generates desired joint/motor torques, and the
inner loop stabilises these desired values. In doing so, the inner loop usually
compensates for joint friction phenomena, thus removing their inherent
stabilising property that may be also beneficial for high level control
objectives. This paper shows how to exploit friction for joint and task space
control of humanoid robots. Experiments are carried out using the humanoid
robot iCub.
|
cs.RO
|
a common architecture for torque controlled humanoid robots consists in two nested loops the outer loop generates desired jointmotor torques and the inner loop stabilises these desired values in doing so the inner loop usually compensates for joint friction phenomena thus removing their inherent stabilising property that may be also beneficial for high level control objectives this paper shows how to exploit friction for joint and task space control of humanoid robots experiments are carried out using the humanoid robot icub
|
[['a', 'common', 'architecture', 'for', 'torque', 'controlled', 'humanoid', 'robots', 'consists', 'in', 'two', 'nested', 'loops', 'the', 'outer', 'loop', 'generates', 'desired', 'jointmotor', 'torques', 'and', 'the', 'inner', 'loop', 'stabilises', 'these', 'desired', 'values', 'in', 'doing', 'so', 'the', 'inner', 'loop', 'usually', 'compensates', 'for', 'joint', 'friction', 'phenomena', 'thus', 'removing', 'their', 'inherent', 'stabilising', 'property', 'that', 'may', 'be', 'also', 'beneficial', 'for', 'high', 'level', 'control', 'objectives', 'this', 'paper', 'shows', 'how', 'to', 'exploit', 'friction', 'for', 'joint', 'and', 'task', 'space', 'control', 'of', 'humanoid', 'robots', 'experiments', 'are', 'carried', 'out', 'using', 'the', 'humanoid', 'robot', 'icub']]
|
[-0.1961782777798362, 0.14774782141903414, -0.06651645106030628, 0.003955497591232415, -0.17951591869350522, -0.1837690350424964, 0.022611705512099435, 0.42877182776574047, -0.25938138214405626, -0.35160576085327194, 0.04516200411890168, -0.16794338618055918, -0.20047576976940035, 0.21970776934176683, -0.14125092621834484, 0.09676386453666055, 0.11440887919598026, -0.018262867932207882, -8.61632579471916e-06, -0.16615638160292293, 0.2877828087774105, 0.06747459702310152, 0.22282801826950163, -0.0017016551457345486, 0.19805904669919983, -0.004537923047973891, 0.0313721469254233, 0.03068528433177562, -0.0746315270710511, 0.06886874367628479, 0.2916424962430028, 0.037916843791026625, 0.30022019068710504, -0.4907470715697855, -0.16605337198634515, 0.05710936526302248, 0.1830432953836862, 0.0404120419640094, -0.03207264500670135, -0.3010053555481136, 0.08100125902565196, -0.17160711844626347, -0.12247251814696938, -0.12544149947352706, -0.012236010358901695, -0.05419902030844241, -0.2844279373763129, -0.010230329336263822, 0.08733816922758705, 0.07323671870399266, -0.06131168164429255, -0.08694547559134662, -0.04383201019372791, 0.2677836638642475, 0.010947388253407552, 0.003087138216869789, 0.26387247020029464, -0.15977933059621136, -0.13232113708072574, 0.34531930726952853, 0.07307642942178064, -0.25030013024806974, 0.16360946230124682, -0.1287843910511583, -0.14767226812546141, 0.11214220025576652, 0.21117700778413565, 0.08711302815936506, -0.1761810379801318, 0.04365060941927368, 0.005632410314865411, 0.14905921572353692, 0.09309548127057496, -0.05505075585679151, 0.24918979660142213, 0.17789281483273953, 0.11019199428410502, 0.13945207627111814, -0.06102295033633709, -0.15078295541461556, -0.2680547199095599, -0.12202870410110336, -0.09860197062953376, -0.07423891836078837, -0.06197437316841388, -0.0600088510022033, 0.30572272128774786, 0.18341075001080753, 0.17432486117468216, 0.07036905075074174, 0.39126585114281626, 0.04179672951577231, 0.12946757335739675, 0.09428724507670268, 0.27655531733180394, 0.015955230227700668, 0.09455373439704999, -0.3067377566592768, 0.09444386413088068, 0.0048183411185164]
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.