id float64 706 1.8k | title stringlengths 1 343 | abstract stringlengths 6 6.09k | categories stringlengths 5 125 | processed_abstract stringlengths 2 5.96k | tokenized_abstract stringlengths 8 8.74k | centroid stringlengths 2.1k 2.17k |
|---|---|---|---|---|---|---|
1,802.1046 | Characteristics of type III radio bursts and solar S bursts | The Sun is an active source of radio emission which is often associated with
the acceleration of electrons arising from processes such as solar flares and
coronal mass ejections (CMEs). At low radio frequencies (<100 MHz), numerous
solar S bursts (where S stands for short) and storms of Type III radio bursts
have been observed, that are not directly relates to flares and CMEs. Here, we
expand our understanding on the spectral characteristic of these two different
types of radio bursts based on observations from the Low Frequency Array
(LOFAR). On 9 July 2013, over 3000 solar S bursts accompanied by over 800 Type
III radio bursts were observed over a time period of ~8 hours. The
characteristics of Type III radio bursts are consistent to previous studies,
while S bursts show narrow bandwidths, durations and drift rates of about 1/2
the drift rate of Type III bursts. Type III bursts and solar S bursts occur in
a region in the corona where plasma emission is the dominant emission mechanism
as determined by data constrained density and magnetic field models.
| astro-ph.SR | the sun is an active source of radio emission which is often associated with the acceleration of electrons arising from processes such as solar flares and coronal mass ejections cmes at low radio frequencies 100 mhz numerous solar s bursts where s stands for short and storms of type iii radio bursts have been observed that are not directly relates to flares and cmes here we expand our understanding on the spectral characteristic of these two different types of radio bursts based on observations from the low frequency array lofar on 9 july 2013 over 3000 solar s bursts accompanied by over 800 type iii radio bursts were observed over a time period of 8 hours the characteristics of type iii radio bursts are consistent to previous studies while s bursts show narrow bandwidths durations and drift rates of about 12 the drift rate of type iii bursts type iii bursts and solar s bursts occur in a region in the corona where plasma emission is the dominant emission mechanism as determined by data constrained density and magnetic field models | [['the', 'sun', 'is', 'an', 'active', 'source', 'of', 'radio', 'emission', 'which', 'is', 'often', 'associated', 'with', 'the', 'acceleration', 'of', 'electrons', 'arising', 'from', 'processes', 'such', 'as', 'solar', 'flares', 'and', 'coronal', 'mass', 'ejections', 'cmes', 'at', 'low', 'radio', 'frequencies', '100', 'mhz', 'numerous', 'solar', 's', 'bursts', 'where', 's', 'stands', 'for', 'short', 'and', 'storms', 'of', 'type', 'iii', 'radio', 'bursts', 'have', 'been', 'observed', 'that', 'are', 'not', 'directly', 'relates', 'to', 'flares', 'and', 'cmes', 'here', 'we', 'expand', 'our', 'understanding', 'on', 'the', 'spectral', 'characteristic', 'of', 'these', 'two', 'different', 'types', 'of', 'radio', 'bursts', 'based', 'on', 'observations', 'from', 'the', 'low', 'frequency', 'array', 'lofar', 'on', '9', 'july', '2013', 'over', '3000', 'solar', 's', 'bursts', 'accompanied', 'by', 'over', '800', 'type', 'iii', 'radio', 'bursts', 'were', 'observed', 'over', 'a', 'time', 'period', 'of', '8', 'hours', 'the', 'characteristics', 'of', 'type', 'iii', 'radio', 'bursts', 'are', 'consistent', 'to', 'previous', 'studies', 'while', 's', 'bursts', 'show', 'narrow', 'bandwidths', 'durations', 'and', 'drift', 'rates', 'of', 'about', '12', 'the', 'drift', 'rate', 'of', 'type', 'iii', 'bursts', 'type', 'iii', 'bursts', 'and', 'solar', 's', 'bursts', 'occur', 'in', 'a', 'region', 'in', 'the', 'corona', 'where', 'plasma', 'emission', 'is', 'the', 'dominant', 'emission', 'mechanism', 'as', 'determined', 'by', 'data', 'constrained', 'density', 'and', 'magnetic', 'field', 'models']] | [-0.10158444960317058, 0.23819181747652085, 0.07627928986807496, 0.14182369242512827, -0.10144381871602187, -0.10359716232762568, 0.056585283887883024, 0.4529330973823865, -0.19304072581128115, -0.3558008662994123, 0.09731743917412435, -0.2757937364409574, -0.05641428682332238, 0.27956921935029744, 0.004377055735838237, -0.0685603707563132, 0.07470805042733748, -0.053578192681177625, -0.037748057259401925, -0.15895842363954418, 0.22424654943558078, 0.13030691861511312, 0.22438163023907692, -0.0462481317618464, 0.07136531586875208, -0.12988098775838605, -0.08667994246303957, -0.052700761263258754, -0.06917965512560234, 0.01553577550350585, 0.2235671481902803, 0.1481320282547838, 0.2085130622289095, -0.433437497753443, -0.29497956733943687, 0.04641191961192009, 0.14907487018628873, -0.06189000510494225, -0.0118890120951821, -0.2658777708045414, 0.09211984831684579, -0.19141289727607122, -0.1079014066994811, 0.15302400404794347, 0.12001907961611222, 0.128235003317564, -0.2528845819010813, 0.13213185062114563, 0.020743354270881455, 0.10084314769030445, -0.10755545107596036, -0.03697547447712471, 0.02194154640375119, 0.0670309635784684, 0.10733855684003275, 0.03761293868948188, 0.14983926875413292, -0.05939184052176642, -0.12994740122166049, 0.34899781667627394, -0.04237009877494226, 0.038703670965333004, 0.24153412870881666, -0.24316221493192844, -0.16053021543969712, 0.24051407429570745, 0.16851055027606587, 0.08881524699843592, -0.12988820256755895, 0.003954892171896063, 0.03218128115339722, 0.17558399881753656, 0.07834222410391602, 0.07564143751903127, 0.27951579126788095, 0.1023862356113063, 0.007669156196061522, 0.04127231548643774, -0.273260019152076, 0.022378254174772235, -0.28692086361374497, -0.05154276527076339, -0.12909051351145737, 0.1324591384438261, -0.059072987851201714, -0.14029617379290155, 0.4556108630132965, 0.06597305958211008, 0.18702781897866064, 0.019732995939880815, 0.21551646621276935, 0.0985866224412651, 0.08544220338869006, 0.14733280106965038, 0.27593245382110276, 0.14873419777852379, 0.17247191841338969, -0.18628354558928145, 0.06873262316350721, 0.03710847106348309] |
1,802.10461 | Time Varying Channel Tracking with Spatial and Temporal BEM for Massive
MIMO Systems | In this paper, we propose a channel tracking method for massive multi-input
and multi-output systems under both time-varying and spatial-varying
circumstance. Exploiting the characteristics of massive antenna array, a
spatial-temporal basis expansion model is designed to reduce the effective
dimensions of up-link and down-link channel, which decomposes channel state
information into the time-varying spatial information and gain information. We
firstly model the users movements as a one-order unknown Markov process, which
is blindly learned by the expectation and maximization (EM) approach. Then, the
up-link time varying spatial information can be blindly tracked by Taylor
series expansion of the steering vector, while the rest up-link channel gain
information can be trained by only a few pilot symbols. Due to angle
reciprocity (spatial reciprocity), the spatial information of the down-link
channel can be immediately obtained from the up-link counterpart, which greatly
reduces the complexity of down-link channel tracking. Various numerical results
are provided to demonstrate the effectiveness of the proposed method.
| eess.SP cs.PF | in this paper we propose a channel tracking method for massive multiinput and multioutput systems under both timevarying and spatialvarying circumstance exploiting the characteristics of massive antenna array a spatialtemporal basis expansion model is designed to reduce the effective dimensions of uplink and downlink channel which decomposes channel state information into the timevarying spatial information and gain information we firstly model the users movements as a oneorder unknown markov process which is blindly learned by the expectation and maximization em approach then the uplink time varying spatial information can be blindly tracked by taylor series expansion of the steering vector while the rest uplink channel gain information can be trained by only a few pilot symbols due to angle reciprocity spatial reciprocity the spatial information of the downlink channel can be immediately obtained from the uplink counterpart which greatly reduces the complexity of downlink channel tracking various numerical results are provided to demonstrate the effectiveness of the proposed method | [['in', 'this', 'paper', 'we', 'propose', 'a', 'channel', 'tracking', 'method', 'for', 'massive', 'multiinput', 'and', 'multioutput', 'systems', 'under', 'both', 'timevarying', 'and', 'spatialvarying', 'circumstance', 'exploiting', 'the', 'characteristics', 'of', 'massive', 'antenna', 'array', 'a', 'spatialtemporal', 'basis', 'expansion', 'model', 'is', 'designed', 'to', 'reduce', 'the', 'effective', 'dimensions', 'of', 'uplink', 'and', 'downlink', 'channel', 'which', 'decomposes', 'channel', 'state', 'information', 'into', 'the', 'timevarying', 'spatial', 'information', 'and', 'gain', 'information', 'we', 'firstly', 'model', 'the', 'users', 'movements', 'as', 'a', 'oneorder', 'unknown', 'markov', 'process', 'which', 'is', 'blindly', 'learned', 'by', 'the', 'expectation', 'and', 'maximization', 'em', 'approach', 'then', 'the', 'uplink', 'time', 'varying', 'spatial', 'information', 'can', 'be', 'blindly', 'tracked', 'by', 'taylor', 'series', 'expansion', 'of', 'the', 'steering', 'vector', 'while', 'the', 'rest', 'uplink', 'channel', 'gain', 'information', 'can', 'be', 'trained', 'by', 'only', 'a', 'few', 'pilot', 'symbols', 'due', 'to', 'angle', 'reciprocity', 'spatial', 'reciprocity', 'the', 'spatial', 'information', 'of', 'the', 'downlink', 'channel', 'can', 'be', 'immediately', 'obtained', 'from', 'the', 'uplink', 'counterpart', 'which', 'greatly', 'reduces', 'the', 'complexity', 'of', 'downlink', 'channel', 'tracking', 'various', 'numerical', 'results', 'are', 'provided', 'to', 'demonstrate', 'the', 'effectiveness', 'of', 'the', 'proposed', 'method']] | [-0.18602030709108833, 0.05424544362268776, -0.059236068511381745, 0.022892615854830125, -0.11614268268989045, -0.2178549269049228, 0.07467723559423149, 0.39160304863442064, -0.3062213371232258, -0.29238441541954535, 0.12932703282633984, -0.20316118940333777, -0.19834612259829912, 0.09578762764311573, -0.07920672606582506, 0.07605776488869392, 0.08123554002870864, 0.055878554152536994, -0.04521727176601232, -0.2577962887832966, 0.2844435580876432, 0.12496131957991968, 0.3653733429994104, -0.0229430660930362, 0.13612846393267847, 0.054844610004013854, -0.06869667450472995, -0.03437409577655453, -0.0558165817910546, 0.0981243805977504, 0.28244401304687883, 0.2151022413067661, 0.2783493940376594, -0.4050134828997941, -0.2895861090561729, 0.08287272833971472, 0.21253162510309934, 0.08580999163825277, -0.01378236272036322, -0.36575161315842614, 0.10073024855301821, -0.21412485578728108, -0.013563140095034731, -0.022926040500685384, -0.11291600929726434, 0.017515527644073825, -0.3819560288993901, 0.07363407444883038, 0.01624979568745564, 0.017927106316614, -0.06140440086763399, -0.08194051483716769, 0.0040011973818579885, 0.18418851569353875, 0.04232298328575849, -0.030899938035688565, 0.10588253767648122, -0.11039051463196785, -0.08472943277381172, 0.3286015850114577, -0.03085350220185952, -0.2801659939975678, 0.11805067500880553, -0.1266949888277516, -0.030522216454773102, 0.18516221472770977, 0.26992343692698434, 0.07527253376850504, -0.2414026262085366, 0.020579551657163714, -0.022716823790688068, 0.19377708435942761, 0.0767476841353493, 0.11890312491715709, 0.16797166380550876, 0.16267420227132454, 0.06828007817045856, 0.1523675404517039, -0.1563753630977737, -0.10887567873431157, -0.208068335204845, -0.13513033350737497, -0.22500803496370303, 0.004067546480240984, -0.12047307706934243, -0.019043057734040615, 0.3820412625511519, 0.15261031099878064, 0.1285925757823677, 0.10878731927958235, 0.3986782437320091, 0.1305055802539168, 0.056737252471112366, 0.10597856704416815, 0.17745878067622078, 0.1257578118223862, 0.1559171679656646, -0.22652620193106418, 0.0664960853608113, 0.016069767328385925] |
1,802.10462 | Inflation with explicit parametric connection between General Relativity
and Scalar-Tensor gravity | In this paper we consider the cosmological inflation within scalar-tensor
gravity and compare it with standard inflation based on general relativity. The
difference is determined by the value of the parameter $\Delta$. This approach
is associated with using the special ansatz which links a function that defines
a type of gravity with a scale factor of the universe.
| gr-qc | in this paper we consider the cosmological inflation within scalartensor gravity and compare it with standard inflation based on general relativity the difference is determined by the value of the parameter delta this approach is associated with using the special ansatz which links a function that defines a type of gravity with a scale factor of the universe | [['in', 'this', 'paper', 'we', 'consider', 'the', 'cosmological', 'inflation', 'within', 'scalartensor', 'gravity', 'and', 'compare', 'it', 'with', 'standard', 'inflation', 'based', 'on', 'general', 'relativity', 'the', 'difference', 'is', 'determined', 'by', 'the', 'value', 'of', 'the', 'parameter', 'delta', 'this', 'approach', 'is', 'associated', 'with', 'using', 'the', 'special', 'ansatz', 'which', 'links', 'a', 'function', 'that', 'defines', 'a', 'type', 'of', 'gravity', 'with', 'a', 'scale', 'factor', 'of', 'the', 'universe']] | [-0.14216737555147246, 0.09658378887728884, -0.10351314654188423, 0.0745878348945929, -0.0901910532908193, -0.13896585585437074, -0.012553695057406378, 0.2681297309744846, -0.21856433898210526, -0.30099206045269966, 0.07685530049011818, -0.19233612205977713, -0.15199953381871356, 0.16098783383595533, -0.0405302847101321, -0.023922831815635336, 0.01165505020140574, 0.0670014872488662, -0.10141654194991008, -0.21572087904647122, 0.44497882973017366, 0.08461980263156624, 0.20958706691604237, -0.03873222158290446, 0.11931652532376606, -0.05225204553551458, -0.006699271692798056, 0.07040867283298023, -0.2065603800148328, 0.122333437866724, 0.14834740240496166, 0.13116671607412142, 0.2728406059523595, -0.33918449359721153, -0.2555495070711035, 0.1216639145919732, 0.06154955467530366, 0.12781246180509634, -0.022934137163121766, -0.26044738825795977, 0.0510088138980791, -0.19442493934585744, -0.120468726662662, -0.0016606714142936058, -0.009078986814309811, -0.033186043805346406, -0.2685165375728032, 0.12158304411147175, -0.054687606010200646, -0.012429920811976853, -0.014047384607316605, -0.0498878417881848, 0.04401649649511894, 0.01067048969582237, 0.13011018096686117, 0.08393977597709103, 0.09357726405342591, -0.13695250347995297, -0.07063551862113948, 0.46387310454557684, -0.16392996529887977, -0.21172668032723496, 0.09537648821072973, -0.1602240622059667, -0.15475248216233892, 0.029667899684964454, 0.08807947473793194, 0.14272728761465386, -0.14489903551494254, 0.17953069727960172, -0.010112741484370982, 0.16101183767976432, 0.07306117182677804, -0.005327515154555118, 0.2593354276252975, 0.19430275614662418, 0.027416734635059177, 0.10366779455015886, -0.03339388705328396, -0.11026381094265601, -0.4083558265119791, -0.1341018729265137, -0.1656401783934441, 0.04854528350627114, -0.161179687257541, -0.1850023984925115, 0.41612516500955, 0.13627026894065583, 0.1705125721878019, 0.11733779984181104, 0.24451996026367978, 0.1465481028506725, 0.06325667239083298, 0.0732716834654325, 0.29843052163928874, 0.12114647744175304, 0.08515423009621687, -0.2407773627321525, -0.0032346981882663637, 0.08454774402017737] |
1,802.10463 | DiGrad: Multi-Task Reinforcement Learning with Shared Actions | Most reinforcement learning algorithms are inefficient for learning multiple
tasks in complex robotic systems, where different tasks share a set of actions.
In such environments a compound policy may be learnt with shared neural network
parameters, which performs multiple tasks concurrently. However such compound
policy may get biased towards a task or the gradients from different tasks
negate each other, making the learning unstable and sometimes less data
efficient. In this paper, we propose a new approach for simultaneous training
of multiple tasks sharing a set of common actions in continuous action spaces,
which we call as DiGrad (Differential Policy Gradient). The proposed framework
is based on differential policy gradients and can accommodate multi-task
learning in a single actor-critic network. We also propose a simple heuristic
in the differential policy gradient update to further improve the learning. The
proposed architecture was tested on 8 link planar manipulator and 27 degrees of
freedom(DoF) Humanoid for learning multi-goal reachability tasks for 3 and 2
end effectors respectively. We show that our approach supports efficient
multi-task learning in complex robotic systems, outperforming related methods
in continuous action spaces.
| cs.LG cs.AI cs.RO stat.ML | most reinforcement learning algorithms are inefficient for learning multiple tasks in complex robotic systems where different tasks share a set of actions in such environments a compound policy may be learnt with shared neural network parameters which performs multiple tasks concurrently however such compound policy may get biased towards a task or the gradients from different tasks negate each other making the learning unstable and sometimes less data efficient in this paper we propose a new approach for simultaneous training of multiple tasks sharing a set of common actions in continuous action spaces which we call as digrad differential policy gradient the proposed framework is based on differential policy gradients and can accommodate multitask learning in a single actorcritic network we also propose a simple heuristic in the differential policy gradient update to further improve the learning the proposed architecture was tested on 8 link planar manipulator and 27 degrees of freedomdof humanoid for learning multigoal reachability tasks for 3 and 2 end effectors respectively we show that our approach supports efficient multitask learning in complex robotic systems outperforming related methods in continuous action spaces | [['most', 'reinforcement', 'learning', 'algorithms', 'are', 'inefficient', 'for', 'learning', 'multiple', 'tasks', 'in', 'complex', 'robotic', 'systems', 'where', 'different', 'tasks', 'share', 'a', 'set', 'of', 'actions', 'in', 'such', 'environments', 'a', 'compound', 'policy', 'may', 'be', 'learnt', 'with', 'shared', 'neural', 'network', 'parameters', 'which', 'performs', 'multiple', 'tasks', 'concurrently', 'however', 'such', 'compound', 'policy', 'may', 'get', 'biased', 'towards', 'a', 'task', 'or', 'the', 'gradients', 'from', 'different', 'tasks', 'negate', 'each', 'other', 'making', 'the', 'learning', 'unstable', 'and', 'sometimes', 'less', 'data', 'efficient', 'in', 'this', 'paper', 'we', 'propose', 'a', 'new', 'approach', 'for', 'simultaneous', 'training', 'of', 'multiple', 'tasks', 'sharing', 'a', 'set', 'of', 'common', 'actions', 'in', 'continuous', 'action', 'spaces', 'which', 'we', 'call', 'as', 'digrad', 'differential', 'policy', 'gradient', 'the', 'proposed', 'framework', 'is', 'based', 'on', 'differential', 'policy', 'gradients', 'and', 'can', 'accommodate', 'multitask', 'learning', 'in', 'a', 'single', 'actorcritic', 'network', 'we', 'also', 'propose', 'a', 'simple', 'heuristic', 'in', 'the', 'differential', 'policy', 'gradient', 'update', 'to', 'further', 'improve', 'the', 'learning', 'the', 'proposed', 'architecture', 'was', 'tested', 'on', '8', 'link', 'planar', 'manipulator', 'and', '27', 'degrees', 'of', 'freedomdof', 'humanoid', 'for', 'learning', 'multigoal', 'reachability', 'tasks', 'for', '3', 'and', '2', 'end', 'effectors', 'respectively', 'we', 'show', 'that', 'our', 'approach', 'supports', 'efficient', 'multitask', 'learning', 'in', 'complex', 'robotic', 'systems', 'outperforming', 'related', 'methods', 'in', 'continuous', 'action', 'spaces']] | [-0.09452552022921339, 0.029810108509057208, -0.08332281486166875, 0.046989013863310135, -0.15244843185080287, -0.22775899394685045, 0.06845209103833395, 0.5030852713382961, -0.28491056828360106, -0.3208200004297853, 0.07502302198411255, -0.20066391056037094, -0.21974240570797335, 0.21248466924438508, -0.17446133302988637, 0.10205876318384166, 0.11786412263462126, 0.06741250322716912, -0.06361536686073306, -0.27179695539115395, 0.317603119699885, -0.016207505348316633, 0.2980180320385945, -0.033798900822208065, 0.1693033187407135, 0.001937493671729265, 0.013969334196095747, -0.013787824488779316, -0.01464657495460693, 0.1611990495813919, 0.37224076094380654, 0.2012985289641376, 0.37560308304783263, -0.3883105625291584, -0.23286238226713868, 0.10986822214781668, 0.153628699015826, 0.07815352636338542, -0.02322978674401682, -0.31318172991601495, 0.06806191660290778, -0.19139303949463074, 0.016938121454685907, -0.14773671607909306, -0.05270251462266582, -0.01350893917216161, -0.3411909242750965, -0.003460061725113246, 0.04559630706389129, 0.07575867135495029, -0.07437781924941664, -0.12695580232593287, 0.031064566411841354, 0.15931946286407447, -0.00043944551105626296, 0.056351035779922225, 0.19148999729952038, -0.1588629418615089, -0.22605097355178552, 0.3425257439964293, -0.022684450469951812, -0.21433724822792036, 0.2182693730573306, -0.0013819612331098057, -0.22381051143509198, 0.08139498128754194, 0.28051203145782966, 0.17735357434473564, -0.17396931617413877, -0.006654113788116988, -0.04267146967127512, 0.13944517063801407, 0.026061163792803967, -0.03095162211271013, 0.13482405237145492, 0.25628343792479547, 0.10788564352176147, 0.12129474639647024, -0.05596063303369316, -0.11958836955514537, -0.19006929543318452, -0.12270545271795263, -0.13396251951776894, -0.04211200334136807, -0.12690833187248568, -0.10472777479231521, 0.34043324233892835, 0.19292842540152044, 0.21057210422421252, 0.12686587005848562, 0.3418437496356951, 0.042349184538992224, 0.09977349701790454, 0.14914791748313172, 0.16010837975375436, -0.016389055543991386, 0.1622434676741886, -0.19439716269313026, 0.09700040873445448, 0.03252642923365525] |
1,802.10464 | Nonlinear Schr\"odinger equation, differentiation by parts and
modulation spaces | We show the existence of weak solutions in the extended sense of the Cauchy
problem for the cubic nonlinear Schr\"odinger equation in the modulation space
$M_{p,q}^{s}(\mathbb R)$ where $1\leq q\leq2$, $2\leq p<\frac{10q'}{q'+6}$ and
$s\geq0$. Moreover, for either $1\leq q\leq\frac32, s\geq0$ and $2\leq p\leq 3$
or $\frac32<q\leq\frac{18}{11}, s>\frac23-\frac1{q}$ and $2\leq p\leq 3$ or
$\frac{18}{11}<q\leq2, s>\frac23-\frac1{q}$ and $2\leq p<\frac{10q'}{q'+6}$ we
show that the Cauchy problem is unconditionally wellposed in
$M_{p,q}^{s}(\mathbb R).$ This improves \cite{NP}, where the case $p=2$ was
considered and the differentiation by parts technique was introduced to a
problem with continuous Fourier variable. Here the same technique is used, but
more delicate estimates are necessary for $p\neq2$.
| math.AP | we show the existence of weak solutions in the extended sense of the cauchy problem for the cubic nonlinear schrodinger equation in the modulation space m_pqsmathbb r where 1leq qleq2 2leq pfrac10qq6 and sgeq0 moreover for either 1leq qleqfrac32 sgeq0 and 2leq pleq 3 or frac32qleqfrac1811 sfrac23frac1q and 2leq pleq 3 or frac1811qleq2 sfrac23frac1q and 2leq pfrac10qq6 we show that the cauchy problem is unconditionally wellposed in m_pqsmathbb r this improves citenp where the case p2 was considered and the differentiation by parts technique was introduced to a problem with continuous fourier variable here the same technique is used but more delicate estimates are necessary for pneq2 | [['we', 'show', 'the', 'existence', 'of', 'weak', 'solutions', 'in', 'the', 'extended', 'sense', 'of', 'the', 'cauchy', 'problem', 'for', 'the', 'cubic', 'nonlinear', 'schrodinger', 'equation', 'in', 'the', 'modulation', 'space', 'm_pqsmathbb', 'r', 'where', '1leq', 'qleq2', '2leq', 'pfrac10qq6', 'and', 'sgeq0', 'moreover', 'for', 'either', '1leq', 'qleqfrac32', 'sgeq0', 'and', '2leq', 'pleq', '3', 'or', 'frac32qleqfrac1811', 'sfrac23frac1q', 'and', '2leq', 'pleq', '3', 'or', 'frac1811qleq2', 'sfrac23frac1q', 'and', '2leq', 'pfrac10qq6', 'we', 'show', 'that', 'the', 'cauchy', 'problem', 'is', 'unconditionally', 'wellposed', 'in', 'm_pqsmathbb', 'r', 'this', 'improves', 'citenp', 'where', 'the', 'case', 'p2', 'was', 'considered', 'and', 'the', 'differentiation', 'by', 'parts', 'technique', 'was', 'introduced', 'to', 'a', 'problem', 'with', 'continuous', 'fourier', 'variable', 'here', 'the', 'same', 'technique', 'is', 'used', 'but', 'more', 'delicate', 'estimates', 'are', 'necessary', 'for', 'pneq2']] | [-0.15565804383833892, 0.09488046935293823, -0.019086411981843413, 0.09485034260782413, -0.05473460144685305, -0.19660682204645127, -0.057270559931639584, 0.3508652010373771, -0.25973533453419806, -0.2063338429480791, 0.18324443045188674, -0.29126059836708007, -0.14340284020698163, 0.18500925514381378, -0.061889617112465205, 0.07937857632990926, -0.005948629160411656, 0.023658559061586856, -0.07412488334579394, -0.2893732077255845, 0.3393348747305572, -0.07818371077999473, 0.16179301887284964, 0.04315609211102128, 0.09387213203124702, 0.06584366166498512, 0.015222899205982686, -0.014760548421472777, -0.221666491483702, 0.058710618108743805, 0.24953343208879233, 0.09755141781177372, 0.29307664729654787, -0.35837835001992063, -0.20842819957062603, 0.17955390938557683, 0.1921359621314332, -0.005271234232932329, -0.02628381527334568, -0.23986548272660002, 0.16287330294493585, -0.07504293871112168, -0.16356964968610554, -0.05998891157563776, 0.07478606406599284, 0.03461887732613832, -0.39367388805374504, 0.12753234346397221, 0.14620692858472467, 0.031628917055204514, -0.1616461854451336, -0.11751356611028313, -0.012987325172871352, 0.04112142165657133, -0.013799815126694738, 0.06877425124403089, -0.06770733457058668, -0.0513224124442786, -0.06088042778079398, 0.34089011505246164, -0.051956893913447856, -0.26055397115647794, 0.12435942375101149, -0.17892042840365321, -0.14370619676541538, 0.07628680618247018, 0.0985713935829699, 0.22845131647773087, -0.05854847344569862, 0.20548557610891294, -0.027920729420147835, 0.1894056380947586, 0.11945636080112308, -0.007658459162339568, 0.01903125608339906, 0.09664920083247125, 0.1537962177587906, 0.12757701283320785, -0.06145762574858964, 0.0188568898383528, -0.3131197906844318, -0.17522938088397497, -0.1949967491067946, 0.09112781123025343, -0.11709683954642969, -0.08214018939062953, 0.27332073416444475, 0.10254693241324275, 0.1076570090543828, 0.07997656469233334, 0.20239489645464345, 0.12670146234333515, -0.00825138478539884, 0.1267415670584887, 0.1482288441050332, 0.11109347960213199, 0.1211470742058009, -0.1719280095747672, -0.025960915815085174, 0.1309584523923695] |
1,802.10465 | Leakage and Protocol Composition in a Game-Theoretic Perspective | In the inference attacks studied in Quantitative Information Flow (QIF), the
adversary typically tries to interfere with the system in the attempt to
increase its leakage of secret information. The defender, on the other hand,
typically tries to decrease leakage by introducing some controlled noise. This
noise introduction can be modeled as a type of protocol composition, i.e., a
probabilistic choice among different protocols, and its effect on the amount of
leakage depends heavily on whether or not this choice is visible to the
adversary. In this work we consider operators for modeling visible and
invisible choice in protocol composition, and we study their algebraic
properties. We then formalize the interplay between defender and adversary in a
game-theoretic framework adapted to the specific issues of QIF, where the
payoff is information leakage. We consider various kinds of leakage games,
depending on whether players act simultaneously or sequentially, and on whether
or not the choices of the defender are visible to the adversary. Finally, we
establish a hierarchy of these games in terms of their information leakage, and
provide methods for finding optimal strategies (at the points of equilibrium)
for both attacker and defender in the various cases. The full version of this
paper can be found in arXiv:1803.10042
| cs.CR cs.GT cs.IT cs.LO math.IT | in the inference attacks studied in quantitative information flow qif the adversary typically tries to interfere with the system in the attempt to increase its leakage of secret information the defender on the other hand typically tries to decrease leakage by introducing some controlled noise this noise introduction can be modeled as a type of protocol composition ie a probabilistic choice among different protocols and its effect on the amount of leakage depends heavily on whether or not this choice is visible to the adversary in this work we consider operators for modeling visible and invisible choice in protocol composition and we study their algebraic properties we then formalize the interplay between defender and adversary in a gametheoretic framework adapted to the specific issues of qif where the payoff is information leakage we consider various kinds of leakage games depending on whether players act simultaneously or sequentially and on whether or not the choices of the defender are visible to the adversary finally we establish a hierarchy of these games in terms of their information leakage and provide methods for finding optimal strategies at the points of equilibrium for both attacker and defender in the various cases the full version of this paper can be found in arxiv180310042 | [['in', 'the', 'inference', 'attacks', 'studied', 'in', 'quantitative', 'information', 'flow', 'qif', 'the', 'adversary', 'typically', 'tries', 'to', 'interfere', 'with', 'the', 'system', 'in', 'the', 'attempt', 'to', 'increase', 'its', 'leakage', 'of', 'secret', 'information', 'the', 'defender', 'on', 'the', 'other', 'hand', 'typically', 'tries', 'to', 'decrease', 'leakage', 'by', 'introducing', 'some', 'controlled', 'noise', 'this', 'noise', 'introduction', 'can', 'be', 'modeled', 'as', 'a', 'type', 'of', 'protocol', 'composition', 'ie', 'a', 'probabilistic', 'choice', 'among', 'different', 'protocols', 'and', 'its', 'effect', 'on', 'the', 'amount', 'of', 'leakage', 'depends', 'heavily', 'on', 'whether', 'or', 'not', 'this', 'choice', 'is', 'visible', 'to', 'the', 'adversary', 'in', 'this', 'work', 'we', 'consider', 'operators', 'for', 'modeling', 'visible', 'and', 'invisible', 'choice', 'in', 'protocol', 'composition', 'and', 'we', 'study', 'their', 'algebraic', 'properties', 'we', 'then', 'formalize', 'the', 'interplay', 'between', 'defender', 'and', 'adversary', 'in', 'a', 'gametheoretic', 'framework', 'adapted', 'to', 'the', 'specific', 'issues', 'of', 'qif', 'where', 'the', 'payoff', 'is', 'information', 'leakage', 'we', 'consider', 'various', 'kinds', 'of', 'leakage', 'games', 'depending', 'on', 'whether', 'players', 'act', 'simultaneously', 'or', 'sequentially', 'and', 'on', 'whether', 'or', 'not', 'the', 'choices', 'of', 'the', 'defender', 'are', 'visible', 'to', 'the', 'adversary', 'finally', 'we', 'establish', 'a', 'hierarchy', 'of', 'these', 'games', 'in', 'terms', 'of', 'their', 'information', 'leakage', 'and', 'provide', 'methods', 'for', 'finding', 'optimal', 'strategies', 'at', 'the', 'points', 'of', 'equilibrium', 'for', 'both', 'attacker', 'and', 'defender', 'in', 'the', 'various', 'cases', 'the', 'full', 'version', 'of', 'this', 'paper', 'can', 'be', 'found', 'in', 'arxiv180310042']] | [-0.11332613899449004, 0.05470211119143571, -0.08398040411498955, 0.09793400360329824, -0.07469183089468034, -0.2145031847257689, 0.12326433832233025, 0.3799580807914589, -0.31173590437963533, -0.3363006440292738, 0.13581596419230949, -0.2774425731063033, -0.13687096326611936, 0.13066717401115394, -0.1472514221958753, 0.021922143947238616, -0.008279418625086006, 0.05210135087884337, -0.004927165041439199, -0.2712671292927746, 0.36100952285409404, 0.04190083705496205, 0.25472812613490337, 0.060793292995515294, 0.06672136983406789, 0.03238839234207455, -0.03279914545313711, 0.016514697122327622, -0.13197330040587246, 0.09156048893118682, 0.273352010924693, 0.175159540153356, 0.312859488448695, -0.44528638913435636, -0.18525210372284776, 0.16395380894837963, 0.11512483881447905, 0.12236024696460884, -0.009429658030875135, -0.27611651784483937, 0.07412735307769139, -0.17232563644467633, -0.041240768176435995, -0.03610549037736179, -0.048229550639086446, 0.028669399309426476, -0.28317738635294537, -0.015707200179371425, 0.06930092715316312, 0.0488791117210679, -0.02542382468323781, -0.05029318613958531, -0.0012045482427763621, 0.20234879335626996, 0.03808487308715529, -0.04635898338558809, 0.17258825949235743, -0.16551024105921747, -0.13049100312305353, 0.33874705635069685, -0.03800533913949882, -0.22699796863278185, 0.16724150985983258, -0.07544353407479211, -0.10407013039257611, 0.05949415177543274, 0.2038400624766226, 0.11482327097997627, -0.1456653510224848, 0.05021635629489775, -0.019285229728995837, 0.2124254745836167, 0.05947936249554949, 0.10417826024248548, 0.1692641756861754, 0.1359234356601466, 0.12176802113218062, 0.13567621657958903, -0.040035542225519166, -0.12252118152786712, -0.2854352646196882, -0.12346867354280779, -0.14353763197035785, 0.04095597653652559, -0.05015448582475917, -0.1197446438220694, 0.39415942997208253, 0.20398283987268098, 0.16486253026323977, 0.013825280951776943, 0.3569101102308231, 0.06771621823362592, 0.015208196973344896, 0.09063112219696604, 0.23242234779453774, 0.044118435469631484, 0.10351066866997576, -0.2258078539069148, 0.17260485726683109, 0.01794358739654133] |
1,802.10466 | Generalized boosts with shell structure of the parameter space | A modification of boost transformation in arbitrary pseudo-Euclidean space is
suggested, which in the case of the Minkowski space admits the existence of
inertial reference frames moving with velocities taking values in a certain
bounded interval. The velocity space may be partitioned by hypersurfaces
\beta^2=\beta^2_k=const, k=1,2,3,..., into a finite or countable number of
domains (shells), each of which has own class of inertial "reference frames"
and the velocity composition law. These shells are in one-to-one
correspondence. A set of mappings of shells to each other forms the group,
isomorphic to permutation group in the case of finite number of shells, or the
group of integers in the case of countable number of shells in the velocity
space
| physics.gen-ph | a modification of boost transformation in arbitrary pseudoeuclidean space is suggested which in the case of the minkowski space admits the existence of inertial reference frames moving with velocities taking values in a certain bounded interval the velocity space may be partitioned by hypersurfaces beta2beta2_kconst k123 into a finite or countable number of domains shells each of which has own class of inertial reference frames and the velocity composition law these shells are in onetoone correspondence a set of mappings of shells to each other forms the group isomorphic to permutation group in the case of finite number of shells or the group of integers in the case of countable number of shells in the velocity space | [['a', 'modification', 'of', 'boost', 'transformation', 'in', 'arbitrary', 'pseudoeuclidean', 'space', 'is', 'suggested', 'which', 'in', 'the', 'case', 'of', 'the', 'minkowski', 'space', 'admits', 'the', 'existence', 'of', 'inertial', 'reference', 'frames', 'moving', 'with', 'velocities', 'taking', 'values', 'in', 'a', 'certain', 'bounded', 'interval', 'the', 'velocity', 'space', 'may', 'be', 'partitioned', 'by', 'hypersurfaces', 'beta2beta2_kconst', 'k123', 'into', 'a', 'finite', 'or', 'countable', 'number', 'of', 'domains', 'shells', 'each', 'of', 'which', 'has', 'own', 'class', 'of', 'inertial', 'reference', 'frames', 'and', 'the', 'velocity', 'composition', 'law', 'these', 'shells', 'are', 'in', 'onetoone', 'correspondence', 'a', 'set', 'of', 'mappings', 'of', 'shells', 'to', 'each', 'other', 'forms', 'the', 'group', 'isomorphic', 'to', 'permutation', 'group', 'in', 'the', 'case', 'of', 'finite', 'number', 'of', 'shells', 'or', 'the', 'group', 'of', 'integers', 'in', 'the', 'case', 'of', 'countable', 'number', 'of', 'shells', 'in', 'the', 'velocity', 'space']] | [-0.1926530449057062, 0.14965983549662834, -0.07181019332171579, -0.017144397957399006, -0.07830446650241983, -0.07385798839948557, 0.0008267258975859571, 0.3775705354256106, -0.2853715609566405, -0.24445998072945352, 0.058715664622060765, -0.25019279763038305, -0.030010959868126644, 0.14662534463046728, -0.07536609647474413, 0.003493893380875996, 0.035475916815279375, 0.12458045345506277, -0.10891946986044661, -0.24346135441085387, 0.3697892768661781, -0.034287563083564926, 0.233775192687031, -0.06399718129300866, 0.11616345920503654, -0.014083966363927928, -0.029079676942964053, 0.08115730168004841, -0.09513859947790103, 0.09519800841647746, 0.2540434095730046, 0.09920257103533067, 0.2916841581433706, -0.3778229081071913, -0.224717854851343, 0.17120874942489098, 0.14964300469928904, 0.038114991318033045, -0.037480836304643286, -0.3079103382147752, 0.046262000269930936, -0.17631017113232922, -0.15573731373096333, -0.009224616440719572, 0.08617216221795514, 0.0623611192989709, -0.23975500539908634, 0.05531705076743398, 0.08563891242274307, 0.07585738898768764, -0.12326170126546239, -0.05249488463320223, -0.06313723790788509, 0.12263145476403035, 0.04537117215282894, 0.02965856804351868, 0.10502937744403708, -0.04433180577651565, -0.0463541879174139, 0.4692338965752901, -0.05783472363515917, -0.2721788238669778, 0.1644542474893789, -0.20946515318215023, -0.1216095044871728, 0.14999249494827255, 0.1574457110114524, 0.1253498608765422, -0.04212896821313891, 0.13236023114687073, -0.10938848076580927, 0.09927136432941489, 0.1434258087578326, 0.035506974763220886, 0.1787720399302559, 0.08040422652767779, 0.08124776897502356, 0.13556543400798168, -0.039329547322644244, -0.06637703608079203, -0.38416138522583865, -0.19993055361355172, -0.16606618447935786, 0.008649470601712578, -0.14831809455853515, -0.18899519526367559, 0.34869508827827744, 0.015719305584407893, 0.2075843697751005, 0.04927399399056067, 0.20722904979604587, 0.04374704114073619, 0.07647536308825786, 0.08226538611302987, 0.1616360362426474, 0.15900427009709628, -0.007304346742879214, -0.1545655025562657, -0.018524997574598367, 0.16932639586857162] |
1,802.10467 | Quantitative Separation Logic - A Logic for Reasoning about
Probabilistic Programs | We present quantitative separation logic ($\mathsf{QSL}$). In contrast to
classical separation logic, $\mathsf{QSL}$ employs quantities which evaluate to
real numbers instead of predicates which evaluate to Boolean values. The
connectives of classical separation logic, separating conjunction and
separating implication, are lifted from predicates to quantities. This
extension is conservative: Both connectives are backward compatible to their
classical analogs and obey the same laws, e.g. modus ponens, adjointness, etc.
Furthermore, we develop a weakest precondition calculus for quantitative
reasoning about probabilistic pointer programs in $\mathsf{QSL}$. This calculus
is a conservative extension of both Reynolds' separation logic for
heap-manipulating programs and Kozen's / McIver and Morgan's weakest
preexpectations for probabilistic programs. Soundness is proven with respect to
an operational semantics based on Markov decision processes. Our calculus
preserves O'Hearn's frame rule, which enables local reasoning. We demonstrate
that our calculus enables reasoning about quantities such as the probability of
terminating with an empty heap, the probability of reaching a certain array
permutation, or the expected length of a list.
| cs.LO cs.PL | we present quantitative separation logic mathsfqsl in contrast to classical separation logic mathsfqsl employs quantities which evaluate to real numbers instead of predicates which evaluate to boolean values the connectives of classical separation logic separating conjunction and separating implication are lifted from predicates to quantities this extension is conservative both connectives are backward compatible to their classical analogs and obey the same laws eg modus ponens adjointness etc furthermore we develop a weakest precondition calculus for quantitative reasoning about probabilistic pointer programs in mathsfqsl this calculus is a conservative extension of both reynolds separation logic for heapmanipulating programs and kozens mciver and morgans weakest preexpectations for probabilistic programs soundness is proven with respect to an operational semantics based on markov decision processes our calculus preserves ohearns frame rule which enables local reasoning we demonstrate that our calculus enables reasoning about quantities such as the probability of terminating with an empty heap the probability of reaching a certain array permutation or the expected length of a list | [['we', 'present', 'quantitative', 'separation', 'logic', 'mathsfqsl', 'in', 'contrast', 'to', 'classical', 'separation', 'logic', 'mathsfqsl', 'employs', 'quantities', 'which', 'evaluate', 'to', 'real', 'numbers', 'instead', 'of', 'predicates', 'which', 'evaluate', 'to', 'boolean', 'values', 'the', 'connectives', 'of', 'classical', 'separation', 'logic', 'separating', 'conjunction', 'and', 'separating', 'implication', 'are', 'lifted', 'from', 'predicates', 'to', 'quantities', 'this', 'extension', 'is', 'conservative', 'both', 'connectives', 'are', 'backward', 'compatible', 'to', 'their', 'classical', 'analogs', 'and', 'obey', 'the', 'same', 'laws', 'eg', 'modus', 'ponens', 'adjointness', 'etc', 'furthermore', 'we', 'develop', 'a', 'weakest', 'precondition', 'calculus', 'for', 'quantitative', 'reasoning', 'about', 'probabilistic', 'pointer', 'programs', 'in', 'mathsfqsl', 'this', 'calculus', 'is', 'a', 'conservative', 'extension', 'of', 'both', 'reynolds', 'separation', 'logic', 'for', 'heapmanipulating', 'programs', 'and', 'kozens', 'mciver', 'and', 'morgans', 'weakest', 'preexpectations', 'for', 'probabilistic', 'programs', 'soundness', 'is', 'proven', 'with', 'respect', 'to', 'an', 'operational', 'semantics', 'based', 'on', 'markov', 'decision', 'processes', 'our', 'calculus', 'preserves', 'ohearns', 'frame', 'rule', 'which', 'enables', 'local', 'reasoning', 'we', 'demonstrate', 'that', 'our', 'calculus', 'enables', 'reasoning', 'about', 'quantities', 'such', 'as', 'the', 'probability', 'of', 'terminating', 'with', 'an', 'empty', 'heap', 'the', 'probability', 'of', 'reaching', 'a', 'certain', 'array', 'permutation', 'or', 'the', 'expected', 'length', 'of', 'a', 'list']] | [-0.1212520897473124, 0.04132742715988901, -0.09603454872055657, 0.15459312682364587, -0.17625570631388462, -0.15392093390903688, 0.11073303526041633, 0.33897395427479887, -0.3220384913186232, -0.2856127206281985, 0.0779793482395524, -0.21755025983985626, -0.061329481682994146, 0.17121198682650698, -0.13557136248458515, 0.07837471200204384, 0.00136152248067612, 0.058665952876661764, -0.07040844423357737, -0.151671221486829, 0.2674101260942266, 0.004706586826818459, 0.22150896279649301, 0.001768176516017058, 0.11988759275356477, 0.07580624484936847, -0.005610060830120787, 0.04482918070967902, -0.07306126729381504, 0.12880149189749676, 0.3049928443308807, 0.228411582360665, 0.27330436828461563, -0.431562745311495, -0.0958556383544805, 0.05898416208766514, 0.06133625121446764, 0.08574127466629514, 0.06302748707504097, -0.31900713391545593, 0.08434439045800404, -0.1692061331052559, -0.0599287444104751, -0.13300725157852425, 0.05506408030985657, 0.036779800587982844, -0.2657823616525892, -0.017767964914850325, 0.18419469149613923, 0.11774255535706427, -0.02775650888303944, -0.10974196376857545, -0.012293194392413803, 0.05317845188053043, -0.03334970345410208, -0.006250653740470157, 0.13611544968955444, -0.04177528575660703, -0.22971346476961943, 0.3156242571488926, 0.002316754146225073, -0.21108022444655725, 0.1977025560703072, -0.06959278024274461, -0.19159549189392816, 0.08927003052508967, 0.07830379240101937, 0.13306814486753535, -0.13219306068777134, 0.09149391824294897, -0.03192905349600496, 0.25590414369873926, 0.1445542153591911, 0.07793360906653106, 0.2100403112923783, 0.15662366717940931, 0.04489833829980908, 0.15736772271268296, -0.003549791063944047, -0.1989346585730373, -0.3472947518990347, -0.19783017739766476, -0.05327550358505863, -0.008267631357761495, -0.09281625606394796, -0.20296510319140823, 0.28058440304558835, 0.2049395914813927, 0.11035860456864942, 0.23280189071965376, 0.2892000031819793, 0.14329674946158333, 0.08118008215008586, 0.024055046733525216, 0.13812971643355648, 0.19100458014749386, 0.114176763035357, -0.1593673110742009, 0.14808583748385762, 0.09857301099620985] |
1,802.10468 | Eigenstate thermalization hypothesis, time operator, and extremely quick
relaxation of fidelity | The eigenstate thermalization hypothesis (ETH) insists that for nonintegrable
systems each energy eigenstate accurately gives microcanonical expectation
values for a class of observables. As a mechanism for ETH to hold, we show that
the energy eigenstates are superposition of uncountably many quasi eigenstates
of operationally defined "time operator", which are thermal for thermodynamic
isolated quantum many-body systems and approximately orthogonal in terms of
extremely short relaxation time of the fidelity. In this way, our scenario
provides a theoretical explanation of ETH.
| cond-mat.stat-mech quant-ph | the eigenstate thermalization hypothesis eth insists that for nonintegrable systems each energy eigenstate accurately gives microcanonical expectation values for a class of observables as a mechanism for eth to hold we show that the energy eigenstates are superposition of uncountably many quasi eigenstates of operationally defined time operator which are thermal for thermodynamic isolated quantum manybody systems and approximately orthogonal in terms of extremely short relaxation time of the fidelity in this way our scenario provides a theoretical explanation of eth | [['the', 'eigenstate', 'thermalization', 'hypothesis', 'eth', 'insists', 'that', 'for', 'nonintegrable', 'systems', 'each', 'energy', 'eigenstate', 'accurately', 'gives', 'microcanonical', 'expectation', 'values', 'for', 'a', 'class', 'of', 'observables', 'as', 'a', 'mechanism', 'for', 'eth', 'to', 'hold', 'we', 'show', 'that', 'the', 'energy', 'eigenstates', 'are', 'superposition', 'of', 'uncountably', 'many', 'quasi', 'eigenstates', 'of', 'operationally', 'defined', 'time', 'operator', 'which', 'are', 'thermal', 'for', 'thermodynamic', 'isolated', 'quantum', 'manybody', 'systems', 'and', 'approximately', 'orthogonal', 'in', 'terms', 'of', 'extremely', 'short', 'relaxation', 'time', 'of', 'the', 'fidelity', 'in', 'this', 'way', 'our', 'scenario', 'provides', 'a', 'theoretical', 'explanation', 'of', 'eth']] | [-0.18507709681059314, 0.20410045144079184, -0.140447112162494, 0.1625950108727808, 0.06374719028395635, -0.19250315009834773, 0.019040055627601197, 0.3259798020216418, -0.21737709819960097, -0.25088068034591865, 0.02101598420743773, -0.25306879369151075, -0.05600040518146233, 0.21891865786165, 0.03493126594521864, 0.13928314017862753, 0.13071864706544598, 0.049847586620828985, -0.07106013899887509, -0.22276145852182383, 0.2825540148532363, 0.07019131663284138, 0.25892233088566563, 0.06891179223613883, 0.08322264933038825, -0.005675171208740385, 0.12789246051307815, -0.018518659435672526, -0.046709135089415973, 0.06536795139128779, 0.2918574651128348, 0.1515872449280671, 0.252966131946003, -0.3923639358009821, -0.19387550780227708, 0.16354171037501483, 0.12324542196950426, 0.12245260335844194, 0.0054962587669307806, -0.25139711437355955, 0.0017996484091804352, -0.17683573170668548, -0.1781587502401736, -0.14187845862528056, 0.05260701590206152, -0.056894948694533036, -0.28217960587116303, 0.18660871766185688, 0.10491787042270449, 0.030402539631374823, -0.08683489388958723, -0.06648160801786515, 0.057147269835695624, 0.05520617627872177, 0.03464786178305929, -0.049908384733206745, 0.12264278404598619, -0.04879875844459475, -0.1439543987888797, 0.39194234681350215, -0.04544749308699443, -0.17262676764095639, 0.19769354813867307, -0.14496294949433686, -0.17510784910646854, 0.08690836597923879, 0.0637687793271731, 0.06980713934890558, -0.18518520851424078, 0.11511381954618695, -0.08170657309439079, 0.13410881005032102, 0.007384929495553176, 0.13927491726123808, 0.2594703609284795, 0.10320952177668612, 0.08804881182660199, 0.12075899727067646, 0.02254731077010985, -0.1899794722493324, -0.35934789287915203, -0.18581850541594588, -0.2706739183653284, 0.15434631350001804, -0.05928761626426332, -0.19739613363542308, 0.4353803060029024, 0.1704996136005646, 0.1961443619572638, 0.12944087589211348, 0.22483721145509203, 0.1540090597671583, 0.0026742038000834947, 0.07864442794227305, 0.2022003766183776, 0.10245340480756612, 0.07595821087145144, -0.27772074934371094, 0.04777925375872004, 0.08975992285083105] |
1,802.10469 | Turing-Hopf bifurcation and spatiotemporal patterns in a ratio-dependent
diffusive Holling-Tanner system with time delay | The Turing-Hopf type spatiotemporal patterns in a diffusive Holling-Tanner
model with discrete time delay is considered. A global Turing bifurcation
theorem for $\tau=0$ and a local Turing bifurcation theorem for $\tau>0$ are
given by the method of eigenvalue analysis and prior estimation. Further
considering the degenerated situation, the existence of Bogdanov-Takens
bifurcation and Turing-Hopf bifurcation are obtained. The normal form method is
used to study the explicit dynamics near the Turing-Hopf singularity, and we
establish the existence of various self-organized spatiotemporal patterns, such
as two non-constant steady states (stripe patterns) coexist and two spatially
inhomogeneous periodic solutions (spot patterns) coexist. Moreover, the
Turing-Turing-Hopf type spatiotemporal patterns, that is a subharmonic
phenomenon with two spatial wave numbers and one temporal frequency, are also
found and theoretically explained, when there is another Turing bifurcation
curve which is relatively closed to the studied one.
| math.DS | the turinghopf type spatiotemporal patterns in a diffusive hollingtanner model with discrete time delay is considered a global turing bifurcation theorem for tau0 and a local turing bifurcation theorem for tau0 are given by the method of eigenvalue analysis and prior estimation further considering the degenerated situation the existence of bogdanovtakens bifurcation and turinghopf bifurcation are obtained the normal form method is used to study the explicit dynamics near the turinghopf singularity and we establish the existence of various selforganized spatiotemporal patterns such as two nonconstant steady states stripe patterns coexist and two spatially inhomogeneous periodic solutions spot patterns coexist moreover the turingturinghopf type spatiotemporal patterns that is a subharmonic phenomenon with two spatial wave numbers and one temporal frequency are also found and theoretically explained when there is another turing bifurcation curve which is relatively closed to the studied one | [['the', 'turinghopf', 'type', 'spatiotemporal', 'patterns', 'in', 'a', 'diffusive', 'hollingtanner', 'model', 'with', 'discrete', 'time', 'delay', 'is', 'considered', 'a', 'global', 'turing', 'bifurcation', 'theorem', 'for', 'tau0', 'and', 'a', 'local', 'turing', 'bifurcation', 'theorem', 'for', 'tau0', 'are', 'given', 'by', 'the', 'method', 'of', 'eigenvalue', 'analysis', 'and', 'prior', 'estimation', 'further', 'considering', 'the', 'degenerated', 'situation', 'the', 'existence', 'of', 'bogdanovtakens', 'bifurcation', 'and', 'turinghopf', 'bifurcation', 'are', 'obtained', 'the', 'normal', 'form', 'method', 'is', 'used', 'to', 'study', 'the', 'explicit', 'dynamics', 'near', 'the', 'turinghopf', 'singularity', 'and', 'we', 'establish', 'the', 'existence', 'of', 'various', 'selforganized', 'spatiotemporal', 'patterns', 'such', 'as', 'two', 'nonconstant', 'steady', 'states', 'stripe', 'patterns', 'coexist', 'and', 'two', 'spatially', 'inhomogeneous', 'periodic', 'solutions', 'spot', 'patterns', 'coexist', 'moreover', 'the', 'turingturinghopf', 'type', 'spatiotemporal', 'patterns', 'that', 'is', 'a', 'subharmonic', 'phenomenon', 'with', 'two', 'spatial', 'wave', 'numbers', 'and', 'one', 'temporal', 'frequency', 'are', 'also', 'found', 'and', 'theoretically', 'explained', 'when', 'there', 'is', 'another', 'turing', 'bifurcation', 'curve', 'which', 'is', 'relatively', 'closed', 'to', 'the', 'studied', 'one']] | [-0.22733198319827871, 0.13929507399776153, -0.11915342181122729, 0.13695112165795373, -0.0752600289149476, -0.19214826031987156, 0.053396537801849525, 0.3122060158423015, -0.31763822875384773, -0.1977520107557731, 0.1453174739069904, -0.22773504968000843, -0.2159328764138211, 0.20404332572361455, -0.009343835242491747, 0.0541827456813605, 0.032985584898519195, 0.03695329203536468, -0.005912869628186205, -0.16579276862986653, 0.3515545337261366, -0.0879254299355255, 0.29973778685421815, -0.02044536830591304, 0.06313129028837595, -0.06348333423291998, 0.016436253381626947, 0.01907433532178402, -0.17349682868833563, 0.021164700346915716, 0.25812399155194204, 0.08820849119386237, 0.2555640614857631, -0.4163704183883965, -0.2326574046297797, 0.13491453902928957, 0.1645597946331171, 0.12537769331580162, -0.01898242144213457, -0.30672996606943864, 0.10018985568146621, -0.0906849576517873, -0.23086988935579678, -0.07070398520279143, 0.022588441309718682, 0.06254964774042102, -0.2675703717196094, 0.1368821774125016, 0.10786950329451689, 0.12875354084452348, -0.0849092982210485, 0.0003642336931079626, -0.09688862369678515, 0.09105055690680663, 0.040734549063823317, -0.009702200949790754, 0.05274039321042697, -0.08420784690450611, -0.13023311566295367, 0.31178949161299635, -0.0351150295530845, -0.2182740603543477, 0.1944725947787187, -0.15988318096746557, -0.08731072272639721, 0.17438415108315114, 0.11573435326551719, 0.08483668682830674, -0.10634588206188969, 0.023381830003927462, -0.04965040854367544, 0.14708933973951, 0.1697483380424923, -0.0026594626417915735, 0.16143374933994242, 0.19225018146763823, 0.07508495198895357, 0.12940829593654987, -0.0957879366598458, -0.16748188412748277, -0.28805209633303874, -0.047840630655576075, -0.12966844286503537, 0.01558344701864241, -0.12148636354925527, -0.20126607648895256, 0.44120175533628625, 0.045364200862656745, 0.19078396939273393, 0.038702182213143844, 0.23003686543919943, 0.147221701385154, -0.03354999117353665, 0.0593938471050933, 0.18813676179353414, 0.11131312639585562, 0.14336034149995872, -0.21454749899816566, 0.06570929073662098, 0.11576243258979438] |
1,802.1047 | QCH Kahler surfaces II | In this paper we give new examples of QCH Kahler surfaces whose opposite
almost Hermitian strucure is Hermitian and not locally conformally Kahler. In
this way we give also a large class of examples of Hermitian surfaces with
J-invariant Ricci tensor which are not l.c.k.
| math.DG | in this paper we give new examples of qch kahler surfaces whose opposite almost hermitian strucure is hermitian and not locally conformally kahler in this way we give also a large class of examples of hermitian surfaces with jinvariant ricci tensor which are not lck | [['in', 'this', 'paper', 'we', 'give', 'new', 'examples', 'of', 'qch', 'kahler', 'surfaces', 'whose', 'opposite', 'almost', 'hermitian', 'strucure', 'is', 'hermitian', 'and', 'not', 'locally', 'conformally', 'kahler', 'in', 'this', 'way', 'we', 'give', 'also', 'a', 'large', 'class', 'of', 'examples', 'of', 'hermitian', 'surfaces', 'with', 'jinvariant', 'ricci', 'tensor', 'which', 'are', 'not', 'lck']] | [-0.20360878912938965, 0.11858065418071218, -0.048674935268031225, 0.05561905593042159, -0.18798606991767883, -0.23634705000246564, -0.11839074099746844, 0.44052386374937164, -0.21157116037276055, -0.19479375920361944, 0.07723929009710749, -0.23878417768412166, -0.27468887095650035, 0.17895015455368493, -0.1783873222147425, 0.0021006908681657577, 0.06614873338904646, 0.06372702200379636, -0.14497755761775705, -0.3876393514374892, 0.5169879380199645, -0.004836669667727418, 0.16498650535941123, 0.15263152991731962, 0.09499565349995262, -0.10382932933668296, 0.03137227644522985, -0.01544827963742945, -0.1617247039038274, 0.12445031269970867, 0.3244526998036438, 0.009255931650598844, 0.12214942951169279, -0.3721248110445837, -0.15989453498688008, 0.2991735965841346, 0.0864987826285263, 0.07069612758803284, -0.07842648233183556, -0.2656194488207499, 0.09597843986832433, -0.11608611028641462, -0.1751634581001579, -0.16897541472895278, 0.021124404958552785, -0.027493262886612985, -0.14446220741503768, 0.004521476174057979, 0.148380085784528, 0.0771547317918804, -0.06247186206488146, -0.10008671010533969, -0.06199559014704492, 0.013077191149608956, 0.03865575738147729, 0.04112181484492289, 0.062399520736653356, -0.0026097807050165203, -0.06129556450371941, 0.3554664019081328, -0.14606633128391372, -0.3129879688016243, 0.07057449856979979, -0.11169806929926078, -0.141205170760966, 0.11947969055424133, 0.1629469176961316, 0.25619657503234017, -0.11168277820882698, 0.19488918830821705, -0.1252193949288792, 0.020837602267662684, 0.08144286027592089, 0.0007986270305183199, 0.151262633005778, 0.019132879531631865, 0.16898221825766896, 0.1202741640412973, 0.09578540200988452, -0.08590537386222018, -0.44004819062021044, -0.24760127974053223, -0.14638478378765285, 0.25834920686837803, -0.11656705287718473, -0.2917247657974561, 0.4623498780859841, -0.043869903983755246, 0.20962004402988693, 0.15492711969806502, 0.1884668363465203, -0.032433605276876026, 0.056905904598534104, 0.15643330121205912, 0.23118637204170228, 0.19911047977705795, 0.05915650259703398, -0.04207345292800003, -0.11625880028845535, 0.12645856383153134] |
1,802.10471 | Approximate subloops and Freiman's theorem in finitely generated
commutative moufang loops | Fix a parameter $K\geqslant 1$. A $K$-approximate subgroup is a finite set
$A$ in a group $G$ which contains the identity, is symmetric and such that
$A.A$ can covered by $K$ left translates of $A$. This article deals with the
generalisation of the concept of approximate groups in the case of loops which
we call approximate loops and the description of $K$-approximate subloops when
the ambient loop is a finitely generated commutative moufang loop. Specifically
we have a Freiman type theorem where such approximate subloops are controlled
by arithmetic progressions defined in the commutative moufang loops.
| math.GR | fix a parameter kgeqslant 1 a kapproximate subgroup is a finite set a in a group g which contains the identity is symmetric and such that aa can covered by k left translates of a this article deals with the generalisation of the concept of approximate groups in the case of loops which we call approximate loops and the description of kapproximate subloops when the ambient loop is a finitely generated commutative moufang loop specifically we have a freiman type theorem where such approximate subloops are controlled by arithmetic progressions defined in the commutative moufang loops | [['fix', 'a', 'parameter', 'kgeqslant', '1', 'a', 'kapproximate', 'subgroup', 'is', 'a', 'finite', 'set', 'a', 'in', 'a', 'group', 'g', 'which', 'contains', 'the', 'identity', 'is', 'symmetric', 'and', 'such', 'that', 'aa', 'can', 'covered', 'by', 'k', 'left', 'translates', 'of', 'a', 'this', 'article', 'deals', 'with', 'the', 'generalisation', 'of', 'the', 'concept', 'of', 'approximate', 'groups', 'in', 'the', 'case', 'of', 'loops', 'which', 'we', 'call', 'approximate', 'loops', 'and', 'the', 'description', 'of', 'kapproximate', 'subloops', 'when', 'the', 'ambient', 'loop', 'is', 'a', 'finitely', 'generated', 'commutative', 'moufang', 'loop', 'specifically', 'we', 'have', 'a', 'freiman', 'type', 'theorem', 'where', 'such', 'approximate', 'subloops', 'are', 'controlled', 'by', 'arithmetic', 'progressions', 'defined', 'in', 'the', 'commutative', 'moufang', 'loops']] | [-0.21733722649514675, 0.1545341186750496, -0.06862648242046514, 0.07142245036326737, -0.07770569949934725, -0.14433560689212754, 0.030230934809272487, 0.36120938261349994, -0.29592283978612005, -0.21286030391153568, 0.12380439634459132, -0.2613342065208902, -0.10678789282974321, 0.17403647388952473, -0.11956702453123096, -0.0458128251581608, 0.02736538095632568, 0.14444809727622973, -0.05746500091966785, -0.21495724998627944, 0.3540685682867964, -0.06157957708637696, 0.17105920079241818, 0.023444219240142655, 0.11087753995282885, -0.022361543543714408, -0.029776856652460992, 0.08270103070147646, -0.10862158177565107, 0.10150495658551033, 0.2696361160487868, 0.0704179004690862, 0.2614643296886546, -0.3559895128128119, -0.14247621516309059, 0.16723859414923936, 0.15044673264007238, 0.008077041612523317, -0.021976278202297788, -0.2210527013060831, 0.16518139090476325, -0.19621709142423546, -0.1486335934556943, -0.004354169253929285, 0.048658634322540216, -0.02179981804268512, -0.2944817409976774, 0.010943608234811109, 0.129655709664803, 0.1460367179242894, 0.01732548185221579, -0.06052439764607698, -0.001613077142489298, 0.09577916804513127, -0.05069337964475077, 0.0552198720118516, 0.0845247276884038, -0.06187782377886227, -0.12798096155590125, 0.38185345754027367, -0.026091485618962906, -0.17383479225100018, 0.08170201805963491, -0.14786792568217302, -0.17338190293230582, 0.11388747727808853, 0.07284520571314108, 0.14502726931338353, -0.0801540806698237, 0.24113089658567333, -0.17391667435488975, 0.11029069352540925, 0.1184526507325548, -0.04596857543704876, 0.12295739200878113, 0.08367761520882293, 0.051206672924308805, 0.17718646898962712, 0.04623402217112016, -0.015257622704666574, -0.39235815693003434, -0.15317918733732463, -0.09428572103691597, 0.12199471276835538, -0.08904353234265727, -0.23551527331922747, 0.42059373917678994, 0.07233812259316134, 0.1623971880520306, 0.0660657986906396, 0.2296350679923004, 0.06904955381848292, 0.09837852693696429, 0.09834234227794998, 0.07897880686990295, 0.19890707001225869, -0.048743645008168336, -0.13381838791489523, -0.012944722649990581, 0.2058490698497432] |
1,802.10472 | Efficient V2V Communication Scheme for 5G MmWave Hyper-Connected CAVs | Connected and Autonomous Vehicles (CAVs) require continuous access to sensory
data to perform complex high-speed maneuvers and advanced trajectory planning.
High priority CAVs are particularly reliant on extended perception horizon
facilitated by sensory data exchange between CAVs. Existing technologies such
as the Dedicated Short Range Communications (DSRC) are ill-equipped to provide
advanced cooperative perception service. This creates the need for more
sophisticated technologies such as the 5G Millimetre-Waves (mmWaves). In this
work, we propose a distributed Vehicle-to-Vehicle (V2V) mmWaves association
scheme operating in a heterogeneous manner. Our system utilises the information
exchanged within the DSRC frequency band to bootstrap the best CAV pairs
formation. Using a Stable Fixtures Matching Game, we form V2V
multipoint-to-multipoint links. Compared to more traditional point-to-point
links, our system provides almost twice as much sensory data exchange capacity
for high priority CAVs while doubling the mmWaves channel utilisation for all
the vehicles in the network.
| cs.NI | connected and autonomous vehicles cavs require continuous access to sensory data to perform complex highspeed maneuvers and advanced trajectory planning high priority cavs are particularly reliant on extended perception horizon facilitated by sensory data exchange between cavs existing technologies such as the dedicated short range communications dsrc are illequipped to provide advanced cooperative perception service this creates the need for more sophisticated technologies such as the 5g millimetrewaves mmwaves in this work we propose a distributed vehicletovehicle v2v mmwaves association scheme operating in a heterogeneous manner our system utilises the information exchanged within the dsrc frequency band to bootstrap the best cav pairs formation using a stable fixtures matching game we form v2v multipointtomultipoint links compared to more traditional pointtopoint links our system provides almost twice as much sensory data exchange capacity for high priority cavs while doubling the mmwaves channel utilisation for all the vehicles in the network | [['connected', 'and', 'autonomous', 'vehicles', 'cavs', 'require', 'continuous', 'access', 'to', 'sensory', 'data', 'to', 'perform', 'complex', 'highspeed', 'maneuvers', 'and', 'advanced', 'trajectory', 'planning', 'high', 'priority', 'cavs', 'are', 'particularly', 'reliant', 'on', 'extended', 'perception', 'horizon', 'facilitated', 'by', 'sensory', 'data', 'exchange', 'between', 'cavs', 'existing', 'technologies', 'such', 'as', 'the', 'dedicated', 'short', 'range', 'communications', 'dsrc', 'are', 'illequipped', 'to', 'provide', 'advanced', 'cooperative', 'perception', 'service', 'this', 'creates', 'the', 'need', 'for', 'more', 'sophisticated', 'technologies', 'such', 'as', 'the', '5g', 'millimetrewaves', 'mmwaves', 'in', 'this', 'work', 'we', 'propose', 'a', 'distributed', 'vehicletovehicle', 'v2v', 'mmwaves', 'association', 'scheme', 'operating', 'in', 'a', 'heterogeneous', 'manner', 'our', 'system', 'utilises', 'the', 'information', 'exchanged', 'within', 'the', 'dsrc', 'frequency', 'band', 'to', 'bootstrap', 'the', 'best', 'cav', 'pairs', 'formation', 'using', 'a', 'stable', 'fixtures', 'matching', 'game', 'we', 'form', 'v2v', 'multipointtomultipoint', 'links', 'compared', 'to', 'more', 'traditional', 'pointtopoint', 'links', 'our', 'system', 'provides', 'almost', 'twice', 'as', 'much', 'sensory', 'data', 'exchange', 'capacity', 'for', 'high', 'priority', 'cavs', 'while', 'doubling', 'the', 'mmwaves', 'channel', 'utilisation', 'for', 'all', 'the', 'vehicles', 'in', 'the', 'network']] | [-0.2688923403604988, 0.07315588920263925, -0.012854755701925102, 0.05868807353702298, -0.12072126615817684, -0.21520866804938713, 0.12075081119955694, 0.43436611846492096, -0.23912285417483528, -0.32110624740252625, 0.11041197875385626, -0.22808476820009183, -0.13974318991264179, 0.19902034719298417, -0.1514702432024343, 0.08305021373844529, 0.10226182840021981, 0.02822085001959774, 0.06312105460941943, -0.1980007504100433, 0.23154060226767575, 0.06531824176891933, 0.3810220417138693, 0.04396046190742856, 0.07933324143350301, 0.0930341018656445, -0.03895236973157561, -0.09122767995467183, -0.06227942497305874, 0.16444315281035882, 0.39521985403985743, 0.18076936206214028, 0.2830551751335529, -0.5002345396426028, -0.2770598867555728, 0.08446700301184948, 0.16058773668703144, 0.011781015175369542, -0.01783718297283977, -0.3278351564564415, 0.08861589614251578, -0.2801040701404516, -0.0475584100286879, -0.05101303112177128, -0.04778516370601751, 0.06253686352165705, -0.30315264637858885, -0.02951620176837251, -0.05500317910824575, 0.06880919185681017, -0.035896106623113155, -0.01690320365250463, -0.007576880913630531, 0.21717335683029346, -0.023834829648163774, 0.04453510297320758, 0.15904967816282264, -0.13103746253418158, -0.14912138807404837, 0.37625117893519533, 0.023478210222517216, -0.17830220150377452, 0.21868209472843256, -0.019555699119558307, -0.12087102491735809, 0.12298916615828923, 0.24111113733158926, 0.06019764429790509, -0.21371737341758343, -0.03951937940075515, 0.06812215434399911, 0.1356405908764164, 0.058843005676690895, 0.11060418490779812, 0.18800914851788156, 0.26561045848034526, 0.18429756635875516, 0.03616878509873877, -0.07598755317205261, -0.15022719687014516, -0.19272517938343053, -0.11299099720388374, -0.1501933102318199, -0.009945616602734034, -0.08022597442893153, -0.07595240200769056, 0.2970225251496034, 0.16652094127257933, 0.10374551536389501, 0.11053341886381039, 0.44047204294474795, 0.03119904319425365, 0.12792937345551075, 0.16547487107911021, 0.17730862683350318, 0.008566731284362677, 0.2524849563778844, -0.157242420916068, 0.08627389455088288, -0.0274672032242666] |
1,802.10473 | Low-Overhead Coordination in Sub-28 Millimeter-Wave Networks | In this paper, we present some contributions from our recent investigation.
We address the open issue of interference coordination for sub-28 GHz
millimeter-wave communication, by proposing fast-converging coordination
algorithms, for dense multi-user multi-cell networks. We propose to optimize a
lower bound on the network sum-rate, after investigating its tightness. The
bound in question results in distributed optimization, requiring local
information at each base station and user. We derive the optimal solution to
the transmit and receive filter updates, that we dub non-homogeneous
waterfilling, and show its convergence to a stationary point of the bound. We
also underline a built-in mechanism to turn-off data streams with low-SINR, and
allocate power to high-SNR streams. This "stream control" is a at the root of
the fast-converging nature of the algorithm. Our numerical result conclude that
low-overhead coordination offers large gains, for dense sub-$28$ GHz systems.
These findings bear direct relevance to the ongoing discussions around 5G New
Radio.
| cs.IT math.IT | in this paper we present some contributions from our recent investigation we address the open issue of interference coordination for sub28 ghz millimeterwave communication by proposing fastconverging coordination algorithms for dense multiuser multicell networks we propose to optimize a lower bound on the network sumrate after investigating its tightness the bound in question results in distributed optimization requiring local information at each base station and user we derive the optimal solution to the transmit and receive filter updates that we dub nonhomogeneous waterfilling and show its convergence to a stationary point of the bound we also underline a builtin mechanism to turnoff data streams with lowsinr and allocate power to highsnr streams this stream control is a at the root of the fastconverging nature of the algorithm our numerical result conclude that lowoverhead coordination offers large gains for dense sub28 ghz systems these findings bear direct relevance to the ongoing discussions around 5g new radio | [['in', 'this', 'paper', 'we', 'present', 'some', 'contributions', 'from', 'our', 'recent', 'investigation', 'we', 'address', 'the', 'open', 'issue', 'of', 'interference', 'coordination', 'for', 'sub28', 'ghz', 'millimeterwave', 'communication', 'by', 'proposing', 'fastconverging', 'coordination', 'algorithms', 'for', 'dense', 'multiuser', 'multicell', 'networks', 'we', 'propose', 'to', 'optimize', 'a', 'lower', 'bound', 'on', 'the', 'network', 'sumrate', 'after', 'investigating', 'its', 'tightness', 'the', 'bound', 'in', 'question', 'results', 'in', 'distributed', 'optimization', 'requiring', 'local', 'information', 'at', 'each', 'base', 'station', 'and', 'user', 'we', 'derive', 'the', 'optimal', 'solution', 'to', 'the', 'transmit', 'and', 'receive', 'filter', 'updates', 'that', 'we', 'dub', 'nonhomogeneous', 'waterfilling', 'and', 'show', 'its', 'convergence', 'to', 'a', 'stationary', 'point', 'of', 'the', 'bound', 'we', 'also', 'underline', 'a', 'builtin', 'mechanism', 'to', 'turnoff', 'data', 'streams', 'with', 'lowsinr', 'and', 'allocate', 'power', 'to', 'highsnr', 'streams', 'this', 'stream', 'control', 'is', 'a', 'at', 'the', 'root', 'of', 'the', 'fastconverging', 'nature', 'of', 'the', 'algorithm', 'our', 'numerical', 'result', 'conclude', 'that', 'lowoverhead', 'coordination', 'offers', 'large', 'gains', 'for', 'dense', 'sub28', 'ghz', 'systems', 'these', 'findings', 'bear', 'direct', 'relevance', 'to', 'the', 'ongoing', 'discussions', 'around', '5g', 'new', 'radio']] | [-0.21266466968901163, 0.006647543591067293, -0.05265906492346212, 0.022674962739601096, -0.10676951977458023, -0.16227349174503042, 0.16295198211982528, 0.38488393227912876, -0.2804597513244708, -0.28940891810251695, 0.08686511562968678, -0.2516796590337579, -0.19546305678025083, 0.13866507035441158, -0.09989156713096523, 0.044155792978831175, 0.0722284653426246, -0.013115198186010514, -0.037558727637300955, -0.26611903605762083, 0.29051982511009555, 0.1207946544041318, 0.3153669665855552, 0.07301937420025321, 0.06703248078778606, -0.036285460497693794, -0.04687168430092769, -0.056396126971537196, -0.13016451382980831, 0.13771629512408062, 0.3220332923810929, 0.2150715393455405, 0.32106384721976755, -0.415320622640521, -0.21400489583979115, 0.0732041081432008, 0.16880990840926594, 0.08093535796567601, -0.10099074703956783, -0.2847139562241194, 0.15527835616682606, -0.1964106997092083, -0.09662494919106585, -0.023711669597296828, -0.05425101960090136, 0.05374457040306879, -0.33011475489183795, 0.029024944219264926, 0.0401515249947184, 0.023101344346191342, -0.0695953631386242, -0.09823163574420553, 0.07588300959047813, 0.14651120497881875, 0.014280421822485024, 0.0005316352433414737, 0.0985186472718947, -0.09404354354084812, -0.13616597434298983, 0.35040022465277854, -0.00868413337708549, -0.17457810873441448, 0.17905492106097212, -0.1019349125808252, -0.17348853391166286, 0.11351664804839713, 0.2636618628381065, 0.07208842970756354, -0.1536248853785525, 0.027239471038276526, -0.04933081049086085, 0.16001811401072605, 0.05855883255993065, 0.101030464835563, 0.18168656741985806, 0.19455914366929056, 0.16429271752406893, 0.16897759492061787, -0.10235941492627669, -0.12729545322010954, -0.24891036458460516, -0.12003332190177293, -0.1940837484527085, 0.024885811827660195, -0.09609223364436491, -0.07643894487256675, 0.34994745161997054, 0.18466413306305185, 0.15520374229680256, 0.1224582940508538, 0.3788209655444677, 0.08980976580488986, 0.04199774497292789, 0.17146662996291476, 0.20992540071146273, 0.0896842185113775, 0.14480855517659189, -0.22566318676935657, 0.02568112857299734, -0.0021107493881381265] |
1,802.10474 | On the Benefits of Asymmetric Coded Cache Placement in Combination
Networks with End-User Caches | This paper investigates the fundamental tradeoff between cache size and
download time in the (H;r;M;N) combination network, where a server with N files
is connected to H relays (without caches) and each of the K:=\binom{H}{r} users
(with caches of size M files) is connected to a different subset of r relays.
Existing schemes fall within two categories: either use the uncoded symmetric
cache placement originally proposed for the shared-link model and design
delivery phase dependent on the network topology, or effectively divide the
combination network into H independent shared-link networks each serving
\binom{H-1}{r-1} users; in either case, the placement phase is independent of
network topology. In this paper, a novel strategy is proposed where the coded
cache placement is dependent on network topology. The proposed scheme is shown
to be information theoretically optimal for large cache size. In addition, when
not exactly optimal, the proposed scheme can also outperform existing schemes.
| cs.IT math.IT | this paper investigates the fundamental tradeoff between cache size and download time in the hrmn combination network where a server with n files is connected to h relays without caches and each of the kbinomhr users with caches of size m files is connected to a different subset of r relays existing schemes fall within two categories either use the uncoded symmetric cache placement originally proposed for the sharedlink model and design delivery phase dependent on the network topology or effectively divide the combination network into h independent sharedlink networks each serving binomh1r1 users in either case the placement phase is independent of network topology in this paper a novel strategy is proposed where the coded cache placement is dependent on network topology the proposed scheme is shown to be information theoretically optimal for large cache size in addition when not exactly optimal the proposed scheme can also outperform existing schemes | [['this', 'paper', 'investigates', 'the', 'fundamental', 'tradeoff', 'between', 'cache', 'size', 'and', 'download', 'time', 'in', 'the', 'hrmn', 'combination', 'network', 'where', 'a', 'server', 'with', 'n', 'files', 'is', 'connected', 'to', 'h', 'relays', 'without', 'caches', 'and', 'each', 'of', 'the', 'kbinomhr', 'users', 'with', 'caches', 'of', 'size', 'm', 'files', 'is', 'connected', 'to', 'a', 'different', 'subset', 'of', 'r', 'relays', 'existing', 'schemes', 'fall', 'within', 'two', 'categories', 'either', 'use', 'the', 'uncoded', 'symmetric', 'cache', 'placement', 'originally', 'proposed', 'for', 'the', 'sharedlink', 'model', 'and', 'design', 'delivery', 'phase', 'dependent', 'on', 'the', 'network', 'topology', 'or', 'effectively', 'divide', 'the', 'combination', 'network', 'into', 'h', 'independent', 'sharedlink', 'networks', 'each', 'serving', 'binomh1r1', 'users', 'in', 'either', 'case', 'the', 'placement', 'phase', 'is', 'independent', 'of', 'network', 'topology', 'in', 'this', 'paper', 'a', 'novel', 'strategy', 'is', 'proposed', 'where', 'the', 'coded', 'cache', 'placement', 'is', 'dependent', 'on', 'network', 'topology', 'the', 'proposed', 'scheme', 'is', 'shown', 'to', 'be', 'information', 'theoretically', 'optimal', 'for', 'large', 'cache', 'size', 'in', 'addition', 'when', 'not', 'exactly', 'optimal', 'the', 'proposed', 'scheme', 'can', 'also', 'outperform', 'existing', 'schemes']] | [-0.19768835531195272, 0.020397058713275032, -0.015544866645910047, 0.0009362677433150442, -0.08460998326237942, -0.2717890543422687, 0.13759584474610165, 0.4032147787007931, -0.28293704215714055, -0.2847993542012331, 0.09130936583214616, -0.24592297840737612, -0.12951257478483524, 0.09261399758444797, -0.13728009606868885, 0.017485193832701928, 0.031446860421301855, 0.04892344925099531, -0.01378775983922989, -0.33491300201402174, 0.32415649115668005, 0.06506956222693662, 0.3870456821499141, 0.016944297944900353, 0.0567085727784984, 0.02168634091503918, -0.045258921527026874, 0.021399112814440346, -0.08900227011307268, 0.056114279423963055, 0.3277026721578393, 0.16794860774776632, 0.25652328896260745, -0.4299326922832611, -0.1875500022119062, 0.11057500185042217, 0.17494452761398074, 0.06096636697436003, 0.00803020205824617, -0.269446610312632, 0.14657191495171976, -0.21093985296131387, 0.01379634765908122, 0.003350780867795284, -0.013632919482030981, 0.06419309981897273, -0.3288521205635137, -0.0745713342647021, -0.02012370848977888, -0.04042739855641549, -0.021632204955519253, -0.09148125023883139, -0.007308539896700028, 0.17002782984530534, -8.137941099325749e-05, 0.028712938856679592, 0.12372405060592133, -0.046166130785619514, -0.10692477875666039, 0.3642003864012155, 0.0013568545046665178, -0.24807220098336, 0.11808934863153342, -0.033719226231836284, -0.1202208771987038, 0.13532666804117932, 0.22529275257870354, 0.09368518788707317, -0.14929148648455315, 0.06329663185838522, -0.07062319290983125, 0.21784527610115884, 0.07557718312946728, 0.09252546945090462, 0.12587979008015748, 0.2495862872865227, 0.1382871067821602, 0.13974100616807747, -0.08797379153012927, -0.10689897777361644, -0.23581676592270062, -0.12688848856408652, -0.2504221538673281, -0.024482396209350554, -0.14821458908517268, -0.09623596043309442, 0.36388728492499, 0.11055370487864255, 0.1523045567084557, 0.09778147370781044, 0.3999481665197055, 0.03745071377960738, 0.10797674733063055, 0.21324602382987537, 0.09832297981011907, 0.024534603719272324, 0.12034437515949076, -0.20182966221142812, 0.1089534142897842, 0.06555273908668675] |
1,802.10475 | Time-diffracting beams: On their nature, diffraction-free propagation as
needles of light, and nonlinear generation | We investigate on the properties of the recently introduced time-diffracting
(TD) beams in free space. They are shown to be paraxial and quasi-monochromatic
realizations of localized waves, spatiotemporal localized waves travelling
undistorted at arbitrary speeds. The paraxial and quasi-monochromatic regime is
shown to be necessary to observe what can properly be named diffraction in
time. TD beams of finite energy travelling at quasi-luminal velocities are seen
to form substantially longer foci or needles of light than the so-called
abruptly focusing and defocusing needle of light, or limiting TD beam of
infinite speed. Exploring the properties of TD beams under Lorentz
transformations and transformation by paraxial optical systems, we realize that
the relativistically moving nonlinear polarization of material media induced by
a strongly localized fundamental pump wave generates a TD beam at its second
harmonic, whose diffraction-free behavior as a needle of light in free space
can be optimized with a standard $4f$-imager system.
| physics.optics | we investigate on the properties of the recently introduced timediffracting td beams in free space they are shown to be paraxial and quasimonochromatic realizations of localized waves spatiotemporal localized waves travelling undistorted at arbitrary speeds the paraxial and quasimonochromatic regime is shown to be necessary to observe what can properly be named diffraction in time td beams of finite energy travelling at quasiluminal velocities are seen to form substantially longer foci or needles of light than the socalled abruptly focusing and defocusing needle of light or limiting td beam of infinite speed exploring the properties of td beams under lorentz transformations and transformation by paraxial optical systems we realize that the relativistically moving nonlinear polarization of material media induced by a strongly localized fundamental pump wave generates a td beam at its second harmonic whose diffractionfree behavior as a needle of light in free space can be optimized with a standard 4fimager system | [['we', 'investigate', 'on', 'the', 'properties', 'of', 'the', 'recently', 'introduced', 'timediffracting', 'td', 'beams', 'in', 'free', 'space', 'they', 'are', 'shown', 'to', 'be', 'paraxial', 'and', 'quasimonochromatic', 'realizations', 'of', 'localized', 'waves', 'spatiotemporal', 'localized', 'waves', 'travelling', 'undistorted', 'at', 'arbitrary', 'speeds', 'the', 'paraxial', 'and', 'quasimonochromatic', 'regime', 'is', 'shown', 'to', 'be', 'necessary', 'to', 'observe', 'what', 'can', 'properly', 'be', 'named', 'diffraction', 'in', 'time', 'td', 'beams', 'of', 'finite', 'energy', 'travelling', 'at', 'quasiluminal', 'velocities', 'are', 'seen', 'to', 'form', 'substantially', 'longer', 'foci', 'or', 'needles', 'of', 'light', 'than', 'the', 'socalled', 'abruptly', 'focusing', 'and', 'defocusing', 'needle', 'of', 'light', 'or', 'limiting', 'td', 'beam', 'of', 'infinite', 'speed', 'exploring', 'the', 'properties', 'of', 'td', 'beams', 'under', 'lorentz', 'transformations', 'and', 'transformation', 'by', 'paraxial', 'optical', 'systems', 'we', 'realize', 'that', 'the', 'relativistically', 'moving', 'nonlinear', 'polarization', 'of', 'material', 'media', 'induced', 'by', 'a', 'strongly', 'localized', 'fundamental', 'pump', 'wave', 'generates', 'a', 'td', 'beam', 'at', 'its', 'second', 'harmonic', 'whose', 'diffractionfree', 'behavior', 'as', 'a', 'needle', 'of', 'light', 'in', 'free', 'space', 'can', 'be', 'optimized', 'with', 'a', 'standard', '4fimager', 'system']] | [-0.13871920631970247, 0.26488961195511534, -0.09656957937836252, 0.057827056176645915, -0.07545097679245157, -0.15548161922997197, -0.01975928168818632, 0.47212850341314316, -0.28958482811511155, -0.22761321239888865, 0.07443411540570022, -0.2580589360483484, -0.08210757094749946, 0.22108391794493262, 0.013544632555201452, 0.09266577561390556, 0.0024836913556082556, 0.005334697841105378, -0.06445216485808006, -0.15390879955660824, 0.28002239472621326, 0.05163525729224283, 0.2885791021445458, -0.0011649809319785002, 0.14427972926344995, 0.04284166715212709, 0.042583632409350564, 0.007764083564216703, -0.08425913974882715, 0.05558229763282845, 0.19594971664151214, 0.052116480526446504, 0.2227216801538274, -0.46066802896756603, -0.28716264027386706, 0.07765684828211535, 0.1608259676329619, 0.14291701996884007, -0.047413203922148164, -0.3227678705006838, 0.0026714420755585, -0.06379968911372372, -0.22583896379350432, -0.040700143702722937, -0.00571223594470332, 0.10121699824577679, -0.23736114974522235, 0.03439921920120987, 0.06892848689886218, 0.02644893192818746, -0.03236597918347141, -0.0188215873258139, -0.047794647602709815, 0.0017408535581402826, 0.047239947526728034, 0.05629107454754659, 0.10021665696030026, -0.12540763123608534, -0.06817964337988208, 0.45639730227605396, -0.06047474170639103, -0.18465324233144226, 0.15818476924882424, -0.20757894093380463, 0.018097931805948746, 0.2124554575482593, 0.23457663374280693, 0.13099674612518078, -0.11450720394981581, 0.02625277785534989, -0.019707029910402723, 0.16194868263702172, 0.19549617047933554, 0.06653188847141056, 0.2147391689386194, 0.1281241948827361, 0.06797751817938606, 0.13380716351686403, -0.09024574939895495, -0.054363959863633904, -0.2627760337200016, -0.11512777534165475, -0.1550500517393407, 0.03795220415192326, -0.03319370273203089, -0.1387009045725152, 0.39048991405824507, 0.09064295024469199, 0.1324442852849745, -0.021533631684184568, 0.26299494410716984, 0.15661967602182206, 0.0517668598578219, 0.07678861456263243, 0.27026285067669403, 0.12219479740813177, 0.09685256442869243, -0.22186820905224655, -0.02242287308045521, 0.04596650058292592] |
1,802.10476 | Coexistence and duality in competing species models | We discuss some stochastic spatial generalizations of the Lotka--Volterra
model for competing species. The generalizations take the forms of spin systems
on general discrete sets and interacting diffusions on integer lattices.
Methods for proving coexistence in these generalizations and some related open
questions are discussed. We use duality as the central point of view. It
relates coexistence of the models to survival of their dual processes.
| math.PR | we discuss some stochastic spatial generalizations of the lotkavolterra model for competing species the generalizations take the forms of spin systems on general discrete sets and interacting diffusions on integer lattices methods for proving coexistence in these generalizations and some related open questions are discussed we use duality as the central point of view it relates coexistence of the models to survival of their dual processes | [['we', 'discuss', 'some', 'stochastic', 'spatial', 'generalizations', 'of', 'the', 'lotkavolterra', 'model', 'for', 'competing', 'species', 'the', 'generalizations', 'take', 'the', 'forms', 'of', 'spin', 'systems', 'on', 'general', 'discrete', 'sets', 'and', 'interacting', 'diffusions', 'on', 'integer', 'lattices', 'methods', 'for', 'proving', 'coexistence', 'in', 'these', 'generalizations', 'and', 'some', 'related', 'open', 'questions', 'are', 'discussed', 'we', 'use', 'duality', 'as', 'the', 'central', 'point', 'of', 'view', 'it', 'relates', 'coexistence', 'of', 'the', 'models', 'to', 'survival', 'of', 'their', 'dual', 'processes']] | [-0.1160039367069575, 0.1017198936562195, -0.03971327457464102, 0.1656524180011316, -0.034726001576266506, -0.17007888942448932, 0.04214480722139618, 0.3241519287623691, -0.29225579589943995, -0.18814279908794118, 0.14093702418595608, -0.30484315737108275, -0.1735107644856202, 0.1942600195938157, -0.05636952580376105, 0.002445389281175184, -0.017122568040521757, -0.00984975081783804, -0.06472314837050032, -0.28098191795024, 0.3549109792731928, -0.0407090728650942, 0.2492695676981274, 0.06447401804369733, 0.1056842730860367, 0.027682219483804973, -0.03756169075936531, 0.005795606207384756, -0.15524526693942872, 0.13216543223031543, 0.24423696947616752, 0.11524229229844148, 0.2249986716884781, -0.42851256257431075, -0.24792932642793114, 0.12715894906696948, 0.13127939042301892, 0.1087866167724838, -0.01783955489835617, -0.2821827328792124, 0.005447186833021768, -0.12327940987818169, -0.19682124243682306, -0.11165921502944195, -0.0002677203014944539, 0.10513196036106709, -0.20886466736115064, 0.06576742164113304, 0.09885954745396068, 0.07925437080363433, -0.1299163418201109, -0.16353560708794798, 0.018949072504641885, 0.0977180570744994, 0.0410869052743003, -0.07889223658253974, 0.06062036659568548, -0.12664024288427422, -0.22517691611904989, 0.371549989731813, 0.010213288386832133, -0.2436922634352055, 0.3085137231374216, -0.11628017240119251, -0.22110393895259636, 0.02750963099639524, 0.19985020839058878, 0.10675890307704156, -0.10547264769786235, 0.09622027710693973, -0.055095005625238024, 0.03792927263941348, 0.08083531227682463, 0.06743582673670696, 0.2569114616437053, 0.16638018259298848, 0.07809796542366684, 0.1705762833413301, -0.00587409971966267, -0.25053481773162883, -0.29592112942852755, -0.15215097774158826, -0.11342209992422299, 0.05690613981675018, -0.12867225160439513, -0.14860846093771132, 0.38333838469010184, 0.1900272905821277, 0.16801515151041024, 0.05975183066347557, 0.18593291461354855, 0.12452656347974853, -0.0008793176102423758, 0.007116945414578147, 0.12279537340333319, 0.20612214841513019, 0.06579064302654429, -0.20042765084089656, 0.032613439012713956, 0.11510468475788718] |
1,802.10477 | Homogenization and Scattering Analysis of Second-Harmonic Generation in
Nonlinear Metasurfaces | We propose an extensive discussion on the homogenization and scattering
analysis of second-order nonlinear metasurfaces. Our developments are based on
the generalized sheet transition conditions (GSTCs) which are used to model the
electromagnetic responses of nonlinear metasurfaces. The GSTCs are solved both
in the frequency domain, assuming an undepleted pump regime, and in the
time-domain, assuming dispersionless material properties but a possible
depleted pump regime. Based on these two modeling approaches, we derive the
general second-harmonic reflectionless and transmissionless conditions as well
as the conditions of asymmetric reflection and transmission. We also discuss
and clarify the concept of nonreciprocal scattering pertaining to nonlinear
metasurfaces.
| physics.optics | we propose an extensive discussion on the homogenization and scattering analysis of secondorder nonlinear metasurfaces our developments are based on the generalized sheet transition conditions gstcs which are used to model the electromagnetic responses of nonlinear metasurfaces the gstcs are solved both in the frequency domain assuming an undepleted pump regime and in the timedomain assuming dispersionless material properties but a possible depleted pump regime based on these two modeling approaches we derive the general secondharmonic reflectionless and transmissionless conditions as well as the conditions of asymmetric reflection and transmission we also discuss and clarify the concept of nonreciprocal scattering pertaining to nonlinear metasurfaces | [['we', 'propose', 'an', 'extensive', 'discussion', 'on', 'the', 'homogenization', 'and', 'scattering', 'analysis', 'of', 'secondorder', 'nonlinear', 'metasurfaces', 'our', 'developments', 'are', 'based', 'on', 'the', 'generalized', 'sheet', 'transition', 'conditions', 'gstcs', 'which', 'are', 'used', 'to', 'model', 'the', 'electromagnetic', 'responses', 'of', 'nonlinear', 'metasurfaces', 'the', 'gstcs', 'are', 'solved', 'both', 'in', 'the', 'frequency', 'domain', 'assuming', 'an', 'undepleted', 'pump', 'regime', 'and', 'in', 'the', 'timedomain', 'assuming', 'dispersionless', 'material', 'properties', 'but', 'a', 'possible', 'depleted', 'pump', 'regime', 'based', 'on', 'these', 'two', 'modeling', 'approaches', 'we', 'derive', 'the', 'general', 'secondharmonic', 'reflectionless', 'and', 'transmissionless', 'conditions', 'as', 'well', 'as', 'the', 'conditions', 'of', 'asymmetric', 'reflection', 'and', 'transmission', 'we', 'also', 'discuss', 'and', 'clarify', 'the', 'concept', 'of', 'nonreciprocal', 'scattering', 'pertaining', 'to', 'nonlinear', 'metasurfaces']] | [-0.1341657794591546, 0.10704794133028911, -0.056512737185558645, 0.015995466587748558, -0.1224227022329906, -0.1381278082737428, 0.004142837580835935, 0.46322701658004695, -0.24845323707790845, -0.22715574054463397, 0.1141216129322256, -0.25766685561647695, -0.23128386873082774, 0.22426035860101284, -0.0014855281531232075, 0.1144888226792795, -0.03946924338894851, -0.061535927524690705, -0.0633996854162124, -0.14720327674085726, 0.32208624128613944, 0.01690810383862626, 0.3358102870869984, 0.07752325218080462, 0.09229124187338121, 0.0171681451566011, -0.009071522193409285, -0.032030033209876525, -0.1519665748369202, 0.08329235940484457, 0.24952081225595427, 0.014421963338622624, 0.19673516434047697, -0.4947890802060516, -0.24933899561106002, -0.00820494085342343, 0.11898544647005269, 0.13224625354519712, -0.05831217642837358, -0.30587676981265105, -0.0033758682045109062, -0.08721653436473345, -0.1358191121677027, -0.06666236129494438, -0.06986048759765995, 0.056071060714176266, -0.28646225634130457, 0.0352372518688038, 0.08055790532855046, 0.017883377598408717, -0.10097919748779567, -0.07843315041538111, 0.0007460331137391548, 0.027138539743654936, 0.004730656181317437, -0.11860681633528286, 0.10384154049408378, -0.1222914434784065, -0.09107190720031708, 0.4071767643202566, -0.07627430081693004, -0.1818736461290719, 0.17123151101732573, -0.14173904572753687, -0.02651498959065207, 0.12148091121513432, 0.20543064847950218, 0.14842087230238232, -0.16551721271792047, 0.03448784763379999, -0.051873100862738865, 0.15292439351391807, 0.12190516959893906, 0.08205955208661216, 0.2036499192811621, 0.17407818974077122, 0.021321317520064925, 0.13810865739835154, -0.06886942592196311, -0.04669852422389826, -0.3343642710626704, -0.08282301597550366, -0.15372752227359315, 0.009005750449220605, -0.06630075834742385, -0.1882341167735822, 0.3955597642230467, 0.17181178893062096, 0.125360201117447, 0.019078937034773667, 0.2995198214634602, 0.22979736518345376, 0.012595821244334712, 0.02913742402152529, 0.3045907023552697, 0.2105673347391839, 0.13695883897847486, -0.2541146648830725, -0.0005495027498821321, 0.0036785056977306756] |
1,802.10478 | HSI-CNN: A Novel Convolution Neural Network for Hyperspectral Image | With the development of deep learning, the performance of hyperspectral image
(HSI) classification has been greatly improved in recent years. The shortage of
training samples has become a bottleneck for further improvement of
performance. In this paper, we propose a novel convolutional neural network
framework for the characteristics of hyperspectral image data, called HSI-CNN.
Firstly, the spectral-spatial feature is extracted from a target pixel and its
neighbors. Then, a number of one-dimensional feature maps, obtained by
convolution operation on spectral-spatial features, are stacked into a
two-dimensional matrix. Finally, the two-dimensional matrix considered as an
image is fed into standard CNN. This is why we call it HSI-CNN. In addition, we
also implements two depth network classification models, called HSI-CNN+XGBoost
and HSI-CapsNet, in order to compare the performance of our framework.
Experiments show that the performance of hyperspectral image classification is
improved efficiently with HSI-CNN framework. We evaluate the model's
performance using four popular HSI datasets, which are the Kennedy Space Center
(KSC), Indian Pines (IP), Pavia University scene (PU) and Salinas scene (SA).
As far as we concerned, HSI-CNN has got the state-of-art accuracy among all
methods we have known on these datasets of 99.28%, 99.09%, 99.42%, 98.95%
separately.
| cs.CV | with the development of deep learning the performance of hyperspectral image hsi classification has been greatly improved in recent years the shortage of training samples has become a bottleneck for further improvement of performance in this paper we propose a novel convolutional neural network framework for the characteristics of hyperspectral image data called hsicnn firstly the spectralspatial feature is extracted from a target pixel and its neighbors then a number of onedimensional feature maps obtained by convolution operation on spectralspatial features are stacked into a twodimensional matrix finally the twodimensional matrix considered as an image is fed into standard cnn this is why we call it hsicnn in addition we also implements two depth network classification models called hsicnnxgboost and hsicapsnet in order to compare the performance of our framework experiments show that the performance of hyperspectral image classification is improved efficiently with hsicnn framework we evaluate the models performance using four popular hsi datasets which are the kennedy space center ksc indian pines ip pavia university scene pu and salinas scene sa as far as we concerned hsicnn has got the stateofart accuracy among all methods we have known on these datasets of 9928 9909 9942 9895 separately | [['with', 'the', 'development', 'of', 'deep', 'learning', 'the', 'performance', 'of', 'hyperspectral', 'image', 'hsi', 'classification', 'has', 'been', 'greatly', 'improved', 'in', 'recent', 'years', 'the', 'shortage', 'of', 'training', 'samples', 'has', 'become', 'a', 'bottleneck', 'for', 'further', 'improvement', 'of', 'performance', 'in', 'this', 'paper', 'we', 'propose', 'a', 'novel', 'convolutional', 'neural', 'network', 'framework', 'for', 'the', 'characteristics', 'of', 'hyperspectral', 'image', 'data', 'called', 'hsicnn', 'firstly', 'the', 'spectralspatial', 'feature', 'is', 'extracted', 'from', 'a', 'target', 'pixel', 'and', 'its', 'neighbors', 'then', 'a', 'number', 'of', 'onedimensional', 'feature', 'maps', 'obtained', 'by', 'convolution', 'operation', 'on', 'spectralspatial', 'features', 'are', 'stacked', 'into', 'a', 'twodimensional', 'matrix', 'finally', 'the', 'twodimensional', 'matrix', 'considered', 'as', 'an', 'image', 'is', 'fed', 'into', 'standard', 'cnn', 'this', 'is', 'why', 'we', 'call', 'it', 'hsicnn', 'in', 'addition', 'we', 'also', 'implements', 'two', 'depth', 'network', 'classification', 'models', 'called', 'hsicnnxgboost', 'and', 'hsicapsnet', 'in', 'order', 'to', 'compare', 'the', 'performance', 'of', 'our', 'framework', 'experiments', 'show', 'that', 'the', 'performance', 'of', 'hyperspectral', 'image', 'classification', 'is', 'improved', 'efficiently', 'with', 'hsicnn', 'framework', 'we', 'evaluate', 'the', 'models', 'performance', 'using', 'four', 'popular', 'hsi', 'datasets', 'which', 'are', 'the', 'kennedy', 'space', 'center', 'ksc', 'indian', 'pines', 'ip', 'pavia', 'university', 'scene', 'pu', 'and', 'salinas', 'scene', 'sa', 'as', 'far', 'as', 'we', 'concerned', 'hsicnn', 'has', 'got', 'the', 'stateofart', 'accuracy', 'among', 'all', 'methods', 'we', 'have', 'known', 'on', 'these', 'datasets', 'of', '9928', '9909', '9942', '9895', 'separately']] | [-0.013665232793069804, -0.03057189286165596, -0.07271604813062228, 0.034072257780159515, -0.05862135005493959, -0.14587804464957652, -0.008249919013066504, 0.460346043551675, -0.24968992569603218, -0.2960669990199117, 0.1206830930036421, -0.3076876538113142, -0.19503964291264614, 0.18138512275778712, -0.13991733711953155, 0.09442274828877252, 0.14114798883644816, 0.04843261369193594, -0.07159003653229239, -0.30859822522048863, 0.30052113071776543, 0.04801746661377808, 0.37212028120978713, 0.015739745713579348, 0.13965245199819598, -0.02502293794711407, -0.03638563430748689, 0.010536408781235178, -0.04131702561881423, 0.16141572465869383, 0.29912295566490427, 0.1974090925931262, 0.2838539065649876, -0.38348532209220604, -0.24499422864367565, 0.07135701645523883, 0.1462949574423524, 0.06788069834434189, -0.061307820464030674, -0.33170186599286705, 0.10403193458616256, -0.17875340757652736, 0.026957574737473178, -0.11868921124245016, -0.020433154623382365, -0.045630547924874684, -0.2618169301882004, 0.02253018189743997, 0.06810180527898363, 0.0611962694197129, -0.05068608018605469, -0.1732112269072483, 0.01611705035604059, 0.1607131322230905, -0.004865377802306261, 0.051718667844453683, 0.08793602612777016, -0.1706533071426421, -0.11900268584633103, 0.35133528462014135, -0.08871006595466334, -0.17875081348495606, 0.18554147102702886, -0.021503547459649733, -0.15401358848366026, 0.09731600369858102, 0.22946605751864038, 0.08732476086379626, -0.1609869695411852, 0.05953715857601939, -0.0828124861053836, 0.15990000170974944, 0.04857449863846294, -0.010843270759766873, 0.14943311216596228, 0.29944794276394904, 0.01385653143724761, 0.17445928431951846, -0.22331262323766565, -0.014412976403195315, -0.16609849538527227, -0.13082738949869496, -0.2034939653866996, -0.038624104978636095, -0.07450348124219976, -0.12067079657109646, 0.44368651791786157, 0.2103051617837105, 0.21828972177150158, 0.06104641357997958, 0.3473489241531262, 0.03882955258401732, 0.11456625326655996, 0.06771395446207279, 0.18929152962011406, 0.045083658367347644, 0.11580898724138164, -0.13515342864960145, 0.03062417064733708, 0.0916421057513127] |
1,802.10479 | Caching in Combination Networks: A Novel Delivery by Leveraging the
Network Topology | Maddah-Ali and Niesen (MAN) in 2014 surprisingly showed that it is possible
to serve an arbitrarily large number of cache-equipped users with a constant
number of transmissions by using coded caching in shared-link broadcast
networks. This paper studies the tradeoff between the user's cache size and the
file download time for combination networks, where users with caches
communicate with the servers through intermediate relays. Motivated by the
so-called separation approach, it is assumed that placement and multicast
message generation are done according to the MAN original scheme and regardless
of the network topology. The main contribution of this paper is the design of a
novel two-phase delivery scheme that, accounting to the network topology,
outperforms schemes available in the literature. The key idea is to create
additional (compared to MAN) multicasting opportunities: in the first phase
coded messages are sent with the goal of increasing the amount of `side
information' at the users, which is then leveraged during the second phase. The
download time with the novel scheme is shown to be proportional to 1=H (with H
being the number or relays) and to be order optimal under the constraint of
uncoded placement for some parameter regimes.
| cs.IT math.IT | maddahali and niesen man in 2014 surprisingly showed that it is possible to serve an arbitrarily large number of cacheequipped users with a constant number of transmissions by using coded caching in sharedlink broadcast networks this paper studies the tradeoff between the users cache size and the file download time for combination networks where users with caches communicate with the servers through intermediate relays motivated by the socalled separation approach it is assumed that placement and multicast message generation are done according to the man original scheme and regardless of the network topology the main contribution of this paper is the design of a novel twophase delivery scheme that accounting to the network topology outperforms schemes available in the literature the key idea is to create additional compared to man multicasting opportunities in the first phase coded messages are sent with the goal of increasing the amount of side information at the users which is then leveraged during the second phase the download time with the novel scheme is shown to be proportional to 1h with h being the number or relays and to be order optimal under the constraint of uncoded placement for some parameter regimes | [['maddahali', 'and', 'niesen', 'man', 'in', '2014', 'surprisingly', 'showed', 'that', 'it', 'is', 'possible', 'to', 'serve', 'an', 'arbitrarily', 'large', 'number', 'of', 'cacheequipped', 'users', 'with', 'a', 'constant', 'number', 'of', 'transmissions', 'by', 'using', 'coded', 'caching', 'in', 'sharedlink', 'broadcast', 'networks', 'this', 'paper', 'studies', 'the', 'tradeoff', 'between', 'the', 'users', 'cache', 'size', 'and', 'the', 'file', 'download', 'time', 'for', 'combination', 'networks', 'where', 'users', 'with', 'caches', 'communicate', 'with', 'the', 'servers', 'through', 'intermediate', 'relays', 'motivated', 'by', 'the', 'socalled', 'separation', 'approach', 'it', 'is', 'assumed', 'that', 'placement', 'and', 'multicast', 'message', 'generation', 'are', 'done', 'according', 'to', 'the', 'man', 'original', 'scheme', 'and', 'regardless', 'of', 'the', 'network', 'topology', 'the', 'main', 'contribution', 'of', 'this', 'paper', 'is', 'the', 'design', 'of', 'a', 'novel', 'twophase', 'delivery', 'scheme', 'that', 'accounting', 'to', 'the', 'network', 'topology', 'outperforms', 'schemes', 'available', 'in', 'the', 'literature', 'the', 'key', 'idea', 'is', 'to', 'create', 'additional', 'compared', 'to', 'man', 'multicasting', 'opportunities', 'in', 'the', 'first', 'phase', 'coded', 'messages', 'are', 'sent', 'with', 'the', 'goal', 'of', 'increasing', 'the', 'amount', 'of', 'side', 'information', 'at', 'the', 'users', 'which', 'is', 'then', 'leveraged', 'during', 'the', 'second', 'phase', 'the', 'download', 'time', 'with', 'the', 'novel', 'scheme', 'is', 'shown', 'to', 'be', 'proportional', 'to', '1h', 'with', 'h', 'being', 'the', 'number', 'or', 'relays', 'and', 'to', 'be', 'order', 'optimal', 'under', 'the', 'constraint', 'of', 'uncoded', 'placement', 'for', 'some', 'parameter', 'regimes']] | [-0.20125708516969623, 0.05940906930223479, -0.03761997817292204, -0.010999449576029016, -0.08658390942970433, -0.24046776857378369, 0.14053390607318184, 0.37325885344939636, -0.2954862600140425, -0.32555534369619515, 0.09709956164608903, -0.27555362530393046, -0.1450207907916874, 0.11668568791060467, -0.12773307586156143, 0.03076524364225434, 0.019322669519594462, 0.05468794734685251, 0.017063603838988424, -0.33720168301145437, 0.2937862597261721, 0.11499481090358671, 0.33648043951766593, 0.02786494006827086, 0.06117160061757236, 0.009725724877600516, -0.05287412279799609, -0.023112784400158314, -0.09411771595178894, 0.08212011089494693, 0.3228577086406519, 0.1720512903219817, 0.27759053421485697, -0.4185357758122955, -0.20611427000813604, 0.0891048672731947, 0.14817499483493513, 0.09294470209719348, -0.03891559074107477, -0.2808216445698748, 0.14383917256508988, -0.2165246005051859, -0.027351049412051357, 0.004785959372476575, -0.03091624563886089, 0.059157444814191704, -0.31802224434278714, -0.035179495945015, -0.024392024225521086, -0.017306171177985705, -0.02212274356551355, -0.05824958913378077, 0.005779163956850162, 0.189492232980547, 0.07933557702025734, 0.043482744195829454, 0.07230817675466418, -0.073122870980119, -0.09424859382859833, 0.38736272755499723, -0.0037189325876770363, -0.19283022868640834, 0.13056087864711785, -0.05674616941889077, -0.09891362345557622, 0.1630810887132048, 0.20479590362552458, 0.0836215934935995, -0.15148761152493093, 0.018432777392415584, -0.03487846851857086, 0.21606791755456364, 0.0917695328524705, 0.08883759201306916, 0.12322210760250556, 0.21019847030948782, 0.1217978339037163, 0.13770300933623186, -0.08066312996859705, -0.11271669011271138, -0.23906140598979056, -0.14718990853330507, -0.2401207502137132, -0.02334348901368791, -0.09751012585642051, -0.05527579171750293, 0.3438196638252045, 0.142545626127648, 0.15734070822889656, 0.09114033202841632, 0.3824910727060083, 0.05539396707279381, 0.08725130625824364, 0.18134224357858755, 0.15170993170240624, 0.06686538250568479, 0.15619157944619183, -0.19284854160026685, 0.12404070038887374, 0.03765130968442953] |
1,802.1048 | A two-stage ensemble Kalman filter based on multiscale model reduction
for inverse problems in time fractional diffusion-wave equations | Ensemble Kalman filter (EnKF) has been widely used in state estimation and
parameter estimation for the dynamic system where observational data is
obtained sequentially in time.
To reduce uncertainty and accelerate posterior inference, a two-stage
ensemble Kalman filter is presented to improve the sequential analysis of EnKF.
It is known that the final posterior ensemble may be concentrated in a small
portion of the entire support of the initial prior ensemble. It will be much
more efficient if we first build a new prior by some partial observations, and
construct a surrogate only over the significant region of the new prior. To
this end, we construct a very coarse model using generalized multiscale finite
element method (GMsFEM) and generate a new prior ensemble in the first stage.
GMsFEM provides a set of hierarchical multiscale basis functions supported in
coarse blocks. This gives flexibility and adaptivity to choosing degree of
freedoms to construct a reduce model. In the second stage, we build an initial
surrogate model based on the new prior by using GMsFEM and sparse generalized
polynomial chaos (gPC)-based stochastic collocation methods. To improve the
initial surrogate model, we dynamically update the surrogate model, which is
adapted to the sequential availability of data and the updated analysis. The
two-stage EnKF can achieve a better estimation than standard EnKF, and
significantly improve the efficiency to update the ensemble analysis (posterior
exploration). To enhance the applicability and flexibility in Bayesian inverse
problems, we extend the two-stage EnKF to non-Gaussian models and hierarchical
models. In the paper, we focus on the time fractional diffusion-wave models in
porous media and investigate their Bayesian inverse problems using the proposed
two-stage EnKF.
| math.NA | ensemble kalman filter enkf has been widely used in state estimation and parameter estimation for the dynamic system where observational data is obtained sequentially in time to reduce uncertainty and accelerate posterior inference a twostage ensemble kalman filter is presented to improve the sequential analysis of enkf it is known that the final posterior ensemble may be concentrated in a small portion of the entire support of the initial prior ensemble it will be much more efficient if we first build a new prior by some partial observations and construct a surrogate only over the significant region of the new prior to this end we construct a very coarse model using generalized multiscale finite element method gmsfem and generate a new prior ensemble in the first stage gmsfem provides a set of hierarchical multiscale basis functions supported in coarse blocks this gives flexibility and adaptivity to choosing degree of freedoms to construct a reduce model in the second stage we build an initial surrogate model based on the new prior by using gmsfem and sparse generalized polynomial chaos gpcbased stochastic collocation methods to improve the initial surrogate model we dynamically update the surrogate model which is adapted to the sequential availability of data and the updated analysis the twostage enkf can achieve a better estimation than standard enkf and significantly improve the efficiency to update the ensemble analysis posterior exploration to enhance the applicability and flexibility in bayesian inverse problems we extend the twostage enkf to nongaussian models and hierarchical models in the paper we focus on the time fractional diffusionwave models in porous media and investigate their bayesian inverse problems using the proposed twostage enkf | [['ensemble', 'kalman', 'filter', 'enkf', 'has', 'been', 'widely', 'used', 'in', 'state', 'estimation', 'and', 'parameter', 'estimation', 'for', 'the', 'dynamic', 'system', 'where', 'observational', 'data', 'is', 'obtained', 'sequentially', 'in', 'time', 'to', 'reduce', 'uncertainty', 'and', 'accelerate', 'posterior', 'inference', 'a', 'twostage', 'ensemble', 'kalman', 'filter', 'is', 'presented', 'to', 'improve', 'the', 'sequential', 'analysis', 'of', 'enkf', 'it', 'is', 'known', 'that', 'the', 'final', 'posterior', 'ensemble', 'may', 'be', 'concentrated', 'in', 'a', 'small', 'portion', 'of', 'the', 'entire', 'support', 'of', 'the', 'initial', 'prior', 'ensemble', 'it', 'will', 'be', 'much', 'more', 'efficient', 'if', 'we', 'first', 'build', 'a', 'new', 'prior', 'by', 'some', 'partial', 'observations', 'and', 'construct', 'a', 'surrogate', 'only', 'over', 'the', 'significant', 'region', 'of', 'the', 'new', 'prior', 'to', 'this', 'end', 'we', 'construct', 'a', 'very', 'coarse', 'model', 'using', 'generalized', 'multiscale', 'finite', 'element', 'method', 'gmsfem', 'and', 'generate', 'a', 'new', 'prior', 'ensemble', 'in', 'the', 'first', 'stage', 'gmsfem', 'provides', 'a', 'set', 'of', 'hierarchical', 'multiscale', 'basis', 'functions', 'supported', 'in', 'coarse', 'blocks', 'this', 'gives', 'flexibility', 'and', 'adaptivity', 'to', 'choosing', 'degree', 'of', 'freedoms', 'to', 'construct', 'a', 'reduce', 'model', 'in', 'the', 'second', 'stage', 'we', 'build', 'an', 'initial', 'surrogate', 'model', 'based', 'on', 'the', 'new', 'prior', 'by', 'using', 'gmsfem', 'and', 'sparse', 'generalized', 'polynomial', 'chaos', 'gpcbased', 'stochastic', 'collocation', 'methods', 'to', 'improve', 'the', 'initial', 'surrogate', 'model', 'we', 'dynamically', 'update', 'the', 'surrogate', 'model', 'which', 'is', 'adapted', 'to', 'the', 'sequential', 'availability', 'of', 'data', 'and', 'the', 'updated', 'analysis', 'the', 'twostage', 'enkf', 'can', 'achieve', 'a', 'better', 'estimation', 'than', 'standard', 'enkf', 'and', 'significantly', 'improve', 'the', 'efficiency', 'to', 'update', 'the', 'ensemble', 'analysis', 'posterior', 'exploration', 'to', 'enhance', 'the', 'applicability', 'and', 'flexibility', 'in', 'bayesian', 'inverse', 'problems', 'we', 'extend', 'the', 'twostage', 'enkf', 'to', 'nongaussian', 'models', 'and', 'hierarchical', 'models', 'in', 'the', 'paper', 'we', 'focus', 'on', 'the', 'time', 'fractional', 'diffusionwave', 'models', 'in', 'porous', 'media', 'and', 'investigate', 'their', 'bayesian', 'inverse', 'problems', 'using', 'the', 'proposed', 'twostage', 'enkf']] | [0.00475393929307095, 0.027118275956811638, -0.13806747549721463, 0.0789859253553335, -0.09273496969687668, -0.1340151462433013, 0.04170601321426644, 0.39810064663602546, -0.30322722099721433, -0.29387986104427416, 0.13646922525060787, -0.18817984746261077, -0.13559637251818044, 0.14546992174519058, -0.10291873564361595, 0.12205005729062991, 0.11082900256934491, -0.011893948043950579, -0.08555176442319697, -0.26813708856024526, 0.26358662167394703, 0.1320225956688889, 0.30714249806584454, -0.07344154884530739, 0.14129147419113328, 0.00315485219640488, -0.07570250438060612, -0.016776074960150503, -0.10958648217516549, 0.1577056728743694, 0.2476537443063386, 0.1793519016924653, 0.3537151055579836, -0.40467558243057944, -0.27293771759691565, 0.13891274701846257, 0.16018389794033613, 0.13715459407180208, -0.007552175269811414, -0.2854598734206097, 0.06850999580526894, -0.20802842445803849, -0.08824418904598463, -0.12177770812741735, -0.0526639135080305, 0.014342897164169699, -0.36824788965284827, 0.07879707382483916, 0.04029634024863216, 0.003478672606870532, -0.03628215007314628, -0.14882315337446264, 0.027519959410313856, 0.06803787886461413, -0.020955457988364453, 0.015173876256766644, 0.11116531163284725, -0.08119726295900447, -0.09357539603994651, 0.3239377432011745, -0.06902232654419177, -0.24667772875082764, 0.1570989015622234, -0.06082697277549993, -0.1416171399334615, 0.13002701412463052, 0.24926448578184301, 0.12982854645021938, -0.16943846031346105, 0.04579452025217258, -0.018097801108167253, 0.20906830984083088, -0.002320281202820214, -0.048011132115498185, 0.12285502705638382, 0.23372607759454034, 0.09600991487164388, 0.15388228299180892, -0.11065728293393146, -0.1427290702014315, -0.24805292371999133, -0.13938511302488304, -0.2126592051407153, -0.04881649527190761, -0.1389592143139188, -0.19131677891720425, 0.4123887065459381, 0.25985927915412255, 0.1939834934151308, 0.05895753328799566, 0.3052974859015508, 0.11583052875437054, 0.04729529868049378, 0.07361382275650447, 0.19631802468359555, 0.09549355842342432, 0.09071170945524831, -0.18429792984568683, 0.07430819908675568, 0.09721632370471277] |
1,802.10481 | A Novel Asymmetric Coded Placement in Combination Networks with end-user
Caches | The tradeoff between the user's memory size and the worst-case download time
in the $(H,r,M,N)$ combination network is studied, where a central server
communicates with $K$ users through $H$ immediate relays, and each user has
local cache of size $M$ files and is connected to a different subset of $r$
relays. The main contribution of this paper is the design of a coded caching
scheme with asymmetric coded placement by leveraging coordination among the
relays, which was not exploited in past work. Mathematical analysis and
numerical results show that the proposed schemes outperform existing schemes.
| cs.IT math.IT | the tradeoff between the users memory size and the worstcase download time in the hrmn combination network is studied where a central server communicates with k users through h immediate relays and each user has local cache of size m files and is connected to a different subset of r relays the main contribution of this paper is the design of a coded caching scheme with asymmetric coded placement by leveraging coordination among the relays which was not exploited in past work mathematical analysis and numerical results show that the proposed schemes outperform existing schemes | [['the', 'tradeoff', 'between', 'the', 'users', 'memory', 'size', 'and', 'the', 'worstcase', 'download', 'time', 'in', 'the', 'hrmn', 'combination', 'network', 'is', 'studied', 'where', 'a', 'central', 'server', 'communicates', 'with', 'k', 'users', 'through', 'h', 'immediate', 'relays', 'and', 'each', 'user', 'has', 'local', 'cache', 'of', 'size', 'm', 'files', 'and', 'is', 'connected', 'to', 'a', 'different', 'subset', 'of', 'r', 'relays', 'the', 'main', 'contribution', 'of', 'this', 'paper', 'is', 'the', 'design', 'of', 'a', 'coded', 'caching', 'scheme', 'with', 'asymmetric', 'coded', 'placement', 'by', 'leveraging', 'coordination', 'among', 'the', 'relays', 'which', 'was', 'not', 'exploited', 'in', 'past', 'work', 'mathematical', 'analysis', 'and', 'numerical', 'results', 'show', 'that', 'the', 'proposed', 'schemes', 'outperform', 'existing', 'schemes']] | [-0.22026209480270367, -0.01842091371741225, -0.042085183883442526, -0.032896437372596184, -0.0888534840642217, -0.2722055988653781, 0.15938083270807413, 0.39725747693607466, -0.2632819047504838, -0.2942969284634641, 0.06498587199615592, -0.2753098875313918, -0.13609238926004222, 0.10698155948069897, -0.12336054597882197, 0.007070818896147799, 0.02921922666060477, 0.06190252815313796, -0.014229374920374694, -0.34617669672328744, 0.28381191231458985, 0.10773082764601295, 0.3163401715536701, 0.02912480493095961, 0.06307122377341891, 0.024900365776897585, -0.09302026062133781, 0.0035943002328573865, -0.10663365717629587, 0.09416218456921187, 0.35678466550133964, 0.187709941102707, 0.29039528924337726, -0.4051314062597428, -0.20426862094392803, 0.07331582453557627, 0.16408480514593898, 0.040217635443463844, -0.04304853918159658, -0.27119017087735553, 0.16296347732992567, -0.22245705624338874, 0.005816634036006129, 0.032355412791304765, -0.017627590581120803, 0.09320060336130097, -0.3236685335447893, -0.059459138465946186, 0.0042583617639351395, 0.020482614849436472, -0.00455353394685749, -0.09069825560746199, -0.0025752300317300127, 0.1900753982593008, 0.05023942622504732, 0.01147271023983968, 0.11752797806377899, -0.042499212640402045, -0.14006830120776245, 0.3624441474824748, 0.007473127421070921, -0.18097770000322463, 0.15126482119407267, -0.05865568469001099, -0.1008975564680518, 0.1433059189250653, 0.21881931804199803, 0.08987925135272931, -0.1594235458203215, 0.0916508643447045, -0.08456521238475305, 0.21921234892710964, 0.10102527126659976, 0.10139535735590394, 0.1088879936117124, 0.2270057599674514, 0.11383664506943302, 0.1270147355179243, -0.07495939091561322, -0.10067804240958488, -0.248541506790021, -0.14647872995664465, -0.2594834719685481, -0.029442839266111867, -0.14041949528891176, -0.0355477480990614, 0.3526129990983231, 0.1271309790652285, 0.12616960017723924, 0.09701256310453321, 0.41020201188214916, 0.03906266897993579, 0.10102022052841618, 0.22289750262837302, 0.10614097520629777, 0.06711668701733443, 0.1414764815337084, -0.2214336902487706, 0.11189196114131111, 0.027239043171458106] |
1,802.10482 | Importance sampling with imperfect cloning for the computation of
generalized Lyapunov exponents | We revisit the numerical calculation of generalized Lyapunov exponents,
$L$($q$), in deterministic dynamical systems. The standard method consists of
adding noise to the dynamics in order to use importance sampling algorithms.
Then $L$($q$) is obtained by taking the limit noise-amplitude $\to$0 after the
calculation. We focus on a particular method that involves periodic cloning and
pruning of a set of trajectories. However, instead of considering a noisy
dynamics, we implement an imperfect (noisy) cloning. This alternative method is
compared with the standard one and, when possible, with analytical results. As
a workbench, we use the asymmetric tent map, the standard map, and a system of
coupled symplectic maps. The general conclusion of this study is that the
imperfect-cloning method performs as well as the standard one, with the
advantage of preserving the deterministic dynamics.
| cond-mat.stat-mech nlin.CD | we revisit the numerical calculation of generalized lyapunov exponents lq in deterministic dynamical systems the standard method consists of adding noise to the dynamics in order to use importance sampling algorithms then lq is obtained by taking the limit noiseamplitude to0 after the calculation we focus on a particular method that involves periodic cloning and pruning of a set of trajectories however instead of considering a noisy dynamics we implement an imperfect noisy cloning this alternative method is compared with the standard one and when possible with analytical results as a workbench we use the asymmetric tent map the standard map and a system of coupled symplectic maps the general conclusion of this study is that the imperfectcloning method performs as well as the standard one with the advantage of preserving the deterministic dynamics | [['we', 'revisit', 'the', 'numerical', 'calculation', 'of', 'generalized', 'lyapunov', 'exponents', 'lq', 'in', 'deterministic', 'dynamical', 'systems', 'the', 'standard', 'method', 'consists', 'of', 'adding', 'noise', 'to', 'the', 'dynamics', 'in', 'order', 'to', 'use', 'importance', 'sampling', 'algorithms', 'then', 'lq', 'is', 'obtained', 'by', 'taking', 'the', 'limit', 'noiseamplitude', 'to0', 'after', 'the', 'calculation', 'we', 'focus', 'on', 'a', 'particular', 'method', 'that', 'involves', 'periodic', 'cloning', 'and', 'pruning', 'of', 'a', 'set', 'of', 'trajectories', 'however', 'instead', 'of', 'considering', 'a', 'noisy', 'dynamics', 'we', 'implement', 'an', 'imperfect', 'noisy', 'cloning', 'this', 'alternative', 'method', 'is', 'compared', 'with', 'the', 'standard', 'one', 'and', 'when', 'possible', 'with', 'analytical', 'results', 'as', 'a', 'workbench', 'we', 'use', 'the', 'asymmetric', 'tent', 'map', 'the', 'standard', 'map', 'and', 'a', 'system', 'of', 'coupled', 'symplectic', 'maps', 'the', 'general', 'conclusion', 'of', 'this', 'study', 'is', 'that', 'the', 'imperfectcloning', 'method', 'performs', 'as', 'well', 'as', 'the', 'standard', 'one', 'with', 'the', 'advantage', 'of', 'preserving', 'the', 'deterministic', 'dynamics']] | [-0.0917197908923051, 0.04056759910831302, -0.08831609829124346, 0.06149526090082487, -0.023086238644089353, -0.15309168782991808, 0.060632659251110235, 0.34359255338980194, -0.28029052129325766, -0.23357964053072713, 0.12905991179903856, -0.2475673269064194, -0.19452665354368615, 0.22633101772799186, -0.06472048526065367, 0.09140859449733839, 0.07868302737673123, 0.03795205274505089, -0.08053876604985404, -0.22312646677230738, 0.3357547676864532, 0.04414614555902186, 0.253172755121451, -0.03858621002203136, 0.1328246362620231, 0.04716269711956777, -0.04128570245776438, 0.02047403677274953, -0.10348338936157896, 0.11291928578760814, 0.16082358429434174, 0.11666306566489353, 0.2793219049715183, -0.386252270940917, -0.1933834344134525, 0.1243681841755681, 0.11260822661587912, 0.14540159930898386, -0.03612365078791327, -0.29075930527566624, 0.0716204442627107, -0.1483496397550246, -0.12477407003858719, -0.1084655547606279, -0.038827474363091766, 0.018033924068952205, -0.30074294631909154, 0.07548548401135838, 0.08874333220526089, 0.028499198901100142, -0.02491240705730337, -0.0765046594456318, 0.021227515542484594, 0.12171694207658716, 0.011571741283687792, 0.021748034045396544, 0.13412515197132685, -0.09606436491153683, -0.16000578950766023, 0.3883407917014803, -0.10056901211007216, -0.24735570345497268, 0.1857981859211577, -0.08398041960247087, -0.1321507226887413, 0.11498786336883451, 0.13604417412584138, 0.11005796716111063, -0.13741340901524932, 0.11451314533505039, -0.046880679847990075, 0.15596021435251742, 0.026593802962452173, 0.004921106077028636, 0.11906508707695386, 0.21280389980970402, 0.07575615618208592, 0.17984961042230047, -0.08702629345829006, -0.16108890572804463, -0.28800560195337643, -0.12620426475945296, -0.17273744862794763, 0.03743224644285598, -0.08419741007508658, -0.15536542869680983, 0.4031146563092162, 0.17054689171808687, 0.19541487533062923, 0.105168082573183, 0.36252777224448934, 0.13197712857414223, 0.018705475394557598, 0.04844724247055693, 0.21441935063128106, 0.11564554374269916, 0.07640845062225267, -0.22042511588855027, 0.027611916263898213, 0.08940230331548567] |
1,802.10483 | Transient fractality as a mechanism for emergent irreversibility in
chaotic Hamiltonian dynamics | Understanding irreversibility in macrophysics from reversible microphysics
has been the holy grail in statistical physics ever since the mid-19th century.
Here the central question concerns the arrow of time, which boils down to
deriving macroscopic emergent irreversibility from microscopic reversible
equations of motion. As suggested by Boltzmann, this irreversibility amounts to
improbability (rather than impossibility) of the second-law-violating events.
Later studies suggest that this improbability arises from a fractal attractor
which is dynamically generated in phase space in reversible dissipative
systems. However, the same mechanism seems inapplicable to reversible
conservative systems, since a zero-volume fractal attractor is incompatible
with the nonzero phase-space volume, which is a constant of motion due to the
Liouville theorem. Here we demonstrate that in a Hamiltonian system the fractal
scaling emerges transiently over an intermediate length scale. Notably, this
transient fractality is unveiled by invoking the Loschmidt demon with an
imperfect accuracy. Moreover, we show that irreversibility from the fractality
can be evaluated by means of information theory and the fluctuation theorem.
The fractality provides a unified understanding of emergent irreversibility
over an intermediate time scale regardless of whether the underlying reversible
dynamics is dissipative or conservative.
| cond-mat.stat-mech nlin.CD | understanding irreversibility in macrophysics from reversible microphysics has been the holy grail in statistical physics ever since the mid19th century here the central question concerns the arrow of time which boils down to deriving macroscopic emergent irreversibility from microscopic reversible equations of motion as suggested by boltzmann this irreversibility amounts to improbability rather than impossibility of the secondlawviolating events later studies suggest that this improbability arises from a fractal attractor which is dynamically generated in phase space in reversible dissipative systems however the same mechanism seems inapplicable to reversible conservative systems since a zerovolume fractal attractor is incompatible with the nonzero phasespace volume which is a constant of motion due to the liouville theorem here we demonstrate that in a hamiltonian system the fractal scaling emerges transiently over an intermediate length scale notably this transient fractality is unveiled by invoking the loschmidt demon with an imperfect accuracy moreover we show that irreversibility from the fractality can be evaluated by means of information theory and the fluctuation theorem the fractality provides a unified understanding of emergent irreversibility over an intermediate time scale regardless of whether the underlying reversible dynamics is dissipative or conservative | [['understanding', 'irreversibility', 'in', 'macrophysics', 'from', 'reversible', 'microphysics', 'has', 'been', 'the', 'holy', 'grail', 'in', 'statistical', 'physics', 'ever', 'since', 'the', 'mid19th', 'century', 'here', 'the', 'central', 'question', 'concerns', 'the', 'arrow', 'of', 'time', 'which', 'boils', 'down', 'to', 'deriving', 'macroscopic', 'emergent', 'irreversibility', 'from', 'microscopic', 'reversible', 'equations', 'of', 'motion', 'as', 'suggested', 'by', 'boltzmann', 'this', 'irreversibility', 'amounts', 'to', 'improbability', 'rather', 'than', 'impossibility', 'of', 'the', 'secondlawviolating', 'events', 'later', 'studies', 'suggest', 'that', 'this', 'improbability', 'arises', 'from', 'a', 'fractal', 'attractor', 'which', 'is', 'dynamically', 'generated', 'in', 'phase', 'space', 'in', 'reversible', 'dissipative', 'systems', 'however', 'the', 'same', 'mechanism', 'seems', 'inapplicable', 'to', 'reversible', 'conservative', 'systems', 'since', 'a', 'zerovolume', 'fractal', 'attractor', 'is', 'incompatible', 'with', 'the', 'nonzero', 'phasespace', 'volume', 'which', 'is', 'a', 'constant', 'of', 'motion', 'due', 'to', 'the', 'liouville', 'theorem', 'here', 'we', 'demonstrate', 'that', 'in', 'a', 'hamiltonian', 'system', 'the', 'fractal', 'scaling', 'emerges', 'transiently', 'over', 'an', 'intermediate', 'length', 'scale', 'notably', 'this', 'transient', 'fractality', 'is', 'unveiled', 'by', 'invoking', 'the', 'loschmidt', 'demon', 'with', 'an', 'imperfect', 'accuracy', 'moreover', 'we', 'show', 'that', 'irreversibility', 'from', 'the', 'fractality', 'can', 'be', 'evaluated', 'by', 'means', 'of', 'information', 'theory', 'and', 'the', 'fluctuation', 'theorem', 'the', 'fractality', 'provides', 'a', 'unified', 'understanding', 'of', 'emergent', 'irreversibility', 'over', 'an', 'intermediate', 'time', 'scale', 'regardless', 'of', 'whether', 'the', 'underlying', 'reversible', 'dynamics', 'is', 'dissipative', 'or', 'conservative']] | [-0.13323963861818017, 0.19874897897351687, -0.14419748829750842, 0.09353386587950922, -0.05952160813996851, -0.10739557247569892, 0.05074496143826659, 0.25843027945734676, -0.3296582051674733, -0.2760419016959955, 0.06383644995165023, -0.22142170435207756, -0.1417339657121265, 0.20089428867847312, -0.07312603594725513, 0.05443667813145717, 0.008014850157522718, 0.03875482732708034, -0.02531971493114215, -0.17942428798292867, 0.302412906707952, 0.08013934991444359, 0.29732931311686, 0.03134225765291933, 0.1383593280466593, -0.04302594755015565, -0.003801104285954181, 0.03958320472110916, -0.10390065040823203, 0.07078284304345231, 0.23014118234049138, 0.09404216359457225, 0.2702402099040556, -0.43134714082780623, -0.26941305222306694, 0.1038660541608325, 0.14894911496173494, 0.1492901343068459, -0.0094931191491714, -0.2902357651954468, 0.04741119452799714, -0.11235923210953738, -0.16496879970459805, -0.08050495327367442, 0.09053460454704795, -0.03773373583665712, -0.16522266124302024, 0.15250258915448142, 0.13887257399086242, 0.09803897215550794, -0.05409861554230773, 0.0005981812188986942, -0.015953009841471168, 0.0890331955477888, 0.03845747215831798, 0.01722422248686308, 0.16270246340634778, -0.10973792373695221, -0.14237799464861486, 0.38573794769420633, -0.03750420078253971, -0.1418222281565859, 0.18363322171014465, -0.14254654410017253, -0.15293513712136766, 0.15611623423003362, 0.09994540513122542, 0.07649788355542571, -0.19305349028722935, 0.10720054174289449, -0.010557282112626583, 0.2048585549099322, 0.045643377693184696, 0.0400131130322853, 0.23420047815108955, 0.20280387626073434, 0.03408791292556294, 0.13017570261943462, -0.015622170977245685, -0.20949281342766438, -0.2858836617301272, -0.16586976819452268, -0.21278306308412115, 0.16730976725577412, -0.08760284238636033, -0.13814055222861898, 0.3374876533293638, 0.18873088354859208, 0.1730307026151346, 0.030296007988389936, 0.24529343312459934, 0.11822878976452472, 0.060055554404376925, 0.07418540945515543, 0.24153000270217628, 0.11938415504004611, 0.14706335743738055, -0.22998129681279367, 0.12026782515985984, 0.08182472113217593] |
1,802.10484 | Accelerator modes and anomalous diffusion in 3D volume-preserving maps | Angle-action maps that are periodic in the action direction can have
accelerator modes: orbits that are periodic when projected onto the torus, but
that lift to unbounded orbits in an action variable. In this paper we construct
a volume-preserving family of maps, with two angles and one action, that have
accelerator modes created at Hopf-one (or saddle-center-Hopf) bifurcations.
Near such a bifurcation we show that there is often a bubble of invariant tori.
Computations of chaotic orbits near such a bubble show that the trapping times
have an algebraic decay similar to that seen around stability islands in
area-preserving maps. As in the 2D case, this gives rise to anomalous diffusive
properties of the action in our 3D map.
| nlin.CD | angleaction maps that are periodic in the action direction can have accelerator modes orbits that are periodic when projected onto the torus but that lift to unbounded orbits in an action variable in this paper we construct a volumepreserving family of maps with two angles and one action that have accelerator modes created at hopfone or saddlecenterhopf bifurcations near such a bifurcation we show that there is often a bubble of invariant tori computations of chaotic orbits near such a bubble show that the trapping times have an algebraic decay similar to that seen around stability islands in areapreserving maps as in the 2d case this gives rise to anomalous diffusive properties of the action in our 3d map | [['angleaction', 'maps', 'that', 'are', 'periodic', 'in', 'the', 'action', 'direction', 'can', 'have', 'accelerator', 'modes', 'orbits', 'that', 'are', 'periodic', 'when', 'projected', 'onto', 'the', 'torus', 'but', 'that', 'lift', 'to', 'unbounded', 'orbits', 'in', 'an', 'action', 'variable', 'in', 'this', 'paper', 'we', 'construct', 'a', 'volumepreserving', 'family', 'of', 'maps', 'with', 'two', 'angles', 'and', 'one', 'action', 'that', 'have', 'accelerator', 'modes', 'created', 'at', 'hopfone', 'or', 'saddlecenterhopf', 'bifurcations', 'near', 'such', 'a', 'bifurcation', 'we', 'show', 'that', 'there', 'is', 'often', 'a', 'bubble', 'of', 'invariant', 'tori', 'computations', 'of', 'chaotic', 'orbits', 'near', 'such', 'a', 'bubble', 'show', 'that', 'the', 'trapping', 'times', 'have', 'an', 'algebraic', 'decay', 'similar', 'to', 'that', 'seen', 'around', 'stability', 'islands', 'in', 'areapreserving', 'maps', 'as', 'in', 'the', '2d', 'case', 'this', 'gives', 'rise', 'to', 'anomalous', 'diffusive', 'properties', 'of', 'the', 'action', 'in', 'our', '3d', 'map']] | [-0.18213621600785762, 0.15006237013218726, -0.11734508918439093, 0.03474204661623121, -0.007683110184585437, -0.10432255968777861, -0.02623008386904581, 0.3776106257787627, -0.27835182730968183, -0.21592213285083955, 0.12396381835007451, -0.28894822139882, -0.18144637086173981, 0.2433048190576876, -0.07743032516227064, 0.01964303666455114, 0.08725873632038124, 0.039749278749625847, -0.0724590975874796, -0.18843413742844206, 0.33880715942981404, -0.0019436975558980918, 0.19356625847932366, -0.022175203636686645, 0.0995788989493098, -0.07517751767976671, 0.054011522999240294, 0.019829405065721426, -0.12642993450454093, 0.06874296077105224, 0.21464276531886342, 0.030397008856734596, 0.19319439243573028, -0.41793439605145943, -0.21065276646668202, 0.11748712821107389, 0.1940233122326561, 0.11258348518520848, -0.07919370446306391, -0.27389546564748335, 0.07675017476973371, -0.13819902773914683, -0.19403479153561032, -0.09014982032056293, 0.07160794698736733, 0.007779698834842087, -0.24268947520221656, 0.026157364153709166, 0.11508747284364305, 0.10344052520126869, -0.07933763598696862, 0.0050283364034218025, -0.08443122781598224, 0.10857155510651258, 0.07800817716478432, 0.07047466807560916, 0.14296377240083155, -0.09761217248856895, -0.10605585532119641, 0.37436505056207237, -0.0946340492536497, -0.23927175316314858, 0.23848218119774872, -0.2145685352251714, -0.1550915355507571, 0.18363630623978555, 0.1890874967042707, 0.10126073866222914, -0.08756655989412286, 0.0883564335312973, -0.09868652201018846, 0.1048143713010682, 0.13040488903434613, -0.00511149871441671, 0.23635040073154065, 0.0940326985795624, 0.14464425501556924, 0.1318325355855955, -0.09001161788272971, -0.10437144126552038, -0.2800322683173845, -0.11163469803177266, -0.09851971878789556, 0.06524026407422419, -0.052175048183382124, -0.2199052288953183, 0.41670613140504587, 0.11934259298862492, 0.24750634713464567, 0.023198447462607127, 0.23140267683113488, 0.10567478006944442, 0.08741849805745813, 0.11249956580547568, 0.24034339401664007, 0.05888773537137442, 0.022620486091567665, -0.19854176294806802, -0.03435998910273879, 0.11951142074699458] |
1,802.10485 | Optical helicity and Hertz vectors | We study the conserved quantity associated with the dual symmetry of the
Maxwell equations, called the optical helicity, by means of transverse Hertz
vectors. In the presence of charges, its evolution yields the integral of
$\bm{E}\cdot\bm{B}$ which is the anomaly term for chiral fermions. We also
discuss the helicity change in condensed matter systems where topological
magnetoelectric effect emerges. An alternative expression of the optical
helicity is also found. Lastly, a dual symmetric Hertz Lagrangian is
constructed and its conserved charge is derived.
| physics.optics cond-mat.mes-hall hep-th | we study the conserved quantity associated with the dual symmetry of the maxwell equations called the optical helicity by means of transverse hertz vectors in the presence of charges its evolution yields the integral of bmecdotbmb which is the anomaly term for chiral fermions we also discuss the helicity change in condensed matter systems where topological magnetoelectric effect emerges an alternative expression of the optical helicity is also found lastly a dual symmetric hertz lagrangian is constructed and its conserved charge is derived | [['we', 'study', 'the', 'conserved', 'quantity', 'associated', 'with', 'the', 'dual', 'symmetry', 'of', 'the', 'maxwell', 'equations', 'called', 'the', 'optical', 'helicity', 'by', 'means', 'of', 'transverse', 'hertz', 'vectors', 'in', 'the', 'presence', 'of', 'charges', 'its', 'evolution', 'yields', 'the', 'integral', 'of', 'bmecdotbmb', 'which', 'is', 'the', 'anomaly', 'term', 'for', 'chiral', 'fermions', 'we', 'also', 'discuss', 'the', 'helicity', 'change', 'in', 'condensed', 'matter', 'systems', 'where', 'topological', 'magnetoelectric', 'effect', 'emerges', 'an', 'alternative', 'expression', 'of', 'the', 'optical', 'helicity', 'is', 'also', 'found', 'lastly', 'a', 'dual', 'symmetric', 'hertz', 'lagrangian', 'is', 'constructed', 'and', 'its', 'conserved', 'charge', 'is', 'derived']] | [-0.23104640387641778, 0.2171125970853609, -0.052064932723069654, 0.0690491726968392, -0.10137317511934514, -0.06481413474014006, -0.03754037716312379, 0.2946358878710648, -0.23809360603733762, -0.23731290142438033, 0.04303523398106691, -0.26906796729919025, -0.1980017108967664, 0.10357912920597123, 0.008259080906921044, 0.005032228145509868, -0.05000666329898394, 0.08504833308298414, -0.10702772388552748, -0.16752369136822115, 0.32405372612780275, 0.024841644971563322, 0.2791246311091704, 0.07970040242710127, 0.17148404601370779, 0.004309390092314016, -0.045478499718450534, 0.029549416404490065, -0.11351828800696062, 0.08489684057535558, 0.1752396944410554, 0.012763234957053168, 0.12422267659340144, -0.41087890470900185, -0.1844393239617802, 0.08729528808375685, 0.12037594907167481, 0.12990872778151774, -0.06543334801794916, -0.2557377459072485, 0.04006181367695695, -0.20021672827963968, -0.18603575682244833, -0.10285122925415635, 0.05076564732575562, -0.021872657825375293, -0.26116355365460237, 0.1234702796287687, 0.024411455603180136, 0.06859951115088402, -0.11111961679090178, -0.09382810725875926, -0.09639332626332961, 0.046101425325770565, 0.1055676437454389, 0.05600197717445198, 0.15027895573350578, -0.17095866835698847, -0.13774350501892224, 0.3909009378573789, -0.07461452991815239, -0.2569143947827198, 0.10771426694217796, -0.12197766202592814, -0.1088384164031595, 0.1210507695994726, 0.07914587558905889, 0.114137165555049, -0.16086772929241017, 0.11953935773245332, -0.0779206473721055, 0.10450698621855004, 0.03464913921907726, 0.08693920334278629, 0.27359693022671994, 0.09490159138037664, 0.04200937383717335, 0.18686534926045414, -0.07767341679555545, -0.1287876408910606, -0.35088380853213913, -0.20829134743388106, -0.23303145672217374, 0.08117168941875784, -0.07691885618810264, -0.14897879477158735, 0.40754289662738036, 0.11582228224497379, 0.13151481378505506, 0.003184330988982011, 0.25319507936152014, 0.20301649479831502, 0.10427557758237349, 0.042065386126590214, 0.2784078841455417, 0.21090344741951855, 0.16120133882888207, -0.3079748094520566, -0.034541159942064706, 0.13126058611882532] |
1,802.10486 | On quadratic curves over finite fields | The geometry of algebraic curves over finite fields is a rich area of
research. In previous work, the authors investigated a particular aspect of the
geometry over finite fields of the classical unit circle, namely how the number
of solutions of the circle equation depends on the characteristic $p$ and the
degree $n\geq 1$ of the finite field $\mathbb{F}_{p^n}$. In this paper, we make
a similar study of the geometry over finite fields of the quadratic curves
defined by the quadratic equations in two variables for the classical conic
sections. In particular the quadratic equation with mixed term is interesting,
and our results display a rich variety of possibilities for the number of
solutions to this equation over a finite field.
| math.NT | the geometry of algebraic curves over finite fields is a rich area of research in previous work the authors investigated a particular aspect of the geometry over finite fields of the classical unit circle namely how the number of solutions of the circle equation depends on the characteristic p and the degree ngeq 1 of the finite field mathbbf_pn in this paper we make a similar study of the geometry over finite fields of the quadratic curves defined by the quadratic equations in two variables for the classical conic sections in particular the quadratic equation with mixed term is interesting and our results display a rich variety of possibilities for the number of solutions to this equation over a finite field | [['the', 'geometry', 'of', 'algebraic', 'curves', 'over', 'finite', 'fields', 'is', 'a', 'rich', 'area', 'of', 'research', 'in', 'previous', 'work', 'the', 'authors', 'investigated', 'a', 'particular', 'aspect', 'of', 'the', 'geometry', 'over', 'finite', 'fields', 'of', 'the', 'classical', 'unit', 'circle', 'namely', 'how', 'the', 'number', 'of', 'solutions', 'of', 'the', 'circle', 'equation', 'depends', 'on', 'the', 'characteristic', 'p', 'and', 'the', 'degree', 'ngeq', '1', 'of', 'the', 'finite', 'field', 'mathbbf_pn', 'in', 'this', 'paper', 'we', 'make', 'a', 'similar', 'study', 'of', 'the', 'geometry', 'over', 'finite', 'fields', 'of', 'the', 'quadratic', 'curves', 'defined', 'by', 'the', 'quadratic', 'equations', 'in', 'two', 'variables', 'for', 'the', 'classical', 'conic', 'sections', 'in', 'particular', 'the', 'quadratic', 'equation', 'with', 'mixed', 'term', 'is', 'interesting', 'and', 'our', 'results', 'display', 'a', 'rich', 'variety', 'of', 'possibilities', 'for', 'the', 'number', 'of', 'solutions', 'to', 'this', 'equation', 'over', 'a', 'finite', 'field']] | [-0.190729333778597, 0.08298894674093886, -0.10031449032008402, 0.01948974380839216, -0.07937429843024035, -0.08468313285434419, 0.0005332379965573426, 0.27999488963199054, -0.296614763100366, -0.2600859769827817, 0.08346414971088391, -0.25642396235638415, -0.15078836168385734, 0.2537880002728794, -0.06848645165684336, 0.024823375954485135, -0.011782291075907463, 0.0957170915866871, -0.09550447341762791, -0.32359589913413545, 0.3792634977658918, -0.047618825635141575, 0.2392393958269934, 0.042124625911151084, 0.1380716278025311, 0.03695627029846646, -0.015440463292420157, 0.07470244708016885, -0.15837390413738725, 0.1403299073942683, 0.25249046804614306, 0.08052632356185682, 0.2651868076679443, -0.391769771271747, -0.23252082485243802, 0.13583416216583413, 0.12374843061278182, 0.0767476238572031, -0.04301605273657748, -0.20342908399025642, 0.09138125078733395, -0.12364457250865704, -0.1769324436375856, -0.0076466276241112345, 0.05089482412026995, 0.08042785376387317, -0.20350292810885437, 0.016538980524709895, 0.097260843289916, 0.14299229226914073, -0.08853579706065973, -0.10886190983963252, 0.021154450624026665, 0.06978104874291573, 0.061102003115036885, 0.04376606327820231, 0.03715558872319573, -0.15930456983325772, -0.09502091505064451, 0.35298128273676743, -0.08821962837684007, -0.2343246130184232, 0.1468157172203064, -0.1816507476412745, -0.09598057072086275, 0.13184562723406337, 0.20495724390945896, 0.18546927929663462, -0.08594545571918576, 0.2094510108538449, -0.09596554647499989, 0.13067746487607765, 0.05753097392249206, -0.0056000707867316715, 0.15584003949953504, 0.10118131043604953, 0.06582980651470009, 0.15005070089039294, -0.040832306791389404, -0.15554944113327945, -0.34948123472719644, -0.18341161201761896, -0.1375594451977325, 0.08174573113730038, -0.1342678628012842, -0.19954642730818922, 0.45686879550099124, 0.06963924559753018, 0.1895733754504626, 0.038717016685476974, 0.24587184466298453, 0.12711998167320748, 0.05062444466512558, 0.03084919677877968, 0.16800398430363697, 0.18645408260251187, 0.06287357132604793, -0.20788161979203135, -0.018487661903770256, 0.06023728015663272] |
1,802.10487 | Goal-oriented adaptive surrogate construction for stochastic inversion | Stochastic inverse problems are generally solved by some form of finite
sampling of a space of uncertain parameters. For computationally expensive
models, surrogate response surfaces are often employed to increase the number
of samples used in approximating the solution. The result is generally a trade
off in errors where the stochastic error is reduced at the cost of an increase
in deterministic/discretization errors in the evaluation of the surrogate. Such
stochastic errors pollute predictions based on the stochastic inverse. In this
work, we formulate a method for adaptively creating a special class of
surrogate response surfaces with this stochastic error in mind. Adjoint
techniques are used to enhance the local approximation properties of the
surrogate allowing the construction of a higher-level enhanced surrogate. Using
these two levels of surrogates, appropriately derived local error indicators
are computed and used to guide refinement of both levels of the surrogates.
Three types of refinement strategies are presented and combined in an iterative
adaptive surrogate construction algorithm. Numerical examples, including a
complex vibroacoustics application, demonstrate how this adaptive strategy
allows for accurate predictions under uncertainty for a much smaller
computational cost than uniform refinement.
| math.NA | stochastic inverse problems are generally solved by some form of finite sampling of a space of uncertain parameters for computationally expensive models surrogate response surfaces are often employed to increase the number of samples used in approximating the solution the result is generally a trade off in errors where the stochastic error is reduced at the cost of an increase in deterministicdiscretization errors in the evaluation of the surrogate such stochastic errors pollute predictions based on the stochastic inverse in this work we formulate a method for adaptively creating a special class of surrogate response surfaces with this stochastic error in mind adjoint techniques are used to enhance the local approximation properties of the surrogate allowing the construction of a higherlevel enhanced surrogate using these two levels of surrogates appropriately derived local error indicators are computed and used to guide refinement of both levels of the surrogates three types of refinement strategies are presented and combined in an iterative adaptive surrogate construction algorithm numerical examples including a complex vibroacoustics application demonstrate how this adaptive strategy allows for accurate predictions under uncertainty for a much smaller computational cost than uniform refinement | [['stochastic', 'inverse', 'problems', 'are', 'generally', 'solved', 'by', 'some', 'form', 'of', 'finite', 'sampling', 'of', 'a', 'space', 'of', 'uncertain', 'parameters', 'for', 'computationally', 'expensive', 'models', 'surrogate', 'response', 'surfaces', 'are', 'often', 'employed', 'to', 'increase', 'the', 'number', 'of', 'samples', 'used', 'in', 'approximating', 'the', 'solution', 'the', 'result', 'is', 'generally', 'a', 'trade', 'off', 'in', 'errors', 'where', 'the', 'stochastic', 'error', 'is', 'reduced', 'at', 'the', 'cost', 'of', 'an', 'increase', 'in', 'deterministicdiscretization', 'errors', 'in', 'the', 'evaluation', 'of', 'the', 'surrogate', 'such', 'stochastic', 'errors', 'pollute', 'predictions', 'based', 'on', 'the', 'stochastic', 'inverse', 'in', 'this', 'work', 'we', 'formulate', 'a', 'method', 'for', 'adaptively', 'creating', 'a', 'special', 'class', 'of', 'surrogate', 'response', 'surfaces', 'with', 'this', 'stochastic', 'error', 'in', 'mind', 'adjoint', 'techniques', 'are', 'used', 'to', 'enhance', 'the', 'local', 'approximation', 'properties', 'of', 'the', 'surrogate', 'allowing', 'the', 'construction', 'of', 'a', 'higherlevel', 'enhanced', 'surrogate', 'using', 'these', 'two', 'levels', 'of', 'surrogates', 'appropriately', 'derived', 'local', 'error', 'indicators', 'are', 'computed', 'and', 'used', 'to', 'guide', 'refinement', 'of', 'both', 'levels', 'of', 'the', 'surrogates', 'three', 'types', 'of', 'refinement', 'strategies', 'are', 'presented', 'and', 'combined', 'in', 'an', 'iterative', 'adaptive', 'surrogate', 'construction', 'algorithm', 'numerical', 'examples', 'including', 'a', 'complex', 'vibroacoustics', 'application', 'demonstrate', 'how', 'this', 'adaptive', 'strategy', 'allows', 'for', 'accurate', 'predictions', 'under', 'uncertainty', 'for', 'a', 'much', 'smaller', 'computational', 'cost', 'than', 'uniform', 'refinement']] | [-0.039599219773201244, 0.041332670242467735, -0.0701727640282895, 0.14214428377931534, -0.05287662715769358, -0.12654114735100871, 0.06581625809015894, 0.3825729362193554, -0.29316655995580493, -0.3287363894611459, 0.1290980807090395, -0.21981170450014778, -0.16948147462163535, 0.2343084564107278, -0.11344293860974845, 0.12743341739082503, 0.06228055748300104, -0.021517116890569763, -0.11155738466155651, -0.2698689716425848, 0.27649349019192554, 0.09153791926012783, 0.2671015465819331, -0.048928964276066314, 0.10842180157218266, -0.0010333772115507928, -0.06742898729647061, 0.046870330326282544, -0.10261911205287097, 0.18056319515521407, 0.27410443200294077, 0.12792139256215362, 0.345243755195822, -0.4556942024174585, -0.20884451098283063, 0.09828740796296015, 0.11285755952013898, 0.12412956637045783, -0.044218350533844424, -0.2200063656641062, 0.06176915846114594, -0.17129030984348406, -0.10175519499917904, -0.10704274299165244, -0.04810217224928753, 0.06360288037026607, -0.3663233390186357, 0.05529715779740068, 0.030590725946856082, 0.06743293220088595, -0.04345500662401762, -0.1412197837665204, 0.01851168980516454, 0.10906439045907329, 0.018004417143486166, 0.01041428122432932, 0.13188916643177254, -0.10493135110908755, -0.10669157411607486, 0.35988395685307245, -0.04876233202877403, -0.28355137160954574, 0.16716824891661644, -0.03505052007715065, -0.12518684206550162, 0.17351598580393734, 0.23300140919705864, 0.14257048920693774, -0.14582110573808668, 0.03746137684445197, 0.03418591323865469, 0.1511977528549593, 0.028022197575342876, 0.004680512699658278, 0.11204750416184425, 0.19800498757866167, 0.09775725341150684, 0.14504810249452632, -0.061822188065865286, -0.10644590675894901, -0.29007488967747325, -0.12500003200828494, -0.1708560087028201, -0.015758772516159942, -0.12349648108670769, -0.1743675566145352, 0.3540277714661209, 0.161142177012547, 0.16771918184138715, 0.09345302541577627, 0.32469831211935907, 0.13674248186575752, 0.040828269679670924, 0.061515169829209015, 0.19627119671499785, 0.08621548479004078, 0.040509147623741124, -0.2205727869175404, 0.12104913339551006, 0.10256946049187154] |
1,802.10488 | An Approximate Pareto Set for Minimizing the Maximum Lateness and
Makespan on Parallel Machines | We consider the two-parallel machines scheduling problem, with the aim of
minimizing the maximum lateness and the makespan. Formally, the problem is
defined as follows. We have to schedule a set J of n jobs on two identical
machines. Each job i in J has a processing time p_i and a delivery time q_i.
Each machine can only perform one job at a given time. The machines are
available at time t=0 and each of them can process at most one job at a given
time. The problem is to find a sequence of jobs, with the objective of
minimizing the maximum lateness L_max and the makespan C_max. With no loss of
generality, we consider that all data are integers and that jobs are indexed in
non-increasing order of their delivery times: q_1 >= q_2 >= ... >= q_n. This
paper proposes an exact algorithm (based on a dynamic programming) to generate
the complete Pareto Frontier in a pseudo-polynomial time. Then, we present an
FPTAS (Fully Polynomial Time Approximation Scheme) to generate an approximate
Pareto Frontier, based on the conversion of the dynamic programming. The
proposed FPTAS is strongly polynomial. Some numerical experiments are provided
in order to compare the two proposed approaches.
| cs.DS | we consider the twoparallel machines scheduling problem with the aim of minimizing the maximum lateness and the makespan formally the problem is defined as follows we have to schedule a set j of n jobs on two identical machines each job i in j has a processing time p_i and a delivery time q_i each machine can only perform one job at a given time the machines are available at time t0 and each of them can process at most one job at a given time the problem is to find a sequence of jobs with the objective of minimizing the maximum lateness l_max and the makespan c_max with no loss of generality we consider that all data are integers and that jobs are indexed in nonincreasing order of their delivery times q_1 q_2 q_n this paper proposes an exact algorithm based on a dynamic programming to generate the complete pareto frontier in a pseudopolynomial time then we present an fptas fully polynomial time approximation scheme to generate an approximate pareto frontier based on the conversion of the dynamic programming the proposed fptas is strongly polynomial some numerical experiments are provided in order to compare the two proposed approaches | [['we', 'consider', 'the', 'twoparallel', 'machines', 'scheduling', 'problem', 'with', 'the', 'aim', 'of', 'minimizing', 'the', 'maximum', 'lateness', 'and', 'the', 'makespan', 'formally', 'the', 'problem', 'is', 'defined', 'as', 'follows', 'we', 'have', 'to', 'schedule', 'a', 'set', 'j', 'of', 'n', 'jobs', 'on', 'two', 'identical', 'machines', 'each', 'job', 'i', 'in', 'j', 'has', 'a', 'processing', 'time', 'p_i', 'and', 'a', 'delivery', 'time', 'q_i', 'each', 'machine', 'can', 'only', 'perform', 'one', 'job', 'at', 'a', 'given', 'time', 'the', 'machines', 'are', 'available', 'at', 'time', 't0', 'and', 'each', 'of', 'them', 'can', 'process', 'at', 'most', 'one', 'job', 'at', 'a', 'given', 'time', 'the', 'problem', 'is', 'to', 'find', 'a', 'sequence', 'of', 'jobs', 'with', 'the', 'objective', 'of', 'minimizing', 'the', 'maximum', 'lateness', 'l_max', 'and', 'the', 'makespan', 'c_max', 'with', 'no', 'loss', 'of', 'generality', 'we', 'consider', 'that', 'all', 'data', 'are', 'integers', 'and', 'that', 'jobs', 'are', 'indexed', 'in', 'nonincreasing', 'order', 'of', 'their', 'delivery', 'times', 'q_1', 'q_2', 'q_n', 'this', 'paper', 'proposes', 'an', 'exact', 'algorithm', 'based', 'on', 'a', 'dynamic', 'programming', 'to', 'generate', 'the', 'complete', 'pareto', 'frontier', 'in', 'a', 'pseudopolynomial', 'time', 'then', 'we', 'present', 'an', 'fptas', 'fully', 'polynomial', 'time', 'approximation', 'scheme', 'to', 'generate', 'an', 'approximate', 'pareto', 'frontier', 'based', 'on', 'the', 'conversion', 'of', 'the', 'dynamic', 'programming', 'the', 'proposed', 'fptas', 'is', 'strongly', 'polynomial', 'some', 'numerical', 'experiments', 'are', 'provided', 'in', 'order', 'to', 'compare', 'the', 'two', 'proposed', 'approaches']] | [-0.17621141718230163, 0.07192177436926879, -0.07340999402933651, 0.026943216850907108, -0.082829229135626, -0.16588377291242581, 0.07816179488983119, 0.4126271273225847, -0.2988702834970694, -0.3082723352079741, 0.08881120440653628, -0.2875565947174574, -0.0671424991274817, 0.1379838576352205, -0.04923052407067382, 0.11231532547919248, 0.05339854566563824, 0.07786850978601535, -0.026994538312363956, -0.34886140924539755, 0.25537380671852994, 0.013011369930352132, 0.24630617899167578, 0.03059550002687658, 0.12255830985889064, 0.0037021452579835447, -0.002913766498254104, -0.0011627118884011954, -0.14510934938586403, 0.0730157724312375, 0.2941225531482787, 0.2220451146472396, 0.35579659978416983, -0.41571571559861603, -0.09215491628180249, 0.16717548289975961, 0.12320521512101734, 0.029441186368013874, 0.013303139479242904, -0.16968418844514574, 0.10145136174355456, -0.11641644125726695, -0.04050597403847584, -0.026060442303805942, 0.03897800666957416, 0.045078976991741605, -0.33106428215449507, 0.006963306335929894, 0.023295324453331455, 0.0012466105235025588, -0.07546246941248426, -0.14355262609038766, 0.04465441872610362, 0.08836999922906133, 0.019488550623675403, 0.0890987763849247, 0.05872022442406777, -0.08555689515284912, -0.19211623895057298, 0.42579254284595147, -0.02303837345221616, -0.2039858165215889, 0.1351128820767344, -0.0793821630903021, -0.15119300126521426, 0.11870673255444589, 0.20348811342917156, 0.15303842088259342, -0.15547615136819506, 0.0702431516582499, -0.048609200922649996, 0.14140055242530775, 0.07882281726183878, -0.018807663747481062, 0.13526060744047616, 0.18591681729315432, 0.12491184307939628, 0.14348746226122133, -0.029830604996396972, -0.0905703441874886, -0.2887761861725588, -0.1562964545058397, -0.24135899246550363, -0.004347609505386591, -0.09462732544856445, -0.12668921381724302, 0.390204907417931, 0.13312933468871346, 0.19050435173899086, 0.19498519050992197, 0.31535690822497464, 0.16366246823849676, 0.021785321385562044, 0.17944854464822313, 0.12098771057898917, 0.005878918336215194, 0.1029652629466257, -0.23391493689033646, 0.08925264623989775, 0.06474123000828173] |
1,802.10489 | As you like it: Localization via paired comparisons | Suppose that we wish to estimate a vector $\mathbf{x}$ from a set of binary
paired comparisons of the form "$\mathbf{x}$ is closer to $\mathbf{p}$ than to
$\mathbf{q}$" for various choices of vectors $\mathbf{p}$ and $\mathbf{q}$. The
problem of estimating $\mathbf{x}$ from this type of observation arises in a
variety of contexts, including nonmetric multidimensional scaling, "unfolding,"
and ranking problems, often because it provides a powerful and flexible model
of preference. We describe theoretical bounds for how well we can expect to
estimate $\mathbf{x}$ under a randomized model for $\mathbf{p}$ and
$\mathbf{q}$. We also present results for the case where the comparisons are
noisy and subject to some degree of error. Additionally, we show that under a
randomized model for $\mathbf{p}$ and $\mathbf{q}$, a suitable number of binary
paired comparisons yield a stable embedding of the space of target vectors.
Finally, we also show that we can achieve significant gains by adaptively
changing the distribution for choosing $\mathbf{p}$ and $\mathbf{q}$.
| stat.ML cs.LG | suppose that we wish to estimate a vector mathbfx from a set of binary paired comparisons of the form mathbfx is closer to mathbfp than to mathbfq for various choices of vectors mathbfp and mathbfq the problem of estimating mathbfx from this type of observation arises in a variety of contexts including nonmetric multidimensional scaling unfolding and ranking problems often because it provides a powerful and flexible model of preference we describe theoretical bounds for how well we can expect to estimate mathbfx under a randomized model for mathbfp and mathbfq we also present results for the case where the comparisons are noisy and subject to some degree of error additionally we show that under a randomized model for mathbfp and mathbfq a suitable number of binary paired comparisons yield a stable embedding of the space of target vectors finally we also show that we can achieve significant gains by adaptively changing the distribution for choosing mathbfp and mathbfq | [['suppose', 'that', 'we', 'wish', 'to', 'estimate', 'a', 'vector', 'mathbfx', 'from', 'a', 'set', 'of', 'binary', 'paired', 'comparisons', 'of', 'the', 'form', 'mathbfx', 'is', 'closer', 'to', 'mathbfp', 'than', 'to', 'mathbfq', 'for', 'various', 'choices', 'of', 'vectors', 'mathbfp', 'and', 'mathbfq', 'the', 'problem', 'of', 'estimating', 'mathbfx', 'from', 'this', 'type', 'of', 'observation', 'arises', 'in', 'a', 'variety', 'of', 'contexts', 'including', 'nonmetric', 'multidimensional', 'scaling', 'unfolding', 'and', 'ranking', 'problems', 'often', 'because', 'it', 'provides', 'a', 'powerful', 'and', 'flexible', 'model', 'of', 'preference', 'we', 'describe', 'theoretical', 'bounds', 'for', 'how', 'well', 'we', 'can', 'expect', 'to', 'estimate', 'mathbfx', 'under', 'a', 'randomized', 'model', 'for', 'mathbfp', 'and', 'mathbfq', 'we', 'also', 'present', 'results', 'for', 'the', 'case', 'where', 'the', 'comparisons', 'are', 'noisy', 'and', 'subject', 'to', 'some', 'degree', 'of', 'error', 'additionally', 'we', 'show', 'that', 'under', 'a', 'randomized', 'model', 'for', 'mathbfp', 'and', 'mathbfq', 'a', 'suitable', 'number', 'of', 'binary', 'paired', 'comparisons', 'yield', 'a', 'stable', 'embedding', 'of', 'the', 'space', 'of', 'target', 'vectors', 'finally', 'we', 'also', 'show', 'that', 'we', 'can', 'achieve', 'significant', 'gains', 'by', 'adaptively', 'changing', 'the', 'distribution', 'for', 'choosing', 'mathbfp', 'and', 'mathbfq']] | [-0.11153738857715526, 0.08460852401565362, -0.07030395899588864, 0.08607710067639654, -0.09729097181134536, -0.14818332113000512, 0.08986854319074103, 0.39932997290443323, -0.32286553745562174, -0.25729334245453467, 0.043719250485506025, -0.2778236666436559, -0.17279821086408417, 0.21657469505649177, -0.06914259239287356, 0.04657545001041027, 0.07386099679085116, 0.08292537455523163, -0.11078034664149859, -0.23273986594461538, 0.3389385296258806, -0.004977389007408476, 0.2328936698313498, -0.04371304264798784, 0.1333991639849103, 0.06133780994235813, 0.009452430384948194, 0.047591689268072904, -0.1304586569817701, 0.14295850740526012, 0.28039544043438686, 0.15893223635638543, 0.2806613530741079, -0.3693924883611899, -0.16892039804549525, 0.15860903315808414, 0.11535444021453413, 0.10598418992247034, -0.02897673318932805, -0.23448948680464202, 0.14352653018321912, -0.1460682198767874, -0.07696285193094855, -0.10889773924963889, 0.013926154535202274, 0.04898568901010795, -0.39048615386182406, 0.043119169267570985, 0.07199410856452496, 0.014706788400082656, -0.07477145417118972, -0.1636528950228514, 0.025500168375899347, 0.09747168554121968, 0.053488506398854906, 0.0875459839692398, 0.06203874006117665, -0.1187221311931879, -0.09512711548884897, 0.3787579629400016, -0.05908909876350937, -0.27131833270801314, 0.14877232644742108, -0.12085290788819299, -0.11311786520329989, 0.06988229021880667, 0.2165871460800522, 0.10689436483970087, -0.08969542962270526, 0.07244942904890767, -0.10570252964964265, 0.16929202252536216, 0.0409500827535448, 0.014201168410198868, 0.15847615483831964, 0.12507368153277434, 0.08544775378251881, 0.12886208102089475, -0.11286874737813131, -0.0675534198892379, -0.30269494728161805, -0.14067359440762303, -0.17260549521167418, 0.06849841538629255, -0.11572046781410156, -0.13154794125738642, 0.36312489648519447, 0.19788414229925885, 0.26110258102768436, 0.09173610559283937, 0.23678297612160068, 0.07535297753746584, -0.018749933426250826, 0.07548290178613187, 0.15247629032673096, 0.10898340446435197, 0.012407314360329191, -0.14963898985535376, 0.09479660175758291, -0.0006782272654884266] |
1,802.1049 | Partial Identification of Expectations with Interval Data | A conditional expectation function (CEF) can at best be partially identified
when the conditioning variable is interval censored. When the number of bins is
small, existing methods often yield minimally informative bounds. We propose
three innovations that make meaningful inference possible in interval data
contexts. First, we prove novel nonparametric bounds for contexts where the
distribution of the censored variable is known. Second, we show that a class of
measures that describe the conditional mean across a fixed interval of the
conditioning space can often be bounded tightly even when the CEF itself
cannot. Third, we show that a constraint on CEF curvature can either tighten
bounds or can substitute for the monotonicity assumption often made in interval
data applications. We derive analytical bounds that use the first two
innovations, and develop a numerical method to calculate bounds under the
third. We show the performance of the method in simulations and then present
two applications. First, we resolve a known problem in the estimation of
mortality as a function of education: because individuals with high school or
less are a smaller and thus more negatively selected group over time, estimates
of their mortality change are likely to be biased. Our method makes it possible
to hold education rank bins constant over time, revealing that current
estimates of rising mortality for less educated women are biased upward in some
cases by a factor of three. Second, we apply the method to the estimation of
intergenerational mobility, where researchers frequently use coarsely measured
education data in the many contexts where matched parent-child income data are
unavailable. Conventional measures like the rank-rank correlation may be
uninformative once interval censoring is taken into account; CEF interval-based
measures of mobility are bounded tightly.
| econ.EM stat.AP stat.ME | a conditional expectation function cef can at best be partially identified when the conditioning variable is interval censored when the number of bins is small existing methods often yield minimally informative bounds we propose three innovations that make meaningful inference possible in interval data contexts first we prove novel nonparametric bounds for contexts where the distribution of the censored variable is known second we show that a class of measures that describe the conditional mean across a fixed interval of the conditioning space can often be bounded tightly even when the cef itself cannot third we show that a constraint on cef curvature can either tighten bounds or can substitute for the monotonicity assumption often made in interval data applications we derive analytical bounds that use the first two innovations and develop a numerical method to calculate bounds under the third we show the performance of the method in simulations and then present two applications first we resolve a known problem in the estimation of mortality as a function of education because individuals with high school or less are a smaller and thus more negatively selected group over time estimates of their mortality change are likely to be biased our method makes it possible to hold education rank bins constant over time revealing that current estimates of rising mortality for less educated women are biased upward in some cases by a factor of three second we apply the method to the estimation of intergenerational mobility where researchers frequently use coarsely measured education data in the many contexts where matched parentchild income data are unavailable conventional measures like the rankrank correlation may be uninformative once interval censoring is taken into account cef intervalbased measures of mobility are bounded tightly | [['a', 'conditional', 'expectation', 'function', 'cef', 'can', 'at', 'best', 'be', 'partially', 'identified', 'when', 'the', 'conditioning', 'variable', 'is', 'interval', 'censored', 'when', 'the', 'number', 'of', 'bins', 'is', 'small', 'existing', 'methods', 'often', 'yield', 'minimally', 'informative', 'bounds', 'we', 'propose', 'three', 'innovations', 'that', 'make', 'meaningful', 'inference', 'possible', 'in', 'interval', 'data', 'contexts', 'first', 'we', 'prove', 'novel', 'nonparametric', 'bounds', 'for', 'contexts', 'where', 'the', 'distribution', 'of', 'the', 'censored', 'variable', 'is', 'known', 'second', 'we', 'show', 'that', 'a', 'class', 'of', 'measures', 'that', 'describe', 'the', 'conditional', 'mean', 'across', 'a', 'fixed', 'interval', 'of', 'the', 'conditioning', 'space', 'can', 'often', 'be', 'bounded', 'tightly', 'even', 'when', 'the', 'cef', 'itself', 'can', 'not', 'third', 'we', 'show', 'that', 'a', 'constraint', 'on', 'cef', 'curvature', 'can', 'either', 'tighten', 'bounds', 'or', 'can', 'substitute', 'for', 'the', 'monotonicity', 'assumption', 'often', 'made', 'in', 'interval', 'data', 'applications', 'we', 'derive', 'analytical', 'bounds', 'that', 'use', 'the', 'first', 'two', 'innovations', 'and', 'develop', 'a', 'numerical', 'method', 'to', 'calculate', 'bounds', 'under', 'the', 'third', 'we', 'show', 'the', 'performance', 'of', 'the', 'method', 'in', 'simulations', 'and', 'then', 'present', 'two', 'applications', 'first', 'we', 'resolve', 'a', 'known', 'problem', 'in', 'the', 'estimation', 'of', 'mortality', 'as', 'a', 'function', 'of', 'education', 'because', 'individuals', 'with', 'high', 'school', 'or', 'less', 'are', 'a', 'smaller', 'and', 'thus', 'more', 'negatively', 'selected', 'group', 'over', 'time', 'estimates', 'of', 'their', 'mortality', 'change', 'are', 'likely', 'to', 'be', 'biased', 'our', 'method', 'makes', 'it', 'possible', 'to', 'hold', 'education', 'rank', 'bins', 'constant', 'over', 'time', 'revealing', 'that', 'current', 'estimates', 'of', 'rising', 'mortality', 'for', 'less', 'educated', 'women', 'are', 'biased', 'upward', 'in', 'some', 'cases', 'by', 'a', 'factor', 'of', 'three', 'second', 'we', 'apply', 'the', 'method', 'to', 'the', 'estimation', 'of', 'intergenerational', 'mobility', 'where', 'researchers', 'frequently', 'use', 'coarsely', 'measured', 'education', 'data', 'in', 'the', 'many', 'contexts', 'where', 'matched', 'parentchild', 'income', 'data', 'are', 'unavailable', 'conventional', 'measures', 'like', 'the', 'rankrank', 'correlation', 'may', 'be', 'uninformative', 'once', 'interval', 'censoring', 'is', 'taken', 'into', 'account', 'cef', 'intervalbased', 'measures', 'of', 'mobility', 'are', 'bounded', 'tightly']] | [-0.06582574047604221, 0.1262932275470256, -0.07242008410136386, 0.13646949239149303, -0.11028506824098991, -0.15577896512705658, 0.0761133165535385, 0.40970361990061394, -0.24906725629601809, -0.3176213614046445, 0.13853912882645417, -0.264362426941963, -0.10260112931513611, 0.2076855310727117, -0.12173228905533012, 0.015628298470238063, 0.06011263000622559, 0.06273419618490556, -0.058323937092801384, -0.318793701646031, 0.2892949715052058, 0.0018579582297033712, 0.28049197373106094, 0.035574052260687515, 0.08041317495726899, -0.011313176327175541, -0.04568109319264965, 0.037236973302862374, -0.12161290202974415, 0.12689381743705538, 0.28501411082519534, 0.14412452048415827, 0.3535779549202086, -0.38506196835803375, -0.20689321970236793, 0.1374159178198686, 0.14400012026038214, 0.09203714740085561, -0.006442692974160561, -0.2716295047821058, 0.07608733583357713, -0.16134129732421834, -0.06967220017058086, -0.08860083357157077, -0.026857357997862964, 0.024649617068830454, -0.3247668480542472, 0.10427200417179344, 0.019879054790322433, 0.04366375309669745, -0.050514907671209544, -0.15203108023981013, -0.00765673318639346, 0.13068381342884824, 0.08780492217018943, 0.0019821697271229202, 0.11129687681784499, -0.09224492181285855, -0.10541953668171528, 0.3452348196782352, -0.05021634004175483, -0.22528297100119474, 0.13612082267843129, -0.17399990316448172, -0.16452702499642505, 0.08946159668427901, 0.19342144087615992, 0.11416906733314586, -0.16445346154383533, 0.034802723006678866, -0.03528766396413573, 0.17573352738132114, 0.0489171451694013, 0.001771631488692544, 0.16595614707189255, 0.12899846750413063, 0.11808747418364188, 0.10679392436814131, -0.08560590612521608, -0.07453026254677494, -0.2804329570924225, -0.12107633637541512, -0.18641494691555605, -0.0006987400421736581, -0.109829969941866, -0.1779126417271271, 0.35291771648393677, 0.17290418031488491, 0.19101749016229824, 0.09825335547179355, 0.29736645362794295, 0.12436278695949582, 0.049192572865718945, 0.09253228230524331, 0.1726915507604953, 0.06980285870803965, 0.05249770505113727, -0.13115007435169013, 0.1470852552213832, 0.012198952020723599] |
1,802.10491 | Exact Controllability of linear KP-I equation | We prove the exact controllability of linear KP-I equation if the control
input is added on a vertical domain. More generally, we have obtained the least
dispersion needed to insure observability for fractional linear KP I equation.
| math.AP | we prove the exact controllability of linear kpi equation if the control input is added on a vertical domain more generally we have obtained the least dispersion needed to insure observability for fractional linear kp i equation | [['we', 'prove', 'the', 'exact', 'controllability', 'of', 'linear', 'kpi', 'equation', 'if', 'the', 'control', 'input', 'is', 'added', 'on', 'a', 'vertical', 'domain', 'more', 'generally', 'we', 'have', 'obtained', 'the', 'least', 'dispersion', 'needed', 'to', 'insure', 'observability', 'for', 'fractional', 'linear', 'kp', 'i', 'equation']] | [-0.1780238119174248, 0.038459785735687695, -0.08053860294859151, 0.08673055345708555, -0.14863727430536136, -0.19390939562455625, -0.01767318308152057, 0.3175527179311659, -0.3211694119649159, -0.22613646079962318, 0.11357961851801421, -0.2845953361735352, -0.11275093010752588, 0.1455254429775114, -0.011979716678930295, 0.1415045394537014, 0.062484624116001905, 0.04791332332014635, -0.07657647903102476, -0.23408943485795847, 0.2911807446539201, -0.07675858612197477, 0.17972015164087754, -0.006885910671002962, 0.13165468614347078, 0.005634704969722677, -0.023464520184977633, 0.025990497270548665, -0.20201524631497828, 0.09238211152370314, 0.22597480102165327, 0.08404310973285622, 0.2740158391361301, -0.4370198105336041, -0.1682266494561289, 0.1222461323329323, 0.13786457770982305, 0.125758982565556, -0.0045571902950099245, -0.29062600806355476, 0.15226506636905912, -0.10024217989396404, -0.18903430888580308, -0.04374770757213638, 0.05711257920877354, 0.040700175195328286, -0.28389889409614577, 0.10784096905105822, 0.06308102947533936, 0.029193871075639855, -0.12438893187287692, -0.1554279377734339, -0.11340281392472822, 0.025479647721088416, -0.0017215371748583543, -0.024208315962774528, 0.00539091627138692, -0.10968169810351085, -0.035563847251437804, 0.36894637404160724, -0.0809379725943546, -0.3239385802550493, 0.12277109737231119, -0.13624367251287442, -0.10694559757924967, 0.10702606066558007, 0.16765290790715734, 0.05753359797637205, -0.13950395813476094, 0.08990679807155519, -0.061898792955420306, 0.24118442204151605, 0.08504981081932783, 0.028769036150864652, 0.07246348654498926, 0.17085022246465087, 0.19062819196590902, 0.08917198097333312, -0.030767873797968432, -0.05407611670828349, -0.3409718697940981, -0.13966470401155184, -0.13246102369314916, 0.10831642138293467, -0.0720784831729189, -0.11772536979736509, 0.3673869315031412, 0.1588710680402614, 0.13526922655669418, 0.09142166232639873, 0.259548498166574, 0.2990921989737733, 0.015807084437157656, 0.10572740003919683, 0.2265092769788729, 0.20234509124546438, 0.12016970655452963, -0.28760229153055195, 0.055976933006801316, 0.09539566395451894] |
1,802.10492 | Multicompartment Magnetic Resonance Fingerprinting | Magnetic resonance fingerprinting (MRF) is a technique for quantitative
estimation of spin-relaxation parameters from magnetic-resonance data. Most
current MRF approaches assume that only one tissue is present in each voxel,
which neglects the tissue's microstructure, and may lead to artifacts in the
recovered parameter maps at boundaries between tissues. In this work, we
propose a multicompartment MRF model that accounts for the presence of multiple
tissues per voxel. The model is fit to the data by iteratively solving a sparse
linear inverse problem at each voxel, in order to express the magnetization
signal as a linear combination of a few fingerprints in the precomputed
dictionary. Thresholding-based methods commonly used for sparse recovery and
compressed sensing do not perform well in this setting due to the high local
coherence of the dictionary. Instead, we solve this challenging sparse-recovery
problem by applying reweighted-l1-norm regularization, implemented using an
efficient interior-point method. The proposed approach is validated with
simulated data at different noise levels and undersampling factors, as well as
with a controlled phantom imaging experiment on a clinical magnetic-resonance
system.
| physics.med-ph cs.NA math.NA math.OC | magnetic resonance fingerprinting mrf is a technique for quantitative estimation of spinrelaxation parameters from magneticresonance data most current mrf approaches assume that only one tissue is present in each voxel which neglects the tissues microstructure and may lead to artifacts in the recovered parameter maps at boundaries between tissues in this work we propose a multicompartment mrf model that accounts for the presence of multiple tissues per voxel the model is fit to the data by iteratively solving a sparse linear inverse problem at each voxel in order to express the magnetization signal as a linear combination of a few fingerprints in the precomputed dictionary thresholdingbased methods commonly used for sparse recovery and compressed sensing do not perform well in this setting due to the high local coherence of the dictionary instead we solve this challenging sparserecovery problem by applying reweightedl1norm regularization implemented using an efficient interiorpoint method the proposed approach is validated with simulated data at different noise levels and undersampling factors as well as with a controlled phantom imaging experiment on a clinical magneticresonance system | [['magnetic', 'resonance', 'fingerprinting', 'mrf', 'is', 'a', 'technique', 'for', 'quantitative', 'estimation', 'of', 'spinrelaxation', 'parameters', 'from', 'magneticresonance', 'data', 'most', 'current', 'mrf', 'approaches', 'assume', 'that', 'only', 'one', 'tissue', 'is', 'present', 'in', 'each', 'voxel', 'which', 'neglects', 'the', 'tissues', 'microstructure', 'and', 'may', 'lead', 'to', 'artifacts', 'in', 'the', 'recovered', 'parameter', 'maps', 'at', 'boundaries', 'between', 'tissues', 'in', 'this', 'work', 'we', 'propose', 'a', 'multicompartment', 'mrf', 'model', 'that', 'accounts', 'for', 'the', 'presence', 'of', 'multiple', 'tissues', 'per', 'voxel', 'the', 'model', 'is', 'fit', 'to', 'the', 'data', 'by', 'iteratively', 'solving', 'a', 'sparse', 'linear', 'inverse', 'problem', 'at', 'each', 'voxel', 'in', 'order', 'to', 'express', 'the', 'magnetization', 'signal', 'as', 'a', 'linear', 'combination', 'of', 'a', 'few', 'fingerprints', 'in', 'the', 'precomputed', 'dictionary', 'thresholdingbased', 'methods', 'commonly', 'used', 'for', 'sparse', 'recovery', 'and', 'compressed', 'sensing', 'do', 'not', 'perform', 'well', 'in', 'this', 'setting', 'due', 'to', 'the', 'high', 'local', 'coherence', 'of', 'the', 'dictionary', 'instead', 'we', 'solve', 'this', 'challenging', 'sparserecovery', 'problem', 'by', 'applying', 'reweightedl1norm', 'regularization', 'implemented', 'using', 'an', 'efficient', 'interiorpoint', 'method', 'the', 'proposed', 'approach', 'is', 'validated', 'with', 'simulated', 'data', 'at', 'different', 'noise', 'levels', 'and', 'undersampling', 'factors', 'as', 'well', 'as', 'with', 'a', 'controlled', 'phantom', 'imaging', 'experiment', 'on', 'a', 'clinical', 'magneticresonance', 'system']] | [-0.02413668646245655, 0.03656324547980396, -0.03876352923576964, 0.05847627361865968, -0.05729807511935095, -0.1640757218834055, 0.016899857150168496, 0.4077972643744116, -0.3077107960714123, -0.32267802707395854, 0.10517955448780082, -0.24743841013225226, -0.16192567117237064, 0.17340608633623394, -0.08018076853741976, 0.09161427861346799, 0.07127468176027336, 0.03133070498403289, -0.05801343560349117, -0.2023036046626988, 0.2557972275588492, 0.04855125154691367, 0.31046323133738374, -0.019301116770789536, 0.14661951191837116, 0.026120013209451412, -0.00938326783183253, 0.025024378471161155, -0.05946908676270885, 0.12543694352313073, 0.3217692718872885, 0.14600808692789127, 0.29667061573524156, -0.461957760208117, -0.2662804075900402, 0.08620083548819159, 0.15313477869197165, 0.1374868306361763, -0.03215088401272872, -0.27034597121581266, 0.07792427349010143, -0.09560118096520785, -0.021127270651049912, -0.10948745016052767, -0.06488194438795537, -0.030728922072078356, -0.34796032535483723, 0.13061176280395806, 0.0011799674102803692, 0.08146615718595224, -0.10167488049641675, -0.10873118050287965, 0.06299649014942009, 0.11061944627330046, 0.02910316895047965, 0.05148532859113237, 0.16195366918162274, -0.1357089925877517, -0.1022218917073174, 0.3599884578725323, -0.04473814138178899, -0.2233515239058761, 0.16139768004756083, -0.10334498704337007, -0.12466141728906553, 0.1548247121549635, 0.19106441878565503, 0.13619516415267505, -0.17488624216904017, 0.037489726212449816, -0.013340829542853911, 0.1920659241705752, 0.05140691150286743, -0.036301516059955415, 0.1417983638133261, 0.20104449341835623, 0.04455739743108014, 0.14704080043487588, -0.15474757095878225, -0.009131343856676143, -0.22839462187700768, -0.07836397518589035, -0.23182548485188323, -0.04671936095763323, -0.12115124694777148, -0.1727045175423634, 0.3899300564186309, 0.20035024916366886, 0.2349477050308699, 0.022608252012684137, 0.3696935396186415, 0.08648811245868936, 0.09751861961459243, 0.030293264735849913, 0.17537449532590638, 0.10054676750389097, 0.11079366096505923, -0.21816365698363038, 0.09395169188660062, 0.04566446664102841] |
1,802.10493 | A Spectral Method for Stable Bispectrum Inversion with Application to
Multireference Alignment | We focus on an alignment-free method to estimate the underlying signal from a
large number of noisy randomly shifted observations. Specifically, we estimate
the mean, power spectrum, and bispectrum of the signal from the observations.
Since bispectrum contains the phase information of the signal, reliable
algorithms for bispectrum inversion is useful in many applications. We propose
a new algorithm using spectral decomposition of the normalized bispectrum
matrix for this task. For clean signals, we show that the eigenvectors of the
normalized bispectrum matrix correspond to the true phases of the signal and
its shifted copies. In addition, the spectral method is robust to noise. It can
be used as a stable and efficient initialization technique for local non-convex
optimization for bispectrum inversion.
| eess.SP | we focus on an alignmentfree method to estimate the underlying signal from a large number of noisy randomly shifted observations specifically we estimate the mean power spectrum and bispectrum of the signal from the observations since bispectrum contains the phase information of the signal reliable algorithms for bispectrum inversion is useful in many applications we propose a new algorithm using spectral decomposition of the normalized bispectrum matrix for this task for clean signals we show that the eigenvectors of the normalized bispectrum matrix correspond to the true phases of the signal and its shifted copies in addition the spectral method is robust to noise it can be used as a stable and efficient initialization technique for local nonconvex optimization for bispectrum inversion | [['we', 'focus', 'on', 'an', 'alignmentfree', 'method', 'to', 'estimate', 'the', 'underlying', 'signal', 'from', 'a', 'large', 'number', 'of', 'noisy', 'randomly', 'shifted', 'observations', 'specifically', 'we', 'estimate', 'the', 'mean', 'power', 'spectrum', 'and', 'bispectrum', 'of', 'the', 'signal', 'from', 'the', 'observations', 'since', 'bispectrum', 'contains', 'the', 'phase', 'information', 'of', 'the', 'signal', 'reliable', 'algorithms', 'for', 'bispectrum', 'inversion', 'is', 'useful', 'in', 'many', 'applications', 'we', 'propose', 'a', 'new', 'algorithm', 'using', 'spectral', 'decomposition', 'of', 'the', 'normalized', 'bispectrum', 'matrix', 'for', 'this', 'task', 'for', 'clean', 'signals', 'we', 'show', 'that', 'the', 'eigenvectors', 'of', 'the', 'normalized', 'bispectrum', 'matrix', 'correspond', 'to', 'the', 'true', 'phases', 'of', 'the', 'signal', 'and', 'its', 'shifted', 'copies', 'in', 'addition', 'the', 'spectral', 'method', 'is', 'robust', 'to', 'noise', 'it', 'can', 'be', 'used', 'as', 'a', 'stable', 'and', 'efficient', 'initialization', 'technique', 'for', 'local', 'nonconvex', 'optimization', 'for', 'bispectrum', 'inversion']] | [-0.07762493013755464, 0.03106268695958787, -0.13628770810643548, 0.09483518616819266, -0.0711447480058328, -0.1076522767238441, -0.005962419522101762, 0.3963038343325502, -0.2866279650479555, -0.28606313138009337, 0.1426452958067024, -0.2586787252641115, -0.17902056422164725, 0.20071356750826244, -0.059184760263678235, 0.08355629543695584, 0.06926982489521386, 0.02003371521647348, -0.08028389056037623, -0.196850104089521, 0.26228114157976185, 0.07506839139387012, 0.29645074817893996, -0.027916436767793398, 0.08273667994825566, 0.012719574821425876, -0.05490769587622261, -0.009477902585487873, -0.07635104714838653, 0.13069111238936054, 0.25386351697169796, 0.1836737129860176, 0.21679686330503128, -0.36958996521034204, -0.15119591905720164, 0.19059822261028114, 0.13911792368734957, 0.15413381222666042, -0.05002627758305428, -0.2834297746007682, 0.09322472439590292, -0.11100195780335391, -0.042773207695391335, -0.11602870811952552, -0.02211603324585518, -0.018389901001250646, -0.34486762951051847, 0.14279118223024195, 0.026471474005165127, -0.005072098734910737, 0.0010717220768546227, -0.14261272166794564, 0.019803288220962296, 0.12544434952748115, 0.01270123179162257, -0.00998678763175658, 0.12615863521216955, -0.12162173441282023, -0.054563904964540645, 0.35837956785880887, -0.10582596961920318, -0.17857066941348318, 0.0858339555943232, -0.10576499983886367, -0.17429942589493652, 0.1702640301349466, 0.20948264884502918, 0.1163006827891728, -0.10866334995438086, 0.0790740043887693, 0.014627146145298343, 0.20606552606417997, 0.015495181779308458, 0.04909736846695791, 0.2108461138864857, 0.10681322618525048, 0.15328336189850233, 0.1694231003467528, -0.1534078145059986, -0.0066034058566953316, -0.2589557221112582, -0.0958486718171444, -0.30140166928548917, 0.008118676533159173, -0.15146995333586838, -0.18385721770588492, 0.48654144379447717, 0.189501307724372, 0.216550819863008, 0.06647743714484768, 0.3737851144119975, 0.1502360751361922, 0.04125378146141646, 0.05630256466092313, 0.2309755437576105, 0.16829566942283608, 0.07113587786443532, -0.19843529009825137, 0.009168075035005564, 0.02696376059158537] |
1,802.10494 | Global-in-time Stability of 2D MHD boundary Layer in the
Prandtl-Hartmann Regime | In this paper, we prove global existence of solutions with analytic
regularity to the 2D MHD boundary layer equations in the mixed Prandtl and
Hartmann regime derived by formal multi-scale expansion in \cite{GP}. The
analysis shows that the combined effect of the magnetic diffusivity and
transveral magnetic field on the boundary leads to a linear damping on the
tangential velocity field near the boundary. And this damping effect yields the
global in time analytic norm estimate in the tangential space variable on the
perturbation of the classical steady Hartmann profile.
| math.AP | in this paper we prove global existence of solutions with analytic regularity to the 2d mhd boundary layer equations in the mixed prandtl and hartmann regime derived by formal multiscale expansion in citegp the analysis shows that the combined effect of the magnetic diffusivity and transveral magnetic field on the boundary leads to a linear damping on the tangential velocity field near the boundary and this damping effect yields the global in time analytic norm estimate in the tangential space variable on the perturbation of the classical steady hartmann profile | [['in', 'this', 'paper', 'we', 'prove', 'global', 'existence', 'of', 'solutions', 'with', 'analytic', 'regularity', 'to', 'the', '2d', 'mhd', 'boundary', 'layer', 'equations', 'in', 'the', 'mixed', 'prandtl', 'and', 'hartmann', 'regime', 'derived', 'by', 'formal', 'multiscale', 'expansion', 'in', 'citegp', 'the', 'analysis', 'shows', 'that', 'the', 'combined', 'effect', 'of', 'the', 'magnetic', 'diffusivity', 'and', 'transveral', 'magnetic', 'field', 'on', 'the', 'boundary', 'leads', 'to', 'a', 'linear', 'damping', 'on', 'the', 'tangential', 'velocity', 'field', 'near', 'the', 'boundary', 'and', 'this', 'damping', 'effect', 'yields', 'the', 'global', 'in', 'time', 'analytic', 'norm', 'estimate', 'in', 'the', 'tangential', 'space', 'variable', 'on', 'the', 'perturbation', 'of', 'the', 'classical', 'steady', 'hartmann', 'profile']] | [-0.1957984147179458, 0.08170017239430713, -0.09783671615522406, 0.018139386179649997, -0.08005681814004978, -0.0414105472413616, -0.017406182573176922, 0.2633955194718308, -0.2815194915359219, -0.2521595498857399, 0.11407668211419757, -0.19468075536812346, -0.09997320169802859, 0.1737129783671763, -0.05472514746296737, 0.0799667481953899, 0.03000798169652828, 0.028939523351275257, -0.05634387079755672, -0.1855382802740981, 0.36432372397846646, 0.0007036052023371061, 0.2826236024085018, 0.021498630278640324, 0.08630420903985699, -0.03452180888917711, 0.001123274660979708, 0.0689335899993441, -0.2155673668232339, 0.06962210423727003, 0.16643132732974159, -0.03252978104994529, 0.269042926608947, -0.46174885738485805, -0.23403136418718432, -5.7272861401240034e-05, 0.14670685084743632, 0.09299282817583945, -0.01656521436266808, -0.26427924026631644, 0.06555372208563817, -0.09033176641807789, -0.18428357091939285, -0.06222112853493955, 0.023331513356727857, 0.036331439540824954, -0.33633531592786314, 0.15602678612340243, 0.07903683126593629, 0.11581208261971672, -0.18340667517234882, -0.07209265458708009, -0.06459062633544413, 0.03978293607425359, 0.10411902180510677, 0.04597555990848276, 0.09951882827121558, -0.16377243177654843, -0.010094052905009853, 0.28962539251790276, -0.1281926014046702, -0.24494558353390958, 0.17772343535131466, -0.2105607518978003, -0.07538692202263822, 0.1268107475505935, 0.18524184653845926, 0.10483816910224657, -0.06520725211335553, 0.12814851051209392, -0.06374523208812914, 0.13125414461311366, 0.09087827388818065, -0.04321033021228181, 0.129325671361423, 0.11487143006330977, 0.1239989691413939, 0.13681309569963357, -0.1326478922364509, -0.08940216861665248, -0.3249810273810807, -0.15369921836536377, -0.15394928244253, 0.04682271150587541, -0.1409797483429429, -0.23471777308732272, 0.38537820771646997, 0.17046741010401295, 0.15603264554714164, 0.042886465922411944, 0.29899359949243565, 0.17635006592350289, 0.012280177407794529, 0.12138320554254783, 0.29579169198663696, 0.2333366751903668, 0.17675466881547536, -0.3003003310101728, 0.03027003592190643, 0.15546968874211112] |
1,802.10495 | Pop Music Highlighter: Marking the Emotion Keypoints | The goal of music highlight extraction is to get a short consecutive segment
of a piece of music that provides an effective representation of the whole
piece. In a previous work, we introduced an attention-based convolutional
recurrent neural network that uses music emotion classification as a surrogate
task for music highlight extraction, for Pop songs. The rationale behind that
approach is that the highlight of a song is usually the most emotional part.
This paper extends our previous work in the following two aspects. First,
methodology-wise we experiment with a new architecture that does not need any
recurrent layers, making the training process faster. Moreover, we compare a
late-fusion variant and an early-fusion variant to study which one better
exploits the attention mechanism. Second, we conduct and report an extensive
set of experiments comparing the proposed attention-based methods against a
heuristic energy-based method, a structural repetition-based method, and a few
other simple feature-based methods for this task. Due to the lack of
public-domain labeled data for highlight extraction, following our previous
work we use the RWC POP 100-song data set to evaluate how the detected
highlights overlap with any chorus sections of the songs. The experiments
demonstrate the effectiveness of our methods over competing methods. For
reproducibility, we open source the code and pre-trained model at
https://github.com/remyhuang/pop-music-highlighter/.
| eess.AS cs.AI cs.MM cs.SD | the goal of music highlight extraction is to get a short consecutive segment of a piece of music that provides an effective representation of the whole piece in a previous work we introduced an attentionbased convolutional recurrent neural network that uses music emotion classification as a surrogate task for music highlight extraction for pop songs the rationale behind that approach is that the highlight of a song is usually the most emotional part this paper extends our previous work in the following two aspects first methodologywise we experiment with a new architecture that does not need any recurrent layers making the training process faster moreover we compare a latefusion variant and an earlyfusion variant to study which one better exploits the attention mechanism second we conduct and report an extensive set of experiments comparing the proposed attentionbased methods against a heuristic energybased method a structural repetitionbased method and a few other simple featurebased methods for this task due to the lack of publicdomain labeled data for highlight extraction following our previous work we use the rwc pop 100song data set to evaluate how the detected highlights overlap with any chorus sections of the songs the experiments demonstrate the effectiveness of our methods over competing methods for reproducibility we open source the code and pretrained model at httpsgithubcomremyhuangpopmusichighlighter | [['the', 'goal', 'of', 'music', 'highlight', 'extraction', 'is', 'to', 'get', 'a', 'short', 'consecutive', 'segment', 'of', 'a', 'piece', 'of', 'music', 'that', 'provides', 'an', 'effective', 'representation', 'of', 'the', 'whole', 'piece', 'in', 'a', 'previous', 'work', 'we', 'introduced', 'an', 'attentionbased', 'convolutional', 'recurrent', 'neural', 'network', 'that', 'uses', 'music', 'emotion', 'classification', 'as', 'a', 'surrogate', 'task', 'for', 'music', 'highlight', 'extraction', 'for', 'pop', 'songs', 'the', 'rationale', 'behind', 'that', 'approach', 'is', 'that', 'the', 'highlight', 'of', 'a', 'song', 'is', 'usually', 'the', 'most', 'emotional', 'part', 'this', 'paper', 'extends', 'our', 'previous', 'work', 'in', 'the', 'following', 'two', 'aspects', 'first', 'methodologywise', 'we', 'experiment', 'with', 'a', 'new', 'architecture', 'that', 'does', 'not', 'need', 'any', 'recurrent', 'layers', 'making', 'the', 'training', 'process', 'faster', 'moreover', 'we', 'compare', 'a', 'latefusion', 'variant', 'and', 'an', 'earlyfusion', 'variant', 'to', 'study', 'which', 'one', 'better', 'exploits', 'the', 'attention', 'mechanism', 'second', 'we', 'conduct', 'and', 'report', 'an', 'extensive', 'set', 'of', 'experiments', 'comparing', 'the', 'proposed', 'attentionbased', 'methods', 'against', 'a', 'heuristic', 'energybased', 'method', 'a', 'structural', 'repetitionbased', 'method', 'and', 'a', 'few', 'other', 'simple', 'featurebased', 'methods', 'for', 'this', 'task', 'due', 'to', 'the', 'lack', 'of', 'publicdomain', 'labeled', 'data', 'for', 'highlight', 'extraction', 'following', 'our', 'previous', 'work', 'we', 'use', 'the', 'rwc', 'pop', '100song', 'data', 'set', 'to', 'evaluate', 'how', 'the', 'detected', 'highlights', 'overlap', 'with', 'any', 'chorus', 'sections', 'of', 'the', 'songs', 'the', 'experiments', 'demonstrate', 'the', 'effectiveness', 'of', 'our', 'methods', 'over', 'competing', 'methods', 'for', 'reproducibility', 'we', 'open', 'source', 'the', 'code', 'and', 'pretrained', 'model', 'at', 'httpsgithubcomremyhuangpopmusichighlighter']] | [-0.04801229167203027, -0.018027553858973137, -0.07509813788803904, 0.06259577967003364, -0.12668186666826917, -0.13539465495480973, 0.052234687877788476, 0.42439943226924703, -0.24806359720200943, -0.29125347562465015, 0.049644262034872495, -0.2909807789761782, -0.2070514900559803, 0.21024053226655923, -0.09612389210890109, 0.03841713451068831, 0.1518300077502581, 0.02986154378942327, -0.04410348707487998, -0.27674728527743475, 0.3253286046707115, 0.06958064504585743, 0.3146705452600825, 0.049937427744582714, 0.11551309187100138, -0.022196848291433723, -0.08928134128512275, -0.05414742813935225, -0.07715479755547974, 0.177342723162897, 0.26349500595444, 0.20538846424685042, 0.3439649471656254, -0.3990449782060546, -0.22315026402405994, 0.06397173995213043, 0.1290991581561888, 0.1483140339542868, -0.05345961163429735, -0.29067895063155585, 0.11645854927289896, -0.19364432217640298, -0.016378419900260795, -0.10637509773668145, -0.006247195309935416, -0.0070204190625896175, -0.2634705928476336, 0.009204592267851015, 0.11935336414341614, 0.05772468178733208, -0.048893354357672836, -0.11382813021218596, 0.06309887751932561, 0.16490197483266303, 0.046894891975664044, 0.08181260186943844, 0.08976330555470607, -0.1498629894816068, -0.17142757303821288, 0.3469421942631288, -0.08449805887833794, -0.18601450951531678, 0.19756694509436715, -0.03140023960726484, -0.1650215357881492, 0.06773776480129476, 0.17838348121660821, 0.1291948048175948, -0.15891675834509186, -0.02573059372294903, -0.07371042332302988, 0.23780503987158413, 0.031480135272091654, -0.04430223755956253, 0.1624956625953282, 0.2791149124098402, -0.002524404316513895, 0.1485842089878643, -0.1244413359243005, -0.043796712624030974, -0.2568866952374647, -0.1393465481874768, -0.1745276342050355, -0.02365058841433748, -0.05398186328837204, -0.1409726542111695, 0.4430256106011639, 0.24565387318763776, 0.2150552222128766, 0.10114451523415448, 0.3366074891479155, -0.007641151218721861, 0.0814884259369851, 0.07433186577596032, 0.18100101966410875, 0.012180570860080004, 0.13493516471696076, -0.19207801543968778, 0.08145878719770845, 0.08909090409473142] |
1,802.10496 | Epidemiologic analyses with error-prone exposures: Review of current
practice and recommendations | Background: Variables in epidemiological observational studies are commonly
subject to measurement error and misclassification, but the impact of such
errors is frequently not appreciated or ignored. As part of the STRengthening
Analytical Thinking for Observational Studies (STRATOS) Initiative, a Task
Group on measurement error and misclassification (TG4) seeks to describe the
scope of this problem and the analysis methods currently in use to address
measurement error. Methods: TG4 conducted a literature survey of four types of
research studies that are typically impacted by exposure measurement error: 1)
dietary intake cohort studies, 2) dietary intake population surveys, 3)
physical activity cohort studies, and 4) air pollution cohort studies. The
survey was conducted to understand current practice for acknowledging and
addressing measurement error. Results: The survey revealed that while
researchers were generally aware that measurement error affected their studies,
very few adjusted their analysis for the error. Most articles provided
incomplete discussion of the potential effects of measurement error on their
results. Regression calibration was the most widely used method of adjustment.
Conclusions: Even in areas of epidemiology where measurement error is a known
problem, the dominant current practice is to ignore errors in analyses. Methods
to correct for measurement error are available but require additional data to
inform the error structure. There is a great need to incorporate such data
collection within study designs and improve the analytical approach. Increased
efforts by investigators, editors and reviewers are also needed to improve
presentation of research when data are subject to error.
| stat.AP | background variables in epidemiological observational studies are commonly subject to measurement error and misclassification but the impact of such errors is frequently not appreciated or ignored as part of the strengthening analytical thinking for observational studies stratos initiative a task group on measurement error and misclassification tg4 seeks to describe the scope of this problem and the analysis methods currently in use to address measurement error methods tg4 conducted a literature survey of four types of research studies that are typically impacted by exposure measurement error 1 dietary intake cohort studies 2 dietary intake population surveys 3 physical activity cohort studies and 4 air pollution cohort studies the survey was conducted to understand current practice for acknowledging and addressing measurement error results the survey revealed that while researchers were generally aware that measurement error affected their studies very few adjusted their analysis for the error most articles provided incomplete discussion of the potential effects of measurement error on their results regression calibration was the most widely used method of adjustment conclusions even in areas of epidemiology where measurement error is a known problem the dominant current practice is to ignore errors in analyses methods to correct for measurement error are available but require additional data to inform the error structure there is a great need to incorporate such data collection within study designs and improve the analytical approach increased efforts by investigators editors and reviewers are also needed to improve presentation of research when data are subject to error | [['background', 'variables', 'in', 'epidemiological', 'observational', 'studies', 'are', 'commonly', 'subject', 'to', 'measurement', 'error', 'and', 'misclassification', 'but', 'the', 'impact', 'of', 'such', 'errors', 'is', 'frequently', 'not', 'appreciated', 'or', 'ignored', 'as', 'part', 'of', 'the', 'strengthening', 'analytical', 'thinking', 'for', 'observational', 'studies', 'stratos', 'initiative', 'a', 'task', 'group', 'on', 'measurement', 'error', 'and', 'misclassification', 'tg4', 'seeks', 'to', 'describe', 'the', 'scope', 'of', 'this', 'problem', 'and', 'the', 'analysis', 'methods', 'currently', 'in', 'use', 'to', 'address', 'measurement', 'error', 'methods', 'tg4', 'conducted', 'a', 'literature', 'survey', 'of', 'four', 'types', 'of', 'research', 'studies', 'that', 'are', 'typically', 'impacted', 'by', 'exposure', 'measurement', 'error', '1', 'dietary', 'intake', 'cohort', 'studies', '2', 'dietary', 'intake', 'population', 'surveys', '3', 'physical', 'activity', 'cohort', 'studies', 'and', '4', 'air', 'pollution', 'cohort', 'studies', 'the', 'survey', 'was', 'conducted', 'to', 'understand', 'current', 'practice', 'for', 'acknowledging', 'and', 'addressing', 'measurement', 'error', 'results', 'the', 'survey', 'revealed', 'that', 'while', 'researchers', 'were', 'generally', 'aware', 'that', 'measurement', 'error', 'affected', 'their', 'studies', 'very', 'few', 'adjusted', 'their', 'analysis', 'for', 'the', 'error', 'most', 'articles', 'provided', 'incomplete', 'discussion', 'of', 'the', 'potential', 'effects', 'of', 'measurement', 'error', 'on', 'their', 'results', 'regression', 'calibration', 'was', 'the', 'most', 'widely', 'used', 'method', 'of', 'adjustment', 'conclusions', 'even', 'in', 'areas', 'of', 'epidemiology', 'where', 'measurement', 'error', 'is', 'a', 'known', 'problem', 'the', 'dominant', 'current', 'practice', 'is', 'to', 'ignore', 'errors', 'in', 'analyses', 'methods', 'to', 'correct', 'for', 'measurement', 'error', 'are', 'available', 'but', 'require', 'additional', 'data', 'to', 'inform', 'the', 'error', 'structure', 'there', 'is', 'a', 'great', 'need', 'to', 'incorporate', 'such', 'data', 'collection', 'within', 'study', 'designs', 'and', 'improve', 'the', 'analytical', 'approach', 'increased', 'efforts', 'by', 'investigators', 'editors', 'and', 'reviewers', 'are', 'also', 'needed', 'to', 'improve', 'presentation', 'of', 'research', 'when', 'data', 'are', 'subject', 'to', 'error']] | [-0.06261419146003792, 0.01817133333255821, -0.0368178520897725, 0.12248718551122564, -0.10577674960552988, -0.13628841558261867, 0.11202705071595719, 0.3943883577982585, -0.18563842656648152, -0.3792423007478676, 0.17500422326576742, -0.3206066670790165, -0.11584131506900022, 0.2300102363422842, -0.1602894428820091, 0.07840087560910627, 0.13512432056452975, -0.009973818632628185, -0.028409024360159553, -0.31451094659871937, 0.2519012480884431, 0.1103276974338305, 0.31150461699865967, 0.027859572623201823, 0.01377955101473429, -0.020842440431024956, -0.15863100630623928, 0.01990829423129798, -0.15210023417039265, 0.12317568640202194, 0.33822965595018434, 0.190464965471751, 0.3733249813679187, -0.3935740491839118, -0.23461007695817146, 0.09900382295836242, 0.14116332613503987, 0.11916120366911483, -0.02780470066240065, -0.2872312719163197, 0.04553305579304515, -0.1640305249628248, -0.0718517579913446, -0.06478141382208981, 0.005104066459013216, 0.004093754071373881, -0.2722191911494176, 0.10475917438306494, 0.009384162862407395, 0.16026284165463475, -0.048118177163190244, -0.19113052460032115, 0.05237189324078969, 0.19908040701601015, 0.13669851676740472, 0.042146049394556524, 0.1803927813398551, -0.11092163379356475, -0.10644303497308528, 0.35323780822945405, -0.002872347968245247, -0.20638555877217388, 0.13982051663637446, -0.13087639289938033, -0.15486736836596335, 0.1023266626625737, 0.2177463446530592, 0.03628697806135209, -0.18594486024760198, -0.02026669642711283, 0.052059785548941674, 0.19120853752586017, 0.009970028413437217, 0.013466527670562028, 0.14441615155122867, 0.1843112785935806, 0.027399440537240492, 0.03052143455598967, -0.09435766165230768, -0.05180016420426289, -0.25478095770252485, -0.08850297067748256, -0.15072569961696544, 0.016112498570681012, -0.0054881901646348045, -0.12564581025197324, 0.3501243607877907, 0.2208312177089937, 0.0899619638394325, 0.02062490082394526, 0.33253079986790696, 0.01235296710075934, 0.08640007002185189, 0.023788245892980654, 0.2510579694399094, 0.10050416411522235, 0.06761202857320957, -0.17889698509811366, 0.16146659994325843, -0.04565402943861622] |
1,802.10497 | Learning Discriminative Multilevel Structured Dictionaries for
Supervised Image Classification | Sparse representations using overcomplete dictionaries have proved to be a
powerful tool in many signal processing applications such as denoising,
super-resolution, inpainting, compression or classification. The sparsity of
the representation very much depends on how well the dictionary is adapted to
the data at hand. In this paper, we propose a method for learning structured
multilevel dictionaries with discriminative constraints to make them well
suited for the supervised pixelwise classification of images. A multilevel
tree-structured discriminative dictionary is learnt for each class, with a
learning objective concerning the reconstruction errors of the image patches
around the pixels over each class-representative dictionary. After the initial
assignment of the class labels to image pixels based on their sparse
representations over the learnt dictionaries, the final classification is
achieved by smoothing the label image with a graph cut method and an erosion
method. Applied to a common set of texture images, our supervised
classification method shows competitive results with the state of the art.
| stat.ML cs.LG | sparse representations using overcomplete dictionaries have proved to be a powerful tool in many signal processing applications such as denoising superresolution inpainting compression or classification the sparsity of the representation very much depends on how well the dictionary is adapted to the data at hand in this paper we propose a method for learning structured multilevel dictionaries with discriminative constraints to make them well suited for the supervised pixelwise classification of images a multilevel treestructured discriminative dictionary is learnt for each class with a learning objective concerning the reconstruction errors of the image patches around the pixels over each classrepresentative dictionary after the initial assignment of the class labels to image pixels based on their sparse representations over the learnt dictionaries the final classification is achieved by smoothing the label image with a graph cut method and an erosion method applied to a common set of texture images our supervised classification method shows competitive results with the state of the art | [['sparse', 'representations', 'using', 'overcomplete', 'dictionaries', 'have', 'proved', 'to', 'be', 'a', 'powerful', 'tool', 'in', 'many', 'signal', 'processing', 'applications', 'such', 'as', 'denoising', 'superresolution', 'inpainting', 'compression', 'or', 'classification', 'the', 'sparsity', 'of', 'the', 'representation', 'very', 'much', 'depends', 'on', 'how', 'well', 'the', 'dictionary', 'is', 'adapted', 'to', 'the', 'data', 'at', 'hand', 'in', 'this', 'paper', 'we', 'propose', 'a', 'method', 'for', 'learning', 'structured', 'multilevel', 'dictionaries', 'with', 'discriminative', 'constraints', 'to', 'make', 'them', 'well', 'suited', 'for', 'the', 'supervised', 'pixelwise', 'classification', 'of', 'images', 'a', 'multilevel', 'treestructured', 'discriminative', 'dictionary', 'is', 'learnt', 'for', 'each', 'class', 'with', 'a', 'learning', 'objective', 'concerning', 'the', 'reconstruction', 'errors', 'of', 'the', 'image', 'patches', 'around', 'the', 'pixels', 'over', 'each', 'classrepresentative', 'dictionary', 'after', 'the', 'initial', 'assignment', 'of', 'the', 'class', 'labels', 'to', 'image', 'pixels', 'based', 'on', 'their', 'sparse', 'representations', 'over', 'the', 'learnt', 'dictionaries', 'the', 'final', 'classification', 'is', 'achieved', 'by', 'smoothing', 'the', 'label', 'image', 'with', 'a', 'graph', 'cut', 'method', 'and', 'an', 'erosion', 'method', 'applied', 'to', 'a', 'common', 'set', 'of', 'texture', 'images', 'our', 'supervised', 'classification', 'method', 'shows', 'competitive', 'results', 'with', 'the', 'state', 'of', 'the', 'art']] | [0.027694090054137633, -0.03722300745639586, -0.08699141832476016, 0.06054915651620831, -0.11584726427099667, -0.17318690940155648, 0.003246014146861853, 0.48412867737933996, -0.32665576524450446, -0.30511946624610575, 0.11442670048709261, -0.24986854921153281, -0.15375822465866804, 0.1549803402958787, -0.14904122269072104, 0.12244741407921537, 0.16494599074940197, 0.1056118792577763, -0.12485523418872617, -0.3116277610164616, 0.3084312863997184, 0.04507814237149432, 0.3498062351194676, -0.05451505495875608, 0.14637859753856902, 0.00840936817257898, -0.06990793445438612, -0.02025116963777691, -0.003529098416765919, 0.21267483120318503, 0.3630299569122144, 0.22117671971791425, 0.3178365760948509, -0.35551131919492035, -0.22876314879977144, 0.10990663996199146, 0.12800303026051552, 0.14430918354773895, -0.05327294211019762, -0.3700635852001142, 0.08760526757396292, -0.10076325816335156, 0.06226958690094762, -0.1506023206107784, -0.0467524287829292, -0.030974769667955114, -0.348188437976205, 0.05043959194445051, 0.10825741878034023, 0.04449828496435657, -0.07094133802747819, -0.14580753377522343, 0.06402531479543541, 0.12169513955450384, 0.01023861954017775, 0.08878458350081928, 0.12586385890317614, -0.22361952300852864, -0.09982745511224493, 0.3684974471863825, -0.04729424268589355, -0.24215429945616052, 0.19830728672241094, -0.02004202432913189, -0.1513563481217716, 0.13639660620247013, 0.22978310405742378, 0.1371598856174387, -0.12444172556861303, 0.005970690620233654, -0.07926699608869966, 0.1909335561664193, 0.08364187700499315, 0.0044096259793150235, 0.16846747695235537, 0.2734339346352499, 0.07350308363493241, 0.1658477116143331, -0.16935903426656296, 0.036458560888422656, -0.20770393910934218, -0.06165063212101814, -0.2609495674871141, -0.058478707237372876, -0.14703083472841172, -0.19375185929238797, 0.45040421799058095, 0.18040943722007796, 0.25789327184611466, 0.08857470187940635, 0.355014106282033, 0.01273687222501394, 0.12475476036051987, 0.08934262415132252, 0.1293668386846548, 0.08786037733807461, 0.09217039216680405, -0.1400961039442336, 0.06397628784179688, 0.11584433185871604] |
1,802.10498 | Uncovering Multiscale Order in the Prime Numbers via Scattering | The prime numbers have been a source of fascination for millenia and continue
to surprise us. Motivated by the hyperuniformity concept, which has attracted
recent attention in physics and materials science, we show that the prime
numbers in certain large intervals possess unanticipated order across length
scales and represent the first example of a new class of many-particle systems
with pure point diffraction patterns, which we call {\it effectively
limit-periodic}. In particular, the primes in this regime are hyperuniform.
This is shown analytically using the structure factor $S(k)$, proportional to
the scattering intensity from a many-particle system. Remarkably, the structure
factor for primes is characterized by dense Bragg peaks, like a quasicrystal,
but positioned at certain rational wavenumbers, like a limit-periodic point
pattern. We identify a transition between ordered and disordered prime regimes
that depends on the intervals studied. Our analysis leads to an algorithm that
enables one to predict primes with high accuracy. Effective limit-periodicity
deserves future investigation in physics, independent of its link to the
primes.
| cond-mat.stat-mech math-ph math.MP | the prime numbers have been a source of fascination for millenia and continue to surprise us motivated by the hyperuniformity concept which has attracted recent attention in physics and materials science we show that the prime numbers in certain large intervals possess unanticipated order across length scales and represent the first example of a new class of manyparticle systems with pure point diffraction patterns which we call it effectively limitperiodic in particular the primes in this regime are hyperuniform this is shown analytically using the structure factor sk proportional to the scattering intensity from a manyparticle system remarkably the structure factor for primes is characterized by dense bragg peaks like a quasicrystal but positioned at certain rational wavenumbers like a limitperiodic point pattern we identify a transition between ordered and disordered prime regimes that depends on the intervals studied our analysis leads to an algorithm that enables one to predict primes with high accuracy effective limitperiodicity deserves future investigation in physics independent of its link to the primes | [['the', 'prime', 'numbers', 'have', 'been', 'a', 'source', 'of', 'fascination', 'for', 'millenia', 'and', 'continue', 'to', 'surprise', 'us', 'motivated', 'by', 'the', 'hyperuniformity', 'concept', 'which', 'has', 'attracted', 'recent', 'attention', 'in', 'physics', 'and', 'materials', 'science', 'we', 'show', 'that', 'the', 'prime', 'numbers', 'in', 'certain', 'large', 'intervals', 'possess', 'unanticipated', 'order', 'across', 'length', 'scales', 'and', 'represent', 'the', 'first', 'example', 'of', 'a', 'new', 'class', 'of', 'manyparticle', 'systems', 'with', 'pure', 'point', 'diffraction', 'patterns', 'which', 'we', 'call', 'it', 'effectively', 'limitperiodic', 'in', 'particular', 'the', 'primes', 'in', 'this', 'regime', 'are', 'hyperuniform', 'this', 'is', 'shown', 'analytically', 'using', 'the', 'structure', 'factor', 'sk', 'proportional', 'to', 'the', 'scattering', 'intensity', 'from', 'a', 'manyparticle', 'system', 'remarkably', 'the', 'structure', 'factor', 'for', 'primes', 'is', 'characterized', 'by', 'dense', 'bragg', 'peaks', 'like', 'a', 'quasicrystal', 'but', 'positioned', 'at', 'certain', 'rational', 'wavenumbers', 'like', 'a', 'limitperiodic', 'point', 'pattern', 'we', 'identify', 'a', 'transition', 'between', 'ordered', 'and', 'disordered', 'prime', 'regimes', 'that', 'depends', 'on', 'the', 'intervals', 'studied', 'our', 'analysis', 'leads', 'to', 'an', 'algorithm', 'that', 'enables', 'one', 'to', 'predict', 'primes', 'with', 'high', 'accuracy', 'effective', 'limitperiodicity', 'deserves', 'future', 'investigation', 'in', 'physics', 'independent', 'of', 'its', 'link', 'to', 'the', 'primes']] | [-0.1540069184161466, 0.1577750234105687, -0.12577142853367917, 0.07911702848045145, -0.055452060885727406, -0.1344951734638321, 0.04491102148731334, 0.3493052731396374, -0.2837635907093565, -0.2829422819885442, 0.04247985410568176, -0.2882434570217996, -0.17895188767039133, 0.2014641530259685, -0.015890289415900937, 0.05798850772716942, 0.01249187905899065, 0.03557975846621581, -0.038361243581577775, -0.23195011489662135, 0.3161176097785641, 0.049019534115729756, 0.28476517660470824, 0.039591074338417034, 0.06452163618788524, 0.002604900399908914, 0.034730292209786566, 0.027524626047718534, -0.1435405906576236, 0.0921059286523008, 0.3004890190267344, 0.05277224991244541, 0.2703554767552027, -0.3919770974598959, -0.20449540809265332, 0.12682496234189028, 0.1487519766795198, 0.06897260751268508, -0.04820081183734255, -0.2515577770097594, 0.09018612449011391, -0.15224636579071824, -0.16471956334283164, -0.10457470892959213, 0.046875721847493494, 0.034360999973423914, -0.25270179814650695, 0.04614591980154325, 0.06143121160622574, 0.07128175977592406, -0.0010078788677810463, -0.09797428376849986, 0.04728879615480448, 0.10036528886513349, 0.04558635444016022, 0.006741038133239675, 0.07934312729588794, -0.12265342966134767, -0.12108896992344989, 0.3954546133524733, -0.003570710684585491, -0.1307172529499777, 0.18635720201394337, -0.2066554895234099, -0.16026604496790264, 0.18744248668189178, 0.14595628377959177, 0.0767073895430895, -0.06692681279839267, 0.08482032344177433, -0.08304132407107306, 0.1918060308866744, 0.09919722372014912, 0.05666940663258049, 0.24226693133126476, 0.17170871261780535, 0.05901460585597077, 0.1566206625276552, -0.08638725874451976, -0.08730651277624918, -0.2439341497200424, -0.11207625422135976, -0.1964035863293792, 0.05939379648492298, -0.049172013071937276, -0.17948937000379853, 0.3969695176260022, 0.14689533963721402, 0.19383429522865903, 0.02739902396813944, 0.2041470057576404, 0.10005660290470135, 0.0868469226748465, 0.05080911962449283, 0.18699839709516236, 0.10817806384997432, 0.06744144109362167, -0.16386943444341956, 0.03624758792240842, 0.04363621720447467] |
1,802.10499 | The initial-boundary value problem for the biharmonic Schr\"odinger
equation on the half-line | We study the local and global wellposedness of the initial-boundary value
problem for the biharmonic Schr\"odinger equation on the half-line with
inhomogeneous Dirichlet-Neumann boundary data. First, we obtain a
representation formula for the solution of the linear nonhomogenenous problem
by using the Fokas method (also known as the \emph{unified transform method}).
We use this representation formula to prove space and time estimates on the
solutions of the linear model in fractional Sobolev spaces by using Fourier
analysis. Secondly, we consider the nonlinear model with a power type
nonlinearity and prove the local wellposedness by means of a classical
contraction argument. We obtain Strichartz estimates to treat the low
regularity case by using the oscillatory integral theory directly on the
representation formula provided by the Fokas method. Global wellposedness of
the defocusing model is established up to cubic nonlinearities by using the
multiplier technique and proving hidden trace regularities.
| math.AP | we study the local and global wellposedness of the initialboundary value problem for the biharmonic schrodinger equation on the halfline with inhomogeneous dirichletneumann boundary data first we obtain a representation formula for the solution of the linear nonhomogenenous problem by using the fokas method also known as the emphunified transform method we use this representation formula to prove space and time estimates on the solutions of the linear model in fractional sobolev spaces by using fourier analysis secondly we consider the nonlinear model with a power type nonlinearity and prove the local wellposedness by means of a classical contraction argument we obtain strichartz estimates to treat the low regularity case by using the oscillatory integral theory directly on the representation formula provided by the fokas method global wellposedness of the defocusing model is established up to cubic nonlinearities by using the multiplier technique and proving hidden trace regularities | [['we', 'study', 'the', 'local', 'and', 'global', 'wellposedness', 'of', 'the', 'initialboundary', 'value', 'problem', 'for', 'the', 'biharmonic', 'schrodinger', 'equation', 'on', 'the', 'halfline', 'with', 'inhomogeneous', 'dirichletneumann', 'boundary', 'data', 'first', 'we', 'obtain', 'a', 'representation', 'formula', 'for', 'the', 'solution', 'of', 'the', 'linear', 'nonhomogenenous', 'problem', 'by', 'using', 'the', 'fokas', 'method', 'also', 'known', 'as', 'the', 'emphunified', 'transform', 'method', 'we', 'use', 'this', 'representation', 'formula', 'to', 'prove', 'space', 'and', 'time', 'estimates', 'on', 'the', 'solutions', 'of', 'the', 'linear', 'model', 'in', 'fractional', 'sobolev', 'spaces', 'by', 'using', 'fourier', 'analysis', 'secondly', 'we', 'consider', 'the', 'nonlinear', 'model', 'with', 'a', 'power', 'type', 'nonlinearity', 'and', 'prove', 'the', 'local', 'wellposedness', 'by', 'means', 'of', 'a', 'classical', 'contraction', 'argument', 'we', 'obtain', 'strichartz', 'estimates', 'to', 'treat', 'the', 'low', 'regularity', 'case', 'by', 'using', 'the', 'oscillatory', 'integral', 'theory', 'directly', 'on', 'the', 'representation', 'formula', 'provided', 'by', 'the', 'fokas', 'method', 'global', 'wellposedness', 'of', 'the', 'defocusing', 'model', 'is', 'established', 'up', 'to', 'cubic', 'nonlinearities', 'by', 'using', 'the', 'multiplier', 'technique', 'and', 'proving', 'hidden', 'trace', 'regularities']] | [-0.06745494895422242, -0.019235236373837707, -0.10784461799071354, 0.09466757153502989, -0.10235341506706057, -0.11234585796387828, 0.008834260657626096, 0.2903204001359591, -0.33256586272979066, -0.24449055581068507, 0.1869850682164384, -0.261351994276807, -0.17031805332889463, 0.1982285987798023, -0.030621581317280374, 0.1234409551224893, 0.04597746853425237, 0.007451312530937852, -0.09607543479193495, -0.22942587637760659, 0.38092108871977853, -0.04624262998248039, 0.2450266099157965, 0.01881682640733514, 0.13074853588101537, 0.04908366675558341, -0.03676445841738561, -0.039222548861685365, -0.1971503366006627, 0.15336884850902216, 0.18669189322347038, 0.06511128271556124, 0.30725908515100575, -0.4389488898141652, -0.24348555575283307, 0.11103426808329793, 0.10262918922112507, 0.10276202343049504, -0.04942119800086532, -0.3453500787553308, 0.06992746644564682, -0.09055303784917254, -0.21036180396735363, -0.11564018758533358, -0.013327627753218016, 0.046942697225778436, -0.31869667124788775, 0.15395080401276265, 0.08606520056531315, 0.02788775126595481, -0.2034309908278844, -0.03095027693740542, 0.013958518839992431, 0.028063813769290236, 0.03145047267550463, 0.005906882998375159, -0.00010893047176662604, -0.1148204152380452, -0.07366403262289305, 0.32387726517634935, -0.12757653545360176, -0.2662389313922498, 0.09313919073997104, -0.12853945643469997, -0.0898993311601938, 0.06924200899658256, 0.15074293341703054, 0.16870732537350383, -0.14531909729525141, 0.16638804433988502, -0.07440178781402532, 0.13206811384836428, 0.09071289051045366, -0.02501753100263728, 0.02689185898931583, 0.13344879298341036, 0.15434070741187553, 0.17789001320647138, -0.04642942910903089, -0.06643100943357753, -0.33876440447888206, -0.14399078906494744, -0.2031125022529238, 0.07695226678007035, -0.13828854646959793, -0.1547457187287636, 0.3828088981162782, 0.1337427115396495, 0.16103924817855464, 0.11376545696953298, 0.26379036527051003, 0.23730460677191387, 0.01354081725993124, 0.0675344163184466, 0.1833327325365069, 0.1872190711433765, 0.16889922283146352, -0.22856575155592695, 0.004743445371626085, 0.2766375482703249] |
1,802.105 | Electroweak phase transition in the $\Sigma$SM - I: Dimensional
reduction | In a series of two papers, we make a comparative analysis of the performance
of conventional perturbation theory to analyze electroweak phase transition in
the real triplet extension of Standard Model ($\Sigma$SM). In Part I (this
paper), we derive and present the high-$T$ dimensionally reduced effective
theory that is suitable for numerical simulation on the lattice. In the sequel
(Part II), we will present results of the numerical simulation and benchmark
the performance of conventional perturbation theory. Under the assumption that
$\Sigma$ is heavy, the resulting effective theory takes the same form as that
derived from the minimal standard model. By recasting the existing
non-perturbative results, we map out the phase diagram of the model in the
plane of triplet mass $M_\Sigma$ and Higgs portal coupling $a_2$. Contrary to
conventional perturbation theory, we find regions of parameter space where the
phase transition may be first order, second order, or crossover. We comment on
prospects for prospective future colliders to probe the region where the
electroweak phase transition is first order by a precise measurement of the
$h\rightarrow\gamma\gamma$ partial width.
| hep-ph | in a series of two papers we make a comparative analysis of the performance of conventional perturbation theory to analyze electroweak phase transition in the real triplet extension of standard model sigmasm in part i this paper we derive and present the hight dimensionally reduced effective theory that is suitable for numerical simulation on the lattice in the sequel part ii we will present results of the numerical simulation and benchmark the performance of conventional perturbation theory under the assumption that sigma is heavy the resulting effective theory takes the same form as that derived from the minimal standard model by recasting the existing nonperturbative results we map out the phase diagram of the model in the plane of triplet mass m_sigma and higgs portal coupling a_2 contrary to conventional perturbation theory we find regions of parameter space where the phase transition may be first order second order or crossover we comment on prospects for prospective future colliders to probe the region where the electroweak phase transition is first order by a precise measurement of the hrightarrowgammagamma partial width | [['in', 'a', 'series', 'of', 'two', 'papers', 'we', 'make', 'a', 'comparative', 'analysis', 'of', 'the', 'performance', 'of', 'conventional', 'perturbation', 'theory', 'to', 'analyze', 'electroweak', 'phase', 'transition', 'in', 'the', 'real', 'triplet', 'extension', 'of', 'standard', 'model', 'sigmasm', 'in', 'part', 'i', 'this', 'paper', 'we', 'derive', 'and', 'present', 'the', 'hight', 'dimensionally', 'reduced', 'effective', 'theory', 'that', 'is', 'suitable', 'for', 'numerical', 'simulation', 'on', 'the', 'lattice', 'in', 'the', 'sequel', 'part', 'ii', 'we', 'will', 'present', 'results', 'of', 'the', 'numerical', 'simulation', 'and', 'benchmark', 'the', 'performance', 'of', 'conventional', 'perturbation', 'theory', 'under', 'the', 'assumption', 'that', 'sigma', 'is', 'heavy', 'the', 'resulting', 'effective', 'theory', 'takes', 'the', 'same', 'form', 'as', 'that', 'derived', 'from', 'the', 'minimal', 'standard', 'model', 'by', 'recasting', 'the', 'existing', 'nonperturbative', 'results', 'we', 'map', 'out', 'the', 'phase', 'diagram', 'of', 'the', 'model', 'in', 'the', 'plane', 'of', 'triplet', 'mass', 'm_sigma', 'and', 'higgs', 'portal', 'coupling', 'a_2', 'contrary', 'to', 'conventional', 'perturbation', 'theory', 'we', 'find', 'regions', 'of', 'parameter', 'space', 'where', 'the', 'phase', 'transition', 'may', 'be', 'first', 'order', 'second', 'order', 'or', 'crossover', 'we', 'comment', 'on', 'prospects', 'for', 'prospective', 'future', 'colliders', 'to', 'probe', 'the', 'region', 'where', 'the', 'electroweak', 'phase', 'transition', 'is', 'first', 'order', 'by', 'a', 'precise', 'measurement', 'of', 'the', 'hrightarrowgammagamma', 'partial', 'width']] | [-0.11213367604312367, 0.11708333436659844, -0.06980558123059737, 0.05694786898431488, -0.06213777583852077, -0.09631971369742015, 0.06179573242266418, 0.31995617474725874, -0.2370370181847114, -0.26147230708576197, 0.09537903070072618, -0.2830349777112377, -0.14555064794170416, 0.1292041932940275, 0.018712813565188852, 0.045162013032104216, 0.02914419041149183, 0.0424523275662942, -0.11902545306795177, -0.22690718649631605, 0.3351614474079587, 0.03602723772611532, 0.2649953193681616, 0.06108629042328226, 0.028837816867790075, -0.006968652364516933, -0.015520063979426325, -0.0021465828451367, -0.17016074309617707, 0.09091176940180236, 0.2099781603272419, 0.07543135421772035, 0.20369011490097186, -0.39375392683162536, -0.19355444451950116, 0.09229634437246986, 0.14484701820196552, 0.1208844884668149, -0.045988262510031214, -0.2921148276050164, 0.08108152155523767, -0.18372330622091973, -0.10666042519603237, -0.085031578613851, -0.038295021147971876, -0.07017336589513169, -0.31391438651913206, 0.08699896494830651, -0.007613859558217852, 0.036383973149707614, -0.025656688664441502, -0.11346387918570272, -0.011689524827056756, 0.07644042800903819, 0.06233828274829719, 0.050021953809246754, 0.10384670444165861, -0.13805170812352702, -0.09640819929259199, 0.40238257849266407, -0.13698954656316936, -0.1399812839592221, 0.14405517149248354, -0.17124160038640296, -0.13546329402942314, 0.1049317907913999, 0.16528626541378152, 0.11789483389707917, -0.11146217804173185, 0.13922947719231424, -0.014830020628349242, 0.17396070775393835, -0.0072201507389753556, 0.004634983746553433, 0.1829433357004888, 0.20564086786757468, 0.022908494937852773, 0.11950922247696169, -0.08846000905081047, -0.1480084095012355, -0.40133310683519063, -0.15004959342189592, -0.11553740596942416, 0.0014203836934578568, -0.07961823420224168, -0.13155167854219343, 0.40356565985500853, 0.2061402058981973, 0.19586607826842442, 0.03168026701151783, 0.30631738527308544, 0.13510341381240512, 0.024876162335640807, -0.013594818767160177, 0.29792577892739597, 0.11609725239712683, 0.08477648770613544, -0.2157365343868069, -0.00738920483155457, 0.11325011554553939] |
1,802.10501 | Predictive Uncertainty Estimation via Prior Networks | Estimating how uncertain an AI system is in its predictions is important to
improve the safety of such systems. Uncertainty in predictive can result from
uncertainty in model parameters, irreducible data uncertainty and uncertainty
due to distributional mismatch between the test and training data
distributions. Different actions might be taken depending on the source of the
uncertainty so it is important to be able to distinguish between them.
Recently, baseline tasks and metrics have been defined and several practical
methods to estimate uncertainty developed. These methods, however, attempt to
model uncertainty due to distributional mismatch either implicitly through
model uncertainty or as data uncertainty. This work proposes a new framework
for modeling predictive uncertainty called Prior Networks (PNs) which
explicitly models distributional uncertainty. PNs do this by parameterizing a
prior distribution over predictive distributions. This work focuses on
uncertainty for classification and evaluates PNs on the tasks of identifying
out-of-distribution (OOD) samples and detecting misclassification on the MNIST
dataset, where they are found to outperform previous methods. Experiments on
synthetic and MNIST and CIFAR-10 data show that unlike previous non-Bayesian
methods PNs are able to distinguish between data and distributional
uncertainty.
| stat.ML cs.LG | estimating how uncertain an ai system is in its predictions is important to improve the safety of such systems uncertainty in predictive can result from uncertainty in model parameters irreducible data uncertainty and uncertainty due to distributional mismatch between the test and training data distributions different actions might be taken depending on the source of the uncertainty so it is important to be able to distinguish between them recently baseline tasks and metrics have been defined and several practical methods to estimate uncertainty developed these methods however attempt to model uncertainty due to distributional mismatch either implicitly through model uncertainty or as data uncertainty this work proposes a new framework for modeling predictive uncertainty called prior networks pns which explicitly models distributional uncertainty pns do this by parameterizing a prior distribution over predictive distributions this work focuses on uncertainty for classification and evaluates pns on the tasks of identifying outofdistribution ood samples and detecting misclassification on the mnist dataset where they are found to outperform previous methods experiments on synthetic and mnist and cifar10 data show that unlike previous nonbayesian methods pns are able to distinguish between data and distributional uncertainty | [['estimating', 'how', 'uncertain', 'an', 'ai', 'system', 'is', 'in', 'its', 'predictions', 'is', 'important', 'to', 'improve', 'the', 'safety', 'of', 'such', 'systems', 'uncertainty', 'in', 'predictive', 'can', 'result', 'from', 'uncertainty', 'in', 'model', 'parameters', 'irreducible', 'data', 'uncertainty', 'and', 'uncertainty', 'due', 'to', 'distributional', 'mismatch', 'between', 'the', 'test', 'and', 'training', 'data', 'distributions', 'different', 'actions', 'might', 'be', 'taken', 'depending', 'on', 'the', 'source', 'of', 'the', 'uncertainty', 'so', 'it', 'is', 'important', 'to', 'be', 'able', 'to', 'distinguish', 'between', 'them', 'recently', 'baseline', 'tasks', 'and', 'metrics', 'have', 'been', 'defined', 'and', 'several', 'practical', 'methods', 'to', 'estimate', 'uncertainty', 'developed', 'these', 'methods', 'however', 'attempt', 'to', 'model', 'uncertainty', 'due', 'to', 'distributional', 'mismatch', 'either', 'implicitly', 'through', 'model', 'uncertainty', 'or', 'as', 'data', 'uncertainty', 'this', 'work', 'proposes', 'a', 'new', 'framework', 'for', 'modeling', 'predictive', 'uncertainty', 'called', 'prior', 'networks', 'pns', 'which', 'explicitly', 'models', 'distributional', 'uncertainty', 'pns', 'do', 'this', 'by', 'parameterizing', 'a', 'prior', 'distribution', 'over', 'predictive', 'distributions', 'this', 'work', 'focuses', 'on', 'uncertainty', 'for', 'classification', 'and', 'evaluates', 'pns', 'on', 'the', 'tasks', 'of', 'identifying', 'outofdistribution', 'ood', 'samples', 'and', 'detecting', 'misclassification', 'on', 'the', 'mnist', 'dataset', 'where', 'they', 'are', 'found', 'to', 'outperform', 'previous', 'methods', 'experiments', 'on', 'synthetic', 'and', 'mnist', 'and', 'cifar10', 'data', 'show', 'that', 'unlike', 'previous', 'nonbayesian', 'methods', 'pns', 'are', 'able', 'to', 'distinguish', 'between', 'data', 'and', 'distributional', 'uncertainty']] | [-0.012886151798186501, 0.0073987680533199925, -0.09393464306281656, 0.13207663435742492, -0.11891221545919464, -0.14722099494315802, 0.07813005920265513, 0.4191416698405568, -0.26144563547135646, -0.39652528684995875, 0.12103168982505025, -0.29241843913140564, -0.10861037132307078, 0.22429258364718407, -0.16473739895316242, 0.1250411802460927, 0.12483721867103753, 0.03721433282703044, -0.08713331755618833, -0.25704485832875673, 0.3364839143197769, 0.05622623067505229, 0.34508238402341557, 0.011109366736262647, 0.1171094298086017, -0.06225980176158854, -0.060295861077870376, -0.021711657089498185, -0.08858507562384371, 0.17077208927732584, 0.28979774676251524, 0.19384403215813895, 0.2864733975799998, -0.36120325613020876, -0.281984056424135, 0.1494787856521992, 0.11547395164032433, 0.09989094325763061, 0.04845751755375961, -0.35614341919198245, 0.04466256716273998, -0.1895823644800843, 0.020252717666191425, -0.1420795373930669, 0.027454719513030575, 0.007150263654760509, -0.2959248774480172, 0.10434372926311304, 0.07894708677219393, 0.048661429795841274, -0.04435520029946167, -0.15957460090632586, 0.0003914649266730116, 0.16982431149631932, 0.09355037458453093, 0.027094365931384225, 0.12679323480593732, -0.11259803335372534, -0.13231820503221728, 0.3722659883123496, -0.02960575710255555, -0.24914977335400335, 0.1771708589683516, -0.06708362648819441, -0.16264931116611525, 0.032590674353441644, 0.27738551073098133, 0.07767191507819435, -0.19224338114678527, -0.0013403602688651318, 0.005624029658617773, 0.1865164001694154, 0.017295332199464802, -0.022636994034422472, 0.17671725546931408, 0.2113819512129025, 0.007880513171094875, 0.08888511046772112, -0.1208223934501412, -0.08851400633337687, -0.23367227672194546, -0.058015861390012254, -0.15709825385732487, -0.016088236966877396, -0.08768327449043391, -0.10680447416916411, 0.33309268278035664, 0.2829490418970117, 0.18973330971516708, 0.0790987096389229, 0.3477306894516738, 0.04945852158588713, 0.07300482190784593, 0.07568328678412899, 0.22915490214708042, 0.07160901678823597, 0.024508249986775376, -0.17044083661087717, 0.14879664635841602, -0.033653638488978774] |
1,802.10502 | Coefficient systems on the Bruhat-Tits building and pro-$p$
Iwahori-Hecke modules | Let $G$ be the group of rational points of a split connected reductive group
over a nonarchimedean local field of residue characteristic $p$. Let $I$ be a
pro-$p$ Iwahori subgroup of $G$ and let $R$ be a commutative quasi-Frobenius
ring. If $H=R[I\backslash G/I]$ denotes the pro-$p$ Iwahori-Hecke algebra of
$G$ over $R$ we clarify the relation between the category of $H$-modules and
the category of $G$-equivariant coefficient systems on the semisimple
Bruhat-Tits building of $G$. If $R$ is a field of characteristic zero this
yields alternative proofs of the exactness of the Schneider-Stuhler resolution
and of the Zelevinski conjecture for smooth $G$-representations generated by
their $I$-invariants. In general, it gives a description of the derived
category of $H$-modules in terms of smooth $G$-representations and yields a
functor to generalized $(\varphi,\Gamma)$-modules extending the constructions
of Colmez, Schneider and Vign\'eras.
| math.RT math.NT | let g be the group of rational points of a split connected reductive group over a nonarchimedean local field of residue characteristic p let i be a prop iwahori subgroup of g and let r be a commutative quasifrobenius ring if hribackslash gi denotes the prop iwahorihecke algebra of g over r we clarify the relation between the category of hmodules and the category of gequivariant coefficient systems on the semisimple bruhattits building of g if r is a field of characteristic zero this yields alternative proofs of the exactness of the schneiderstuhler resolution and of the zelevinski conjecture for smooth grepresentations generated by their iinvariants in general it gives a description of the derived category of hmodules in terms of smooth grepresentations and yields a functor to generalized varphigammamodules extending the constructions of colmez schneider and vigneras | [['let', 'g', 'be', 'the', 'group', 'of', 'rational', 'points', 'of', 'a', 'split', 'connected', 'reductive', 'group', 'over', 'a', 'nonarchimedean', 'local', 'field', 'of', 'residue', 'characteristic', 'p', 'let', 'i', 'be', 'a', 'prop', 'iwahori', 'subgroup', 'of', 'g', 'and', 'let', 'r', 'be', 'a', 'commutative', 'quasifrobenius', 'ring', 'if', 'hribackslash', 'gi', 'denotes', 'the', 'prop', 'iwahorihecke', 'algebra', 'of', 'g', 'over', 'r', 'we', 'clarify', 'the', 'relation', 'between', 'the', 'category', 'of', 'hmodules', 'and', 'the', 'category', 'of', 'gequivariant', 'coefficient', 'systems', 'on', 'the', 'semisimple', 'bruhattits', 'building', 'of', 'g', 'if', 'r', 'is', 'a', 'field', 'of', 'characteristic', 'zero', 'this', 'yields', 'alternative', 'proofs', 'of', 'the', 'exactness', 'of', 'the', 'schneiderstuhler', 'resolution', 'and', 'of', 'the', 'zelevinski', 'conjecture', 'for', 'smooth', 'grepresentations', 'generated', 'by', 'their', 'iinvariants', 'in', 'general', 'it', 'gives', 'a', 'description', 'of', 'the', 'derived', 'category', 'of', 'hmodules', 'in', 'terms', 'of', 'smooth', 'grepresentations', 'and', 'yields', 'a', 'functor', 'to', 'generalized', 'varphigammamodules', 'extending', 'the', 'constructions', 'of', 'colmez', 'schneider', 'and', 'vigneras']] | [-0.24339261258094613, 0.015224655199905528, -0.15896726974888759, 0.01254991615218494, -0.11808997875778005, -0.14016880043302937, -0.03844949901480611, 0.30056504513520527, -0.3778993236209156, -0.18622825566597065, 0.03721892270978595, -0.18646152115038336, -0.08116210211986019, 0.21551869169343263, -0.18090513897101013, -0.15437362991574713, 0.015285242371165249, 0.15642916345421007, -0.07449736496817101, -0.2845871486591504, 0.4044310274920837, -0.027891506523969035, 0.20602770571542137, 0.02743959803175291, 0.09027522990671809, 0.04946299469755853, -0.020665002733414227, 0.004933081752182368, -0.1673813062678913, 0.13765239557388292, 0.3609086538473254, 0.06891193891779575, 0.21951252180203001, -0.3296693528879105, -0.10969489891773693, 0.2372393866055919, 0.114868755260592, -0.06071168945773559, 0.018987140487297438, -0.3023373718794627, 0.17895441804327727, -0.2313732178744805, -0.13271177909679382, -0.03161127680761959, 0.14775313616915167, 0.002459284941912355, -0.28235977657331046, 0.002765281985322123, 0.10518119993674405, 0.19743172093020642, -0.06005908374380156, -0.10396712684151306, -0.10444124863373444, 0.05263651401722146, -0.07701090615591966, 0.08129751182722804, 0.1140115468605312, -0.09004191323393063, -0.08942499893772252, 0.39942858364391964, -0.09616675384013969, -0.14537897402838365, 0.10347084105117521, -0.18773822887691066, -0.08361267269356176, 0.10164499463623061, 0.03419490855680231, 0.1784685565336772, 0.03354961097048705, 0.2757231786565492, -0.17540809227948023, 0.02521083857059506, 0.08064645289457129, -0.026300366839089238, 0.1445682338603279, 0.05924142203987097, 0.04438626524150844, 0.09749238297209718, 0.057533311679863426, 0.08217601403457057, -0.388157390167608, -0.1767452173962203, -0.10689740310943521, 0.18364511092659086, -0.12188142926210918, -0.16508178390915204, 0.4483486802371986, 0.06993694377460462, 0.1549964518896612, 0.17252053343519733, 0.17767582872029913, 0.04982524782227462, 0.07313730112133164, 0.04866432931671357, 0.05996585709919386, 0.34703763333484805, -0.11233830223414663, -0.144241241430042, -0.052240392761578894, 0.24897401323131121] |
1,802.10503 | Anticipation in Human-Robot Cooperation: A Recurrent Neural Network
Approach for Multiple Action Sequences Prediction | Close human-robot cooperation is a key enabler for new developments in
advanced manufacturing and assistive applications. Close cooperation require
robots that can predict human actions and intent, and understand human
non-verbal cues. Recent approaches based on neural networks have led to
encouraging results in the human action prediction problem both in continuous
and discrete spaces. Our approach extends the research in this direction. Our
contributions are three-fold. First, we validate the use of gaze and body pose
cues as a means of predicting human action through a feature selection method.
Next, we address two shortcomings of existing literature: predicting multiple
and variable-length action sequences. This is achieved by introducing an
encoder-decoder recurrent neural network topology in the discrete action
prediction problem. In addition, we theoretically demonstrate the importance of
predicting multiple action sequences as a means of estimating the stochastic
reward in a human robot cooperation scenario. Finally, we show the ability to
effectively train the prediction model on a action prediction dataset,
involving human motion data, and explore the influence of the model's
parameters on its performance. Source code repository:
https://github.com/pschydlo/ActionAnticipation
| cs.HC cs.AI cs.RO | close humanrobot cooperation is a key enabler for new developments in advanced manufacturing and assistive applications close cooperation require robots that can predict human actions and intent and understand human nonverbal cues recent approaches based on neural networks have led to encouraging results in the human action prediction problem both in continuous and discrete spaces our approach extends the research in this direction our contributions are threefold first we validate the use of gaze and body pose cues as a means of predicting human action through a feature selection method next we address two shortcomings of existing literature predicting multiple and variablelength action sequences this is achieved by introducing an encoderdecoder recurrent neural network topology in the discrete action prediction problem in addition we theoretically demonstrate the importance of predicting multiple action sequences as a means of estimating the stochastic reward in a human robot cooperation scenario finally we show the ability to effectively train the prediction model on a action prediction dataset involving human motion data and explore the influence of the models parameters on its performance source code repository httpsgithubcompschydloactionanticipation | [['close', 'humanrobot', 'cooperation', 'is', 'a', 'key', 'enabler', 'for', 'new', 'developments', 'in', 'advanced', 'manufacturing', 'and', 'assistive', 'applications', 'close', 'cooperation', 'require', 'robots', 'that', 'can', 'predict', 'human', 'actions', 'and', 'intent', 'and', 'understand', 'human', 'nonverbal', 'cues', 'recent', 'approaches', 'based', 'on', 'neural', 'networks', 'have', 'led', 'to', 'encouraging', 'results', 'in', 'the', 'human', 'action', 'prediction', 'problem', 'both', 'in', 'continuous', 'and', 'discrete', 'spaces', 'our', 'approach', 'extends', 'the', 'research', 'in', 'this', 'direction', 'our', 'contributions', 'are', 'threefold', 'first', 'we', 'validate', 'the', 'use', 'of', 'gaze', 'and', 'body', 'pose', 'cues', 'as', 'a', 'means', 'of', 'predicting', 'human', 'action', 'through', 'a', 'feature', 'selection', 'method', 'next', 'we', 'address', 'two', 'shortcomings', 'of', 'existing', 'literature', 'predicting', 'multiple', 'and', 'variablelength', 'action', 'sequences', 'this', 'is', 'achieved', 'by', 'introducing', 'an', 'encoderdecoder', 'recurrent', 'neural', 'network', 'topology', 'in', 'the', 'discrete', 'action', 'prediction', 'problem', 'in', 'addition', 'we', 'theoretically', 'demonstrate', 'the', 'importance', 'of', 'predicting', 'multiple', 'action', 'sequences', 'as', 'a', 'means', 'of', 'estimating', 'the', 'stochastic', 'reward', 'in', 'a', 'human', 'robot', 'cooperation', 'scenario', 'finally', 'we', 'show', 'the', 'ability', 'to', 'effectively', 'train', 'the', 'prediction', 'model', 'on', 'a', 'action', 'prediction', 'dataset', 'involving', 'human', 'motion', 'data', 'and', 'explore', 'the', 'influence', 'of', 'the', 'models', 'parameters', 'on', 'its', 'performance', 'source', 'code', 'repository', 'httpsgithubcompschydloactionanticipation']] | [-0.09138117956533998, 0.01706537698565671, -0.05354452915026585, 0.06632657833037209, -0.12416805283717029, -0.15874378644804682, 0.04354555546100256, 0.46267174653585447, -0.26570867015903005, -0.316765489411741, 0.0645169203371602, -0.2562803132125068, -0.2792047863383649, 0.17877330654815293, -0.17115121005097847, 0.0814898099994045, 0.1500295467291398, 0.07750200675748989, -0.00156993282320832, -0.24256950742385006, 0.288299851266163, 0.041991371568806925, 0.32902059598712674, 0.05445301990688506, 0.13702430301770382, -0.000602636771863172, -0.06297592645336086, -0.056140473025634845, -0.059420788783050404, 0.19171156600961534, 0.30423771039009473, 0.16478365451709795, 0.3663393045410267, -0.43671852828116664, -0.27401618720469634, 0.07339814480507324, 0.12333666335052337, 0.11703563673493776, -0.04737816490837533, -0.37822957551981534, 0.06938355724270666, -0.20847640447952084, -0.0413036452997373, -0.09358710561523945, -0.022810685009700734, -0.021485707118016416, -0.29419187499076455, -0.0032308735731649547, 0.053341241432829804, 0.09905376388223132, -0.11901837472420557, -0.06085839251362467, 0.04033088950357961, 0.25124507071964897, 0.0885407128892273, 0.067185221793058, 0.15153024838568427, -0.20824731150847856, -0.1988809315946972, 0.3815934781901003, -0.048763355928105274, -0.2543043467699864, 0.1952471624537582, -0.04738220743428483, -0.15009205041772258, 0.046464917620448444, 0.2611883013735613, 0.12264834281886176, -0.1697306776861789, 0.016364885202431484, -0.021125296171939836, 0.15045755902094282, 0.022472615618752675, -0.019098101211428766, 0.2088602102060612, 0.27618775783796173, 0.02437930545018399, 0.10073785165206463, -0.08975771309046374, -0.10273032409791161, -0.20964671714933722, -0.09494754483213247, -0.15294327751800255, -0.020595560892284412, -0.09565184500079038, -0.08850870880900331, 0.40772731917092153, 0.2406211787839909, 0.1779294706757556, 0.11614018689985103, 0.3309955881260212, 0.008610528204281357, 0.06586525928697327, 0.03187773300679555, 0.18097353983125058, -0.008106638731445232, 0.1055868772779545, -0.22466783109378297, 0.11445798692151966, 0.07801278041436424] |
1,802.10504 | An abelian subfield of the dyadic division field of a hyperelliptic
Jacobian | Given a field $k$ of characteristic different from $2$ and an integer $d \geq
3$, let $J$ be the Jacobian of the "generic" hyperelliptic curve given by $y^2
= \prod_{i = 1}^d (x - \alpha_i)$, where the $\alpha_i$'s are transcendental
and independent over $k$; it is defined over the transcendental extension $K /
k$ generated by the symmetric functions of the $\alpha_i$'s. We investigate
certain subfields of the field $K_{\infty}$ obtained by adjoining all points of
$2$-power order of $J(\bar{K})$. In particular, we explicitly describe the
maximal abelian subextension of $K_{\infty} / K(J[2])$ and show that it is
contained in $K(J[8])$ (resp. $K(J[16])$) if $g \geq 2$ (resp. if $g = 1$). On
the way we obtain an explicit description of the abelian subextension
$K(J[4])$, and we describe the action of a particular automorphism in
$\mathrm{Gal}(K_{\infty} / K)$ on these subfields.
| math.NT | given a field k of characteristic different from 2 and an integer d geq 3 let j be the jacobian of the generic hyperelliptic curve given by y2 prod_i 1d x alpha_i where the alpha_is are transcendental and independent over k it is defined over the transcendental extension k k generated by the symmetric functions of the alpha_is we investigate certain subfields of the field k_infty obtained by adjoining all points of 2power order of jbark in particular we explicitly describe the maximal abelian subextension of k_infty kj2 and show that it is contained in kj8 resp kj16 if g geq 2 resp if g 1 on the way we obtain an explicit description of the abelian subextension kj4 and we describe the action of a particular automorphism in mathrmgalk_infty k on these subfields | [['given', 'a', 'field', 'k', 'of', 'characteristic', 'different', 'from', '2', 'and', 'an', 'integer', 'd', 'geq', '3', 'let', 'j', 'be', 'the', 'jacobian', 'of', 'the', 'generic', 'hyperelliptic', 'curve', 'given', 'by', 'y2', 'prod_i', '1d', 'x', 'alpha_i', 'where', 'the', 'alpha_is', 'are', 'transcendental', 'and', 'independent', 'over', 'k', 'it', 'is', 'defined', 'over', 'the', 'transcendental', 'extension', 'k', 'k', 'generated', 'by', 'the', 'symmetric', 'functions', 'of', 'the', 'alpha_is', 'we', 'investigate', 'certain', 'subfields', 'of', 'the', 'field', 'k_infty', 'obtained', 'by', 'adjoining', 'all', 'points', 'of', '2power', 'order', 'of', 'jbark', 'in', 'particular', 'we', 'explicitly', 'describe', 'the', 'maximal', 'abelian', 'subextension', 'of', 'k_infty', 'kj2', 'and', 'show', 'that', 'it', 'is', 'contained', 'in', 'kj8', 'resp', 'kj16', 'if', 'g', 'geq', '2', 'resp', 'if', 'g', '1', 'on', 'the', 'way', 'we', 'obtain', 'an', 'explicit', 'description', 'of', 'the', 'abelian', 'subextension', 'kj4', 'and', 'we', 'describe', 'the', 'action', 'of', 'a', 'particular', 'automorphism', 'in', 'mathrmgalk_infty', 'k', 'on', 'these', 'subfields']] | [-0.20315115533594508, 0.13189147953403335, -0.044477087300037965, -0.019148030411088257, -0.03384120917326072, -0.13297630640590796, -0.004011073877336457, 0.334287253623188, -0.3186822907628084, -0.2377876525715692, 0.06447859371201048, -0.2792336367056123, -0.11144285690534161, 0.20749910776430625, -0.02882288530781807, -0.06845627206348581, -0.04564487610514334, 0.16743188095642836, -0.06164215317585331, -0.3345539047586499, 0.365430956648197, -0.12139506661696942, 0.12467550861697418, 0.04846131739759585, 0.1192273120595928, 0.03692336753829295, 0.0026974543688993435, -0.006067124673791113, -0.2126787495420217, 0.09127881030326535, 0.2899400349560892, 0.11802654730712447, 0.20900676799647044, -0.3351037351603736, -0.15300063967879396, 0.23701288452139124, 0.14509276551325456, -0.05467508982837899, 0.03706681633593689, -0.21429599898783636, 0.17638185123360017, -0.14221461986016948, -0.15257681817820412, -0.06311289563018363, 0.14027962963336904, 0.01799137551279273, -0.29239052918637753, -0.023245534546731506, 0.11525575568521162, 0.18154055874765618, -0.021609837102005258, -0.1962148335260281, -0.055807378397730645, 0.06756823809701018, -0.014876811397698475, 0.11837342007129337, 0.03798507155261177, -0.1253632736788859, -0.06985194291382868, 0.3607234898627212, -0.09849908216438052, -0.15515697225055192, 0.08979129667932284, -0.19331434141713544, -0.0771764933670056, 0.14352548578972346, 0.09768691695353482, 0.1859777240533731, -0.017569374504091684, 0.24818700912328495, -0.15317610324927955, 0.11664083473715436, 0.0866776543546166, -0.06901313834168832, 0.12538617268728558, 0.028834469885623548, 0.06617048795305891, 0.11932948894445872, 0.007352175503910985, 0.030408931816054974, -0.4002610294264741, -0.15255999902728945, -0.1737344574657982, 0.16104886594985146, -0.1294091796221437, -0.10575077617977513, 0.41453333759272937, 0.08861476573656546, 0.18746835747515433, 0.06986644064818393, 0.17111109388497425, 0.11155682848766446, 0.029354054378927685, 0.1413023273307772, 0.05458441441442119, 0.18535479736419802, -0.0841105365598196, -0.18232293077198847, -0.0283804431273893, 0.13192739343139692] |
1,802.10505 | Vibrational anomalies in AFe$_\mathbf{2}$As$_\mathbf{2}$ (A$\,=\,$Ca,
Sr, and Ba) single crystals | The detailed behavior of the in-plane infrared-active vibrational modes has
been determined in AFe$_2$As$_2$ (A$\,=\,$Ca, Sr, and Ba) above and below the
structural and magnetic transition at $T_N=$172, 195 and 138 K, respectively.
Above $T_N$, two infrared-active $E_u$ modes are observed. In all three
compounds, below $T_N$ the low-frequency $E_u$ mode is observed to split into
upper and lower branches; with the exception of the Ba material, the oscillator
strength across the transition is conserved. In the Ca and Sr materials, the
high-frequency $E_u$ mode splits into an upper and a lower branch; however, the
oscillator strengths are quite different. Surprisingly, in both the Sr and Ba
materials, below $T_N$ the upper branch appears be either very weak or totally
absent, while the lower branch displays an anomalous increase in strength. The
frequencies and atomic characters of the lattice modes at the center of the
Brillouin zone have been calculated for the high-temperature phase for each of
these materials. The high-frequency $E_u$ mode does not change in position or
character across this series of compounds. Below $T_N$, the $E_u$ modes are
predicted to split into features of roughly equal strength. We discuss the
possibility that the anomalous increase in the strength of the lower branch of
the high-frequency mode below $T_N$ in the Sr and Ba compounds, and the weak
(silent) upper branch, may be related to the orbital ordering and a change in
the bonding between the Fe and As atoms in the magnetically-ordered state.
| cond-mat.str-el cond-mat.supr-con | the detailed behavior of the inplane infraredactive vibrational modes has been determined in afe_2as_2 aca sr and ba above and below the structural and magnetic transition at t_n172 195 and 138 k respectively above t_n two infraredactive e_u modes are observed in all three compounds below t_n the lowfrequency e_u mode is observed to split into upper and lower branches with the exception of the ba material the oscillator strength across the transition is conserved in the ca and sr materials the highfrequency e_u mode splits into an upper and a lower branch however the oscillator strengths are quite different surprisingly in both the sr and ba materials below t_n the upper branch appears be either very weak or totally absent while the lower branch displays an anomalous increase in strength the frequencies and atomic characters of the lattice modes at the center of the brillouin zone have been calculated for the hightemperature phase for each of these materials the highfrequency e_u mode does not change in position or character across this series of compounds below t_n the e_u modes are predicted to split into features of roughly equal strength we discuss the possibility that the anomalous increase in the strength of the lower branch of the highfrequency mode below t_n in the sr and ba compounds and the weak silent upper branch may be related to the orbital ordering and a change in the bonding between the fe and as atoms in the magneticallyordered state | [['the', 'detailed', 'behavior', 'of', 'the', 'inplane', 'infraredactive', 'vibrational', 'modes', 'has', 'been', 'determined', 'in', 'afe_2as_2', 'aca', 'sr', 'and', 'ba', 'above', 'and', 'below', 'the', 'structural', 'and', 'magnetic', 'transition', 'at', 't_n172', '195', 'and', '138', 'k', 'respectively', 'above', 't_n', 'two', 'infraredactive', 'e_u', 'modes', 'are', 'observed', 'in', 'all', 'three', 'compounds', 'below', 't_n', 'the', 'lowfrequency', 'e_u', 'mode', 'is', 'observed', 'to', 'split', 'into', 'upper', 'and', 'lower', 'branches', 'with', 'the', 'exception', 'of', 'the', 'ba', 'material', 'the', 'oscillator', 'strength', 'across', 'the', 'transition', 'is', 'conserved', 'in', 'the', 'ca', 'and', 'sr', 'materials', 'the', 'highfrequency', 'e_u', 'mode', 'splits', 'into', 'an', 'upper', 'and', 'a', 'lower', 'branch', 'however', 'the', 'oscillator', 'strengths', 'are', 'quite', 'different', 'surprisingly', 'in', 'both', 'the', 'sr', 'and', 'ba', 'materials', 'below', 't_n', 'the', 'upper', 'branch', 'appears', 'be', 'either', 'very', 'weak', 'or', 'totally', 'absent', 'while', 'the', 'lower', 'branch', 'displays', 'an', 'anomalous', 'increase', 'in', 'strength', 'the', 'frequencies', 'and', 'atomic', 'characters', 'of', 'the', 'lattice', 'modes', 'at', 'the', 'center', 'of', 'the', 'brillouin', 'zone', 'have', 'been', 'calculated', 'for', 'the', 'hightemperature', 'phase', 'for', 'each', 'of', 'these', 'materials', 'the', 'highfrequency', 'e_u', 'mode', 'does', 'not', 'change', 'in', 'position', 'or', 'character', 'across', 'this', 'series', 'of', 'compounds', 'below', 't_n', 'the', 'e_u', 'modes', 'are', 'predicted', 'to', 'split', 'into', 'features', 'of', 'roughly', 'equal', 'strength', 'we', 'discuss', 'the', 'possibility', 'that', 'the', 'anomalous', 'increase', 'in', 'the', 'strength', 'of', 'the', 'lower', 'branch', 'of', 'the', 'highfrequency', 'mode', 'below', 't_n', 'in', 'the', 'sr', 'and', 'ba', 'compounds', 'and', 'the', 'weak', 'silent', 'upper', 'branch', 'may', 'be', 'related', 'to', 'the', 'orbital', 'ordering', 'and', 'a', 'change', 'in', 'the', 'bonding', 'between', 'the', 'fe', 'and', 'as', 'atoms', 'in', 'the', 'magneticallyordered', 'state']] | [-0.1527984815801741, 0.24194796868648655, 0.014378558201905416, 0.013999412034410148, -0.03319395137760712, -0.12487578117193616, 0.13789120588679704, 0.383367709465781, -0.2545468487679407, -0.266970336361199, 0.03821535789673882, -0.3519396313485138, -0.0862936582644375, 0.1644745606054761, 0.06231146188196251, -0.08042295207174457, -0.04853767521147217, 0.08184002738217919, -0.08131871173367361, -0.1630384847559795, 0.24212990956647054, 0.02951345633411286, 0.33186192358939015, 0.02958906417408464, 0.011303550009710752, -0.07025221954765064, 0.12019210971739827, -0.020030618704171204, -0.10249603182396362, 0.06342418441662984, 0.2731640553444016, -0.015955288858361998, 0.1924261344910352, -0.3853600073453723, -0.16763023864073984, 0.059969656741512674, 0.18529804462795052, 0.09347914799392147, 0.020031325871657048, -0.24997415948630672, 0.08781444878716554, -0.07837123517309344, -0.09877556386802877, -0.045067489259146935, 0.03090903326412853, -0.014657510883336392, -0.22599917667993932, 0.09440979072063857, 0.12889388768449045, 0.1372560024432534, -0.13502455158349203, -0.22400475276291978, -0.09852067011085396, 0.08697585949142064, 0.08155006141572886, 0.008139268228099966, 0.09309001836583626, -0.10406887995326246, -0.06295104726616825, 0.3611913536428189, -0.11715866824497982, -0.03469612205968885, 0.20486956399922468, -0.20136508422010407, -0.10495890778993085, 0.21448037208875223, 0.10056663466503425, 0.0803148294675487, -0.08349172078757262, 0.08331129309621506, 0.035269487797453695, 0.1807212248729656, 0.08032298973305341, 0.07984887939706749, 0.23481596842205046, 0.11863589765722578, 0.034085339766794016, 0.13254304384071455, -0.14139003493652053, -0.03682815400237332, -0.2447486473152376, -0.12940984573975509, -0.1680167226748047, -0.033271925369864425, -0.07833303150320568, -0.17902564626871323, 0.3958018629191614, 0.09269790253744517, 0.23884810628179384, -0.04732758072323679, 0.20412355952335484, 0.16329446038829962, 0.0887905419024886, 0.0509765455451775, 0.32567301863918496, 0.17834173433330594, 0.09369833556916185, -0.27862494448389935, 0.035152597455497904, 0.023836170718530003] |
1,802.10506 | Behavior of thin disk crystalline morphology in the presence of
corrections to ideal magnetohydrodynamics | We analyze an axisymmetric magnetohydrodynamics configuration, describing the
morphology of a purely differentially rotating thin plasma disk, in which
linear and non-linear perturbations are triggered associated with microscopic
magnetic structures. We study the evolution of the non-stationary correction in
the limit in which the co-rotation condition (i.e., the dependence of the disk
angular velocity on the magnetic flux function) is preserved and the poloidal
velocity components are neglected. The main feature we address here is the
influence of ideal (finite electron inertia) and collisional (resistivity,
viscosity, and thermal conductivity) effects on the behavior of the flux
function perturbation and of the associated small-scale modifications in the
disk. We analyze two different regimes in which resistivity or viscosity
dominates and study the corresponding linear and non-linear behaviors of the
perturbation evolution, i.e., when the backreaction magnetic field is
negligible or comparable to the background one, respectively. We demonstrate
that when resistivity dominates, a radial oscillating morphology (crystalline
structure) emerges and it turns out to be damped in time, in both the linear
and non-linear regimes, but in such a way that the resulting transient can be
implemented in the description of relevant astrophysical processes, for
instance, associated with jet formation or cataclysmic variables. When the
viscosity effect dominates the dynamics, only the non-linear regime is
available and a very fast instability is triggered.
| astro-ph.SR physics.plasm-ph | we analyze an axisymmetric magnetohydrodynamics configuration describing the morphology of a purely differentially rotating thin plasma disk in which linear and nonlinear perturbations are triggered associated with microscopic magnetic structures we study the evolution of the nonstationary correction in the limit in which the corotation condition ie the dependence of the disk angular velocity on the magnetic flux function is preserved and the poloidal velocity components are neglected the main feature we address here is the influence of ideal finite electron inertia and collisional resistivity viscosity and thermal conductivity effects on the behavior of the flux function perturbation and of the associated smallscale modifications in the disk we analyze two different regimes in which resistivity or viscosity dominates and study the corresponding linear and nonlinear behaviors of the perturbation evolution ie when the backreaction magnetic field is negligible or comparable to the background one respectively we demonstrate that when resistivity dominates a radial oscillating morphology crystalline structure emerges and it turns out to be damped in time in both the linear and nonlinear regimes but in such a way that the resulting transient can be implemented in the description of relevant astrophysical processes for instance associated with jet formation or cataclysmic variables when the viscosity effect dominates the dynamics only the nonlinear regime is available and a very fast instability is triggered | [['we', 'analyze', 'an', 'axisymmetric', 'magnetohydrodynamics', 'configuration', 'describing', 'the', 'morphology', 'of', 'a', 'purely', 'differentially', 'rotating', 'thin', 'plasma', 'disk', 'in', 'which', 'linear', 'and', 'nonlinear', 'perturbations', 'are', 'triggered', 'associated', 'with', 'microscopic', 'magnetic', 'structures', 'we', 'study', 'the', 'evolution', 'of', 'the', 'nonstationary', 'correction', 'in', 'the', 'limit', 'in', 'which', 'the', 'corotation', 'condition', 'ie', 'the', 'dependence', 'of', 'the', 'disk', 'angular', 'velocity', 'on', 'the', 'magnetic', 'flux', 'function', 'is', 'preserved', 'and', 'the', 'poloidal', 'velocity', 'components', 'are', 'neglected', 'the', 'main', 'feature', 'we', 'address', 'here', 'is', 'the', 'influence', 'of', 'ideal', 'finite', 'electron', 'inertia', 'and', 'collisional', 'resistivity', 'viscosity', 'and', 'thermal', 'conductivity', 'effects', 'on', 'the', 'behavior', 'of', 'the', 'flux', 'function', 'perturbation', 'and', 'of', 'the', 'associated', 'smallscale', 'modifications', 'in', 'the', 'disk', 'we', 'analyze', 'two', 'different', 'regimes', 'in', 'which', 'resistivity', 'or', 'viscosity', 'dominates', 'and', 'study', 'the', 'corresponding', 'linear', 'and', 'nonlinear', 'behaviors', 'of', 'the', 'perturbation', 'evolution', 'ie', 'when', 'the', 'backreaction', 'magnetic', 'field', 'is', 'negligible', 'or', 'comparable', 'to', 'the', 'background', 'one', 'respectively', 'we', 'demonstrate', 'that', 'when', 'resistivity', 'dominates', 'a', 'radial', 'oscillating', 'morphology', 'crystalline', 'structure', 'emerges', 'and', 'it', 'turns', 'out', 'to', 'be', 'damped', 'in', 'time', 'in', 'both', 'the', 'linear', 'and', 'nonlinear', 'regimes', 'but', 'in', 'such', 'a', 'way', 'that', 'the', 'resulting', 'transient', 'can', 'be', 'implemented', 'in', 'the', 'description', 'of', 'relevant', 'astrophysical', 'processes', 'for', 'instance', 'associated', 'with', 'jet', 'formation', 'or', 'cataclysmic', 'variables', 'when', 'the', 'viscosity', 'effect', 'dominates', 'the', 'dynamics', 'only', 'the', 'nonlinear', 'regime', 'is', 'available', 'and', 'a', 'very', 'fast', 'instability', 'is', 'triggered']] | [-0.16397982996968166, 0.1572184384390025, -0.07595259934110013, 0.06625760157082884, -0.07368302001064089, -0.07948416158523378, -0.04704608252326547, 0.3308930074426908, -0.302106204102873, -0.2542472315778083, 0.08955782983789791, -0.25582802245133296, -0.10441832131441883, 0.1974647879476768, 0.023433664655270945, 0.01716113050871, 0.010350211374545554, -0.015427901124296425, -0.044763497723636705, -0.1757265466641895, 0.3363156217194439, 0.06428281313882352, 0.24944953538418688, 0.022634351669038804, 0.08461908708737644, -0.048065378049573115, -0.021708681709594554, 0.09037395339115178, -0.13210268864703895, -0.014282375678990607, 0.18633403006314692, -0.00047099772685517866, 0.2377733775500527, -0.45565369702573566, -0.21709054353047028, 0.04053571047932581, 0.14527912622712016, 0.10218094964983647, -0.024570501026663895, -0.20333558201122828, 0.044131465133375, -0.14127090487100585, -0.14300074016304082, -0.05708213662204274, 0.04411575620624799, 0.01747312411762405, -0.2902759588087557, 0.14795239521442233, 0.10874463294775367, 0.047064305332815484, -0.12434667477128306, -0.05842221056127937, -0.06366654182154988, 0.0747945327792885, 0.09541127977469047, 0.03006064889717612, 0.19823819840838713, -0.19208612889869492, -0.03613653689253706, 0.37341758407031495, -0.10134985762321062, -0.18073820578236435, 0.20442604686045465, -0.2160738150102531, -0.08832234424971011, 0.14974083480643327, 0.1896031128099977, 0.1298666740746682, -0.11892845243369471, 0.07575954931005752, -0.001323627427572737, 0.1641456420650823, 0.03969612999542339, 0.04310422565637005, 0.24747729086031853, 0.16135778942623655, 0.022382116732563823, 0.15075836799984277, -0.1425214133564664, -0.09213148284418222, -0.2922134851535514, -0.10652039567562374, -0.13162797148473696, 0.06833387825319225, -0.08880454070301336, -0.19987442306251274, 0.3965483795545223, 0.12310993034489083, 0.19104553888308573, -0.03229923231940431, 0.30288542643071964, 0.1618155771446926, 0.043445706472371344, 0.13279594636221626, 0.28879651465444817, 0.1677141641497377, 0.10932712507889625, -0.3258110678645673, 0.0816801096719631, 0.019885688674057257] |
1,802.10507 | Unveiling the superconducting mechanism of Ba$_{0.51}$K$_{0.49}$BiO$_3$ | Bismuthates were the first family of oxide high-temperature superconductors,
exhibiting superconducting transition temperatures (Tc) up to 32K, but the
superconducting mechanism remains under debate despite more than 30 years of
extensive research. Our angle-resolved photoemission spectroscopy studies on
Ba$_{0.51}$K$_{0.49}$BiO$_3$ reveal an unexpectedly 34% larger bandwidth than
in conventional density functional theory calculations. This can be reproduced
by calculations that fully account for long-range Coulomb interactions --- the
first direct demonstration of bandwidth expansion due to the Fock exchange
term, a long-accepted and yet uncorroborated fundamental effect in many body
physics. Furthermore, we observe an isotropic superconducting gap with
2\Delta$_0$/k$_B$ T$_c$ = 3.51 $\pm$ 0.05, and strong electron-phonon
interactions with a coupling constant \lambda$\sim$ 1.3 $\pm$ 0.2. These
findings solve a long-standing mystery --- Ba$_{0.51}$K$_{0.49}$BiO$_3$ is an
extraordinary Bardeen-Cooper-Schrieffer (BCS) superconductor, where long-range
Coulomb interactions expand the bandwidth, enhance electron-phonon coupling,
and generate the high Tc. Such effects will also be critical for finding new
superconductors.
| cond-mat.supr-con | bismuthates were the first family of oxide hightemperature superconductors exhibiting superconducting transition temperatures tc up to 32k but the superconducting mechanism remains under debate despite more than 30 years of extensive research our angleresolved photoemission spectroscopy studies on ba_051k_049bio_3 reveal an unexpectedly 34 larger bandwidth than in conventional density functional theory calculations this can be reproduced by calculations that fully account for longrange coulomb interactions the first direct demonstration of bandwidth expansion due to the fock exchange term a longaccepted and yet uncorroborated fundamental effect in many body physics furthermore we observe an isotropic superconducting gap with 2delta_0k_b t_c 351 pm 005 and strong electronphonon interactions with a coupling constant lambdasim 13 pm 02 these findings solve a longstanding mystery ba_051k_049bio_3 is an extraordinary bardeencooperschrieffer bcs superconductor where longrange coulomb interactions expand the bandwidth enhance electronphonon coupling and generate the high tc such effects will also be critical for finding new superconductors | [['bismuthates', 'were', 'the', 'first', 'family', 'of', 'oxide', 'hightemperature', 'superconductors', 'exhibiting', 'superconducting', 'transition', 'temperatures', 'tc', 'up', 'to', '32k', 'but', 'the', 'superconducting', 'mechanism', 'remains', 'under', 'debate', 'despite', 'more', 'than', '30', 'years', 'of', 'extensive', 'research', 'our', 'angleresolved', 'photoemission', 'spectroscopy', 'studies', 'on', 'ba_051k_049bio_3', 'reveal', 'an', 'unexpectedly', '34', 'larger', 'bandwidth', 'than', 'in', 'conventional', 'density', 'functional', 'theory', 'calculations', 'this', 'can', 'be', 'reproduced', 'by', 'calculations', 'that', 'fully', 'account', 'for', 'longrange', 'coulomb', 'interactions', 'the', 'first', 'direct', 'demonstration', 'of', 'bandwidth', 'expansion', 'due', 'to', 'the', 'fock', 'exchange', 'term', 'a', 'longaccepted', 'and', 'yet', 'uncorroborated', 'fundamental', 'effect', 'in', 'many', 'body', 'physics', 'furthermore', 'we', 'observe', 'an', 'isotropic', 'superconducting', 'gap', 'with', '2delta_0k_b', 't_c', '351', 'pm', '005', 'and', 'strong', 'electronphonon', 'interactions', 'with', 'a', 'coupling', 'constant', 'lambdasim', '13', 'pm', '02', 'these', 'findings', 'solve', 'a', 'longstanding', 'mystery', 'ba_051k_049bio_3', 'is', 'an', 'extraordinary', 'bardeencooperschrieffer', 'bcs', 'superconductor', 'where', 'longrange', 'coulomb', 'interactions', 'expand', 'the', 'bandwidth', 'enhance', 'electronphonon', 'coupling', 'and', 'generate', 'the', 'high', 'tc', 'such', 'effects', 'will', 'also', 'be', 'critical', 'for', 'finding', 'new', 'superconductors']] | [-0.1677942704228445, 0.23031388846809292, -0.03583975240699884, 0.05254037695232074, -0.08194563833121965, -0.18144376237713103, 0.11678945286768942, 0.3820292020493464, -0.23469475922221947, -0.33846633772466433, -0.024861728698188264, -0.35782685958956545, -0.09479425922413734, 0.1776361805166596, 0.04883630275317292, -0.00253445965023963, -0.021361223469186272, -0.06483348259172163, -0.1381762814566468, -0.22794874931536765, 0.26224428459032867, 0.04997244647804748, 0.3187958116366251, 0.16099924269813504, -0.0005694189560410843, -0.02873916311887729, 0.10388216238179421, -0.011129666903257571, -0.1674915882714059, 0.0483769500420454, 0.29493835157670734, -0.1073724556859029, 0.2709835415919991, -0.4327484694611583, -0.25323677684079754, 0.023508133742694014, 0.15771541441318807, 0.12956575464419517, -0.06981725427544301, -0.2698988376021687, 0.03181039128370734, -0.19959066025409344, -0.11512519964929419, -0.12183833918675806, -0.0034909159530306585, -0.07837397265688491, -0.23848351805684836, 0.12104858636893048, 0.004518050344887416, 0.1131724260480582, -0.07311649280568785, -0.13388771728323018, 0.032906216341133755, -0.0007388458927036137, 0.0557850790383118, 0.0974130895983025, 0.09388586407766451, -0.12301737734004918, -0.08983565821796907, 0.3423423909883462, -0.05257828284241416, -0.01471639289109196, 0.1596735788389688, -0.15824206309657343, -0.09609312068897526, 0.18330335104838014, 0.07953699493019313, 0.05870721185095357, -0.16595010457849885, 0.07418748181088311, 0.003096178893748721, 0.2505577101900771, 0.0303731733599577, 0.10768142437784164, 0.22697090597923947, 0.22173210441738972, 0.0034899656685239105, 0.06373230824593103, -0.07998569643953217, -0.06030584269870274, -0.22798258542929575, -0.11818351998973978, -0.19057540543301887, 0.08672361434641848, -0.08222900420406477, -0.15074202879583715, 0.31795118619708307, 0.18469189628455285, 0.1763715783442446, -0.02374356789073932, 0.21433638418533815, 0.1116140190931981, 0.10983563343580573, 0.05204200973054646, 0.31051117854155097, 0.18095407019230864, 0.09726976669657775, -0.27761435246793553, 0.05614458595723468, -0.023265800459272658] |
1,802.10508 | Brain Tumor Segmentation and Radiomics Survival Prediction: Contribution
to the BRATS 2017 Challenge | Quantitative analysis of brain tumors is critical for clinical decision
making. While manual segmentation is tedious, time consuming and subjective,
this task is at the same time very challenging to solve for automatic
segmentation methods. In this paper we present our most recent effort on
developing a robust segmentation algorithm in the form of a convolutional
neural network. Our network architecture was inspired by the popular U-Net and
has been carefully modified to maximize brain tumor segmentation performance.
We use a dice loss function to cope with class imbalances and use extensive
data augmentation to successfully prevent overfitting. Our method beats the
current state of the art on BraTS 2015, is one of the leading methods on the
BraTS 2017 validation set (dice scores of 0.896, 0.797 and 0.732 for whole
tumor, tumor core and enhancing tumor, respectively) and achieves very good
Dice scores on the test set (0.858 for whole, 0.775 for core and 0.647 for
enhancing tumor). We furthermore take part in the survival prediction
subchallenge by training an ensemble of a random forest regressor and
multilayer perceptrons on shape features describing the tumor subregions. Our
approach achieves 52.6% accuracy, a Spearman correlation coefficient of 0.496
and a mean square error of 209607 on the test set.
| cs.CV | quantitative analysis of brain tumors is critical for clinical decision making while manual segmentation is tedious time consuming and subjective this task is at the same time very challenging to solve for automatic segmentation methods in this paper we present our most recent effort on developing a robust segmentation algorithm in the form of a convolutional neural network our network architecture was inspired by the popular unet and has been carefully modified to maximize brain tumor segmentation performance we use a dice loss function to cope with class imbalances and use extensive data augmentation to successfully prevent overfitting our method beats the current state of the art on brats 2015 is one of the leading methods on the brats 2017 validation set dice scores of 0896 0797 and 0732 for whole tumor tumor core and enhancing tumor respectively and achieves very good dice scores on the test set 0858 for whole 0775 for core and 0647 for enhancing tumor we furthermore take part in the survival prediction subchallenge by training an ensemble of a random forest regressor and multilayer perceptrons on shape features describing the tumor subregions our approach achieves 526 accuracy a spearman correlation coefficient of 0496 and a mean square error of 209607 on the test set | [['quantitative', 'analysis', 'of', 'brain', 'tumors', 'is', 'critical', 'for', 'clinical', 'decision', 'making', 'while', 'manual', 'segmentation', 'is', 'tedious', 'time', 'consuming', 'and', 'subjective', 'this', 'task', 'is', 'at', 'the', 'same', 'time', 'very', 'challenging', 'to', 'solve', 'for', 'automatic', 'segmentation', 'methods', 'in', 'this', 'paper', 'we', 'present', 'our', 'most', 'recent', 'effort', 'on', 'developing', 'a', 'robust', 'segmentation', 'algorithm', 'in', 'the', 'form', 'of', 'a', 'convolutional', 'neural', 'network', 'our', 'network', 'architecture', 'was', 'inspired', 'by', 'the', 'popular', 'unet', 'and', 'has', 'been', 'carefully', 'modified', 'to', 'maximize', 'brain', 'tumor', 'segmentation', 'performance', 'we', 'use', 'a', 'dice', 'loss', 'function', 'to', 'cope', 'with', 'class', 'imbalances', 'and', 'use', 'extensive', 'data', 'augmentation', 'to', 'successfully', 'prevent', 'overfitting', 'our', 'method', 'beats', 'the', 'current', 'state', 'of', 'the', 'art', 'on', 'brats', '2015', 'is', 'one', 'of', 'the', 'leading', 'methods', 'on', 'the', 'brats', '2017', 'validation', 'set', 'dice', 'scores', 'of', '0896', '0797', 'and', '0732', 'for', 'whole', 'tumor', 'tumor', 'core', 'and', 'enhancing', 'tumor', 'respectively', 'and', 'achieves', 'very', 'good', 'dice', 'scores', 'on', 'the', 'test', 'set', '0858', 'for', 'whole', '0775', 'for', 'core', 'and', '0647', 'for', 'enhancing', 'tumor', 'we', 'furthermore', 'take', 'part', 'in', 'the', 'survival', 'prediction', 'subchallenge', 'by', 'training', 'an', 'ensemble', 'of', 'a', 'random', 'forest', 'regressor', 'and', 'multilayer', 'perceptrons', 'on', 'shape', 'features', 'describing', 'the', 'tumor', 'subregions', 'our', 'approach', 'achieves', '526', 'accuracy', 'a', 'spearman', 'correlation', 'coefficient', 'of', '0496', 'and', 'a', 'mean', 'square', 'error', 'of', '209607', 'on', 'the', 'test', 'set']] | [0.008718288670055533, -0.031440411394522166, -0.04154628228310694, 0.054012493715185114, -0.05666959884122086, -0.14528572948982463, 0.06389595065794543, 0.4372453424935612, -0.16353910342859923, -0.3160317873735215, 0.09685112871533341, -0.29767473823849816, -0.17368716159205577, 0.19094626931473613, -0.15643992250704247, 0.1246686607496903, 0.16109539239986795, 0.03705378921965704, -0.017182889887100677, -0.3228762386465706, 0.2555846116597796, 0.0715858231631562, 0.36490556484106296, 0.03716638646704923, 0.149878057820502, -0.03405177933816317, -0.04107279527104563, -0.009094936946116766, -0.0801375844731819, 0.16172563905151704, 0.2741242443989728, 0.18876502982223775, 0.3801029561996316, -0.37120731615861835, -0.2072683640492513, 0.07644328911970695, 0.12703492803412494, 0.08139578628821685, 0.013285372785297065, -0.33513000203917426, 0.09750740117604893, -0.14467054902708634, 0.01991838252324845, -0.1162110249588383, 0.013506914776916377, -0.056267073956387935, -0.3305171376571131, 0.14426230825033884, 0.02125648901671855, 0.08945612141855201, -0.08112764448053451, -0.14479978635889176, 0.02999937841679973, 0.19488941517474068, -0.008485929793588242, 0.12034613996123274, 0.141357582570886, -0.19960862719611341, -0.12758518914508762, 0.3099505263898108, -0.02412506187973535, -0.19800481866316302, 0.1745783182238971, -0.05774212316362466, -0.1357046433874622, 0.11983524469078342, 0.22988621682459534, 0.0934753949022267, -0.14663275366802003, -0.049400293105450604, -0.008974769413651188, 0.21248425146708813, 0.06420703895124584, -0.10038840403816335, 0.13937909859665648, 0.31540514883958704, 0.015367125876355862, 0.13921028799740126, -0.17733658781356137, -0.035518522414824234, -0.2084306750299211, -0.14967644865543622, -0.19464621508093596, -0.0298346963610977, -0.12660779731041935, -0.1989316315775971, 0.4304027485060573, 0.17566406227038625, 0.17398390714315345, 0.1401804053373095, 0.30671995174103744, 0.011396953587154273, 0.08478851091902048, 0.04828377524227723, 0.20171438752345128, 0.026243116630967886, 0.098286922620092, -0.2286739107761262, 0.12339790778826239, 0.08249385636325156] |
1,802.10509 | Are there monopoles in the quark-gluon plasma? | Monopole-like objects have been identified in multiple lattice studies, and
there is now a significant amount of literature on their importance in
phenomenology. Some analytic indications of their role, however, are still
missing. The 't Hooft-Polyakov monopoles, originally derived in the
Georgi-Glashow model, are an important dynamical ingredient in theories with
extended supersymmetry ${\cal N} = 2,\,4$, and help explain the issues related
with electric-magnetic duality. There is no such solution in QCD-like theories
without scalar fields. However, all of these theories have instantons and their
finite-$T$ constituents known as instanton-dyons (or instanton-monopoles). The
latter leads to semiclassical partition functions, which for ${\cal N} = 2,\,4$
theories were shown to be identical ("Poisson dual") to the partition function
for monopoles. We show how, in a pure gauge theory, the semiclassical
instanton-based partition function can also be Poisson-transformed into a
partition function, interpreted as the one of moving and rotating monopoles.
| hep-ph hep-th nucl-th | monopolelike objects have been identified in multiple lattice studies and there is now a significant amount of literature on their importance in phenomenology some analytic indications of their role however are still missing the t hooftpolyakov monopoles originally derived in the georgiglashow model are an important dynamical ingredient in theories with extended supersymmetry cal n 24 and help explain the issues related with electricmagnetic duality there is no such solution in qcdlike theories without scalar fields however all of these theories have instantons and their finitet constituents known as instantondyons or instantonmonopoles the latter leads to semiclassical partition functions which for cal n 24 theories were shown to be identical poisson dual to the partition function for monopoles we show how in a pure gauge theory the semiclassical instantonbased partition function can also be poissontransformed into a partition function interpreted as the one of moving and rotating monopoles | [['monopolelike', 'objects', 'have', 'been', 'identified', 'in', 'multiple', 'lattice', 'studies', 'and', 'there', 'is', 'now', 'a', 'significant', 'amount', 'of', 'literature', 'on', 'their', 'importance', 'in', 'phenomenology', 'some', 'analytic', 'indications', 'of', 'their', 'role', 'however', 'are', 'still', 'missing', 'the', 't', 'hooftpolyakov', 'monopoles', 'originally', 'derived', 'in', 'the', 'georgiglashow', 'model', 'are', 'an', 'important', 'dynamical', 'ingredient', 'in', 'theories', 'with', 'extended', 'supersymmetry', 'cal', 'n', '24', 'and', 'help', 'explain', 'the', 'issues', 'related', 'with', 'electricmagnetic', 'duality', 'there', 'is', 'no', 'such', 'solution', 'in', 'qcdlike', 'theories', 'without', 'scalar', 'fields', 'however', 'all', 'of', 'these', 'theories', 'have', 'instantons', 'and', 'their', 'finitet', 'constituents', 'known', 'as', 'instantondyons', 'or', 'instantonmonopoles', 'the', 'latter', 'leads', 'to', 'semiclassical', 'partition', 'functions', 'which', 'for', 'cal', 'n', '24', 'theories', 'were', 'shown', 'to', 'be', 'identical', 'poisson', 'dual', 'to', 'the', 'partition', 'function', 'for', 'monopoles', 'we', 'show', 'how', 'in', 'a', 'pure', 'gauge', 'theory', 'the', 'semiclassical', 'instantonbased', 'partition', 'function', 'can', 'also', 'be', 'poissontransformed', 'into', 'a', 'partition', 'function', 'interpreted', 'as', 'the', 'one', 'of', 'moving', 'and', 'rotating', 'monopoles']] | [-0.11850420802714443, 0.19570698508397646, -0.08431592781958329, 0.16202335111752508, -0.059271428236725175, -0.12830944816173262, -0.012143738507047664, 0.3602401530306761, -0.18175714395205383, -0.307407313641034, 0.08056182521522096, -0.2702877104605491, -0.17215055725093753, 0.11118275424794985, -0.041794660221626916, 0.05471699223631904, -0.031818887857137386, 0.06308681922838041, -0.05371740310243806, -0.2634711576020662, 0.2806929259427956, 0.0028454220337400427, 0.23823459443895995, 0.06574631020186, 0.04529589331601144, -0.01873249423826354, -0.015843245631628703, 0.04523698735006508, -0.08703050053152604, 0.049486636008741015, 0.2516738802549385, 0.09193599648729321, 0.1706887831274724, -0.46048703014242404, -0.23186918639508233, 0.13664035419030685, 0.1971961197207308, 0.09162326205163865, -0.060059609466753455, -0.24798470529011724, 0.09224491815405841, -0.17423942624306193, -0.15797798933705226, -0.0964571708673928, 0.030609917050848406, -0.019015564068480314, -0.2275266285263458, 0.051777661673298586, 0.03173308980593388, 0.04651062898844683, -0.06989551542428177, -0.1416853212364981, -0.06043052411682549, 0.11056698894692066, 0.12493777165718402, 0.10940003337585652, 0.0922050039556359, -0.18808063006560718, -0.1534599511239513, 0.3790679288470522, -0.024969149791147737, -0.24592475712831532, 0.1997264225881699, -0.12511813165588292, -0.19011217792879562, 0.09707007593266209, 0.08437282657314117, 0.15303822736046752, -0.1309028452857822, 0.1663846478268479, -0.06263591877507921, 0.11589350328673007, 0.06515485424624413, 0.08714665061252534, 0.291829808710181, 0.07421925715265834, 0.009208061478930671, 0.13736928972656376, 0.021833134398535906, -0.1565347615166941, -0.34017625858818756, -0.1366300613716004, -0.13774230448310548, 0.09024432773518117, -0.08943312018309865, -0.18062941926641574, 0.3005871472747198, 0.12472176762158368, 0.20480907287093855, 0.007031028052050696, 0.18304780112313374, 0.12776483440625983, 0.1179115964419709, 0.019428959967874207, 0.24283721858455773, 0.16670287824806054, 0.07323876808897979, -0.19909734079823355, -0.05074129909352989, 0.14308176183008722] |
1,802.1051 | Automated design of collective variables using supervised machine
learning | Selection of appropriate collective variables for enhancing sampling of
molecular simulations remains an unsolved problem in computational biophysics.
In particular, picking initial collective variables (CVs) is particularly
challenging in higher dimensions. Which atomic coordinates or transforms there
of from a list of thousands should one pick for enhanced sampling runs? How
does a modeler even begin to pick starting coordinates for investigation? This
remains true even in the case of simple two state systems and only increases in
difficulty for multi-state systems. In this work, we solve the initial CV
problem using a data-driven approach inspired by the filed of supervised
machine learning. In particular, we show how the decision functions in
supervised machine learning (SML) algorithms can be used as initial CVs
(SML_cv) for accelerated sampling. Using solvated alanine dipeptide and
Chignolin mini-protein as our test cases, we illustrate how the distance to the
Support Vector Machines' decision hyperplane, the output probability estimates
from Logistic Regression, the outputs from deep neural network classifiers, and
other classifiers may be used to reversibly sample slow structural transitions.
We discuss the utility of other SML algorithms that might be useful for
identifying CVs for accelerating molecular simulations.
| stat.ML cs.CE q-bio.BM | selection of appropriate collective variables for enhancing sampling of molecular simulations remains an unsolved problem in computational biophysics in particular picking initial collective variables cvs is particularly challenging in higher dimensions which atomic coordinates or transforms there of from a list of thousands should one pick for enhanced sampling runs how does a modeler even begin to pick starting coordinates for investigation this remains true even in the case of simple two state systems and only increases in difficulty for multistate systems in this work we solve the initial cv problem using a datadriven approach inspired by the filed of supervised machine learning in particular we show how the decision functions in supervised machine learning sml algorithms can be used as initial cvs sml_cv for accelerated sampling using solvated alanine dipeptide and chignolin miniprotein as our test cases we illustrate how the distance to the support vector machines decision hyperplane the output probability estimates from logistic regression the outputs from deep neural network classifiers and other classifiers may be used to reversibly sample slow structural transitions we discuss the utility of other sml algorithms that might be useful for identifying cvs for accelerating molecular simulations | [['selection', 'of', 'appropriate', 'collective', 'variables', 'for', 'enhancing', 'sampling', 'of', 'molecular', 'simulations', 'remains', 'an', 'unsolved', 'problem', 'in', 'computational', 'biophysics', 'in', 'particular', 'picking', 'initial', 'collective', 'variables', 'cvs', 'is', 'particularly', 'challenging', 'in', 'higher', 'dimensions', 'which', 'atomic', 'coordinates', 'or', 'transforms', 'there', 'of', 'from', 'a', 'list', 'of', 'thousands', 'should', 'one', 'pick', 'for', 'enhanced', 'sampling', 'runs', 'how', 'does', 'a', 'modeler', 'even', 'begin', 'to', 'pick', 'starting', 'coordinates', 'for', 'investigation', 'this', 'remains', 'true', 'even', 'in', 'the', 'case', 'of', 'simple', 'two', 'state', 'systems', 'and', 'only', 'increases', 'in', 'difficulty', 'for', 'multistate', 'systems', 'in', 'this', 'work', 'we', 'solve', 'the', 'initial', 'cv', 'problem', 'using', 'a', 'datadriven', 'approach', 'inspired', 'by', 'the', 'filed', 'of', 'supervised', 'machine', 'learning', 'in', 'particular', 'we', 'show', 'how', 'the', 'decision', 'functions', 'in', 'supervised', 'machine', 'learning', 'sml', 'algorithms', 'can', 'be', 'used', 'as', 'initial', 'cvs', 'sml_cv', 'for', 'accelerated', 'sampling', 'using', 'solvated', 'alanine', 'dipeptide', 'and', 'chignolin', 'miniprotein', 'as', 'our', 'test', 'cases', 'we', 'illustrate', 'how', 'the', 'distance', 'to', 'the', 'support', 'vector', 'machines', 'decision', 'hyperplane', 'the', 'output', 'probability', 'estimates', 'from', 'logistic', 'regression', 'the', 'outputs', 'from', 'deep', 'neural', 'network', 'classifiers', 'and', 'other', 'classifiers', 'may', 'be', 'used', 'to', 'reversibly', 'sample', 'slow', 'structural', 'transitions', 'we', 'discuss', 'the', 'utility', 'of', 'other', 'sml', 'algorithms', 'that', 'might', 'be', 'useful', 'for', 'identifying', 'cvs', 'for', 'accelerating', 'molecular', 'simulations']] | [-0.06261774464558388, 0.09947501284080214, -0.07542125845193556, 0.10164174699937426, -0.07622232903083115, -0.1941984724085394, 0.10123934383388877, 0.42728978551002506, -0.30153833796298996, -0.285532244159504, 0.08505748624711768, -0.23204538211485698, -0.1509027507590591, 0.20642385196262375, -0.08586531543393724, 0.09043796453624964, 0.11307942232875556, 0.013730948942127763, -0.05184489675166239, -0.2926386335634233, 0.29222212992992597, 0.038721990592618105, 0.26450096378967014, -0.04897655592751257, 0.10786363850083663, 0.029720382136052725, 0.009737636809976599, 0.010843462824464651, -0.06193086932331219, 0.12533163336722525, 0.34490053715981234, 0.19783548890977867, 0.34477635348196495, -0.4015108508958536, -0.2194605785633255, 0.13151332744776473, 0.19848519998852202, 0.1394704305176796, -0.037529971822616214, -0.246105446171774, 0.04465238390413603, -0.13014376348442008, -0.09880004111034124, -0.14783529949988977, -0.014495728004720187, 0.03498133160557944, -0.28089745256320103, 0.050904776737785214, 0.05597997994309762, 0.06114156188961772, -0.08224865899555692, -0.14549893490998939, 0.030456784268908355, 0.11968272016623739, 0.036514763534309096, 0.06602425877480124, 0.17973435407062782, -0.17734999955180533, -0.16192656023111002, 0.363967180463303, -0.02124297171207049, -0.2108230325585404, 0.21747747792852754, -0.04680560875117548, -0.19642296121662756, 0.0960354786630259, 0.2347198560925143, 0.12131293533974778, -0.15801241277649844, 0.025352906146790043, -0.018190717970299506, 0.16892160890748745, 0.045721305287611126, -0.03296919723194976, 0.1788643931336317, 0.1970091787330115, 0.016750669082237848, 0.15122106364692955, -0.09262225808219902, -0.11405185012197237, -0.22950331431803936, -0.14022776974183893, -0.20872092771538311, 0.023677258488251685, -0.09333847814274666, -0.13871825201264054, 0.3407241522584149, 0.21299344763944655, 0.17749818037600093, 0.050851704008498026, 0.28622383149832814, 0.0824380984773485, 0.04424670420511453, 0.09393156249767419, 0.20510048154002228, 0.08114898211404335, 0.08733822322287357, -0.1960354121173876, 0.10423555838534627, 0.033853639178842154] |
1,802.10511 | Sidon set systems | A family ${\mathcal A}$ of $k$-subsets of $\{1,2,\dots, N\}$ is a Sidon
system if the sumsets $A+B$, $A,B\in \mathcal{A}$ are pairwise distinct. We
show that the largest cardinality $F_k(N)$ of a Sidon system of $k$-subsets of
$[N]$ satisfies $F_k(N)\le {N-1\choose k-1}+N-k$ and the asymptotic lower bound
$F_k(N)=\Omega_k(N^{k-1})$. More precise bounds on $F_k(N)$ are obtained for
$k\le 3$. We also obtain the threshold probability for a random system to be
Sidon for $k\ge 2$.
| math.CO | a family mathcal a of ksubsets of 12dots n is a sidon system if the sumsets ab abin mathcala are pairwise distinct we show that the largest cardinality f_kn of a sidon system of ksubsets of n satisfies f_knle n1choose k1nk and the asymptotic lower bound f_knomega_knk1 more precise bounds on f_kn are obtained for kle 3 we also obtain the threshold probability for a random system to be sidon for kge 2 | [['a', 'family', 'mathcal', 'a', 'of', 'ksubsets', 'of', '12dots', 'n', 'is', 'a', 'sidon', 'system', 'if', 'the', 'sumsets', 'ab', 'abin', 'mathcala', 'are', 'pairwise', 'distinct', 'we', 'show', 'that', 'the', 'largest', 'cardinality', 'f_kn', 'of', 'a', 'sidon', 'system', 'of', 'ksubsets', 'of', 'n', 'satisfies', 'f_knle', 'n1choose', 'k1nk', 'and', 'the', 'asymptotic', 'lower', 'bound', 'f_knomega_knk1', 'more', 'precise', 'bounds', 'on', 'f_kn', 'are', 'obtained', 'for', 'kle', '3', 'we', 'also', 'obtain', 'the', 'threshold', 'probability', 'for', 'a', 'random', 'system', 'to', 'be', 'sidon', 'for', 'kge', '2']] | [-0.26291723157653035, 0.16236004189417605, -0.03881592704901393, 0.04770484257941987, 0.002913909662567394, -0.20489645983472887, 0.07439876409431159, 0.3076946489335838, -0.2242890358377825, -0.2164225057685669, 0.07380299233424832, -0.40445208368481883, -0.08757956512487562, 0.18219690061580968, -0.05947821635857854, 0.0562629478478978, 0.07261869214265279, 0.16057971675066987, -0.0017460783005652713, -0.3174928171219121, 0.3108362621614631, -0.12043008189910734, 0.14713741631679972, 0.0018708230534069975, 0.08203630915410082, -0.0331205124802835, 0.07250876807358483, 0.0270885314634988, -0.26644846643897147, 0.08918717580939263, 0.24481497837097752, 0.21941634579102548, 0.25807496981406713, -0.31944385808433445, -0.06950223969269387, 0.22888822555804336, 0.1820951431701091, -0.005324844533288983, 0.02196298318018999, -0.21242989378023736, 0.2023855719426778, -0.140025143013139, -0.12343722656631553, -0.023163134481390596, 0.1925871063705901, 0.033866039975743056, -0.4267767033028141, -0.013771966257555621, 0.13689181216480867, 0.06250877557715899, -0.0004642898730054813, -0.2740230271051651, -0.016893346977590675, 0.08371030260533305, -0.08210861584840631, 0.060872177770492475, -0.004220823468771619, -0.010766863539277144, -0.08410803186641612, 0.3251018054204547, -0.03602863275314826, -0.15779678163472827, 0.05318844200170953, -0.16455832864879302, -0.1902566636505891, 0.12057051570220313, 0.09536154185172538, 0.1953747677551189, -0.05941662189065361, 0.1820124543303112, -0.18815508675695936, 0.18140267524343562, 0.1423903960262386, 0.06271481872733001, 0.06876069403082972, 0.10995610876822136, 0.16606918184257205, 0.14417860039647565, 0.01927953521052087, 0.07104348681185027, -0.34074961824316374, -0.13383916969834106, -0.24237468157908026, 0.15140702531666456, -0.20625351219496224, -0.16951466911360885, 0.29494808860857724, 0.07585096214963517, 0.1780002374975929, 0.19555738172493875, 0.18407287176605805, 0.07087849192058956, -0.023744151337255895, 0.1448746742024808, 0.08361961632232431, 0.1615871977959563, -0.14403831441296447, -0.15142006546416334, 0.008972887113742846, 0.1814533611628371] |
1,802.10512 | Engineered Swift Equilibration for Brownian objects: from underdamped to
overdamped dynamics | We propose a general framework to study transformations that drive an
underdamped Brownian particle in contact with a thermal bath from an
equilibrium state to a new one in an arbitrarily short time. To this end, we
make use of a time and space-dependent potential, that plays a dual role:
confine the particle, and manipulate the system. In the special case of an
isothermal compression or decompression of a harmonically trapped particle, we
derive explicit protocols that perform this quick transformation, following an
inverse engineering method. We focus on the properties of these protocols,
which crucially depend on two key dimensionless numbers that characterize the
relative values of the three timescales of the problem, associated with
friction, oscillations in the confinement and duration of the protocol. In
particular, we show that our protocols encompass the known overdamped version
of this problem and extend it to any friction for decompression and to a large
range of frictions for compression.
| cond-mat.stat-mech | we propose a general framework to study transformations that drive an underdamped brownian particle in contact with a thermal bath from an equilibrium state to a new one in an arbitrarily short time to this end we make use of a time and spacedependent potential that plays a dual role confine the particle and manipulate the system in the special case of an isothermal compression or decompression of a harmonically trapped particle we derive explicit protocols that perform this quick transformation following an inverse engineering method we focus on the properties of these protocols which crucially depend on two key dimensionless numbers that characterize the relative values of the three timescales of the problem associated with friction oscillations in the confinement and duration of the protocol in particular we show that our protocols encompass the known overdamped version of this problem and extend it to any friction for decompression and to a large range of frictions for compression | [['we', 'propose', 'a', 'general', 'framework', 'to', 'study', 'transformations', 'that', 'drive', 'an', 'underdamped', 'brownian', 'particle', 'in', 'contact', 'with', 'a', 'thermal', 'bath', 'from', 'an', 'equilibrium', 'state', 'to', 'a', 'new', 'one', 'in', 'an', 'arbitrarily', 'short', 'time', 'to', 'this', 'end', 'we', 'make', 'use', 'of', 'a', 'time', 'and', 'spacedependent', 'potential', 'that', 'plays', 'a', 'dual', 'role', 'confine', 'the', 'particle', 'and', 'manipulate', 'the', 'system', 'in', 'the', 'special', 'case', 'of', 'an', 'isothermal', 'compression', 'or', 'decompression', 'of', 'a', 'harmonically', 'trapped', 'particle', 'we', 'derive', 'explicit', 'protocols', 'that', 'perform', 'this', 'quick', 'transformation', 'following', 'an', 'inverse', 'engineering', 'method', 'we', 'focus', 'on', 'the', 'properties', 'of', 'these', 'protocols', 'which', 'crucially', 'depend', 'on', 'two', 'key', 'dimensionless', 'numbers', 'that', 'characterize', 'the', 'relative', 'values', 'of', 'the', 'three', 'timescales', 'of', 'the', 'problem', 'associated', 'with', 'friction', 'oscillations', 'in', 'the', 'confinement', 'and', 'duration', 'of', 'the', 'protocol', 'in', 'particular', 'we', 'show', 'that', 'our', 'protocols', 'encompass', 'the', 'known', 'overdamped', 'version', 'of', 'this', 'problem', 'and', 'extend', 'it', 'to', 'any', 'friction', 'for', 'decompression', 'and', 'to', 'a', 'large', 'range', 'of', 'frictions', 'for', 'compression']] | [-0.13449588710666174, 0.1546999808365687, -0.10886884729165726, 0.02280455649184959, -0.02966995417034324, -0.15245591281453455, 0.05443786550386915, 0.36006262747547296, -0.28942266198411537, -0.2744809170253575, 0.07963034362882918, -0.2140273666141932, -0.14065260322959033, 0.2270421832203099, -0.05410729222039433, 0.03756021766245875, 0.044797454421302375, 0.032444871200213235, -0.05030489207357404, -0.21522406006196537, 0.3095915424077524, 0.05639822478700854, 0.25526288332111097, 0.056674218329872135, 0.11826802641698572, 0.03342792998757685, 0.0174166047490641, -0.0004695956889964357, -0.17137179392458293, 0.08110341339967438, 0.17315923476803907, 0.053309126839607576, 0.2829705586338628, -0.4530933727038718, -0.20253746825140678, 0.12453186424829278, 0.131997813594445, 0.14246557694432455, -0.05818872082288837, -0.21674353839045601, 0.01999282189114373, -0.1759133099289493, -0.14155782667236239, -0.07941808087362236, 0.04485715391656643, 0.04815456578714325, -0.2579247833736524, 0.07253683187130414, 0.09088657296556851, 0.016146476728299372, -0.08389680115564997, -0.022172868701252096, 0.06663900686728567, 0.12947301138074527, 0.03268574070055745, -0.0008305628386862529, 0.16347635881621628, -0.14266881804774764, -0.10572346632628218, 0.39628216080791967, -0.07375018311446367, -0.22007477502456477, 0.2058229490641587, -0.0960391570749115, -0.1397391955568632, 0.10486115929832729, 0.20562953856638103, 0.13964875910690502, -0.14291069382279256, 0.02946102198418171, -0.02666719490662217, 0.18494483340631793, 0.060796636563454624, 0.016944043870641013, 0.17836235418526716, 0.15929112360294012, 0.0843957525249158, 0.194670145921527, -0.07860747938776755, -0.12809056045982656, -0.31199894225389896, -0.19150225822872755, -0.17113675172529125, 0.044851567478308194, -0.08821392754530107, -0.19074781464937415, 0.3779749086162052, 0.20104610658533684, 0.21078792007940622, 0.04952189293645817, 0.2845095872902606, 0.11579421905084525, 0.011232111544077154, 0.07293673008503511, 0.23206217293450726, 0.11025592909029484, 0.11805595216470995, -0.25856332341061694, 0.0176462114499764, 0.046816133031963456] |
1,802.10513 | Bosonic dark matter halos: excited states and relaxation in the
potential of the ground state | An ultra-light axion field with mass $\sim 10^{-22}\ {\rm eV}$, also known as
wave or fuzzy dark matter, has been proposed as a component of the dark matter
in the Universe. We study the evolution of the axion dark matter distribution
in the central region of a halo, assuming the mass is dominated by this axion
field, and that gravity is the only important interaction. We calculate the
excited axion states in the spherical gravitational potential generated by the
self-gravitating ground-state, also known as soliton. These excited states are
similar to the states of the hydrogen atom with quantum numbers $(n,l,m)$, here
designating oscillation modes of a classical wave. At fixed $n$, the modes with
highest $l$ have the lowest energy because of the extended mass distribution
generating the potential. We use an approximate analytical treatment to derive
the distribution of mass in these states when a steady-state is reached by
dynamical relaxation, and find that a corona with a mass density profile $\rho
\propto r^{-5/3}$ should be set up around the central soliton, analogous to the
Bahcall-Wolf cusp predicted for the stellar distribution around a central black
hole. The central soliton accretes dark matter from the corona as dynamical
relaxation proceeds and negative orbital energy flows out. This density profile
should remain valid out to the radius where the mass in the corona is
comparable to the mass of the central soliton; further than that, the
gravitational potential depends on the initial distribution of dark matter and
the relaxation time increases rapidly with radius.
| astro-ph.CO astro-ph.GA | an ultralight axion field with mass sim 1022 rm ev also known as wave or fuzzy dark matter has been proposed as a component of the dark matter in the universe we study the evolution of the axion dark matter distribution in the central region of a halo assuming the mass is dominated by this axion field and that gravity is the only important interaction we calculate the excited axion states in the spherical gravitational potential generated by the selfgravitating groundstate also known as soliton these excited states are similar to the states of the hydrogen atom with quantum numbers nlm here designating oscillation modes of a classical wave at fixed n the modes with highest l have the lowest energy because of the extended mass distribution generating the potential we use an approximate analytical treatment to derive the distribution of mass in these states when a steadystate is reached by dynamical relaxation and find that a corona with a mass density profile rho propto r53 should be set up around the central soliton analogous to the bahcallwolf cusp predicted for the stellar distribution around a central black hole the central soliton accretes dark matter from the corona as dynamical relaxation proceeds and negative orbital energy flows out this density profile should remain valid out to the radius where the mass in the corona is comparable to the mass of the central soliton further than that the gravitational potential depends on the initial distribution of dark matter and the relaxation time increases rapidly with radius | [['an', 'ultralight', 'axion', 'field', 'with', 'mass', 'sim', '1022', 'rm', 'ev', 'also', 'known', 'as', 'wave', 'or', 'fuzzy', 'dark', 'matter', 'has', 'been', 'proposed', 'as', 'a', 'component', 'of', 'the', 'dark', 'matter', 'in', 'the', 'universe', 'we', 'study', 'the', 'evolution', 'of', 'the', 'axion', 'dark', 'matter', 'distribution', 'in', 'the', 'central', 'region', 'of', 'a', 'halo', 'assuming', 'the', 'mass', 'is', 'dominated', 'by', 'this', 'axion', 'field', 'and', 'that', 'gravity', 'is', 'the', 'only', 'important', 'interaction', 'we', 'calculate', 'the', 'excited', 'axion', 'states', 'in', 'the', 'spherical', 'gravitational', 'potential', 'generated', 'by', 'the', 'selfgravitating', 'groundstate', 'also', 'known', 'as', 'soliton', 'these', 'excited', 'states', 'are', 'similar', 'to', 'the', 'states', 'of', 'the', 'hydrogen', 'atom', 'with', 'quantum', 'numbers', 'nlm', 'here', 'designating', 'oscillation', 'modes', 'of', 'a', 'classical', 'wave', 'at', 'fixed', 'n', 'the', 'modes', 'with', 'highest', 'l', 'have', 'the', 'lowest', 'energy', 'because', 'of', 'the', 'extended', 'mass', 'distribution', 'generating', 'the', 'potential', 'we', 'use', 'an', 'approximate', 'analytical', 'treatment', 'to', 'derive', 'the', 'distribution', 'of', 'mass', 'in', 'these', 'states', 'when', 'a', 'steadystate', 'is', 'reached', 'by', 'dynamical', 'relaxation', 'and', 'find', 'that', 'a', 'corona', 'with', 'a', 'mass', 'density', 'profile', 'rho', 'propto', 'r53', 'should', 'be', 'set', 'up', 'around', 'the', 'central', 'soliton', 'analogous', 'to', 'the', 'bahcallwolf', 'cusp', 'predicted', 'for', 'the', 'stellar', 'distribution', 'around', 'a', 'central', 'black', 'hole', 'the', 'central', 'soliton', 'accretes', 'dark', 'matter', 'from', 'the', 'corona', 'as', 'dynamical', 'relaxation', 'proceeds', 'and', 'negative', 'orbital', 'energy', 'flows', 'out', 'this', 'density', 'profile', 'should', 'remain', 'valid', 'out', 'to', 'the', 'radius', 'where', 'the', 'mass', 'in', 'the', 'corona', 'is', 'comparable', 'to', 'the', 'mass', 'of', 'the', 'central', 'soliton', 'further', 'than', 'that', 'the', 'gravitational', 'potential', 'depends', 'on', 'the', 'initial', 'distribution', 'of', 'dark', 'matter', 'and', 'the', 'relaxation', 'time', 'increases', 'rapidly', 'with', 'radius']] | [-0.1330589746654618, 0.19308184601889247, -0.10217123327995925, 0.12619755687648612, -0.0379865184654573, -0.061596258922352216, 0.0028370142905224187, 0.307128462129656, -0.20153990551080628, -0.33607058387761024, 0.054427588068167956, -0.2621675685340283, -0.025000723536290667, 0.15677812165197205, 0.04734374461752618, 0.032285818138945044, -0.020787077688374647, 0.07815548596702808, -0.05744832487384259, -0.17870330426148048, 0.3484504364777868, 0.07085505608131415, 0.1910644065771325, 0.03433885018697337, 0.05118724885670578, -0.03870736492943822, 0.029759632513000102, -0.03080052624584413, -0.16355395304120726, 0.04253378223682589, 0.16930577823111567, 0.07576052090244405, 0.2383510337348151, -0.3975259840853658, -0.22598975367898888, 0.1157750658417011, 0.19630324670351018, 0.10511927030359705, -0.09715575042281153, -0.27607295586015373, 0.06020901211738294, -0.20988984553545129, -0.1846527335180344, -0.0061394706916283156, 0.07238117408317825, 0.021684597290175803, -0.23584868677837006, 0.15282870785438218, 0.006554546512836846, -0.07684364361578927, -0.100825389067405, -0.11561095414080602, -0.08112963412103115, 0.03005139447221368, 0.08720914862465624, 0.06239215074855761, 0.22182908372807444, -0.181550571514184, -0.020058266206772302, 0.3950366907406087, -0.12072592960589557, -0.12197614571846584, 0.1559767161130759, -0.18668272299874647, -0.0962192948402006, 0.15677755472578986, 0.1316349566644788, 0.11230447589255431, -0.09844915633136635, 0.0777682181292524, -0.058001528612643884, 0.21040636277666278, 0.09471159759160204, 0.03281360005448554, 0.3662292456181318, 0.14641319528340782, 0.07424442359867195, 0.08793645345505473, -0.11766632707132137, -0.09439975271257116, -0.2845851575846181, -0.1315752752924192, -0.19239655421161111, 0.06598662219555848, -0.08856245788960151, -0.13432736422720493, 0.36864962601194196, 0.08647913682142126, 0.2054188342545839, 0.030027389654195775, 0.2836141603779705, 0.15679798717205368, 0.058067923579730236, 0.11347438215698097, 0.3084107194753254, 0.19080240067879797, 0.09029149698897028, -0.2721653630162644, -0.037355751414582423, 0.008366015492299315] |
1,802.10514 | Toll Caps in Privatized Road Networks | We consider a network pricing game on a parallel network with congestion
effects in which link owners set tolls for travel so as to maximize profit. A
central authority is able to regulate this competition by means of a (uniform)
price cap. The first question we want to answer is how such a cap should be
designed in order to minimize the total congestion. We provide an algorithm
that finds an optimal price cap for networks with affine latency functions and
a full support Wardrop equilibrium. Second, we consider the induced network
performance at an optimal price cap. We show that for two link networks with
affine latency functions, the congestion costs at the optimal price cap are at
most $8/7$ times the optimal congestion costs. For more general latency
functions, this bound goes up to 2 under the assumption that an uncapped Nash
equilibrium exists. However, in general such an equilibrium need not exist and
this can be used to show that optimal price caps can induce arbitrarily
inefficient flows.
| cs.GT | we consider a network pricing game on a parallel network with congestion effects in which link owners set tolls for travel so as to maximize profit a central authority is able to regulate this competition by means of a uniform price cap the first question we want to answer is how such a cap should be designed in order to minimize the total congestion we provide an algorithm that finds an optimal price cap for networks with affine latency functions and a full support wardrop equilibrium second we consider the induced network performance at an optimal price cap we show that for two link networks with affine latency functions the congestion costs at the optimal price cap are at most 87 times the optimal congestion costs for more general latency functions this bound goes up to 2 under the assumption that an uncapped nash equilibrium exists however in general such an equilibrium need not exist and this can be used to show that optimal price caps can induce arbitrarily inefficient flows | [['we', 'consider', 'a', 'network', 'pricing', 'game', 'on', 'a', 'parallel', 'network', 'with', 'congestion', 'effects', 'in', 'which', 'link', 'owners', 'set', 'tolls', 'for', 'travel', 'so', 'as', 'to', 'maximize', 'profit', 'a', 'central', 'authority', 'is', 'able', 'to', 'regulate', 'this', 'competition', 'by', 'means', 'of', 'a', 'uniform', 'price', 'cap', 'the', 'first', 'question', 'we', 'want', 'to', 'answer', 'is', 'how', 'such', 'a', 'cap', 'should', 'be', 'designed', 'in', 'order', 'to', 'minimize', 'the', 'total', 'congestion', 'we', 'provide', 'an', 'algorithm', 'that', 'finds', 'an', 'optimal', 'price', 'cap', 'for', 'networks', 'with', 'affine', 'latency', 'functions', 'and', 'a', 'full', 'support', 'wardrop', 'equilibrium', 'second', 'we', 'consider', 'the', 'induced', 'network', 'performance', 'at', 'an', 'optimal', 'price', 'cap', 'we', 'show', 'that', 'for', 'two', 'link', 'networks', 'with', 'affine', 'latency', 'functions', 'the', 'congestion', 'costs', 'at', 'the', 'optimal', 'price', 'cap', 'are', 'at', 'most', '87', 'times', 'the', 'optimal', 'congestion', 'costs', 'for', 'more', 'general', 'latency', 'functions', 'this', 'bound', 'goes', 'up', 'to', '2', 'under', 'the', 'assumption', 'that', 'an', 'uncapped', 'nash', 'equilibrium', 'exists', 'however', 'in', 'general', 'such', 'an', 'equilibrium', 'need', 'not', 'exist', 'and', 'this', 'can', 'be', 'used', 'to', 'show', 'that', 'optimal', 'price', 'caps', 'can', 'induce', 'arbitrarily', 'inefficient', 'flows']] | [-0.14114334924185337, 0.045785587717801446, -0.057256854419754435, 0.11693137712138078, -0.0735508191034372, -0.14524110902797932, 0.1414770930842088, 0.4289730766526701, -0.32502505761416006, -0.24891725521431202, 0.1268329959266073, -0.2732309920724198, -0.15332121695037823, 0.1262436572391518, -0.16675914855359383, 0.03769880096218413, 0.022413260359943392, 0.027717849401905532, 0.029381503029699215, -0.28543740983954385, 0.2873878764609496, 0.07274543330868521, 0.2754896992915555, 0.10177116499422663, 0.09316138863803176, -0.03205357002344919, 0.07057779363754113, 0.047241107754719756, -0.1624280621976066, 0.08253751058207705, 0.31685007865437204, 0.15996481185746297, 0.34463498168434314, -0.47967861699517705, -0.1551645962161976, 0.188875735056592, 0.08258208549684948, 0.06169517176451804, -0.00298324477294125, -0.17189188310822026, 0.10958121947628277, -0.21205914473673057, -0.09192514652113991, -0.05323946541338636, -0.0022590766056326396, 0.042613793447020064, -0.35629698437807417, -0.02261355140230112, 0.02238898852578642, 0.0004697772226642207, -0.047300023428431294, -0.08480969107742503, -0.03235644799090748, 0.17953755546426564, 0.02296893670358769, 0.05854896679030437, 0.13371045022865224, -0.11675254736239994, -0.18353594609601587, 0.3809519183838315, -0.06418613379083203, -0.21841699625664984, 0.12510440116938834, -0.08029296293130352, -0.12307541878902141, 0.1354211414047675, 0.23167434243256585, 0.07372301275030388, -0.14813063315208458, 0.038474357507207936, -0.06355809414628566, 0.16892380062871945, 0.09365701017770589, 0.019586563658388605, 0.15789112404985517, 0.15709751745282907, 0.26328769605640834, 0.14171497823468993, -0.036727388684872034, -0.12436156841376197, -0.26864605221886473, -0.13268348339527072, -0.14480822808953406, 0.08225309498858643, -0.10170847629193538, -0.12547570897527693, 0.3356452579746208, 0.12661975808577797, 0.15884718667969042, 0.13154780201148242, 0.2987409934737823, 0.12161999985404456, 0.012729552623472716, 0.22410593540761728, 0.1957059114441624, -0.027697211432703688, 0.10447908927685151, -0.2000350261967267, 0.13746257243699758, 0.024260762493447427] |
1,802.10515 | Stochastic Dynamic Programming Heuristics for Influence
Maximization-Revenue Optimization | The well-known Influence Maximization (IM) problem has been actively studied
by researchers over the past decade, with emphasis on marketing and social
networks. Existing research have obtained solutions to the IM problem by
obtaining the influence spread and utilizing the property of submodularity.
This paper is based on a novel approach to the IM problem geared towards
optimizing clicks and consequently revenue within anOnline Social Network
(OSN). Our approach diverts from existing approaches by adopting a novel,
decision-making perspective through implementing Stochastic Dynamic Programming
(SDP). Thus, we define a new problem Influence Maximization-Revenue
Optimization (IM-RO) and propose SDP as a method in which this problem can be
solved. The SDP method has lucrative gains for an advertiser in terms of
optimizing clicks and generating revenue however, one drawback to the method is
its associated "curse of dimensionality" particularly for problems involving a
large state space. Thus, we introduce the Lawrence Degree Heuristic (LDH),
Adaptive Hill-Climbing (AHC) and Multistage Particle Swarm Optimization (MPSO)
heuristics as methods which are orders of magnitude faster than the SDP method
whilst achieving near-optimal results. Through a comparative analysis on
various synthetic and real-world networks we present the AHC and LDH as
heuristics well suited to to the IM-RO problem in terms of their accuracy,
running times and scalability under ideal model parameters. In this paper we
present a compelling survey on the SDP method as a practical and lucrative
method for spreading information and optimizing revenue within the context of
OSNs.
| stat.ML cs.LG math.OC | the wellknown influence maximization im problem has been actively studied by researchers over the past decade with emphasis on marketing and social networks existing research have obtained solutions to the im problem by obtaining the influence spread and utilizing the property of submodularity this paper is based on a novel approach to the im problem geared towards optimizing clicks and consequently revenue within anonline social network osn our approach diverts from existing approaches by adopting a novel decisionmaking perspective through implementing stochastic dynamic programming sdp thus we define a new problem influence maximizationrevenue optimization imro and propose sdp as a method in which this problem can be solved the sdp method has lucrative gains for an advertiser in terms of optimizing clicks and generating revenue however one drawback to the method is its associated curse of dimensionality particularly for problems involving a large state space thus we introduce the lawrence degree heuristic ldh adaptive hillclimbing ahc and multistage particle swarm optimization mpso heuristics as methods which are orders of magnitude faster than the sdp method whilst achieving nearoptimal results through a comparative analysis on various synthetic and realworld networks we present the ahc and ldh as heuristics well suited to to the imro problem in terms of their accuracy running times and scalability under ideal model parameters in this paper we present a compelling survey on the sdp method as a practical and lucrative method for spreading information and optimizing revenue within the context of osns | [['the', 'wellknown', 'influence', 'maximization', 'im', 'problem', 'has', 'been', 'actively', 'studied', 'by', 'researchers', 'over', 'the', 'past', 'decade', 'with', 'emphasis', 'on', 'marketing', 'and', 'social', 'networks', 'existing', 'research', 'have', 'obtained', 'solutions', 'to', 'the', 'im', 'problem', 'by', 'obtaining', 'the', 'influence', 'spread', 'and', 'utilizing', 'the', 'property', 'of', 'submodularity', 'this', 'paper', 'is', 'based', 'on', 'a', 'novel', 'approach', 'to', 'the', 'im', 'problem', 'geared', 'towards', 'optimizing', 'clicks', 'and', 'consequently', 'revenue', 'within', 'anonline', 'social', 'network', 'osn', 'our', 'approach', 'diverts', 'from', 'existing', 'approaches', 'by', 'adopting', 'a', 'novel', 'decisionmaking', 'perspective', 'through', 'implementing', 'stochastic', 'dynamic', 'programming', 'sdp', 'thus', 'we', 'define', 'a', 'new', 'problem', 'influence', 'maximizationrevenue', 'optimization', 'imro', 'and', 'propose', 'sdp', 'as', 'a', 'method', 'in', 'which', 'this', 'problem', 'can', 'be', 'solved', 'the', 'sdp', 'method', 'has', 'lucrative', 'gains', 'for', 'an', 'advertiser', 'in', 'terms', 'of', 'optimizing', 'clicks', 'and', 'generating', 'revenue', 'however', 'one', 'drawback', 'to', 'the', 'method', 'is', 'its', 'associated', 'curse', 'of', 'dimensionality', 'particularly', 'for', 'problems', 'involving', 'a', 'large', 'state', 'space', 'thus', 'we', 'introduce', 'the', 'lawrence', 'degree', 'heuristic', 'ldh', 'adaptive', 'hillclimbing', 'ahc', 'and', 'multistage', 'particle', 'swarm', 'optimization', 'mpso', 'heuristics', 'as', 'methods', 'which', 'are', 'orders', 'of', 'magnitude', 'faster', 'than', 'the', 'sdp', 'method', 'whilst', 'achieving', 'nearoptimal', 'results', 'through', 'a', 'comparative', 'analysis', 'on', 'various', 'synthetic', 'and', 'realworld', 'networks', 'we', 'present', 'the', 'ahc', 'and', 'ldh', 'as', 'heuristics', 'well', 'suited', 'to', 'to', 'the', 'imro', 'problem', 'in', 'terms', 'of', 'their', 'accuracy', 'running', 'times', 'and', 'scalability', 'under', 'ideal', 'model', 'parameters', 'in', 'this', 'paper', 'we', 'present', 'a', 'compelling', 'survey', 'on', 'the', 'sdp', 'method', 'as', 'a', 'practical', 'and', 'lucrative', 'method', 'for', 'spreading', 'information', 'and', 'optimizing', 'revenue', 'within', 'the', 'context', 'of', 'osns']] | [-0.07436529124431589, -0.04995227848995743, -0.061878301236786164, 0.06623654151186845, -0.12434080304623937, -0.16120648851863456, 0.09266988090823937, 0.40772650484378936, -0.2948035408748475, -0.3500176706799754, 0.12813287718823263, -0.24845378189213543, -0.21134741841183033, 0.207762455475256, -0.07699541216153406, 0.08435573684911093, 0.06960596266076152, -0.017804434294946523, -0.06653843549130017, -0.28836630987206574, 0.29169917243260723, 0.08793895857680757, 0.30823973667953514, 0.06676861949704795, 0.11854787484723299, 0.026111566330356054, -0.012979696759639822, 0.06696965645961828, -0.11608928101402688, 0.15991004253977167, 0.31207840033488754, 0.2266728005212935, 0.3838027843979375, -0.39733150599303046, -0.1990743065214574, 0.10876591948585378, 0.16163969182190407, 0.08572959673970386, -0.06837090391976137, -0.285833047089692, 0.08762144690490646, -0.17994767472914702, -0.03876228148305459, -0.09885165519119382, -0.034000443788092014, 0.0025685614817143407, -0.295631619938266, 0.024435289315266128, 0.014379757733866112, 0.05300862961084632, -0.025015418380862985, -0.16005725642942167, 0.07008016736624156, 0.09927434635199146, 0.08449867922561664, 0.031834962648922126, 0.12843652944432174, -0.13377668445598365, -0.19531922515935873, 0.3961201217983669, -0.026975635107936734, -0.18602273863100222, 0.14757230430324045, -0.0014890562455503293, -0.12835625480523202, 0.11134793898311095, 0.2433851445304544, 0.18123931694323572, -0.16956589585448015, 0.06379253451483431, -0.045585738905080796, 0.11569263634474089, 0.02796416309635335, 0.02812983686250056, 0.149618331034411, 0.24917362388530018, 0.13991314595959958, 0.1467096298907159, -0.029370745977649364, -0.1212921610404833, -0.14824793608657968, -0.12426098435063207, -0.18477164953372177, 0.010894047517478926, -0.1111124315677683, -0.11519815500752824, 0.40672487934760043, 0.18982915709048143, 0.13245226670853763, 0.10910103099198855, 0.3500026354265357, 0.09236646308170808, 0.04858455808982713, 0.09022278469362499, 0.19600561800663868, 0.026362643440142886, 0.16056829889222535, -0.21509975536703418, 0.12458369596439717, 0.07691449440769954] |
1,802.10516 | $L^2$ estimates and vanishing theorems for holomorphic vector bundles
equipped with singular Hermitian metrics | We investigate singular Hermitian metrics on vector bundles, especially
strictly Griffiths positive ones. $L^2$ esitimates and vanishing theorems
usually require an assumption that vector bundles are Nakano positive. However
there is no general definition of the Nakano positivity in singular settings.
In this paper, we show various $L^2$ estimates and vanishing theromes by
assuming that the vector bundle is strictly Griffiths positive and the base
manifold is projective.
| math.CV math.AG | we investigate singular hermitian metrics on vector bundles especially strictly griffiths positive ones l2 esitimates and vanishing theorems usually require an assumption that vector bundles are nakano positive however there is no general definition of the nakano positivity in singular settings in this paper we show various l2 estimates and vanishing theromes by assuming that the vector bundle is strictly griffiths positive and the base manifold is projective | [['we', 'investigate', 'singular', 'hermitian', 'metrics', 'on', 'vector', 'bundles', 'especially', 'strictly', 'griffiths', 'positive', 'ones', 'l2', 'esitimates', 'and', 'vanishing', 'theorems', 'usually', 'require', 'an', 'assumption', 'that', 'vector', 'bundles', 'are', 'nakano', 'positive', 'however', 'there', 'is', 'no', 'general', 'definition', 'of', 'the', 'nakano', 'positivity', 'in', 'singular', 'settings', 'in', 'this', 'paper', 'we', 'show', 'various', 'l2', 'estimates', 'and', 'vanishing', 'theromes', 'by', 'assuming', 'that', 'the', 'vector', 'bundle', 'is', 'strictly', 'griffiths', 'positive', 'and', 'the', 'base', 'manifold', 'is', 'projective']] | [-0.246954817268433, 0.10503407906424289, -0.024550699332559652, 0.13392167277704697, -0.12157237273288157, -0.21392949124459515, -0.034810803109201406, 0.36408079449426045, -0.20627308287128637, -0.09792255971467856, 0.18200341717579938, -0.2643777084762626, -0.23281759571171168, 0.14644903407403917, -0.1511960295170094, 0.04536129120793758, 0.07047029961584926, 0.09127451860430566, -0.14903200895412627, -0.27229210963141115, 0.5357270161974046, -0.03275147133690277, 0.2954636373924035, 0.1287446881813759, 0.09294942550530488, 0.029412891412379617, -0.052654212354823496, 0.005507872609252279, -0.12047788270182068, 0.09765575198230869, 0.27434540708076605, 0.10724395616544467, 0.27223531091867975, -0.3379850478729967, -0.2082575147717514, 0.28877421931335423, 0.07565854400551568, -0.005432868214098342, 0.01678349013320368, -0.27433836742332485, 0.17621818885461174, -0.06405989382641786, -0.1426468900141172, -0.15106607471225839, 0.02814767044743128, -0.011913522483541094, -0.25479145004470466, 0.03812025198148507, 0.16840104682540352, 0.13521894320111835, -0.14867236467332326, -0.12108716159656813, -0.054586063536011024, -0.0077662885358387775, 0.0827854127150424, 0.06739531841065566, 0.09613986280887868, -0.052591318461274954, -0.09528465659329385, 0.3015685375342428, -0.12073927495459263, -0.330589985503166, 0.11075143899881479, -0.15381815009327096, -0.10773735036932383, 0.11093539892074962, 0.0881417120214213, 0.18226208674693198, 0.016672073849335764, 0.152638730011831, -0.11244212148823973, 0.0735747605054216, 0.08476720813125597, -0.01723906699529228, 0.10002708801943244, 0.008661737538535486, 0.1566566014097947, 0.0339554438903702, 0.009195714007188199, -0.1520565624743926, -0.38232417895712634, -0.2281722788783637, -0.15613165579623345, 0.19843728163025595, -0.12964870431394296, -0.19125930477237102, 0.3141930639235811, 0.02292272157854203, 0.27054610887937475, 0.14068711041049523, 0.2725269665207827, 0.08366181824892534, 0.019459636134067267, 0.07490179677860755, 0.24963645700534637, 0.23126096553945294, 0.09289830809487312, -0.06731922300109132, 0.04778088278588698, 0.13933872019476962] |
1,802.10517 | Experimental investigation of heat transport in homogeneous bubbly flow | We present results on the global and local characterisation of heat transport
in homogeneous bubbly flow. Experimental measurements were performed with and
without the injection of $\sim 2.5$ mm diameter bubbles (corresponding to $Re_b
\approx 600$) in a rectangular water column heated from one side and cooled
from the other. The gas volume fraction $\alpha$ was varied in the range $0\% -
5\%$, and the Rayleigh number $Ra_H$ in the range $4.0 \times 10^9 - 1.2 \times
10^{11}$. We find that the global heat transfer is enhanced up to 20 times due
to bubble injection. Interestingly, for bubbly flow, for our lowest
concentration $\alpha = 0.5\% $ onwards, the Nusselt number $\overline{Nu}$ is
nearly independent of $Ra_H$, and depends solely on the gas volume
fraction~$\alpha$. We observe the scaling $\overline{Nu} \propto
\alpha^{0.45}$, which is suggestive of a diffusive transport mechanism. Through
local temperature measurements, we show that the bubbles induce a huge increase
in the strength of liquid temperature fluctuations, e.g. by a factor of 200 for
$\alpha = 0.9\%$. Further, we compare the power spectra of the temperature
fluctuations for the single- and two-phase cases. In the single-phase cases,
most of the spectral power of the temperature fluctuations is concentrated in
the large-scale rolls. However, with the injection of bubbles, we observe
intense fluctuations over a wide range of scales, extending up to very high
frequencies. Thus, while in the single-phase flow the thermal boundary layers
control the heat transport, once the bubbles are injected, the bubble-induced
liquid agitation governs the process from a very small bubble concentration
onwards.
| physics.flu-dyn | we present results on the global and local characterisation of heat transport in homogeneous bubbly flow experimental measurements were performed with and without the injection of sim 25 mm diameter bubbles corresponding to re_b approx 600 in a rectangular water column heated from one side and cooled from the other the gas volume fraction alpha was varied in the range 0 5 and the rayleigh number ra_h in the range 40 times 109 12 times 1011 we find that the global heat transfer is enhanced up to 20 times due to bubble injection interestingly for bubbly flow for our lowest concentration alpha 05 onwards the nusselt number overlinenu is nearly independent of ra_h and depends solely on the gas volume fractionalpha we observe the scaling overlinenu propto alpha045 which is suggestive of a diffusive transport mechanism through local temperature measurements we show that the bubbles induce a huge increase in the strength of liquid temperature fluctuations eg by a factor of 200 for alpha 09 further we compare the power spectra of the temperature fluctuations for the single and twophase cases in the singlephase cases most of the spectral power of the temperature fluctuations is concentrated in the largescale rolls however with the injection of bubbles we observe intense fluctuations over a wide range of scales extending up to very high frequencies thus while in the singlephase flow the thermal boundary layers control the heat transport once the bubbles are injected the bubbleinduced liquid agitation governs the process from a very small bubble concentration onwards | [['we', 'present', 'results', 'on', 'the', 'global', 'and', 'local', 'characterisation', 'of', 'heat', 'transport', 'in', 'homogeneous', 'bubbly', 'flow', 'experimental', 'measurements', 'were', 'performed', 'with', 'and', 'without', 'the', 'injection', 'of', 'sim', '25', 'mm', 'diameter', 'bubbles', 'corresponding', 'to', 're_b', 'approx', '600', 'in', 'a', 'rectangular', 'water', 'column', 'heated', 'from', 'one', 'side', 'and', 'cooled', 'from', 'the', 'other', 'the', 'gas', 'volume', 'fraction', 'alpha', 'was', 'varied', 'in', 'the', 'range', '0', '5', 'and', 'the', 'rayleigh', 'number', 'ra_h', 'in', 'the', 'range', '40', 'times', '109', '12', 'times', '1011', 'we', 'find', 'that', 'the', 'global', 'heat', 'transfer', 'is', 'enhanced', 'up', 'to', '20', 'times', 'due', 'to', 'bubble', 'injection', 'interestingly', 'for', 'bubbly', 'flow', 'for', 'our', 'lowest', 'concentration', 'alpha', '05', 'onwards', 'the', 'nusselt', 'number', 'overlinenu', 'is', 'nearly', 'independent', 'of', 'ra_h', 'and', 'depends', 'solely', 'on', 'the', 'gas', 'volume', 'fractionalpha', 'we', 'observe', 'the', 'scaling', 'overlinenu', 'propto', 'alpha045', 'which', 'is', 'suggestive', 'of', 'a', 'diffusive', 'transport', 'mechanism', 'through', 'local', 'temperature', 'measurements', 'we', 'show', 'that', 'the', 'bubbles', 'induce', 'a', 'huge', 'increase', 'in', 'the', 'strength', 'of', 'liquid', 'temperature', 'fluctuations', 'eg', 'by', 'a', 'factor', 'of', '200', 'for', 'alpha', '09', 'further', 'we', 'compare', 'the', 'power', 'spectra', 'of', 'the', 'temperature', 'fluctuations', 'for', 'the', 'single', 'and', 'twophase', 'cases', 'in', 'the', 'singlephase', 'cases', 'most', 'of', 'the', 'spectral', 'power', 'of', 'the', 'temperature', 'fluctuations', 'is', 'concentrated', 'in', 'the', 'largescale', 'rolls', 'however', 'with', 'the', 'injection', 'of', 'bubbles', 'we', 'observe', 'intense', 'fluctuations', 'over', 'a', 'wide', 'range', 'of', 'scales', 'extending', 'up', 'to', 'very', 'high', 'frequencies', 'thus', 'while', 'in', 'the', 'singlephase', 'flow', 'the', 'thermal', 'boundary', 'layers', 'control', 'the', 'heat', 'transport', 'once', 'the', 'bubbles', 'are', 'injected', 'the', 'bubbleinduced', 'liquid', 'agitation', 'governs', 'the', 'process', 'from', 'a', 'very', 'small', 'bubble', 'concentration', 'onwards']] | [-0.11933424798120913, 0.22460667563255832, -0.024562035400125266, -0.007574238892522671, 0.019964360329505847, -0.0761015481222971, 0.060799024539896995, 0.31882829752275865, -0.2652184398194929, -0.33773195662895056, 0.10507100038633747, -0.3272674656938303, -0.010070128808179356, 0.22060133267824691, 0.019093609015332667, 0.0026071234244127266, -0.0224826906057896, -0.0161261405386984, -0.05400274497801511, -0.17817412971016605, 0.2468709377205278, 0.08333105394455391, 0.296420174962511, 0.08418637982708967, 0.09141759755819537, -0.0730554173947092, -0.011741488273658856, 0.03302902087494931, -0.18709136166741136, 0.011567202314191798, 0.18478333994638044, -0.01231073519271935, 0.21680762949784646, -0.41954742893063296, -0.23087660560208395, 0.07491540632533335, 0.13109346209147782, 0.05649985673454201, -0.048401218671700004, -0.18575528217112924, 0.08933242574915305, -0.1607232639872227, -0.13247511900987066, -0.002635788738060244, 0.041332787604943855, 0.03664744367518675, -0.26262575168323915, 0.16910335065991303, 0.019932085820510398, 0.05822969976295607, -0.06404333231754337, -0.11534020842390326, -0.03542839182727772, 0.0965604151298446, 0.05268893770378094, 0.0330838458314648, 0.23434453273346045, -0.16291019087748998, 0.0024381816001264305, 0.35411513714105125, -0.10738392713375199, -0.09628286896691489, 0.19794817665210507, -0.22249298816084803, -0.06013091568978078, 0.2447618554808258, 0.16154762568670933, 0.10259478005459606, -0.09062661626926205, 0.020810739073524705, -0.035886576237875646, 0.2173777550686239, 0.0796761914122232, -0.01101805537106748, 0.20583885922426665, 0.1782411153347591, 0.052953497254597685, 0.1305468779210346, -0.1743312854852388, -0.06700372266286148, -0.2580514809100221, -0.1437729310939147, -0.13903506959634504, 0.0973325760674266, -0.14456147312034953, -0.11105423816663074, 0.36450049292349335, 0.12603127434813072, 0.22501852002185513, 0.026697990692616625, 0.2503873864977115, 0.09839708281875273, 0.06699273910457781, 0.13662793438177645, 0.27091861064509143, 0.13200103570193816, 0.1637252478779653, -0.2347528753155021, 0.029991044882890276, -0.015785489291847338] |
1,802.10518 | Mapping mesoscopic phase evolution during e-beam induced transformations
via deep learning of atomically resolved images | Understanding transformations under electron beam irradiation requires
mapping the structural phases and their evolution in real time. To date, this
has mostly been a manual endeavor comprising of difficult frame-by-frame
analysis that is simultaneously tedious and prone to error. Here, we turn
towards the use of deep convolutional neural networks (DCNN) to automatically
determine the Bravais lattice symmetry present in atomically-resolved images. A
DCNN is trained to identify the Bravais lattice class given a 2D fast Fourier
transform of the input image. Monte-Carlo dropout is used for determining the
prediction probability, and results are shown for both simulated and real
atomically-resolved images from scanning tunneling microscopy and scanning
transmission electron microscopy. A reduced representation of the final layer
output allows to visualize the separation of classes in the DCNN and agrees
with physical intuition. We then apply the trained network to electron
beam-induced transformations in WS2, which allows tracking and determination of
growth rate of voids. These results are novel in two ways: (1) It shows that
DCNNs can be trained to recognize diffraction patterns, which is markedly
different from the typical "real image" cases, and (2) it provides a method
with in-built uncertainty quantification, allowing the real-time analysis of
phases present in atomically resolved images.
| cond-mat.mtrl-sci | understanding transformations under electron beam irradiation requires mapping the structural phases and their evolution in real time to date this has mostly been a manual endeavor comprising of difficult framebyframe analysis that is simultaneously tedious and prone to error here we turn towards the use of deep convolutional neural networks dcnn to automatically determine the bravais lattice symmetry present in atomicallyresolved images a dcnn is trained to identify the bravais lattice class given a 2d fast fourier transform of the input image montecarlo dropout is used for determining the prediction probability and results are shown for both simulated and real atomicallyresolved images from scanning tunneling microscopy and scanning transmission electron microscopy a reduced representation of the final layer output allows to visualize the separation of classes in the dcnn and agrees with physical intuition we then apply the trained network to electron beaminduced transformations in ws2 which allows tracking and determination of growth rate of voids these results are novel in two ways 1 it shows that dcnns can be trained to recognize diffraction patterns which is markedly different from the typical real image cases and 2 it provides a method with inbuilt uncertainty quantification allowing the realtime analysis of phases present in atomically resolved images | [['understanding', 'transformations', 'under', 'electron', 'beam', 'irradiation', 'requires', 'mapping', 'the', 'structural', 'phases', 'and', 'their', 'evolution', 'in', 'real', 'time', 'to', 'date', 'this', 'has', 'mostly', 'been', 'a', 'manual', 'endeavor', 'comprising', 'of', 'difficult', 'framebyframe', 'analysis', 'that', 'is', 'simultaneously', 'tedious', 'and', 'prone', 'to', 'error', 'here', 'we', 'turn', 'towards', 'the', 'use', 'of', 'deep', 'convolutional', 'neural', 'networks', 'dcnn', 'to', 'automatically', 'determine', 'the', 'bravais', 'lattice', 'symmetry', 'present', 'in', 'atomicallyresolved', 'images', 'a', 'dcnn', 'is', 'trained', 'to', 'identify', 'the', 'bravais', 'lattice', 'class', 'given', 'a', '2d', 'fast', 'fourier', 'transform', 'of', 'the', 'input', 'image', 'montecarlo', 'dropout', 'is', 'used', 'for', 'determining', 'the', 'prediction', 'probability', 'and', 'results', 'are', 'shown', 'for', 'both', 'simulated', 'and', 'real', 'atomicallyresolved', 'images', 'from', 'scanning', 'tunneling', 'microscopy', 'and', 'scanning', 'transmission', 'electron', 'microscopy', 'a', 'reduced', 'representation', 'of', 'the', 'final', 'layer', 'output', 'allows', 'to', 'visualize', 'the', 'separation', 'of', 'classes', 'in', 'the', 'dcnn', 'and', 'agrees', 'with', 'physical', 'intuition', 'we', 'then', 'apply', 'the', 'trained', 'network', 'to', 'electron', 'beaminduced', 'transformations', 'in', 'ws2', 'which', 'allows', 'tracking', 'and', 'determination', 'of', 'growth', 'rate', 'of', 'voids', 'these', 'results', 'are', 'novel', 'in', 'two', 'ways', '1', 'it', 'shows', 'that', 'dcnns', 'can', 'be', 'trained', 'to', 'recognize', 'diffraction', 'patterns', 'which', 'is', 'markedly', 'different', 'from', 'the', 'typical', 'real', 'image', 'cases', 'and', '2', 'it', 'provides', 'a', 'method', 'with', 'inbuilt', 'uncertainty', 'quantification', 'allowing', 'the', 'realtime', 'analysis', 'of', 'phases', 'present', 'in', 'atomically', 'resolved', 'images']] | [-0.05969492597542183, 0.05681473651937055, -0.08470083794497785, 0.0559171649160596, -0.06486533237711607, -0.17806479441300396, 0.030867588892240005, 0.4683751777262038, -0.2775075203553746, -0.3343381559661617, 0.06460452817371386, -0.28046468135494473, -0.1826740298103722, 0.20163376734832764, -0.06440703541425445, 0.11872836040757886, 0.0844401715972196, -0.02901377061662237, -0.08391381282409092, -0.2545920671732391, 0.2776171430895666, 0.04849635904021358, 0.34565957188063745, 0.010783104100253306, 0.1104126968149783, 0.0044383944839564635, -0.03756327212684182, -0.02073227772731663, -0.10238338448142563, 0.13163191131632596, 0.27707797282339225, 0.10583305660323285, 0.22179791239515237, -0.45858227511759375, -0.21766259830707269, 0.04548872506598607, 0.15641555168385646, 0.13128510117530823, -0.04929631778256045, -0.30413751955736357, 0.07238619356276016, -0.09165624828864503, -0.04116606905500323, -0.14797736953794777, -0.029283697188501833, -0.02354387305671286, -0.2747874249207157, 0.05468606532017872, 0.003325805486772137, 0.06823239236893765, -0.0771116261484635, -0.03884533615511598, -0.023157974173884512, 0.17135613183807402, 0.008811690139322027, 0.0698360432599427, 0.15800230185675335, -0.14440045130407456, -0.09612046605545702, 0.38499749733419925, -0.0006712115487282716, -0.1783310342037562, 0.21620256440189567, -0.1362975513523284, -0.11550290877162253, 0.16091618412829828, 0.1709565632587787, 0.10424206445606209, -0.17696342178285845, 0.004202776966001657, -0.02772822239192076, 0.21345025695209363, 0.0763725626544611, 0.0013999665908750545, 0.1851331495823456, 0.2254871120970262, 0.010601773265256428, 0.15614454911002273, -0.18721109506257616, -0.02258884561196132, -0.21286389280734494, -0.12933290004391151, -0.1906155453456873, 0.03592984838913041, -0.07312528364014477, -0.15887602193219455, 0.42237517862124097, 0.1934584847807396, 0.2038795012049377, 0.050710925856125945, 0.32342602465317577, 0.049276935542454416, 0.12375272289528828, -0.005122898685637391, 0.18416965977815478, 0.08526230118581031, 0.10590857320105729, -0.19113117642700672, 0.07334223352214411, 0.050424490579476275] |
1,802.10519 | On the Lie bracket approximation approach to distributed optimization:
Extensions and limitations | We consider the problem of solving a smooth convex optimization problem with
equality and inequality constraints in a distributed fashion. Assuming that we
have a group of agents available capable of communicating over a communication
network described by a time-invariant directed graph, we derive distributed
continuous-time agent dynamics that ensure convergence to a neighborhood of the
optimal solution of the optimization problem. Following the ideas introduced in
our previous work, we combine saddle-point dynamics with Lie bracket
approximation techniques. While the methodology was previously limited to
linear constraints and objective functions given by a sum of strictly convex
separable functions, we extend these result here and show that it applies to a
very general class of optimization problems under mild assumptions on the
communication topology.
| math.OC cs.SY | we consider the problem of solving a smooth convex optimization problem with equality and inequality constraints in a distributed fashion assuming that we have a group of agents available capable of communicating over a communication network described by a timeinvariant directed graph we derive distributed continuoustime agent dynamics that ensure convergence to a neighborhood of the optimal solution of the optimization problem following the ideas introduced in our previous work we combine saddlepoint dynamics with lie bracket approximation techniques while the methodology was previously limited to linear constraints and objective functions given by a sum of strictly convex separable functions we extend these result here and show that it applies to a very general class of optimization problems under mild assumptions on the communication topology | [['we', 'consider', 'the', 'problem', 'of', 'solving', 'a', 'smooth', 'convex', 'optimization', 'problem', 'with', 'equality', 'and', 'inequality', 'constraints', 'in', 'a', 'distributed', 'fashion', 'assuming', 'that', 'we', 'have', 'a', 'group', 'of', 'agents', 'available', 'capable', 'of', 'communicating', 'over', 'a', 'communication', 'network', 'described', 'by', 'a', 'timeinvariant', 'directed', 'graph', 'we', 'derive', 'distributed', 'continuoustime', 'agent', 'dynamics', 'that', 'ensure', 'convergence', 'to', 'a', 'neighborhood', 'of', 'the', 'optimal', 'solution', 'of', 'the', 'optimization', 'problem', 'following', 'the', 'ideas', 'introduced', 'in', 'our', 'previous', 'work', 'we', 'combine', 'saddlepoint', 'dynamics', 'with', 'lie', 'bracket', 'approximation', 'techniques', 'while', 'the', 'methodology', 'was', 'previously', 'limited', 'to', 'linear', 'constraints', 'and', 'objective', 'functions', 'given', 'by', 'a', 'sum', 'of', 'strictly', 'convex', 'separable', 'functions', 'we', 'extend', 'these', 'result', 'here', 'and', 'show', 'that', 'it', 'applies', 'to', 'a', 'very', 'general', 'class', 'of', 'optimization', 'problems', 'under', 'mild', 'assumptions', 'on', 'the', 'communication', 'topology']] | [-0.1498398645594716, 0.007416954301297665, -0.09751209677755833, 0.047455778867006304, -0.0987480548620224, -0.1848255673646927, 0.07920438984036446, 0.38384716361016036, -0.3384526257757097, -0.28757661426067355, 0.10658445809036493, -0.21231378699839115, -0.19906129086948932, 0.16371708068437874, -0.10960666004940868, 0.10646918401867152, 0.08990452993661165, 0.005501956600695849, -0.07365375323593616, -0.2889952865683008, 0.3396940628699958, -0.014340808279812337, 0.22508280727639796, 0.018105522241909058, 0.153735140257515, 0.05671567570418119, 3.7133540958166125e-05, 0.07646860920544714, -0.14277790324477246, 0.15042081160563975, 0.2912955788373947, 0.191705342983827, 0.33869548129290344, -0.43064005219191315, -0.22894315748661756, 0.13566500791162253, 0.10388275044411421, 0.05135102884285152, -0.04010720010194928, -0.25685446298867465, 0.08692185572162271, -0.14505901823937892, -0.0948181784003973, -0.030583898173179476, -0.03738510474562645, 0.05542689998587593, -0.32916706486791375, 0.03380256229639053, 0.08273912405967712, 0.02406931935250759, -0.09840883692540228, -0.07506256878282874, 0.05953814637474716, 0.05701781664043665, 0.004093240508809686, 0.03632576215267182, 0.1214084825515747, -0.06973533894866706, -0.1473768924623728, 0.3544002712070942, -0.03337154951272532, -0.269175220310688, 0.15571853278577327, -0.07348011734336615, -0.19567458903603255, 0.09767938415333628, 0.20445960803469643, 0.1780609229952097, -0.18631102291494608, 0.143245227171632, -0.09804173752292991, 0.11835895751044154, 0.01483950798213482, 0.007108031595591455, 0.09355584791488945, 0.16499989006668328, 0.20432904214225708, 0.15940636383742093, 0.040444459239020944, -0.15643994800001382, -0.2804969854578376, -0.08101210699602962, -0.1955800254261121, 0.04009360937587917, -0.08056715992803219, -0.12936936149746178, 0.37518723189085723, 0.11446080929785966, 0.15828874802961945, 0.17733304873853922, 0.2949404881838709, 0.1185337381111458, 0.02577483866363764, 0.1370330118238926, 0.19888599283341318, 0.14799947341717778, 0.07249843725655228, -0.18138855614082422, 0.0774498349223286, 0.07574779465794564] |
1,802.1052 | Glass stability (GS) of chemically complex (natural) sub-alkaline
glasses | Glass stability (GS) indicates the glass reluctance or ability to crystallise
upon heating; it can be characterised by several methods and parameters and is
frequently used to retrieve glass-forming ability (GFA) of corresponding
liquids as the case with which such liquids can be made crystal free via
melt-quenching. Here, GS has been determined for the first time on six
sub-alkaline glasses having complex (natural) compositions, the most widespread
and abundant on Earth. KT, KH, KW, KLL and w2 GS parameters increase linearly
and monotonically as a function of SiO2, with very high correlations. Moreover,
Tx values and GS parameters highly correlate with GFA via Rc (critical cooling
rate), previously determined with ex-situ cooling-induced experiments.
Therefore, GS scales with GFA for natural silicate compositions. In addition,
the in-situ Rc value of B100 measured with DSC results > 45 {\deg}C/min (> 2700
{\deg}C/h), broadly corroborating the Rc of about 150 {\deg}C/min (9000
{\deg}C/h) determined ex-situ. In turn, relevant solidification parameters on
heating or cooling can be obtained by DSC investigations also for chemically
complex (natural) systems, similar to simple silicate systems. These outcomes
are relevant for lavas or magmas that re-heat glass-bearing volcanic rocks, as
well as for fabricate glass-ceramic materials with desirable texture and
composition of phases starting from abundant and very cheap raw volcanic rocks.
| physics.geo-ph | glass stability gs indicates the glass reluctance or ability to crystallise upon heating it can be characterised by several methods and parameters and is frequently used to retrieve glassforming ability gfa of corresponding liquids as the case with which such liquids can be made crystal free via meltquenching here gs has been determined for the first time on six subalkaline glasses having complex natural compositions the most widespread and abundant on earth kt kh kw kll and w2 gs parameters increase linearly and monotonically as a function of sio2 with very high correlations moreover tx values and gs parameters highly correlate with gfa via rc critical cooling rate previously determined with exsitu coolinginduced experiments therefore gs scales with gfa for natural silicate compositions in addition the insitu rc value of b100 measured with dsc results 45 degcmin 2700 degch broadly corroborating the rc of about 150 degcmin 9000 degch determined exsitu in turn relevant solidification parameters on heating or cooling can be obtained by dsc investigations also for chemically complex natural systems similar to simple silicate systems these outcomes are relevant for lavas or magmas that reheat glassbearing volcanic rocks as well as for fabricate glassceramic materials with desirable texture and composition of phases starting from abundant and very cheap raw volcanic rocks | [['glass', 'stability', 'gs', 'indicates', 'the', 'glass', 'reluctance', 'or', 'ability', 'to', 'crystallise', 'upon', 'heating', 'it', 'can', 'be', 'characterised', 'by', 'several', 'methods', 'and', 'parameters', 'and', 'is', 'frequently', 'used', 'to', 'retrieve', 'glassforming', 'ability', 'gfa', 'of', 'corresponding', 'liquids', 'as', 'the', 'case', 'with', 'which', 'such', 'liquids', 'can', 'be', 'made', 'crystal', 'free', 'via', 'meltquenching', 'here', 'gs', 'has', 'been', 'determined', 'for', 'the', 'first', 'time', 'on', 'six', 'subalkaline', 'glasses', 'having', 'complex', 'natural', 'compositions', 'the', 'most', 'widespread', 'and', 'abundant', 'on', 'earth', 'kt', 'kh', 'kw', 'kll', 'and', 'w2', 'gs', 'parameters', 'increase', 'linearly', 'and', 'monotonically', 'as', 'a', 'function', 'of', 'sio2', 'with', 'very', 'high', 'correlations', 'moreover', 'tx', 'values', 'and', 'gs', 'parameters', 'highly', 'correlate', 'with', 'gfa', 'via', 'rc', 'critical', 'cooling', 'rate', 'previously', 'determined', 'with', 'exsitu', 'coolinginduced', 'experiments', 'therefore', 'gs', 'scales', 'with', 'gfa', 'for', 'natural', 'silicate', 'compositions', 'in', 'addition', 'the', 'insitu', 'rc', 'value', 'of', 'b100', 'measured', 'with', 'dsc', 'results', '45', 'degcmin', '2700', 'degch', 'broadly', 'corroborating', 'the', 'rc', 'of', 'about', '150', 'degcmin', '9000', 'degch', 'determined', 'exsitu', 'in', 'turn', 'relevant', 'solidification', 'parameters', 'on', 'heating', 'or', 'cooling', 'can', 'be', 'obtained', 'by', 'dsc', 'investigations', 'also', 'for', 'chemically', 'complex', 'natural', 'systems', 'similar', 'to', 'simple', 'silicate', 'systems', 'these', 'outcomes', 'are', 'relevant', 'for', 'lavas', 'or', 'magmas', 'that', 'reheat', 'glassbearing', 'volcanic', 'rocks', 'as', 'well', 'as', 'for', 'fabricate', 'glassceramic', 'materials', 'with', 'desirable', 'texture', 'and', 'composition', 'of', 'phases', 'starting', 'from', 'abundant', 'and', 'very', 'cheap', 'raw', 'volcanic', 'rocks']] | [-0.010857080530517838, 0.21686301680680578, -0.03871278366760204, 0.012519895387078194, -0.04547280413165475, -0.15447917514208828, 0.051906607443529165, 0.39426460314952017, -0.24633993444859573, -0.3384412130692965, 0.12133414782839938, -0.29252198968265364, -0.10801971250026526, 0.23954334137370836, -0.007625745562613724, 0.06912081747066004, 0.013182491068527744, -0.0178672211226878, -0.08294281119272685, -0.22333319337690988, 0.2450918727309296, 0.07115771460155265, 0.24845701381430457, 0.02035069579044669, 0.06280917294198674, -0.06417668532161265, 0.04287464866491534, 0.019996155855125018, -0.15967678255641762, 0.049969340509860516, 0.2719936788964428, 0.040979893888128505, 0.13861379185112185, -0.4179005293135473, -0.2534182251399855, 0.05822266713809668, 0.11623321720465804, 0.016982784068644154, -0.03379703996342086, -0.21246800723075687, 0.08043045621436606, -0.15741889156026845, -0.09169460867440248, -0.11542716964914432, 0.05361861292312911, 0.04981617402935926, -0.2600552842430949, 0.08976491640138654, 0.030904391720895454, 0.10183946712000483, -0.10273931941806236, -0.19572982735125322, -0.07371557620131192, 0.08970870087970423, 0.02646744348282556, 0.02553077996262844, 0.23121990906698495, -0.10034399458238383, -0.04267059809318855, 0.4018627750513514, -0.07228164140326662, -0.07355105219106413, 0.2901608450917536, -0.1298886843496498, -0.09308705539342337, 0.19824783862947207, 0.09265211170609443, 0.1273634961525504, -0.15992596427326283, -0.03459823953486872, 0.006063230898293653, 0.21471091319748944, 0.09260658825230762, 0.023853782283111018, 0.23810067594176132, 0.19260940653033573, -0.013404349713479325, 0.12260579513541855, -0.07707855498984136, -0.03989643127207408, -0.13975888560247568, -0.17160159910351716, -0.16783482056561164, 0.04214701844372622, -0.1125040151391615, -0.14198422545798872, 0.32441571034696043, 0.11881279309768158, 0.21125730830712608, -0.003934411191087412, 0.23816451913583578, 0.046098175553301944, 0.10666768970279887, 0.036390878329205026, 0.22598337289391524, 0.14615091715903694, 0.11381244765255939, -0.2045514017491686, 0.1510447283057077, -0.00028377166017889977] |
1,802.10521 | More than five-twelfths of the zeros of $\zeta$ are on the critical line | The second moment of the Riemann zeta-function twisted by a normalized
Dirichlet polynomial with coefficients of the form $(\mu \star \Lambda_1^{\star
k_1} \star \Lambda_2^{\star k_2} \star \cdots \star \Lambda_d^{\star k_d})$ is
computed unconditionally by means of the autocorrelation of ratios of $\zeta$
techniques from Conrey, Farmer, Keating, Rubinstein and Snaith (2005), Conrey,
Farmer and Zirnbauer (2008) as well as Conrey and Snaith (2007). This in turn
allows us to describe the combinatorial process behind the mollification of \[
\zeta(s) + \lambda_1 \frac{\zeta'(s)}{\log T} + \lambda_2
\frac{\zeta''(s)}{\log^2 T} + \cdots + \lambda_d \frac{\zeta^{(d)}(s)}{\log^d
T}, \] where $\zeta^{(k)}$ stands for the $k$th derivative of the Riemann
zeta-function and $\{\lambda_k\}_{k=1}^d$ are real numbers. Improving on recent
results on long mollifiers and sums of Kloosterman sums due to Pratt and Robles
(2017), as an application, we increase the current lower bound of critical
zeros of the Riemann zeta-function to slightly over five-twelfths.
| math.NT | the second moment of the riemann zetafunction twisted by a normalized dirichlet polynomial with coefficients of the form mu star lambda_1star k_1 star lambda_2star k_2 star cdots star lambda_dstar k_d is computed unconditionally by means of the autocorrelation of ratios of zeta techniques from conrey farmer keating rubinstein and snaith 2005 conrey farmer and zirnbauer 2008 as well as conrey and snaith 2007 this in turn allows us to describe the combinatorial process behind the mollification of zetas lambda_1 fraczetaslog t lambda_2 fraczetaslog2 t cdots lambda_d fraczetadslogd t where zetak stands for the kth derivative of the riemann zetafunction and lambda_k_k1d are real numbers improving on recent results on long mollifiers and sums of kloosterman sums due to pratt and robles 2017 as an application we increase the current lower bound of critical zeros of the riemann zetafunction to slightly over fivetwelfths | [['the', 'second', 'moment', 'of', 'the', 'riemann', 'zetafunction', 'twisted', 'by', 'a', 'normalized', 'dirichlet', 'polynomial', 'with', 'coefficients', 'of', 'the', 'form', 'mu', 'star', 'lambda_1star', 'k_1', 'star', 'lambda_2star', 'k_2', 'star', 'cdots', 'star', 'lambda_dstar', 'k_d', 'is', 'computed', 'unconditionally', 'by', 'means', 'of', 'the', 'autocorrelation', 'of', 'ratios', 'of', 'zeta', 'techniques', 'from', 'conrey', 'farmer', 'keating', 'rubinstein', 'and', 'snaith', '2005', 'conrey', 'farmer', 'and', 'zirnbauer', '2008', 'as', 'well', 'as', 'conrey', 'and', 'snaith', '2007', 'this', 'in', 'turn', 'allows', 'us', 'to', 'describe', 'the', 'combinatorial', 'process', 'behind', 'the', 'mollification', 'of', 'zetas', 'lambda_1', 'fraczetaslog', 't', 'lambda_2', 'fraczetaslog2', 't', 'cdots', 'lambda_d', 'fraczetadslogd', 't', 'where', 'zetak', 'stands', 'for', 'the', 'kth', 'derivative', 'of', 'the', 'riemann', 'zetafunction', 'and', 'lambda_k_k1d', 'are', 'real', 'numbers', 'improving', 'on', 'recent', 'results', 'on', 'long', 'mollifiers', 'and', 'sums', 'of', 'kloosterman', 'sums', 'due', 'to', 'pratt', 'and', 'robles', '2017', 'as', 'an', 'application', 'we', 'increase', 'the', 'current', 'lower', 'bound', 'of', 'critical', 'zeros', 'of', 'the', 'riemann', 'zetafunction', 'to', 'slightly', 'over', 'fivetwelfths']] | [-0.1808174595424867, 0.06973869945089864, -0.08390719409416944, 0.08258341782587181, -0.11068785130463318, -0.08724622068745988, 0.05641210936192326, 0.2505545076816829, -0.22102209578143128, -0.26666280597712455, 0.09117549421950313, -0.2708624662074943, -0.1352809124118857, 0.22407748097373145, -0.06024639553098536, 0.08387574150379914, -0.014718541552298773, 0.014604920834136097, -0.052050465218314065, -0.34325107937303384, 0.2910258920251656, 0.026548872746999807, 0.1734203742851795, 0.13466890834258008, 0.03254276867121903, 0.008242901438958387, -0.02249542364560471, -0.11286523350542273, -0.2067161280272612, 0.09301568379403273, 0.2191527624260078, 0.05178691295267486, 0.23205900612745933, -0.34548311393165876, -0.10196392033805153, 0.13052105769834746, 0.14765722409008877, -0.1183249612630748, 0.08729064101162158, -0.28260907679083824, 0.10262456765301081, -0.16433554420720287, -0.1249860415822451, -0.07573983285909713, 0.09540736645637359, 0.07672221799565257, -0.34765670951038824, 0.13514783047747783, 0.0845113456806988, 0.08988309481334109, -0.028144305113636987, -0.29530545128092395, 0.01190820484901709, 0.0489570465348939, 0.10491794334883531, 0.10360811355370861, 0.03773299414914713, -0.08709777069257212, -0.11890809795360512, 0.2852774025844549, -0.1111280798734819, -0.14217766133873766, 0.07538711157655205, -0.17672206543441585, -0.18691923694490498, 0.09469749720544464, 0.0678987816226349, 0.2136401476880619, -0.01643024863842041, 0.16585542779822432, -0.09486853272598515, 0.05940259154886007, 0.23445507219763223, -0.0963314626567455, 0.1765456146394674, -0.006443370819967518, 0.014849829141731694, 0.11629948618217135, -0.07480172591228317, -0.06749822003121832, -0.25528442282785674, -0.22391628880451656, -0.23380061845580088, 0.16302181682167158, -0.13432590393614505, -0.17260641862078807, 0.3186417289656837, 0.07034888529260434, 0.20214527649822325, 0.1491435155856298, 0.19513485293206412, 0.16812670674025595, 0.025388330061322274, 0.052281561505688884, 0.08313310575939076, 0.2771027146372944, 0.08776036811446938, -0.18727044802034837, 0.04260148186976813, 0.22784817795470746] |
1,802.10522 | Universal two-time correlations, out-of-time-ordered correlators and
Leggett-Garg inequality violation by edge Majorana fermion qubits | In the present work we propose that two-time correlations of Majorana edge
localized fermions constitute a novel and versatile toolbox for assessing the
topological phases of 1D open lattices. Using analytical and numerical
calculations on the Kitaev model, we uncover universal relationships between
the decay of the short-time correlations and a particular family of
out-of-time-ordered correlators, which provide direct experimental alternatives
to the quantitative analysis of the system regime, either normal or
topological. Furthermore we show that the saturation of two-time correlations
possesses features of an order parameter. Finally, we find that violations of
Leggett-Garg inequalities can indicate the topological-normal phase transition
by looking at different qubits formed by pairing local and non-local edge
Majorana fermions.
| cond-mat.str-el quant-ph | in the present work we propose that twotime correlations of majorana edge localized fermions constitute a novel and versatile toolbox for assessing the topological phases of 1d open lattices using analytical and numerical calculations on the kitaev model we uncover universal relationships between the decay of the shorttime correlations and a particular family of outoftimeordered correlators which provide direct experimental alternatives to the quantitative analysis of the system regime either normal or topological furthermore we show that the saturation of twotime correlations possesses features of an order parameter finally we find that violations of leggettgarg inequalities can indicate the topologicalnormal phase transition by looking at different qubits formed by pairing local and nonlocal edge majorana fermions | [['in', 'the', 'present', 'work', 'we', 'propose', 'that', 'twotime', 'correlations', 'of', 'majorana', 'edge', 'localized', 'fermions', 'constitute', 'a', 'novel', 'and', 'versatile', 'toolbox', 'for', 'assessing', 'the', 'topological', 'phases', 'of', '1d', 'open', 'lattices', 'using', 'analytical', 'and', 'numerical', 'calculations', 'on', 'the', 'kitaev', 'model', 'we', 'uncover', 'universal', 'relationships', 'between', 'the', 'decay', 'of', 'the', 'shorttime', 'correlations', 'and', 'a', 'particular', 'family', 'of', 'outoftimeordered', 'correlators', 'which', 'provide', 'direct', 'experimental', 'alternatives', 'to', 'the', 'quantitative', 'analysis', 'of', 'the', 'system', 'regime', 'either', 'normal', 'or', 'topological', 'furthermore', 'we', 'show', 'that', 'the', 'saturation', 'of', 'twotime', 'correlations', 'possesses', 'features', 'of', 'an', 'order', 'parameter', 'finally', 'we', 'find', 'that', 'violations', 'of', 'leggettgarg', 'inequalities', 'can', 'indicate', 'the', 'topologicalnormal', 'phase', 'transition', 'by', 'looking', 'at', 'different', 'qubits', 'formed', 'by', 'pairing', 'local', 'and', 'nonlocal', 'edge', 'majorana', 'fermions']] | [-0.17004806611381856, 0.18912884286027262, -0.11633738073729107, 0.09544726607694837, -0.02507193201895932, -0.1847218018715623, 0.06180775983475855, 0.3324804610476412, -0.21803073783340896, -0.2512205852163506, 0.025163026816605046, -0.3112345288090151, -0.17784708029598575, 0.16215519152043772, 0.08244509380190344, 0.08858670628276365, 0.024859749607677603, -0.030595883971696384, -0.13659231190304755, -0.2095300962441954, 0.3336886626363186, -0.016679950692723024, 0.2986619233370534, 0.09890870075945839, 0.02929378009465491, -0.002078642018926169, 0.03363748580410049, 0.017379815806634724, -0.17510777397440286, 0.10035300182563991, 0.2190444202158311, 0.03848472253242829, 0.19750790897724702, -0.47869121707205115, -0.19603166305199105, 0.07818469986648716, 0.16407387511120258, 0.12345774608547799, -0.06366842477542252, -0.35968525618603775, 0.043422824028750945, -0.1758108557651526, -0.12326599384963127, -0.17082815837307735, -0.013707900724919706, -0.022486805289598375, -0.2736716199955293, 0.1489813135182164, 0.06010779449395064, 0.06572833732376428, -0.0025588052010099434, -0.063225176997266, -0.009579791402412129, 0.12232696096581439, -8.498443037688989e-05, -0.03978093263917956, 0.0889681784387433, -0.14154357832438988, -0.17367995061193078, 0.30652261734187425, -0.07345462806376324, -0.14965562807628885, 0.19461705514775782, -0.15177139408441345, -0.11784770130380538, 0.03321757739217117, 0.12045287347904503, 0.06712560001600149, -0.1412109714779192, 0.05524734790830327, -0.0720295377159973, 0.1694079098715206, -0.005166645808113289, 0.12292419390447823, 0.24241566948656892, 0.14157175426250965, 0.0549203120212167, 0.18234758177202132, -0.08545080071178682, -0.10102827126031806, -0.3390213458493737, -0.18917939778224663, -0.23071147382644744, 0.013968142396810561, -0.08156386935197274, -0.18981251325699147, 0.4558580897844814, 0.17065115128483238, 0.1678239206165268, 0.03937513222375981, 0.21186008075139776, 0.1184952859525922, 0.04479276067135727, 0.05277858460763598, 0.2335718058627741, 0.11312927467475549, 0.04463724289812019, -0.29073990017561047, 0.04533815828999023, 0.07655669379866971] |
1,802.10523 | Is Private Browsing in Modern Web Browsers Really Private? | Web browsers are the most common tool to perform various activities over the
internet. Along with normal mode, all modern browsers have private browsing
mode. The name of the mode varies from browser to browser but the purpose of
the private mode remains same in every browser. In normal browsing mode, the
browser keeps track of users' activity and related data such as browsing
histories, cookies, auto-filled fields, temporary internet files, etc. In
private mode, it is said that no information is stored while browsing or all
information is destroyed after closing the current private session. However,
some researchers have already disproved this claim by performing various tests
in most popular browsers. I have also some personal experience where private
mode browsing fails to keep all browsing information as private. In this
position paper, I take the position against private browsing. By examining
various facts, it is proved that the private browsing mode is not really
private as it is claimed; it does not keep everything private. In following
sections, I will present the proof to justify my argument. Along with some
other already performed research work, I will show my personal case studies and
experimental data as well.
| cs.CR cs.CY | web browsers are the most common tool to perform various activities over the internet along with normal mode all modern browsers have private browsing mode the name of the mode varies from browser to browser but the purpose of the private mode remains same in every browser in normal browsing mode the browser keeps track of users activity and related data such as browsing histories cookies autofilled fields temporary internet files etc in private mode it is said that no information is stored while browsing or all information is destroyed after closing the current private session however some researchers have already disproved this claim by performing various tests in most popular browsers i have also some personal experience where private mode browsing fails to keep all browsing information as private in this position paper i take the position against private browsing by examining various facts it is proved that the private browsing mode is not really private as it is claimed it does not keep everything private in following sections i will present the proof to justify my argument along with some other already performed research work i will show my personal case studies and experimental data as well | [['web', 'browsers', 'are', 'the', 'most', 'common', 'tool', 'to', 'perform', 'various', 'activities', 'over', 'the', 'internet', 'along', 'with', 'normal', 'mode', 'all', 'modern', 'browsers', 'have', 'private', 'browsing', 'mode', 'the', 'name', 'of', 'the', 'mode', 'varies', 'from', 'browser', 'to', 'browser', 'but', 'the', 'purpose', 'of', 'the', 'private', 'mode', 'remains', 'same', 'in', 'every', 'browser', 'in', 'normal', 'browsing', 'mode', 'the', 'browser', 'keeps', 'track', 'of', 'users', 'activity', 'and', 'related', 'data', 'such', 'as', 'browsing', 'histories', 'cookies', 'autofilled', 'fields', 'temporary', 'internet', 'files', 'etc', 'in', 'private', 'mode', 'it', 'is', 'said', 'that', 'no', 'information', 'is', 'stored', 'while', 'browsing', 'or', 'all', 'information', 'is', 'destroyed', 'after', 'closing', 'the', 'current', 'private', 'session', 'however', 'some', 'researchers', 'have', 'already', 'disproved', 'this', 'claim', 'by', 'performing', 'various', 'tests', 'in', 'most', 'popular', 'browsers', 'i', 'have', 'also', 'some', 'personal', 'experience', 'where', 'private', 'mode', 'browsing', 'fails', 'to', 'keep', 'all', 'browsing', 'information', 'as', 'private', 'in', 'this', 'position', 'paper', 'i', 'take', 'the', 'position', 'against', 'private', 'browsing', 'by', 'examining', 'various', 'facts', 'it', 'is', 'proved', 'that', 'the', 'private', 'browsing', 'mode', 'is', 'not', 'really', 'private', 'as', 'it', 'is', 'claimed', 'it', 'does', 'not', 'keep', 'everything', 'private', 'in', 'following', 'sections', 'i', 'will', 'present', 'the', 'proof', 'to', 'justify', 'my', 'argument', 'along', 'with', 'some', 'other', 'already', 'performed', 'research', 'work', 'i', 'will', 'show', 'my', 'personal', 'case', 'studies', 'and', 'experimental', 'data', 'as', 'well']] | [-0.12864768127393392, 0.05697984124223391, -0.08926164939284625, 0.092784408882091, -0.1733472521858986, -0.26812401269515507, 0.08459379043220777, 0.39479829949935935, -0.28143143342958404, -0.29728416122044576, 0.1437708177084028, -0.3472144911500785, -0.102958249616098, 0.20747273364410068, -0.13501241936988076, -0.0026937161532296526, 0.04042572635131879, 0.09990871959069575, 0.04497919655922386, -0.3570176151891549, 0.2754341436190192, 0.05150401110953717, 0.31872301970754346, 0.04533397418333951, -0.013696423004589495, 0.0625557013225243, -0.13776830378731694, -0.05666957249526273, -0.08258428200739824, 0.03810846811216889, 0.34477606586961435, 0.28252747296342434, 0.33976494208109953, -0.43728880516669094, -0.12193953276922305, 0.08521205768920481, 0.18086367743172108, 0.10673121528375443, -0.09046309254828351, -0.3016297467219916, 0.09528658272786127, -0.19082293695666724, -0.07028521848913057, -0.08459096053271846, 0.017708196109537073, -0.002916480507172475, -0.17897247041004116, -0.015503163509584746, 0.02625378067111314, 0.11894079713583594, 0.009452272995582057, -0.05199694949569124, -0.0489072370386419, 0.2082473077556128, 0.14867088505457335, 0.01581454331894885, 0.21999190444176114, -0.1260938828562932, -0.1395557987212081, 0.37127250018106267, -0.01801957631738847, -0.1030011952130331, 0.1644510564892882, -0.10006980963211243, -0.14461512296375903, 0.07239514954680355, 0.13490062808345138, 0.06723761061533363, -0.20554257172978285, 0.04762155471564825, -0.06564495192883028, 0.2007124868663724, 0.08757396012331792, 0.06926873113637828, 0.22081036568675755, 0.12387384383026699, 0.03654008518758634, 0.03664494423940072, -0.0004617382755804092, -0.09439415527234851, -0.2415465679657034, -0.18479334953419788, -0.18672178644802176, -0.01936821925975359, -0.029207385149684434, -0.13252959306812798, 0.3566774138334123, 0.18001167769684936, 0.13556640414577542, 0.018520066258262354, 0.3897318924692544, -0.049580632344433904, 0.13561238874234446, 0.17576817641119388, 0.17522213641642898, -0.024030342756892847, 0.24225715931176886, -0.08439025815665684, 0.1775755425233093, -0.01987509307630285] |
1,802.10524 | Quantizing quantum Ricci curvature | Quantum Ricci curvature has been introduced recently as a new, geometric
observable characterizing the curvature properties of metric spaces, without
the need for a smooth structure. Besides coordinate invariance, its key
features are scalability, computability and robustness. We demonstrate that
these properties continue to hold in the context of nonperturbative quantum
gravity, by evaluating the quantum Ricci curvature numerically in
two-dimensional Euclidean quantum gravity, defined in terms of dynamical
triangulations. Despite the well-known, highly nonclassical properties of the
underlying quantum geometry, its Ricci curvature can be matched well to that of
a five-dimensional round sphere.
| hep-th gr-qc hep-lat | quantum ricci curvature has been introduced recently as a new geometric observable characterizing the curvature properties of metric spaces without the need for a smooth structure besides coordinate invariance its key features are scalability computability and robustness we demonstrate that these properties continue to hold in the context of nonperturbative quantum gravity by evaluating the quantum ricci curvature numerically in twodimensional euclidean quantum gravity defined in terms of dynamical triangulations despite the wellknown highly nonclassical properties of the underlying quantum geometry its ricci curvature can be matched well to that of a fivedimensional round sphere | [['quantum', 'ricci', 'curvature', 'has', 'been', 'introduced', 'recently', 'as', 'a', 'new', 'geometric', 'observable', 'characterizing', 'the', 'curvature', 'properties', 'of', 'metric', 'spaces', 'without', 'the', 'need', 'for', 'a', 'smooth', 'structure', 'besides', 'coordinate', 'invariance', 'its', 'key', 'features', 'are', 'scalability', 'computability', 'and', 'robustness', 'we', 'demonstrate', 'that', 'these', 'properties', 'continue', 'to', 'hold', 'in', 'the', 'context', 'of', 'nonperturbative', 'quantum', 'gravity', 'by', 'evaluating', 'the', 'quantum', 'ricci', 'curvature', 'numerically', 'in', 'twodimensional', 'euclidean', 'quantum', 'gravity', 'defined', 'in', 'terms', 'of', 'dynamical', 'triangulations', 'despite', 'the', 'wellknown', 'highly', 'nonclassical', 'properties', 'of', 'the', 'underlying', 'quantum', 'geometry', 'its', 'ricci', 'curvature', 'can', 'be', 'matched', 'well', 'to', 'that', 'of', 'a', 'fivedimensional', 'round', 'sphere']] | [-0.1706524330926569, 0.12687976708096502, -0.13387510451047044, 0.08846016230159684, -0.11939317440418036, -0.15028934693760485, -0.09545309292887778, 0.34726828128883713, -0.2657504352103723, -0.22994947569738877, 0.09277641460127932, -0.2318045608307186, -0.20117259280707098, 0.1702074463038068, -0.1332325288437699, 0.14600526273348613, -0.0023750550971415483, 0.05984936434971659, -0.08791503136193282, -0.2792000308730885, 0.3791687821871356, 0.05951249254446195, 0.25695262189072215, 0.102154103868739, 0.0993351594790032, -0.051324133260028534, 0.03264012830822091, 0.11519268797220368, -0.17251723291625048, 0.11008357649767085, 0.2079048220362318, 0.09717192272165497, 0.23312015126851438, -0.3997208220394034, -0.3081493526403057, 0.10228337336723742, 0.12209326880248754, 0.08357262040831541, -0.07527184514819008, -0.3473036436339546, 0.07811725332989897, -0.09264582832539944, -0.17246421123916086, -0.15990449511691143, -0.025963178688758297, -0.04377566930886946, -0.12104161516334372, 0.05391498197997479, 0.09472297330503351, 0.03855794642586261, -0.01222411929874828, -0.03923216685652733, -0.06112941044480785, 0.12652620832484804, 0.020119830191527542, 0.021552270170497267, 0.1142761959498258, -0.15789899251570827, -0.16611768313634553, 0.3970874943231281, -0.0808847854906497, -0.2663186435783772, 0.1402076302457748, -0.10673749704208028, -0.11511984067037702, 0.047604652425568356, 0.16732958394690955, 0.15086012488525163, -0.12516545889421218, 0.19558048426161373, 0.010539294999877089, 0.09949938677202322, 0.08753446866022913, 0.13340974452072069, 0.2277341698639487, 0.07498894593629397, 0.0705511048240097, 0.15327855250920708, -0.019975443610823467, -0.20737248925970084, -0.3369129545631279, -0.22850523812537032, -0.22130979489240993, 0.13436058940929604, -0.19020739955028004, -0.1817044117635018, 0.40256481285354023, 0.06674947826878021, 0.17273046176292395, 0.09212949714917494, 0.27253287220128664, 0.046986670251690635, 0.061764057698708616, 0.09229441293956418, 0.29209814523101635, 0.2125008668971101, 0.0677720430895294, -0.2273125336971134, 0.013017157587761941, 0.13428998269434822] |
1,802.10525 | Searching for supernovae in the multiply-imaged galaxies behind the
gravitational telescope A370 | Strong lensing by massive galaxy clusters can provide magnification of the
flux and even multiple images of the galaxies that lie behind them. This
phenomenon facilitates observations of high-redshift supernovae (SNe), that
would otherwise remain undetected. Type Ia supernovae (SNe Ia) detections are
of particular interest because of their standard brightness, since they can be
used to improve either cluster lensing models or cosmological parameter
measurements. We present a ground-based, near-infrared search for lensed SNe
behind the galaxy cluster Abell 370. Our survey was based on 15 epochs of
J-band observations with the HAWK-I instrument on the Very Large Telescope
(VLT). We use Hubble Space Telescope (HST) photometry to infer the global
properties of the multiply-imaged galaxies. Using a recently published lensing
model of Abell 370, we also present the predicted magnifications and time
delays between the images. In our survey, we did not discover any live SNe from
the 13 lensed galaxies with 47 multiple images behind Abell 370. This is
consistent with the expectation of $0.09\pm0.02$ SNe calculated based on the
measured star formation rate. We compare the expectations of discovering
strongly lensed SNe in our survey and that performed with HST during the Hubble
Frontier Fields (HFF) programme. We also show the expectations of search
campaigns that can be conducted with future facilities, such as the James Webb
Space Telescope (JWST) or the Wide-Field Infrared Survey Telescope (WFIRST). We
show that the NIRCam instrument aboard the JWST will be sensitive to most SN
multiple images in the strongly lensed galaxies and thus will be able to
measure their time delays if observations are scheduled accordingly.
| astro-ph.GA astro-ph.CO | strong lensing by massive galaxy clusters can provide magnification of the flux and even multiple images of the galaxies that lie behind them this phenomenon facilitates observations of highredshift supernovae sne that would otherwise remain undetected type ia supernovae sne ia detections are of particular interest because of their standard brightness since they can be used to improve either cluster lensing models or cosmological parameter measurements we present a groundbased nearinfrared search for lensed sne behind the galaxy cluster abell 370 our survey was based on 15 epochs of jband observations with the hawki instrument on the very large telescope vlt we use hubble space telescope hst photometry to infer the global properties of the multiplyimaged galaxies using a recently published lensing model of abell 370 we also present the predicted magnifications and time delays between the images in our survey we did not discover any live sne from the 13 lensed galaxies with 47 multiple images behind abell 370 this is consistent with the expectation of 009pm002 sne calculated based on the measured star formation rate we compare the expectations of discovering strongly lensed sne in our survey and that performed with hst during the hubble frontier fields hff programme we also show the expectations of search campaigns that can be conducted with future facilities such as the james webb space telescope jwst or the widefield infrared survey telescope wfirst we show that the nircam instrument aboard the jwst will be sensitive to most sn multiple images in the strongly lensed galaxies and thus will be able to measure their time delays if observations are scheduled accordingly | [['strong', 'lensing', 'by', 'massive', 'galaxy', 'clusters', 'can', 'provide', 'magnification', 'of', 'the', 'flux', 'and', 'even', 'multiple', 'images', 'of', 'the', 'galaxies', 'that', 'lie', 'behind', 'them', 'this', 'phenomenon', 'facilitates', 'observations', 'of', 'highredshift', 'supernovae', 'sne', 'that', 'would', 'otherwise', 'remain', 'undetected', 'type', 'ia', 'supernovae', 'sne', 'ia', 'detections', 'are', 'of', 'particular', 'interest', 'because', 'of', 'their', 'standard', 'brightness', 'since', 'they', 'can', 'be', 'used', 'to', 'improve', 'either', 'cluster', 'lensing', 'models', 'or', 'cosmological', 'parameter', 'measurements', 'we', 'present', 'a', 'groundbased', 'nearinfrared', 'search', 'for', 'lensed', 'sne', 'behind', 'the', 'galaxy', 'cluster', 'abell', '370', 'our', 'survey', 'was', 'based', 'on', '15', 'epochs', 'of', 'jband', 'observations', 'with', 'the', 'hawki', 'instrument', 'on', 'the', 'very', 'large', 'telescope', 'vlt', 'we', 'use', 'hubble', 'space', 'telescope', 'hst', 'photometry', 'to', 'infer', 'the', 'global', 'properties', 'of', 'the', 'multiplyimaged', 'galaxies', 'using', 'a', 'recently', 'published', 'lensing', 'model', 'of', 'abell', '370', 'we', 'also', 'present', 'the', 'predicted', 'magnifications', 'and', 'time', 'delays', 'between', 'the', 'images', 'in', 'our', 'survey', 'we', 'did', 'not', 'discover', 'any', 'live', 'sne', 'from', 'the', '13', 'lensed', 'galaxies', 'with', '47', 'multiple', 'images', 'behind', 'abell', '370', 'this', 'is', 'consistent', 'with', 'the', 'expectation', 'of', '009pm002', 'sne', 'calculated', 'based', 'on', 'the', 'measured', 'star', 'formation', 'rate', 'we', 'compare', 'the', 'expectations', 'of', 'discovering', 'strongly', 'lensed', 'sne', 'in', 'our', 'survey', 'and', 'that', 'performed', 'with', 'hst', 'during', 'the', 'hubble', 'frontier', 'fields', 'hff', 'programme', 'we', 'also', 'show', 'the', 'expectations', 'of', 'search', 'campaigns', 'that', 'can', 'be', 'conducted', 'with', 'future', 'facilities', 'such', 'as', 'the', 'james', 'webb', 'space', 'telescope', 'jwst', 'or', 'the', 'widefield', 'infrared', 'survey', 'telescope', 'wfirst', 'we', 'show', 'that', 'the', 'nircam', 'instrument', 'aboard', 'the', 'jwst', 'will', 'be', 'sensitive', 'to', 'most', 'sn', 'multiple', 'images', 'in', 'the', 'strongly', 'lensed', 'galaxies', 'and', 'thus', 'will', 'be', 'able', 'to', 'measure', 'their', 'time', 'delays', 'if', 'observations', 'are', 'scheduled', 'accordingly']] | [-0.050833257656432825, 0.0857796072052994, -0.09046780614379431, 0.10354254422630864, -0.20536938230053622, -0.08672087576784444, 0.036894616050896854, 0.4567478739478615, -0.13840621023278418, -0.3437753524247571, 0.08270680609687618, -0.3164618783717633, -0.08099499687923935, 0.2462846446688172, -0.02074316925678118, -0.026896701409736098, 0.16060848300971356, -0.15669035006452733, -0.029667704489103025, -0.4172355897911242, 0.27955473308370377, 0.13818871389870874, 0.17729313322778945, -0.08655751073098138, 0.08835766575000971, -0.09790027046171523, -0.15291652438311037, 0.0049505687516255914, -0.16022964118695265, 0.017029675444254953, 0.275264335758481, 0.22036808767540847, 0.21743484249134454, -0.3429450676793909, -0.19443850439697616, 0.13504237731855906, 0.20291195928670896, 0.029086608601880542, -0.036509752382998695, -0.3973507908650775, 0.030828049270155377, -0.11817588178311869, -0.13568404543803034, 0.05529601011801971, -0.040504488197577355, 0.07015146292773972, -0.20001739417555942, 0.11037069900909244, -0.09365397468619119, 0.07395633154161525, -0.14796581164905837, -0.0578198797668571, -0.034598762275172466, 0.058614078114526035, -0.04888040104258303, 0.08527445306845378, 0.10588692685228177, -0.18312886661295308, -0.029335802679093144, 0.4177422607352448, -0.07638309539508507, 0.07276007426844444, 0.20553070727268352, -0.23617086986826266, -0.21137722494073685, 0.08601341246145913, 0.18225031203986233, 0.10662715686206123, -0.17642515522082536, 0.024267638134438725, -0.007728367080312041, 0.23931473612694648, 0.021282211870429446, 0.10405836919724178, 0.3153157971593576, 0.09152187591057606, 0.06326922001700834, 0.06634205404611493, -0.33138161864206245, 0.05062496169009822, -0.26598507584720565, -0.10111514897804492, -0.16077357051852212, 0.10759246806106801, -0.1353460440029781, -0.08786386900933718, 0.32228596702964507, 0.16841889003968416, 0.193323290713257, 0.09396576394208389, 0.3057735886264327, -0.0007075055895638321, 0.17157645375609104, 0.02679128741517607, 0.3790331736786033, 0.10348944469487595, 0.10052257368981155, -0.19444895914776691, 0.03694369841527459, -0.006876702204151324] |
1,802.10526 | Application of R\'enyi and Tsallis Entropies to Topic Modeling
Optimization | This is full length article (draft version) where problem number of topics in
Topic Modeling is discussed. We proposed idea that Renyi and Tsallis entropy
can be used for identification of optimal number in large textual collections.
We also report results of numerical experiments of Semantic stability for 4
topic models, which shows that semantic stability play very important role in
problem topic number. The calculation of Renyi and Tsallis entropy based on
thermodynamics approach.
| stat.ML | this is full length article draft version where problem number of topics in topic modeling is discussed we proposed idea that renyi and tsallis entropy can be used for identification of optimal number in large textual collections we also report results of numerical experiments of semantic stability for 4 topic models which shows that semantic stability play very important role in problem topic number the calculation of renyi and tsallis entropy based on thermodynamics approach | [['this', 'is', 'full', 'length', 'article', 'draft', 'version', 'where', 'problem', 'number', 'of', 'topics', 'in', 'topic', 'modeling', 'is', 'discussed', 'we', 'proposed', 'idea', 'that', 'renyi', 'and', 'tsallis', 'entropy', 'can', 'be', 'used', 'for', 'identification', 'of', 'optimal', 'number', 'in', 'large', 'textual', 'collections', 'we', 'also', 'report', 'results', 'of', 'numerical', 'experiments', 'of', 'semantic', 'stability', 'for', '4', 'topic', 'models', 'which', 'shows', 'that', 'semantic', 'stability', 'play', 'very', 'important', 'role', 'in', 'problem', 'topic', 'number', 'the', 'calculation', 'of', 'renyi', 'and', 'tsallis', 'entropy', 'based', 'on', 'thermodynamics', 'approach']] | [-0.06328739162534475, 0.07956656555955609, -0.09597325605961184, 0.0909440937343364, -0.06862909892573953, -0.11599226355552673, 0.023530504703521728, 0.32885204687714575, -0.22991432918856541, -0.33314155076940855, 0.05359091812279075, -0.31515835713595153, -0.17097220246990522, 0.22357548076969883, -0.10978659600019455, 0.12898749612271787, 0.0996219684369862, 0.07570734653621912, -0.004019838155557712, -0.2831912287324667, 0.3224632703745738, 0.09847870143751303, 0.3433333757255847, 0.13937314656873545, 0.04686313631013036, 0.017836156903455656, -0.0794404170786341, 0.07375290228674809, -0.1853256659467782, 0.1660925915806244, 0.35395658063610125, 0.20209097665424147, 0.3202164350294818, -0.36879361430803936, -0.2201124222576618, 0.08229059511174758, 0.13425114432970683, 0.08580980672656248, -0.0763827708751584, -0.228999718464911, 0.059898246160397926, -0.2370022549604376, -0.04776710473001003, -0.1191894135872523, 0.04253751134499908, -0.026073059638341268, -0.21932333355148634, 0.13573931289797958, 0.11936182336881757, 0.10266083666433891, -0.03989285379027327, -0.12206774123633901, 0.033635696458319826, 0.09846498853216569, 0.09826656427855293, -0.012587918701271216, 0.10341079630578558, -0.11741620247252285, -0.1357281232221673, 0.3424427215754986, -0.03531899223725001, -0.24430814335743586, 0.11908282737247645, -0.06899296154578527, -0.23756795967618624, 0.04973966486752033, 0.19308879781203966, 0.145495137895147, -0.1321407166061302, 0.0539864867599681, -0.07499250456690788, 0.2147431587614119, 0.04593378795621296, 0.08205102695773045, 0.1977874233946204, 0.21217868485798438, -0.0020327804361780486, 0.2045359898249929, -0.06504506826090316, -0.1732939812168479, -0.3012058370312055, -0.17102157315860192, -0.21682465331008036, -0.01751724911814866, -0.09331528473606644, -0.1467813455561797, 0.3640241243566076, 0.23805971514433621, 0.15091946514944235, 0.022479377465012173, 0.2417228209475676, 0.05129086455330253, -0.0272609256953001, 0.08040039699524641, 0.15339245262245338, 0.11775432094465942, 0.1351024137251079, -0.18412664723737787, 0.07195308630044261, 0.201843341945981] |
1,802.10527 | Approaching near-perfect state discrimination of photonic Bell states
through the use of unentangled ancilla photons | Despite well-established no-go theorems on a perfect linear optical Bell
state analyzer, we find a numerical trend that appears to approach a
near-perfect measurement if we incorporate eight or more un-entangled ancilla
photons into our device. Following this trend, we begin a promising inductive
approach to building an ideal optical Bell measurement device. In the process,
we determine that any Bell state analyzer that (even occasionally) bunches all
photons into only two of the output modes cannot perform an ideal measurement
and we find a set of conditions on our linear optical circuit that prevent this
outcome.
| quant-ph cs.IT math.IT | despite wellestablished nogo theorems on a perfect linear optical bell state analyzer we find a numerical trend that appears to approach a nearperfect measurement if we incorporate eight or more unentangled ancilla photons into our device following this trend we begin a promising inductive approach to building an ideal optical bell measurement device in the process we determine that any bell state analyzer that even occasionally bunches all photons into only two of the output modes cannot perform an ideal measurement and we find a set of conditions on our linear optical circuit that prevent this outcome | [['despite', 'wellestablished', 'nogo', 'theorems', 'on', 'a', 'perfect', 'linear', 'optical', 'bell', 'state', 'analyzer', 'we', 'find', 'a', 'numerical', 'trend', 'that', 'appears', 'to', 'approach', 'a', 'nearperfect', 'measurement', 'if', 'we', 'incorporate', 'eight', 'or', 'more', 'unentangled', 'ancilla', 'photons', 'into', 'our', 'device', 'following', 'this', 'trend', 'we', 'begin', 'a', 'promising', 'inductive', 'approach', 'to', 'building', 'an', 'ideal', 'optical', 'bell', 'measurement', 'device', 'in', 'the', 'process', 'we', 'determine', 'that', 'any', 'bell', 'state', 'analyzer', 'that', 'even', 'occasionally', 'bunches', 'all', 'photons', 'into', 'only', 'two', 'of', 'the', 'output', 'modes', 'can', 'not', 'perform', 'an', 'ideal', 'measurement', 'and', 'we', 'find', 'a', 'set', 'of', 'conditions', 'on', 'our', 'linear', 'optical', 'circuit', 'that', 'prevent', 'this', 'outcome']] | [-0.12423375599461664, 0.12619064053863865, -0.1047351378187233, 0.016872336781600505, -0.05306270767278893, -0.24165843208130372, 0.08954039563862037, 0.40963811146057383, -0.22863909846050867, -0.2611531437165579, 0.05097058483242647, -0.2704591027327946, -0.08593625159535025, 0.24141001552866048, -0.03850678420074436, 0.07239131466010396, 0.11888990418187209, -0.02762196959342038, -0.034783358726061274, -0.21719234818782734, 0.27734183041112764, 0.018855903544748316, 0.3069594648514627, -0.00888462154175706, 0.13045122525274602, 0.04022474676294594, 0.010422348163603825, 0.014499328061178023, -0.07134757380087964, 0.07135876366982655, 0.259925387381595, 0.150944958393443, 0.2703313752058513, -0.45528379325964013, -0.1711171300017408, 0.13663323866488525, 0.12229760932945172, 0.1912165021984743, -0.051149619981552694, -0.24349420420868245, 0.037856499322366954, -0.2071344784403942, -0.10220869228110782, -0.09655230187728397, -0.011039631042097296, -0.07542991107899924, -0.2856283890587107, 0.021624681473310505, 0.13533728184387545, 0.017237135171129996, -0.027117497368468618, -0.034006083621738514, 0.025333621627080957, 0.0676765471235944, -0.08747270231982171, -0.0028170665478980056, 0.1521630520333669, -0.1108116675904781, -0.1773932833908772, 0.31201188175045713, -0.06600615232042512, -0.18986758787413033, 0.17524067228850054, -0.15339558941136322, -0.11175682495006037, 0.07318941320349671, 0.11777852614153633, 0.06872320356446185, -0.13908612631185321, -0.041248293974251504, -0.08579781849165352, 0.27678898735119184, 0.06906819627715313, 0.08224435046087114, 0.21457943392024204, 0.10275618233052748, 0.07260044234595736, 0.164249355058965, -0.04130885836267986, -0.025954405277045633, -0.3298461301423305, -0.1823692478670748, -0.1960305363255819, 0.12996525798668274, -0.06230406982011081, -0.13495208704083853, 0.39049266364273366, 0.17785351495828708, 0.15773785627466075, 0.01857439078846756, 0.35449117045773537, 0.08155611217421674, 0.05776805776570525, 0.04811101640593641, 0.3113885604472337, 0.12028363003984702, 0.06162726303220403, -0.1904551834200642, 0.05037795204897316, -0.0027496224217002795] |
1,802.10528 | Dimensional Analysis in Economics: A Study of the Neoclassical Economic
Growth Model | The fundamental purpose of the present research article is to introduce the
basic principles of Dimensional Analysis in the context of the neoclassical
economic theory, in order to apply such principles to the fundamental relations
that underlay most models of economic growth. In particular, basic instruments
from Dimensional Analysis are used to evaluate the analytical consistency of
the Neoclassical economic growth model. The analysis shows that an adjustment
to the model is required in such a way that the principle of dimensional
homogeneity is satisfied.
| econ.EM physics.soc-ph q-fin.GN | the fundamental purpose of the present research article is to introduce the basic principles of dimensional analysis in the context of the neoclassical economic theory in order to apply such principles to the fundamental relations that underlay most models of economic growth in particular basic instruments from dimensional analysis are used to evaluate the analytical consistency of the neoclassical economic growth model the analysis shows that an adjustment to the model is required in such a way that the principle of dimensional homogeneity is satisfied | [['the', 'fundamental', 'purpose', 'of', 'the', 'present', 'research', 'article', 'is', 'to', 'introduce', 'the', 'basic', 'principles', 'of', 'dimensional', 'analysis', 'in', 'the', 'context', 'of', 'the', 'neoclassical', 'economic', 'theory', 'in', 'order', 'to', 'apply', 'such', 'principles', 'to', 'the', 'fundamental', 'relations', 'that', 'underlay', 'most', 'models', 'of', 'economic', 'growth', 'in', 'particular', 'basic', 'instruments', 'from', 'dimensional', 'analysis', 'are', 'used', 'to', 'evaluate', 'the', 'analytical', 'consistency', 'of', 'the', 'neoclassical', 'economic', 'growth', 'model', 'the', 'analysis', 'shows', 'that', 'an', 'adjustment', 'to', 'the', 'model', 'is', 'required', 'in', 'such', 'a', 'way', 'that', 'the', 'principle', 'of', 'dimensional', 'homogeneity', 'is', 'satisfied']] | [-0.07111662802122096, 0.04593290331215351, -0.09340641087961986, 0.08210555192165296, -0.0820989360265872, -0.07179072143729119, 0.00755548428004498, 0.3036339536857079, -0.2696635563981117, -0.27941178539767864, 0.12309634777415981, -0.23824622472200324, -0.20460920903612587, 0.20307164980536874, -0.08151013901566757, 0.06489235997227404, 0.010785018586937119, 0.040930776610313094, -0.005289192508686992, -0.23021604217972388, 0.34147986386738277, 0.08706729244440795, 0.3660401745863697, 0.039724198717843086, 0.06307742968201638, -0.011543787517310942, -0.04560388979666373, 0.04931867824976935, -0.1727997784214334, 0.22121905510259024, 0.2695605104479696, 0.1737848156296155, 0.31512667856672233, -0.459439895104836, -0.22745216176571215, 0.04644019416369059, 0.09434020232737941, 0.09027263053131344, -0.02229201708208112, -0.16201191298006212, 0.08054422737126622, -0.17681783591123187, -0.1673371658742647, -0.09237896661986322, -0.03087999596917892, 0.00272213179645512, -0.2681335007552715, 0.08547360897064209, 0.06491250667501898, 0.08316892569555956, -0.0803243564797894, -0.05817637730608968, -0.01956050794790773, 0.14886768387308727, 0.1203594747273361, -0.03416524164049941, 0.08441712181357776, -0.11179787427553332, -0.15161317490479526, 0.42867598699077086, -0.03900533435345792, -0.1662717974580386, 0.2115306849427083, -0.1420587394030436, -0.19067226110354943, 0.0068026396281578964, 0.20273452653166127, 0.06238473333856639, -0.17235392802668845, 0.10544070741161704, -0.017144451860119314, 0.1658126326606554, 0.014268036538680248, 0.0026777398498619306, 0.16277251530657796, 0.21874191794708808, 0.06052277715986266, 0.1047626073088716, -0.04470090734608033, -0.13851954603896421, -0.3505522736512563, -0.18453877532087704, -0.13271710254964145, 0.05702085565529106, -0.09396481242249993, -0.14466704946723494, 0.40874508533845927, 0.22435320747317747, 0.09817779732539374, 0.009733627238036955, 0.3188322935472516, 0.14397202822215416, 0.07266643600510982, 0.03495970122406588, 0.2473297148669029, 0.14305040911935707, 0.08993897418327192, -0.19248137543361415, 0.07963472187299939, 0.09459412779439898] |
1,802.10529 | Maximum likelihood estimation of a finite mixture of logistic regression
models in a continuous data stream | In marketing we are often confronted with a continuous stream of responses to
marketing messages. Such streaming data provide invaluable information
regarding message effectiveness and segmentation. However, streaming data are
hard to analyze using conventional methods: their high volume and the fact that
they are continuously augmented means that it takes considerable time to
analyze them. We propose a method for estimating a finite mixture of logistic
regression models which can be used to cluster customers based on a continuous
stream of responses. This method, which we coin oFMLR, allows segments to be
identified in data streams or extremely large static datasets. Contrary to
black box algorithms, oFMLR provides model estimates that are directly
interpretable. We first introduce oFMLR, explaining in passing general topics
such as online estimation and the EM algorithm, making this paper a high level
overview of possible methods of dealing with large data streams in marketing
practice. Next, we discuss model convergence, identifiability, and relations to
alternative, Bayesian, methods; we also identify more general issues that arise
from dealing with continuously augmented data sets. Finally, we introduce the
oFMLR [R] package and evaluate the method by numerical simulation and by
analyzing a large customer clickstream dataset.
| cs.LG stat.CO stat.ML | in marketing we are often confronted with a continuous stream of responses to marketing messages such streaming data provide invaluable information regarding message effectiveness and segmentation however streaming data are hard to analyze using conventional methods their high volume and the fact that they are continuously augmented means that it takes considerable time to analyze them we propose a method for estimating a finite mixture of logistic regression models which can be used to cluster customers based on a continuous stream of responses this method which we coin ofmlr allows segments to be identified in data streams or extremely large static datasets contrary to black box algorithms ofmlr provides model estimates that are directly interpretable we first introduce ofmlr explaining in passing general topics such as online estimation and the em algorithm making this paper a high level overview of possible methods of dealing with large data streams in marketing practice next we discuss model convergence identifiability and relations to alternative bayesian methods we also identify more general issues that arise from dealing with continuously augmented data sets finally we introduce the ofmlr r package and evaluate the method by numerical simulation and by analyzing a large customer clickstream dataset | [['in', 'marketing', 'we', 'are', 'often', 'confronted', 'with', 'a', 'continuous', 'stream', 'of', 'responses', 'to', 'marketing', 'messages', 'such', 'streaming', 'data', 'provide', 'invaluable', 'information', 'regarding', 'message', 'effectiveness', 'and', 'segmentation', 'however', 'streaming', 'data', 'are', 'hard', 'to', 'analyze', 'using', 'conventional', 'methods', 'their', 'high', 'volume', 'and', 'the', 'fact', 'that', 'they', 'are', 'continuously', 'augmented', 'means', 'that', 'it', 'takes', 'considerable', 'time', 'to', 'analyze', 'them', 'we', 'propose', 'a', 'method', 'for', 'estimating', 'a', 'finite', 'mixture', 'of', 'logistic', 'regression', 'models', 'which', 'can', 'be', 'used', 'to', 'cluster', 'customers', 'based', 'on', 'a', 'continuous', 'stream', 'of', 'responses', 'this', 'method', 'which', 'we', 'coin', 'ofmlr', 'allows', 'segments', 'to', 'be', 'identified', 'in', 'data', 'streams', 'or', 'extremely', 'large', 'static', 'datasets', 'contrary', 'to', 'black', 'box', 'algorithms', 'ofmlr', 'provides', 'model', 'estimates', 'that', 'are', 'directly', 'interpretable', 'we', 'first', 'introduce', 'ofmlr', 'explaining', 'in', 'passing', 'general', 'topics', 'such', 'as', 'online', 'estimation', 'and', 'the', 'em', 'algorithm', 'making', 'this', 'paper', 'a', 'high', 'level', 'overview', 'of', 'possible', 'methods', 'of', 'dealing', 'with', 'large', 'data', 'streams', 'in', 'marketing', 'practice', 'next', 'we', 'discuss', 'model', 'convergence', 'identifiability', 'and', 'relations', 'to', 'alternative', 'bayesian', 'methods', 'we', 'also', 'identify', 'more', 'general', 'issues', 'that', 'arise', 'from', 'dealing', 'with', 'continuously', 'augmented', 'data', 'sets', 'finally', 'we', 'introduce', 'the', 'ofmlr', 'r', 'package', 'and', 'evaluate', 'the', 'method', 'by', 'numerical', 'simulation', 'and', 'by', 'analyzing', 'a', 'large', 'customer', 'clickstream', 'dataset']] | [-0.07447929385016323, 0.03450140254572034, -0.08259817220270634, 0.11566479377739597, -0.13608508700272068, -0.17039366776589304, 0.07343800893810112, 0.42759325333870946, -0.2814838557364419, -0.3128207724518143, 0.15332322258502246, -0.3008860005543829, -0.1616738229652401, 0.20253701480221933, -0.10695828930125571, 0.06953835560474544, 0.10627139776945115, 0.0077728942492103666, -0.03237877194507746, -0.2731491394271143, 0.29357793617760763, 0.0407830073137302, 0.28194152876734735, -0.003924964554607868, 0.10383600216417108, 0.0203871384751983, -0.09785417282371782, 0.050872310441336596, -0.11906939490072546, 0.155415427434491, 0.31794844749116236, 0.22669521576026455, 0.3174749225191772, -0.4235020624531899, -0.19545201075612567, 0.10649963890551589, 0.15629027162445708, 0.1308762389882031, -0.06947391971691104, -0.29822627709247174, 0.09069558778544888, -0.206497691529803, -0.05429962670779787, -0.1592540021066088, -0.019723549052141607, 0.027659501346061006, -0.3005102295009419, 0.05509344554375275, -0.0027979632560163736, 0.04115493491292, -0.044780866504006554, -0.08495348116499372, 0.038726762481965125, 0.135427821528865, 0.08446135739679449, 0.014908744166750693, 0.10874715083511546, -0.11472333504203562, -0.12977331148227678, 0.38278954226290807, -0.05383939342602389, -0.19590075174812227, 0.20970588622265496, -0.06395643126685173, -0.1526384193263948, 0.0888323132682126, 0.26573350018821656, 0.09953108038404025, -0.18305655919481068, 0.028201711957226507, -0.03425292252097279, 0.1601433064369485, 0.01986145043745637, -0.021240276310709304, 0.17152433685492724, 0.19096982744522392, 0.03398437477269908, 0.13518594426655908, -0.09334117542850436, -0.07841872098884778, -0.2349292674055323, -0.12071023878641426, -0.16438481408637018, -0.03652801617980003, -0.11701621225933195, -0.17519126925966702, 0.3479921401850879, 0.24200000449549408, 0.21097948657115922, 0.06416875497554429, 0.3503263891953975, 0.0726505639863899, 0.05561960716848262, 0.11182588498806581, 0.13124271300970577, 0.03772017250070348, 0.10801186393684475, -0.12168883820762857, 0.08706340970820747, 0.015633886235300452] |
1,802.1053 | Orion+: Automated Problem Diagnosis in Computing Systems by Mining
Metric Data | This work presents the suspicious code at a finer granularity of call stack
rather than code region, which was being returned by Orion. Call stack based
comparison returns call stacks that are most impacted by the bug and save
developer time to debug from scratch. This solution has polynomial complexity
and hence can be implemented practically.
| cs.DC | this work presents the suspicious code at a finer granularity of call stack rather than code region which was being returned by orion call stack based comparison returns call stacks that are most impacted by the bug and save developer time to debug from scratch this solution has polynomial complexity and hence can be implemented practically | [['this', 'work', 'presents', 'the', 'suspicious', 'code', 'at', 'a', 'finer', 'granularity', 'of', 'call', 'stack', 'rather', 'than', 'code', 'region', 'which', 'was', 'being', 'returned', 'by', 'orion', 'call', 'stack', 'based', 'comparison', 'returns', 'call', 'stacks', 'that', 'are', 'most', 'impacted', 'by', 'the', 'bug', 'and', 'save', 'developer', 'time', 'to', 'debug', 'from', 'scratch', 'this', 'solution', 'has', 'polynomial', 'complexity', 'and', 'hence', 'can', 'be', 'implemented', 'practically']] | [-0.06923103776560831, 0.0490574299391093, -0.11005114496219903, 0.06499748912756331, -0.14291819432816869, -0.22230487304373778, 0.06677664402273617, 0.39046750783122014, -0.29114840105051243, -0.3341134967558901, 0.12241733391835753, -0.24814726505428553, -0.08798412942477236, 0.21821892091871373, -0.13246608818683722, 0.0013433068046911753, 0.09583954835709717, -0.0037322833335825373, -0.05764048261594975, -0.33012809521252556, 0.3265005135908723, 0.175631968504084, 0.24516225582088477, 0.008733642403967679, 0.03151682691947956, -0.06074538377392206, -0.058574800738175066, 0.02007463327442695, -0.04297179251508559, 0.07625521739412632, 0.30423740102976027, 0.204015583598188, 0.2792246913138245, -0.45044575232480255, -0.15895969068099344, 0.0359154064249846, 0.17503210683519552, 0.08658539617525614, 0.02248083841654339, -0.24693790368369914, 0.2000562054225676, -0.2026545619924686, -0.052345329812461774, -0.055138148966112306, -0.010715055894771857, -0.04550599167123437, -0.17752455127525277, -0.07240949699501341, -0.02816186100244522, 0.10352601140870579, 0.022150140617408658, -0.0942580525089787, -0.026821400246782496, 0.12349348809636597, -0.0059034075987126145, 0.11380658988491632, 0.16988857580249064, -0.0625212493635315, -0.11374286217947624, 0.378044266586325, -0.0022492405397705234, -0.15311738786112983, 0.157542896195082, -0.02246816923642265, -0.1186766758161996, 0.19664594015505696, 0.14877851184324495, 0.10594464587380312, -0.1744408090266266, 0.07897003167766213, -0.035957707574457994, 0.27762057038697613, 0.13328881836995216, 0.0017761813381054839, 0.18741081612617044, 0.19208130352698, 0.051431640034674535, 0.1985677577467868, -0.06219941653710391, -0.041724866655256064, -0.21123626605341478, -0.16478521400962823, -0.13622556952759624, 0.027530060419979106, -0.05646180980121634, -0.15997961975101913, 0.38718696700276006, 0.21893120180383058, 0.1311810570769012, 0.11501514634957337, 0.330805606740926, 0.04450738231285608, 0.12676543930553766, 0.16785977175459266, 0.11671187874994107, -0.06871820423735439, 0.12542795128787734, -0.12065828712573941, 0.22018712226002077, 0.10001787185735468] |
1,802.10531 | Satellite ruling polynomials, DGA representations, and the colored
HOMFLY-PT polynomial | We establish relationships between two classes of invariants of Legendrian
knots in $\mathbb{R}^3$: Representation numbers of the Chekanov-Eliashberg DGA
and satellite ruling polynomials. For positive permutation braids, $\beta
\subset J^1S^1$, we give a precise formula in terms of representation numbers
for the $m$-graded ruling polynomial $R^m_{S(K,\beta)}(z)$ of the satellite of
$K$ with $\beta$ specialized at $z=q^{1/2}-q^{-1/2}$ with $q$ a prime power,
and we use this formula to prove that arbitrary $m$-graded satellite ruling
polynomials, $R^m_{S(K,L)}$, are determined by the Chekanov-Eliashberg DGA of
$K$. Conversely, for $m\neq 1$, we introduce an $n$-colored $m$-graded ruling
polynomial, $R^m_{n,K}(q)$, in strict analogy with the $n$-colored HOMFLY-PT
polynomial, and show that the total $n$-dimensional $m$-graded representation
number of $K$ to $\mathbb{F}_q^n$, $\mbox{Rep}_m(K,\mathbb{F}_q^n)$, is exactly
equal to $R^m_{n,K}(q)$. In the case of $2$-graded representations, we show
that $R^2_{n,K}=\mbox{Rep}_2(K, \mathbb{F}_q^n)$ arises as a specialization of
the $n$-colored HOMFLY-PT polynomial.
| math.SG math.GT | we establish relationships between two classes of invariants of legendrian knots in mathbbr3 representation numbers of the chekanoveliashberg dga and satellite ruling polynomials for positive permutation braids beta subset j1s1 we give a precise formula in terms of representation numbers for the mgraded ruling polynomial rm_skbetaz of the satellite of k with beta specialized at zq12q12 with q a prime power and we use this formula to prove that arbitrary mgraded satellite ruling polynomials rm_skl are determined by the chekanoveliashberg dga of k conversely for mneq 1 we introduce an ncolored mgraded ruling polynomial rm_nkq in strict analogy with the ncolored homflypt polynomial and show that the total ndimensional mgraded representation number of k to mathbbf_qn mboxrep_mkmathbbf_qn is exactly equal to rm_nkq in the case of 2graded representations we show that r2_nkmboxrep_2k mathbbf_qn arises as a specialization of the ncolored homflypt polynomial | [['we', 'establish', 'relationships', 'between', 'two', 'classes', 'of', 'invariants', 'of', 'legendrian', 'knots', 'in', 'mathbbr3', 'representation', 'numbers', 'of', 'the', 'chekanoveliashberg', 'dga', 'and', 'satellite', 'ruling', 'polynomials', 'for', 'positive', 'permutation', 'braids', 'beta', 'subset', 'j1s1', 'we', 'give', 'a', 'precise', 'formula', 'in', 'terms', 'of', 'representation', 'numbers', 'for', 'the', 'mgraded', 'ruling', 'polynomial', 'rm_skbetaz', 'of', 'the', 'satellite', 'of', 'k', 'with', 'beta', 'specialized', 'at', 'zq12q12', 'with', 'q', 'a', 'prime', 'power', 'and', 'we', 'use', 'this', 'formula', 'to', 'prove', 'that', 'arbitrary', 'mgraded', 'satellite', 'ruling', 'polynomials', 'rm_skl', 'are', 'determined', 'by', 'the', 'chekanoveliashberg', 'dga', 'of', 'k', 'conversely', 'for', 'mneq', '1', 'we', 'introduce', 'an', 'ncolored', 'mgraded', 'ruling', 'polynomial', 'rm_nkq', 'in', 'strict', 'analogy', 'with', 'the', 'ncolored', 'homflypt', 'polynomial', 'and', 'show', 'that', 'the', 'total', 'ndimensional', 'mgraded', 'representation', 'number', 'of', 'k', 'to', 'mathbbf_qn', 'mboxrep_mkmathbbf_qn', 'is', 'exactly', 'equal', 'to', 'rm_nkq', 'in', 'the', 'case', 'of', '2graded', 'representations', 'we', 'show', 'that', 'r2_nkmboxrep_2k', 'mathbbf_qn', 'arises', 'as', 'a', 'specialization', 'of', 'the', 'ncolored', 'homflypt', 'polynomial']] | [-0.2537611079091827, 0.08922274262499909, -0.07470879386765537, 0.05037973465880862, -0.09667877361730293, -0.15956642941261331, 0.011047576974939417, 0.2952120914917301, -0.33226287280450817, -0.27570329525128556, 0.018907651746714556, -0.23817747914128834, -0.16709514158191505, 0.2097306150874054, -0.07214437790421976, -0.012855741083277044, 0.0341923991839091, 0.08791653165869691, -0.09888011034474604, -0.29015120371865727, 0.3421393972028185, -0.03956419331780462, 0.11391686740572805, 0.012302579399612214, 0.129637142588143, -0.007448005738357703, -0.02328265090300529, -0.02843836549910958, -0.18905143470722208, 0.10756951259983773, 0.29859466713969596, 0.10467906833143421, 0.15003566019478495, -0.35011128798403124, -0.07986988538048334, 0.24246991732744155, 0.15327478009793494, -0.03208105511170019, 0.034522048632303876, -0.21595814206844402, 0.14600938330059526, -0.18930829139081418, -0.17472573263329214, -0.07468111755464364, 0.08732571800549825, 0.03271002810517395, -0.27315010202151757, 0.0294922863571426, 0.114099631137732, 0.16560316631156538, -0.0020285408633450666, -0.13604233418763786, 0.00018272117056228497, 0.06809660131801609, -0.013662669657626086, 0.06199582918909275, 0.03893698291439149, -0.13374472915677837, -0.12346854547935504, 0.3454247478533674, -0.06737641795641847, -0.22917324141491446, 0.09004262867211192, -0.17656416821603974, -0.19301350984929336, 0.13981160211756274, 0.05012255544187846, 0.0941705288503457, -0.009465218300034326, 0.15517421868603884, -0.1677162262990519, 0.09819605648862544, 0.1493990184980686, -0.02018416192451561, 0.1636158550912687, 0.006227603340866389, 0.07583532686241799, 0.18474555890317315, -0.03603685002911974, -0.037465826195181795, -0.3117447480214415, -0.2447370954151093, -0.14211129333513478, 0.12694795938139714, -0.15028766450888253, -0.13449605383254865, 0.3415075313506855, 0.05808961078766044, 0.19402430298289766, 0.20493974037882354, 0.22399662837938025, 0.09194462157147765, 0.06526621458017164, 0.06541822071152704, 0.08268210567120049, 0.1863912317643149, -0.010773663760887252, -0.15649465571192128, 0.019498294648817843, 0.20450675392316447] |
1,802.10532 | Higgs and $Z$ Assisted Stop Searches at Hadron Colliders | Current searches for the light top squark (stop) mostly focus on the decay
channels of $\tilde{t} \rightarrow t \chi_1^0$ or $\tilde{t} \rightarrow b
\chi_1^\pm \rightarrow bW \chi_1^0$, leading to $t\bar{t}/bbWW+\met$ final
states for stop pair productions at the LHC. However, in supersymmetric
scenarios with light neutralinos and charginos other than the neutralino
lightest supersymmetric particle (LSP), more than one decay mode of the stop
could be dominant. While those new decay modes could significantly weaken the
current stop search limits at the LHC, they also offer alternative discovery
channels for stop searches. In this paper, we studied the scenario with light
Higgsino next-to-LSPs (NLSPs) and Bino LSP. The light stop decays primarily via
$\tilde t_1 \to t \chi_2^0/\chi_3^0$, with the neutralinos subsequent decaying
to a $Z$ boson or a Higgs boson: $\chi_2^0/\chi^0_3 \to \chi_1^0 h/Z$. Pair
production of light stops at the LHC leads to final states of $t \bar t
hh\met$, $t \bar t hZ\met$ or $t \bar t ZZ\met$. We consider three signal
regions: one charged lepton (1$\ell$), two opposite sign charged leptons (2 OS
$\ell$) and at least three charged leptons ($ \ge 3 \ell$). We found that the
1$\ell$ signal region of channel $t \bar t hZ\met$ has the best reach
sensitivity for light stop searches. For 14 TeV LHC with 300 ${\rm fb}^{-1}$
integrated luminosity, a stop mass up to 900 GeV can be discovered at 5$\sigma$
significance, or up to 1050 GeV can be excluded at 95\% C.L. Combining all
three decay channels for $1 \ell$ signal region extends the reach for about
100$-$150 GeV. We also studied the stop reach at the 100 TeV $pp$ collider with
3 ${\rm ab}^{-1}$ luminosity, with discovery and exclusion reach being 6 TeV
and 7 TeV, respectively.
| hep-ph | current searches for the light top squark stop mostly focus on the decay channels of tildet rightarrow t chi_10 or tildet rightarrow b chi_1pm rightarrow bw chi_10 leading to tbartbbwwmet final states for stop pair productions at the lhc however in supersymmetric scenarios with light neutralinos and charginos other than the neutralino lightest supersymmetric particle lsp more than one decay mode of the stop could be dominant while those new decay modes could significantly weaken the current stop search limits at the lhc they also offer alternative discovery channels for stop searches in this paper we studied the scenario with light higgsino nexttolsps nlsps and bino lsp the light stop decays primarily via tilde t_1 to t chi_20chi_30 with the neutralinos subsequent decaying to a z boson or a higgs boson chi_20chi0_3 to chi_10 hz pair production of light stops at the lhc leads to final states of t bar t hhmet t bar t hzmet or t bar t zzmet we consider three signal regions one charged lepton 1ell two opposite sign charged leptons 2 os ell and at least three charged leptons ge 3 ell we found that the 1ell signal region of channel t bar t hzmet has the best reach sensitivity for light stop searches for 14 tev lhc with 300 rm fb1 integrated luminosity a stop mass up to 900 gev can be discovered at 5sigma significance or up to 1050 gev can be excluded at 95 cl combining all three decay channels for 1 ell signal region extends the reach for about 100150 gev we also studied the stop reach at the 100 tev pp collider with 3 rm ab1 luminosity with discovery and exclusion reach being 6 tev and 7 tev respectively | [['current', 'searches', 'for', 'the', 'light', 'top', 'squark', 'stop', 'mostly', 'focus', 'on', 'the', 'decay', 'channels', 'of', 'tildet', 'rightarrow', 't', 'chi_10', 'or', 'tildet', 'rightarrow', 'b', 'chi_1pm', 'rightarrow', 'bw', 'chi_10', 'leading', 'to', 'tbartbbwwmet', 'final', 'states', 'for', 'stop', 'pair', 'productions', 'at', 'the', 'lhc', 'however', 'in', 'supersymmetric', 'scenarios', 'with', 'light', 'neutralinos', 'and', 'charginos', 'other', 'than', 'the', 'neutralino', 'lightest', 'supersymmetric', 'particle', 'lsp', 'more', 'than', 'one', 'decay', 'mode', 'of', 'the', 'stop', 'could', 'be', 'dominant', 'while', 'those', 'new', 'decay', 'modes', 'could', 'significantly', 'weaken', 'the', 'current', 'stop', 'search', 'limits', 'at', 'the', 'lhc', 'they', 'also', 'offer', 'alternative', 'discovery', 'channels', 'for', 'stop', 'searches', 'in', 'this', 'paper', 'we', 'studied', 'the', 'scenario', 'with', 'light', 'higgsino', 'nexttolsps', 'nlsps', 'and', 'bino', 'lsp', 'the', 'light', 'stop', 'decays', 'primarily', 'via', 'tilde', 't_1', 'to', 't', 'chi_20chi_30', 'with', 'the', 'neutralinos', 'subsequent', 'decaying', 'to', 'a', 'z', 'boson', 'or', 'a', 'higgs', 'boson', 'chi_20chi0_3', 'to', 'chi_10', 'hz', 'pair', 'production', 'of', 'light', 'stops', 'at', 'the', 'lhc', 'leads', 'to', 'final', 'states', 'of', 't', 'bar', 't', 'hhmet', 't', 'bar', 't', 'hzmet', 'or', 't', 'bar', 't', 'zzmet', 'we', 'consider', 'three', 'signal', 'regions', 'one', 'charged', 'lepton', '1ell', 'two', 'opposite', 'sign', 'charged', 'leptons', '2', 'os', 'ell', 'and', 'at', 'least', 'three', 'charged', 'leptons', 'ge', '3', 'ell', 'we', 'found', 'that', 'the', '1ell', 'signal', 'region', 'of', 'channel', 't', 'bar', 't', 'hzmet', 'has', 'the', 'best', 'reach', 'sensitivity', 'for', 'light', 'stop', 'searches', 'for', '14', 'tev', 'lhc', 'with', '300', 'rm', 'fb1', 'integrated', 'luminosity', 'a', 'stop', 'mass', 'up', 'to', '900', 'gev', 'can', 'be', 'discovered', 'at', '5sigma', 'significance', 'or', 'up', 'to', '1050', 'gev', 'can', 'be', 'excluded', 'at', '95', 'cl', 'combining', 'all', 'three', 'decay', 'channels', 'for', '1', 'ell', 'signal', 'region', 'extends', 'the', 'reach', 'for', 'about', '100150', 'gev', 'we', 'also', 'studied', 'the', 'stop', 'reach', 'at', 'the', '100', 'tev', 'pp', 'collider', 'with', '3', 'rm', 'ab1', 'luminosity', 'with', 'discovery', 'and', 'exclusion', 'reach', 'being', '6', 'tev', 'and', '7', 'tev', 'respectively']] | [-0.07162740374161296, 0.33974083825064244, 0.007095209450470913, 0.17361698763774794, -0.05821545918975887, -0.2692616739694785, 0.0819885126705318, 0.33650589170219425, -0.23714452603951203, -0.3160838127812351, 0.043171434388976554, -0.3588560515835722, 0.15282536948802367, 0.13738127996203792, 0.13011364623538824, 0.051229702143058234, 0.12218211521063119, 0.014497693147082744, -0.024866393070462494, -0.26377545667603425, 0.17453265962939962, 0.018947501233911465, 0.11491615433259154, 0.11023136732430326, -0.010715120363470127, 0.012458618788721431, -0.00662739293275275, -0.18715032727666384, -0.13674054417384351, -0.007529296151410417, 0.20294807334074227, 0.09437535924247045, 0.11077988531201866, -0.2747882249275408, -0.06186670473581213, 0.24516802424319697, 0.21989890651651442, -0.000571437507330894, -0.05212200589767397, -0.3297326262871274, 0.20977805016539142, -0.20880184645575614, -0.08734020537587406, 0.06520372013821601, 0.03092626134908072, -0.17858898138616638, -0.3364520905343849, 0.1098714623618059, -0.04032474337311402, -0.008341136246793689, 0.05898807899698323, -0.24008558352612078, -0.10850470743947448, -0.0704327758262431, 0.12596618745756066, 0.06959555609594183, 0.2308104855179939, -0.17185852499397014, -0.20260684503394832, 0.3421805730218804, -0.137279375473363, -0.11364622202161634, 0.24140340042755412, -0.20840356402510107, -0.12938332215806608, 0.19809864040503936, 0.265253371764571, 0.09539413073135779, -0.15457841025638888, 0.16038755824341144, 0.024783389044393624, 0.17572567432172584, 0.15496381955698557, 0.07618987268819623, 0.2705759880985581, 0.2306790221880233, 0.07835506808403814, 0.038352048750991644, -0.14183411820546402, 0.012394844662079926, -0.43451492530807484, -0.1268438799240464, -9.546935584419324e-05, 0.06998083384681056, -0.037676226373111875, 0.030605783463982714, 0.37158141557949187, 0.07842658877909661, 0.32475082450330894, 0.05199402642355125, 0.25713443713514567, 0.056740472528642685, 0.07966513727744792, 0.08956599879438791, 0.3528777422164683, 0.10483488630589588, 0.14791085232079054, -0.17082654226412233, -0.04247118862929134, 0.008420751796326073] |
1,802.10533 | Modern Theory for the Orbital Moment in a Superconductor | The chiral p-wave superconducting state is comprised of spin triplet Cooper
pairs carrying a finite orbital angular momentum. For the case of a periodic
lattice, calculating the net magnetisation arising from this orbital component
presents a challenge as the circulation operator $\hat{\bf{r}} \times
\hat{\bf{p}}$ is not well defined in the Bloch representation. This difficulty
has been overcome in the normal state, for which a modern theory is firmly
established. Here, we derive the extension of this normal state approach,
generating a theory which is valid for a general superconducting state, and go
on to perform model calculations for a chiral p-wave state in Sr$_2$RuO$_4$.
The results suggest that the magnitude of the elusive edge current in
Sr$_2$RuO$_4$ is finite, but lies below experimental resolution. This provides
a possible solution to the long-standing controversy concerning the gap
symmetry of the superconducting state in this material.
| cond-mat.supr-con | the chiral pwave superconducting state is comprised of spin triplet cooper pairs carrying a finite orbital angular momentum for the case of a periodic lattice calculating the net magnetisation arising from this orbital component presents a challenge as the circulation operator hatbfr times hatbfp is not well defined in the bloch representation this difficulty has been overcome in the normal state for which a modern theory is firmly established here we derive the extension of this normal state approach generating a theory which is valid for a general superconducting state and go on to perform model calculations for a chiral pwave state in sr_2ruo_4 the results suggest that the magnitude of the elusive edge current in sr_2ruo_4 is finite but lies below experimental resolution this provides a possible solution to the longstanding controversy concerning the gap symmetry of the superconducting state in this material | [['the', 'chiral', 'pwave', 'superconducting', 'state', 'is', 'comprised', 'of', 'spin', 'triplet', 'cooper', 'pairs', 'carrying', 'a', 'finite', 'orbital', 'angular', 'momentum', 'for', 'the', 'case', 'of', 'a', 'periodic', 'lattice', 'calculating', 'the', 'net', 'magnetisation', 'arising', 'from', 'this', 'orbital', 'component', 'presents', 'a', 'challenge', 'as', 'the', 'circulation', 'operator', 'hatbfr', 'times', 'hatbfp', 'is', 'not', 'well', 'defined', 'in', 'the', 'bloch', 'representation', 'this', 'difficulty', 'has', 'been', 'overcome', 'in', 'the', 'normal', 'state', 'for', 'which', 'a', 'modern', 'theory', 'is', 'firmly', 'established', 'here', 'we', 'derive', 'the', 'extension', 'of', 'this', 'normal', 'state', 'approach', 'generating', 'a', 'theory', 'which', 'is', 'valid', 'for', 'a', 'general', 'superconducting', 'state', 'and', 'go', 'on', 'to', 'perform', 'model', 'calculations', 'for', 'a', 'chiral', 'pwave', 'state', 'in', 'sr_2ruo_4', 'the', 'results', 'suggest', 'that', 'the', 'magnitude', 'of', 'the', 'elusive', 'edge', 'current', 'in', 'sr_2ruo_4', 'is', 'finite', 'but', 'lies', 'below', 'experimental', 'resolution', 'this', 'provides', 'a', 'possible', 'solution', 'to', 'the', 'longstanding', 'controversy', 'concerning', 'the', 'gap', 'symmetry', 'of', 'the', 'superconducting', 'state', 'in', 'this', 'material']] | [-0.1850244193223082, 0.1682801339209644, -0.08534547691823731, 0.04998485552816009, -0.08550943387016444, -0.09308168185796116, 0.0794594985036127, 0.32869496167650525, -0.23994544961548764, -0.24488906239972671, 0.04732392568216646, -0.2763917323621646, -0.06678651003691723, 0.14752020951340789, 0.0049413082970332515, 0.05719314854670788, 0.014302194590719653, 0.04173419145460595, -0.11475841549239908, -0.1847682402298694, 0.33333481276329135, -0.028223599320356275, 0.3152122010680204, 0.10022511744124055, 0.07645539910443173, -0.009805402792396858, 0.06795329659600073, -0.021692284350086685, -0.1100203927435103, 0.10940423496329868, 0.27058731702576116, 0.004106526802503832, 0.2253574441881579, -0.4294148510859781, -0.23493009132110107, 0.06492276477929153, 0.13498552057983904, 0.176799858977664, -0.050259724420882286, -0.265242283685874, 0.08029855484541334, -0.19519695838336165, -0.1909234366432147, -0.0921750791685682, 0.01798146022614879, -0.09222311489480797, -0.24024816054824583, 0.11515115533994746, 0.10606674562473978, 0.06896302251867306, -0.08621372289883471, -0.11930948320995938, -0.008466336894190123, 0.05178357495821383, 0.04307474643008416, 0.09668771677624277, 0.058035881460634466, -0.1494099176931523, -0.1230861755402785, 0.3525350420099591, -0.034580483455473265, -0.16593195112589354, 0.1283709747605288, -0.12992578842283659, -0.0846163849543098, 0.09827826227861601, 0.08296137495937062, 0.1051183053043107, -0.12997202656533516, 0.09124572991195108, -0.09327193576691699, 0.16714825174069478, 0.005049107156851342, 0.057951396789064004, 0.2644387482088322, 0.2307200750195041, 0.0703192747453831, 0.12969747059945752, -0.11558234605292173, -0.12247631784805595, -0.2982519696692897, -0.17370674817972082, -0.23707986190180544, 0.07525294819778294, 0.026362389201584475, -0.18849326048085702, 0.42635871711987217, 0.15637706410349675, 0.20738887834087225, -0.028369486907457695, 0.29197921318946485, 0.12273837859056969, 0.05705426765841917, 0.039045837219201136, 0.25700412711872994, 0.17849196096501824, 0.08545326548759681, -0.2810197065102304, 0.06462408551244511, 0.05267038493594286] |
1,802.10534 | Voigt effect-based wide-field magneto-optical microscope integrated in a
pump-probe experimental setup | In this work we describe an experimental setup for spatially-resolved
pump-probe experiment with integrated wide-field magneto-optical (MO)
microscope. The MO microscope can be used to study ferromagnetic materials with
both perpendicular-to-plane and in-plane magnetic anisotropy via polar Kerr and
Voigt effects, respectively. The functionality of the Voigt effect-based
microscope was tested using an in-plane magnetized ferromagnetic semiconductor
(Ga,Mn)As. It was revealed that the presence of mechanical defects in the
(Ga,Mn)As epilayer alters significantly the magnetic anisotropy in their
proximity. The importance of MO experiments with simultaneous temporal and
spatial resolutions was demonstrated using (Ga,Mn)As sample attached to a
piezoelectric actuator, which produces a voltage-controlled strain. We observed
a considerably different behavior in different parts of the sample that enabled
us to identify sample parts where the epilayer magnetic anisotropy was
significantly modified by a presence of the piezostressor and where it was not.
Finally, we discuss the possible applicability of our experimental setup for
the research of compensated antiferromagnets, where only MO effects even in
magnetic moments are present.
| cond-mat.mtrl-sci | in this work we describe an experimental setup for spatiallyresolved pumpprobe experiment with integrated widefield magnetooptical mo microscope the mo microscope can be used to study ferromagnetic materials with both perpendiculartoplane and inplane magnetic anisotropy via polar kerr and voigt effects respectively the functionality of the voigt effectbased microscope was tested using an inplane magnetized ferromagnetic semiconductor gamnas it was revealed that the presence of mechanical defects in the gamnas epilayer alters significantly the magnetic anisotropy in their proximity the importance of mo experiments with simultaneous temporal and spatial resolutions was demonstrated using gamnas sample attached to a piezoelectric actuator which produces a voltagecontrolled strain we observed a considerably different behavior in different parts of the sample that enabled us to identify sample parts where the epilayer magnetic anisotropy was significantly modified by a presence of the piezostressor and where it was not finally we discuss the possible applicability of our experimental setup for the research of compensated antiferromagnets where only mo effects even in magnetic moments are present | [['in', 'this', 'work', 'we', 'describe', 'an', 'experimental', 'setup', 'for', 'spatiallyresolved', 'pumpprobe', 'experiment', 'with', 'integrated', 'widefield', 'magnetooptical', 'mo', 'microscope', 'the', 'mo', 'microscope', 'can', 'be', 'used', 'to', 'study', 'ferromagnetic', 'materials', 'with', 'both', 'perpendiculartoplane', 'and', 'inplane', 'magnetic', 'anisotropy', 'via', 'polar', 'kerr', 'and', 'voigt', 'effects', 'respectively', 'the', 'functionality', 'of', 'the', 'voigt', 'effectbased', 'microscope', 'was', 'tested', 'using', 'an', 'inplane', 'magnetized', 'ferromagnetic', 'semiconductor', 'gamnas', 'it', 'was', 'revealed', 'that', 'the', 'presence', 'of', 'mechanical', 'defects', 'in', 'the', 'gamnas', 'epilayer', 'alters', 'significantly', 'the', 'magnetic', 'anisotropy', 'in', 'their', 'proximity', 'the', 'importance', 'of', 'mo', 'experiments', 'with', 'simultaneous', 'temporal', 'and', 'spatial', 'resolutions', 'was', 'demonstrated', 'using', 'gamnas', 'sample', 'attached', 'to', 'a', 'piezoelectric', 'actuator', 'which', 'produces', 'a', 'voltagecontrolled', 'strain', 'we', 'observed', 'a', 'considerably', 'different', 'behavior', 'in', 'different', 'parts', 'of', 'the', 'sample', 'that', 'enabled', 'us', 'to', 'identify', 'sample', 'parts', 'where', 'the', 'epilayer', 'magnetic', 'anisotropy', 'was', 'significantly', 'modified', 'by', 'a', 'presence', 'of', 'the', 'piezostressor', 'and', 'where', 'it', 'was', 'not', 'finally', 'we', 'discuss', 'the', 'possible', 'applicability', 'of', 'our', 'experimental', 'setup', 'for', 'the', 'research', 'of', 'compensated', 'antiferromagnets', 'where', 'only', 'mo', 'effects', 'even', 'in', 'magnetic', 'moments', 'are', 'present']] | [-0.1144324069000071, 0.13384103684265505, -0.0240505081989492, -0.018496124731471008, -0.08477660024350155, -0.12182192558733125, 0.016546422405943822, 0.45000120249044684, -0.22738284912304066, -0.3371315268311827, -0.0034002178214168886, -0.27904460356859045, -0.11524681026293408, 0.23916731059684285, 0.015831511160026172, 0.01306793571157392, -0.011839914191070767, -0.09239995553867802, -0.057403471576219, -0.22511720839178279, 0.2516978712464195, 0.07294619464803309, 0.34361451784969266, 0.05382788428271722, 0.06470271803915412, 0.023187646506509434, 0.08400979330984965, 0.08741308959101193, -0.12463173926352326, 0.08642451792894419, 0.23201971701512644, -0.07497850119848624, 0.1989523525615888, -0.4753084965376339, -0.18612002045847476, -0.004870035699457817, 0.13111703691261245, 0.13880020803758053, -0.08390726671981004, -0.3078639778097914, 0.08126713700282077, -0.10780230851655472, -0.10964022797166503, -0.10198238352867997, -0.026655544094475254, 0.008910817580596943, -0.28060009141197606, 0.06515955729992129, 0.061229493089783885, 0.11910964392813012, -0.12228619833920329, -0.07437797252177483, -0.055812338482133954, 0.04719991426238613, 0.04048562529108798, 0.05144872931954784, 0.19433282765038756, -0.05648083009908164, -0.10800791321699285, 0.3322604256238611, -0.04756463289578235, -0.10230749120403614, 0.14650418334695997, -0.21744083550237564, -0.05482592273412073, 0.11143584982935517, 0.1458119485981851, 0.12595920241992212, -0.16327289983608007, 0.0629285053596721, 0.008878404482467366, 0.21885609503979572, 0.07073315977218694, 0.02323200349651632, 0.21515977650276563, 0.19820058313226105, -0.003325097781184706, 0.19014576793623356, -0.20208823664246925, 0.011215709054557096, -0.17952357969244032, -0.16729631105859188, -0.2073824688600975, 0.055116195702967594, -0.08206907666559952, -0.14298877266368695, 0.39872401577997063, 0.19550952516285525, 0.16765243369930735, -0.0898982148203123, 0.29585965105798095, 0.05380174085578238, 0.09734545658215038, -0.023165976632818847, 0.31509941326415475, 0.17994460279061014, 0.14994740356840858, -0.2896789559246307, 0.07797742045728401, -0.05355704275591831] |
1,802.10535 | Subsums of conditionally convergent series in finite dimensional spaces | An achievement set of a series is a set of all its subsums. We study the
properties of achievement sets of conditionally convergent series in finite
dimensional spaces. The purpose of the paper is to answer some of the open
problems formulated in \cite{GM}. We obtain general results for series with
harmonic-like coordinates, that is
$A((-1)^{n+1}n^{-\alpha_1},\dots,(-1)^{n+1}n^{-\alpha_d})=\mathbb{R}^d$ for
pairwise distinct numbers $\alpha_1,\dots,\alpha_d\in(0,1]$. For $d=2$,
$\alpha_1=1, \alpha_2=\frac{1}{2}$ it was stated as an open problem in
\cite{GM}, that is $A(\frac{(-1)^n}{n},\frac{(-1)^n}{\sqrt{n}})=\mathbb{R}^2$.
| math.FA | an achievement set of a series is a set of all its subsums we study the properties of achievement sets of conditionally convergent series in finite dimensional spaces the purpose of the paper is to answer some of the open problems formulated in citegm we obtain general results for series with harmoniclike coordinates that is a1n1nalpha_1dots1n1nalpha_dmathbbrd for pairwise distinct numbers alpha_1dotsalpha_din01 for d2 alpha_11 alpha_2frac12 it was stated as an open problem in citegm that is afrac1nnfrac1nsqrtnmathbbr2 | [['an', 'achievement', 'set', 'of', 'a', 'series', 'is', 'a', 'set', 'of', 'all', 'its', 'subsums', 'we', 'study', 'the', 'properties', 'of', 'achievement', 'sets', 'of', 'conditionally', 'convergent', 'series', 'in', 'finite', 'dimensional', 'spaces', 'the', 'purpose', 'of', 'the', 'paper', 'is', 'to', 'answer', 'some', 'of', 'the', 'open', 'problems', 'formulated', 'in', 'citegm', 'we', 'obtain', 'general', 'results', 'for', 'series', 'with', 'harmoniclike', 'coordinates', 'that', 'is', 'a1n1nalpha_1dots1n1nalpha_dmathbbrd', 'for', 'pairwise', 'distinct', 'numbers', 'alpha_1dotsalpha_din01', 'for', 'd2', 'alpha_11', 'alpha_2frac12', 'it', 'was', 'stated', 'as', 'an', 'open', 'problem', 'in', 'citegm', 'that', 'is', 'afrac1nnfrac1nsqrtnmathbbr2']] | [-0.14639677362491008, 0.061865842930274084, -0.061045792349295254, 0.04225022325209304, -0.03214378140496779, -0.0654076206089597, 0.0030617117654525815, 0.34899270759053425, -0.27561601628995924, -0.23120717218860168, 0.12203102731241602, -0.27210823209216334, -0.13260937311163504, 0.25333577394485474, -0.10848643401101844, 0.06432928761055898, 0.04846698942288042, 0.045000222243674816, -0.01909319379634849, -0.33376502101740174, 0.3549157857563194, -0.030558650573230768, 0.22231852564616256, 0.06155994845664269, 0.1105857557770222, -0.025246444896616246, 0.0056093126624720555, 0.05156169205342662, -0.12864151388212994, 0.136512870018447, 0.2946553476512024, 0.16783931221149556, 0.3260061947041995, -0.3391620252944835, -0.15076133767015312, 0.10084464218709076, 0.11895621611341221, 0.0734255729268675, -0.014982706592864778, -0.21203999886008568, 0.11442091281538548, -0.11662409267043822, -0.1617939419317225, -0.08499196771379203, 0.07531380268094474, -0.0007739841765787912, -0.3050517556321335, 0.024301912086977535, 0.08800899747708073, 0.0902814887821266, -0.09124732515232459, -0.09557401662060915, 0.09199517173692584, 0.14397964301066193, 0.03603174497919547, 0.041008321616211776, -0.02086943580469193, -0.07848870247885129, -0.14757792705236233, 0.3767817404172192, -0.04180108310578212, -0.2277179812910418, 0.16181489507578414, -0.13714656882842824, -0.1923908721272872, 0.07569471327587962, 0.12472658522733271, 0.1476663568452613, -0.14921248699091885, 0.13106139668914146, -0.13680657394842743, 0.11774799636922369, 0.09539155861082142, -0.0038004152800517844, 0.13863717135973275, 0.16105041531718348, 0.0859475249156662, 0.17307142344660648, 0.013908183948481328, -0.06017013426075932, -0.3297356520715642, -0.20500580572255261, -0.20512840868937082, 0.05194711765236132, -0.041844170629876117, -0.22088176313124291, 0.3792580075766126, 0.10837142146431701, 0.20577484538957272, 0.05978100032430805, 0.21366542705321964, 0.1262175833558415, -0.04404680115132503, 0.05611442791119422, 0.1263164907382093, 0.15386192639651772, 0.027358917659786465, -0.15264455647501227, 0.02034131796912558, 0.1196017822965163] |
1,802.10536 | Photonic glass for high contrast structural color | Non-iridescent structural colors based on disordered arrangement of
monodisperse spherical particles, also called photonic glass, show low color
saturation due to gradual transition in reflectivity. No significant
improvement is usually expected from particles optimization, as the Mie
resonances are broad for small dielectric particles with moderate refractive
index. Moreover, the short range order of a photonic glass alone is also
insufficient to cause sharp spectral features. We show here, that the
combination of a well-chosen particle geometry with the short range order of a
photonic glass has strong synergetic effects. We demonstrate how core-shell
particles can be used to obtain a sharp transition in the reflection spectrum
of photonic glass which is essential to achieve a strong color saturation. The
Fourier transform required for a highly saturated color can be achieved by
shifting the first zero position of the motif Fourier transform to smaller wave
numbers in respect to the peak of the lattice Fourier transform. We show that
this can be obtained by choosing a non-monotonous refractive index distribution
from the center of the particle through the shell and into the background
material. The first-order theoretical predictions are confirmed by numerical
simulations.
| physics.optics | noniridescent structural colors based on disordered arrangement of monodisperse spherical particles also called photonic glass show low color saturation due to gradual transition in reflectivity no significant improvement is usually expected from particles optimization as the mie resonances are broad for small dielectric particles with moderate refractive index moreover the short range order of a photonic glass alone is also insufficient to cause sharp spectral features we show here that the combination of a wellchosen particle geometry with the short range order of a photonic glass has strong synergetic effects we demonstrate how coreshell particles can be used to obtain a sharp transition in the reflection spectrum of photonic glass which is essential to achieve a strong color saturation the fourier transform required for a highly saturated color can be achieved by shifting the first zero position of the motif fourier transform to smaller wave numbers in respect to the peak of the lattice fourier transform we show that this can be obtained by choosing a nonmonotonous refractive index distribution from the center of the particle through the shell and into the background material the firstorder theoretical predictions are confirmed by numerical simulations | [['noniridescent', 'structural', 'colors', 'based', 'on', 'disordered', 'arrangement', 'of', 'monodisperse', 'spherical', 'particles', 'also', 'called', 'photonic', 'glass', 'show', 'low', 'color', 'saturation', 'due', 'to', 'gradual', 'transition', 'in', 'reflectivity', 'no', 'significant', 'improvement', 'is', 'usually', 'expected', 'from', 'particles', 'optimization', 'as', 'the', 'mie', 'resonances', 'are', 'broad', 'for', 'small', 'dielectric', 'particles', 'with', 'moderate', 'refractive', 'index', 'moreover', 'the', 'short', 'range', 'order', 'of', 'a', 'photonic', 'glass', 'alone', 'is', 'also', 'insufficient', 'to', 'cause', 'sharp', 'spectral', 'features', 'we', 'show', 'here', 'that', 'the', 'combination', 'of', 'a', 'wellchosen', 'particle', 'geometry', 'with', 'the', 'short', 'range', 'order', 'of', 'a', 'photonic', 'glass', 'has', 'strong', 'synergetic', 'effects', 'we', 'demonstrate', 'how', 'coreshell', 'particles', 'can', 'be', 'used', 'to', 'obtain', 'a', 'sharp', 'transition', 'in', 'the', 'reflection', 'spectrum', 'of', 'photonic', 'glass', 'which', 'is', 'essential', 'to', 'achieve', 'a', 'strong', 'color', 'saturation', 'the', 'fourier', 'transform', 'required', 'for', 'a', 'highly', 'saturated', 'color', 'can', 'be', 'achieved', 'by', 'shifting', 'the', 'first', 'zero', 'position', 'of', 'the', 'motif', 'fourier', 'transform', 'to', 'smaller', 'wave', 'numbers', 'in', 'respect', 'to', 'the', 'peak', 'of', 'the', 'lattice', 'fourier', 'transform', 'we', 'show', 'that', 'this', 'can', 'be', 'obtained', 'by', 'choosing', 'a', 'nonmonotonous', 'refractive', 'index', 'distribution', 'from', 'the', 'center', 'of', 'the', 'particle', 'through', 'the', 'shell', 'and', 'into', 'the', 'background', 'material', 'the', 'firstorder', 'theoretical', 'predictions', 'are', 'confirmed', 'by', 'numerical', 'simulations']] | [-0.06008548710351675, 0.20309067860582283, -0.12192433360249885, 0.038182772687573585, -0.07309911776227886, -0.11952921872900635, 0.009818644245961015, 0.4459962280264481, -0.250961802260458, -0.30143370714739515, 0.06632817298815696, -0.2694132466332437, -0.14906963156874006, 0.1511279248591474, -0.0464157807001955, 0.07235551729721108, 0.01383620662158693, -0.010715075727513571, -0.05976413010011567, -0.14932251068729657, 0.2552595379813019, 0.04009115614522963, 0.292618711539327, 0.08157788831837127, 0.05586817999336618, 0.030673665674934115, 0.03495489361990301, 0.04146230209696015, -0.1250220612612091, 0.0930526273740079, 0.22383542791240574, 0.003289681832774161, 0.21128154789469172, -0.42759897178666273, -0.21806647566357057, 0.08544555934715456, 0.15284400921733568, 0.10815972120107822, -0.09821233769379305, -0.2563912977972382, 0.09199291600910899, -0.12144426882648213, -0.1391203462512961, -0.0676207380255303, -0.0011394389137780112, 0.03896312400762336, -0.2635593825150185, 0.07235191955316783, 0.0630611775471911, 0.0442349797752903, -0.03346044704115375, -0.09007707618447165, -0.024171589137841537, 0.06603940256082313, 0.006942170150360874, -0.002087412276570661, 0.1585584065751438, -0.11962593628643708, -0.08506276574132993, 0.4130019939847175, -0.08609029718429975, -0.13405599777581934, 0.16486068787487523, -0.18960758359255897, -0.04100236014361672, 0.23301101502976887, 0.16360360543832297, 0.08077196607250392, -0.09653332410862794, 0.021249081887433866, -0.02272625703723809, 0.2501919583086928, 0.08696377694297949, 0.05364855076246678, 0.2107153402658305, 0.16454616072708306, 0.03643462021227135, 0.18829771499282202, -0.11474109596302588, -0.03651395977662944, -0.2744733366121205, -0.1445399309494026, -0.25278600047154287, 0.01902802882936525, -0.1581674571862472, -0.17966614802394526, 0.3819137360282976, 0.10951996025016503, 0.20189090595288695, 0.016944731091670304, 0.2620962929997564, 0.14772087058300934, 0.09091486554554244, 1.1359205122052697e-05, 0.27652194624564036, 0.1539816623589825, 0.09847437257883308, -0.22235389728427243, 0.024228326972680157, 0.028172028757670383] |
1,802.10537 | Thermal Conformal Blocks | We study conformal blocks for thermal one-point-functions on the sphere in
conformal field theories of general dimension. These thermal conformal blocks
satisfy second order Casimir differential equations and have integral
representations related to AdS Witten diagrams. We give an analytic formula for
the scalar conformal block in terms of generalized hypergeometric functions. As
an application, we deduce an asymptotic formula for the three-point coeffcients
of primary operators in the limit where two of the operators are heavy.
| hep-th | we study conformal blocks for thermal onepointfunctions on the sphere in conformal field theories of general dimension these thermal conformal blocks satisfy second order casimir differential equations and have integral representations related to ads witten diagrams we give an analytic formula for the scalar conformal block in terms of generalized hypergeometric functions as an application we deduce an asymptotic formula for the threepoint coeffcients of primary operators in the limit where two of the operators are heavy | [['we', 'study', 'conformal', 'blocks', 'for', 'thermal', 'onepointfunctions', 'on', 'the', 'sphere', 'in', 'conformal', 'field', 'theories', 'of', 'general', 'dimension', 'these', 'thermal', 'conformal', 'blocks', 'satisfy', 'second', 'order', 'casimir', 'differential', 'equations', 'and', 'have', 'integral', 'representations', 'related', 'to', 'ads', 'witten', 'diagrams', 'we', 'give', 'an', 'analytic', 'formula', 'for', 'the', 'scalar', 'conformal', 'block', 'in', 'terms', 'of', 'generalized', 'hypergeometric', 'functions', 'as', 'an', 'application', 'we', 'deduce', 'an', 'asymptotic', 'formula', 'for', 'the', 'threepoint', 'coeffcients', 'of', 'primary', 'operators', 'in', 'the', 'limit', 'where', 'two', 'of', 'the', 'operators', 'are', 'heavy']] | [-0.15387342170518087, 0.10582816677905564, -0.08154944266731802, 0.09373360004668173, -0.09494161415587817, -0.09825085993169953, -0.08316270608798061, 0.2812591087881868, -0.1934138271271398, -0.19534809141125725, 0.1096403575578925, -0.3103741671228291, -0.18866732741068853, 0.1950418693503659, -0.02520809831759451, 0.08752006544780574, -0.04900960629119685, 0.09545489004200422, -0.1429691346558301, -0.2609747776541075, 0.4086900011660825, -0.02610145187722274, 0.2327774810898853, 0.08118672003528397, 0.10281711015360136, 0.050172426327327754, -0.030111570640369074, -0.05084333257553609, -0.17935180746165938, 0.12035238283294204, 0.25939182477611067, 0.02316790805994778, 0.13401738437517596, -0.46985946924082544, -0.15222073035731323, 0.0991703212065132, 0.17128934441624502, 0.07031291162619661, 0.01665620307559086, -0.23317417355352327, 0.0706393129412869, -0.17745368910561266, -0.20435237060576728, -0.12586359914980436, -0.008180989906816793, -0.03740509371824661, -0.28152079034694716, 0.07022306153023812, 0.05119628912622207, 0.07388880222692694, -0.09315189346671104, -0.10822806365046601, 0.003723003239812035, 0.12602006146335043, 0.08699072497639511, -0.014251850340147748, 0.1117950381992973, -0.16999381653180248, -0.11718374481087697, 0.29833007224614877, -0.09774470654788035, -0.27747167792710425, 0.08669455183400332, -0.14261038720264638, -0.1813806665901977, 0.031035693258194153, 0.15423917770385742, 0.18462256751464387, -0.1738488469272852, 0.19409739813004548, -0.04004866719294928, 0.04835377048890989, 0.13597707354194044, 0.0465527845548135, 0.20982726885459238, 0.0015236443570373875, 0.04897055103547724, 0.22150399442762136, 0.05313546508611915, -0.11251739218929097, -0.42945002828185497, -0.24460368190499904, -0.14293994704827415, 0.0917930619785023, -0.2347994418935406, -0.23705241463980392, 0.3715522891204608, 0.0882528104634012, 0.14764852388141567, 0.12315620424372978, 0.2072542223000997, 0.24558267574359074, 0.12116159576506011, 0.039288266457764336, 0.18937352097495214, 0.2387802768498659, 0.08438790720691414, -0.1963126226730406, -0.1018199783376124, 0.258053958759104] |
1,802.10538 | Multiple stellar populations in Magellanic Cloud clusters. VI. A survey
of multiple sequences and Be stars in young clusters | The split main sequences (MSs) and extended MS turnoffs (eMSTOs) detected in
a few young clusters have demonstrated that these stellar systems host multiple
populations differing in a number of properties such as rotation and, possibly,
age.We analyze Hubble Space Telescope photometry for thirteen clusters with
ages between ~40 and ~1000 Myrs and of different masses. Our goal is to
investigate for the first time the occurrence of multiple populations in a
large sample of young clusters. We find that all the clusters exhibit the eMSTO
phenomenon and that MS stars more massive than ~1.6 solar masses define a blue
and red MS, with the latter hosting the majority of MS stars. The comparison
between the observations and isochrones suggests that the blue MSs are made of
slow-rotating stars, while the red MSs host stars with rotational velocities
close to the breakup value. About half of the bright MS stars in the youngest
clusters are H-alpha emitters. These Be stars populate the red MS and the
reddest part of the eMSTO thus supporting the idea that the red MS is made of
fast rotators. We conclude that the split MS and the eMSTO are a common feature
of young clusters in both Magellanic Clouds. The phenomena of a split MS and an
eMSTO occur for stars that are more massive than a specific threshold which is
independent of the host-cluster mass. As a by-product, we report the
serendipitous discovery of a young SMC cluster, GALFOR1.
| astro-ph.SR astro-ph.GA | the split main sequences mss and extended ms turnoffs emstos detected in a few young clusters have demonstrated that these stellar systems host multiple populations differing in a number of properties such as rotation and possibly agewe analyze hubble space telescope photometry for thirteen clusters with ages between 40 and 1000 myrs and of different masses our goal is to investigate for the first time the occurrence of multiple populations in a large sample of young clusters we find that all the clusters exhibit the emsto phenomenon and that ms stars more massive than 16 solar masses define a blue and red ms with the latter hosting the majority of ms stars the comparison between the observations and isochrones suggests that the blue mss are made of slowrotating stars while the red mss host stars with rotational velocities close to the breakup value about half of the bright ms stars in the youngest clusters are halpha emitters these be stars populate the red ms and the reddest part of the emsto thus supporting the idea that the red ms is made of fast rotators we conclude that the split ms and the emsto are a common feature of young clusters in both magellanic clouds the phenomena of a split ms and an emsto occur for stars that are more massive than a specific threshold which is independent of the hostcluster mass as a byproduct we report the serendipitous discovery of a young smc cluster galfor1 | [['the', 'split', 'main', 'sequences', 'mss', 'and', 'extended', 'ms', 'turnoffs', 'emstos', 'detected', 'in', 'a', 'few', 'young', 'clusters', 'have', 'demonstrated', 'that', 'these', 'stellar', 'systems', 'host', 'multiple', 'populations', 'differing', 'in', 'a', 'number', 'of', 'properties', 'such', 'as', 'rotation', 'and', 'possibly', 'agewe', 'analyze', 'hubble', 'space', 'telescope', 'photometry', 'for', 'thirteen', 'clusters', 'with', 'ages', 'between', '40', 'and', '1000', 'myrs', 'and', 'of', 'different', 'masses', 'our', 'goal', 'is', 'to', 'investigate', 'for', 'the', 'first', 'time', 'the', 'occurrence', 'of', 'multiple', 'populations', 'in', 'a', 'large', 'sample', 'of', 'young', 'clusters', 'we', 'find', 'that', 'all', 'the', 'clusters', 'exhibit', 'the', 'emsto', 'phenomenon', 'and', 'that', 'ms', 'stars', 'more', 'massive', 'than', '16', 'solar', 'masses', 'define', 'a', 'blue', 'and', 'red', 'ms', 'with', 'the', 'latter', 'hosting', 'the', 'majority', 'of', 'ms', 'stars', 'the', 'comparison', 'between', 'the', 'observations', 'and', 'isochrones', 'suggests', 'that', 'the', 'blue', 'mss', 'are', 'made', 'of', 'slowrotating', 'stars', 'while', 'the', 'red', 'mss', 'host', 'stars', 'with', 'rotational', 'velocities', 'close', 'to', 'the', 'breakup', 'value', 'about', 'half', 'of', 'the', 'bright', 'ms', 'stars', 'in', 'the', 'youngest', 'clusters', 'are', 'halpha', 'emitters', 'these', 'be', 'stars', 'populate', 'the', 'red', 'ms', 'and', 'the', 'reddest', 'part', 'of', 'the', 'emsto', 'thus', 'supporting', 'the', 'idea', 'that', 'the', 'red', 'ms', 'is', 'made', 'of', 'fast', 'rotators', 'we', 'conclude', 'that', 'the', 'split', 'ms', 'and', 'the', 'emsto', 'are', 'a', 'common', 'feature', 'of', 'young', 'clusters', 'in', 'both', 'magellanic', 'clouds', 'the', 'phenomena', 'of', 'a', 'split', 'ms', 'and', 'an', 'emsto', 'occur', 'for', 'stars', 'that', 'are', 'more', 'massive', 'than', 'a', 'specific', 'threshold', 'which', 'is', 'independent', 'of', 'the', 'hostcluster', 'mass', 'as', 'a', 'byproduct', 'we', 'report', 'the', 'serendipitous', 'discovery', 'of', 'a', 'young', 'smc', 'cluster', 'galfor1']] | [-0.09450006323062222, 0.18130788352098248, -0.08032271273343723, 0.11566673703325724, -0.09874877818544542, -0.032113266948606695, 0.11492112694185011, 0.4291928216992023, -0.13553238182120825, -0.38451838290919205, 0.04703646705649198, -0.2559969807390031, -0.04284289515431016, 0.2083933770633495, -0.06335857243100104, -0.10295164697487985, 0.15221170634262202, -0.016093087028558096, -0.011867062239676776, -0.30504801206306115, 0.3030385325378007, -0.04338967758805726, 0.14572324545492132, -0.11456719367603256, 0.040309182541398716, -0.136798901815104, -0.035688750958647424, -0.0518527010857168, -0.09453795996141857, 0.05132270958572857, 0.22009319415670042, 0.12758039603750523, 0.27519341784121454, -0.3118339564172541, -0.1642704950356933, 0.06710458067361234, 0.25097656101402094, 0.04039267628320901, -0.10142578769723927, -0.2958771053447642, 0.1387804895259386, -0.14708698183213445, -0.20776883487912925, 0.095576206741716, 0.06972738221207872, 0.07193093697616469, -0.19050906013340443, 0.13794982230963285, 0.01477137017679547, 0.09168080634953192, -0.10664380947127938, -0.1641940241852729, -0.055511382113553366, 0.13684207217263689, 0.013500182755668609, 0.03579371555300414, 0.10482207759358528, -0.11734783840134802, -0.030536550106788594, 0.39072056978648484, -0.0391057688991341, 0.020968480356345975, 0.2605207416311692, -0.18683123897591775, -0.18723529676929856, 0.11135078731670299, 0.130566865286582, 0.175571802500366, -0.17925575424432139, -0.06123145031482982, -0.01760904301412034, 0.21434265484865986, 0.07336170662748666, 0.0858543852559668, 0.32016809455557793, 0.15513372880864643, 0.013846860941661106, 0.10477402197699301, -0.24834042786974614, -0.10088709985918158, -0.19089810541409552, -0.1272852219932728, -0.10049179374973467, 0.03030256486992344, -0.15211675556755166, -0.14916248811593602, 0.3279511518410815, 0.09774483663463159, 0.23503300803136234, 0.07810110958150689, 0.2877146665820821, 0.07027981393491418, 0.18182411168034243, 0.1235923901746773, 0.26574678335354224, 0.21302455027918676, 0.05682714016095943, -0.24271705310237557, 0.027081214657345833, -0.04915428115584126] |
1,802.10539 | From synchronous to one-time delayed dynamics in coupled maps | We study the completely synchronized states (CSSs) of a system of coupled
logistic maps as a function of three parameters: interaction strength
($\varepsilon$), range of the interaction ($\alpha$), that can vary from
first-neighbors to global coupling, and a parameter ($\beta$) that allows to
scan continuously from non-delayed to one-time delayed dynamics. % We identify
in the plane $\alpha$-$\varepsilon$ periodic orbits, limit cycles and chaotic
trajectories, and describe how these structures change with the delay. These
features can be explained by studying the bifurcation diagrams of a
two-dimensional non-delayed map. This allows us to understand the effects of
one-time delays on CSSs, e.g, regularization of chaotic orbits and
synchronization of short-range coupled maps, observed when the dynamics is
moderately delayed. Finally, we substitute the logistic map by cubic and
logarithmic maps, in order to test the robustness of our findings.
| nlin.CD | we study the completely synchronized states csss of a system of coupled logistic maps as a function of three parameters interaction strength varepsilon range of the interaction alpha that can vary from firstneighbors to global coupling and a parameter beta that allows to scan continuously from nondelayed to onetime delayed dynamics we identify in the plane alphavarepsilon periodic orbits limit cycles and chaotic trajectories and describe how these structures change with the delay these features can be explained by studying the bifurcation diagrams of a twodimensional nondelayed map this allows us to understand the effects of onetime delays on csss eg regularization of chaotic orbits and synchronization of shortrange coupled maps observed when the dynamics is moderately delayed finally we substitute the logistic map by cubic and logarithmic maps in order to test the robustness of our findings | [['we', 'study', 'the', 'completely', 'synchronized', 'states', 'csss', 'of', 'a', 'system', 'of', 'coupled', 'logistic', 'maps', 'as', 'a', 'function', 'of', 'three', 'parameters', 'interaction', 'strength', 'varepsilon', 'range', 'of', 'the', 'interaction', 'alpha', 'that', 'can', 'vary', 'from', 'firstneighbors', 'to', 'global', 'coupling', 'and', 'a', 'parameter', 'beta', 'that', 'allows', 'to', 'scan', 'continuously', 'from', 'nondelayed', 'to', 'onetime', 'delayed', 'dynamics', 'we', 'identify', 'in', 'the', 'plane', 'alphavarepsilon', 'periodic', 'orbits', 'limit', 'cycles', 'and', 'chaotic', 'trajectories', 'and', 'describe', 'how', 'these', 'structures', 'change', 'with', 'the', 'delay', 'these', 'features', 'can', 'be', 'explained', 'by', 'studying', 'the', 'bifurcation', 'diagrams', 'of', 'a', 'twodimensional', 'nondelayed', 'map', 'this', 'allows', 'us', 'to', 'understand', 'the', 'effects', 'of', 'onetime', 'delays', 'on', 'csss', 'eg', 'regularization', 'of', 'chaotic', 'orbits', 'and', 'synchronization', 'of', 'shortrange', 'coupled', 'maps', 'observed', 'when', 'the', 'dynamics', 'is', 'moderately', 'delayed', 'finally', 'we', 'substitute', 'the', 'logistic', 'map', 'by', 'cubic', 'and', 'logarithmic', 'maps', 'in', 'order', 'to', 'test', 'the', 'robustness', 'of', 'our', 'findings']] | [-0.1716446381281404, 0.12608163944199025, -0.09483379297136493, 0.07064642222351669, -0.03237702166798579, -0.16737107360078132, 0.07131367735500509, 0.34485650709693266, -0.3149833957226399, -0.2892091703628573, 0.0872266756127561, -0.26959818716333006, -0.18856135813300223, 0.19334854014382205, -0.03383660873035243, 0.048321971450658405, 0.04528340841095675, -0.002022372041691971, -0.0665020832367351, -0.2145035680518691, 0.32892700869535263, 0.04127857697826317, 0.188548702527495, -0.03061745104873005, 0.08444890388808049, -0.01640138104523751, 0.007633421638542239, 0.02806787592571174, -0.14043017100811994, 0.0633891022482524, 0.20048321365902666, 0.0664568384826827, 0.23563296863507918, -0.403561305391657, -0.23610606992973343, 0.12194027898230535, 0.15845339417469137, 0.10442146297325106, 0.006805143489413347, -0.300894331327393, 0.036869050770559735, -0.14599372543432979, -0.1569685606724199, -0.09906882792711258, 0.011057994461974458, 0.08922676665593719, -0.2908294912588591, 0.06809055256684694, 0.05569559812669039, 0.02572496738182107, -0.05490002953464521, 0.017269115805153407, -0.07450092869283467, 0.16993649020343368, 0.020038891516913494, 0.020675169541979867, 0.13954638639423886, -0.11939062410451964, -0.0999149152998785, 0.3544182309278232, -0.10430438247931306, -0.19482576516833539, 0.22586941770500477, -0.16486616718226715, -0.10478449166368912, 0.1526991466525942, 0.2094517058747656, 0.07774288462721468, -0.14293668853679264, 0.04076287606585538, 0.010366513866328579, 0.2146329837577308, 0.060371970427427986, -0.0027211920935181245, 0.17384409627822392, 0.1371620266325087, 0.06470588079708464, 0.15583018554282127, -0.09986557083432084, -0.14106779290801463, -0.25872545690714, -0.08283633365542353, -0.1061241717706092, 0.038987543286673504, -0.11637786518633006, -0.1606722207746797, 0.44698996884364856, 0.15959183936801685, 0.23108722216185176, 0.03394194844569189, 0.2485786736908588, 0.11646724545383169, 0.048120273708584994, 0.017853293889750016, 0.25176808810690143, 0.12069395843633067, 0.06475668014386696, -0.2426500625357114, 0.053450976352905855, 0.04902810135664528] |
1,802.1054 | Thresholds of Braided Convolutional Codes on the AWGN Channel | In this paper, we perform a threshold analysis of braided convolutional codes
(BCCs) on the additive white Gaussian noise (AWGN) channel. The decoding
thresholds are estimated by Monte-Carlo density evolution (MC-DE) techniques
and compared with approximate thresholds from an erasure channel prediction.
The results show that, with spatial coupling, the predicted thresholds are very
accurate and quickly approach capacity if the coupling memory is increased. For
uncoupled ensembles with random puncturing, the prediction can be improved with
help of the AWGN threshold of the unpunctured ensemble.
| cs.IT math.IT | in this paper we perform a threshold analysis of braided convolutional codes bccs on the additive white gaussian noise awgn channel the decoding thresholds are estimated by montecarlo density evolution mcde techniques and compared with approximate thresholds from an erasure channel prediction the results show that with spatial coupling the predicted thresholds are very accurate and quickly approach capacity if the coupling memory is increased for uncoupled ensembles with random puncturing the prediction can be improved with help of the awgn threshold of the unpunctured ensemble | [['in', 'this', 'paper', 'we', 'perform', 'a', 'threshold', 'analysis', 'of', 'braided', 'convolutional', 'codes', 'bccs', 'on', 'the', 'additive', 'white', 'gaussian', 'noise', 'awgn', 'channel', 'the', 'decoding', 'thresholds', 'are', 'estimated', 'by', 'montecarlo', 'density', 'evolution', 'mcde', 'techniques', 'and', 'compared', 'with', 'approximate', 'thresholds', 'from', 'an', 'erasure', 'channel', 'prediction', 'the', 'results', 'show', 'that', 'with', 'spatial', 'coupling', 'the', 'predicted', 'thresholds', 'are', 'very', 'accurate', 'and', 'quickly', 'approach', 'capacity', 'if', 'the', 'coupling', 'memory', 'is', 'increased', 'for', 'uncoupled', 'ensembles', 'with', 'random', 'puncturing', 'the', 'prediction', 'can', 'be', 'improved', 'with', 'help', 'of', 'the', 'awgn', 'threshold', 'of', 'the', 'unpunctured', 'ensemble']] | [-0.12736159471015251, 0.13206145473431694, -0.08022582531516809, 0.08837274585980488, 0.0318299921792607, -0.24653055121970557, 0.0987620503536079, 0.4242381135564904, -0.2620008913691827, -0.28859045805929356, 0.11174488965243232, -0.2567130624923075, -0.18473649130278635, 0.14231362672817763, -0.08400446355212914, 0.1284777775310727, 0.14595193198210624, 0.08442614000591146, -0.10348956741468418, -0.28987171082909025, 0.3145275086511013, 0.19758318431762067, 0.3065131788174513, -0.00983532466709094, 0.034683652418438175, -0.01800819843747588, -0.035429367822659916, -0.05209308472694829, -0.13600772225914246, 0.06354024211962729, 0.25641812984073575, 0.08281311999632825, 0.20380674350227035, -0.373713958542794, -0.3001397521300025, 0.07095136107920214, 0.1583982696567207, 0.13466525739492025, -0.03330467391872865, -0.30020496247033046, 0.1356520754458426, -0.2160014848787944, -0.008986967978565845, -0.04451969702359895, -0.07672689603858215, 0.04712203099002499, -0.3667225741109876, 0.07601271802559495, 0.06383102580493447, 0.017262678376810496, -0.0141558863417527, -0.1599277095100301, 0.03645803227067687, 0.12238627909899277, -0.02450878493390371, 0.034506351339121805, 0.13271044542319899, -0.13106852177216477, -0.12807693994647368, 0.27401993291108695, -0.10735477378245356, -0.2302829292291494, 0.1253989364878751, -0.057598182568759766, -0.046439508338956985, 0.2042492291305301, 0.21160491076189764, 0.040648195843840405, -0.12416229620142731, 0.04734926665239686, 0.016540534105314333, 0.17160356625221496, 0.07504040815022796, 0.06283060084963434, 0.14828341375213377, 0.1804090165424832, -0.004918837107631357, 0.1602926009840895, -0.15329801209736615, -0.13094907584816737, -0.22793508328627363, -0.04556018984615992, -0.166998197080914, 0.05137320953220952, -0.14884970170211556, -0.13623132142996372, 0.3255066217131761, 0.18597079786948514, 0.18055744785382305, 0.17256145013582913, 0.3203528575046898, 0.12136744461996957, 0.04064280141231626, 0.14876886457746286, 0.2055695061490676, 0.2176241607345684, -0.0017423240175514028, -0.20577419934886357, 0.07081742175898059, 0.022420668747102798] |
1,802.10541 | Conductance signatures of odd-frequency superconductivity in quantum
spin Hall systems using a quantum point contact | Topological superconductors give rise to unconventional superconductivity,
which is mainly characterized by the symmetry of the superconducting pairing
amplitude. However, since the symmetry of the superconducting pairing amplitude
is not directly observable, its experimental identification is rather
difficult. In our work, we propose a system, composed of a quantum point
contact and proximity induced s-wave superconductivity at the helical edge of a
two dimensional topological insulator, for which we demonstrate the presence of
odd-frequency pairing and its intimate connection to unambiguous transport
signatures. Notably, our proposal requires no time-reversal symmetry breaking
terms. We discover the domination of crossed Andreev reflection over electron
cotunneling in a wide range of parameter space, which is a quite unusual
transport regime.
| cond-mat.supr-con | topological superconductors give rise to unconventional superconductivity which is mainly characterized by the symmetry of the superconducting pairing amplitude however since the symmetry of the superconducting pairing amplitude is not directly observable its experimental identification is rather difficult in our work we propose a system composed of a quantum point contact and proximity induced swave superconductivity at the helical edge of a two dimensional topological insulator for which we demonstrate the presence of oddfrequency pairing and its intimate connection to unambiguous transport signatures notably our proposal requires no timereversal symmetry breaking terms we discover the domination of crossed andreev reflection over electron cotunneling in a wide range of parameter space which is a quite unusual transport regime | [['topological', 'superconductors', 'give', 'rise', 'to', 'unconventional', 'superconductivity', 'which', 'is', 'mainly', 'characterized', 'by', 'the', 'symmetry', 'of', 'the', 'superconducting', 'pairing', 'amplitude', 'however', 'since', 'the', 'symmetry', 'of', 'the', 'superconducting', 'pairing', 'amplitude', 'is', 'not', 'directly', 'observable', 'its', 'experimental', 'identification', 'is', 'rather', 'difficult', 'in', 'our', 'work', 'we', 'propose', 'a', 'system', 'composed', 'of', 'a', 'quantum', 'point', 'contact', 'and', 'proximity', 'induced', 'swave', 'superconductivity', 'at', 'the', 'helical', 'edge', 'of', 'a', 'two', 'dimensional', 'topological', 'insulator', 'for', 'which', 'we', 'demonstrate', 'the', 'presence', 'of', 'oddfrequency', 'pairing', 'and', 'its', 'intimate', 'connection', 'to', 'unambiguous', 'transport', 'signatures', 'notably', 'our', 'proposal', 'requires', 'no', 'timereversal', 'symmetry', 'breaking', 'terms', 'we', 'discover', 'the', 'domination', 'of', 'crossed', 'andreev', 'reflection', 'over', 'electron', 'cotunneling', 'in', 'a', 'wide', 'range', 'of', 'parameter', 'space', 'which', 'is', 'a', 'quite', 'unusual', 'transport', 'regime']] | [-0.283270044112976, 0.2232793097296714, -0.09400290405600627, 0.07111385374919026, -0.13071331740794784, -0.18743684042929712, 0.09737946850876524, 0.3341452663079796, -0.24409116262522262, -0.27530350357803524, -0.01343495345228694, -0.2680685298724307, -0.1597808236375642, 0.15672333707284725, 0.02723387397555077, 0.02287956218048134, -0.04796513448604661, -0.00848897048431393, -0.14061648137151048, -0.21143505384779385, 0.3772828960035028, -0.021718675822903138, 0.34849331388249993, 0.10749775958725084, 0.03116674655968817, 0.021560249195442114, 0.09624946606942476, 0.0033755805977703766, -0.11850060378479907, 0.07300584417525043, 0.30286003433916175, -0.08691067942696759, 0.13294161560061651, -0.40946543293121535, -0.22259034678383738, 0.06316853917211804, 0.14185519467862165, 0.12472941642169419, -0.061316729976962775, -0.32957564073049617, 0.03962733284828977, -0.2075516015338974, -0.10888379118126681, -0.10079784594221503, 0.0037130799311666917, -0.11343044738492204, -0.23256962137838078, 0.08319251272731866, 0.09849043379629302, 0.08147747427002232, -0.020658789248341042, -0.021557687959856648, -0.05648154278214161, 0.012327281268647848, 0.058429379847983264, 0.019628871611367244, 0.10162125725565781, -0.15967127153308888, -0.13013957684429792, 0.3483753822202611, 0.014526784103602553, -0.07855554362838595, 0.20739613774702206, -0.12435437155823804, -0.07690480540896583, 0.1699876810193189, 0.06738252724863143, 0.053675610836770415, -0.10258986447484066, 0.09565808120060267, -0.058692227658998765, 0.14316597052488644, 0.02618286022359235, 0.13415840400569937, 0.2731926366686821, 0.20699689619672987, 0.09559024366725268, 0.13467640089046243, -0.11921440844989231, -0.07053860401113828, -0.3349063573484747, -0.16910562977099267, -0.23259302590074193, 0.07149531483527324, 0.003416593606199703, -0.21216412062326875, 0.42876854172557527, 0.16240042620925552, 0.21305516178313738, -0.0830569153971986, 0.24633964627551344, 0.12980192586676115, 0.06777519106259967, 0.026292887876510747, 0.23195955764629647, 0.17702722893311426, 0.07522095052792062, -0.3421682668451825, 0.09775744495181064, 0.028017517521531664] |
1,802.10542 | Memory-based Parameter Adaptation | Deep neural networks have excelled on a wide range of problems, from vision
to language and game playing. Neural networks very gradually incorporate
information into weights as they process data, requiring very low learning
rates. If the training distribution shifts, the network is slow to adapt, and
when it does adapt, it typically performs badly on the training distribution
before the shift. Our method, Memory-based Parameter Adaptation, stores
examples in memory and then uses a context-based lookup to directly modify the
weights of a neural network. Much higher learning rates can be used for this
local adaptation, reneging the need for many iterations over similar data
before good predictions can be made. As our method is memory-based, it
alleviates several shortcomings of neural networks, such as catastrophic
forgetting, fast, stable acquisition of new knowledge, learning with an
imbalanced class labels, and fast learning during evaluation. We demonstrate
this on a range of supervised tasks: large-scale image classification and
language modelling.
| stat.ML cs.LG | deep neural networks have excelled on a wide range of problems from vision to language and game playing neural networks very gradually incorporate information into weights as they process data requiring very low learning rates if the training distribution shifts the network is slow to adapt and when it does adapt it typically performs badly on the training distribution before the shift our method memorybased parameter adaptation stores examples in memory and then uses a contextbased lookup to directly modify the weights of a neural network much higher learning rates can be used for this local adaptation reneging the need for many iterations over similar data before good predictions can be made as our method is memorybased it alleviates several shortcomings of neural networks such as catastrophic forgetting fast stable acquisition of new knowledge learning with an imbalanced class labels and fast learning during evaluation we demonstrate this on a range of supervised tasks largescale image classification and language modelling | [['deep', 'neural', 'networks', 'have', 'excelled', 'on', 'a', 'wide', 'range', 'of', 'problems', 'from', 'vision', 'to', 'language', 'and', 'game', 'playing', 'neural', 'networks', 'very', 'gradually', 'incorporate', 'information', 'into', 'weights', 'as', 'they', 'process', 'data', 'requiring', 'very', 'low', 'learning', 'rates', 'if', 'the', 'training', 'distribution', 'shifts', 'the', 'network', 'is', 'slow', 'to', 'adapt', 'and', 'when', 'it', 'does', 'adapt', 'it', 'typically', 'performs', 'badly', 'on', 'the', 'training', 'distribution', 'before', 'the', 'shift', 'our', 'method', 'memorybased', 'parameter', 'adaptation', 'stores', 'examples', 'in', 'memory', 'and', 'then', 'uses', 'a', 'contextbased', 'lookup', 'to', 'directly', 'modify', 'the', 'weights', 'of', 'a', 'neural', 'network', 'much', 'higher', 'learning', 'rates', 'can', 'be', 'used', 'for', 'this', 'local', 'adaptation', 'reneging', 'the', 'need', 'for', 'many', 'iterations', 'over', 'similar', 'data', 'before', 'good', 'predictions', 'can', 'be', 'made', 'as', 'our', 'method', 'is', 'memorybased', 'it', 'alleviates', 'several', 'shortcomings', 'of', 'neural', 'networks', 'such', 'as', 'catastrophic', 'forgetting', 'fast', 'stable', 'acquisition', 'of', 'new', 'knowledge', 'learning', 'with', 'an', 'imbalanced', 'class', 'labels', 'and', 'fast', 'learning', 'during', 'evaluation', 'we', 'demonstrate', 'this', 'on', 'a', 'range', 'of', 'supervised', 'tasks', 'largescale', 'image', 'classification', 'and', 'language', 'modelling']] | [-0.01313514689099975, 0.056906797010105946, -0.05670744303497486, 0.10068899603562613, -0.14077620618842274, -0.20126853861147537, 0.05998979778669309, 0.4732552731409669, -0.3220282960945042, -0.339125199400587, 0.09580917104394757, -0.21166083609095948, -0.18968317068211035, 0.2177078851920669, -0.16313961984415074, 0.08783506942272652, 0.17578271160600706, 0.051177602721145375, -0.06878398919434403, -0.2941939660173375, 0.29337368631386196, 0.06803457112237084, 0.34129944066517054, -0.005506364205211866, 0.12472182301244175, -0.02228571431041928, -0.003904519136995077, -0.03797330280503956, -0.024260121324914508, 0.119716539158253, 0.32661158408445773, 0.22646845973504243, 0.379265491431579, -0.4214502553106286, -0.2685693446022924, 0.14452593060850633, 0.1734804575506132, 0.14648177867929918, -0.016978538694820598, -0.31354566010122653, 0.10505568283842877, -0.19705195164860925, 0.0418555706681218, -0.19070876203768422, -0.014875900256447494, 0.024783416185800888, -0.3014556515045115, -0.0050673263554926965, 0.09207622679132328, 0.04852799556192622, -0.025166406834614463, -0.10113043081219075, 0.030207983098807744, 0.16488024267109722, 0.03435212208696612, 0.07184115543350345, 0.16625337131263224, -0.19533100556000135, -0.10473363377532223, 0.328359117929358, -0.04491139139427105, -0.19592155521531823, 0.2116250003768073, 0.012230827956227586, -0.17030784209782723, 0.11737418523407542, 0.25272632511914705, 0.11019914719217923, -0.13418384971346314, -0.0016090231425550882, 0.006362953924690373, 0.18942903894349, 0.04917685559485108, -0.013009237527148798, 0.15859719923464582, 0.2665453159817389, 0.046214660426994666, 0.09388587810535683, -0.11265298806974897, -0.09964847520750482, -0.19230530553031713, -0.06817196593692643, -0.21859569791704417, -0.007138744978874456, -0.12728583000962318, -0.15702365883480524, 0.37321612125379033, 0.19844993834849448, 0.2536728456179844, 0.14281940900109474, 0.33991607651114464, 0.048757309040956896, 0.181536229030462, 0.11927422484150156, 0.15429738969833123, 0.04225114410801325, 0.20038387928216253, -0.1528627339648665, 0.1263120685238391, 0.02037790619287989] |
1,802.10543 | A Frequent Itemset Hiding Toolbox | Advances in data collection and data storage technologies have given way to
the establishment of transactional databases among companies and organizations,
as they allow enormous amounts of data to be stored efficiently. Useful
knowledge can be mined from these data, which can be used in several ways
depending on the nature of the data. Quite often companies and organizations
are willing to share data for the sake of mutual benefit. However, the sharing
of such data comes with risks, as problems with privacy may arise. Sensitive
data, along with sensitive knowledge inferred from this data, must be protected
from unintentional exposure to unauthorized parties. One form of the inferred
knowledge is frequent patterns mined in the form of frequent itemsets from
transactional databases. The problem of protecting such patterns is known as
the frequent itemset hiding problem.
In this paper we present a toolbox, which provides several implementations of
frequent itemset hiding algorithms. Firstly, we summarize the most important
aspects of each algorithm. We then introduce the architecture of the toolbox
and its novel features. Finally, we provide experimental results on real world
datasets, demonstrating the efficiency of the toolbox and the convenience it
offers in comparing different algorithms.
| cs.CR cs.DB | advances in data collection and data storage technologies have given way to the establishment of transactional databases among companies and organizations as they allow enormous amounts of data to be stored efficiently useful knowledge can be mined from these data which can be used in several ways depending on the nature of the data quite often companies and organizations are willing to share data for the sake of mutual benefit however the sharing of such data comes with risks as problems with privacy may arise sensitive data along with sensitive knowledge inferred from this data must be protected from unintentional exposure to unauthorized parties one form of the inferred knowledge is frequent patterns mined in the form of frequent itemsets from transactional databases the problem of protecting such patterns is known as the frequent itemset hiding problem in this paper we present a toolbox which provides several implementations of frequent itemset hiding algorithms firstly we summarize the most important aspects of each algorithm we then introduce the architecture of the toolbox and its novel features finally we provide experimental results on real world datasets demonstrating the efficiency of the toolbox and the convenience it offers in comparing different algorithms | [['advances', 'in', 'data', 'collection', 'and', 'data', 'storage', 'technologies', 'have', 'given', 'way', 'to', 'the', 'establishment', 'of', 'transactional', 'databases', 'among', 'companies', 'and', 'organizations', 'as', 'they', 'allow', 'enormous', 'amounts', 'of', 'data', 'to', 'be', 'stored', 'efficiently', 'useful', 'knowledge', 'can', 'be', 'mined', 'from', 'these', 'data', 'which', 'can', 'be', 'used', 'in', 'several', 'ways', 'depending', 'on', 'the', 'nature', 'of', 'the', 'data', 'quite', 'often', 'companies', 'and', 'organizations', 'are', 'willing', 'to', 'share', 'data', 'for', 'the', 'sake', 'of', 'mutual', 'benefit', 'however', 'the', 'sharing', 'of', 'such', 'data', 'comes', 'with', 'risks', 'as', 'problems', 'with', 'privacy', 'may', 'arise', 'sensitive', 'data', 'along', 'with', 'sensitive', 'knowledge', 'inferred', 'from', 'this', 'data', 'must', 'be', 'protected', 'from', 'unintentional', 'exposure', 'to', 'unauthorized', 'parties', 'one', 'form', 'of', 'the', 'inferred', 'knowledge', 'is', 'frequent', 'patterns', 'mined', 'in', 'the', 'form', 'of', 'frequent', 'itemsets', 'from', 'transactional', 'databases', 'the', 'problem', 'of', 'protecting', 'such', 'patterns', 'is', 'known', 'as', 'the', 'frequent', 'itemset', 'hiding', 'problem', 'in', 'this', 'paper', 'we', 'present', 'a', 'toolbox', 'which', 'provides', 'several', 'implementations', 'of', 'frequent', 'itemset', 'hiding', 'algorithms', 'firstly', 'we', 'summarize', 'the', 'most', 'important', 'aspects', 'of', 'each', 'algorithm', 'we', 'then', 'introduce', 'the', 'architecture', 'of', 'the', 'toolbox', 'and', 'its', 'novel', 'features', 'finally', 'we', 'provide', 'experimental', 'results', 'on', 'real', 'world', 'datasets', 'demonstrating', 'the', 'efficiency', 'of', 'the', 'toolbox', 'and', 'the', 'convenience', 'it', 'offers', 'in', 'comparing', 'different', 'algorithms']] | [-0.10380801234169672, 0.025960643951261613, -0.07583819507520609, 0.08888088171861729, -0.14759359998984178, -0.1351522205856128, 0.08359617822342576, 0.36739853297795483, -0.3255188708414731, -0.377056927457639, 0.15492756410394257, -0.34538754417874556, -0.12249764454511261, 0.23262309598450984, -0.12223551994840141, 0.05325164763524838, 0.10859050887903601, 0.04638857448993639, -0.0015846935970165847, -0.2739614170295041, 0.3177217651455752, 0.046361641008313276, 0.3262070029583203, 0.04793951920018386, 0.03539224832796085, -0.024062990323270684, -0.08746409742220132, -0.015449873237266912, -0.06482161226537285, 0.21024663891086365, 0.36411559368348, 0.2921123035467375, 0.2946155276465412, -0.47637327816618147, -0.14545415193497685, 0.1104487548835269, 0.13613306215306717, 0.1358370667929093, -0.07719026071524912, -0.3136559328925445, 0.08302882847483808, -0.16533743424327044, -0.07274376914190625, -0.14461330768895622, -0.020207057311550605, 0.007237322822133613, -0.26553349932082393, 0.03458223499453641, 0.004762355899543562, 0.06555203911988766, -0.01681716883281274, -0.10387501336198918, -0.00025364645667860856, 0.19263263398444458, 0.0981754851112161, -0.01919069155657561, 0.13526568184583332, -0.11239531182861845, -0.16424790729567335, 0.42166005241352333, 0.012192212916552628, -0.15075242822204749, 0.1825348458220087, -0.065087493083173, -0.16636456478733438, 0.0877549508987252, 0.21247559412845865, 0.07936275981006273, -0.20483774582541842, 0.02236498870398971, -0.017898178500259043, 0.1694997052460834, 0.04276000821714912, 0.10321873644876982, 0.1988923164522135, 0.18240305493543646, 0.034840053049192285, 0.1379194565072899, -0.0735572640147603, -0.0728349711596217, -0.215157036552552, -0.12095971689114918, -0.17674984047236156, -0.002361183148345456, -0.09939095714378425, -0.1266250178304468, 0.3524889276508036, 0.24427123434535092, 0.17557297333906494, -0.011739121749997139, 0.3553653640120323, 0.007577043544412146, 0.1628992703378238, 0.10832709575600773, 0.13823985553348914, -0.00233125826343894, 0.15862141638507496, -0.13064418198077485, 0.16266597303369987, -0.060658256598191344] |
1,802.10544 | A Fractional Variational Approach for Modelling Dissipative Mechanical
Systems: Continuous and Discrete Settings | Employing a phase space which includes the (Riemann-Liouville) fractional
derivative of curves evolving on real space, we develop a restricted
variational principle for Lagrangian systems yielding the so-called restricted
fractional Euler-Lagrange equations (both in the continuous and discrete
settings), which, as we show, are invariant under linear change of variables.
This principle relies on a particular restriction upon the admissible variation
of the curves. In the case of the half-derivative and mechanical Lagrangians,
i.e. kinetic minus potential energy, the restricted fractional Euler-Lagrange
equations model a dissipative system in both directions of time, summing up to
a set of equations that is invariant under time reversal. Finally, we show that
the discrete equations are a meaningful discretisation of the continuous ones.
| math-ph math.CA math.MP | employing a phase space which includes the riemannliouville fractional derivative of curves evolving on real space we develop a restricted variational principle for lagrangian systems yielding the socalled restricted fractional eulerlagrange equations both in the continuous and discrete settings which as we show are invariant under linear change of variables this principle relies on a particular restriction upon the admissible variation of the curves in the case of the halfderivative and mechanical lagrangians ie kinetic minus potential energy the restricted fractional eulerlagrange equations model a dissipative system in both directions of time summing up to a set of equations that is invariant under time reversal finally we show that the discrete equations are a meaningful discretisation of the continuous ones | [['employing', 'a', 'phase', 'space', 'which', 'includes', 'the', 'riemannliouville', 'fractional', 'derivative', 'of', 'curves', 'evolving', 'on', 'real', 'space', 'we', 'develop', 'a', 'restricted', 'variational', 'principle', 'for', 'lagrangian', 'systems', 'yielding', 'the', 'socalled', 'restricted', 'fractional', 'eulerlagrange', 'equations', 'both', 'in', 'the', 'continuous', 'and', 'discrete', 'settings', 'which', 'as', 'we', 'show', 'are', 'invariant', 'under', 'linear', 'change', 'of', 'variables', 'this', 'principle', 'relies', 'on', 'a', 'particular', 'restriction', 'upon', 'the', 'admissible', 'variation', 'of', 'the', 'curves', 'in', 'the', 'case', 'of', 'the', 'halfderivative', 'and', 'mechanical', 'lagrangians', 'ie', 'kinetic', 'minus', 'potential', 'energy', 'the', 'restricted', 'fractional', 'eulerlagrange', 'equations', 'model', 'a', 'dissipative', 'system', 'in', 'both', 'directions', 'of', 'time', 'summing', 'up', 'to', 'a', 'set', 'of', 'equations', 'that', 'is', 'invariant', 'under', 'time', 'reversal', 'finally', 'we', 'show', 'that', 'the', 'discrete', 'equations', 'are', 'a', 'meaningful', 'discretisation', 'of', 'the', 'continuous', 'ones']] | [-0.17183388841804118, 0.11581951237749308, -0.10740378450039618, 0.05536756553919986, -0.10154511208335558, -0.09109557006352892, 0.035343272153598566, 0.31370406970381737, -0.3048572815333804, -0.2596724769876649, 0.10953480152820702, -0.2259211641891549, -0.13706354247018074, 0.20055871653021312, -0.07125113526611433, 0.10465449394638805, 0.02917311100366836, 0.047689376265043396, -0.13484426861978135, -0.2210936718309919, 0.34178062456194314, -0.07460728293905655, 0.22978331312770023, -0.02544602328465165, 0.20651122474422057, 0.006821850454434753, -0.022580792863542833, 0.029943265346325156, -0.1257745373602423, 0.10221359319984913, 0.18101819667499514, 0.02483334550828052, 0.26413252842612567, -0.4057947675852726, -0.2510078325246771, 0.1397330576631551, 0.06593533328268678, 0.08040412374733326, 0.017773791540336484, -0.30125326905205535, 0.03097865026211366, -0.10819072088537117, -0.13465742462237054, -0.10076995443475122, 0.021053377523397407, 0.060905587882734834, -0.26878914176583446, 0.12680368446744977, 0.07923162115039303, 0.04096807989602288, -0.1423162121248121, -0.07061130125948693, -0.049342907867200365, 0.02814082313173761, 0.028353469583089465, -0.0024351577274501325, 0.08440597720521813, -0.08558830638454916, -0.11372006005452324, 0.4217114831631382, -0.09484446289570769, -0.30174527135677637, 0.14336811939332014, -0.11281152329174801, -0.16004998073719132, 0.1320500960348454, 0.1780208489081512, 0.17853965473671754, -0.1590682364922638, 0.1649631007137941, -0.04283422473818064, 0.113605663087219, 0.06373433580932518, 0.014459718509654825, 0.11498089150942785, 0.11194924757777093, 0.1425521564980348, 0.1393801970698405, -0.027407211986913656, -0.18829414404463024, -0.39973113710293545, -0.17725264204394384, -0.15504922288625192, 0.04639490455156192, -0.09508638286473191, -0.17408706812323846, 0.3866335087378199, 0.09704344167451685, 0.14103725058957933, 0.10657258931702623, 0.23439317205920815, 0.20993379843239382, 0.03624230026034638, 0.04968984380053977, 0.1914809920747454, 0.12815631956327705, 0.11087171184287097, -0.23342481884756125, 0.004293621203396469, 0.11389043680392205] |
1,802.10545 | A spectral collocation method for nonlocal diffusion equations | Nonlocal diffusion model provides an appropriate description of the diffusion
process of solute in the complex medium, which cannot be described properly by
classical theory of PDE. However, the operators in the nonlocal diffusion
models are nonlocal, so the resulting numerical methods generate dense or full
stiffness matrices. This imposes significant computational and memory challenge
for a nonlocal diffusion model.
In this paper, we develop a spectral collocation method for the nonlocal
diffusion model and provide a rigorous error analysis which theoretically
justifies the spectral rate of convergence provided that the kernel functions
and the source functions are sufficiently smooth. Compared to finite difference
methods and finite element methods, because of the high order convergence
rates, the numerical cost of spectral collocation methods will be greatly
decreased. Numerical results confirm the exponential rate of convergence.
| math.NA | nonlocal diffusion model provides an appropriate description of the diffusion process of solute in the complex medium which cannot be described properly by classical theory of pde however the operators in the nonlocal diffusion models are nonlocal so the resulting numerical methods generate dense or full stiffness matrices this imposes significant computational and memory challenge for a nonlocal diffusion model in this paper we develop a spectral collocation method for the nonlocal diffusion model and provide a rigorous error analysis which theoretically justifies the spectral rate of convergence provided that the kernel functions and the source functions are sufficiently smooth compared to finite difference methods and finite element methods because of the high order convergence rates the numerical cost of spectral collocation methods will be greatly decreased numerical results confirm the exponential rate of convergence | [['nonlocal', 'diffusion', 'model', 'provides', 'an', 'appropriate', 'description', 'of', 'the', 'diffusion', 'process', 'of', 'solute', 'in', 'the', 'complex', 'medium', 'which', 'can', 'not', 'be', 'described', 'properly', 'by', 'classical', 'theory', 'of', 'pde', 'however', 'the', 'operators', 'in', 'the', 'nonlocal', 'diffusion', 'models', 'are', 'nonlocal', 'so', 'the', 'resulting', 'numerical', 'methods', 'generate', 'dense', 'or', 'full', 'stiffness', 'matrices', 'this', 'imposes', 'significant', 'computational', 'and', 'memory', 'challenge', 'for', 'a', 'nonlocal', 'diffusion', 'model', 'in', 'this', 'paper', 'we', 'develop', 'a', 'spectral', 'collocation', 'method', 'for', 'the', 'nonlocal', 'diffusion', 'model', 'and', 'provide', 'a', 'rigorous', 'error', 'analysis', 'which', 'theoretically', 'justifies', 'the', 'spectral', 'rate', 'of', 'convergence', 'provided', 'that', 'the', 'kernel', 'functions', 'and', 'the', 'source', 'functions', 'are', 'sufficiently', 'smooth', 'compared', 'to', 'finite', 'difference', 'methods', 'and', 'finite', 'element', 'methods', 'because', 'of', 'the', 'high', 'order', 'convergence', 'rates', 'the', 'numerical', 'cost', 'of', 'spectral', 'collocation', 'methods', 'will', 'be', 'greatly', 'decreased', 'numerical', 'results', 'confirm', 'the', 'exponential', 'rate', 'of', 'convergence']] | [-0.06363283882349018, 0.039675940452284786, -0.09622190387316924, 0.07973710470026377, -0.03740103518323261, -0.13043715484673157, 0.021798569662838847, 0.37231760095763844, -0.3061805574038504, -0.25406693032025085, 0.11351777256555472, -0.24829335840802422, -0.1416706645344247, 0.17718160108608358, -0.04965322049718131, 0.11301459081005305, 0.10798998186638688, -0.020277835546628067, -0.09442735274334314, -0.2472774113446255, 0.28083412398101404, 0.0746579274726922, 0.27509569639668746, 0.09061308976550422, 0.1014438666170463, -0.07575387341614045, -0.07345648445462917, 0.027587215710595688, -0.1234406050424, 0.14285107024753577, 0.22789454220585814, 0.061297072422937214, 0.31732364405658753, -0.4548340095001656, -0.2842308454462053, 0.10089447519652929, 0.1844289858811809, 0.11691861855968669, -0.05181695171974271, -0.24600577261470094, 0.07726449821390868, -0.17461810238498454, -0.1345005636993686, -0.13446625661248723, -0.0370377467958914, 0.07428227389883592, -0.3277180708862622, 0.15483494856572874, 0.08445547643008039, 0.04925439099657952, -0.04394074912552776, -0.09404461760320426, 0.01200418926857631, 0.08886335220920634, 0.022577010208752815, -0.01778654591180384, 0.07045472763917025, -0.11687426557139535, -0.08332326208234436, 0.3589028713416637, -0.09146671662507716, -0.28312398723381405, 0.18866293424541844, -0.12635424247127958, -0.054308203435913825, 0.17703536532216652, 0.17746597951404777, 0.15068066232111854, -0.1619931773337371, 0.10492088913286031, 0.012907749606871648, 0.17388029052766368, -0.002232775044189218, 0.01952086888216881, 0.07804567358278505, 0.1713295085783637, 0.09389574655934292, 0.07400063711889636, -0.05403564092429245, -0.13350521609433652, -0.3136653178576928, -0.1383681025575189, -0.19845347157816456, 0.02359953172162932, -0.16644480579270748, -0.20565925259143114, 0.37791908646057193, 0.1622143126266618, 0.1566166167613119, 0.06948720115949125, 0.28662654249381053, 0.20330853777362362, 0.04212714830303893, 0.06706822056746793, 0.20353189896216944, 0.15235780543812058, 0.11512231478563455, -0.26907516347059485, 0.08325368267405257, 0.13067842995566453] |
1,802.10546 | Computational Theories of Curiosity-Driven Learning | What are the functions of curiosity? What are the mechanisms of
curiosity-driven learning? We approach these questions about the living using
concepts and tools from machine learning and developmental robotics. We argue
that curiosity-driven learning enables organisms to make discoveries to solve
complex problems with rare or deceptive rewards. By fostering exploration and
discovery of a diversity of behavioural skills, and ignoring these rewards,
curiosity can be efficient to bootstrap learning when there is no information,
or deceptive information, about local improvement towards these problems. We
also explain the key role of curiosity for efficient learning of world models.
We review both normative and heuristic computational frameworks used to
understand the mechanisms of curiosity in humans, conceptualizing the child as
a sense-making organism. These frameworks enable us to discuss the
bi-directional causal links between curiosity and learning, and to provide new
hypotheses about the fundamental role of curiosity in self-organizing
developmental structures through curriculum learning. We present various
developmental robotics experiments that study these mechanisms in action, both
supporting these hypotheses to understand better curiosity in humans and
opening new research avenues in machine learning and artificial intelligence.
Finally, we discuss challenges for the design of experimental paradigms for
studying curiosity in psychology and cognitive neuroscience.
Keywords: Curiosity, intrinsic motivation, lifelong learning, predictions,
world model, rewards, free-energy principle, learning progress, machine
learning, AI, developmental robotics, development, curriculum learning,
self-organization.
| cs.AI cs.LG | what are the functions of curiosity what are the mechanisms of curiositydriven learning we approach these questions about the living using concepts and tools from machine learning and developmental robotics we argue that curiositydriven learning enables organisms to make discoveries to solve complex problems with rare or deceptive rewards by fostering exploration and discovery of a diversity of behavioural skills and ignoring these rewards curiosity can be efficient to bootstrap learning when there is no information or deceptive information about local improvement towards these problems we also explain the key role of curiosity for efficient learning of world models we review both normative and heuristic computational frameworks used to understand the mechanisms of curiosity in humans conceptualizing the child as a sensemaking organism these frameworks enable us to discuss the bidirectional causal links between curiosity and learning and to provide new hypotheses about the fundamental role of curiosity in selforganizing developmental structures through curriculum learning we present various developmental robotics experiments that study these mechanisms in action both supporting these hypotheses to understand better curiosity in humans and opening new research avenues in machine learning and artificial intelligence finally we discuss challenges for the design of experimental paradigms for studying curiosity in psychology and cognitive neuroscience keywords curiosity intrinsic motivation lifelong learning predictions world model rewards freeenergy principle learning progress machine learning ai developmental robotics development curriculum learning selforganization | [['what', 'are', 'the', 'functions', 'of', 'curiosity', 'what', 'are', 'the', 'mechanisms', 'of', 'curiositydriven', 'learning', 'we', 'approach', 'these', 'questions', 'about', 'the', 'living', 'using', 'concepts', 'and', 'tools', 'from', 'machine', 'learning', 'and', 'developmental', 'robotics', 'we', 'argue', 'that', 'curiositydriven', 'learning', 'enables', 'organisms', 'to', 'make', 'discoveries', 'to', 'solve', 'complex', 'problems', 'with', 'rare', 'or', 'deceptive', 'rewards', 'by', 'fostering', 'exploration', 'and', 'discovery', 'of', 'a', 'diversity', 'of', 'behavioural', 'skills', 'and', 'ignoring', 'these', 'rewards', 'curiosity', 'can', 'be', 'efficient', 'to', 'bootstrap', 'learning', 'when', 'there', 'is', 'no', 'information', 'or', 'deceptive', 'information', 'about', 'local', 'improvement', 'towards', 'these', 'problems', 'we', 'also', 'explain', 'the', 'key', 'role', 'of', 'curiosity', 'for', 'efficient', 'learning', 'of', 'world', 'models', 'we', 'review', 'both', 'normative', 'and', 'heuristic', 'computational', 'frameworks', 'used', 'to', 'understand', 'the', 'mechanisms', 'of', 'curiosity', 'in', 'humans', 'conceptualizing', 'the', 'child', 'as', 'a', 'sensemaking', 'organism', 'these', 'frameworks', 'enable', 'us', 'to', 'discuss', 'the', 'bidirectional', 'causal', 'links', 'between', 'curiosity', 'and', 'learning', 'and', 'to', 'provide', 'new', 'hypotheses', 'about', 'the', 'fundamental', 'role', 'of', 'curiosity', 'in', 'selforganizing', 'developmental', 'structures', 'through', 'curriculum', 'learning', 'we', 'present', 'various', 'developmental', 'robotics', 'experiments', 'that', 'study', 'these', 'mechanisms', 'in', 'action', 'both', 'supporting', 'these', 'hypotheses', 'to', 'understand', 'better', 'curiosity', 'in', 'humans', 'and', 'opening', 'new', 'research', 'avenues', 'in', 'machine', 'learning', 'and', 'artificial', 'intelligence', 'finally', 'we', 'discuss', 'challenges', 'for', 'the', 'design', 'of', 'experimental', 'paradigms', 'for', 'studying', 'curiosity', 'in', 'psychology', 'and', 'cognitive', 'neuroscience', 'keywords', 'curiosity', 'intrinsic', 'motivation', 'lifelong', 'learning', 'predictions', 'world', 'model', 'rewards', 'freeenergy', 'principle', 'learning', 'progress', 'machine', 'learning', 'ai', 'developmental', 'robotics', 'development', 'curriculum', 'learning', 'selforganization']] | [-0.01444826182740533, 0.09943673410757921, -0.10140569887111801, 0.13524443036866451, -0.22326312701352038, -0.19598537354473855, 0.04629908590658881, 0.4429114718299245, -0.29758620299154886, -0.3565270076261825, 0.032810154568208745, -0.2314825873988717, -0.32648696902504915, 0.1918239534261136, -0.14323601513101236, 0.039536363125461514, 0.06150872827869511, -0.0032053328815422645, 0.007951245675225413, -0.2569408730998245, 0.2968047326003653, 0.046234181908256164, 0.3116453729293362, 0.0486947226268951, 0.09758278675373303, -0.03750801517416654, -0.022926286440424003, -0.05609395396214499, -0.13631136658507162, 0.2501339437968736, 0.43600837137991694, 0.32453012293993644, 0.45328055297768793, -0.46379454085790434, -0.22458365748282602, 0.09907800619750727, 0.12255708855072517, 0.09265926297688978, -0.06536696270600319, -0.35412111733613055, 0.013789610973331572, -0.14553928986907527, -0.056728966595141386, -0.18890720271448477, -0.009249940065425052, -0.04999342233153044, -0.2069440446539851, -0.043685881520228, 0.09357771708723564, 0.16505837247795405, -0.07817156400275314, -0.14316393734834373, 0.09044131287017748, 0.20943126028292308, 0.11400855208419702, 0.024306693279050193, 0.22168811230501365, -0.2528568567468187, -0.2707830446011765, 0.35094195514038923, 0.06444606055148702, -0.15384680728476868, 0.2513063329487518, -0.03656718719460367, -0.19869664900501027, 0.022664162889529653, 0.27462499615569563, 0.024577789087922162, -0.1698028636961347, 0.008958240873363341, 0.05479950349631528, 0.12477294429343633, 0.014010555769202978, 0.00265551958076542, 0.2564388363287626, 0.2659022098734536, 0.009736588399645803, 0.048253712480212665, 0.009036239932034994, -0.16525567128189828, -0.2114669723989336, -0.1583934858630464, -0.09617658459386223, 0.02909237349621431, -0.06414435908702146, -0.08927645806759986, 0.34811966381072346, 0.24232213452303838, 0.11089872549731268, 0.07274407271995295, 0.30142461788519304, -0.02726927846029612, 0.07390417559524819, 0.08321281662312495, 0.1978374974721815, 0.02559781868893279, 0.1695336397212633, -0.17804252401433526, 0.13280177981629318, -0.03455920274751708] |
1,802.10547 | Dynamic Pricing with Variable Order Sizes for a Model with Constant
Demand Elasticity | In this paper we investigate a dynamic pricing model for constant demand
elasticity where customers have a probability distribution on the number of
items they order. This is a generalization from standard models which restrict
customers to buy only one item at a time. For the generalized model, we first
obtain a closed form expression for the optimal expected revenue and optimal
pricing strategy. This expression involves a recursively defined term for which
we investigate the behavior. We call comparable models those which have the
same demand, which is the customer arrival rate times the average order size.
In fact, the average order size plays an important role for results for the
generalized model. An important result we show is that comparable models have
the same asymptotic pricing behavior. Numerical results also show that
comparable models are relatively close even for low inventory levels. Lastly,
we prove that the relative difference between comparable models is governed not
by the customer arrival rate, but solely by their order size distributions.
| math.OC | in this paper we investigate a dynamic pricing model for constant demand elasticity where customers have a probability distribution on the number of items they order this is a generalization from standard models which restrict customers to buy only one item at a time for the generalized model we first obtain a closed form expression for the optimal expected revenue and optimal pricing strategy this expression involves a recursively defined term for which we investigate the behavior we call comparable models those which have the same demand which is the customer arrival rate times the average order size in fact the average order size plays an important role for results for the generalized model an important result we show is that comparable models have the same asymptotic pricing behavior numerical results also show that comparable models are relatively close even for low inventory levels lastly we prove that the relative difference between comparable models is governed not by the customer arrival rate but solely by their order size distributions | [['in', 'this', 'paper', 'we', 'investigate', 'a', 'dynamic', 'pricing', 'model', 'for', 'constant', 'demand', 'elasticity', 'where', 'customers', 'have', 'a', 'probability', 'distribution', 'on', 'the', 'number', 'of', 'items', 'they', 'order', 'this', 'is', 'a', 'generalization', 'from', 'standard', 'models', 'which', 'restrict', 'customers', 'to', 'buy', 'only', 'one', 'item', 'at', 'a', 'time', 'for', 'the', 'generalized', 'model', 'we', 'first', 'obtain', 'a', 'closed', 'form', 'expression', 'for', 'the', 'optimal', 'expected', 'revenue', 'and', 'optimal', 'pricing', 'strategy', 'this', 'expression', 'involves', 'a', 'recursively', 'defined', 'term', 'for', 'which', 'we', 'investigate', 'the', 'behavior', 'we', 'call', 'comparable', 'models', 'those', 'which', 'have', 'the', 'same', 'demand', 'which', 'is', 'the', 'customer', 'arrival', 'rate', 'times', 'the', 'average', 'order', 'size', 'in', 'fact', 'the', 'average', 'order', 'size', 'plays', 'an', 'important', 'role', 'for', 'results', 'for', 'the', 'generalized', 'model', 'an', 'important', 'result', 'we', 'show', 'is', 'that', 'comparable', 'models', 'have', 'the', 'same', 'asymptotic', 'pricing', 'behavior', 'numerical', 'results', 'also', 'show', 'that', 'comparable', 'models', 'are', 'relatively', 'close', 'even', 'for', 'low', 'inventory', 'levels', 'lastly', 'we', 'prove', 'that', 'the', 'relative', 'difference', 'between', 'comparable', 'models', 'is', 'governed', 'not', 'by', 'the', 'customer', 'arrival', 'rate', 'but', 'solely', 'by', 'their', 'order', 'size', 'distributions']] | [-0.09585139244524817, 0.08011187371793038, -0.05822521724225678, 0.11984491107789745, -0.05246463493366874, -0.1273742817733547, 0.0848559584618772, 0.38434767641523887, -0.25884573302678104, -0.29712829332710544, 0.11402303411583736, -0.28282420919139006, -0.13759112186432326, 0.18100937205289638, -0.08076382848880524, 0.018003833709565712, 0.0405696649379896, 0.09940825379591368, -0.01452529745124082, -0.28405421871978503, 0.28827807319504845, 0.06839685020665225, 0.3302164521211615, 0.03494195549710263, 0.10782307002021099, -0.028508090535344106, -0.0033281411722126094, 0.01962841570738306, -0.15442293712013566, 0.11180996014764147, 0.23658134226108019, 0.07629008004689843, 0.3061285130762269, -0.4086567441762023, -0.17753413463143644, 0.1430034403711249, 0.11586235047555005, 0.08318906811688691, -0.037802662506848356, -0.1906633161148883, 0.10087549889228753, -0.2350962719406117, -0.09642348569658028, -0.04341391641260869, 0.02498320363924877, 0.05388915044194936, -0.32380369491048555, 0.04574317458487314, 0.05445586349258024, -0.008114072325699356, -0.09534144892767843, -0.12138129821730524, 0.023316264080886658, 0.16013389620268662, 0.0936797391974571, -0.0056253120402348115, 0.0729149971322636, -0.15263669752548917, -0.11165614139575225, 0.40664797571085437, -0.08390782826122713, -0.2194519986194619, 0.12653834316824403, -0.12679292782094087, -0.12604277933391153, 0.10683215073083896, 0.2100515651500084, 0.12638946021934586, -0.15058385204391542, 0.05441114530308288, -0.0684412634385937, 0.18575425704764809, 0.05948403488690331, 0.019524513752083982, 0.17883840469731646, 0.1689913086620705, 0.1173359870169444, 0.11364183468005713, -0.028212361529568686, -0.1291963208050704, -0.2748083370412595, -0.14935960278421992, -0.1561600700869451, 0.058083734308461074, -0.15114311553176546, -0.12192665901277545, 0.36976753775245297, 0.17771688148450965, 0.19723790861974808, 0.14727145741754294, 0.2882255389501159, 0.2041909653836718, 0.038192665204405785, 0.12323587370441245, 0.17494447165053095, -0.0013564045970829634, 0.08048671872228295, -0.19410622560215243, 0.191656413424716, 0.06998791894462159] |
1,802.10548 | Using Deep Learning for Segmentation and Counting within Microscopy Data | Cell counting is a ubiquitous, yet tedious task that would greatly benefit
from automation. From basic biological questions to clinical trials, cell
counts provide key quantitative feedback that drive research. Unfortunately,
cell counting is most commonly a manual task and can be time-intensive. The
task is made even more difficult due to overlapping cells, existence of
multiple focal planes, and poor imaging quality, among other factors. Here, we
describe a convolutional neural network approach, using a recently described
feature pyramid network combined with a VGG-style neural network, for
segmenting and subsequent counting of cells in a given microscopy image.
| cs.CV cs.LG q-bio.QM | cell counting is a ubiquitous yet tedious task that would greatly benefit from automation from basic biological questions to clinical trials cell counts provide key quantitative feedback that drive research unfortunately cell counting is most commonly a manual task and can be timeintensive the task is made even more difficult due to overlapping cells existence of multiple focal planes and poor imaging quality among other factors here we describe a convolutional neural network approach using a recently described feature pyramid network combined with a vggstyle neural network for segmenting and subsequent counting of cells in a given microscopy image | [['cell', 'counting', 'is', 'a', 'ubiquitous', 'yet', 'tedious', 'task', 'that', 'would', 'greatly', 'benefit', 'from', 'automation', 'from', 'basic', 'biological', 'questions', 'to', 'clinical', 'trials', 'cell', 'counts', 'provide', 'key', 'quantitative', 'feedback', 'that', 'drive', 'research', 'unfortunately', 'cell', 'counting', 'is', 'most', 'commonly', 'a', 'manual', 'task', 'and', 'can', 'be', 'timeintensive', 'the', 'task', 'is', 'made', 'even', 'more', 'difficult', 'due', 'to', 'overlapping', 'cells', 'existence', 'of', 'multiple', 'focal', 'planes', 'and', 'poor', 'imaging', 'quality', 'among', 'other', 'factors', 'here', 'we', 'describe', 'a', 'convolutional', 'neural', 'network', 'approach', 'using', 'a', 'recently', 'described', 'feature', 'pyramid', 'network', 'combined', 'with', 'a', 'vggstyle', 'neural', 'network', 'for', 'segmenting', 'and', 'subsequent', 'counting', 'of', 'cells', 'in', 'a', 'given', 'microscopy', 'image']] | [-0.05994450238255803, 0.0452414969772552, -0.025922839830845895, 0.0621145073162166, -0.11899862100012751, -0.2069165931939326, 0.07783208624165824, 0.44262165480735477, -0.2483477446996146, -0.31891390391521984, 0.07857863418640325, -0.22540836833944225, -0.24395089965276043, 0.23693793970677587, -0.19091102610238725, 0.07279071532250994, 0.15041684768059188, 0.003610761483691426, 0.04707189333023071, -0.25644067380897173, 0.2374326452880985, 0.06204891226470771, 0.35017268325324463, 0.014795621686539792, 0.09240522091700272, -0.0017544494499687595, -0.0599437309570159, 0.02208553635364756, -0.03257557211841828, 0.18464576910165223, 0.3718799259490098, 0.1992836186398912, 0.3363762285249929, -0.48823422372265896, -0.23983378756339802, 0.094959755352877, 0.20127119408918057, 0.097533683020638, -0.0405943585717592, -0.24303326207316583, 0.09305282340225096, -0.12124031927493034, -0.028691336648971444, -0.12674324653779317, -0.03382009930080838, -0.008548750563619765, -0.2670779937944102, 0.040884570496137994, 0.016600018150803416, 0.09698746472390161, -0.005151931530410292, -0.0816016697249554, 0.02508559602787812, 0.226227520532304, -0.005731018923335906, 0.09023534314650478, 0.18150788101231247, -0.20608292841775852, -0.1424907065758651, 0.3706511219756471, 0.0753606188609594, -0.2018792654265358, 0.20373610494601907, -0.07647156861676561, -0.17101498105271598, 0.16994102185385096, 0.17492498563969452, 0.08802444892794345, -0.21262883260990775, -0.04228087589360781, -0.01787690942486127, 0.23156826703272987, 0.13710110225112676, -0.006569944952398238, 0.21006307004000804, 0.28991648735422076, 0.022912689352953673, 0.10471166870639086, -0.12781420199557988, -0.025481369120605064, -0.1755179500794085, -0.10621036262712394, -0.17565273247762686, 0.0367342849271466, -0.05298391540462476, -0.1902329483436364, 0.365551684025882, 0.153584089548788, 0.19139269641553514, 0.03850440539871201, 0.3553380887729652, -8.712999165208652e-05, 0.1636261318838506, -0.037093358045570894, 0.13094042249099172, 0.06723927988698988, 0.12499104146704529, -0.16300386067178815, 0.091121233679881, 0.05505150198146249] |
1,802.10549 | Automatic topography of high-dimensional data sets by non-parametric
Density Peak clustering | Data analysis in high-dimensional spaces aims at obtaining a synthetic
description of a data set, revealing its main structure and its salient
features. We here introduce an approach providing this description in the form
of a topography of the data, namely a human-readable chart of the probability
density from which the data are harvested. The approach is based on an
unsupervised extension of Density Peak clustering and a non-parametric density
estimator that measures the probability density in the manifold containing the
data. This allows finding automatically the number and the height of the peaks
of the probability density, and the depth of the "valleys" separating them.
Importantly, the density estimator provides a measure of the error, which
allows distinguishing genuine density peaks from density fluctuations due to
finite sampling. The approach thus provides robust and visual information about
the density peaks' height, their statistical reliability, and their
hierarchical organization, offering a conceptually powerful extension of the
standard clustering partitions. We show that this framework is particularly
useful in the analysis of complex data sets.
| stat.ML cs.LG | data analysis in highdimensional spaces aims at obtaining a synthetic description of a data set revealing its main structure and its salient features we here introduce an approach providing this description in the form of a topography of the data namely a humanreadable chart of the probability density from which the data are harvested the approach is based on an unsupervised extension of density peak clustering and a nonparametric density estimator that measures the probability density in the manifold containing the data this allows finding automatically the number and the height of the peaks of the probability density and the depth of the valleys separating them importantly the density estimator provides a measure of the error which allows distinguishing genuine density peaks from density fluctuations due to finite sampling the approach thus provides robust and visual information about the density peaks height their statistical reliability and their hierarchical organization offering a conceptually powerful extension of the standard clustering partitions we show that this framework is particularly useful in the analysis of complex data sets | [['data', 'analysis', 'in', 'highdimensional', 'spaces', 'aims', 'at', 'obtaining', 'a', 'synthetic', 'description', 'of', 'a', 'data', 'set', 'revealing', 'its', 'main', 'structure', 'and', 'its', 'salient', 'features', 'we', 'here', 'introduce', 'an', 'approach', 'providing', 'this', 'description', 'in', 'the', 'form', 'of', 'a', 'topography', 'of', 'the', 'data', 'namely', 'a', 'humanreadable', 'chart', 'of', 'the', 'probability', 'density', 'from', 'which', 'the', 'data', 'are', 'harvested', 'the', 'approach', 'is', 'based', 'on', 'an', 'unsupervised', 'extension', 'of', 'density', 'peak', 'clustering', 'and', 'a', 'nonparametric', 'density', 'estimator', 'that', 'measures', 'the', 'probability', 'density', 'in', 'the', 'manifold', 'containing', 'the', 'data', 'this', 'allows', 'finding', 'automatically', 'the', 'number', 'and', 'the', 'height', 'of', 'the', 'peaks', 'of', 'the', 'probability', 'density', 'and', 'the', 'depth', 'of', 'the', 'valleys', 'separating', 'them', 'importantly', 'the', 'density', 'estimator', 'provides', 'a', 'measure', 'of', 'the', 'error', 'which', 'allows', 'distinguishing', 'genuine', 'density', 'peaks', 'from', 'density', 'fluctuations', 'due', 'to', 'finite', 'sampling', 'the', 'approach', 'thus', 'provides', 'robust', 'and', 'visual', 'information', 'about', 'the', 'density', 'peaks', 'height', 'their', 'statistical', 'reliability', 'and', 'their', 'hierarchical', 'organization', 'offering', 'a', 'conceptually', 'powerful', 'extension', 'of', 'the', 'standard', 'clustering', 'partitions', 'we', 'show', 'that', 'this', 'framework', 'is', 'particularly', 'useful', 'in', 'the', 'analysis', 'of', 'complex', 'data', 'sets']] | [-0.09821487488974442, 0.035771124491611246, -0.18355168147686998, 0.10265482026192456, -0.04183530953616418, -0.07540037012766061, 0.07219689619331353, 0.3349966010956586, -0.27392104024270914, -0.33025051181300963, 0.07080310874019118, -0.2833188046012462, -0.14058227054828284, 0.15332733337157245, -0.046576399655862785, 0.04216176069049893, 0.03451676156516347, 0.06298852634305756, -0.06281108941933697, -0.1891268016395812, 0.33102579849996955, 0.08627801180827892, 0.35233261838726615, 0.03326184380713893, 0.09808761293427141, 0.01208822404425163, -0.07534974505964281, 0.019655802382166958, -0.12375548752213777, 0.21236329550865565, 0.2632552840393679, 0.1914657092166144, 0.2981381915903104, -0.3579826963096643, -0.20006887251364025, 0.09305892675718956, 0.098377793858727, 0.10694724023502705, -0.05104268220555701, -0.3055112544800444, 0.047417088759656265, -0.12052597703101735, -0.11604520879370085, -0.10793195335173059, -0.004382194785251357, 0.005487295726699562, -0.28629245616973314, 0.11552169937212234, 0.04773610216885238, 0.045760820744205906, -0.0515063154777437, -0.09679186602936651, -0.03291028560990275, 0.11215480928705342, 0.0144480127538822, 0.014931537638466549, 0.1295764494350116, -0.12725400916787785, -0.06519527436533792, 0.3398020301206872, -0.048918516041935776, -0.1678773170101574, 0.18510325142348336, -0.12839713841194994, -0.13229838164855096, 0.15264253086549626, 0.16764614592980723, 0.08838417620837004, -0.14238624879053322, 0.07587726676271929, -0.030631738751671737, 0.16677469424582247, 0.022540353915664828, 0.039152457212879396, 0.222131373453417, 0.21404126191768666, 0.08826470542859671, 0.11658697392143866, -0.180288850197511, -0.05986515595811826, -0.2883962899200276, -0.13891276093226612, -0.20827670771783838, -0.007763767404877849, -0.1457572801558143, -0.19616380971374697, 0.4546229894173963, 0.17855237631111182, 0.24808524143025706, 0.08499982342760924, 0.33755428263189635, 0.10217639602576556, 0.051707000378653105, 0.08241848491437348, 0.11714704217785306, 0.1436769262855423, 0.04041944923489515, -0.1773408776404732, 0.08988035293349504, 0.0062953438168263124] |
1,802.1055 | Exclusive double quarkonium production and generalized TMDs of gluons | Being the "mother distributions" of all types of two-parton correlation
functions, generalized transverse momentum dependent parton distributions
(GTMDs) have attracted a lot of attention over the last years. We argue that
exclusive double production of pseudoscalar quarkonia ($\eta_c$ or $\eta_b$) in
nucleon-nucleon collisions gives access to GTMDs of gluons.
| hep-ph hep-ex | being the mother distributions of all types of twoparton correlation functions generalized transverse momentum dependent parton distributions gtmds have attracted a lot of attention over the last years we argue that exclusive double production of pseudoscalar quarkonia eta_c or eta_b in nucleonnucleon collisions gives access to gtmds of gluons | [['being', 'the', 'mother', 'distributions', 'of', 'all', 'types', 'of', 'twoparton', 'correlation', 'functions', 'generalized', 'transverse', 'momentum', 'dependent', 'parton', 'distributions', 'gtmds', 'have', 'attracted', 'a', 'lot', 'of', 'attention', 'over', 'the', 'last', 'years', 'we', 'argue', 'that', 'exclusive', 'double', 'production', 'of', 'pseudoscalar', 'quarkonia', 'eta_c', 'or', 'eta_b', 'in', 'nucleonnucleon', 'collisions', 'gives', 'access', 'to', 'gtmds', 'of', 'gluons']] | [-0.08816738850056972, 0.3156521156838886, -0.20860869986746383, 0.16851964781098827, -0.06078274936738367, -0.08283197373265819, -0.016319267451763153, 0.39321488225642515, -0.1571597245958995, -0.1371140868155932, -0.1690296579214117, -0.35413510449306695, 0.06687329866809352, 0.08826884155503797, 0.06706131415023488, 0.148171405973179, 0.11364400673572127, 0.0008133697912705188, -0.13601540655791, -0.2795513384804434, 0.36433030666821464, -0.009421486875555498, 0.27500676589884926, 0.19030620666144757, 0.05174237968666213, 0.17787007569354407, -0.0944985571098799, -0.11369451643823057, -0.10055982861837148, 0.08290826367292724, 0.25481138699592987, 0.06896853893615153, 0.1914548293060186, -0.33544136348123454, -0.1739451391099743, 0.1670671997363774, 0.20262236349588755, 0.06292754341135448, -0.007635531994533174, -0.2502839387755613, 0.0519319335640199, -0.378012696623194, -0.09159628865404093, -0.12203672000121478, 0.08120180739622031, 0.03185059759309705, -0.2888633455624994, 0.10561293298236038, -0.07693744264543056, 0.0044072947645445865, 0.02795862636947054, -0.28262559976428747, -0.0807103670050143, 0.006448740893927384, 0.1911533465038757, 0.11486398733734172, 0.15369502367565827, -0.19399992308379815, -0.21899710452939591, 0.351774791540692, 0.05944175622901138, -0.22561413343349584, 0.10576520519977321, -0.23304660142190298, -0.19018881995116874, 0.18445353707944862, 0.3188351006532202, 0.0802813946906173, -0.2100192546958522, 0.09507740022880691, -0.04297144909636402, 0.1179212548803272, 0.17158093544825606, 0.19840421779461356, 0.20521101557022456, 0.12614595358811168, -0.10507059670813686, 0.09278785716742277, -0.03874168218094475, -0.16782334047768796, -0.3516122918499976, -0.08473594308051528, -0.11716116888077968, 0.12340748927803064, -0.045689830304674654, -0.14089029312742, 0.4058204290590116, 0.021248581971288944, 0.2954551145738485, -0.014907179267278739, 0.2551854746606277, 0.08777303298060991, 0.1355960279304002, 0.07272475606248695, 0.2292594620387773, 0.24823644559602348, 0.18295839703309216, -0.15868143668892432, 0.07784789373946129, 0.03406440267073257] |
1,802.10551 | A Variational Inequality Perspective on Generative Adversarial Networks | Generative adversarial networks (GANs) form a generative modeling approach
known for producing appealing samples, but they are notably difficult to train.
One common way to tackle this issue has been to propose new formulations of the
GAN objective. Yet, surprisingly few studies have looked at optimization
methods designed for this adversarial training. In this work, we cast GAN
optimization problems in the general variational inequality framework. Tapping
into the mathematical programming literature, we counter some common
misconceptions about the difficulties of saddle point optimization and propose
to extend techniques designed for variational inequalities to the training of
GANs. We apply averaging, extrapolation and a computationally cheaper variant
that we call extrapolation from the past to the stochastic gradient method
(SGD) and Adam.
| cs.LG math.OC stat.ML | generative adversarial networks gans form a generative modeling approach known for producing appealing samples but they are notably difficult to train one common way to tackle this issue has been to propose new formulations of the gan objective yet surprisingly few studies have looked at optimization methods designed for this adversarial training in this work we cast gan optimization problems in the general variational inequality framework tapping into the mathematical programming literature we counter some common misconceptions about the difficulties of saddle point optimization and propose to extend techniques designed for variational inequalities to the training of gans we apply averaging extrapolation and a computationally cheaper variant that we call extrapolation from the past to the stochastic gradient method sgd and adam | [['generative', 'adversarial', 'networks', 'gans', 'form', 'a', 'generative', 'modeling', 'approach', 'known', 'for', 'producing', 'appealing', 'samples', 'but', 'they', 'are', 'notably', 'difficult', 'to', 'train', 'one', 'common', 'way', 'to', 'tackle', 'this', 'issue', 'has', 'been', 'to', 'propose', 'new', 'formulations', 'of', 'the', 'gan', 'objective', 'yet', 'surprisingly', 'few', 'studies', 'have', 'looked', 'at', 'optimization', 'methods', 'designed', 'for', 'this', 'adversarial', 'training', 'in', 'this', 'work', 'we', 'cast', 'gan', 'optimization', 'problems', 'in', 'the', 'general', 'variational', 'inequality', 'framework', 'tapping', 'into', 'the', 'mathematical', 'programming', 'literature', 'we', 'counter', 'some', 'common', 'misconceptions', 'about', 'the', 'difficulties', 'of', 'saddle', 'point', 'optimization', 'and', 'propose', 'to', 'extend', 'techniques', 'designed', 'for', 'variational', 'inequalities', 'to', 'the', 'training', 'of', 'gans', 'we', 'apply', 'averaging', 'extrapolation', 'and', 'a', 'computationally', 'cheaper', 'variant', 'that', 'we', 'call', 'extrapolation', 'from', 'the', 'past', 'to', 'the', 'stochastic', 'gradient', 'method', 'sgd', 'and', 'adam']] | [0.0035029501925207306, -0.04216039615118357, -0.1160142870589358, 0.17978379456040097, -0.16291595434342496, -0.2270311821084164, 0.053301096298411246, 0.4674077060256825, -0.3037717154547267, -0.33946958796854027, 0.07731127303253982, -0.2399820893063958, -0.217189951212008, 0.16058139938128288, -0.1920484225189344, 0.15062880499257905, 0.09520462820817885, -0.050753506293642475, -0.09971336741095836, -0.2849009614819508, 0.2849997641446191, 0.016567873921184265, 0.29863118586038834, -0.01387810167764909, 0.13332837642472023, -0.05118816914647573, 0.04162529661686572, 0.019308177777184327, -0.10355950340841655, 0.22007627951622497, 0.3120402193277097, 0.21395959717900964, 0.4439481067715488, -0.46454167075943753, -0.2574254479736365, 0.11760032267527289, 0.14474934044453414, 0.16020555855309376, -0.08398243214660248, -0.2682323236873404, 0.06059685969328294, -0.12753844587227758, -0.03872810356456359, -0.18298968026933612, -0.07846464054491066, -0.038370843289694825, -0.280079620317785, 0.013422583569543527, 0.08954024014108983, 0.02099652196467686, -0.029990001362137742, -0.15897492886059078, 0.09082538611064742, 0.059162264170705296, 0.10593556469596434, 0.05092387117033244, 0.09876190638169646, -0.10595237770591115, -0.15245648390292876, 0.3234949783483123, -0.00847419447715959, -0.21140980988513816, 0.17171688542747107, 0.0015595752982514315, -0.21312054966148905, 0.09420383339518773, 0.25642863903137414, 0.19304894760525862, -0.21760705147381323, 0.02077375187349628, -0.019201912980175533, 0.09117947313882083, 0.04852941567001895, -0.03263739671808148, 0.12344555631394452, 0.20954180680994006, 0.09904788551588742, 0.17429959292706773, -0.09707718470026969, -0.13791918064864567, -0.2247798727504665, -0.0749644119460441, -0.18310822824924636, 0.04451651232446865, -0.030847541208414278, -0.16676532115298706, 0.3655603774670573, 0.24681836246039535, 0.18145875442681497, 0.11535297792985058, 0.35342943088197315, 0.06861690423865498, 0.11680331123137816, 0.10074717950717103, 0.23860156581356365, 0.10475107296140956, 0.15381762680414393, -0.11339338991855898, 0.09844032141568948, 0.06598873977305093] |
1,802.10552 | Equi-coverage Contours in Cellular Networks | In this letter, we introduce a general cellular network model where i) users
and BSs are distributed as two general point processes that may be coupled, ii)
pathloss is assumed to follow a multi-slope power-law pathloss model, and iii)
fading (power) is assumed to be independent across all wireless links. For this
setup, we first obtain a set of contours representing the same meta
distribution of SIR, which is the distribution of the conditional coverage
probability given the point process, for different values of the parameters of
the pathloss function and BS and user point processes. This general result is
then specialized to 3GPP-inspired user and BS configurations obtained by
combining Poisson point process (PPP) and Poisson cluster process (PCP).
| cs.IT cs.NI math.IT | in this letter we introduce a general cellular network model where i users and bss are distributed as two general point processes that may be coupled ii pathloss is assumed to follow a multislope powerlaw pathloss model and iii fading power is assumed to be independent across all wireless links for this setup we first obtain a set of contours representing the same meta distribution of sir which is the distribution of the conditional coverage probability given the point process for different values of the parameters of the pathloss function and bs and user point processes this general result is then specialized to 3gppinspired user and bs configurations obtained by combining poisson point process ppp and poisson cluster process pcp | [['in', 'this', 'letter', 'we', 'introduce', 'a', 'general', 'cellular', 'network', 'model', 'where', 'i', 'users', 'and', 'bss', 'are', 'distributed', 'as', 'two', 'general', 'point', 'processes', 'that', 'may', 'be', 'coupled', 'ii', 'pathloss', 'is', 'assumed', 'to', 'follow', 'a', 'multislope', 'powerlaw', 'pathloss', 'model', 'and', 'iii', 'fading', 'power', 'is', 'assumed', 'to', 'be', 'independent', 'across', 'all', 'wireless', 'links', 'for', 'this', 'setup', 'we', 'first', 'obtain', 'a', 'set', 'of', 'contours', 'representing', 'the', 'same', 'meta', 'distribution', 'of', 'sir', 'which', 'is', 'the', 'distribution', 'of', 'the', 'conditional', 'coverage', 'probability', 'given', 'the', 'point', 'process', 'for', 'different', 'values', 'of', 'the', 'parameters', 'of', 'the', 'pathloss', 'function', 'and', 'bs', 'and', 'user', 'point', 'processes', 'this', 'general', 'result', 'is', 'then', 'specialized', 'to', '3gppinspired', 'user', 'and', 'bs', 'configurations', 'obtained', 'by', 'combining', 'poisson', 'point', 'process', 'ppp', 'and', 'poisson', 'cluster', 'process', 'pcp']] | [-0.14829979892898382, 0.05353295840244709, -0.06555391357577711, 0.05408173488493568, -0.06823205094033179, -0.23071016503904923, 0.131818047685533, 0.37362435393567595, -0.27758280856206136, -0.24212413957389464, 0.028379001060868575, -0.23760435581520326, -0.1729961342820037, 0.09999989781786978, -0.07951936357412018, 0.043663804895883354, 0.00784288821428889, 0.02063094004362571, 0.0213587501520651, -0.21152516466197596, 0.3879866811276625, 0.0981432431134857, 0.30942899967786397, -0.033759436554944594, 0.06400809529386148, 0.024725204419751626, -0.07456409137602113, -0.011566637601398182, -0.10673801592550439, 0.05598771445327947, 0.26697404454305707, 0.1626035608727257, 0.21637724720317275, -0.3811787183889571, -0.2541695348918438, 0.11072351299461071, 0.14910880919788502, 0.04497497428713382, 0.01664144651447775, -0.2680331679538456, 0.13091807135873856, -0.20681014847198204, -0.0960815221583862, 0.059155416569257734, -0.011491752347024549, 0.10307915493877244, -0.41462405484576687, 0.031495274475016516, 0.0262945523767286, 0.014564865836169288, -0.027981017414918718, -0.11797160087172881, 0.011071233722545645, 0.1718750399881739, 0.03275608069174375, 0.007068427772644688, 0.14567881043483855, -0.0965666110654745, -0.0813013372606277, 0.3750910590121037, 0.006085459776848805, -0.2621024169669557, 0.16197910289350553, -0.13674857760896952, -0.14106892998635517, 0.13101262416682763, 0.20855785626135454, 0.06422754381431126, -0.24519342076847284, 0.06194444327173019, -0.02251681760188286, 0.11064931701481373, 0.05190927410466956, 0.00733306777356349, 0.17717439653508427, 0.1704915063015475, 0.09730022840060983, 0.09868446158190422, -0.13403053467060214, -0.15691277185971497, -0.29231436833144486, -0.1386118307318382, -0.22069781292484245, 0.0533626005210045, -0.13962645711256935, -0.14304518359987176, 0.36827665408525395, 0.12079052448941849, 0.20623296877846686, 0.1462802395736701, 0.2996343717902523, 0.19040402938123155, -0.01475301880131186, 0.1078064666176606, 0.11565776934192766, 0.08794963855233763, 0.12207395258602224, -0.09653099721000225, 0.08266961524857819, -0.017185990391455654] |
1,802.10553 | Topological phase transition in a two-species fermion system: Effects of
a rotating trap potential or a synthetic gauge field | We numerically investigate the quantum phases and phase transition in a
system made of two species of fermionic atoms that interact with each other via
$s$-wave Feshbach resonance, and are subject to rotation or a synthetic gauge
field that puts the fermions at Landau level filling factor $\nu_f = 2$. We
show that the system undergoes a continuous quantum phase transition from a
$\nu_f = 2$ fermionic integer quantum Hall state formed by atoms, to a $\nu_b =
1/2$ bosonic fractional quantum Hall state formed by bosonic diatomic
molecules. In the disk geometry we use, these two different topological phases
are distinguished by their different gapless edge excitation spectra, and the
quantum phase transition between them is signaled by the closing of the energy
gap in the bulk. Comparisons will be made with field theoretical predictions,
and the case of $p$-wave pairing.
| cond-mat.str-el cond-mat.quant-gas | we numerically investigate the quantum phases and phase transition in a system made of two species of fermionic atoms that interact with each other via swave feshbach resonance and are subject to rotation or a synthetic gauge field that puts the fermions at landau level filling factor nu_f 2 we show that the system undergoes a continuous quantum phase transition from a nu_f 2 fermionic integer quantum hall state formed by atoms to a nu_b 12 bosonic fractional quantum hall state formed by bosonic diatomic molecules in the disk geometry we use these two different topological phases are distinguished by their different gapless edge excitation spectra and the quantum phase transition between them is signaled by the closing of the energy gap in the bulk comparisons will be made with field theoretical predictions and the case of pwave pairing | [['we', 'numerically', 'investigate', 'the', 'quantum', 'phases', 'and', 'phase', 'transition', 'in', 'a', 'system', 'made', 'of', 'two', 'species', 'of', 'fermionic', 'atoms', 'that', 'interact', 'with', 'each', 'other', 'via', 'swave', 'feshbach', 'resonance', 'and', 'are', 'subject', 'to', 'rotation', 'or', 'a', 'synthetic', 'gauge', 'field', 'that', 'puts', 'the', 'fermions', 'at', 'landau', 'level', 'filling', 'factor', 'nu_f', '2', 'we', 'show', 'that', 'the', 'system', 'undergoes', 'a', 'continuous', 'quantum', 'phase', 'transition', 'from', 'a', 'nu_f', '2', 'fermionic', 'integer', 'quantum', 'hall', 'state', 'formed', 'by', 'atoms', 'to', 'a', 'nu_b', '12', 'bosonic', 'fractional', 'quantum', 'hall', 'state', 'formed', 'by', 'bosonic', 'diatomic', 'molecules', 'in', 'the', 'disk', 'geometry', 'we', 'use', 'these', 'two', 'different', 'topological', 'phases', 'are', 'distinguished', 'by', 'their', 'different', 'gapless', 'edge', 'excitation', 'spectra', 'and', 'the', 'quantum', 'phase', 'transition', 'between', 'them', 'is', 'signaled', 'by', 'the', 'closing', 'of', 'the', 'energy', 'gap', 'in', 'the', 'bulk', 'comparisons', 'will', 'be', 'made', 'with', 'field', 'theoretical', 'predictions', 'and', 'the', 'case', 'of', 'pwave', 'pairing']] | [-0.20474570083746807, 0.3119877341895183, -0.056644366662145305, 0.018903813707615458, 0.006316253634022294, -0.20912977819927306, 0.08754696039543253, 0.3653952063416406, -0.23489241338194275, -0.269255725599879, 0.004546361225791168, -0.309406179479129, -0.10698271551162755, 0.11191383294138066, 0.07278145139320023, 0.046295221955280935, -0.0032022684584740255, 0.002114613517020032, -0.10610848679475272, -0.22925475145281432, 0.3540228000111717, -0.05355169486820617, 0.23590347209690715, 0.03317906890774695, 0.02049672963740907, -0.03525512469640352, 0.0976524478085875, -0.01655715018537619, -0.15092256218239977, 0.06310936897028264, 0.24782956865274433, -0.0492903177338324, 0.16542543390457579, -0.4635096606295958, -0.19016312745989386, 0.04258248343454044, 0.12248687940673139, 0.14630340245425058, -0.04205184676784941, -0.3498467962582522, -0.0024103176136829442, -0.18627360315738822, -0.10848781031392274, -0.07753176270923812, -0.00872367103843742, -0.06798575055725176, -0.21032107118249155, 0.08466218040398449, 0.03980583057608188, 0.09334330446013123, -0.050542295440569145, -0.1152179625886995, -0.05543629577209195, 0.0889335490416454, -0.015317209803653385, 0.03463852069472137, 0.14686866236261006, -0.17684273636839587, -0.16059588286489676, 0.37834541813182315, -0.09826156227320111, -0.132926215906795, 0.2185750340158455, -0.16346036324218055, -0.07489560674892726, 0.1636470905250724, 0.08253975885270311, 0.04097298700563449, -0.07207522371414506, 0.07704808463747848, -0.013514359739588961, 0.1656234439985036, 0.04566904510331186, 0.06702652239247406, 0.3057412301464904, 0.09051240567895148, 0.01568647875055242, 0.18776975316791158, -0.10787894199003478, -0.15115135903771726, -0.26093887782273745, -0.1895211824892665, -0.2323876802789436, 0.06168274165352257, -0.015428579720189434, -0.1324080098520884, 0.39535028892133733, 0.10394450982156538, 0.21193536208178715, -0.052530607143283, 0.2457332209040739, 0.1540648637058066, 0.013898050742518667, 0.033689411145990056, 0.2483701344157348, 0.15756475394792693, 0.05028482577461991, -0.2972172400227366, -0.04002856497867234, 0.06023350997874848] |
1,802.10554 | Retrieval and Registration of Long-Range Overlapping Frames for Scalable
Mosaicking of In Vivo Fetoscopy | Purpose: The standard clinical treatment of Twin-to-Twin Transfusion Syndrome
consists in the photo-coagulation of undesired anastomoses located on the
placenta which are responsible to a blood transfer between the two twins. While
being the standard of care procedure, fetoscopy suffers from a limited
field-of-view of the placenta resulting in missed anastomoses. To facilitate
the task of the clinician, building a global map of the placenta providing a
larger overview of the vascular network is highly desired. Methods: To overcome
the challenging visual conditions inherent to in vivo sequences (low contrast,
obstructions or presence of artifacts, among others), we propose the following
contributions: (i) robust pairwise registration is achieved by aligning the
orientation of the image gradients, and (ii) difficulties regarding long-range
consistency (e.g. due to the presence of outliers) is tackled via a bag-of-word
strategy, which identifies overlapping frames of the sequence to be registered
regardless of their respective location in time. Results: In addition to visual
difficulties, in vivo sequences are characterised by the intrinsic absence of
gold standard. We present mosaics motivating qualitatively our methodological
choices and demonstrating their promising aspect. We also demonstrate
semi-quantitatively, via visual inspection of registration results, the
efficacy of our registration approach in comparison to two standard baselines.
Conclusion: This paper proposes the first approach for the construction of
mosaics of placenta in in vivo fetoscopy sequences. Robustness to visual
challenges during registration and long-range temporal consistency are
proposed, offering first positive results on in vivo data for which standard
mosaicking techniques are not applicable.
| cs.CV | purpose the standard clinical treatment of twintotwin transfusion syndrome consists in the photocoagulation of undesired anastomoses located on the placenta which are responsible to a blood transfer between the two twins while being the standard of care procedure fetoscopy suffers from a limited fieldofview of the placenta resulting in missed anastomoses to facilitate the task of the clinician building a global map of the placenta providing a larger overview of the vascular network is highly desired methods to overcome the challenging visual conditions inherent to in vivo sequences low contrast obstructions or presence of artifacts among others we propose the following contributions i robust pairwise registration is achieved by aligning the orientation of the image gradients and ii difficulties regarding longrange consistency eg due to the presence of outliers is tackled via a bagofword strategy which identifies overlapping frames of the sequence to be registered regardless of their respective location in time results in addition to visual difficulties in vivo sequences are characterised by the intrinsic absence of gold standard we present mosaics motivating qualitatively our methodological choices and demonstrating their promising aspect we also demonstrate semiquantitatively via visual inspection of registration results the efficacy of our registration approach in comparison to two standard baselines conclusion this paper proposes the first approach for the construction of mosaics of placenta in in vivo fetoscopy sequences robustness to visual challenges during registration and longrange temporal consistency are proposed offering first positive results on in vivo data for which standard mosaicking techniques are not applicable | [['purpose', 'the', 'standard', 'clinical', 'treatment', 'of', 'twintotwin', 'transfusion', 'syndrome', 'consists', 'in', 'the', 'photocoagulation', 'of', 'undesired', 'anastomoses', 'located', 'on', 'the', 'placenta', 'which', 'are', 'responsible', 'to', 'a', 'blood', 'transfer', 'between', 'the', 'two', 'twins', 'while', 'being', 'the', 'standard', 'of', 'care', 'procedure', 'fetoscopy', 'suffers', 'from', 'a', 'limited', 'fieldofview', 'of', 'the', 'placenta', 'resulting', 'in', 'missed', 'anastomoses', 'to', 'facilitate', 'the', 'task', 'of', 'the', 'clinician', 'building', 'a', 'global', 'map', 'of', 'the', 'placenta', 'providing', 'a', 'larger', 'overview', 'of', 'the', 'vascular', 'network', 'is', 'highly', 'desired', 'methods', 'to', 'overcome', 'the', 'challenging', 'visual', 'conditions', 'inherent', 'to', 'in', 'vivo', 'sequences', 'low', 'contrast', 'obstructions', 'or', 'presence', 'of', 'artifacts', 'among', 'others', 'we', 'propose', 'the', 'following', 'contributions', 'i', 'robust', 'pairwise', 'registration', 'is', 'achieved', 'by', 'aligning', 'the', 'orientation', 'of', 'the', 'image', 'gradients', 'and', 'ii', 'difficulties', 'regarding', 'longrange', 'consistency', 'eg', 'due', 'to', 'the', 'presence', 'of', 'outliers', 'is', 'tackled', 'via', 'a', 'bagofword', 'strategy', 'which', 'identifies', 'overlapping', 'frames', 'of', 'the', 'sequence', 'to', 'be', 'registered', 'regardless', 'of', 'their', 'respective', 'location', 'in', 'time', 'results', 'in', 'addition', 'to', 'visual', 'difficulties', 'in', 'vivo', 'sequences', 'are', 'characterised', 'by', 'the', 'intrinsic', 'absence', 'of', 'gold', 'standard', 'we', 'present', 'mosaics', 'motivating', 'qualitatively', 'our', 'methodological', 'choices', 'and', 'demonstrating', 'their', 'promising', 'aspect', 'we', 'also', 'demonstrate', 'semiquantitatively', 'via', 'visual', 'inspection', 'of', 'registration', 'results', 'the', 'efficacy', 'of', 'our', 'registration', 'approach', 'in', 'comparison', 'to', 'two', 'standard', 'baselines', 'conclusion', 'this', 'paper', 'proposes', 'the', 'first', 'approach', 'for', 'the', 'construction', 'of', 'mosaics', 'of', 'placenta', 'in', 'in', 'vivo', 'fetoscopy', 'sequences', 'robustness', 'to', 'visual', 'challenges', 'during', 'registration', 'and', 'longrange', 'temporal', 'consistency', 'are', 'proposed', 'offering', 'first', 'positive', 'results', 'on', 'in', 'vivo', 'data', 'for', 'which', 'standard', 'mosaicking', 'techniques', 'are', 'not', 'applicable']] | [-0.07445688740863848, 0.015435373410582542, -0.041819006582016066, 0.052084332840627946, -0.054052398198344294, -0.12204206002793545, 0.03549954844751365, 0.41252978136312335, -0.2345546039287001, -0.3360624651991642, 0.0950990492889222, -0.2521075606195917, -0.188504926992708, 0.18986940628477192, -0.17100380773603496, 0.05275037752383674, 0.11627436706616971, -0.02018779315497546, -0.04501521985137867, -0.23745157485011018, 0.27358118388961417, 0.04160228781327004, 0.3204487201892921, 0.03518334099029626, 0.09479301666039147, 0.004995786767927535, -0.08600758569669016, 0.0037480856178350925, -0.06057429062005418, 0.1794957111311716, 0.28858272447307115, 0.15155503354335745, 0.30118812287729535, -0.4247816956053758, -0.19869433547594986, 0.09434959027332239, 0.14690034237197147, 0.10678525253118301, -0.053078222994020416, -0.32862044534187823, 0.10757581202732024, -0.09064253874197264, -0.07917245665979158, -0.08098135075922455, -0.03510752003996693, 0.008336681469612108, -0.2845099807783563, 0.11205374401153324, 0.06895873900089834, 0.09353678139872969, -0.07353715817049716, -0.0868044170511571, 0.005214153807760487, 0.20534710928111435, 0.07969699715237855, 0.03567431260213902, 0.1319144290924493, -0.17058412432614264, -0.11391503126041273, 0.38223538755799735, -0.01024018140085372, -0.1918937449621397, 0.21302599003238062, -0.09268064138145306, -0.13064060220119333, 0.1397815296283713, 0.1410461590170481, 0.09992764136416465, -0.1813232755821739, -0.004613694619042837, 0.042426797232286435, 0.150924739141051, 0.06914861911401761, 0.01242377744582031, 0.20217343944598049, 0.20228435095838992, 0.012071439904356074, 0.14748924960194046, -0.1426342289312508, -0.06102604042685163, -0.2545063916852908, -0.12119717922753133, -0.1504634323890411, -0.032560442967634676, -0.07776951721866827, -0.14668632230736436, 0.3970576005963413, 0.20505383981564532, 0.20268903554261347, 0.04652748463019135, 0.3376317942034333, 0.002924968350975354, 0.08816050304965521, -0.02319958031711717, 0.2150879850664604, 0.05041589338572756, 0.09767347897192644, -0.21626018436349584, 0.10144604350892722, 0.036421759863339] |
1,802.10555 | Continuity of Functional Transducers: A Profinite Study of Rational
Functions | A word-to-word function is continuous for a class of languages~$\mathcal{V}$
if its inverse maps $\mathcal{V}$_languages to~$\mathcal{V}$. This notion
provides a basis for an algebraic study of transducers, and was integral to the
characterization of the sequential transducers computable in some circuit
complexity classes.
Here, we report on the decidability of continuity for functional transducers
and some standard classes of regular languages. To this end, we develop a
robust theory rooted in the standard profinite analysis of regular languages.
Since previous algebraic studies of transducers have focused on the sole
structure of the underlying input automaton, we also compare the two algebraic
approaches. We focus on two questions: When are the automaton structure and the
continuity properties related, and when does continuity propagate to
superclasses?
| cs.FL cs.LO | a wordtoword function is continuous for a class of languagesmathcalv if its inverse maps mathcalv_languages tomathcalv this notion provides a basis for an algebraic study of transducers and was integral to the characterization of the sequential transducers computable in some circuit complexity classes here we report on the decidability of continuity for functional transducers and some standard classes of regular languages to this end we develop a robust theory rooted in the standard profinite analysis of regular languages since previous algebraic studies of transducers have focused on the sole structure of the underlying input automaton we also compare the two algebraic approaches we focus on two questions when are the automaton structure and the continuity properties related and when does continuity propagate to superclasses | [['a', 'wordtoword', 'function', 'is', 'continuous', 'for', 'a', 'class', 'of', 'languagesmathcalv', 'if', 'its', 'inverse', 'maps', 'mathcalv_languages', 'tomathcalv', 'this', 'notion', 'provides', 'a', 'basis', 'for', 'an', 'algebraic', 'study', 'of', 'transducers', 'and', 'was', 'integral', 'to', 'the', 'characterization', 'of', 'the', 'sequential', 'transducers', 'computable', 'in', 'some', 'circuit', 'complexity', 'classes', 'here', 'we', 'report', 'on', 'the', 'decidability', 'of', 'continuity', 'for', 'functional', 'transducers', 'and', 'some', 'standard', 'classes', 'of', 'regular', 'languages', 'to', 'this', 'end', 'we', 'develop', 'a', 'robust', 'theory', 'rooted', 'in', 'the', 'standard', 'profinite', 'analysis', 'of', 'regular', 'languages', 'since', 'previous', 'algebraic', 'studies', 'of', 'transducers', 'have', 'focused', 'on', 'the', 'sole', 'structure', 'of', 'the', 'underlying', 'input', 'automaton', 'we', 'also', 'compare', 'the', 'two', 'algebraic', 'approaches', 'we', 'focus', 'on', 'two', 'questions', 'when', 'are', 'the', 'automaton', 'structure', 'and', 'the', 'continuity', 'properties', 'related', 'and', 'when', 'does', 'continuity', 'propagate', 'to', 'superclasses']] | [-0.12037194159299458, 0.0872490137002733, -0.08451143965848591, 0.10648034530988132, -0.13349382480806557, -0.093205500097776, 0.0717394975512404, 0.3795033647132314, -0.34028156877549226, -0.22115327895826792, 0.1138006223650449, -0.2568265816027468, -0.13981540898276754, 0.24054448415856222, -0.09501469887269676, 0.07511982145432522, 0.03292935810721487, 0.08592553893181164, -0.09512055261360775, -0.21943526438818398, 0.35802588312047695, -0.01934866973945548, 0.28341728130794197, 0.018571946096475705, 0.10663886116971531, -0.011058541039805397, -0.04944577606102406, 0.05191663463315195, -0.15033608979029842, 0.15942751527725418, 0.2638116139083454, 0.17275393909335998, 0.2678573200025034, -0.42528721747134834, -0.18683382649790525, 0.11349673927107379, 0.06681583044003726, 0.09125702382519471, -0.01823359572286294, -0.2573007767565918, 0.10947191172706594, -0.11724761008354258, -0.04964785875121424, -0.05341811251079987, 0.05004014161777152, 0.048836132459542596, -0.2167430380176491, -0.023013638061411632, 0.1287928736376122, 0.11323896644652383, -0.0714167974964323, -0.08466737772903814, 0.031174177194229703, 0.1156802917392886, -0.02392826894536799, -0.0034496029608013217, 0.08295286068123234, -0.11464068341292133, -0.17726933424676622, 0.3465242339836911, -0.04254850157929107, -0.22598917629908433, 0.23672606460442228, -0.11369065135286367, -0.2159525076627793, 0.07177761556919325, 0.1505389293801994, 0.12440860628589126, -0.14004737780499657, 0.16673423913076582, -0.10229899709628633, 0.19858255105724265, 0.07896268814571264, 0.06133850243650685, 0.12634979598685975, 0.188440072026935, 0.057893665555541304, 0.19757579838903236, 0.031531135118681906, -0.03682799220916407, -0.2998631691390818, -0.17386891194503784, -0.1028774239484621, 0.02652981265328732, -0.030390482075985766, -0.25823856125131617, 0.4258082685424477, 0.13666723977220208, 0.12217955119630769, 0.15562188312072645, 0.280900807050634, 0.10948544128005169, 0.03366738197216687, 0.04865450041622601, 0.16492632923942166, 0.16883731777548852, 0.03956123938868669, -0.1732936241704401, 0.08058229106678512, 0.14527299656909853] |
1,802.10556 | The hierarchy of Poisson brackets for the open Toda lattice and its'
spectral curves | We establish a new representation of the infinite hierarchy of Pois- son
brackets (PB) for the open Toda lattice in terms of its spectral curve. For the
classical Poisson bracket (PB) we give a representation in the form of a
contour integral of some special Abelian differential (meromorphic one-form) on
the spectral curve. All higher brackets of the infinite hierarchy are obtained
by multiplication of the one-form by a power of the spectral parameter.
| math-ph math.MP | we establish a new representation of the infinite hierarchy of pois son brackets pb for the open toda lattice in terms of its spectral curve for the classical poisson bracket pb we give a representation in the form of a contour integral of some special abelian differential meromorphic oneform on the spectral curve all higher brackets of the infinite hierarchy are obtained by multiplication of the oneform by a power of the spectral parameter | [['we', 'establish', 'a', 'new', 'representation', 'of', 'the', 'infinite', 'hierarchy', 'of', 'pois', 'son', 'brackets', 'pb', 'for', 'the', 'open', 'toda', 'lattice', 'in', 'terms', 'of', 'its', 'spectral', 'curve', 'for', 'the', 'classical', 'poisson', 'bracket', 'pb', 'we', 'give', 'a', 'representation', 'in', 'the', 'form', 'of', 'a', 'contour', 'integral', 'of', 'some', 'special', 'abelian', 'differential', 'meromorphic', 'oneform', 'on', 'the', 'spectral', 'curve', 'all', 'higher', 'brackets', 'of', 'the', 'infinite', 'hierarchy', 'are', 'obtained', 'by', 'multiplication', 'of', 'the', 'oneform', 'by', 'a', 'power', 'of', 'the', 'spectral', 'parameter']] | [-0.2126566940868223, 0.07377457724431076, -0.09131353518397019, 0.0916933784437542, -0.13141562147191851, -0.11265065543026336, 0.051024340650041564, 0.2889403640418439, -0.2990528290738931, -0.2569954290583327, 0.07207263450333345, -0.2214426150593853, -0.14549722001459953, 0.18722745066357627, -0.07151642049083838, 0.029158225219312904, 0.04457850329817046, 0.13197694868289842, -0.16302993084064912, -0.2601601896505501, 0.38906336910519246, -0.004118572813584595, 0.21514837611529575, -0.004653766071675597, 0.1506708218917452, 0.0280931792096109, -0.03461291520176707, -0.07760967235584315, -0.12216848807057014, 0.18521571670960937, 0.2425241208559758, 0.059662873101596896, 0.13853965719809402, -0.37461947679922386, -0.1753804442107778, 0.11080741098251294, 0.15823504304815386, -0.004114533925580012, -0.02287053453540933, -0.27440189746384686, 0.055357841913261124, -0.1723986376718794, -0.17096826549921487, -0.032442698311815794, 0.010080660580078492, 0.08791644095971778, -0.2165248721485605, 0.06105459580902715, 0.0772424212254181, 0.12547357911495743, -0.09425118885386886, -0.13327729191026977, -0.08017110677964583, 0.03179741623761082, -0.032982591124301824, 0.01389404431589552, 0.0413482943801461, -0.14107846800313406, -0.10635540256830486, 0.3752682888345491, -0.0800174552494207, -0.25621734166870247, 0.04657884948962444, -0.15502578473171671, -0.18895952141138952, 0.15264167811098583, 0.08244083226482207, 0.09302847243442729, -0.1327499458314599, 0.20861355874788118, -0.09300511512225745, 0.05091333513091494, 0.09819560494852832, 0.008543059393461491, 0.17782084743895038, 0.09787827192780536, 0.07228667979959298, 0.11871844246933186, -0.02713043029684372, -0.12000168720889534, -0.3672421737574041, -0.21846598965694775, -0.1131270547740388, 0.10352414750770943, -0.20217735117704078, -0.1966016289551516, 0.4462536719495531, 0.0572276181451712, 0.22373631911830524, 0.09600607250389215, 0.18297211584207174, 0.2284386168938835, 0.07077486337968023, 0.0043915002166318735, 0.12368723403582212, 0.22548922202298166, 0.0837869455949781, -0.19344049412757158, -0.09168565508003372, 0.20186864532454796] |
1,802.10557 | General-type discrete self-adjoint Dirac systems: explicit solutions of
direct and inverse problems, asymptotics of Verblunsky-type coefficients and
stability of solving inverse problem | We consider discrete self-adjoint Dirac systems determined by the potentials
(sequences) $\{C_k\}$ such that the matrices $C_k$ are positive definite and
$j$-unitary, where $j$ is a diagonal $m\times m$ matrix and has $m_1$ entries
$1$ and $m_2$ entries $-1$ ($m_1+m_2=m$) on the main diagonal. We construct
systems with rational Weyl functions and explicitly solve inverse problem to
recover systems from the contractive rational Weyl functions. Moreover, we
study the stability of this procedure. The matrices $C_k$ (in the potentials)
are so called Halmos extensions of the Verblunsky-type coefficients $\rho_k$.
We show that in the case of the contractive rational Weyl functions the
coefficients $\rho_k$ tend to zero and the matrices $C_k$ tend to the indentity
matrix $I_m$.
| math.SP math.CA math.OC | we consider discrete selfadjoint dirac systems determined by the potentials sequences c_k such that the matrices c_k are positive definite and junitary where j is a diagonal mtimes m matrix and has m_1 entries 1 and m_2 entries 1 m_1m_2m on the main diagonal we construct systems with rational weyl functions and explicitly solve inverse problem to recover systems from the contractive rational weyl functions moreover we study the stability of this procedure the matrices c_k in the potentials are so called halmos extensions of the verblunskytype coefficients rho_k we show that in the case of the contractive rational weyl functions the coefficients rho_k tend to zero and the matrices c_k tend to the indentity matrix i_m | [['we', 'consider', 'discrete', 'selfadjoint', 'dirac', 'systems', 'determined', 'by', 'the', 'potentials', 'sequences', 'c_k', 'such', 'that', 'the', 'matrices', 'c_k', 'are', 'positive', 'definite', 'and', 'junitary', 'where', 'j', 'is', 'a', 'diagonal', 'mtimes', 'm', 'matrix', 'and', 'has', 'm_1', 'entries', '1', 'and', 'm_2', 'entries', '1', 'm_1m_2m', 'on', 'the', 'main', 'diagonal', 'we', 'construct', 'systems', 'with', 'rational', 'weyl', 'functions', 'and', 'explicitly', 'solve', 'inverse', 'problem', 'to', 'recover', 'systems', 'from', 'the', 'contractive', 'rational', 'weyl', 'functions', 'moreover', 'we', 'study', 'the', 'stability', 'of', 'this', 'procedure', 'the', 'matrices', 'c_k', 'in', 'the', 'potentials', 'are', 'so', 'called', 'halmos', 'extensions', 'of', 'the', 'verblunskytype', 'coefficients', 'rho_k', 'we', 'show', 'that', 'in', 'the', 'case', 'of', 'the', 'contractive', 'rational', 'weyl', 'functions', 'the', 'coefficients', 'rho_k', 'tend', 'to', 'zero', 'and', 'the', 'matrices', 'c_k', 'tend', 'to', 'the', 'indentity', 'matrix', 'i_m']] | [-0.18231520910169288, 0.1229701395837012, 0.009018919527016837, 0.04546505924121573, -0.04672657989832605, -0.19323271521816737, 0.009234219420187432, 0.35434055504999284, -0.3246450863039956, -0.14133287607772468, 0.10692893683404565, -0.34398875326110884, -0.2141950128696345, 0.10323257663825142, -0.05811914965783342, 0.07708953273611079, 0.012179146954340154, 0.07770710833900576, -0.16839267554741097, -0.2618752228726376, 0.3938849387842969, -0.05060839551252088, 0.15225409272308502, 0.008900986195557976, 0.12003869927440096, -0.006957466255447924, 0.009695478698945251, -0.05621541522700211, -0.14201306272561537, 0.06147257772731948, 0.2683803139190222, 0.09167001657749943, 0.22952018668553953, -0.35385671959676107, -0.09710439900739183, 0.22777181914766673, 0.15310959148638206, -0.02642371511118936, 0.01213877241364038, -0.25339804335842553, 0.13456827308179747, -0.13806929583018968, -0.12996529407221183, -0.08475130906826335, 0.04513752972004646, 0.02936008430270735, -0.33926317948398405, 0.06628347580834966, 0.09530390566214919, 0.02668828420453416, -0.05047553339029726, -0.2437887635114121, -0.01338338535198749, 0.09689970647289964, 0.020367279505268832, -0.015583089339057112, 0.06785273980670448, -0.0025759019531662866, -0.07500755434087077, 0.35564270032698225, -0.04522693184493431, -0.29482679076744683, 0.10144349814850259, -0.17629956220806545, -0.11836959541763244, 0.07418288458299277, 0.09488842808962639, 0.150338611437072, -0.06734418323070838, 0.2172734265447522, -0.12215661617991483, 0.1000440372495334, 0.07385545618960569, -0.020533637320301657, 0.13830504982314748, -0.04729031383637981, 0.10414424851729438, 0.08442372285182877, 0.06075502058254266, -0.0438871970460429, -0.2958611183446543, -0.14590930247855982, -0.24757883501849298, 0.12152017910105722, -0.11408850897024767, -0.18877437182477322, 0.38807141495033587, 0.0981014354459556, 0.24708587712214874, 0.14019536598111856, 0.19508716559583514, 0.14737850948686487, 0.05831690114101893, 0.05973722024194511, 0.10818276677987185, 0.22821986917125317, 0.06415059337601194, -0.18413482515888033, -0.022670580355193596, 0.17693854036644616] |
1,802.10558 | Exactly Robust Kernel Principal Component Analysis | Robust principal component analysis (RPCA) can recover low-rank matrices when
they are corrupted by sparse noises. In practice, many matrices are, however,
of high-rank and hence cannot be recovered by RPCA. We propose a novel method
called robust kernel principal component analysis (RKPCA) to decompose a
partially corrupted matrix as a sparse matrix plus a high or full-rank matrix
with low latent dimensionality. RKPCA can be applied to many problems such as
noise removal and subspace clustering and is still the only unsupervised
nonlinear method robust to sparse noises. Our theoretical analysis shows that,
with high probability, RKPCA can provide high recovery accuracy. The
optimization of RKPCA involves nonconvex and indifferentiable problems. We
propose two nonconvex optimization algorithms for RKPCA. They are alternating
direction method of multipliers with backtracking line search and proximal
linearized minimization with adaptive step size. Comparative studies in noise
removal and robust subspace clustering corroborate the effectiveness and
superiority of RKPCA.
| cs.LG stat.ML | robust principal component analysis rpca can recover lowrank matrices when they are corrupted by sparse noises in practice many matrices are however of highrank and hence cannot be recovered by rpca we propose a novel method called robust kernel principal component analysis rkpca to decompose a partially corrupted matrix as a sparse matrix plus a high or fullrank matrix with low latent dimensionality rkpca can be applied to many problems such as noise removal and subspace clustering and is still the only unsupervised nonlinear method robust to sparse noises our theoretical analysis shows that with high probability rkpca can provide high recovery accuracy the optimization of rkpca involves nonconvex and indifferentiable problems we propose two nonconvex optimization algorithms for rkpca they are alternating direction method of multipliers with backtracking line search and proximal linearized minimization with adaptive step size comparative studies in noise removal and robust subspace clustering corroborate the effectiveness and superiority of rkpca | [['robust', 'principal', 'component', 'analysis', 'rpca', 'can', 'recover', 'lowrank', 'matrices', 'when', 'they', 'are', 'corrupted', 'by', 'sparse', 'noises', 'in', 'practice', 'many', 'matrices', 'are', 'however', 'of', 'highrank', 'and', 'hence', 'can', 'not', 'be', 'recovered', 'by', 'rpca', 'we', 'propose', 'a', 'novel', 'method', 'called', 'robust', 'kernel', 'principal', 'component', 'analysis', 'rkpca', 'to', 'decompose', 'a', 'partially', 'corrupted', 'matrix', 'as', 'a', 'sparse', 'matrix', 'plus', 'a', 'high', 'or', 'fullrank', 'matrix', 'with', 'low', 'latent', 'dimensionality', 'rkpca', 'can', 'be', 'applied', 'to', 'many', 'problems', 'such', 'as', 'noise', 'removal', 'and', 'subspace', 'clustering', 'and', 'is', 'still', 'the', 'only', 'unsupervised', 'nonlinear', 'method', 'robust', 'to', 'sparse', 'noises', 'our', 'theoretical', 'analysis', 'shows', 'that', 'with', 'high', 'probability', 'rkpca', 'can', 'provide', 'high', 'recovery', 'accuracy', 'the', 'optimization', 'of', 'rkpca', 'involves', 'nonconvex', 'and', 'indifferentiable', 'problems', 'we', 'propose', 'two', 'nonconvex', 'optimization', 'algorithms', 'for', 'rkpca', 'they', 'are', 'alternating', 'direction', 'method', 'of', 'multipliers', 'with', 'backtracking', 'line', 'search', 'and', 'proximal', 'linearized', 'minimization', 'with', 'adaptive', 'step', 'size', 'comparative', 'studies', 'in', 'noise', 'removal', 'and', 'robust', 'subspace', 'clustering', 'corroborate', 'the', 'effectiveness', 'and', 'superiority', 'of', 'rkpca']] | [-0.07780502347323374, 0.005702952033458039, -0.06784417476648322, 0.04721223721497107, -0.09750172672405218, -0.22221093026634592, -0.009627317694815783, 0.4530877546669963, -0.335424263901913, -0.26118028530468923, 0.19570602997630024, -0.24663891267771712, -0.2160920874776844, 0.13198918216258812, -0.13619952858127177, 0.11759849256859758, 0.11501546088271798, -0.039572860378263075, -0.12765081367718104, -0.25584826407094413, 0.2450938381221838, 0.05250341229092998, 0.2742529323217101, -0.028799206361723825, 0.11226637514893156, 0.042593782990782834, -0.07075334995244749, 0.05220327408124621, 0.05939767658179708, 0.12520626686305966, 0.3682532509884391, 0.18845926964870438, 0.3437849402618714, -0.3920366421270256, -0.22745465949321023, 0.15522120135406461, 0.1811469164945615, 0.10136534838984983, -0.06380234774219272, -0.295878318095138, 0.13937029062519565, -0.10820003046701925, -0.020938170875291318, -0.22071936573588458, -0.09103727672183408, -0.0028101887355427234, -0.35373061997756267, 0.1443375138683806, 0.07641398158067694, -0.003057948988265334, -0.0465850212957519, -0.2129586110763156, 0.07046423501854476, 0.04370250934768522, 0.06065752218143107, 0.008769413369755523, 0.1541629524077647, -0.06072134642790143, -0.1128890253066157, 0.3315429813109147, -0.05532081487054268, -0.2630564189868239, 0.18706525906395072, -0.02482015403877132, -0.17354292978490823, 0.18889960599466202, 0.22684394859541684, 0.10550916450133976, -0.12805038138387131, 0.05326774413753391, -0.04050395544916869, 0.17610165977683395, -0.006573799069230564, -0.014936392376115784, 0.10145705473760011, 0.14917762661561704, 0.16791614173024966, 0.12977110247000104, -0.10927184467585996, -0.020637135576600067, -0.20394518604884163, -0.07576873749852754, -0.2518211186532146, -0.0339570061731091, -0.1664554731651151, -0.18680820592607444, 0.3905738699190223, 0.14833689903249392, 0.23201612438648367, 0.0665061821801385, 0.381610961117519, 0.10707235845769994, 0.0022454471207964113, 0.10538500609198728, 0.1720233424939812, 0.18616798244571933, 0.02737032410303259, -0.19736634663870342, 0.08983450446528597, 0.0818145030643791] |
1,802.10559 | Quantum work for sudden quenches in Gaussian random Hamiltonians | In the context of nonequilibrium quantum thermodynamics, variables like work
behave stochastically. A particular definition of the work probability density
function (pdf) for coherent quantum processes allows the verification of the
quantum version of the celebrated fluctuation theorems, due to Jarzynski and
Crooks, that apply when the system is driven away from an initial equilibrium
thermal state. Such a particular pdf depends basically on the details of the
initial and final Hamiltonians, on the temperature of the initial thermal state
and on how some external parameter is changed during the coherent process.
Using random matrix theory we derive a simple analytic expression that
describes the general behavior of the work characteristic function $G(u)$,
associated with this particular work pdf for sudden quenches, valid for all the
traditional Gaussian ensembles of Hamiltonians matrices. This formula well
describes the general behavior of $G(u)$ calculated from single draws of the
initial and final Hamiltonians in all ranges of temperatures.
| quant-ph cond-mat.stat-mech | in the context of nonequilibrium quantum thermodynamics variables like work behave stochastically a particular definition of the work probability density function pdf for coherent quantum processes allows the verification of the quantum version of the celebrated fluctuation theorems due to jarzynski and crooks that apply when the system is driven away from an initial equilibrium thermal state such a particular pdf depends basically on the details of the initial and final hamiltonians on the temperature of the initial thermal state and on how some external parameter is changed during the coherent process using random matrix theory we derive a simple analytic expression that describes the general behavior of the work characteristic function gu associated with this particular work pdf for sudden quenches valid for all the traditional gaussian ensembles of hamiltonians matrices this formula well describes the general behavior of gu calculated from single draws of the initial and final hamiltonians in all ranges of temperatures | [['in', 'the', 'context', 'of', 'nonequilibrium', 'quantum', 'thermodynamics', 'variables', 'like', 'work', 'behave', 'stochastically', 'a', 'particular', 'definition', 'of', 'the', 'work', 'probability', 'density', 'function', 'pdf', 'for', 'coherent', 'quantum', 'processes', 'allows', 'the', 'verification', 'of', 'the', 'quantum', 'version', 'of', 'the', 'celebrated', 'fluctuation', 'theorems', 'due', 'to', 'jarzynski', 'and', 'crooks', 'that', 'apply', 'when', 'the', 'system', 'is', 'driven', 'away', 'from', 'an', 'initial', 'equilibrium', 'thermal', 'state', 'such', 'a', 'particular', 'pdf', 'depends', 'basically', 'on', 'the', 'details', 'of', 'the', 'initial', 'and', 'final', 'hamiltonians', 'on', 'the', 'temperature', 'of', 'the', 'initial', 'thermal', 'state', 'and', 'on', 'how', 'some', 'external', 'parameter', 'is', 'changed', 'during', 'the', 'coherent', 'process', 'using', 'random', 'matrix', 'theory', 'we', 'derive', 'a', 'simple', 'analytic', 'expression', 'that', 'describes', 'the', 'general', 'behavior', 'of', 'the', 'work', 'characteristic', 'function', 'gu', 'associated', 'with', 'this', 'particular', 'work', 'pdf', 'for', 'sudden', 'quenches', 'valid', 'for', 'all', 'the', 'traditional', 'gaussian', 'ensembles', 'of', 'hamiltonians', 'matrices', 'this', 'formula', 'well', 'describes', 'the', 'general', 'behavior', 'of', 'gu', 'calculated', 'from', 'single', 'draws', 'of', 'the', 'initial', 'and', 'final', 'hamiltonians', 'in', 'all', 'ranges', 'of', 'temperatures']] | [-0.10273870371747762, 0.17107025596982192, -0.1309219886853288, 0.06024065618715049, 0.005748782951671343, -0.12320742417441813, 0.06058413905870671, 0.28496646536036563, -0.2636897533770818, -0.24454886270448184, 0.053812468521452196, -0.2455719463746041, -0.1272659562788855, 0.21339160430943593, -0.0428382605403805, 0.09011591399291483, 0.049962788492662065, 0.03718782649099385, -0.09468859548752125, -0.19443624163977802, 0.3751667285582815, 0.04245440569446565, 0.2928483155197822, 0.034455012585497644, 0.08593842444810061, 0.08443717223454793, 0.008632046522763677, -0.014101007636875296, -0.16064369597948733, 0.04966998235053884, 0.18787214206382394, 0.1092755142151593, 0.227379052571427, -0.4133640396146056, -0.1981792862359912, 0.09508024935255377, 0.09515656799936924, 0.16946142630126232, 0.004994168412686588, -0.2603350799972526, 0.01728476450826304, -0.190597351330022, -0.1740113804504896, -0.06842192943739252, 0.03151079749043744, 0.04746877034143346, -0.2566272327377915, 0.13287944928444445, 0.10587516394876637, 0.023370168547934063, -0.07403359532345814, -0.11318062793072432, -0.013402633261508666, 0.12605308250241273, 0.009006176021312758, 0.03045744815459236, 0.19055230539733878, -0.13887077126090822, -0.07679705905507152, 0.33124739500001454, -0.06062552776301089, -0.17232963097436974, 0.17299817132656103, -0.1411444527359727, -0.15705382084856048, 0.0641162814393353, 0.1325765149339508, 0.11979914841821226, -0.17694333103496226, 0.14386939481855968, -0.005023304810329603, 0.14450684220989785, 0.028035642453827538, 0.036737730769136064, 0.17443951322900084, 0.0915461613689191, 0.02599957248625847, 0.17351750370401603, -0.03579018189973281, -0.19658134997380564, -0.3401780903924448, -0.13662346998581854, -0.2308072220080365, 0.10950093251169445, -0.0811398024861074, -0.19620140105545056, 0.4212757379043465, 0.1668081885884301, 0.20657304289320913, 0.06595721169753979, 0.2712618277217142, 0.1857039890347574, -0.04410697907531777, 0.06169556269350533, 0.18650552026949113, 0.17285493243402109, 0.12220565146969584, -0.21394496663019824, 0.0949422794734486, 0.05253011717174489] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.